Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Nonunique mixed ensemble

Example

On H=C2 with the standard inner product and orthonormal basis e1=(10), e2=(01), put e±:=12(e1±e2) (Density operators and scalar spectral probability). Then the maximally mixed density operator 12I admits the two orthonormal convex decompositions

12I=12Te1,e1+12Te2,e2=12Te+,e++12Te−,e−,

where (e1,e2) and (e+,e−) are distinct orthonormal bases of H. Thus the same density operator has two distinct orthonormal convex decompositions into rank-one density operators.

Facts & Assumptions

Given: H=C2 with the standard inner product; the orthonormal basis (e1,e2); the unit vectors e±; the operators Tu,vx=⟨x,v⟩u.

[A1]

A density operator is a self-adjoint positive trace-class operator with trace 1 (Density operators and scalar spectral probability(a), definition only). For a finite family of unit vectors ujinmathbbC2 and weights wjge0 with sumjwj=1, set ho:=sumjwjujuj∗. This is a finite matrix and hence trace class; it is self-adjoint, x∗hox=sumjwj∣uj∗x∣2ge0, and its finite trace is sumjwjsumk=12∣(uj)k∣2=sumjwj=1. Thus it is a density operator even without orthogonality. This is a local finite-matrix calculation, not an invocation of the supplier's Countable Choice expansion.

[A2]

Tu,v is trace class with tr⁡(Tu,v)=⟨u,v⟩ and ∥Tu,v∥1=∥u∥ ∥v∥; the trace is linear on trace-class operators (Rank-one operator calculus). In the present H=C2 these facts follow directly from Tu,v=uv∗: the diagonal sum is ∑kukvk‾=⟨u,v⟩, and (uv∗)∗(uv∗)=∥u∥2vv∗ has at most one nonzero eigenvalue, ∥u∥2∥v∥2, so its singular-value sum is ∥u∥∥v∥. Finite diagonal sums are linear. No choice principle is used in these finite computations.

[A3]

In an orthonormal basis of C2 the matrix of Tu,v is the column-times-row matrix uv∗; Te1,e1 and Te2,e2 therefore have matrices (1000) and (0001).

Verification

1.1A1A2A3algebra

[Computational basis decomposition] By [A3], 12Te1,e1+12Te2,e2 has matrix 12(1000)+12(0001)=12I, and by [A2] it is a trace-class operator of trace 12+12=1; by [A1] it is a density operator coming from the orthonormal family (e1,e2) with weights 12,12.

2.1step 1.1A1A3algebra

[Fixed ± basis decomposition] The vectors e±=12(e1±e2) are unit and orthogonal since ⟨e+,e−⟩=12(⟨e1,e1⟩−⟨e1,e2⟩+⟨e2,e1⟩−⟨e2,e2⟩)=0; their matrices are Te+,e+=12(1111) and Te−,e−=12(1−1−11), so 12Te+,e++12Te−,e−=12I again, with weights 12,12 on an orthonormal family; thus the same operator 12I has a second decomposition.

3.1step 1.1step 2.1A1algebra∎

[The decompositions are different] The two orthonormal families are distinct: ∣⟨e1,e+⟩∣=12∉{0,1}, so e1 is not a scalar multiple of e± and Te1,e1 is not one of Te±,e± (their matrices of step 2.1 differ from (1000)); hence the two lists of rank-one density operators are not the same up to reordering, while both convex combinations equal the single operator 12I by steps 1.1 and 2.1. Therefore this density operator has a nonunique orthonormal convex decomposition into rank-one density operators, consistent with the expansion in [A1].

Remarks

  • The operator identity is basis-independent. Both decompositions define the same matrix ρ=12I, so tr⁡(ρA)=12tr⁡A for every endomorphism A of H.
  • Nonuniqueness needs no optimization. The two decompositions here are already orthonormal and vary only in the choice of basis; no operational preparation procedure is specified.

Depends on

Dependency tree · 2 levels

Sources