pith. machine review for the scientific record. sign in
theorem

rrf_fixed_point_exists

proved
show as:
view math explainer →
module
IndisputableMonolith.RRF.Foundation.SelfReference
domain
RRF
line
135 · github
papers citing
none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.RRF.Foundation.SelfReference on GitHub at line 135.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

formal source

 132}
 133
 134/-- The RRF fixed point exists. -/
 135theorem rrf_fixed_point_exists : Nonempty DescriptiveFixedPoint :=
 136  ⟨rrf_is_fixed_point⟩
 137
 138/-! ## Consistency Claims -/
 139
 140/-- The formalization is internally consistent.
 141
 142This is witnessed by the fact that it compiles without contradiction.
 143We cannot prove this from within (Gödel), but we can assert it.
 144-/
 145structure InternalConsistency where
 146  /-- Derivable from foundational axioms only. -/
 147  foundational : Nonempty (ℝ → ℝ)
 148  /-- No obvious contradiction. -/
 149  not_obviously_false : ¬(0 = 1)
 150  /-- All proofs in this file are terminal (no holes). -/
 151  rigorous_proofs_only : Bool
 152
 153/-- The RRF formalization is internally consistent. -/
 154def rrf_internally_consistent : InternalConsistency := {
 155  foundational := ⟨IndisputableMonolith.Cost.Jcost⟩,
 156  not_obviously_false := by norm_num,
 157  rigorous_proofs_only := true
 158}
 159
 160
 161/-- Internal consistency is witnessed. -/
 162theorem internal_consistency_exists : Nonempty InternalConsistency :=
 163  ⟨rrf_internally_consistent⟩
 164
 165/-! ## The Compilation as Recognition -/