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.
Characteristic-zero scalar extension of geometric semisimplicity
Statement
Let be connected and let be a finite-rank rational local system (Local systems and pullback). If is semisimple, then is semisimple for every characteristic-zero field (Semisimple modules as direct sums of simple modules). In particular this applies to rational Gauss-Manin local systems after complex geometric semisimplicity has been proved. The field need not embed in . Semisimplicity means that every monodromy-invariant subspace has an invariant complement, equivalently that the monodromy module is a finite direct sum of simple modules.
Facts & Assumptions
Given: A connected base . Work on each path component separately, fixing a point in that component and the finite-dimensional -vector space with its monodromy action, so that invariant subspaces of are exactly the submodules of the monodromy module and semisimplicity on this path component is semisimplicity of that module (Local systems and pullback).
For a finite-dimensional algebra over a field the Jacobson radical is a nilpotent two-sided ideal and the quotient algebra is semisimple (For a finite-dimensional algebra, the Jacobson radical is nilpotent and the quotient by it is semisimple); a unital ring is semisimple exactly when its left regular module is a direct sum of simple modules (A semisimple ring as a ring whose left regular module is semisimple).
Over the regular trace form is nondegenerate if and only if is semisimple; if is semisimple then and the trace form is the sum of the nondegenerate matrix trace pairings (The trace form detects semisimplicity over the complex numbers).
A nilpotent endomorphism of a finite-dimensional vector space has a strictly upper-triangular matrix in some ordered basis, hence trace zero (Characterisations of a nilpotent endomorphism).
For a finite-length module, sum-of-simples, direct-sum and invariant-complement characterizations of semisimplicity are equivalent (Choice-free semisimple characterizations for finite-length modules), and semisimple means an internal direct sum of simple submodules, the empty sum included (Semisimple modules as direct sums of simple modules).
Proof
Let be the -span of the monodromy matrices. It contains the identity and is closed under multiplication, because a product of monodromy matrices is a monodromy matrix, so it is a finite-dimensional unital -algebra. For every field over the canonical map is injective: rationally independent matrices stay independent after extending scalars, as one sees by comparing coordinates in a rational basis of . Its image is the -span of the monodromy matrices, so submodules for this image are exactly the monodromy-invariant subspaces of ; in particular the action of on is faithful.
Assume is semisimple. Let . If is a simple submodule, then is a submodule equal to or , and would give for every , contradicting the nilpotence of from [F1]. Hence kills every simple summand of and therefore kills all of , since a semisimple module is a direct sum of simple submodules by [F4]. Faithfulness of the action, established in step 1.1, then forces : an element of acts as zero on . Therefore is semisimple.
Choose the rational basis of and let be the Gram matrix of the regular trace form of in this basis. Its entries are rational: passing from to extends the rational matrix of left multiplication by to a complex matrix with the same trace. By step 2.1 and [F2] the regular trace form of is nondegenerate, so as a complex number, and since it is a nonzero rational number. For every field the scalar extension therefore makes , viewed over , a nondegenerate matrix. No embedding of into is used.
Let be any characteristic-zero field and put . For and the product lies in the nilpotent ideal by [F1], so for some and the endomorphism of is nilpotent; by [F3] its trace vanishes. Nondegeneracy of the extended matrix from step 3.1 then forces , so . By [F1] the quotient is a semisimple ring.
Finally is semisimple over . Choose a -basis of . The map , , is a surjective -module homomorphism, and the regular module of the semisimple ring is a direct sum of simple modules by [F1]. Hence is a sum of images of simple modules, each of which is simple or zero, and has finite length over ; by [F4] it is a finite direct sum of simple modules, that is, semisimple. By step 1.1 this is exactly semisimplicity of the monodromy module, equivalently every invariant subspace has an invariant complement by [F4], which is semisimplicity of the local system . The zero fiber is the empty direct sum and is included.
Source notes
The scalar-extension argument is supplied locally from the complex regular-trace criterion of [F2]; it does not appeal to an unproved separable-algebra theorem and it never embeds the coefficient field into . The reduction is the one used in Deligne II 4.2.6 to pass from complex to rational coefficients.
Depends on
- Local systems and pullback
- Semisimple modules as direct sums of simple modules
- A semisimple ring as a ring whose left regular module is semisimple
- The trace form detects semisimplicity over the complex numbers
- For a finite-dimensional algebra, the Jacobson radical is nilpotent and the quotient by it is semisimple
- Choice-free semisimple characterizations for finite-length modules
- Characterisations of a nilpotent endomorphism
Used by
Dependency tree · two levels
31 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.