正温度下三维Migdal-Kadanoff格点上的自旋玻璃序
Positive-temperature spin-glass order on the three-dimensional Migdal-Kadanoff lattice
浏览论文内容
中文总结 AI 辅助
本文在三维Migdal-Kadanoff格点及更广菱形格点上，通过精确重整化与计算机辅助证明，首次证明了正温度下自旋玻璃序及蓝团簇密度失衡。
中文摘要 AI 辅助
我们研究菱形分层格点（具有n个分支，有效维度为1+log2 n）上耦合独立同分布的Ising自旋玻璃；n=4时即为Z^3的Migdal-Kadanoff格点。对于n≥4及任意具有有界密度的耦合分布，我们证明在足够低的温度T>0下，一致于格点层级，极点是有序的，当极点固定时每个自旋的Edwards-Anderson参数为1-O(T)，且两个自由边界副本的重叠二阶矩为1-O(T)。对于标准高斯耦合，n=3,4,5,7,8及所有T≤T*(n)=4/15, 6/7, 6/5, 7/4, 2（数值估计T_c的0.89至0.98倍），计算机辅助证明给出极点序，且当层级趋于无穷时给出位点重叠序及下述蓝团簇结论；同样适用于这些温度下所有更大的n。此前，在这些格点上具有受挫独立耦合的自旋玻璃序仅对超过10^18个分支的情形得到证明（Collet和Eckmann，1984）。关键步骤是精确重整化映射下有效耦合的增长：对于n≥4，通过Rogozin不等式对高概率事件上的密度界进行一步压缩；在T_c附近，通过尖峰序中的区间算术界。遵循Collet和Eckmann祖先链论证的传递定理将此增长转化为体结论。在Chayes-Machta-Redner表示中，相同的输入给出一个蓝团簇，其包含两个极点的概率趋于1，且其期望密度远离零有界，而最大的其他蓝团簇的密度在概率和L^1意义下趋于零；因此产生蓝团簇密度失衡。据我们所知，这是除完全图外图上自旋玻璃此类失衡的首个证明。
英文摘要
We study the Ising spin glass with independent, identically distributed couplings on the diamond hierarchical lattice with $n$ branches, of effective dimension $1+\log_2 n$; $n=4$ is the Migdal-Kadanoff lattice of $\mathbb{Z}^3$. For $n\ge4$ and every coupling law with a bounded density we prove that at sufficiently low temperature $T>0$, uniformly in the level of the lattice, the poles are ordered, every spin has Edwards-Anderson parameter $1-O(T)$ when the poles are fixed, and the overlap of two free-boundary replicas has second moment $1-O(T)$. For standard Gaussian couplings, $n=3,4,5,7,8$ and every $T\le T^*(n)=4/15,\,6/7,\,6/5,\,7/4,\,2$ ($0.89$ to $0.98$ times numerical estimates of $T_c$), a computer-assisted proof gives pole order and, as the level tends to infinity, site-overlap order and the blue-cluster statements below; likewise for every larger $n$ at these temperatures. Previously, spin-glass order on these lattices with frustrated independent couplings had been proved only for more than $10^{18}$ branches (Collet and Eckmann, 1984). The key step is growth of the effective coupling under the exact renormalization map: for $n\ge4$, by a one-step contraction, via Rogozin's inequality, of a density bound on an event of high probability; near $T_c$, by interval-arithmetic bounds in the peakedness order. A transfer theorem following the ancestor-chain argument of Collet and Eckmann turns this growth into bulk statements. In the Chayes-Machta-Redner representation the same input gives a blue cluster that contains both poles with probability tending to one and whose expected density is bounded away from zero, while the largest other blue cluster has density tending to zero in probability and in $L^1$; hence blue-cluster density imbalance. To our knowledge this is the first proof of such an imbalance for a spin glass on a graph other than the complete graph.
