IndisputableMonolith.Foundation.PrimitiveRecognitionCalculus.CubicalChainComplex
Defines a two-step cubical chain complex C₂ → C₁ → C₀ in which the composition of successive boundary maps vanishes. Supplies the BoundaryPair structure, square-boundary certificates, and finite two-face ledger lemmas that encode ∂² = 0. Downstream dimensional-boundary and Δ-native analysis modules import this as the algebraic skeleton for recognition calculus on cubes.
claimA two-step chain complex of types $C_2 \xrightarrow{\partial_2} C_1 \xrightarrow{\partial_1} C_0$ such that $\partial_1 \circ \partial_2 = 0$. The module packages boundary pairs on squares, ambient two-face identities, and finite ledger certificates that the squared boundary is identically zero.
background
In the Primitive Recognition Calculus, multi-distinction geometry supplies the combinatorial substrate on which recognition acts. Cubes and their faces carry oriented distinctions; the algebraic content of that geometry is a chain complex whose differentials count signed face incidences.
This module isolates the lowest nontrivial length of that complex: two steps, from 2-chains through 1-chains to 0-chains. The central algebraic demand is the classical identity $\partial^2 = 0$, here realized on square (two-face) data rather than on a full simplicial or cubical set. Sibling definitions introduce a BoundaryPair packaging the two successive maps, a square-boundary specialization, and certificate types (TwoFaceCert and finite ledger forms) that witness the vanishing of the composition on concrete face lists.
The setting is purely type-theoretic and combinatorial: no metric, measure, or continuum structure is assumed. The module sits immediately above MultiDistinctionGeometry and below the all-dimensional cubical boundary and Δ-native analysis layers.
proof idea
The module is primarily definitional scaffolding plus elementary algebraic identities. BoundaryPair and squareBoundaryPair package the two maps; ambient_two_face_square_zero and the TwoFaceCert family discharge $\partial_1\circ\partial_2=0$ by direct expansion on face incidences (oriented edge cancellations on each square). List and finite-ledger variants lift the pointwise identity to finite collections by induction or fold. The headline declaration cubical_chain_complex_headline assembles these pieces into the stated two-step complex. No deep homological machinery is invoked; proofs are combinatorial cancellations.
why it matters in Recognition Science
Recognition Science needs a native chain complex so that conservation and closure statements (ledger balance, Δ-native strong closure) can be stated as homological identities rather than ad-hoc bookkeeping. This module supplies the two-step core used by AllDimensionalCubicalBoundary to extend the boundary operator across dimensions, and by DeltaNativeAnalysis and DeltaNativeStrongClosure to prove that native recognition increments square to zero. In the broader forcing chain it underwrites the discrete geometric side of the eight-tick octave and D = 3 spatial structure: once $\partial^2=0$ is certified on cubes, higher recognition calculus can treat cycles and boundaries as first-class objects. Without it, downstream Δ-native closure would lack an algebraic carrier.
scope and limits
- Does not construct the full cubical singular complex in all degrees.
- Does not prove homology vanishing or compute Betti numbers.
- Does not introduce metrics, measures, or continuum limits on the cubes.
- Does not treat non-cubical cells (simplices, polytopes) or infinite ledgers.
- Does not derive physical constants or the J-cost functional equation.