AFTD Auto-Formalizing Theoretical Domains

hardCoreWeightedClosedNeighborhoodBound

deforiginal

Given a finite graph G on a type V with decidable equality, vertex fugacities lam, and observable weights a, hardCoreWeightedClosedNeighborhoodBound G lam a is the sum over all vertices v of (a v)^2 * lam v / (1 + ∑_{u ∈ N[v]} lam u)^2, where N[v] is the closed neighborhood of v.

Statement

noncomputable def hardCoreWeightedClosedNeighborhoodBound {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (lam : V → ℝ) (a : V → ℝ) : ℝ
Related work
OP-1355
Verified
09 Nov 2026
Axioms
none listed
Used by 7

Read back from the Lean

Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and weighting functions lam : V → ℝ and a : V → ℝ, hardCoreWeightedClosedNeighborhoodBound G lam a is defined as the real number: $$\sum_{v \in V} \frac{a(v)^2 \cdot \mathrm{lam}(v)}{\left(1 + \sum_{u \in \{v\} \cup N_G(v)} \mathrm{lam}(u)\right)^2}$$ where $N_G(v)$ is the set of neighbors of $v$ in $G$ (G.neighborFinset v), so that $\{v\} \cup N_G(v)$ is the closed neighborhood of $v$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The closed-neighborhood lower bound for the weighted hard-core variance. -/
noncomputable def hardCoreWeightedClosedNeighborhoodBound {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (lam : V → ℝ) (a : V → ℝ) : ℝ :=
  ∑ v, (a v ^ 2 * lam v) / (1 + ∑ u ∈ insert v (G.neighborFinset v), lam u) ^ 2
See it in the graphDiscuss this resultChallenge it