Cosmology Polarized Birth Domains Clos Some Root Of Descent

The descent lemma

In the Recognition Science framework, a ledger is a discrete record of events, and a recognition is the act of matching a new event to a stored one. The cost of recognition is forced by a proved theorem, and from that cost the framework derives a cosmology. One step in that derivation is a lemma named clos_someRoot_of_descent, which is a theorem about connected regions in a finite graph. It says: if you have a graph, a list of special vertices called roots, and a height function that is zero only at those roots, and if every non-root vertex has a neighbor with a strictly smaller height, then every vertex in the graph is connected to at least one root.

The lemma is a formal statement about graphs, but its use in the framework is concrete. The framework models the birth of a world as a shell that installs a field of charges: +1 on one side of a central spine, -1 on the other, and 0 on the spine itself. The graph is the set of cells in a diamond (2D) or octahedron (3D) ball, and the height function measures distance from the roots, which are the three points (1,0), (-1,0), and (0,0) in 2D, or their 3D analogues. The lemma proves that every cell in the ball connects to one of these three roots through edges that preserve the charge. Since the three roots have distinct charges, the cells split into exactly three connected regions: the positive half, the negative half, and the spine.

The consequence is a statement about how much information the framework must carry. The number of cells in a ball of radius t grows quadratically in 2D and cubically in 3D, but the number of connected regions is always exactly three, independent of t. The framework calls this "carried-state sub-extensivity": the birth field is carried at O(1) cost, meaning the number of regions does not grow with the world's size. The theorem polarized_carried_subextensive states this directly: the component count is 3, and the ball's size is at least 3t in 2D or 3t² in 3D, so the fraction of components per cell tends to zero.

The lemma does not claim that the live engine, after birth, keeps the field in this simple state. The docstring is explicit: the live engine diffuses the spine by forced resolution, creating additional small interface components. Those extra components are bounded by a separate interface bound, not by this lemma. The O(1) statement is exact only for the forced conjugate birth configuration, which is what the shell creation installs each cadence cycle. The lemma also does not claim anything about the physical mechanism that bridges recognition to linking; that bridge remains an open target in the framework.

/-- **Descent toward a finite set of roots.** If a height `h : V → ℕ` vanishes only on the cells in
`roots`, and every cell of positive height has an edge (in either orientation) to a strictly-lower
cell, then every cell is connected to some root in `roots`. Strong induction on `h v`, exactly as
`InterfaceComponentBound.clos_root_of_descent` but with several roots instead of one. -/
theorem clos_someRoot_of_descent [Finite V] (E : List (V × V)) (h : V → ℕ) (roots : List V)
    (hzero : ∀ v, h v = 0 → v ∈ roots)
    (hdesc : ∀ v, h v ≠ 0 → ∃ u, ((v, u) ∈ E ∨ (u, v) ∈ E) ∧ h u < h v) :
    ∀ v, ∃ r ∈ roots, clos E v r := by
  have e := clos_equiv E
  have H : ∀ n, ∀ v, h v = n → ∃ r ∈ roots, clos E v r := by
    intro n
    induction n using Nat.strong_induction_on with
    | _ n ih =>
      intro v hv
      rcases Nat.eq_zero_or_pos (h v) with h0 | hpos
      · exact ⟨v, hzero v h0, e.refl v⟩
      · have hvne : h v ≠ 0 := by omega
        obtain ⟨u, hedge, hlt⟩ := hdesc v hvne
        have hvu : clos E v u := by
          rcases hedge with he | he
          · exact Relation.EqvGen.rel v u he
          · exact e.symm (Relation.EqvGen.rel u v he)
        obtain ⟨r, hr, hur⟩ := ih (h u) (by omega) u rfl
        exact ⟨r, hr, e.trans hvu hur⟩
  intro v
  exact H (h v) v rfl

/-- **The polarized birth field has exactly 3 locked domains, every radius (2-D).** The upper bound
`≤ 3` (descent toward the three roots) meets the lower bound `≥ 3` (the three roots carry the three
distinct charges `+1`, `-1`, `0`, and charge is a closure invariant). So the carried state is exactly
3 for all `t ≥ 1`: the fine half, the coarse half, and the spine. -/
theorem polarized_components_eq_three (t : ℕ) (ht : 1 ≤ t) : comp (Fmono t) = 3 := by
  refine le_antisymm (polarized_components_le_three t ht) ?_
  exact three_le_comp_of_three_charges (edges t) (polarized t)
    ⟨(1, 0), by rw [mem_ball_iff]; omega⟩
    ⟨(-1, 0), by rw [mem_ball_iff]; omega⟩
    ⟨(0, 0), by rw [mem_ball_iff]; omega⟩
    (by simp only [polarized]; dsimp only; decide)
    (by simp only [polarized]; dsimp only; decide)
    (by simp only [polarized]; dsimp only; decide)

/-- **Carried-state sub-extensivity for the birth field (2-D).** The polarized diamond fills
`2t² + 2t + 1` cells (Phase 49) but is carried as exactly 3 super-regions, so the carried state times
the radius is at most the area for every `t ≥ 1`: `3 t ≤ card (ball t)`, the carried cost is `O(1)`
while the world is `Θ(t²)`. -/
theorem polarized_carried_subextensive (t : ℕ) (ht : 1 ≤ t) :
    comp (Fmono t) = 3 ∧ 3 * t ≤ (InterfaceComponentBound.Diamond.ball t).card := by
  refine ⟨polarized_components_eq_three t ht, ?_⟩
  rw [LatticeBallVolume.Diamond.card_ball]
  nlinarith [ht]

What this page does not claim

The lemma does not bound the component count after the live engine diffuses the spine. The lemma does not establish any physical claim about the bridge from recognition to linking. The O(1) carried-state statement is exact only for the forced conjugate birth configuration, not for the evolved field.

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/PolarizedBirthDomains.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: