Cosmology Foam Topology Euler Char Excursion Empty

The empty excursion set

The Euler characteristic is a number that describes the shape of a space, counting its basic pieces with alternating signs: vertices minus edges plus squares minus cubes, written χ = N₀ − N₁ + N₂ − N₃. For a solid box, this number is always 1, no matter how large the box. Remove a hole and it becomes 0; hollow out a void and it becomes 2. The key property is that a solid region, however big, is topologically just a point.

This counting rule has a long history in mathematics, where it was developed in the 18th and 19th centuries by Leonhard Euler and Henri Poincaré. It is a topological invariant, meaning it stays the same under continuous deformation. A coffee cup and a doughnut both have a single hole, so they share the same Euler characteristic. The rule also obeys a simple additivity law: for two overlapping regions, the characteristic of their union plus the characteristic of their intersection equals the sum of their individual characteristics.

In Recognition Science, the framework models the universe as a discrete record of events, and this counting rule becomes a tool for reading cosmic structure. The framework's machine-checked library of formal theorems shows that a filled box in one, two, or three dimensions always has Euler characteristic 1, independent of its side lengths. This normalization means that any deviation from 1 in a measured region indicates genuine topology: extra components, tunnels, or enclosed voids, not mere size.

The declaration eulerChar_excursion_empty establishes a specific consequence of this counting. It shows that if no cell in a region is over-dense, meaning the field value is not positive anywhere, then the set of over-dense cells is empty and its Euler characteristic is 0. This is the vacuum state. The theorem is verified in the machine-checked library with no unverified assumptions, and it follows from the simple fact that filtering a set by a condition that holds nowhere gives the empty set, whose Euler characteristic is 0 by definition.

This result matters because of what it implies about dynamics. The framework's forced recognition dynamics drives any coupled world toward consensus, where all cells share the same value. If that consensus value is zero, then no cell is over-dense, and the structure becomes empty: χ = 0. If the consensus is positive, every cell is over-dense, and the structure becomes a single blob with χ = 1. Either way, every handle and enclosed void is erased. A sponge-like cosmic web fed to this closed dynamics loses all its topology and decays to nothing. Sustained structure, the framework concludes, requires an open driven law, not this closed relaxation.

/-- **THEOREM (1-D normalization).** A filled segment of `a + 1` lattice points (so `a`
unit edges) has Euler characteristic `N₀ − N₁ = (a+1) − a = 1`: one contractible
component, independent of length. -/
theorem eulerChar1D_filledBox (a : ℤ) : (a + 1) - a = 1 := by ring

/-- **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 (vacuum endpoint).** If no cell of `K` is over-dense (`¬ p c` for every `c ∈ K`, the
`σ = 0` consensus `f ≡ 0` under `p c := 0 < f c`), the positive excursion set `K.filter p` is empty
and its Euler characteristic is `0`. The closed forced relaxation erases the structure to the
vacuum. -/
theorem eulerChar_excursion_empty {α : Type*} (dim : α → ℕ) (p : α → Prop) [DecidablePred p]
    (K : Finset α) (h : ∀ c ∈ K, ¬ p c) :
    eulerChar dim (K.filter p) = 0 := by
  rw [Finset.filter_false_of_mem h, eulerChar_empty]

/-- **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

This theorem does not claim that the Euler characteristic of any real cosmic structure is zero. It does not claim that the closed relaxation dynamics is the actual evolution of the universe. It does not claim that the framework's recognition dynamics has been observed in nature.

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: