AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.Protocol.aux_alice_bit

theoremverifiedimported Lean

Alice's bit is fixed on a child's leaf rectangle. Let $p$ be a protocol on $X \times Y$, let $A \subseteq X$, $B \subseteq Y$, let $f : X \to \{0,1\}$ be the bit Alice sends, and let $b$ be a bit. If $R$ is a leaf rectangle of $p$ run on the restricted input set $(A \cap \{x \mid f(x) = b\}) \times B$, then every input $(x, y) \in R$ satisfies $f(x) = b$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
lemma CommunicationComplexity.Deterministic.Protocol.aux_alice_bit {p : Protocol X Y α} {A : Set X} {B : Set Y} {f : X → Bool}
    {b : Bool} {R : Set (X × Y)} (hR : R ∈ leafRectanglesAux p (A ∩ {x | f x = b}) B)
    {x : X} {y : Y} (hxy : (x, y) ∈ R) : f x = b
Source
TCSlib, `CommunicationComplexity.Deterministic.Protocol.aux_alice_bit`
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 3
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- Shared bit-split step of the `alice` branches: a leaf rectangle of the child reached on Alice's bit `b` only contains inputs `(x, y)` with `f x = b` (via `aux_subset`). -/
lemma CommunicationComplexity.Deterministic.Protocol.aux_alice_bit {p : Protocol X Y α} {A : Set X} {B : Set Y} {f : X → Bool}
    {b : Bool} {R : Set (X × Y)} (hR : R ∈ leafRectanglesAux p (A ∩ {x | f x = b}) B)
    {x : X} {y : Y} (hxy : (x, y) ∈ R) : f x = b :=
  (aux_subset p _ _ R hR hxy).1.2
See it in the graphDiscuss this resultChallenge it