pith. sign in

arxiv: 2605.17338 · v1 · pith:NZ4OOK6Hnew · submitted 2026-05-17 · ❄️ cond-mat.dis-nn · math-ph· math.MP

At Most Two Infinite Blue Clusters in the CMR Representation of the Edwards-Anderson Spin Glass

Yan Ru Pei This is my paper

Pith reviewed 2026-05-19 22:46 UTC · model grok-4.3

classification ❄️ cond-mat.dis-nn math-phmath.MP
keywords Edwards-Anderson modelCMR representationspin glassblue clustersinfinite componentsoverlap paritymass transportpercolation
0
0 comments X

The pith

The blue subgraph in the two-replica CMR representation of the Edwards-Anderson spin glass has at most two infinite connected components.

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

The paper establishes that for any translation-invariant joint Gibbs measure on the disorder, two spin replicas, and CMR bond variables on the d-dimensional integer lattice, the subgraph formed by blue bonds has at most two infinite clusters. When two infinite blue clusters exist, they must belong to the same infinite grey cluster and have opposite parity in terms of the overlap. This result is obtained by circumventing the lack of insertion tolerance and positive association in the blue process through a finite-box merge operation and mass-transport bounds on the ends of translation-invariant subgraphs. A reader would care because it provides a precise geometric constraint that is consistent with the expectation from mean-field theory and simulations of exactly two macroscopic blue clusters with opposite overlap signs in the low-temperature spin-glass phase.

Core claim

For any translation-invariant joint Gibbs measure on disorder, two spin replicas, and CMR bond variables on Z^d, the blue subgraph contains at most two infinite connected components; if two exist, then they lie in a common infinite grey cluster and belong to opposite overlap-parity classes.

What carries the argument

the blue subgraph in the two-replica Chayes-Machta-Redner (CMR) representation, analyzed via finite-box merge operations and mass-transport bounds on translation-invariant subgraphs

Load-bearing premise

The joint Gibbs measure is translation-invariant, which enables the application of mass-transport arguments and the finite-box merge operation to control the ends of subgraphs.

What would settle it

A construction of a translation-invariant joint Gibbs measure in which the blue subgraph has three or more distinct infinite connected components would disprove the claim.

Figures

Figures reproduced from arXiv: 2605.17338 by Yan Ru Pei.

Figure 1
Figure 1. Figure 1: The box-resampling lemma. The event A3(Λ) is expressed using exterior arms and is therefore measurable from FΛc . Conditional on this outside event, Bs(Λ) has positive probability and merges all exterior blue components in the overlap class q = s that touch ∂Λ. The dotted blue arms indicate exterior blue components in the opposite overlap class; they are shown only as context for the chosen q = s resamplin… view at source ↗
read the original abstract

The two-replica Chayes-Machta-Redner (CMR) representation is one of the main proposed geometric signatures of spin-glass order in the short-range Edwards-Anderson model. Mean-field arguments and recent numerics suggest that the low-temperature phase should exhibit two macroscopic blue clusters carrying opposite overlap signs. We prove a rigorous structural constraint in this direction. For any translation-invariant joint Gibbs measure on disorder, two spin replicas, and CMR bond variables on Z^d, the blue subgraph contains at most two infinite connected components; if two exist, then they lie in a common infinite grey cluster and belong to opposite overlap-parity classes. The main obstacle is that the blue-bond process is neither insertion-tolerant nor positively associated, so the usual Burton-Keane and random-cluster arguments do not apply. We circumvent this by working in the full joint measure and using a finite-box merge operation together with the mass-transport bound on ends of translation-invariant subgraphs. As auxiliary input, we establish finite energy and a percolation transition for the grey subgraph via Bayesian resampling of couplings and a parity-based Peierls estimate. These results do not prove the existence of infinite blue clusters or a spin-glass phase transition, but they give a rigorous upper bound compatible with the two-cluster picture for short-range spin glasses.

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.

Referee Report

1 major / 2 minor

Summary. The manuscript proves that for any translation-invariant joint Gibbs measure on the disorder, two spin replicas, and CMR bond variables for the Edwards-Anderson model on Z^d, the blue subgraph contains at most two infinite connected components. If two exist, they lie in a common infinite grey cluster and belong to opposite overlap-parity classes. The argument establishes finite energy and a percolation transition for the grey subgraph via Bayesian resampling of couplings and a parity-based Peierls estimate, then circumvents the lack of insertion tolerance and positive association in the blue process by using a finite-box merge operation together with the mass-transport bound on the number of ends of translation-invariant subgraphs.

Significance. If the central claim holds, the result supplies a rigorous structural upper bound on the number of infinite blue clusters that is compatible with the two-cluster scenario suggested by mean-field theory and recent numerics. It does not establish existence of infinite blue clusters or the spin-glass transition itself, but it furnishes a geometric constraint that can be used in subsequent work. The technical device of applying mass transport directly in the joint measure, after verifying auxiliary properties of the grey subgraph, is a clear strength of the paper.

major comments (1)
  1. [Mass-transport application (main theorem section)] Mass-transport application (main theorem section): the bound that caps the number of infinite blue components at two relies on the blue-bond indicators being a measurable factor of the underlying translation-invariant probability space so that the mass-transport inequality controls the expected number of ends without extra terms arising from spin or overlap dependence. The manuscript should add an explicit paragraph confirming that the joint Gibbs measure preserves this factor property; without it the application to the blue subgraph is not immediate.
minor comments (2)
  1. [Grey subgraph properties] The parity-based Peierls estimate used to obtain finite energy for the grey subgraph would benefit from a short self-contained calculation or inequality reference so that readers can verify the percolation transition without reconstructing the Bayesian resampling argument from scratch.
  2. [Setup and notation] Notation for the overlap-parity classes and the finite-box merge operation should be introduced with a brief diagram or one-sentence definition in the setup section to improve readability for readers outside the immediate subfield.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive assessment of the result. We address the single major comment below.

read point-by-point responses

  1. Referee: Mass-transport application (main theorem section): the bound that caps the number of infinite blue components at two relies on the blue-bond indicators being a measurable factor of the underlying translation-invariant probability space so that the mass-transport inequality controls the expected number of ends without extra terms arising from spin or overlap dependence. The manuscript should add an explicit paragraph confirming that the joint Gibbs measure preserves this factor property; without it the application to the blue subgraph is not immediate.

    Authors: We agree that an explicit confirmation is helpful for clarity. The joint Gibbs measure is constructed directly from the translation-invariant disorder and the two-replica spin configurations via the standard CMR bond probabilities, which are measurable functions of these variables; consequently the blue-bond indicators remain a measurable factor of the underlying probability space. We will insert a short paragraph in the main theorem section (immediately preceding the mass-transport argument) that states this fact and notes that no additional spin- or overlap-dependent correction terms arise in the application of the mass-transport inequality. revision: yes

Circularity Check

0 steps flagged

Direct structural proof with no reduction to inputs by construction

full rationale

The paper establishes an upper bound on infinite blue clusters via a mass-transport argument applied to the joint translation-invariant Gibbs measure, combined with a finite-box merge operation and auxiliary percolation results for the grey subgraph. No step reduces a claimed prediction or uniqueness result to a fitted parameter, self-definition, or load-bearing self-citation chain; the derivation invokes standard tools (mass transport on ends of translation-invariant subgraphs) whose applicability is justified directly from the joint measure and translation invariance without circular substitution. The argument remains self-contained against external benchmarks such as the mass-transport principle and does not rename or smuggle in prior results by the same author as the central claim.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the existence of a translation-invariant joint Gibbs measure and on two auxiliary results (finite energy and percolation transition for the grey subgraph) that are established inside the paper via resampling and Peierls arguments.

axioms (2)
  • domain assumption Existence of a translation-invariant joint Gibbs measure on the disorder, two replicas, and CMR bond variables on Z^d
    The theorem is stated for any such measure; the proof uses translation invariance to apply the mass-transport principle.
  • ad hoc to paper Finite energy and percolation transition for the grey subgraph, obtained via Bayesian resampling of couplings and a parity-based Peierls estimate
    These auxiliary facts are proved in the paper and then used to control the blue clusters.

pith-pipeline@v0.9.0 · 5762 in / 1336 out tokens · 49499 ms · 2026-05-19T22:46:24.075405+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

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

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages

  1. [1]

    Oliver Redner, Jon Machta, and Lincoln F. Chayes. Graphical representations and cluster algorithms for critical points with fields.Physical Review E, 58(3):2749–2752, 1998

    work page 1998

  2. [2]

    Machta, C

    J. Machta, C. M. Newman, and D. L. Stein. The percolation signature of the spin glass transition.Journal of Statistical Physics, 130:113–128, 2007

    work page 2007

  3. [3]

    Cluster percolation in the two-dimensional Ising spin glass.Physical Review E, 107(5):054103, 2023

    Lambert M¨ unster and Martin Weigel. Cluster percolation in the two-dimensional Ising spin glass.Physical Review E, 107(5):054103, 2023

    work page 2023

  4. [4]

    Cluster percolation in the three-dimensional±Jrandom- bond Ising model.Physical Review E, 113(2):024139, 2026

    Lambert M¨ unster and Martin Weigel. Cluster percolation in the three-dimensional±Jrandom- bond Ising model.Physical Review E, 113(2):024139, 2026

    work page 2026

  5. [5]

    Graphical representations for Ising systems in external fields.Journal of Statistical Physics, 93:17–32, 1998

    Lincoln Chayes, Jon Machta, and Oliver Redner. Graphical representations for Ising systems in external fields.Journal of Statistical Physics, 93:17–32, 1998

    work page 1998

  6. [6]

    Newman.Topics in Disordered Systems

    Charles M. Newman.Topics in Disordered Systems. Birkh¨ auser, 1997

    work page 1997

  7. [7]

    Bond percolation in frustrated systems.Annals of Probability, 27(4):1781–1808, 1999

    Emilio De Santis and Alberto Gandolfi. Bond percolation in frustrated systems.Annals of Probability, 27(4):1781–1808, 1999

    work page 1999

  8. [8]

    R. M. Burton and M. Keane. Density and uniqueness in percolation.Communications in Mathematical Physics, 121:501–505, 1989

    work page 1989

  9. [9]

    Cambridge University Press, 2016

    Russell Lyons and Yuval Peres.Probability on Trees and Networks. Cambridge University Press, 2016

    work page 2016

  10. [10]

    Uniqueness of the infinite tree in low-dimensional random forests.Probability and Mathematical Physics, 5:1185–1216, 2024

    Nathan Halberstam and Tom Hutchcroft. Uniqueness of the infinite tree in low-dimensional random forests.Probability and Mathematical Physics, 5:1185–1216, 2024

    work page 2024

  11. [11]

    Friedli and Yvan Velenik.Statistical Mechanics of Lattice Systems: A Concrete Mathemat- ical Introduction

    S. Friedli and Yvan Velenik.Statistical Mechanics of Lattice Systems: A Concrete Mathemat- ical Introduction. Cambridge University Press, 2017

    work page 2017

  12. [12]

    Alberto Gandolfi, Michael Keane, and Charles M. Newman. Uniqueness of the infinite compo- nent in a random graph with applications to percolation and spin glasses.Probability Theory and Related Fields, 92:511–527, 1992. 17

    work page 1992