theorem
proved
rational_root_theorem_for_phi
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Information.ComputationLimitsStructure on GitHub at line 96.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
formal source
93
94/-- **LEMMA**: The rational root theorem applied: the only possible rational roots of
95 x² - x - 1 = 0 are ±1, neither of which is a root. -/
96theorem rational_root_theorem_for_phi :
97 (1 : ℝ)^2 - 1 - 1 ≠ 0 ∧ ((-1 : ℝ))^2 - (-1) - 1 ≠ 0 := by
98 constructor <;> norm_num
99
100/-- **THEOREM IC-002.7**: There is no finite-precision algorithm that exactly computes
101 φ in the sense that any rational number differs from φ. -/
102theorem no_exact_phi_computation (q : ℚ) : (q : ℝ) ≠ phi := by
103 intro heq
104 apply phi_irrational
105 exact Set.mem_range.mpr ⟨q, heq⟩
106
107/-! ## III. Landauer Bound: Energy Cost of Computation -/
108
109/-- Boltzmann constant (in J/K). -/
110noncomputable def k_B : ℝ := 1.380649e-23
111
112/-- **THEOREM IC-002.8**: The Landauer energy k_B T ln(2) is positive for T > 0.
113 This is the minimum energy cost to erase one bit of information. -/
114theorem landauer_energy_pos (T : ℝ) (hT : T > 0) :
115 k_B * T * Real.log 2 > 0 := by
116 unfold k_B
117 apply mul_pos
118 apply mul_pos
119 · norm_num
120 · exact hT
121 · exact Real.log_pos (by norm_num)
122
123/-- **THEOREM IC-002.9**: The Landauer energy grows linearly with temperature. -/
124theorem landauer_scales_with_temp (T₁ T₂ : ℝ) (hT₁ : T₁ > 0) (hT₂ : T₂ > 0) (h : T₂ > T₁) :
125 k_B * T₂ * Real.log 2 > k_B * T₁ * Real.log 2 := by
126 unfold k_B