math / data /lean /OAI /Analysis /HilbertCrouzeix /Definitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.66 kB
import Mathlib
namespace OAI
noncomputable section
open Complex Set
open scoped TensorProduct Matrix.Norms.L2Operator Classical ComplexConjugate
namespace HilbertCrouzeix
universe u
abbrev Coeff (m : β„•) := Matrix (Fin m) (Fin m) β„‚
abbrev CoeffSpace (m : β„•) := EuclideanSpace β„‚ (Fin m)
variable {H : Type u} [NormedAddCommGroup H] [InnerProductSpace β„‚ H]
def numericalRange (A : H β†’L[β„‚] H) : Set β„‚ :=
{z | βˆƒ x : H, β€–xβ€– = 1 ∧ inner β„‚ x (A x) = z}
def numericalClosure (A : H β†’L[β„‚] H) : Set β„‚ := closure (numericalRange A)
abbrev Amplification (H : Type u) [NormedAddCommGroup H] [InnerProductSpace β„‚ H]
(m : β„•) := UniformSpace.Completion (H βŠ—[β„‚] CoeffSpace m)
def tensorOp {m : β„•} (A : H β†’L[β„‚] H) (B : Coeff m) :
Amplification H m β†’L[β„‚] Amplification H m :=
(TensorProduct.mapL A (Matrix.toEuclideanCLM (n := Fin m) (π•œ := β„‚) B)).completion
def matrixPolynomial {m d : β„•} (B : Fin (d + 1) β†’ Coeff m) (z : β„‚) : Coeff m :=
βˆ‘ k : Fin (d + 1), z ^ k.val β€’ B k
def polynomialEval {m d : β„•} (A : H β†’L[β„‚] H) (B : Fin (d + 1) β†’ Coeff m) :
Amplification H m β†’L[β„‚] Amplification H m :=
βˆ‘ k : Fin (d + 1), tensorOp (A ^ k.val) (B k)
def normSup {E : Type*} [Norm E] (S : Set β„‚) (f : β„‚ β†’ E) : ℝ :=
if S.Nonempty then sSup ((fun z => β€–f zβ€–) '' S) else 0
def contourIntegral {E : Type*} [NormedAddCommGroup E] [NormedSpace β„‚ E]
(Ξ³ : ℝ β†’ β„‚) (f : β„‚ β†’ E) : E :=
∫ t : ℝ in (0 : ℝ)..1, deriv Ξ³ t β€’ f (Ξ³ t)
def contourIndex (Ξ³ : ℝ β†’ β„‚) (z : β„‚) : β„‚ :=
(2 * (Real.pi : β„‚) * Complex.I)⁻¹ * contourIntegral Ξ³ (fun w => (w - z)⁻¹)
def IsCauchyContour (K U : Set β„‚) (Ξ³ : ℝ β†’ β„‚) : Prop :=
ContDiff ℝ 1 Ξ³ ∧ Ξ³ 0 = Ξ³ 1 ∧
(βˆ€ t ∈ Set.Icc (0 : ℝ) 1, Ξ³ t ∈ U \ K) ∧
(βˆ€ z ∈ K, contourIndex Ξ³ z = 1) ∧
(βˆ€ z βˆ‰ U, contourIndex Ξ³ z = 0)
def chosenContour (K U : Set β„‚) : ℝ β†’ β„‚ :=
Classical.epsilon (IsCauchyContour K U)
variable [CompleteSpace H]
def dunfordIntegral (A : H β†’L[β„‚] H) (Ξ³ : ℝ β†’ β„‚) (f : β„‚ β†’ β„‚) : H β†’L[β„‚] H :=
(2 * (Real.pi : β„‚) * Complex.I)⁻¹ β€’
contourIntegral Ξ³ (fun z => f z β€’ resolvent A z)
def holomorphicCalculus (A : H β†’L[β„‚] H) (U : Set β„‚) (f : β„‚ β†’ β„‚) : H β†’L[β„‚] H :=
dunfordIntegral A (chosenContour (numericalClosure A) U) f
def matrixUnit {m : β„•} (i j : Fin m) : Coeff m := Matrix.single i j 1
def holomorphicEval {m : β„•} (A : H β†’L[β„‚] H) (U : Set β„‚) (F : β„‚ β†’ Coeff m) :
Amplification H m β†’L[β„‚] Amplification H m :=
βˆ‘ i : Fin m, βˆ‘ j : Fin m,
tensorOp (holomorphicCalculus A U (fun z => F z i j)) (matrixUnit i j)
def contourEval {m : β„•} (A : H β†’L[β„‚] H) (Ξ³ : ℝ β†’ β„‚) (F : β„‚ β†’ Coeff m) :
Amplification H m β†’L[β„‚] Amplification H m :=
βˆ‘ i : Fin m, βˆ‘ j : Fin m,
tensorOp (dunfordIntegral A Ξ³ (fun z => F z i j)) (matrixUnit i j)
def HolomorphicOn {m : β„•} (F : β„‚ β†’ Coeff m) (U : Set β„‚) : Prop :=
βˆ€ i j, DifferentiableOn β„‚ (fun z => F z i j) U
abbrev RationalMatrix (m : β„•) := Matrix (Fin m) (Fin m) (RatFunc β„‚)
def poleFreeSet {m : β„•} (R : RationalMatrix m) : Set β„‚ :=
{z | βˆ€ i j, (R i j).denom.eval z β‰  0}
def rationalFunction {m : β„•} (R : RationalMatrix m) (z : β„‚) : Coeff m :=
fun i j => RatFunc.eval (RingHom.id β„‚) z (R i j)
def rationalCalculus (A : H β†’L[β„‚] H) (r : RatFunc β„‚) : H β†’L[β„‚] H :=
Polynomial.aeval A r.num * Ring.inverse (Polynomial.aeval A r.denom)
def rationalEval {m : β„•} (A : H β†’L[β„‚] H) (R : RationalMatrix m) :
Amplification H m β†’L[β„‚] Amplification H m :=
βˆ‘ i : Fin m, βˆ‘ j : Fin m, tensorOp (rationalCalculus A (R i j)) (matrixUnit i j)
def PolynomialConclusion (A : H β†’L[β„‚] H) : Prop :=
βˆ€ (m : β„•), 0 < m β†’ βˆ€ (d : β„•) (B : Fin (d + 1) β†’ Coeff m),
β€–polynomialEval A Bβ€– ≀ 2 * normSup (numericalRange A) (matrixPolynomial B) ∧
2 * normSup (numericalRange A) (matrixPolynomial B) =
2 * normSup (numericalClosure A) (matrixPolynomial B) ∧
IsGreatest ((fun z => β€–matrixPolynomial B zβ€–) '' numericalClosure A)
(normSup (numericalClosure A) (matrixPolynomial B))
def HolomorphicConclusion (A : H β†’L[β„‚] H) : Prop :=
βˆ€ (m : β„•), 0 < m β†’ βˆ€ (U : Set β„‚), IsOpen U β†’ numericalClosure A βŠ† U β†’
βˆ€ (F : β„‚ β†’ Coeff m), HolomorphicOn F U β†’
(βˆƒ Ξ³, IsCauchyContour (numericalClosure A) U Ξ³) ∧
(βˆ€ Ξ³, IsCauchyContour (numericalClosure A) U Ξ³ β†’
βˆ€ i j, dunfordIntegral A Ξ³ (fun z => F z i j) =
holomorphicCalculus A U (fun z => F z i j)) ∧
IsGreatest ((fun z => β€–F zβ€–) '' numericalClosure A)
(normSup (numericalClosure A) F) ∧
β€–holomorphicEval A U Fβ€– ≀ 2 * normSup (numericalClosure A) F
def RationalConclusion (A : H β†’L[β„‚] H) : Prop :=
βˆ€ (m : β„•), 0 < m β†’ βˆ€ (R : RationalMatrix m),
numericalClosure A βŠ† poleFreeSet R β†’
(βˆ€ i j, IsUnit (Polynomial.aeval A (R i j).denom)) ∧
rationalEval A R = holomorphicEval A (poleFreeSet R) (rationalFunction R) ∧
IsGreatest ((fun z => β€–rationalFunction R zβ€–) '' numericalClosure A)
(normSup (numericalClosure A) (rationalFunction R)) ∧
β€–rationalEval A Rβ€– ≀ 2 * normSup (numericalClosure A) (rationalFunction R)
def NonzeroConclusion (A : H β†’L[β„‚] H) : Prop :=
IsCompact (numericalClosure A) ∧ Convex ℝ (numericalClosure A) ∧
spectrum β„‚ A βŠ† numericalClosure A ∧ PolynomialConclusion A ∧
HolomorphicConclusion A ∧ RationalConclusion A
def ZeroConclusion (A : H β†’L[β„‚] H) : Prop :=
numericalRange A = βˆ… ∧
(βˆ€ (m : β„•) (F : β„‚ β†’ Coeff m), normSup (numericalRange A) F = 0) ∧
βˆ€ (m : β„•), 0 < m β†’
(βˆ€ T : Amplification H m β†’L[β„‚] Amplification H m, T = 0) ∧
(βˆ€ (d : β„•) (B : Fin (d + 1) β†’ Coeff m), polynomialEval A B = 0 ∧
β€–polynomialEval A Bβ€– ≀ 2 * normSup (numericalRange A) (matrixPolynomial B)) ∧
(βˆ€ (U : Set β„‚) (F : β„‚ β†’ Coeff m), holomorphicEval A U F = 0 ∧
β€–holomorphicEval A U Fβ€– ≀ 2 * normSup (numericalRange A) F) ∧
(βˆ€ (R : RationalMatrix m), rationalEval A R = 0 ∧
β€–rationalEval A Rβ€– ≀ 2 * normSup (numericalRange A) (rationalFunction R))
def UniformlySharp : Prop :=
βˆ€ c : ℝ, c < 2 β†’ βˆƒ (n m d : β„•), 0 < n ∧ 0 < m ∧
βˆƒ (A : CoeffSpace n β†’L[β„‚] CoeffSpace n) (B : Fin (d + 1) β†’ Coeff m),
c * normSup (numericalRange A) (matrixPolynomial B) < β€–polynomialEval A Bβ€–
end HilbertCrouzeix
end
end OAI