Alphabeta Math
PropositionStatement: AI-adaptedProof: 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.

Smooth diagonalizable groups over algebraically closed fields have only principal cocycles into smooth commutative unipotent groups

Statement

Assume the Axiom of Choice. Let k be an algebraically closed field, let G be a diagonalizable group variety over k (Diagonalizable groups and their character modules) and let M be a commutative unipotent group variety over k equipped with an action of G by group automorphisms (Crossed homomorphisms, principal crossed homomorphisms and Hochschild extensions). Put Nk={n≥1:n⋅1k≠0}, all positive integers in characteristic zero and those prime to p in characteristic p>0. Then every crossed homomorphism f:G→M is principal: there is m∈M(k) with f(x)=x⋅m−mfor all x∈G(k).

Facts & Assumptions

Given: The Axiom of Choice, an algebraically closed field k, a smooth diagonalizable group G with character group X(G)=MG, a smooth commutative unipotent group M with a G-action, and a crossed homomorphism f:G→M.

[F1]

A crossed homomorphism satisfies f(xy)=f(x)+x⋅f(y) for all points x,y; it is principal when f(x)=x⋅m−m for some m∈M(k). The k-points of Gn=ker⁡(n⋅:G→G) form a finite subgroup for each n≥1. (Crossed homomorphisms, principal crossed homomorphisms and Hochschild extensions, Diagonalizable groups and their character modules)

[F2]

Assume AC. If e⋅1k≠0, the power map x↦xe is a bijection of M(k), so multiplication by e is an automorphism of the abelian group M(k). (Power maps with exponent prime to the characteristic are bijective on unipotent groups)

[F3]

If G is a smooth group of multiplicative type over the algebraically closed field k and Z⊆G is a closed subscheme with Z(k)⊇⋃n∈NkGn(k), then Z=G. (A smooth group of multiplicative type is the only closed subscheme containing all its finite subgroups)

[F4]

A closed subset of the Noetherian topological space underlying a finite-type k-scheme is Noetherian; a descending chain of closed subsets of a Noetherian space stabilizes. (Chain dimension and the empty-space convention)

Proof

Given: The Axiom of Choice, an algebraically closed field k, a smooth diagonalizable group G, a smooth commutative unipotent G-group M, and a crossed homomorphism f:G→M.

1.1F1F2

Fix n>1 in Nk and x∈Gn(k), and sum the identity f(x)=f(xy)−x⋅f(y) over all y∈Gn(k): since the action of x is a group automorphism, ∑y∈Gn(k)f(xy)=∑y′∈Gn(k)f(y′)=s and ∑yx⋅f(y)=x⋅s, so enf(x)=s−x⋅s where en=∣Gn(k)∣ divides a power of n, hence en⋅1k≠0. By [F2] en is invertible on M(k), so f(x)=x⋅mn−mn with mn=−en−1s for all x∈Gn(k): the restriction of f to Gn is principal.

2.1step 1.1

For each n∈Nk let M(n)={m∈M(k):f(x)=x⋅m−m for all x∈Gn(k)}. Each M(n) is nonempty by [step 1.1] (for n>1; for n=1 the condition is vacuous and M(1)=M(k)) and is the set of k-points of the closed subscheme of M defined by the finitely many equations f(x)=x⋅m−m for x running over a generating set of Gn; the family is directed downwards under divisibility: if n∣n′, then Gn⊆Gn′ and M(n′)⊆M(n).

3.1F4step 2.1

Choose a divisibility-increasing cofinal sequence n1∣n2∣⋯ in Nk (take nj to be the least common multiple of the integers at most j belonging to Nk). The sets M(n1)⊇M(n2)⊇⋯ form a descending chain of nonempty closed subsets of M(k), which is Noetherian as a subspace of the Noetherian finite-type scheme M (Chain dimension and the empty-space convention), so it stabilizes at some index j0; choose m∈M(nj0), which is nonempty. Then f(x)=x⋅m−m for all x in ⋃jGnj(k).

4.1F3step 3.1∎

Consider the morphisms G→M, x↦f(x) and x↦x⋅m−m; their equalizer Z is a closed subscheme of G (closed immersions and equalizers into the separated M) with Z(k)⊇⋃n∈NkGn(k) by [step 3.1], since every n∈Nk divides some nj and hence has its Gn contained in some Gnj. As G is a diagonalizable group variety, it is smooth of multiplicative type over the algebraically closed field k, [F3] gives Z=G; therefore f(x)=x⋅m−m for all points x, and f is principal.

Depends on

Used by

Dependency tree · two levels

30 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