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.
Automorphism-stable Laurent ideals descend to rational coefficients
Statement
Assume full AC. Let , let and , and let be an ideal invariant under coefficientwise application of every field automorphism of fixing . Then If is radical, then is radical as well. In particular, if is preserved by all such coordinatewise automorphisms, the radical vanishing ideal of its Zariski closure is the scalar extension of a radical ideal over . This includes the empty set, the whole torus and zero variables. No algebraicity or closedness of is assumed.
Statement references
Facts & Assumptions
Given: Full AC, the indicated Laurent rings, ideal or point set, and coefficientwise field automorphisms.
The Axiom of Choice is inherited through the fixed-field supplier.
The fixed field of Aut(C/Q) is Q proves that a complex number fixed by every automorphism fixing belongs to . Its proof includes the extension of embeddings to algebraic closures and the transcendence-basis argument under full AC.
Proof
Finite stable linear spaces have rational bases. Let be a complex linear subspace invariant under coordinatewise application of all the automorphisms in [F1]. Choose any finite basis and put its row matrix in reduced row-echelon form, deleting zero rows. Finite elimination terminates by choosing successive pivot columns in the fixed order. The resulting nonzero rows are independent of the initial basis: the pivot columns are characterized successively by the dimensions of the projections of to initial coordinate blocks; once these columns are fixed, each row is the unique vector of whose pivot coordinates are its specified standard basis vector. Indeed the pivot-coordinate projection is an isomorphism by row reduction. Applying a field automorphism preserves row-echelon equations, zero entries, leading ones and the increasing pivot order. It takes the row space to , so uniqueness fixes every entry of this matrix. By [F1] all entries are rational. Thus its rows belong to and their complex span is . If the row list is empty and the same conclusion holds.
Apply finite descent to each support box. For let be the finite-dimensional complex span of monomials with , in a fixed lexicographic order. For take the single monomial . Coefficientwise automorphisms preserve and preserve . Step 1.1 expresses each element of as a finite complex linear combination of elements of . Every Laurent polynomial has finite support and belongs to some . Hence every element of belongs to . The reverse inclusion holds because is an ideal containing that rational intersection. This proves the asserted scalar-extension equality without choosing an infinite family of generators or invoking an elimination theorem.
Radical contraction and stable point sets. If and for an integer , radicality of gives . Thus the contracted ideal is radical. For the point-set assertion let be the Laurent polynomials vanishing on every point of . It is radical, since a complex number whose positive power vanishes is zero. For an automorphism and , one has whenever , so using the inverse automorphism too. The Zariski closure has exactly the same vanishing ideal: each zero set of a polynomial vanishing on is closed and contains the closure, and the reverse inclusion follows from . Apply step 2.1 to , then the radical contraction just proved. Empty gives the unit ideal and the full torus gives zero; step 2.1 also handles directly. These are finite row computations plus the precise full-AC fixed-field theorem, with no extra choice assumption.
Depends on
Used by
Dependency tree · two levels
7 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
- Cooper, Culler, Gillet, Long and Shalen, Plane Curves Associated to Character Varieties of 3-Manifolds (standard reference, not scraped)