Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Surface p basis subfield separation

Statement

Assume AC. Let k have characteristic p>0, A=k[ ⁣[X1,…,Xn] ⁣][Y1,…,Ym] and K=Frac⁡A. Choose a possibly infinite p-basis (bi)i∈I of k/kp, meaning its restricted monomials of finite support form a kp-basis. For finite J⊂I put kJ=kp(bi:i∉J), AJ=kJ[ ⁣[X1p,…,Xnp] ⁣][Y1p,…,Ymp] and KJ=Frac⁡AJ. Then A is finite free over AJ, the family (KJ) is downward directed with intersection Kp, and for every finite field extension L/K, ⋂JLpKJ=Lp.

Facts & Assumptions

Given: A field k of characteristic p>0, the ring A=k[ ⁣[X1,…,Xn] ⁣][Y1,…,Ym] with fraction field K, and a p-basis (bi)i∈I of k/kp whose restricted monomials of finite support form a kp-basis of k.

[F1]

def-axiom-of-choice. The Axiom of Choice (AC) is the following statement. > Every family of nonempty sets has a choice function > (def-choice-function). Written out: for every set F all of whose members are nonempty, there exists a function g with domain F satisfying g(S)∈S for all S∈F. (The Axiom of Choice)

[F2]

def-dependent-choice. Let X be a set and let R⊆X×X be a binary relation on X. Call R entire on X when for every x∈X there is y∈X with xRy. The Axiom of Dependent Choice, written DC, is the following statement. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

[F3]

def-derivation-algebra. Let A→φB be a homomorphism of commutative rings (def-commutative-ring), so that B is an A-algebra, and let M be a B-module (def-left-and-right-modules). (Derivation of an algebra)

[F4]

def-kahler-differentials-algebra. Let A→φB be a homomorphism of commutative rings and let Der⁡A(B,−) be the derivation functor of Derivation of an algebra. (Universal Kähler differential module)

[F5]

def-linear-basis. Let V be a vector space over a field F (def-vector-space). A subset B⊆V is a basis of V when - (B1) B is linearly independent (def-linear-independence), and - (B2) B spans V, that is span⁡(B)=V (def-linear-combination-and-span, which is where the words spans and spanning set are fixed; they are not redefined (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis)

Proof

1.1F5given

For a finite J⊂I write kJ=kp(bi:i∉J); the p-monomials in the variables bi, i∈J, form a kJ-basis of k by the defining property of a p-basis and the finite-support condition. Consequently the products of these monomials with the X- and Y-monomials of exponents less than p form an explicit AJ-basis of A=k[ ⁣[X] ⁣][Y], because A is a finite free module over k[ ⁣[Xp] ⁣][Yp] with the monomials of exponents less than p as a basis; so A is finite free over AJ=kJ[ ⁣[Xp] ⁣][Yp].

2.1F2step 1.1

The family (KJ) over finite J is downward directed by inclusion of the finite sets, with union the whole index set corresponding to increasing J; only the downward directed structure and its cofinal refinements are used below.

3.1F3F4givenstep 1.1step 2.1

The intersection of the fields KJ is Kp. The inclusion Kp⊆⋂JKJ is immediate. For the reverse inclusion, fix x∈⋂JKJ and write x=f/gp with f,g∈A, g≠0 (replace a denominator g0 by g0p). For each finite J, separately write x=aJ/cJ with aJ,cJ∈AJ, cJ≠0. Then x=(aJcJp−1)/cJp; putting aJ′=aJcJp−1∈AJ gives cJpf=aJ′gp∈AJ, since gp∈Ap⊆AJ. The denominator cJ may depend on J. Every coordinate derivation ∂/∂Xi or ∂/∂Yj kills AJ, as does each coefficient derivation δi dual to bi for i∈J. Applying any such derivation D to cJpf=aJ′gp yields cJpD(f)=0, so D(f)=0. For each coordinate derivation choose any J; for each δi choose J containing i. Thus all coordinate derivatives of f vanish, so only monomials with every X,Y exponent divisible by p occur. Also every coefficient of f is killed by every δi; expanding that coefficient in the finite-support p-monomial kp-basis shows it lies in kp. Hence f∈kp[ ⁣[X1p,…,Xnp] ⁣][Y1p,…,Ymp]=Ap, and x=f/gp∈Kp.

4.1F2F5step 2.1step 3.1

For every finite field extension L/K, ⋂JLpKJ=Lp. We prove the more general assertion by induction on [E:F]: if F has characteristic p and (Fα) is a downward-directed family of purely inseparable subfields of an extension field containing Fp, with ⋂αFα=Fp, then ⋂αEpFα=Ep for every finite extension E/F. Steps 2.1 and 3.1 give these hypotheses for F=K and Fα=KJ. The base case E=F is the intersection hypothesis. If F⊊M⊊E, induction gives ⋂αMpFα=Mp. The family Mα=MpFα is downward directed, purely inseparable over Mp, and has intersection Mp; also EpMα=EpFα. Applying induction to E/M proves the claim. It remains to consider an extension with no proper intermediate field. Such an extension is simple; it is either separable or purely inseparable of degree p. In the separable case write E=F(θ) and let d=[E:F]. Then Ep=Fp(θp) is separable of degree d over Fp. It is linearly disjoint from each purely inseparable Fα/Fp, so 1,θp,…,(θp)d−1 remains a basis of EpFα/Fα. If z belongs to every EpFα, its unique coordinates in this basis lie in every Fα, hence in Fp; thus z∈Ep. In the purely inseparable case write E=F(θ) with θp=t∈F∖Fp. Then Ep=Fp(t). Since t∉⋂αFα, choose α0 with t∉Fα0 and restrict to the cofinal family Fα⊆Fα0. For these indices, tp∈Fp⊆Fα but t∉Fα, so 1,t,…,tp−1 is a basis of EpFα/Fα. The same unique-coordinate argument puts every element of the intersection in Ep.

5.1F1F2step 2.1step 4.1∎

The Axiom of Choice and the Axiom of Dependent Choice are inherited from the Zorn and derivation suppliers; the only quoted input for the family (KJ) is the cofinal subfamily of steps 2.1 and 4.1.

Remarks

  • The explicit finite AJ-basis in step 1.1 gives finite freeness. In step 3.1 the denominator cJ is local to each field KJ; no common denominator is chosen. The extension argument in step 4.1 uses a cofinal refinement only in the purely inseparable degree-p case.
  • Maximality of the p-independent family is supplied by Zorn in the standing construction of the p-basis; the lemma itself takes the family as given.

Depends on

Used by

Dependency tree · two levels

21 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