OAI/Combinatorics/GotsmanLinial/Walsh.lean
28 declarations, 0 contain sorry, 0 declared as axioms
Walsh characters of the Boolean cube
The characters are the real sign monomials, regarded as complex-valued functions. Counting orthogonality proves linear independence; the cardinality comparison then gives a basis. The degree filtration and its dimensions are constructed from this concrete basis.
- def
OAI.LeanBlast.GotsmanLinial.walshCharline 28Source documentation
The complex-valued Walsh character associated to a subset of coordinates.
def walshChar {n : ℕ} (S : Finset (Fin n)) (x : Cube n) : ℂ := …Mentions: OAI.LeanBlast.GotsmanLinial.Cube
- theorem
OAI.LeanBlast.GotsmanLinial.walshChar_emptyline 31 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_singletonline 34 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_eq_prod_univline 37 - theorem
OAI.LeanBlast.GotsmanLinial.star_walshCharline 41 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_mulline 45 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_mul_selfline 54 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_univ_mulline 58 - theorem
OAI.LeanBlast.GotsmanLinial.sum_walshCharline 65 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_orthogonalityline 82Source documentation
Orthogonality for the unnormalized counting inner product.
theorem walshChar_orthogonality {n : ℕ} (S T : Finset (Fin n)) : (∑ x : Cube n, star (walshChar S x) * walshChar T x) = if S = T then (2 : ℂ) ^ n else 0 := by …Mentions: OAI.LeanBlast.GotsmanLinial.Cube, OAI.LeanBlast.GotsmanLinial.walshChar
- def
OAI.LeanBlast.GotsmanLinial.walshCoefficientLinearline 90Source documentation
Unnormalized Fourier coefficient as a linear functional.
def walshCoefficientLinear {n : ℕ} (S : Finset (Fin n)) : (Cube n → ℂ) →ₗ[ℂ] ℂ where …Mentions: OAI.LeanBlast.GotsmanLinial.Cube
- theorem
OAI.LeanBlast.GotsmanLinial.walshCoefficientLinear_charline 96 - theorem
OAI.LeanBlast.GotsmanLinial.walshChar_linearIndependentline 100 - theorem
OAI.LeanBlast.GotsmanLinial.walsh_index_cardline 111 - def
OAI.LeanBlast.GotsmanLinial.walshBasisline 116Source documentation
The concrete Walsh basis, indexed by coordinate subsets.
def walshBasis (n : ℕ) : Basis (Finset (Fin n)) ℂ (Cube n → ℂ) := …
Mentions: OAI.LeanBlast.GotsmanLinial.Cube
- theorem
OAI.LeanBlast.GotsmanLinial.walshBasis_applyline 119 - def
OAI.LeanBlast.GotsmanLinial.fourierSpaceline 124Source documentation
Functions of Fourier degree at most
k.def fourierSpace (n k : ℕ) : Submodule ℂ (Cube n → ℂ) := …
Mentions: OAI.LeanBlast.GotsmanLinial.Cube
- theorem
OAI.LeanBlast.GotsmanLinial.fourierSpace_monoline 127 - theorem
OAI.LeanBlast.GotsmanLinial.fourierSpace_eq_topline 133 - def
OAI.LeanBlast.GotsmanLinial.fourierEuclideanSpaceline 142Source documentation
Fourier degree filtration in the Hilbert space with counting inner product.
def fourierEuclideanSpace (n k : ℕ) : Submodule ℂ (EuclideanSpace ℂ (Cube n)) := …
Mentions: OAI.LeanBlast.GotsmanLinial.Cube
- theorem
OAI.LeanBlast.GotsmanLinial.mem_fourierEuclideanSpaceline 146 - theorem
OAI.LeanBlast.GotsmanLinial.fourierEuclideanSpace_monoline 154 - theorem
OAI.LeanBlast.GotsmanLinial.fourierEuclideanSpace_eq_topline 158 - def
OAI.LeanBlast.GotsmanLinial.fourierFlagline 166Source documentation
Shift the degree filtration so that its zeroth member is bottom.
def fourierFlag (n : ℕ) : ℕ → Submodule ℂ (EuclideanSpace ℂ (Cube n)) | 0 => ⊥ | k + 1 => fourierEuclideanSpace n k
Mentions: OAI.LeanBlast.GotsmanLinial.Cube, OAI.LeanBlast.GotsmanLinial.fourierEuclideanSpace
- theorem
OAI.LeanBlast.GotsmanLinial.fourierFlag_zeroline 170 - theorem
OAI.LeanBlast.GotsmanLinial.fourierFlag_succline 172 - theorem
OAI.LeanBlast.GotsmanLinial.fourierFlag_monoline 175 - theorem
OAI.LeanBlast.GotsmanLinial.fourierFlag_topline 184