Foundation Logic Realization Has Identity Step Of Nontrivial

The identity step

In mathematics, a monoid is a set with an associative operation and an identity element. The Recognition Science framework begins with a more abstract object: a ledger, a discrete record of comparison events, which carries a cost of recognition between any two entries. The framework's library, a machine-checked collection of formal theorems, defines a realization of this ledger as a carrier set together with a comparison cost, an identity element, and a step action that generates new entries.

The declaration hasIdentityStep_of_nontrivial proves a simple fact about any such realization: if the carrier set has more than one element, then there exists an entry whose comparison cost against the identity is non-zero. In plain language, a non-trivial system of comparisons must contain a distinct starting point, an element that is not identical to the zero of the system. This is a theorem in the framework's library, proved from the definition of non-triviality alone, with no additional assumptions about the topology, order, or algebraic structure of the carrier.

The result matters because it guarantees that the identity-step shadow, the data of the identity and the generating step, is always present in a non-trivial realization. This shadow is the raw material from which the framework extracts arithmetic: the step action, applied repeatedly to the identity, generates a sequence of entries that behaves like the natural numbers. The theorem ensures this extraction is always possible, for any non-trivial setting, whether the carrier is continuous, discrete, or categorical.

What the theorem does not claim is that this extracted arithmetic is faithful, that is, that distinct steps in the sequence correspond to distinct elements of the carrier. A separate structure, FaithfulArithmeticInterpretation, is required for that, and it is not guaranteed by non-triviality alone. Periodic realizations, such as modular carriers, can have a free internal orbit while the carrier interpretation is periodic. The theorem also does not claim that the identity step is unique, nor that the comparison cost satisfies any particular functional equation; it only establishes the existence of a non-zero comparison against the identity.

Within the framework, this small lemma is a load-bearing step in the Universal Forcing program, which aims to derive physical constants from the structure of recognition. It shows that the seed of arithmetic, the identity and the step, is forced by the mere assumption that the ledger is not trivial. The theorem is a foundation stone, not a finished building; it opens the door to extracting arithmetic, but the faithfulness of that extraction, and the laws that govern the comparison cost, are separate questions that the framework addresses elsewhere.

theorem hasIdentityStep_of_nontrivial (R : LogicRealization) :
    R.hasIdentityStep :=
  R.nontrivial

theorem hasIdentityStep_of_nontrivial (R : LogicRealization) :
    R.hasIdentityStep :=
  R.nontrivial

What this page does not claim

The extracted arithmetic is faithful in the carrier. The identity step is unique for a given realization. The comparison cost satisfies any particular functional equation.

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