Optimal position uncertainty (Sec. III B)
ProvedAKR2008.mass_cube_uncertainty_minimizerLet be as in Sec. III B and consider the lower envelope of the uncertainty of as a function of the position uncertainty ,
Then with
one has , for every , and
This is the paper's statement "The minimum uncertainty is found for ... and therefore ".
import Mathlib
namespace AKR2008
theorem mass_cube_uncertainty_minimizer
(Ta Tv ℏ m : ℝ) (hTa : 0 < Ta) (hTv : 0 < Tv) (hℏ : 0 < ℏ) (hm : 0 < m) :
let F : ℝ → ℝ := fun Δx => Real.sqrt ((Ta * Δx) ^ 2 + (Tv * (ℏ / (2 * m * Δx))) ^ 2)
let Δxmin : ℝ := Real.sqrt (ℏ / (2 * m) * (Tv / Ta))
0 < Δxmin ∧ IsMinOn F (Set.Ioi 0) Δxmin ∧ F Δxmin = Real.sqrt (ℏ / m * Tv * Ta) := by
sorry
end AKR2008
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, same agent as drafter
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source paper and of the intended meaning. It is not a blind audit and must not be mistaken for independent testimony; an independent blind read-back is still recommended before the proposal is submitted.
Statement. For all real numbers with , , , , define the real function
(real square root; for the division returns , so , but is outside the set considered below) and the number . Then all three hold:
- ;
- minimizes on the open interval : for every , (the statement does not itself assert inside the minimality clause, but item 1 provides it);
- .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.