Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The Schroedinger-Robertson bound in anticommutator form and the Robertson bound on product domains

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with inner product linear in the first argument (Real and complex inner product spaces, with the inner product linear in the first argument, Hilbert space), let A,B be symmetric densely defined operators on H (Symmetric, self-adjoint and essentially self-adjoint operators, Adjoint of a densely defined operator), and let u∈D(A)∩D(B) with ∥u∥=1 satisfy in addition u∈D(AB)∩D(BA), that is Bu∈D(A) and Au∈D(B). Put a:=⟨Au,u⟩,b:=⟨Bu,u⟩,x:=(A−a)u,y:=(B−b)u,ΔA:=∥x∥,ΔB:=∥y∥, and write {A,B}u:=ABu+BAu and [A,B]u:=ABu−BAu for the pairings at u. Then:

(a) a,b∈R, x,y∈H, and Re⁡⟨x,y⟩=12⟨{(A−a),(B−b)}u,u⟩=12⟨{A,B}u,u⟩−ab,⟨[A,B]u,u⟩=−2iIm⁡⟨x,y⟩;

(b) (Robertson bound) ΔA ΔB≥12∣⟨[A,B]u,u⟩∣;

(c) (Schroedinger-Robertson bound) (ΔA)2(ΔB)2≥(12⟨{(A−a),(B−b)}u,u⟩)2+14∣⟨[A,B]u,u⟩∣2, that is, with the expanded anticommutator pairing (ΔA)2(ΔB)2≥(12⟨{A,B}u,u⟩−ab)2+14∣⟨[A,B]u,u⟩∣2;

(d) equality holds in (c) if and only if x and y are linearly dependent; in particular the Robertson bound (b) follows from (c) because the first square is nonnegative;

(e) if A and B are bounded everywhere-defined self-adjoint operators, then the product-domain hypothesis u∈D(AB)∩D(BA) holds for every unit u∈H and clauses (a)-(d) apply to every unit u.

No energy-time inequality and no apparatus statement is made.

Facts & Assumptions

Given: The Axiom of Countable Choice; a complex Hilbert space H; symmetric densely defined A,B; a unit u∈D(A)∩D(B) with u∈D(AB)∩D(BA); the numbers a,b and vectors x,y.

[F1]

Covariance-refined uncertainty. For symmetric densely defined A,B and a unit u∈D(A)∩D(B), with a,b,x,y as above: a,b are real and x,y∈H; Cov⁡u(A,B):=Re⁡⟨x,y⟩ is real and symmetric; the refined bound (ΔA)2(ΔB)2≥[Re⁡⟨x,y⟩]2+[Im⁡⟨x,y⟩]2 holds, with equality if and only if x,y are linearly dependent; and if u∈D(AB)∩D(BA) then ⟨[A,B]u,u⟩=−2iIm⁡⟨x,y⟩ and (ΔA)2(ΔB)2≥[Re⁡⟨x,y⟩]2+14∣⟨[A,B]u,u⟩∣2 (Covariance-refined preparation uncertainty without operator products clauses (a)-(d)).

[F2]

Commutator pairing. If u∈D(AB)∩D(BA) then ([A,B]u,u)=⟨ABu,u⟩−⟨BAu,u⟩=−2iIm⁡⟨Au,Bu⟩, and ⟨x,y⟩=⟨Au,Bu⟩−ab with real a,b (Weak-form Robertson uncertainty on a common domain clauses (a) and (c)).

[F3]

Inner products and Cauchy-Schwarz. For z∈C one has ∣z∣2=(Re⁡z)2+(Im⁡z)2, and ∥v∥ ∥w∥≥∣⟨v,w⟩∣ with equality if and only if v,w are linearly dependent (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F4]

Bounded operators. A bounded everywhere-defined self-adjoint operator on H has domain H, so for bounded self-adjoint A,B the hypotheses u∈D(A)∩D(B) and u∈D(AB)∩D(BA) hold for every u∈H (A bounded linear operator between normed spaces, Symmetric, self-adjoint and essentially self-adjoint operators).

Proof

technique · expand the two pairings of the centered vectors in terms of the anticommutator and commutator pairings using symmetry of the operators, then read the Schroedinger-Robertson inequality off the refined Cauchy-Schwarz bound

Given: The data of the statement and [F1]-[F4].

1.1givenF1

[Means and centered vectors] By [F1] the numbers a and b are real and x=(A−a)u, y=(B−b)u lie in H, so ΔA=∥x∥ and ΔB=∥y∥ are the norms of the centered vectors.

2.1step 1.1F2algebra

[The real part is the anticommutator pairing] Since Bu∈D(A) and Au∈D(B), symmetry of A gives ⟨ABu,u⟩=⟨Bu,Au⟩=⟨Au,Bu⟩‾ and symmetry of B gives ⟨BAu,u⟩=⟨Au,Bu⟩. Adding, ⟨{A,B}u,u⟩=2Re⁡⟨Au,Bu⟩. By [F2], ⟨x,y⟩=⟨Au,Bu⟩−ab with ab∈R, hence Re⁡⟨x,y⟩=Re⁡⟨Au,Bu⟩−ab=12⟨{A,B}u,u⟩−ab. Expanding the anticommutator of the centered operators, using a,b∈R and ⟨Au,u⟩=a, ⟨Bu,u⟩=b, gives ⟨{(A−a),(B−b)}u,u⟩=⟨{A,B}u,u⟩−2ab, so the two displays for the real part agree.

3.1step 2.1F2algebra

[The imaginary part is the commutator pairing] By [F2], ⟨[A,B]u,u⟩=−2iIm⁡⟨Au,Bu⟩; by step 2.1 and [F2], Im⁡⟨x,y⟩=Im⁡⟨Au,Bu⟩, so ⟨[A,B]u,u⟩=−2iIm⁡⟨x,y⟩. This completes (a).

4.1step 2.1step 3.1F1F3algebra

[The two bounds] By [F1] the refined bound (ΔA)2(ΔB)2≥[Re⁡⟨x,y⟩]2+[Im⁡⟨x,y⟩]2 holds. Substituting step 2.1 and ∣Im⁡⟨x,y⟩∣=12∣⟨[A,B]u,u⟩∣ from step 3.1 gives (c); dropping the nonnegative first square gives (b).

5.1step 4.1F1

[Equality] By [F1] equality in the refined bound holds if and only if x,y are linearly dependent; this is (d).

6.1givenF4∎

[Bounded case] If A and B are bounded everywhere-defined self-adjoint operators then D(A)=D(B)=H and all products are everywhere defined, so the product-domain hypothesis of the statement holds for every unit u∈H by [F4]; the displays of (a)-(d) are then unconditional in u. This is (e).

Depends on

Dependency tree · 2 levels

Sources