Alphabeta Math
Pipeline-generated
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.

Group Schemes of Finite Type over a Field — Examples

1 · Prerequisites

2 · Summary

The additive group Ga, the multiplicative group Gm and the general linear group GLn are displayed with their explicit coordinate rings and structure maps. All three are checked on R-points for an arbitrary commutative k-algebra R, including nonreduced R; the verification relies on the matrix, determinant and adjugate identities in the coordinate algebras rather than on point-wise formulas.

The counterexample on this page works over an algebraically closed field of characteristic p>0: the group schemes αp and μp have isomorphic underlying schemes and singleton groups of rational points, yet different group laws. The coefficient comparison against Gm therefore refutes the claim that the abstract group of rational points, even together with the underlying scheme, determines the group-scheme structure.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

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.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Rational points do not detect the group-scheme structure of alpha_p and mu_p

Statement refuted

For group schemes of finite type over an algebraically closed field k, the abstract group of k-rational points determines their group-scheme structure. Even a fixed underlying k-scheme together with that abstract group determines the group law.

Facts & Assumptions

[F2]

The additive and multiplicative group schemes have the displayed structure morphisms over arbitrary algebras. (The group schemes Ga, Gm, and GLn)

[F3]

Affine scheme morphisms correspond to algebra maps, and product coordinate rings are tensor products. (Affine schemes are contravariantly equivalent to commutative rings, Affine fibre products are spectra of tensor products)

[F4]

We assume the Axiom of Choice, inherited through the closed-subgroup criterion in [F1] and its affine quotient supplier. The coefficient comparisons are finite algebraic calculations. (The Axiom of Choice)

Counterexample

Let k be algebraically closed of characteristic p>0. Set αp=Spec⁡k[x]/(xp),μp=Spec⁡k[t]/(tp−1). Then αp(k)={0} and μp(k)={1} are isomorphic singleton groups. Their underlying k-schemes are isomorphic by t=1+x. Nevertheless they are not isomorphic as k-group schemes: αp has additive comultiplication x↦x⊗1+1⊗x, while in the coordinate x=t−1 the multiplicative law of μp has x↦x⊗1+1⊗x+x⊗x. The proof below excludes every group-scheme isomorphism, not merely the displayed scheme isomorphism.

Given: AC and an algebraically closed field k of characteristic p>0 and the two displayed schemes.

1.1F1F2F3F4givenalgebra

For every commutative k-algebra R, αp(R)={a∈R:ap=0} is an additive subgroup of R: (a+b)p=ap+bp and (−a)p=(−1)pap. Also μp(R)={u∈R×:up=1} is a multiplicative subgroup of R×. The closed immersions into Ga and Gm therefore give the induced group laws by [F1]–[F2]. AC is carried through the criterion in [F1], as recorded in [F4]. Each coordinate algebra has dimension p over k, so is finite type. The formula t=1+x identifies their underlying rings because (1+x)p−1=xp. In a field ap=0 forces a=0, and tp=1 forces (t−1)p=0, hence t=1. Thus both rational-point groups are singleton while both schemes retain a nonzero nilpotent coordinate.

2.1F1F2F3step 1.1algebra

Every group-scheme homomorphism f:αp→Gm corresponds by [F3] to a unit g(x)=∑j=0p−1cjxj in k[x]/(xp) satisfying g(0)=1 and g(x+y)=g(x)g(y) in k[x,y]/(xp,yp). Compare coefficients of xr−1y for 1≤r<p: the left side has coefficient rcr, the right side cr−1c1. Since c0=1 and 1,…,p−1 are invertible in k, induction gives cr=c1r/r!. Now compare the coefficient of xp−1y: the left side is zero because every term of g(x+y) has total degree less than p, while the right side is cp−1c1=c1p/(p−1)!. Thus c1=0 and all cr=0 for r>0. This also covers p=2. Hence every such homomorphism is the trivial one, g=1.

3.1F1F2F3step 1.1step 2.1algebra∎

If αp≅μp as group schemes, compose that isomorphism with the closed subgroup inclusion μp↪Gm. The result would be nontrivial: on coordinate rings the inclusion pulls t back to its nonconstant class in k[t]/(tp−1), and an isomorphism cannot send t−1≠0 to zero. This contradicts step 2.1. Thus the two group schemes are not isomorphic despite their isomorphic underlying schemes and rational-point groups. Nilpotent test algebras distinguish their laws; for example their common coordinate x=t−1 has the additional product term x⊗x for μp written in the counterexample.

Sources