Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Weak and strong additivity of orthogonal projections

Statement

Assume Countable Choice. Let (X,Σ) be a measurable space, let H be a complex Hilbert space, and let E:Σ→B(H) take values in orthogonal projections and satisfy E(∅)=0 and E(B∩C)=E(B)E(C) for all B,C∈Σ. Then the following two properties are equivalent:

  1. (weak countable additivity) for every pairwise disjoint sequence (Bn)n∈N in Σ with union B and all x,y∈H, ⟨E(B)x,y⟩=∑n=0∞⟨E(Bn)x,y⟩;
  2. (strong countable additivity) for every such sequence and every x∈H, E(B)x=∑n=0∞E(Bn)x with the series converging in norm.

Facts & Assumptions

[A1]

An orthogonal projection value P=E(B) satisfies P2=P=P∗ and ⟨Px,x⟩=∥Px∥2≥0, and it is contractive, ∥Pu∥≤∥u∥ for all u (Projection valued measure, Hilbert projections are linear, self-adjoint and contractive).

[A2]

The Hilbert adjoint satisfies ⟨Su,v⟩=⟨u,S∗v⟩ for all u,v, and conjugate symmetry gives ⟨S∗u,v⟩=⟨v,S∗u⟩‾=⟨Sv,u⟩‾=⟨u,Sv⟩; for a self-adjoint S the two pairings with S coincide (The Hilbert-space adjoint of a bounded operator, Real and complex inner-product spaces and their induced length).

[A3]

Multiplicativity on intersections and the empty-set value hold: E(B∩C)=E(B)E(C) and E(∅)=0; if C⊆B then E(C)=E(B∩C)=E(B)E(C)=E(C)E(B) (Projection valued measure).

[A4]

Cauchy–Schwarz gives ∣⟨u,v⟩∣≤∥u∥ ∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A5]

The pairing is linear in the first argument and conjugate-linear in the second, and ∥u∥2=⟨u,u⟩ (Real and complex inner-product spaces and their induced length).

[A6]

Countable Choice is the declared standing hypothesis of this block of the page (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: A measurable space (X,Σ), a complex Hilbert space H, a map E with orthogonal projection values, E(∅)=0, E(B∩C)=E(B)E(C), a pairwise disjoint sequence (Bn) in Σ with union B, vectors x,y∈H, and partial sums QN:=∑n≤NE(Bn).

1.1A1A4A5

Strong implies weak: for every N the difference of the two sides of the weak identity is ⟨E(B)x−QNx,y⟩, so by Cauchy–Schwarz ∣⟨E(B)x,y⟩−∑n≤N⟨E(Bn)x,y⟩∣≤∥E(B)x−QNx∥ ∥y∥, which tends to 0 because E(B)x−QNx→0 in norm by hypothesis.

1.2A1A2A3A5

Weak implies strong: expanding ∥E(B)x−QNx∥2=⟨E(B)x−QNx,E(B)x−QNx⟩ and using P2=P=P∗ for each projection value gives ∥E(B)x−QNx∥2=⟨E(B)x,x⟩−2∑n≤N⟨E(Bn)x,x⟩+∑n,m≤N⟨E(Bm∩Bn)x,x⟩, because ⟨E(B)x,E(B)x⟩=⟨E(B)2x,x⟩, because ⟨E(Bn)x,E(B)x⟩=⟨E(B)E(Bn)x,x⟩ with Bn⊆B, and because ⟨E(Bn)x,E(Bm)x⟩=⟨E(Bm)E(Bn)x,x⟩=⟨E(Bm∩Bn)x,x⟩.

2.1step 1.2A3A5

In the last sum the off-diagonal terms are ⟨E(∅)x,x⟩=0 and the diagonal terms are ⟨E(Bn)x,x⟩, so ∥E(B)x−QNx∥2=⟨E(B)x,x⟩−∑n≤N⟨E(Bn)x,x⟩, which tends to 0 by weak countable additivity applied with y=x; hence QNx→E(B)x in norm.

3.1step 1.1step 2.1A6∎

Both implications hold for an arbitrary pairwise disjoint sequence, so weak and strong countable additivity of E are equivalent.

Depends on

Dependency tree · 2 levels

Sources