Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

The trace pairing on a finite endomorphism space is nondegenerate

Statement

Let V be a finite-dimensional complex vector space. If D:V→V is linear and tr⁡(D∘A)=0 for every linear map A:V→V, then D=0. Equivalently, the trace pairing (D,A)↦tr⁡(D∘A) has the property that its only first input pairing to zero with every second input is D=0. This includes the zero space.

Facts & Assumptions

Given: A finite-dimensional complex vector space V and an endomorphism D:V→V.

[F1]

A finite-dimensional vector space has a finite ordered basis; dimension zero means the space is the zero space (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis).

[F2]

An endomorphism is a linear map V→V, and its matrix records the coordinates of its images on an ordered basis (Linear map between vector spaces over the same field, Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

[F3]

A matrix unit Eji has its only nonzero entry, 1, at row j and column i (Matrix units Eij and the Kronecker delta).

[F4]

The matrix of a composite is the product of the matrices in matching ordered bases ([S∘T]BD=[S]CD[T]BC).

[F6]

The trace of an endomorphism is the matrix trace in any ordered basis, including trace 0 on the zero space (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

Proof

1.1givenF1algebrachoose

If dim⁡V=0, [F1] gives V={0}, so its only endomorphism is D=0. Assume henceforth dim⁡V=m>0 and choose an ordered basis.

2.1step 1.1F2F3F7choosealgebra

If every entry of the matrix of D were zero, [F2] would make D vanish on every basis vector and hence on every vector. Thus if D≠0 there are indices i,j<m with matrix entry Dij≠0. Define A(∑k<makbk):=aibj using the ordered basis chosen in step 1.1. Unique coordinates [F7] make this well-defined; for scalars α,β and vectors with coordinate lists (ak) and (ck), the coordinate list of their linear combination is (αak+βck), so the formula gives A(αx+βy)=αA(x)+βA(y). Thus A is an endomorphism. Its matrix sends bi to bj and every other basis vector to 0, so that matrix is Eji.

3.1step 1.1step 2.1F4F5F6discharge-contradiction∎

By [F4], the matrix of D∘A is [D][A]=[D]Eji. Row-by-column multiplication [F5] gives ([D]Eji)kk=Dkjδik, so every diagonal entry is 0 except the (i,i) entry, which is Dij. By [F6], tr⁡(D∘A)=Dij≠0. This contradicts the hypothesis for every A. Therefore D=0, including the zero-dimensional case from step 1.1.

Depends on

Used by

Dependency tree · two levels

38 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