hard_core_weighted_var_ones
When the observable weights a are identically 1, the weighted hard-core variance hardCoreWeightedVar G lam (fun _ => 1) is equal to the unweighted independent set size variance hardCoreVarSize G lam.
Statement
theorem hard_core_weighted_var_ones {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (lam : V → ℝ) : hardCoreWeightedVar G lam (fun _ => 1) = hardCoreVarSize G lam
- Source
- folklore
- Verified
- 10 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- hardCoreWeightedVarGiven a finite graph G on a type V with decidable equality, vertex fugacities lam, and observable weights a, hardCoreWeightedVar G lam a…
- hardCoreVarSizeGiven a finite graph G on a type V with decidable equality and vertex fugacities lam, the variance of the independent set size…
- Used by 1
- hard_core_weighted_closed_neighborhood_bound_onesWhen the observable weights a are identically 1, the weighted closed-neighborhood bound hardCoreWeightedClosedNeighborhoodBound G lam (fun…
Read back from the Lean
For any finite type $V$ with decidable equality, any simple graph $G$ on $V$ with decidable adjacency, and any vertex weight function $\lambda : V \to \mathbb{R}$, the weighted variance under the hard-core model on $G$ with weights $\lambda$ evaluated on the constant function $a(v) = 1$ (hardCoreWeightedVar G lam (fun _ => 1)) is equal to the variance of the independent set size under the hard-core model on $G$ with weights $\lambda$ (hardCoreVarSize G lam).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof unfolds the definitions of both the weighted hard-core variance and the unweighted independent set size variance. Both definitions compute the variance E₂ - E₁² with respect to the hard-core Gibbs distribution with partition function Z = ∑_{I} ∏_{v ∈ I} λ(v). When the observable weight function is identically 1, the sum ∑_{v ∈ I} 1 over each independent set I simplifies to its cardinality |I|, matching the two variance expressions term by term.
Expanding the definitions reduces the problem to showing that the weighted moments with constant weight 1 coincide with the independent set size moments.
Unfolding the definitions of hardCoreWeightedVar and hardCoreVarSize reveals that both expressions compute the variance E₂ - E₁² under the hard-core measure with partition function Z = ∑_{I} ∏_{v ∈ I} λ(v). In the weighted variance, the observable evaluated on an independent set I is ∑_{v ∈ I} 1, whereas in the size variance it is the cardinality |I|.
unfold hardCoreWeightedVar hardCoreVarSizeEvaluating the sum of the constant 1 over each independent set as its cardinality shows that the two variance formulas are identical.
For every independent set I, summing the constant 1 over v ∈ I yields the cardinality |I| (cast to ℝ). The simplifier evaluates ∑_{v ∈ I} 1 to |I| in both the first moment E₁ and the second moment E₂, leaving the left-hand and right-hand sides identical and closing the goal.
simp
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Specializing weighted hard-core variance to constant observable weight 1 recovers the independent set size variance. -/theorem hard_core_weighted_var_ones {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (lam : V → ℝ) : hardCoreWeightedVar G lam (fun _ => 1) = hardCoreVarSize G lam := by unfold hardCoreWeightedVar hardCoreVarSize simp