Hopf algebra of permutations
Open-knowledge reference entry

In algebra, the Malvenuto–Poirier–Reutenauer Hopf algebra of permutations or MPR Hopf algebra is a Hopf algebra with a basis of all elements of all the finite symmetric groups Sn, and is a non-commutative analogue of the Hopf algebra of symmetric functions. It is both free as an algebra and graded-cofree as a graded coalgebra, so is in some sense as far as possible from being either commutative or cocommutative. It was introduced by Malvenuto & Reutenauer (1995) and studied by Poirier & Reutenauer (1995).
Definition
The underlying free abelian group of the MPR algebra has a basis consisting of the disjoint union of the symmetric groups Sn for n = 0, 1, 2, .... , which can be thought of as permutations.
The identity 1 is the empty permutation, and the counit takes the empty permutation to 1 and the others to 0.
The product of two permutations (a1,...,am) and (b1,...,bn) in MPR is
given by the shuffle product (a1,...,am) ш (m + b1,...,m + bn).
The coproduct of a permutation a on m points is given by Σa=b*c st(b) ⊗ st(c), where the sum is over the m + 1 ways to write a (considered as a sequence of m integers) as a concatenation of two sequences b and c, and st(b) is the standardization of b, where the elements of the sequence b are reduced to be a set of the form {1, 2, ..., n} while preserving their order.
The antipode has infinite order.
Relation to other algebras
The Hopf algebra of permutations relates the rings of symmetric functions, quasisymmetric functions, and noncommutative symmetric functions, (denoted Sym, QSym, and NSym respectively), as depicted in the following commutative diagram.
This brief starts where responsible research should: with the source description of “Hopf algebra of permutations” as open-knowledge reference entry. Everything that follows is an evidence route, not borrowed authority.
Why this record matters
The subject matters to the general reference register because the source frames it as open-knowledge reference entry. Its deeper value depends on whether names, dates, institutions and citations support that framing.
Named sources, stable identifiers and responsible institutions provide the strongest route from overview to verifiable evidence. The source revision retrieved here is dated Apr 30, 2026. The linked authority identifier is Q17027553. None of the 0 selected statements returned an explicit reference. The first chronological checks are 1995.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Hopf algebra of permutations”, its source revision and the description used here.
- Expand the search: follow Hopf algebra of permutations primary sources, Hopf algebra of permutations archive and Hopf research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Hopf algebra of permutations”?
- Which institution is responsible for the underlying evidence?
- Which cited source is closest to the event, object or claim?
Search terms from this dossier
This entry incorporates text from “Hopf algebra of permutations” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.