Encyclopedia Foundation Foundation Ontology Predicates Rs Exists Iff Law Exists
ARTICLE 4 claims 3 theorems 1 model
Foundation Ontology Predicates Rs Exists Iff Law Exists
In Recognition Science, the statement 'x exists' is not a primitive assumption but a verdict delivered by a cost-minimization process.
Existence as a selection outcome
In ordinary mathematics, existence is a primitive notion: a number exists because the axioms say it does. Recognition Science (RS) replaces that picture with a selection rule. The framework's central object is a ledger, a discrete record of recognition events, and each event carries a forced cost, a number measuring how far a configuration is from perfect self-consistency. The theorem rs_exists_iff_law_exists states that a real number x is recognized as existing, written RSExists x, exactly when it satisfies the Law of Existence. In plain terms: to exist in this framework is to be a stable configuration under the cost function, one whose defect collapses to zero.
The definition is precise. The declaration RSExists x is defined as the conjunction of two conditions: x is positive, and its defect, the cost value J(x), equals zero. The theorem rs_exists_unique_one then proves that the only positive real number with zero defect is 1. The cost function J(x) = (x + 1/x)/2 - 1 has a unique minimum at x = 1, where J(1) = 0. So the framework's existence predicate is not an empty formalism: it has exactly one inhabitant. The number 1 exists, and nothing else positive does. This is a proved theorem in the machine-checked library of formal theorems, not a philosophical preference.
The declaration also connects existence to the framework's meta-principle, the statement that nothing cannot recognize itself. The theorem nothing_unbounded_defect proves that as x approaches zero from above, the defect grows without bound: for any finite cost ceiling C, there is a small positive x whose defect exceeds C. The point 0 itself is not selectable because its defect is infinite. This turns a metaphysical slogan into a derived consequence of the cost structure. The framework does not assume that nothing fails to exist; it proves that nothing cannot be selected.
What the declaration does not claim is equally important. It does not claim that the number 1 is the only thing that exists in the ordinary physical sense. The predicate RSExists is a formal selection outcome, not a complete ontology. The framework also defines RSReal, which adds a discreteness condition: a real number is real in this sense if it exists and lies on the phi-ladder, the set of powers of the golden ratio. The theorem rs_real_one shows that 1 is real in this richer sense, but the declaration itself is silent on what else might qualify. It also does not claim that existence is a matter of human choice or convention. The cost function is forced by five plain conditions, and the uniqueness of 1 follows from that forcing, not from a decision to make it so.
The practical upshot is a testable criterion. Given any candidate configuration, compute its defect under J. If the defect is zero, the configuration exists in the framework's sense; if not, it does not. This turns a philosophical question into a calculation. The framework's library proves the relevant facts: J(2) = 1/4, J(4) = 9/8, J(1/2) = 1/4, and so on, none of which are zero. The only zero is at 1. That is the whole content of the declaration, and it is exactly what it establishes.
MODEL RSExists · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- **RSExists**: A value x exists in the RS sense if:
1. x > 0 (positive configuration)
2. defect(x) = 0 (stable under J-cost)
This is the operational definition of "existence" in RS.
It's not assumed - it's the result of selection by cost minimization. -/
def RSExists (x : ℝ) : Prop := 0 < x ∧ defect x = 0
THEOREM rs_exists_unique_one · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- The only RSExistent value is 1. -/
theorem rs_exists_unique_one : ∀ x : ℝ, RSExists x ↔ x = 1 := by
intro x
constructor
· intro ⟨hpos, hdef⟩
exact (defect_zero_iff_one hpos).mp hdef
· intro hx
rw [hx]
exact ⟨by norm_num, defect_at_one⟩
THEOREM nothing_unbounded_defect · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- For any threshold, sufficiently small positive values have defect exceeding it.
This means "approaching nothing" has unbounded cost. -/
theorem nothing_unbounded_defect :
∀ C : ℝ, ∃ ε > 0, ∀ x, 0 < x → x < ε → C < defect x :=
nothing_cannot_exist
THEOREM rs_real_one · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- Unity is RSReal (trivially, as φ⁰ · φ⁰ = 1). -/
theorem rs_real_one : RSReal 1 := by
constructor
· exact rs_exists_one
· use 0, 0
simp [PhiForcing.φ]
What this page does not claim
The declaration does not claim that the number 1 is the only thing that exists in the ordinary physical sense. The declaration does not claim that existence is a matter of human choice or convention. The declaration does not claim that the meta-principle is a pre-logical axiom; it is a derived consequence.
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/OntologyPredicates.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 physical configurations, if any, correspond to the formal existence predicate RSExists?
- How does the phi-ladder condition in RSReal relate to the discrete spectrum of particle masses?
- Does the framework's selection rule for truth, RSTrue, mirror the existence rule in a provable way?
- What would it take to show that the framework's existence predicate applies to a concrete physical system?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
MODEL RSExists · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- **RSExists**: A value x exists in the RS sense if: 1. x > 0 (positive configuration) 2. defect(x) = 0 (stable under J-cost) This is the operational definition of "existence" in RS. It's not assumed - it's the result of selection by cost minimization. -/ def RSExists (x : ℝ) : Prop := 0 < x ∧ defect x = 0The declaration RSExists x is defined as the conjunction of two conditions: x is positive, and its defect, the cost value J(x), equals zero. RSExists · IndisputableMonolith/Foundation/OntologyPredicates.leanTHEOREM rs_exists_unique_one · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- The only RSExistent value is 1. -/ theorem rs_exists_unique_one : ∀ x : ℝ, RSExists x ↔ x = 1 := by intro x constructor · intro ⟨hpos, hdef⟩ exact (defect_zero_iff_one hpos).mp hdef · intro hx rw [hx] exact ⟨by norm_num, defect_at_one⟩The theorem rs_exists_unique_one proves that the only positive real number with zero defect is 1. rs_exists_unique_one · IndisputableMonolith/Foundation/OntologyPredicates.leanTHEOREM nothing_unbounded_defect · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- For any threshold, sufficiently small positive values have defect exceeding it. This means "approaching nothing" has unbounded cost. -/ theorem nothing_unbounded_defect : ∀ C : ℝ, ∃ ε > 0, ∀ x, 0 < x → x < ε → C < defect x := nothing_cannot_existThe theorem nothing_unbounded_defect proves that as x approaches zero from above, the defect grows without bound. nothing_unbounded_defect · IndisputableMonolith/Foundation/OntologyPredicates.leanTHEOREM rs_real_one · IndisputableMonolith/Foundation/OntologyPredicates.lean
/-- Unity is RSReal (trivially, as φ⁰ · φ⁰ = 1). -/ theorem rs_real_one : RSReal 1 := by constructor · exact rs_exists_one · use 0, 0 simp [PhiForcing.φ]The theorem rs_real_one shows that 1 is real in this richer sense. rs_real_one · IndisputableMonolith/Foundation/OntologyPredicates.lean