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

Affine smooth and connected properties in exact sequences of algebraic groups

Statement

Assume the Axiom of Choice. Let 1→N→G→qQ→1 be an exact sequence of separated finite-type k-group schemes, meaning q is faithfully flat of finite presentation and N is its scheme-theoretic kernel. Then:

  • if N,Q are affine, smooth, or connected, respectively, so is G;
  • if G is affine, smooth, or connected, respectively, so is Q;
  • if N is affine, then q is affine; if N is smooth, then q is smooth.

Facts & Assumptions

[F1]
[F2]

Connected groups are geometrically connected; geometrically reduced finite-type groups are smooth. (Connected finite-type groups are geometrically connected)

[F3]

Flat finite-presentation morphisms are open. Smoothness is flatness, local finite presentation, and geometrically regular fibres; smooth morphisms remain smooth under base change and composition, and geometric regularity descends under field extension. (Flat finite-presentation morphisms are open, Smooth morphism of schemes, Smoothness survives base change and composition, Field tests for geometric regularity)

[F4]

Algebraic closures exist under AC, and nonempty finite-type schemes over an algebraically closed field have rational closed points, by the maximal-ideal description in the weak Nullstellensatz. (Assuming Choice, every field has an algebraic closure, Over an algebraically closed field, every maximal ideal is an evaluation ideal)

Proof

Given: AC and the exact sequence in the statement.

1.1F1givenalgebraconstruct

The morphism (g,n)↦(g,gn) is an isomorphism G×N≅G×QG; its inverse sends (g,h) to (g,g−1h), which factors through the kernel by the group law. Thus base change of q by itself is projection from G×N. If N is affine this projection is affine, and [F1] gives that q is affine. If Q also is affine, its inverse image G is affine. Conversely if G is affine, [F1] supplies affine Q; its exact quotient agrees with the represented normal quotient by the fppf lifting and kernel-pair identity just proved.

2.1F2F3F4step 1.1algebra

For each z∈Q, choose an algebraic closure Ω of κ(z) by [F4]. The nonempty finite-type fibre Gz×κ(z)Ω has an Ω-point by [F4], and translation by it identifies that fibre with NΩ using step 1.1. If N is smooth, NΩ is smooth by [F3]; hence its affine chart rings are geometrically regular. Field descent in [F3] makes Gz geometrically regular over κ(z). The given flatness and finite presentation of q now make q smooth by [F3]. If Q is smooth too, composition in [F3] makes G smooth. Conversely if G is smooth, it is geometrically reduced. Faithful flat pullback injects the local coordinate sections of Q into those of G, so every nilpotent section of the geometric Q is zero. Thus Q is geometrically reduced, and [F2] makes it smooth.

3.1F1F2F3step 2.1algebra∎

Surjectivity makes a quotient of connected G connected. If both N and Q are connected, [F2] and the fibre identification in step 2.1 make every fibre of q connected. For a decomposition of G into two disjoint open-and-closed subsets, each connected fibre lies entirely in one; their images are disjoint opens in Q by [F3] and cover Q. Connectedness of Q forces one image empty and hence one original subset empty. Thus G is connected. AC is inherited from [F1]–[F3].

Depends on

Used by

Dependency tree · two levels

76 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