Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 n≥0, let RQ=Q[z1±1,…,zn±1] and RC=C[z1±1,…,zn±1], and let I⊆RC be an ideal invariant under coefficientwise application of every field automorphism of C fixing Q. Then I=(I∩RQ)RC. If I is radical, then I∩RQ is radical as well. In particular, if S⊆(C∗)n is preserved by all such coordinatewise automorphisms, the radical vanishing ideal of its Zariski closure is the scalar extension of a radical ideal over Q. This includes the empty set, the whole torus and zero variables. No algebraicity or closedness of S is assumed.

Statement references

Facts & Assumptions

Given: Full AC, the indicated Laurent rings, ideal or point set, and coefficientwise field automorphisms.

[A1]

The Axiom of Choice is inherited through the fixed-field supplier.

[F1]

The fixed field of Aut(C/Q) is Q proves that a complex number fixed by every automorphism fixing Q belongs to Q. Its proof includes the extension of embeddings to algebraic closures and the transcendence-basis argument under full AC.

Proof

1.1F1givenconstructalgebra

Finite stable linear spaces have rational bases. Let W⊆CN 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 W to initial coordinate blocks; once these columns are fixed, each row is the unique vector of W whose pivot coordinates are its specified standard basis vector. Indeed the pivot-coordinate projection is an isomorphism W→Cdim⁡W 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 W, so uniqueness fixes every entry of this matrix. By [F1] all entries are rational. Thus its rows belong to W∩QN and their complex span is W. If W=0 the row list is empty and the same conclusion holds.

2.1step 1.1givenalgebra

Apply finite descent to each support box. For d≥0 let Vd be the finite-dimensional complex span of monomials zα with −d≤αi≤d, in a fixed lexicographic order. For n=0 take the single monomial 1. Coefficientwise automorphisms preserve Vd and preserve Wd=I∩Vd. Step 1.1 expresses each element of Wd as a finite complex linear combination of elements of I∩RQ. Every Laurent polynomial has finite support and belongs to some Vd. Hence every element of I belongs to (I∩RQ)RC. The reverse inclusion holds because I 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.

3.1A1step 2.1givenconstructalgebra∎

Radical contraction and stable point sets. If f∈RQ and fk∈I∩RQ for an integer k≥1, radicality of I gives f∈I∩RQ. Thus the contracted ideal is radical. For the point-set assertion let I(S) be the Laurent polynomials vanishing on every point of S. It is radical, since a complex number whose positive power vanishes is zero. For an automorphism σ and s∈S, one has (σf)(s)=σ(f(σ−1s))=0 whenever f∈I(S), so σI(S)=I(S) using the inverse automorphism too. The Zariski closure has exactly the same vanishing ideal: each zero set of a polynomial vanishing on S is closed and contains the closure, and the reverse inclusion follows from S⊆S‾. Apply step 2.1 to I(S), then the radical contraction just proved. Empty S gives the unit ideal and the full torus gives zero; step 2.1 also handles n=0 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