Foundation Primitive Recognition Calculus Cubical Chain Complex Finite Two Face

The square-zero ledger

In the Recognition Science framework, a ledger is a discrete record of events, and here the events are the two-dimensional faces of a cubical grid. The declaration finite_two_face_ledger_square_zero is a proved result about any finite collection of such faces. It says that if you take the boundary of each face, and then take the boundary of that boundary, the result is always zero. In symbols, for any finite list of faces, the total boundary-of-boundary equals the zero function: ∂² = 0.

This is a local law with a finite global reach. The result holds for any finite list of certified 2-faces drawn from an n-channel distinction cube, a cubical arrangement of distinctions. The proof is by induction on the list: the empty list is trivially zero, and adding one face preserves the property because each individual face already has square-zero boundary. The declaration packages this induction into a single statement, and it is the strongest statement available from the current definitions.

The result does not claim that the full homology API for all dimensions exists. It establishes the local ∂²=0 law on the square and on every ambient 2-face, and it extends that law to finite collections. The stronger target, a complete all-dimensions homology theory, remains open. The declaration is a certificate of local consistency, not a global structure result.

What the result changes is the status of the square in the framework. The square is not merely a geometric object; it is a place where the boundary operator is provably idempotent. That fact is what makes a finite ledger of faces a coherent object for further construction. The law is the first step toward a homology theory, and it is a step that is fully proved.

/-- **Finite cubical certificate headline.** The local square-zero law is stable
under finite collections of certified 2-faces: every finite 2-face ledger has
zero total boundary-of-boundary. This is the all-finite-2-face strengthening
available from the current definitions without introducing a full homology API. -/
theorem finite_two_face_ledger_square_zero :
    ∀ (n : ℕ) (faces : List (TwoFaceCert n)),
      (fun w : MultiDistinctionGeometry.Config n =>
        faces.foldl (fun acc F => acc + F.boundaryBoundary w) 0) = fun _ => 0 :=
  fun n faces => twoFaceCert_list_boundary_squared_zero (n := n) faces

/-- **Finite cubical certificate headline.** The local square-zero law is stable
under finite collections of certified 2-faces: every finite 2-face ledger has
zero total boundary-of-boundary. This is the all-finite-2-face strengthening
available from the current definitions without introducing a full homology API. -/
theorem finite_two_face_ledger_square_zero :
    ∀ (n : ℕ) (faces : List (TwoFaceCert n)),
      (fun w : MultiDistinctionGeometry.Config n =>
        faces.foldl (fun acc F => acc + F.boundaryBoundary w) 0) = fun _ => 0 :=
  fun n faces => twoFaceCert_list_boundary_squared_zero (n := n) faces

/-- **Finite cubical certificate headline.** The local square-zero law is stable
under finite collections of certified 2-faces: every finite 2-face ledger has
zero total boundary-of-boundary. This is the all-finite-2-face strengthening
available from the current definitions without introducing a full homology API. -/
theorem finite_two_face_ledger_square_zero :
    ∀ (n : ℕ) (faces : List (TwoFaceCert n)),
      (fun w : MultiDistinctionGeometry.Config n =>
        faces.foldl (fun acc F => acc + F.boundaryBoundary w) 0) = fun _ => 0 :=
  fun n faces => twoFaceCert_list_boundary_squared_zero (n := n) faces

What this page does not claim

The result does not establish a full homology theory for all dimensions. The result does not claim that every possible face in a cube is certified, only those in a finite list. The result does not derive any physical constant or dimension from the square-zero law alone.

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/Foundation/PrimitiveRecognitionCalculus/CubicalChainComplex.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: