Multiplication by a continuous matrix loop preserves
ProvedAsymptoticOperator.exists_coeff_eq_coeffMulasymptotic-operatorconley-zehnder-indexfourier-seriesunbounded-operator
Let with its Haar probability measure and let . For and let be its -th Fourier coefficient, computed componentwise after viewing the real entries of as complex numbers.
Let be continuous (no symmetry is assumed) and . Then there is with for every , where .
In other words, multiplication by a continuous matrix loop maps into itself. This is the zeroth-order term of the asymptotic operator .
Formalization note: L2 n, coeff and coeffMul come from the definition module AsymptoticOperator_Setting; L2 n is Lp (EuclideanSpace ℝ (Fin n ⊕ Fin n)) 2 over UnitAddCircle with AddCircle.haarAddCircle, coeff m k is and coeffMul S f k is , with applied to the complexified vector .
Preamble
import Definitions.Def_AsymptoticOperator_Setting
Formal statement
namespace AsymptoticOperator
open ConleyZehnder
/-- For a continuous loop `S` of matrices and `f ∈ L²(S¹, ℝ²ⁿ)`, the product `t ↦ S(t) f(t)`
is again in `L²`: some element of `L²` has Fourier coefficients `(S f)^ₖ` for every `k`. -/
theorem exists_coeff_eq_coeffMul {n : ℕ} (S : C(UnitAddCircle, Mat n)) (f : L2 n) :
∃ m : L2 n, ∀ k : ℤ, coeff m k = coeffMul S f k := by sorry
end AsymptoticOperator
Source
Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, §3.2, equation (3.4)