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.

Joint PVM construction for strongly commuting regular projection-valued measures

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a nonzero complex Hilbert space (Hilbert space) and let E,F be regular projection-valued measures on the Borel σ-algebra of R (Projection valued measure, The Borel sigma-algebra of a topological space) satisfying the strong commutation relation

E(B)F(C)=F(C)E(B)for all Borel B,C⊆R.

Then there is a unique regular projection-valued measure G on the Borel σ-algebra of R2 with

G(B×C)=E(B)F(C)for every Borel rectangle B×C,

where rectangle means a measurable rectangle in the sense of Measurable rectangles in a product of measurable spaces. Its marginals are G(B×R)=E(B) and G(R×C)=F(C).

For the scalar construction, let A0 be the algebra of finite unions of Borel rectangles, and define P0(⨆i=1nBi×Ci):=∑i=1nE(Bi)F(Ci) on disjoint rectangular decompositions. For every ψ∈H, μψ(A):=⟨P0(A)ψ,ψ⟩ is a finite premeasure on A0 and has a unique extension Gψ=⟨G(⋅)ψ,ψ⟩ to the Borel σ-algebra. For x,y∈H, define the polarized measure νx,y:=14∑k=03ikGx+iky. Then every Borel S⊆R2 has a unique bounded operator G(S) satisfying ⟨G(S)x,y⟩=νx,y(S) for all x,y∈H, and 0≤G(S)≤I.

Facts & Assumptions

Given: A nonzero complex Hilbert space H; regular PVMs E,F on B(R) with E(B)F(C)=F(C)E(B); the algebra A0 of finite unions of measurable rectangles in R2.

[F1]

A PVM is a map into orthogonal projections with E(∅)=0, E(R)=I, E(B∩C)=E(B)E(C) and strong countable additivity; regularity means every scalar measure Ex(B)=⟨E(B)x,x⟩ is a regular Borel measure. For an orthogonal projection P one has ⟨Px,x⟩=∥Px∥2≥0 (Projection valued measure, The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

[F2]

For a PVM, Ex(B)=⟨E(B)x,x⟩ is a positive measure with Ex(R)=∥x∥2; the polarized Ex,y(B)=⟨E(B)x,y⟩ is a finite complex measure with Ey,x=Ex,y‾, ∣Ex,y(B)∣≤∥x∥ ∥y∥ and the polarization identity Ex,y=14∑k=03ikEx+iky (Scalar and complex measures from a pvm).

[F3]

A premeasure on an algebra is finitely additive and countably additive on disjoint families whose union lies in the algebra; the outer set function it induces is an outer measure under ACω, the Carathéodory σ-algebra carries the extended measure, the source algebra consists of Carathéodory measurable sets, the extension agrees with the premeasure on the source algebra, and a finite premeasure has at most one extension to the generated σ-algebra (Premeasures on algebras of sets, Assuming countable choice, the outer set function induced by a premeasure is an outer measure, Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure, The induced outer measure agrees with the premeasure on the source algebra, Assuming countable choice, every source-algebra set is measurable for the induced outer measure, A finite premeasure has at most one extension to its generated sigma-algebra).

[F4]

Finite positive measures agreeing on a π-system that generates a σ-algebra and having equal total mass agree everywhere on it (Finite measures agreeing on a generating pi-system and on the whole space are equal, Pi-systems).

[F5]

The σ-algebra generated by the measurable rectangles of B(R)×B(R) is the product σ-algebra, and B(R)⊗B(R)=B(R2) (The product sigma-algebra and its finite iterates, The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}).

[F6]

Every finite Borel measure on R2 is regular once every open subset of R2 is σ-compact (Sigma-compact open sets make locally finite Borel measures regular). This topological hypothesis holds: for an open proper U⊊R2, the compact sets Kn={x∈[−n,n]2:dist⁡(x,R2∖U)≥1/n} cover U; for U=R2, the squares [−n,n]2 cover it.

[F7]

For a bounded sesquilinear form on a Hilbert space there is a unique bounded operator representing it; equivalently, bounded linear functionals are represented by vectors (Riesz representation for Hilbert spaces).

[F8]

If P is a π-system and D is a λ-system containing P, then D contains the σ-algebra generated by P (Dynkin's pi-lambda theorem).

Proof

1.1givenF1algebra

[The finitely additive projection on the rectangle algebra] For a finite disjoint union A=⨆i=1n(Bi×Ci) of measurable rectangles put P(A):=∑iE(Bi)F(Ci). This is well defined: two finite rectangle decompositions have a common refinement into disjoint rectangles (intersections of the pieces), and on a common refinement both sums agree by additivity of E and F; in particular P(∅)=0 and P(R2)=I. Each E(Bi)F(Ci) is an orthogonal projection because (E(Bi)F(Ci))2=E(Bi)2F(Ci)2=E(Bi)F(Ci) and (E(Bi)F(Ci))∗=F(Ci)E(Bi)=E(Bi)F(Ci) by [F1] and strong commutation; summands belonging to disjoint rectangles are orthogonal, since E(Bi)F(Ci)E(Bj)F(Cj)=E(Bi∩Bj)F(Ci∩Cj)=0. Hence P(A) is a sum of pairwise orthogonal projections, so P(A)2=P(A)=P(A)∗; and from the refinement description P is finitely additive on disjoint unions, P(A∩A′)=P(A)P(A′) and P(A∪A′)=P(A)+P(A′) for disjoint A,A′∈A0.

1.2F5F8algebra

[Uniqueness for finite complex measures] Let μ,ν be finite complex measures on B(R2) that agree on A0, which contains R2. Then D:={S∈B(R2):μ(S)=ν(S)} contains R2 and the π-system A0; it is a λ-system because equality on the whole space gives closure under complements and countable additivity gives closure under disjoint countable unions. By Dynkin's π-λ theorem [F8], D contains σ(A0)=B(R2) by [F5], so μ=ν on every Borel set.

2.1step 1.1F1F3algebra

[The scalar set functions are premeasures] For ψ∈H define μψ(A):=⟨P(A)ψ,ψ⟩=∥P(A)ψ∥2 for A∈A0; by step 1.1, μψ(∅)=0, μψ is finitely additive, and μψ≤∥ψ∥2. To verify countable additivity, fix pairwise disjoint An∈A0 with union A∈A0 and put RN:=A∖⋃n≤NAn∈A0. Finite additivity gives μψ(A)=∑n≤Nμψ(An)+μψ(RN), and RN↓∅, so continuity from above at ∅ implies μψ(A)=∑nμψ(An). It remains to prove that continuity: for An↓∅ in A0, show μψ(An)→0. Given ε>0, approximate each An from inside by a compact union of rectangles: for a rectangle B×C one has P(B×C)−P(KB×KC)=E(B∖KB)F(C)+E(KB)F(C∖KC) with the two summands orthogonal, so μψ(B×C)−μψ(KB×KC)≤Eψ(B∖KB)+Fψ(C∖KC) for Eψ(B)=⟨E(B)ψ,ψ⟩, Fψ(C)=⟨F(C)ψ,ψ⟩; by regularity [F1] compact KB⊆B, KC⊆C make this arbitrarily small, and finite unions are handled by summing. Choose compact Ln⊆An with μψ(An∖Ln)<ε2−n. If μψ(An)≥ε for all n, then for every N additivity and L1∩⋯∩LN⊇AN∖⋃n≤N(An∖Ln) give μψ(L1∩⋯∩LN)≥μψ(AN)−∑n≤Nμψ(An∖Ln)≥ε−∑n≤Nε2−n>0; hence every finite intersection L1∩⋯∩LN is nonempty, and compactness gives a point of ⋂nLn⊆⋂nAn=∅, a contradiction. Thus μψ(An)→0, and μψ is a finite premeasure on A0.

3.1step 1.1step 2.1F2F3F4F5algebra

[Carathéodory extension and polarization] By steps 1.1 and 2.1 the algebra A0 of finite unions of measurable rectangles is a π-system containing R2 and generates B(R2) by [F5]; hence μψ extends to a finite measure νψ on B(R2), unique by [F3], and νψ(S)=μψ(S) for S∈A0. Uniqueness also extends the scalar homogeneity ναx=∣α∣2νx and the parallelogram identity from A0 to every Borel set: the corresponding finite positive measures agree on A0 and have the same total mass. For x,y∈H define νx,y(S):=14∑k=03ikνx+iky(S); this is a finite complex measure and for S∈A0 it coincides with ⟨P(S)x,y⟩ by the polarization identity [F2]. The scalar homogeneity and parallelogram identity imply, by expansion of the four polarization terms, that (x,y)↦νx,y(S) is sesquilinear and Hermitian for every Borel S, with νx,x(S)=νx(S)≥0. Positivity gives Cauchy–Schwarz for this form (apply 0≤νx+λy(S) for all λ∈C), so ∣νx,y(S)∣≤νx(S)1/2νy(S)1/2≤∥x∥ ∥y∥.

4.1step 3.1F7algebra

[The operators G(S)] Fix a Borel S⊆R2. For fixed x, the map y↦νx,y(S)‾ is a bounded linear functional of norm at most ∥x∥ by step 3.1, so by [F7] there is a unique G(S)x∈H with νx,y(S)‾=⟨y,G(S)x⟩, that is νx,y(S)=⟨G(S)x,y⟩, and ∥G(S)x∥≤∥x∥. The assignment x↦G(S)x is linear because the form is linear in its first argument and the representative is unique, so G(S)∈B(H) with ∥G(S)∥≤1; moreover ⟨G(S)x,y⟩=νx,y(S)=νy,x(S)‾=⟨G(S)y,x⟩‾=⟨x,G(S)y⟩, so G(S) is self-adjoint, and ⟨G(S)x,x⟩=νx(S)∈[0,∥x∥2] gives 0≤G(S)≤I. For every A∈A0, step 3.1 gives νx,y(A)=⟨P(A)x,y⟩, so the defining pairings imply G(A)=P(A); in particular G(B×C)=E(B)F(C).

5.1step 1.1step 1.2step 4.1F1F2F6F8algebra

[Multiplicativity and the PVM axioms] First observe that for arbitrary Borel S and rectangle R=B′×C′, for every x,y the scalar set functions S′↦⟨G(S′∩R)x,y⟩=νx,y(S′∩R) and S′↦⟨G(S′)G(R)x,y⟩=νG(R)x,y(S′) are finite complex measures; they agree on rectangles S′=B×C because G(S′∩R)=E(B∩B′)F(C∩C′)=E(B)E(B′)F(C)F(C′)=E(B)F(C)E(B′)F(C′)=G(S′)G(R) by [F1] and the commutation hypothesis, and they agree on R2 since each value is G(R). By step 1.2 [F8], these scalar measures agree on all Borel S′, so G(S′∩R)=G(S′)G(R) for all Borel S′. Now fix arbitrary Borel S and compare, for every x,y, the finite complex measures T↦⟨G(S∩T)x,y⟩=νx,y(S∩T) and T↦⟨G(S)G(T)x,y⟩=νx,G(S)y(T); by the previous result they agree on every rectangle T, and by step 1.2 [F8] they agree for all Borel T. Taking S=T yields G(S)2=G(S), so every G(S) is an orthogonal projection; G(∅)=0 and G(R2)=I follow from the rectangle values. Strong countable additivity holds because for pairwise disjoint Sn with union S the scalar measures satisfy νx(S)=∑nνx(Sn), so ∑n∥G(Sn)x∥2=∑nνx(Sn)=νx(S)≤∥x∥2<∞ and the orthogonal series ∑nG(Sn)x converges in norm to a vector whose pairings with every y equal ∑nνx,y(Sn)=νx,y(S)=⟨G(S)x,y⟩, hence to G(S)x. Finally the scalar measures of G are the νψ, finite Borel measures on R2 and hence regular by [F6]; so G is a regular PVM with G(B×C)=E(B)F(C).

6.1step 5.1step 1.2F1F2F8algebra∎

[Marginals and uniqueness] For the marginal, G(B×R)=E(B)F(R)=E(B) and G(R×C)=F(C) by [F1]. If G′ is another regular PVM with G′(B×C)=E(B)F(C), then for every x,y the finite complex measures S↦⟨G′(S)x,y⟩ and νx,y agree on rectangles, including R2, so step 1.2 [F8] gives their equality on B(R2). Taking y=G′(S)x−G(S)x gives G′(S)=G(S) for every Borel S. Hence G is unique, completing the proof.

Depends on

Dependency tree · 2 levels

Sources