Three Dimensions from a Recognition Requirement

Why does observable space have three dimensions? We prove that a single requirement on the act of recognition admits exactly one answer. A recognition act posts a debit and a matched credit, and we ask that the two halves remain distinguishable once posted: some cycle a recognizer can run must fail to bound in the complement of the locus the recognizer itself traverses. The setting is a recognizer with D jointly independent binary primitives, whose state-transition graph Q_D is realized tamely in a closed, connected, orientable, smooth D-manifold with vanishing first integral homology.

The requirement names no integer and inherits one: a pass sweeps a graph, so its trace is one-dimensional and minimality makes it a circle, and a circle tamely embedded in such a manifold has nonvanishing first complement homology if and only if D = 3: linking of circles is a codimension-two phenomenon. The implication reverses, so the requirement characterizes three-dimensionality: the substrate is an integral homology 3-sphere and the registered distinction is a single integer, the linking number. The structural axioms alone have models in every D >= 2, so the requirement is a genuine input; and the two substrate clauses that carry it, compactness and integral 1-acyclicity, are each sharp: without compactness the requirement holds at D = 2, without acyclicity at D = 4. The stage itself is constructed rather than posited: the recognizer's refinement records are dense in a solid D-cube that is their unique completion, the cube's Hausdorff dimension is D, its cycles all bound, and its compactified interior is S^D, so both substrate clauses hold by construction on that stage while the axioms retain the general class against which each is sharp. Read at process dimension k the same requirement gives D = 2k+1, and two further premises (a recognizer keeps one ledger, and recognition takes the cheapest complete pass) select k = 1: a complete pass costs at least 2^(2k+1) - 1, and the eight steps attained at k = 1 undercut the floor of thirty-one at k = 2 (ninety, once its faces are counted), every higher arity being realized in S^(2k+1). The same principle selects the record: among nonzero linking numbers the cheapest is one unit. Finally, the requirement must be read as a linking class: bare non-contractibility selects no dimension. The combinatorial, arithmetic, and algebraic cores of the argument are machine-verified in the Lean 4 proof assistant, the classical duality inputs entering the verified statements as explicit hypotheses; an appendix maps the statements to the public formal development.