Encyclopedia Foundation Foundation Primitive Recognition Calculus Prccategory Theory Parse Topos System
ARTICLE 3 claims 3 theorems
Foundation Primitive Recognition Calculus Prccategory Theory Parse Topos System
A machine-checked theorem shows that the mathematical universe used by Recognition Science has at least two distinct truth values, so it is not a trivial one-point system.
What non-degeneracy means
In mathematics, a topos is a category that behaves like the category of sets, with objects as sets and arrows as functions. A topos has a special object called the subobject classifier, which plays the role of truth values. In the topos of sets, that classifier is the type of propositions, with two global points: true and false. A topos is called degenerate if those two truth values are actually the same, which collapses the whole structure into a single trivial point.
The theorem toposSystem_not_degenerate proves, in the machine-checked library of formal theorems, that the topos of sets is not degenerate: true is not equal to false. This is not a new discovery about logic; it is a formal verification that the standard two-valued logic is consistent with the framework's requirements. The proof works by showing that this topos realizes the δ core, a minimal structure of distinct tokens and ordered expressions, and any system that realizes that core cannot be degenerate.
In Recognition Science, this declaration matters because the framework's foundational system needs at least two distinguishable outcomes to record a recognition event. If true and false were the same, the whole ledger of distinctions would collapse. The theorem guarantees that the categorical foundation is expressive enough to support the framework's primitive recognition calculus. It does not claim that the topos of sets is the only such foundation, nor that it is the intended physical model; it only establishes a minimal consistency condition.
The declaration also packages several related facts: the subobject classifier classifies the whole terminal object as true, the empty subobject as false, and the two are distinct. Together these form a single proof that the category-theoretic parse realizes the δ core. The practical upshot is that the framework can use ordinary set-theoretic logic without fear of triviality, at least at this foundational level.
THEOREM toposSystem_not_degenerate · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
theorem toposSystem_not_degenerate : ¬ DistinctionDichotomy.Degenerate toposSystem :=
DistinctionDichotomy.not_degenerate_of_realizesDelta toposSystem toposSystem_embeds_delta
THEOREM toposSystem_embeds_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
/-- **The categorical foundation contains the δ core.** -/
theorem toposSystem_embeds_delta : Nonempty (PRCEmbeddingInto toposSystem) :=
FormalSystemEmbeddingTarget_proved toposSystem toposSystem_expressive
THEOREM category_theory_realizes_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
/-- **The faithful parse, packaged.** The topos of sets has a two-point subobject
classifier Ω = Prop classifying the subobjects of the terminal object, its two
truth values are distinct (non-degeneracy), and the foundation realizes the δ
core. -/
theorem category_theory_realizes_delta :
subobjectClassification (fun _ => True) = True
∧ subobjectClassification (fun _ => False) = False
∧ ((True : Omega) ≠ False)
∧ Nonempty (PRCEmbeddingInto toposSystem) :=
⟨classifies_top, classifies_bot, top_ne_bot, toposSystem_embeds_delta⟩
What this page does not claim
It does not claim that the topos of sets is the only foundation for Recognition Science. It does not claim that the topos of sets is the physical model of reality. It does not claim that true and false being distinct is a new logical discovery; it is a formal verification of standard logic.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- What exactly is the δ core and why does realizing it rule out degeneracy?
- How does the topos of sets relate to the physical recognition ledger?
- What other categorical foundations could also realize the δ core?
- Does non-degeneracy of the topos of sets imply anything about the uniqueness of the cost function J?
- What is the formal definition of the FormalSystem interface that toposSystem instantiates?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM toposSystem_not_degenerate · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
theorem toposSystem_not_degenerate : ¬ DistinctionDichotomy.Degenerate toposSystem := DistinctionDichotomy.not_degenerate_of_realizesDelta toposSystem toposSystem_embeds_deltaThe theorem toposSystem_not_degenerate proves, in the machine-checked library of formal theorems, that the topos of sets is not degenerate: true is not equal to false. toposSystem_not_degenerate · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.leanTHEOREM toposSystem_embeds_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
/-- **The categorical foundation contains the δ core.** -/ theorem toposSystem_embeds_delta : Nonempty (PRCEmbeddingInto toposSystem) := FormalSystemEmbeddingTarget_proved toposSystem toposSystem_expressiveThe proof works by showing that this topos realizes the δ core, a minimal structure of distinct tokens and ordered expressions, and any system that realizes that core cannot be degenerate. toposSystem_embeds_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.leanTHEOREM category_theory_realizes_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean
/-- **The faithful parse, packaged.** The topos of sets has a two-point subobject classifier Ω = Prop classifying the subobjects of the terminal object, its two truth values are distinct (non-degeneracy), and the foundation realizes the δ core. -/ theorem category_theory_realizes_delta : subobjectClassification (fun _ => True) = True ∧ subobjectClassification (fun _ => False) = False ∧ ((True : Omega) ≠ False) ∧ Nonempty (PRCEmbeddingInto toposSystem) := ⟨classifies_top, classifies_bot, top_ne_bot, toposSystem_embeds_delta⟩The subobject classifier classifies the whole terminal object as true, the empty subobject as false, and the two are distinct. category_theory_realizes_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCCategoryTheoryParse.lean