Encyclopedia Foundation Foundation Primitive Recognition Calculus Prcone Primitive Act Judgment Diff

ARTICLE 3 claims 3 theorems

Foundation Primitive Recognition Calculus Prcone Primitive Act Judgment Diff

In Recognition Science, the act of comparing two things is not a separate primitive: it is a consequence of the act's own structure.

The derived judgment

Recognition Science starts from a single primitive: an act that produces a trace, a discrete record of events. From that act alone, the framework derives the ability to compare two endpoints and declare them the same or different. The declaration actJudgment_diff is the formal statement of the "different" side: it establishes that the judgment of difference is exactly the logical negation of equality. In plain terms, if the act-generated structure says two endpoints are not equal, then they are different, and vice versa. This is not a definitional choice; it is a proved theorem in the framework's machine-checked library of formal theorems.

The significance is that comparison does not require a second, independent primitive. The framework proves that any judgment satisfying three plain conditions, that it is an equivalence relation, that "same" and "different" are exact opposites, and that the two endpoints are always separated, is forced to be the decidable equality carried by the act-generated structure. The theorem comparison_is_derived_not_primitive states this directly: the same/different judgment is derived from the act, not an additional assumption. This resolves a foundational question: how many primitives does recognition require? The answer, within the framework, is one.

The classical analogue is the distinction between a set and its equality relation. In ordinary mathematics, equality is often taken as given, a logical primitive. Here, equality is shown to be constructible from the act's inductive structure. The framework models recognition as a freely generated type with two endpoints, left and right, and the comparison judgment is computed by structural recursion on that type. The theorem actJudgment_same establishes the "same" side: it is exactly equality. Together, the two theorems give a complete, decidable comparison apparatus with no extra primitive.

What this does not claim is broader. It does not claim that all of mathematics reduces to this one act, nor that the act's structure is the only possible foundation for comparison. It does not claim that the judgment is primitive or assumed; the whole point is that it is derived. It also does not claim that the act itself is observable or that the trace is a physical object. The framework's claim is narrower: given the act-generated structure, comparison is forced, not chosen.

THEOREM actJudgment_diff · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCOnePrimitive.lean
theorem actJudgment_diff (T : Trace) (a b : Endpoint) :
    actJudgment.diff T a b ↔ a ≠ b := Iff.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⟩
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

All of mathematics reduces to this one act. The act's structure is the only possible foundation for comparison. The act itself is observable or the trace is a physical object.

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