Foundation Ontology Predicates Rs Exists Iff Defect Zero

Existence as a selection outcome

In mathematics, existence is usually a primitive notion: a number exists, a set exists, and that is the end of the matter. Recognition Science (RS) replaces that assumption with a test. Its declaration rs_exists_iff_defect_zero defines existence as a selection outcome: a real number x exists in the RS sense precisely when its defect, a measure of recognition cost, equals zero. The definition is explicit in the framework's library: RSExists x means 0 < x and defect x = 0.

The power of the definition is that it is not empty. The framework's library proves that the only positive real number with zero defect is 1. The theorem rs_exists_unique_one states this directly: for any real x, RSExists x if and only if x = 1. A companion theorem, rs_exists_unique, confirms there is exactly one such value. This is a striking consequence of the cost function J(x) = (x + 1/x)/2 - 1, which the framework derives from five plain conditions. At x = 1, the cost is zero; everywhere else it is positive.

The definition also has a physical flavor. The framework interprets "nothing" as a configuration whose defect is unboundedly large, so it cannot be selected. The theorem nothing_unbounded_defect states that for any finite cost bound C, there is a small positive epsilon such that every x below epsilon has defect greater than C. In plain words, the closer a configuration gets to zero, the more it costs to recognize; only the unit value 1 is stable enough to count as existing.

What the declaration does not claim is just as important. It does not say that the number 1 is the only thing in the universe. It defines a specific technical predicate within RS, and the theorem about uniqueness applies only to that predicate. It does not claim that ordinary mathematical existence collapses to this test; a classical set or a prime number exists in the usual sense regardless of any defect. The declaration also does not assert that the cost function J is the only possible cost function; that uniqueness is a separate theorem in the framework's library, and this declaration merely uses it.

The practical upshot is a vocabulary for talking about stability. When the framework's library says something "exists", it means it is a configuration that survives the recognition process with zero cost. This turns a philosophical question into a computable one, and it gives the number 1 a special status as the unique stable point. For a reader, the takeaway is simple: in RS, existence is not assumed, it is earned, and only the unit earns it.

/-- **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

/-- 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⟩

/-- There exists exactly one RSExistent value. -/
theorem rs_exists_unique : ∃! x : ℝ, RSExists x := by
  use 1
  constructor
  · exact rs_exists_one
  · intro y hy
    exact (rs_exists_unique_one y).mp hy

/-- 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

What this page does not claim

Ordinary mathematical existence is not replaced by this test. The declaration does not prove that the cost function J is the only possible cost function. The number 1 is not claimed to be the only entity in any physical or mathematical universe outside the framework's predicate.

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: