REVIEW 1 major objections 5 minor 8 references
The matrix potential game and structures of self-affine sets
T0 review · 1 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash
Pith's one-line read A new matrix potential game proves the RCO and RCD self-affine carpets are winning; strong winning conditions imply non-emptiness, dimension lower bounds, and homothetic copies of every finite pattern.
desk verdict A promising new game for self-affine sets, but Theorem 5.2's dimension bound is vacuous as stated; referee it for the framework, not the current examples. 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 central object is the matrix potential game. Player I plays nested boxes $A^m(B[0,l])+b$, where $A$ is a diagonal matrix with entries $\beta_{11},\dots,\beta_{nn}\in(0,1)$; Player II replies with at most countable collections of smaller boxes $A^q(B[0,r])+y$. A reply at level $m$ is legal when the weighted sum $\sum_i(\prod_{j=1}^n\beta_{jj}^{q_{i,j}})^c$ is at most $(\alpha\prod_{j=1}^n\beta_{jj}^m)^c$. A set is winning if Player II can keep the outcome out of the deleted region unless it lies in the set. The paper's certification device is a strategy-defining iterative covering (SDIC): a covering of the complement by such boxes satisfying (SDIC 1) and a local weighted-count bound (SDIC
What would settle it
For a fixed RCD(U,V) construction and a fixed level k, enumerate all choices of corner positions and all centers z, and compute the maximum over z of the number of level-k rectangles $T_\omega$ that meet $A^k_{U,V}(B[0,1])+z$. If this maximum exceeds 9, Proposition 4.5's SDIC 2 bound is false and the stated $\alpha(c,t)$ is not a valid winning parameter; the same check applies to RCO with the bound $9m$.
Extended reading notes
Core claim
The paper claims that a new game, the matrix potential game, can certify winning sets far beyond the reach of previous potential games. A set is winning when Player II can answer every nested sequence of anisotropic boxes so that the outcome lies in the set (or escapes the initial region). The RCO family (iteratively removing rectangles from a grid) and the RCD family (Moran sets whose rectangles sit at corners of larger rectangles) are shown to be winning with explicit parameters $\alpha(c)$ and $\alpha(c,t)$. The main theorem, Theorem 5.2, states that if all diagonal entries $\beta_{jj}$ of the defining matrix lie in $(0,1/5)$ and condition (8) holds for some $\eta\in(0,1)$, then every win
Load-bearing premise
In the verification that the complement-covering satisfies the game's local weighted-count bound, the argument relies on an unproved visual assertion: any level-$k$ box meets at most nine level-$k$ rectangles in the RCD construction, and at most $9m$ in the RCO construction; if that count is wrong for some corner arrangement, the computed winning parameter is too small and the non-emptiness and pattern theorems no longer follow.
Editorial extensions
If this is right
- If Theorem 5.2's hypotheses hold, every winning set has non-empty intersection with every initial box $A(B[0,\zeta_2])+y$, and that intersection has Hausdorff dimension at least $\max\{n-K_1/(\beta|\log\beta_{\max}|),0\}$.
- RCO and RCD self-affine sets are winning for explicit parameters; for large $U,V$ these parameters satisfy the small-alpha hypotheses, so the intersection of several such sets is non-empty and has dimension numerically close to 2 (for instance above $1.9999$ in the paper's examples).
- For every $M\in\mathbb{N}$, all sufficiently large $U$ give RCD$(U,U+\ell)$ sets that contain homothetic copies of every set with at most $M$ elements; the same holds for totally disconnected affine IFS attractors.
- Countable intersections of winning sets are winning with parameter $(\sum_j\alpha_j^c)^{1/c}$, so the dimension lower bound transfers to intersections of countably many self-affine carpets.
Reading between the lines
- The 'at most nine' rectangle-intersection count used to verify SDIC 2 is likely not sharp; replacing it by the exact maximum would shrink $\alpha(c,t)$ and relax the small-alpha hypotheses, potentially bringing pattern theorems into smaller parameter ranges.
- The SDIC certification strategy is not specific to $\mathbb{R}^2$ or uniform diagonal ratios; analogous bounds for higher-dimensional self-affine carpets or variable-contraction Moran constructions would transfer the non-emptiness, dimension, and pattern results.
- Because the numerical pattern examples use very large $U,V$ to satisfy (13), sharpening Claim B or optimizing $c,\eta$ could lower the parameter sizes and increase the achievable $M$ for realistic carpets.
- The intersection results are natural tools for problems on multiple base expansions or digit restrictions, where self-affine winning sets arise; checking the SDIC bounds for those sets would yield dimension and pattern statements of the same type.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a 'matrix potential game', a variant of potential games adapted to diagonal affine contractions, and proves several structural results for winning sets: countable intersections (Lemma 3.3), a general strategy for showing closed sets are winning via 'strategy defining iterative coverings' (Proposition 4.1), applications to two families of self-affine sets (RCO and RCD, Propositions 4.3 and 4.5), a Hausdorff dimension lower bound for winning sets (Theorem 5.2), and a theorem on existence of homothetic copies of finite sets (Theorem 6.1). The paper also gives numerical examples claiming dimension bounds close to 2 and pattern/intersection conclusions.
Significance. The matrix potential game and the SDIC machinery are genuinely new and could be useful tools for self-affine sets with zero thickness, where earlier Schmidt-game and thickness techniques do not apply. The countable intersection lemma is clean, and the idea of encoding self-affine coverings as winning strategies is promising. However, the central dimension-theoretic result — which drives the pattern and intersection applications — is not supported as stated: under the theorem's own hypotheses the displayed lower bound is vacuous, and the claimed numerical dimension bounds in Sections 6.5 and 6.6 directly contradict the theorem. The paper's framework may be salvageable by correcting a missing factor in K1, but as it stands the main advertised results do not follow.
major comments (1)
- [Theorem 5.2, Eqs. (8)–(9)] The dimension lower bound in Theorem 5.2 is vacuous under its own hypotheses. Let C = 3^{-n}∏(1-5β_jj^N) − 8n(1+2^{2n+1})η. Condition (8) says C>0. Since the product is <1 and the subtracted term is positive, C < 3^{-n}; hence |log C| ≥ n log 3. In particular K1 = 2η^{-1}|log C| ≥ 2n η^{-1} log 3. Condition (8) also gives η < 3^{-n}/(8n(1+2^{2n+1})), so for n=2, η^{-1} > 8·2·(1+2^5)·3^2 = 4752, and K1 > 2·4752·log 3 ≈ 2.09×10^4. For the parameters in Examples 6.5–6.6, |log β_max| is at most about 27.6 (and often much smaller), so K1/|log β_max| ≫ 2 and max{2 − K1/|log β_max|, 0} = 0. This directly contradicts the reported dim_H ≥ 1.99999 in Examples 6.5 and 6.6. The source appears to be a missing factor of α in K1: in the Moran construction each block has N ≈ η/α levels, so the dimension correction should be proportional to α/η, not 1/η. As printed, Theorem 5.2, Corollary 5.3, Corollary
minor comments (5)
- [Proposition 4.5, SDIC 2] The assertion that a level-k box A^k(B[0,1])+z intersects at most nine level-k rectangles T_ω is stated 'by inspection'. A short geometric proof should be supplied, since the bound is load-bearing for the value of α(c,t) in Eq. (6). While the bound is plausible (each coordinate can meet at most two cells), the paper should justify it explicitly, especially because the hierarchical cells have side length U/(U−1) times the test box side.
- [References and cross-references] There are several incorrect cross-references: 'Theorem 4.2' should be 'Example 4.2'; 'Theorem 4.3' and 'Theorem 4.5' should be 'Proposition 4.3' and 'Proposition 4.5'; 'Theorem 6.7' should be 'Corollary 6.7'. The acknowledgements contain the typo 'additioanlly'.
- [Example 6.8] In the first bullet, 'U = 2 37' and 'V = 2 36' appear to be typos for 237 and 236 (matching Example 6.6). Please clarify.
- [Examples 6.5–6.6] The phrase 'using numerical methods to find the optimum values of c and η' is not accompanied by the chosen values or reproducible code. Since the resulting dimension and pattern claims are quantitative, the paper should list the (c,η) pairs used or provide a small verification script.
- [Equation (7)] The formula for N_t is typeset with ⌈·⌉; please make the ceiling notation uniform and clearer, and define all terms before first use.
Circularity Check
No significant circularity: the winning parameters are computed from covering geometry and the dimension/pattern theorems take them as inputs.
full rationale
The paper's derivation chain is self-contained with respect to its game-theoretic framework. The winning parameters alpha(c) and alpha(c,t) in Propositions 4.3 and 4.5 are explicit functions of the covering geometry — the overlap counts 9m and 9(U-1)(V-1)N_t and the contraction scale (UV)^{-t} — obtained by verifying SDIC 2, not by fitting to the non-emptiness, dimension, or pattern conclusions. Theorem 5.2 then takes these computed alphas as inputs together with a freely chosen eta satisfying condition (8), and the dimension lower bound is obtained from an external Moran-set dimension theorem (Refs [11,12]); the theorem's conclusion is not used to choose alpha or eta. The pattern and intersection results (Theorem 6.1, 6.3, Corollary 6.7) are applications of Theorem 5.2 after verifying the inequalities in (13), again using the previously computed alphas. No load-bearing self-citation or imported uniqueness theorem appears; the cited external results are standard Moran-set dimension bounds. The skeptic's concern that K1 may make the dimension bound vacuous for the numerical examples is a potential correctness issue, not a circularity, since it does not identify any conclusion that is fed back into the hypotheses. The unresolved cross-reference '??4.2??4.4' is a manuscript defect, not circularity.
Assumptions & free parameters
assumptions (3)
- standard math Hausdorff dimension and covering properties of Moran-type sets as in Falconer's fractal geometry and references [11] and [12].
- domain assumption The contraction matrix A is diagonal with entries in (0,1), and the main theorem restricts to entries in (0,1/5).
- domain assumption A level-k box A^k(B[0,1])+z intersects at most nine level-k rectangles T_omega in the RCD construction, and at most 9m removed rectangles in the RCO construction.
Cite this review
Pith. "Pith review of The matrix potential game and structures of self-affine sets." pith.science (2026). https://pith.science/paper/5HGYB4G5
@misc{pith2026250811577,
author = {Pith},
title = {Pith review of: The matrix potential game and structures of self-affine sets},
year = {2026},
howpublished = {\url{https://pith.science/paper/5HGYB4G5}},
note = {Machine review of arXiv:2508.11577}
}
abstract
We present a new variant of the potential game and show that certain compact subsets of $\mathbb{R}^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are non-empty, provide a lower bound for their Hausdorff dimension, show that they have good intersection properties, and provide conditions under which, given $M \in \mathbb{N}$, they contain a homothetic copy of every set with at most $M$ elements. The applications of our game to self-affine sets are new and complement the recent work of Yavicoli et al (Math. Z. 2022 and Int. Math. Res. Not. IMRN 2023) for self-similar sets.
Reference graph
Works this paper leans on
-
[1]
On finitely many base $q$ expansions
S. Baker and G. Bender. On finitely many baseqexpansions, 2025. Available at arXiv:2501.09582
work page Pith review arXiv 2025
-
[2]
R. Broderick, L. Fishman, and D. Simmons. Quantitative results using variants of Schmidt’s game: dimension bounds, arithmetic progressions, and more.Acta Arith., 188(3):289–316, 2019
work page 2019
-
[3]
V. Chan, I. Laba, and M. Pramanik. Finite configurations in sparse sets.J. Anal. Math., 128:289–335, 2016
work page 2016
-
[4]
K. Falconer.Fractal geometry - mathematical foundations and applications.John Wiley & Sons, Ltd., Chichester, 1990
work page 1990
-
[5]
Falconer.Techniques in fractal geometry
K. Falconer.Techniques in fractal geometry. John Wiley & Sons, Ltd., Chichester, 1997
work page 1997
-
[6]
K. Falconer and A. Yavicoli. Intersections of thick compact sets inR d.Math. Z., 301(3):2291–2315, 2022
work page 2022
-
[7]
L. Fishman, D. Simmons, and M. Urba´ nski. Diophantine approximation and the geometry of limit sets in Gromov hyperbolic metric spaces.Mem. Amer. Math. Soc., 254, 2018
work page 2018
-
[8]
J. E. Hutchinson. Fractals and self similarity.Indiana Univ. Math. J., 30:713–747, 1981. 16 Before presenting the proof of Claim B we state and prove Theorem A.4. Lemma A.4.Let k2N be such that k6 1 modN and let T2E k+1. If z is the element of Ek such that k(T) =A k(B[0; ]) +z, thenT 2 1Ak(B[0; ]) +z. Proof.For eachT2E k+1, we have that T=A k+1(B[0; ]) + ...
work page 1981
Reviewed August 5, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.