Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Weyl product and sum inequalities for compact operators

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H be a complex Hilbert space and let T:H→H be compact (Hilbert space, Compact linear operator). List the nonzero eigenvalues of T, repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue) and ordered so that ∣λ1(T)∣≥∣λ2(T)∣≥⋯; if this list is finite, pad it with zeros. Let s1(T)≥s2(T)≥⋯ be the zero-padded singular-value sequence (Absolute value and singular values of a compact operator). For every integer N≥0, with an empty product equal to 1 when N=0, ∏j=1N∣λj(T)∣≤∏j=1Nsj(T). If T is trace class (Trace class operator), then ∑j≥1∣λj(T)∣≤∑j≥1sj(T)=∥T∥1.

Facts & Assumptions

Given: AC, a complex Hilbert space H, a compact operator T:H→H, its eigenvalue list with algebraic multiplicity, and its singular-value list.

[A1]

AC is the choice-function axiom and supplies the prescribed-initial-point form of Dependent Choice used in the Riesz–Schauder supplier (The Axiom of Choice, AC supplies the countable and dependent choices used in Banach integration).

[A2]

AC implies Countable Choice, which supplies the narrower hypotheses of the SVD, singular-value, trace-class, and orthogonal-decomposition suppliers (AC supplies the countable and dependent choices used in Banach integration).

[A3]

Every nonzero spectral value of a compact operator is an eigenvalue with finite-dimensional generalized eigenspace, and only finitely many spectral values have modulus at least any fixed ε>0 (Riesz schauder spectrum of a compact operator).

[A4]

For each nonzero eigenvalue λ, its generalized eigenspace is Gλ(T)=ker⁡(T−λI)mλ for a stabilized exponent mλ, is finite-dimensional, and has dimension equal to its algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue). Thus (T−λI)∣Gλ(T) is nilpotent.

[A5]

Every nilpotent endomorphism of a finite-dimensional vector space has a basis arranged in Jordan strings; each string has an initial invariant segment of every length from zero through its full length by the definition of a Jordan string (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings, Jordan blocks, Jordan strings, and their endpoints).

[A6]

Under Countable Choice, the singular values of T have a finite or countably infinite positive list (sj)j∈JT, with orthonormal families (ej), (fj), SVD expansion Tx=∑j∈JTsj⟨x,ej⟩fj, and partial isometry U such that T=U∣T∣ and U∗U is the orthogonal projection onto (ker⁡T)⊥; the singular values are nonincreasing and s1(T)=∥T∥ (Singular value decomposition for compact operators, Absolute value and singular values of a compact operator).

[A7]

The exterior space is the alternating range in the Hilbert tensor power; its wedges have Gram-determinant inner product, the induced map obeys (ΛNT)(x1∧⋯∧xN)=Tx1∧⋯∧TxN, is bounded, and is functorial (Hilbert exterior powers and induced operators).

[A8]
[A9]

The operator norm bounds the norm of every image vector: ∥Sx∥≤∥S∥∥x∥ (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A10]

For trace-class T, the singular-value series converges and its sum is ∥T∥1 (Trace class operator).

[A11]

Every closed subspace of a Hilbert space has an orthogonal complement that gives a direct-sum decomposition (Orthogonal decomposition by a closed subspace).

[A12]

Under Countable Choice, a countable union of at most countable sets is at most countable; in particular this applies to a sequence of finite sets (Countable unions of at most countable sets, assuming ACω).

[A13]

For a complete orthonormal family, Parseval's identity holds and the finite-subset coefficient net converges in norm to each vector (Parseval equivalences for an orthonormal family).

[A14]

A decomposable wedge in a finite-dimensional vector space is nonzero exactly when its factors are linearly independent (In a finite-dimensional vector space, a decomposable wedge is nonzero exactly when its vectors are linearly independent).

[A18]

For every fixed real c, as R→+∞, (R+c)exp⁡(c−R)→0: use the exponential addition and reciprocal laws to write exp⁡(c−R)=exp⁡(c)/exp⁡(R), then bound ∣R+c∣ by 2R for sufficiently large R and apply R/exp⁡(R)→0. The latter is the case m=1, a=1 of the exponential-beats-polynomials theorem (Limits at +∞ and −∞, and infinite limits at a point, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y), The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The exponential dominates every fixed nonnegative integer power at +∞).

[A19]

For every q>0, exp⁡(log⁡q)=q by the inverse definition of the natural logarithm (The natural logarithm as the inverse of the exponential function).

[A20]

The natural logarithm is strictly increasing and satisfies log⁡(ab)=log⁡a+log⁡b for a,b>0 (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[A21]

For a nonnegative real series, convergence is equivalent to bounded partial sums, and its sum is the supremum of those partial sums (Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[A22]

Every nonempty finite set of real numbers has a maximum and a minimum (Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum).

[A23]

For every positive real ε there is m≥1 with 1/m<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[A24]

A real x is nonzero exactly when ∣x∣>0 (Basic properties of the absolute value).

Choice accounting: The exact statement assumes AC. The Riesz–Schauder and algebraic-multiplicity suppliers are AC-qualified; AC supplies the dependent choice used by the former [A1]. Countable Choice follows from AC by [A2] and is used by the countable-union theorem [A12], Parseval [A13], the SVD, the singular-value and trace-class suppliers, and orthogonal decomposition; SVD uses it to select bases in the countable family of finite-dimensional singular eigenspaces. The Jordan-string choices are finite and local to each prefix. No basis of all of H is selected.

Proof

technique · direct

Given: The data in the statement, and for a fixed finite positive-eigenvalue prefix the stabilized exponents mλ from [A4].

1.1A1A2A3A4A12A22A23A24

By [A1, A3, A4], the nonzero spectral values are eigenvalues of finite algebraic multiplicity, and there are only finitely many above any positive modulus threshold. Every nonzero spectral value lies in the threshold set {λ:∣λ∣≥1/m} for some m≥1 by [A23, A24]. Each threshold set is finite by [A3], so Countable Choice [A2] and [A12] make their union at most countable. Repeating each value according to its finite algebraic multiplicity still gives a countable list by another application of [A12]. If that list is infinite, after choosing any remaining value only finitely many remaining values have at least its modulus; that finite nonempty set has a maximum modulus by [A22], which is then maximal among all remaining values. Finite ties can be ordered arbitrarily. AC permits iterating this selection to obtain a sequence ordered by decreasing modulus. If N=0, both products are the empty product 1. If N≥1 and the zero-padded eigenvalue list has λN(T)=0, its first N-term product is zero and the asserted inequality follows from nonnegativity of singular values. It remains to prove the claim when N≥1 and all of λ1(T),…,λN(T) are nonzero.

1.2A4A5

For each distinct eigenvalue λ among this prefix, let rλ be its number of occurrences. Then rλ≤dim⁡Gλ(T) by [A4]. Apply [A5] to (T−λI)∣Gλ(T) and list the resulting finite Jordan-string lengths as ℓ1,…,ℓq. In that order, take an initial segment of length ki:=min⁡(ℓi,rλ−∑h<ikh) from string i while the residual is positive, and take length zero thereafter. Since ∑iℓi=dim⁡Gλ(T)≥rλ, these lengths sum to rλ. The definition in [A5] makes each selected initial segment invariant under T, so their direct sum Fλ is T-invariant, has dimension rλ, and the restriction of T to it is triangular with diagonal entry λ repeated rλ times.

1.3A2A6A7A11A13A14

Put S:=ΛNT, K:=(ker⁡T)⊥, and P:=U∗U, the orthogonal projection onto K from [A6]. For every increasing N-tuple J=(j1<⋯<jN) in JT, set ηJ:=ej1∧⋯∧ejN, θJ:=fj1∧⋯∧fjN, and μJ:=∏k=1Nsjk(T). By the Gram formula [A7], both wedge families are orthonormal. The ej span K: if their closed span were proper, [A11] would give a nonzero x∈K orthogonal to all ej, while the SVD expansion [A6] would imply Tx=0, contradicting K∩ker⁡T={0}. Since decomposable wedges are dense by the exterior construction, approximating each factor by finite ej-sums and expanding by multilinearity shows that the ηJ span ΛNK. The tensor projection P⊗N is self-adjoint and idempotent and commutes with permutations; its restriction to the alternating range is ΛNP, the orthogonal projection onto M:=span⁡‾{ηJ}. Since T=TP, functoriality [A7] gives S=SΛNP, so S vanishes on M⊥. On each ηJ, SηJ=μJθJ. If there are at least N positive singular values, the family (ηJ) is a complete orthonormal family in M. For x∈M, Parseval and net convergence [A13] give xF:=∑J∈FcJηJ→x over finite subsets F, with cJ=⟨x,ηJ⟩. Orthonormality of both wedge families gives ∥SxF∥2=∑J∈FμJ2∣cJ∣2≤(sup⁡JμJ)2∑J∈F∣cJ∣2=(sup⁡JμJ)2∥xF∥2. Since S is bounded [A7], passing to the norm limit yields ∥Sx∥≤(sup⁡JμJ)∥x∥. The unit vector η(1,…,N) attains sup⁡JμJ=∏j=1Nsj(T), because every increasing tuple has sjk(T)≤sk(T). If there are fewer than N positive singular values, K is finite-dimensional of dimension less than N, so every decomposable N-wedge in K vanishes by [A14]; density gives ΛNK={0} and S=0, the same norm formula holding with sN(T)=0.

2.1A4step 1.2

The spaces Gλ(T) for the finitely many distinct prefix values form a direct sum: if ∑νxν=0 with xν∈Gν(T), fix λ and apply Qλ:=∏ν≠λ(T−νI)mν. It kills every xν for ν≠λ. On Gλ(T) each factor is (λ−ν)I+Nλ, where Nλ=(T−λI)∣Gλ is nilpotent, so that factor is invertible by its finite geometric-series inverse. Thus Qλ∣Gλ is invertible and xλ=0. Consequently EN:=⨁λFλ is a T-invariant N-dimensional subspace.

3.1A7A8A14step 2.1

Choose the concatenated Jordan-segment basis v1,…,vN of EN and put w:=v1∧⋯∧vN. The vectors are linearly independent by their being a basis, so [A14] gives w≠0. If A is the triangular matrix of T∣EN in this basis, multilinearity and alternation [A7] expand (Tv1)∧⋯∧(TvN)=det⁡(A)w. By [A8], det⁡(A)=∏j=1Nλj(T). Hence (ΛNT)w=(∏j=1Nλj(T))w.

4.1A9step 1.1step 3.1step 1.3

In the nonzero-prefix case of step 1.1, step 3.1 gives an eigenvector of S with eigenvalue ∏j=1Nλj(T). The operator-norm bound [A9] and norm identity [step 1.3] yield ∏j=1N∣λj(T)∣≤∥S∥=∏j=1Nsj(T). Together with step 1.1 this proves the product inequality for every N≥0.

5.1A6A20A24step 4.1

Fix N≥1 with λ1(T),…,λN(T) all nonzero. For each k≤N, step 4.1 gives the product inequality for the first k terms. Its left side is positive, hence sk(T)>0. The eigenvalue moduli are positive by [A24], so set xj:=log⁡∣λj(T)∣ and yj:=log⁡sj(T) for j≤N. Both sequences are nonincreasing because modulus, singular values and logarithm preserve the indicated order; taking logarithms in the product inequalities and using the logarithm product law [A20] gives ∑j=1kxj≤∑j=1kyj for every k≤N.

6.1A15A16A17A18A19A22step 5.1algebra

For a nonincreasing real list x1,…,xN and real t, ∑j=1N(xj−t)+=max⁡0≤k≤N(∑j=1kxj−kt), where the k=0 sum is zero: the positive terms form an initial segment, and adding any nonpositive later term cannot increase the prefix sum. This finite maximum exists by [A22]. Applying the identity to the lists in step 5.1 and their prefix-sum inequalities gives ∑j=1N(xj−t)+≤∑j=1N(yj−t)+ for every t∈R. Put c:=min⁡{xN,yN}−1 and b:=max⁡{x1,y1}+1, so c<xj,yj<b for every j, and for R≥0 put aR:=c−R and ϕu(t):=(u−t)+exp⁡(t). By [A15, A16], these functions and their finite sums are continuous and integrable on [aR,b]; since exp⁡(t)>0, the positive-part inequality remains true after multiplication by exp⁡(t). Monotonicity and linearity of the integral [A16] give ∑j∫aRbϕxj(t) dt≤∑j∫aRbϕyj(t) dt. Fix any u among these finitely many xj,yj. On [aR,u], ϕu(t)=(u−t)exp⁡(t), whose primitive is Gu(t):=(u−t+1)exp⁡(t): directly from the derivative definition [A17], (u−t+1)′=−1, and the product rule and (exp⁡)′=exp⁡ give Gu′(t)=(u−t)exp⁡(t). On [u,b], ϕu=0. Applying the fundamental theorem, the zero-integral case and interval additivity [A16, A17] yields ∫aRbϕu(t) dt=exp⁡(u)−(u−aR+1)exp⁡(aR). The error Eu,R:=(u−aR+1)exp⁡(aR)=(R+u−c+1)exp⁡(c−R) is nonnegative and tends to zero: for sufficiently large R, it is at most 2exp⁡(c)R/exp⁡(R), which tends to zero by [A18]. Because there are finitely many xj, for every ε>0 one common sufficiently large R makes ∑jExj,R<ε. The integral inequality then gives ∑jexp⁡(xj)≤∑jexp⁡(yj)+ε, since Eyj,R≥0. As ε was arbitrary, [A19] gives ∑j=1N∣λj(T)∣≤∑j=1Nsj(T).

7.1A10A21step 6.1∎

If the nonzero eigenvalue list is finite with length m>0, step 6.1 at N=m bounds its full absolute sum; for m=0 that sum is zero. If the list is infinite, step 6.1 bounds every eigenvalue partial sum by the corresponding singular-value partial sum, which is at most ∥T∥1 by trace class [A10]. The eigenvalue terms are nonnegative, so [A21] gives convergence of their series and bounds its sum, the supremum of its partial sums, by ∥T∥1. Zero padding changes neither sum, and [A10] identifies the singular-value sum with ∥T∥1. This proves the sum conclusion, including finite-rank and zero operators.

Depends on

Used by

Dependency tree · two levels

201 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources