Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Coprime polynomial factorisations lift after an etale localisation

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let R be a commutative ring, let r,s≥1 and let f(T)=Tn+a1Tn−1+⋯+an∈R[T],n=r+s, be monic of degree n, and let p∈Spec⁡R. Suppose that the image fˉ∈κ(p)[T] admits a factorisation fˉ=gˉ hˉ with gˉ,hˉ monic of degrees r and s and coprime in the strong form aˉ gˉ+bˉ hˉ=1for some aˉ,bˉ∈κ(p)[T].

Then there exist a finitely presented R-algebra R′ and a prime p′⊆R′ lying over p with κ(p′)=κ(p) such that

  1. the structure morphism Spec⁡R′→Spec⁡R is 'etale at every point (Étale morphism of schemes), and
  2. f=gh in R′[T] for monic g,h∈R′[T] of degrees r and s that are coprime in R′[T]: there are a,b∈R′[T] with ag+bh=1.

Explicitly one may take A=R[b1,…,br,c1,…,cs], gu=Tr+b1Tr−1+⋯+br,hu=Ts+c1Ts−1+⋯+cs, let ϕ1,…,ϕn∈A be the coefficients of guhu−f in the basis Tn−1,…,T,1, put R∘=A/(ϕ1,…,ϕn), let p0⊆R∘ be the kernel of the substitution sending bi,cj to the coefficients of gˉ,hˉ, and put R′=(R∘)d, p′=p0R′, where d∈R∘ is the determinant of the Jacobian matrix (∂ϕk/∂bi, ∂ϕk/∂cj).

Facts & Assumptions

Given: The data and hypotheses displayed in the Statement, with the conventions fixed there.

[F1]

Assume AC. Let Ch≅(A[t1,…,tm]/(f1,…,fr))g be a presentation of an affine chart of a locally finitely presented morphism in which some r×r minor of the Jacobian matrix (∂fj/∂ti) becomes a unit; then the morphism is smooth at the point and exhibits relative dimension m−r there, and conversely every smooth point admits such a chart (Relative Jacobian criterion with its presentation hypothesis, Standard smooth presentations and locally standard smooth maps, Locally finite presentation morphisms).

[F2]

'Etale at a point means smooth at that point of relative dimension 0: locally of finite presentation, flat, geometrically regular fibres, and local fibre dimension 0 at each point over it; a chart of relative dimension m−r with m=r therefore witnesses 'etaleness (Étale morphism of schemes, Relative dimension of a smooth morphism at a point, Smooth morphism of schemes).

[F3]

For d∈R∘ the principal localisation (R∘)d has spectrum the primes of R∘ avoiding d, extension and contraction are inverse bijections preserving strict inclusion, and localisation commutes with quotients, so for a prime p0∌d with image p′ the quotient ring satisfies R′/p′≅(R∘/p0)d, and its fraction field is the residue field κ(p′) (Principal localisation Rf={1,f,f2,…}−1R, Prime ideals of a localization are exactly the primes disjoint from the denominator set, Primes of a localization avoid the denominator set, Localisation commutes with quotient rings: S−1R/S−1I≅Sˉ−1(R/I), Rp/pRp≅Frac⁡(R/p) is the residue field at p).

[F4]

The polynomial ring R[b1,…,br,c1,…,cs] is the free commutative R-algebra on n=r+s indeterminates, with coefficients extracted by the R-linear coefficient functionals; a quotient of a polynomial algebra by a finitely generated ideal is a finitely presented algebra, so Spec⁡ of it over Spec⁡R is locally of finite presentation (The polynomial ring R[xi:i∈I] as finitely supported coefficient families on monomials, Finitely presented modules and finitely presented algebras, Locally finite presentation morphisms).

[F5]

For a square matrix over a commutative ring with invertible determinant d, the inverse exists and equals d−1adj⁡(A), so every linear system with that matrix has a unique solution (If det⁡(A) is a unit, then A−1=det⁡(A)−1adj⁡(A), For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix); over a field, a square matrix is invertible if and only if its kernel is zero, by rank--nullity (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F6]

The Axiom of Choice states that every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

technique · direct
1.1F4

The universal coefficient algebra and the point. Put A=R[b1,…,br,c1,…,cs], gu=Tr+∑i=1rbiTr−i, hu=Ts+∑j=1scjTs−j and let ϕ1,…,ϕn∈A be the coefficients of guhu−f in the basis Tn−1,…,T,1, so that R∘=A/(ϕ1,…,ϕn) is a finitely presented R-algebra [F4] and f=guhu holds in R∘[T] by construction. Substituting for bi,cj the coefficients of gˉ,hˉ defines an R-algebra map R∘→κ(p) because gˉhˉ=fˉ makes all ϕk vanish; let p0 be its kernel. The composite R→R∘→κ(p) is the canonical map, so p0 lies over p, and R∘/p0→κ(p) is injective by definition of the kernel and its image contains R/p; because it lies in κ(p)=Frac⁡(R/p), the fraction field of R∘/p0 is exactly κ(p0)=κ(p).

1.2F4

The Jacobian is a Sylvester matrix. Writing the coefficient vector of a polynomial of degree ≤n−1 in the basis Tn−1,…,T,1, the n×n Jacobian matrix J with entries ∂ϕk/∂bi and ∂ϕk/∂cj is the matrix of the R-linear map (δb,δc)↦(δg)hu+gu(δh), where δg=∑iδbiTr−i ranges over polynomials of degree ≤r−1 and δh=∑jδcjTs−j over polynomials of degree ≤s−1: this is the product rule applied to the coefficient functionals ϕk of guhu, the term f contributing no derivatives. Reducing modulo p0 gives the matrix Jˉ over the field κ(p0)=κ(p) of the map (δg,δh)↦(δg)hˉ+gˉ(δh).

2.1F5step 1.1step 1.2

Invertibility of the reduced Jacobian. Let δg,δh over κ(p) satisfy (δg)hˉ+gˉ(δh)=0 with deg⁡δg≤r−1 and deg⁡δh≤s−1. Using the Bezout identity aˉgˉ+bˉhˉ=1, one has δh=δh(aˉgˉ+bˉhˉ)=aˉ(δhgˉ)+bˉ(δhhˉ)=hˉ(bˉδh−aˉδg), so hˉ divides δh; since deg⁡δh<s=deg⁡hˉ and hˉ≠0, this forces δh=0. Then gˉ(δh)=0 gives (δg)hˉ=0, and since κ(p)[T] is a domain with hˉ≠0 we get δg=0. Hence Jˉ has zero kernel between spaces of dimension n, so it is invertible and det⁡(Jˉ)≠0 by [F5]. Therefore d:=det⁡J∈R∘ has nonzero image in κ(p0)=κ(p) and d∉p0.

3.1F3step 1.1step 2.1

Localisation at the determinant. Put R′=(R∘)d and p′=p0R′, a prime of R′ over p because d∉p0 [F3]. In R′ the element d is a unit, κ(p′)=Frac⁡((R∘/p0)d)=Frac⁡(R∘/p0)=κ(p) by step 1.1, since localizing a domain at a nonzero element does not change its fraction field, and the equation f=guhu of step 1.1 persists in R′[T] with the images of gu,hu, which are monic of degrees r,s because R′≠0 and leading coefficient 1 remains a unit. This gives claim 2 in the form g=gu, h=hu inside R′.

4.1F1F2F4step 3.1

'Etaleness on the whole chart. The algebra R′ is the localisation at d of the finitely presented R-algebra R∘=A/(ϕ1,…,ϕn), hence is finitely presented over R [F4], and the full n×n Jacobian determinant is the unit d of R′; the presentation R′=(R[b1,…,br,c1,…,cs]/(ϕ1,…,ϕn))d therefore has an invertible n×n minor with m=n variables and n equations. By the Jacobian criterion [F1] (AC) the morphism Spec⁡R′→Spec⁡R is smooth of relative dimension n−n=0 at every prime of R′, so it is 'etale everywhere by [F2]. This gives claim 1.

4.2F5step 1.2step 3.1

Coprimality of the lifted factors. Since det⁡J=d is a unit of R′, the matrix J is invertible over R′ with inverse d−1adj⁡(J) [F5]. In the identification of step 1.2 the same matrix J represents the R′-linear map (b,a)↦ag+bh, where a runs over the polynomials of degree ≤s−1 (coefficients the images of c1,…,cs) and b over the polynomials of degree ≤r−1 (coefficients the images of b1,…,br), into the polynomials of degree ≤n−1; invertibility of J makes this map surjective, so there are a,b∈R′[T] with ag+bh=1; in particular g and h are coprime in R′[T].

5.1

Conclusion and choice accounting. Steps 1.1, 1.2 and 2.1 construct R′,p′ with κ(p′)=κ(p), step 4.1 gives the 'etaleness of claim 1 and steps 3.1 and 4.2 the factorisation with coprime monic factors of claim 2. The Axiom of Choice [F6] is assumed in the Statement and used exactly through the Jacobian criterion [F1] in step 4.1; the coefficient construction, the residue-field identification and the linear algebra of steps 1.2, 2.1 and 4.2 are choice-free. [F1, F6, step 2.1, step 3.1, step 4.1, step 4.2] □

Depends on

Used by

Dependency tree · two levels

68 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