`log_phi_bound`

proved

show as: view math explainer →

module: IndisputableMonolith.Numerics.IntervalProofs
domain: Numerics
line: 66 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Numerics.IntervalProofs on GitHub at line 66.

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

formal source

  63  num_ineq
  64
  65/-- Crude bound for ln phi. -/
  66lemma log_phi_bound : (0.481211 : ℝ) ≤ Real.log Real.goldenRatio ∧
  67    Real.log Real.goldenRatio ≤ (0.481212 : ℝ) := by
  68  constructor <;> num_ineq
  69
  70end IntervalProofs
  71end Numerics
  72end IndisputableMonolith

papers checked against this theorem

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