Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Indeterminacy of a rational map to a group is divisorial

Statement

Assume the Axiom of Choice. Let k be algebraically closed, X a smooth integral finite-type k-scheme, and H a separated finite-type k-group scheme. The complement of the maximal domain of a rational map f:X⇢H is either empty or a finite union of prime divisors.

Facts & Assumptions

[F1]

Smooth local rings are UFDs, and hence a rational function is regular at a point exactly when none of its pole divisors contains that point. (Regular local rings are unique factorization domains)

[F2]

Nonempty opens of finite-type schemes over an algebraically closed field have rational closed points. (Over an algebraically closed field, every maximal ideal is an evaluation ideal)

[F3]

Rational maps to separated schemes have a unique maximal open domain, obtained by gluing representatives. Group multiplication and inverse are morphisms. (Rational maps of integral finite-type schemes, Abelian varieties over a field)

Proof

Given: AC, k, X, H, and f as above.

1.1F1F3givenconstruct

On the product of its domain with itself define Φ(x,y)=f(x)f(y)−1. This is a rational map X×X⇢H and is the identity on the generic diagonal. Fix an affine neighbourhood W=Spec⁡B of the identity in H, and finite k-algebra generators b1,…,br of B. The preimage of W under Φ is a nonempty open since it contains the diagonal over the domain of f. Thus ri=Φ∗bi are rational functions on X×X. Their finitely many pole divisors determine, by [F1], precisely the locus where the rational map to W is not regular. Where all ri are regular, their algebraic relations remain valid and define its extension as a morphism to W.

2.1F1F2F3step 1.1algebra

For a closed point x∈X(k), f is defined at x if and only if Φ is defined at (x,x), and the value there is the identity. The forward implication is immediate. Conversely, if Φ extends at (x,x), its diagonal restriction is the identity by generic agreement and separatedness. Choose an open neighbourhood in X×X on which it is regular. Its slice at x in the second coordinate meets the dense domain of f, so [F2] supplies a rational point u in that intersection. Restricting Φ to X×{u} near x and multiplying by the fixed f(u) extends f near x. Since the value on the diagonal is the identity, this is also equivalent to all ri being regular at (x,x): if Φ is defined there its value lies in W, and conversely the regular ri extend the map to W.

3.1F1F2F3step 1.1step 2.1algebra∎

No pole divisor of any ri contains the whole diagonal: Φ maps the diagonal over the domain of f to the identity in W. Each such prime divisor is locally Cartier by [F1], and its restriction to the integral smooth diagonal is either empty or an effective Cartier divisor, since its local equation is not zero at the generic point of the diagonal. Its support therefore is a union of codimension-one subvarieties of X. By step 2.1 the indeterminacy locus equals the union of these restricted supports on all closed points. Both are closed subsets of a finite-type scheme over an algebraically closed field, so [F2] shows they are equal as subsets. This is precisely the claimed pure divisorial complement. AC is inherited from [F1]–[F2].

Depends on

Used by

Dependency tree · two levels

29 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