theorem
proved
term proof
phi_ladder_optimization_collapses
show as:
view Lean formalization →
formal statement (Lean)
124theorem phi_ladder_optimization_collapses
125 (omega_0 lam : ℝ) (n : ℕ) (h : 0 < n) :
126 ∃ k_opt : ℕ, k_opt ∈ Finset.range n ∧
127 T_c_phi_rung omega_0 lam k_opt =
128 Finset.sup' (Finset.range n)
129 ⟨0, by simp [Finset.mem_range]; exact h⟩
130 (T_c_phi_rung omega_0 lam) := by
proof body
Term-mode proof.
131 have hne : (Finset.range n).Nonempty := ⟨0, by simp [Finset.mem_range]; exact h⟩
132 obtain ⟨k_opt, hmem, h_eq⟩ :=
133 Finset.exists_mem_eq_sup' hne (T_c_phi_rung omega_0 lam)
134 exact ⟨k_opt, hmem, h_eq.symm⟩
135
136/-! ## §4. Master certificate -/
137
138/-- **HYDRIDE SC OPTIMIZATION MASTER CERTIFICATE.** Five clauses:
139
1401. `mu_star_in_band`: μ* ∈ (0, 1).
1412. `lambda_pos`: e-ph coupling positive.
1423. `T_c_optimization_exists`: optimal rung exists on any finite range.
1434. `phi_ladder_collapses`: optimization reduces to single integer parameter.
1445. `phonon_rung_imported`: phonon rung is imported from PhiLadderPhononResonance. -/