AFTD Auto-Formalizing Theoretical Domains

ising_regular_pair_base

def

The finite set of ordered pairs of simple d-regular graphs on Fin n, the common base over which every bad fraction is taken.

Statement

noncomputable def ising_regular_pair_base (d n : ℕ) : Finset (SimpleGraph (Fin n) × SimpleGraph (Fin n))
Source
step towards critical_regular_ising_two_layer_weak_matching_quartic_crossover
Verified
01 Nov 2026
Axioms
none listed
Used by 1
  • ising_two_layer_deviation_fractionThe fraction of ordered pairs of d-regular graphs on Fin n on which |Φ p| is at least ε; the general form of the two-layer bad fraction…

Lean source view module on GitHub

/-- Ordered pairs of d-regular graphs on Fin n; common base of every bad fraction. -/
noncomputable def ising_regular_pair_base (d n : ℕ) : Finset (SimpleGraph (Fin n) × SimpleGraph (Fin n)) := by
  classical
  exact Finset.univ.filter (fun p => p.1.IsRegularOfDegree d ∧ p.2.IsRegularOfDegree d)
See it in the graphDiscuss this resultChallenge it