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.

E is a k-algebra, the E_i are ideals, and commutator traces vanish

Statement

Keep the notation of Commensurable subspaces and the ideals E_0, E_1, E_2 of E: k is a field, V a k-vector space (Vector space over a field), A⊆V a k-subspace, K a commutative k-algebra acting on V with fA<A for all f∈K, and E,E1,E2,E0 are the k-subspaces of End⁡k(V) attached to A. Assume the Axiom of Choice as inherited from the linear algebra suppliers (The Axiom of Choice). Then:

  1. E is a k-subalgebra of End⁡k(V) containing the image of K, and E1,E2 are two-sided ideals of E;
  2. E1+E2=E and E1∩E2=E0;
  3. E0 is a finite potent subspace of End⁡k(V) in the sense of Linearity and conjugation invariance of the finite potent trace, so the trace Tr⁡V of The trace of a finite potent endomorphism exists and is unique is defined on E0 and is k-linear there (Linear map between vector spaces over the same field);
  4. if γ∈E0 and ψ∈E, or if γ∈E1 and ψ∈E2, then the commutator [γ,ψ]=γψ−ψγ lies in E0 and Tr⁡V([γ,ψ])=0.

Facts & Assumptions

Given: a field k, a k-vector space V, a k-subspace A⊆V, a commutative k-algebra K acting on V with fA<A for every f∈K, and the associated k-subspaces E,E1,E2,E0⊆End⁡k(V); also elements γ,ψ∈End⁡k(V) satisfying one of the two membership hypotheses of claim 4 whenever that claim is invoked.

[F1]

V is a k-vector space, linear maps are additive and k-homogeneous, composites and finite linear combinations of linear maps are linear, and End⁡k(V) is a k-vector space under 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. A linear map defined on a subspace of a vector space extends to a linear map on the whole space, and there is a k-linear projection π ⁣:V→A with π(a)=a for all a∈A: extend a basis of A to a basis of V and let π send the added basis vectors to 0. (The Axiom of Choice)

[F3]

For every finite potent endomorphism θ of V the trace Tr⁡V(θ) exists, is unique, and for every finite-dimensional θ-stable subspace W⊆V containing θm(V) for some m≥0 equals tr⁡W(θ∣W). (The trace of a finite potent endomorphism exists and is unique)

[F4]

(T4)-(T6) of Linearity and conjugation invariance of the finite potent trace: Tr⁡V is k-linear on every finite potent subspace F⊆End⁡k(V); if φ ⁣:V′→V and ψ ⁣:V→V′ are k-linear with ψφ finite potent, then φψ is finite potent with Tr⁡V(φψ)=Tr⁡V′(ψφ); and if γ∈E0, ψ∈E, or γ∈E1, ψ∈E2, then [γ,ψ]∈E0 with Tr⁡V([γ,ψ])=0.

[F5]

A<B means that (A+B)/B is finite-dimensional and 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}, E0=E1∩E2={θ:θV<A and θA finite-dimensional}, and E,E1,E2 are k-subspaces while E0=E1∩E2; the image of K is contained in E by the assumed fA<A. (Commensurable subspaces and the ideals E_0, E_1, E_2 of E)

Proof

technique · direct
1.1givenF1F5

(Setup) We verify the four numbered claims with E,E1,E2,E0 as in [F5], noting that E0=E1∩E2 by definition, that the image of K lies in E by hypothesis, and that all statements are statements about the linear endomorphisms θ∈End⁡k(V) and their images of A and V.

2.1step 1.1F1F5

(Claim 1: E is a k-subalgebra) Since idV(A)=A gives idV∈E and finite sums and scalar multiples of elements of E lie in E by [F5], it remains to check composition: for θ,θ′∈E one has θθ′(A)=θ(θ′(A)), and θ′(A)<A gives θ(θ′(A))<θ(A)<A by the linear-map rule and transitivity, so θθ′∈E; hence E is a k-subalgebra of End⁡k(V) containing the image of K.

3.1step 2.1F5algebra

(Claim 1: E1 and E2 are k-subspaces) If θ1,θ2∈E1 then (θ1+θ2)(V)⊆θ1(V)+θ2(V)<A+A=A and λθ1∈E1, so E1 is a k-subspace by [F5]; and E2 is a k-subspace because (θ1+θ2)(A)⊆θ1(A)+θ2(A) is a sum of two finite-dimensional spaces, hence finite-dimensional.

4.1step 3.1F5

(Claim 1: E1 is a two-sided ideal) For θ∈E and η∈E1 we have (θη)(V)=θ(ηV)<θ(A)<A by the linear-map rule, so θη∈E1, while (ηθ)(V)⊆η(V)<A, so ηθ∈E1; hence E1 is a two-sided ideal of E.

5.1step 4.1F5algebra

(Claim 1: E2 is a two-sided ideal) For θ∈E and η∈E2 we have (θη)(A)=θ(ηA), an image of the finite-dimensional space ηA under a linear map, hence finite-dimensional, so θη∈E2; and choosing a finite-dimensional W with θA⊆A+W, we get (ηθ)(A)⊆η(A+W)=ηA+ηW, a sum of two finite-dimensional spaces, hence finite-dimensional, so ηθ∈E2.

6.1step 5.1F2F5

(Claim 2: a projection is available) By [F2] fix a k-linear projection π ⁣:V→A with π∣A=idA; then π(V)=A<A, so π∈E1, and (1−π)(A)=0 is finite-dimensional, so 1−π∈E2 and also 1−π∈E.

7.1step 6.1F5

(Claim 2: E1+E2=E) If θ∈E, then θ=πθ+(1−π)θ with πθ∈E1 and (1−π)θ∈E2 because E1 and E2 are two-sided ideals of E and π,1−π∈E; conversely η∈E1 satisfies η(A)⊆η(V)<A, and η∈E2 has η(A) finite-dimensional, whence η(A)<A by monotonicity, so both E1 and E2 are contained in E; hence E1+E2=E.

8.1step 7.1F5

(Claim 2: the intersection) Since E0:=E1∩E2 by definition, the second half of claim 2 holds; combining with step 7.1 gives E1+E2=E and E1∩E2=E0.

9.1step 8.1F5algebra

(Claim 3: E0 is finite potent) Let θ1,θ2∈E0; then θ1(V)<A and θ2(V)<A, so with finite-dimensional W such that θ2(V)⊆A+W we get θ1θ2(V)⊆θ1(A)+θ1(W), which is a sum of two finite-dimensional spaces because θ1(A) is finite-dimensional and θ1(W) is an image of a finite-dimensional space; thus every product of two elements of E0 has finite-dimensional image, i.e. E0 is a finite potent subspace with exponent 2.

10.1step 9.1F3F4

(Claim 3: linearity of the trace) By (T4) of [F4] applied to the finite potent subspace E0, the trace Tr⁡V is defined and k-linear on E0.

11.1step 10.1F4

(Claim 4) If γ∈E0 and ψ∈E, or if γ∈E1 and ψ∈E2, then claim (T6)(b) of [F4] gives [γ,ψ]∈E0 and Tr⁡V([γ,ψ])=0, which is claim 4.

12.1step 2.1step 4.1step 5.1step 7.1step 8.1step 9.1step 10.1step 11.1F2∎

All four claims are established: claim 1 in steps 2.1, 4.1 and 5.1, claim 2 in steps 7.1 and 8.1, claim 3 in steps 9.1 and 10.1, and claim 4 in step 11.1; the Axiom of Choice was used only through [F2], to extend a basis of A to all of V.

Depends on

Used by

Dependency tree · two levels

19 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