Combinatorial Lefschetz Number

• Combinatorial Lefschetz Number is a topological invariant defined via chain-level trace formulas and valuation axioms, extending classical Lefschetz theory to discrete structures.
• It computes fixed points in polyhedra, simplicial complexes, and graphs using combinatorial fixed-point formulas and index integration.
• Its invariance, additivity, and homological correspondences facilitate robust applications in algebraic topology, graph theory, and quantum topology.

The combinatorial Lefschetz number is a topological invariant arising as a combinatorial refinement and extension of the classical Lefschetz number for continuous self-maps of polyhedra, simplicial complexes, graphs, and related combinatorial structures. Its definition and properties are rooted in lattice-theoretic valuation principles, chain-level trace formulas, and analogues of the fixed-point index, yielding a canonical tool for analyzing fixed points and their indices via purely combinatorial and homological data. The combinatorial Lefschetz number admits generalizations to non-compact, non-invariant, and non-open settings, and plays a critical role in algebraic topology, graph theory, fixed-point theory, and quantum topology.

1. Definition and Fundamental Principles

Let $K$ be a finite simplicial complex, $f: K \to K$ a (simplicial or continuous) endomorphism, and $A \subseteq K$ a (possibly proper) subcomplex or definable subspace. The combinatorial Lefschetz number, denoted $\Lambda(f, A)_K$, is defined via chain-level and valuation-theoretic principles:

• Chain-Level Trace Formula: For a simplicial approximation $f^{\mathrm{simp}}$ of $f$ and each $p\geq0$,

$$\Lambda(f, A)_K = \sum_{p\ge0} (-1)^p \operatorname{Tr}\left(M_p(f^{\mathrm{simp}})|_{C_{p,A}(K)}\right),$$

where $C_{p,A}(K)$ denotes $p$-chains supported in $A$ (López et al., 16 Jan 2026).

• Combinatorial Degree Sum: For a simplicial map $f$ and oriented simplex $\sigma\in K$,

$$L_c(f) = \sum_{\sigma\in K} (-1)^{\dim \sigma} \deg(f, \sigma),$$

where $\deg(f, \sigma)\in\{0, \pm1\}$ is the local degree (López et al., 30 May 2025).

• Valuation Axioms: As per Hadwiger's characterization, the combinatorial Lefschetz number is uniquely characterized by:
  • Additivity/inclusion-exclusion: $\phi(A\cup B) = \phi(A) + \phi(B) - \phi(A\cap B)$, $\phi(\varnothing) = 0$.
  • Simplex normalization: For simplex $\sigma$, $$\phi(\{\sigma\}) = (-1)^{\dim \sigma} c(f, \sigma) + \phi(\partial \sigma)$$, with $c(f, \sigma)\in\{0,\pm 1\}$ measuring signed coverage (Staecker, 2013).

In the case $A=K$ and $f$ a homeomorphism, $\Lambda(f, K)_K$ coincides with the classical Lefschetz number, recovering the homological trace

$$\Lambda(f) = \sum_{q=0}^{\dim K} (-1)^q \operatorname{Tr}(f_*: H_q(K;\mathbb{Q}) \to H_q(K;\mathbb{Q})).$$

2. Axiomatic and Homological Characterizations

The combinatorial Lefschetz number is governed by axioms reflecting valuation, normalization, invariance, and additivity:

• Normalization: For $U$ compact and $f$ a homeomorphism, $\Lambda(U, f)_K = \Lambda(f|_U)$ is the classical Lefschetz number (López et al., 30 May 2025).
• Additivity: For disjoint $f$-invariant subsets, $$\Lambda(U \cup V, f)_K = \Lambda(U, f)_K + \Lambda(V, f)_K$$ (López et al., 30 May 2025, López et al., 16 Jan 2026).
• Homotopy and Topological Invariance: If $f,g$ are homeomorphisms (or more generally, homotopic), and $A$ is $f$- and $g$-invariant with no boundary fixed points, then $\Lambda(A, f)_K = \Lambda(A, g)_K$ (López et al., 30 May 2025).

The uniqueness of such a valuation is established via the Hadwiger–Klain–Rota theory, and the normalization on simplices enforces the classical alternating trace formula in homology (Staecker, 2013). These axioms permit extension to arbitrary continuous maps by the Simplicial Approximation Theorem, alongside either homotopy invariance or mere continuity in the assignment $F \mapsto \Lambda(F,X)$ (Staecker, 2013).

3. Combinatorial Formulations and Fixed-Simplex Sums

The combinatorial Lefschetz number generalizes the fixed-point sum principle through explicit enumeration of fixed simplices and their indices:

• Combinatorial Fixed-Simplex Formula:

$$L(f, K) = \sum_{\sigma \subseteq K,\, f(\sigma) = \sigma} (-1)^{\dim \sigma} \operatorname{sign}(f|_\sigma),$$

where $\operatorname{sign}(f|_\sigma) = \pm1$ reflects orientation preservation or reversal (Staecker, 2013, Knill, 2012).

• Graph Endomorphisms: For a graph $G$ and endomorphism $T$, the Lefschetz number is given by a super-trace on cohomology and admits the formula (Knill, 2012):

$$L(T) = \sum_{x \in \operatorname{Fix}(T)} (-1)^{\dim x} \sigma_x,$$

where the sum is over fixed simplices (cliques), and $\sigma_x$ is the vertex-permutation signature.

All chain-level and simplex-based combinatorial formulas are shown to agree with the alternating trace in (co)homology for suitable choices.

4. Invariance Properties and Applications

Topological and homotopy invariance of the combinatorial Lefschetz number are proven for broad classes of maps and spaces, including non-compact and non-invariant settings:

• Topological Invariance: If $f:X\to X$, $g:Y\to Y$ are homeomorphisms and $A\subset X$, $B\subset Y$ are corresponding invariant subspaces, a homeomorphism $h:A\to B$ extends to $\overline{A}\to\overline{B}$ with $h\circ f = g\circ h$ on $\overline{A}$ implies $\Lambda(f,A)_X = \Lambda(g,B)_Y$ (López et al., 16 Jan 2026, López et al., 30 May 2025).
• Relative Invariance: For relative Lefschetz numbers $\Lambda(f; (X,C))$, invariance holds under suitable homeomorphisms respecting complements and commuting maps (López et al., 16 Jan 2026).
• Additivity and Cut-and-Paste: The combinatorial Lefschetz number is particularly effective in decomposing spaces into stratified or elementary pieces, computing local contributions, and reassembling via additivity (López et al., 16 Jan 2026).
• Extension to Open Maps and Noncompact Spaces: The combinatorial Lefschetz number extends to open maps $f$ with $f(A)\subset A$, providing fixed-point results even for unbounded sets in Euclidean space (López et al., 16 Jan 2026).
• Integration with Respect to the Fixed-Point Index: A theory of index integration is developed, eliminating restrictions such as definability, openness, or invariance of the subspaces involved (López et al., 30 May 2025).

5. Connections to Fixed-Point and Nielsen Theory

The combinatorial Lefschetz number is closely tied to fixed-point index theory and Nielsen fixed-point theory:

• Combinatorial Fixed-Point Index: For $f:K\to K$, the combinatorial Lefschetz number of $f$ restricted to $U$ is the combinatorial fixed-point index: $\Lambda(U,f)_K = i_c(K, f, U)$ (López et al., 30 May 2025).
• Fixed-Point Theorems: $\Lambda_c(f,A)_X \neq 0$ implies the existence of a fixed point in $\overline{A}$, generalizing the Lefschetz fixed-point theorem to open, non-compact, and even unbounded settings (López et al., 16 Jan 2026).
• Lower Bounds for Nielsen Numbers: The combinatorial Lefschetz number yields effective lower bounds for triad-Nielsen numbers in spaces built as connected sums or unions of subcomplexes (López et al., 16 Jan 2026).

6. Extensions and Specialized Variants

Various extensions, generalizations, and combinatorial incarnations of the Lefschetz number appear in related research contexts:

• Abelianized Lefschetz Numbers: In quantum topology, weighted sums of abelianized Lefschetz numbers capture the colored Jones polynomials, as in the interpretation of braid group actions on configuration space homology with local coefficients (Martel, 2020).
• Dynamical Zeta Functions and Averaging: For graphs, the Lefschetz zeta function of an automorphism and the average Lefschetz number over the automorphism group provide insight into orbit structure and quotient spaces (Knill, 2012).
• Chain-Level and Index-Integration Frameworks: The framework described in (López et al., 30 May 2025) provides a combinatorial index theory that subsumes the combinatorial Lefschetz number, featuring topological and homotopical invariance without definability, openness, or invariance restrictions.

7. Illustrative Computations and Examples

Computations exemplary of the combinatorial Lefschetz number highlight its algorithmic and conceptual power:

• For the reflection $f(x)=1-x$ on $[0,1]$ with the standard 1-simplex structure, the combinatorial Lefschetz number is $+1$, matching the classical Lefschetz number (López et al., 30 May 2025).
• Piecewise affine maps on annuli, glued complexes, wedges of circles, and noncompact unions of tori are analyzed by successive “cutting” into elementary sets, use of additivity, and direct trace computation (López et al., 16 Jan 2026).
• In graphs, endomorphisms fixing cliques or triangles demonstrate the fixed-simplex sum, while acting on star-shaped complexes generalizes the Brouwer fixed-point theorem to the discrete/graph context (Knill, 2012).

---

The combinatorial Lefschetz number thus represents a robust, axiomatic, and computationally accessible extension of classical Lefschetz theory, fully compatible with modern developments in combinatorics, fixed-point theory, and algebraic topology (Staecker, 2013, Knill, 2012, Martel, 2020, López et al., 16 Jan 2026, López et al., 30 May 2025).