Context
stringlengths
57
6.04k
file_name
stringlengths
21
79
start
int64
14
1.49k
end
int64
18
1.5k
theorem
stringlengths
25
1.55k
proof
stringlengths
5
7.36k
rank
int64
0
2.4k
import Mathlib.Analysis.Calculus.ContDiff.Basic import Mathlib.Analysis.Calculus.Deriv.Linear import Mathlib.Analysis.Complex.Conformal import Mathlib.Analysis.Calculus.Conformal.NormedSpace #align_import analysis.complex.real_deriv from "leanprover-community/mathlib"@"3bce8d800a6f2b8f63fe1e588fd76a9ff4adcebe" se...
Mathlib/Analysis/Complex/RealDeriv.lean
162
166
theorem DifferentiableAt.conformalAt (h : DifferentiableAt β„‚ f z) (hf' : deriv f z β‰  0) : ConformalAt f z := by
rw [conformalAt_iff_isConformalMap_fderiv, (h.hasFDerivAt.restrictScalars ℝ).fderiv] apply isConformalMap_complex_linear simpa only [Ne, ext_ring_iff]
1,872
import Mathlib.Analysis.Calculus.ContDiff.Basic import Mathlib.Analysis.Calculus.Deriv.Linear import Mathlib.Analysis.Complex.Conformal import Mathlib.Analysis.Calculus.Conformal.NormedSpace #align_import analysis.complex.real_deriv from "leanprover-community/mathlib"@"3bce8d800a6f2b8f63fe1e588fd76a9ff4adcebe" se...
Mathlib/Analysis/Complex/RealDeriv.lean
171
185
theorem conformalAt_iff_differentiableAt_or_differentiableAt_comp_conj {f : β„‚ β†’ β„‚} {z : β„‚} : ConformalAt f z ↔ (DifferentiableAt β„‚ f z ∨ DifferentiableAt β„‚ (f ∘ conj) (conj z)) ∧ fderiv ℝ f z β‰  0 := by
rw [conformalAt_iff_isConformalMap_fderiv] rw [isConformalMap_iff_is_complex_or_conj_linear] apply and_congr_left intro h have h_diff := h.imp_symm fderiv_zero_of_not_differentiableAt apply or_congr Β· rw [differentiableAt_iff_restrictScalars ℝ h_diff] rw [← conj_conj z] at h_diff rw [differentiableAt...
1,872
import Mathlib.MeasureTheory.Measure.Haar.Basic import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Measure.Haar.Unique open MeasureTheory Measure Set open scoped ENNReal variable {π•œ E F : Type*} [NontriviallyNormedField π•œ] [CompleteSpace π•œ] [NormedAddCommGroup E] [MeasurableSp...
Mathlib/MeasureTheory/Measure/Haar/Disintegration.lean
42
102
theorem LinearMap.exists_map_addHaar_eq_smul_addHaar' (h : Function.Surjective L) : βˆƒ (c : ℝβ‰₯0∞), 0 < c ∧ c < ∞ ∧ ΞΌ.map L = (c * addHaar (univ : Set (LinearMap.ker L))) β€’ Ξ½ := by
/- This is true for the second projection in product spaces, as the projection of the Haar measure `ΞΌS.prod ΞΌT` is equal to the Haar measure `ΞΌT` multiplied by the total mass of `ΞΌS`. This is also true for linear equivalences, as they map Haar measure to Haar measure. The general case follows from these two an...
1,873
import Mathlib.MeasureTheory.Measure.Haar.Basic import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Measure.Haar.Unique open MeasureTheory Measure Set open scoped ENNReal variable {π•œ E F : Type*} [NontriviallyNormedField π•œ] [CompleteSpace π•œ] [NormedAddCommGroup E] [MeasurableSp...
Mathlib/MeasureTheory/Measure/Haar/Disintegration.lean
106
109
theorem LinearMap.exists_map_addHaar_eq_smul_addHaar (h : Function.Surjective L) : βˆƒ (c : ℝβ‰₯0∞), 0 < c ∧ ΞΌ.map L = c β€’ Ξ½ := by
rcases L.exists_map_addHaar_eq_smul_addHaar' μ ν h with ⟨c, c_pos, -, hc⟩ exact ⟨_, by simp [c_pos, NeZero.ne addHaar], hc⟩
1,873
import Mathlib.Analysis.Analytic.Basic import Mathlib.Analysis.Analytic.Composition import Mathlib.Analysis.Analytic.Linear import Mathlib.Analysis.Calculus.FDeriv.Analytic import Mathlib.Geometry.Manifold.ChartedSpace import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.Analysis.Calculus.ContDiff.Basic ...
Mathlib/Geometry/Manifold/SmoothManifoldWithCorners.lean
256
258
theorem target_eq : I.target = range (I : H β†’ E) := by
rw [← image_univ, ← I.source_eq] exact I.image_source_eq_target.symm
1,874
import Mathlib.Geometry.Manifold.SmoothManifoldWithCorners import Mathlib.Geometry.Manifold.LocalInvariantProperties #align_import geometry.manifold.cont_mdiff from "leanprover-community/mathlib"@"e5ab837fc252451f3eb9124ae6e7b6f57455e7b9" open Set Function Filter ChartedSpace SmoothManifoldWithCorners open scope...
Mathlib/Geometry/Manifold/ContMDiff/Defs.lean
97
100
theorem contDiffWithinAtProp_self_source {f : E β†’ H'} {s : Set E} {x : E} : ContDiffWithinAtProp π“˜(π•œ, E) I' n f s x ↔ ContDiffWithinAt π•œ n (I' ∘ f) s x := by
simp_rw [ContDiffWithinAtProp, modelWithCornersSelf_coe, range_id, inter_univ, modelWithCornersSelf_coe_symm, CompTriple.comp_eq, preimage_id_eq, id_eq]
1,875
import Mathlib.Geometry.Manifold.SmoothManifoldWithCorners import Mathlib.Geometry.Manifold.LocalInvariantProperties #align_import geometry.manifold.cont_mdiff from "leanprover-community/mathlib"@"e5ab837fc252451f3eb9124ae6e7b6f57455e7b9" open Set Function Filter ChartedSpace SmoothManifoldWithCorners open scope...
Mathlib/Geometry/Manifold/ContMDiff/Defs.lean
116
154
theorem contDiffWithinAt_localInvariantProp (n : β„•βˆž) : (contDiffGroupoid ∞ I).LocalInvariantProp (contDiffGroupoid ∞ I') (ContDiffWithinAtProp I I' n) where is_local {s x u f} u_open xu := by
have : I.symm ⁻¹' (s ∩ u) ∩ range I = I.symm ⁻¹' s ∩ range I ∩ I.symm ⁻¹' u := by simp only [inter_right_comm, preimage_inter] rw [ContDiffWithinAtProp, ContDiffWithinAtProp, this] symm apply contDiffWithinAt_inter have : u ∈ 𝓝 (I.symm (I x)) := by rw [ModelWithCorners.left_inv] ...
1,875
import Mathlib.Geometry.Manifold.ContMDiff.Defs open Set Filter Function open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace H] (I : Mode...
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
52
77
theorem ContMDiffWithinAt.comp {t : Set M'} {g : M' β†’ M''} (x : M) (hg : ContMDiffWithinAt I' I'' n g t (f x)) (hf : ContMDiffWithinAt I I' n f s x) (st : MapsTo f s t) : ContMDiffWithinAt I I'' n (g ∘ f) s x := by
rw [contMDiffWithinAt_iff] at hg hf ⊒ refine ⟨hg.1.comp hf.1 st, ?_⟩ set e := extChartAt I x set e' := extChartAt I' (f x) have : e' (f x) = (writtenInExtChartAt I I' x f) (e x) := by simp only [e, e', mfld_simps] rw [this] at hg have A : βˆ€αΆ  y in 𝓝[e.symm ⁻¹' s ∩ range I] e x, f (e.symm y) ∈ t ∧ f (e.sy...
1,876
import Mathlib.Geometry.Manifold.ContMDiff.Defs open Set Filter Function open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace H] (I : Mode...
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
81
84
theorem ContMDiffWithinAt.comp_of_eq {t : Set M'} {g : M' β†’ M''} {x : M} {y : M'} (hg : ContMDiffWithinAt I' I'' n g t y) (hf : ContMDiffWithinAt I I' n f s x) (st : MapsTo f s t) (hx : f x = y) : ContMDiffWithinAt I I'' n (g ∘ f) s x := by
subst hx; exact hg.comp x hf st
1,876
import Mathlib.Geometry.Manifold.ContMDiff.Defs open Set Filter Function open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace H] (I : Mode...
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
119
122
theorem ContMDiff.comp {g : M' β†’ M''} (hg : ContMDiff I' I'' n g) (hf : ContMDiff I I' n f) : ContMDiff I I'' n (g ∘ f) := by
rw [← contMDiffOn_univ] at hf hg ⊒ exact hg.comp hf subset_preimage_univ
1,876
import Mathlib.Geometry.Manifold.ContMDiff.Defs open Set Filter Function open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace H] (I : Mode...
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
244
248
theorem contMDiff_const : ContMDiff I I' n fun _ : M => c := by
intro x refine ⟨continuousWithinAt_const, ?_⟩ simp only [ContDiffWithinAtProp, (· ∘ ·)] exact contDiffWithinAt_const
1,876
import Mathlib.Geometry.Manifold.ContMDiff.Defs open Set Filter Function open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace H] (I : Mode...
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
252
253
theorem contMDiff_one [One M'] : ContMDiff I I' n (1 : M β†’ M') := by
simp only [Pi.one_def, contMDiff_const]
1,876
import Mathlib.Geometry.Manifold.ContMDiff.Defs open Set Filter Function open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace H] (I : Mode...
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
262
262
theorem smooth_one [One M'] : Smooth I I' (1 : M β†’ M') := by
simp only [Pi.one_def, smooth_const]
1,876
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set Function Filter ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H ...
Mathlib/Geometry/Manifold/ContMDiff/Product.lean
59
63
theorem ContMDiffWithinAt.prod_mk {f : M β†’ M'} {g : M β†’ N'} (hf : ContMDiffWithinAt I I' n f s x) (hg : ContMDiffWithinAt I J' n g s x) : ContMDiffWithinAt I (I'.prod J') n (fun x => (f x, g x)) s x := by
rw [contMDiffWithinAt_iff] at * exact ⟨hf.1.prod hg.1, hf.2.prod hg.2⟩
1,877
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set Function Filter ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H ...
Mathlib/Geometry/Manifold/ContMDiff/Product.lean
66
70
theorem ContMDiffWithinAt.prod_mk_space {f : M β†’ E'} {g : M β†’ F'} (hf : ContMDiffWithinAt I π“˜(π•œ, E') n f s x) (hg : ContMDiffWithinAt I π“˜(π•œ, F') n g s x) : ContMDiffWithinAt I π“˜(π•œ, E' Γ— F') n (fun x => (f x, g x)) s x := by
rw [contMDiffWithinAt_iff] at * exact ⟨hf.1.prod hg.1, hf.2.prod hg.2⟩
1,877
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set Function Filter ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H ...
Mathlib/Geometry/Manifold/ContMDiff/Product.lean
149
162
theorem contMDiffWithinAt_fst {s : Set (M Γ— N)} {p : M Γ— N} : ContMDiffWithinAt (I.prod J) I n Prod.fst s p := by
/- porting note: `simp` fails to apply lemmas to `ModelProd`. Was rw [contMDiffWithinAt_iff'] refine' ⟨continuousWithinAt_fst, _⟩ refine' contDiffWithinAt_fst.congr (fun y hy => _) _ · simp only [mfld_simps] at hy simp only [hy, mfld_simps] · simp only [mfld_simps] -/ rw [contMDiffWithinAt_iff'] ...
1,877
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set Function Filter ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H ...
Mathlib/Geometry/Manifold/ContMDiff/Product.lean
218
231
theorem contMDiffWithinAt_snd {s : Set (M Γ— N)} {p : M Γ— N} : ContMDiffWithinAt (I.prod J) J n Prod.snd s p := by
/- porting note: `simp` fails to apply lemmas to `ModelProd`. Was rw [contMDiffWithinAt_iff'] refine' ⟨continuousWithinAt_snd, _⟩ refine' contDiffWithinAt_snd.congr (fun y hy => _) _ · simp only [mfld_simps] at hy simp only [hy, mfld_simps] · simp only [mfld_simps] -/ rw [contMDiffWithinAt_iff'] ...
1,877
import Mathlib.Geometry.Manifold.ContMDiff.Product import Mathlib.Analysis.NormedSpace.OperatorNorm.Prod open Set ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [Norme...
Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean
51
55
theorem contMDiffWithinAt_iff_contDiffWithinAt {f : E β†’ E'} {s : Set E} {x : E} : ContMDiffWithinAt π“˜(π•œ, E) π“˜(π•œ, E') n f s x ↔ ContDiffWithinAt π•œ n f s x := by
simp (config := { contextual := true }) only [ContMDiffWithinAt, liftPropWithinAt_iff', ContDiffWithinAtProp, iff_def, mfld_simps] exact ContDiffWithinAt.continuousWithinAt
1,878
import Mathlib.Geometry.Manifold.ContMDiff.Product import Mathlib.Analysis.NormedSpace.OperatorNorm.Prod open Set ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [Norme...
Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean
63
65
theorem contMDiffAt_iff_contDiffAt {f : E β†’ E'} {x : E} : ContMDiffAt π“˜(π•œ, E) π“˜(π•œ, E') n f x ↔ ContDiffAt π•œ n f x := by
rw [← contMDiffWithinAt_univ, contMDiffWithinAt_iff_contDiffWithinAt, contDiffWithinAt_univ]
1,878
import Mathlib.Geometry.Manifold.ContMDiff.Product import Mathlib.Analysis.NormedSpace.OperatorNorm.Prod open Set ChartedSpace SmoothManifoldWithCorners open scoped Topology Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [Norme...
Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean
81
82
theorem contMDiff_iff_contDiff {f : E β†’ E'} : ContMDiff π“˜(π•œ, E) π“˜(π•œ, E') n f ↔ ContDiff π•œ n f := by
rw [← contDiffOn_univ, ← contMDiffOn_univ, contMDiffOn_iff_contDiffOn]
1,878
import Mathlib.Geometry.Manifold.ContMDiff.NormedSpace #align_import geometry.manifold.vector_bundle.fiberwise_linear from "leanprover-community/mathlib"@"be2c24f56783935652cefffb4bfca7e4b25d167e" noncomputable section open Set TopologicalSpace open scoped Manifold Topology variable {π•œ B F : Type*} [Topolog...
Mathlib/Geometry/Manifold/VectorBundle/FiberwiseLinear.lean
74
82
theorem source_trans_partialHomeomorph (hU : IsOpen U) (hΟ† : ContinuousOn (fun x => Ο† x : B β†’ F β†’L[π•œ] F) U) (h2Ο† : ContinuousOn (fun x => (Ο† x).symm : B β†’ F β†’L[π•œ] F) U) (hU' : IsOpen U') (hΟ†' : ContinuousOn (fun x => Ο†' x : B β†’ F β†’L[π•œ] F) U') (h2Ο†' : ContinuousOn (fun x => (Ο†' x).symm : B β†’ F β†’L[π•œ] ...
dsimp only [FiberwiseLinear.partialHomeomorph]; mfld_set_tac
1,879
import Mathlib.Geometry.Manifold.ContMDiff.NormedSpace #align_import geometry.manifold.vector_bundle.fiberwise_linear from "leanprover-community/mathlib"@"be2c24f56783935652cefffb4bfca7e4b25d167e" noncomputable section open Set TopologicalSpace open scoped Manifold Topology variable {π•œ B F : Type*} [Topolog...
Mathlib/Geometry/Manifold/VectorBundle/FiberwiseLinear.lean
87
95
theorem target_trans_partialHomeomorph (hU : IsOpen U) (hΟ† : ContinuousOn (fun x => Ο† x : B β†’ F β†’L[π•œ] F) U) (h2Ο† : ContinuousOn (fun x => (Ο† x).symm : B β†’ F β†’L[π•œ] F) U) (hU' : IsOpen U') (hΟ†' : ContinuousOn (fun x => Ο†' x : B β†’ F β†’L[π•œ] F) U') (h2Ο†' : ContinuousOn (fun x => (Ο†' x).symm : B β†’ F β†’L[π•œ] ...
dsimp only [FiberwiseLinear.partialHomeomorph]; mfld_set_tac
1,879
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set ChartedSpace SmoothManifoldWithCorners open scoped Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace...
Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean
36
42
theorem contMDiff_model : ContMDiff I π“˜(π•œ, E) n I := by
intro x refine (contMDiffAt_iff _ _).mpr ⟨I.continuousAt, ?_⟩ simp only [mfld_simps] refine contDiffWithinAt_id.congr_of_eventuallyEq ?_ ?_ Β· exact Filter.eventuallyEq_of_mem self_mem_nhdsWithin fun xβ‚‚ => I.right_inv simp_rw [Function.comp_apply, I.left_inv, Function.id_def]
1,880
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set ChartedSpace SmoothManifoldWithCorners open scoped Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace...
Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean
45
49
theorem contMDiffOn_model_symm : ContMDiffOn π“˜(π•œ, E) I n I.symm (range I) := by
rw [contMDiffOn_iff] refine ⟨I.continuousOn_symm, fun x y => ?_⟩ simp only [mfld_simps] exact contDiffOn_id.congr fun x' => I.right_inv
1,880
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set ChartedSpace SmoothManifoldWithCorners open scoped Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace...
Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean
105
110
theorem contMDiffOn_extend_symm (he : e ∈ maximalAtlas I M) : ContMDiffOn π“˜(π•œ, E) I n (e.extend I).symm (I '' e.target) := by
refine (contMDiffOn_symm_of_mem_maximalAtlas he).comp (contMDiffOn_model_symm.mono <| image_subset_range _ _) ?_ simp_rw [image_subset_iff, PartialEquiv.restr_coe_symm, I.toPartialEquiv_coe_symm, preimage_preimage, I.left_inv, preimage_id']; rfl
1,880
import Mathlib.Geometry.Manifold.ContMDiff.Basic open Set ChartedSpace SmoothManifoldWithCorners open scoped Manifold variable {π•œ : Type*} [NontriviallyNormedField π•œ] -- declare a smooth manifold `M` over the pair `(E, H)`. {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] {H : Type*} [TopologicalSpace...
Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean
113
116
theorem contMDiffOn_extChartAt_symm (x : M) : ContMDiffOn π“˜(π•œ, E) I n (extChartAt I x).symm (extChartAt I x).target := by
convert contMDiffOn_extend_symm (chart_mem_maximalAtlas I x) rw [extChartAt_target, I.image_eq]
1,880
import Mathlib.Geometry.Manifold.ContMDiff.Atlas import Mathlib.Geometry.Manifold.VectorBundle.FiberwiseLinear import Mathlib.Topology.VectorBundle.Constructions #align_import geometry.manifold.vector_bundle.basic from "leanprover-community/mathlib"@"e473c3198bb41f68560cab68a0529c854b618833" assert_not_exists mfde...
Mathlib/Geometry/Manifold/VectorBundle/Basic.lean
108
114
theorem FiberBundle.chartedSpace_chartAt (x : TotalSpace F E) : chartAt (ModelProd HB F) x = (trivializationAt F E x.proj).toPartialHomeomorph ≫ₕ (chartAt HB x.proj).prod (PartialHomeomorph.refl F) := by
dsimp only [chartAt_comp, prodChartedSpace_chartAt, FiberBundle.chartedSpace'_chartAt, chartAt_self_eq] rw [Trivialization.coe_coe, Trivialization.coe_fst' _ (mem_baseSet_trivializationAt F E x.proj)]
1,881
import Mathlib.Geometry.Manifold.ContMDiff.Atlas import Mathlib.Geometry.Manifold.VectorBundle.FiberwiseLinear import Mathlib.Topology.VectorBundle.Constructions #align_import geometry.manifold.vector_bundle.basic from "leanprover-community/mathlib"@"e473c3198bb41f68560cab68a0529c854b618833" assert_not_exists mfde...
Mathlib/Geometry/Manifold/VectorBundle/Basic.lean
117
121
theorem FiberBundle.chartedSpace_chartAt_symm_fst (x : TotalSpace F E) (y : ModelProd HB F) (hy : y ∈ (chartAt (ModelProd HB F) x).target) : ((chartAt (ModelProd HB F) x).symm y).proj = (chartAt HB x.proj).symm y.1 := by
simp only [FiberBundle.chartedSpace_chartAt, mfld_simps] at hy ⊒ exact (trivializationAt F E x.proj).proj_symm_apply hy.2
1,881
import Mathlib.Geometry.Manifold.ContMDiff.Atlas import Mathlib.Geometry.Manifold.VectorBundle.FiberwiseLinear import Mathlib.Topology.VectorBundle.Constructions #align_import geometry.manifold.vector_bundle.basic from "leanprover-community/mathlib"@"e473c3198bb41f68560cab68a0529c854b618833" assert_not_exists mfde...
Mathlib/Geometry/Manifold/VectorBundle/Basic.lean
178
196
theorem contMDiffWithinAt_totalSpace (f : M β†’ TotalSpace F E) {s : Set M} {xβ‚€ : M} : ContMDiffWithinAt IM (IB.prod π“˜(π•œ, F)) n f s xβ‚€ ↔ ContMDiffWithinAt IM IB n (fun x => (f x).proj) s xβ‚€ ∧ ContMDiffWithinAt IM π“˜(π•œ, F) n (fun x ↦ (trivializationAt F E (f xβ‚€).proj (f x)).2) s xβ‚€ := by
simp (config := { singlePass := true }) only [contMDiffWithinAt_iff_target] rw [and_and_and_comm, ← FiberBundle.continuousWithinAt_totalSpace, and_congr_right_iff] intro hf simp_rw [modelWithCornersSelf_prod, FiberBundle.extChartAt, Function.comp, PartialEquiv.trans_apply, PartialEquiv.prod_coe, PartialEqu...
1,881
import Mathlib.Geometry.Manifold.SmoothManifoldWithCorners import Mathlib.Topology.Compactness.Paracompact import Mathlib.Topology.Metrizable.Urysohn #align_import geometry.manifold.metrizable from "leanprover-community/mathlib"@"d1bd9c5df2867c1cb463bc6364446d57bdd9f7f1" open TopologicalSpace
Mathlib/Geometry/Manifold/Metrizable.lean
24
31
theorem ManifoldWithCorners.metrizableSpace {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E] {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ E H) (M : Type*) [TopologicalSpace M] [ChartedSpace H M] [SigmaCompactSpace M] [T2Space M] : MetrizableSpace M := by
haveI := I.locallyCompactSpace; haveI := ChartedSpace.locallyCompactSpace H M haveI := I.secondCountableTopology haveI := ChartedSpace.secondCountable_of_sigma_compact H M exact metrizableSpace_of_t3_second_countable M
1,882
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
133
141
theorem isOpen_A (L : E β†’L[π•œ] F) (r Ξ΅ : ℝ) : IsOpen (A f L r Ξ΅) := by
rw [Metric.isOpen_iff] rintro x ⟨r', r'_mem, hr'⟩ obtain ⟨s, s_gt, s_lt⟩ : βˆƒ s : ℝ, r / 2 < s ∧ s < r' := exists_between r'_mem.1 have : s ∈ Ioc (r / 2) r := ⟨s_gt, le_of_lt (s_lt.trans_le r'_mem.2)⟩ refine ⟨r' - s, by linarith, fun x' hx' => ⟨s, this, ?_⟩⟩ have B : ball x' s βŠ† ball x r' := ball_subset (le...
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
144
145
theorem isOpen_B {K : Set (E β†’L[π•œ] F)} {r s Ξ΅ : ℝ} : IsOpen (B f K r s Ξ΅) := by
simp [B, isOpen_biUnion, IsOpen.inter, isOpen_A]
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
148
151
theorem A_mono (L : E β†’L[π•œ] F) (r : ℝ) {Ξ΅ Ξ΄ : ℝ} (h : Ξ΅ ≀ Ξ΄) : A f L r Ξ΅ βŠ† A f L r Ξ΄ := by
rintro x ⟨r', r'r, hr'⟩ refine ⟨r', r'r, fun y hy z hz => (hr' y hy z hz).trans_le (mul_le_mul_of_nonneg_right h ?_)⟩ linarith [mem_ball.1 hy, r'r.2, @dist_nonneg _ _ y x]
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
154
159
theorem le_of_mem_A {r Ξ΅ : ℝ} {L : E β†’L[π•œ] F} {x : E} (hx : x ∈ A f L r Ξ΅) {y z : E} (hy : y ∈ closedBall x (r / 2)) (hz : z ∈ closedBall x (r / 2)) : β€–f z - f y - L (z - y)β€– ≀ Ξ΅ * r := by
rcases hx with ⟨r', r'mem, hr'⟩ apply le_of_lt exact hr' _ ((mem_closedBall.1 hy).trans_lt r'mem.1) _ ((mem_closedBall.1 hz).trans_lt r'mem.1)
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
162
181
theorem mem_A_of_differentiable {Ξ΅ : ℝ} (hΞ΅ : 0 < Ξ΅) {x : E} (hx : DifferentiableAt π•œ f x) : βˆƒ R > 0, βˆ€ r ∈ Ioo (0 : ℝ) R, x ∈ A f (fderiv π•œ f x) r Ξ΅ := by
let Ξ΄ := (Ξ΅ / 2) / 2 obtain ⟨R, R_pos, hR⟩ : βˆƒ R > 0, βˆ€ y ∈ ball x R, β€–f y - f x - fderiv π•œ f x (y - x)β€– ≀ Ξ΄ * β€–y - xβ€– := eventually_nhds_iff_ball.1 <| hx.hasFDerivAt.isLittleO.bound <| by positivity refine ⟨R, R_pos, fun r hr => ?_⟩ have : r ∈ Ioc (r / 2) r := right_mem_Ioc.2 <| half_lt_self hr.1 ...
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
473
483
theorem A_mem_nhdsWithin_Ioi {L : F} {r Ξ΅ x : ℝ} (hx : x ∈ A f L r Ξ΅) : A f L r Ξ΅ ∈ 𝓝[>] x := by
rcases hx with ⟨r', rr', hr'⟩ rw [mem_nhdsWithin_Ioi_iff_exists_Ioo_subset] obtain ⟨s, s_gt, s_lt⟩ : βˆƒ s : ℝ, r / 2 < s ∧ s < r' := exists_between rr'.1 have : s ∈ Ioc (r / 2) r := ⟨s_gt, le_of_lt (s_lt.trans_le rr'.2)⟩ refine ⟨x + r' - s, by simp only [mem_Ioi]; linarith, fun x' hx' => ⟨s, this, ?_⟩⟩ have...
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
486
492
theorem B_mem_nhdsWithin_Ioi {K : Set F} {r s Ξ΅ x : ℝ} (hx : x ∈ B f K r s Ξ΅) : B f K r s Ξ΅ ∈ 𝓝[>] x := by
obtain ⟨L, LK, hL₁, hLβ‚‚βŸ© : βˆƒ L : F, L ∈ K ∧ x ∈ A f L r Ξ΅ ∧ x ∈ A f L s Ξ΅ := by simpa only [B, mem_iUnion, mem_inter_iff, exists_prop] using hx filter_upwards [A_mem_nhdsWithin_Ioi hL₁, A_mem_nhdsWithin_Ioi hLβ‚‚] with y hy₁ hyβ‚‚ simp only [B, mem_iUnion, mem_inter_iff, exists_prop] exact ⟨L, LK, hy₁, hyβ‚‚βŸ©
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
499
502
theorem A_mono (L : F) (r : ℝ) {Ξ΅ Ξ΄ : ℝ} (h : Ξ΅ ≀ Ξ΄) : A f L r Ξ΅ βŠ† A f L r Ξ΄ := by
rintro x ⟨r', r'r, hr'⟩ refine ⟨r', r'r, fun y hy z hz => (hr' y hy z hz).trans (mul_le_mul_of_nonneg_right h ?_)⟩ linarith [hy.1, hy.2, r'r.2]
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
505
510
theorem le_of_mem_A {r Ξ΅ : ℝ} {L : F} {x : ℝ} (hx : x ∈ A f L r Ξ΅) {y z : ℝ} (hy : y ∈ Icc x (x + r / 2)) (hz : z ∈ Icc x (x + r / 2)) : β€–f z - f y - (z - y) β€’ Lβ€– ≀ Ξ΅ * r := by
rcases hx with ⟨r', r'mem, hr'⟩ have A : x + r / 2 ≀ x + r' := by linarith [r'mem.1] exact hr' _ ((Icc_subset_Icc le_rfl A) hy) _ ((Icc_subset_Icc le_rfl A) hz)
1,883
import Mathlib.Analysis.Calculus.Deriv.Basic import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.MeasureTheory.Constructions.BorelSpace.ContinuousLinearMap import Mathlib.MeasureTheory.Function.StronglyMeasurable.Basic #align_import analysis.calculus.fderiv_...
Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
513
538
theorem mem_A_of_differentiable {Ξ΅ : ℝ} (hΞ΅ : 0 < Ξ΅) {x : ℝ} (hx : DifferentiableWithinAt ℝ f (Ici x) x) : βˆƒ R > 0, βˆ€ r ∈ Ioo (0 : ℝ) R, x ∈ A f (derivWithin f (Ici x) x) r Ξ΅ := by
have := hx.hasDerivWithinAt simp_rw [hasDerivWithinAt_iff_isLittleO, isLittleO_iff] at this rcases mem_nhdsWithin_Ici_iff_exists_Ico_subset.1 (this (half_pos hΡ)) with ⟨m, xm, hm⟩ refine ⟨m - x, by linarith [show x < m from xm], fun r hr => ?_⟩ have : r ∈ Ioc (r / 2) r := ⟨half_lt_self hr.1, le_rfl⟩ refine...
1,883
import Mathlib.Analysis.Calculus.LineDeriv.Basic import Mathlib.Analysis.Calculus.FDeriv.Measurable open MeasureTheory variable {π•œ : Type*} [NontriviallyNormedField π•œ] [LocallyCompactSpace π•œ] {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] [MeasurableSpace E] [OpensMeasurableSpace E] {F : Type*} [Norm...
Mathlib/Analysis/Calculus/LineDeriv/Measurable.lean
33
38
theorem measurableSet_lineDifferentiableAt (hf : Continuous f) : MeasurableSet {x : E | LineDifferentiableAt π•œ f x v} := by
borelize π•œ let g : E β†’ π•œ β†’ F := fun x t ↦ f (x + t β€’ v) have hg : Continuous g.uncurry := by apply hf.comp; continuity exact measurable_prod_mk_right (measurableSet_of_differentiableAt_with_param π•œ hg)
1,884
import Mathlib.Analysis.Calculus.LineDeriv.Basic import Mathlib.Analysis.Calculus.FDeriv.Measurable open MeasureTheory variable {π•œ : Type*} [NontriviallyNormedField π•œ] [LocallyCompactSpace π•œ] {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] [MeasurableSpace E] [OpensMeasurableSpace E] {F : Type*} [Norm...
Mathlib/Analysis/Calculus/LineDeriv/Measurable.lean
40
45
theorem measurable_lineDeriv [MeasurableSpace F] [BorelSpace F] (hf : Continuous f) : Measurable (fun x ↦ lineDeriv π•œ f x v) := by
borelize π•œ let g : E β†’ π•œ β†’ F := fun x t ↦ f (x + t β€’ v) have hg : Continuous g.uncurry := by apply hf.comp; continuity exact (measurable_deriv_with_param hg).comp measurable_prod_mk_right
1,884
import Mathlib.Analysis.Calculus.LineDeriv.Basic import Mathlib.Analysis.Calculus.FDeriv.Measurable open MeasureTheory variable {π•œ : Type*} [NontriviallyNormedField π•œ] [LocallyCompactSpace π•œ] {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] [MeasurableSpace E] [OpensMeasurableSpace E] {F : Type*} [Norm...
Mathlib/Analysis/Calculus/LineDeriv/Measurable.lean
47
52
theorem stronglyMeasurable_lineDeriv [SecondCountableTopologyEither E F] (hf : Continuous f) : StronglyMeasurable (fun x ↦ lineDeriv π•œ f x v) := by
borelize π•œ let g : E β†’ π•œ β†’ F := fun x t ↦ f (x + t β€’ v) have hg : Continuous g.uncurry := by apply hf.comp; continuity exact (stronglyMeasurable_deriv_with_param hg).comp_measurable measurable_prod_mk_right
1,884
import Mathlib.Analysis.Calculus.LineDeriv.Basic import Mathlib.Analysis.Calculus.FDeriv.Measurable open MeasureTheory variable {π•œ : Type*} [NontriviallyNormedField π•œ] [LocallyCompactSpace π•œ] {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] [MeasurableSpace E] [OpensMeasurableSpace E] {F : Type*} [Norm...
Mathlib/Analysis/Calculus/LineDeriv/Measurable.lean
72
81
theorem measurableSet_lineDifferentiableAt_uncurry (hf : Continuous f) : MeasurableSet {p : E Γ— E | LineDifferentiableAt π•œ f p.1 p.2} := by
borelize π•œ let g : (E Γ— E) β†’ π•œ β†’ F := fun p t ↦ f (p.1 + t β€’ p.2) have : Continuous g.uncurry := hf.comp <| (continuous_fst.comp continuous_fst).add <| continuous_snd.smul (continuous_snd.comp continuous_fst) have M_meas : MeasurableSet {q : (E Γ— E) Γ— π•œ | DifferentiableAt π•œ (g q.1) q.2} := meas...
1,884
import Mathlib.Analysis.Calculus.LineDeriv.Basic import Mathlib.Analysis.Calculus.FDeriv.Measurable open MeasureTheory variable {π•œ : Type*} [NontriviallyNormedField π•œ] [LocallyCompactSpace π•œ] {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] [MeasurableSpace E] [OpensMeasurableSpace E] {F : Type*} [Norm...
Mathlib/Analysis/Calculus/LineDeriv/Measurable.lean
83
90
theorem measurable_lineDeriv_uncurry [MeasurableSpace F] [BorelSpace F] (hf : Continuous f) : Measurable (fun (p : E Γ— E) ↦ lineDeriv π•œ f p.1 p.2) := by
borelize π•œ let g : (E Γ— E) β†’ π•œ β†’ F := fun p t ↦ f (p.1 + t β€’ p.2) have : Continuous g.uncurry := hf.comp <| (continuous_fst.comp continuous_fst).add <| continuous_snd.smul (continuous_snd.comp continuous_fst) exact (measurable_deriv_with_param this).comp measurable_prod_mk_right
1,884
import Mathlib.Analysis.Calculus.LineDeriv.Basic import Mathlib.Analysis.Calculus.FDeriv.Measurable open MeasureTheory variable {π•œ : Type*} [NontriviallyNormedField π•œ] [LocallyCompactSpace π•œ] {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E] [MeasurableSpace E] [OpensMeasurableSpace E] {F : Type*} [Norm...
Mathlib/Analysis/Calculus/LineDeriv/Measurable.lean
92
99
theorem stronglyMeasurable_lineDeriv_uncurry (hf : Continuous f) : StronglyMeasurable (fun (p : E Γ— E) ↦ lineDeriv π•œ f p.1 p.2) := by
borelize π•œ let g : (E Γ— E) β†’ π•œ β†’ F := fun p t ↦ f (p.1 + t β€’ p.2) have : Continuous g.uncurry := hf.comp <| (continuous_fst.comp continuous_fst).add <| continuous_snd.smul (continuous_snd.comp continuous_fst) exact (stronglyMeasurable_deriv_with_param this).comp_measurable measurable_prod_mk_right
1,884
import Mathlib.Analysis.Calculus.ContDiff.Basic import Mathlib.Analysis.NormedSpace.FiniteDimension #align_import analysis.calculus.bump_function_inner from "leanprover-community/mathlib"@"3bce8d800a6f2b8f63fe1e588fd76a9ff4adcebe" noncomputable section open Function Set Filter open scoped Topology Filter variable...
Mathlib/Analysis/Calculus/BumpFunction/Basic.lean
118
120
theorem one_lt_rOut_div_rIn {c : E} (f : ContDiffBump c) : 1 < f.rOut / f.rIn := by
rw [one_lt_div f.rIn_pos] exact f.rIn_lt_rOut
1,885
import Mathlib.Analysis.Calculus.ContDiff.Basic import Mathlib.Analysis.NormedSpace.FiniteDimension #align_import analysis.calculus.bump_function_inner from "leanprover-community/mathlib"@"3bce8d800a6f2b8f63fe1e588fd76a9ff4adcebe" noncomputable section open Function Set Filter open scoped Topology Filter variable...
Mathlib/Analysis/Calculus/BumpFunction/Basic.lean
154
157
theorem one_of_mem_closedBall (hx : x ∈ closedBall c f.rIn) : f x = 1 := by
apply ContDiffBumpBase.eq_one _ _ f.one_lt_rOut_div_rIn simpa only [norm_smul, Real.norm_eq_abs, abs_inv, abs_of_nonneg f.rIn_pos.le, ← div_eq_inv_mul, div_le_one f.rIn_pos] using mem_closedBall_iff_norm.1 hx
1,885
import Mathlib.Analysis.Calculus.ContDiff.Basic import Mathlib.Analysis.NormedSpace.FiniteDimension #align_import analysis.calculus.bump_function_inner from "leanprover-community/mathlib"@"3bce8d800a6f2b8f63fe1e588fd76a9ff4adcebe" noncomputable section open Function Set Filter open scoped Topology Filter variable...
Mathlib/Analysis/Calculus/BumpFunction/Basic.lean
172
176
theorem support_eq : Function.support f = Metric.ball c f.rOut := by
simp only [toFun, support_comp_eq_preimage, ContDiffBumpBase.support _ _ f.one_lt_rOut_div_rIn] ext x simp only [mem_ball_iff_norm, sub_zero, norm_smul, mem_preimage, Real.norm_eq_abs, abs_inv, abs_of_pos f.rIn_pos, ← div_eq_inv_mul, div_lt_div_right f.rIn_pos]
1,885
import Mathlib.Analysis.Calculus.ContDiff.Basic import Mathlib.Analysis.NormedSpace.FiniteDimension #align_import analysis.calculus.bump_function_inner from "leanprover-community/mathlib"@"3bce8d800a6f2b8f63fe1e588fd76a9ff4adcebe" noncomputable section open Function Set Filter open scoped Topology Filter variable...
Mathlib/Analysis/Calculus/BumpFunction/Basic.lean
179
180
theorem tsupport_eq : tsupport f = closedBall c f.rOut := by
simp_rw [tsupport, f.support_eq, closure_ball _ f.rOut_pos.ne']
1,885
import Mathlib.Analysis.NormedSpace.FiniteDimension import Mathlib.Analysis.RCLike.Basic #align_import data.is_R_or_C.lemmas from "leanprover-community/mathlib"@"468b141b14016d54b479eb7a0fff1e360b7e3cf6" variable {K E : Type*} [RCLike K] namespace RCLike @[simp, rclike_simps]
Mathlib/Analysis/RCLike/Lemmas.lean
71
74
theorem reCLM_norm : β€–(reCLM : K β†’L[ℝ] ℝ)β€– = 1 := by
apply le_antisymm (LinearMap.mkContinuous_norm_le _ zero_le_one _) convert ContinuousLinearMap.ratio_le_opNorm (reCLM : K β†’L[ℝ] ℝ) (1 : K) simp
1,886
import Mathlib.Analysis.Convex.Cone.Extension import Mathlib.Analysis.NormedSpace.RCLike import Mathlib.Analysis.NormedSpace.Extend import Mathlib.Analysis.RCLike.Lemmas #align_import analysis.normed_space.hahn_banach.extension from "leanprover-community/mathlib"@"915591b2bb3ea303648db07284a161a7f2a9e3d4" univers...
Mathlib/Analysis/NormedSpace/HahnBanach/Extension.lean
44
59
theorem exists_extension_norm_eq (p : Subspace ℝ E) (f : p β†’L[ℝ] ℝ) : βˆƒ g : E β†’L[ℝ] ℝ, (βˆ€ x : p, g x = f x) ∧ β€–gβ€– = β€–fβ€– := by
rcases exists_extension_of_le_sublinear ⟨p, f⟩ (fun x => β€–fβ€– * β€–xβ€–) (fun c hc x => by simp only [norm_smul c x, Real.norm_eq_abs, abs_of_pos hc, mul_left_comm]) (fun x y => by -- Porting note: placeholder filled here rw [← left_distrib] exact mul_le_mul_of_nonneg_left (norm_add_le x y) (@...
1,887
import Mathlib.Analysis.Convex.Cone.Extension import Mathlib.Analysis.NormedSpace.RCLike import Mathlib.Analysis.NormedSpace.Extend import Mathlib.Analysis.RCLike.Lemmas #align_import analysis.normed_space.hahn_banach.extension from "leanprover-community/mathlib"@"915591b2bb3ea303648db07284a161a7f2a9e3d4" univers...
Mathlib/Analysis/NormedSpace/HahnBanach/Extension.lean
151
163
theorem coord_norm' {x : E} (h : x β‰  0) : β€–(β€–xβ€– : π•œ) β€’ coord π•œ x hβ€– = 1 := by
#adaptation_note /-- `set_option maxSynthPendingDepth 2` required after https://github.com/leanprover/lean4/pull/4119 Alternatively, we can add: ``` let X : SeminormedAddCommGroup (β†₯(span π•œ {x}) β†’L[π•œ] π•œ) := inferInstance have : BoundedSMul π•œ (β†₯(span π•œ {x}) β†’L[π•œ] π•œ) := @NormedSpace.boundedSMul π•œ _...
1,887
import Mathlib.Analysis.NormedSpace.HahnBanach.Extension import Mathlib.Analysis.NormedSpace.RCLike import Mathlib.Analysis.LocallyConvex.Polar #align_import analysis.normed_space.dual from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" noncomputable section open scoped Classical open ...
Mathlib/Analysis/NormedSpace/Dual.lean
82
84
theorem inclusionInDoubleDual_norm_le : β€–inclusionInDoubleDual π•œ Eβ€– ≀ 1 := by
rw [inclusionInDoubleDual_norm_eq] exact ContinuousLinearMap.norm_id_le
1,888
import Mathlib.Analysis.NormedSpace.HahnBanach.Extension import Mathlib.Analysis.NormedSpace.RCLike import Mathlib.Analysis.LocallyConvex.Polar #align_import analysis.normed_space.dual from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" noncomputable section open scoped Classical open ...
Mathlib/Analysis/NormedSpace/Dual.lean
87
88
theorem double_dual_bound (x : E) : β€–(inclusionInDoubleDual π•œ E) xβ€– ≀ β€–xβ€– := by
simpa using ContinuousLinearMap.le_of_opNorm_le _ (inclusionInDoubleDual_norm_le π•œ E) x
1,888
import Mathlib.Analysis.NormedSpace.HahnBanach.Extension import Mathlib.Analysis.NormedSpace.RCLike import Mathlib.Analysis.LocallyConvex.Polar #align_import analysis.normed_space.dual from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" noncomputable section open scoped Classical open ...
Mathlib/Analysis/NormedSpace/Dual.lean
101
103
theorem dualPairing_separatingLeft : (dualPairing π•œ E).SeparatingLeft := by
rw [LinearMap.separatingLeft_iff_ker_eq_bot, LinearMap.ker_eq_bot] exact ContinuousLinearMap.coe_injective
1,888
import Mathlib.Analysis.NormedSpace.Dual import Mathlib.Analysis.NormedSpace.OperatorNorm.Completeness #align_import analysis.normed_space.weak_dual from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" noncomputable section open Filter Function Bornology Metric Set open Topology Filter...
Mathlib/Analysis/NormedSpace/WeakDual.lean
141
145
theorem dual_norm_topology_le_weak_dual_topology : (UniformSpace.toTopologicalSpace : TopologicalSpace (Dual π•œ E)) ≀ (WeakDual.instTopologicalSpace : TopologicalSpace (WeakDual π•œ E)) := by
convert (@toWeakDual_continuous _ _ _ _ (by assumption)).le_induced exact induced_id.symm
1,889
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Constructions.BorelSpace.Complex #align_import measure_theory.function.special_functions.is_R_or_C from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" noncomputable section open NNReal ENNReal namespace RCLike variabl...
Mathlib/MeasureTheory/Function/SpecialFunctions/RCLike.lean
73
77
theorem measurable_of_re_im (hre : Measurable fun x => RCLike.re (f x)) (him : Measurable fun x => RCLike.im (f x)) : Measurable f := by
convert Measurable.add (M := π•œ) (RCLike.measurable_ofReal.comp hre) ((RCLike.measurable_ofReal.comp him).mul_const RCLike.I) exact (RCLike.re_add_im _).symm
1,890
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Constructions.BorelSpace.Complex #align_import measure_theory.function.special_functions.is_R_or_C from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" noncomputable section open NNReal ENNReal namespace RCLike variabl...
Mathlib/MeasureTheory/Function/SpecialFunctions/RCLike.lean
80
84
theorem aemeasurable_of_re_im (hre : AEMeasurable (fun x => RCLike.re (f x)) ΞΌ) (him : AEMeasurable (fun x => RCLike.im (f x)) ΞΌ) : AEMeasurable f ΞΌ := by
convert AEMeasurable.add (M := π•œ) (RCLike.measurable_ofReal.comp_aemeasurable hre) ((RCLike.measurable_ofReal.comp_aemeasurable him).mul_const RCLike.I) exact (RCLike.re_add_im _).symm
1,890
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
42
43
theorem Memβ„’p.integrable_sq {f : Ξ± β†’ ℝ} (h : Memβ„’p f 2 ΞΌ) : Integrable (fun x => f x ^ 2) ΞΌ := by
simpa [← memβ„’p_one_iff_integrable] using h.norm_rpow two_ne_zero ENNReal.two_ne_top
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
46
51
theorem memβ„’p_two_iff_integrable_sq_norm {f : Ξ± β†’ F} (hf : AEStronglyMeasurable f ΞΌ) : Memβ„’p f 2 ΞΌ ↔ Integrable (fun x => β€–f xβ€– ^ 2) ΞΌ := by
rw [← memβ„’p_one_iff_integrable] convert (memβ„’p_norm_rpow_iff hf two_ne_zero ENNReal.two_ne_top).symm Β· simp Β· rw [div_eq_mul_inv, ENNReal.mul_inv_cancel two_ne_zero ENNReal.two_ne_top]
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
54
57
theorem memβ„’p_two_iff_integrable_sq {f : Ξ± β†’ ℝ} (hf : AEStronglyMeasurable f ΞΌ) : Memβ„’p f 2 ΞΌ ↔ Integrable (fun x => f x ^ 2) ΞΌ := by
convert memβ„’p_two_iff_integrable_sq_norm hf using 3 simp
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
81
83
theorem Integrable.const_inner (c : E) (hf : Integrable f ΞΌ) : Integrable (fun x => βŸͺc, f x⟫) ΞΌ := by
rw [← memβ„’p_one_iff_integrable] at hf ⊒; exact hf.const_inner c
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
86
88
theorem Integrable.inner_const (hf : Integrable f ΞΌ) (c : E) : Integrable (fun x => βŸͺf x, c⟫) ΞΌ := by
rw [← memβ„’p_one_iff_integrable] at hf ⊒; exact hf.inner_const c
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
104
106
theorem _root_.integral_eq_zero_of_forall_integral_inner_eq_zero (f : Ξ± β†’ E) (hf : Integrable f ΞΌ) (hf_int : βˆ€ c : E, ∫ x, βŸͺc, f x⟫ βˆ‚ΞΌ = 0) : ∫ x, f x βˆ‚ΞΌ = 0 := by
specialize hf_int (∫ x, f x βˆ‚ΞΌ); rwa [integral_inner hf, inner_self_eq_zero] at hf_int
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
118
121
theorem snorm_rpow_two_norm_lt_top (f : Lp F 2 ΞΌ) : snorm (fun x => β€–f xβ€– ^ (2 : ℝ)) 1 ΞΌ < ∞ := by
have h_two : ENNReal.ofReal (2 : ℝ) = 2 := by simp [zero_le_one] rw [snorm_norm_rpow f zero_lt_two, one_mul, h_two] exact ENNReal.rpow_lt_top_of_nonneg zero_le_two (Lp.snorm_ne_top f)
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
124
140
theorem snorm_inner_lt_top (f g : Ξ± β†’β‚‚[ΞΌ] E) : snorm (fun x : Ξ± => βŸͺf x, g x⟫) 1 ΞΌ < ∞ := by
have h : βˆ€ x, β€–βŸͺf x, g xβŸ«β€– ≀ β€–β€–f xβ€– ^ (2 : ℝ) + β€–g xβ€– ^ (2 : ℝ)β€– := by intro x rw [← @Nat.cast_two ℝ, Real.rpow_natCast, Real.rpow_natCast] calc β€–βŸͺf x, g xβŸ«β€– ≀ β€–f xβ€– * β€–g xβ€– := norm_inner_le_norm _ _ _ ≀ 2 * β€–f xβ€– * β€–g xβ€– := (mul_le_mul_of_nonneg_right (le_mul_of_one_le_left (norm_non...
1,891
import Mathlib.Analysis.RCLike.Lemmas import Mathlib.MeasureTheory.Function.StronglyMeasurable.Inner import Mathlib.MeasureTheory.Integral.SetIntegral #align_import measure_theory.function.l2_space from "leanprover-community/mathlib"@"83a66c8775fa14ee5180c85cab98e970956401ad" set_option linter.uppercaseLean3 false...
Mathlib/MeasureTheory/Function/L2Space.lean
154
167
theorem integral_inner_eq_sq_snorm (f : Ξ± β†’β‚‚[ΞΌ] E) : ∫ a, βŸͺf a, f a⟫ βˆ‚ΞΌ = ENNReal.toReal (∫⁻ a, (β€–f aβ€–β‚Š : ℝβ‰₯0∞) ^ (2 : ℝ) βˆ‚ΞΌ) := by
simp_rw [inner_self_eq_norm_sq_to_K] norm_cast rw [integral_eq_lintegral_of_nonneg_ae] rotate_left Β· exact Filter.eventually_of_forall fun x => sq_nonneg _ Β· exact ((Lp.aestronglyMeasurable f).norm.aemeasurable.pow_const _).aestronglyMeasurable congr ext1 x have h_two : (2 : ℝ) = ((2 : β„•) : ℝ) := by ...
1,891
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
65
72
theorem _root_.MeasureTheory.Memβ„’p.evariance_lt_top [IsFiniteMeasure ΞΌ] (hX : Memβ„’p X 2 ΞΌ) : evariance X ΞΌ < ∞ := by
have := ENNReal.pow_lt_top (hX.sub <| memβ„’p_const <| ΞΌ[X]).2 2 rw [snorm_eq_lintegral_rpow_nnnorm two_ne_zero ENNReal.two_ne_top, ← ENNReal.rpow_two] at this simp only [coe_two, Pi.sub_apply, ENNReal.one_toReal, one_div] at this rw [← ENNReal.rpow_mul, inv_mul_cancel (two_ne_zero : (2 : ℝ) β‰  0), ENNReal.rpow_o...
1,892
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
75
89
theorem evariance_eq_top [IsFiniteMeasure ΞΌ] (hXm : AEStronglyMeasurable X ΞΌ) (hX : Β¬Memβ„’p X 2 ΞΌ) : evariance X ΞΌ = ∞ := by
by_contra h rw [← Ne, ← lt_top_iff_ne_top] at h have : Memβ„’p (fun Ο‰ => X Ο‰ - ΞΌ[X]) 2 ΞΌ := by refine ⟨hXm.sub aestronglyMeasurable_const, ?_⟩ rw [snorm_eq_lintegral_rpow_nnnorm two_ne_zero ENNReal.two_ne_top] simp only [coe_two, ENNReal.one_toReal, ENNReal.rpow_two, Ne] exact ENNReal.rpow_lt_top_o...
1,892
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
92
97
theorem evariance_lt_top_iff_memβ„’p [IsFiniteMeasure ΞΌ] (hX : AEStronglyMeasurable X ΞΌ) : evariance X ΞΌ < ∞ ↔ Memβ„’p X 2 ΞΌ := by
refine ⟨?_, MeasureTheory.Memβ„’p.evariance_lt_top⟩ contrapose rw [not_lt, top_le_iff] exact evariance_eq_top hX
1,892
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
100
103
theorem _root_.MeasureTheory.Memβ„’p.ofReal_variance_eq [IsFiniteMeasure ΞΌ] (hX : Memβ„’p X 2 ΞΌ) : ENNReal.ofReal (variance X ΞΌ) = evariance X ΞΌ := by
rw [variance, ENNReal.ofReal_toReal] exact hX.evariance_lt_top.ne
1,892
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
106
113
theorem evariance_eq_lintegral_ofReal (X : Ξ© β†’ ℝ) (ΞΌ : Measure Ξ©) : evariance X ΞΌ = ∫⁻ Ο‰, ENNReal.ofReal ((X Ο‰ - ΞΌ[X]) ^ 2) βˆ‚ΞΌ := by
rw [evariance] congr ext1 Ο‰ rw [pow_two, ← ENNReal.coe_mul, ← nnnorm_mul, ← pow_two] congr exact (Real.toNNReal_eq_nnnorm_of_nonneg <| sq_nonneg _).symm
1,892
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
116
125
theorem _root_.MeasureTheory.Memβ„’p.variance_eq_of_integral_eq_zero (hX : Memβ„’p X 2 ΞΌ) (hXint : ΞΌ[X] = 0) : variance X ΞΌ = ΞΌ[X ^ (2 : Nat)] := by
rw [variance, evariance_eq_lintegral_ofReal, ← ofReal_integral_eq_lintegral_ofReal, ENNReal.toReal_ofReal (by positivity)] <;> simp_rw [hXint, sub_zero] Β· rfl Β· convert hX.integrable_norm_rpow two_ne_zero ENNReal.two_ne_top with Ο‰ simp only [Pi.sub_apply, Real.norm_eq_abs, coe_two, ENNReal.one_toRe...
1,892
import Mathlib.Probability.Notation import Mathlib.Probability.Integration import Mathlib.MeasureTheory.Function.L2Space #align_import probability.variance from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9" open MeasureTheory Filter Finset noncomputable section open scoped MeasureThe...
Mathlib/Probability/Variance.lean
128
139
theorem _root_.MeasureTheory.Memβ„’p.variance_eq [IsFiniteMeasure ΞΌ] (hX : Memβ„’p X 2 ΞΌ) : variance X ΞΌ = ΞΌ[(X - fun _ => ΞΌ[X] :) ^ (2 : Nat)] := by
rw [variance, evariance_eq_lintegral_ofReal, ← ofReal_integral_eq_lintegral_ofReal, ENNReal.toReal_ofReal (by positivity)] Β· rfl Β· -- Porting note: `ΞΌ[X]` without whitespace is ambiguous as it could be GetElem, -- and `convert` cannot disambiguate based on typeclass inference failure. convert (hX.sub...
1,892
import Mathlib.Probability.Variance import Mathlib.MeasureTheory.Function.UniformIntegrable #align_import probability.ident_distrib from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" open MeasureTheory Filter Finset noncomputable section open scoped Topology MeasureTheory ENNReal NNR...
Mathlib/Probability/IdentDistrib.lean
132
135
theorem measure_mem_eq (h : IdentDistrib f g μ ν) {s : Set γ} (hs : MeasurableSet s) : μ (f ⁻¹' s) = ν (g ⁻¹' s) := by
rw [← Measure.map_apply_of_aemeasurable h.aemeasurable_fst hs, ← Measure.map_apply_of_aemeasurable h.aemeasurable_snd hs, h.map_eq]
1,893
import Mathlib.Probability.Variance import Mathlib.MeasureTheory.Function.UniformIntegrable #align_import probability.ident_distrib from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" open MeasureTheory Filter Finset noncomputable section open scoped Topology MeasureTheory ENNReal NNR...
Mathlib/Probability/IdentDistrib.lean
141
145
theorem ae_snd (h : IdentDistrib f g ΞΌ Ξ½) {p : Ξ³ β†’ Prop} (pmeas : MeasurableSet {x | p x}) (hp : βˆ€α΅ x βˆ‚ΞΌ, p (f x)) : βˆ€α΅ x βˆ‚Ξ½, p (g x) := by
apply (ae_map_iff h.aemeasurable_snd pmeas).1 rw [← h.map_eq] exact (ae_map_iff h.aemeasurable_fst pmeas).2 hp
1,893
import Mathlib.Probability.Variance import Mathlib.MeasureTheory.Function.UniformIntegrable #align_import probability.ident_distrib from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" open MeasureTheory Filter Finset noncomputable section open scoped Topology MeasureTheory ENNReal NNR...
Mathlib/Probability/IdentDistrib.lean
162
168
theorem aestronglyMeasurable_snd [TopologicalSpace Ξ³] [MetrizableSpace Ξ³] [BorelSpace Ξ³] (h : IdentDistrib f g ΞΌ Ξ½) (hf : AEStronglyMeasurable f ΞΌ) : AEStronglyMeasurable g Ξ½ := by
refine aestronglyMeasurable_iff_aemeasurable_separable.2 ⟨h.aemeasurable_snd, ?_⟩ rcases (aestronglyMeasurable_iff_aemeasurable_separable.1 hf).2 with ⟨t, t_sep, ht⟩ refine ⟨closure t, t_sep.closure, ?_⟩ apply h.ae_mem_snd isClosed_closure.measurableSet filter_upwards [ht] with x hx using subset_closure hx
1,893
import Mathlib.Probability.Variance import Mathlib.MeasureTheory.Function.UniformIntegrable #align_import probability.ident_distrib from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982" open MeasureTheory Filter Finset noncomputable section open scoped Topology MeasureTheory ENNReal NNR...
Mathlib/Probability/IdentDistrib.lean
326
348
theorem Memβ„’p.uniformIntegrable_of_identDistrib_aux {ΞΉ : Type*} {f : ΞΉ β†’ Ξ± β†’ E} {j : ΞΉ} {p : ℝβ‰₯0∞} (hp : 1 ≀ p) (hp' : p β‰  ∞) (hβ„’p : Memβ„’p (f j) p ΞΌ) (hfmeas : βˆ€ i, StronglyMeasurable (f i)) (hf : βˆ€ i, IdentDistrib (f i) (f j) ΞΌ ΞΌ) : UniformIntegrable f p ΞΌ := by
refine uniformIntegrable_of' hp hp' hfmeas fun Ξ΅ hΞ΅ => ?_ by_cases hΞΉ : Nonempty ΞΉ swap; Β· exact ⟨0, fun i => False.elim (hΞΉ <| Nonempty.intro i)⟩ obtain ⟨C, hC₁, hCβ‚‚βŸ© := hβ„’p.snorm_indicator_norm_ge_pos_le (hfmeas _) hΞ΅ refine ⟨⟨C, hC₁.le⟩, fun i => le_trans (le_of_eq ?_) hCβ‚‚βŸ© have : {x | (⟨C, hC₁.le⟩ : ℝβ‰₯...
1,893
import Mathlib.Analysis.Convex.Cone.Extension import Mathlib.Analysis.Convex.Gauge import Mathlib.Topology.Algebra.Module.FiniteDimension import Mathlib.Topology.Algebra.Module.LocallyConvex #align_import analysis.normed_space.hahn_banach.separation from "leanprover-community/mathlib"@"915591b2bb3ea303648db07284a161a...
Mathlib/Analysis/NormedSpace/HahnBanach/Separation.lean
47
76
theorem separate_convex_open_set [TopologicalSpace E] [AddCommGroup E] [TopologicalAddGroup E] [Module ℝ E] [ContinuousSMul ℝ E] {s : Set E} (hsβ‚€ : (0 : E) ∈ s) (hs₁ : Convex ℝ s) (hsβ‚‚ : IsOpen s) {xβ‚€ : E} (hxβ‚€ : xβ‚€ βˆ‰ s) : βˆƒ f : E β†’L[ℝ] ℝ, f xβ‚€ = 1 ∧ βˆ€ x ∈ s, f x < 1 := by
let f : E β†’β‚—.[ℝ] ℝ := LinearPMap.mkSpanSingleton xβ‚€ 1 (ne_of_mem_of_not_mem hsβ‚€ hxβ‚€).symm have := exists_extension_of_le_sublinear f (gauge s) (fun c hc => gauge_smul_of_nonneg hc.le) (gauge_add_le hs₁ <| absorbent_nhds_zero <| hsβ‚‚.mem_nhds hsβ‚€) ?_ Β· obtain βŸ¨Ο†, hφ₁, hΟ†β‚‚βŸ© := this have hφ₃ : Ο† xβ‚€ = 1 := by...
1,894
import Mathlib.Analysis.Convex.Cone.Extension import Mathlib.Analysis.Convex.Gauge import Mathlib.Topology.Algebra.Module.FiniteDimension import Mathlib.Topology.Algebra.Module.LocallyConvex #align_import analysis.normed_space.hahn_banach.separation from "leanprover-community/mathlib"@"915591b2bb3ea303648db07284a161a...
Mathlib/Analysis/NormedSpace/HahnBanach/Separation.lean
84
112
theorem geometric_hahn_banach_open (hs₁ : Convex ℝ s) (hsβ‚‚ : IsOpen s) (ht : Convex ℝ t) (disj : Disjoint s t) : βˆƒ (f : E β†’L[ℝ] ℝ) (u : ℝ), (βˆ€ a ∈ s, f a < u) ∧ βˆ€ b ∈ t, u ≀ f b := by
obtain rfl | ⟨aβ‚€, haβ‚€βŸ© := s.eq_empty_or_nonempty Β· exact ⟨0, 0, by simp, fun b _hb => le_rfl⟩ obtain rfl | ⟨bβ‚€, hbβ‚€βŸ© := t.eq_empty_or_nonempty Β· exact ⟨0, 1, fun a _ha => zero_lt_one, by simp⟩ let xβ‚€ := bβ‚€ - aβ‚€ let C := xβ‚€ +α΅₯ (s - t) have : (0 : E) ∈ C := ⟨aβ‚€ - bβ‚€, sub_mem_sub haβ‚€ hbβ‚€, by simp_rw [xβ‚€...
1,894
import Mathlib.Analysis.Complex.UpperHalfPlane.Basic import Mathlib.LinearAlgebra.GeneralLinearGroup import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup import Mathlib.Topology.Instances.Matrix import Mathlib.Topology.Algebra.Module.FiniteDimension #align_import number_theory.modular from "leanprover-community/mat...
Mathlib/NumberTheory/Modular.lean
85
89
theorem bottom_row_coprime {R : Type*} [CommRing R] (g : SL(2, R)) : IsCoprime ((↑g : Matrix (Fin 2) (Fin 2) R) 1 0) ((↑g : Matrix (Fin 2) (Fin 2) R) 1 1) := by
use -(↑g : Matrix (Fin 2) (Fin 2) R) 0 1, (↑g : Matrix (Fin 2) (Fin 2) R) 0 0 rw [add_comm, neg_mul, ← sub_eq_add_neg, ← det_fin_two] exact g.det_coe
1,895
import Mathlib.Analysis.Complex.UpperHalfPlane.Basic import Mathlib.LinearAlgebra.GeneralLinearGroup import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup import Mathlib.Topology.Instances.Matrix import Mathlib.Topology.Algebra.Module.FiniteDimension #align_import number_theory.modular from "leanprover-community/mat...
Mathlib/NumberTheory/Modular.lean
94
104
theorem bottom_row_surj {R : Type*} [CommRing R] : Set.SurjOn (fun g : SL(2, R) => (↑g : Matrix (Fin 2) (Fin 2) R) 1) Set.univ {cd | IsCoprime (cd 0) (cd 1)} := by
rintro cd ⟨bβ‚€, a, gcd_eqn⟩ let A := of ![![a, -bβ‚€], cd] have det_A_1 : det A = 1 := by convert gcd_eqn rw [det_fin_two] simp [A, (by ring : a * cd 1 + bβ‚€ * cd 0 = bβ‚€ * cd 0 + a * cd 1)] refine ⟨⟨A, det_A_1⟩, Set.mem_univ _, ?_⟩ ext; simp [A]
1,895
import Mathlib.Analysis.Complex.UpperHalfPlane.Basic import Mathlib.LinearAlgebra.GeneralLinearGroup import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup import Mathlib.Topology.Instances.Matrix import Mathlib.Topology.Algebra.Module.FiniteDimension #align_import number_theory.modular from "leanprover-community/mat...
Mathlib/NumberTheory/Modular.lean
117
161
theorem tendsto_normSq_coprime_pair : Filter.Tendsto (fun p : Fin 2 β†’ β„€ => normSq ((p 0 : β„‚) * z + p 1)) cofinite atTop := by
-- using this instance rather than the automatic `Function.module` makes unification issues in -- `LinearEquiv.closedEmbedding_of_injective` less bad later in the proof. letI : Module ℝ (Fin 2 β†’ ℝ) := NormedSpace.toModule let Ο€β‚€ : (Fin 2 β†’ ℝ) β†’β‚—[ℝ] ℝ := LinearMap.proj 0 let π₁ : (Fin 2 β†’ ℝ) β†’β‚—[ℝ] ℝ := Linear...
1,895
import Mathlib.RingTheory.MvPowerSeries.Basic import Mathlib.RingTheory.Ideal.LocalRing #align_import ring_theory.power_series.basic from "leanprover-community/mathlib"@"2d5739b61641ee4e7e53eca5688a08f66f2e6a60" noncomputable section open Finset (antidiagonal mem_antidiagonal) namespace MvPowerSeries open Fi...
Mathlib/RingTheory/MvPowerSeries/Inverse.lean
90
97
theorem coeff_invOfUnit [DecidableEq Οƒ] (n : Οƒ β†’β‚€ β„•) (Ο† : MvPowerSeries Οƒ R) (u : RΛ£) : coeff R n (invOfUnit Ο† u) = if n = 0 then ↑u⁻¹ else -↑u⁻¹ * βˆ‘ x ∈ antidiagonal n, if x.2 < n then coeff R x.1 Ο† * coeff R x.2 (invOfUnit Ο† u) else 0 := by
convert coeff_inv_aux n (↑u⁻¹) Ο†
1,896
import Mathlib.RingTheory.MvPowerSeries.Basic import Mathlib.RingTheory.Ideal.LocalRing #align_import ring_theory.power_series.basic from "leanprover-community/mathlib"@"2d5739b61641ee4e7e53eca5688a08f66f2e6a60" noncomputable section open Finset (antidiagonal mem_antidiagonal) namespace MvPowerSeries open Fi...
Mathlib/RingTheory/MvPowerSeries/Inverse.lean
101
104
theorem constantCoeff_invOfUnit (Ο† : MvPowerSeries Οƒ R) (u : RΛ£) : constantCoeff Οƒ R (invOfUnit Ο† u) = ↑u⁻¹ := by
classical rw [← coeff_zero_eq_constantCoeff_apply, coeff_invOfUnit, if_pos rfl]
1,896
import Mathlib.RingTheory.MvPowerSeries.Basic import Mathlib.RingTheory.Ideal.LocalRing #align_import ring_theory.power_series.basic from "leanprover-community/mathlib"@"2d5739b61641ee4e7e53eca5688a08f66f2e6a60" noncomputable section open Finset (antidiagonal mem_antidiagonal) namespace MvPowerSeries open Fi...
Mathlib/RingTheory/MvPowerSeries/Inverse.lean
107
137
theorem mul_invOfUnit (Ο† : MvPowerSeries Οƒ R) (u : RΛ£) (h : constantCoeff Οƒ R Ο† = u) : Ο† * invOfUnit Ο† u = 1 := ext fun n => letI := Classical.decEq (Οƒ β†’β‚€ β„•) if H : n = 0 then by rw [H] simp [coeff_mul, support_single_ne_zero, h] else by classical have : ((0 : Οƒ β†’β‚€ β„•), n) ∈ ant...
rw [mem_antidiagonal, zero_add] rw [coeff_one, if_neg H, coeff_mul, ← Finset.insert_erase this, Finset.sum_insert (Finset.not_mem_erase _ _), coeff_zero_eq_constantCoeff_apply, h, coeff_invOfUnit, if_neg H, neg_mul, mul_neg, Units.mul_inv_cancel_left, ← Finset.insert_erase this, Finset.su...
1,896
import Mathlib.Algebra.Polynomial.Degree.CardPowDegree import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.NumberTheory.ClassNumber.AdmissibleAbsoluteValue import Mathlib.RingTheory.Ideal.LocalRing #align_import number_theory.class_number.admissible_card_pow_degree from "leanprover-community/mathlib"@"0b...
Mathlib/NumberTheory/ClassNumber/AdmissibleCardPowDegree.lean
36
57
theorem exists_eq_polynomial [Semiring Fq] {d : β„•} {m : β„•} (hm : Fintype.card Fq ^ d ≀ m) (b : Fq[X]) (hb : natDegree b ≀ d) (A : Fin m.succ β†’ Fq[X]) (hA : βˆ€ i, degree (A i) < degree b) : βˆƒ iβ‚€ i₁, iβ‚€ β‰  i₁ ∧ A i₁ = A iβ‚€ := by
-- Since there are > q^d elements of A, and only q^d choices for the highest `d` coefficients, -- there must be two elements of A with the same coefficients at -- `0`, ... `degree b - 1` ≀ `d - 1`. -- In other words, the following map is not injective: set f : Fin m.succ β†’ Fin d β†’ Fq := fun i j => (A i).coef...
1,897
import Mathlib.Algebra.Polynomial.Degree.CardPowDegree import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.NumberTheory.ClassNumber.AdmissibleAbsoluteValue import Mathlib.RingTheory.Ideal.LocalRing #align_import number_theory.class_number.admissible_card_pow_degree from "leanprover-community/mathlib"@"0b...
Mathlib/NumberTheory/ClassNumber/AdmissibleCardPowDegree.lean
63
98
theorem exists_approx_polynomial_aux [Ring Fq] {d : β„•} {m : β„•} (hm : Fintype.card Fq ^ d ≀ m) (b : Fq[X]) (A : Fin m.succ β†’ Fq[X]) (hA : βˆ€ i, degree (A i) < degree b) : βˆƒ iβ‚€ i₁, iβ‚€ β‰  i₁ ∧ degree (A i₁ - A iβ‚€) < ↑(natDegree b - d) := by
have hb : b β‰  0 := by rintro rfl specialize hA 0 rw [degree_zero] at hA exact not_lt_of_le bot_le hA -- Since there are > q^d elements of A, and only q^d choices for the highest `d` coefficients, -- there must be two elements of A with the same coefficients at -- `degree b - 1`, ... `degree b -...
1,897
import Mathlib.Algebra.Polynomial.Degree.CardPowDegree import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.NumberTheory.ClassNumber.AdmissibleAbsoluteValue import Mathlib.RingTheory.Ideal.LocalRing #align_import number_theory.class_number.admissible_card_pow_degree from "leanprover-community/mathlib"@"0b...
Mathlib/NumberTheory/ClassNumber/AdmissibleCardPowDegree.lean
106
149
theorem exists_approx_polynomial {b : Fq[X]} (hb : b β‰  0) {Ξ΅ : ℝ} (hΞ΅ : 0 < Ξ΅) (A : Fin (Fintype.card Fq ^ ⌈-log Ξ΅ / log (Fintype.card Fq)βŒ‰β‚Š).succ β†’ Fq[X]) : βˆƒ iβ‚€ i₁, iβ‚€ β‰  i₁ ∧ (cardPowDegree (A i₁ % b - A iβ‚€ % b) : ℝ) < cardPowDegree b β€’ Ξ΅ := by
have hbΞ΅ : 0 < cardPowDegree b β€’ Ξ΅ := by rw [Algebra.smul_def, eq_intCast] exact mul_pos (Int.cast_pos.mpr (AbsoluteValue.pos _ hb)) hΞ΅ have one_lt_q : 1 < Fintype.card Fq := Fintype.one_lt_card have one_lt_q' : (1 : ℝ) < Fintype.card Fq := by assumption_mod_cast have q_pos : 0 < Fintype.card Fq := by ...
1,897
import Mathlib.Algebra.CharP.Basic import Mathlib.RingTheory.Ideal.LocalRing import Mathlib.Algebra.IsPrimePow import Mathlib.Data.Nat.Factorization.Basic #align_import algebra.char_p.local_ring from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"
Mathlib/Algebra/CharP/LocalRing.lean
25
67
theorem charP_zero_or_prime_power (R : Type*) [CommRing R] [LocalRing R] (q : β„•) [char_R_q : CharP R q] : q = 0 ∨ IsPrimePow q := by
-- Assume `q := char(R)` is not zero. apply or_iff_not_imp_left.2 intro q_pos let K := LocalRing.ResidueField R haveI RM_char := ringChar.charP K let r := ringChar K let n := q.factorization r -- `r := char(R/m)` is either prime or zero: cases' CharP.char_is_prime_or_zero K r with r_prime r_zero Β· ...
1,898
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
85
105
theorem reduce_to_p_prime {P : Prop} : (βˆ€ p > 0, MixedCharZero R p β†’ P) ↔ βˆ€ p : β„•, p.Prime β†’ MixedCharZero R p β†’ P := by
constructor Β· intro h q q_prime q_mixedChar exact h q (Nat.Prime.pos q_prime) q_mixedChar Β· intro h q q_pos q_mixedChar rcases q_mixedChar.charP_quotient with ⟨I, hI_ne_top, _⟩ -- Krull's Thm: There exists a prime ideal `P` such that `I ≀ P` rcases Ideal.exists_le_maximal I hI_ne_top with ⟨M, hM_...
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
112
136
theorem reduce_to_maximal_ideal {p : β„•} (hp : Nat.Prime p) : (βˆƒ I : Ideal R, I β‰  ⊀ ∧ CharP (R β§Έ I) p) ↔ βˆƒ I : Ideal R, I.IsMaximal ∧ CharP (R β§Έ I) p := by
constructor Β· intro g rcases g with ⟨I, ⟨hI_not_top, _⟩⟩ -- Krull's Thm: There exists a prime ideal `M` such that `I ≀ M`. rcases Ideal.exists_le_maximal I hI_not_top with ⟨M, ⟨hM_max, hM_ge⟩⟩ use M constructor Β· exact hM_max Β· cases CharP.exists (R β§Έ M) with | intro r hr => ...
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
161
169
theorem of_algebraRat [Algebra β„š R] : βˆ€ I : Ideal R, I β‰  ⊀ β†’ CharZero (R β§Έ I) := by
intro I hI constructor intro a b h_ab contrapose! hI -- `↑a - ↑b` is a unit contained in `I`, which contradicts `I β‰  ⊀`. refine I.eq_top_of_isUnit_mem ?_ (IsUnit.map (algebraMap β„š R) (IsUnit.mk0 (a - b : β„š) ?_)) Β· simpa only [← Ideal.Quotient.eq_zero_iff_mem, map_sub, sub_eq_zero, map_natCast] simpa on...
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
178
189
theorem PNat.isUnit_natCast [h : Fact (βˆ€ I : Ideal R, I β‰  ⊀ β†’ CharZero (R β§Έ I))] (n : β„•+) : IsUnit (n : R) := by
-- `n : R` is a unit iff `(n)` is not a proper ideal in `R`. rw [← Ideal.span_singleton_eq_top] -- So by contrapositive, we should show the quotient does not have characteristic zero. apply not_imp_comm.mp (h.elim (Ideal.span {↑n})) intro h_char_zero -- In particular, the image of `n` in the quotient shoul...
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
204
209
theorem pnatCast_one [Fact (βˆ€ I : Ideal R, I β‰  ⊀ β†’ CharZero (R β§Έ I))] : ((1 : β„•+) : RΛ£) = 1 := by
apply Units.ext rw [Units.val_one] change ((PNat.isUnit_natCast (R := R) 1).unit : R) = 1 rw [IsUnit.unit_spec (PNat.isUnit_natCast 1)] rw [PNat.one_coe, Nat.cast_one]
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
214
217
theorem pnatCast_eq_natCast [Fact (βˆ€ I : Ideal R, I β‰  ⊀ β†’ CharZero (R β§Έ I))] (n : β„•+) : ((n : RΛ£) : R) = ↑n := by
change ((PNat.isUnit_natCast (R := R) n).unit : R) = ↑n simp only [IsUnit.unit_spec]
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
250
260
theorem of_not_mixedCharZero [CharZero R] (h : βˆ€ p > 0, Β¬MixedCharZero R p) : βˆ€ I : Ideal R, I β‰  ⊀ β†’ CharZero (R β§Έ I) := by
intro I hI_ne_top suffices CharP (R ⧸ I) 0 from CharP.charP_to_charZero _ cases CharP.exists (R ⧸ I) with | intro p hp => cases p with | zero => exact hp | succ p => have h_mixed : MixedCharZero R p.succ := ⟨⟨I, ⟨hI_ne_top, hp⟩⟩⟩ exact absurd h_mixed (h p.succ p.succ_pos)
1,899
import Mathlib.Algebra.CharP.LocalRing import Mathlib.RingTheory.Ideal.Quotient import Mathlib.Tactic.FieldSimp #align_import algebra.char_p.mixed_char_zero from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a" variable (R : Type*) [CommRing R] class MixedCharZero (p : β„•) : Prop where ...
Mathlib/Algebra/CharP/MixedCharZero.lean
264
270
theorem to_not_mixedCharZero (h : βˆ€ I : Ideal R, I β‰  ⊀ β†’ CharZero (R β§Έ I)) : βˆ€ p > 0, Β¬MixedCharZero R p := by
intro p p_pos by_contra hp_mixedChar rcases hp_mixedChar.charP_quotient with ⟨I, hI_ne_top, hI_p⟩ replace hI_zero : CharP (R ⧸ I) 0 := @CharP.ofCharZero _ _ (h I hI_ne_top) exact absurd (CharP.eq (R ⧸ I) hI_p hI_zero) (ne_of_gt p_pos)
1,899
import Mathlib.Algebra.Polynomial.Module.Basic import Mathlib.Algebra.Ring.Idempotents import Mathlib.RingTheory.Ideal.LocalRing import Mathlib.RingTheory.Noetherian import Mathlib.RingTheory.ReesAlgebra import Mathlib.RingTheory.Finiteness import Mathlib.Order.Basic import Mathlib.Order.Hom.Lattice #align_import rin...
Mathlib/RingTheory/Filtration.lean
67
71
theorem pow_smul_le (i j : β„•) : I ^ i β€’ F.N j ≀ F.N (i + j) := by
induction' i with _ ih Β· simp Β· rw [pow_succ', mul_smul, add_assoc, add_comm 1, ← add_assoc] exact (smul_mono_right _ ih).trans (F.smul_le _)
1,900