Cosmology Foam Topology Euler Char Disjoint Union

The additivity of shape counting

The Euler characteristic is a number that summarizes the shape of a geometric object. For a grid of cells, it is computed by counting the object's vertices, subtracting its edges, adding its squares, and subtracting its cubes: χ = N₀ − N₁ + N₂ − N₃. A solid box, no matter how large, always yields χ = 1, the same value as a single point. This size-independence is the signature of a topological invariant: it measures genuine features like holes or enclosed voids, never mere scale.

This additivity theorem, proved in the framework's machine-checked library of formal theorems, states that for two disjoint collections of cells, the Euler characteristic of their union is simply the sum of their individual characteristics: χ(A ∪ B) = χ(A) + χ(B). The proof follows directly from a more general inclusion-exclusion identity, χ(A ∪ B) + χ(A ∩ B) = χ(A) + χ(B), where the overlapping contribution vanishes when the sets are disjoint. This seemingly simple property is the combinatorial foundation that makes the Euler characteristic a well-defined and practical tool.

The theorem's practical payoff is that a large, complex structure can be analyzed piece by piece. If a cosmic foam is assembled from k separate solid domains, its total Euler characteristic is just k, directly recovering the number of connected components. A single contractible domain reads χ = 1. This additivity is what allows the framework's numerical readout to sum the Euler characteristic over the separated locked domains that its birth law assembles, providing a parameter-free topological signature of the cosmic web.

In Recognition Science, this theorem anchors the topological readout of the assembled recognition foam. The framework models the universe's large-scale structure as a discrete record of recognition events, and this theorem ensures that the shape statistics computed on that record are stable. The framework's library proves that a filled box in any dimension has χ = 1, and that removing a single interior vertex from a 2-D box creates a hole (χ = 0) while doing so in 3-D creates an enclosed void (χ = 2). These three primitive topologies, blob, hole, and void, are the fundamental shapes the readout reports.

What this theorem does not claim is any physical content about the actual universe. It is a purely combinatorial statement about finite sets of cells. It does not assert that the cosmic web is a foam, that recognition events are real, or that the framework's model is correct. Those are separate, empirical or definitional matters. The theorem's power is its universality within its own domain: it holds for any finite collection of cells with any dimension assignment, with no fitted parameters or hidden assumptions.

/-- **THEOREM.** Over disjoint cell sets the Euler characteristic is additive:
`χ(A ∪ B) = χ(A) + χ(B)`. So `k` separated locked domains contribute `k` times their
Euler characteristic; with the box normalization of §2, `k` disjoint solid domains read
`χ = k`, recovering the connected-component count. -/
theorem eulerChar_disjoint_union {α : Type*} [DecidableEq α] (dim : α → ℕ)
    {A B : Finset α} (h : Disjoint A B) :
    eulerChar dim (A ∪ B) = eulerChar dim A + eulerChar dim B := by
  classical
  have hbase := eulerChar_union_add_inter dim A B
  have hinter : A ∩ B = (∅ : Finset α) := Finset.disjoint_iff_inter_eq_empty.mp h
  rw [hinter, eulerChar_empty, add_zero] at hbase
  exact hbase

/-- **THEOREM (2-D normalization).** A filled rectangle of `(a+1)×(b+1)` lattice points
has Euler characteristic `N₀ − N₁ + N₂ = 1`, INDEPENDENT of `a, b`. Here
`N₀ = (a+1)(b+1)` vertices, `N₁ = a(b+1) + (a+1)b` unit edges (horizontal then vertical),
and `N₂ = a·b` unit squares. A solid rectangle, however large, is topologically a
point. -/
theorem eulerChar2D_filledBox (a b : ℤ) :
    (a + 1) * (b + 1) - (a * (b + 1) + (a + 1) * b) + a * b = 1 := by ring

/-- **THEOREM (3-D normalization).** A filled box of `(a+1)×(b+1)×(c+1)` lattice points
has Euler characteristic `N₀ − N₁ + N₂ − N₃ = 1`, INDEPENDENT of `a, b, c`. The cell
counts are `N₀ = (a+1)(b+1)(c+1)`; `N₁ = a(b+1)(c+1) + (a+1)b(c+1) + (a+1)(b+1)c` (edges
along the three axes); `N₂ = ab(c+1) + a(b+1)c + (a+1)bc` (squares in the three coordinate
planes); `N₃ = abc` (unit cubes). A solid box, however large, is topologically a point,
so in the numeric readout any deviation of `χ` from `1` measures genuine topology, never
size. -/
theorem eulerChar3D_filledBox (a b c : ℤ) :
    (a + 1) * (b + 1) * (c + 1)
      - (a * (b + 1) * (c + 1) + (a + 1) * b * (c + 1) + (a + 1) * (b + 1) * c)
      + (a * b * (c + 1) + a * (b + 1) * c + (a + 1) * b * c)
      - a * b * c = 1 := by ring

/-- **THEOREM (valuation / inclusion-exclusion).** The cubical Euler characteristic is a
valuation: `χ(A ∪ B) + χ(A ∩ B) = χ(A) + χ(B)`. This is the combinatorial core that makes
`χ` well-defined and additive; it is the reason the numeric readout may sum `χ` over the
locked domains the law assembles. -/
theorem eulerChar_union_add_inter {α : Type*} [DecidableEq α] (dim : α → ℕ)
    (A B : Finset α) :
    eulerChar dim (A ∪ B) + eulerChar dim (A ∩ B)
      = eulerChar dim A + eulerChar dim B := by
  classical
  unfold eulerChar
  exact Finset.sum_union_inter

What this page does not claim

The theorem makes no claim about the physical reality of the recognition foam or the framework's cosmological model. It does not assert that the Euler characteristic is the only meaningful topological statistic for the cosmic web. It does not claim that the Euler characteristic of the actual universe has any particular value.

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