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.

Separated translate gluing

Statement

Assume AC and DC as inherited from the supplied algebra and scheme results. Let R be a strictly henselian discrete valuation ring with fraction field K and residue field k, let X be a smooth separated finite-type R-scheme with a strict R-birational group law m, and let a be an R-section of X. Then gluing X to a left translate X(a) along the closed section-translation graph produces a smooth separated finite-type R-scheme X′ containing X as an R-dense open subscheme and extending the strict law m to a strict law on X′.

Facts & Assumptions

Given: AC and DC, a strictly henselian discrete valuation ring R, a smooth separated finite-type R-scheme X with a strict birational group law m, and a section a:Spec⁡R→X.

[F1]

For a strict law the graph closure of the section translation has two-coordinate projections that are open immersions with dense images, and section translation is defined at b exactly when the law is defined at (a,b) (Strict law graph calculus).

[F2]

Gluing along open subschemes is available, and rational maps agree when they agree on schematically dense opens of separated reduced targets and descend along faithfully flat maps (Gluing affine schemes along compatible open isomorphisms, 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).

[F3]

A separated quasi-finite birational morphism with integral source and normal target is an open immersion, by the finite-birational component argument in Scheme Zariski Main factorization for separated quasi-finite morphisms. Smooth schemes over a DVR are regular and normal, as established in [F1].

Proof

technique · direct: glue along the translation graph and check the strict-law conditions on the pieces
1.1F1F2givenconstruct

Let Γ⊆X×RX be the graph closure of the section translation ta; by [F1] its two projections are open immersions onto R-dense open subschemes. Gluing X to a copy X(a) along Γ is therefore gluing along an open subscheme, giving a smooth finite-type R-scheme X′ containing X as an R-dense open subscheme; the closedness of the graph in the separated product makes X′ separated.

2.1F1F2step 1.1construct

Write j:X→∼X(a) for the canonical copy map, which extends the left translation by a on its original domain. Let U be the strict-law domain in X2, with translation images V and W. On U1=(j×id⁡)(U) define m′(j(x),y)=j(m(x,y)). On U2⊂X×X(a), consisting of (x,j(y)) with (x,a)∈U and (m(x,a),y)∈U, define m′(x,j(y))=m(m(x,a),y). Together with m on U these morphisms agree on overlaps by associativity and schematic density [F2], and give m′ on U′=U∪U1∪U2. For any fixed y, strictness makes the conditions on x in U2 dense: right translation by a is birational, and the domain of right translation by y is dense. Thus U2 is dense along its second projection. The domains U and U1 are dense along the first projection; since X is fibre-dense in X′, these facts make U′ dense along both projections of (X′)2. No definition on the whole fourth chart X(a)2 is needed for this density assertion.

3.1F1F2F3step 2.1algebra∎

The universal translations on each of U,U1,U2 are open immersions: on U1 conjugate the original translations by the copy isomorphism j; on U2 compose the original translations with the open-immersion right translation by a and with j. Hence the glued translations are quasi-finite. They are birational and separated, and their source and target are regular componentwise; [F3] makes them open immersions. The left-translation image contains V and (j×j)(V), so it is dense along both projections. The right-translation image contains W and (j×id⁡)(W), giving first-projection density and second-projection density over X. Over a second coordinate j(y), its image from U2 is the set of products (xa)y on the dense domain just described; the composite of the birational right translations by a and y has dense image in X, hence in X′. This gives second-projection density over X(a) as well. Thus m′ is strict. Associativity follows from its agreement with m on schematically dense domains.

Depends on

Used by

Dependency tree · two levels

54 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