1 Can this framework be expressed mathematically?

Yes -- but with important caveats about what the mathematics can and cannot do at this stage. This page is the complete equation catalog of the ECI coordination ontology: every equation, every variable, every assumption, collected in one place for reference.

Some of these equations are established mathematical tools borrowed from statistics, information theory, and physics. Others are definitions -- notational conventions that formalize ECI's conceptual vocabulary. A few are proposed relationships whose functional form remains unknown. And one is an explicit toy model, useful for building intuition but not intended as a quantitative prediction.

Every equation on this page carries six metadata items: Source, Status, Assumptions, Variables, Empirical implication / N/A for definitions, and (where applicable) the reason for its classification. This is a reference page -- organized for lookup, not for narrative. If you want the conceptual story behind these equations, follow the links to the pages where they are developed in context.

2 Why math matters

Mathematics serves three functions in a theoretical framework:

Precision. Natural language is ambiguous. "Information shapes the carrier" could mean many things. Writing the compatibility function Q(I, C, C) forces you to specify: Q takes three arguments, it returns a scalar (or at least a value on an ordered set), and it depends on the relationship between the information pattern, the carrier, and the channel. You cannot hide ambiguity inside an equation the way you can inside a sentence.

Deduction. Once relationships are formalized, you can derive consequences that were not obvious from the verbal description. The variance formula with the correlation extension (Equation 10) tells you something that the verbal claim "coordination affects macro-stability" does not: specifically, that positive correlations among micro-components can increase macro-level fluctuations, not just decrease them. That consequence was not intuitive from the words alone.

Testability. An equation makes predictions that can be compared to data. "Persistent things are compatible with their environment" is not testable as stated. But "p_{t+Delta_t}(Omega) is proportional to p_t(Omega) times S(Omega, Delta_t), where S is independently measurable" gives you something to measure, fit, and potentially reject.

However, mathematics can also give false confidence. A precise equation with unknown functional form -- like S = f(Q, stability, E, robustness, ...) -- is not more informative than the verbal version. It just looks more informative. This page is honest about which equations are quantitatively usable now and which are formal templates awaiting specification.

3 Established mathematical tools used by ECI

ECI does not build its mathematics from scratch. It draws on several well-established mathematical frameworks, adapting their tools to the coordination ontology context.

| Mathematical tool | Field of origin | How ECI uses it | Key reference | |---|---|---|---| | Shannon entropy H(X) = -Sigma p(x) log p(x) | Information theory | Measures information content of carriers; quantifies what is lost in observer compression | Shannon (1948) | | Data Processing Inequality (DPI): I(X;Z) <= I(X;Y) for Markov chain X -> Y -> Z | Information theory | Formalizes observer compression -- an observer's output cannot contain more information about the source than the observer received | Cover & Thomas (2006) | | Variance of the mean with correlation extension | Probability / statistics | Connects micro-level coordination to macro-level stability; the correlation term drives emergence theory | Standard probability theory | | Replicator dynamics: dx_i/dt = x_i[f_i(x) - phi(x)] | Evolutionary game theory | Structural analogy for persistence filtering (special case: replicating populations only) | Taylor & Jonker (1978); Hofbauer & Sigmund (1998) | | Bayesian updating: posterior proportional to prior times likelihood | Probability theory | Template for the persistence filter equation | Bayes (1763); standard | | Renormalization group / coarse-graining | Statistical physics | Template for the scale recursion G function | Kadanoff (1966); Wilson (1971) | | Born rule: P(outcome) = |<psi|phi>|^2 | Quantum mechanics | Foundation for the observer null hypothesis (H_0) | Born (1926); standard QM |

These are not ECI contributions. They are the mathematical infrastructure on which ECI builds. Every equation below that uses these tools inherits their assumptions and limitations.

4 Full equation catalog

This section contains all thirteen equations of the ECI framework. Each equation is presented with its full metadata: Source, Status, Assumptions, Variables (with units where applicable), and Falsifiable consequence.

The five status categories are:

| Status | Meaning | |---|---| | Definition | A notational convention within the ECI framework; not empirically testable on its own | | Established | An accepted mathematical theorem, definition, or empirically well-supported relationship within a clearly stated domain of validity; not an ECI contribution | | Adapted | Rewritten from established mathematics with structure preserved; ECI applies it to a new domain | | Proposed | A novel relationship posited by ECI; functional form may be unknown | | Toy model | Illustrative under simplified assumptions; not intended as a quantitative prediction |

Equation 1 -- The ECI operational system

Omega_ECI = (I, C, E ; C)

The core operational unit of the ECI framework: any functioning system requires Information (I), a Carrier (C), and Energy (E), operating within the constraints of a Channel (C).

| Metadata | Content | |---|---| | Source | ECI original -- defines the framework's minimal unit | | Status | Definition | | Assumptions | (1) "Functioning system" means a system that processes, maintains, or transforms information. (2) These three elements are jointly necessary and individually insufficient. (3) The Channel C constrains but does not eliminate the system's operation. | | Variables | I = information pattern (dimensionless, or in bits when quantified via Shannon entropy); C = carrier (physical substrate; type depends on system); E = energy (joules, or energy flow rate in watts); C = channel (the medium/substrate through which the carrier operates; characterized by dimensional, temporal, and coupling constraints) | | Falsifiable consequence | If a functioning system is found where one of the three elements (I, C, E) is genuinely absent -- not merely difficult to identify, but provably absent -- the ECI decomposition fails for that system. If the decomposition adds no predictive or explanatory power beyond existing descriptions across multiple system types, the framework is not useful. |

Developed in: ECI Unit

Equation 2 -- Containment relation

C in C_alpha

A carrier always operates within (is contained by) a specific channel. The channel's properties -- its dimensional architecture, temporal bandwidth, coupling characteristics -- constrain what the carrier can do.

| Metadata | Content | |---|---| | Source | ECI original -- formalizes the carrier-channel relationship | | Status | Definition | | Assumptions | (1) Every carrier has at least one identifiable channel. (2) The channel's constraints are real and measurable, not merely categorical labels. (3) A carrier may operate across multiple channels, but each operation is constrained by the channel it currently occupies. | | Variables | C = carrier (the physical substrate carrying information); C_alpha = a specific channel (the medium/environment constraining the carrier); the subscript alpha indexes which channel | | Falsifiable consequence | If carriers routinely operate in ways that violate the known constraints of their channel -- for example, if electromagnetic signals transmitted through a medium consistently exceed the bandwidth limits of that medium -- the containment relation is wrong. If channel properties have no measurable effect on carrier behavior, the concept adds nothing. |

Developed in: Carrier (B2), Channels (B4)

Equation 3 -- Compatibility function

Q(I, C, C)

A function that quantifies how well an information pattern (I) fits a given carrier (C) operating within a given channel (C). Higher Q means the carrier can represent and process the information pattern more faithfully within that channel's constraints.

| Metadata | Content | |---|---| | Source | ECI original -- central to coupling, persistence, and access theories | | Status | Definition (of the concept); Proposed (for any specific operationalization) | | Assumptions | (1) Compatibility is a real, measurable property of the I-C-C relationship, not a post-hoc label. (2) Q can, in principle, be estimated independently of whether the system actually persists or succeeds. (3) Q is not binary (compatible/incompatible) but graded. | | Variables | I = information pattern; C = carrier; C = channel; Q = compatibility (scalar or ordered value, dimensionless). Specific operationalizations may introduce units depending on the measurement method (e.g., mutual information in bits, signal-to-noise ratio in dB). | | Falsifiable consequence | If Q, measured independently, does not predict system performance (signal fidelity, persistence duration, coupling strength) better than chance across multiple system types, the concept of compatibility adds no value. The tautology avoidance criterion is paramount: Q must be defined and measured without reference to the outcome it is supposed to predict. |

Developed in: Coupling & Resonance (B5), Persistence Filtering (C2)

Equation 4 -- Coupling strength

Gamma(X, Y)

A function that quantifies the strength of information coupling between two systems X and Y -- how much the state of one system influences or constrains the state of the other.

| Metadata | Content | |---|---| | Source | ECI original -- formalizes the interaction concept used across the framework | | Status | Definition (of the concept); specific operationalizations may be established (e.g., mutual information, transfer entropy, Granger causality) | | Assumptions | (1) Coupling strength is a measurable property of the X-Y relationship. (2) Gamma is symmetric in the general case but may be decomposed into directional components (X influencing Y vs. Y influencing X). (3) Gamma = 0 means statistical independence; Gamma > 0 means some degree of mutual constraint. | | Variables | X, Y = two systems (may be ECI units, subsystems, or components at any scale); Gamma = coupling strength (dimensionless if defined via normalized mutual information; in bits if via raw mutual information; in domain-specific units if via physical coupling measures such as spring constants in N/m) | | Falsifiable consequence | If coupling strength as measured by Gamma does not predict the degree of coordinated behavior between X and Y -- if highly coupled systems (high Gamma) behave no more coordinately than weakly coupled systems (low Gamma) -- the measure is not capturing what it claims to capture. |

Developed in: Coupling & Resonance (B5)

Equation 5 -- Resource budget

B_total = B_ordinary + B_extra + B_maintenance

The total resource budget available to a system, decomposed into three functional categories. The key insight: the "currency" B can be energy, neural tissue, developmental investment, processing time, or any other limited resource. The carrier capacity K_i available for a given function i is then derived from the allocated budget: K_i = g(B_i, architecture).

| Metadata | Content | |---|---| | Source | ECI original -- resource allocation framework | | Status | Proposed | | Assumptions | (1) Total resources are finite and conserved (or at least bounded) within a given time window. (2) A meaningful three-way decomposition exists: ordinary operation, extra/exploratory capacity, and maintenance/repair. (3) The mapping from budget B_i to capacity K_i depends on the system's architecture -- the same budget yields different capacity in different architectures. (4) Budget categories may overlap or shift over time; the decomposition represents a snapshot. | | Variables | B_total = total resource budget (units depend on the resource: joules for energy, mm^3 for neural tissue, hours for processing time, etc.); B_ordinary = resources allocated to routine operation; B_extra = resources allocated to exploratory, novel, or non-routine functions; B_maintenance = resources allocated to maintenance, repair, error correction; K_i = carrier capacity derived from budget allocation i (bits, states, or domain-specific capacity units); g = architecture-dependent mapping function (form unspecified) | | Falsifiable consequence | If the three-way decomposition does not carve resource usage at meaningful joints -- if systems cannot be usefully characterized in terms of ordinary/extra/maintenance allocations, or if the decomposition does not predict performance trade-offs (e.g., increased B_extra at the cost of B_maintenance leading to higher exploration but lower robustness) -- the framework adds nothing beyond "resources are finite." |

Developed in: Cross-Channel Access (E1), Carrier (B2)

Equation 6 -- Independent opportunity matching (toy model)

P(match >= 1) = 1 - (1 - q)^N

The probability of at least one successful match given N independent opportunities each with success probability q. This is a standard result from probability theory, applied here as a simplified illustration of how access probability scales with opportunity count.

| Metadata | Content | |---|---| | Source | Standard probability theory (complement of the probability that all N independent trials fail) | | Status | Toy model | | Assumptions | (1) Each opportunity is independent of every other -- this is the critical simplification and is almost certainly false in real systems. (2) Each opportunity has the same success probability q -- also unrealistic in practice. (3) N opportunities are available simultaneously or sequentially within the relevant time window. These assumptions are explicitly acknowledged as unrealistic. Real systems have correlated opportunities, variable q, and structured (not random) search. | | Variables | P(match >= 1) = probability of at least one successful match (dimensionless, range [0, 1]); q = per-opportunity success probability (dimensionless, range [0, 1]); N = number of independent opportunities (dimensionless integer) | | Falsifiable consequence | As a toy model, this equation is not intended to make quantitative predictions about real systems. Its falsifiable content is limited to the qualitative claim that increasing N (opportunity count) increases the probability of at least one match, all else being equal. If increasing the number of independent opportunities does not increase match probability -- if there are strong diminishing returns even for truly independent opportunities -- basic probability theory would be wrong (which it is not). The real falsifiable question is whether real systems are well-approximated by independent opportunities at all (they almost certainly are not). |

Developed in: Cross-Channel Access (E1)

Equation 7 -- Functional access

A_access approx [1 - (1 - q)^N] x R(kappa, K, Gamma, stability)

The actual access a system achieves is the product of the opportunity-matching probability (Equation 6) and a modulating factor R that depends on coordination (kappa), carrier capacity (K), coupling strength (Gamma), and system stability. The functional form of R is currently unknown.

| Metadata | Content | |---|---| | Source | ECI original -- attempts to connect the toy model (Equation 6) to real system performance | | Status | Proposed | | Assumptions | (1) Access can be meaningfully decomposed into an "opportunity" component and a "system readiness" component. (2) The two components are approximately multiplicative (rather than, say, additive or involving a minimum). (3) R captures the system-level factors that modulate whether a matched opportunity is actually exploited. (4) The functional form of R is unknown -- this equation is a structural hypothesis, not a quantitative model. | | Variables | A_access = realized access (dimensionless or in domain-specific units such as bits/second, signal detection probability, etc.); q, N = as in Equation 6; kappa = coordination parameter (dimensionless; from C1); K = carrier capacity (bits or domain-specific); Gamma = coupling strength (as in Equation 4); stability = system stability measure (domain-specific); R = modulating function (unknown form) | | Falsifiable consequence | If realized access does not depend on system-level factors (kappa, K, Gamma, stability) -- if the opportunity-matching probability alone is sufficient to predict access across diverse systems -- then R is unnecessary and the decomposition adds nothing. If no operationalization of R can be found that improves prediction over the baseline P(match >= 1), the proposed structure fails. |

Developed in: Cross-Channel Access (E1)

Equation 8 -- Persistence filter equation

p_{t+Delta_t}(Omega) = p_t(Omega) . S(Omega, Delta_t) / Z

The distribution of configurations at time t + Delta_t equals the prior distribution weighted by the survival function S and renormalized. This is mathematically identical to a Bayesian update where "survival" is the likelihood.

| Metadata | Content | |---|---| | Source | Adapted from general Bayesian updating / selection dynamics. The mathematical structure (prior times likelihood, renormalized) is standard. Its application to arbitrary configuration spaces as a general filtering principle is an ECI contribution. | | Status | Adapted | | Assumptions | (1) Configurations can be meaningfully represented as points in a configuration space Omega. (2) The survival function S(Omega, Delta_t) is well-defined and in principle estimable. (3) The configuration space does not change over the interval Delta_t, or changes slowly relative to the filtering dynamics. (4) New configurations are not generated during the interval -- this equation captures filtering only, not variation. A complete model alternates variation steps with filtering steps. | | Variables | p_t(Omega) = probability density over configurations at time t (dimensionless density, integrates to 1); S(Omega, Delta_t) = survival probability of configuration Omega over interval Delta_t (dimensionless, range [0, 1]); Z = normalization constant = integral of p_t(Omega') . S(Omega', Delta_t) dOmega' (ensures p_{t+Delta_t} integrates to 1); Delta_t = time interval (seconds, years, or any consistent time unit) | | Falsifiable consequence | The equation itself is nearly tautological ("things that survive are more common in the surviving population"). The falsifiable content enters through the proposed decomposition of S (Equation 9). If S cannot be independently predicted from measurable configuration properties -- if survival is effectively random -- then the persistence filtering framework adds no explanatory value beyond "things that last longer are observed more often." |

Developed in: Persistence Filtering (C2)

Equation 9 -- Survival function decomposition

S = f(Q, stability, E, robustness, ...)

What determines whether a configuration survives? ECI hypothesizes that the survival function S decomposes into contributions from compatibility (Q), structural stability, energy access (E), robustness, and potentially other factors. The functional form of f is unspecified.

| Metadata | Content | |---|---| | Source | ECI original -- proposes the structure of the survival function | | Status | Proposed | | Assumptions | (1) Survival is not random -- there exist measurable properties of a configuration that predict its persistence probability. (2) These properties can be grouped into the categories listed (compatibility, stability, energy, robustness). (3) The listed factors are the primary determinants of survival (other factors may exist but are secondary). (4) Each factor can be independently measured without reference to the survival outcome. This last assumption is the tautology avoidance criterion and is non-negotiable. | | Variables | S = survival probability (dimensionless, range [0, 1]); Q = compatibility function (as in Equation 3); stability = structural stability, operationalized via Lyapunov exponents (1/s), basin depth in free-energy landscape (J), or eigenvalue analysis (domain-specific); E = energy access (watts, or J/s); robustness = perturbation tolerance, measured as the maximum perturbation magnitude the configuration can absorb without qualitative state change (domain-specific units); f = unknown function mapping these factors to survival probability | | Falsifiable consequence | If independently measured Q, stability, E, and robustness do not predict S better than chance -- and not better than simpler single-variable baselines (e.g., just thermodynamic stability, just mass) -- across multiple tested systems, then the decomposition adds unnecessary complexity. If survival in non-replicative systems is genuinely random across multiple domains and measurement approaches, persistence filtering is not a useful lens. |

Developed in: Persistence Filtering (C2)

Equation 10 -- Variance of the mean with correlation extension

Var(X-bar) = sigma^2 / N + (2 / N^2) Sigma_{i < j} Cov(X_i, X_j)

The variance of the sample mean for N possibly correlated random variables. The first term is the classical result for independent variables; the second term captures how correlations among components affect macro-level stability.

| Metadata | Content | |---|---| | Source | Standard probability theory and statistics. Not an ECI contribution. | | Status | Established | | Assumptions | (1) X_1, ..., X_N have common variance sigma^2 (the formula generalizes straightforwardly if variances differ). (2) Second moments exist (the variance and covariances are finite). (3) The macro-variable of interest is the sample mean X-bar = (1/N) Sigma X_i. For macro-variables that are nonlinear functions of the micro-states, this formula does not directly apply -- the coarse-graining function G (Equation 11) is needed. | | Variables | X-bar = sample mean of N variables (units same as X_i); sigma^2 = common variance of individual variables (units of X_i squared); N = number of components (dimensionless integer); Cov(X_i, X_j) = covariance between components i and j (units of X_i squared) | | Falsifiable consequence | The formula itself is a mathematical identity -- it cannot be empirically falsified. What can be tested is ECI's interpretive claim that the correlation term (second term) is "more relevant to coordination theory than the 1/N term." If the correlation term is consistently negligible in real coordinated systems -- if the IID approximation is always sufficient -- then the emphasis on coordination structure is misplaced and simpler models suffice. |

Developed in: Emergence & Scale (C4)

Equation 11 -- Scale recursion

X^{(L+1)} = G_L(X^{(L)})

A coarse-grained macro-variable at level L serves as an effective micro-variable at level L+1. The function G_L is the level-specific coarse-graining function that captures how entities at level L interact and combine to produce the effective entities of level L+1.

| Metadata | Content | |---|---| | Source | ECI original, inspired by renormalization group methods in statistical physics (Kadanoff 1966, Wilson 1971). The general idea of hierarchical coarse-graining is well-established; the specific claim that a recursive G_L structure applies broadly across complex systems is an ECI contribution. | | Status | Proposed | | Assumptions | (1) Identifiable levels exist -- level boundaries can be meaningfully drawn. (2) G_L captures the essential dynamics of the level L to level L+1 transition. (3) Feedback across levels, while real, is secondary to the "upward" coarse-graining captured by G_L. (4) G_L may differ at each level -- the way cells combine into tissues is not the same as the way organisms combine into populations. (5) Real hierarchies may not be strictly nested; skip-level and downward interactions complicate the recursive picture. | | Variables | X^{(L)} = state vector at level L (components and units depend on the system and level -- molecular coordinates, cellular states, organism behaviors, etc.); G_L = coarse-graining function at level L (maps a collection of level-L states to a level-(L+1) state); L = level index (dimensionless integer) | | Falsifiable consequence | If the G functions at different levels of the same system have nothing structurally in common -- if no general patterns recur across level transitions -- then the "same grammar across scales" claim fails and scale recursion is not a productive framework. If macro-level properties in complex systems show no systematic relationship to micro-level variation, coordination, or network structure, the G framework is not useful. |

Developed in: Emergence & Scale (C4)

Equation 12 -- Observer compression and Data Processing Inequality

Y = Pi_O(X)

I(X; Z) <= I(X; Y) for Markov chain X -> Y -> Z

An observer (O) compresses source information (X) into an output representation (Y = Pi_O(X)), where Pi_O is the observer's compression/projection function. The Data Processing Inequality (DPI) guarantees that any further processing (Y -> Z) cannot increase the information about the source X.

| Metadata | Content | |---|---| | Source | The DPI is an established result in information theory (Cover & Thomas, 2006). The compression function Y = Pi_O(X) is ECI's notation for applying the DPI to observer systems. | | Status | Established (DPI); Definition (the Pi_O notation and its application to observers) | | Assumptions | (1) The processing chain X -> Y -> Z forms a Markov chain (Z depends on X only through Y). (2) The observer's output Y is a function of its input -- the observer does not have access to information about X beyond what it receives through its sensory channels. (3) Mutual information I(X; Y) is well-defined (the relevant probability distributions exist and have finite entropy). | | Variables | X = source state (the aspect of reality being observed; units and dimensionality depend on context); Y = observer output (the observer's representation of X; dimensionality typically much lower than X); Z = any further processing of Y; Pi_O = observer-specific compression/projection function; I(X; Y) = mutual information between X and Y (bits) | | Falsifiable consequence | The DPI itself is a mathematical theorem and cannot be empirically falsified within its assumptions. However, ECI's application of it to observers makes a testable claim: an observer's output should never contain more information about a source than the observer received through its input channels. If systematic violations are found -- if an observer demonstrably extracts more information about a source than was present in its input -- either the Markov chain assumption is wrong (there is a hidden channel), or the measurement of mutual information is flawed, or the DPI has been violated (which would require revising information theory itself). |

Developed in: Observer Compression (D4)

Equation 13 -- Observer null hypothesis

H_0: P(outcome | observer_A) = P(outcome | observer_B) if physical setup identical

The null hypothesis for observer-independence: if two observers set up physically identical measurement apparatus, the probability distributions of their outcomes should be identical. Any observer-specific effect on physical measurement outcomes would violate this null.

| Metadata | Content | |---|---| | Source | Standard quantum mechanics prediction. The Born rule gives P(outcome) = |<psi|phi>|^2, which depends on the quantum state and the measurement apparatus, not on who is looking. This is the default expectation of every working physicist. | | Status | Established (as a prediction of standard QM) | | Assumptions | (1) "Physical setup identical" means the quantum state preparation, measurement apparatus, and environmental conditions are the same (to within experimental precision). (2) Observer identity is the only variable that differs between the two conditions. (3) The measurement outcomes are sampled from the Born-rule distribution. | | Variables | P(outcome | observer_A) = probability of a specific measurement outcome given observer A is conducting the experiment (dimensionless, range [0, 1]); P(outcome | observer_B) = same for observer B; outcome = the measurement result (domain-specific: photon detection, spin measurement, etc.) | | Falsifiable consequence | If large-scale, well-powered, preregistered experiments with QRNG-based randomization find that measurement outcome distributions systematically depend on observer identity when physical setups are controlled to be identical, the null hypothesis is rejected. This would be among the most extraordinary experimental results in the history of physics. ECI includes this null explicitly so that it can be rigorously tested and (most likely) confirmed, thereby constraining the framework's speculative edges. Rejection of H_0 would open the observer-complexity-affects-physics edge; confirmation of H_0 would close it. |

Developed in: Observer & Experience (D3), Falsifiability (F3)

5 What the math can and cannot do

The thirteen equations above fall into two distinct categories, and confusing them would be a serious error.

What the math can do now

Formal templates. The persistence filter equation (Eq. 8), the variance formula (Eq. 10), the DPI (Eq. 12), and the observer null hypothesis (Eq. 13) are mathematically precise and can be applied to data today. They have well-defined inputs, well-defined outputs, and well-defined conditions under which they apply or fail.

Definitions that enforce precision. The ECI operational system (Eq. 1), containment relation (Eq. 2), compatibility function (Eq. 3), coupling strength (Eq. 4), and observer compression notation (Eq. 12) force the framework to be specific about its variables and their relationships. They prevent the kind of verbal slipperiness that plagues many theoretical frameworks.

Qualitative predictions. Even the toy model (Eq. 6) and proposed equations (Eqs. 5, 7, 9, 11) generate qualitative predictions: more independent opportunities should increase match probability; survival should correlate with independently measured compatibility; the correlation term should matter in coordinated systems.

What the math cannot do yet

Quantitative predictions from proposed equations. Equations 5, 7, 9, and 11 have unknown functional forms. Writing S = f(Q, stability, E, robustness, ...) does not tell you whether S is a product of these factors, a weighted sum, a threshold function, or something else entirely. Until the functional forms are specified (or at least constrained by data), these equations are hypotheses about which variables matter, not predictive models.

Numerical values. Even where the functional form is known (e.g., the variance formula), the framework does not yet provide numerical estimates for most parameters. What is kappa for a specific neural circuit? What is Q for a specific carrier-channel pair? These require empirical measurement in specific systems -- the equations tell you what to measure, not what the measurements will be.

Cross-system comparison. The framework proposes that the same formal structures apply across systems (scale recursion, persistence filtering, the V-kappa framework). Whether this is actually true is an empirical question. The math provides the template for comparison; it does not guarantee that the comparison will be productive.

6 Operationalization priorities

Not all equations are equally ready for empirical testing. The following table ranks them by current testability and identifies what is needed to move each equation toward empirical use.

| Equation | Current testability | What is needed next | Priority | |---|---|---|---| | Eq. 10 (Variance with correlations) | Testable now -- apply to any system with micro-level data and macro-level measurements | Multi-system comparison: does the correlation term improve prediction of macro-stability across neural, ecological, and social systems? | High | | Eq. 12 (DPI / observer compression) | Testable now -- measure mutual information at input and output of any sensory/processing system | Systematic tests across sensory modalities: does any system violate the DPI bound? | High | | Eq. 13 (Observer null hypothesis) | Testable now -- standard QM experiments with observer identity as the controlled variable | Large-scale, preregistered, QRNG-based experiments testing whether observer identity affects measurement statistics | High | | Eq. 8 (Persistence filter) | Testable with operationalization -- requires independently measurable S | Identify systems where both p_t and S can be independently estimated; mineral stability, protein fold persistence, or organizational survival | Medium | | Eq. 9 (S decomposition) | Testable with operationalization -- requires independent measures of Q, stability, E, robustness | Start with systems where these variables have established operationalizations (e.g., thermodynamic stability for crystals, energy budgets for ecosystems) | Medium | | Eq. 11 (Scale recursion) | Testable with operationalization -- requires identifying G at multiple levels in the same system | Neural circuits (single neuron to population), ecological hierarchies (organism to community), social systems (individual to organization) | Medium | | Eq. 5 (Resource budget) | Testable in specific systems -- requires measuring budget allocations | Neuroscience: can neural tissue allocation be meaningfully decomposed into ordinary/extra/maintenance? Ecology: can energy budgets? | Medium-Low | | Eq. 4 (Coupling strength) | Testable via established measures -- mutual information, transfer entropy, Granger causality are all established | Apply to ECI-specific predictions: does Gamma predict coordination outcomes? | Medium | | Eq. 3 (Compatibility Q) | Requires operationalization -- the concept needs domain-specific measurement protocols | Develop Q measures for at least three domains; test whether Q predicts outcomes independently | Medium | | Eq. 7 (Functional access) | Requires operationalization -- R is unknown | Depends on progress with Eqs. 3, 4, and 5; cannot be tested until components are measurable | Low | | Eq. 6 (Toy model) | Not for testing -- illustrative only; the real question is whether real systems approximate independent opportunities | N/A -- serves pedagogical purpose | N/A | | Eqs. 1, 2 (ECI system, containment) | Definitions -- tested indirectly through the utility of the framework as a whole | Ongoing: does the I-C-E decomposition prove useful across systems? | Ongoing |

7 Connected Nodes

-> Applications & Future (F1): Applications claims depend on the equations developed here. Tier 1 applications (near-term) rely on established equations (Eqs. 10, 12, 13); Tier 2 and Tier 3 applications depend on proposed equations whose functional forms remain unknown.

-> Falsifiability (F3): Every equation's "Falsifiable consequence" entry on this page implements the standards developed on F3. The equation status labels (Definition, Established, Adapted, Proposed, Toy model) and the six-metadata requirement originate from F3's labeling system. F3 provides the philosophy; F2 provides the equations.

8 Master symbol table

All notation used across the ECI framework, collected in one place. Symbols are grouped by category. Where a symbol appears in multiple equations, all are listed.

Core ECI symbols

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | Omega_ECI | ECI operational system | Definition | -- | ECI Unit | 1 | | I | Information pattern | Framework variable | bits (when quantified) or dimensionless | ECI Unit | 1, 3 | | C | Carrier | Framework variable | system-dependent | Carrier (B2) | 1, 2, 3 | | E | Energy | Framework variable | J or W | Energy (B3) | 1, 9 | | C, C_alpha | Channel (general, specific) | Framework variable | characterized by dimensional, temporal, coupling constraints | Channels (B4) | 1, 2, 3 | | Q | Compatibility function | Proposed definition | dimensionless (or bits, dB in specific operationalizations) | Coupling (B5) | 3, 7, 9 | | Gamma | Coupling strength | Proposed definition | dimensionless (normalized) or bits (raw MI) | Coupling (B5) | 4, 7 |

Resource and capacity symbols

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | B_total | Total resource budget | Proposed variable | system-dependent (J, mm^3, hours, etc.) | Cross-Channel (E1) | 5 | | B_ordinary | Ordinary operation budget | Proposed variable | same as B_total | Cross-Channel (E1) | 5 | | B_extra | Extra/exploratory budget | Proposed variable | same as B_total | Cross-Channel (E1) | 5 | | B_maintenance | Maintenance budget | Proposed variable | same as B_total | Cross-Channel (E1) | 5 | | K, K_i | Carrier capacity (general, function-specific) | Proposed variable | bits or domain-specific | Carrier (B2) | 5, 7 | | g | Budget-to-capacity mapping | Proposed function | -- | Cross-Channel (E1) | 5 |

Access and matching symbols

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | q | Per-opportunity success probability | Toy model parameter | dimensionless [0, 1] | Cross-Channel (E1) | 6, 7 | | N (matching context) | Number of independent opportunities | Toy model parameter | dimensionless integer | Cross-Channel (E1) | 6, 7 | | A_access | Realized access | Proposed variable | domain-specific | Cross-Channel (E1) | 7 | | R | System readiness modulating function | Proposed function (unknown form) | dimensionless | Cross-Channel (E1) | 7 |

Persistence and filtering symbols

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | Omega (config.) | Configuration / configuration space | Standard variable | -- | Persistence (C2) | 8, 9 | | p_t(Omega) | Configuration distribution at time t | Standard variable | dimensionless density | Persistence (C2) | 8 | | S | Survival function | Proposed definition | dimensionless [0, 1] | Persistence (C2) | 8, 9 | | Z | Normalization constant | Derived quantity | -- | Persistence (C2) | 8 | | Delta_t | Time interval | Standard variable | s, yr, or consistent unit | Persistence (C2) | 8 | | stability (sigma) | Structural stability | Proposed variable | Lyapunov exponents (1/s), basin depth (J), or eigenvalue-based | Persistence (C2) | 9 | | robustness (rho) | Perturbation tolerance | Proposed variable | domain-specific | Persistence (C2) | 9 |

Emergence and scale symbols

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | X-bar | Sample mean | Standard variable | same as X_i | Emergence (C4) | 10 | | sigma^2 | Variance of individual variables | Standard variable | (units of X_i)^2 | Emergence (C4) | 10 | | N (components) | Number of micro-level components | Standard variable | dimensionless integer | Emergence (C4) | 10 | | Cov(X_i, X_j) | Covariance between components | Established | (units of X_i)^2 | Emergence (C4) | 10 | | X^{(L)} | State at level L | Proposed variable | level-dependent | Emergence (C4) | 11 | | G_L | Coarse-graining function at level L | Proposed function | -- | Emergence (C4) | 11 | | L | Level index | Standard variable | dimensionless integer | Emergence (C4) | 11 |

Information-theoretic and observer symbols

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | X (source) | Source state | Standard variable | context-dependent | Observer Compression (D4) | 12 | | Y | Observer output | Standard variable | context-dependent | Observer Compression (D4) | 12 | | Z (processed) | Further-processed output | Standard variable | context-dependent | Observer Compression (D4) | 12 | | Pi_O | Observer compression function | Definition (ECI notation) | -- | Observer Compression (D4) | 12 | | I(X; Y) | Mutual information | Established | bits | Information theory | 12 | | H_0 | Observer null hypothesis | Established (standard QM prediction) | -- | Observer (D3) | 13 |

Coordination symbols (used across equations)

| Symbol | Name | Type | Units | Defined in | Used in Equations | |---|---|---|---|---|---| | V | Variation (family of measures) | Proposed definition | domain-specific | Variation (C1) | context for 10, 11 | | kappa | Coordination parameter | Proposed definition | dimensionless | Variation (C1) | 7, context for 10, 11 |