Encyclopedia Foundation Foundation Existence Uniqueness From Cost Cost Zero Set Has One Member
ARTICLE 3 claims 3 theorems
Foundation Existence Uniqueness From Cost Cost Zero Set Has One Member
In Recognition Science, only one positive number can carry a recognition cost of zero: the number one itself.
The single zero-cost point
A cost function assigns a price to every comparison. In the Recognition Science framework, the cost of recognizing one positive number as another is written J(x), where x is the ratio of the two numbers. The framework's central result, proved in a machine-checked library of formal theorems, is that this cost must take the form J(x) = (x + 1/x)/2 - 1. The question this page answers is simpler: which positive numbers, if any, have a cost of exactly zero? The answer, proved as the theorem cost_zero_set_has_one_member, is that only the number 1 does.
That conclusion is the uniqueness half of a larger existence claim. The framework's earlier work showed that J(x) = 0 if and only if x = 1, which already says the zero-cost set contains 1 and nothing else. The companion theorem makes the uniqueness explicit: if two positive numbers x and y both have J-cost zero, then x = y. The proof is short and runs through the earlier singleton result. A supporting theorem, jcost_isolated_from_zero, adds that any positive number other than 1 has strictly positive cost, so the zero is not merely unique but isolated: there is no cluster of near-zero-cost points around it.
The framework reads this as a structural fact about recognition itself. Existence is not plural: there cannot be two distinct cost minima on the positive real line. The cost function has one and only one place where it touches zero, and that place is the neutral point where the two numbers being compared are equal. The isolation property matters for stability: small perturbations away from 1 do not produce nearly free recognitions, they produce recognitions with a cost bounded away from zero.
What the theorem does not claim is equally important. It does not say that recognition events are impossible at other ratios, only that they are never free. It does not assign physical meaning to the number 1 beyond being the ratio of a number to itself; it is a statement about the cost function's shape, not about which objects exist in the world. The theorem also does not derive the cost function itself. It assumes the form J(x) = (x + 1/x)/2 - 1 and proves facts about that form. The derivation of the form from first principles is a separate, earlier result in the framework.
THEOREM cost_zero_set_singleton · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean
/-- The cost-zero set is exactly {1}. -/
theorem cost_zero_set_singleton :
∀ x : ℝ, 0 < x → (Jcost x = 0 ↔ x = 1) := by
intro x hx
constructor
· intro h
by_contra hne
exact absurd h (ne_of_gt (Jcost_pos_of_ne_one x hx hne))
· rintro rfl; exact Jcost_unit0
THEOREM cost_zero_set_has_one_member · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean
/-- The cost-zero set in ℝ+ has cardinality 1 (in the sense that any two
members are equal). -/
theorem cost_zero_set_has_one_member {x y : ℝ}
(hx : 0 < x) (hy : 0 < y)
(hJx : Jcost x = 0) (hJy : Jcost y = 0) :
x = y := by
rw [(cost_zero_set_singleton x hx).mp hJx,
(cost_zero_set_singleton y hy).mp hJy]
THEOREM jcost_isolated_from_zero · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean
/-- Away from 1, J-cost is strictly positive (isolation). -/
theorem jcost_isolated_from_zero {x : ℝ} (hx : 0 < x) (hne : x ≠ 1) :
0 < Jcost x := Jcost_pos_of_ne_one x hx hne
What this page does not claim
The theorem does not derive the cost function J; it assumes the form and proves properties of it. The theorem does not say recognition events are impossible at other ratios, only that they are never free. The theorem does not assign physical existence to the number 1 beyond being the ratio of a number to itself.
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/ExistenceUniquenessFromCost.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:
- How does the uniqueness of the zero-cost point relate to the uniqueness of the cost function itself?
- What does the isolation property imply for the stability of recognition dynamics near the neutral point?
- Does the singleton zero-cost set generalize to other cost functions that satisfy the framework's axioms?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM cost_zero_set_singleton · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean
/-- The cost-zero set is exactly {1}. -/ theorem cost_zero_set_singleton : ∀ x : ℝ, 0 < x → (Jcost x = 0 ↔ x = 1) := by intro x hx constructor · intro h by_contra hne exact absurd h (ne_of_gt (Jcost_pos_of_ne_one x hx hne)) · rintro rfl; exact Jcost_unit0only the number 1 does cost_zero_set_singleton · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.leanTHEOREM cost_zero_set_has_one_member · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean
/-- The cost-zero set in ℝ+ has cardinality 1 (in the sense that any two members are equal). -/ theorem cost_zero_set_has_one_member {x y : ℝ} (hx : 0 < x) (hy : 0 < y) (hJx : Jcost x = 0) (hJy : Jcost y = 0) : x = y := by rw [(cost_zero_set_singleton x hx).mp hJx, (cost_zero_set_singleton y hy).mp hJy]if two positive numbers x and y both have J-cost zero, then x = y cost_zero_set_has_one_member · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.leanTHEOREM jcost_isolated_from_zero · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean
/-- Away from 1, J-cost is strictly positive (isolation). -/ theorem jcost_isolated_from_zero {x : ℝ} (hx : 0 < x) (hne : x ≠ 1) : 0 < Jcost x := Jcost_pos_of_ne_one x hx hneany positive number other than 1 has strictly positive cost jcost_isolated_from_zero · IndisputableMonolith/Foundation/ExistenceUniquenessFromCost.lean