AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.aux_isRectangle

theoremverifiedimported Lean

Auxiliary leaf sets are rectangles. 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 set belonging to the auxiliary leaf-rectangle collection of $p$ relative to the constraint $A \times B$ is a rectangle; that is, if $R \subseteq X \times Y$ is one of these leaf sets, then $R = A' \times B'$ for some $A' \subseteq X$ and $B' \subseteq Y$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.aux_isRectangle (p : Protocol X Y α) (A : Set X) (B : Set Y)
    (R : Set (X × Y)) (hR : R ∈ leafRectanglesAux p A B) : Rectangle.IsRectangle R
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_isRectangle`
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
propext
Built on 3
Used by 1

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 a combinatorial rectangle. -/lemma CommunicationComplexity.Deterministic.Protocol.aux_isRectangle (p : Protocol X Y α) (A : Set X) (B : Set Y)    (R : Set (X × Y)) (hR : R ∈ leafRectanglesAux p A B) : Rectangle.IsRectangle R := by  induction p generalizing A B with  | output _ =>    simp only [leafRectanglesAux, Set.mem_singleton_iff] at hR    exact ⟨A, B, hR⟩  | alice f P ih =>    simp only [leafRectanglesAux, Set.mem_union] at hR    rcases hR with h | h <;> exact ih _ _ _ h  | bob f P ih =>    simp only [leafRectanglesAux, Set.mem_union] at hR    rcases hR with h | h <;> exact ih _ _ _ h
See it in the graphDiscuss this resultChallenge it