AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.aux_subset

theoremverifiedimported Lean

Auxiliary leaf rectangles lie within the constraint. Let $p$ be a deterministic two-party communication protocol over input types $X$ (Alice) and $Y$ (Bob), and let $A \subseteq X$ and $B \subseteq Y$. Then every rectangle $R$ in the collection of auxiliary leaf rectangles of $p$ constrained to $A \times B$ satisfies $R \subseteq A \times B$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.aux_subset (p : Protocol X Y α) (A : Set X) (B : Set Y)
    (R : Set (X × Y)) (hR : R ∈ leafRectanglesAux p A B) : R ⊆ A ×ˢ B
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_subset`
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.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 3

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false invariable {X Y α : Type*} in/-- Every leaf rectangle of `p` relative to `A ×ˢ B` is contained in `A ×ˢ B`. -/lemma CommunicationComplexity.Deterministic.Protocol.aux_subset (p : Protocol X Y α) (A : Set X) (B : Set Y)    (R : Set (X × Y)) (hR : R ∈ leafRectanglesAux p A B) : R ⊆ A ×ˢ B := by  induction p generalizing A B with  | output _ =>    simp only [leafRectanglesAux, Set.mem_singleton_iff] at hR    subst hR; exact le_refl _  | alice f P ih =>    simp only [leafRectanglesAux, Set.mem_union] at hR    rcases hR with h | h <;>      exact (ih _ _ _ h).trans (by intro ⟨x, y⟩ ⟨hx, hy⟩; exact ⟨hx.1, hy⟩)  | bob f P ih =>    simp only [leafRectanglesAux, Set.mem_union] at hR    rcases hR with h | h <;>      exact (ih _ _ _ h).trans (by intro ⟨x, y⟩ ⟨hx, hy⟩; exact ⟨hx, hy.1⟩)
See it in the graphDiscuss this resultChallenge it