Selection Theory
Competitive Dynamics, Cascades, Uncertainty, Equilibria, and Selection Speed
The selection inequality Sel(A) = CL(A) - 〈Λ, B(A)〉 ≥ 0, treated as a parametric family indexed by Λ, generates a complete theory of competitive dynamics. Game theory, market dynamics, and technology selection are DERIVED, not assumed.
Five bodies: competitive reversal from Λ variation, cascade dynamics with critical fragility, Λ estimation error as formal Bleak, multi-pattern SEP as Nash equilibrium, and selection speed decomposition deriving the innovator's dilemma.
1. Competitive Reversal
Theorem S2 — Dominance depends on Lambda
A's dominance over B depends on Λ. There exists a reversal surface in R3+ such that changing the environment swaps which pattern dominates.
2. Cascade Dynamics
Critical fragility phase transition
When a pattern fails (Sel drops below 0), its neighbors lose a coherence source. Their Sel decreases. If any neighbor crosses Sel = 0, it fails too, propagating the cascade. There is a critical fragility threshold: below it, failures are local; above it, a single failure can propagate through the entire niche.
3. Lambda Estimation Error
Bounded rationality as corollary
No pattern has perfect knowledge of Λ. The estimation error ΔΛ is itself a form of Bleak — information about the true environment that leaks away at the observation boundary. Bounded rationality (Herbert Simon) follows as a corollary: organisms act on estimated Λ, not true Λ, and the estimation cost is a formal budget term.
4. Multi-Pattern SEP as Nash Equilibrium
Price of anarchy and competitive transitions
When multiple patterns coexist in a niche, each optimizing its own Sel, the multi-pattern SEP is a Nash equilibrium: no pattern can unilaterally improve its Sel by changing its budget allocation. The price of anarchy (gap between cooperative and Nash optima) is bounded by B6 (quadratic tangent law).
5. Selection Speed Decomposition
Deriving the innovator's dilemma
Selection speed decomposes into three components: challenge rate (how fast Λ changes), propagation speed (how fast information about the change reaches patterns), and reorganization speed (how fast patterns adapt their budget allocation).
Large organisms have high reorganization Bcx (many internal dependencies to coordinate). Small organisms have low Bcx but low CL (less coherence buffer). The scale-speed tradeoff creates a regime where small patterns can outpace large ones in rapidly changing environments (Λ shifting fast), while large patterns dominate in stable environments (Λ stationary).
Falsifiable Predictions
P1: Reversal Surface
P2: Cascade Threshold
Source: CT_RESEARCH_SELECTION_THEORY.md · Five families of competitive theory derived from the selection inequality with no game-theoretic assumptions.