CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le
theoremverifiedimported Lean
Fooling set bound from communication complexity. Let $g : X \times Y \to \alpha$ be a two-argument function, and let $S \subseteq X \times Y$ be a fooling set for $g$, meaning that $S$ meets every $g$-monochromatic rectangle in at most one point. If the deterministic communication complexity of $g$ satisfies $D(g) \le n$ for some $n \in \bbn$, then the cardinality of $S$ satisfies $\abs{S} \le 2^{n}$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in variable {X Y α : Type*} in open CommunicationComplexity.Rectangle in theorem CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le (g : X → Y → α) (S : Set (X × Y)) (n : ℕ) (hS : Rectangle.IsFoolingSet S g) (h : communicationComplexity g ≤ n) : Set.ncard S ≤ 2 ^ n
- Source
- TCSlib, `CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le`
- Lean proof
- By Lucy Horowitz, Timothe Kasriel, Mihir Singhal, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Lucy Horowitz, Timothe Kasriel, and Mihir Singhal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le← CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le (TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:536): adapted
What was changed in
CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le--- TCSlib/CommunicationComplexity/DeterministicCC/DetRectangle.lean:536 (CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le) +++ as compiled here @@ -1,10 +1,6 @@ -open Rectangle in -/-- If the deterministic communication complexity of `g` is at most `n`, then every fooling -set for `g` has at most `2 ^ n` elements [Rou16, Cor 4.7] (also -[RY20, Ch. 1, §Using Fooling Sets]). Deviation: this is the exponential form of the -fooling-set bound `⌈log₂ |S|⌉ ≤ D(g)`; `clog_ncard_le_communicationComplexity` restates it -with `Nat.clog`. The proof combines the leaf-rectangle partition of a protocol of complexity -at most `n` with the fact that a fooling set meets each monochromatic rectangle in at most -one point. -/ -theorem foolingSet_ncard_le_pow_of_communicationComplexity_le +set_option relaxedAutoImplicit false in +set_option autoImplicit false in +variable {X Y α : Type*} in +open CommunicationComplexity.Rectangle in +theorem CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le (g : X → Y → α) (S : Set (X × Y)) (n : ℕ) - Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 12
- CommunicationComplexity.Deterministic.communicationComplexity_le_iffThreshold characterization of deterministic communication complexity. Let $f : X \to Y \to \alpha$ be a two-argument function and let $n$…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_isMonoPartitionLeaf rectangles of a protocol form a monochromatic partition. Let $p$ be a deterministic two-party communication protocol over input types…
- CommunicationComplexity.Rectangle.foolingSet_ncard_le_of_monoPartitionFooling set bound via monochromatic partition. Let $g : X \times Y \to \alpha$, let $S \subseteq X \times Y$ be a fooling set for $g$, and…
- CommunicationComplexity.Rectangle.IsMonoPartitionA collection $\mathcal{P}$ of subsets of $X \times Y$ is a monochromatic rectangle partition for $g : X \to Y \to \alpha$ if every…
- CommunicationComplexity.Deterministic.Protocol.leafRectanglesThe leaf rectangles of a protocol $p : \texttt{Protocol}\,X\,Y\,\alpha$ form the collection…
- CommunicationComplexity.Deterministic.communicationComplexityThe deterministic communication complexity of $f : X \to Y \to \alpha$ is defined as…
- CommunicationComplexity.Rectangle.IsFoolingSetA set $S \subseteq X \times Y$ is a fooling set for $g : X \to Y \to \alpha$ if every monochromatic rectangle with respect to $g$…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_finiteFiniteness of a protocol's leaf rectangles. For any deterministic two-party communication protocol $p$ over input types $X$ (Alice) and…
- CommunicationComplexity.Deterministic.Protocol.leafRectangles_cardLeaf rectangle count is at most two to the complexity. Let $p$ be a deterministic two-party communication protocol over input types $X$…
- CommunicationComplexity.Deterministic.ProtocolA deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob) producing a value of type $\alpha$ is an…
- CommunicationComplexity.Deterministic.Protocol.complexityThe communication complexity of a protocol $p$ is the worst-case total number of bits exchanged: an output node costs $0$, while an alice…
- CommunicationComplexity.Deterministic.Protocol.ComputesA protocol $p$ computes a two-argument function $f : X \to Y \to \alpha$ if $p.\texttt{run}\,x\,y = f\,x\,y$ for all inputs $x : X$…
- Used by 1
- CommunicationComplexity.Deterministic.clog_ncard_le_communicationComplexityFooling-set lower bound for deterministic communication complexity. Let $g : X \times Y \to \alpha$ be a two-argument function and let…
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.
set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} inopen CommunicationComplexity.Rectangle in/-- If the deterministic communication complexity of `g` is at most `n`, then every fooling set for `g` has at most `2 ^ n` elements [Rou16, Cor 4.7] (also [RY20, Ch. 1, §Using Fooling Sets]). Deviation: this is the exponential form of the fooling-set bound `⌈log₂ |S|⌉ ≤ D(g)`; `clog_ncard_le_communicationComplexity` restates it with `Nat.clog`. The proof combines the leaf-rectangle partition of a protocol of complexity at most `n` with the fact that a fooling set meets each monochromatic rectangle in at most one point. -/theorem CommunicationComplexity.Deterministic.foolingSet_ncard_le_pow_of_communicationComplexity_le (g : X → Y → α) (S : Set (X × Y)) (n : ℕ) (hS : Rectangle.IsFoolingSet S g) (h : communicationComplexity g ≤ n) : Set.ncard S ≤ 2 ^ n := by obtain ⟨p, hp, hc⟩ := (communicationComplexity_le_iff g n).mp h let Part := Protocol.leafRectangles p have hPart : Rectangle.IsMonoPartition Part g := Protocol.leafRectangles_isMonoPartition p g hp have hCard : Set.ncard Part ≤ 2 ^ n := (Protocol.leafRectangles_card p).trans (Nat.pow_le_pow_right (by omega) hc) exact (Rectangle.foolingSet_ncard_le_of_monoPartition hS hPart (Protocol.leafRectangles_finite p)).trans hCard