arxiv: 2604.08496 · v1 · submitted 2026-04-09 · 🧮 math.SP · math-ph· math.DS· math.MP

Recognition: 2 theorem links

· Lean Theorem

Johnson-Schwartzman Gap Labelling for Metric and Discrete Decorated Graphs

Gilad Sofer, Ram Band

Pith reviewed 2026-05-10 17:06 UTC · model grok-4.3

classification 🧮 math.SP math-phmath.DSmath.MP

keywords Johnson-Schwartzman gap labellingSchrödinger operatorsdecorated graphsintegrated density of statesuniquely ergodic dynamical systemsspectral gapsmetric graphsdiscrete graphs

0 comments

The pith

Schrödinger operators on decorated graphs from uniquely ergodic systems obey Johnson-Schwartzman gap labelling.

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

The paper proves that the integrated density of states takes values from a specific set at the spectral gaps of Schrödinger operators on metric and discrete decorated graphs built from uniquely ergodic one-dimensional dynamical systems. This extends the classical Johnson-Schwartzman theorem to graphs that may contain cycles, where traditional Sturm oscillation theory no longer applies and different spectral methods are used instead. A sympathetic reader would care because the result shows which gap labels remain possible when the underlying geometry becomes more complex than a simple line. The authors also demonstrate that the integrated density of states can be discontinuous and that graph geometry can close gaps even for labels that the theorem permits.

Core claim

We prove Johnson-Schwartzman gap-labelling theorems for Schrödinger operators on both metric and discrete decorated graphs arising from uniquely ergodic one-dimensional dynamical systems. These theorems identify the admissible values of the integrated density of states at spectral gaps. Because the graphs may contain cycles, the proofs rely on spectral methods other than Sturm oscillation theory. We further show that the integrated density of states can exhibit discontinuities for some families of such graphs and that not every admissible label corresponds to an open spectral gap, with the gap closing driven by the graph geometry rather than by the underlying dynamics.

What carries the argument

The Johnson-Schwartzman gap-labelling theorem, which determines the possible values of the integrated density of states at spectral gaps from the ergodic invariants of the underlying dynamical system.

If this is right

The admissible gap labels remain exactly those furnished by the underlying one-dimensional dynamical system.
Cycles in the graph do not change the allowed labels but necessitate new proof techniques.
The integrated density of states can be discontinuous at certain energies for specific families of decorated graphs.
Graph geometry supplies an independent mechanism that can close a gap even when its label is admissible.
The gap-labelling statement holds separately in the metric-graph setting and in the discrete-graph setting.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same labelling relation may persist when the construction is extended to graphs generated by higher-dimensional or non-uniquely ergodic systems.
Explicit computation of the integrated density of states on a finite but large decorated graph could be used to test the predicted labels numerically.
The geometric gap-closing mechanism suggests a way to engineer spectra on graphs by adjusting edge lengths or vertex decorations without changing the potential.
The results connect the spectral theory of quantum graphs to classical one-dimensional ergodic Schrödinger operators, offering a route to import techniques from either side.

Load-bearing premise

That alternative spectral methods can replace Sturm oscillation theory and establish the gap labelling uniformly for decorated graphs that contain cycles.

What would settle it

A concrete counterexample: a uniquely ergodic one-dimensional dynamical system together with its associated decorated graph in which the integrated density of states evaluated at a gap takes a numerical value outside the set of labels predicted by the Johnson-Schwartzman theorem.

Figures

Figures reproduced from arXiv: 2604.08496 by Gilad Sofer, Ram Band.

**Figure 1.1.** Figure 1.1: A Sturmian comb (top), along with a decorated Z-graph with more complex decorations. Any family of graphs ΓΩ is equipped with a naturally induced shift, (1.13) T : ΓΩ → ΓΩ, (1.14) TΓω = ΓT ω, where we abuse the notation T. One can further define (1.15) T : C (Γω) → C (ΓT ω), (T f) (x) = f [PITH_FULL_IMAGE:figures/full_fig_p005_1_1.png] view at source ↗

**Figure 1.2.** Figure 1.2: The compact graph Γω|[0,4], constructed by truncating the infinite graph Γω and keeping five decorations. In this setting, the analogue of the normalized length will be the average number of vertices: V (GΩ) := X a∈A νa |VGa (1.18) | . 1.4. Integrated density of states (IDS). 1.4.1. IDS for metric graphs. Let (Ω, T) be a uniquely ergodic subshift, with an associated family of metric decorated Z-graphs Γ… view at source ↗

**Figure 2.1.** Figure 2.1: The compact graph Γω (t) (2.13). Here, sω (t) (2.7) consists of two points, marked by x signs. and in general might be larger). Restricting E to be outside the mentioned set, and using the unique continuation of fE at every edge of Γa, we conclude that the zero set of fE is discrete. Hence the surplus σ (a) (E) is well-defined for all such E values. The nodal surplus has been extensively studied for quan… view at source ↗

**Figure 3.1.** Figure 3.1: The dispersion relation k (µ) = arccos (1 − µ) from Theorem 3.1 relating Spec (∆) (horizontal) and Spec (H) (vertical). Each µ ∈ Spec (∆) corresponds to a point k (µ) 2 ∈ Spec (H). The dispersion relation k (µ) is either monotone increasing or monotone decreasing, depending on the parity of j k(µ) π k . Let Γ be an equilateral compact metric graph with all edge lengths equal to 1, and equipped with the… view at source ↗

**Figure 4.1.** Figure 4.1: Illustration of how subwords of the form W = 10...01 give rise to a compactly supported eigenfunction. Here, taking α ≈ 0.29 and the initial angle to be θ = 1 − α + ε, the first subword of length 5 of the associated Sturmian sequence (1.9) gives rise to the compactly supported eigenfunction on the right. (1) A subword W with k = c1 zeros, which appear with frequency 1 − c1α in Ωα. (2) A subword W with k … view at source ↗

read the original abstract

We study Schr\"odinger operators on metric and discrete decorated graphs. The values taken by the integrated density of states (IDS) on spectral gaps are called gap labels. A natural question is which gap labels can occur. We answer this for graphs arising from uniquely ergodic one-dimensional dynamical systems by proving Johnson-Schwartzman gap-labelling theorems in both the metric and discrete settings. Our results extend Johnson-Schwartzman gap labelling beyond the standard one-dimensional setting. Unlike in one dimension, these graphs may contain cycles, which prevent the use of Sturm oscillation theory and require different spectral methods. We also analyze discontinuities of the IDS for certain graph families and show that not every admissible label corresponds to an open spectral gap. This reveals a mechanism of gap closing driven by graph geometry rather than by the underlying dynamics.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper extends Johnson-Schwartzman gap labelling to metric and discrete decorated graphs from uniquely ergodic systems and shows geometry can close gaps on its own.

read the letter

This paper extends Johnson-Schwartzman gap labelling to metric and discrete decorated graphs from uniquely ergodic systems and shows geometry can close gaps on its own. The new results cover graphs that may contain cycles, which rules out the usual Sturm oscillation theory, so the authors use other spectral methods to establish the labelling theorems in both settings. They also examine discontinuities in the integrated density of states for specific families and demonstrate that some admissible labels do not produce open gaps, with the closing driven by the graph geometry rather than the dynamics alone. This separation of contributions is the clearest advance over the one-dimensional case referenced in the abstract. The work is useful because it gives concrete theorems that apply to a broader class of graphs while keeping the dynamical assumptions standard. The additional analysis on gap closing adds a practical observation that clarifies when labels actually correspond to gaps. The claims avoid circularity and do not rely on fitted parameters or invented entities. The main soft spot is that the abstract does not sketch the alternative spectral methods in detail, so the strength of the proofs for the cyclic cases rests on whether those methods apply uniformly without hidden restrictions. If the full paper supplies explicit derivations and checks for the discontinuities, that concern shrinks. The citation pattern follows the expected one-dimensional literature without excess self-reference. This paper is aimed at researchers in spectral theory on graphs and ergodic operators who already know the Johnson-Schwartzman results. A reader looking for extensions beyond lines or trees would find the theorems and the geometry mechanism worth reading. It deserves a serious referee because the extension is specific, the claims are testable, and the overall argument holds together on the evidence given. I would bring it to a reading group focused on graph spectra. I would cite it if working on similar extensions. It should go to peer review rather than desk rejection.

Referee Report

2 major / 2 minor

Summary. The manuscript proves Johnson-Schwartzman gap-labelling theorems for Schrödinger operators on both metric and discrete decorated graphs arising from uniquely ergodic one-dimensional dynamical systems. It extends the classical one-dimensional results to graphs that may contain cycles by replacing Sturm oscillation theory with alternative spectral methods. The paper further analyzes discontinuities of the integrated density of states (IDS) for selected graph families and shows that not every admissible label corresponds to an open spectral gap, with some gap closings driven by graph geometry rather than the underlying dynamics.

Significance. If the central theorems hold, the work meaningfully broadens gap-labelling results beyond the standard one-dimensional setting to decorated graphs, which appear in models of quantum systems on more complex structures. The separate analysis of IDS discontinuities supplies a concrete geometric mechanism for gap closing that is independent of the dynamical system, adding a useful distinction between dynamical and geometric effects on the spectrum.

major comments (2)

[Proof of the metric Johnson-Schwartzman theorem] The central extension relies on alternative spectral methods that replace Sturm oscillation theory for graphs containing cycles. The manuscript should explicitly verify, in the proof of the metric-case theorem, that these methods yield the same gap-labelling conclusion as in the cycle-free case; without a direct comparison or a counter-example check, the uniformity of the extension remains unconfirmed.
[Analysis of IDS discontinuities] In the discrete setting, the argument that the IDS discontinuities are controlled by graph geometry (rather than by the underlying ergodic dynamics) is load-bearing for the claim that not every admissible label produces an open gap. The manuscript should supply a concrete family of decorated graphs where a label is admissible yet the gap closes, together with the explicit computation of the IDS jump.

minor comments (2)

The abstract states that proofs exist using alternative spectral methods but does not name the methods; a brief parenthetical reference in the abstract would improve readability.
Notation for the decorated graphs (e.g., the precise definition of the decoration and the metric versus discrete versions) should be introduced once in a dedicated preliminary section rather than piecemeal.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address the two major comments point by point below, indicating planned revisions to strengthen the manuscript.

read point-by-point responses

Referee: [Proof of the metric Johnson-Schwartzman theorem] The central extension relies on alternative spectral methods that replace Sturm oscillation theory for graphs containing cycles. The manuscript should explicitly verify, in the proof of the metric-case theorem, that these methods yield the same gap-labelling conclusion as in the cycle-free case; without a direct comparison or a counter-example check, the uniformity of the extension remains unconfirmed.

Authors: We agree that an explicit verification would improve clarity. The alternative spectral methods in the proof of the metric Johnson-Schwartzman theorem (relying on transfer-matrix cocycles and the unique ergodicity of the underlying dynamical system) are formulated so that the gap-labelling identity follows from the same ergodic averaging argument used in the cycle-free setting. To address the referee's concern directly, we will add a brief remark (or short subsection) in the revised manuscript that specializes the decorated graph to a cycle-free case and confirms that the labels obtained coincide with those from the classical Sturm-based argument. This will explicitly demonstrate uniformity without altering the main proof. revision: yes
Referee: [Analysis of IDS discontinuities] In the discrete setting, the argument that the IDS discontinuities are controlled by graph geometry (rather than by the underlying ergodic dynamics) is load-bearing for the claim that not every admissible label produces an open gap. The manuscript should supply a concrete family of decorated graphs where a label is admissible yet the gap closes, together with the explicit computation of the IDS jump.

Authors: We concur that a fully explicit example with computations would make the geometric gap-closing mechanism more concrete and load-bearing. The manuscript already treats families of decorated graphs in which geometry forces IDS discontinuities independent of the dynamics, but we will strengthen this by adding a specific, computable example in the revised version. We will select a periodic decorated graph with cycles, derive the admissible labels from the uniquely ergodic base dynamics, and provide the explicit IDS jump calculation showing closure for one admissible label. This addition will be placed in the section analyzing IDS discontinuities. revision: yes

Circularity Check

0 steps flagged

No significant circularity; theorems presented as independent extensions

full rationale

The paper claims to prove Johnson-Schwartzman gap-labelling theorems for metric and discrete decorated graphs arising from uniquely ergodic 1D systems, using alternative spectral methods to handle cycles where Sturm oscillation theory fails. No self-definitional reductions, fitted inputs renamed as predictions, or load-bearing self-citations appear in the provided claims or abstract. The derivations are described as new proofs extending prior results to graphs with cycles, with separate analysis of IDS discontinuities driven by geometry. The central results are self-contained against external benchmarks and do not reduce to inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard assumptions from spectral theory and dynamical systems; no free parameters or invented entities are indicated in the abstract.

axioms (2)

domain assumption Graphs arise from uniquely ergodic one-dimensional dynamical systems
Explicitly stated as the setting in which the theorems are proved.
standard math The integrated density of states exists and gap labels are well-defined for these operators
Standard background assumption in the spectral theory of Schrödinger operators on graphs.

pith-pipeline@v0.9.0 · 5439 in / 1347 out tokens · 85468 ms · 2026-05-10T17:06:13.320713+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear
We answer this for graphs arising from uniquely ergodic one-dimensional dynamical systems by proving Johnson-Schwartzman gap-labelling theorems in both the metric and discrete settings... Unlike in one dimension, these graphs may contain cycles, which prevent the use of Sturm oscillation theory and require different spectral methods.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
the nodal surplus of E in Γ_a by σ(a)(E) := #{zeros of f_E in Γ_a} − (n(a)(E)−1)

Reference graph

Works this paper leans on

9 extracted references · 1 canonical work pages

[1]

[ABB18] L. Alon, R. Band, and G. Berkolaiko,Nodal statistics on quantum graphs, Comm. Math. Phys.362(2018), no. 3, 909–948. MR 3845291 [ABB22] ,Universality of nodal count distribution in large metric graphs, ExperimentalMath- ematics0(2022), no. 0, 1–35. [Alo20] L. Alon,Quantum graphs - generic eigenfunctions and their nodal count and neumann count stati...

2018
[2]

[AOS03] J. E. Avron, D. Osadchy, and R. Seiler,A topological look at the Quantum Hall Effect, Physics Today56(2003), no. 8, 38–42. [BBG92] J. Bellissard, A. Bovier, and J.-M. Ghez,Gap labelling theorems for one-dimensional dis- crete Schrödinger operators, Rev. Math. Phys.4(1992), no. 1, 1–37. MR 1160136 [BBLP05] B. Booss-Bavnbek, M. Lesch, and J. Phillip...

2003
[3]

Baake and U

MR 3748521 [BG13] M. Baake and U. Grimm,Aperiodic order. Vol. 1, Encyclopedia of Mathematics and its Applications, vol. 149, Cambridge University Press, Cambridge, 2013, A mathematical invitation, With a foreword by Roger Penrose. MR 3136260 34 RAM BAND AND GILAD SOFER [BGM24] M. Baake, F. Gähler, and J. Mazáč,On the Fibonacci tiling and its modern ramifi...

2013
[4]

Breuer and N

[BL26] J. Breuer and N. Y. Levi,The point spectrum of periodic quantum trees, arXiv:2603.08362 (2026). [BLT83] J. Bellissard, R. Lima, and D. Testard,A metal-insulator transition for the almost Mathieu model, Comm. Math. Phys.88(1983), no. 2, 207–234. MR 696805 [BPS] R. Band, M. Prokhorova, and G. Sofer,Spectral flow and Robin domains on metric graphs, ar...

work page arXiv 2026
[5]

Theory Adv

[DF23] ,Gap labelling for discrete one-dimensional ergodic Schrödinger operators, From complex analysis to operator theory—a panorama, Oper. Theory Adv. Appl., vol. 291, Birkhäuser/Springer, Cham, [2023]©2023, pp. 341–404. MR 4651279 [DFZ23] D. Damanik, J. Fillman, and Z. Zhang,Johnson Schwartzman gap labelling for ergodic Jacobi matrices, Journal of Spec...

2023
[6]

Kellendonk,private communication

MR 0407617 (53 #11389) [Kel] J. Kellendonk,private communication. [Kel24] ,Topological quantum numbers in quasicrystals, Israel Journal of Chemistry (2024), Overview on the theory of topological quantum numbers in quasicrystals via non- commutative topology. GAP LABELS FOR ERGODIC OPERATORS ON DECORATED GRAPHS 35 [KLS03] S. Klassert, D. Lenz, and P. Stoll...

2024
[7]

Lledó and O

[LP08] F. Lledó and O. Post,Eigenvalue bracketing for discrete and metric graphs, J. Math. Anal. Appl.348(2008), no. 2, 806–833. MR MR2446037 (2010a:47076) [LPPV09] D. Lenz, N. Peyerimhoff, O. Post, and I. Veselic,Continuity of the integrated density of states on random length metric graphs, Mathematical Physics, Analysis and Geometry 12 (2009). [LS20] Y....

2008
[8]

Schwartzman,Asymptotic cycles, Ann

MR 2590264 [Sch57] S. Schwartzman,Asymptotic cycles, Ann. of Math. (2)66(1957), 270–284. MR 88720 [Sch06] P. Schapotschnikow,Eigenvalue and nodal properties on quantum graph trees, Waves Ran- dom Complex Media16(2006), no. 3, 167–178. [SFFG24] J. Schirmann, S. Franca, F. Flicker, and A. G. Grushin,Physical properties of an aperiodic monotile with graphene...

1957
[9]

von Below,A characteristic equation associated to an eigenvalue problem onc2-networks, Linear Algebra Appl.71(1985), 309–325

[vB85] J. von Below,A characteristic equation associated to an eigenvalue problem onc2-networks, Linear Algebra Appl.71(1985), 309–325. Department of Mathematics, Technion – Israel Institute of Technology, Haifa, Is- rael Email address:ramband@technion.ac.il Department of Mathematics and the Helen Diller Quantum Center, Technion – Israel Institute of Tech...

1985