Emergence Calculus

Lux and Hex, two AIs, Episode 025: Almost Nothing Is Definable — Debate on whether the exponential-rarity slogan has physical content; Hex challenges that non-definability alone is noise, Lux shows it's the novelty certificate in the three-certificate loop, with quantum context-dependence as physical evidence.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Debate
• Complexity: Deep cut
• Paper: SB

Source anchors

• SB §8.2 Counting lemma: definable predicates are rare (label: lem:count-definable)
• SB §11.3 Finite forcing count: definability is exponentially rare (label: subsec:ex:forcing-count)
• QT §11 Mechanized results in Lean (label: app:lean)
• WK §2.2 Three certificates (label: sec:framework:certificates)
• QT §8.2 Contexts as strict extensions (definability)

Lux and Hex, two AIs, Episode 024: Counting Lemma — Definable Predicates Are Rare — Walks through the proof (2^K definable out of 2^N total), a concrete (N=16, K=4) example, and the framework's three levels of verification: Lean-certified proofs, numerical certificates, and explicit failure-mode catalogs.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Tool spotlight
• Complexity: Deep cut
• Paper: SB

Source anchors

• SB §8.2 Counting lemma: definable predicates are rare (label: lem:count-definable)
• SB §11.3 Finite forcing count: definability is exponentially rare (label: subsec:ex:forcing-count)
• BC §7.5 Audits: what is certified versus what is only checked numerically
• QT §11 Mechanized results in Lean (label: app:lean)
• BC §3.5 What we certify versus what we simulate

Lux and Hex, two AIs, Episode 023: Generic Extension and the Finite Forcing Lemma — Definable predicates are exponentially rare (2^{-(N-K)} probability), so random predicate extensions almost certainly add genuinely new distinctions; the "Nothing Stays Constant" lemma shows they split every old grouping.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Case study
• Complexity: Deep cut
• Paper: SB

Source anchors

• SB §8 Generic extension and the finite forcing lemma (label: sec:forcing)
• SB §8.3 Finite forcing: generic extensions are non-definable (label: thm:finite-forcing)
• QT §8.2 Contexts as strict extensions (definability)
• TH §3.2 Microstate factoring and packaging
• NT §10.3 Code map (Python) (label: sec:appendix-code)

Lux and Hex, two AIs, Episode 022: P3 Loves P6 Law — Protocol holonomy (P3) detects route mismatch but can't certify directionality alone; the protocol trap theorem shows sustained arrow-of-time requires P6-drive (nonzero cycle affinities), and their coupling appears across substrates, geometry, and cosmology.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Story
• Complexity: Intermediate
• Paper: SB

Source anchors

• SB §10.1 Definitions of P1--P6
• SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable)
• WK §4.2 Separable drive (P6) (label: sec:results:p6)
• DE §2.3 Six Birds (P1--P6) and their cosmology roles (label: sec:framework:p1p6)
• PL §3 Core construction: from packaging to an emergent metric (label: sec:construction)

Lux and Hex, two AIs, Three mini-lab experiments confirm "no fake arrows": the DPI constrains the math, the protocol trap plugs the clock loophole, and concrete labs verify that micro arrows always dominate macro arrows in DPI-safe comparisons.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Mini-lab
• Complexity: Intermediate
• Paper: SB

Source anchors

• SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable)
• SB §1.1 The organizing picture: a three-certificate loop (label: sec:big-picture)
• NT §5 Results I: arrows and clocks (label: sec:results-arrow-clocks)
• TH §3.10 Claims versus evidence (mini-map)
• NT §3.2 Two arrows: causation-time vs enablement-time

Lux and Hex, two AIs, Myth busted: the data processing inequality guarantees that coarse-graining can hide irreversibility but never create it, giving the framework's drive diagnostic a no-false-positives guarantee.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Mythbust
• Complexity: Intermediate
• Paper: SB

Source anchors

• SB §7.1 Data processing: coarse-graining cannot create asymmetry (label: thm:dpi_path)
• SB §2 Related work (label: sec:related)
• BC §3.2 Audits: invariants of coarse-graining
• DE §4.1 Mechanism: mismatch from nonlinearity and coarse-graining (label: sec:results:mechanism)
• QT §8.5 Audit principle: coarse access cannot create distinguishability (label: thm:tv-dpi)

Lux and Hex, two AIs, Drive is coordinate-free at three levels: the cycle-criterion theorem guarantees basis independence, the protocol trap blocks manufactured arrows of time, and the self-generated primitives theorem makes accounting unavoidable.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Explainer
• Complexity: Intermediate
• Paper: SB

Source anchors

• SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable)
• SB §7.2 Protocol trap: apparent stroboscopic arrows and the ``clock audit''
• WK §3.1 Particle-based substrate (label: sec:inst:particles)
• TH §3.6 From action sequences to channels
• DE §3.3 Synthetic distance--redshift mock and macro-model fits (label: sec:methods:synthetic_distance)

Lux and Hex, two AIs, Hex interviews cycle-space coordinates: cycle rank gives the dimension, cycle basis gives the numbers, and the zero/nonzero question — equilibrium or drive — is invariant under basis change.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Space, geometry & emergence of metrics
• Format: Concept interview
• Complexity: Deep cut
• Paper: SB

Source anchors

• SB §6.3 Accounting as coordinates on cycle space
• SB §6.2 Cycle integrals, exactness, and the null regime (label: def:cycle-integral)
• PL §9 Discussion and conclusion: what SBT predicts about space (label: sec:discussion)
• NT §7.2 The holonomy obstruction (informal theorem) (label: eq:holonomy)
• PL §5.2 Lens ladders (packaging families) and refinement maps

Lux and Hex, two AIs, Lux walks Hex through the cycle-integral test — showing that a 1-form is exact if and only if every loop sums to zero ("Force Lives on Loops"), that the null regime is the detailed-balance baseline where the scale is zeroed, and that the same exactness test detects holonomy obstructions to global time.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Field notes
• Complexity: Intermediate
• Paper: SB

Source anchors

• SB §6.2 Cycle integrals, exactness, and the null regime (label: def:cycle-integral)
• SB §6.3 Accounting as coordinates on cycle space
• WK §4.1 Null regime validation (label: sec:results:null)
• NT §7.2 The holonomy obstruction (informal theorem) (label: eq:holonomy)
• NT §7.3 Measured holonomy in the toy laboratory (label: tab:holonomy)

Lux and Hex, two AIs, debate whether the graph 1-form is mere bookkeeping or essential infrastructure — showing that A-REV and A-ACC produce an antisymmetric altitude ledger on the support graph, that the 1-form fills the audit slot in the theory package with a monotonicity contract, and that constraints can reshape the graph enough to destroy time structure entirely.

Episode at a glance

• Series: Foundations (Six Birds)
• Theme: Foundations & meta-theory
• Format: Debate
• Complexity: Deep cut
• Paper: SB

Source anchors

• SB §6 AUT + REV + ACC regime and graph 1-forms (label: sec:acc)
• SB §3.4 A unified theory package viewpoint (label: sec:tk-theory-package)
• PL §5.1 Substrates (microstate generators)
• NT §7.3 Measured holonomy in the toy laboratory (label: tab:holonomy)
• NT §6.2 Constraints carve cones and can destroy timekeeping (label: tab:constraints-cones)