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.

Strict law graph calculus

Statement

Assume AC and DC as inherited from the supplied algebra and scheme results. Let R be a discrete valuation ring, X a smooth separated faithfully flat finite-type R-scheme, and m a strict R-birational group law on X (Strictification). Then:

(a) X embeds into the functor of relative birational self-maps of X, and the closure Γ of the multiplication graph in X×RX×RX has all three two-coordinate projections which are open immersions with both-projection dense images;

(b) for a section a and a point b, the section translation ta is defined at b if and only if the law m is defined at (a,b);

(c) products of section translations are computed by the graph triple: if the law is defined at the relevant pairs, then tatb=tc where c is the third coordinate of the graph.

Facts & Assumptions

Given: AC and DC, a DVR R, a smooth separated faithfully flat finite-type R-scheme X, and a strict R-birational group law m on X.

[F1]

Strictness: on an open U⊆X×RX dense over both projections, the universal left and right translations are open immersions with both-projection dense images; the law is associative as an R-rational map (Strictification).

[F2]

The graph of a rational map has a schematic closure containing it as a schematically dense open; since the graph domain is smooth and reduced, the closure is reduced. Schematic density survives product with the flat R-scheme X. Fibre-dense opens in smooth finite-presentation schemes remain schematically dense after arbitrary test-scheme base change, and two morphisms into a separated target which agree on a schematically dense open agree everywhere (Schematic closure and agreement on a dense open, Projective weak models and rational mapping, Agreement on a schematically dense open).

[F3]

A finite-type morphism with at most one point in each geometric fibre is quasi-finite. A separated quasi-finite birational morphism from a reduced source to a normal target is an open immersion componentwise: apply Zariski Main locally, then use that a finite birational algebra inside the target's fraction field equals the normal domain (Scheme Zariski Main factorization for separated quasi-finite morphisms, Regularity ascends and descends along a flat local homomorphism, Locally standard smooth iff flat with geometrically regular fibres, regular local rings are normal).

[F4]

Pullback of a faithfully flat morphism is faithfully flat and detects equality of morphisms: if two maps become equal after pullback along a faithfully flat cover, they were equal before pullback (Faithfully flat scheme morphism).

Proof

technique · follow BLR 5.2/4 and 5.3/1–4: represent elements by strict translations, prove the graph relation on a dense auxiliary variable, then use normality and Zariski Main
1.1F1F2F4givenconstruct

For an R-scheme T, let BirX/R(T) be the group of T-birational self-maps of XT=X×RT. Strictness [F1] makes each section a∈X(T) act by a T-birational left translation τa, naturally in T. This defines X→BirX/R. It is a monomorphism: if τa=τb, then on the common dense domain the maps (τa,id⁡) and (τb,id⁡) from T×RX to XT×TXT agree. They factor as the universal right translation (x,y)↦(m(x,y),y) after (a,id⁡) and (b,id⁡), respectively. The right translation is an open immersion by [F1], so cancellation gives (a,id⁡)=(b,id⁡) on that dense open; [F2] makes the open schematically dense, hence the equality holds on T×RX. Since T×RX→T is faithfully flat, [F4] gives a=b. Associativity also gives τaτb=τc whenever m(a,b)=c is defined.

2.1F1F2step 1.1algebra

Let Γ⊆X3 be the schematic closure of the graph of m∣U, with coordinates (x,y,z). On the open locus in X4 where (y,w),(x,m(y,w)),(z,w)∈U, the maps m(x,m(y,w)) and m(z,w) are defined. This locus is dense over the first three coordinates by the two-projection density of U and the open-immersion property of the strict translations in [F1]. On the intersection with the graph over U, associativity makes the two morphisms agree on the dense open where the associative identity is represented; as the target X is separated, [F2] gives equality on their common domain. The graph over U, after product with the flat scheme X, is schematically dense in Γ×RX; hence [F2] extends this equality to the whole common domain in Γ×RX. Pulling back along any T-valued triple (a,b,c):T→Γ shows τaτb=τc as T-birational maps. In particular, if m(a,b)=c is defined, then tatb=tc, proving (c); conversely, for fixed any two coordinates of a triple in Γ(T), the third is unique by the monomorphism of step 1.1 and invertibility in BirX/R(T).

3.1F1F3step 2.1construct

Each projection qij:Γ→X2 is a monomorphism: for every T, a triple (a,b,c)∈Γ(T) satisfies the translation relation of step 2.1, so any two of its coordinates determine the third. It is finite type, hence quasi-finite by [F3]. On the graph over U, q12 is the identity onto U, while q13 and q23 are the universal left and right translations; these are open immersions with dense images by [F1]. Thus each qij is birational on every component it meets. The target X2 is normal because it is smooth over the regular DVR R. Applying [F3] componentwise shows each qij is an open immersion. Its image contains respectively U, the left-translation image, and the right-translation image, all dense over both projections, so the images are dense over both projections. This proves (a).

4.1F1F2F3step 3.1step 2.1construct∎

The open immersion q12 identifies Γ with an open W⊆X2, and the third coordinate defines m on W. This is the full domain: any local morphism extending m has graph in the closed Γ, since it agrees with the graph over U on a schematically dense open. For a section a:T→X and a T-point b of XT, if m is defined at (a,b), pullback along a×id⁡ shows ta is defined at b. Conversely, if ta is defined at b, choose an open neighbourhood D on which it is a morphism and consider D→X3, y↦(a(pT(y)),y,ta(y)), where pT:XT→T. On the T-dense open where the strict law defines ta, this graph factors through Γ; universal schematic density [F2] therefore makes it factor through Γ on D. Hence (a,b)∈W, so the law is defined there. This proves (b) for every test scheme. For an R-section a, the graph closure Γa⊆X2 of ta maps into Γ. Its two projections are finite-type monomorphisms by the monomorphism of q12 and q13, and are birational because ta is an R-birational map. The target X is normal; [F3] makes both projections open immersions with dense images, as used for translate gluing.

Depends on

Used by

Dependency tree · two levels

137 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