finConfigSpace
plain-language theorem explainer
Fin n for positive n instantiates the ConfigSpace class in recognition geometry by supplying a finite nonempty set of states. Discrete modelers cite this to realize the abstract configuration space concretely in examples. The definition is a one-line wrapper exhibiting the element 0 as witness for nonemptiness.
Claim. For any positive integer $n$, the finite set $Fin(n)$ forms a configuration space witnessed by the element $0$.
background
Recognition Geometry defines a configuration space as any type equipped with a nonempty predicate, per the Core module. This minimal structure supports the existence of configurations without yet specifying joins or consistency. The module develops concrete examples beginning with discrete recognition on Fin n, where every configuration is distinguishable and the quotient is isomorphic to the original space. Upstream, the ConfigSpace class from CostFromDistinction adds a commutative monoid structure with join, consistency, and independence, while the identity event from ObserverForcing sits at minimal J-cost.
proof idea
This is a one-line wrapper that supplies the witness 0 for the Nonempty instance of Fin n.
why it matters
This declaration populates the discrete recognition example in the Recognition Geometry module. It supports the module insight that the quotient is isomorphic to the original space for the discrete case, contrasting with sign and magnitude recognizers on integers. It provides a finite model relevant to the Recognition Composition Law and the forcing chain steps that derive spatial dimensions from self-similar fixed points.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.