`K`

definition

show as: view math explainer →

module: IndisputableMonolith.Constants.LambdaRecDerivation
domain: Constants
line: 92 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Constants.LambdaRecDerivation on GitHub at line 92.

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

used by

formal source

  89    K(λ) = 0 iff λ = λ_rec. This is tautological given the definition
  90    of G, but is retained for backward compatibility with the
  91    verification infrastructure. -/
  92noncomputable def K (lambda : ℝ) : ℝ :=
  93  lambda ^ 2 / lambda_rec ^ 2 - 1
  94
  95theorem lambda_rec_is_root : K lambda_rec = 0 := by
  96  unfold K lambda_rec ell0
  97  simp only [one_pow, div_one]
  98  ring
  99
 100theorem lambda_rec_unique_root (lambda : ℝ) (hlambda : lambda > 0) :
 101    K lambda = 0 ↔ lambda = lambda_rec := by
 102  unfold K lambda_rec ell0
 103  simp only [one_pow, div_one]
 104  constructor
 105  · intro h
 106    have hsq : lambda ^ 2 = 1 := by linarith
 107    have : (lambda - 1) * (lambda + 1) = 0 := by nlinarith
 108    rcases mul_eq_zero.mp this with h1 | h1
 109    · linarith
 110    · linarith
 111  · intro h
 112    rw [h]; ring
 113
 114theorem lambda_rec_is_forced :
 115    ∃! lambda : ℝ, lambda > 0 ∧ K lambda = 0 := by
 116  use lambda_rec
 117  constructor
 118  · exact ⟨lambda_rec_pos, lambda_rec_is_root⟩
 119  · intro y ⟨hy_pos, hy_root⟩
 120    exact (lambda_rec_unique_root y hy_pos).mp hy_root
 121
 122/-! ## The Complete G Derivation Chain (Q1 Answer)

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.