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.

Finite étale algebras over a complete local ring are determined by reduction

Statement

Assume AC. Let (A,m) be a Noetherian local ring complete and separated for an ideal I⊆m. Reduction is an equivalence between finite étale A-algebras and finite étale A/I-algebras. In particular this applies to I=m, or to a parameter ideal (f) when A is complete local and regular. This is an affine lifting statement.

Facts & Assumptions

Given: AC, (A,m) and I in the Statement, and a finite étale A/I-algebra D1.

[F1]

Finite étale algebras lift with all maps uniquely through nilpotent ideals (Finite étale algebras lift uniquely through nilpotent thickenings). Over a local ring their finite projective modules are finite free (Finite étale algebras have finite locally free underlying modules).

[F2]

Differentials commute with base change and Nakayama detects zero finite modules (Kähler differentials commute with scalar base change, Assuming the Axiom of Choice, generators modulo an ideal in the Jacobson radical lift to generators). AC is inherited through [F1]–[F2] (The Axiom of Choice).

[F3]

Finite modules over a complete Noetherian local ring are complete by Completion of a finite module is extension of scalars, and their ideal-adic intersections vanish when that ideal is in the maximal ideal by The Krull intersection is the (1−a)-torsion submodule, and it vanishes in the Jacobson-radical case.

Proof

1.1F1F2construct

By [F1] construct compatible finite étale algebras Dn over A/In. Each is free of the same finite rank r: its residue-field dimension is constant under reduction. Choose a basis of D1 and lift it successively to Dn+1. Nakayama makes each lifted list a basis, since the source and target are free of the same rank and its determinant reduces to a unit. Thus these identifications respect the transition maps, and D=lim←⁡Dn is Ar as a module. The compatible multiplication tables and units define a commutative associative unital algebra structure on it. Its reduction modulo In is Dn.

2.1F1F2step 1.1algebra

The algebra D is finite free, hence flat and finitely presented as an algebra by [F1]. Its finite module of differentials has reduction modulo I equal to zero by [F2], and Nakayama makes it zero. Thus D is finite étale. Given two finite étale A-algebras and a map between their reductions, [F1] gives compatible maps modulo all In. Their matrices have a unique limit because finite free modules are complete and separated. The limit preserves multiplication and unit, since these identities hold modulo every In; conversely any map is determined by all those reductions. This proves the equivalence.

3.1F3step 2.1algebra∎

If A is initially complete for its maximal ideal, it is complete for every ideal I⊆m. Choose representatives for a compatible system modulo In. They form a maximal-adic Cauchy sequence since In⊆mn, and hence have a limit in A. Each In is closed in the maximal-adic topology, because A/In is a complete separated finite module by [F3]; consequently the limit has every prescribed residue modulo In. Injectivity follows from ⋂In⊆⋂mn=0. This proves the parameter-ideal application in the Statement without an additional completeness assumption.

Depends on

Used by

Dependency tree · two levels

31 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