Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Optimal position uncertainty Δxmin⁡=ℏ2mTvTa\Delta x_{\min}=\sqrt{\tfrac{\hbar}{2m}\tfrac{T_v}{T_a}}Δxmin​=2mℏ​Ta​Tv​​​ (Sec. III B)

Proved
AKR2008.mass_cube_uncertainty_minimizer

by LG · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

mathematical-physicsoptimizationuncertainty-principle

Let Ta,Tv,ℏ,m>0T_a, T_v, \hbar, m > 0Ta​,Tv​,ℏ,m>0 be as in Sec. III B and consider the lower envelope of the uncertainty of T00GWT^{\mathrm{GW}}_{00}T00GW​ as a function of the position uncertainty Δx>0\Delta x>0Δx>0,

F(Δx)=(Ta Δx)2+(Tv ℏ2m Δx)2.F(\Delta x) = \sqrt{\bigl(T_a\,\Delta x\bigr)^2 + \Bigl(T_v\,\frac{\hbar}{2m\,\Delta x}\Bigr)^2}.F(Δx)=(Ta​Δx)2+(Tv​2mΔxℏ​)2​.

Then with

Δxmin⁡=ℏ2m TvTa\Delta x_{\min} = \sqrt{\frac{\hbar}{2m}\,\frac{T_v}{T_a}}Δxmin​=2mℏ​Ta​Tv​​​

one has Δxmin⁡>0\Delta x_{\min}>0Δxmin​>0, F(Δxmin⁡)≤F(Δx)F(\Delta x_{\min}) \le F(\Delta x)F(Δxmin​)≤F(Δx) for every Δx>0\Delta x>0Δx>0, and

F(Δxmin⁡)=ℏm Tv Ta.F(\Delta x_{\min}) = \sqrt{\frac{\hbar}{m}\,T_v\,T_a}.F(Δxmin​)=mℏ​Tv​Ta​​.

This is the paper's statement "The minimum uncertainty is found for Δxmin⁡\Delta x_{\min}Δxmin​ ... and therefore ΔT00GW≥ℏmδT00,vGWδT00,aGW\Delta T^{\mathrm{GW}}_{00}\ge\sqrt{\tfrac{\hbar}{m}\delta T^{\mathrm{GW}}_{00,v}\delta T^{\mathrm{GW}}_{00,a}}ΔT00GW​≥mℏ​δT00,vGW​δT00,aGW​​".

Preamble
import Mathlib
Formal statement
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
Source
M. Albers, C. Kiefer, M. Reginatto, Measurement analysis and quantum gravity, Phys. Rev. D 78, 064051 (2008), https://doi.org/10.1103/PhysRevD.78.064051, p. 064051-8, Sec. III B, formula for Δxmin⁡\Delta x_{\min}Δxmin​
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 Ta,Tv,ℏ,mT_a, T_v, \hbar, mTa​,Tv​,ℏ,m with Ta>0T_a>0Ta​>0, Tv>0T_v>0Tv​>0, ℏ>0\hbar>0ℏ>0, m>0m>0m>0, define the real function

F(x)=(Tax)2+(Tv⋅ℏ2mx)2(x∈R)F(x) = \sqrt{(T_a x)^2 + \Bigl(T_v\cdot\frac{\hbar}{2 m x}\Bigr)^2}\qquad(x\in\mathbb R)F(x)=(Ta​x)2+(Tv​⋅2mxℏ​)2​(x∈R)

(real square root; for x=0x = 0x=0 the division returns 000, so F(0)=0F(0)=0F(0)=0, but x=0x=0x=0 is outside the set considered below) and the number xmin⁡=ℏ2m⋅TvTax_{\min} = \sqrt{\tfrac{\hbar}{2m}\cdot\tfrac{T_v}{T_a}}xmin​=2mℏ​⋅Ta​Tv​​​. Then all three hold:

  1. 0<xmin⁡0 < x_{\min}0<xmin​;
  2. xmin⁡x_{\min}xmin​ minimizes FFF on the open interval (0,∞)(0,\infty)(0,∞): for every x>0x>0x>0, F(xmin⁡)≤F(x)F(x_{\min}) \le F(x)F(xmin​)≤F(x) (the statement does not itself assert xmin⁡∈(0,∞)x_{\min}\in(0,\infty)xmin​∈(0,∞) inside the minimality clause, but item 1 provides it);
  3. F(xmin⁡)=ℏm Tv TaF(x_{\min}) = \sqrt{\tfrac{\hbar}{m}\,T_v\,T_a}F(xmin​)=mℏ​Tv​Ta​​.
Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me