The unshuffle coproduct is cocommutative: this is the "co-commutative" half of the
ProvedFreeMonoidShuffle.unsh_swapaether-catalognovelty
The unshuffle coproduct is cocommutative: this is the "co-commutative" half of the
graded noncommutative co-commutative bialgebra (K⟨X⟩, concatenation, Δ_⧢).
theorem FreeMonoidShuffle.unsh_swap(w : List X) : (unsh w).map Prod.swap = unsh w := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/FreeMonoidUnshuffle.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Novelty/FreeMonoidUnshuffle.lean
import Mathlib
import Definitions.Def_Novelty_FreeMonoidShuffle
import Definitions.Def_Novelty_FreeMonoidUnshuffle
/-
# The unshuffle coproduct and shuffle/unshuffle duality
Continuation of `Novelty.FreeMonoidShuffle`. We introduce the *unshuffle* coproduct
`Δ_⧢ (w) = Σ_{w = u ⧢ v} u ⊗ v`
defined by the recursion `Δ_⧢(a·w) = (a ⊗ 1 + 1 ⊗ a) · Δ_⧢(w)` (the unique
concatenation-algebra morphism making every letter primitive), and prove:
* `count_shuf_eq_count_unsh` : **duality** — the multiplicity of `w` in the shuffle
`u ⧢ v` equals the multiplicity of `(u,v)` in the unshuffle of `w`. This is the
statement that the shuffle product and the unshuffle coproduct are transposes of one
another for the canonical pairing on words.
* `unsh_append` : the unshuffle coproduct is multiplicative for concatenation
(the bialgebra axiom for `(K⟨X⟩, concatenation, Δ_⧢)`).
* `unsh_coassoc` : the unshuffle coproduct is coassociative.
* `unsh_card`, `unsh_length_mem` : grading data.
-/
open FreeMonoidShuffle
variable {X : Type*}
/-! ## The unshuffle coproduct -/
/-! ## Counting lemmas -/
variable [DecidableEq X]
/-! ## The unshuffle coproduct is an algebra morphism for concatenation -/
/-! ## Coassociativity -/
/-! ## Cocommutativity -/Formal statement
theorem FreeMonoidShuffle.unsh_swap(w : List X) : (unsh w).map Prod.swap = unsh w := by sorry
Source