Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Position-momentum uncertainty on the maximal domains of the line

Statement

Assume the Axiom of Choice and the Axiom of Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)). Fix ℏ>0 and let Q and P be the position and momentum operators of Position and momentum operators on Euclidean L2 on L2(R;C); by Self-adjointness, Fourier representation and translation identities of position and momentum both are self-adjoint, D(P)=W1,2(R;C) and D(Q)={f: xf∈L2}. Let f∈D(Q)∩D(P) have ∥f∥=1, and put a:=⟨Qf,f⟩=∫Rx∣f(x)∣2dx,b:=⟨Pf,f⟩, xQ:=(Q−a)f,yP:=(P−b)f,ΔQ:=∥xQ∥,ΔP:=∥yP∥. Then:

(a) a,b∈R, and with m1:=∫Rf′f‾ dx and m2:=∫Rxf′f‾ dx (absolutely convergent complex integrals, f′ the weak derivative) one has Re⁡m1=0,Re⁡m2=−12,b=ℏ Im⁡m1;

(b) ⟨xQ,yP⟩=−iℏ2+ℏ Im⁡m2−ab; consequently Im⁡⟨xQ,yP⟩=−ℏ2 and ΔQ ΔP≥ℏ2;

(c) equality ΔQΔP=ℏ2 holds if and only if xQ,yP are linearly dependent and Re⁡⟨xQ,yP⟩=0;

(d) no assumption on the products QP or PQ is used: the assertion holds on the full maximal domain of the pair, and the means a,b, the centered vectors xQ,yP and the variances are finite on it.

The statement concerns a preparation vector only; it asserts no apparatus error, jointly measured distribution or physical interpretation.

Facts & Assumptions

Given: a unit vector f∈W1,2(R;C) with xf∈L2, its weak derivative f′∈L2, the numbers a,b, the vectors xQ,yP and the variances.

[F1]

f has a unique continuous locally absolutely continuous representative f∗ with f∗(x)−f∗(y)=∫yxf′; moreover ∣f∗(x)∣≤Cf:=∥f∥+∥f′∥<∞ for all x and f∗(x)→0 as ∣x∣→∞ (One-dimensional W1,p functions have unique absolutely continuous representatives, Endpoint trace bound and decay of H1 functions clause (c)).

[F2]

There is χ∈Cc∞(R) with 0≤χ≤1, χ=1 on [−1,1], χ=0 outside [−2,2]; for R>0, χR(x):=χ(x/R) satisfies χR=1 on [−R,R], χR=0 outside [−2R,2R], and ∣xχR′(x)∣≤sup⁡t∣tχ′(t)∣=:Cχ<∞ (Explicit compactly supported smooth cutoffs).

[F3]

Complex conjugation preserves W1,2 and D(f‾)=Df‾: this follows from the weak-derivative definition applied to the conjugate test functions, since ∫f‾ φ′=∫f φ′‾‾=−∫Df φ‾‾=−∫Df‾ φ for real-valued φ and hence for all test functions by linearity.

[F4]

Smooth-factor Leibniz rule: if η is smooth and Dβη is bounded for ∣β∣≤1 and u∈W1,2, then ηu∈W1,2 with D(ηu)=(Dη)u+ηDu (Weak Leibniz rule with a smooth factor).

[F5]

Weak product rule for bounded Sobolev factors: if u,v∈W1,2(R;C)∩L∞, then uv∈W1,2 with D(uv)=(Du)v+u(Dv) (Weak product rule for bounded Sobolev functions).

[F6]

If g∈W1,1(R;C) has compact support, then ∫RDg=0: the absolutely continuous representative of g (for p=1) vanishes outside a compact set, so its limiting difference and the difference formula give zero (One-dimensional W1,p functions have unique absolutely continuous representatives, applied with p=1).

[F7]

Cauchy–Schwarz and its consequence: ∣⟨v,w⟩∣2=(Re⁡⟨v,w⟩)2+(Im⁡⟨v,w⟩)2 and ∥v∥ ∥w∥≥∣⟨v,w⟩∣≥∣Im⁡⟨v,w⟩∣ (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F8]

Dominated convergence: if gR→g pointwise and ∣gR∣≤G with ∫G<∞, then ∫gR→∫g (Dominated convergence).

[F9]

Covariance-refined uncertainty of Covariance-refined preparation uncertainty without operator products: for symmetric densely defined operators A,B and a unit vector u∈D(A)∩D(B), with centered vectors x=(A−a)u, y=(B−b)u and z:=⟨x,y⟩, one has ΔA ΔB≥∣z∣≥∣Im⁡z∣, with ∣z∣2=(Re⁡z)2+(Im⁡z)2; equality in ΔA ΔB≥∣z∣ holds exactly when x and y are linearly dependent (clauses (b) and (c) there, the equality clause being that of the Cauchy–Schwarz step).

Proof

1.1givenF7algebra

[Integrability of the two pairings] Since f,xf,f′∈L2(R), Cauchy–Schwarz gives ∫∣f′ f‾∣≤∥f′∥ ∥f∥<∞ and ∫∣xf′ f‾∣≤∥xf∥ ∥f′∥<∞; so m1,m2 are well-defined complex numbers.

1.2givenF2F3F4F5algebra

[Smooth cutoffs and products in W^{1,2}] For R>0 put ηR(x):=x χR(x) and uR:=ηRf. By [F2], ηR and ηR′ are bounded (by 2R and 1+Cχ), so [F4] gives uR∈W1,2 with DuR=(χR+xχR′)f+xχRf′; also uR is bounded and compactly supported. By [F3] and [F1], f‾∈W1,2∩L∞ with Df‾=f′‾. Hence [F5] applies to uR and f‾: gR:=uRf‾∈W1,2(R;C), compactly supported, with DgR=(χR+xχR′) ∣f∣2+2xχRRe⁡(f′f‾), using f′f‾+f′‾f=2Re⁡(f′f‾).

2.1givenstep 1.2F6algebra

[The integrated identity] By [F6] applied to the compactly supported W1,2 (hence W1,1) class gR, 0=∫RDgR=∫RχR∣f∣2+∫RxχR′∣f∣2+2Re⁡∫RxχRf′f‾.

3.1givenstep 1.1step 2.1F8algebra

[Limits as R→∞] As R→∞: (i) χR∣f∣2→∣f∣2 pointwise with 0≤χR∣f∣2≤∣f∣2∈L1, so ∫χR∣f∣2→∥f∥2=1 by [F8]; (ii) ∣xχR′∣ is bounded by Cχ and supported in {∣x∣≥R}, so ∣∫xχR′∣f∣2∣≤Cχ∫{∣x∣≥R}∣f∣2→0 by absolute continuity of the integral; (iii) xχRf′f‾→xf′f‾ pointwise with ∣xχRf′f‾∣≤∣xf′f‾∣∈L1 by step 1.1, so ∫xχRf′f‾→m2 by [F8]. Passing to the limit in step 2.1 gives 1+2Re⁡m2=0, that is Re⁡m2=−12.

4.1givenstep 3.1F6F8algebra

[The second identity] Applying the same construction with ηR replaced by χR (so gR0:=χRff‾∈W1,2, compactly supported, with DgR0=χR′∣f∣2+2χRRe⁡(f′f‾)) and using [F6], 0=∫χR′∣f∣2+2Re⁡∫χRf′f‾; as R→∞ the first term tends to 0 as in step 3.1(ii) and the second to 2Re⁡m1 by dominated convergence (∣f′f‾∣≤12(∣f∣2+∣f′∣2)∈L1). Hence Re⁡m1=0.

5.1givenstep 4.1F3algebra

[The means] a is real because Q is self-adjoint and f∈D(Q); b is real because P is self-adjoint and f∈D(P). Moreover b=⟨Pf,f⟩=∫R(−iℏf′)f‾ dx=−iℏm1, and Re⁡m1=0 gives −iℏm1=ℏIm⁡m1, real as required. This is (a).

6.1givenstep 3.1step 5.1algebra

[The pairing] Expand ⟨xQ,yP⟩=⟨Qf,Pf⟩−b⟨Qf,f⟩−a⟨f,Pf⟩+ab⟨f,f⟩. Here ⟨Qf,f⟩=a and ⟨f,Pf⟩=⟨Pf,f⟩‾=b (both means real), so the last three terms sum to −ab+ab−ab=−ab. And ⟨Qf,Pf⟩=∫xf (−iℏf′)‾dx=iℏ∫xff′‾ dx=iℏ m2‾=iℏ(−12−iIm⁡m2)=−iℏ2+ℏIm⁡m2, using step 3.1. Hence ⟨xQ,yP⟩=−iℏ2+ℏIm⁡m2−ab, with imaginary part −ℏ2.

7.1givenstep 6.1F7F9algebra

[The uncertainty bound] By [F9] (or [F7] applied to xQ and yP), ΔQ ΔP=∥xQ∥ ∥yP∥≥∣⟨xQ,yP⟩∣≥∣Im⁡⟨xQ,yP⟩∣=ℏ2. This is (b).

8.1givenstep 6.1step 7.1F9algebra∎

[Equality and scope] By the equality clause of [F9], equality in ∥xQ∥ ∥yP∥≥∣⟨xQ,yP⟩∣ holds exactly when xQ,yP are linearly dependent; given step 6.1, the further condition ∣⟨xQ,yP⟩∣=ℏ2 is exactly Re⁡⟨xQ,yP⟩=0 by the identity ∣⟨xQ,yP⟩∣2=(Re⁡⟨xQ,yP⟩)2+(Im⁡⟨xQ,yP⟩)2 of [F9]. This is (c). No product QP or PQ was used anywhere: the means, the centered vectors and the pairings were formed from Qf and Pf only, so (d) holds.

Depends on

Dependency tree · 2 levels

Sources