Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The group schemes Ga, Gm, and GLn

Example

Over every field k, the additive group Ga=Spec⁡k[x], multiplicative group Gm=Spec⁡k[t,t−1], and general linear group GL⁡n=Spec⁡k[xij,d−1],d=det⁡(xij),n≥1, are group schemes of finite type. For every commutative k-algebra R, their groups of points are respectively (R,+), R×, and the invertible n×n matrices over R. Their structure morphisms are regular on the displayed schemes, including when R is nonreduced.

Verification

Given: A field k, a positive integer n, and a commutative unital k-algebra R.

[F1] Group schemes and their homomorphisms are defined in Group schemes of finite type over a field and Morphisms and closed subgroup schemes of group schemes.

[F2] Ring maps correspond to affine scheme morphisms, and affine product rings are tensor products. (Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products)

1.1F1F2givenalgebra

For Ga, the comorphisms of multiplication, identity and inverse send x respectively to x⊗1+1⊗x, 0, and −x. They are algebra maps and hence morphisms by [F2]. Evaluation on R identifies its points with R and its operations with addition, zero, and negation. For Gm, the corresponding formulas are t↦t⊗t, t↦1, and t↦t−1. Each image of t is a unit, so these maps are defined on the Laurent algebra. Evaluation identifies its points with R× and its operations with multiplication, one and inversion. These formulas satisfy the group-object identities as ring identities and hence as scheme morphisms by [F1]–[F2].

1.2F2F3constructalgebra

For X=(xij), define multiplication by xij↦∑lxil⊗xlj. Its determinant is (d⊗1)(1⊗d) by [F3], a unit, so the formula extends to the localized coordinate ring. The identity has xij↦δij, with determinant one. Define inversion by the entries of d−1adj⁡(X); they belong to the same localized algebra. Its determinant is a unit, since the adjugate identity gives XX−1=I and determinant multiplicativity gives det⁡(X−1)=d−1. Thus inversion also gives a morphism. The points of the localized spectrum are exactly matrices with unit determinant, equivalently invertible matrices by [F3].

2.1F1F2F3step 1.1step 1.2algebra∎

Matrix associativity, the identity matrix, and the two inverse identities in [F3] verify all group identities on GL⁡n(R), for every R. They also verify the scheme identities: each domain in those identities is affine by [F2]; testing its coordinate algebra with its universal point tests the morphisms themselves. All three displayed coordinate algebras are finitely generated over k (write the determinant inverse as a generator subject to zd−1=0), so the schemes are finite type. They are therefore group schemes by [F1]. No field-valued-point or smoothness argument substitutes for these formulas.

Depends on

Used by

Dependency tree · two levels

28 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