A formula for the Euler class of foliations

Alessandro V. Cigna

arxiv: 2602.14990 · v3 · submitted 2026-02-16 · 🧮 math.GT

A formula for the Euler class of foliations

Alessandro V. Cigna This is my paper

Pith reviewed 2026-05-15 21:44 UTC · model grok-4.3

classification 🧮 math.GT

keywords foliationsEuler classbranched surfacesPoincaré dualtaut foliationsWhitehead link3-manifoldstransverse surfaces

0 comments

The pith

The dual graph of a cooriented branched surface yields a simplicial cycle that is the Poincaré dual of the foliation's Euler class.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper supplies a combinatorial formula for the relative Euler class of a foliation by building a simplicial 1-cycle directly from the dual graph of any cooriented branched surface that fully carries it. This cycle is shown to represent the Poincaré dual of the Euler class relative to the boundary, turning an abstract characteristic class into an explicit object one can read off the carrying data. The formula finishes the classification of which homology classes arise as relative Euler classes of taut foliations in the Whitehead link exterior and recovers earlier results of Lackenby and Dunfield as special cases. It further implies that branched surfaces whose complement consists of balls obey a combinatorial version of the transverse surface theorem.

Core claim

Given a cooriented branched surface B that fully carries a foliation F, the simplicial 1-cycle Γ_m(B) constructed from the dual graph of B represents the Poincaré dual of the Euler class of F relative to the boundary.

What carries the argument

The simplicial 1-cycle Γ_m(B) obtained from the dual graph of the branched surface B, which directly encodes the carrying relation and yields the Poincaré dual of the Euler class.

If this is right

The classification of homology classes realizable as relative Euler classes of taut foliations in the Whitehead link exterior is now complete.
Earlier formulas for the Euler class due to Lackenby and Dunfield appear as special cases of the new construction.
Any cooriented branched surface whose complement is a union of balls satisfies the combinatorial transverse surface theorem.
The Euler class can be read off combinatorially whenever a foliation is presented via a carrying branched surface.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The construction suggests a practical algorithm for computing Euler-class obstructions in other link exteriors by enumerating dual graphs of candidate branched surfaces.
Graph-theoretic invariants of the dual graph may translate into new obstructions for the existence of taut foliations in arbitrary 3-manifolds.
The same cycle construction might extend to give combinatorial representatives for other characteristic classes of foliations or flows.

Load-bearing premise

The branched surface must be cooriented and fully carry the foliation so that its dual graph produces a cycle whose homology class equals the Poincaré dual of the Euler class.

What would settle it

A concrete counterexample would be any cooriented branched surface that fully carries a foliation yet whose dual-graph cycle Γ_m(B) lies in a different homology class from the Poincaré dual of the foliation's Euler class.

read the original abstract

Given a cooriented branched surface $\mathcal B$ fully carrying a foliation $\mathcal F$, we use the dual graph of $\mathcal B$ to define a simplicial 1-cycle $\Gamma_m(\mathcal B)$ representing the Poincar\'e dual of the Euler class of $\mathcal F$ relative to the boundary. As an example, we complete the classification of which homology classes in the Whitehead link exterior are realisable as relative Euler classes of taut foliations. We also show how our formula generalises previous results of Lackenby and Dunfield. Finally, we observe that cooriented branched surfaces whose complement is a union of balls satisfy a Combinatorial Transverse Surface Theorem, in the sense of Landry--Minsky--Taylor.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a direct combinatorial formula for the Poincaré dual of the relative Euler class using the dual graph of a carrying branched surface, and uses it to finish the Whitehead link classification.

read the letter

The main new piece is the definition of the simplicial 1-cycle Γ_m(B) pulled straight from the dual graph of a cooriented branched surface B that fully carries the foliation F. This cycle is claimed to represent the Poincaré dual of the relative Euler class, and the paper applies it to complete the realizability list for the Whitehead link exterior while extending the Lackenby-Dunfield formulas. That is concrete progress: an explicit construction that turns a topological question into something you can compute from the graph data. Finishing the Whitehead case is the clearest payoff, since it gives a full list rather than partial results. The generalization looks like it could be applied to other manifolds without much extra work. The side note on the combinatorial transverse surface theorem for ball-complement branched surfaces is a minor observation but fits the same combinatorial style. The soft spot is the local verification. The equality between Γ_m(B) and the dual Euler class depends on the dual graph edges correctly accumulating the obstruction contributions around each branch curve, including signs and boundary behavior. The abstract states the claim cleanly, but if the full write-up does not spell out the local intersection numbers or rule out extra boundary terms when the carrying map is not transverse near the singular locus, the identification could fail in edge cases. That step is load-bearing for both the classification and the generalization. This is aimed at 3-manifold people who already work with taut foliations and branched surfaces and want a practical formula rather than existence theorems. A reader comfortable with the standard Euler class obstruction will be able to check the key step quickly. I would send it to referees. The claim is specific enough that a careful review can confirm whether the cycle matches the class exactly.

Referee Report

2 major / 1 minor

Summary. The manuscript defines a simplicial 1-cycle Γ_m(B) from the dual graph of a cooriented branched surface B that fully carries a foliation F, claiming this cycle represents the Poincaré dual of the relative Euler class e(F). It applies the construction to complete the classification of realizable relative Euler classes in the Whitehead link exterior, generalizes results of Lackenby and Dunfield, and observes that cooriented branched surfaces with ball complements satisfy a combinatorial transverse surface theorem.

Significance. If the identification holds, the formula supplies a direct combinatorial representative for PD(e(F)) that could streamline computations of Euler classes for taut foliations carried by branched surfaces. The Whitehead link classification is a concrete, verifiable application, and the generalization of prior work plus the transverse surface observation add incremental value to the literature on foliations in 3-manifolds.

major comments (2)

[Definition of Γ_m(B)] Definition of Γ_m(B) (presumably §2): the manuscript must supply an explicit local formula showing how edge contributions in the dual graph accumulate twisting numbers around each branch curve so that the resulting cycle is homologous to the standard obstruction cocycle for a transverse vector field; without this local verification the equality to PD(e(F)) remains unproven.
[Whitehead link classification] Whitehead link classification (application section): the carrying maps for the listed branched surfaces must be checked to be transverse near the singular locus; any inconsistency in coorientation or carrying would allow the homology class of Γ_m(B) to differ from PD(e(F)) by a boundary term, undermining the completeness claim.

minor comments (1)

Notation for the cycle Γ_m(B) should be introduced with a clear statement of the coefficient ring and the precise simplicial chain complex in which it lives.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and valuable comments on our manuscript. We address each major comment below and have made revisions to incorporate the suggested clarifications and verifications.

read point-by-point responses

Referee: [Definition of Γ_m(B)] Definition of Γ_m(B) (presumably §2): the manuscript must supply an explicit local formula showing how edge contributions in the dual graph accumulate twisting numbers around each branch curve so that the resulting cycle is homologous to the standard obstruction cocycle for a transverse vector field; without this local verification the equality to PD(e(F)) remains unproven.

Authors: We agree that providing an explicit local formula would make the identification clearer. In the revised manuscript, we have added a detailed local analysis in Section 2, explicitly computing the contributions from the edges of the dual graph around each branch curve. This shows how the twisting numbers accumulate to produce a cycle homologous to the standard obstruction cocycle for a transverse vector field, thereby confirming that Γ_m(B) represents the Poincaré dual of the relative Euler class e(F). revision: yes
Referee: [Whitehead link classification] Whitehead link classification (application section): the carrying maps for the listed branched surfaces must be checked to be transverse near the singular locus; any inconsistency in coorientation or carrying would allow the homology class of Γ_m(B) to differ from PD(e(F)) by a boundary term, undermining the completeness claim.

Authors: We appreciate this observation. Upon review, we have verified the transversality of the carrying maps near the singular locus for all branched surfaces listed in the classification. In the revised manuscript, we include these explicit checks, confirming consistent coorientations and transversality. This ensures that the homology class of Γ_m(B) matches PD(e(F)) without additional boundary terms, supporting the completeness of the classification. revision: yes

Circularity Check

0 steps flagged

Direct combinatorial definition with no reduction to inputs by construction.

full rationale

The paper defines the simplicial 1-cycle Γ_m(B) explicitly from the dual graph of a cooriented branched surface B that fully carries the foliation F, then asserts that this cycle represents the Poincaré dual of the relative Euler class. No equation or step in the abstract or described construction reduces the claimed equality to a fitted parameter, a self-citation chain, or a tautological renaming; the identification is presented as following from the carrying map and local intersection data. Generalizations of Lackenby-Dunfield results and the Combinatorial Transverse Surface Theorem are stated as consequences rather than foundational inputs. The derivation therefore remains self-contained and does not collapse to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on standard domain assumptions about cooriented branched surfaces and the existence of foliations they carry; no free parameters or new postulated entities are visible in the abstract.

axioms (1)

domain assumption A cooriented branched surface fully carries a foliation when the foliation is transverse to the branches in the expected way.
Invoked to ensure the dual graph encodes the Euler class correctly.

invented entities (1)

simplicial 1-cycle Γ_m(B) no independent evidence
purpose: Represents the Poincaré dual of the relative Euler class
Defined combinatorially from the dual graph of the branched surface.

pith-pipeline@v0.9.0 · 5412 in / 1358 out tokens · 18720 ms · 2026-05-15T21:44:02.223335+00:00 · methodology

A formula for the Euler class of foliations

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)