Cosmology Polarized Birth Interface Interface Subextensive

The surface of the birth field

The polarized birth field is a discrete model universe in the Recognition Science framework. Each cell carries a sign: positive on one side, negative on the other, and zero along the middle line. The declaration interface_subextensive establishes a structural fact about where the action happens: every edge connecting two cells of opposite sign touches the middle line, called the spine. In two dimensions, the spine is the vertical column at x = 0, holding 2t + 1 cells when the grid has radius t. In three dimensions, the spine becomes a flat disk at x = 0, holding 2t² + 2t + 1 cells.

The consequence is a scaling law. The whole world in two dimensions has area roughly t², while the spine has only about t cells. In three dimensions, the world has volume roughly t³, while the spine has about t² cells. In both cases, the ratio of spine to world shrinks like 1/t: as the universe grows, the recognition-active interface occupies a vanishing fraction of the total. The cost of maintaining the boundary, in this model, lives on a lower-dimensional surface, not spread through the volume. The theorem interface_subextensive states this precisely, with the spine size bounded by a constant times the volume divided by t.

This closes a two-part picture for the birth field. Earlier work established that the carried state, the number of distinct regions, stays fixed at three for any radius. Now the interface, the set of edges where opposite charges meet, is shown to be confined to the spine. Both halves together mean the whole structure, carried regions and active boundary, becomes negligible as a fraction of the growing world. The framework's library, a machine-checked collection of formal theorems, records this as a theorem with no unproved assumptions beyond the standard logical axioms.

In Recognition Science, this result supports the idea that recognition cost localizes to surfaces rather than filling volumes. The framework models physical structure as a ledger of discrete recognition events, and this theorem shows one such ledger, the polarized birth field, concentrates its distinctions on a codimension-1 set. The exact count of interface edges, as opposed to spine cells, is not part of the theorem; the proof bounds the spine but does not enumerate every boundary edge individually. That enumeration remains a separate, open enumeration problem.

/-- **Every active edge touches the spine.** For the polarized diamond field, any two adjacent cells
of different charge have an endpoint on the spine `x = 0`. The charge `sign(x)` flips only between
columns `x = -1, 0, 1`, and a charge-flipping adjacency must step the `x`-coordinate across `0`, so
one endpoint sits on the spine. Pure case analysis: split the `sign` on each endpoint, then the
unit-distance adjacency forces the spine. -/
theorem bichromatic_endpoint_on_spine (t : ℕ) (a b : Vtx t)
    (hadj : adj a.val b.val) (hc : polarized t a ≠ polarized t b) :
    a.val.1 = 0 ∨ b.val.1 = 0 := by
  unfold adj at hadj
  simp only [polarized] at hc
  split_ifs at hc <;> omega

/-- **The 2-D spine is `2t + 1` cells.** The interface of the birth field is confined to this
codimension-1 set (a 1-D ball), which is `Θ(t)` while the world is `Θ(t²)`. -/
theorem spine_card (t : ℕ) : (spine t).card = 2 * t + 1 := by
  rw [spine_eq_image, Finset.card_image_of_injective _ (by
    intro u v h; simpa using h)]
  rw [Int.card_Icc]
  omega

/-- **The 2-D spine is `2t + 1` cells.** The interface of the birth field is confined to this
codimension-1 set (a 1-D ball), which is `Θ(t)` while the world is `Θ(t²)`. -/
theorem spine_card (t : ℕ) : (spine t).card = 2 * t + 1 := by
  rw [spine_eq_image, Finset.card_image_of_injective _ (by
    intro u v h; simpa using h)]
  rw [Int.card_Icc]
  omega

/-- **Interface sub-extensivity (2-D).** The recognition-active interface of the birth field is
confined to the spine, a set of `2t + 1` cells, so `spine · t ≤ area`: the interface fraction falls
as `~ 1/t`. The cost lives on a 1-D curve while the world is the 2-D area `2t² + 2t + 1`. -/
theorem interface_subextensive (t : ℕ) (ht : 1 ≤ t) :
    (spine t).card = 2 * t + 1 ∧
      (spine t).card * t ≤ (InterfaceComponentBound.Diamond.ball t).card := by
  refine ⟨spine_card t, ?_⟩
  rw [spine_card t, LatticeBallVolume.Diamond.card_ball]
  nlinarith [ht]

/-- **Birth-field sub-extensivity, both halves (2-D).** The single capstone tying Phase 50 to Phase 51
for the forced conjugate-birth field: (1) it is carried as exactly 3 locked domains for every radius
(`O(1)` carried state, Phase 50), (2) its entire recognition-active interface is spine-incident, and
(3) the spine times the radius fits in the area, so the interface is confined to a codimension-1 set.
Both the carried-domain fraction and the interface support vanish as a fraction of the `Θ(t²)` world:
the North-Star "carry each region at the coarsest φ-rung its recognition allows" made exact for the
birth field, as a THEOREM. -/
theorem birth_field_subextensive (t : ℕ) (ht : 1 ≤ t) :
    comp (PolarizedBirthDomains.Diamond.Fmono t) = 3
    ∧ (∀ p ∈ (edges t).filter (fun q => decide (polarized t q.1 ≠ polarized t q.2)),
         p.1.val.1 = 0 ∨ p.2.val.1 = 0)
    ∧ (spine t).card * t ≤ (InterfaceComponentBound.Diamond.ball t).card :=
  ⟨PolarizedBirthDomains.Diamond.polarized_components_eq_three t ht,
   interface_on_spine t, (interface_subextensive t ht).2⟩

What this page does not claim

The exact number of interface edges is not counted, only the spine size is bounded. The result does not establish anything about the physical universe, only about the discrete model. The framework's claim that recognition cost localizes is a model interpretation, not a statement about empirical physics.

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