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.
Limits of one-parameter orbits and concentrator subschemes
Definition
Let be a separated -scheme of finite type with an action of (Algebraic group actions, orbit maps, orbit subschemes and scheme-theoretic stabilizers), and let be a -stable closed subscheme. For a morphism , the limit exists if extends to a morphism , in which case the extension and its value at are unique by separatedness; for a point one writes for the orbit map and asks that extend over . When is affine, the action is a -gradation and exists iff for all with ; the concentrator subscheme is the closed subscheme defined by the ideal generated by , where is the graded ideal of . The associated functor sends to the set of with .
The uniqueness in the first sentence follows from separatedness (Separated S-scheme): the equalizer of two extensions is closed in and contains . This open is schematically dense, since on every affine chart of the map is injective. The equalizer is therefore the whole source, also when is nonreduced; the affine description is the gradation induced by the coaction of on when is affine (Affine schemes and their coordinate rings), and the closed subscheme structure is that of the ideal sheaf generated by the listed homogeneous pieces (Ideal sheaves). The functor-of-points description of is stated here and proved in Representability and smoothness of concentrator subschemes; no representability is asserted by the definition itself.
Depends on
Used by
Dependency tree · two levels
21 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. S. Milne, Algebraic Groups (corrected 2022 printing, Cambridge University Press) (standard reference, not scraped)
- Brian Conrad, Reductive Group Schemes (SGA 3 summer school, Luminy; Panoramas et Syntheses) (standard reference, not scraped)