The Surface That Counts Its Own Boundary

Abstract

The boundary of the tetrahedron is a sphere, and a sphere has no boundary. We make the second fact a finite computation: over the two-element field, the boundary surface of a tetrahedron certifies its own closure by a local count — every edge lies in exactly two faces — rather than by any global topological argument. We build the surface as the top rung of a short ladder of forced constructions: a cochain complex on a filled triangle, a common two-step complex that carries the de Rham coboundary and the nilpotent BRST charge of string quantization at once, and finally the closed surface, with its second incidence matrix read directly off the figure. Each rung's defining law — that applying the boundary twice yields nothing — is a single nilpotency wearing several masks: a finite incidence matrix that one can run, a categorical chain complex, and the smooth de Rham complex on differential forms. We draw the boundary between the masks we compute and the smooth mask we only point at, and we make that boundary an explicit object rather than a hopeful gesture. The closed-surface scaffold is a discrete shadow of a string worldsheet, honest about exactly where the shadow stops. All statements are checked in Lean 4; the load-bearing finite theorems use no axioms beyond the type theory itself. Published by The Institute for Applied Ontological Mathematics.