Encyclopedia Foundation Foundation Primitive Recognition Calculus Prcone Primitive Endpoint Eq Left Or R

ARTICLE 2 claims 2 theorems

Foundation Primitive Recognition Calculus Prcone Primitive Endpoint Eq Left Or R

A distinction has exactly two sides, and the framework's library proves this is the only possibility for its primitive act of recognition.

The two endpoints

A distinction is the smallest possible act of recognition: it marks off one thing from another. In the Recognition Science framework, this primitive act generates a type with exactly two endpoints, named left and right. The declaration endpoint_eq_left_or_right is a machine-checked theorem stating that every endpoint is either the left one or the right one. There is no third option, no middle state, and no endpoint that fails to be one of the two. This is not an assumption the framework adds; it is a consequence of how the act-generated structure is built, proved by structural recursion on the constructors.

The theorem matters because it underpins the framework's claim that comparison is derived, not primitive. A distinction gives you two endpoints, and the judgment of whether two endpoints are the same or different is then computed from that structure alone. The library proves that for any admissible judgment that is tight and separating, the same-relation is forced to be the decidable equality carried by the act-generated type. In plain words: once you have a distinction with two sides, the ability to compare those sides follows automatically, without needing a second independent primitive for comparison.

What the theorem does not claim is equally important. It does not say that the framework has proved anything about the physical world, about space, time, or any empirical content. It is a structural fact about a freely generated type with two constructors. It does not claim that all distinctions in nature have exactly two endpoints, nor that the framework's primitive act of recognition is the only way to form a distinction. The theorem is a formal statement about the framework's own primitive calculus, not a claim about any particular physical system.

The payoff is that the framework can build its later results, such as the forced cost function and the golden ratio, on a foundation where the basic act of recognition is genuinely minimal: one act, two endpoints, and comparison derived from the act itself. This theorem is the first step in showing that the framework's primitive is not hiding an unexamined assumption about how to tell things apart.

THEOREM endpoint_eq_left_or_right · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCOnePrimitive.lean
/-- A distinction has exactly two endpoints. -/
theorem endpoint_eq_left_or_right (e : Endpoint) :
    e = Endpoint.left ∨ e = Endpoint.right := by
  obtain ⟨s⟩ := e
  cases s with
  | left => exact Or.inl rfl
  | right => exact Or.inr rfl
THEOREM comparison_is_derived_not_primitive · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCOnePrimitive.lean
/-- **Item 5 resolution.** Recognition is one primitive. For any judgment that is
an equivalence (the admissibility fields), tight, and separating, the `same`
relation is forced to be the decidable equality carried by the act-generated
structure. Hence the same/different judgment is derived from the act, not an
independent second primitive. -/
theorem comparison_is_derived_not_primitive
    (J : TraceJudgment)
    (htight : ∀ (T : Trace) (a b : Endpoint), J.diff T a b ↔ ¬ J.same T a b)
    (hsep : ∀ T : Trace, J.diff T Endpoint.left Endpoint.right) :
    ∀ (T : Trace) (a b : Endpoint),
      (J.same T a b ↔ a = b)
        ∧ (J.same T a b ↔ actJudgment.same T a b) := by
  intro T a b
  have h := genuine_judgment_same_is_equality J htight hsep T a b
  exact ⟨h, h.trans (actJudgment_same T a b).symm⟩

What this page does not claim

The theorem does not claim that all distinctions in nature have exactly two endpoints. It does not claim that the framework's primitive act is the only way to form a distinction. It does not claim anything about empirical physics or the physical world.

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/PRCOnePrimitive.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:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND