Alphabeta Math
Pipeline-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.

Measurement compatibility, dilation and identifiable tomography

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite Hermitian frames and their Gram pseudoinverse

Definition

For an integer d≥1, let Hd={A∈Md(C):A=A∗}, regarded as a real vector space. For A,B∈Hd, define the trace pairing ⟨A,B⟩HS:=Tr⁡(AB) and write ∥A∥HS:=Tr⁡(A2). The following A-page lemma verifies that the pairing is a real inner product and that this expression is its norm.

Let m≥1 and let F=(Fa)a=1m be a finite family in Hd. It is informationally complete when its real linear span is all of Hd. Its synthesis map is S:Rm→Hd, Sc=∑a=1mcaFa. Define the Gram matrix by Gab:=Tr⁡(FaFb).

Equip Rm with the dot product cTb=∑a=1mcaba. Here S∗:Hd→Rm denotes the adjoint relative to this dot product and the displayed trace pairing: it is characterized by cT(S∗X)=⟨Sc,X⟩HS for every c∈Rm and X∈Hd. The following lemma proves that the trace pairing is an inner product and that this adjoint exists as a well-defined linear map; it also establishes that G=S∗S is real symmetric positive semidefinite.

For this positive semidefinite real matrix G, let G+ be its unique Moore–Penrose pseudoinverse in Mm(R), defined by the four Penrose equations over R. Define the canonical dual operators Da=∑b=1m(G+)baFb and the reconstruction map D:Rm→Hd, Dc=∑a=1mcaDa. A later A-page lemma identifies this finite pseudoinverse with its spectral formula.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Two-sided Hoeffding bound for Bernoulli frequencies

Statement

Let n≥1, p∈[0,1], and let X1,…,Xn:Ω→{0,1} be measurable on a probability space with P(X1=x1,…,Xn=xn)=∏k=1nbp(xk)for every (x1,…,xn)∈{0,1}n. Here bp(1)=p and bp(0)=1−p, including p=0 and p=1. Thus the variables have the stated independent Bernoulli product law. For their frequency f=n−1∑k=1nXk and every t>0,

P(∣f−p∣≥t)≤2e−2nt2.

No axiom of choice is assumed.

Facts & Assumptions

Given: n≥1, p∈[0,1], and the finite Bernoulli product law in the Statement.

[A1]

For each tuple in {0,1}n, its probability is the product of the one-coordinate probabilities bp(1)=p and bp(0)=1−p.

[F1]

The Hoeffding MGF bound for a variable in a unit interval: if Y is measurable with 0≤Y≤1 almost surely, then Eeλ(Y−EY)≤eλ2/8 for every real λ; its proof does not assume choice.

Proof

1.1givenA1F1algebra

Summing the product law [A1] over the other n−1 coordinates gives P(Xk=1)=p∏j≠k(p+(1−p))=p, so EXk=p. Put S=∑k=1n(Xk−p). By [F1], Eeλ(Xk−p)≤eλ2/8 for every real λ. Expanding the finite expectation over {0,1}n and using [A1] factors it into the product of these n expectations. Hence EeλS≤enλ2/8.

2.1givenA1step 1.1algebra

For λ>0, S≥nt implies eλS≥eλnt. For any nonnegative W and c>0, W≥c 1{W≥c}, so P(W≥c)≤EW/c. Apply this to W=eλS and then step 1.1 to get P(f−p≥t)≤e−λnt+nλ2/8. Setting λ=4t gives e−2nt2.

3.1step 2.1givenA1step 1.1algebra∎

Apply the same argument to −S, using step 1.1 at −4t; it gives P(p−f≥t)≤e−2nt2. The union bound follows from 1A∪B≤1A+1B, so adding the two tails proves the claim. Endpoints p=0,1 are included by [A1]: then every Xk=p almost surely and the left side is zero for t>0.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite instrument dilation with an outcome register

Statement

Let d,e≥1 and let A be a finite nonempty outcome set. A finite completely positive instrument from Cd to Ce is a family of completely positive complex-linear maps Ia:Md(C)→Me(C), indexed by a∈A, whose sum is trace-preserving. Then there are an integer q≥1, an isometry V:Cd→Ce⊗Cq, and pairwise orthogonal projections Qa on Cq with ∑aQa=Iq such that, for every X∈Md(C),

Ia(X)=Tr⁡E ⁣[(Ie⊗Qa)VXV∗(Ie⊗Qa)].

Here E=Cq is the finite register space with its displayed orthonormal basis, and the partial trace is defined on its matrix units by Tr⁡E(Y⊗∣ea,r⟩⟨eb,s∣)=δ(a,r),(b,s)Y, extended linearly. The register basis is indexed by the Kraus labels (a,r); a zero outcome map has no labels and corresponds to Qa=0.

Facts & Assumptions

Given: d,e≥1, a finite nonempty set A, and completely positive maps Ia:Md(C)→Me(C) such that ∑aIa is trace-preserving.

[A1]

The outcome set A is finite and nonempty, each Ia is completely positive, and their sum is trace-preserving, exactly as in the Statement.

[F1]

Finite completely positive trace-preserving maps: complete positivity means every finite ancilla amplification id⁡r⊗Φ preserves positive semidefinite matrices; trace preservation means Tr⁡Φ(X)=Tr⁡X for every input matrix.

[F2]

Complete finite Choi-Kraus equivalence: every finite completely positive map Φ:Md(C)→Me(C) has a finite Kraus representation Φ(X)=∑rKrXKr∗; for any such representation, Φ is trace-preserving exactly when ∑rKr∗Kr=Id.

Proof

1.1givenA1F1F2construct

By [F1], each Ia is completely positive in the finite matrix sense. Apply [F2] to obtain a finite Kraus family (Ka,r)r for it, allowing the empty family for a zero map. Since A is finite, these finitely many choices require only finite choice. Put q=∑aqa, where qa is the number of Kraus operators for outcome a.

2.1givenA1F1F2step 1.1algebra

The combined map ∑aIa has Kraus family (Ka,r)a,r and is trace-preserving by [A1] and [F1]. Thus [F2] gives ∑a,rKa,r∗Ka,r=Id. Since d≥1, this identity implies q≥1.

3.1A1step 2.1constructalgebra

Let (ea,r)a,r be the standard orthonormal basis of Cq indexed by these labels. Define Vx=∑a,rKa,rx⊗ea,r and Qa=∑r∣ea,r⟩⟨ea,r∣. Then V∗V=∑a,rKa,r∗Ka,r=Id, so V is an isometry. Disjoint label sets make the Qa pairwise orthogonal and their sum Iq.

4.1A1step 1.1step 3.1algebra∎

Expanding the sandwich gives ∑r,sKa,rXKa,s∗⊗∣ea,r⟩⟨ea,s∣ with both labels restricted to outcome a. The partial trace sends each register matrix unit ∣ea,r⟩⟨ea,s∣ to δrs, leaving ∑rKa,rXKa,r∗=Ia(X) by step 1.1. This proves the claimed formula.

Remarks

The finite Kraus family in this proof carries both the outcome label and its internal Kraus label. The projection Qa groups all labels that yield the same outcome; tracing out the register after that projection removes cross terms. The identity is a finite-dimensional algebraic dilation statement and makes no claim about a laboratory apparatus.

The following diagram records the factorization of the displayed map. Its arrows name the maps in the formula; the proof is the matrix expansion in step 4.1 and does not rely on the diagram.

diagram failed to render:
M_d(\mathbb C)
  \arrow[r, "X\mapsto VXV^*"]
  \arrow[dr, "I_a"']
&
M_e(\mathbb C)\otimes M_q(\mathbb C)
  \arrow[r, "Z\mapsto(I_e\otimes Q_a)Z(I_e\otimes Q_a)"]
&
M_e(\mathbb C)\otimes M_q(\mathbb C)
  \arrow[dl, "\operatorname{Tr}_E"]
\\
& M_e(\mathbb C)
TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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 (Pi)i∈I and (Qj)j∈J be projection-valued measures: Pi=Pi∗=Pi2, Qj=Qj∗=Qj2, distinct projections in each family are orthogonal, and ∑iPi=∑jQj=IH. A joint POVM is a family of effects (Gij)(i,j)∈I×J with ∑i,jGij=IH, ∑jGij=Pi, and ∑iGij=Qj. Such a joint POVM exists exactly when PiQj=QjPi for every i,j. When it exists it is unique and equals Gij=PiQj.

Facts & Assumptions

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

[A1]

The families (Pi)i∈I and (Qj)j∈J each consist of pairwise orthogonal projections summing to IH.

[F1]

Finite effects and instruments: normalization and non-determination of the update: a finite POVM is a family of effects 0≤Fa≤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 Pi commute with all Qj. Then Gij=PiQj is self-adjoint, since (PiQj)∗=QjPi=PiQj, and is idempotent, since (PiQj)2=Pi2Qj2=PiQj. For any x, ⟨Gijx,x⟩=⟨Gijx,Gijx⟩≥0, so each is positive; the sum identity makes each bounded above by IH. Finite summation gives ∑i,jGij=(∑iPi)(∑jQj)=IH, and the two marginal sums are Pi and Qj. So this family is a joint POVM.

1.2givenA1F1F2algebra

Conversely, suppose a joint POVM (Gij) exists. For each pair, 0≤Gij≤Pi because Pi−Gij=∑k≠jGik≥0, and similarly 0≤Gij≤Qj. If x∈ker⁡Pi, then 0≤⟨Gijx,x⟩≤⟨Pix,x⟩=0. By [F2], ⟨Gijx,x⟩=∥Gij1/2x∥2, hence Gijx=0 and Gij(I−Pi)=0. Taking adjoints gives (I−Pi)Gij=0, so Gij=PiGijPi. The same argument yields Gij=QjGijQj.

2.1A1step 1.2algebra∎

Using Pi=∑kGik and Qj=∑ℓGℓj, we obtain PiQj=∑kGikQj. The support relation Gik=QkGikQk from step 1.2 makes every term with k≠j zero, and the k=j term is Gij. Therefore PiQj=Gij. Since Gij is self-adjoint, taking adjoints gives QjPi=Gij=PiQj. 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.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The real trace pairing on finite Hermitian matrices is an inner product

Statement

Let Hd be the real vector space of Hermitian d×d complex matrices from the preceding definition. The pairing ⟨A,B⟩HS=Tr⁡(AB) is real-valued, symmetric, real-bilinear, and positive definite on Hd. Its associated norm is ∥A∥HS=Tr⁡(A2). For every m≥1 and finite family F1,…,Fm∈Hd, the Gram matrix Gab=Tr⁡(FaFb) is real symmetric positive semidefinite, equals S∗S for the synthesis map Sc=∑acaFa, and satisfies ker⁡G=ker⁡S.

Facts & Assumptions

Given: d,m≥1, the Hermitian matrices Hd, the trace pairing, the family F1,…,Fm, and the synthesis map defined in the preceding definition.

[F1]

Finite Hermitian frames and their Gram pseudoinverse: Hd is a real vector space, ⟨A,B⟩HS=Tr⁡(AB), and Gab=Tr⁡(FaFb).

[F2]

Finite matrix trace cyclicity and nondegeneracy: Tr⁡(AB)=Tr⁡(BA) for finite square matrices.

[F3]

Finite matrix spectral and state calculus: every finite Hermitian matrix has an orthonormal eigenbasis with real eigenvalues.

[F4]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: in a real or complex inner-product space, ∣⟨u,v⟩∣≤∥u∥∥v∥.

Proof

1.1givenF1F2algebra

For Hermitian A,B, Tr⁡(AB)‾=Tr⁡((AB)∗)=Tr⁡(BA)=Tr⁡(AB) by [F2]. The trace is additive and real-homogeneous, so the pairing is real-valued, symmetric, and real-bilinear.

2.1F3step 1.1algebra

Diagonalize A∈Hd by [F3] with real eigenvalues λ1,…,λd. Then Tr⁡(A2)=∑jλj2≥0, with equality exactly when all λj=0, hence exactly when A=0. This proves positive definiteness and the displayed square-root formula.

3.1F1F2step 1.1step 2.1F4algebra∎

For c∈Rm, bilinearity gives cTGc=Tr⁡((Sc)2)=∥Sc∥HS2≥0. For X∈Hd, the vector v with coordinates va=Tr⁡(FaX) satisfies ⟨Sc,X⟩HS=cTv for every c, so it is S∗X. By [F2], va=Tr⁡(XFa); hence the matrix of S∗S is precisely G. The equality ⟨c,Gc⟩=∥Sc∥HS2 implies ker⁡G=ker⁡S: Sc=0 gives Gc=0, while Gc=0 gives ∥Sc∥HS2=0 and hence Sc=0 by step 2.1. By [F4], ∣⟨A,B⟩HS∣≤∥A∥HS∥B∥HS; expanding ∥A+B∥HS2 and applying this bound gives ∥A+B∥HS≤∥A∥HS+∥B∥HS. Thus the formula is a norm.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Informationally complete linear tomography

Definition

Input integers d,m≥1, a finite POVM (Fa)a=1m on Cd that spans the real Hermitian matrices, and real frequencies fa≥0 with ∑afa=1. Form the Gram matrix Gab=Tr⁡(FaFb), compute its Moore–Penrose inverse G+, set Da=∑b(G+)baFb, and return

X=∑a=1mfaDa.

All sums and matrices are finite. The output is Hermitian. The procedure does not project X onto the positive cone, and it makes no positivity claim for finite frequency inputs.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The Gram pseudoinverse reconstructs a spanning Hermitian frame

Statement

Let d,m≥1, let F1,…,Fm∈Hd span Hd over R, and form S, G=S∗S, G+, and Da as in the preceding finite-frame definition. If G=∑λ>0λPλ is its finite spectral resolution, then G+=∑λ>0λ−1Pλ. Moreover, every X∈Hd is reconstructed by

X=∑a=1mTr⁡(XFa)Da.

This holds for redundant families as well as bases; G need not be invertible.

Facts & Assumptions

Given: d,m≥1, a spanning family F1,…,Fm∈Hd, its synthesis map S, Gram matrix G=S∗S, Moore–Penrose inverse G+, and canonical dual Da.

[A1]

The finite family F1,…,Fm spans Hd over R, as required in the Statement.

[F1]

Finite Hermitian frames and their Gram pseudoinverse: Hd is a real space with the trace pairing Tr⁡(AB); Gab=Tr⁡(FaFb); Da=∑b(G+)baFb.

[F2]

The real trace pairing on finite Hermitian matrices is an inner product: the Hilbert–Schmidt trace pairing is a real inner product, G=S∗S is real positive semidefinite, and ker⁡G=ker⁡S.

[F3]

Finite matrix spectral and state calculus: every finite Hermitian matrix has an orthonormal eigenbasis with real eigenvalues.

[F4]

The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations: G+ satisfies GG+G=G, G+GG+=G+, and both GG+ and G+G are self-adjoint.

[F5]

Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse: every finite real matrix has a unique matrix satisfying the four Penrose equations.

Proof

1.1F1F2algebra

By [F2], G is real symmetric positive semidefinite, G=S∗S, and ker⁡G=ker⁡S. The coordinate formula for the adjoint is (S∗X)a=⟨Fa,X⟩HS=Tr⁡(XFa) by [F1] and [F2].

2.1F2F3F4F5step 1.1algebra

Regard the real symmetric positive semidefinite matrix G as a complex Hermitian matrix and apply [F3]. Its eigenvalues are real. If z=x+iy is in the complex eigenspace for a real eigenvalue λ, then realness of G gives Gx=λx and Gy=λy; thus that eigenspace is the complexification of its real eigenspace. Real eigenspaces for distinct eigenvalues are orthogonal, since Gu=λu, Gv=μv, and symmetry give (λ−μ)uTv=0. The real eigenspaces form a direct sum of dimension m: their complexifications are the orthogonal complex eigenspaces, which span Cm by [F3]. Each eigenvalue is nonnegative because, for a nonzero real eigenvector x with Gx=λx, λ∥x∥22=xTGx≥0. In each real eigenspace, take a finite basis v1,…,vk and set u1=v1/∥v1∥2 and uj=(vj−∑i<j(vjTui)ui)/∥vj−∑i<j(vjTui)ui∥2 for 2≤j≤k; basis independence makes every denominator nonzero, and these vectors form a real orthonormal basis. These bases give a real spectral resolution G=∑λ≥0λPλ with real orthogonal projections whose sum is I. Put H0=∑λ>0λ−1Pλ. Orthogonality gives GH0G=G, H0GH0=H0, and GH0=H0G=∑λ>0Pλ, which are self-adjoint. Thus H0 satisfies the four Penrose equations [F4], and uniqueness in [F5] gives H0=G+. Consequently Q=G+G=∑λ>0Pλ is an orthogonal projection and ker⁡Q=ker⁡G, so Ran⁡(I−Q)=ker⁡G=ker⁡S by [F2].

3.1A1F1F2step 1.1step 2.1algebra∎

The synthesis map of the canonical dual is D=SG+ by [F1]. For any X∈Hd, the spanning hypothesis [A1] supplies c∈Rm with X=Sc. Then D(S∗X)=SG+S∗Sc=SG+Gc=SQc=Sc=X, because c−Qc∈Ran⁡(I−Q)=ker⁡S by step 2.1. The coordinates of S∗X are Tr⁡(XFa) by step 1.1, which proves the stated sum.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Tomography correctness and finite-sample stability

Statement

Let d,m,n≥1, let (Fa)a=1m be a finite POVM on Cd whose real span is Hd, and let ρ∈Hd satisfy ρ≥0 and Tr⁡ρ=1. Put pa=Tr⁡(ρFa), form the canonical dual Da from the Gram pseudoinverse, and write D:Rm→Hd for Dc=∑acaDa.

Define the frequency simplex Δm={f∈Rm:fa≥0 for all a, ∑afa=1} and the real-linear map X:Rm→Hd by X(f)=∑afaDa. On Δm, this is the output of the previously defined linear-inversion procedure; on all of Rm, X denotes its linear extension. Use the induced operator norm ∥D∥2→HS=sup⁡∥c∥2=1∥Dc∥HS.

Then exact probabilities reconstruct the state: X(p)=ρ. For every real frequency vector f∈Rm,

∥X(f)−ρ∥HS≤∥D∥2→HS∥f−p∥2.

Let (Ω,F,P) be a probability space and let Y1,…,Yn:Ω→{1,…,m} be measurable with the independent product law P(Y1=a1,…,Yn=an)=∏kpak for every outcome tuple. Define fa=n−1∑k=1n1{Yk=a}. Then for every 0<δ<1,

P ⁣(max⁡1≤a≤m∣fa−pa∣≤log⁡(2m/δ)2n)≥1−δ.

Consequently, with probability at least 1−δ,

∥X(f)−ρ∥HS≤∥D∥2→HSmlog⁡(2m/δ)2n.

These are conditional mathematical statements under the specified product sampling law; no empirical data or calibrated apparatus is asserted.

Facts & Assumptions

Given: The finite POVM and spanning, density-matrix, and independent product-sampling hypotheses in the Statement.

[A1]

The sample outcomes have the independent product law with one-trial probabilities (pa)a=1m stated in the Statement.

[F1]

The Gram pseudoinverse reconstructs a spanning Hermitian frame: for every H∈Hd, ∑aTr⁡(HFa)Da=H.

[F2]

Finite effects and instruments: normalization and non-determination of the update: for a density operator ρ and finite POVM (Fa), pa=Tr⁡(ρFa)≥0 and ∑apa=1.

[F3]

Informationally complete linear tomography: on an admissible frequency vector f∈Δm, the procedure returns X(f)=∑afaDa; the Statement defines the same formula as a linear map on all of Rm.

[F4]

Two-sided Hoeffding bound for Bernoulli frequencies: for n independent Bernoulli(p) variables, their frequency f satisfies P(∣f−p∣≥t)≤2e−2nt2 for every t>0, without a choice assumption.

[F6]

The Cauchy-sequence reals have the least-upper-bound property: every nonempty bounded-above set of real numbers has a supremum.

[F7]

The real trace pairing on finite Hermitian matrices is an inner product: the Hilbert–Schmidt trace pairing on Hd is a real inner product and its induced norm is ∥A∥HS=Tr⁡(A2).

Proof

1.1givenF1F2F3algebra

Apply [F1] with H=ρ. Then ∑apaDa=ρ, so [F3] gives X(p)=ρ. The probabilities are in [0,1] and sum to one by [F2].

1.2givenA1F2F3F4algebra

For each sample k, ∑a=1m1{Yk=a}=1, so fa≥0 and ∑afa=1, as required by [F3]. Fix an outcome a and set Zka=1{Yk=a}. For every z∈{0,1}n, summing [A1] over the finite outcome tuples with 1{Yk=a}=zk gives P(Z1a=z1,…,Zna=zn)=∏k=1n∑b: 1{b=a}=zkpb=∏k=1nbpa(zk), since [F2] gives ∑bpb=1. Thus these indicators have the Bernoulli product law, and [F4] yields P(∣fa−pa∣≥t)≤2e−2nt2. No independence between indicators for different outcomes is used.

2.1givenF5F6F7step 1.1algebra

By linearity, X(f)−ρ=D(f−p). Set C=(∑a∥Da∥HS2)1/2. By [F7], this is the norm from a real inner product, so its triangle inequality follows from [F5] by expanding the square of a sum. Thus ∥Dc∥HS≤∑a∣ca∣∥Da∥HS≤C∥c∥2. Since m≥1, the unit sphere in Rm contains e1, so the set {∥Dc∥HS:∥c∥2=1} is nonempty; the bound makes it bounded above. Its supremum exists by [F6] and is the finite induced operator norm in the Statement. Scaling c (and treating c=0 directly) gives ∥Dc∥HS≤∥D∥2→HS∥c∥2, which proves the deterministic estimate.

3.1givenA1step 2.1step 1.2algebra∎

A finite union bound gives P(∃a: ∣fa−pa∣≥t)≤2me−2nt2. Set t=log⁡(2m/δ)/(2n), which is positive since 2m/δ>1; then the right side is δ. On the complementary event, ∥f−p∥2≤m t, and step 2.1 gives the asserted state-error bound.

5 · Examples, experiments and counterexamples

None yet.

Sources