Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Linearity and conjugation invariance of the finite potent trace

Statement

Assume the Axiom of Choice as inherited from the linear algebra suppliers (The Axiom of Choice). Let k be a field and V a k-vector space (Vector space over a field), and let Tr⁡V be the trace of finite potent endomorphisms supplied by The trace of a finite potent endomorphism exists and is unique.

(T4) Let F⊆End⁡k(V) be a k-subspace that is finite potent, meaning that there is an integer n≥0 such that θ1⋯θn(V) is finite-dimensional (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis) for every choice of elements θ1,…,θn∈F. Then Tr⁡V restricted to F is k-linear (Linear map between vector spaces over the same field).

(T5) If φ ⁣:V′→V and ψ ⁣:V→V′ are k-linear and ψφ is finite potent, then φψ is finite potent and Tr⁡V(φψ)=Tr⁡V′(ψφ).

(T6) Let A⊆V be a k-subspace and let E,E1,E2,E0 be the subspaces of End⁡k(V) attached to A in Commensurable subspaces and the ideals E_0, E_1, E_2 of E.

  • (a) If θ ⁣:V→V has finite-dimensional image, then for every k-linear σ ⁣:V→V the commutator [θ,σ]=θσ−σθ is finite potent and Tr⁡V([θ,σ])=0.
  • (b) If γ∈E0 and ψ∈E, or if γ∈E1 and ψ∈E2, then [γ,ψ]∈E0 and Tr⁡V([γ,ψ])=0.

Facts & Assumptions

Given: a field k, a k-vector space V with the finite potent trace Tr⁡V; a k-subspace A⊆V together with the spaces E,E1,E2,E0 attached to it as in Commensurable subspaces and the ideals E_0, E_1, E_2 of E; and, for the three claims, (i) a finite potent k-subspace F⊆End⁡k(V) with exponent n, (ii) k-linear maps φ ⁣:V′→V and ψ ⁣:V→V′ with ψφ finite potent, (iii) an endomorphism θ ⁣:V→V with finite-dimensional image, a k-linear σ ⁣:V→V, and elements γ,ψ of End⁡k(V) satisfying one of the two membership hypotheses of (T6)(b).

[F1]

V is a k-vector space, a linear map is additive and k-homogeneous, images of subspaces under linear maps are subspaces, composites of linear maps are linear, and End⁡k(V) is a k-vector space for the pointwise operations, with composition k-bilinear. (Vector space over a field, Linear map between vector spaces over the same field)

[F2]

Assume the Axiom of Choice: every vector space over a field has a basis; in particular finite-dimensional spaces and their subspaces have finite bases. (The Axiom of Choice, Every vector space has a basis)

[F3]

A vector space is finite-dimensional exactly when it has a finite basis, and the zero space is finite-dimensional; a space spanned by a finite set is finite-dimensional (a maximal linearly independent subset of that finite set is a finite basis); images of finite-dimensional spaces under linear maps are finite-dimensional; a sum of finitely many finite-dimensional subspaces is finite-dimensional. (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis)

[F4]

For a finite-dimensional V and a linear T ⁣:V→V, the trace tr⁡(T) is the sum of the diagonal entries of the matrix of T in any ordered basis, independently of that basis; tr⁡(T+T′)=tr⁡(T)+tr⁡(T′) and tr⁡(λT)=λtr⁡(T) for λ∈k, because diagonal entries of matrices are additive and homogeneous; and tr⁡(0)=0. (The basis-independent trace of an endomorphism of a finite-dimensional vector space)

[F5]

The finite potent trace of The trace of a finite potent endomorphism exists and is unique exists and is unique: it agrees with the ordinary trace when V is finite-dimensional (T1), is additive over a θ-stable subspace and the corresponding quotient (T2), vanishes for nilpotent θ (T3), and satisfies Tr⁡V(θ)=tr⁡W(θ∣W) for every finite-dimensional θ-stable subspace W⊆V containing θm(V) for some m≥0. (The trace of a finite potent endomorphism exists and is unique)

[F6]

Commensurability A<B means that (A+B)/B is finite-dimensional, A∼B means A<B and B<A; the relation < is reflexive, transitive, preserved by k-linear maps and by finite sums, and unchanged on commensurable subspaces; E={θ:θA<A}, E1={θ:θV<A}, E2={θ:θA finite-dimensional} and E0=E1∩E2 are k-subspaces of End⁡k(V), with E0={θ:θV<A and θA finite-dimensional}, and the Ei depend only on the commensurability class of A. (Commensurable subspaces and the ideals E_0, E_1, E_2 of E)

Proof

technique · direct
1.1givenF1F2F3

(Setup; reduction for (T4)) Let F⊆End⁡k(V) be finite potent with exponent n, and let F0⊆F be an arbitrary finite-dimensional k-subspace, with a finite basis φ1,…,φm; since a map out of F is k-linear as soon as it is additive and k-homogeneous on every such F0, it suffices to prove that Tr⁡V∣F0 is linear for this arbitrary F0.

2.1step 1.1F1F3

(A common finite-dimensional space) If n=0, the empty-product condition says V is finite-dimensional; set W:=V, which is stable under each φj. If n≥1, set W:=∑i1,…,inφi1⋯φin(V). This is a finite sum of finite-dimensional spaces by finite potency of F, so W is finite-dimensional, and it is stable under each φj because φjφi1⋯φin(V)⊆φjφi1⋯φin−1(V)⊆W.

3.1step 2.1F5

(Traces are computed on W) For θ=∑jλjφj∈F0 one has θn(V)⊆W and W is θ-stable, while W is finite-dimensional and θ is finite potent, so [F5] gives Tr⁡V(θ)=tr⁡W(θ∣W); in particular Tr⁡V(φj)=tr⁡W(φj∣W) for every j.

4.1step 3.1F4

((T4)) By k-linearity of the ordinary trace in the endomorphism, Tr⁡V(θ)=tr⁡W(θ∣W)=∑jλjtr⁡W(φj∣W)=∑jλjTr⁡V(φj), so Tr⁡V is linear on the arbitrary finite-dimensional subspace F0⊆F, and (T4) follows for F.

5.1step 4.1F1F2F4algebra

(Rectangular trace identity) If W,W′ are finite-dimensional and A ⁣:W′→W, B ⁣:W→W′ are k-linear, then tr⁡W′(B∘A)=tr⁡W(A∘B): choose ordered bases and let (aij), (bij) be the matrices of A and B; the diagonal entries of the two products are the finite sums ∑jbijaji and ∑iaijbji, which are rearrangements of one another in the commutative ring k.

6.1step 5.1F1F3

((T5), stabilisation) Put α:=ψφ ⁣:V′→V′ and β:=φψ ⁣:V→V, and fix n0 with αn0(V′) finite-dimensional; the descending chains αk(V′) for k≥n0 and, using βk(V)⊆φ(αk−1(V′)), the chains βk(V) for k≥n0+1 lie inside the finite-dimensional spaces αn0(V′) and φ(αn0(V′)), so both stabilise: choose n large enough that n≥n0+1 and W′:=αn(V′)=αn+1(V′) and W:=βn(V)=βn+1(V), both finite-dimensional; then β is finite potent.

7.1step 6.1F1

(The induced maps) The map φ sends W′ into W, since φ(W′)=φ(αn(V′))=βn(φ(V′))⊆βn(V)=W. Conversely, stabilization gives W=βn(V)=βn+1(V)=φαnψ(V)⊆φ(W′), so φ(W′)=W. The map ψ sends W into W′, since ψ(W)=ψ(βn(V))=αn(ψ(V))⊆αn(V′)=W′. Thus the restrictions have the stated domains and codomains, and their composites are α∣W′=ψ∣W∘φ∣W′ and β∣W=φ∣W′∘ψ∣W.

8.1step 7.1step 5.1F5

((T5)) Applying [F5] to α on V′ and to β on V, and the rectangular identity to φ∣W′ ⁣:W′→W and ψ∣W ⁣:W→W′, gives Tr⁡V′(ψφ)=tr⁡W′(α∣W′)=tr⁡W′(ψ∣W∘φ∣W′)=tr⁡W(φ∣W′∘ψ∣W)=tr⁡W(β∣W)=Tr⁡V(φψ), which is (T5); note that ψφ is finite potent by hypothesis and φψ is finite potent by step 6.1.

9.1step 8.1F1

((T6)(a), factorisation) Assume θ ⁣:V→V has finite-dimensional image W:=θ(V), let i ⁣:W↪V be the inclusion and let θˉ ⁣:V→W be θ with restricted codomain, so that θ=iθˉ and θˉi=θ∣W; for any k-linear σ ⁣:V→V the maps θˉσ ⁣:V→W and σi ⁣:W→V are k-linear, with θσ=i(θˉσ) and σθ=(σi)θˉ.

10.1step 9.1F1F3

((T6)(a), traces) Applying (T5) to the pairs (i,θˉ), (i,θˉσ) and (σi,θˉ) is legitimate because in each case the composite in the finite-dimensional space W is finite potent, and yields Tr⁡V(θ)=Tr⁡W(θ∣W), Tr⁡V(θσ)=Tr⁡W(θˉσi) and Tr⁡V(σθ)=Tr⁡W(θˉσi).

11.1step 10.1F3step 4.1

((T6)(a), conclusion) Both θσ and σθ have finite-dimensional image, respectively contained in W and σ(W). The finite-image endomorphisms form a k-subspace: sums have image in the sum of the two finite-dimensional images, and scalar multiples still have finite-dimensional image. This subspace is finite potent with exponent 1, so (T4) gives Tr⁡V([θ,σ])=Tr⁡V(θσ)−Tr⁡V(σθ). Step 10.1 computes both terms as Tr⁡W(θˉσi), so their difference is zero.

12.1step 11.1F6

((T6)(b), first case) Assume γ∈E0 and ψ∈E. Choose a finite-dimensional subspace U⊆V with ψA⊆A+U, using ψA<A. Then (γψ)(V)⊆γ(V)<A, and (γψ)(A)⊆γ(A)+γ(U) is finite-dimensional because γA is finite-dimensional and γ(U) is the image of a finite-dimensional space. Thus γψ∈E0. Separately choose a finite-dimensional subspace W⊆V with γV⊆A+W, using γV<A. Then (ψγ)(V)⊆ψ(A)+ψ(W)⊆A+U+ψ(W), so ψγV<A; also (ψγ)(A)⊆ψ(γA) is finite-dimensional because γA is finite-dimensional. Thus ψγ∈E0. The witnesses U and W serve different containments and need not be equal.

13.1step 12.1F3F6

(The common finite-potent subspace E0) For any ρ1,ρ2∈E0, choose finite-dimensional W with ρ2V⊆A+W. Then ρ1ρ2V⊆ρ1A+ρ1W, which is finite-dimensional because ρ1A is finite-dimensional and ρ1W is the image of a finite-dimensional space. Thus every product of two elements of the subspace E0 has finite-dimensional image, so E0 is finite potent with exponent 2. In particular every element of E0, including γψ and ψγ from step 12.1, is finite potent.

14.1step 12.1step 13.1step 4.1step 8.1F6

((T6)(b), first case concluded) For γ∈E0 and ψ∈E, step 12.1 puts γψ, ψγ and their difference [γ,ψ] in the common finite-potent subspace E0. By (T4) on E0, Tr⁡V([γ,ψ])=Tr⁡V(γψ)−Tr⁡V(ψγ). Apply the domain-correct (T5) with φ=γ and ψ=ψ; its hypothesis ψφ=ψγ is finite potent by step 13.1, and it gives Tr⁡V(γψ)=Tr⁡V(ψγ). Hence the commutator trace is zero.

14.2step 13.1step 4.1step 8.1F5F6

((T6)(b), second case) Assume γ∈E1 and ψ∈E2. Then γψ∈E0 since (γψ)(A)=γ(ψA) is finite-dimensional and (γψ)(V)⊆γV<A. Also ψγ∈E0: choose finite-dimensional W with γV⊆A+W; then (ψγ)(V)⊆ψ(A)+ψ(W) is finite-dimensional because ψA is finite-dimensional, and (ψγ)(A)⊆(ψγ)(V) is finite-dimensional. The difference [γ,ψ] lies in E0 as the difference of two elements of that subspace. By (T4) on the common finite-potent subspace E0 from step 13.1, Tr⁡V([γ,ψ])=Tr⁡V(γψ)−Tr⁡V(ψγ). The domain-correct (T5), with φ=γ and ψ=ψ, applies because ψγ is finite potent and gives equality of these two traces. Therefore Tr⁡V([γ,ψ])=0.

15.1step 4.1step 8.1step 11.1step 14.1step 14.2F2∎

Combining the steps: (T4) is step 4.1, (T5) is step 8.1, (T6)(a) is step 11.1, and both cases of (T6)(b) are steps 14.1 and 14.2; the only use of the Axiom of Choice is the selection of bases through [F2], in the rectangular identity of step 5.1.

Depends on

Used by

Dependency tree · two levels

35 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