A monoidal category consists of a category , a bifunctor , a monoidal unit object , and natural isomorphisms
The associator and unitors satisfy the pentagon identity for a monoidal category
and the triangle identity for a monoidal category
Composition is written from right to left. Naturality of these isomorphisms is part of the definition.
A symmetric monoidal category additionally has a natural braiding with , satisfying the two hexagon identities. Written as composites from the same source to the same target, these are
The unit compatibility is and .
For two distinct choices of symmetry, take super vector spaces over , with degree-preserving linear maps, the usual graded tensor product, its usual associator, and the unit concentrated in degree zero. On vectors of degrees , define
Both are natural in degree-preserving maps and are involutive. For the second, the hexagons follow from and modulo two; the ordinary flip has the same identities without signs. Degree zero of the unit gives unit compatibility. On the tensor square of a one-dimensional odd space, the two maps differ by . Thus the same monoidal structure can carry two different symmetries; the second uses the Koszul sign rule.
We prove the monoidal coherence theorem by a terminating normalization argument. Its precise formal assertion is that any two composites of associators, unitors, their inverses, and their tensor products with identities, between the same formal tensor expressions, are equal. The expressions must have the same ordered list of object letters after unit symbols are removed. This does not assert that different symmetries are equal, nor does it treat an accidental equality of actual objects as a new structural identification.
Use the following directed reductions in every tensor context:
interpreted respectively by , , . For a formal expression , let be its number of leaves, counting both object letters and unit symbols, and define
Order the pairs by comparing the first coordinate first, and then the second. A unit reduction decreases the first coordinate. An associativity reduction preserves the first coordinate and decreases the second by . The same calculation holds in any context, since associativity preserves the size of the rewritten subtree. Hence there is no infinite directed reduction path.
An irreducible expression has no unit next to another tensor factor and no composite left tensor factor. It is therefore the right-associated expression of its ordered nonunit letters, or the single unit if there are no such letters. In particular the normal form is uniquely determined by the ordered word.
We next show that every pair of first reductions has a commuting completion. Reductions in disjoint subexpressions commute by bifunctoriality of the monoidal tensor product. A reduction inside one of the variable expressions commutes with the outer reduction by naturality of the associator or unitor. The genuine overlaps are exactly the following cases.
For , associating first at the root or first in its left subtree gives the two sides of the pentagon; their completions to commute.
For , the competing associator and inner left unitor have a commuting completion because
For , the analogous completion is exactly the triangle identity. For , the associator and the outer right unitor have a commuting completion because
The two displayed unit identities are the permitted unit identities derived from the monoidal pentagon and triangle.
The final overlap is , where both unitors apply. They agree as a consequence of the same identities. Naturality of at the map , followed by cancellation of , gives
Therefore left-unit compatibility and the triangle give
The functor is naturally isomorphic to the identity via , and is consequently faithful. Thus , so this overlap commutes too. There are no other nonvariable overlaps among the three reduction patterns.
Termination and these commuting completions imply equality of all normalization arrows, not merely uniqueness of the normal-form object. Here is the induction. Suppose every expression smaller than in the decreasing pair measure has a unique normalization arrow. Two normalization paths from start with arrows and . The local completion gives directed paths , with . Append any normalization of . By the induction hypothesis the tails of the original paths are and . Their composites from are equal. If is already normal, its only directed normalization is the identity. This proves the induction.
Write for the resulting unique normalization. For every directed structural generator , including a generator in an arbitrary tensor context, uniqueness gives . Since all structural generators are invertible, the corresponding equation holds for their inverses as well. Any structural composite consequently satisfies
Its value depends only on the formal endpoints. Thus every structural diagram with the specified ordered word commutes, proving the monoidal coherence theorem.
The tensor differential. Use homological grading, so each differential lowers degree by one. The tensor product of chain complexes has
for . This Koszul sign rule gives
Thus the graded tensor product is a chain complex.
The Hom differential. Write . For a degree- element of this graded Hom complex of chain complexes, use the prescribed differential
The next application uses degree , so
In degree zero, , so its kernel consists exactly of chain maps. A degree-one element has , which is exactly the change between two chain maps related by a chain homotopy. Consequently
This is natural: precomposition and postcomposition by chain maps preserve both degree-zero cycles and degree-zero boundaries.
The dual complex and the sign adjustment. Define the reversed dual chain complex
Here is a functional on , so it belongs to , and . The absence of an additional sign in is intentional.
Interpret finite generation of the free chain complexes as finiteness of their total graded free modules. Then only finitely many degrees occur, and the finite-free evaluation isomorphisms assemble into a graded isomorphism
where , , and this component is zero outside . The dual module construction and evaluation make natural. Finite rank is needed for evaluation to be an isomorphism; finite total support also makes the sums on the tensor side agree with the products on the Hom functor side.
Under , the Hom functor differential has the form
The usual tensor product of chain complexes instead has second coefficient . Set
This is integer-valued for every , including negative , and satisfies . Conjugating the usual tensor differential by leaves the first term unchanged and changes its second coefficient to . Hence , giving the sign conjugation for the tensor-Hom identification
This is an isomorphism of chain complexes, not merely of their homology. If one instead assumes only degreewise finite rank with unbounded grading, the ordinary tensor need not identify with the product defining ; the finite-total convention is essential to this last conclusion.
We use the James reduced product theorem and the Bott–Samelson theorem: if is a connected based CW complex with free integral homology, then is a weak equivalence, and its induced Pontryagin ring is
Here is the reduced suspension, is the tensor algebra, and the multiplication is induced by concatenating James words, hence by concatenating loops. Taking supplies a single generator of degree , so
is free, with one generator in every degree and zero in the other degrees.
The diagonal makes this a homology coalgebra. The generator is a primitive homology class:
There are no nontrivial lower positive degrees in which its reduced diagonal could land. Compatibility of the diagonal with loop multiplication gives
The degree of is even, so the two tensor factors commute without a Koszul sign rule.
The universal coefficient theorem for cohomology has no Ext terms here because homology is free. Let be the cohomology class dual to , with and . The cup product is dual to the diagonal, hence
Therefore the integral cohomology ring is the divided power algebra
Explicitly for , and all other cohomology groups vanish. In particular : over the integers this is not a polynomial ring on . This is the integral cohomology of an odd-sphere loop space.
For the requested homology multiplication, use the homology cross product followed by concatenation:
The constant loop gives the degree-zero unit. Loop concatenation is associative up to homotopy, which suffices for associativity on homology; Moore loops can make the space-level operation strictly associative. The Künneth theorem identifies the tensor-product homology because its groups are free abelian groups. The Bott–Samelson theorem identifies this product with word multiplication, so . The Pontryagin ring of an odd-sphere loop space has presentation
With only one generator the tensor algebra has the indicated polynomial presentation. The homology product and the divided-power cohomology product are different operations.
Super vector space 2026-10-14
A super vector space is a vector space graded by the two-element group. Degree-preserving maps and the usual graded tensor product form a monoidal category. Over a field of characteristic different from two, this category has two different symmetries: ordinary interchange of tensor factors and interchange multiplied by on homogeneous factors of degrees . The latter is the Koszul sign rule.