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.
Absolutely simple objects
Definition
Let be a field and let be a -linear category (k-linear categories and k-linear functors). Since composition in is -bilinear, is a -algebra with unit for every object .
An object of is absolutely simple when the -algebra is one-dimensional over , that is,
Equivalently, the evaluation map
is an isomorphism of -algebras. These two formulations agree: the evaluation map is -linear and multiplicative with , and it is injective because with forces ; surjectivity is exactly . In particular a nonzero endomorphism space has dimension one, so an absolutely simple object is not a zero object; if has a zero object then automatically.
In a -linear abelian category, a simple object with satisfies this condition (Simple object). The converse need not hold: the representation of the two-vertex quiver has only scalar endomorphisms but has the proper nonzero subrepresentation . Thus the definition records the scalar endomorphism condition without asserting simplicity in an arbitrary abelian category. Every simple object of a locally finite -linear abelian category over an algebraically closed field is absolutely simple. Indeed, a nonzero endomorphism of a simple object has zero kernel and full image, hence is an isomorphism; its endomorphism algebra is therefore a division algebra. Local finiteness makes finite-dimensional (Locally finite k-linear abelian categories). For , a polynomial over annihilates by linear dependence of its powers; it splits into linear factors, and a division algebra has no zero divisors, so one factor vanishes. Thus . This definition fixes no semisimplicity and no algebraic-closedness hypothesis; it records them only as the standard situation in which absolute simplicity is automatic.
If is absolutely simple, every automorphism of is a scalar with : it is an invertible endomorphism, hence by absolute simplicity equals some , and is invertible with inverse because is invertible.
Depends on
Used by
Dependency tree · two levels
9 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.