AFTD Auto-Formalizing Theoretical Domains

ising_inverse_square_bulk_field_polynomial

def

A real polynomial P represents the order-n bulk field coefficient when, at every real field h, the order-n finite-ring coefficients tend to P(tanh(h)^2) as the ring size tends to infinity.

Statement

noncomputable def ising_inverse_square_bulk_field_polynomial (n : ℕ) (P : Polynomial ℝ) : Prop
Source
arXiv:2610.39815, Sections 2–4; helper for OP-806.
Verified
01 Nov 2026
Axioms
none listed
Built on 1
Used by 1

Lean source view module on GitHub

noncomputable def ising_inverse_square_bulk_field_polynomial (n : ℕ) (P : Polynomial ℝ) : Prop := ∀ h : ℝ, Filter.Tendsto (fun L : ℕ => ising_inverse_square_ring_coefficient n L h)
    Filter.atTop (nhds (P.eval ((Real.tanh h)^2)))
See it in the graphDiscuss this resultChallenge it