Relations among higher Whitehead maps

This paper defines generalised higher Whitehead maps between polyhedral products and establishes new families of relations among them by exploring the connection between the homotopy-theoretic properties of these spaces and the combinatorial structure of simplicial complexes, thereby recovering and generalising known identities.

The Gist

Imagine the universe of mathematics as a giant, invisible playground called Topology. In this playground, shapes aren't rigid like wooden blocks; they are made of stretchy rubber. You can twist, pull, and bend them, but you can't tear them or glue them together. Mathematicians study how these shapes can be transformed into one another.

One of the most interesting things in this playground is how different "loops" or "paths" on a shape interact. When you take two loops and try to combine them, they sometimes create a new, more complex shape. This interaction is called a Whitehead product.

For decades, mathematicians have known a few "rules of the road" for how these products behave. The most famous rule is the Jacobi Identity, which is like a balancing act: if you combine three loops in a specific order, the result cancels out to zero. It's like a magic trick where $A + B + C = 0$ if you arrange them just right.

However, the authors of this paper, Jelena Grbić, George Simmons, and Matthew Staniforth, wanted to know: Are there more hidden rules? What happens if we combine more than three loops, or if the loops are made of different materials?

Here is the story of their discovery, explained through simple analogies.

1. The Playground: Polyhedral Products

The authors use a special tool called a Polyhedral Product. Imagine you have a set of building blocks (simplicial complexes).

• Some blocks are solid cubes ($X$).
• Some blocks are hollow shells ($A$).
• You have a blueprint (a simplicial complex) that tells you which blocks to stack together.

If the blueprint says "put a cube here and a shell there," you build that structure. If the blueprint changes, the structure changes. The authors realized that these structures are like Lego sets that encode complex mathematical relationships. By changing the blueprint, they could build new machines to test their theories.

2. The New Machine: Higher Whitehead Maps

In the old days, mathematicians studied Whitehead products using simple spheres (like basketballs). But the authors wanted to study "Higher Whitehead Maps."

Think of a standard Whitehead product as a two-person dance. You have two dancers (loops), and they spin around each other to create a new move.
The authors created a machine that allows $n$ people to dance at once.

• Instead of just two loops, they can combine 3, 4, or even 10 loops simultaneously.
• They call this a "Higher Whitehead Map." It's like a choreographer directing a massive group dance where everyone has to move in perfect sync.

3. The Big Discovery: The Identity Complex

The authors asked: "If we have a group dance with 10 people, is there a rule that says the whole thing cancels out to zero, just like the 3-person Jacobi identity?"

They found that the answer depends on the blueprint (the simplicial complex) they used to build the dance floor.

• They discovered a special blueprint they call the "Identity Complex."
• Think of this blueprint as a recipe for a perfect cancellation. If you arrange your dancers according to this specific recipe, the chaotic movements of the group dance will perfectly cancel each other out, leaving the stage empty (mathematically, the result is "zero").

They proved that for any way you partition a group of dancers into smaller teams, there is a specific blueprint (Identity Complex) that guarantees the dance will cancel out. This generalizes the old rules to massive, complex groups.

4. The Twist: Folding the Map

Here is where it gets really clever. Sometimes, in a dance, two dancers might be wearing the exact same costume and doing the exact same move. In math, this is called a "repeated factor."

The authors introduced a concept called "Folding."

• Imagine you have a large, flat map of a city (the blueprint).
• You take a pair of scissors and cut out two identical neighborhoods.
• You then fold the map so that these two neighborhoods lie directly on top of each other.
• Now, the two neighborhoods are treated as one single place.

In their math, "folding" the blueprint allows them to study what happens when the same loop is used multiple times in the dance.

• The Surprise: When they folded the map, they found new, hidden relationships.
• The 2-Torsion Secret: In the world of rubber shapes, sometimes if you do a move twice, it disappears (becomes zero). But sometimes, if you do it twice, it doesn't disappear; it becomes a "2-torsion" element. It's like a secret code that only reveals itself when you do the move an even number of times. The authors used their "folding" technique to find these secret codes, which were invisible to previous methods that only looked at the shapes through a "rational" (fraction-based) lens.

5. Why Does This Matter?

You might ask, "Who cares about rubber bands and dance floors?"

• Universal Laws: Just as physics has laws of gravity that apply to apples and planets, topology has laws of interaction that apply to tiny particles and massive cosmic structures. This paper finds new laws for how these interactions work.
• New Tools: They built a new "Lego set" (the Identity Complex and Folding) that allows mathematicians to solve problems that were previously impossible.
• Hidden Patterns: They found that the universe of shapes has a deeper symmetry than we thought. Even when things look messy and complex, there is often a hidden blueprint (a combinatorial structure) that makes everything balance out.

Summary

In simple terms, this paper is about finding new rules for a cosmic dance.

1. The authors built a new stage (Polyhedral Products) to watch the dance.
2. They created a new dance move involving many partners (Higher Whitehead Maps).
3. They discovered a specific blueprint (Identity Complex) that guarantees the dance cancels itself out.
4. They invented a way to "fold" the blueprint to see what happens when partners are identical, revealing secret "2-torsion" moves that were previously hidden.

They didn't just find one new rule; they found a whole family of rules that connect the simple, known laws of the past with the complex, mysterious shapes of the future.

Technical Summary

Technical Summary: Relations Among Higher Whitehead Maps

Paper: Relations Among Higher Whitehead Maps by Jelena Grbić, George Simmons, and Matthew Staniforth.
Source: arXiv:2306.05230v2 [math.AT]

1. Problem Statement

The paper addresses the problem of identifying and generalizing algebraic relations among higher Whitehead maps within the homotopy groups of topological spaces.

• Context: Classical Whitehead products $[f, g]$ define a graded quasi-Lie algebra structure on homotopy groups $\pi_*(Y)$. Key relations include the Jacobi identity and Hardie's identity (a generalization involving exterior Whitehead products).
• Limitation of Previous Work: Existing relations were largely derived using algebraic techniques (e.g., Hurewicz homomorphism, Adams–Hilton models) restricted to spherical maps (maps between spheres) or specific rational homotopy contexts. These methods often fail to generalize to arbitrary suspension spaces or to detect integral torsion phenomena (e.g., 2-torsion) that vanish in rational homotopy.
• Goal: To define generalized higher Whitehead maps between polyhedral products and establish new families of relations among them that recover classical identities while revealing new combinatorial structures and integral relations, including those with repeated factors.

2. Methodology

The authors employ a geometric and combinatorial approach, shifting away from purely algebraic models.

A. Polyhedral Products and Combinatorics

• Polyhedral Products: The authors utilize $(X, A)_K$, a space constructed from a simplicial complex $K$ on $m$ vertices and an $m$-tuple of CW-pairs $(X_i, A_i)$.
• Higher Whitehead Maps: They define the higher Whitehead map $hw(f_1, \dots, f_m)$ as a map of polyhedral products:
  $$(CX, X)_{\partial \Delta^{m-1}} \to (Y, *)_{\partial \Delta^{m-1}}$$
  induced by maps of pairs $f_i: (CX_i, X_i) \to (Y_i, *)$. Here, $\partial \Delta^{m-1}$ is the boundary of the $(m-1)$-simplex.
• Combinatorial Encoding: The existence and triviality of these maps are encoded by the combinatorial structure of $K$. Specifically, the map is null-homotopic if the domain can be extended over a larger simplicial complex (e.g., the full simplex $\Delta^{m-1}$).

B. Nested and Folded Maps

• Nested Higher Whitehead Maps: Maps where the inputs $f_i$ are themselves higher Whitehead maps. These correspond to polyhedral join products of simplicial complexes.
• Folded Higher Whitehead Maps: A novel combinatorial operation where vertices of a simplicial complex are identified (folded). This allows the encoding of higher Whitehead maps with repeated factors (e.g., $[f, [f, g]]$), which were previously difficult to handle in the polyhedral framework.
• Identity Complexes ($K_\Pi$): For a partition $\Pi$ of the vertex set, the authors construct a specific simplicial complex $K_\Pi$ (the "identity complex") that supports a specific linear relation among nested maps.

C. Relative Homotopy Techniques

To prove the main relations, the authors generalize the Nakaoka–Toda and Hardie proofs of the Jacobi identity. They introduce relative higher Whitehead maps and utilize the long exact sequence of relative homotopy groups for a pair $(X, A)$. By analyzing the boundary map $\partial$ and the inclusion map $j$, they demonstrate that the sum of specific nested maps vanishes due to exactness.

3. Key Contributions and Results

A. Generalized Hardie's Identity (Theorem 5.6)

The paper establishes a broad family of relations among higher Whitehead maps indexed by partitions $\Pi = \{P_1, \dots, P_k\}$ of the vertex set $[m]$.

• The Relation: For a partition $\Pi$, there exists an identity complex $K_\Pi$ such that:
  $$\sum_{i=1}^k h^{K_\Pi}_w \left( hw(f_{j_1}, \dots, f_{j_{q_i}}), f_{i_1}, \dots, f_{i_{p_i}} \right) \circ \sigma_i = 0$$
  where $\sigma_i$ are coordinate permutations.
• Significance: This recovers the classical Jacobi identity (for $k=3$) and Hardie's identity (for $k=m$) as special cases but extends them to arbitrary suspension spaces and arbitrary simplicial complexes $K_\Pi$.

B. Relations with Repeated Factors (Folded Maps)

By applying folding operations to the identity complexes, the authors derive relations involving maps with repeated factors.

• Result: They show that folding a relation on a complex $K_\Pi$ yields a new relation on the folded complex $K_\Pi^\nabla$.
• Example: They recover the relation $[[u_1, u_2, u_3], [u_1, u_4, u_5]] + [[[u_1, u_2, u_3], u_4, u_5], u_1] = 0$ (previously known rationally by Zhuravleva) integrally.

C. Detection of 2-Torsion

A major contribution is the ability to detect 2-torsion elements in homotopy groups that are invisible to rational homotopy theory.

• Mechanism: By choosing specific spaces (e.g., $Y_i = \Omega S^3$) and maps, the folded higher Whitehead maps yield non-trivial elements of order 2.
• Example: The paper constructs a 2-torsion element in $\pi_{2m-2}((\Omega S^3, *)_{\partial \Delta})$ using the folded map $\nabla_{(m,1)} hw(hw(f_1, \dots, f_{m-1}), f_m)$.

D. Combinatorial Characterization of Triviality

The paper provides precise combinatorial conditions (Propositions 3.4, 3.5, 4.10) under which nested and folded higher Whitehead maps are null-homotopic. These conditions depend on whether the underlying simplicial complex contains specific subcomplexes (e.g., full simplices or specific compositions).

4. Significance and Impact

1. Unification of Algebraic and Geometric Approaches: The paper successfully bridges the gap between the combinatorial topology of polyhedral products and the algebraic structure of homotopy groups, providing a geometric proof for identities previously established via complex algebraic models.
2. Integral vs. Rational: Unlike previous work that often relied on rationalization (where torsion is lost), this framework works integrally. This allows for the discovery of new torsion phenomena (specifically 2-torsion) in the homotopy groups of polyhedral products.
3. Generalization of Lie Algebra Structures: The results suggest that the homotopy groups of polyhedral products carry a rich $L_\infty$-algebra structure (homotopy Lie algebra), where the higher Whitehead maps realize the higher brackets, and the derived relations realize the strong homotopy Jacobi identity.
4. New Computational Tools: The introduction of "identity complexes" and "folding" provides a systematic toolkit for generating new relations in homotopy groups, applicable to a wide range of spaces beyond spheres, including Davis–Januszkiewicz spaces and moment-angle complexes.

In summary, this paper significantly advances the understanding of higher Whitehead products by generalizing them to polyhedral products, introducing combinatorial folding to handle repeated factors, and proving new integral relations that reveal torsion structures previously undetectable by rational methods.