Cosmology Polarized Birth Interface Count Interface Total Growth

The run total

The declaration interface_total_growth is a theorem in the Recognition Science framework's machine-checked library of formal theorems. It answers a counting question about a growing lattice world. The world is a discrete grid that expands over time, and at each step the framework's engine posts forced distinctions: edges in the grid where two neighboring sites carry different polarization values. These edges form the recognition-active interface, the part of the world where the engine is doing work. The theorem computes how many such edges exist in total over a full run from the first step to a later radius T.

In two dimensions the answer is 8T minus 8. The world's area grows like T squared, but the net number of forced distinctions posted over the whole run grows only like T. In three dimensions the total is 8T squared minus 8T, growing like T squared while the volume grows like T cubed. The pattern is the same in both cases: the net interface growth is one dimension below the volume. The theorem states this as a closed form, not as a bound. It is a proved result in the framework's library, with no unproved assumptions beyond the standard three axioms of the ambient type theory.

The number matters because the framework's compute-watch principle says cost scales with recognition activity, not with volume. A naive simulation that touched every cell in the volume would post on the order of T cubed or T squared operations. This theorem shows the actual posted distinctions are far fewer: T in two dimensions, T squared in three. The engine is not brute-forcing the world; it is only writing the boundary where distinctions occur. That is the practical consequence a reader can take away: the framework's own counting argument shows its simulated worlds are cheap to run relative to their size.

The theorem does not claim anything about the physical universe. It counts edges in a specific combinatorial model, a polarized diamond field in two dimensions and an octahedron field in three. It does not say real spacetime works this way. It does not say the interface growth is constant in three dimensions; the per-cycle increment there is linear in the radius, not constant. The theorem is a statement about the model's internal arithmetic, and its force is exactly that: a precise, checked count that supports the framework's cost principle within the model.

/-- **Total interface growth over a forward run (2-D).** The net number of interface edges the
polarized birth introduces over a full run from radius `1` to radius `T` is exactly `8T - 8 = 8(T-1)`,
the difference of the start and end interface sizes. This is `Θ(T)`, sub-extensive against the
brute-force spacetime cost `Θ(T³)` (volume `Θ(T²)` times `T` cycles): the compute-watch total. -/
theorem interface_total_growth (T : ℕ) (hT : 1 ≤ T) :
    (B T).card - (B 1).card = 8 * T - 8 := by
  rw [interface_card_eq T hT, interface_card_eq 1 (le_refl 1)]
  omega

/-- **Total interface growth over a forward run (2-D).** The net number of interface edges the
polarized birth introduces over a full run from radius `1` to radius `T` is exactly `8T - 8 = 8(T-1)`,
the difference of the start and end interface sizes. This is `Θ(T)`, sub-extensive against the
brute-force spacetime cost `Θ(T³)` (volume `Θ(T²)` times `T` cycles): the compute-watch total. -/
theorem interface_total_growth (T : ℕ) (hT : 1 ≤ T) :
    (B T).card - (B 1).card = 8 * T - 8 := by
  rw [interface_card_eq T hT, interface_card_eq 1 (le_refl 1)]
  omega

/-- **Total interface growth over a forward run (2-D).** The net number of interface edges the
polarized birth introduces over a full run from radius `1` to radius `T` is exactly `8T - 8 = 8(T-1)`,
the difference of the start and end interface sizes. This is `Θ(T)`, sub-extensive against the
brute-force spacetime cost `Θ(T³)` (volume `Θ(T²)` times `T` cycles): the compute-watch total. -/
theorem interface_total_growth (T : ℕ) (hT : 1 ≤ T) :
    (B T).card - (B 1).card = 8 * T - 8 := by
  rw [interface_card_eq T hT, interface_card_eq 1 (le_refl 1)]
  omega

What this page does not claim

The theorem says nothing about the physical universe; it counts edges in a specific combinatorial model. The three-dimensional per-cycle interface increment is linear in the radius, not constant. The theorem does not establish that real spacetime is discrete or that recognition activity is a physical cost.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Cosmology/PolarizedBirthInterfaceCount.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: