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 nonabelian group makes the double cross-relations noncommutative

Example

In D(kS3) let p=(12), q=(23) and r=(13)=pqp−1. Then (δr⊗p) and (δq⊗e) do not commute. On the Yetter–Drinfeld module kS3 with basis ux, degree x and conjugation action, the braiding sends up⊗uq to ur⊗up, which differs from the ordinary flip.

Facts & Assumptions

Given: The group-double multiplication and Yetter–Drinfeld braiding, and the transpositions p,q,r in S3. Verify the two products and the stated braiding value.

[L1]

The Drinfeld double of a finite group algebra: (δx⊗g)(δy⊗h)=1x=gyg−1δx⊗gh.

[L2]

Modules over the finite double are left-left Yetter–Drinfeld modules: c(v⊗w)=∑v−1⋅w⊗v0.

[A1]

In S3, pqp−1=r=(13), q≠r, and p−1=p.

Verification

1.1givenA1L1algebra

The product formula [L1] gives (δr⊗p)(δq⊗e)=δr⊗p, since r=pqp−1. Reversing the factors gives (δq⊗e)(δr⊗p)=0, since q≠r. Thus these elements do not commute.

2.1A1L2algebra∎

Define ux to have degree x and let g⋅ux=ugxg−1. This action preserves the grading by conjugation, so it is a Yetter–Drinfeld module by the group case of [L2]. Its braiding is c(up⊗uq)=upqp−1⊗up=ur⊗up, whereas the ordinary flip gives uq⊗up. These tensors differ because r≠q.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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