REVIEW 3 major objections 3 minor 43 references
Intersection matrices associated to geometric-ordered bases of Feynman integrals
T0 review · 3 major / 3 minor · reviewed 2026-08-15 · deepseek-v4-flash
Pith's one-line read Intersection matrices for geometrically ordered Feynman bases collapse to Laurent polynomials in ε, and to integers times ε^{-n} after ε-factorisation.
desk verdict A genuinely useful practical algorithm for eliminating auxiliary functions, wrapped in two structural claims that are well-evidenced but not actually proven. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the intersection matrix $C_{ij}=\langle\Psi_i|\Psi_j^\vee\rangle$ of integrand classes, paired with the dual basis obtained by $\varepsilon\to-\varepsilon$, together with the rotation matrix $R_2$ that connects the step-1 basis $J$ to the step-2 basis $K$. The identity that runs through the paper is the differential equation $d_B\tilde C=\tilde A\tilde C+\tilde C\tilde A^{\vee T}$, which fixes $\tilde C$ up to an $\varepsilon$-dependent prefactor; applying the rotation through $C=R_2^{-1}\tilde C(R_2^{\vee T})^{-1}$ and requiring $d_BC=0$ converts the demand of constant intersection numbers into algebraic equations among the auxiliary functions. Algorithm 1 reads these equations off from the bottom up in powers of $\varepsilon$, eliminating a subset of the auxiliary functions while keeping the number of required intersection-number computations small. For Feynman integrals proper, the machinery first replaces integrands by their symmetry-averaged versions, so that the intersection numbers are well defined at integral level and independent of the integral representation.
What would settle it
Compute one entry of $\tilde C$ for the four-loop equal-mass banana directly from the defining intersection integral rather than from the differential equation; the claimed structure predicts a Laurent polynomial in $\varepsilon$ with lowest power $\varepsilon^{-2}$. Finding a term such as $\ln x$ or a pole below $\varepsilon^{-2}$ would refute the claim.
Extended reading notes
Core claim
The paper's central claim is that the intersection matrices of the bases produced by the geometric Laporta algorithm are far simpler than generic rational functions would suggest. Working on the maximal cut, with the dual basis defined by the substitution $\varepsilon\to-\varepsilon$ and with integrands symmetrised under the symmetry relations of the Feynman family, the paper finds that the intersection matrix $\tilde C$ of the filtration-compatible basis $J$ is a Laurent polynomial in $\varepsilon$ whose lowest power is at least $\varepsilon^{-n}$; and that the intersection matrix $C$ of the $\varepsilon$-factorised basis $K$ is constant in the kinematic variables and, up to an overall factor $\varepsilon^{-n}$, has integer entries, whenever the boundary values of the auxiliary functions are chosen so that $d_B C=0$. Because constant intersection numbers impose $N_F(N_F+1)/2$ constraints whereas weak self-duality imposes only $N_F(N_F-1)/2$, the constant-intersection condition detects algebraic relations among auxiliary functions that self-duality misses. The resulting Algorithm 1 eliminates the redundant auxiliary functions on the maximal cut and is verified in examples that include an elliptic curve, the three-loop electron self-energy with one zero mass, the four-loop equal-mass banana (a Calabi-Yau three-fold), and higher-genus necklace diagrams.
Load-bearing premise
All of the simplification rests on being able to solve the equations that fix the auxiliary functions of the rotation so that the unwanted negative powers of $\varepsilon$ vanish; the paper verifies this in every worked example but does not prove that such a solution exists for every Feynman family.
Editorial extensions
If this is right
- For any Feynman family for which the two-step geometric construction exists, the redundant auxiliary transcendental functions on the maximal cut can be eliminated automatically, shrinking the $\varepsilon$-factorised differential system.
- Constant intersection numbers become a well-defined criterion for fixing the integration constants of auxiliary functions: choose boundary values so that $d_BC=0$.
- The counting difference ($N_F(N_F+1)/2$ equations versus $N_F(N_F-1)/2$ for weak self-duality) means the constant-intersection condition should remove at least as many auxiliary functions as self-duality in every example.
- In the four-loop equal-mass banana, the algorithm reduces the twenty auxiliary functions of the rotation to ten, and the surviving functions are expressed through a period of the Calabi-Yau three-fold and related quantities.
- The same simplification is expected beyond the maximal cut once relative twisted cohomology is brought in, which would extend the elimination algorithm to complete Feynman integrals.
Reading between the lines
- The parity structure of the Laurent-polynomial expansion suggests a diagnostic: if an even-loop family shows a lowest $\varepsilon$-power on the diagonal that reaches $-l+1$, either a symmetry relation has been missed or the basis is not filtration-compatible.
- The algebraic-equation viewpoint opens an optimisation problem: choose the rotation ansatz so that the elimination constraints are triangular, thereby minimising the number of auxiliary functions that ever have to be integrated.
- If the integer-entry property of $C$ survives beyond the maximal cut, intersection matrices could serve as a normalisation-independent certificate that an $\varepsilon$-factorised basis is well chosen, independent of the representation used for the integrals.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies intersection matrices of Feynman integrands on the maximal cut, for two bases produced by the geometric Laporta algorithm of refs. [19,20]: the filtration-compatible basis \tilde{J} and the \epsilon-factorised basis K. The main claims are that the intersection matrix of \tilde{J} has entries that are Laurent polynomials in \epsilon, and that for K the entries are, after an overall power of \epsilon is factored out, integers, provided the integration constants (boundary values) of the auxiliary functions in the rotation R2 are chosen appropriately. The paper formulates an algorithm that exploits these properties to eliminate algebraically redundant auxiliary functions, and illustrates the claims on examples ranging from simple rational cases to elliptic curves, Calabi-Yau banana integrals, and higher-genus necklace integrals. The paper also clarifies that intersection numbers must be defined on symmetrised integrands in order to be meaningful at the level of Feynman integrals.
Significance. If the structural claims hold, the paper provides a useful practical tool: it shows that constant intersection numbers give more constraints than self-duality, and it gives a systematic, differential-equation-based algorithm for reducing the number of auxiliary transcendental functions in \epsilon-factorised systems. The worked examples are detailed and the dependence on boundary constants is demonstrated explicitly, e.g. in the four-loop banana example. The differential-equation derivations in Sections 2-4 are coherent, and the clarification about symmetrised integrands addresses a real subtlety. However, the general claims are not proved; they are supported by examples and by the phrase 'in all examples we checked'. Because the central statements are formulated as general findings, the missing proof of existence of suitable boundary constants is a load-bearing gap that must be addressed.
major comments (3)
- [§5, Algorithm 1 step 4, eq. (91)] The existence of a solution to the system C(k)_ij = 0 for k < 0 and C(0)_ij = N_ij with det N ≠ 0 is assumed, not proved. The verification step in eq. (90) only checks that a candidate solution satisfies d_B C(k) = 0 and throws an exception otherwise, so the algorithm presupposes the very property it is designed to exploit. This matters because eq. (39) shows that a constant intersection matrix requires AC - C A^T = 0, a nontrivial algebraic constraint on A; it is not automatic that the integration constants available in R2 are sufficient to satisfy it. The paper gives no counting argument relating the number of free boundary constants to the number of equations, and no genericity statement. Since the abstract's 'if the boundary values ... are chosen appropriately' depends directly on this solvability, the authors should either prove existence for the bases constructed in refs. [19,20], state clearly that this is an additional assumption, or explicitly formulate the claim as a conjecture.
- [Abstract and §2.1, eqs. (82)-(83)] The general statements that the intersection matrix for a filtration-compatible basis is a Laurent polynomial in \epsilon, and that the \epsilon-factorised basis gives an integer matrix up to a power of \epsilon, are supported only by examples. The text before eq. (82) says 'in all examples we checked', and no proof is supplied for either the Laurent-polynomial structure or the integrality. Eq. (87) determines \tilde{C} up to a prefactor from a differential equation, but it does not by itself imply the claimed rationality or Laurent-polynomial form. If these are meant as theorems, a proof should be provided; if they are empirical observations, the abstract and Section 2.1 should be reworded so that the conditional status is explicit.
- [§1, paragraph on the integer condition] The sentence 'Given that the entries of the intersection matrix are rational, the integer condition follows easily from an appropriate rescaling' is not correct as written. Rationality plus proportionality to a power of \epsilon does not imply integer entries after factoring out only that power: for example, C = (1/2)\epsilon^{-1} is rational and proportional to \epsilon^{-1}, but its entries are not integers and cannot be made integer without introducing a rational prefactor. The examples achieve exact integer entries, but the argument in the introduction needs to be made precise, either by allowing an additional constant prefactor or by proving integrality directly.
minor comments (3)
- [§6.5, discussion after eq. (164)] For the four-loop banana, the paper states that 10 of the 20 auxiliary functions can be eliminated, but no explicit list of the eliminated functions or the resulting reduced system is given. A table or an explicit list would make the algorithm's output easier to check and would strengthen the example.
- [§4, eq. (80)] The step from the differential equation for the symmetrised forms to the statement that CFeynman is the intersection matrix of the symmetrised forms is stated rather than derived. A short justification that the symmetrisation does not alter the differential equation in the presence of the block structure of eq. (68) would be helpful.
- [§7, Conclusions] The sentence 'We expect this to be true beyond the maximal cut' makes clear that the results are only established on the maximal cut. This limitation should also appear in the abstract, since the current abstract states the claims without this restriction.
Circularity Check
No significant circularity: the paper's structural claims are conditional constructions, not predictions forced by fitted inputs.
full rationale
No circular step satisfies the evidentiary bar. The central claims are explicitly conditional: the integer/constant intersection-matrix statement for the ε-factorised basis is qualified by 'if the boundary values for the auxiliary functions of the rotation are chosen appropriately' (abstract and Section 2.1). Algorithm 1 does not fit a parameter and then rename it a prediction; it imposes constant intersection numbers as constraints on the integration constants of the auxiliary functions entering R2, and the examples, e.g. Section 6.5 around eqs. (166)-(169), demonstrate the genuine dependence on boundary values rather than assuming it away. The filtration-compatible intersection matrix tildeC is obtained by solving the differential equation (87), which follows from the known matrix tildeA and the definition of intersection numbers, so it is not an input disguised as a conclusion. Reliance on refs. [19,20] for the existence and form of the rotation R2 is a normal algorithmic dependency: the paper takes the ε-factorised basis as given and studies properties of its intersection matrix; the cited work does not supply the target result. The absence of a general existence proof for the algebraic system in Algorithm 1 step 4 is a completeness or correctness gap, not circularity, since the paper verifies solvability in examples and does not claim a proof for all families. The integer condition is also acknowledged to be a normalization once constancy is established ('Given that the entries of the intersection matrix are rational, the integer condition follows easily from an appropriate rescaling'), further showing that no independent claim is being forced by construction.
Assumptions & free parameters
free parameters (3)
- Overall prefactor f(epsilon) for tilde C =
set to 1 in examples (Section 6.4)
- Boundary constants for auxiliary functions =
e.g., N(-2)_34 = 0 in four-loop banana (Eq. 167-168)
- Constant matrix N_ij in Algorithm 1 step 4 =
arbitrary symmetric invertible matrix, e.g., the matrices shown in examples
assumptions (5)
- standard math Intersection theory and Riemann's twisted bilinear relations (Eq. 27) define the four pairings and their relations.
- ad hoc to paper The epsilon-dual basis is obtained by epsilon -> -epsilon and division by P_odd, and this correctly represents (H^n)^vee.
- domain assumption Invariance of intersection numbers under simultaneous twist and integrand transformations (Eq. 59).
- domain assumption Boundaries of integration cycles lie in the divisor D, so period matrices satisfy d_B P = epsilon A P and the dual analogue.
- domain assumption The geometric-ordered bases of refs. [19,20] provide a filtration-compatible J and an epsilon-factorised K with auxiliary functions satisfying the stated differential equations.
Cite this review
Pith. "Pith review of Intersection matrices associated to geometric-ordered bases of Feynman integrals." pith.science (2026). https://pith.science/paper/VQ6BSSHE
@misc{pith2026260803646,
author = {Pith},
title = {Pith review of: Intersection matrices associated to geometric-ordered bases of Feynman integrals},
year = {2026},
howpublished = {\url{https://pith.science/paper/VQ6BSSHE}},
note = {Machine review of arXiv:2608.03646}
}
abstract
In integration-by-parts reduction of Feynman integrals, the order relation in the Laporta algorithm determines a set of master integrals. In this paper we investigate the intersection matrices of the integrands of the master integrals that are obtained from a geometric order relation. With an appropriate definition of integrands and their duals, we find that the intersection matrices are simpler than expected: For a filtration-compatible basis, the entries of the intersection matrix are Laurent polynomials in the dimensional regularisation parameter $\varepsilon$. For an $\varepsilon$-factorised basis, the entries are instead integers, up to an overall power of $\varepsilon$, if the boundary values for the auxiliary functions of the rotation are chosen appropriately. This has practical consequences: We can systematically eliminate certain auxiliary transcendental functions, introduced in going from a filtration-compatible basis to an $\varepsilon$-factorised basis. We provide an algorithm that performs this elimination while minimising the number of required calculations.
Figures
Reference graph
Works this paper leans on
- [1]
-
[2]
Frellesvig et al., JHEP 05, 153 (2019), arXiv:1901.11510
H. Frellesvig et al., JHEP 05, 153 (2019), arXiv:1901.11510
arXiv 2019
-
[3]
H. Frellesvig et al., Phys. Rev. Lett. 123, 201602 (2019), arXiv:1907.02000
arXiv 2019
- [4]
- [5]
-
[6]
Frellesvig et al., JHEP 03, 027 (2021), arXiv:2008.04823
H. Frellesvig et al., JHEP 03, 027 (2021), arXiv:2008.04823
arXiv 2021
- [7]
- [8]
Show all 43 references
-
[9]
Chestnov et al., JHEP 09, 187 (2022), arXiv:2204.12983
V . Chestnov et al., JHEP 09, 187 (2022), arXiv:2204.12983
2022 arXiv
-
[10]
Chestnov, H
V . Chestnov, H. Frellesvig, F. Gasparotto, M. K. Mandal , and P . Mastrolia, JHEP 06, 131 (2023), arXiv:2209.01997
2023 arXiv
- [11]
-
[12]
Brunello et al., JHEP 09, 015 (2024), arXiv:2401.01897
G. Brunello et al., JHEP 09, 015 (2024), arXiv:2401.01897
2024 arXiv
-
[13]
Brunello, V
G. Brunello, V . Chestnov, and P . Mastrolia, JHEP 07, 045 (2025), arXiv:2408.16668
2025 arXiv
-
[14]
J. Chen, X. Jiang, X. Xu, and L. L. Y ang, Phys. Lett. B 814, 136085 (2021), arXiv:2008.03045
2021 arXiv
-
[15]
J. Chen, X. Jiang, C. Ma, X. Xu, and L. L. Y ang, JHEP 07, 066 (2022), arXiv:2202.08127
2022 arXiv
-
[16]
Jiang and L
X. Jiang and L. L. Y ang, Phys. Rev. D 108, 076004 (2023), arXiv:2303.11657. 34
2023 arXiv
-
[17]
Jiang, M
X. Jiang, M. Lian, and L. L. Y ang, (2023), arXiv:2312.03 453
2023
- [18]
-
[19]
Bree et al., Phys
ε-collaboration, I. Bree et al., Phys. Rev. Lett. 136, 241602 (2026), arXiv:2506.09124
2026
- [20]
-
[21]
Gasparotto, S
F. Gasparotto, S. Weinzierl, and X. Xu, JHEP 06, 128 (2023), arXiv:2305.05447
2023 arXiv
-
[22]
C. Duhr, S. Maggio, C. Semper, and S. F. Stawinski, (2026 ), arXiv:2604.08332
2026 arXiv
-
[23]
C. Duhr, F. Porkert, C. Semper, and S. F. Stawinski, JHEP 03, 053 (2025), arXiv:2408.04904
2025
-
[24]
Duhr et al., JHEP 02, 211 (2026), arXiv:2509.17787
C. Duhr et al., JHEP 02, 211 (2026), arXiv:2509.17787
2026
-
[25]
Frellesvig and S
H. Frellesvig and S. Weinzierl, SciPost Phys. 16, 150 (2024), arXiv:2301.02264
2024 arXiv
-
[26]
Pögel, X
S. Pögel, X. Wang, S. Weinzierl, K. Wu, and X. Xu, JHEP 09, 084 (2024), arXiv:2407.08799
2024 arXiv
-
[27]
C. Duhr, F. Porkert, C. Semper, and S. F. Stawinski, JHEP 03, 019 (2025), arXiv:2407.17175
2025
- [28]
-
[29]
Pögel, X
S. Pögel, X. Wang, and S. Weinzierl, Phys. Rev. Lett. 130, 101601 (2023), arXiv:2211.04292
2023 arXiv
- [30]
-
[31]
C. Duhr, F. Porkert, and S. F. Stawinski, JHEP 02, 014 (2025), arXiv:2412.02300
2025
-
[32]
C. Duhr, S. Maggio, F. Porkert, C. Semper, and S. F. Stawi nski, JHEP 12, 034 (2025), arXiv:2507.23061
2025
-
[33]
Forner, C
F. Forner, C. C. Mella, C. Nega, L. Tancredi, and F. J. Wag ner, (2026), arXiv:2604.25270
2026 arXiv
-
[34]
Matsubara-Heo and N
S.-J. Matsubara-Heo and N. Takayama, Nagoya Mathemati cal Journal 246, 256–272 (2022)
2022
-
[35]
Cho and K
K. Cho and K. Matsumoto, Nagoya Math. J. 139, 67 (1995)
1995
-
[36]
Aomoto and M
K. Aomoto and M. Kita, Theory of Hypergeometric Functions (Springer, 2011)
2011
-
[37]
M. A. Barkatou, Journal of Symbolic Computation 28, 547 (1999). 35
1999
-
[38]
M. A. Barkatou, T. Cluzeau, C. El Bacha, and J.-A. Weil, C omputing closed form solutions of integrable connections, in Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC ’12, p. 43–50, New Y ork, NY , USA, 2012, Association for Comput...
2012
- [39]
-
[40]
C. Duhr, F. Gasparotto, C. Nega, L. Tancredi, and S. Wein zierl, JHEP 11, 020 (2024), arXiv:2408.05154
2024 arXiv
-
[41]
Mizera, Aspects of Scattering Amplitudes and Moduli Space Localiza tion, PhD thesis, Perimeter Inst
S. Mizera, Aspects of Scattering Amplitudes and Moduli Space Localiza tion, PhD thesis, Perimeter Inst. Theor. Phys., 2019, arXiv:1906.02099
2019 arXiv
-
[42]
Mizera, PoS MA2019, 016 (2019), arXiv:2002.10476
S. Mizera, PoS MA2019, 016 (2019), arXiv:2002.10476
2019 arXiv
-
[43]
Matsubara-Heo and S
S.-J. Matsubara-Heo and S. Telen, Adv. Appl. Math. 165, 102832 (2025), arXiv:2301.13579. 36
2025 arXiv
Reviewed August 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.