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 be a discrete valuation ring with fraction field and residue field , let be a strict henselization, and let be a smooth separated faithfully flat finite-type -scheme with a strict -birational group law. Then finitely many section translates of yield a smooth separated finite-type -scheme on which the multiplication of is everywhere defined, and is an -group scheme containing 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 containing the same smooth faithfully flat finitely presented fibre-dense open with the same strict law.
Facts & Assumptions
Given: AC and DC, a DVR with fraction field and residue field , a strict henselization , and a smooth separated faithfully flat finite-type -scheme with a strict birational group law .
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).
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
Successively glue translates whenever a section translation of the original is not defined everywhere as a map . Let be the domain of its original multiplication with values in . By the graph open-immersion property [F1] these are increasing opens of the fixed Noetherian scheme . If the next translation is undefined at , its newly glued translate defines it there; graph calculus then puts in . Such strict increases cannot continue indefinitely in a Noetherian space. Thus for a finite enlargement , every original section translation is everywhere defined.
Fix a geometric pair in . Strict graph calculus [F1] makes the auxiliary locus of where and is in the original law domain open and fibre-dense in . By [F2] some section 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 is defined near the pair, since its inner product lies in the original and is everywhere defined by step 1.1. Associativity identifies this map with the original rational multiplication. It follows that the extended strict law on is a morphism on the entire original .
To extend the law to all of , choose an auxiliary at a generic point of the fibre over a given pair . The strict graph projections [F1] put and on a fibre-dense open auxiliary locus. Their product is defined by step 2.1, and associativity gives . This gives the rational law a regular representative on a smooth faithfully flat auxiliary cover, so domain descent [F2] makes it regular at . The same argument makes the division map regular everywhere. The strict translation monomorphism into the relative birational-map group, supplied by [F1], now identifies with a subset closed under multiplication and division for every test . It is nonempty since faithful flatness and smoothness over the strictly henselian DVR give an -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 is the claimed smooth separated finite-type group completion.
For uniqueness over a base , let be smooth separated finitely presented group completions containing the same smooth faithfully flat finitely presented fibre-dense . Each acts faithfully by birational translations on for every test : the domain is fibre-dense, and equality of translations implies equality of the translating sections after the faithfully flat dense domain cover of . The multiplication map is smooth, since it is a restriction of group multiplication, and surjective: in each geometric fibre, for a prescribed , the dense opens and intersect. It is quasi-compact and locally finitely presented. On the kernel pair of , two pairs from have the same product in , hence the same product of birational translations of by [F1]; faithfulness for makes their -images equal. Fppf morphism descent [F2] gives with composite equal to . Reversing the roles gives an inverse, by surjectivity of the covers. The isomorphism fixes (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
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Strict law graph calculus
- Separated translate gluing
- Strict henselization of a DVR and smooth sections
- 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
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
- Bosch, Lutkebohmert, Raynaud, Neron Models (1990), 5.3/6-8 and 5.1/3-4 (finite translate completion and uniqueness) (standard reference, not scraped)