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.

Finite completely positive trace-preserving maps — Examples

1 · Prerequisites

2 · Summary

These exact finite calculations separate positivity from complete positivity, show a channel that lowers von Neumann entropy, and exhibit correlated joint preparations with the same system marginal but different outputs. A final two-qubit product-preparation model gives channel maps at every time while violating the semigroup law through a coherence revival. The counterexamples report no measurements and make no universal claim about every correlated preparation or every finite bath.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

None yet.

5 · Examples, experiments and counterexamples

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Amplitude damping can decrease system entropy

Statement refuted

Every finite quantum channel Φ and every positive semidefinite trace-one matrix ρ satisfy S(Φ(ρ))≥S(ρ).

Facts & Assumptions

Given: The finite channel and entropy definitions, kB>0 with units J K−1, and the full Axiom of Choice as required by the KL supplier below.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. It is an explicit hypothesis of the published KL nonnegativity supplier used for the strict entropy comparison.

[F1]

Finite completely positive trace-preserving maps: a finite channel is a complex-linear completely positive trace-preserving map.

[F2]

Complete finite Choi-Kraus equivalence: a finite Kraus map X↦∑aKaXKa∗ is completely positive, and it is trace-preserving when ∑aKa∗Ka=I.

[F3]

Quantum spectral entropy and relative-entropy domains: for a positive trace-one matrix with eigenvalues λi, S(ρ)=−kB∑iλiln⁡λi, with 0ln⁡0=0.

[F4]

Kullback–Leibler divergence: for probability laws P≪Q, D(P∥Q)=∫ln⁡(dP/dQ) dP, using the natural logarithm.

[F5]

Kullback–Leibler divergence is nonnegative: under full AC, D(P∥Q)≥0, with equality exactly when P=Q.

[F6]

The real exponential function and the number e by a power series: exp⁡(x) is the real exponential function defined by its power series, with exp⁡(0)=1.

[F8]

The exponential function is strictly increasing: x<y implies exp⁡(x)<exp⁡(y).

Counterexample

1.1givenF1F2F6F7F8algebra

Fix γ>0 in s−1 and t>0 in seconds, so 0<e−γt<1 by [F6]–[F8]. On C2, define K0=diag⁡(e−γt/2,1), K1=1−e−γt ∣1⟩⟨0∣, and Φt(X)=K0XK0∗+K1XK1∗. Since K0∗K0+K1∗K1=I2, [F2] and [F1] show that Φt is a finite channel.

2.1givenA1F3F4F5F6F7F8step 1.1algebra∎

The matrix ρ0=I2/2 is positive semidefinite with trace one. Direct multiplication gives Φt(ρ0)=diag⁡(p,1−p), where p=e−γt/2∈(0,1/2) by [F6]–[F8]. The entropy difference is S(ρ0)−S(Φt(ρ0))=kB(ln⁡2−h(p)), where h(p)=−pln⁡p−(1−p)ln⁡(1−p). For the binary laws P=(p,1−p) and Q=(1/2,1/2), [F4] gives D(P∥Q)=ln⁡2−h(p); since P≠Q, [F5] gives D(P∥Q)>0. With kB>0, this yields S(Φt(ρ0))<S(ρ0) and refutes the universal claim.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Transpose positivity fails ancillary positivity

Statement refuted

Every complex-linear positive trace-preserving map between finite matrix algebras is completely positive.

Facts & Assumptions

Given: The standard ordered basis of C2, finite matrix transpose T(X)=XT, and the finite channel definitions.

[F1]

Finite completely positive trace-preserving maps: a positive map sends positive semidefinite inputs to positive semidefinite outputs; complete positivity additionally requires positivity of id⁡r⊗Φ for every finite r.

[F2]

Finite matrix spectral and state calculus: every positive semidefinite finite matrix has a positive square root, finite Hermitian matrices have spectral decompositions, and the finite trace is cyclic.

[F3]

Complete finite Choi-Kraus equivalence: with the unnormalized Choi matrix J(Φ)=∑i,jEij⊗Φ(Eij), a finite map is completely positive if and only if J(Φ)≥0.

Counterexample

1.1givenF1F2algebra

The transpose is complex-linear and preserves trace because it fixes the diagonal entries. For any X≥0, [F2] gives X=YY∗ for some matrix Y; hence T(X)=XT=Y‾YT=Y‾(Y‾)∗≥0. Thus T is positive and trace-preserving.

2.1givenF3step 1.1algebra∎

Its Choi matrix is J(T)=∑i,j=01Eij⊗Eji, the swap operator F(∣a⟩⊗∣b⟩)=∣b⟩⊗∣a⟩. For η=(∣0⟩⊗∣1⟩−∣1⟩⊗∣0⟩)/2, one has Fη=−η; therefore J(T)≱0. By [F3], T is not completely positive.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Correlated preparations with identical marginals diverge

Statement refuted

For fixed finite system and environment spaces and a fixed joint unitary U, the final system matrix Tr⁡E(UωU∗) is determined by the initial system marginal Tr⁡Eω for every positive semidefinite trace-one matrix ω.

Facts & Assumptions

Given: Two qubit spaces HS=HE=C2, the standard ordered product basis, and the finite partial trace over HE.

[F1]

Partial trace over a finite tensor factor: in product-basis coordinates, (Tr⁡ER)aa′=∑b=01R(a,b),(a′,b); the second tensor factor is contracted.

[F2]

Independent-preparation reduced unitary channel: a fixed finite unitary and a fixed product preparation ρ⊗σE induce a finite channel. This result makes no claim that correlated joint preparations are determined by the system marginal alone.

Counterexample

1.1givenF1algebra

Let ∣ψ±⟩=(∣00⟩±∣11⟩)/2 and ω±=∣ψ±⟩⟨ψ±∣; each ω± is positive semidefinite with trace one. Using [F1], the cross terms ∣00⟩⟨11∣ and ∣11⟩⟨00∣ vanish under Tr⁡E because their environment indices differ, while the diagonal terms give Tr⁡Eω+=Tr⁡Eω−=I2/2.

2.1givenF1F2step 1.1algebra∎

Define U∣a,b⟩=∣a,a⊕b⟩ for a,b∈{0,1}, where ⊕ is addition modulo two. This CNOT map permutes the orthonormal product basis and is therefore unitary. It sends ∣ψ±⟩ to ∣±⟩⊗∣0⟩, where ∣±⟩=(∣0⟩±∣1⟩)/2. Thus Tr⁡E(Uω±U∗)=∣±⟩⟨±∣, and the outputs are distinct because their (0,1) matrix entries are 1/2 and −1/2. Equal system marginals therefore do not determine the final system state for these correlated preparations, refuting the claim. The product-preparation theorem [F2] is unaffected.

Remarks

The diagram uses the standard circuit convention: horizontal wires carry the system S and environment E from left to right; the filled control dot is on S, and ⊕ is the target on E. It depicts the same basis permutation defined in step 2.1 and is illustrative only.

SE
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite-bath dephasing revival violates semigroup

Statement refuted

Every reduced-unitary family from a fixed finite system–environment Hamiltonian and a fixed product environment state is a semigroup: Φt+s=Φt∘Φs for all t,s≥0.

Facts & Assumptions

Given: Finite system and environment spaces C2, a total Hamiltonian H=H∗, ℏ>0 in joule-seconds, time in seconds, and a fixed product preparation ρ⊗σE.

[F1]

Partial trace over a finite tensor factor: Tr⁡E contracts the environment coordinate in the ordered product basis, (Tr⁡ER)aa′=∑bR(a,b),(a′,b).

[F2]

Finite matrix spectral and state calculus: finite Hermitian matrices have spectral exponentials, and the finite trace is cyclic.

[F3]

Independent-preparation reduced unitary channel: for a finite Hermitian total Hamiltonian and fixed environment density σE, the product-prepared reduced map Φt(ρ)=Tr⁡E(Ut(ρ⊗σE)Ut∗) is a channel for each real t and uses the operator-norm power-series exponential. This theorem does not assert a semigroup law.

[F4]

The complex exponential by its power series: exp⁡z=∑n=0∞zn/n! for every z∈C, and exp⁡0=1.

[F6]

exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0: for real θ, exp⁡(iθ)=cos⁡θ+isin⁡θ and ∣exp⁡(iθ)∣=1.

[F7]

t↦(cos⁡t,sin⁡t) is a bijection from [0,2π) onto the real unit circle: every point of the unit circle has the form (cos⁡θ,sin⁡θ) for some θ∈[0,2π).

Counterexample

1.1givenF1F2F3F4F5F6algebra

Let Z=diag⁡(1,−1), take g>0 in s−1, and set H=ℏg Z⊗Z. With σE=I2/2=12∑b=±1∣b⟩⟨b∣ and Ut=e−itH/ℏ, the power-series definition of the finite operator exponential in [F3] and the Z-eigenbasis give Ut=∑b=±1diag⁡(exp⁡(−ibgt),exp⁡(ibgt))⊗∣b⟩⟨b∣. Applying [F1] to the two orthogonal environment sectors yields Φt(ρ)=12(VtρVt∗+Vt∗ρVt), where Vt=diag⁡(exp⁡(−igt),exp⁡(igt)). In matrix coordinates, Φt ⁣(axyd)=(aκ(t)xκ(t)yd) with κ(t):=12(exp⁡(−2igt)+exp⁡(2igt)). By [F3], each Φt is a channel.

2.1givenF4F5F6F7step 1.1algebra∎

By [F7], choose a dimensionless θ∈[0,2π) with (cos⁡θ,sin⁡θ)=(0,1); hence θ>0. Equation [F6] gives exp⁡(iθ)=i, and [F5] with [F4] gives exp⁡(−iθ)=−i and exp⁡(2iθ)=exp⁡(−2iθ)=−1. Set τ=θ/(2g)>0 and ρ+=∣+⟩⟨+∣, with ∣+⟩=(∣0⟩+∣1⟩)/2. By step 1.1, κ(τ)=12(−i+i)=0 and κ(2τ)=12(−1−1)=−1. Therefore Φτ(Φτ(ρ+))=I2/2 whereas Φ2τ(ρ+)=∣−⟩⟨−∣, where ∣−⟩=(∣0⟩−∣1⟩)/2. The outputs differ, so Φ2τ≠Φτ∘Φτ; the family is not a semigroup.

Sources