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 translate completion and uniqueness

Statement

Assume AC and DC as inherited from the supplied algebra and scheme results. Let R be a discrete valuation ring with fraction field K and residue field k, let Rsh be a strict henselization, and let X be a smooth separated faithfully flat finite-type Rsh-scheme with a strict Rsh-birational group law. Then finitely many section translates of X yield a smooth separated finite-type Rsh-scheme Y on which the multiplication of X×X is everywhere defined, and Y is an Rsh-group scheme containing X as a fibre-dense open subscheme. Any two group completions of the birational law are canonically isomorphic. The uniqueness assertion also holds after arbitrary base change: more generally it holds for smooth separated finitely presented group schemes over a base S containing the same smooth faithfully flat finitely presented fibre-dense open X/S with the same strict law.

Facts & Assumptions

Given: AC and DC, a DVR R with fraction field K and residue field k, a strict henselization Rsh, and a smooth separated faithfully flat finite-type Rsh-scheme X with a strict birational group law m.

[F1]

The strict graph has open-immersion two-coordinate projections and both-projection dense images; section translation is defined at a point exactly when the law is defined at the pair (Strict law graph calculus). Gluing a left translate along its closed graph preserves smoothness, separatedness, finite type and strictness (Separated translate gluing).

[F2]

Over the strictly henselian base every dense open of either fibre is met by a section, and sections meet all fibre-dense opens (Strict henselization of a DVR and smooth sections); rational maps descend along faithfully flat maps and agree on schematically dense opens of separated targets (S-dense open subschemes and S-rational maps, An S-rational map defined after a faithfully flat smooth base change is defined, Scheme morphisms satisfy fppf descent, Agreement on a schematically dense open).

Proof

technique · direct: enlarge by translates until the multiplication domains stabilize, then descend and verify the group axioms
1.1F1givenconstruct

Successively glue translates X(i+1)=X(i)∪X(i)(ai+1) whenever a section translation of the original X is not defined everywhere as a map X⇢X(i). Let Qi⊆X×X be the domain of its original multiplication with values in X(i). By the graph open-immersion property [F1] these are increasing opens of the fixed Noetherian scheme X×X. If the next translation is undefined at b, its newly glued translate defines it there; graph calculus then puts (ai+1,b) in Qi+1∖Qi. Such strict increases cannot continue indefinitely in a Noetherian space. Thus for a finite enlargement Y, every original section translation ta:X→Y is everywhere defined.

2.1F1F2step 1.1algebra

Fix a geometric pair (x,y) in X×X. Strict graph calculus [F1] makes the auxiliary locus of w where w−1x∈X and (w−1x,y) is in the original law domain open and fibre-dense in X. By [F2] some section a meets this locus: on the special fibre use smooth section lifting, and on the generic fibre use the generic-open assertion on a component with nonempty special fibre. Then the map (x,y)↦a((a−1x)y) is defined near the pair, since its inner product lies in the original X and ta:X→Y is everywhere defined by step 1.1. Associativity identifies this map with the original rational multiplication. It follows that the extended strict law on Y is a morphism on the entire original X×X.

3.1F1F2step 2.1algebra

To extend the law to all of Y×Y, choose an auxiliary a∈X at a generic point of the fibre over a given pair (b,c)∈Y×Y. The strict graph projections [F1] put ba∈X and a−1c∈X on a fibre-dense open auxiliary locus. Their product is defined by step 2.1, and associativity gives bc=(ba)(a−1c). This gives the rational law a regular representative on a smooth faithfully flat auxiliary cover, so domain descent [F2] makes it regular at (b,c). The same argument makes the division map (b,c)↦b−1c regular everywhere. The strict translation monomorphism into the relative birational-map group, supplied by [F1], now identifies Y(T) with a subset closed under multiplication and division for every test T. It is nonempty since faithful flatness and smoothness over the strictly henselian DVR give an Rsh-section. Hence it is a subgroup: division gives the unit and inverses, and associativity holds by the strict law and schematic density. These natural operations are scheme morphisms by their construction, so Y is the claimed smooth separated finite-type group completion.

4.1F1F2step 3.1algebra∎

For uniqueness over a base S, let Y1,Y2 be smooth separated finitely presented group completions containing the same smooth faithfully flat finitely presented fibre-dense X. Each Yi acts faithfully by birational translations on XT for every test T: the domain XT∩y−1XT is fibre-dense, and equality of translations implies equality of the translating sections after the faithfully flat dense domain cover of T. The multiplication map qi:X×SX→Yi is smooth, since it is a restriction of group multiplication, and surjective: in each geometric fibre, for a prescribed y, the dense opens X and yX−1 intersect. It is quasi-compact and locally finitely presented. On the kernel pair of q1, two pairs from X2 have the same product in Y1, hence the same product of birational translations of X by [F1]; faithfulness for Y2 makes their q2-images equal. Fppf morphism descent [F2] gives Y1→Y2 with composite q1 equal to q2. Reversing the roles gives an inverse, by surjectivity of the covers. The isomorphism fixes X (compare translations, using their faithful action) and preserves group multiplication by the same comparison. Faithfulness also proves uniqueness. This proof applies to arbitrary pullback bases, including the tensor-product bases used for descent.

Depends on

Used by

Dependency tree · two levels

57 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