Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Reduced graded symmetric coalgebra with its shuffle coproduct

Definition

Let k be a characteristic-zero field (Field), meaning char⁡(k)=0 under The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise. By Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring, k is a commutative ring. Let W=⨁j∈ZWj be a graded k-vector space. For n≥1, define the graded symmetric power

Sn(W)=W⊗kn/Jn,

where Jn is spanned by the differences obtained by replacing any adjacent homogeneous factors x⊗y by (−1)∣x∣∣y∣y⊗x inside a pure tensor. Write w1⊙⋯⊙wn for the image of a tensor and set

Sc(W)=⨁n≥1Sn(W).

The reduced shuffle coproduct is the degree-zero linear map Δˉ:Sc(W)→Sc(W)⊗kSc(W) given on a homogeneous pure symmetric tensor by

Δˉ(w1⊙⋯⊙wn)=∑p=1n−1 ∑σ∈Sh⁡(p,n−p)ϵ(σ;w1,…,wn)(wσ(1)⊙⋯⊙wσ(p))⊗(wσ(p+1)⊙⋯⊙wσ(n)),

where Sh⁡(p,n−p)={σ∈Sn:σ(1)<⋯<σ(p), σ(p+1)<⋯<σ(n)}, and ϵ is the Koszul sign of Koszul sign rule for graded tensor products and permutations. For n=1 the sum is empty and Δˉ(w)=0. This is a reduced, hence noncounital coalgebra convention; no arity-zero summand is included. The next lemmas verify its coproduct laws, conilpotence, and cofree universal property.

Depends on

Used by

Dependency tree · two levels

23 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