Pith. sign in

REVIEW 1 major objections 4 minor 12 references

Crossing matrix and a polynomial invariant of braid systems up to Hurwitz equivalence

T0 review · 1 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Pith's one-line read The paper proves that the product of characteristic polynomials of crossing matrices C(b_i^{r_i}) is invariant under Hurwitz equivalence, and that the resulting essential eigenvalue set detects when Euler fusion or fission is unavoidable be

desk verdict A clean, short construction whose load-bearing conjugacy lemma is unproved here and outsourced to the authors' own preprint; worth refereeing if that lemma is supplied. read the letter →

arxiv 2601.02323 v3 pith:ENIL4O4W submitted 2026-01-05 math.GT

classification math.GT MSC 20F3657K10
keywords braidsystemsHurwitzequivalencecrossingmatrixcharacteristicpolynomialsurfacelinksbraidsEulerfusionconjugacyinvariant
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Braid systems—ordered collections of braids—are the combinatorial data underlying surface braids and surface links, and two systems are considered equivalent when they are related by the Hurwitz action. This paper proves that a single polynomial P(b), the product of the characteristic polynomials of the crossing matrices C(b_i^{r_i}) for each component, is invariant under the Hurwitz action. The key structural reason is that each b_i^{r_i} is a pure braid, so its crossing matrix is symmetric, has real eigenvalues, and its characteristic polynomial is unchanged by conjugation. Because P factors into real linear terms, the roots can be read off and manipulated easily; in the paper's worked example P distinguishes two four-component systems that the usual trace-product, monodromy-group, and permutation invariants cannot separate. The same construction produces an essential eigenvalue set that is unchanged by Hurwitz moves, global conjugation, and stabilization, so for surface links any difference in that set forces an Euler fusion or fission somewhere in the equivalence sequence.

What carries the argument

The central object is the crossing matrix C(B) of a braid diagram, whose (i,j)-entry is the number of positive crossings minus the number of negative crossings in which strand i passes over strand j. It is well-defined on the braid, and for a pure braid it is symmetric. For a braid b whose permutation has order r, b^r is pure, so the symmetric integer matrix C(b^r) has real eigenvalues; its characteristic polynomial P(b) is a conjugation invariant by the quoted Proposition 3. The machinery of the paper is to multiply these single-braid polynomials across a braid system to obtain P(b), and to delete the trivial eigenvalues 0, ±1 to get the essential set E(b), which is stable under stabilizati

What would settle it

The most direct check: take any braid b and a conjugate b' = a^{-1} b a; compute the characteristic polynomials of C(b^r) and C((b')^r). The paper predicts they coincide; a mismatch would refute the quoted Proposition 3 and thereby Theorem 1. Since the crossing matrices are finite integer matrices, this is a direct finite computation.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1: if two braid systems are Hurwitz equivalent, their P-polynomials are equal. The construction: for a braid b_i with permutation order r_i, form the pure braid b_i^{r_i}, take its crossing matrix, and record the characteristic polynomial det(xI - C(b_i^{r_i})); multiply these n polynomials. Since the single-braid characteristic polynomial is a conjugacy invariant, each Hurwitz move—which replaces one component by a conjugate and another by a conjugate product—leaves the product untouched. Theorem 2 then strips off the eigenvalues 0 and ±1, which are the only eigenvalues that stabilization adds or removes, and shows the remaining multiset E(b) is invariant under

Load-bearing premise

The main theorem inherits its force from the quoted Proposition 3, which says the characteristic polynomial of C(b^r) is invariant under conjugation; the present paper does not prove this, and an error there would collapse Theorem 1 and the surface-link application.

Editorial extensions

If this is right

  • P(b) and E(b) can be computed directly from braid words by forming crossing matrices, so the invariants are practical for small systems.
  • If P differs, Hurwitz equivalence is impossible; the paper demonstrates this on a pair that classical invariants fail to separate.
  • P(b) always factors into mn real linear factors whose roots sum to zero, giving a multiset of real numbers attached to the braid system.
  • For equivalent surface links, a difference in E(b) forces at least one Euler fusion or fission in any sequence of moves; E can therefore certify that the four-dimensional move is necessary.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: because P is a product, it records only the union of the single-component spectra; the authors do not exploit correlations between components. A joint polynomial built from all C(b_i^{r_i}) simultaneously might separate additional Hurwitz classes.
  • Editorial extension: the structure used is just 'symmetric integer matrix attached to each group element, with a conjugacy-invariant characteristic polynomial,' so the same construction could produce Hurwitz invariants for other groups equipped with such a representation.
  • Editorial extension: in the paper's own example, P separates systems that agree on trace product, monodromy group, and all permutation/homomorphism projections; a natural next test is to survey random pairs of braid systems and measure how often P detects non-equivalence relative to those classical invariants.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper studies the crossing matrix C(b) of a braid b and, for a braid system \vec b=(b_1,\dots,b_n)\in (B_m)^n, defines P(\vec b) as the product of the characteristic polynomials of C(b_i^{r_i}), where r_i is the order of the braid permutation of b_i. The main theorems assert that P is invariant under Hurwitz equivalence (Theorem 1), that P factors into mn real linear factors whose roots sum to zero (Corollary 2), and that the essential eigenvalue multiset E(\vec b), obtained by deleting eigenvalues 0, \pm 1, is invariant under Hurwitz action, global conjugation, and stabilization/destabilization (Theorem 2). The paper presents the invariant as an obstruction to Hurwitz equivalence and, via Kamada's four-dimensional Markov theorem, as an indicator for the necessity of Euler fusion or fission. Two worked examples (Examples 9 and 10) illustrate that the invariant is easily computable and can be more discriminating than the trace product and monodromy group.

Significance. The central observation — that the Hurwitz action preserves conjugacy classes, so any conjugacy invariant of braids gives a Hurwitz invariant by multiplying over entries — is elementary, but the paper packages it cleanly around crossing-matrix spectral data. The invariant is computable and the examples are convincing; Example 9 is a genuine demonstration that P is strictly finer than two classical necessary conditions. The surface-link application is potentially useful. The main weakness is the unproved external premise Proposition 2/3; if that is supplied, the paper is a solid, modest contribution.

major comments (1)
  1. [§3, Proposition 2/3 (and §6, Theorems 1 and 2)] The Hurwitz invariance of P and E rests entirely on Proposition 2/3: if b is conjugate to b' and r is the order of the braid permutation, then C(b^r) is permutation equivalent to C((b')^r). This is quoted from the authors' own preprint [9] without proof. The rest of the paper — Corollary 1, Theorem 1, Corollary 2, Lemma 2, Theorem 2 — is a formal consequence of this statement, so a failure of Proposition 2/3 would invalidate the main claims. Because [9] is not a published reference, I ask the authors to include a self-contained proof of Proposition 2 (and hence Proposition 3), or at least to reproduce the argument from [9] in an appendix, so that the central invariant does not depend on an unchecked claim.
minor comments (4)
  1. [Lemma 2 (III)] The displayed formula P(σ_m)=P(σ_m^{-1})=x^{m-2}(x+1)(x-1) is inconsistent with Example 6 when σ_m is viewed in B_{m+1}; it should be x^{m-1}(x+1)(x-1). The conclusion about E is unaffected, since the extra roots are 0 and ±1.
  2. [Theorem 3 (IV)] In the definition of Euler fission, the final term is written τ(b'_{l+p}); this should presumably be τ(b'_{l+q}). The transformations (IV)/(IV') would also benefit from a precise statement of how q is related to the τ values.
  3. [Reference list / footnote 4] Footnote 4 contains a typo ('compareing'). Also, reference [7] is an arXiv preprint; if a published or updated version exists, it should be cited.
  4. [Example 2] It would help to indicate the braid permutation orders explicitly for the two braids before displaying the fourth-power crossing matrices, since Proposition 2 uses r.

Circularity Check

1 steps flagged · score 4.0 of 10

Main Hurwitz invariants are assembled from the authors' own unproved Proposition 3; the derivation is formal rather than independent.

  1. self citation load bearing [Section 3, Proposition 3; Section 6, Corollary 1 and Proof of Theorem 1]
    "Proposition 3([9]). Let r be the order of the braid permutation of a braid b. The rank, determinant, characteristic polynomial, and eigenvalues of C(b^r) are invariant under conjugation. ... Proof of Theorem 1. This is an immediate consequence of Corollary 1 by taking the product of characteristic polynomials."

    Corollary 1 is Proposition 3 applied entrywise under Proposition 9(C); the proof of Theorem 1 is then literally 'an immediate consequence of Corollary 1'. Thus the claimed Hurwitz invariance of P and E reduces, inside this paper, to the authors' own preprint [9] for the key conjugacy invariance of C(b^r). No proof of Proposition 3 is supplied, and if that self-cited result failed, Theorem 1, Corollary 2, Lemma 2, and Theorem 2 would all fail. This is load-bearing self-citation rather than an externally derived first-principles invariant.

full rationale

No definitional circularity or fitted-input-as-prediction was found: P(b) is explicitly defined as a product of characteristic polynomials, and Hurwitz invariance is not assumed in the definition. The worked examples and the stabilization/conjugation arguments are internally consistent and checkable. The only substantive circularity concern is that the central engine, Proposition 3, is imported from the same first author's prior preprint [9] and is not derived in the paper. The new braid-system invariants are formal products/multisets of that self-cited conjugacy invariant. Since Proposition 3 is a parameter-free algebraic statement that can be checked by computation and does not assume the target theorem, this is not a full equivalence-by-construction, but it is a load-bearing self-citation, warranting score 4 rather than 0-2 or 6+.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters or invented entities. The paper is a short application of known results: crossing-matrix invariants from [4] and [9] plus standard Hurwitz-action facts. The central dependence on the authors' own unreviewed preprint [9] is the main epistemic weak point.

assumptions (5)
  • domain assumption Crossing matrix C(b) is well-defined for a braid b and symmetric for pure braids.
    Introduced and proved in [4]; the paper does not reprove it. This is foundational for defining P(b).
  • domain assumption For b with braid-permutation order r, the characteristic polynomial of C(b^r) is a conjugacy invariant (Prop 3).
    Quoted from the authors' own preprint [9]; the main engine of Theorem 1, not proved here.
  • standard math The Hurwitz action preserves the multiset of conjugacy classes of the entries of a tuple (Prop 9(C)).
    Immediate from the action definition; cited to [3,7].
  • domain assumption Kamada's theorems: every surface link is the closure of a surface braid, and two closures are equivalent iff the braid systems are related by (I)-(IV') (Theorem 3).
    External results from [6]; load-bearing for the Euler-fusion application.
  • standard math Eigenvalues of a real symmetric matrix are real.
    Used in Prop 6 and Cor 2 to factor P(b) over R.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Crossing matrix and a polynomial invariant of braid systems up to Hurwitz equivalence." pith.science (2026). https://pith.science/paper/ENIL4O4W

@misc{pith2026260102323,
  author       = {Pith},
  title        = {Pith review of: Crossing matrix and a polynomial invariant of braid systems up to Hurwitz equivalence},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ENIL4O4W}},
  note         = {Machine review of arXiv:2601.02323}
}
read the original abstract

We study the crossing matrix of a braid and introduce a polynomial invariant for braid systems that is invariant under Hurwitz equivalence. As an application to the study of surface braids and surface links, we also define an invariant that can be used as an indicator of the necessity of Euler fusion or fission between braid systems.

Figures

Figures reproduced from arXiv: 2601.02323 by the authors.

Figure 1
Figure 1. A braid diagram. In this paper, the equivalence class of a geometric m-braid is simply called an m-braid. Let Bm be the m-braid group, that is, the set of m-braids with the group operation naturally induced by the braid product. For 1 ≤ i ≤ m − 1, σi is the m-braid which has the diagram depicted in [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. The generators σi and σ −1 i . 3 [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. A braid diagram and its crossing matrix. [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Braids b = σ1σ2σ −1 3 and b ′ = σ1σ −1 2 σ3. 5 [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: Conjugate braids b = σ3σ −1 1 σ4 and b ′ = σ4σ3σ −1 1 . Example 4. For the braids b = σ1σ2σ −1 3 and b ′ = σ1σ −1 2 σ3 in Example 2, we obtain det(C(b 4 )) = 1, det(C((b ′ ) 4 )) = −3. The characteristic polynomials of C(b 4 ), C((b ′ ) 4 ) are x 4 − 2x 2 + 1 = (x + 1)…
Figure 6
Figure 6. Figure 6: The braid ι(b). Lemma 1. Let b ∈ Bm. Let ι(b) be the (m + 1)-braid that has the same word as b (see [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 7
Figure 7. Figure 7: The braid b5 has the characteristic polynomial P(b5) = x 5 − 4x 3 . Proof. Since bm is a pure braid, we have P(bm) = det (xI − C(bm)). By the Laplace expansion along the mth column and then the (m − 1)th row, we have [PITH_FULL_IMAGE:figures/full_fig_p009_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 2 linked inside Pith

  1. [9]

    Shimizu, Determinant of the crossing matrix of a braid, arXiv:2509.08464 (2025)

    A. Shimizu, Determinant of the crossing matrix of a braid, arXiv:2509.08464 (2025)

  2. [1]

    Artin, Theorie der Z¨ opfe, Abh

    E. Artin, Theorie der Z¨ opfe, Abh. Math. Semin. Hamburg Univ.4(1926), 47–72

  3. [2]

    Artin, Theory of braids, Ann

    E. Artin, Theory of braids, Ann. Math.48(1947), 101–126

  4. [3]

    Berger, Hurwitz equivalence in dihedral groups, Electron

    E. Berger, Hurwitz equivalence in dihedral groups, Electron. J. Combin. 18(2011). P45

  5. [4]

    Burillo, M

    J. Burillo, M. Gutierrez, S. Krsti´ c and Z. Nitecki, Crossing matrices and Thurston’s normal form for braids, Topol. Appl.118(2002), 293–308

  6. [5]

    Gutierrez and Z

    M. Gutierrez and Z. Nitecki, Crossing matrix of positive braids, arXiv:1805.12189 (2018)

  7. [6]

    Kamada, Braid and Knot Theory in Dimension Four, Math

    S. Kamada, Braid and Knot Theory in Dimension Four, Math. Surveys Monogr. Math. Soc., Providence, RI, 2002

  8. [7]

    Liberman, M

    E. Liberman, M. Teicher, The Hurwitz equivalence problem is undecidable, arXiv:math/0511153 (2005). 4For the case of Example 10, we can also detect the necessity of the Euler fusion or fission between ⃗band⃗ cby compareing the sum of the degree and the length. The sum of the degree kand the lengthlof ⃗b∈P l id(Ak) is unchanged modulo 3 by the operations (...

Show all 12 references
  1. [8]

    Ozawa, A

    Y. Ozawa, A. Shimizu and Y. Yaguchi, The CN matrix of a pure braid projection, J. Knot Theory Ramifications35(1) (2026), 2550075

  2. [10]

    Shimizu, A

    A. Shimizu, A. Gill and S. Joshi, A note on the unknotting number and the region unknotting number of weaving knots, to appear in Hiroshima Math. J. (arXiv:2408.14938)

  3. [11]

    Shimizu and Y

    A. Shimizu and Y. Yaguchi, Characterization of the OU matrix of a braid diagram, Topol. Appl.373(2025), 109440

  4. [12]

    Shimizu and Y

    A. Shimizu and Y. Yaguchi, Determinant of the OU matrix of a braid diagram, J. Knot Theory Ramifications34(2) (2025), 2550005. 17

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.