hardCoreWeightedClosedNeighborhoodBound
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
- op_1355_clique_components_variance_ge_boundFor any finite simple graph G on a finite type V with decidable equality whose connected components are all cliques, and for all positive…
- op_1355_complete_graph_variance_ge_boundOn the complete graph (⊤ : SimpleGraph V) on a finite type V with decidable equality, for all positive vertex fugacities lam and all…
- op_1355_claw_free_of_weighted_boundIf a finite simple graph G on a finite type V with decidable equality satisfies the weighted hard-core closed-neighborhood variance bound…
- op_1355_center_violation_of_partition_boundsA center-only observable violates the weighted local variance bound whenever the center activity is one, its partition weight is between 0…
- hard_core_weighted_closed_neighborhood_bound_onesWhen the observable weights a are identically 1, the weighted closed-neighborhood bound hardCoreWeightedClosedNeighborhoodBound G lam (fun…
- op_1355_empty_graph_equalityOn the edgeless graph (⊥ : SimpleGraph V) on a finite type V with decidable equality, for all positive vertex fugacities lam and all…
- op_1355_claw_strict_variance_violationOn the complete bipartite claw graph completeBipartiteGraph (Fin 1) (Fin 3), there exist positive vertex fugacities lam and nonnegative…
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