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 decomposition map is independent of the stable lattice
Statement
If and are two -stable -lattices in the same finite-dimensional -module , then
in the modular Grothendieck group .
Facts & Assumptions
Given: A finite-dimensional -module and two -stable -lattices .
The decomposition map is defined by taking the class of the reduction of a stable lattice (Decomposition map from ordinary to modular Grothendieck groups).
Because and are full lattices in the same -space, some integer satisfies , where is a uniformizer of .
Proof
By [A1], after replacing by if necessary, we may assume . Multiplication by the scalar does not change the class of the reduction in the Grothendieck group, because as -modules.
Put . Reduction of the inclusion has kernel and cokernel . Multiplication by identifies the kernel with , while the cokernel is . Thus in .
Multiplication by on the finite-length -module gives exact sequences Their Grothendieck-group identities give . Both end terms are annihilated by , so this equality is an equality in . Step 2.1 therefore gives .
Hence the Grothendieck-group class in [F1] is independent of the stable lattice.
Depends on
Used by
Cited to discharge well-definedness by Decomposition map from ordinary to modular Grothendieck groups.
Dependency tree · two levels
4 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
- J. Miquel Martinez, Modular Representation Theory of Finite Groups (standard reference, not scraped)
- Tudor Ciurca, Representation Theory (standard reference, not scraped)