Indexed metadata

A proof of Chvátal's conjecture via a sharp correlation inequality

Fan Chang, Hong Liu, Miao Liu

Source record

Source: arXiv

Published: Sep 16, 2026

arXiv: 2609.19123

Open original source ↗

Source abstract

We prove Chvátal's conjecture, posed in 1972: every hereditary family of subsets of a finite set has a largest intersecting subfamily that is a star. More generally, we prove a sharp correlation inequality for increasing Boolean functions f,g:{0,1}n{0,1}f,g:\{0,1\}^n\to\{0,1\}. Writing g(x)=1g(1x)g^*(x)=1-g(1-x), we show that S[n]g^(S)2maxiSInfi[f]2Cov(f,g)Cov(f,g)Cov(f,g)+Cov(f,g). \sum_{\varnothing\ne S\subseteq[n]}\hat{g}(S)^2\max_{i\in S}\mathrm{Inf}_i[f]\le\frac{2\mathrm{Cov}(f,g)\mathrm{Cov}(f,g^*)}{\mathrm{Cov}(f,g)+\mathrm{Cov}(f,g^*)}. When gg is antipodal, that is, g=gg=g^*, this yields Cov(f,g)14mini[n]Infi[f]\mathrm{Cov}(f,g)\ge\frac{1}{4}\min_{i\in[n]}\mathrm{Inf}_i[f], the correlation formulation of Chvátal's conjecture due to Friedgut, Kahn, Kalai and Keller.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.