Theorems · Inductive type
FourierPair
(E : Type u_5) → (F : Type u_6) → [FourierTransform E F] → [FourierTransformInv F E] → Prop
A FourierPair is a pair of spaces E and F such that 𝓕⁻ ∘ 𝓕 = id on E.
- Defined in
- Mathlib.Analysis.Fourier.Notation
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FourierTransformInvstatement · cited by 25
- FourierTransformstatement · cited by 23
Cited by12
Results whose statement or proof uses this declaration.
- FourierPair.fourierInv_fourier_eqstatement and proof · cited by 7
- FourierTransform.fourierCLEstatement and proof · cited by 4
- FourierTransform.fourierEquivstatement and proof · cited by 4
- FourierTransform.fourierCLE_applystatement and proof · cited by 1
- FourierTransform.fourierCLE_symm_applystatement and proof · cited by 1
- FourierPair.casesOnstatement and proof · cited by 0
- FourierPair.recOnstatement and proof · cited by 0
- SchwartzMap.fourierTransformCLEstatement · cited by 0
- SchwartzMap.fourierTransformCLE_applystatement · cited by 0
- SchwartzMap.fourierTransformCLE_symm_applystatement · cited by 0
- FourierTransform.fourierEquiv_applystatement and proof · cited by 0
- FourierTransform.fourierEquiv_symm_applystatement and proof · cited by 0