Pith. sign in

REVIEW 3 minor 29 references

Discrete Unique Continuation on Simplex

T0 review · 0 major / 3 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read A single nonzero value at the center of a lattice simplex forces a support lower bound of order $R^{\lceil n/2\rceil}$, and this growth rate is optimal.

desk verdict A clean, self-contained optimal support bound for a simplex unique continuation system; the proof is sound and the scope is honestly narrow. read the letter →

arxiv 2608.02707 v1 pith:TVE3QJT4 submitted 2026-08-03 math-ph math.APmath.MP

Linjun Li This is my paper · ORCID
classification math-phmath.APmath.MP
keywords discreteuniquecontinuationlatticesimplexsupportcardinalityPascaluncertaintyprinciplefactorialnormalizationoptimalexponentorientedrelationsrandomSchrödingerlocalization
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

This paper proves a discrete analog of unique continuation on the integer points of an $n$-dimensional simplex of side length $R$. If a function on the simplex satisfies a complete system of $n$-term oriented-simplex relations and takes a nonzero value at the balanced center, then its support must contain at least a constant times $R^{\lceil n/2\rceil}$ points, where the constant depends only on $n$. Explicit constructions show that the exponent cannot be improved, so the bound is optimal. This matters because support-cardinality lower bounds are the kind of geometric input used in proofs of localization for random Schrödinger operators on lattices, where literal unique continuation fails.

What carries the argument

The load-bearing mechanism is the tensorized Pascal uncertainty principle: if a polynomial $p$ in $d$ variables has a nonzero coefficient for the monomial $x^\kappa$, then the total number of supported monomials across all $2^d$ partial unit shifts is at least $\prod_i(\kappa_i+2)$. It is built from a one-variable two-shift bound obtained from the rank of Pascal submatrices, and it converts a single deep monomial on a coordinate facet into many boundary monomials on pairs of coordinate facets. Two additional mechanisms carry the full argument: factorial normalization, which turns the simplex relations into the single equation $DF=0$ for $D=\partial_{z_1}+\cdots+\partial_{z_n}$ and gives translation invariance along the diagonal, and a shell decomposition by simultaneous derivatives in all variables, which sums the fixed-scale boundary estimate over disjoint shells to produce the final exponent.

What would settle it

A direct check is to search for a two-variable polynomial $p$ with $[xy]p\neq 0$ whose four unit-shifted versions have total support size below $9$; Lemma 5.1 with $\kappa=(1,1)$ requires at least $9$. A counterexample would disprove the key lemma, and a failure there would remove the foundation of the main theorem's proof.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.1: for integers $n\ge 2$ and $R\ge 1$, every function $g$ on $\Delta_{nR}^{(n)}$ satisfying $\sum_{i=1}^n g(\beta+e_i)=0$ for all $\beta\in\Delta_{nR-1}^{(n)}$ and with $g(R,\dots,R)\neq 0$ must have $|\operatorname{supp} g|\ge c_n R^{\lceil n/2\rceil}$. The proof gives an explicit constant for $n\ge 3$, and for $n=2$ it gives the exact value $|\operatorname{supp} g|=2R+1$. The paper also proves optimality by constructing explicit products of coordinate differences with nonzero balanced coefficient whose support has size of order $R^{\lceil n/2\rceil}$.

Load-bearing premise

The entire proof rests on the tensorized Pascal uncertainty principle: a single nonzero monomial coefficient forces the total monomial count across all partial unit shifts to be at least the product of the shifted exponents plus two, and if that induction step failed, the boundary lower bound and the final exponent would not follow.

Editorial extensions

If this is right

  • For every fixed dimension $n$, nonvanishing at the balanced point forces at least $c_n R^{\lceil n/2\rceil}$ nonzero values, with an explicit constant for $n\ge 3$.
  • The exponent $\lceil n/2\rceil$ is sharp: there are admissible functions whose support is only of order $R^{\lceil n/2\rceil}$.
  • The $n=2$ case is exactly $2R+1$: every point of the simplex is forced to be nonzero.
  • The $n=3$ case recovers the quadratic triangular-lattice support bound previously used as a discrete unique-continuation input for random Schrödinger localization.
  • The boundary estimate that feeds the proof already shows that two specified coordinate facets together contain many forced monomials, before shells are summed.

Reading between the lines

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

  • Editorial inference: the same tensorized Pascal mechanism is likely to give support bounds for monomials assumed deep at interior points other than the balanced center, with the bound depending on the minimum exponent.
  • Editorial inference: the factorial normalization and shell summation might transfer to other finite difference relations whose characteristic variety is a single direction, yielding sharp support exponents for related lattice systems.
  • Editorial inference: because the proof uses only monomial counting, it may extend to positive-weight support measures, not just cardinality, if the one-variable two-shift inequality holds with the appropriate weights.
  • Editorial inference: a direct computational search for small $R$ in the three-variable case could test how close true minimal supports come to the explicit constant, a comparison not carried out in the paper.
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

0 major / 3 minor

Summary. The paper studies functions g on the lattice simplex Δ^{(n)}_{nR}, n≥2, R≥1, satisfying the complete oriented-simplex relations Σ_{i=1}^n g(β+e_i)=0 for all β of degree nR−1. Its main result (Theorem 2.1) states that if the balanced value g(R,...,R) is nonzero, then |supp g| ≥ c_n R^{⌈n/2⌉}, with an explicit constant for n≥3 and the stronger exact statement |supp g|=2R+1 for n=2; it also constructs examples showing that the exponent is optimal. The proof normalizes g to a homogeneous polynomial F in ker D, proves a two-shift Pascal uncertainty bound via a rank lemma established by the Lindström–Gessel–Viennot lemma (Lemmas 4.1–4.2), tensorizes it (Lemma 5.1), converts it into a two-facet monomial boundary estimate (Proposition 6.1), and sums this estimate over disjoint derivative shells (Section 7).

Significance. If correct, the paper gives a self-contained discrete unique-continuation inequality with the optimal exponent for all n, extending the n=3 triangular estimate of Li–Zhang to arbitrary dimension by a purely algebraic argument. The proof is modular, gives explicit constants, and is accompanied by explicit optimality constructions. The LGV-based rank lemma and the tensorized Pascal uncertainty principle are natural and generalize cleanly. I also note the paper's honest scope statement that the simplex system is not identified with an arbitrary discrete Schrödinger equation; this limits immediate physical application but does not affect the validity of the theorem. The self-cited localization results are used for context and for the n=3 remark, not as input to the general proof, so the argument is not circular.

minor comments (3)
  1. [§2 detailed overview and §6 Proposition 6.1] The symbol ℓ_d is typeset ambiguously; it should be declared explicitly as floor(d/2) in both the detailed proof overview and in Proposition 6.1, so that θ=d−ℓ_d equals ceil(d/2) and the final exponent is immediately unambiguous.
  2. [Abstract and Acknowledgments] The disclosure of the AI tool in the abstract is unusual for a mathematical paper; consider moving this information to the acknowledgments or to a reproducibility statement so that it does not distract from the mathematical content.
  3. [References] Several references appear with future or very recent dates (for example [22], [29], [20]); please update publication statuses if they have appeared in final form.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 2.1 is proved from the defining relations via self-contained algebraic lemmas.

full rationale

The paper's central lower bound is genuinely derived rather than assumed. The factorial normalization in Lemma 3.1 converts the assumed simplex relations exactly into the differential identity DF = 0 while preserving support and the nonzero balanced coefficient; the lower bound is then obtained from the rank-based Pascal uncertainty principle in Lemma 4.2, its tensorized induction in Lemma 5.1, the dehomogenization and two-facet estimates in Proposition 6.1, and the disjoint shell decomposition in Section 7. None of these steps invokes the theorem being proved, and no fitted parameter or experimental input is renamed as a prediction. The self-citations ([18], [21], [22], [23]) appear only in the introduction and in the contextual Remark 2.2 identifying the n = 3 case with the Li–Zhang triangle; they do not supply any equation used in the general proof, so they are not load-bearing. The optimality constructions in Proposition 8.1 are explicit kernel polynomials whose annihilation and support sizes are checked directly from the definitions. There is no step where an input is equivalent to the output by construction, and the derivation is self-contained against the stated assumptions; hence the circularity score is 0.

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

The central claim rests only on the defining relations and standard combinatorial identities. No free parameters are fitted, and no new entities are introduced. The proof's constants are explicit functions of n.

assumptions (3)
  • standard math Lindstrom-Gessel-Viennot lemma (cited [24,14]) for planar directed acyclic networks
    Imported in Lemma 4.1 to show Pascal submatrices have rank equal to maximum matching size; this rank statement is the foundation of the one-variable Pascal uncertainty principle.
  • standard math Standard binomial identities and factorial normalization
    Used throughout (Lemma 3.1, Equation (13), Section 8) without proof; standard algebraic manipulation.
  • domain assumption The defining simplex relation (1) is taken as the problem hypothesis
    The theorem concerns functions satisfying the complete oriented-simplex sums; this is the object of study, not an ad hoc postulate.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Discrete Unique Continuation on Simplex." pith.science (2026). https://pith.science/paper/TVE3QJT4

@misc{pith2026260802707,
  author       = {Pith},
  title        = {Pith review of: Discrete Unique Continuation on Simplex},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TVE3QJT4}},
  note         = {Machine review of arXiv:2608.02707}
}
abstract

For integers $N\ge0$ and $n\ge2$, let \[ \Delta_N^{(n)} =\left\{\alpha\in\mathbb Z_{\ge 0}^n: \alpha_1+\cdots+\alpha_n=N\right\}. \] We formulate a discrete unique-continuation problem on this lattice simplex. Given an integer $R\ge1$, consider a function $g:\Delta_{nR}^{(n)}\to\mathbb R$ satisfying the complete oriented-simplex relations \[ \sum_{i=1}^n g(\beta+e_i)=0, \qquad \beta\in\Delta_{nR-1}^{(n)}, \] where $e_i$ is the $i$th standard basis vector. We prove that a nonzero value at the balanced point forces the support-cardinality estimate with optimal growth exponent: if $g(R,\ldots,R)\neq 0$, then $|\operatorname{supp}(g)|\ge c_n R^{\lceil n/2\rceil}$. Here $c_n>0$ depends only on $n$. The key input is a \emph{Pascal uncertainty principle}. After factorial normalization, the simplex relations become a single directional differential equation. A nonzero balanced coefficient then produces a monomial whose relevant facet-chart exponents are all large, while the tensorized Pascal uncertainty principle prevents the coefficient supports in all partially shifted affine charts from being simultaneously sparse. Comparing those charts with two coordinate facets and summing over disjoint derivative shells gives the lower bound. Explicit constructions show that the exponent $\lceil n/2\rceil$ is optimal. The proof was obtained through human-guided discovery and exploration with the assistance of GPT-5.6 Sol.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

29 extracted references · 25 canonical work pages

  1. [1]

    Aizenman and S

    M. Aizenman and S. Molchanov,Localization at large disorder and at extreme energies: an elementary derivation, Comm. Math. Phys.157(1993), no. 2, 245–278

    work page 1993

  2. [2]

    P. W. Anderson,Absence of diffusion in certain random lattices, Phys. Rev.109(1958), no. 5, 1492–1505

    work page 1958

  3. [3]

    Bourgain and C

    J. Bourgain and C. E. Kenig,On localization in the continuous Anderson–Bernoulli model in higher dimension, Invent. Math.161(2005), no. 2, 389–426

    work page 2005

  4. [4]

    Bucaj, D

    V. Bucaj, D. Damanik, J. Fillman, V. Gerbuz, T. VandenBoom, F. Wang, and Z. Zhang,Localization for the one-dimensional Anderson model via positivity and large deviations for the Lyapunov exponent, Trans. Amer. Math. Soc.372(2019), no. 5, 3619–3667

    work page 2019

  5. [5]

    Buhovsky, A

    L. Buhovsky, A. Logunov, E. Malinnikova, and M. Sodin,A discrete harmonic function bounded on a large portion ofZ 2 is constant, Duke Math. J.171(2022), no. 6, 1349–1378

    work page 2022

  6. [6]

    Carmona, A

    R. Carmona, A. Klein, and F. Martinelli,Anderson localization for Bernoulli and other singular potentials, Comm. Math. Phys.108(1987), no. 1, 41–66

    work page 1987

  7. [7]

    Damanik, R

    D. Damanik, R. Sims, and G. Stolz,Localization for one-dimensional, continuum, Bernoulli–Anderson models, Duke Math. J.114(2002), no. 1, 59–100

    work page 2002

  8. [8]

    Ding and C

    J. Ding and C. K. Smart,Localization near the edge for the Anderson Bernoulli model on the two dimensional lattice, Invent. Math.219(2020), no. 2, 467–506

    work page 2020

Show all 29 references
  1. [9]

    Drogin,Localization of one-dimensional random band matrices, arXiv:2508.05802 (2025)

    R. Drogin,Localization of one-dimensional random band matrices, arXiv:2508.05802 (2025)

    2025 arXiv

  2. [10]

    Elboim, A

    D. Elboim, A. Gloria, and F. Hern´ andez,Diffusivity of the Lorentz mirror walk in high dimensions, arXiv:2505.01341 (2025)

    2025 arXiv

  3. [11]

    Fr¨ ohlich, F

    J. Fr¨ ohlich, F. Martinelli, E. Scoppola, and T. Spencer,Constructive proof of localization in the Anderson tight binding model, Comm. Math. Phys.101(1985), no. 1, 21–46

    1985

  4. [12]

    Fr¨ ohlich and T

    J. Fr¨ ohlich and T. Spencer,Absence of diffusion in the Anderson tight binding model for large disorder or low energy, Comm. Math. Phys.88(1983), no. 2, 151–184

    1983

  5. [13]

    Germinet and A

    F. Germinet and A. Klein,A comprehensive proof of localization for continuous Anderson models with singular random potentials, J. Eur. Math. Soc.15(2013), no. 1, 53–143

    2013

  6. [14]

    Gessel and G

    I. Gessel and G. Viennot,Binomial determinants, paths, and hook length formulae, Adv. Math.58(1985), no. 3, 300–321

    1985

  7. [15]

    C. E. Kenig, L. Silvestre, and J.-N. Wang,On Landis’ conjecture in the plane, Comm. Partial Differential Equations40(2015), no. 4, 766–789

    2015

  8. [16]

    S. T. Krymskii,On the lowest possible dimension of supports of solutions to the discrete Schr¨ odinger equation, arXiv:2401.02800 (2024)

    2024 arXiv

  9. [17]

    Kunz and B

    H. Kunz and B. Souillard,Sur le spectre des op´ erateurs aux diff´ erences finies al´ eatoires, Comm. Math. Phys.78 (1980), no. 2, 201–246

    1980

  10. [18]

    Li,Anderson–Bernoulli localization at large disorder on the 2D lattice, Comm

    L. Li,Anderson–Bernoulli localization at large disorder on the 2D lattice, Comm. Math. Phys.393(2022), no. 1, 151–214

    2022

  11. [19]

    Li,Polynomial bound for the localization length of the Lorentz mirror model on the 1D cylinder, arXiv:2010.05900v3 (2026)

    L. Li,Polynomial bound for the localization length of the Lorentz mirror model on the 1D cylinder, arXiv:2010.05900v3 (2026)

    2026 arXiv

  12. [20]

    Li,On the Manhattan pinball problem, Electron

    L. Li,On the Manhattan pinball problem, Electron. Commun. Probab.26(2021), Paper No. 25, 11 pp

    2021

  13. [21]

    Li,Anderson–Bernoulli localization on 2D and 3D lattice, Ph.D

    L. Li,Anderson–Bernoulli localization on 2D and 3D lattice, Ph.D. thesis, University of Pennsylvania, 2022

    2022

  14. [22]

    Li,On support cardinality for the discrete Schr¨ odinger equation, Lett

    L. Li,On support cardinality for the discrete Schr¨ odinger equation, Lett. Math. Phys.116(2026), no. 4, Paper No. 90

    2026

  15. [23]

    Li and L

    L. Li and L. Zhang,Anderson–Bernoulli localization on the three-dimensional lattice and discrete unique continu- ation principle, Duke Math. J.171(2022), no. 2, 327–415

    2022

  16. [24]

    Lindstr¨ om,On the vector representations of induced matroids, Bull

    B. Lindstr¨ om,On the vector representations of induced matroids, Bull. London Math. Soc.5(1973), no. 1, 85–90

    1973

  17. [25]

    Logunov, E

    A. Logunov, E. Malinnikova, N. Nadirashvili, and F. Nazarov,The Landis conjecture on exponential decay, Invent. Math.241(2025), no. 2, 465–508. 16

    2025

  18. [26]

    V. Z. Meshkov,On the possible rate of decay at infinity of solutions of second order partial differential equations, Math. USSR-Sb.72(1992), no. 2, 343–361

    1992

  19. [27]

    Shubin, R

    C. Shubin, R. Vakilian, and T. Wolff,Some harmonic analysis questions suggested by Anderson–Bernoulli models, Geom. Funct. Anal.8(1998), no. 5, 932–964

    1998

  20. [28]

    Wegner,Bounds on the density of states in disordered systems, Z

    F. Wegner,Bounds on the density of states in disordered systems, Z. Phys. B44(1981), 9–15

    1981

  21. [29]

    Yau and J

    H.-T. Yau and J. Yin,Delocalization of one-dimensional random band matrices, arXiv:2501.01718 (2025). Independent Researcher, New York, NY, USA Email address:linjunhomework@gmail.com 17

    2025 arXiv

Pith tools

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