Foundation Primitive Recognition Calculus Prcfull Zfcparse Zf System Expr Reflex

Reflexivity of expressions

In mathematics, a relation is reflexive when every object is related to itself. For a relation that orders expressions by length, reflexivity says that each expression is at most as long as itself, which is trivially true for ordinary numbers. The declaration zfSystem_exprReflexive proves this property for a specific formal system built inside the Recognition Science framework. The framework's ledger, a discrete record of events, uses expressions as tokens and orders them by derivation length. The theorem states that this ordering is reflexive: for every natural number n, n is at most n, which follows directly from the standard reflexivity of the less-than-or-equal relation on natural numbers.

The significance is not the trivial inequality itself but what it enables. In the framework, a formal system that is reflexive is classified as non-degenerate, meaning it falls on the δ side of a dichotomy that separates systems capable of genuine distinction from those that are not. The theorem is one of several that together show the framework's model of full Zermelo-Fraenkel set theory (ZFC) satisfies the axioms and properties needed to realize the δ core, a minimal structure for recognition. The reflexivity property is a small but necessary piece of this larger proof that ZFC, as represented in the framework, is expressive enough to support the framework's foundational claims.

What the declaration does not claim is also important. It does not assert that reflexivity is a deep or surprising property; it is a basic fact about the ordering chosen. It does not claim that the framework's model of ZFC is the only such model, nor that it proves the consistency of ZFC. The theorem is about the formal system's internal ordering, not about the truth of set theory itself. It also does not claim that the framework's representation of ZFC is identical to the standard mathematical presentation; it is a model built from tokens and expressions, with its own definitions of membership and distinction.

In the context of the framework, this reflexivity theorem is a building block. It helps establish that the framework's formal system is non-degenerate, which in turn supports the claim that the framework can model the kind of distinction that recognition requires. Without reflexivity, the ordering would be ill-behaved, and the system might not qualify as a proper ledger. The theorem thus quietly underpins the framework's ability to talk about sets and their differences in a way that is internally consistent.

theorem zfSystem_exprReflexive : DistinctionDichotomy.ExprReflexive zfSystem :=
  fun n => Nat.le_refl n

/-- Full ZFC falls on the δ side of the distinction dichotomy: it is non-degenerate,
hence realizes δ. -/
theorem zfSystem_not_degenerate : ¬ DistinctionDichotomy.Degenerate zfSystem :=
  DistinctionDichotomy.not_degenerate_of_realizesDelta zfSystem zfSystem_embeds_delta

What this page does not claim

The declaration does not prove the consistency of ZFC. The declaration does not claim that the framework's model of ZFC is the only possible model. The declaration does not assert that reflexivity is a deep or surprising property.

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