AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.flipAt_apply_ne

theoremverifiedimported Lean

Flip leaves other coordinates unchanged. Let $x \colon \mathrm{Fin}\,n \to \mathrm{Bool}$ be an $n$-bit Boolean input, and let $i, j \in \mathrm{Fin}\,n$ be coordinates with $j \ne i$. Then the input obtained from $x$ by flipping its $i$-th coordinate agrees with $x$ at coordinate $j$; that is, its value at $j$ equals $x(j)$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
@[simp] lemma CommunicationComplexity.flipAt_apply_ne {n : ℕ} {i j : Fin n} (hij : j ≠ i) (x : BoolInput n) :
    flipAt i x j = x j
Source
TCSlib, `CommunicationComplexity.flipAt_apply_ne`
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 2

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false in/-- Flipping coordinate `i` leaves every other coordinate `j ≠ i` unchanged. -/@[simp] lemma CommunicationComplexity.flipAt_apply_ne {n : ℕ} {i j : Fin n} (hij : j ≠ i) (x : BoolInput n) :    flipAt i x j = x j := by  simp [flipAt, hij]
See it in the graphDiscuss this resultChallenge it