← 研踪 PaperTrailarXiv:2611.11713 · v1
Binary Belief Propagation Fixed Points: Finiteness, Rigidity, and Topological Complexity
首次提交 2026-11-09 08:18
版本更新 2026-11-09 08:18
雷达观测 2026-11-10 13:19
摘要
A fixed finite binary Ising model has only finitely many admissible complex belief propagation fixed points, even at degenerate parameter values. Families of positive fixed points obtained by varying external fields can nevertheless have nontrivial topology. We study this distinction through the external-field projection. For a fixed field, we prove finiteness by bounding the pole orders of the magnetizations on a hypothetical complex solution curve. The generic degree on the support graph then bounds the total local multiplicity. A graph has a single smooth real line as its full positive response for every choice of positive couplings, base field, and strictly positive sweep direction exactly when it contains no two vertex-disjoint connected subgraphs of cycle rank at least two. Two such subgraphs suffice to create a circular component. For a plane obtained by varying two vertex fields, connected simple bipartite cubic graphs with one uniform coupling and a universal bound on the fixed fields realize every genus. The minimum number of vertices grows logarithmically in the genus, by a matching algebraic upper bound on Betti numbers. Finally, we certify the complete field discriminant of an eighteen-vertex product model and recover its torus component's genus from the counts of distinct roots on all field cells. The three main theorems, including the logarithmic size bounds, are formally verified in Lean 4 with Mathlib.
作者备注：37 pages, 3 figures. Lean 4 formalization and interval certificates at https://github.com/ywatanabex/bp-response-geometry-lean
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-09 08:18 · 最新观测版本
Binary Belief Propagation Fixed Points: Finiteness, Rigidity, and Topological Complexity
A fixed finite binary Ising model has only finitely many admissible complex belief propagation fixed points, even at degenerate parameter values. Families of positive fixed points obtained by varying external fields can nevertheless have nontrivial topology. We study this distinction through the external-field projection. For a fixed field, we prove finiteness by bounding the pole orders of the magnetizations on a hypothetical complex solution curve. The generic degree on the support graph then bounds the total local multiplicity. A graph has a single smooth real line as its full positive response for every choice of positive couplings, base field, and strictly positive sweep direction exactly when it contains no two vertex-disjoint connected subgraphs of cycle rank at least two. Two such subgraphs suffice to create a circular component. For a plane obtained by varying two vertex fields, connected simple bipartite cubic graphs with one uniform coupling and a universal bound on the fixed fields realize every genus. The minimum number of vertices grows logarithmically in the genus, by a matching algebraic upper bound on Betti numbers. Finally, we certify the complete field discriminant of an eighteen-vertex product model and recover its torus component's genus from the counts of distinct roots on all field cells. The three main theorems, including the logarithmic size bounds, are formally verified in Lean 4 with Mathlib.
查看此版本解读 →查看此版本原文 ↗