Encyclopedia Foundation Foundation Primitive Recognition Calculus Grow Ratio Orbit Lt Trichotomy Lt Q
ARTICLE 4 claims 3 theorems 1 model
Foundation Primitive Recognition Calculus Grow Ratio Orbit Lt Trichotomy Lt Q
A formal definition of "less than" for growth ratios, proved to behave like ordinary number ordering.
The order on ratio orbits
In mathematics, an order relation lets you compare two objects and say which comes first. The declaration ltQ defines such a relation for a specific kind of object: a ratio orbit, which is a sequence of ratios generated by repeated growth steps in a discrete ledger, a record of events where each step multiplies the previous value by some factor. The definition is plain: one orbit is less than another when it is at most the other, and the two are not equal. Formally, ltQ p q means leQ p q and not crossEq p q, where leQ is the existing "at most" relation and crossEq is the equality relation between orbits.
The key result is a trichotomy theorem: for any two ratio orbits p and q, exactly one of three things holds: p is less than q, p equals q, or q is less than p. This mirrors the familiar property of real numbers, where any two numbers are either less, equal, or greater. The theorem is proved in the machine-checked library of formal theorems, and it relies on two supporting facts: the "less than" relation is irreflexive, meaning no orbit is less than itself, and equality between orbits is decidable, meaning a computer can always determine whether two orbits are equal. These together give a total order on ratio orbits, a structure where every pair is comparable.
The trichotomy matters because it turns a collection of growth processes into a well-behaved sequence. With a total order, one can sort orbits, find minima and maxima, and reason about limits in a principled way. This is a stepping stone in the framework's larger project of deriving physical structure from recognition events, but the declaration itself is purely combinatorial: it establishes an ordering property, not any physical law.
What ltQ does not claim is equally important. It does not assert that this order corresponds to numerical magnitude of the ratios themselves; the relation is defined on orbits, not on the individual ratio values. It does not claim that the order is dense, complete, or well-founded, only that it is total. And it does not derive any physical consequence, such as the golden ratio or the number of dimensions; those results live elsewhere in the framework and are not part of this declaration.
MODEL ltQ · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
def ltQ (p q : RatioOrbit) : Prop := leQ p q ∧ ¬ RatioOrbit.crossEq p q
THEOREM ltQ_trichotomy · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
theorem ltQ_trichotomy (p q : RatioOrbit) :
ltQ p q ∨ RatioOrbit.crossEq p q ∨ ltQ q p := by
cases' leQ_total p q with hpq hqp
· by_cases heq : RatioOrbit.crossEq p q
· exact Or.inr (Or.inl heq)
· exact Or.inl ⟨hpq, heq⟩
· by_cases heq : RatioOrbit.crossEq q p
· exact Or.inr (Or.inl (RatioOrbit.crossEq_symm heq))
· exact Or.inr (Or.inr ⟨hqp, heq⟩)
THEOREM ltQ_irrefl · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
theorem ltQ_irrefl (p : RatioOrbit) : ¬ ltQ p p := by
intro h
exact h.2 (RatioOrbit.crossEq_refl p)
THEOREM crossEq_decidable · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
instance crossEq_decidable (a b : RatioOrbit) : Decidable (RatioOrbit.crossEq a b) := by
unfold RatioOrbit.crossEq
infer_instance
What this page does not claim
This declaration does not claim that the order on ratio orbits corresponds to the numerical magnitude of the ratios themselves. This declaration does not claim that the order is dense, complete, or well-founded. This declaration does not derive any physical consequence such as the golden ratio or the number of spatial dimensions.
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/Grow/RatioOrbitLtTrichotomy.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:
- What is the definition of the leQ relation on ratio orbits, and how does it compare orbits step by step?
- How does the total order on ratio orbits support later derivations of physical constants in the framework?
- What are the exact axioms that the machine-checked library uses to prove the trichotomy theorem?
- Does the total order extend to a well-order, allowing induction on ratio orbits?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
MODEL ltQ · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
def ltQ (p q : RatioOrbit) : Prop := leQ p q ∧ ¬ RatioOrbit.crossEq p qThe declaration ltQ defines a relation on ratio orbits: one orbit is less than another when it is at most the other, and the two are not equal. ltQ · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.leanTHEOREM ltQ_trichotomy · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
theorem ltQ_trichotomy (p q : RatioOrbit) : ltQ p q ∨ RatioOrbit.crossEq p q ∨ ltQ q p := by cases' leQ_total p q with hpq hqp · by_cases heq : RatioOrbit.crossEq p q · exact Or.inr (Or.inl heq) · exact Or.inl ⟨hpq, heq⟩ · by_cases heq : RatioOrbit.crossEq q p · exact Or.inr (Or.inl (RatioOrbit.crossEq_symm heq)) · exact Or.inr (Or.inr ⟨hqp, heq⟩)The trichotomy theorem proves that for any two ratio orbits, exactly one of three things holds: one is less than the other, they are equal, or the other is less than the first. ltQ_trichotomy · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.leanTHEOREM ltQ_irrefl · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
theorem ltQ_irrefl (p : RatioOrbit) : ¬ ltQ p p := by intro h exact h.2 (RatioOrbit.crossEq_refl p)The relation is irreflexive, meaning no ratio orbit is less than itself. ltQ_irrefl · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.leanTHEOREM crossEq_decidable · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean
instance crossEq_decidable (a b : RatioOrbit) : Decidable (RatioOrbit.crossEq a b) := by unfold RatioOrbit.crossEq infer_instanceEquality between ratio orbits is decidable, meaning a computer can always determine whether two orbits are equal. crossEq_decidable · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/Grow/RatioOrbitLtTrichotomy.lean