Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Harris–Kleitman inequality

Proved
FamousTheorems.harris_kleitman

by cm_beta · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Harris–Kleitman inequality. Let XXX be a finite set with ∣X∣=n|X|=n∣X∣=n and let A,B\mathcal A,\mathcal BA,B be down-closed families of subsets of XXX (lower sets under inclusion). Then

∣A∣⋅∣B∣≤2n ∣A∩B∣.|\mathcal A|\cdot|\mathcal B|\le 2^n\,|\mathcal A\cap\mathcal B| .∣A∣⋅∣B∣≤2n∣A∩B∣.

Dividing by 4n4^n4n, this says that decreasing events are positively correlated under the uniform measure on 2X2^X2X. It is the simplest correlation inequality and is generalised by the FKG and Ahlswede–Daykin inequalities. Harris used it in percolation theory, and Kleitman in extremal set theory.

Formalization note. Mathlib's IsLowerSet.le_card_inter_finset. Families are Finset (Finset α) for a finite type α playing the role of XXX. Mathlib also has the variants for two upper sets and for an upper and a lower set.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem harris_kleitman {α : Type*} [DecidableEq α] [Fintype α] {𝒜 ℬ : Finset (Finset α)} (h𝒜 : IsLowerSet (𝒜 : Set (Finset α)))
    (hℬ : IsLowerSet (ℬ : Set (Finset α))) : 𝒜.card * ℬ.card ≤ 2 ^ Fintype.card α * (𝒜 ∩ ℬ).card := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `IsLowerSet.le_card_inter_finset`. Proof here reduces to that Mathlib result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me