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 finite-group Noether theorem does not supply invariant finite generation for positive-dimensional groups
Remark
Noether's finiteness theorem for invariants of a finite group (Noether's finiteness theorem: the invariants of a finite group acting on a finite-type algebra over a Noetherian ring form an algebra of finite type) requires the acting group to be finite. It therefore does not supply the finite generation of invariant rings of positive-dimensional groups: applied to the action of on of Invariants of the hyperbolic action of the multiplicative group on the plane the hypothesis fails, since is not finite (Reductive and linearly reductive complex algebraic groups), even though the invariant ring there is ; and no argument on this page reduces a reductive group action to a finite-group action. The finite-group theorem is thus not a substitute for the Reynolds-operator proof of finite generation for complex reductive groups given by the bridge theorem of this page.
The remark is a hypothesis comparison, not a proof step: it records the design caveat that the finite-group Noether bound is not invoked anywhere in the finite-generation argument for reductive , where the Reynolds operator and the graded ideal argument do all the work. No reduction of a - or reductive action to a finite-group action is asserted or used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Michel Brion, Introduction to actions of algebraic groups, Les cours du CIRM 1 (2010), no. 1, 1-22 (standard reference, not scraped)