Alphabeta Math
LemmaStatement: AI-generatedProof: AI-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 absorbing lowering dynamics and replacement limit

Statement

Let V=⨁j=0JVj be a finite-dimensional complex inner-product space with an orthogonal grading, J≥0, and V0=Cg for a unit vector g. Let Pj be the orthogonal projection onto Vj. Let H=H† preserve every block, and let finitely many linear maps La satisfy LaVj⊆Vj−1, with V−1={0}. Define R=∑aLa†La and assume that, for some r∗>0, PjRPj≥r∗Pj for every j≥1, where the inequality means that the difference has nonnegative quadratic form. This is a uniform lower bound on the total exit rate of every vector in each excited block.

For t≥0 let Nt=etL, where L(X)=−i[H,X]+∑a(LaXLa†−{La†La,X}/2). Then Nt converges as t→∞ to the replacement channel R(X)=Tr⁡(X)∣g⟩⟨g∣, in the induced norm of the entrywise ℓ1 matrix norm in any fixed orthonormal basis. In particular, every initial density operator has ground population tending to one and all excited populations and ground–excited coherences tending to zero. The stated rate bound excludes a nonzero excited vector annihilated by all jumps. Here, in the chosen orthonormal basis, ∥X∥ent,1=∑k,l∣Xkl∣, and the induced norm of a linear map T on operators is ∥T∥ent,1→ent,1=sup⁡∥X∥ent,1≤1∥T(X)∥ent,1. The norm axioms and boundedness of every such T are verified in step 4.1.

If d=dim⁡V and (ek)k=1d is any orthonormal basis, R has Kraus operators Kk=∣g⟩⟨ek∣ and its input-first, unnormalized Choi matrix has rank d; hence d is also the minimum Kraus number.

Facts & Assumptions

Given: The finite orthogonal grading, operators and lower bound in the Statement. A density operator is a positive semidefinite operator of trace one.

Goal: Prove the population and channel limits and the asserted Kraus and Choi properties.

[F1]

The lowering supplier gives the finite graded generator and shows that each lower cutoff is invariant under its exponential. Invariant finite truncation for lowering generators

[F2]

For Hermitian H and finitely many jumps on a finite-dimensional space, the displayed exponential is a completely positive trace-preserving linear map for every t≥0. Finite GKSL evolution and the QEC channel interface

[F3]

A finite-dimensional positive semidefinite operator has an orthonormal eigenbasis with nonnegative eigenvalues and a positive square root. Finite support square roots and generalized inverses

[F4]

Real power series may be differentiated term by term inside their radius of convergence; the real exponential has derivative equal to itself, and the usual algebra rules apply to derivatives. Inside its radius a real power series may be differentiated term by term, and the differentiated series has the same radius The exponential function is smooth and (exp)'=exp Sums, scalar multiples, products and quotients: (f+g)'(c) = f'(c) + g'(c), (α f)'(c) = α f'(c), (fg)'(c) = f'(c)g(c) + f(c)g'(c), and (f/g)'(c) = (f'(c)g(c) - f(c)g'(c))/g(c)² when g(c) ≠ 0 The real chain rule gives (f∘h)′(t)=f′(h(t))h′(t) when h is differentiable at t and f is differentiable at h(t), with both points limit points of their respective domains. The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f ∘ g is differentiable at c with (f ∘ g)'(c) = f'(g(c)) g'(c)

[F5]

The mean value theorem applies to a real function continuous on a closed interval and differentiable on its interior. For c>0, e−ct→0 as t→∞. The mean value theorem, as the case g(x) = x of Cauchy's: for f continuous on [a,b] with a < b and differentiable on (a,b) there is c ∈ (a,b) with f(b) - f(a) = f'(c)(b-a) The exponential dominates every fixed nonnegative integer power at +∞

[F6]

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

[F7]

The input-first Choi matrix is ∑k,l∣ek⟩⟨el∣⊗Φ(∣ek⟩⟨el∣). For a finite-dimensional channel, its Choi rank is its minimum Kraus number. Choi matrix with input factor first Canonical Choi eigenvectors, Kraus rank and branch weights

[F8]

For a bounded linear map T between normed spaces over the same scalar field, its operator norm is the finite supremum sup⁡∥X∥≤1∥T(X)∥. The operator norm as the least bound and as the unit-sphere or unit-ball supremum

Proof

1.1givenF1algebra

If J=0, the space is one-dimensional, all jumps vanish and H is scalar, so L=0 and every operator already equals its trace times ∣g⟩⟨g∣. Assume henceforth J≥1. Put D=∑j=0JjPj and Q=I−P0. The lowering relation gives [D,La]=−La, including on V0, while H and every La†La preserve the blocks. The latter follows from orthogonality: for u∈Vj and v∈Vk with j≠k, ⟨Lau,Lav⟩=0. Thus cyclicity of the finite trace gives Tr⁡(DL(X))=−Tr⁡(RX) for every X. The blockwise rate hypothesis implies R≥r∗Q; also Q≤D≤JQ.

2.1givenF2F3F4F5step 1.1algebra

Let ρ be a density operator and put ρt=Nt(ρ) and m(t)=Tr⁡(Dρt). By [F2], ρt is positive and has trace one. The convergent exponential series, differentiated entrywise using [F4], gives ρ˙t=L(ρt). By step 1.1, m′(t)=−Tr⁡(Rρt)≤−r∗Tr⁡(Qρt)≤−(r∗/J)m(t). The trace inequalities follow by diagonalizing the positive operator ρt as in [F3] and applying the quadratic-form inequalities to its eigenvectors. Let c=r∗/J>0. The difference quotient of t↦ct equals c, and the exponential is differentiable on R; hence the chain rule in [F4], applied on real domains, gives (ect)′=cect. The product rule in [F4] now gives (ectm(t))′=ect(cm(t)+m′(t))≤0; [F5] therefore makes ectm(t) nonincreasing on every finite interval. Hence 0≤Tr⁡(Qρt)≤m(t)≤m(0)e−ct≤Je−ct.

3.1givenF3F5F6step 2.1algebra

Choose an orthonormal basis beginning with g and continuing with vectors in the excited blocks. Write its matrix entries as (ρt)ab. By [F3], ρt has a positive square root; applying [F6] to its images of two basis vectors gives ∣(ρt)ab∣2≤(ρt)aa(ρt)bb. Every excited diagonal entry is between zero and Tr⁡(Qρt), and the ground entry is 1−Tr⁡(Qρt). Step 2.1 and [F5] therefore show that every matrix entry of ρt converges to the corresponding entry of ∣g⟩⟨g∣, including all off-diagonal entries. In particular all excited populations vanish and the ground population tends to one.

4.1givenF2F8step 3.1algebra

The entrywise function in the Statement is a norm: it vanishes exactly on the zero matrix, is absolutely homogeneous, and satisfies the triangle inequality by summing ∣Xkl+Ykl∣≤∣Xkl∣+∣Ykl∣. The rank-one operators ∣ek⟩⟨el∣ form a basis of the operator space. Each diagonal unit is a density operator. For k≠l, the polarization identity expresses ∣ek⟩⟨el∣ as a fixed complex linear combination of the four rank-one positive operators formed from ek±el and ek±iel; after division by their traces these are density operators. By linearity and step 3.1, Nt(Ekl)→Tr⁡(Ekl)∣g⟩⟨g∣ entrywise for every matrix unit. For any linear map T on this operator space, put CT=max⁡k,l∥T(Ekl)∥ent,1, a finite maximum. For X=∑k,lxklEkl, linearity and the triangle inequality give ∥T(X)∥ent,1≤∑k,l∣xkl∣∥T(Ekl)∥ent,1≤CT∥X∥ent,1. Thus T is bounded, so the operator-norm definition in [F8] applies and gives ∥T∥ent,1→ent,1≤CT. For T=Nt−R, each matrix-unit image tends entrywise to zero, so its finite sum of absolute entries tends to zero; the maximum over the finitely many pairs also tends to zero. This proves the asserted channel convergence. The same argument applies in any fixed orthonormal basis.

5.1givenF7step 1.1step 4.1algebra∎

For Kk=∣g⟩⟨ek∣, direct expansion gives ∑kKkXKk†=Tr⁡(X)∣g⟩⟨g∣ and ∑kKk†Kk=I. By [F7], the Choi matrix is ∑k∣ek⟩⟨ek∣⊗∣g⟩⟨g∣=I⊗∣g⟩⟨g∣, whose rank is d; [F7] gives the minimum Kraus number. Finally, if an excited vector v is annihilated by every La, then ⟨v,Rv⟩=0, whereas step 1.1 gives ⟨v,Rv⟩≥r∗∥v∥2; hence v=0. Together with the J=0 case, this proves all claims.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.