The asymptotic operator of a symmetric loop is symmetric
ProvedAsymptoticOperator.isSymmetricasymptotic-operatorconley-zehnder-indexspectral-theorysymplectic-geometryunbounded-operator
Let be continuous with for all . Then
Preamble
import Definitions.Def_AsymptoticOperator_Setting
Formal statement
namespace AsymptoticOperator
open ConleyZehnder
/-- Wendl §3.2, p. 55: for a loop of symmetric matrices, `A_S` is symmetric:
`⟨A_S f, g⟩ = ⟨f, A_S g⟩` for `f, g ∈ W^{1,2}`. -/
theorem isSymmetric {n : ℕ} (S : C(UnitAddCircle, Mat n)) (hS : IsSymLoop S) :
(asymptoticOperator S).IsFormalAdjoint (asymptoticOperator S) := by sorry
end AsymptoticOperator
Source
Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, §3.2, p. 55
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. For every (including ) and every continuous map such that for every , the operator (defined below) satisfies
Nothing else is asserted: in particular no density of the domain and no identification of the domain is part of this statement.
Meaning of the symbols.
- with its Haar probability measure ; is the space of real matrices indexed by ; .
- with the Euclidean inner product, and , the real Hilbert space of a.e.-classes of square-integrable maps with . Pointwise values of an element of are those of an arbitrary measurable representative.
- Fourier coefficients: and , (real entries viewed in ; Bochner integral, value if not integrable).
- is "in " iff is summable, the complex modulus, over all coordinates.
- is the set of pairs with in and for all .
- is defined by cases: if some partially defined real-linear operator on has graph exactly , then is such an operator (picked by choice); otherwise is the zero operator with domain all of (for which the identity above holds trivially, both sides being ). The theorem is about this whichever case occurs.
For , and the identity reads .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.