Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Elliptic curves in game theory

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The reducibility of the Spohn curve of a 2x2 game is fully classified: twelve conditions, and real points stay dense.

desk verdict The reducibility classification is new and valuable, but the abstract oversells the denseness result and the main proofs lean on unreproduced computations. read the letter →

arxiv 2501.14612 v2 pith:7CCMGIFU submitted 2025-01-24 math.AG

Abhiram Kidambi , Elke Neuhaus , Irem Portakal This is my paper · ORCID
classification math.AG MSC 14H5214P2591A05
keywords Spohncurvedependencyequilibriumtotallymixedequilibria2x2normal-formgamesellipticintersectionoftwoquadricsj-invariantrealalgebraicgeometry
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

Spohn curves are the algebraic models of totally mixed dependency equilibria — equilibria in which every pure strategy is used with positive probability and players condition on one another's expected choices — for 2x2 normal-form games, and generically they are elliptic curves realized as the intersection of two quadrics in projective 3-space. The paper classifies when the planar Spohn cubic is reducible: exactly when its defining polynomial is nonzero and one of twelve explicit conditions on the payoff entries holds. It then argues that real points are Zariski dense in the Spohn variety, with the written theorem proving this for the twelve reducible cases when the remaining payoff entries are generic while the abstract states the density conclusion in all cases. This matters because real points on the curve are the usable equilibria, so density means the algebraic model does not lose the real solution space. The paper also gives a step-by-step computation of the $j$-invariant of a Spohn curve and proposes defining full game equivalence by isomorphism of these curves over $\mathbb{Q}$.

What carries the argument

The carrying object is the Spohn cubic $C\subset\mathbb{P}^2$: the ternary cubic obtained by eliminating $p_{22}$ from the two quadrics $\det M_1$ and $\det M_2$ that define the Spohn variety $V_X\subset\mathbb{P}^3$. Its seven coefficients are built from payoff differences, and the reducibility proof checks candidate lines through the intersections of $C$ with three coordinate lines. For the real-density step the load-bearing mechanism is the criterion that one smooth real point in every irreducible component forces Zariski density of the real points, combined with a generic projection result that lifts such points from the plane cubic back to $V_X$. For the invariant part the machinery is the reduction of two quadrics in $\mathbb{P}^3$ with a common rational point to a plane cubic, the Aronhold invariants $S$ and $T$, the discriminant $\Delta=(64S^3-T^2)/1728$, and the $j$-invariant $j=64S^3/\Delta$.

What would settle it

Take a 2x2 payoff matrix that satisfies none of the twelve conditions in Theorem 3.2 and factor the corresponding ternary cubic; if it splits, the classification is incomplete. In one of the twelve cases, vary the payoff entries assumed generic and inspect the real points of each irreducible component of $V_X$; a component with no smooth real point would disprove the real-density claim as stated.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3.2: for a 2x2 game with payoff tables $A$ and $B$, the Spohn cubic $C=V(f)$, where $f=c_1x^2y+c_2x^2z+c_3xy^2+c_4xz^2+c_5y^2z+c_6yz^2+c_7xyz$, is reducible if and only if $f$ is nonzero and one of twelve listed conditions on the payoff entries holds. The coefficients $c_i$ are explicit differences of payoff entries, so each reducibility condition has a direct reading as an equality among payoffs. In Theorem 3.7 the paper proves, for each of the twelve reducible cases and assuming the remaining payoff entries are generic, that every irreducible component of the Spohn variety $V_X$ contains a smooth real point, and therefore the real points of $V_X$ lie Zariski dense in $V_X$; the abstract states this density conclusion in all cases, while the theorem itself carries the genericity assumption. The proof decomposes the ideal of $V_X$ into minimal primes, matches components with those of the plane cubic under elimination, and lifts smooth real points through a generic projection. The paper further supplies a complete pipeline for computing the $j$-invariant of a Spohn curve from two quadrics with a common rational point, and uses it to define full equivalence of 2x2 games by isomorphism of their Spohn curves over $\mathbb{Q}$.

Load-bearing premise

The load-bearing premise is that the companion repository's polynomial decompositions are correct and exhaustive, and that the real-density statement proved for the twelve reducibility cases under generic remaining payoff entries genuinely extends to every case the abstract describes as 'all cases'.

Editorial extensions

If this is right

  • For generic 2x2 games the Spohn curve is an elliptic curve, so the Aronhold algorithm computes its $j$-invariant directly from payoff data and organizes game-theoretic properties by elliptic curve invariants.
  • Where the real-density proof applies, every irreducible component of the Spohn variety has real points, so solving over the reals does not discard any algebraic component of the equilibrium model.
  • In the reducibility cases (8) through (12), under the same genericity assumption, every point of the open simplex on the Spohn variety is a dependency equilibrium, while in cases (1) through (7) some components lie on boundary hyperplanes and require separate treatment.
  • Every Nash equilibrium of a 2x2 game is a dependency equilibrium, and for Prisoner's Dilemma-type games infinitely many dependency equilibria Pareto dominate the unique Nash equilibrium.
  • Two 2x2 games are fully equivalent when their Spohn curves are isomorphic over $\mathbb{Q}$; equal $j$-invariants are necessary but not sufficient over $\mathbb{Q}$, so twist-related curves remain an open case.

Reading between the lines

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

  • Editorial inference: because the abstract claims real density in all cases while the written theorem covers the twelve reducibility cases under genericity, a natural completion is to check the residual non-generic cases where $V_X$ can be reducible while the plane cubic is not, as in the paper's Example 3.8.
  • Editorial inference: since planar irreducibility does not imply irreducibility of the Spohn variety, the next combinatorial target suggested by this work is a direct classification of when $V_X$ itself splits, independent of the planar model.
  • Editorial inference: the continued-fraction approximation in Appendix A suggests a numerical stability test: approximate real payoffs by rationals, compute the $j$-invariant, and check whether the resulting game-equivalence classes stabilize as precision increases.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper studies the Spohn variety of totally mixed dependency equilibria for 2x2 normal-form games, which generically is an intersection of two quadrics in P3 and hence an elliptic curve. The authors eliminate one variable to obtain a plane cubic, classify when this cubic is reducible (Theorem 3.2, twelve explicit cases), and prove that under these reducibility conditions the real points of the Spohn variety are Zariski dense, assuming the remaining payoff entries are generic (Theorem 3.7). The paper also reviews algorithms for computing j-invariants of elliptic curves given as intersections of quadrics, applies them to Spohn curves, and proposes a notion of game equivalence based on the j-invariant. The proofs of the two main theorems rely heavily on computations in the companion Mathrepo [7], and the abstract states the denseness result more broadly than Theorem 3.7 establishes.

Significance. If the classification and denseness results are correct, they provide a useful and nontrivial contribution to the real algebraic geometry of dependency equilibria: the reducibility classification in Theorem 3.2 is explicit and combinatorial, and the real-point denseness statement is exactly the kind of result needed to justify passing from complex Spohn varieties to real dependency equilibria. The paper also gives a clear exposition of j-invariant computations for intersections of quadrics, with reproducible examples, and introduces an equivalence notion for 2x2 games that could stimulate further work. The authors are generally careful to distinguish generic from non-generic statements, and they provide concrete game-theoretic applications such as Proposition 2.7 and Remark 2.8. The main weakness is that the central proofs are not self-contained: they defer essential ideal decompositions, elimination computations, and component checks to the companion repository, and one headline claim in the abstract is not supported by the stated theorem.

major comments (3)
  1. [Abstract and Theorem 3.7] The abstract states that real points are dense on the Spohn curve 'in all cases', but Theorem 3.7 proves this only for the twelve reducibility cases of Theorem 3.2, and only under the assumption that all other payoff entries are generic. Example 3.8 explicitly describes reducible Spohn varieties outside those twelve cases (e.g. a12=a22) and states that there are 'no other known cases' rather than proving completeness. The denseness result for all cases is therefore not established by the manuscript, and the abstract should be weakened to match Theorem 3.7.
  2. [Section 3.1, proof of Theorem 3.2] Theorem 3.2 is the classification on which the denseness proof rests, but its proof is not self-contained. The text says 'The detailed computations can be found in [7]', the ideals J3 and J4 are dismissed with 'we can proceed similarly', and the long factors d_l and e_l in the displayed decompositions are not shown. Since a missed factor or an incorrect primary decomposition would change the list of reducibility cases, the proof as printed does not allow a reader to verify the classification independently. The authors should either reproduce the relevant decompositions (at least the minimal prime lists) or provide a certificate in the appendix that is checked in the text.
  3. [Section 3.2, proof of Theorem 3.7] The passage from real smooth points on the planar cubic C to real smooth points on the Spohn variety VX depends on unstated computational facts: 'One can check in all cases that every irreducible component has codimension 2' and the claim that for all cases except (7) the elimination ideals of the minimal primes are exactly the minimal primes of C. These checks are again deferred to [7]. Moreover, the proof invokes Proposition 3.6 for 'the generic projection between affine spaces' but then uses the specific elimination projection that forgets p22. It is not shown that this particular projection is generic enough for Proposition 3.6 to apply to each irreducible component. This is a load-bearing step in the denseness theorem and should be addressed explicitly.
minor comments (5)
  1. [Section 3.2, Lemma 3.5] In the irreducible case the proof states that 'the cubic is an elliptic curve and has real points'; an irreducible real plane cubic need not be smooth, so 'elliptic curve' should be replaced by 'irreducible cubic' unless smoothness is justified, although the existence of real points is not in question.
  2. [Section 3.1, footnote 1] There is a typo in the footnote: 'Decompostion' should be 'Decomposition'.
  3. [Appendix A, Listing 1] The code comments contain garbled spacing, e.g. 'Co nt in ue d fraction r e p r e s e n t a t i o n' and 'e v a l _ c o n t f r a c', which should be cleaned for readability.
  4. [Appendix A, final paragraph] The phrase 'contined fraction' should read 'continued fraction'.
  5. [Section 4.2, Example 4.8] The observation that affine transformations of the payoff matrices preserve the Spohn curve is useful, but it would be clearer to state explicitly that this is a symmetry of the defining quadrics and not only of the j-invariant.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the Spohn-cubic classification and real-point denseness proofs are derived from payoff entries by explicit polynomial computations; reliance on the authors' Mathrepo [7] is a verifiability issue, not a circular reduction.

full rationale

The paper's central claims (Theorem 3.2 and Theorem 3.7) are algebraic consequences of the defining equations of the Spohn variety. The coefficients c1,...,c7 of the Spohn cubic are explicit rational functions of the payoff entries, and the reducibility conditions are obtained from the factorization of f along candidate lines and the primary decomposition of ideals (di,ei). No parameter is fitted, no target quantity is reused as an input, and no result is assumed in its own proof. The j-invariant computations in Section 4 are derived from Aronhold invariants of the cubic obtained by eliminating the common point from the two quadrics; the proposed equivalence relation is defined by isomorphism of Spohn curves, not by j-invariant equality, so there is no self-definitional circularity. The main caveat is that the proofs of Theorem 3.2 and Theorem 3.7 delegate substantial computations to the authors' companion Mathrepo [7] ('The detailed computations can be found in [7]'; 'One can check in all cases that every irreducible component has codimension 2'). This is a reproducibility and trust concern, and the abstract's unconditional denseness claim goes beyond the generic-other-entries hypothesis of Theorem 3.7, but these are correctness/scope gaps rather than examples of a derivation reducing by construction to its own inputs. Accordingly no circular step is identified; the score reflects only the presence of self-citation as the authority for key computations.

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

No free parameters are fitted; payoff entries are inputs, not fitted constants. The axioms are the cited background results and the companion-repository computations. The paper introduces no new particles, forces, or conserved quantities. Definition 4.11 is a new equivalence notion but not an invented entity in the sense of a postulated object.

assumptions (5)
  • domain assumption Generic Spohn variety properties from [11, Theorems 2.4 and 2.5]: for generic games V_X is irreducible of known codimension/degree and the 2x2 Spohn variety is an elliptic curve.
    Invoked in Section 2 to motivate the study and in Proposition 2.6 for the totally mixed Nash case; these results are cited, not reproven.
  • domain assumption Real smooth point lifting criterion from [1, Proposition 5.8] (Baldi and Mourrain).
    Used in Theorem 3.7 to pull back smooth real points from the planar cubic to V_X; cited, not reproven.
  • domain assumption Konstanz matrix determinant description from [11, Theorem 19].
    Used in Proposition 2.7 to show infinitely many Pareto-dominating dependency equilibria exist.
  • ad hoc to paper Computations in companion repository [7] are correct and exhaustive (ideal decompositions, elimination ideals).
    Theorems 3.2 and 3.7 say 'detailed computations can be found in [7]' and 'one can check'; the proof is not self-contained in the text.
  • ad hoc to paper Genericity of the remaining payoff entries in Theorem 3.7.
    The denseness theorem is proven for the 12 reducibility cases 'assuming that all the other entries of the payoff tables are generic'; the abstract drops this caveat.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Elliptic curves in game theory." pith.science (2026). https://pith.science/paper/7CCMGIFU

@misc{pith2026250114612,
  author       = {Pith},
  title        = {Pith review of: Elliptic curves in game theory},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7CCMGIFU}},
  note         = {Machine review of arXiv:2501.14612}
}
abstract

We investigate Spohn curves, the algebro-geometric models of totally mixed dependency equilibria for $2 \times 2$ normal-form games. These curves arise as the intersection of two quadrics in $\mathbb{P}^3$ and are generically elliptic curves. We examine the reduction of Spohn curves to plane curves, providing a full classification of conditions under which they are reducible. Notably, we prove that the real points are dense on the Spohn curve in all cases, which is relevant for applications. These computations are further supported by Macaulay2 and stored in Mathrepo. We review methods to compute the $j$-invariants of elliptic curves arising as the intersection of quadrics in $\mathbb P^3$ which we apply to the case of Spohn curves aimed at game theorists. We propose a definition of equivalence of generic $2\times 2$ games based on the $j$-invariant of the Spohn curve.

Figures

Figures reproduced from arXiv: 2501.14612 by the authors.

Figure 1
Figure 1. For a polynomial f (m) lk , the dots on the left side in A represent the variables aij appearing in f (m) lk . The lines on the right side of the same color in B represent the two variables bij that occur in the same monomial as aij within f (m) lk . For example, the yellow line in B for f (9) 11 represents the monomials a12b12 and a12b22 in f (9) 11 . There is only one way (up to sign) to arrange monomials in f (m)… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The GameTheory package for Macaulay2

    math.AG 2025-07 conditional novelty 6.0 of 10

    A new Macaulay2 package computes Nash, correlated, dependency, and conditional independence equilibria for finite normal-form games using algebraic geometry and polyhedral methods.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages · cited by 1 Pith paper

  1. [12]

    Portakal, D

    I. Portakal, D. Windisch: Dependency equilibria: boundary cases and their real algebraic geometry, Advances in Applied Mathematics vol. 168 , 2025

    work page 2025

  2. [7]

    Kidambi, E

    A. Kidambi, E. Neuhaus, I. Portakal: MathRepo for Elliptic Curves in Game Theory, https://mathrepo.mis.mpg.de/elliptic_curves_game_theory/

    work page

  3. [1]

    Baldi, B

    L. Baldi, B. Mourrain: Computing real radicals by moment optimization, Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation , 2021

    work page 2021

  4. [2]

    Brady: https://www.notzeb.com/aronhold.html, Last accessed: July 1, 2025

    Z.E. Brady: https://www.notzeb.com/aronhold.html, Last accessed: July 1, 2025

    work page 2025

  5. [3]

    Chan: https://www.math.brown.edu/mchan2/j_formula.txt, Last accessed: July 1, 2025

    M. Chan: https://www.math.brown.edu/mchan2/j_formula.txt, Last accessed: July 1, 2025

    work page 2025

  6. [4]

    Cohen: Number theory: Volume I: Tools and Diophantine Equations, Graduate Texts in Mathematics, vol

    H. Cohen: Number theory: Volume I: Tools and Diophantine Equations, Graduate Texts in Mathematics, vol. 239, Springer , 2007

    work page 2007

  7. [5]

    Das: Computational number theory, Discrete Mathematics and Its Applications, CRC Press , 2013

    A. Das: Computational number theory, Discrete Mathematics and Its Applications, CRC Press , 2013

    work page 2013

  8. [6]

    Grayson, M

    D. Grayson, M. Stillman: Macaulay 2, a software system for research in algebraic geometry, available at https://macaulay2.com/

    work page

Show all 18 references
  1. [8]

    H. Knaf, E. Selder, K. Spindler: Explicit transformation of an intersection of two quadrics to an elliptic curve in Weierstraß form, arXiv:1906.10230, 2019

    1906 arXiv

  2. [9]

    Mangolte: Real algebraic varieties, Springer Monographs in Mathematics, Springer , 2020

    F. Mangolte: Real algebraic varieties, Springer Monographs in Mathematics, Springer , 2020

    2020

  3. [10]

    Bordeaux, 2024, http://pari.math.u-bordeaux.fr/

    The PARI Group: PARI/GP version 2.17.1, Univ. Bordeaux, 2024, http://pari.math.u-bordeaux.fr/

    2024

  4. [11]

    Portakal, B

    I. Portakal, B. Sturmfels: Geometry of dependency equilibria, Rendiconti dell’Istituto di Matematica dell’Universit` a di Trieste, vol. 54 (5), 2022

    2022

  5. [13]

    Spohn: Dependency equilibria and the causal structure of decision and game situations, Homo Oeconomicus 20, 195–255, 2003

    W. Spohn: Dependency equilibria and the causal structure of decision and game situations, Homo Oeconomicus 20, 195–255, 2003

    2003

  6. [14]

    Spohn: Dependency equilibria, Philosophy of Science 74 , 775–789, 2007

    W. Spohn: Dependency equilibria, Philosophy of Science 74 , 775–789, 2007

    2007

  7. [15]

    Silverman: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol

    J. Silverman: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol. 106, Springer , 2009

    2009

  8. [16]

    Sturmfels: Algorithms in Invariant Theory, Texts And Monographs In Symbolic Computation, Springer , 2008

    B. Sturmfels: Algorithms in Invariant Theory, Texts And Monographs In Symbolic Computation, Springer , 2008

    2008

  9. [17]

    Sturmfels: Solving Systems of Polynomial Equations, CBMS Regional Conference Series in Mathematics, vol

    B. Sturmfels: Solving Systems of Polynomial Equations, CBMS Regional Conference Series in Mathematics, vol. 97, American Mathematical Society , 2002

    2002

  10. [18]

    Wolfram Research, Inc.: Mathematica, Version 14.1, Champaign, IL , 2024, https://www.wolfram.com/ mathematica. Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany Email address: kidambi@mis.mpg.de Max Planck Institute for Mathematics in...

    2024

Pith tools

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