IndisputableMonolith.RecogGeom.Examples
This module supplies concrete examples of configuration spaces in Recognition Geometry, taking the form of finite sets Fin n for n ≥ 2. Researchers constructing discrete recognizers or testing indistinguishability relations would cite these examples to instantiate the abstract framework. The module consists of definitions and small lemmas that apply the imported core, recognizer, indistinguishability, and quotient constructions to the finite case.
claimConfiguration space $C$ is the finite set $C = $ Fin $n$ for integer $n$ with $n$ ≥ 2, equipped with a recognizer $R: C → E$ and the induced indistinguishability relation whose quotient yields the recognition cells.
background
Recognition Geometry treats space as emergent from recognition maps rather than primitive. The Core module supplies the basic types for configurations and events. The Recognizer module defines a recognition map $R: C → E$ that sends configurations to observable events. The Indistinguishable module introduces the equivalence relation of indistinguishability, whose classes are the resolution cells. The Quotient module forms the recognition quotient $C_R = C / {∼}$. The Examples module instantiates these objects on the finite set Fin n with n ≥ 2 distinct configurations.
proof idea
This is a definition module, no proofs. It assembles the imported modules into explicit finite examples and records a handful of elementary lemmas that verify the expected relations hold on Fin n.
why it matters in Recognition Science
The module supplies the discrete test cases required by the Integration module, which assembles all Recognition Geometry components into a complete framework summary. It directly supports the finite-configuration illustrations needed to connect the abstract axioms RG2 and RG3 to concrete models.
scope and limits
- Does not treat continuous or infinite configuration spaces.
- Does not derive new general theorems beyond the imported modules.
- Does not address the forcing chain or Recognition Science constants.
- Does not provide numerical simulations or physical interpretations.
used by (1)
depends on (4)
declarations in this module (21)
-
instance
finConfigSpace -
def
discreteRecognizer -
theorem
discrete_indist_iff_eq -
theorem
discrete_singleton_cells -
inductive
Sign -
def
signOf -
def
signRecognizer -
theorem
sign_indistinguishable -
theorem
neg_indist -
theorem
neg_pos_dist -
theorem
zero_pos_dist -
def
magnitudeRecognizer -
theorem
magnitude_indistinguishable -
theorem
plus_minus_indist -
theorem
diff_magnitude_dist -
theorem
sign_distinguishes_3_neg3 -
theorem
magnitude_indist_3_neg3 -
theorem
sign_indist_3_5 -
theorem
magnitude_distinguishes_3_5 -
theorem
composition_refines -
def
examples_status