OAI/Analysis/FactorGeneration/Convolution.lean
61 declarations, 0 contain sorry, 0 declared as axioms
Coordinate masks and permutations on the actual complex square-summable space. These implement the Hilbert-space operations used in lem:length-one-convolution.
- abbrev
OAI.Generator.SquareSpaceline 19 - theorem
OAI.Generator.squareSpace_norm_sqline 23 - def
OAI.Generator.coordinateMaskline 27 - theorem
OAI.Generator.coordinateMask_applyline 31 - theorem
OAI.Generator.coordinateMask_norm_leline 34 - theorem
OAI.Generator.coordinateMask_add_complline 40 - def
OAI.Generator.coordinatePermuteline 46 - theorem
OAI.Generator.coordinatePermute_applyline 49 - theorem
OAI.Generator.coordinatePermute_normline 52 - def
OAI.Generator.coordinatePermuteCLMline 60Source documentation
Reindexing by a permutation, as a bounded complex linear operator.
def coordinatePermuteCLM (e : X ≃ X) : SquareSpace X →L[ℂ] SquareSpace X := …
Mentions: OAI.Generator.SquareSpace
- theorem
OAI.Generator.coordinatePermuteCLM_applyline 67 - theorem
OAI.Generator.squareSpace_inner_zeroline 71Source documentation
Disjoint coordinate support implies genuine Hilbert orthogonality.
theorem squareSpace_inner_zero {f g : SquareSpace X} (h : ∀ x, f x = 0 ∨ g x = 0) : inner ℂ f g = 0 := by …Mentions: OAI.Generator.SquareSpace
- theorem
OAI.Generator.squareSpace_sum_norm_sqline 80Source documentation
Pythagoras for a finite family with disjoint supports.
theorem squareSpace_sum_norm_sq (s : Finset I) (f : I → SquareSpace X) (h : ∀ i ∈ s, ∀ j ∈ s, i ≠ j → ∀ x, f i x = 0 ∨ f j x = 0) : ‖∑ i ∈ s, f i‖ ^ 2 = ∑ i ∈ s, ‖f i‖ ^ 2 := by …Mentions: OAI.Generator.SquareSpace
- theorem
OAI.Generator.coordinateMask_sum_sq_leline 97Source documentation
The projections onto finitely many disjoint coordinate sets have total squared mass at most that of the original vector.
theorem coordinateMask_sum_sq_le (s : Finset I) (U : I → Set X) (hU : ∀ i ∈ s, ∀ j ∈ s, i ≠ j → Disjoint (U i) (U j)) (f : SquareSpace X) : ∑ i ∈ s, ‖coordinateMask (U i) f‖ ^ 2 ≤ ‖f‖ ^ 2 := by …Mentions: OAI.Generator.SquareSpace, OAI.Generator.coordinateMask
- abbrev
OAI.Generator.FreeConvolution.Letterline 138 - def
OAI.Generator.FreeConvolution.inverseLetterline 140 - def
OAI.Generator.FreeConvolution.letterline 141 - def
OAI.Generator.FreeConvolution.beginsline 142 - theorem
OAI.Generator.FreeConvolution.inverseLetter_inverseline 144 - theorem
OAI.Generator.FreeConvolution.inverseLetter_injectiveline 147 - theorem
OAI.Generator.FreeConvolution.letter_toWordline 150 - theorem
OAI.Generator.FreeConvolution.letter_inverseline 153 - theorem
OAI.Generator.FreeConvolution.letter_trueline 156 - theorem
OAI.Generator.FreeConvolution.letter_falseline 158 - theorem
OAI.Generator.FreeConvolution.letter_injectiveline 161 - theorem
OAI.Generator.FreeConvolution.begins_letter_mulline 167Source documentation
A noncancelling left multiplication creates its signed letter as the head.
theorem begins_letter_mul (a : Letter A) (w : FreeGroup A) (h : ¬ begins (inverseLetter a) w) : begins a (letter a * w) := by …Mentions: OAI.Generator.FreeConvolution.Letter, OAI.Generator.FreeConvolution.begins, OAI.Generator.FreeConvolution.inverseLetter, OAI.Generator.FreeConvolution.letter
- def
OAI.Generator.FreeConvolution.leftRegularline 185Source documentation
The actual left regular translation λ(g)η(x)=η(g⁻¹x).
def leftRegular (g : FreeGroup A) : SquareSpace (FreeGroup A) →L[ℂ] SquareSpace (FreeGroup A) := …
Mentions: OAI.Generator.SquareSpace
- theorem
OAI.Generator.FreeConvolution.leftRegular_applyline 188 - theorem
OAI.Generator.FreeConvolution.leftRegular_normline 191 - def
OAI.Generator.FreeConvolution.creationline 194 - def
OAI.Generator.FreeConvolution.cancellationline 197 - theorem
OAI.Generator.FreeConvolution.creation_add_cancellationline 200 - theorem
OAI.Generator.FreeConvolution.creation_supportline 209 - theorem
OAI.Generator.FreeConvolution.begins_disjointline 217 - theorem
OAI.Generator.FreeConvolution.creation_norm_leline 223 - theorem
OAI.Generator.FreeConvolution.creation_sum_boundline 228 - theorem
OAI.Generator.FreeConvolution.cancellation_sum_boundline 253 - theorem
OAI.Generator.FreeConvolution.length_one_convolution_vector_boundline 270Source documentation
The manuscript's length-one bound on every vector of ℓ²(FreeGroup A).
theorem length_one_convolution_vector_bound (s : Finset (Letter A)) (b : Letter A → ℂ) (f : SquareSpace (FreeGroup A)) : ‖(∑ a ∈ s, b a • leftRegular (letter a)) f‖ ≤ (2 * Real.sqrt (∑ a ∈ s, ‖b a‖ ^ 2)) * ‖f‖ := by …Mentions: OAI.Generator.FreeConvolution.Letter, OAI.Generator.SquareSpace, OAI.Generator.FreeConvolution.leftRegular, OAI.Generator.FreeConvolution.letter
- theorem
OAI.Generator.FreeConvolution.length_one_convolution_operator_boundline 285Source documentation
The length-one convolution estimate for the operator norm of the left regular action.
theorem length_one_convolution_operator_bound (s : Finset (Letter A)) (b : Letter A → ℂ) : ‖∑ a ∈ s, b a • leftRegular (letter a)‖ ≤ 2 * Real.sqrt (∑ a ∈ s, ‖b a‖ ^ 2) := by …Mentions: OAI.Generator.FreeConvolution.Letter, OAI.Generator.FreeConvolution.leftRegular, OAI.Generator.FreeConvolution.letter
- def
OAI.Generator.FreeConvolution.leftRegularHomline 304 - def
OAI.Generator.FreeConvolution.regularline 309 - def
OAI.Generator.FreeConvolution.realRegularline 312 - def
OAI.Generator.FreeConvolution.deltaline 315 - theorem
OAI.Generator.FreeConvolution.delta_applyline 317 - theorem
OAI.Generator.FreeConvolution.delta_normline 320 - theorem
OAI.Generator.FreeConvolution.leftRegular_delta_applyline 323 - theorem
OAI.Generator.FreeConvolution.regular_delta_applyline 328Source documentation
Applying the actual convolution operator to δ₁ recovers every coefficient.
theorem regular_delta_apply (f : MonoidAlgebra ℂ (FreeGroup A)) (x : FreeGroup A) : regular f delta x = f.coeff x := by …Mentions: OAI.Generator.FreeConvolution.regular, OAI.Generator.FreeConvolution.delta
- theorem
OAI.Generator.FreeConvolution.realRegular_delta_applyline 335 - theorem
OAI.Generator.FreeConvolution.regular_single_deltaline 344 - theorem
OAI.Generator.FreeConvolution.regular_delta_orthonormalline 350 - theorem
OAI.Generator.FreeConvolution.regular_coefficient_isometryline 368Source documentation
Exact finite coefficient L² isometry in the regular representation.
theorem regular_coefficient_isometry (f : MonoidAlgebra ℂ (FreeGroup A)) : ‖regular f delta‖ ^ 2 = ∑ x ∈ f.coeff.support, ‖f.coeff x‖ ^ 2 := by …Mentions: OAI.Generator.FreeConvolution.regular, OAI.Generator.FreeConvolution.delta
- theorem
OAI.Generator.FreeConvolution.regular_delta_norm_leline 378Source documentation
Coefficient domination implies the ℓ² inequality; no comparison between operator norms in distinct representations is used.
theorem regular_delta_norm_le {f : MonoidAlgebra ℂ (FreeGroup A)} {a : MonoidAlgebra ℝ (FreeGroup A)} (h : ∀ x, ‖f.coeff x‖ ≤ a.coeff x) : ‖regular f delta‖ ≤ ‖realRegular a delta‖ := by …Mentions: OAI.Generator.FreeConvolution.regular, OAI.Generator.FreeConvolution.delta, OAI.Generator.FreeConvolution.realRegular
- theorem
OAI.Generator.FreeConvolution.realRegular_pow_delta_norm_leline 387Source documentation
Actual coefficient-vector power estimate.
theorem realRegular_pow_delta_norm_le (a : MonoidAlgebra ℝ (FreeGroup A)) (d : ℕ) : ‖realRegular (a ^ d) delta‖ ≤ ‖realRegular a‖ ^ d := by …Mentions: OAI.Generator.FreeConvolution.realRegular, OAI.Generator.FreeConvolution.delta
- theorem
OAI.Generator.groupRing_linear_combinationline 407Source documentation
Linear images of a group-ring sum are its literal finite coefficient combination.
theorem groupRing_linear_combination (Ψ : MonoidAlgebra ℂ G →ₗ[ℂ] E) (f : MonoidAlgebra ℂ G) : Ψ f = ∑ g ∈ f.coeff.support, f.coeff g • Ψ (MonoidAlgebra.single g 1) := by … - theorem
OAI.Generator.groupRing_coefficient_isometryline 419Source documentation
The source's coefficient isometry from actual orthonormal word images.
theorem groupRing_coefficient_isometry (Ψ : MonoidAlgebra ℂ G →ₗ[ℂ] E) (hΨ : Orthonormal ℂ (fun g => Ψ (MonoidAlgebra.single g 1))) (f : MonoidAlgebra ℂ G) : ‖Ψ f‖ ^ 2 = ∑ g ∈ f.coeff.support, ‖f.coeff g‖ ^ 2 := by … - theorem
OAI.Generator.groupRing_norm_eq_of_orthonormalline 431Source documentation
Two orthonormal realizations have exactly the same coefficient norm.
theorem groupRing_norm_eq_of_orthonormal {E' : Type*} [NormedAddCommGroup E'] [InnerProductSpace ℂ E'] (Ψ : MonoidAlgebra ℂ G →ₗ[ℂ] E) (Θ : MonoidAlgebra ℂ G →ₗ[ℂ] E') (hΨ : Orthonormal ℂ (fun g => Ψ (MonoidAlgebra.single g 1))) (hΘ : Orthonormal ℂ (fun g => Θ (MonoidAlgebra.single g 1))) (f : MonoidAlgebra ℂ G) : ‖Ψ f‖ = ‖Θ f‖ := by … - theorem
OAI.Generator.groupRing_norm_eq_regularline 442Source documentation
For orthonormal word images, the finite coefficient norm agrees with the regular representation norm.
theorem groupRing_norm_eq_regular {A : Type*} (Ψ : MonoidAlgebra ℂ (FreeGroup A) →ₗ[ℂ] E) (hΨ : Orthonormal ℂ (fun g => Ψ (MonoidAlgebra.single g 1))) (f : MonoidAlgebra ℂ (FreeGroup A)) : ‖Ψ f‖ = ‖FreeConvolution.regular f FreeConvolution.delta‖ := by …Mentions: OAI.Generator.FreeConvolution.regular, OAI.Generator.FreeConvolution.delta
- def
OAI.Generator.prefixLetterSupportline 457 - def
OAI.Generator.prefixWeightline 460 - theorem
OAI.Generator.prefixWeight_square_sum_leline 464Source documentation
The exact collected multiplicities imply the required square-coefficient budget.
theorem prefixWeight_square_sum_le (n : ℕ) (hn : 0 < n) (α : ℝ) : ∑ a ∈ prefixLetterSupport n, ‖(prefixWeight n α a : ℂ)‖ ^ 2 ≤ α ^ 2 := by …Mentions: OAI.Generator.prefixLetterSupport, OAI.Generator.prefixWeight
- theorem
OAI.Generator.prefix_convolution_operator_boundline 490Source documentation
The manuscript's actual coefficient family has convolution norm at most 2α.
theorem prefix_convolution_operator_bound (n : ℕ) (hn : 0 < n) (α : ℝ) (hα : 0 ≤ α) : ‖∑ a ∈ prefixLetterSupport n, (prefixWeight n α a : ℂ) • leftRegular (letter a)‖ ≤ 2 * α := by …Mentions: OAI.Generator.prefixLetterSupport, OAI.Generator.prefixWeight