Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

Relative integral closure under elementary etale change

Statement

Assume AC and let A be a reduced finite-type algebra over an algebraically closed field k. Let A→B be any algebra map and C=Int⁡A(B)⊆B. If A→E is an elementary etale algebra change as constructed in Local algebra tools for elementary etale changes of classical varieties, then E⊗AC  =  Int⁡E(E⊗AB) inside E⊗AB. Injectivity on the left is part of the assertion. The algebra B need not be finite type, reduced, or a domain.

Facts & Assumptions

Given: AC and the algebras in the Statement.

[F1]

The specified changes are flat and locally have the monic form (A[T]/(P))h with P′ invertible (Local algebra tools for elementary etale changes of classical varieties).

[F2]

Integral elements form a subring, integrality is transitive, a finite module algebra is integral, and relative integral closure commutes with localization (Integral elements over a nonzero base ring form a subring, Integral extensions are transitive, Integrality and finite-module characterizations for one element, Integrality and integral closure commute with localisation). AC is assumed (The Axiom of Choice).

Proof

1.1F1F2algebra

Flatness of E preserves the injection C↪B. The image of E⊗AC is integral over E, since each of its elements uses finitely many integral elements of C and sums and products of integral elements remain integral by [F2]. For the opposite inclusion it suffices to work on the monic principal-open charts of [F1]; an element belongs to a submodule if its class in the quotient vanishes locally on a covering family.

1.2F2algebraconstruct

Let P∈A[T] be monic of degree d>0, put D=A[T]/(P), and take c∈B[T]/(P) integral over D. Since D is finite free over A, transitivity makes c integral over A. Write c=∑i<dbiTi. Form a splitting algebra over B by adjoining a root of P, dividing by its monic linear factor, then adjoining a root of the quotient and continuing. Every extension is finite free with a basis containing 1, so B injects into the splitting algebra, and its roots α1,…,αd are integral over A. The polynomial identity P′(T)c(T)≡∑i=1dc(αi)∏j≠i(T−αj)(modP(T)) holds universally: over independent formal roots, interpolation proves it after inverting the Vandermonde determinant, and injectivity of that localization in the universal polynomial domain proves the original polynomial identity. Specialization therefore permits repeated roots. Each c(αi) is integral over A, because evaluation carries its monic equation to a monic equation. Every coefficient on the right is integral over A. The degree-less-than-d remainder on the left has coefficients in the injected ring B, so each of those coefficients belongs to C. Thus P′c∈C[T]/(P).

2.1F1F2step 1.1step 1.2algebra∎

On the chart E=Dh of [F1], let b∈(B[T]/(P))h be integral over E. Localization compatibility in [F2] gives some N such that c=hNb lies in B[T]/(P) and is integral over D. By step 1.2, P′c lies in C[T]/(P). Both h and P′ are invertible in E, whence b=h−N(P′)−1(P′c) belongs to E⊗AC. Covering by these charts proves the opposite inclusion. Degree-zero monic charts are empty and cause no exception; the zero algebras are likewise harmless. Together with step 1.1 this proves the equality. AC is inherited through [F1]; the finite splitting-algebra construction adds no further choice.

Depends on

Used by

Dependency tree · two levels

33 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