hardCoreClosedNeighborhoodBound
Given a finite graph G on a type V with decidable equality and positive vertex fugacities lam, the closed-neighborhood variance lower bound hardCoreClosedNeighborhoodBound G lam is defined as the sum over all vertices v of lam v / (1 + ∑_{u ∈ N[v]} lam u)^2, where N[v] is the closed neighborhood insert v (G.neighborFinset v).
Statement
noncomputable def hardCoreClosedNeighborhoodBound {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (lam : V → ℝ) : ℝ
- Related work
- OP-1340; knowledgebase
- Verified
- 09 Nov 2026
- Axioms
- none listed
- Used by 2
- hard_core_weighted_closed_neighborhood_bound_onesWhen the observable weights a are identically 1, the weighted closed-neighborhood bound hardCoreWeightedClosedNeighborhoodBound G lam (fun…
- op_1340_empty_graph_equalityOn the empty (edgeless) graph (⊥ : SimpleGraph V) on a finite type V with decidable equality and positive vertex fugacities lam,…
Read back from the Lean
Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a function lam : V → ℝ, hardCoreClosedNeighborhoodBound G lam is defined to be the real number
$$\sum_{v : V} \frac{\mathrm{lam}(v)}{\left(1 + \sum_{u \in \{v\} \cup N_G(v)} \mathrm{lam}(u)\right)^2}$$
where $N_G(v)$ (G.neighborFinset v) is the set of neighbors of $v$ in $G$.
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 hard-core variance, defined as ∑_v λ_v / (1 + ∑_{u ∈ N[v]} λ_u)^2. -/ noncomputable def hardCoreClosedNeighborhoodBound {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (lam : V → ℝ) : ℝ := ∑ v : V, lam v / (1 + ∑ u ∈ insert v (G.neighborFinset v), lam u) ^ 2