Download data/lean/OAI/Analysis/HilbertCrouzeix/Definitions.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.66 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/HilbertCrouzeix/Definitions.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/HilbertCrouzeix/Definitions.lean
-
curl -L -o Definitions.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/HilbertCrouzeix/Definitions.lean
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 | |