Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

A counital coideal quotient of the two-by-two comatrix coalgebra

Example

Let C=E2 be the two-by-two comatrix coalgebra from Finite comatrix coalgebras exist, with basis c11,c12,c21,c22. Set

I=span⁡{c12,c21,c11−c22}.

This is a nonzero counital coideal. The quotient is one-dimensional, with the two diagonal basis vectors identified and the off-diagonal basis vectors killed.

Facts & Assumptions

Given: A field k, the comatrix coalgebra C=E2, and the subspace I above.

[F1]

Coalgebra maps preserve comultiplication and counit, and the coalgebra axioms use the associator and unit isomorphisms (Coalgebra and coalgebra map over a field).

[F2]

On the comatrix basis, Δ(cij)=∑ℓciℓ⊗cℓj and ε(cij)=δij (Finite comatrix coalgebras exist).

[F3]

The field-free coideal condition is εC(I)=0 and ΔC(I)⊆im⁡(I⊗C→C⊗C)+im⁡(C⊗I→C⊗C), using the tensor maps induced by inclusion (Subcoalgebras, coideals, and quotient coalgebras).

[F4]

The quotient vector space C/I consists of cosets and its canonical map q:C→C/I is linear with kernel I (Quotient module M/N with scalar multiplication on additive cosets, The quotient action is well defined and makes M/N a module).

[F5]

A map prescribed on the basis of a free vector space extends uniquely to a linear map (Universal property of the free module on a set).

[F6]

Tensoring linear maps gives a well-defined linear map with (q⊗q)(x⊗y)=q(x)⊗q(y) (Module homomorphisms induce tensor-product homomorphisms functorially).

[F7]

A field has distinct zero and unit, 0≠1 (Field).

Verification

1.1givenF2F3algebra

The counit vanishes on c12 and c21, and ε(c11−c22)=1−1=0 by [F2]. The subspace I is nonzero because it contains the basis vector c12. Write jI:I↪C for the inclusion. The formulas Δ(c12)=c11⊗c12+c12⊗c22 and Δ(c21)=c21⊗c11+c22⊗c21 place their terms in im⁡(idC⊗jI)+im⁡(jI⊗idC). For the third generator, Δ(c11−c22)=(c11−c22)⊗c11+c22⊗(c11−c22)+c12⊗c21−c21⊗c12, and its four terms lie in the same sum of images. By linearity, I satisfies the field-free coideal condition [F3].

1.2givenF4F5F7algebra

Define ℓ:C→k on the basis by ℓ(c11)=ℓ(c22)=1 and ℓ(c12)=ℓ(c21)=0, extending linearly by [F5]. Its kernel is exactly I: if z=ac11+bc12+dc21+ec22 then ℓ(z)=a+e=0 precisely when e=−a, leaving z in the span defining I. Every class is a scalar multiple of u=q(c11)=q(c22), while u≠0 because c11∉I: otherwise ℓ(c11)=0, contrary to ℓ(c11)=1 and [F7]. Also q(c12)=q(c21)=0. Hence u is a basis of C/I.

2.1step 1.2F1F2F4F5F6algebra∎

Define linear maps Δ‾:C/I→(C/I)⊗(C/I) and ε‾:C/I→k on the basis u by Δ‾(u)=u⊗u and ε‾(u)=1, extending them linearly by [F5]. On u, coassociativity gives α(Δ‾⊗id)Δ‾(u)=u⊗(u⊗u)=(id⊗Δ‾)Δ‾(u), and the left and right counit composites both give u. Since u is a basis and these are linear maps, the coalgebra identities hold on all of C/I. For c11, (q⊗q)Δ(c11)=u⊗u+0⊗0=u⊗u=Δ‾q(c11) and ε(c11)=1=ε‾q(c11). For c12, (q⊗q)Δ(c12)=u⊗0+0⊗u=0=Δ‾q(c12) and ε(c12)=0=ε‾q(c12). For c21, (q⊗q)Δ(c21)=0⊗u+u⊗0=0=Δ‾q(c21) and ε(c21)=0=ε‾q(c21). For c22, (q⊗q)Δ(c22)=0⊗0+u⊗u=u⊗u=Δ‾q(c22) and ε(c22)=1=ε‾q(c22). By linearity these equalities hold on all of C, so q is a coalgebra map by [F1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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