Encyclopedia Foundation Foundation Primitive Recognition Calculus Prcinevitability Instances Peano Syste
ARTICLE 3 claims 3 theorems
Foundation Primitive Recognition Calculus Prcinevitability Instances Peano Syste
Peano arithmetic's first distinction, that 0 and 1 are different, already contains the minimal recognition core that Recognition Science builds on.
The arithmetic seed
Peano arithmetic begins with a simple act of separation: the number zero is not the number one. The declaration peanoSystem_embeds_delta takes this single fact, that 0 and 1 are distinct, and proves that the entire structure of natural numbers with this distinction contains a copy of the recognition calculus, the framework's minimal system for telling things apart. In plain terms, the theorem says that the most basic arithmetic foundation already carries the essential machinery for recognition, the process by which a system marks one thing as different from another.
The proof works by building a formal system, a mathematical structure with tokens, expressions, and a way to distinguish them, from the natural numbers. The tokens are all natural numbers, the expressions are their lengths, and the distinguishing operation is simply inequality. Since 0 and 1 are distinct, this system can tell its two endpoints apart, and that ability is enough to embed the entire recognition calculus into it. The machine-checked library of formal theorems confirms this embedding exists, meaning the result is not a matter of argument but of verified proof.
This is one of four concrete instances showing the same pattern. The logical carrier with true and false, the set-theoretic empty set versus its singleton, and the type-theoretic two-element type all exhibit the same two-token separation. The arithmetic case matters because it shows the distinction is not an artifact of logic or set theory alone; it appears wherever two primitives can be told apart, including in the natural numbers themselves. The theorem named_foundations_embed_delta bundles all four embeddings together, confirming that the primitive distinction is a common thread across foundations.
The declaration does not claim that Peano arithmetic is identical to the recognition calculus, nor that it fully parses the foundation. It establishes only that a copy of the recognition core exists inside the arithmetic system, not that the two are equivalent or that one reduces to the other. The embedding is a structural inclusion, not a complete translation. What the theorem changes is the understanding of where recognition begins: not as an added layer on top of mathematics, but as something already present in the first distinction arithmetic makes.
THEOREM peanoSystem_embeds_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
theorem peanoSystem_embeds_delta : Nonempty (PRCEmbeddingInto peanoSystem) :=
two_distinct_realizes_delta (0 : ℕ) 1 (by decide)
THEOREM peanoSystem · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
/-- Arithmetic foundation: the natural-number object's `0 ≠ 1`, the first
distinction Peano arithmetic makes. -/
def peanoSystem : FormalSystem := ofTwoDistinct (0 : ℕ) 1 (by decide)
THEOREM named_foundations_embed_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
/-- **Item 4, widened.** Four structurally different foundations, the logical
two-valued carrier, the arithmetic `0 ≠ 1`, the set-theoretic `∅ ≠ {∅}`, and the
type-theoretic `𝟚`, each realize the δ core. The primitive distinction is not an
artifact of one foundation's notation; it appears wherever two primitives can be
told apart. -/
theorem named_foundations_embed_delta :
Nonempty (PRCEmbeddingInto boolLogicSystem)
∧ Nonempty (PRCEmbeddingInto peanoSystem)
∧ Nonempty (PRCEmbeddingInto setFoundationSystem)
∧ Nonempty (PRCEmbeddingInto typeTheorySystem) :=
⟨boolLogicSystem_embeds_delta, peanoSystem_embeds_delta,
setFoundationSystem_embeds_delta, typeTheorySystem_embeds_delta⟩
What this page does not claim
Peano arithmetic is not identical to the recognition calculus, only that it contains a copy of it. The embedding does not provide a complete translation of arithmetic into recognition terms. The theorem does not claim that arithmetic is the only or primary foundation for recognition.
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/PRCInevitabilityInstances.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:
- Does the embedding extend to a full faithful parse of Peano arithmetic, or does it only cover the two-token separation?
- What additional structure beyond two distinct primitives is needed to realize the full recognition calculus rather than just its delta core?
- How does the recognition calculus embedding into arithmetic relate to the forcing chain that derives the golden ratio and three dimensions?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM peanoSystem_embeds_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
theorem peanoSystem_embeds_delta : Nonempty (PRCEmbeddingInto peanoSystem) := two_distinct_realizes_delta (0 : ℕ) 1 (by decide)The declaration peanoSystem_embeds_delta proves that the natural numbers with the distinction between 0 and 1 contain a copy of the recognition calculus. peanoSystem_embeds_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.leanTHEOREM peanoSystem · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
/-- Arithmetic foundation: the natural-number object's `0 ≠ 1`, the first distinction Peano arithmetic makes. -/ def peanoSystem : FormalSystem := ofTwoDistinct (0 : ℕ) 1 (by decide)The proof builds a formal system from the natural numbers where tokens are numbers, expressions are lengths, and distinguishing is inequality. peanoSystem · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.leanTHEOREM named_foundations_embed_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean
/-- **Item 4, widened.** Four structurally different foundations, the logical two-valued carrier, the arithmetic `0 ≠ 1`, the set-theoretic `∅ ≠ {∅}`, and the type-theoretic `𝟚`, each realize the δ core. The primitive distinction is not an artifact of one foundation's notation; it appears wherever two primitives can be told apart. -/ theorem named_foundations_embed_delta : Nonempty (PRCEmbeddingInto boolLogicSystem) ∧ Nonempty (PRCEmbeddingInto peanoSystem) ∧ Nonempty (PRCEmbeddingInto setFoundationSystem) ∧ Nonempty (PRCEmbeddingInto typeTheorySystem) := ⟨boolLogicSystem_embeds_delta, peanoSystem_embeds_delta, setFoundationSystem_embeds_delta, typeTheorySystem_embeds_delta⟩The same embedding holds for the logical carrier, the set-theoretic empty set versus singleton, and the type-theoretic two-element type. named_foundations_embed_delta · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCInevitabilityInstances.lean