TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)

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.

Sharp finite joint measurability forces commutation

Statement

Let $H$ be a finite-dimensional complex Hilbert space, let $I, J$ be finite nonempty sets, and let $(P_{i})_{i \in I}$ and $(Q_{j})_{j \in J}$ be projection-valued measures: $P_{i} = P_{i}^{*} = P_{i}^{2}$ , $Q_{j} = Q_{j}^{*} = Q_{j}^{2}$ , distinct projections in each family are orthogonal, and $\sum_{i} P_{i} = \sum_{j} Q_{j} = I_{H}$ . A joint POVM is a family of effects $(G_{i j})_{(i, j) \in I \times J}$ with $\sum_{i, j} G_{i j} = I_{H}$ , $\sum_{j} G_{i j} = P_{i}$ , and $\sum_{i} G_{i j} = Q_{j}$ . Such a joint POVM exists exactly when $P_{i} Q_{j} = Q_{j} P_{i}$ for every $i, j$ . When it exists it is unique and equals $G_{i j} = P_{i} Q_{j}$ .

Statement references

Finite effects and instruments: normalization and non-determination of the update

Facts & Assumptions

Given: The finite-dimensional Hilbert space, finite projection-valued measures, and joint POVM defined in the Statement.

[A1]

The families $(P_{i})_{i \in I}$ and $(Q_{j})_{j \in J}$ each consist of pairwise orthogonal projections summing to $I_{H}$ .

[F1]

Finite effects and instruments: normalization and non-determination of the update: a finite POVM is a family of effects $0 \leq F_{a} \leq I$ summing to $I$ .

[F2]

Finite matrix spectral and state calculus: a finite positive semidefinite matrix has a positive square root defined by its spectral resolution.

Proof

1.1A1algebra

Suppose all $P_{i}$ commute with all $Q_{j}$ . Then $G_{i j} = P_{i} Q_{j}$ is self-adjoint, since $(P_{i} Q_{j})^{*} = Q_{j} P_{i} = P_{i} Q_{j}$ , and is idempotent, since $(P_{i} Q_{j})^{2} = P_{i}^{2} Q_{j}^{2} = P_{i} Q_{j}$ . For any $x$ , $⟨ G_{i j} x, x ⟩ = ⟨ G_{i j} x, G_{i j} x ⟩ \geq 0$ , so each is positive; the sum identity makes each bounded above by $I_{H}$ . Finite summation gives $\sum_{i, j} G_{i j} = (\sum_{i} P_{i}) (\sum_{j} Q_{j}) = I_{H}$ , and the two marginal sums are $P_{i}$ and $Q_{j}$ . So this family is a joint POVM.

1.2givenA1F1F2algebra

Conversely, suppose a joint POVM $(G_{i j})$ exists. For each pair, $0 \leq G_{i j} \leq P_{i}$ because $P_{i} - G_{i j} = \sum_{k \neq j} G_{i k} \geq 0$ , and similarly $0 \leq G_{i j} \leq Q_{j}$ . If $x \in \ker P_{i}$ , then $0 \leq ⟨ G_{i j} x, x ⟩ \leq ⟨ P_{i} x, x ⟩ = 0$ . By [F2], $⟨ G_{i j} x, x ⟩ = ∥ G_{i j}^{1 / 2} x ∥^{2}$ , hence $G_{i j} x = 0$ and $G_{i j} (I - P_{i}) = 0$ . Taking adjoints gives $(I - P_{i}) G_{i j} = 0$ , so $G_{i j} = P_{i} G_{i j} P_{i}$ . The same argument yields $G_{i j} = Q_{j} G_{i j} Q_{j}$ .

2.1A1step 1.2algebra∎

Using $P_{i} = \sum_{k} G_{i k}$ and $Q_{j} = \sum_{ℓ} G_{ℓ j}$ , we obtain $P_{i} Q_{j} = \sum_{k} G_{i k} Q_{j}$ . The support relation $G_{i k} = Q_{k} G_{i k} Q_{k}$ from step 1.2 makes every term with $k \neq j$ zero, and the $k = j$ term is $G_{i j}$ . Therefore $P_{i} Q_{j} = G_{i j}$ . Since $G_{i j}$ is self-adjoint, taking adjoints gives $Q_{j} P_{i} = G_{i j} = P_{i} Q_{j}$ . This proves commutation and uniqueness.

Remarks

The sharp projection hypothesis is essential. General POVMs can be jointly measurable even when their effects do not commute; no commutation criterion for arbitrary POVMs is asserted here.

Sharp finite joint measurability forces commutation

Statement

Statement references

Facts & Assumptions

Proof

Remarks

Depends on

Dependency tree · 2 levels

Sources