What was already known
Existing exact magnetization law and earlier numerical/heuristic crossing estimates. The paper gives a finite-N refinement.
AI involvement
Arjun Pemmasani had a bracket conjecture with gaps. Claude Opus 5.5 proposed the improved bracket and its Bessel-bound proof. Pemmasani rewrote the proof and checked the model-generated Lean statements against the paper.
- Uniform Bessel bounds for magnetization crossings in finite Ising chainsUniform Bessel bounds for magnetization crossings in finite Ising chains
Importance
The bracket gives finite-length bounds that narrow as the chain grows.
Technical verification
Section 7 reports Lean 4 checking of Theorem 3.4 as stated, including rational finite certificates for . The author reports human review of statement correspondence and independently rewriting the proof, with the precise Lean mapping in the repository.
Formal checking
Section 7 reports Lean 4 checking of Theorem 3.4 as stated, including rational finite certificates for . The author reports human review of statement correspondence and independently rewriting the proof, with the precise Lean mapping in the repository.
- Checker
- Arjun Pemmasani, reporting Lean checks
- Scope
- Section 7 reports Lean 4 checking of Theorem 3.4 as stated, including rational finite certificates for . The author reports human review of statement correspondence and independently rewriting the proof, with the precise Lean mapping in the repository.
- Basis
- Reported by the linked checker
Human understanding
Pemmasani rewrites the Bessel-function argument and explains how the two bounds determine the crossing.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision