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.

Coconnected Hopf algebras: the coordinate ring of U_n and passage to quotients

Statement

Let k be a field and n≥1. Then:

(a) O(Un)=k[Xij∣1≤i<j≤n] is a coconnected Hopf algebra: assigning weight j−i to each generator Xij and letting Cr be the span of the monomials of weight at most r gives a filtration satisfying Δ(Cr)⊆∑i+j=rCi⊗kCj;

(b) if A→B is a surjective morphism of commutative Hopf algebras over k and A is coconnected, then B is coconnected;

(c) assuming the Axiom of Choice (The Axiom of Choice), if H⊆Un is a closed subgroup scheme, then O(H) is a quotient of O(Un) and hence coconnected.

Facts & Assumptions

Given: A field k, an integer n≥1, and the Hopf algebra O(Un)=k[Xij:i<j] of The upper unitriangular group scheme U_n and its coordinate ring with the displayed comultiplication.

[F1]

A commutative Hopf algebra A is coconnected when it has an increasing filtration (Cr) with C0=k⋅1, ⋃rCr=A and Δ(Cr)⊆∑i+j=rCi⊗kCj; the filtration need not be finite in each degree. (Coconnected commutative Hopf algebras)

[F2]

O(Un) is a polynomial algebra on the entries strictly above the diagonal with Δ(Xij)=Xij⊗1+1⊗Xij+∑i<l<jXil⊗Xlj, ε(Xij)=0, and counit/antipode compatible with these formulas. (The upper unitriangular group scheme U_n and its coordinate ring)

[F3]

Assuming AC for the geometric closed-subscheme/quotient-ring conversion, a closed subgroup scheme H⊆Un has coordinate ring O(H)=O(Un)/I for the Hopf ideal I of functions vanishing on H, and the quotient of a commutative Hopf algebra by a Hopf ideal carries the quotient Hopf algebra structure. (Closed subgroup schemes of an affine group scheme correspond to Hopf ideals, Hopf ideals, kernels and quotients of commutative Hopf algebras, The general linear group scheme and its coordinate ring)

Proof

Given: A field k, an integer n≥1, and the Hopf algebra O(Un).

1.1F1F2algebra

Declare the weight of the monomial ∏Xijaij to be ∑i<jaij(j−i), and let Cr be the k-span of the monomials of weight at most r. Then C0=k⋅1, the Cr increase, and ⋃rCr=O(Un) because every polynomial is a finite sum of monomials of bounded weight. On the generators, [F2] gives Δ(Xij)=Xij⊗1+1⊗Xij+∑i<l<jXil⊗Xlj, and the three kinds of terms have total weight j−i, j−i, and (l−i)+(j−l)=j−i; hence Δ(Xij)∈∑a+b=j−iCa⊗Cb. Since Δ is a k-algebra homomorphism from the tensor product and the weights add under multiplication, Δ(∏Xijaij)∈∑a+b=rCa⊗Cb for a monomial of weight r, and the condition Δ(Cr)⊆∑a+b=rCa⊗Cb follows for all r by linearity. This proves (a).

1.2F1algebra

Let π:A→B be a surjective morphism of commutative Hopf algebras and let (Cr) be a coconnected filtration on A. Put Dr=π(Cr). Then D0=k⋅1B because π preserves units and C0=k⋅1A; the Dr increase and exhaust B because π is surjective; and, since π⊗π is surjective onto B⊗B with (π⊗π)(Ci⊗Cj)=Di⊗Dj, the comultiplication of B satisfies ΔB(Dr)=(π⊗π)ΔA(Cr)⊆∑i+j=rDi⊗Dj. Hence B is coconnected, which proves (b).

2.1F3step 1.1step 1.2∎

Assume AC and let H⊆Un be a closed subgroup scheme. By [F3] the coordinate ring of H is the quotient O(Un)/I by the Hopf ideal I of functions vanishing on H, and π:O(Un)→O(H) is a surjective morphism of commutative Hopf algebras. By [step 1.1] O(Un) is coconnected, so [step 1.2] applied to π shows that O(H) is coconnected. This proves (c) and completes the proof.

Depends on

Used by

Dependency tree · two levels

44 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