Cosmology Foam Topology Euler Char Excursion All

The trivial endpoint

The Euler characteristic is a number that describes the shape of a space by counting its features. For a grid of cells, it is the number of vertices, minus the number of edges, plus the number of faces, minus the number of cubes, and so on. A solid block, no matter its size, always has an Euler characteristic of 1, the same as a single point. A hollow shell has a value of 2, and a shape with a tunnel through it has a value of 0. These values are topological invariants: they do not change when the shape is stretched or bent, only when holes are created or destroyed.

In the Recognition Science framework, a ledger (a discrete record of events) can be used to model a region of space as a collection of cells. The framework's library, a machine-checked collection of formal theorems, proves that a particular relaxation process, which drives any system toward a state of consensus, always ends in a topologically trivial state. The theorem named eulerChar_excursion_all establishes that if every cell in a region is over-dense, meaning it has a positive value, then the set of over-dense cells is the entire region itself. Its Euler characteristic is therefore the same as the whole region's, which for a simple box is 1: a single, featureless blob with no tunnels and no enclosed voids.

This result is the counterpart to another theorem, eulerChar_excursion_empty, which covers the other possible consensus state. If no cell is over-dense, the set of over-dense cells is empty, and its Euler characteristic is 0, the vacuum. Together, these two theorems prove that the closed relaxation process erases all topology from any initial structure. A complex cosmic-web-like sponge, with its filaments, tunnels, and voids, inevitably decays into either a single blob or nothing at all. The framework's library proves that sustained cosmic-web structure requires an open, driven process, not this closed relaxation.

This is a purely combinatorial and topological statement about a specific mathematical operation. It does not claim that the actual universe's cosmic web is topologically trivial, nor does it describe how the open process might create structure. The theorem is a precise, machine-checked fact about the endpoint of one particular dynamical rule within the framework.

/-- **THEOREM (blob endpoint).** If every cell of `K` is over-dense (`p c` for every `c ∈ K`, a
strictly positive consensus `σ > 0`), the positive excursion set `K.filter p` is all of `K`, so its
Euler characteristic is `χ(K)`, a single contractible blob (`= 1` for a filled box by §2). Either
consensus endpoint is topologically trivial: no handles (`b₁`), no enclosed voids (`b₂`). -/
theorem eulerChar_excursion_all {α : Type*} (dim : α → ℕ) (p : α → Prop) [DecidablePred p]
    (K : Finset α) (h : ∀ c ∈ K, p c) :
    eulerChar dim (K.filter p) = eulerChar dim K := by
  rw [Finset.filter_true_of_mem h]

/-- **THEOREM (blob endpoint).** If every cell of `K` is over-dense (`p c` for every `c ∈ K`, a
strictly positive consensus `σ > 0`), the positive excursion set `K.filter p` is all of `K`, so its
Euler characteristic is `χ(K)`, a single contractible blob (`= 1` for a filled box by §2). Either
consensus endpoint is topologically trivial: no handles (`b₁`), no enclosed voids (`b₂`). -/
theorem eulerChar_excursion_all {α : Type*} (dim : α → ℕ) (p : α → Prop) [DecidablePred p]
    (K : Finset α) (h : ∀ c ∈ K, p c) :
    eulerChar dim (K.filter p) = eulerChar dim K := by
  rw [Finset.filter_true_of_mem h]

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

What this page does not claim

This theorem does not claim that the actual universe's cosmic web is topologically trivial. This theorem does not describe how the open process might create or sustain structure. This theorem does not apply to the open driven law, only to the closed relaxation.

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: