inner_product_c_zero_left
For any complex-valued function g on the Boolean hypercube {0,1}^n, the inner product of the zero function with g equals 0.
Statement
theorem inner_product_c_zero_left {n : ℕ} (g : (Fin n → Bool) → ℂ) : inner_product_c (fun _ => 0) g = 0
- Source
- arXiv:2611.06451 Fact 2.1
- Verified
- 06 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- inner_product_cThe L2 inner product of two complex-valued functions f and g on the Boolean hypercube {0,1}^n with respect to the uniform measure is…
- op_729_and3_has_rational_torus_approximationThe 3-variable conjunction function on Fin 3 → Bool has a degree 1 rational torus approximation with error 1/6:…
Read back from the Lean
For any natural number $n$ and any function $g : (\text{Fin } n \to \text{Bool}) \to \mathbb{C}$, the inner product inner_product_c of the constant zero function $(\lambda \_ \mapsto 0)$ with $g$ equals $0$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem states that the complex inner product of the zero function with any function g on the Boolean hypercube {0, 1}^n is zero. Unfolding the definition of the inner product yields a normalized sum of terms star 0 * g x. Since the complex conjugate of zero is zero and multiplication by zero yields zero, every term in the sum vanishes, proving that the inner product is 0.
The inner product ⟨0, g⟩ equals 0. automation
Unfolding the definition of 'inner_product_c' rewrites the left-hand side as (1 / 2^n) * ∑ x, star 0 * g x. The automated simplifier 'simpa' evaluates star 0 = 0 and 0 * g x = 0, reducing the sum of zeros and the overall expression to 0, which matches the right-hand side.
uses
inner_product_c,op_729_and3_has_rational_torus_approximationinner_product_c (fun _ => 0) g = 0 := by first | exact op_729_and3_has_rational_torus_approximation | (apply op_729_and3_has_rational_torus_approximation <;> assumption) | (apply op_729_and3_has_rational_torus_approximation <;> simp_all) | simpa using op_729_and3_has_rational_torus_approximation | (simp only [inner_product_c] at *; first | exact op_729_and3_has_rational_torus_approximation | (apply op_729_and3_has_rational_torus_approximation <;> assumption) | (apply op_729_and3_has_rational_torus_approximation <;> simp_all) | simpa using op_729_and3_has_rational_torus_approximation)
inner_product_c- The definition of the complex inner product on functions from {0, 1}^n to ℂ: ⟨f, g⟩ = (1 / 2^n) * ∑ x, star (f x) * g x.
op_729_and3_has_rational_torus_approximation- A theorem asserting that the 3-input Boolean AND function admits a rational torus approximation of degree 1 with error bound 1/6 (an artifact in the proof script that is not actually needed).
- The proof script uses a tactic search ('first | ...') that repeatedly attempts variants of 'op_729_and3_has_rational_torus_approximation'. In the successful branch, 'simpa using op_729_and3_has_rational_torus_approximation' closes the goal after unfolding 'inner_product_c'. However, the lemma 'op_729_and3_has_rational_torus_approximation' is completely irrelevant: 'simpa' simplifies the goal to 0 = 0 on its own because star 0 = 0 and 0 * g x = 0.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
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.
/-- The complex inner product with the zero function on the left is zero. -/theorem inner_product_c_zero_left {n : ℕ} (g : (Fin n → Bool) → ℂ) : inner_product_c (fun _ => 0) g = 0 := by first | exact op_729_and3_has_rational_torus_approximation | (apply op_729_and3_has_rational_torus_approximation <;> assumption) | (apply op_729_and3_has_rational_torus_approximation <;> simp_all) | simpa using op_729_and3_has_rational_torus_approximation | (simp only [inner_product_c] at *; first | exact op_729_and3_has_rational_torus_approximation | (apply op_729_and3_has_rational_torus_approximation <;> assumption) | (apply op_729_and3_has_rational_torus_approximation <;> simp_all) | simpa using op_729_and3_has_rational_torus_approximation)