Foundation Primitive Recognition Calculus Real Line Non Nativity Faithful Cover

The countable boundary

The real line, the continuum of all real numbers, is uncountable: there are more real numbers than there are whole numbers. This was proved by Georg Cantor in 1874 with his diagonal argument. The theorem faithful_cover_into_countable_iff_countable in the Recognition Science library restates this classical fact in the language of certificates. A certificate is a label assigned to a piece of data; a faithful assignment gives distinct labels to distinct pieces of data, so the label uniquely identifies what it certifies. The theorem says: a set admits a faithful assignment of whole-number labels if and only if the set is countable.

The forward direction is the substantive one. If you can label every element of a set with a distinct whole number, then the set must be countable, because the labels themselves can be listed in order. The reverse direction is immediate: any countable set can be matched with the whole numbers. The theorem therefore draws a precise boundary. Countable sets, like the rational numbers or the algebraic numbers, can be faithfully labeled. Uncountable sets, like the real line, cannot. The real line is too large: any attempt to label its points with whole numbers must either reuse a label for two different points or leave some points unlabeled.

In Recognition Science, this boundary has a direct consequence. The framework models recognition as a discrete record of events, and a countable certificate system is a protocol that can only distinguish countably many alternatives. The theorem real_not_faithfully_certifiable states that no such protocol can faithfully cover the real line. The continuum carries surplus that no countable distinction protocol can witness. This is the cardinality form of the Non-Nativity of the Real Line: the real line enters the framework only through a completion interface, not from distinction alone. The theorem does not say that the real line cannot be approximated, only that it cannot be exactly and uniquely labeled by a countable system.

The theorem also clarifies where the boundary does not bite. For countable witness types, such as algebraic cycles in Hodge theory, a faithful certificate assignment into the whole numbers always exists. Cardinality gives no obstruction there; any genuine obstruction must be finer than counting. The theorem thus separates two cases cleanly: uncountable witnesses are ruled out by counting, while countable witnesses require a geometric argument. This is the dividing line the declaration establishes, and it is a theorem about sets and labels, not a claim about what exists in the world.

/-- The dividing line: a faithful cover into a countable system exists iff the
witness type is countable. This is exactly the boundary between where the
cardinality form of the doctrine bites (uncountable witnesses) and where it does
not (countable witnesses, needing a finer geometric obstruction). -/
theorem faithful_cover_into_countable_iff_countable
    {W : Type} :
    (∃ assign : W → ℕ, Faithful assign) ↔ Countable W := by
  constructor
  · rintro ⟨assign, h⟩
    exact faithful_cover_into_countable_imp_countable assign h
  · intro hW
    exact countable_witness_has_faithful_cover

/-- **The Non-Nativity of the Real Line (cardinality form).** No countable
finite-distinction certificate system faithfully covers the real line. The
continuum carries surplus that no countable distinction protocol can witness;
ℝ enters only through a completion interface, not from distinction alone. -/
theorem real_not_faithfully_certifiable
    {Cert : Type} [Countable Cert] (assign : ℝ → Cert) :
    ¬ Faithful assign :=
  no_faithful_cover_of_uncountable real_uncountable assign

/-- **Honest refinement: countable witnesses escape the cardinality weapon.** Any
countable witness type admits a faithful certificate assignment into ℕ. So when
the true witnesses are countable — as for algebraic cycles and rational Hodge
classes — cardinality gives no obstruction, and any genuine obstruction must be
finer than counting (for Hodge: the geometric diffuse residual). -/
theorem countable_witness_has_faithful_cover
    {W : Type} [Countable W] : ∃ assign : W → ℕ, Faithful assign := by
  obtain ⟨f, hf⟩ := exists_injective_nat W
  exact ⟨f, hf⟩

What this page does not claim

The real line cannot be approximated by countable systems, only exactly labeled. The theorem says anything about what certificates exist in physical reality. Countable witness types face no obstruction at all, only no cardinality obstruction.

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