Foundation Primitive Recognition Calculus Prccompleteness Independence T Not Com

The countable gap

The real number line has a property that makes it the stage for calculus: every set of numbers that has an upper bound also has a least upper bound. This is called order-completeness. It is what separates the real numbers from the rationals, where a set like all numbers whose square is less than 2 has no least upper bound in the system itself. The theorem T_not_complete shows that a specific countable field, called T, a discrete record of values built from the framework's cost function, lacks this property entirely.

The proof is a chain of plain facts. Every proper subfield of the reals fails order-completeness, because it must contain the rationals, and the rationals are dense. Countability forces a subfield to be proper, since the reals are uncountable. The field T is countable, so it is incomplete. The same argument applies to any countable field: none of them can be order-complete. The theorem completeness_is_exactly_the_continuum states this precisely: order-completeness is exactly what uncountability buys.

The framework's library of formal theorems also proves that T is closed under the canonical cost function J(x) = (x + 1/x)/2 - 1, and that J satisfies the genuine cost laws: J(1) = 0, J(x) = J(1/x), and J(x) is nonnegative for positive x. So the incompleteness result does not rest on a weak premise. The theorem completeness_not_forced_by_genuine_cost_laws states that even with these bona fide cost laws in place, T still lacks the least-upper-bound property while the reals have it.

In Recognition Science, the framework's own results place their carriers in countable fields: the constants, the phi-ladder, and the cost dynamics all live countably. Therefore, the carrier the framework uses is never order-complete. Order-completeness is an independent commitment, a strictly stronger assumption that the cost axioms do not force. The theorem proves this independence, and it names what the continuum adds: the least-upper-bound property and nothing less.

/-- The countable cost-closed field `T` lacks the least-upper-bound property. -/
theorem T_not_complete :
    ∃ S : Set ℝ,
      (∀ x ∈ S, x ∈ T)
        ∧ S.Nonempty
        ∧ (∃ b ∈ T, ∀ x ∈ S, x ≤ b)
        ∧ ¬ ∃ s, IsLUBIn T S s :=
  countable_subfield_not_complete T T_countable

/-- **The sharp final form.** Order-completeness is precisely the content the
continuum adds: NO countable subfield of ℝ is order-complete, while ℝ is. Since every
δ result places the carrier in a countable field (the constants, the φ-ladder, the
cost dynamics all live countably), the carrier δ uses is never order-complete,
whichever countable field it is. Completeness is an independent axiom whose only model
is uncountable. -/
theorem completeness_is_exactly_the_continuum :
    (∀ K : Subfield ℝ, (K : Set ℝ).Countable →
        ∃ S : Set ℝ, (∀ x ∈ S, x ∈ K) ∧ S.Nonempty ∧ (∃ b ∈ K, ∀ x ∈ S, x ≤ b)
          ∧ ¬ ∃ s, IsLUBIn K S s)
      ∧ (∀ S : Set ℝ, S.Nonempty → (∃ b, ∀ x ∈ S, x ≤ b) → ∃ s, IsLUB S s) :=
  ⟨countable_subfield_not_complete, real_has_lub⟩

/-- The canonical cost `Cost.Jcost` genuinely satisfies the recognition-cost axioms:
the unit law `J(1) = 0` and reciprocal symmetry `J(x) = J(x⁻¹)` for positive `x`. So
the premise of the independence result is not merely "closed under a function"; it is
"a model of the cost laws". -/
theorem jcost_isCostRequirements : Cost.CostRequirements Cost.Jcost :=
  ⟨fun hx => Cost.Jcost_symm hx, Cost.Jcost_unit0⟩

/-- **Completeness independent of the GENUINE cost laws (not just `Jcost`-closure).**
This upgrades `completeness_not_forced_by_cost_axioms`: the premise now records that
`Cost.Jcost` is a bona fide recognition cost (unit `J(1)=0`, reciprocal symmetry
`J(x)=J(x⁻¹)`, nonnegativity `J(x)≥0` on positives), and that `T` is a countable field
on which `Jcost` is closed (hence a model of those laws). `T` still fails the
least-upper-bound property while ℝ satisfies it. So order-completeness is not entailed
by the genuine cost laws plus the field structure; it is an independent commitment.
This is the credibility-gating form: a skeptic cannot say the independence rests on a
weak "closure" premise rather than the actual cost axioms. -/
theorem completeness_not_forced_by_genuine_cost_laws :
    (Cost.Jcost 1 = 0)
      ∧ (∀ x : ℝ, 0 < x → Cost.Jcost x = Cost.Jcost x⁻¹)
      ∧ (∀ x : ℝ, 0 < x → 0 ≤ Cost.Jcost x)
      ∧ (∀ x ∈ T, Cost.Jcost x ∈ T)
      ∧ (T : Set ℝ).Countable
      ∧ (∃ S : Set ℝ,
          (∀ x ∈ S, x ∈ T) ∧ S.Nonempty ∧ (∃ b ∈ T, ∀ x ∈ S, x ≤ b)
            ∧ ¬ ∃ s, IsLUBIn T S s)
      ∧ (∀ S : Set ℝ, S.Nonempty → (∃ b, ∀ x ∈ S, x ≤ b) → ∃ s, IsLUB S s) :=
  ⟨Cost.Jcost_unit0, fun _ hx => Cost.Jcost_symm hx, fun _ hx => Cost.Jcost_nonneg hx,
    fun _ hx => CostOnField.jcost_mem_T hx, T_countable, T_not_complete, real_has_lub⟩

What this page does not claim

This theorem does not claim that the real numbers are the only order-complete field. It does not claim that the cost function J itself is undefined on the reals. It does not claim that order-completeness is inconsistent with the cost axioms, only that it is not entailed by them.

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