Appendix: Full proof of that $z \mapsto \sin^{-1} z^{-1}$ is not meromorphic at $0$
```lean4 module import Mathlib.Analysis.Meromorphic.Basic import Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv import Mathlib.Analysis.SpecificLimits.RCLike open Complex Filter Bornology open scoped Real Topology Pointwise @[simp] lemma Filter.frequently_inv {α : Type*} [Inv α] {f : Filter α} {p : α → Prop} : (∃ᶠ a in f⁻¹, p a) ↔ (∃ᶠ a in f, p a⁻¹) := frequently_map example : ¬MeromorphicAt (fun z => sin⁻¹ z⁻¹) 0 := by apply mt MeromorphicAt.eventually_eq_zero_or_eventually_ne_zero conv => equals (∃ᶠ z in cobounded ℂ, sin z ≠ 0) ∧ (∃ᶠ z in cobounded ℂ, sin z = 0) => simp [← inv_cobounded₀] constructor case left => have ht : Tendsto (fun x : ℝ ↦ ↑x * I) (cobounded ℝ) (cobounded ℂ) := by have ht₁ : Tendsto ((↑) : ℝ → ℂ) (cobounded ℝ) (cobounded ℂ) := RCLike.tendsto_ofReal_cobounded_cobounded ℂ have ht₂ : Tendsto (fun z : ℂ ↦ z * I) (cobounded ℂ) (cobounded ℂ) := tendsto_mul_right_cobounded (by simp) exact ht₂.comp ht₁ refine ht.frequently_map _ (fun x ↦ mt ?_) (eventually_ne_cobounded 0).frequently rw [sin_eq_zero_iff] rintro ⟨n, hn⟩ simpa using congr_arg im hn case right => suffices ht : Tendsto (fun n : ℤ ↦ (↑n * ↑π : ℂ)) atTop (cobounded ℂ) by apply ht.frequently; simp [sin_int_mul_pi, atTop_neBot] have ht₁ : Tendsto ((↑) : ℤ → ℝ) atTop (cobounded ℝ) := tendsto_intCast_atTop_cobounded have ht₂ : Tendsto ((↑) : ℝ → ℂ) (cobounded ℝ) (cobounded ℂ) := RCLike.tendsto_ofReal_cobounded_cobounded ℂ have ht₃ : Tendsto (fun z : ℂ ↦ z * ↑π) (cobounded ℂ) (cobounded ℂ) := tendsto_mul_right_cobounded (by simp) exact ht₃.comp <| ht₂.comp ht₁ ```Show trace profiling of mapRange_def: 11 ms before, 12 ms after
### Trace profiling of `mapRange_def` before PR 32136
```diff
diff --git a/Mathlib/Data/DFinsupp/Defs.lean b/Mathlib/Data/DFinsupp/Defs.lean
index 7d7269bf51..db05c94165 100644
ESTIMATED CHANGES
Modified Mathlib/Data/DFinsupp/Defs.lean
2025-11-28 17:46:11 7fe0b73
feat(RingTheory): ann(I) ≠ ⊥ from ∀ r ∈ I, ann(r) ≠ ⊥ (#32135)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Span/Basic.lean
+ theorem LinearMap.ker_toSpanSingleton_eq_bot_iff
Modified Mathlib/RingTheory/Ideal/AssociatedPrime/Finiteness.lean
+ theorem Ideal.bot_lt_annihilator_of_disjoint_nonZeroDivisors
+ theorem Ideal.nonempty_inter_nonZeroDivisors_of_faithfulSMul
2025-11-28 17:46:10 e45c309
chore(Data/Set): golf entire `Injective.compl_image_eq` using `grind` (#32115)
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Image.lean
2025-11-28 17:46:08 6af175d
chore(Data/Vector): golf `ofFn_get` (#32113)
ESTIMATED CHANGES
Modified Mathlib/Data/Vector/Basic.lean
2025-11-28 17:46:06 4dbedbe
chore(MeasureTheory/MeasurableSpace): golf `generateFrom_pi_eq` using `grind` (#32112)
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/MeasurableSpace/Pi.lean
2025-11-28 17:46:04 ae7605f
feat(CategoryTheory/Triangulated): spectral objects (#31586)
In this file, we introduce the category `SpectralObject C ι` of spectral objects in a pretriangulated category `C` indexed by the category `ι`, a notion introduced by Verdier in order to give a nice presentation of spectral sequences.
In the short term, I intend to PR the construction of the spectral object consisting of all truncations of an object in a triangulated category equipped with a t-structure. In a more distant future, the analogous notion of spectral object in an abelian category shall be introduced, and spectral sequences will be constructed by combining two facts :
1. by applying an homological functor, a spectral object in a triangulated category can be transformed into a spectral object in an abelian category (easy)
2. spectral sequences are attached to spectral objects in abelian categories (very technical)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Triangulated/SpectralObject.lean
+ structure CategoryTheory.Triangulated.SpectralObject.Hom
+ theorem CategoryTheory.Triangulated.SpectralObject.comp_hom
+ theorem CategoryTheory.Triangulated.SpectralObject.hom_ext
+ theorem CategoryTheory.Triangulated.SpectralObject.id_hom
+ theorem CategoryTheory.Triangulated.SpectralObject.mapTriangulatedFunctor_δ
+ def CategoryTheory.Triangulated.SpectralObject.triangle
+ theorem CategoryTheory.Triangulated.SpectralObject.triangle_distinguished
+ def CategoryTheory.Triangulated.SpectralObject.δ
+ theorem CategoryTheory.Triangulated.SpectralObject.ω₂_obj_distinguished
+ structure CategoryTheory.Triangulated.SpectralObject
2025-11-28 16:39:34 d14bbde
chore: make ac_rfl tactic as flexible (#32206)
[Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/345428-mathlib-reviewers/topic/PR.20!4.2328962.3A.20chore.3A.20enable.20the.20flexible.20linter.20in.20mathlib/near/560774327)
ESTIMATED CHANGES
Modified Mathlib/Tactic/Linter/FlexibleLinter.lean
Modified MathlibTest/FlexibleLinter.lean
2025-11-28 16:39:33 2a3c47d
chore(Logic/Equiv): golf entire `Function.Injective.map_swap` using `grind` (#32110)
ESTIMATED CHANGES
Modified Mathlib/Logic/Equiv/Basic.lean
2025-11-28 16:39:31 9c9edd0
feat(MeasureTheory): subsetness is measurable (#32096)
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean
+/- theorem MeasurableSet.sep_finite
+/- theorem MeasurableSet.sep_infinite
+/- theorem MeasurableSet.setOf_finite
+/- theorem MeasurableSet.setOf_infinite
2025-11-28 16:39:29 6ccffb6
chore(to_additive): remove redundant entries from `abbreviationDict` (#32092)
This PR removes some entries from the `to_additive` `abbreviationDict`. These were only used in `noncommProd_mul_single` which I have renamed to `noncommProd_mulSingle`.
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/NoncommProd.lean
+ theorem Finset.noncommProd_mulSingle
- theorem Finset.noncommProd_mul_single
Modified Mathlib/GroupTheory/Finiteness.lean
Modified Mathlib/Tactic/Translate/ToAdditive.lean
Modified MathlibTest/toAdditive.lean
2025-11-28 16:39:27 a15523f
chore(CategoryTheory): make the construction effective epi -> regular epi use general pullback cones (#32086)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Shapes/RegularMono.lean
+ def CategoryTheory.isColimitCoforkOfEffectiveEpi
2025-11-28 16:39:26 6d6a180
chore(Logic/Function): golf `Injective.dite` and `rec_update` (+ others) using `grind` (#32068)
ESTIMATED CHANGES
Modified Mathlib/Logic/Function/Basic.lean
2025-11-28 16:39:24 43c1e61
doc(LinearAlgebra/CliffordAlgebra/Contraction): fix typos (#31863)
Issues found and fixed with help from Codex.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Contraction.lean
2025-11-28 16:39:22 a6080a7
feat: add `grind` annotations for `Set.mem_toFinset` and `Multiset.mem_toFinset` (#31818)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Enumerative/Partition/Basic.lean
Modified Mathlib/Combinatorics/Enumerative/Partition/GenFun.lean
Modified Mathlib/Data/Finset/Dedup.lean
Modified Mathlib/Data/Fintype/Sets.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Defs.lean
2025-11-28 16:39:21 0225efd
feat(Algebra/Polynomial/AlgebraMap): add Polynomial.mapAlgHom lemmas (#30547)
Co-authored by: @AntoineChambert-Loir
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/AlgebraMap.lean
+ theorem Polynomial.X_pow_smul_rTensor_monomial
+ theorem Polynomial.coeff_mapAlgHom_apply
+ theorem Polynomial.lcoeff_comp_mapAlgHom_eq
+ theorem Polynomial.mapAlgHom_monomial
2025-11-28 16:39:19 ecc842f
feat: Fin.find update (#30037)
We currently define `Fin.find` in a way that is redundant (in the sense that it is just equivalent to `Fin.find?` in batteries). This PR replaces it with a definition that works closer to `Nat.find`, and links the new definition of `Fin.find` to `Fin.find?` in the natural way.
ESTIMATED CHANGES
Modified Mathlib/Data/Fin/Tuple/Basic.lean
- def Fin.find
+ theorem Fin.find?_decide_eq_dite
+ theorem Fin.find?_decide_get_eq_find
+ theorem Fin.find?_eq_dite
+ theorem Fin.find?_eq_some_find_of_exists
+ theorem Fin.find?_eq_some_find_of_isSome
+ theorem Fin.find_congr'
+ theorem Fin.find_congr
+ theorem Fin.find_eq_dite
+ theorem Fin.find_eq_iff
- theorem Fin.find_eq_none_iff
- theorem Fin.find_eq_some_iff
+ theorem Fin.find_eq_zero
+ theorem Fin.find_le
+ theorem Fin.find_le_iff
+ theorem Fin.find_lt_iff
+ theorem Fin.find_mem_find?_decide
- theorem Fin.find_min'
- theorem Fin.find_min
+ theorem Fin.find_mono
+ theorem Fin.find_mono_of_le
+ theorem Fin.find_nat_lt
+ theorem Fin.find_of_find_le
+ theorem Fin.find_of_not_zero
+ theorem Fin.find_pos
- theorem Fin.find_spec
+ theorem Fin.get_find?_eq_find_of_eq_true
- theorem Fin.isSome_find_iff
+ theorem Fin.le_find_iff
+ theorem Fin.lt_find_iff
+ theorem Fin.mem_find?_iff
- theorem Fin.mem_find_iff
- theorem Fin.mem_find_of_unique
- theorem Fin.nat_find_mem_find
+ theorem Fin.val_find
2025-11-28 16:39:17 d6ab112
refactor: use isometry extensions for completions at infinite places of number fields (#29969)
The API for `InfinitePlace.Completion` currently makes use of abstract results defined on absolute values, which all depend on the hypothesis of the form `∀ x, ‖f x‖ = v x`. This is equivalent to `f` being an isometry, and so many of these results can be bypassed and deprecated by using `Isometry.completion_extension`
ESTIMATED CHANGES
Modified Mathlib/Analysis/Normed/Field/WithAbs.lean
+/- theorem AbsoluteValue.Completion.locallyCompactSpace
Modified Mathlib/NumberTheory/NumberField/AdeleRing.lean
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Completion.lean
+/- def NumberField.InfinitePlace.Completion.extensionEmbedding
+ theorem NumberField.InfinitePlace.isometry_embedding
+ theorem NumberField.InfinitePlace.isometry_embedding_of_isReal
Modified Mathlib/Topology/MetricSpace/Completion.lean
+/- theorem Isometry.completion_extension
+ def Isometry.extensionHom
+ theorem Isometry.extensionHom_coe
2025-11-28 16:39:16 5f80bf5
feat: grind annotations for `Disjoint` (#28026)
ESTIMATED CHANGES
Modified Archive/Imo/Imo2001Q3.lean
Modified Mathlib/Data/Finset/Disjoint.lean
Modified Mathlib/Data/Set/Disjoint.lean
+/- theorem Set.disjoint_iff_forall_ne
+/- theorem Set.not_disjoint_iff
Modified Mathlib/Order/BooleanAlgebra/Basic.lean
Modified Mathlib/Order/BoundedOrder/Basic.lean
Modified Mathlib/Order/BoundedOrder/Lattice.lean
Modified Mathlib/Order/CompleteLattice/MulticoequalizerDiagram.lean
Modified Mathlib/Order/Disjoint.lean
+/- theorem Codisjoint.eq_iff
+/- theorem Codisjoint.ne_iff
+ theorem Codisjoint.out
+/- theorem Disjoint.eq_iff
+/- theorem Disjoint.ne_iff
+ theorem Disjoint.out
+/- theorem codisjoint_assoc
+/- theorem codisjoint_left_comm
+/- theorem codisjoint_right_comm
Modified Mathlib/Order/SupIndep.lean
Modified MathlibTest/grind/pairwise_disjoint.lean
2025-11-28 15:51:32 7c89bb6
feat: universal property of weak convergence over a compact space (#32087)
... in terms of continuous maps
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Measure/FiniteMeasure.lean
+ theorem MeasureTheory.FiniteMeasure.continuous_iff_forall_continuousMap_continuous_integral
+ theorem MeasureTheory.FiniteMeasure.continuous_iff_forall_continuousMap_continuous_lintegral
+/- theorem MeasureTheory.FiniteMeasure.continuous_iff_forall_continuous_integral
+/- theorem MeasureTheory.FiniteMeasure.continuous_iff_forall_continuous_lintegral
+/- theorem MeasureTheory.FiniteMeasure.continuous_integral_boundedContinuousFunction
+ theorem MeasureTheory.FiniteMeasure.continuous_integral_continuousMap
+ theorem MeasureTheory.FiniteMeasure.continuous_lintegral_boundedContinuousFunction
+ theorem MeasureTheory.FiniteMeasure.continuous_lintegral_continuousMap
Modified Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean
+ theorem MeasureTheory.ProbabilityMeasure.continuous_iff_forall_continuousMap_continuous_integral
+ theorem MeasureTheory.ProbabilityMeasure.continuous_iff_forall_continuousMap_continuous_lintegral
+/- theorem MeasureTheory.ProbabilityMeasure.continuous_iff_forall_continuous_integral
+/- theorem MeasureTheory.ProbabilityMeasure.continuous_iff_forall_continuous_lintegral
+/- theorem MeasureTheory.ProbabilityMeasure.continuous_integral_boundedContinuousFunction
+ theorem MeasureTheory.ProbabilityMeasure.continuous_integral_continuousMap
+ theorem MeasureTheory.ProbabilityMeasure.continuous_lintegral_boundedContinuousFunction
+ theorem MeasureTheory.ProbabilityMeasure.continuous_lintegral_continuousMap
2025-11-28 15:51:30 7a3abee
chore(Data/Fintype): golf entire `piFinset_update_eq_filter_piFinset_mem` (+ others) using `grind`. `grind` annotate `mem_piFinset` (#32065)
ESTIMATED CHANGES
Modified Mathlib/Data/Fintype/Pi.lean
2025-11-28 15:51:29 ceaf127
refactor(SetTheory/Ordinal): use generic order lemmas (#31883)
... and deprecate the custom `Ordinal` ones
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Spectrum/Prime/LTSeries.lean
Modified Mathlib/SetTheory/Cardinal/Aleph.lean
Modified Mathlib/SetTheory/Cardinal/Cofinality.lean
Modified Mathlib/SetTheory/Cardinal/Ordinal.lean
Modified Mathlib/SetTheory/Game/Birthday.lean
Modified Mathlib/SetTheory/Game/Nim.lean
Modified Mathlib/SetTheory/Game/Ordinal.lean
Modified Mathlib/SetTheory/Nimber/Basic.lean
Modified Mathlib/SetTheory/Ordinal/Arithmetic.lean
+/- theorem Ordinal.div_le_of_le_mul
+/- theorem Ordinal.sub_le_self
+/- theorem Ordinal.zero_div
+/- theorem Ordinal.zero_sub
Modified Mathlib/SetTheory/Ordinal/Basic.lean
- theorem Ordinal.eq_zero_or_pos
- theorem Ordinal.le_add_left
- theorem Ordinal.le_add_right
Modified Mathlib/SetTheory/Ordinal/Exponential.lean
Modified Mathlib/SetTheory/Ordinal/Family.lean
Modified Mathlib/SetTheory/Ordinal/FixedPoint.lean
Modified Mathlib/SetTheory/Ordinal/NaturalOps.lean
- theorem NatOrdinal.zero_le
+/- theorem Ordinal.le_nadd_self
+/- theorem Ordinal.le_self_nadd
Modified Mathlib/SetTheory/Ordinal/Notation.lean
Modified Mathlib/SetTheory/Ordinal/Principal.lean
Modified Mathlib/SetTheory/Ordinal/Topology.lean
Modified Mathlib/SetTheory/Ordinal/Veblen.lean
Modified Mathlib/Topology/Category/Profinite/Nobeling/Induction.lean
2025-11-28 14:57:34 fa915c1
feat(Data/Finite/Defs): add `@[push]` tag for `Set.not_finite` and `Set.not_infinite` (#32199)
This PR extends `push_neg` with the two lemmas about `Set.Infinite`/`Set.Finite`.
ESTIMATED CHANGES
Modified Archive/Imo/Imo2024Q3.lean
Modified Counterexamples/AharoniKorman.lean
Modified Mathlib/Algebra/Order/Archimedean/IndicatorCard.lean
Modified Mathlib/Combinatorics/Matroid/Basic.lean
Modified Mathlib/Data/ENat/Lattice.lean
Modified Mathlib/Data/Finite/Defs.lean
+ theorem Set.not_finite
Modified Mathlib/Data/Finite/Prod.lean
Modified Mathlib/Data/Set/Card.lean
Modified Mathlib/Data/Set/MulAntidiagonal.lean
Modified Mathlib/Data/Set/SMulAntidiagonal.lean
Modified Mathlib/GroupTheory/OrderOfElement.lean
Modified Mathlib/LinearAlgebra/Reflection.lean
Modified Mathlib/NumberTheory/DiophantineApproximation/Basic.lean
Modified Mathlib/NumberTheory/LSeries/PrimesInAP.lean
Modified Mathlib/NumberTheory/Pell.lean
Modified Mathlib/Order/CompactlyGenerated/Basic.lean
Modified Mathlib/Order/WellFoundedSet.lean
Modified Mathlib/Order/WellQuasiOrder.lean
2025-11-28 14:57:32 0594480
feat(CategoryTheory/Bicategory): define lax transformations between oplax functors (#25825)
and also define oplax transformations between lax functors.
- [x] depends on: #25779
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Lax.lean
+ def CategoryTheory.Lax.OplaxTrans.id
+ def CategoryTheory.Lax.OplaxTrans.vComp
+ theorem CategoryTheory.Lax.OplaxTrans.vComp_naturality_comp
+ theorem CategoryTheory.Lax.OplaxTrans.vComp_naturality_id
+ theorem CategoryTheory.Lax.OplaxTrans.vComp_naturality_naturality
+ structure CategoryTheory.Lax.OplaxTrans
Modified Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Oplax.lean
+ def CategoryTheory.Oplax.LaxTrans.id
+ def CategoryTheory.Oplax.LaxTrans.vComp
+ theorem CategoryTheory.Oplax.LaxTrans.vComp_naturality_comp
+ theorem CategoryTheory.Oplax.LaxTrans.vComp_naturality_id
+ theorem CategoryTheory.Oplax.LaxTrans.vComp_naturality_naturality
+ structure CategoryTheory.Oplax.LaxTrans
Modified scripts/noshake.json
2025-11-28 14:12:31 4bb77eb
chore(Data/Finsupp): Rename degree_def (#32179)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Nullstellensatz.lean
Modified Mathlib/Data/Finsupp/Weight.lean
+ theorem Finsupp.degree_apply
- theorem Finsupp.degree_def
Modified Mathlib/RingTheory/MvPolynomial/Homogeneous.lean
Modified Mathlib/RingTheory/MvPowerSeries/Substitution.lean
2025-11-28 14:12:29 c44323d
feat(RingTheory): compute the characteristic of the quotient by an ideal (#32168)
More precisely, we prove:
```lean
theorem Ideal.ringChar_quot {S : Type*} [CommRing S] (I : Ideal S) :
ringChar (S ⧸ I) = absNorm (under ℤ I)
```
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Ideal/Int.lean
+ theorem Ideal.ringChar_quot
2025-11-28 14:12:27 b7da419
feat(LinearAlgebra): rank of commutative semiring over itself (#32123)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Dimension/Basic.lean
+ theorem CommSemiring.rank_self
+ theorem Module.le_rank_iff
+ theorem Module.le_rank_iff_exists_finset
+ theorem Module.le_rank_iff_exists_linearMap
+ theorem Module.one_le_rank_iff
+ theorem rank_subsingleton
Modified Mathlib/LinearAlgebra/Dimension/Finrank.lean
+ theorem CommSemiring.finrank_self
Modified Mathlib/LinearAlgebra/Dimension/Subsingleton.lean
- theorem rank_subsingleton
Modified Mathlib/SetTheory/Cardinal/Basic.lean
+ theorem Cardinal.exists_finset_eq_card
2025-11-28 14:12:25 5971034
feat(LinearAlgebra/Span): improve `R ∙ x` notation precedence and printing (#32108)
This PR makes 2 changes to the `R ∙ x` notation.
- The precedence is improved. On the one hand, we want to write `R ∙ x ⊔ R ∙ y`/`R ∙ x ⊓ R ∙ y` without brackets, so the precedence should be least `70`. On the other hand we want to be able to write `R ∙ a * b` without brackets, so the precedence should be at most `70`.
As a result, the notation `ℝ ∙ (v - w)` now does require brackets, but I think this is reasonable.
- An `app_unexpander` has been added to pretty print the notation. This unexpander needs to be defined by hand because we need to explicitly tell it that the `{_}` notation that is used is the `«term{_}»` notation.
This PR also removes a bunch of unneeded brackets.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Lie/Engel.lean
Modified Mathlib/Algebra/Lie/Normalizer.lean
+/- theorem LieSubalgebra.lie_mem_sup_of_mem_normalizer
Modified Mathlib/Algebra/Module/Torsion/Basic.lean
Modified Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean
Modified Mathlib/Analysis/InnerProductSpace/Projection/Reflection.lean
Modified Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean
+/- theorem Orientation.two_zsmul_oangle_left_of_span_eq
+/- theorem Orientation.two_zsmul_oangle_of_span_eq_of_span_eq
+/- theorem Orientation.two_zsmul_oangle_right_of_span_eq
Modified Mathlib/Geometry/Euclidean/MongePoint.lean
Modified Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean
+/- theorem vectorSpan_pair
+/- theorem vectorSpan_pair_rev
Modified Mathlib/LinearAlgebra/Basis/Flag.lean
Modified Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean
Modified Mathlib/LinearAlgebra/Dimension/FreeAndStrongRankCondition.lean
Modified Mathlib/LinearAlgebra/Reflection.lean
Modified Mathlib/LinearAlgebra/Span/Basic.lean
+/- theorem Submodule.covBy_span_singleton_sup
+/- theorem Submodule.wcovBy_span_singleton_sup
Modified Mathlib/LinearAlgebra/Span/Defs.lean
+/- theorem Submodule.lt_sup_iff_notMem
+/- theorem Submodule.mem_span_singleton
+/- theorem Submodule.span_insert
+/- theorem Submodule.span_singleton_eq_bot
+/- theorem Submodule.span_singleton_eq_range
+/- theorem Submodule.span_singleton_eq_top_iff
+/- theorem Submodule.span_singleton_le_iff_mem
+/- theorem Submodule.span_singleton_smul_eq
+/- theorem Submodule.span_zero_singleton
Modified Mathlib/RingTheory/Noetherian/Defs.lean
Modified Mathlib/Topology/Instances/AddCircle/Defs.lean
Modified Mathlib/Topology/Instances/AddCircle/Real.lean
2025-11-28 14:12:23 ba5f510
refactor(Algebra/Polynomial/Splits): continue deprecation (#32103)
This PR continues the deprecation in `Splits.lean` as we move over to the new API in `Factors.lean`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/CubicDiscriminant.lean
Modified Mathlib/Algebra/Polynomial/Factors.lean
+ theorem IsUnit.splits
+ theorem Polynomial.Splits.comp_X_add_C
+ theorem Polynomial.Splits.comp_X_sub_C
+ theorem Polynomial.Splits.comp_of_degree_le_one
+ theorem Polynomial.Splits.comp_of_degree_le_one_of_invertible
+ theorem Polynomial.Splits.comp_of_degree_le_one_of_monic
+ theorem Polynomial.Splits.comp_of_natDegree_le_one
+ theorem Polynomial.Splits.comp_of_natDegree_le_one_of_invertible
+ theorem Polynomial.Splits.comp_of_natDegree_le_one_of_monic
- theorem Polynomial.Splits.of_dvd
+ theorem Polynomial.Splits.splits_of_dvd
+ theorem Polynomial.splits_iff_comp_splits_of_degree_eq_one
+ theorem Polynomial.splits_iff_comp_splits_of_natDegree_eq_one
+ theorem Polynomial.splits_of_degree_le_one_of_invertible
+ theorem Polynomial.splits_of_degree_le_one_of_monic
+ theorem Polynomial.splits_of_natDegree_le_one_of_invertible
+ theorem Polynomial.splits_of_natDegree_le_one_of_monic
Modified Mathlib/Algebra/Polynomial/Splits.lean
- theorem Polynomial.Splits.comp_X_add_C
- theorem Polynomial.Splits.comp_X_sub_C
- theorem Polynomial.Splits.comp_of_degree_le_one
- theorem Polynomial.eq_prod_roots_of_splits
- theorem Polynomial.eq_prod_roots_of_splits_id
- theorem Polynomial.splits_iff_comp_splits_of_degree_eq_one
- theorem Polynomial.splits_mul
- theorem Polynomial.splits_of_isUnit
- theorem Polynomial.splits_of_splits_mul'
- theorem Polynomial.splits_of_splits_mul
- theorem Polynomial.splits_of_splits_of_dvd
Modified Mathlib/Analysis/Polynomial/MahlerMeasure.lean
Modified Mathlib/FieldTheory/AbelRuffini.lean
Modified Mathlib/FieldTheory/Finite/GaloisField.lean
Modified Mathlib/FieldTheory/Galois/Basic.lean
Modified Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean
Modified Mathlib/FieldTheory/IsAlgClosed/Basic.lean
Modified Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
Modified Mathlib/FieldTheory/Isaacs.lean
Modified Mathlib/FieldTheory/Normal/Basic.lean
Modified Mathlib/FieldTheory/Normal/Closure.lean
Modified Mathlib/FieldTheory/Normal/Defs.lean
Modified Mathlib/FieldTheory/PolynomialGaloisGroup.lean
Modified Mathlib/FieldTheory/Separable.lean
Modified Mathlib/FieldTheory/SplittingField/IsSplittingField.lean
Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean
Modified Mathlib/RingTheory/Adjoin/Field.lean
Modified Mathlib/RingTheory/Invariant/Basic.lean
Modified Mathlib/RingTheory/Polynomial/IsIntegral.lean
2025-11-28 14:12:21 7f65024
refactor(FieldTheory/IsAlgClosed,IsSepClosed): rename from `factors` to `splits` (#32036)
This PR corrects the names of the fields of `IsAlgClosed` and `IsSepClosed`.
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/IsAlgClosed/Basic.lean
- theorem IsAlgClosed.splits
Modified Mathlib/FieldTheory/IsSepClosed.lean
- theorem IsSepClosed.splits_of_separable
2025-11-28 14:12:19 f8c8067
chore(CategoryTheory): generalize `EqualizerCondition.bijective_mapToEqualizer_pullback` to abstract pullback cones (#31906)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Sites/Coherent/RegularSheaves.lean
+ theorem CategoryTheory.regularTopology.EqualizerCondition.bijective_mapToEqualizer_pullback'
+/- theorem CategoryTheory.regularTopology.EqualizerCondition.bijective_mapToEqualizer_pullback
+ theorem CategoryTheory.regularTopology.EqualizerCondition.mk'
- def CategoryTheory.regularTopology.MapToEqualizer
+ def CategoryTheory.regularTopology.mapToEqualizer
Modified Mathlib/Condensed/TopComparison.lean
2025-11-28 13:07:46 3b77237
chore: enable the flexible linter in mathlib (#28962)
Let's see what has regressed in the mean-time, and how many exceptions remain.
We're somewhat liberal with disabling the linter when this doesn't make sense: let's see how close we are.
ESTIMATED CHANGES
Modified Archive/Arithcc.lean
Modified Archive/Examples/Eisenstein.lean
Modified Archive/Examples/IfNormalization/Result.lean
Modified Archive/Imo/Imo1997Q3.lean
Modified Archive/Imo/Imo2008Q4.lean
Modified Archive/Imo/Imo2019Q4.lean
Modified Archive/Imo/Imo2024Q5.lean
Modified Counterexamples/MapFloor.lean
Modified Mathlib/Algebra/Field/GeomSum.lean
Modified Mathlib/Algebra/FreeAlgebra.lean
Modified Mathlib/Algebra/Group/Submonoid/Basic.lean
Modified Mathlib/Algebra/Homology/Augment.lean
Modified Mathlib/Algebra/Lie/Nilpotent.lean
Modified Mathlib/Algebra/Lie/Weights/IsSimple.lean
Modified Mathlib/Algebra/LinearRecurrence.lean
Modified Mathlib/Algebra/Module/ZLattice/Summable.lean
Modified Mathlib/Algebra/Polynomial/Bivariate.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/Algebra/Ring/Subring/Basic.lean
Modified Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean
Modified Mathlib/AlgebraicGeometry/Cover/Directed.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Formula.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Formula.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Formula.lean
Modified Mathlib/AlgebraicGeometry/Limits.lean
Modified Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Monoidal.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/HomotopyCat.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean
Modified Mathlib/Analysis/AbsoluteValue/Equivalence.lean
Modified Mathlib/Analysis/Analytic/Constructions.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean
Modified Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean
Modified Mathlib/Analysis/Calculus/LHopital.lean
Modified Mathlib/Analysis/Complex/Arg.lean
Modified Mathlib/Analysis/Complex/Exponential.lean
Modified Mathlib/Analysis/Complex/JensenFormula.lean
Modified Mathlib/Analysis/Fourier/FourierTransformDeriv.lean
Modified Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean
Modified Mathlib/Analysis/InnerProductSpace/Rayleigh.lean
Modified Mathlib/Analysis/MeanInequalities.lean
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/PosPart/Basic.lean
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/IntegralRepresentation.lean
Modified Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean
Modified Mathlib/Analysis/SpecialFunctions/Gaussian/FourierTransform.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean
Modified Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
Modified Mathlib/Analysis/SpecialFunctions/Pow/Real.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Complex.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean
Modified Mathlib/CategoryTheory/Bicategory/Adjunction/Mate.lean
Modified Mathlib/CategoryTheory/Bicategory/InducedBicategory.lean
Modified Mathlib/CategoryTheory/Comma/Over/Pullback.lean
Modified Mathlib/CategoryTheory/Dialectica/Monoidal.lean
Modified Mathlib/CategoryTheory/Galois/Basic.lean
Modified Mathlib/CategoryTheory/Limits/Constructions/Equalizers.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Grothendieck.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Products.lean
Modified Mathlib/CategoryTheory/Limits/VanKampen.lean
Modified Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean
Modified Mathlib/CategoryTheory/Monoidal/Internal/Module.lean
Modified Mathlib/CategoryTheory/Products/Basic.lean
Modified Mathlib/Combinatorics/Additive/Corner/Roth.lean
Modified Mathlib/Combinatorics/Additive/FreimanHom.lean
Modified Mathlib/Combinatorics/Additive/SmallTripling.lean
Modified Mathlib/Combinatorics/Additive/VerySmallDoubling.lean
Modified Mathlib/Combinatorics/SetFamily/FourFunctions.lean
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean
Modified Mathlib/Computability/Halting.lean
Modified Mathlib/Computability/Partrec.lean
Modified Mathlib/Computability/PartrecCode.lean
Modified Mathlib/Computability/Primrec.lean
Modified Mathlib/Computability/TMConfig.lean
Modified Mathlib/Computability/TMToPartrec.lean
Modified Mathlib/Control/EquivFunctor/Instances.lean
Modified Mathlib/Data/Bool/Count.lean
Modified Mathlib/Data/ENat/Basic.lean
Modified Mathlib/Data/EReal/Operations.lean
Modified Mathlib/Data/Finsupp/Sigma.lean
Modified Mathlib/Data/Matrix/Basis.lean
Modified Mathlib/Data/Multiset/Bind.lean
Modified Mathlib/Data/Nat/Digits/Defs.lean
Modified Mathlib/Data/Nat/Digits/Lemmas.lean
Modified Mathlib/Data/Num/Lemmas.lean
Modified Mathlib/Data/Rat/Cast/CharZero.lean
Modified Mathlib/Data/Seq/Basic.lean
Modified Mathlib/Data/Set/Prod.lean
Modified Mathlib/Data/String/Basic.lean
Modified Mathlib/Data/WSeq/Basic.lean
Modified Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean
Modified Mathlib/Geometry/Euclidean/Triangle.lean
Modified Mathlib/Geometry/Manifold/ContMDiff/Constructions.lean
Modified Mathlib/Geometry/Manifold/MFDeriv/Basic.lean
Modified Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean
Modified Mathlib/GroupTheory/Coxeter/Basic.lean
Modified Mathlib/GroupTheory/FreeGroup/Basic.lean
Modified Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean
Modified Mathlib/GroupTheory/HNNExtension.lean
Modified Mathlib/GroupTheory/Perm/Fin.lean
Modified Mathlib/Init.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean
Modified Mathlib/LinearAlgebra/Contraction.lean
Modified Mathlib/LinearAlgebra/DirectSum/TensorProduct.lean
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean
Modified Mathlib/Logic/Equiv/List.lean
Modified Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean
Modified Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean
Modified Mathlib/MeasureTheory/Measure/HasOuterApproxClosedProd.lean
Modified Mathlib/MeasureTheory/Measure/Typeclasses/Probability.lean
Modified Mathlib/NumberTheory/ArithmeticFunction.lean
Modified Mathlib/NumberTheory/LucasLehmer.lean
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
Modified Mathlib/NumberTheory/Padics/PadicNumbers.lean
Modified Mathlib/NumberTheory/PellMatiyasevic.lean
Modified Mathlib/NumberTheory/PythagoreanTriples.lean
Modified Mathlib/NumberTheory/Zsqrtd/Basic.lean
Modified Mathlib/Order/Compare.lean
Modified Mathlib/Order/Iterate.lean
Modified Mathlib/Order/KrullDimension.lean
Modified Mathlib/Order/OrderIsoNat.lean
Modified Mathlib/Probability/Distributions/Exponential.lean
Modified Mathlib/Probability/Distributions/Fernique.lean
Modified Mathlib/RingTheory/DedekindDomain/PID.lean
Modified Mathlib/RingTheory/Extension/Cotangent/Basic.lean
Modified Mathlib/RingTheory/FiniteType.lean
Modified Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean
Modified Mathlib/RingTheory/HahnSeries/Lex.lean
Modified Mathlib/RingTheory/Idempotents.lean
Modified Mathlib/RingTheory/MvPowerSeries/Substitution.lean
Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Eval.lean
Modified Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean
Modified Mathlib/RingTheory/TensorProduct/IsBaseChangeFree.lean
Modified Mathlib/RingTheory/TensorProduct/IsBaseChangeHom.lean
Modified Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean
Modified Mathlib/RingTheory/WittVector/FrobeniusFractionField.lean
Modified Mathlib/SetTheory/Cardinal/Cofinality.lean
Modified Mathlib/SetTheory/Cardinal/Free.lean
Modified Mathlib/SetTheory/Ordinal/Notation.lean
Modified Mathlib/Tactic/NormNum/Irrational.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/SummationFilter.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/UniformOn.lean
Modified Mathlib/Topology/EMetricSpace/PairReduction.lean
Modified Mathlib/Topology/MetricSpace/PiNat.lean
Modified Mathlib/Topology/Piecewise.lean
Modified Mathlib/Topology/UniformSpace/Ultra/Completion.lean
Modified Mathlib/Topology/UniformSpace/Ultra/Constructions.lean
2025-11-28 11:46:58 7b0ee8f
chore: update Mathlib dependencies 2025-11-28 (#32203)
This PR updates the Mathlib dependencies.
ESTIMATED CHANGES
Modified lake-manifest.json
2025-11-28 11:46:56 d19e769
feat(NumberTheory/ModularForms): adjoin -1 to a subgroup (#30649)
Given a subgroup of GL(2, R), form the subgroup generated by it and `-1`. Using this, define the width of a subgroup.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/ModularForms/ArithmeticSubgroups.lean
+ def Subgroup.adjoinNegOne
+ theorem Subgroup.adjoinNegOne_eq_self_iff
+ theorem Subgroup.commensurable_adjoinNegOne_self
+ theorem Subgroup.hasDetOne_adjoinNegOne_iff
+ theorem Subgroup.hasDetPlusMinusOne_adjoinNegOne_iff
+ theorem Subgroup.le_adjoinNegOne
+ theorem Subgroup.mem_adjoinNegOne_iff
+ theorem Subgroup.negOne_mem_adjoinNegOne
+ theorem Subgroup.relIndex_adjoinNegOne_ne_zero
+ theorem Subgroup.relindex_adjoinNegOne_eq_two
Modified Mathlib/NumberTheory/ModularForms/Cusps.lean
+ theorem Subgroup.IsRegularAtInfty.eq
+ def Subgroup.IsRegularAtInfty
+ theorem Subgroup.commensurable_strictPeriods_periods
+ theorem Subgroup.isRegularAtInfty_iff
+ theorem Subgroup.isRegularAtInfty_of_neg_one_mem
+ theorem Subgroup.periods_eq_zmultiples_widthInfty
+ theorem Subgroup.relIndex_strictPeriods
+ theorem Subgroup.strictPeriods_eq_periods_of_neg_one_mem
+ theorem Subgroup.strictPeriods_le_periods
+ theorem Subgroup.two_mul_withInfty_mem_strictPeriods
+ theorem Subgroup.widthInfty_mem_periods
+ theorem Subgroup.widthInfty_nonneg
+ theorem Subgroup.widthInfty_pos
+ theorem Subgroup.widthInfty_pos_iff
2025-11-28 11:15:56 4eb9bc7
feat(Data/Int/Fib): the Cassini and Catalan identities (#30882)
The [Cassini and Catalan identities](https://en.wikipedia.org/wiki/Cassini_and_Catalan_identities) are identities for the Fibonacci numbers.
* Cassini's identity: `fib (n + 1) * fib (n - 1) - fib n ^ 2 = (-1) ^ |n|` for all integers `n`.
* Catalan's identity: `fib (x + a) ^ 2 - fib (x + 2 * a) * fib x = fib a ^ 2 * (-1) ^ |x|` for all integers `x` and `a`.
Also moved `Data.Int.Fib` to `Data.Int.Fib.Basic`. No deprecation needed since this was only pushed this week.
ESTIMATED CHANGES
Modified Mathlib.lean
Renamed Mathlib/Data/Int/Fib.lean to Mathlib/Data/Int/Fib/Basic.lean
Added Mathlib/Data/Int/Fib/Lemmas.lean
+ theorem Int.fib_natCast_succ_mul_fib_natCast_pred_sub_fib_natCast_sq
Modified Mathlib/Data/Matrix/Basic.lean
2025-11-28 10:54:37 3438e5b
feat(Analysis): generalize `Real.deriv_rpow_const` and prove iteration version (#32196)
We prove that for calculating the derivative of `Real.rpow` it is not necessary to check any conditions, since the junk values align. This makes it easy to calculate the iterated derivative.
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean
+ theorem tendsto_rpow_neg_nhdsGT_zero
Modified Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean
+/- theorem Real.deriv_rpow_const'
+/- theorem Real.deriv_rpow_const
+ theorem Real.iter_deriv_rpow_const
+ theorem Real.not_differentiableAt_rpow_const_zero
Modified Mathlib/Computability/AkraBazzi/AkraBazzi.lean
2025-11-28 10:31:09 eeda320
feat(Bicategory/Modification/Pseudo): define modifications between strong natural transformations of pseudofunctors (#30895)
This PR adds modifications between strong natural transformations of pseudofunctors. At the same time, it improves the existing code on modifications between oplax natural tranformations of oplax functors (by removing some simp lemmas).
This is a migration of #18254 to a fork.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/Bicategory/FunctorBicategory/Oplax.lean
Modified Mathlib/CategoryTheory/Bicategory/Modification/Oplax.lean
+/- def CategoryTheory.Oplax.OplaxTrans.Modification.vcomp
+/- structure CategoryTheory.Oplax.OplaxTrans.Modification
- def CategoryTheory.Oplax.OplaxTrans.ModificationIso.ofComponents
- theorem CategoryTheory.Oplax.OplaxTrans.ext
+ theorem CategoryTheory.Oplax.OplaxTrans.homCategory.ext
+ def CategoryTheory.Oplax.OplaxTrans.isoMk
+ def CategoryTheory.Oplax.StrongTrans.Modification.equivOplax
+ def CategoryTheory.Oplax.StrongTrans.Modification.id
+ def CategoryTheory.Oplax.StrongTrans.Modification.mkOfOplax
+ def CategoryTheory.Oplax.StrongTrans.Modification.toOplax
+ def CategoryTheory.Oplax.StrongTrans.Modification.vcomp
+ theorem CategoryTheory.Oplax.StrongTrans.Modification.whiskerLeft_naturality
+ theorem CategoryTheory.Oplax.StrongTrans.Modification.whiskerRight_naturality
+ structure CategoryTheory.Oplax.StrongTrans.Modification
+ theorem CategoryTheory.Oplax.StrongTrans.homCategory.ext
+ def CategoryTheory.Oplax.StrongTrans.isoMk
Added Mathlib/CategoryTheory/Bicategory/Modification/Pseudo.lean
+ def CategoryTheory.Pseudofunctor.StrongTrans.Modification.equivOplax
+ def CategoryTheory.Pseudofunctor.StrongTrans.Modification.id
+ def CategoryTheory.Pseudofunctor.StrongTrans.Modification.mkOfOplax
+ def CategoryTheory.Pseudofunctor.StrongTrans.Modification.toOplax
+ def CategoryTheory.Pseudofunctor.StrongTrans.Modification.vcomp
+ theorem CategoryTheory.Pseudofunctor.StrongTrans.Modification.whiskerLeft_naturality
+ theorem CategoryTheory.Pseudofunctor.StrongTrans.Modification.whiskerRight_naturality
+ structure CategoryTheory.Pseudofunctor.StrongTrans.Modification
+ theorem CategoryTheory.Pseudofunctor.StrongTrans.homCategory.ext
+ def CategoryTheory.Pseudofunctor.StrongTrans.isoMk
Modified Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Oplax.lean
Modified Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Pseudo.lean
2025-11-28 08:05:25 8505a46
doc: balance parentheses and brackets (#32119)
We fix various unbalanced brackets and parentheses in mathlib docstrings.
The instances were found by way of a script, but the false positive rate was high enough that I don't think it would make for a valuable linter.
Codex wrote the detection script and performed the fixes.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Action/Pointwise/Set/Basic.lean
Modified Mathlib/Algebra/Group/ForwardDiff.lean
Modified Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean
Modified Mathlib/Algebra/Group/Pointwise/Finset/BigOperators.lean
Modified Mathlib/Algebra/Group/Pointwise/Finset/Scalar.lean
Modified Mathlib/Algebra/Group/Pointwise/Set/Basic.lean
Modified Mathlib/Algebra/Group/Pointwise/Set/Scalar.lean
Modified Mathlib/Algebra/Homology/ShortComplex/Exact.lean
Modified Mathlib/AlgebraicTopology/CechNerve.lean
Modified Mathlib/Analysis/Asymptotics/TVS.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Continuity.lean
Modified Mathlib/CategoryTheory/Abelian/Refinements.lean
Modified Mathlib/CategoryTheory/Adjunction/Basic.lean
Modified Mathlib/CategoryTheory/Shift/Opposite.lean
Modified Mathlib/Geometry/Manifold/Instances/Sphere.lean
Modified Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean
Modified Mathlib/MeasureTheory/Function/SimpleFunc.lean
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean
Modified Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean
Modified Mathlib/MeasureTheory/Measure/OpenPos.lean
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Three.lean
Modified Mathlib/Order/LiminfLimsup.lean
Modified Mathlib/Probability/CondVar.lean
Modified Mathlib/RingTheory/MvPolynomial/Groebner.lean
Modified Mathlib/Tactic/Generalize.lean
Modified Mathlib/Tactic/Linter/DeprecatedSyntaxLinter.lean
Modified Mathlib/Tactic/Module.lean
Modified Mathlib/Tactic/Simps/Basic.lean
Modified Mathlib/Topology/Algebra/Group/Basic.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Defs.lean
Modified Mathlib/Topology/Bases.lean
2025-11-28 08:05:23 a46dc89
feat(Geometry/Euclidean/../TriangleInequality): one equality case of the vector triangle inequality (#32100)
This PR proves one equality case of the triangle inequality for angles. It also adds a `proof_wanted` for the bidirectional version.
[#new members > Criterion for equality in the triangle inequality for angles @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Criterion.20for.20equality.20in.20the.20triangle.20inequality.20for.20angles/near/560161005)
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Angle/Unoriented/TriangleInequality.lean
+ theorem InnerProductGeometry.angle_le_angle_add_angle_aux
+ theorem InnerProductGeometry.angle_le_angle_add_angle_of_norm_eq_one
+ theorem InnerProductGeometry.inner_normalize_ortho
+ theorem InnerProductGeometry.inner_normalized_ortho_sq_add_inner_sq_eq_one
+ theorem InnerProductGeometry.inner_ortho_nonneg_of_norm_eq_one
+ theorem InnerProductGeometry.inner_ortho_right_eq_sin_angle
- theorem angle_le_angle_add_angle_aux
- theorem angle_le_angle_add_angle_of_norm_eq_one
- theorem inner_normalize_ortho
- theorem inner_normalized_ortho_sq_add_inner_sq_eq_one
- theorem inner_ortho_nonneg_of_norm_eq_one
- theorem inner_ortho_right_eq_sin_angle
2025-11-28 08:05:21 0b4fac0
feat: fixed points of normal subgroup is stable under the group action (#31511)
The set of fixed points of a normal subgroup is stable under the group action.
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/GroupAction/SubMulAction.lean
+ theorem coe_smul_fixedPoints_of_normal
+ def fixedPointsSubMulOfNormal
+ theorem smul_mem_fixedPoints_of_normal
2025-11-28 08:05:18 a945bbf
feat(Geometry/Euclidean/SignedDist): `signedInfDist_reindex` (#31256)
Add a lemma saying how `Affine.Simplex.signedInfDist` interacts with `Affine.Simplex.reindex`.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/SignedDist.lean
+ theorem Affine.Simplex.signedInfDist_reindex
2025-11-28 08:05:14 71c5ee2
feat(Geometry/Euclidean/Altitude): `reindex` lemmas (#31056)
Add lemmas about `altitude`, `altitudeFoot` and `height` applied to `Simplex.reindex`.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Altitude.lean
+ theorem Affine.Simplex.altitudeFoot_reindex
+ theorem Affine.Simplex.altitude_reindex
+ theorem Affine.Simplex.height_reindex
2025-11-28 08:05:12 e4f6915
chore(CategoryTheory): move `Closed` directory into `Monoidal` (#30771)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/Monoidal.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean
Modified Mathlib/CategoryTheory/Category/Cat/CartesianClosed.lean
Modified Mathlib/CategoryTheory/Distributive/Monoidal.lean
Modified Mathlib/CategoryTheory/Limits/Sifted.lean
Modified Mathlib/CategoryTheory/Monoidal/Braided/Reflection.lean
Renamed Mathlib/CategoryTheory/Closed/Monoidal.lean to Mathlib/CategoryTheory/Monoidal/Closed/Basic.lean
Renamed Mathlib/CategoryTheory/Closed/Cartesian.lean to Mathlib/CategoryTheory/Monoidal/Closed/Cartesian.lean
Renamed Mathlib/CategoryTheory/Closed/Enrichment.lean to Mathlib/CategoryTheory/Monoidal/Closed/Enrichment.lean
Renamed Mathlib/CategoryTheory/Closed/Functor.lean to Mathlib/CategoryTheory/Monoidal/Closed/Functor.lean
Renamed Mathlib/CategoryTheory/Closed/FunctorCategory/Basic.lean to Mathlib/CategoryTheory/Monoidal/Closed/FunctorCategory/Basic.lean
Renamed Mathlib/CategoryTheory/Closed/FunctorCategory/Complete.lean to Mathlib/CategoryTheory/Monoidal/Closed/FunctorCategory/Complete.lean
Renamed Mathlib/CategoryTheory/Closed/FunctorCategory/Groupoid.lean to Mathlib/CategoryTheory/Monoidal/Closed/FunctorCategory/Groupoid.lean
Renamed Mathlib/CategoryTheory/Closed/FunctorToTypes.lean to Mathlib/CategoryTheory/Monoidal/Closed/FunctorToTypes.lean
Renamed Mathlib/CategoryTheory/Closed/Ideal.lean to Mathlib/CategoryTheory/Monoidal/Closed/Ideal.lean
Renamed Mathlib/CategoryTheory/Closed/Types.lean to Mathlib/CategoryTheory/Monoidal/Closed/Types.lean
Renamed Mathlib/CategoryTheory/Closed/Zero.lean to Mathlib/CategoryTheory/Monoidal/Closed/Zero.lean
Modified Mathlib/CategoryTheory/Monoidal/DayConvolution/Closed.lean
Modified Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean
Modified Mathlib/CategoryTheory/Monoidal/Subcategory.lean
Modified Mathlib/CategoryTheory/Preadditive/Projective/Internal.lean
Modified Mathlib/CategoryTheory/Sites/CartesianClosed.lean
Modified Mathlib/CategoryTheory/Sites/Monoidal.lean
Modified Mathlib/Condensed/CartesianClosed.lean
Modified Mathlib/Condensed/Light/CartesianClosed.lean
2025-11-28 07:12:46 6726d3f
refactor: Change `isChain_get_iff*` lemmas (#32062)
Changes `isChain_iff_get` lemmas to make them more usable.
ESTIMATED CHANGES
Modified Archive/Imo/Imo2024Q5.lean
Modified Mathlib/Data/List/Chain.lean
+/- theorem List.isChain_reverse
Modified Mathlib/Data/List/ChainOfFn.lean
Modified Mathlib/Order/RelSeries.lean
2025-11-28 06:58:06 b514609
feat: add `DifferentiableAt.lineDifferentiableAt` (#32183)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/LineDeriv/Basic.lean
+ theorem DifferentiableAt.lineDifferentiableAt
+ theorem DifferentiableWithinAt.lineDifferentiableWithinAt
2025-11-28 06:43:00 0d0a7e4
chore(Analysis/Distribution): proof simplifications (#32197)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Distribution/TemperateGrowth.lean
2025-11-28 00:08:25 963c484
fix: restore `multipliableUniformlyOn_iff_hasProdUniformlyOn` (#32191)
Add back `multipliableUniformlyOn_iff_hasProdUniformlyOn`, which was accidentally removed while resolving a merge conflict in #31313.
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/InfiniteSum/UniformOn.lean
+ theorem multipliableUniformlyOn_iff_hasProdUniformlyOn
2025-11-27 23:09:31 37726fd
fix(Linter/PrivateModule): do not consider reserved names as public (#32140)
As discovered [on zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/PrivateModule.20linter.20not.20firing).
The declarations associated with reserved names are added to the environment lazily, and may therefore be added in downstream files. Further, they may be added to the public scope if their originating modules are `public import`s.
For example, if `foo` is public in `M.Foo`, this causes `foo.eq_1` to be reserved as a name in downstream modules. If `M.Bar` uses `public import M.Foo`, then when the declaration for `foo.eq_1` is realized and added to the environment, it will end up in the public scope. We should still fire the linter in these cases if every non-reserved name is private. Hence, we ignore reserved names in the main loop and do not count them as public declarations from the current module.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/ImplicitContDiff.lean
Modified Mathlib/Tactic/Linter/PrivateModule.lean
Modified Mathlib/Tactic/ToAdditive.lean
Added MathlibTest/PrivateModuleLinter/reservedName1.lean
+ def foo
Added MathlibTest/PrivateModuleLinter/reservedName2.lean
2025-11-27 22:32:55 cf0f1b2
feat(Bicategory/InducedBicategory): add induced bicategories (#30925)
This PR adds a way of inducing a full bicategory structure on given type of objects with a map to the objects of some bicategory (i.e. with all 1-morphisms and all 2-morphisms).
I have not tried to implement "locally induced bicategories" which should allow for a sub-class of 1-morphisms as well. This is because copying the naive approach and replacing the map F as for induced categories with a functor, one runs into issues when the equalities in F.map_comp and F.map_id are not defeq equalities. One could probably define locally full sub-bicategories using a pair of ObjectProperty + MorphismProperty to ensure that the inclusions are actually defeq, but I did not want to get into this.
This is the migration of #25603 to a fork.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Bicategory/InducedBicategory.lean
+ structure CategoryTheory.Bicategory.InducedBicategory.Hom
+ structure CategoryTheory.Bicategory.InducedBicategory.Hom₂
+ theorem CategoryTheory.Bicategory.InducedBicategory.eqToHom_hom
+ def CategoryTheory.Bicategory.InducedBicategory.forget
+ theorem CategoryTheory.Bicategory.InducedBicategory.hom_ext
+ theorem CategoryTheory.Bicategory.InducedBicategory.hom₂_ext
+ def CategoryTheory.Bicategory.InducedBicategory.isoMk
+ theorem CategoryTheory.Bicategory.InducedBicategory.mkHom_eqToHom
+ def CategoryTheory.Bicategory.InducedBicategory
2025-11-27 21:37:43 747865c
chore(Data/Finset): golf entire `mem_finset_image` and `image_erase` using `grind` (#32189)
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/Image.lean
2025-11-27 21:12:46 e183968
feat(Convex/Segment): add `lineMap_mem_openSegment` (#32181)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Segment.lean
+ theorem lineMap_mem_openSegment
2025-11-27 20:24:57 e3df2e6
feat: move set inverse/negative inside binders (#32173)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Pointwise/Set/Basic.lean
+ theorem Set.exists_inv_mem
+ theorem Set.forall_inv_mem
2025-11-27 19:21:49 139686f
feat(Measure/../NoAtoms): add `Measure.ae_ne` (#32182)
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Measure/Typeclasses/NoAtoms.lean
+ theorem MeasureTheory.Measure.ae_ne
2025-11-27 19:21:47 48eb806
feat(MeasureTheory\Group\Action): add μ(c • s ∩ t) = μ(s ∩ c⁻¹ • t) and similar (#32117)
Adding lemmas (and their symmetric version thereof)
`μ(c • s ∩ t) = μ(s ∩ c⁻¹ • t)`
`μ(c • s ∪ t) = μ(s ∪ c⁻¹ • t)`
`μ(c • s ∖ t) = μ(s ∖ c⁻¹ • t)`
`μ(c • s Δ t) = μ(s Δ c⁻¹ • t)`
for μ a `SMulInvariantMeasure`.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Group/Action.lean
+ theorem MeasureTheory.measure_inter_inv_smul
+ theorem MeasureTheory.measure_inv_smul_inter
+ theorem MeasureTheory.measure_inv_smul_sdiff
+ theorem MeasureTheory.measure_inv_smul_symmDiff
+ theorem MeasureTheory.measure_inv_smul_union
+ theorem MeasureTheory.measure_sdiff_inv_smul
+ theorem MeasureTheory.measure_symmDiff_inv_smul
+ theorem MeasureTheory.measure_union_inv_smul
2025-11-27 19:21:46 3486100
fix: reduce the amount of coercion instances that are always tried (#31168)
Previously, there were a couple of coercion instances that are rarely used but still always tried (e.g. from `SignType`). This PR replaces those with `CoeDep` instances. Note: `CoeDep` is used here even though the coercions are non-dependent because it is similar to `CoeHTCT` but is meant to be used from the user side in contrast to `CoeHTCT`, which is an implementation detail.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Matrix.20multiplication.20notation.20failed/with/548327898
ESTIMATED CHANGES
Modified Mathlib/Data/Sign/Defs.lean
2025-11-27 18:23:02 98a6772
chore(Data/Sum): golf `Data.Sum.Basic` using `grind` (#32141)
ESTIMATED CHANGES
Modified Mathlib/Data/Sum/Basic.lean
2025-11-27 18:09:41 4e32118
feat: order instances on quotients (#29735)
We define a `Preorder (Quotient s)` instance in the natural way, and prove that it can be strengthened to a `LinearOrder` when all equivalence classes are `OrdConnected`.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Order/Quotient.lean
+ theorem Quotient.le_def
+ theorem Quotient.lift_monotone
+ theorem Quotient.lt_of_mk_lt_mk
+ theorem Quotient.mk_le_mk
+ theorem Quotient.mk_lt_mk
+ theorem Quotient.mk_monotone
2025-11-27 17:00:35 4b2f10c
chore: golf using the combination `ext` and `grind`. add `grind` annotations (#31307)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Coeff.lean
Modified Mathlib/Algebra/Polynomial/Reverse.lean
Modified Mathlib/Combinatorics/Enumerative/Partition/Basic.lean
Modified Mathlib/Combinatorics/Enumerative/Partition/GenFun.lean
Modified Mathlib/Data/DFinsupp/Defs.lean
Modified Mathlib/Data/Finset/Pi.lean
Modified Mathlib/Data/PFun.lean
Modified Mathlib/Data/Part.lean
Modified Mathlib/Order/Interval/Finset/Basic.lean
Modified Mathlib/Order/Interval/Finset/Defs.lean
Modified Mathlib/Topology/EMetricSpace/BoundedVariation.lean
2025-11-27 17:00:33 4e83287
feat(Combinatorics/SimpleGraph): add lemma `IsTree.dist_ne_of_adj` and necessary lemmas (#30069)
This contribution was created as part of the Utrecht Summerschool "Formalizing Mathematics in Lean" in July 2025.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
+ theorem SimpleGraph.IsAcyclic.mem_support_of_ne_mem_support_of_adj_of_isPath
+ theorem SimpleGraph.IsAcyclic.ne_mem_support_of_support_of_adj_of_isPath
+ theorem SimpleGraph.IsAcyclic.path_concat
+ theorem SimpleGraph.IsTree.dist_ne_of_adj
2025-11-27 16:44:54 62a39c1
feat(Geometry/Euclidean/Triangle): greatest / least angles in a triangle (#32006)
Add lemmas that the greatest angle in a (possibly degenerate) triangle is at least π / 3, and the least is at most π / 3, along with versions with strict inequality if the angles aren't all equal.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Triangle.lean
+ theorem EuclideanGeometry.angle_le_pi_div_three_of_le_of_le
+ theorem EuclideanGeometry.angle_lt_pi_div_three_of_le_of_le_of_ne
+ theorem EuclideanGeometry.pi_div_three_le_angle_of_le_of_le
+ theorem EuclideanGeometry.pi_div_three_lt_angle_of_le_of_le_of_ne
2025-11-27 16:44:52 c40b7e5
feat(NumberTheory/Real/GoldenRatio): add two more fib identities (#31401)
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/Real/GoldenRatio.lean
+ theorem Real.fib_succ_sub_goldenConj_mul_fib
+ theorem Real.goldenConj_mul_fib_succ_add_fib
2025-11-27 16:44:50 2e1927f
feat(Data/Nat/Choose/Multinomial): add multinomial_eq_of_support_subset (#30976)
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Choose/Multinomial.lean
+ theorem Finsupp.multinomial_eq_of_support_subset
2025-11-27 16:30:59 2b4fa09
feat: generalize `Finsupp.lex_lt_iff_of_unique` (#30973)
ESTIMATED CHANGES
Modified Mathlib/Data/DFinsupp/Lex.lean
+ theorem DFinsupp.lex_iff_of_unique
+ theorem DFinsupp.lex_le_iff_of_unique
+ theorem DFinsupp.lex_lt_iff_of_unique
Modified Mathlib/Data/Finsupp/Lex.lean
+ theorem Finsupp.lex_iff_of_unique
+/- theorem Finsupp.lex_le_iff_of_unique
+/- theorem Finsupp.lex_lt_iff_of_unique
Modified Mathlib/Order/PiLex.lean
+ theorem Pi.colex_le_iff_of_unique
+ theorem Pi.colex_lt_iff_of_unique
+ theorem Pi.lex_iff_of_unique
+ theorem Pi.lex_le_iff_of_unique
+ theorem Pi.lex_lt_iff_of_unique
2025-11-27 16:30:57 d855d70
feat: `PadicInt` is isomorphic to the integers of the uniform space completion `(Rat.padicValuation p).Completion` (#30363)
- Uniform and ring isomorphisms between `𝒪[(Rat.padicValuation p).Completion]` and `ℤ_[p]`
- A homeomorphism `e : X ≃ Y` gives a closed set `{ x : X | p x ↔ q (e x) }` for clopen subsets given by `p` and `q`
- Move `Padic.isUnit_den` to an earlier file to avoid having to import `Padics.RingHoms` unnecessarily
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/Padics/PadicIntegers.lean
+ theorem PadicInt.isUnit_den
Modified Mathlib/NumberTheory/Padics/RingHoms.lean
- theorem PadicInt.isUnit_den
Modified Mathlib/NumberTheory/Padics/WithVal.lean
+ theorem Padic.norm_rat_le_one_iff_padicValuation_le_one
+ theorem Padic.withValUniformEquiv_cast_apply
+ theorem Padic.withValUniformEquiv_norm_le_one_iff
Modified Mathlib/Topology/Homeomorph/Defs.lean
+ theorem Homeomorph.isClosed_setOf_iff
2025-11-27 16:17:09 633ee94
feat(Analysis/Distribution/ContDiffMapSupportedIn): add withSeminorms statement (#30236)
Add `withSeminorms` instance to `ContDiffMapSupportedIn`, where the seminorm familiy is given by the sup-norm on the i-th derivative.
Co-authored by: @ADedecker
ESTIMATED CHANGES
Modified Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean
+ theorem ContDiffMapSupportedIn.norm_apply_le_seminorm
+ theorem ContDiffMapSupportedIn.norm_iteratedFDeriv_apply_le_seminorm
+ theorem ContDiffMapSupportedIn.norm_iteratedFDeriv_apply_le_seminorm_withOrder
+ theorem ContDiffMapSupportedIn.norm_toBoundedContinuousFunction
+ theorem ContDiffMapSupportedIn.toBoundedContinuousFunctionCLM_apply
+ theorem ContDiffMapSupportedIn.toBoundedContinuousFunctionCLM_eq_of_scalars
+ theorem ContDiffMapSupportedIn.toBoundedContinuousFunctionLM_apply
2025-11-27 14:44:54 bc044be
chore: add deprecations from #30242 (#32172)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean
2025-11-27 14:13:05 eaef552
feat(Data/Nat/PrimeFin): add API for Nat.primeFactors (#32145)
We add three API lemmas for `Nat.primeFactors` (in the namespace `Nat.Prime`, to allow for dot notation).
See the discussion on Zulip at [#PR reviews > #30273 (already merged) @ 💬](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2330273.20.28already.20merged.29/near/560237631).
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/PrimeFin.lean
+ theorem Nat.Prime.mem_primeFactors'
+ theorem Nat.Prime.mem_primeFactors
+ theorem Nat.Prime.mem_primeFactors_self
2025-11-27 13:47:20 9ea0d96
feat(RingTheory): `IsStandardEtale` (#32138)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Bivariate.lean
- theorem Polynomial.Bivariate.Polynomial.Bivariate.pderiv_one_equivMvPolynomial
- theorem Polynomial.Bivariate.Polynomial.Bivariate.pderiv_zero_equivMvPolynomial
+ theorem Polynomial.Bivariate.pderiv_one_equivMvPolynomial
+ theorem Polynomial.Bivariate.pderiv_zero_equivMvPolynomial
Modified Mathlib/RingTheory/Etale/Basic.lean
- theorem Algebra.FormallyEtale.Algebra.FormallyEtale.iff_of_surjective
- theorem Algebra.FormallyEtale.Algebra.FormallyEtale.of_restrictScalars
+ theorem Algebra.FormallyEtale.iff_of_surjective
+ theorem Algebra.FormallyEtale.of_restrictScalars
Modified Mathlib/RingTheory/Etale/StandardEtale.lean
+ theorem Algebra.IsStandardEtale.of_equiv
+ theorem Algebra.IsStandardEtale.of_isLocalizationAway
+ theorem Algebra.IsStandardEtale.of_surjective
+ theorem StandardEtalePresentation.aeval_val_equivMvPolynomial
+ def StandardEtalePresentation.equivRing
+ theorem StandardEtalePresentation.equivRing_symm_X
+ theorem StandardEtalePresentation.equivRing_x
+ theorem StandardEtalePresentation.exists_mul_aeval_x_g_pow_eq_aeval_x
+ def StandardEtalePresentation.mapEquiv
+ def StandardEtalePresentation.toPresentation
+ def StandardEtalePresentation.toSubmersivePresentation
+ theorem StandardEtalePresentation.toSubmersivePresentation_jacobian
+ structure StandardEtalePresentation
Modified Mathlib/RingTheory/Extension/Generators.lean
+ theorem Algebra.Generators.ker_ofAlgHom
2025-11-27 13:47:18 4e93559
feat(CyclotomicField): splitting of the prime `p` in `ℚ⟮ζₘ⟯` when `p` does not divide `m` (#31946)
This PR proves that when the prime `p` does not divide `m`, it splits completely in the cyclotomic field `ℚ(ζₘ)`.
Also change `liesOver_span_zeta_sub_one` from a theorem to an instance for better typeclass inference
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/Basic.lean
+ theorem NumberField.RingOfIntegers.minpoly_coe
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Ideal.lean
+ theorem IsCyclotomicExtension.Rat.inertiaDegIn_of_not_dvd
+ theorem IsCyclotomicExtension.Rat.inertiaDeg_of_not_dvd
- theorem IsCyclotomicExtension.Rat.liesOver_span_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.ramificationIdxIn_of_not_dvd
+ theorem IsCyclotomicExtension.Rat.ramificationIdx_of_not_dvd
2025-11-27 13:47:15 f32d859
feat(CategoryTheory): add predicate `IsRepresentedBy` (#31337)
We define the predicate `IsRepresentedBy`: A functor `F` is represented by `X`
with universal element `x : F.obj X` if the natural transformation `yoneda.obj X ⟶ F` induced
by `x` is an isomorphism. We also relate this to the other existing ways of expressing a functor is representable.
This is part of a series towards expressing a certain morphism is an analytification morphism, which will be defined in terms of `IsRepresentedBy`.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/RepresentedBy.lean
+ theorem CategoryTheory.Functor.IsRepresentable.iff_exists_isRepresentedBy
+ theorem CategoryTheory.Functor.IsRepresentedBy.iff_exists_representableBy
+ theorem CategoryTheory.Functor.IsRepresentedBy.iff_isIso_uliftYonedaEquiv
+ theorem CategoryTheory.Functor.IsRepresentedBy.iff_natIso
+ theorem CategoryTheory.Functor.IsRepresentedBy.iff_of_isoObj
+ theorem CategoryTheory.Functor.IsRepresentedBy.of_isRepresentable
+ theorem CategoryTheory.Functor.IsRepresentedBy.of_isoObj
+ theorem CategoryTheory.Functor.IsRepresentedBy.of_natIso
+ theorem CategoryTheory.Functor.IsRepresentedBy.representableBy_homEquiv_apply
+ structure CategoryTheory.Functor.IsRepresentedBy
+ theorem CategoryTheory.Functor.RepresentableBy.isRepresentedBy
Modified Mathlib/CategoryTheory/Yoneda.lean
+ def CategoryTheory.Functor.CorepresentableBy.equivOfIsoObj
+ def CategoryTheory.Functor.CorepresentableBy.equivUliftCoyonedaIso
+ def CategoryTheory.Functor.CorepresentableBy.ofIsoObj
+ def CategoryTheory.Functor.RepresentableBy.equivOfIsoObj
+ def CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso
+ def CategoryTheory.Functor.RepresentableBy.ofIsoObj
+ def CategoryTheory.Functor.corepresentableByUliftFunctorEquiv
+ theorem CategoryTheory.Functor.isCorepresentable_comp_uliftFunctor_iff
+ theorem CategoryTheory.Functor.isRepresentable_comp_uliftFunctor_iff
+ def CategoryTheory.Functor.representableByUliftFunctorEquiv
2025-11-27 13:06:23 8c00a0d
feat: `RingEquiv.restrict` (#31846)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/Subring/Basic.lean
+ def RingEquiv.restrict
2025-11-27 13:06:22 ba9cbd6
feat(LinearAlgebra/AffineSpace/Simplex/Basic): faces and `reindex` (#31054)
Add lemmas about the set of vertices of a `face` or `faceOpposite` of `Simplex.reindex`.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean
+ theorem Affine.Simplex.range_faceOpposite_reindex
+ theorem Affine.Simplex.range_face_reindex
2025-11-27 12:51:52 93fc5cb
feat(Analysis/Distribution): natural powers of temperate functions (#32166)
We prove that the natural powers of a temperate growth function is of temperate growth.
We also remove some unnecessary namespace indicators, this does not change the theorem names.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Distribution/TemperateGrowth.lean
+/- theorem Function.HasTemperateGrowth.id'
+/- theorem Function.HasTemperateGrowth.id
+/- theorem Function.HasTemperateGrowth.mul
+ theorem Function.HasTemperateGrowth.pow
+/- theorem Function.HasTemperateGrowth.smul
2025-11-27 12:30:39 a30baca
feat: bounded Lp norm of limit if converge in measure (#31882)
We prove that if the `eLpNorm` of a collection of `AEStronglyMeasurable` functions that converges in measure
is bounded by some constant `C`, then the `eLpNorm` of its limit is also bounded by `C`.
We also weaken some assumptions in proofs of other theorems.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean
+ theorem MeasureTheory.eLpNorm_le_of_tendstoInMeasure
+/- theorem MeasureTheory.tendstoInMeasure_iff_enorm
+/- theorem MeasureTheory.tendstoInMeasure_iff_measureReal_enorm
+/- theorem MeasureTheory.tendstoInMeasure_iff_measureReal_norm
+/- theorem MeasureTheory.tendstoInMeasure_iff_norm
+/- theorem MeasureTheory.tendstoInMeasure_of_tendsto_eLpNorm_top
Modified Mathlib/MeasureTheory/Function/LpSpace/Complete.lean
+ theorem MeasureTheory.Lp.eLpNorm_le_of_ae_tendsto
2025-11-27 11:47:40 5b3c429
feat(Algebra/Algebra/Basic): add RingHom.commSemiringToCommRing (#30974)
Co-authored by: @AntoineChambert-Loir
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Basic.lean
2025-11-27 10:43:10 9819a5b
feat(Algebra/Homology): cohomology of HomComplex (#32091)
Given `ℤ`-indexed cochain complexes `K` and `L`, and `n : ℤ`, we introduce a type `HomComplex.CohomologyClass K L n` which is the quotient of `HomComplex.Cocycle K L n` which identifies cohomologous cocycles.
We construct this type of cohomology classes instead of using the homology API because `Cochain K L` can be considered both as a complex of abelian groups or as a complex of `R`-modules when the category is `R`-linear. This also complements the API around `HomComplex` which is centered on terms in types `Cochain` or `Cocycle` which are suitable for computations.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean
+ def CochainComplex.HomComplex.Cocycle.isKernel
+ def CochainComplex.HomComplex.Cocycle.toCochainAddMonoidHom
Added Mathlib/Algebra/Homology/HomotopyCategory/HomComplexCohomology.lean
+ def CochainComplex.HomComplex.CohomologyClass.descAddMonoidHom
+ theorem CochainComplex.HomComplex.CohomologyClass.descAddMonoidHom_cohomologyClass
+ def CochainComplex.HomComplex.CohomologyClass.mk
+ def CochainComplex.HomComplex.CohomologyClass.mkAddMonoidHom
+ theorem CochainComplex.HomComplex.CohomologyClass.mk_add
+ theorem CochainComplex.HomComplex.CohomologyClass.mk_eq_zero_iff
+ theorem CochainComplex.HomComplex.CohomologyClass.mk_neg
+ theorem CochainComplex.HomComplex.CohomologyClass.mk_sub
+ theorem CochainComplex.HomComplex.CohomologyClass.mk_surjective
+ theorem CochainComplex.HomComplex.CohomologyClass.mk_zero
+ def CochainComplex.HomComplex.CohomologyClass
+ def CochainComplex.HomComplex.coboundaries
+ def CochainComplex.HomComplex.leftHomologyData'
2025-11-27 10:43:07 1ad1c36
feat(CategoryTheory/Sites): cover of pullback from cover of left or right component (#31336)
To construct this, we also add a typeclass `Precoverage.RespectsIso` that asserts that a pre-`0`-hypercover being covering for a precoverage `J` implies being covering for every isomorphic pre-`0`-hypercover.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
+ theorem CategoryTheory.PreZeroHypercover.inv_hom_h₀_comp_f
+ theorem CategoryTheory.PreZeroHypercover.inv_inv_h₀_comp_f
+ theorem CategoryTheory.PreZeroHypercover.presieve₀_mem_iff_of_iso
+ theorem CategoryTheory.PreZeroHypercover.presieve₀_mem_of_iso
+ def CategoryTheory.PreZeroHypercover.pullbackCoverOfLeftIsoPullback₁
+ def CategoryTheory.PreZeroHypercover.pullbackCoverOfRightIsoPullback₂
+ theorem CategoryTheory.Precoverage.RespectsIso.of_forall_exists_iso
+ theorem CategoryTheory.Precoverage.ZeroHypercover.presieve₀_mem_of_iso
Modified Mathlib/CategoryTheory/Sites/Sieves.lean
+ theorem CategoryTheory.Presieve.ofArrows_comp_eq_of_surjective
+ theorem CategoryTheory.Presieve.ofArrows_comp_le
2025-11-27 10:43:05 e716b7c
feat: add piCongrSigmaFiber and piCongrFiberwise equivalences (#29706)
## Summary
Add two new equivalence functions for working with fibers and sigma types:
- `Equiv.piCongrSigmaFiber`: transforms between functions on sigma fibers and regular pi types
- `Equiv.piCongrFiberwise`: lifts fiber-wise equivalences to product equivalences
These functions are from the FLT (Fermat's Last Theorem) project and are useful for manipulating dependent function types indexed by fibers of a function.
## Details
The new definitions allow for elegant transformations between:
1. Functions defined on sigma types representing fibers of a function
2. Regular dependent functions
These are particularly useful in algebraic contexts where one needs to work with products indexed by fibers.
## Context
This PR was prepared by Claude (Claude Code) based on the following prompt:
> "Please read FLT/Mathlib/Logic/Equiv/Basic.lean, and also the corresponding file in the Mathlib repository. Please prepare a PR to Mathlib containing this content, putting it at an appropriate point in the corresponding Mathlib file. Make sure the PR is label FLT, and write in the PR comment an explanation that the PR was prepared by Claude, including quoting the prompting."
The content is sourced from `/Users/kim/projects/lean/FLT/FLT/Mathlib/Logic/Equiv/Basic.lean` in the FLT project repository.
🤖 Generated with [Claude Code](https://claude.ai/code)
ESTIMATED CHANGES
Modified Mathlib/Logic/Equiv/Basic.lean
+ def Equiv.piCongrFiberwise
+ theorem Equiv.piCongrFiberwise_apply
+ theorem Equiv.piCongrFiberwise_symm_apply
+ def Equiv.piCongrSigmaFiber
+ theorem Equiv.piCongrSigmaFiber_apply
+ theorem Equiv.piCongrSigmaFiber_symm_apply
2025-11-27 10:43:03 03cc451
feat(SimpleGraph): helper lemmas for `Walk.IsSubwalk` (#29376)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Walks/Subwalks.lean
+ theorem SimpleGraph.Walk.IsSubwalk.darts_isInfix
+ theorem SimpleGraph.Walk.IsSubwalk.darts_subset
+ theorem SimpleGraph.Walk.IsSubwalk.edges_isInfix
+ theorem SimpleGraph.Walk.IsSubwalk.edges_subset
+ theorem SimpleGraph.Walk.IsSubwalk.support_subset
2025-11-27 09:46:46 f157c2c
feat: add Kernel.restrict_const (#32167)
This PR adds a simple lemma Kernel.restrict_const showing that the restriction of a constant kernel to a measurable set s commutes with the restriction of the underlying measure.
Specifically, it proves:
(Kernel.const α μ).restrict hs = Kernel.const α (μ.restrict s)
ESTIMATED CHANGES
Modified Mathlib/Probability/Kernel/Basic.lean
+ theorem ProbabilityTheory.Kernel.restrict_const
2025-11-27 09:46:45 a0d8a53
chore: add missing deprecation `logMahlerMeasure_mul_eq_add_logMahelerMeasure` (#32148)
From #30548.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Polynomial/MahlerMeasure.lean
2025-11-27 09:46:43 d7c53e9
feat: add centralMoment_congr_ae lemma (#31985)
Add `centralMoment_congr_ae` lemma showing that central moments are equal for almost-everywhere equal random variables.
This is useful for working with random variables that are only defined up to a.e. equality.
Contributed by sequential-intelligence-lab(SIL), University of Virginia
ESTIMATED CHANGES
Modified Mathlib/Probability/Moments/Basic.lean
+ theorem ProbabilityTheory.centralMoment_congr_ae
2025-11-27 09:46:41 a3c69a1
feat(Data/Nat): reducible strong recursion (#30181)
+ Redefine `Nat.strongRec'` to allow Lean kernel computation (reduction) with the strong Nat recursor. TODO: maybe merge this with Batteries' `Nat.strongRec`.
+ Redefine `Nat.xgcd` to use `Nat.strongRec'` to allow kernel reduction.
ESTIMATED CHANGES
Modified Mathlib/Data/Int/GCD.lean
+/- theorem Nat.gcdA_zero_left
+/- theorem Nat.gcdB_zero_left
+/- def Nat.xgcdAux
+/- theorem Nat.xgcd_zero_left
Modified Mathlib/Data/Nat/Init.lean
+ theorem Nat.strongRec'_spec
+/- def Nat.strongRecOn'
2025-11-27 08:57:55 b76a60f
feat(AlgebraicTopology): multicoequalizers and pushouts of simplicial sets (#31797)
Let `X` be a simplicial set. In this PR, we show that a bicartesian square in the lattice of subcomplexes of `X` gives a pushout in the category `SSet`, and "multicoequalizer diagrams" in this lattice also allow to express certain subcomplexes as the multicoequalizers in the category of simplicial sets.
From https://github.com/joelriou/topcat-model-category
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/Subcomplex.lean
- def SSet.Subcomplex.eqToIso
Added Mathlib/AlgebraicTopology/SimplicialSet/SubcomplexColimits.lean
+ theorem SSet.Subcomplex.BicartSq.isPushout
Modified Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean
Modified Mathlib/CategoryTheory/Limits/Types/Multicoequalizer.lean
+ theorem CategoryTheory.Limits.Types.isPushout_of_bicartSq
Modified Mathlib/Order/CompleteLattice/MulticoequalizerDiagram.lean
2025-11-27 08:57:52 616b0cf
feat(Order): helper lemmas for `IsChain`/`IsAntichain` (#30003)
These were useful in formalizing Dilworth's theorem.
ESTIMATED CHANGES
Modified Mathlib/Order/Antichain.lean
+ theorem isAntichain_coe_univ_iff
+ theorem isAntichain_preimage_subtypeVal
Modified Mathlib/Order/Preorder/Chain.lean
+ theorem isChain_coe_univ_iff
+ theorem isChain_preimage_subtypeVal
2025-11-27 08:19:38 697c2c8
feat(Analysis/Convex/Between): `InjOn` lemmas (#32164)
Add lemmas `Set.InjOn.wbtw_map_iff` and `Set.InjOn.sbtw_map_iff`, analogous to those already present for `Function.Injective`. For use together with #32161 in #31205.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Between.lean
+ theorem Set.InjOn.sbtw_map_iff
+ theorem Set.InjOn.wbtw_map_iff
+ theorem affineSegment_subset_affineSpan
2025-11-27 08:19:36 3f65178
feat(LinearAlgebra/AffineSpace/Basis): spaces of coordinates (#32161)
Define `fintypeAffineCoords`, the `AffineSubspace` of `ι → k` (for `Fintype ι`) where coordinates sum to `1`, and the analogous `finsuppAffineCoords` for a general `ι`. The `Finsupp` case was recently discussed in #30854 and is the subject of a TODO (not addressed) in this file. The `Fintype` case is intended for use in #31205 to refactor a proof based on review there.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/Basis.lean
+ theorem AffineIndependent.injOn_affineCombination_fintypeAffineCoords
+ def finsuppAffineCoords
+ def fintypeAffineCoords
+ theorem mem_finsuppAffineCoords_iff_linearCombination
+ theorem mem_fintypeAffineCoords_iff_sum
2025-11-27 08:19:34 57005bf
feat(LinearAlgebra/AffineSpace/Simplex/Basic): `affineCombination_mem_affineSpan_faceOpposite_iff` (#32150)
Add a convenience lemma that reflects common patterns appearing in #31205 and pointed out in review of that PR.
```lean
lemma affineCombination_mem_affineSpan_faceOpposite_iff {n : ℕ} [NeZero n] {s : Simplex k P n}
{w : Fin (n + 1) → k} (hw : ∑ i, w i = 1) {i : Fin (n + 1)} :
Finset.univ.affineCombination k s.points w ∈
affineSpan k (Set.range (s.faceOpposite i).points) ↔ w i = 0 := by
```
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean
+ theorem Affine.Simplex.affineCombination_mem_affineSpan_faceOpposite_iff
2025-11-27 08:19:33 c1b2e4a
feat(CategoryTheory/Triangulated): right orthogonal and localization (#31843)
In this PR, we show that if `P` is a triangulated subcategory of a triangulated category `C`, if `L : C ⥤ D` is the localization functor to the Verdier quotient by `P`, and `Y : C` belongs to the right orthogonal of `P`, then morphisms `X ⟶ Y` identify to morphisms `L.obj X ⟶ L.obj Y`.
(In the case of the localization functor from the category of complexes to the derived category of an abelian category, this will allow the computation of morphisms to a K-injective complex in the derived category as homotopy classes of morphisms.)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Triangulated/Orthogonal.lean
+ theorem CategoryTheory.ObjectProperty.isLocal_trW
+ theorem CategoryTheory.ObjectProperty.rightOrthogonal.map_bijective_of_isTriangulated
2025-11-27 08:19:31 34bdc72
feat(CategoryTheory): DiagramWithUniqueTerminal (#31426)
This PR sets up the type `DiagramWithUniqueTerminal` of diagrams of bounded cardinality with a unique terminal object in a filtered category. This shall be used in #30605 in order to show that for any filtered category, there is a final functor from a directed poset.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Presentable/Directed.lean
+ theorem CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram.IsTerminal.lift_self
+ theorem CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram.IsTerminal.prop
+ structure CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram.IsTerminal
+ def CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram.iSup
+ def CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram.single
+ def CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram.sup
+ structure CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.Diagram
+ theorem CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.DiagramWithUniqueTerminal.ext
+ structure CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.DiagramWithUniqueTerminal
+ def CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functor
+ def CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap
+ theorem CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap_comp
+ theorem CategoryTheory.IsCardinalFiltered.exists_cardinal_directed.functorMap_id
2025-11-27 08:19:29 eee0187
chore: remove obsolete NormDigits namespace (#30248)
In Lean 3, `nat.digits m n` with concrete numbers `m` `n` could be normalized via `norm_num`. [The logic enabling that](https://github.com/leanprover-community/mathlib3/blob/65a1391a0106c9204fe45bc73a039f056558cb83/src/data/nat/digits.lean#L599-L678) was partially ported over to Lean 4 in the `NormDigits` namespace, but never was completed.
Independently, simprocs as introduced in Lean v4.6.0 made it so that `simp [Nat.digits, Nat.digitsAux]` could normalize `Nat.digits m n` without any need for the special `NormDigits` code. More recently, #25864 made it so that just plain `rfl` can normalize `Nat.digits m n` (but note that a revert PR has been proposed in #30246).
Therefore, the `NormDigits` namespace is no longer relevent and should be deleted.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Digits/Defs.lean
- theorem Nat.NormDigits.digits_one
- theorem Nat.NormDigits.digits_succ
2025-11-27 08:19:27 6148916
feat(FieldTheory/IsGaloisGroup): prove the Galois correspondence for `IsGaloisGroup` (#29688)
This PR reproves the Galois correspondence for `IsGaloisGroup`.
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/Galois/IsGaloisGroup.lean
+ theorem IsGaloisGroup.card_fixingSubgroup_eq_finrank
+ theorem IsGaloisGroup.finrank_fixedPoints_eq_card_subgroup
+ theorem IsGaloisGroup.fixedPoints_bot
+ theorem IsGaloisGroup.fixedPoints_fixingSubgroup
+ theorem IsGaloisGroup.fixedPoints_le_of_le
+ theorem IsGaloisGroup.fixedPoints_top
+ theorem IsGaloisGroup.fixingSubgroup_bot
+ theorem IsGaloisGroup.fixingSubgroup_fixedPoints
+ theorem IsGaloisGroup.fixingSubgroup_le_of_le
+ theorem IsGaloisGroup.fixingSubgroup_top
+ theorem IsGaloisGroup.intermediateFieldEquivSubgroup_apply
+ theorem IsGaloisGroup.intermediateFieldEquivSubgroup_symm_apply
+ theorem IsGaloisGroup.intermediateFieldEquivSubgroup_symm_apply_toDual
+ theorem IsGaloisGroup.le_fixedPoints_iff_le_fixingSubgroup
+ theorem IsGaloisGroup.map_mulEquivAlgEquiv_fixingSubgroup
+ theorem IsGaloisGroup.ofDual_intermediateFieldEquivSubgroup_apply
+ theorem IsGaloisGroup.of_mulEquiv_algEquiv
2025-11-27 08:19:25 c6867ad
feat: ring-theoretic fractions in Rat (#28399)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/RingTheory/Localization/NumDen.lean
+ theorem IsFractionRing.num_den_unique
Added Mathlib/RingTheory/Localization/Rat.lean
+ theorem Rat.associated_num_den
+ theorem Rat.isFractionRingDen
+ theorem Rat.isFractionRingNum
+ theorem Rat.isLocalizationIsInteger_iff
2025-11-27 08:19:23 4c04a1d
feat(Data/Finsupp/Basic): Finsupp.optionElim (#25920)
Similar to how `Finsupp.cons` constructs a map `Fin (n + 1) →₀ M` from a map `Fin n →₀ M`,
we define `Finsupp.optionElim'` to construct a map `Option α →₀ M` from a map `α →₀ M`, given an additional value for `none`. We base this on the new `optionEquiv` definition. As a function, it behaves as `Option.elim'`, hence the name.
We prove a variety of API lemmas, based on those for `Finsupp.cons`, to bring the definitions more in line with the contents of Data/Finsupp/Fin.
Original PR: https://github.com/leanprover-community/mathlib4/pull/13861
- [x] depends on: #26309
ESTIMATED CHANGES
Modified Mathlib/Data/Finsupp/Option.lean
+/- theorem Finsupp.embDomain_some_none
+/- theorem Finsupp.embDomain_some_some
+/- theorem Finsupp.eq_option_embedding_update_none_iff
+ def Finsupp.optionElim
+ theorem Finsupp.optionElim_apply_eq_elim
+ theorem Finsupp.optionElim_apply_none
+ theorem Finsupp.optionElim_apply_some
+ theorem Finsupp.optionElim_eq_elim'
+ theorem Finsupp.optionElim_ne_zero_iff
+ theorem Finsupp.optionElim_ne_zero_of_left
+ theorem Finsupp.optionElim_ne_zero_of_right
+ theorem Finsupp.optionElim_some
+ theorem Finsupp.optionElim_zero
+/- def Finsupp.some
+/- theorem Finsupp.some_apply
+/- theorem Finsupp.some_embDomain_some
+ theorem Finsupp.some_optionElim
+/- theorem Finsupp.some_single_none
+/- theorem Finsupp.some_single_some
+/- theorem Finsupp.some_update_none
+/- theorem Finsupp.some_zero
2025-11-27 07:13:13 9a1cf4a
feat: more lemmas on `Concept` (#29995)
These are used in the [`combinatorial-games`](https://github.com/vihdzp/combinatorial-games) repository.
ESTIMATED CHANGES
Modified Mathlib/Order/Concept.lean
+ theorem Concept.compl_extent
+ theorem Concept.compl_intent
+ def Concept.copy
+ theorem Concept.copy_eq
+ theorem Concept.isCompl_extent_intent
2025-11-27 04:08:03 516dddc
feat(CategoryTheory/Presentable): transport via an equivalence (#30731)
If `e : C ≌ D` is an equivalence of categories and `C` is locally presentable (resp. accessible), then so is `D`.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Presentable/Adjunction.lean
+ theorem CategoryTheory.Equivalence.hasCardinalFilteredGenerator
+ theorem CategoryTheory.Equivalence.isAccessibleCategory
+ theorem CategoryTheory.Equivalence.isCardinalAccessibleCategory
+ theorem CategoryTheory.Equivalence.isCardinalLocallyPresentable
+ theorem CategoryTheory.Equivalence.isLocallyPresentable
2025-11-27 01:03:27 49c9359
feat(SpecialFunctions/Log): tight bounds on artanh(x) (#31487)
We provide tight bounds, thanks to Taylor series, on `1/2 (log ((1+x)/(1-x)))`. It is more convenient, however, to avoid Taylor series in the proof, since the geometric sum formula can be used to more easily calculate the difference.
From the [exponential-ramsey project](https://github.com/b-mehta/exponential-ramsey/blob/main/src/log_small.lean), and used to give [very tight estimates on logs (Zulip)](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/A.20million.20digits.20of.20log.202/with/554793210).
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean
+ theorem Real.hasDerivAt_half_log_one_add_div_one_sub_sub_sum_range
+ theorem Real.log_div_le_sum_range_add
+ theorem Real.sum_range_le_log_div
+ theorem Real.sum_range_sub_log_div_le
2025-11-26 23:22:18 6a9728e
chore(CyclotomicField): add missing deprecated aliases for #30010 (#32149)
These results were removed since they were not needed anymore but I forgot to add the deprecated aliases.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
2025-11-26 22:53:27 072b486
chore: fix more unused decidable instances in types (#32153)
Found by #31747. After this, we should be able to turn on the unused decidable in type linter by default.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
+/- theorem SimpleGraph.IsAcyclic.isPath_iff_isChain
+/- theorem SimpleGraph.IsAcyclic.isPath_iff_isTrail
Modified Mathlib/Data/Finsupp/Sigma.lean
+/- theorem Finsupp.embSigma_single
2025-11-26 22:16:13 102243f
feat: Linearity of Derivation.compAlgebraMap (#32026)
Let $Der_R(B,M)$ denote the $M$-valued derivations an $R$-algebra $B$. Assume we are also given an $R$-algebra homomorphism $\sigma: A\to B$. Then precomposing with $\sigma$ induces a map $Der_R(B,M)\to Der_R(A,M)$.
This map is defined `Derivation.compAlgebraMap`.
In this PR we enhance this map: When $R$ $A$ $M$ also form a scalar tower, this map is in fact $A$-linear,
as witnessed by the added `Derivation.compAlgebraHom`.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Derivation/Basic.lean
+ def Derivation.compAlgebraMapL
2025-11-26 21:08:41 feb1bf6
feat: $C^n$ implicit function theorem (#30595)
I formalise a proof that the implicit function obtained from a $C^n$ implicit equation ($n \geq 1$) is $C^n$. Roughly speaking, given an equation $f : E \times F \to F$ that is smooth at $(a,b) : E\times F$ and whose derivative $f'$ is in some sense non-singular, then there exists a function $\phi : E \to F$ such that $\phi(a) = b$, $f(x, \phi(x)) = f(a,b)$ for all $x$ in a neighbourhood of $a$, and $\phi$ is $C^n$ at $a$.
The current implicit function theorem in Mathlib is quite general and not directly applicable to many familiar scenarios. The statements added by this PR correspond to, e.g., the way the theorem is described on Wikipedia, and will be directly useful for an upcoming formalisation of the smoothness theorem for flows of ODEs.
- [x] depends on: #30607
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Calculus/Implicit.lean
Added Mathlib/Analysis/Calculus/ImplicitContDiff.lean
+ theorem ImplicitFunctionData.contDiff_implicitFunction
+ theorem IsContDiffImplicitAt.apply_implicitFunction
+ theorem IsContDiffImplicitAt.comp_implicitFunctionAux_eq_snd
+ theorem IsContDiffImplicitAt.contDiffAt_implicitFunction
+ theorem IsContDiffImplicitAt.implicitFunctionAux_fst
+ def IsContDiffImplicitAt.implicitFunctionData
+ theorem IsContDiffImplicitAt.implicitFunctionData_leftFun_pt
+ theorem IsContDiffImplicitAt.implicitFunctionData_rightFun_pt
+ theorem IsContDiffImplicitAt.implicitFunction_def
+ structure IsContDiffImplicitAt
2025-11-26 20:07:35 addec83
chore: generalize le_sum_ofDigitsTerm_digits (#32072)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Real/OfDigits.lean
+/- theorem Real.le_sum_ofDigitsTerm_digits
2025-11-26 19:53:55 c15bb2e
feat(Combinatorics/SimpleGraph): add simp lemma `getVert_map` for `Walk.map` (#32102)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Walks/Maps.lean
+ theorem SimpleGraph.Walk.getVert_map
2025-11-26 19:12:37 20a0747
chore: rename LinearMap.coeFn_sum to LinearMap.coe_sum (#32054)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Azumaya/Matrix.lean
Modified Mathlib/Algebra/Lie/TraceForm.lean
Modified Mathlib/Algebra/Lie/Weights/Basic.lean
Modified Mathlib/Algebra/Module/Submodule/LinearMap.lean
- theorem LinearMap.coeFn_sum
+ theorem LinearMap.coe_sum
Modified Mathlib/LinearAlgebra/Basis/Defs.lean
Modified Mathlib/LinearAlgebra/BilinearForm/Hom.lean
Modified Mathlib/LinearAlgebra/BilinearForm/Properties.lean
Modified Mathlib/LinearAlgebra/Contraction.lean
Modified Mathlib/LinearAlgebra/Dual/Lemmas.lean
Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean
Modified Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean
Modified Mathlib/LinearAlgebra/Matrix/ToLin.lean
Modified Mathlib/LinearAlgebra/Multilinear/Basic.lean
Modified Mathlib/LinearAlgebra/RootSystem/Base.lean
Modified Mathlib/LinearAlgebra/RootSystem/Finite/CanonicalBilinear.lean
Modified Mathlib/LinearAlgebra/SesquilinearForm/Star.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Pi.lean
Modified Mathlib/RingTheory/Bialgebra/MonoidAlgebra.lean
Modified Mathlib/Topology/Algebra/Module/LinearMap.lean
Modified Mathlib/Topology/Algebra/Module/ModuleTopology.lean
2025-11-26 18:21:49 97cfe23
feat: updates to downstream repos scripts (#31839)
Adds repos, improves the output for `scripts/downstream-tags.py`, and adds flags to `scripts/downstream_dashboard.py` so we can query particular defect types.
ESTIMATED CHANGES
Modified scripts/downstream-tags.py
Modified scripts/downstream_dashboard.py
Modified scripts/downstream_repos.yml
2025-11-26 18:08:05 95f1094
feat(SetTheory/ZFC/Ordinal): Lean ordinals to ZFC ordinals (#26544)
We define `Ordinal.toZFSet` and prove that its outputs are precisely the ZFC ordinals. Moved from #19985.
ESTIMATED CHANGES
Modified Mathlib/SetTheory/ZFC/Basic.lean
+ theorem ZFSet.insert_eq
Modified Mathlib/SetTheory/ZFC/Ordinal.lean
+ theorem Ordinal.coe_toZFSet
+ theorem Ordinal.mem_toPSet_iff
+ theorem Ordinal.mem_toZFSet_iff
+ theorem Ordinal.mk_toPSet
+ theorem Ordinal.rank_toPSet
+ theorem Ordinal.rank_toZFSet
+ theorem Ordinal.toZFSet_injective
+ theorem Ordinal.toZFSet_mem_toZFSet_iff
+ theorem Ordinal.toZFSet_monotone
+ theorem Ordinal.toZFSet_strictMono
+ theorem Ordinal.toZFSet_subset_toZFSet_iff
+ theorem Ordinal.toZFSet_succ
+ theorem Ordinal.toZFSet_zero
+ theorem Ordinal.type_toPSet
+ theorem ZFSet.IsOrdinal.rank_inj
+ theorem ZFSet.IsOrdinal.rank_le_iff_subset
+ theorem ZFSet.IsOrdinal.rank_lt_iff_mem
+ theorem ZFSet.IsOrdinal.toZFSet_rank_eq
+ theorem ZFSet.isOrdinal_iff_mem_range_toZFSet
+ theorem ZFSet.isOrdinal_succ
+ theorem ZFSet.isOrdinal_toZFSet
Modified Mathlib/SetTheory/ZFC/PSet.lean
+ theorem PSet.mem_def
Modified Mathlib/SetTheory/ZFC/Rank.lean
+ theorem ZFSet.rank_mk
2025-11-26 17:53:27 e8aa54a
feat(Algebra/Homology): K-injective cochain complexes (#31941)
We define the notion of K-injective cochain complex in an abelian category, and show that bounded below complexes of injective objects are K-injective.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean
+ def CochainComplex.HomComplex.Cochain.single
+ theorem CochainComplex.HomComplex.Cochain.single_v
+ theorem CochainComplex.HomComplex.Cochain.single_v_eq_zero
Added Mathlib/Algebra/Homology/HomotopyCategory/HomComplexInduction.lean
+ def CochainComplex.HomComplex.Cochain.EqUpTo
+ def CochainComplex.HomComplex.Cochain.InductionUp.limitSequence
+ theorem CochainComplex.HomComplex.Cochain.InductionUp.limitSequence_eqUpTo
+ def CochainComplex.HomComplex.Cochain.InductionUp.sequence
+ theorem CochainComplex.HomComplex.Cochain.InductionUp.sequence_eqUpTo
Added Mathlib/Algebra/Homology/HomotopyCategory/KInjective.lean
+ theorem CochainComplex.isKInjective_of_injective
+ theorem CochainComplex.isKInjective_of_injective_aux
Modified docs/references.bib
2025-11-26 17:53:25 5e892b1
feat(Geometry/Convex/Cone): characterize salient pointed cones (#31648)
Prove one lemma characterizing salient pointed cones by the intersection of the cone and its negative.
This characterization is often used as the definition of salient in presentations where convex cones are by default pointed.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Convex/Cone/Pointed.lean
+ theorem PointedCone.salient_iff_inter_neg_eq_singleton
2025-11-26 17:13:40 02e56b4
chore: tag `Finsupp.prod_congr` with `gcongr` (#28511)
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Finsupp/Basic.lean
2025-11-26 16:35:08 b29a244
feat(CategoryTheory): injective resolutions as cochain complexes indexed by the integers (#32003)
Given an injective resolution `R` of an object `X` in an abelian category `C`, we define `R.cochainComplex : CochainComplex C ℤ`, which is the extension of `R.cocomplex : CochainComplex C ℕ`, and the quasi-isomorphism `R.ι' : (CochainComplex.singleFunctor C 0).obj X ⟶ R.cochainComplex`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Homology/Embedding/CochainComplex.lean
Modified Mathlib/Algebra/Homology/Embedding/Extend.lean
+ theorem HomologicalComplex.extendSingleIso_hom_f
+ theorem HomologicalComplex.extendSingleIso_inv_f
+ theorem HomologicalComplex.extend_single_d
Modified Mathlib/Algebra/Homology/Embedding/ExtendHomology.lean
Added Mathlib/CategoryTheory/Abelian/Injective/Extend.lean
+ theorem CategoryTheory.InjectiveResolution.cochainComplex_d
+ theorem CategoryTheory.InjectiveResolution.ι'_f_zero
2025-11-26 16:35:05 22ed602
feat(AlgebraicTopology/SimplicialSet): rank functions for pairings (#28346)
This PR introduces the type of (weak) rank functions for pairings, a notion introduced by Sean Moss, *Another approach to the Kan-Quillen model structure*. Rank functions can be used in order to show that certain pairings are regular (i.e. the ancestrality relation is well founded). In a future PR, it shall be shown that a regular pairing admits a rank function to the natural numbers, which shall be used to show that the corresponding inclusion of simplicial sets is a (strong) anodyne extension.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Pairing.lean
+ theorem SSet.Subcomplex.Pairing.AncestralRel.dim_le
Added Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Rank.lean
+ theorem SSet.Subcomplex.Pairing.RankFunction.isRegular
+ def SSet.Subcomplex.Pairing.RankFunction.toWeakRankFunction
+ theorem SSet.Subcomplex.Pairing.RankFunction.wf_ancestralRel
+ structure SSet.Subcomplex.Pairing.RankFunction
+ theorem SSet.Subcomplex.Pairing.WeakRankFunction.isRegular
+ theorem SSet.Subcomplex.Pairing.WeakRankFunction.wf_ancestralRel
+ structure SSet.Subcomplex.Pairing.WeakRankFunction
+ structure SSet.Subcomplex.PairingCore.RankFunction
+ structure SSet.Subcomplex.PairingCore.WeakRankFunction
2025-11-26 16:01:49 87c9cf0
feat(SimpleGraph): characterise when `fromEdgeSet` is less than another graph (#31693)
From ProofBench
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Basic.lean
+ theorem SimpleGraph.fromEdgeSet_le
2025-11-26 16:01:46 cb55ab3
feat: many lemmas on integrability of a bounded linear map composed with two functions (#31661)
Specialize [ContinuousLinearMap.memLp_of_bilin](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Function/Holder.html#ContinuousLinearMap.memLp_of_bilin) to the case where one of the argument is bounded and the other is integrable.
Add a version of [MeasureTheory.Integrable.bdd_mul'](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Function/L1Space/Integrable.html#MeasureTheory.Integrable.bdd_mul') for scalar multiplication.
This is needed for #31666.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Function/ConditionalExpectation/Real.lean
Modified Mathlib/MeasureTheory/Function/Holder.lean
+ theorem ContinuousLinearMap.integrable_of_bilin_of_bdd_left
+ theorem ContinuousLinearMap.integrable_of_bilin_of_bdd_right
Modified Mathlib/MeasureTheory/Function/L1Space/Integrable.lean
- theorem MeasureTheory.Integrable.bdd_mul'
+/- theorem MeasureTheory.Integrable.bdd_mul
+ theorem MeasureTheory.Integrable.bdd_smul
+ theorem MeasureTheory.Integrable.mul_bdd
+ theorem MeasureTheory.Integrable.smul_bdd
Modified Mathlib/Probability/Martingale/Basic.lean
2025-11-26 16:01:44 f45ec66
feat: monotonicity of Holderianity (#31561)
Prove many results related to the following two:
- If a function is `r`-Hölder over a bounded space, then it is also `s`-Hölder when `s ≤ r`.
- If a function is `r`-Hölder and `t`-Hölder, then it is `s`-Hölder for `r ≤ s ≤ t`.
ESTIMATED CHANGES
Modified Mathlib/Topology/MetricSpace/Holder.lean
+ theorem HolderOnWith.holderOnWith_zero_of_bounded
+ theorem HolderOnWith.interpolate
+ theorem HolderOnWith.interpolate_const
+ theorem HolderOnWith.mono_const
+ theorem HolderOnWith.of_le
+ theorem HolderOnWith.of_le_of_le
+ theorem HolderWith.holderWith_zero_of_bounded
+ theorem HolderWith.interpolate
+ theorem HolderWith.interpolate_const
+ theorem HolderWith.of_le
+ theorem HolderWith.of_le_of_le
+ theorem convex_setOf_holderOnWith
+ theorem convex_setOf_holderWith
Modified Mathlib/Topology/MetricSpace/HolderNorm.lean
+ theorem HolderOnWith.exists_holderOnWith_of_le'
+ theorem HolderOnWith.exists_holderOnWith_of_le
+ theorem HolderOnWith.exists_holderOnWith_of_le_of_le
+ theorem MemHolder.memHolder_of_le_of_le
+ theorem MemHolder.of_le'
+ theorem MemHolder.of_le
2025-11-26 16:01:41 9183cd2
feat(Topology): `nhdsSetWithin` filter (#31077)
Add a relative version `nhdsSetWithin` of `nhdsSet`, analogous to `nhdsWithin`. The main application of this is a slightly more general variant of the tube lemma (`generalized_tube_lemma_left`) that came up while working in analysis files.
ESTIMATED CHANGES
Modified Mathlib/Topology/Compactness/Compact.lean
+ theorem IsCompact.nhdsSetWithin_prod_eq
+ theorem generalized_tube_lemma'
+ theorem generalized_tube_lemma_left
+ theorem generalized_tube_lemma_right
Modified Mathlib/Topology/ContinuousOn.lean
+ theorem Continuous.preimage_mem_nhdsSet
+ theorem Continuous.preimage_mem_nhdsSetWithin
+ theorem ContinuousOn.preimage_mem_nhdsSetWithin
+ theorem ContinuousOn.preimage_mem_nhdsSetWithin_of_mem_nhdsSet
Modified Mathlib/Topology/Defs/Filter.lean
+ def nhdsSetWithin
Modified Mathlib/Topology/NhdsWithin.lean
+ theorem Topology.IsInducing.map_nhdsSet_eq
+ theorem map_nhdsSet_induced_eq
+ theorem map_nhdsSet_subtype_val
+ theorem mem_nhdsSetWithin
+ theorem mem_nhdsSet_induced
+ theorem mem_nhdsSet_subtype_iff_nhdsSetWithin
+ theorem nhdsSetWithin_basis_open
+ theorem nhdsSetWithin_empty'
+ theorem nhdsSetWithin_empty
+ theorem nhdsSetWithin_eq_principal_of_subset
+ theorem nhdsSetWithin_hasBasis
+ theorem nhdsSetWithin_mono_left
+ theorem nhdsSetWithin_mono_right
+ theorem nhdsSetWithin_prod_le
+ theorem nhdsSetWithin_self
+ theorem nhdsSetWithin_singleton
+ theorem nhdsSetWithin_univ'
+ theorem nhdsSetWithin_univ
+ theorem nhdsSet_induced
+ theorem principal_inter_le_nhdsSetWithin
2025-11-26 16:01:38 5c71dcf
feat(CyclotomicFields): generalize `IsPrimitiveRoot.integralPowerBasis` to all (nonzero) integers (#30010)
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
+ theorem IsCyclotomicExtension.Rat.adjoin_singleton_eq_top
+ theorem IsCyclotomicExtension.Rat.cyclotomicRing_isIntegralClosure
+/- theorem IsCyclotomicExtension.Rat.discr
+ theorem IsCyclotomicExtension.Rat.isIntegralClosure_adjoin_singleton
+ theorem IsCyclotomicExtension.Rat.natAbs_discr
- theorem IsPrimitiveRoot.integralPowerBasis'_gen
+ theorem IsPrimitiveRoot.integralPowerBasisOfPrimePow_dim
+ theorem IsPrimitiveRoot.integralPowerBasisOfPrimePow_gen
+/- theorem IsPrimitiveRoot.integralPowerBasis_dim
+/- theorem IsPrimitiveRoot.integralPowerBasis_gen
- theorem IsPrimitiveRoot.power_basis_int'_dim
- theorem IsPrimitiveRoot.subOneIntegralPowerBasis'_gen
- theorem IsPrimitiveRoot.subOneIntegralPowerBasis'_gen_prime
+ theorem IsPrimitiveRoot.subOneIntegralPowerBasisOfPrimePow_gen
+ theorem IsPrimitiveRoot.subOneIntegralPowerBasisOfPrimePow_gen_prime
+/- theorem IsPrimitiveRoot.subOneIntegralPowerBasis_gen
- theorem IsPrimitiveRoot.subOneIntegralPowerBasis_gen_prime
2025-11-26 15:02:01 76fe653
feat(Int): Shift{Left,Right} instance spec on how it interacts with Nat (#32142)
replaces #28884
We have:
```
Int.shiftLeft_neg
Int.shiftRight_neg
Int.shiftLeft_natCast
Int.shiftRight_natCast
Int.shiftLeft_negSucc
Int.shiftRight_negSucc
```
and we were missing a connection to the `HShiftLeft Int Nat Int` instance in core. This rectifies the missing API with
```
Int.shiftLeft_natCast_right
Int.shiftRight_natCast_right
```
the negations are handled by existing simp lemmas
ESTIMATED CHANGES
Modified Mathlib/Data/Int/Bitwise.lean
+ theorem Int.shiftLeft_natCast_right
+ theorem Int.shiftRight_natCast_right
2025-11-26 15:01:59 d0b7272
fix: fix namespace of deprecations (#32137)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Quotient/Basic.lean
2025-11-26 15:01:58 cf46d6e
chore(TotallyReal/TotallyComplex): remove the `NumberField` hypothesis (#31810)
We remove the`NumberField` hypothesis in the definitions and most of the results. In general, it can be replaced by the hypothesis that the field is of characteristic zero and some integrality hypothesis.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/CMField.lean
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
+/- theorem NumberField.IsTotallyComplex.nrRealPlaces_eq_zero
+/- theorem NumberField.IsTotallyReal.maximalRealSubfield_eq_top
+/- theorem NumberField.IsTotallyReal.nrComplexPlaces_eq_zero
+/- theorem NumberField.IsTotallyReal.of_algebra
+/- theorem NumberField.nrComplexPlaces_eq_zero_iff
+/- theorem NumberField.nrRealPlaces_eq_zero_iff
2025-11-26 15:01:56 e47720c
feat: Add multiplicative version of structure theorem for finitely generated abelian groups (#31526)
This is similar to the multiplicative version of the structure theorem for *finite* abelian groups (using a pi type instead of a direct sum)
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/FiniteAbelian/Basic.lean
+ theorem CommGroup.equiv_free_prod_prod_multiplicative_zmod
2025-11-26 15:01:54 c081da6
feat(MeasureTheory): typeclass for measurability of equality (#31512)
Currently, there are multiple lemmas of the form `MeasurableSet {x | f x = g x}` with different typeclass assumptions. This PR unifies them using a new `MeasurableEq` typeclass. A new instance for second-countable Hausdorff spaces is also added.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean
Modified Mathlib/MeasureTheory/Group/Arithmetic.lean
- theorem ae_eq_trim_of_measurable
- theorem measurableSet_eq_fun'
- theorem measurableSet_eq_fun
- theorem measurableSet_eq_fun_of_countable
- theorem nullMeasurableSet_eq_fun
Modified Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean
+ theorem Measurable.const_eq
+ theorem Measurable.eq
+ theorem Measurable.eq_const
+ theorem measurableSet_eq_fun
Modified Mathlib/MeasureTheory/MeasurableSpace/Defs.lean
Modified Mathlib/MeasureTheory/Measure/AEMeasurable.lean
+ theorem nullMeasurableSet_eq_fun
Modified Mathlib/MeasureTheory/Measure/Trim.lean
+ theorem ae_eq_trim_of_measurable
Modified Mathlib/Probability/Kernel/CondDistrib.lean
+/- theorem ProbabilityTheory.condExp_ae_eq_integral_condDistrib'
Modified Mathlib/Probability/Kernel/Posterior.lean
2025-11-26 15:01:51 d503061
doc(Algebra): fix typos (#30669)
Issues were found and fixed with help from Codex.
ESTIMATED CHANGES
Modified Mathlib/Algebra/AddConstMap/Basic.lean
Modified Mathlib/Algebra/BigOperators/Pi.lean
Modified Mathlib/Algebra/BrauerGroup/Defs.lean
Modified Mathlib/Algebra/CharZero/AddMonoidHom.lean
Modified Mathlib/Algebra/Field/Action/ConjAct.lean
Modified Mathlib/Algebra/Field/Power.lean
Modified Mathlib/Algebra/Field/ULift.lean
Modified Mathlib/Algebra/GroupWithZero/Associated.lean
Modified Mathlib/Algebra/Homology/ComplexShapeSigns.lean
Modified Mathlib/Algebra/Homology/DerivedCategory/Basic.lean
Modified Mathlib/Algebra/Homology/DerivedCategory/ShortExact.lean
Modified Mathlib/Algebra/Homology/Factorizations/Basic.lean
Modified Mathlib/Algebra/Homology/HomologySequenceLemmas.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/MappingCone.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/ShortExact.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/SingleFunctors.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/Triangulated.lean
Modified Mathlib/Algebra/Homology/HomotopyCofiber.lean
Modified Mathlib/Algebra/Homology/Localization.lean
Modified Mathlib/Algebra/Lie/Free.lean
Modified Mathlib/Algebra/Lie/InvariantForm.lean
Modified Mathlib/Algebra/Lie/Quotient.lean
Modified Mathlib/Algebra/Lie/Sl2.lean
Modified Mathlib/Algebra/Lie/Submodule.lean
Modified Mathlib/Algebra/Lie/TraceForm.lean
Modified Mathlib/Algebra/Order/Ring/Nat.lean
Modified Mathlib/Algebra/Polynomial/Lifts.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/Algebra/SkewMonoidAlgebra/Single.lean
Modified Mathlib/Algebra/Star/NonUnitalSubsemiring.lean
2025-11-26 15:01:47 75ee4ad
feat(RingTheory/Congruence/Hom): prove basic isomorphisms theorems for ring congruences (#26277)
This file contains elementary definitions involving congruence
relations and morphisms for semirings, rings, and algebras.
* `RingCon.ker`: the kernel of a monoid homomorphism as a congruence relation
* `RingCon.lift`, `RingCon.liftₐ`: the homomorphism / the algebra morphism
on the quotient given that the congruence is in the kernel
* `RingCon.map`, `RingCon.mapₐ`: homomorphism / algebra morphism
from a smaller to a larger quotient
* `RingCon.quotientKerEquivRangeS`, `RingCon.quotientKerEquivRange`,
`RingCon.quotientKerEquivRangeₐ` :
the first isomorphism theorem for semirings (using `RingHom.rangeS`),
rings (using `RingHom.range`) and algebras (using `AlgHom.range`).
* `RingCon.comapQuotientEquivRangeS`, `RingCon.comapQuotientEquivRange`,
`RingCon.comapQuotientEquivRangeₐ` : the second isomorphism theorem
for semirings (using `RingHom.rangeS`), rings (using `RingHom.range`)
and algebras (using `AlgHom.range`).
* `RingCon.quotientQuotientEquivQuotient`, `RingCon.quotientQuotientEquivQuotientₐ` :
the third isomorphism theorem for semirings (or rings) and algebras
It is an adaptation of what existed for multiplicative congruences (docs#Con) and is only useful for semirings which are not rings.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Ring/Subsemiring/Basic.lean
+ theorem RingHom.injective_codRestrict
+ theorem RingHom.rangeS_codRestrict
+ theorem RingHom.rangeS_eq_top
+ theorem RingHom.surjective_codRestrict
Modified Mathlib/Algebra/RingQuot.lean
+ def RingCon.mkₐ
+ theorem RingCon.mkₐ_surjective
Modified Mathlib/Data/Set/Restrict.lean
+ theorem Set.range_codRestrict
+ theorem Set.surjective_codRestrict
Modified Mathlib/LinearAlgebra/Dimension/DivisionRing.lean
Modified Mathlib/RingTheory/Congruence/Basic.lean
+ theorem RingCon.comap_mono
Modified Mathlib/RingTheory/Congruence/Defs.lean
+ theorem RingCon.coe_inj
+ theorem RingCon.coe_mk'
+/- def RingCon.comap
+ theorem RingCon.comap_rel
+ theorem RingCon.ext''
+/- def RingCon.mk'
+ theorem RingCon.mk'_surjective
Added Mathlib/RingTheory/Congruence/Hom.lean
+ theorem RingCon.Quotient.hom_ext
+ theorem RingCon.coe_comapQuotientEquivRange_mk
+ theorem RingCon.coe_comapQuotientEquivRangeₐ_mk
+ theorem RingCon.coe_comapQuotientEquivRangeₐ_symm_mk
+ theorem RingCon.coe_liftₐ
+ theorem RingCon.coe_quotientKerEquivRangeS_mk
+ theorem RingCon.coe_quotientKerEquivRangeₐ_mkₐ
+ theorem RingCon.comapQuotientEquivOfSurj_mk
+ theorem RingCon.comapQuotientEquivOfSurj_symm_mk'
+ theorem RingCon.comapQuotientEquivOfSurj_symm_mk
+ theorem RingCon.comapQuotientEquivRangeS_mk
+ theorem RingCon.comapQuotientEquivRangeS_symm_mk
+ theorem RingCon.comapQuotientEquivRange_mk
+ theorem RingCon.comapQuotientEquivRange_symm_mk
+ theorem RingCon.comapQuotientEquivRangeₐ_mk
+ theorem RingCon.comap_bot
+ theorem RingCon.comap_eq
+ theorem RingCon.congr_mk
+ theorem RingCon.congrₐ_mk
+ def RingCon.correspondence
+ def RingCon.factorₐ
+ theorem RingCon.factorₐ_apply
+ theorem RingCon.factorₐ_mk
+ def RingCon.ker
+ def RingCon.kerLift
+ theorem RingCon.kerLift_injective
+ theorem RingCon.kerLift_mk
+ theorem RingCon.kerLift_range_eq
+ def RingCon.kerLiftₐ
+ theorem RingCon.kerLiftₐ_injective
+ theorem RingCon.kerLiftₐ_mk
+ theorem RingCon.kerLiftₐ_range_eq
+ theorem RingCon.ker_apply
+ theorem RingCon.ker_comp
+ theorem RingCon.ker_eq_lift_of_injective
+ theorem RingCon.ker_mk'_eq
+ def RingCon.lift
+ theorem RingCon.lift_apply_mk'
+ theorem RingCon.lift_bijective_iff
+ theorem RingCon.lift_coe
+ theorem RingCon.lift_comp_mk'
+ theorem RingCon.lift_injective_iff
+ theorem RingCon.lift_mk'
+ theorem RingCon.lift_surjective_iff
+ theorem RingCon.lift_surjective_of_surjective
+ theorem RingCon.lift_unique
+ def RingCon.liftₐ
+ theorem RingCon.liftₐ_coe_toRingHom
+ theorem RingCon.liftₐ_mk
+ theorem RingCon.liftₐ_range
+ def RingCon.map
+ def RingCon.mapGen
+ theorem RingCon.mapGen_apply_apply_of_surjective
+ theorem RingCon.mapGen_eq_map_of_surjective
+ theorem RingCon.map_apply
+ theorem RingCon.mkₐ_comp_factorₐ_comp_mkₐ
+ def RingCon.quotientKerEquivOfRightInverse
+ theorem RingCon.quotientKerEquivOfRightInverse_apply
+ theorem RingCon.quotientKerEquivOfSurjective_mk
+ theorem RingCon.quotientKerEquivRangeₐ_mkₐ
+ def RingCon.quotientQuotientEquivQuotient
+ theorem RingCon.quotientQuotientEquivQuotient_coe_coe
+ theorem RingCon.quotientQuotientEquivQuotient_mk_mk
+ theorem RingCon.quotientQuotientEquivQuotient_symm_mk
+ def RingCon.quotientQuotientEquivQuotientₐ
+ theorem RingCon.quotientQuotientEquivQuotientₐ_coe_coe
+ theorem RingCon.quotientQuotientEquivQuotientₐ_mk_mk
+ theorem RingCon.quotientQuotientEquivQuotientₐ_symm_mk
+ theorem RingCon.rangeS_kerLift
+ theorem RingCon.rangeS_lift
+ theorem RingCon.rangeS_mk'
+ theorem RingCon.range_lift
+ theorem RingCon.range_mk'
+ theorem RingCon.range_mkₐ
2025-11-26 13:56:19 3f25611
chore(Data/Part): golf entire `assert_pos` and `assert_neg` using `ext; simp_all` (#32139)
ESTIMATED CHANGES
Modified Mathlib/Data/Part.lean
2025-11-26 13:56:17 0bee8dd
chore(Data/Int/Fib): add `fib_neg` (#32107)
Forgot to add `Int.fib_neg`:
```lean
theorem fib_neg (n : ℤ) : fib (-n) = if Even n then -fib n else fib n := by
```
Also changes `Int.fib_gcd` to `Int.gcd_fib` and gets rid of the unnecessary coercions.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/Parity.lean
+ theorem neg_one_zpow_eq_ite
Modified Mathlib/Data/Int/Fib.lean
- theorem Int.fib_gcd
+ theorem Int.fib_neg
+ theorem Int.gcd_fib
Modified Mathlib/Logic/Basic.lean
+ theorem apply_ite_left
2025-11-26 13:56:14 b25a4f7
feat(Data/Finsupp): add degree_sum (#32074)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Nullstellensatz.lean
Modified Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean
Modified Mathlib/Data/Finsupp/Weight.lean
+/- def Finsupp.degree
- theorem Finsupp.degree_add
+ theorem Finsupp.degree_def
- theorem Finsupp.degree_zero
Modified Mathlib/RingTheory/MvPolynomial/Homogeneous.lean
Modified Mathlib/RingTheory/MvPowerSeries/Substitution.lean
2025-11-26 13:03:14 5eac5e0
refactor(Topology): relax Eventually to Frequently for TendstoUniformly.continuous (#32122)
... and its friends.
For downstream streams, I don't find any that can be generalized, so I keep their statements and added a Eventually.frequently in between or the equivalent
ESTIMATED CHANGES
Modified Mathlib/Analysis/Analytic/Basic.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Continuity.lean
Modified Mathlib/Analysis/Complex/LocallyUniformLimit.lean
Modified Mathlib/Analysis/Normed/Group/FunctionSeries.lean
Modified Mathlib/Topology/ContinuousMap/Bounded/Basic.lean
Modified Mathlib/Topology/UniformSpace/UniformApproximation.lean
Modified Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean
2025-11-26 13:03:12 2d70ee5
feat(Data/Multiset): add Multiset filter and bind lemmas (#31107)
Add basic lemmas equating `Multiset` `filter`, `filterMap`, `join`, and `bind` operations.
ESTIMATED CHANGES
Modified Mathlib/Data/Multiset/Bind.lean
+ theorem Multiset.bind_filter
+ theorem Multiset.bind_filterMap
+ theorem Multiset.filterMap_bind
+ theorem Multiset.filterMap_eq_bind
+ theorem Multiset.filterMap_join
+ theorem Multiset.filter_bind
+ theorem Multiset.filter_eq_bind
+ theorem Multiset.filter_join
Modified Mathlib/Data/Multiset/Filter.lean
+ theorem Multiset.filterMap_add
+ theorem Multiset.filterMap_cons
+ theorem Multiset.map_filter_eq_filterMap
2025-11-26 13:03:10 e2bf3a6
feat(Computability/NFA): NFA acceptsFrom definitions and lemmas (#31038)
This PR defines `NFA.acceptsFrom`, similar to [`DFA.acceptsFrom`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Computability/DFA.html#DFA.acceptsFrom), and provides helper lemmas.
ESTIMATED CHANGES
Modified Mathlib/Computability/NFA.lean
+ def NFA.acceptsFrom
+ theorem NFA.acceptsFrom_iUnion
+ theorem NFA.acceptsFrom_iUnion₂
+ theorem NFA.acceptsFrom_union
+ theorem NFA.accepts_eq_acceptsFrom_start
+ theorem NFA.append_mem_acceptsFrom
+ theorem NFA.append_preimage_acceptsFrom
+ theorem NFA.cons_mem_acceptsFrom
+ theorem NFA.cons_preimage_acceptsFrom
+ theorem NFA.evalFrom_append
+ theorem NFA.evalFrom_iUnion
+ theorem NFA.evalFrom_iUnion₂
+ theorem NFA.evalFrom_union
+/- theorem NFA.eval_append_singleton
+ theorem NFA.mem_acceptsFrom
+ theorem NFA.nil_mem_acceptsFrom
+ theorem NFA.stepSet_union
2025-11-26 12:49:29 54106a2
feat(Algebra): add subsingleton of IsZero for `AddCommGrpCat` (#32101)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/Grp/Zero.lean
+ theorem CommGrpCat.isZero_iff_subsingleton
+ theorem CommGrpCat.subsingleton_of_isZero
+ theorem GrpCat.isZero_iff_subsingleton
+ theorem GrpCat.subsingleton_of_isZero
2025-11-26 12:23:26 0194007
feat(Analysis): `tendsto_zpow_nhdsNE_zero_cobounded` (#32120)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Meromorphic/Order.lean
Modified Mathlib/Analysis/Normed/Field/Lemmas.lean
+ theorem Filter.inv_nhdsNE_zero
- theorem Filter.inv_nhdsWithin_ne_zero
+ theorem Filter.tendsto_inv₀_nhdsNE_zero
- theorem Filter.tendsto_inv₀_nhdsWithin_ne_zero
- theorem NormedField.tendsto_norm_inv_nhdsNE_zero_atTop
+ theorem tendsto_norm_inv_nhdsNE_zero_atTop
+ theorem tendsto_zpow_nhdsNE_zero_cobounded
Modified Mathlib/Analysis/Normed/Ring/Lemmas.lean
+ theorem tendsto_pow_cobounded_cobounded
2025-11-26 12:00:48 757fe2e
chore: fix dependency counting script (#32133)
Specifically support lines which start as either of:
* `public import`
* `import`
ESTIMATED CHANGES
Modified scripts/count-trans-deps.py
2025-11-26 11:32:22 2aff67d
refactor: redefine `IsTuranMaximal` (#28719)
Redefined `IsTuranMaximal := G.IsExtremal (CliqueFree · (r + 1))` and
- replaced `classical` in `IsTuranMaximal.le_iff_eq` with `DecidableRel`
- refactored `turanGraph.instDecidableRelAdj`, `turanGraph_zero`, `exists_isTuranMaximal`
- added `open Fintype`
- replaced `simp only` with `rw` or `simp_rw`
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean
+ theorem SimpleGraph.IsExtremal.le_iff_eq
Modified Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean
+/- theorem SimpleGraph.IsTuranMaximal.card_parts
- theorem SimpleGraph.IsTuranMaximal.le_iff_eq
+/- def SimpleGraph.IsTuranMaximal
+/- theorem SimpleGraph.not_cliqueFree_of_isTuranMaximal
+/- theorem SimpleGraph.turanGraph_zero
2025-11-26 11:32:20 dbb8003
feat(Data/Nat/Factorization): some results on equality of powers of naturals proved from factorization (#28557)
I came across some math olympiad problems in number theory that could benefit from these theorems, expecially those on the prime power equality `p ^ m = a ^ n`. A specialized `eq_of_factorization_eq'` is added BTW to help with proof search.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Factorization/Basic.lean
+ theorem Nat.exists_eq_pow_of_exponent_coprime_of_pow_eq_pow
+ theorem Nat.exists_eq_pow_of_pow_eq_pow
Modified Mathlib/Data/Nat/Factorization/Defs.lean
+ theorem Nat.eq_of_factorization_eq'
Modified Mathlib/Data/Nat/Factorization/PrimePow.lean
+ theorem Nat.exists_base_eq_prime_pow_of_prime_pow_eq_base_pow
+ theorem Nat.exponent_dvd_of_prime_pow_eq_pow
+ theorem Nat.exponent_eq_exponent_mul_factorization_of_prime_pow_eq_base_pow
2025-11-26 11:15:47 8f6c938
chore(CategoryTheory/Limits): golf entire `ι_colimitLimitIso_limit_π` using `simp` (#32132)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/FilteredColimitCommutesFiniteLimit.lean
2025-11-26 10:44:46 0520e08
feat: characteristic function of a Gaussian measure (#31567)
ESTIMATED CHANGES
Modified Mathlib/Probability/Distributions/Gaussian/Basic.lean
+ theorem ProbabilityTheory.IsGaussian.charFun_eq
+ theorem ProbabilityTheory.isGaussian_iff_charFun_eq
2025-11-26 10:04:12 e814276
feat: beta reduce in the `T%` elaborator (#30879)
Whenever the `T%` elaborator succeeds, head beta reduce the resulting application.
This enables applying it with anonymous functions or inside big operators without issue.
(For instance, all changes to `SmoothSection` in #30357 are now possible without additional `dsimp` steps.)
In the process, also extract the workhorse component of the elaborator into an independent function
and improve its doc-string to mention the corresponding tracing option.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Manifold/Notation.lean
+ def Manifold.Elab.totalSpaceMk
Modified MathlibTest/DifferentialGeometry/Notation.lean
2025-11-26 10:04:09 ce7caf1
feat(Algebra/Order/Floor): generalize mul_floor_div theorems to rings and semirings (#30041)
Generalize `mul_cast_floor_div_cancel` from `Field` and `Semifield` to `Ring` and `Semiring`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Floor/Ring.lean
+/- theorem Int.cast_mul_floor_div_cancel_of_pos
+/- theorem Int.mul_cast_floor_div_cancel_of_pos
+/- theorem Int.mul_natCast_floor_div_cancel
+/- theorem Int.natCast_mul_floor_div_cancel
Modified Mathlib/Algebra/Order/Floor/Semifield.lean
- theorem Nat.cast_mul_floor_div_cancel
- theorem Nat.mul_cast_floor_div_cancel
Modified Mathlib/Algebra/Order/Floor/Semiring.lean
+ theorem Nat.cast_mul_floor_div_cancel
+ theorem Nat.mul_cast_floor_div_cancel
Modified Mathlib/Analysis/Real/OfDigits.lean
2025-11-26 09:48:55 c6d0669
chore(Topology/MetricSpace): golf `candidates_nonneg` and `candidates_lipschitz_aux` using `grind` (#32051)
ESTIMATED CHANGES
Modified Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean
2025-11-26 09:48:52 7ed80c7
feat(Geometry/Euclidean/Angle/Oriented/Affine): equal angles between parallel lines (#31713)
We have an existing lemma that angles are equal mod π when corresponding lines in those angles are parallel. Add a stronger lemma giving equality mod 2π when all four endpoints of the angles lie on the same line (excluding the degenerate case of collinear points where it's possible one angle is 0 and the other is π).
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Angle/Oriented/Affine.lean
+ theorem EuclideanGeometry.oangle_eq_of_parallel
2025-11-26 09:48:50 b815664
feat(AlgebraicTopology): edges and "triangles" in the nerve of a category (#31274)
We study `Edge` and `Edge.CompStruct` in the case of the nerve of a category. In particular, `Edge.CompStruct` are related to commutative triangles.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/SimplicialNerve.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/CompStruct.lean
+ theorem SSet.Edge.CompStruct.d₀
+ theorem SSet.Edge.CompStruct.d₁
+ theorem SSet.Edge.CompStruct.d₂
+/- def SSet.Edge.CompStruct.simplex
+ theorem SSet.Edge.map_edge
+/- def SSet.Edge.mk'
+ def SSet.Edge.mk
+ theorem SSet.Edge.mk_edge
Modified Mathlib/AlgebraicTopology/SimplicialSet/Coskeletal.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/HomotopyCat.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/Nerve.lean
+ def CategoryTheory.nerve.edgeMk
+ theorem CategoryTheory.nerve.edgeMk_edge
+ theorem CategoryTheory.nerve.edgeMk_surjective
+ def CategoryTheory.nerve.homEquiv
+ theorem CategoryTheory.nerve.homEquiv_comp
+ theorem CategoryTheory.nerve.homEquiv_edgeMk
+ theorem CategoryTheory.nerve.homEquiv_edgeMk_map_nerveMap
+ theorem CategoryTheory.nerve.homEquiv_id
+ theorem CategoryTheory.nerve.left_edge
+ theorem CategoryTheory.nerve.mk₁_homEquiv_apply
+ theorem CategoryTheory.nerve.nonempty_compStruct_iff
+ theorem CategoryTheory.nerve.right_edge
+/- theorem CategoryTheory.nerve.δ_obj
+/- theorem CategoryTheory.nerve.δ₀_eq
+ theorem CategoryTheory.nerve.δ₂_two
+ theorem CategoryTheory.nerve.δ₂_zero
+/- theorem CategoryTheory.nerve.σ_obj
+ theorem CategoryTheory.nerve.σ_zero_nerveEquiv_symm
+/- def CategoryTheory.nerveEquiv
Modified Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/StrictSegal.lean
Modified Mathlib/CategoryTheory/ComposableArrows/Basic.lean
+ theorem CategoryTheory.ComposableArrows.ext₂_of_arrow
+ theorem CategoryTheory.ComposableArrows.mk₁_comp_eqToHom
+ theorem CategoryTheory.ComposableArrows.mk₁_eqToHom_comp
+ theorem CategoryTheory.ComposableArrows.mk₁_hom
2025-11-26 08:45:01 07e962f
feat: the empty line in commands linter (#25945)
This linter flags empty lines within a command.
It allows empty lines within doc-strings, module-docs and a couple of other "sensible" places.
It also skips files that are likely to contain meta-code, since there the use of empty lines in definition is more widespread.
This PR continues the work from #25236.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/Analysis/Meromorphic/FactorizedRational.lean
Modified Mathlib/CategoryTheory/Comma/StructuredArrow/CommaMap.lean
Modified Mathlib/CategoryTheory/Monoidal/Opposite/Mon_.lean
Modified Mathlib/Combinatorics/Enumerative/Bell.lean
Modified Mathlib/Data/UInt.lean
Modified Mathlib/GroupTheory/Perm/MaximalSubgroups.lean
Modified Mathlib/Init.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean
Modified Mathlib/RingTheory/Flat/TorsionFree.lean
Modified Mathlib/RingTheory/HahnSeries/HahnEmbedding.lean
Modified Mathlib/Tactic.lean
Added Mathlib/Tactic/Linter/EmptyLine.lean
+ def Lean.Substring.Raw.getRange
+ def Lean.Syntax.Mathlib.Linter.EmptyLine.emptyLineLinter
+ def Lean.Syntax.filter
+ def Lean.Syntax.filterMap
+ def Lean.Syntax.filterMapM
Added MathlibTest/EmptyLine.lean
+ structure F
+ def F₀
+ structure WithAString
2025-11-26 08:20:32 26d3df1
feat(LinearAlgebra/SymmetricAlgebra): IsSymmetricAlgebra (#27308)
This PR continues the work from #24602.
Original PR: https://github.com/leanprover-community/mathlib4/pull/24602
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/SymmetricAlgebra/Basic.lean
+ theorem IsSymmetricAlgebra.algHom_ext
+ theorem IsSymmetricAlgebra.comp_equiv
+ theorem IsSymmetricAlgebra.equiv_apply
+ theorem IsSymmetricAlgebra.equiv_symm_apply
+ theorem IsSymmetricAlgebra.equiv_symm_comp
+ theorem IsSymmetricAlgebra.equiv_toAlgHom
+ theorem IsSymmetricAlgebra.induction
+ theorem IsSymmetricAlgebra.lift_comp_linearMap
+ theorem IsSymmetricAlgebra.lift_eq
+ theorem IsSymmetricAlgebra.lift_unique
+ theorem IsSymmetricAlgebra.of_equiv
+ def IsSymmetricAlgebra
+ theorem SymmetricAlgebra.isSymmetricAlgebra_ι
Modified Mathlib/LinearAlgebra/SymmetricAlgebra/Basis.lean
+ theorem SymmetricAlgebra.IsSymmetricAlgebra.mvPolynomial
2025-11-26 07:51:50 5f59d4e
feat(Mathlib/Geometry/Euclidean/Triangle): oriented converse of pons asinorum (#32029)
We have pons asinorum for both oriented and unoriented angles, but the converse only for unoriented angles. Add the converse for oriented angles (where the hypothesis uses equality of angles mod π, as that's often more convenient to prove than equality mod 2π, and in fact it implies equality mod 2π in this context).
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Triangle.lean
+ theorem EuclideanGeometry.dist_eq_of_two_zsmul_oangle_eq
+ theorem Orientation.norm_eq_of_two_zsmul_oangle_sub_eq
2025-11-26 07:51:48 6bb1e61
feat(Topology/UniformSpace/Closeds): uniform continuity of union (#32011)
ESTIMATED CHANGES
Modified Mathlib/Topology/UniformSpace/Closeds.lean
+ theorem TopologicalSpace.Closeds.uniformContinuous_sup
+ theorem TopologicalSpace.Compacts.uniformContinuous_sup
+ theorem TopologicalSpace.NonemptyCompacts.uniformContinuous_sup
+ theorem UniformContinuous.sup_closeds
+ theorem UniformContinuous.sup_compacts
+ theorem UniformContinuous.sup_nonemptyCompacts
+ theorem UniformSpace.hausdorff.uniformContinuous_union
+ theorem union_mem_hausdorffEntourage
2025-11-26 07:51:45 5d8e98d
feat(Analysis): the Sequential Banach-Alaoglu theorem (#31656)
Add the sequential Banach-Alaoglu theorem: closed balls of the dual of a separable
normed space are sequentially compact in the weak-* topology.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Normed/Module/WeakDual.lean
+ theorem WeakDual.exists_countable_separating
+ theorem WeakDual.isSeqCompact_closedBall
+ theorem WeakDual.isSeqCompact_of_isBounded_of_isClosed
+ theorem WeakDual.isSeqCompact_polar
+ theorem WeakDual.metrizable_of_isCompact
2025-11-26 07:04:10 e107beb
feat: allow `grind` to unfold `abs` (#31935)
Following discussion on [zulip](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/.22Missing.20Tactics.22.20list/near/558745339)[#general > "Missing Tactics" list @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/.22Missing.20Tactics.22.20list/near/558745339).
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Group/Unbundled/Abs.lean
Added MathlibTest/grind/linarith.lean
2025-11-26 06:47:59 5334b1e
chore(Topology/UniformSpace/Closeds): rename `UniformSpace.hausdorff.isClosed_powerset` to `IsClosed.powerset_hausdorff` (#32022)
The new name is analogous to the one for `TotallyBounded` and allows using dot notation.
ESTIMATED CHANGES
Modified Mathlib/Topology/UniformSpace/Closeds.lean
+ theorem IsClosed.powerset_hausdorff
- theorem UniformSpace.hausdorff.isClosed_powerset
2025-11-26 06:47:57 b2345a4
feat(HaarToSphere): add an `IsOpenPosMeasure` instance (#31966)
... for `Measure.toSphere μ`.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Constructions/HaarToSphere.lean
2025-11-26 06:17:33 6afe337
chore: reverse the directions of Path.symm_cast and trans_cast (#31575)
It seems Mathlib doesn't mind currently which way these go, but pushing casts inwards is better for me.
Note: Proofs in this PR were developed with assistance from Claude.
ESTIMATED CHANGES
Modified Mathlib/Topology/Path.lean
+ theorem Path.cast_symm
+ theorem Path.cast_trans
2025-11-26 06:17:31 01e172e
feat(HasSumUniformlyOn): generalize theorem (#31313)
Drop the `T2Space` assumption which was never really needed in `MultipliableUniformlyOn.hasProdUniformlyOn` and `SummableUniformlyOn.hasSumUniformlyOn`.
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/InfiniteSum/UniformOn.lean
+/- theorem MultipliableLocallyUniformly.hasProdLocallyUniformly
+/- theorem MultipliableLocallyUniformlyOn.hasProdLocallyUniformlyOn
+/- theorem MultipliableLocallyUniformlyOn_congr
+/- theorem MultipliableUniformly.hasProdUniformly
+/- theorem MultipliableUniformlyOn.hasProdUniformlyOn
+/- theorem multipliableLocallyUniformlyOn_iff_hasProdLocallyUniformlyOn
+/- theorem multipliableLocallyUniformlyOn_of_of_forall_exists_nhds
+/- theorem multipliableLocallyUniformly_iff_hasProdLocallyUniformly
+/- theorem multipliableLocallyUniformly_of_of_forall_exists_nhds
- theorem multipliableUniformlyOn_iff_hasProdUniformlyOn
+/- theorem multipliableUniformly_iff_hasProdUniformly
Modified Mathlib/Topology/UniformSpace/LocallyUniformConvergence.lean
+ theorem TendstoLocallyUniformly.congr
+ theorem TendstoLocallyUniformly.congr_inseparable
+ theorem TendstoLocallyUniformly.congr_inseparable_right
+ theorem TendstoLocallyUniformly.congr_right
+ theorem TendstoLocallyUniformlyOn.congr_inseparable
+ theorem TendstoLocallyUniformlyOn.congr_inseparable_right
Modified Mathlib/Topology/UniformSpace/UniformConvergence.lean
+ theorem TendstoUniformlyOn.congr_inseparable
+ theorem TendstoUniformlyOn.congr_inseparable_right
+ theorem TendstoUniformlyOnFilter.congr_inseparable
+ theorem tendstoUniformly_congr_inseparable
2025-11-26 05:44:55 46c21b0
feat(Algebra/Polynomial/Factors): Composition with negation of `X` is multiplicative (#32121)
This PR proves `(p * q).comp (-X) = p.comp (-X) * q.comp (-X)` for rings (possibly noncommutative) and deduces that `f.Splits` implies `(f.comp (-X)).Splits`.
This generalizes the current theorem `Polynomial.Splits.comp_neg_X` so that the coefficients may be taken from a `Ring` instead of a `Field`
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Eval/Defs.lean
+ theorem Polynomial.mul_comp_neg_X
Modified Mathlib/Algebra/Polynomial/Factors.lean
+ theorem Polynomial.Splits.comp_neg_X
Modified Mathlib/Algebra/Polynomial/Splits.lean
- theorem Polynomial.Splits.comp_neg_X
2025-11-26 05:17:20 52a3c07
doc(Topology/Order/IntermediateValue): polish docstrings (#31969)
Issues found and fixed with help from Codex.
ESTIMATED CHANGES
Modified Mathlib/Topology/Order/IntermediateValue.lean
2025-11-26 03:58:31 bebc23c
feat(Matrix): Kill todo in `Analysis.CStarAlgebra.Matrix` (#31939)
ESTIMATED CHANGES
Modified Mathlib/Analysis/CStarAlgebra/Matrix.lean
+ theorem Matrix.l2_opNNNorm_diagonal
+ theorem Matrix.l2_opNorm_diagonal
+ theorem Matrix.l2_opNorm_toEuclideanCLM
2025-11-26 02:38:41 6647d12
feat(LinearAlgebra/Matrix/ToLin): `star A.toLin' = (A.map star).toLin'` (intrinsic star) (#31221)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Star/LinearMap.lean
+ theorem LinearMap.IntrinsicStar.isSelfAdjoint_iff_map_star
+ theorem LinearMap.IntrinsicStar.isSelfAdjoint_iff_toMatrix'
- theorem LinearMap.isSelfAdjoint_iff_map_star
+ theorem LinearMap.toMatrix'_intrinsicStar
+ theorem Matrix.IntrinsicStar.isSelfAdjoint_toLin'_iff
+ theorem Matrix.intrinsicStar_toLin'
2025-11-26 02:38:39 7a0e478
feat(CStarAlgebra): the log is operator monotone (#30894)
This PR shows that the logarithm is operator monotone, i.e. `CFC.log` is monotone on `{a : A | IsStrictlyPositive a}` where `A` is a unital C*-algebra.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Complex/Exponential.lean
+ theorem Real.norm_exp_sub_one_sub_id_le
Added Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog/Order.lean
+ theorem CFC.log_le_log
+ theorem CFC.log_monotoneOn
+ theorem CFC.tendsto_cfc_rpow_sub_one_log
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean
+ theorem CFC.rpow_eq_cfc_real
Added Mathlib/Analysis/SpecialFunctions/Log/RpowTendsto.lean
+ theorem Real.norm_inv_mul_rpow_sub_one_sub_log_le
+ theorem Real.tendstoLocallyUniformlyOn_rpow_sub_one_log
+ theorem tendsto_rpow_sub_one_log
2025-11-26 01:45:31 483cf36
feat(DifferentialForm): pullback commutes with exterior derivative (#30871)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/DifferentialForm/Basic.lean
+ theorem extDerivWithin_pullback
+ theorem extDeriv_pullback
Modified Mathlib/Analysis/Normed/Module/Alternating/Basic.lean
+ theorem ContinuousAlternatingMap.compContinuousLinearMapCLM_apply
+ def ContinuousAlternatingMap.fderivCompContinuousLinearMapCLM
+ theorem ContinuousAlternatingMap.fderivCompContinuousLinearMapCLM_apply
+ theorem ContinuousAlternatingMap.fderivCompContinuousLinearMap_of_isEmpty
Modified Mathlib/Analysis/Normed/Module/Alternating/Uncurry/Fin.lean
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_alternatizeUncurryFinCLM_comp_apply
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_fderivCompContinuousLinearMap_eq_zero
+ theorem ContinuousAlternatingMap.fderivCompContinuousLinearMap_eq_alternatizeUncurryFin
Modified Mathlib/Data/Fin/Tuple/Basic.lean
+ theorem Fin.removeNth_fun_const
Modified Mathlib/LinearAlgebra/Alternating/Uncurry/Fin.lean
2025-11-26 01:16:14 0ceb38e
chore: use generic `map_X` lemmas where possible (#31244)
While thinking about grind annotations for homomorphisms, it occurs to me that automation is more likely when we use the generic, rather than namespaced, lemmas where possible. This is some cleanup in that direction.
ESTIMATED CHANGES
Modified Archive/Examples/Eisenstein.lean
Modified Archive/Wiedijk100Theorems/Partition.lean
Modified Counterexamples/CliffordAlgebraNotInjective.lean
Modified Counterexamples/DirectSumIsInternal.lean
Modified Counterexamples/Phillips.lean
Modified Mathlib/Algebra/Algebra/Tower.lean
Modified Mathlib/Algebra/Category/Grp/FilteredColimits.lean
Modified Mathlib/Algebra/Category/Grp/Images.lean
Modified Mathlib/Algebra/Category/Grp/ZModuleEquivalence.lean
Modified Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean
Modified Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean
Modified Mathlib/Algebra/Category/ModuleCat/Images.lean
Modified Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean
Modified Mathlib/Algebra/Category/MonCat/FilteredColimits.lean
Modified Mathlib/Algebra/CharP/Pi.lean
Modified Mathlib/Algebra/CharP/Subring.lean
Modified Mathlib/Algebra/Colimit/Module.lean
Modified Mathlib/Algebra/Colimit/Ring.lean
Modified Mathlib/Algebra/CubicDiscriminant.lean
Modified Mathlib/Algebra/DirectSum/Algebra.lean
Modified Mathlib/Algebra/DirectSum/Basic.lean
Modified Mathlib/Algebra/DirectSum/Ring.lean
Modified Mathlib/Algebra/Exact.lean
Modified Mathlib/Algebra/FreeAbelianGroup/Finsupp.lean
Modified Mathlib/Algebra/FreeMonoid/Basic.lean
Modified Mathlib/Algebra/GCDMonoid/Basic.lean
Modified Mathlib/Algebra/Group/ForwardDiff.lean
Modified Mathlib/Algebra/Group/Hom/Defs.lean
Modified Mathlib/Algebra/Group/Prod.lean
Modified Mathlib/Algebra/Group/Subgroup/Pointwise.lean
Modified Mathlib/Algebra/Group/Submonoid/Pointwise.lean
Modified Mathlib/Algebra/GroupWithZero/Action/End.lean
Modified Mathlib/Algebra/GroupWithZero/Subgroup.lean
Modified Mathlib/Algebra/GroupWithZero/Submonoid/Pointwise.lean
Modified Mathlib/Algebra/Homology/ComplexShapeSigns.lean
Modified Mathlib/Algebra/Homology/Homotopy.lean
Modified Mathlib/Algebra/Lie/BaseChange.lean
Modified Mathlib/Algebra/Lie/Basic.lean
Modified Mathlib/Algebra/Lie/Character.lean
Modified Mathlib/Algebra/Lie/DirectSum.lean
Modified Mathlib/Algebra/Lie/Free.lean
Modified Mathlib/Algebra/Lie/TensorProduct.lean
Modified Mathlib/Algebra/Lie/TraceForm.lean
Modified Mathlib/Algebra/Lie/Weights/Basic.lean
Modified Mathlib/Algebra/Lie/Weights/Cartan.lean
Modified Mathlib/Algebra/Module/Equiv/Basic.lean
Modified Mathlib/Algebra/Module/Injective.lean
Modified Mathlib/Algebra/Module/LinearMap/Defs.lean
- theorem LinearMap.map_eq_zero_iff
Modified Mathlib/Algebra/Module/LinearMap/End.lean
Modified Mathlib/Algebra/Module/LocalizedModule/Basic.lean
Modified Mathlib/Algebra/Module/LocalizedModule/Exact.lean
Modified Mathlib/Algebra/Module/Submodule/Bilinear.lean
Modified Mathlib/Algebra/Module/Submodule/Ker.lean
Modified Mathlib/Algebra/Module/Submodule/LinearMap.lean
Modified Mathlib/Algebra/Module/ZLattice/Covolume.lean
Modified Mathlib/Algebra/MonoidAlgebra/Grading.lean
Modified Mathlib/Algebra/MvPolynomial/CommRing.lean
Modified Mathlib/Algebra/MvPolynomial/Derivation.lean
Modified Mathlib/Algebra/MvPolynomial/Equiv.lean
Modified Mathlib/Algebra/MvPolynomial/Eval.lean
Modified Mathlib/Algebra/MvPolynomial/Funext.lean
Modified Mathlib/Algebra/MvPolynomial/Monad.lean
Modified Mathlib/Algebra/Order/CompleteField.lean
Modified Mathlib/Algebra/Polynomial/Basic.lean
Modified Mathlib/Algebra/Polynomial/Coeff.lean
Modified Mathlib/Algebra/Polynomial/Degree/Lemmas.lean
Modified Mathlib/Algebra/Polynomial/DenomsClearable.lean
Modified Mathlib/Algebra/Polynomial/Derivative.lean
Modified Mathlib/Algebra/Polynomial/Eval/Coeff.lean
Modified Mathlib/Algebra/Polynomial/Eval/Defs.lean
Modified Mathlib/Algebra/Polynomial/FieldDivision.lean
Modified Mathlib/Algebra/Polynomial/Lifts.lean
Modified Mathlib/Algebra/Polynomial/Monic.lean
Modified Mathlib/Algebra/Polynomial/Roots.lean
Modified Mathlib/Algebra/Quandle.lean
Modified Mathlib/Algebra/Ring/Action/Basic.lean
Modified Mathlib/Algebra/Ring/Action/End.lean
Modified Mathlib/Algebra/RingQuot.lean
Modified Mathlib/Algebra/Star/TensorProduct.lean
Modified Mathlib/Algebra/TrivSqZeroExt.lean
Modified Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean
Modified Mathlib/AlgebraicGeometry/Modules/Tilde.lean
Modified Mathlib/AlgebraicGeometry/Properties.lean
Modified Mathlib/AlgebraicGeometry/StructureSheaf.lean
Modified Mathlib/Analysis/BoxIntegral/Basic.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean
Modified Mathlib/Analysis/CStarAlgebra/Matrix.lean
Modified Mathlib/Analysis/Calculus/ContDiff/Basic.lean
Modified Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean
Modified Mathlib/Analysis/Calculus/Deriv/Basic.lean
Modified Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean
Modified Mathlib/Analysis/Calculus/InverseFunctionTheorem/ApproximatesLinearOn.lean
Modified Mathlib/Analysis/Calculus/Taylor.lean
Modified Mathlib/Analysis/Complex/Harmonic/Analytic.lean
Modified Mathlib/Analysis/Complex/Isometry.lean
Modified Mathlib/Analysis/Complex/Norm.lean
Modified Mathlib/Analysis/Complex/Polynomial/Basic.lean
Modified Mathlib/Analysis/Complex/Trigonometric.lean
Modified Mathlib/Analysis/Convolution.lean
Modified Mathlib/Analysis/Fourier/BoundedContinuousFunctionChar.lean
Modified Mathlib/Analysis/Fourier/FourierTransform.lean
Modified Mathlib/Analysis/Fourier/FourierTransformDeriv.lean
Modified Mathlib/Analysis/InnerProductSpace/Adjoint.lean
Modified Mathlib/Analysis/InnerProductSpace/Basic.lean
Modified Mathlib/Analysis/InnerProductSpace/Defs.lean
Modified Mathlib/Analysis/InnerProductSpace/Dual.lean
Modified Mathlib/Analysis/InnerProductSpace/LinearMap.lean
Modified Mathlib/Analysis/InnerProductSpace/LinearPMap.lean
Modified Mathlib/Analysis/InnerProductSpace/Symmetric.lean
Modified Mathlib/Analysis/InnerProductSpace/TwoDim.lean
Modified Mathlib/Analysis/InnerProductSpace/l2Space.lean
Modified Mathlib/Analysis/LocallyConvex/ContinuousOfBounded.lean
Modified Mathlib/Analysis/Normed/Group/SemiNormedGrp/Kernels.lean
Modified Mathlib/Analysis/Normed/Module/Basic.lean
Modified Mathlib/Analysis/Normed/Module/HahnBanach.lean
Modified Mathlib/Analysis/Normed/Module/RCLike/Basic.lean
Modified Mathlib/Analysis/Normed/Operator/Bilinear.lean
Modified Mathlib/Analysis/Normed/Operator/Extend.lean
Modified Mathlib/Analysis/Normed/Operator/Mul.lean
Modified Mathlib/Analysis/Normed/Unbundled/FiniteExtension.lean
Modified Mathlib/Analysis/Normed/Unbundled/IsPowMulFaithful.lean
Modified Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean
Modified Mathlib/Analysis/RCLike/Basic.lean
Modified Mathlib/Analysis/SpecialFunctions/Complex/CircleAddChar.lean
Modified Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean
Modified Mathlib/CategoryTheory/Abelian/GrothendieckCategory/ModuleEmbedding/GabrielPopescu.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Images.lean
Modified Mathlib/CategoryTheory/SingleObj.lean
Modified Mathlib/Data/Complex/Basic.lean
Modified Mathlib/Data/DFinsupp/BigOperators.lean
Modified Mathlib/Data/Real/ENatENNReal.lean
Modified Mathlib/Data/ZMod/Basic.lean
Modified Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean
Modified Mathlib/FieldTheory/AbelRuffini.lean
Modified Mathlib/FieldTheory/Finite/Basic.lean
Modified Mathlib/FieldTheory/Finite/Polynomial.lean
Modified Mathlib/FieldTheory/Fixed.lean
Modified Mathlib/FieldTheory/IsAlgClosed/Basic.lean
Modified Mathlib/FieldTheory/IsSepClosed.lean
Modified Mathlib/FieldTheory/Minpoly/Basic.lean
Modified Mathlib/FieldTheory/Minpoly/Field.lean
Modified Mathlib/FieldTheory/PrimitiveElement.lean
Modified Mathlib/FieldTheory/PurelyInseparable/Exponent.lean
Modified Mathlib/FieldTheory/RatFunc/Basic.lean
Modified Mathlib/FieldTheory/RatFunc/Defs.lean
Modified Mathlib/FieldTheory/Separable.lean
Modified Mathlib/Geometry/Euclidean/Angle/Oriented/Rotation.lean
Modified Mathlib/Geometry/Euclidean/MongePoint.lean
Modified Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean
Modified Mathlib/Geometry/Manifold/LocalDiffeomorph.lean
Modified Mathlib/Geometry/Manifold/VectorField/LieBracket.lean
Modified Mathlib/Geometry/RingedSpace/Basic.lean
Modified Mathlib/GroupTheory/Abelianization/Defs.lean
Modified Mathlib/GroupTheory/Congruence/Basic.lean
Modified Mathlib/GroupTheory/CoprodI.lean
Modified Mathlib/GroupTheory/FreeAbelianGroup.lean
Modified Mathlib/GroupTheory/FreeGroup/Basic.lean
Modified Mathlib/GroupTheory/MonoidLocalization/Basic.lean
Modified Mathlib/GroupTheory/Nilpotent.lean
Modified Mathlib/GroupTheory/OrderOfElement.lean
Modified Mathlib/GroupTheory/OreLocalization/Basic.lean
Modified Mathlib/GroupTheory/Perm/Sign.lean
Modified Mathlib/GroupTheory/SemidirectProduct.lean
Modified Mathlib/GroupTheory/SpecificGroups/Alternating.lean
Modified Mathlib/GroupTheory/SpecificGroups/Cyclic.lean
Modified Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean
Modified Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean
Modified Mathlib/LinearAlgebra/AffineSpace/Basis.lean
Modified Mathlib/LinearAlgebra/AffineSpace/Combination.lean
Modified Mathlib/LinearAlgebra/Alternating/DomCoprod.lean
Modified Mathlib/LinearAlgebra/Basis/Basic.lean
Modified Mathlib/LinearAlgebra/Basis/Bilinear.lean
Modified Mathlib/LinearAlgebra/Basis/Defs.lean
Modified Mathlib/LinearAlgebra/Basis/Prod.lean
Modified Mathlib/LinearAlgebra/BilinearMap.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Contraction.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Equivs.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Even.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/EvenEquiv.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Grading.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Prod.lean
Modified Mathlib/LinearAlgebra/Complex/Module.lean
Modified Mathlib/LinearAlgebra/Contraction.lean
Modified Mathlib/LinearAlgebra/CrossProduct.lean
Modified Mathlib/LinearAlgebra/DFinsupp.lean
Modified Mathlib/LinearAlgebra/Determinant.lean
Modified Mathlib/LinearAlgebra/Dimension/Free.lean
Modified Mathlib/LinearAlgebra/Dimension/RankNullity.lean
Modified Mathlib/LinearAlgebra/Dual/Basis.lean
Modified Mathlib/LinearAlgebra/Dual/Defs.lean
Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean
Modified Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
Modified Mathlib/LinearAlgebra/ExteriorAlgebra/Basic.lean
+/- theorem ExteriorAlgebra.ι_eq_zero_iff
Modified Mathlib/LinearAlgebra/ExteriorAlgebra/Grading.lean
Modified Mathlib/LinearAlgebra/FiniteDimensional/Basic.lean
Modified Mathlib/LinearAlgebra/FreeModule/Finite/CardQuotient.lean
Modified Mathlib/LinearAlgebra/FreeModule/PID.lean
Modified Mathlib/LinearAlgebra/InvariantBasisNumber.lean
Modified Mathlib/LinearAlgebra/Matrix/Adjugate.lean
Modified Mathlib/LinearAlgebra/Matrix/Basis.lean
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean
Modified Mathlib/LinearAlgebra/Matrix/MvPolynomial.lean
Modified Mathlib/LinearAlgebra/Matrix/Polynomial.lean
Modified Mathlib/LinearAlgebra/Matrix/Rank.lean
Modified Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean
Modified Mathlib/LinearAlgebra/Matrix/ToLin.lean
Modified Mathlib/LinearAlgebra/Matrix/ToLinearEquiv.lean
Modified Mathlib/LinearAlgebra/Multilinear/Basic.lean
Modified Mathlib/LinearAlgebra/PiTensorProduct.lean
Modified Mathlib/LinearAlgebra/Projection.lean
Modified Mathlib/LinearAlgebra/QuadraticForm/Basic.lean
Modified Mathlib/LinearAlgebra/QuadraticForm/Dual.lean
Modified Mathlib/LinearAlgebra/QuadraticForm/TensorProduct.lean
Modified Mathlib/LinearAlgebra/RootSystem/OfBilinear.lean
Modified Mathlib/LinearAlgebra/RootSystem/RootPositive.lean
Modified Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean
Modified Mathlib/LinearAlgebra/StdBasis.lean
Modified Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean
+/- theorem TensorAlgebra.ι_eq_zero_iff
Modified Mathlib/LinearAlgebra/TensorAlgebra/Grading.lean
Modified Mathlib/LinearAlgebra/TensorAlgebra/ToTensorPower.lean
Modified Mathlib/LinearAlgebra/TensorPower/Basic.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Basic.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Graded/External.lean
Modified Mathlib/LinearAlgebra/Trace.lean
Modified Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean
Modified Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean
Modified Mathlib/MeasureTheory/Function/Jacobian.lean
Modified Mathlib/MeasureTheory/Integral/Bochner/ContinuousLinearMap.lean
Modified Mathlib/MeasureTheory/Integral/FinMeasAdditive.lean
Modified Mathlib/MeasureTheory/Integral/SetToL1.lean
Modified Mathlib/MeasureTheory/Measure/Haar/OfBasis.lean
Modified Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean
Modified Mathlib/MeasureTheory/Measure/Map.lean
Modified Mathlib/NumberTheory/ArithmeticFunction.lean
Modified Mathlib/NumberTheory/Bernoulli.lean
Modified Mathlib/NumberTheory/BernoulliPolynomials.lean
Modified Mathlib/NumberTheory/ClassNumber/Finite.lean
Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean
Modified Mathlib/NumberTheory/Cyclotomic/Discriminant.lean
Modified Mathlib/NumberTheory/LucasLehmer.lean
Modified Mathlib/NumberTheory/Modular.lean
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
Modified Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean
Modified Mathlib/NumberTheory/NumberField/FinitePlaces.lean
Modified Mathlib/NumberTheory/NumberField/Ideal/Basic.lean
Modified Mathlib/NumberTheory/NumberField/ProductFormula.lean
Modified Mathlib/NumberTheory/Padics/RingHoms.lean
Modified Mathlib/NumberTheory/RamificationInertia/Basic.lean
Modified Mathlib/NumberTheory/SumTwoSquares.lean
Modified Mathlib/NumberTheory/Zsqrtd/Basic.lean
Modified Mathlib/RepresentationTheory/Homological/Resolution.lean
Modified Mathlib/RepresentationTheory/Invariants.lean
Modified Mathlib/RingTheory/AdicCompletion/Basic.lean
Modified Mathlib/RingTheory/Adjoin/PowerBasis.lean
Modified Mathlib/RingTheory/AdjoinRoot.lean
Modified Mathlib/RingTheory/AlgebraTower.lean
Modified Mathlib/RingTheory/Coalgebra/TensorProduct.lean
Modified Mathlib/RingTheory/Conductor.lean
Modified Mathlib/RingTheory/DedekindDomain/Different.lean
Modified Mathlib/RingTheory/DedekindDomain/Factorization.lean
Modified Mathlib/RingTheory/DedekindDomain/Ideal/Basic.lean
Modified Mathlib/RingTheory/Derivation/Basic.lean
Modified Mathlib/RingTheory/Discriminant.lean
Modified Mathlib/RingTheory/Etale/Kaehler.lean
Modified Mathlib/RingTheory/Extension/Cotangent/Basic.lean
Modified Mathlib/RingTheory/FractionalIdeal/Basic.lean
Modified Mathlib/RingTheory/FractionalIdeal/Extended.lean
Modified Mathlib/RingTheory/FractionalIdeal/Operations.lean
Modified Mathlib/RingTheory/FreeCommRing.lean
Modified Mathlib/RingTheory/HahnSeries/Summable.lean
Modified Mathlib/RingTheory/Henselian.lean
Modified Mathlib/RingTheory/Ideal/Over.lean
Modified Mathlib/RingTheory/Ideal/Quotient/Operations.lean
Modified Mathlib/RingTheory/IntegralClosure/IsIntegral/Basic.lean
Modified Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean
Modified Mathlib/RingTheory/Kaehler/Basic.lean
Modified Mathlib/RingTheory/Kaehler/JacobiZariski.lean
Modified Mathlib/RingTheory/Kaehler/Polynomial.lean
Modified Mathlib/RingTheory/Kaehler/TensorProduct.lean
Modified Mathlib/RingTheory/LaurentSeries.lean
Modified Mathlib/RingTheory/LocalProperties/Reduced.lean
Modified Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean
Modified Mathlib/RingTheory/Localization/Basic.lean
Modified Mathlib/RingTheory/Localization/Defs.lean
Modified Mathlib/RingTheory/Localization/Ideal.lean
Modified Mathlib/RingTheory/Localization/Integer.lean
Modified Mathlib/RingTheory/Localization/Integral.lean
Modified Mathlib/RingTheory/Localization/LocalizationLocalization.lean
Modified Mathlib/RingTheory/Localization/NumDen.lean
Modified Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean
Modified Mathlib/RingTheory/MvPowerSeries/Basic.lean
Modified Mathlib/RingTheory/MvPowerSeries/Order.lean
Modified Mathlib/RingTheory/NoetherNormalization.lean
Modified Mathlib/RingTheory/Norm/Basic.lean
Modified Mathlib/RingTheory/Norm/Transitivity.lean
Modified Mathlib/RingTheory/Nullstellensatz.lean
Modified Mathlib/RingTheory/OreLocalization/Ring.lean
Modified Mathlib/RingTheory/Perfection.lean
Modified Mathlib/RingTheory/Polynomial/Basic.lean
Modified Mathlib/RingTheory/Polynomial/Content.lean
Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean
Modified Mathlib/RingTheory/Polynomial/Eisenstein/Basic.lean
Modified Mathlib/RingTheory/Polynomial/Eisenstein/IsIntegral.lean
Modified Mathlib/RingTheory/Polynomial/GaussLemma.lean
Modified Mathlib/RingTheory/Polynomial/Quotient.lean
Modified Mathlib/RingTheory/PolynomialAlgebra.lean
Modified Mathlib/RingTheory/PowerBasis.lean
Modified Mathlib/RingTheory/PowerSeries/Basic.lean
Modified Mathlib/RingTheory/PowerSeries/Order.lean
Modified Mathlib/RingTheory/RootsOfUnity/Basic.lean
Modified Mathlib/RingTheory/TensorProduct/Basic.lean
Modified Mathlib/RingTheory/Trace/Basic.lean
Modified Mathlib/RingTheory/Valuation/Integers.lean
Modified Mathlib/RingTheory/Valuation/ValuationRing.lean
Modified Mathlib/RingTheory/WittVector/Compare.lean
Modified Mathlib/RingTheory/WittVector/Defs.lean
Modified Mathlib/RingTheory/WittVector/Frobenius.lean
Modified Mathlib/RingTheory/WittVector/FrobeniusFractionField.lean
Modified Mathlib/RingTheory/WittVector/InitTail.lean
Modified Mathlib/RingTheory/WittVector/IsPoly.lean
Modified Mathlib/RingTheory/WittVector/Isocrystal.lean
Modified Mathlib/RingTheory/WittVector/StructurePolynomial.lean
Modified Mathlib/RingTheory/WittVector/Teichmuller.lean
Modified Mathlib/RingTheory/WittVector/Truncated.lean
Modified Mathlib/RingTheory/WittVector/WittPolynomial.lean
Modified Mathlib/Topology/Algebra/Module/Basic.lean
Modified Mathlib/Topology/Algebra/Module/LinearMap.lean
Modified Mathlib/Topology/Algebra/Module/WeakBilin.lean
Modified Mathlib/Topology/Category/Profinite/Nobeling/Successor.lean
Modified Mathlib/Topology/ContinuousMap/CompactlySupported.lean
Modified Mathlib/Topology/ContinuousMap/Polynomial.lean
Modified Mathlib/Topology/Sheaves/CommRingCat.lean
2025-11-25 23:45:46 760a178
feat(Topology): prod/sum of UniformContinuous function is UniformContinuous (#32082)
The big operator version of `UniformContinuous.mul`.
This seems to be the only lemma that requires `[CommGroup α]` over `[Group α]` in the section, so I just declare all type variables ad-hoc to preserve the desired parameter order
A --ψ--> A --φ--> A --ψ--> A ⟶ 0`.
When `G` is finite and generated by `g : G`, then `P := Chains(k[G], N, ρ(g) - Id)` (with `ρ` the left regular representation) is a projective resolution of `k` as a trivial representation.
In this PR we show that for `A : Rep k G`, `(A ⊗ P)_G` is isomorphic to `Chains(A, N, ρ_A(g) - Id)` as a complex of `k`-modules, and hence the homology of this complex computes group homology.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/RepresentationTheory/Homological/FiniteCyclic.lean
Added Mathlib/RepresentationTheory/Homological/GroupHomology/FiniteCyclic.lean
+ theorem Rep.FiniteCyclicGroup.groupHomologyπEven_eq_iff
+ theorem Rep.FiniteCyclicGroup.groupHomologyπEven_eq_zero_iff
+ theorem Rep.FiniteCyclicGroup.groupHomologyπOdd_eq_iff
+ theorem Rep.FiniteCyclicGroup.groupHomologyπOdd_eq_zero_iff
2025-10-28 10:18:10 50818a5
feat(RingTheory): a semiprimary ring is Noetherian/Artinian iff its Jacobson radical is fg (#22151)
A key fact used is `Module.FG.smul`: if `I` is a two-sided ideal of `R` that is f.g. as a left ideal and `N` is a f.g. `R`-module, then `I • M` is also a f.g. `R`-module.
Many lemmas about coprimality of ideals are also generalized to the noncommutative, two-sided setting.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Operations.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean
Modified Mathlib/NumberTheory/RamificationInertia/Basic.lean
Modified Mathlib/RingTheory/Extension/Basic.lean
Modified Mathlib/RingTheory/Finiteness/Basic.lean
+ theorem Ideal.fg_top
Modified Mathlib/RingTheory/Finiteness/Ideal.lean
+ theorem Ideal.FG.mul
+ theorem Ideal.FG.pow
+ theorem Submodule.FG.smul
Modified Mathlib/RingTheory/HopkinsLevitzki.lean
+ theorem IsSemiprimaryRing.isNoetherianRing_iff_jacobson_fg
+ theorem IsSemiprimaryRing.isNoetherian_iff_finite_of_jacobson_fg
Modified Mathlib/RingTheory/Ideal/Maps.lean
Modified Mathlib/RingTheory/Ideal/Operations.lean
+/- theorem Ideal.iInf_sup_eq_top
+/- theorem Ideal.mem_mul_span_singleton
+/- theorem Ideal.mul_le_inf
+/- theorem Ideal.mul_sup_eq_of_coprime_left
+/- theorem Ideal.mul_sup_eq_of_coprime_right
+/- theorem Ideal.mul_top
+/- theorem Ideal.natCast_eq_top
+ theorem Ideal.pow_sup_eq_top'
+/- theorem Ideal.pow_sup_eq_top
+ theorem Ideal.pow_sup_pow_eq_top'
+/- theorem Ideal.pow_sup_pow_eq_top
+/- theorem Ideal.span_mul_span'
+/- theorem Ideal.span_mul_span
+/- theorem Ideal.span_pair_mul_span_pair
+/- theorem Ideal.span_singleton_mul_left_inj
+/- theorem Ideal.span_singleton_mul_left_mono
+/- theorem Ideal.span_singleton_mul_span_singleton
+/- theorem Ideal.span_singleton_pow
+/- theorem Ideal.sup_iInf_eq_top
+/- theorem Ideal.sup_mul_eq_of_coprime_left
+/- theorem Ideal.sup_mul_eq_of_coprime_right
+ theorem Ideal.sup_pow_eq_top'
+/- theorem Ideal.sup_pow_eq_top
+/- theorem Submodule.mem_smul_span_singleton
+/- theorem Submodule.span_smul_span
2025-10-28 09:17:55 ed54e09
feat: missing basic API for uniformly continuous functions (#30977)
ESTIMATED CHANGES
Modified Mathlib/Topology/MetricSpace/Pseudo/Defs.lean
+ theorem Metric.uniformContinuous_iff_le
Modified Mathlib/Topology/UniformSpace/Basic.lean
+ theorem UniformContinuousOn.congr
2025-10-28 09:17:53 bcc52d7
perf(MeasureTheory/Measure/Restrict): make `restrictₗ` irreducible (#30968)
This makes failing unification problems involving `Measure.restrict` significantly faster.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Measure/Restrict.lean
2025-10-28 09:17:51 af1138b
feat: linters to try hammers at every step (#30808)
This PR adds three linters which respectively try running `simp_all`, `aesop`, and `grind` at each step in Mathlib. The intention is not to look at individual outputs and make replacements, but rather to use these as baselines for premise selection algorithm comparisons.
In https://github.com/leanprover/lean4/pull/10920 I'm adding `grind +premises` (and I'd like to do the same with `simp_all` and `aesop`), and we can then measure how different premise selection algorithms compare at library scale.
ESTIMATED CHANGES
Modified Mathlib/Tactic/Core.lean
Modified Mathlib/Tactic/TacticAnalysis/Declarations.lean
+ def tryAtEachStep
+ def tryAtEachStepAesop
+ def tryAtEachStepGrind
+ def tryAtEachStepGrindPremises
+ def tryAtEachStepSimpAll
Modified MathlibTest/TacticAnalysis.lean
+ def P
+ theorem p
Added MathlibTest/tryAtEachStep.lean
+ theorem foo
Modified scripts/noshake.json
2025-10-28 09:17:49 e963315
feat: further extensions of the differential geometry elaborators (#30413)
Also infer the model with corners on
- a space of continuous linear equivalences
- a closed real interval (Set.Icc)
- the complex upper half plane
And add elaborators for `HasMFDeriv(Within)At` analogous to the `mfderiv(Within)` ones.
Further cases, as well as products, disjoint unions or open subsets, will be covered in future PRs.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Manifold/Notation.lean
Modified MathlibTest/DifferentialGeometry/Notation.lean
Modified MathlibTest/DifferentialGeometry/NotationAdvanced.lean
+ def RealCopy'
+ def RealCopy
+ def id'
2025-10-28 09:17:47 9859788
feat: behavior of divisors when taking powers of meromorphic functions (#30238)
Establish the behavior of divisors when taking powers of meromorphic functions. For consistency, provide `_fun`-versions of several simple lemmas.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/WithTop/Untop0.lean
+ theorem WithTop.untop₀_natCast
+ theorem WithTop.untop₀_ofNat
Modified Mathlib/Analysis/Meromorphic/Divisor.lean
+ theorem MeromorphicOn.divisor_const
+ theorem MeromorphicOn.divisor_fun_inv
+ theorem MeromorphicOn.divisor_fun_mul
+ theorem MeromorphicOn.divisor_fun_pow
+ theorem MeromorphicOn.divisor_fun_smul
+ theorem MeromorphicOn.divisor_fun_zpow
+ theorem MeromorphicOn.divisor_intCast
+ theorem MeromorphicOn.divisor_natCast
+ theorem MeromorphicOn.divisor_ofNat
+ theorem MeromorphicOn.divisor_pow
+ theorem MeromorphicOn.divisor_zpow
Modified Mathlib/Analysis/Meromorphic/FactorizedRational.lean
Modified Mathlib/Analysis/Meromorphic/Order.lean
+ theorem meromorphicOrderAt_const
+ theorem meromorphicOrderAt_const_intCast
+ theorem meromorphicOrderAt_const_natCast
+ theorem meromorphicOrderAt_const_ofNat
2025-10-28 09:17:45 e1e62f4
feat(Topology/Instances): Cantor set is the set of ternary numbers without `1`s (#26096)
* Prove `ofDigits_zero_two_sequence_mem_cantorSet`: If `x = 0.d₀d₁...` in base-3, and none of the digits `dᵢ` is `1`, then `x` belongs to the Cantor set.
* Prove `ofDigits_zero_two_sequence_unique`: such a representation is uniquie.
* Define `toTernary` which converts a real number from the Cantor set to its ternary representation without `1`s.
* Prove `ofDigits_cantorToTernary : ofDigits (cantorToTernary x) = x`.
ESTIMATED CHANGES
Modified Mathlib/Topology/Instances/CantorSet.lean
+ theorem cantorSequence_eq_self_sub_sum_cantorToTernary
+ theorem cantorSequence_get_succ
+ theorem cantorSequence_mem_cantorSet
+ theorem cantorSet_eq_zero_two_ofDigits
+ theorem cantorStep_mem_cantorSet
+ theorem cantorToTernary_ne_one
+ theorem le_ofDigits_cantorToTernary_sum
+ theorem ofDigits_cantorToTernary
+ theorem ofDigits_cantorToTernary_sum_le
+ theorem ofDigits_zero_two_sequence_mem_cantorSet
+ theorem ofDigits_zero_two_sequence_unique
Modified scripts/noshake.json
2025-10-28 08:36:31 95e5f68
feat(Topology): Units of nonnegative elements (#30420)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Nonneg/Field.lean
+ def Nonneg.unitsEquivPos
Modified Mathlib/Topology/Algebra/Field.lean
+ def Nonneg.unitsHomeomorphPos
2025-10-28 07:56:30 8367022
chore: two suggestions from the weekly linter (#30992)
From [#mathlib4 > Weekly linting log @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/near/547192939)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/RingTheory/RootsOfUnity/CyclotomicUnits.lean
+/- theorem IsPrimitiveRoot.pow_sub_one_mul_geom_sum_eq_pow_sub_one_mul_geom_sum
2025-10-28 05:30:06 337f3a7
feat(Geometry/Euclidean/Incenter): excenters are distinct (#30938)
Add some lemmas that excenters of a simplex are distinct points, except when they have the same signs up to negating all the signs.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Incenter.lean
+ theorem Affine.Simplex.ExcenterExists.excenterWeights_eq_excenterWeights_iff
+ theorem Affine.Simplex.ExcenterExists.excenter_eq_excenter_iff
+ theorem Affine.Simplex.ExcenterExists.excenter_eq_incenter_iff
+ theorem Affine.Simplex.excenter_singleton_injective
+ theorem Affine.Simplex.excenter_singleton_ne_incenter
2025-10-28 05:30:04 715cc30
feat(Geometry/Euclidean/Projection): projection onto sup (#30703)
Add a lemma that, if the orthogonal projections of a point onto two subspaces are equal, so is the projection onto their supremum.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Projection.lean
+ theorem EuclideanGeometry.orthogonalProjection_sup_of_orthogonalProjection_eq
2025-10-28 05:30:02 8f3ecec
feat(Geometry/Euclidean/Angle/Oriented/RightAngle): angles less than `π / 2` (#30600)
Add a lemma that an oriented angle in a right-angled triangle is less than `π / 2`, even in degenerate cases (there's already a corresponding lemma for unoriented angles, but that one needs to exclude some degenerate cases because of the different default values for oriented and unoriented angles involving zero vectors). Deduce lemmas that, for such angles involved in right-angled triangles, equality of the angles (i.e. equality mod 2π) follows from equality of twice the angles (i.e. equality of the angles mod π).
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Angle/Oriented/RightAngle.lean
+ theorem EuclideanGeometry.abs_oangle_toReal_lt_pi_div_two_of_angle_eq_pi_div_two
+ theorem EuclideanGeometry.oangle_eq_oangle_of_two_zsmul_eq_of_angle_eq_pi_div_two
+ theorem EuclideanGeometry.oangle_eq_oangle_rev_of_two_zsmul_eq_of_angle_eq_pi_div_two
2025-10-28 05:30:00 5ab5c34
feat(Geometry/Euclidean/Projection): `orthogonalProjection_orthogonalProjection_of_le` (#30474)
Add a lemma that `orthogonalProjection s₁ (orthogonalProjection s₂ p) = orthogonalProjection s₁ p` for `s₁ ≤ s₂`. (A similar lemma for projection onto submodules rather than affine subspaces already exists.)
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Projection.lean
+ theorem EuclideanGeometry.orthogonalProjection_orthogonalProjection_of_le
2025-10-28 05:29:58 e6f0e55
feat: define `Star` on tensor products (#27290)
This pr defines the `Star`, `StarAddMonoid`, `StarModule`, `StarMul`, and `StarRing` instances on tensor product spaces.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Algebra/Star/TensorProduct.lean
+ theorem TensorProduct.star_tmul
Modified Mathlib/RingTheory/TensorProduct/Basic.lean
2025-10-28 05:03:08 b9e2532
doc(RingTheory): fix typos (#30710)
Found with help from Codex, curated by me.
I've tried to limit the PR to changes that are easy to verify. Should you find it difficult to review any particular part of this PR, know that I have nothing against trimming this PR down in favor of smaller free-standing PRs for the difficult-to-review parts.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/DividedPowers/Basic.lean
Modified Mathlib/RingTheory/FractionalIdeal/Basic.lean
Modified Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean
Modified Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean
Modified Mathlib/RingTheory/Ideal/Pointwise.lean
Modified Mathlib/RingTheory/Localization/Away/Basic.lean
Modified Mathlib/RingTheory/MvPowerSeries/Order.lean
Modified Mathlib/RingTheory/PowerSeries/Restricted.lean
Modified Mathlib/RingTheory/Valuation/Minpoly.lean
2025-10-28 04:48:09 69d5ad6
fix(Geometry/IsManifold/Basic): fix a typo (#30743)
The same doc-string was copy-pasted twice.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Manifold/IsManifold/Basic.lean
2025-10-28 01:14:59 76badb2
chore: deprecate Function.Involutive.iterate_bit{0,1} (#30986)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/Parity.lean
- theorem Function.Involutive.iterate_bit0
- theorem Function.Involutive.iterate_bit1
+ theorem Function.Involutive.iterate_two_mul_add_one
2025-10-27 22:34:37 0a7fab8
feat(AlgebraicGeometry): global sections of inverse limits of schemes (#30226)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicGeometry/AffineTransitionLimit.lean
+ theorem AlgebraicGeometry.Scheme.compactSpace_of_isLimit
+ theorem AlgebraicGeometry.exists_appTop_map_eq_zero_of_isAffine_of_isLimit
+ theorem AlgebraicGeometry.exists_appTop_map_eq_zero_of_isLimit
+ theorem AlgebraicGeometry.exists_appTop_π_eq_of_isAffine_of_isLimit
+ theorem AlgebraicGeometry.exists_appTop_π_eq_of_isLimit
+ theorem AlgebraicGeometry.exists_app_map_eq_map_of_isLimit
+ theorem AlgebraicGeometry.exists_app_map_eq_zero_of_isLimit
+ theorem AlgebraicGeometry.exists_map_eq_top
+ theorem AlgebraicGeometry.isAffineHom_π_app
+ def AlgebraicGeometry.isLimitOpensCone
+ theorem AlgebraicGeometry.nonempty_isColimit_Γ_mapCocone
+ def AlgebraicGeometry.opensCone
+ def AlgebraicGeometry.opensDiagram
+ def AlgebraicGeometry.opensDiagramι
Modified Mathlib/AlgebraicGeometry/Limits.lean
+ theorem AlgebraicGeometry.Scheme.isAffine_of_isLimit
Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean
+ theorem AlgebraicGeometry.IsOpenImmersion.isPullback
Modified Mathlib/AlgebraicGeometry/Restrict.lean
Added Mathlib/CategoryTheory/Limits/Shapes/Pullback/Connected.lean
+ def CategoryTheory.Limits.isColimitOfIsPushoutOfIsConnected
+ def CategoryTheory.Limits.isLimitOfIsPullbackOfIsConnected
2025-10-27 21:05:24 f1364c9
chore(Data/List): golf entire `nodup_iff_getElem?_ne_getElem?` and `Nodup.pmap` using `grind` (#30961)
ESTIMATED CHANGES
Modified Mathlib/Data/List/Nodup.lean
2025-10-27 21:05:23 e8dba13
chore(Data/Seq): golf `terminates_parallel` using `grind` (#30944)
ESTIMATED CHANGES
Modified Mathlib/Data/Seq/Parallel.lean
2025-10-27 21:05:21 1fbd1af
chore(Data/Prod): golf `toLex_covBy_toLex_iff` using `grind` (#30888)
ESTIMATED CHANGES
Modified Mathlib/Data/Prod/Lex.lean
2025-10-27 21:05:19 d5ebaaf
feat(Probability/Decision): basic properties of the Bayes risk (#29143)
- Comparison of the Bayes risk and the minimax risk
- Maximal value of the Bayes risk and particular cases where it equals that value
- Data-processing inequality
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Probability/Decision/Risk/Basic.lean
+ theorem ProbabilityTheory.avgRisk_const_left'
+ theorem ProbabilityTheory.avgRisk_const_left
+ theorem ProbabilityTheory.avgRisk_const_right'
+ theorem ProbabilityTheory.avgRisk_const_right
+ theorem ProbabilityTheory.avgRisk_le_iSup_risk
+ theorem ProbabilityTheory.avgRisk_le_mul'
+ theorem ProbabilityTheory.avgRisk_le_mul
+ theorem ProbabilityTheory.bayesRisk_compProd_le_bayesRisk
+ theorem ProbabilityTheory.bayesRisk_const'
+ theorem ProbabilityTheory.bayesRisk_const
+ theorem ProbabilityTheory.bayesRisk_const_of_neZero
+ theorem ProbabilityTheory.bayesRisk_const_of_nonempty
+ theorem ProbabilityTheory.bayesRisk_discard
+ theorem ProbabilityTheory.bayesRisk_eq_iInf_measure_of_subsingleton
+ theorem ProbabilityTheory.bayesRisk_le_avgRisk
+ theorem ProbabilityTheory.bayesRisk_le_bayesRisk_comp
+ theorem ProbabilityTheory.bayesRisk_le_bayesRisk_map
+ theorem ProbabilityTheory.bayesRisk_le_iInf'
+ theorem ProbabilityTheory.bayesRisk_le_iInf
+ theorem ProbabilityTheory.bayesRisk_le_minimaxRisk
+ theorem ProbabilityTheory.bayesRisk_le_mul'
+ theorem ProbabilityTheory.bayesRisk_le_mul
+ theorem ProbabilityTheory.bayesRisk_lt_top
+ theorem ProbabilityTheory.bayesRisk_of_subsingleton'
+ theorem ProbabilityTheory.bayesRisk_of_subsingleton
+ theorem ProbabilityTheory.iSup_bayesRisk_le_minimaxRisk
Modified Mathlib/Probability/Decision/Risk/Defs.lean
2025-10-27 20:01:14 0f4d3c5
feat(Order): lemmas about `iSupIndep` (#29791)
* generalize `Finset.SupIndep` "bind" operations from `DistribLattice` to `IsModularLattice`
* new lemma `iSupIndep.iInf`
* more characterizations of `iSupIndep` on submodules:
* `iSupIndep_iff_finset_sum_eq_zero_imp_eq_zero`
* `iSupIndep_iff_finset_sum_eq_imp_eq`
* add `@[simp]` and `@[grind]` attributes which were helpful for these proofs
Original motivation was to have the following fact:
```lean
theorem iSupIndep_iInf_genEigenspace [NoZeroSMulDivisors R M] {α : Type*} (f : α → End R M)
(k : ℕ∞) : iSupIndep fun μ : α → R ↦ ⨅ a : α, ((f a).genEigenspace (μ a)) k :=
.iInf (f · |>.genEigenspace · k) (f · |>.independent_genEigenspace k)
```
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/Disjoint.lean
Modified Mathlib/Data/Finset/Lattice/Fold.lean
Modified Mathlib/Data/Finset/Lattice/Union.lean
+/- theorem Finset.inf_biUnion
Modified Mathlib/Data/Finset/Sigma.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Factors.lean
Modified Mathlib/LinearAlgebra/DFinsupp.lean
+ theorem iSupIndep_iff_finset_sum_eq_imp_eq
+ theorem iSupIndep_iff_finset_sum_eq_zero_imp_eq_zero
Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean
Modified Mathlib/Logic/Embedding/Basic.lean
Modified Mathlib/Order/CompactlyGenerated/Basic.lean
+ theorem iSupIndep.iInf
Modified Mathlib/Order/Partition/Finpartition.lean
Modified Mathlib/Order/SupIndep.lean
+ theorem Finset.SupIndep.mono
+ theorem Finset.supIndep_sigma_iff'
+ theorem iSupIndep.injOn_iInf
+ theorem iSupIndep_subsingleton
2025-10-27 19:39:45 fcfaca0
chore: fix longest pole utilities, and verify in CI (#29967)
We should consider outright deleting these. The fact that they were broken is good evidence they haven't been used recently. Sebastian also has a good replacement available (that is aware of the module system), although I'm not sure it's deployed yet.
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
Modified LongestPole/Main.lean
Modified LongestPole/Unused.lean
2025-10-27 16:35:57 ef9ae2a
feat(gcongr): support `@[gcongr]` for `Monotone` and friends (#28339)
This PR adds the feature to `gcongr` that you can now tag lemmas whose conclusion is `Monotone f`, `Antitone f`, etc.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Floor/Ring.lean
+/- theorem Int.floor_le_floor
Modified Mathlib/Algebra/Order/Floor/Semiring.lean
+/- theorem Nat.floor_le_floor
Modified Mathlib/Algebra/Order/Module/Algebra.lean
+/- theorem algebraMap_mono
+/- theorem algebraMap_strictMono
Modified Mathlib/Algebra/Order/Ring/Cast.lean
Modified Mathlib/Algebra/Ring/Subring/Basic.lean
Modified Mathlib/Analysis/Complex/Exponential.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/ERealExp.lean
+/- theorem EReal.exp_le_exp
+/- theorem EReal.exp_lt_exp
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean
Modified Mathlib/Combinatorics/Extremal/RuzsaSzemeredi.lean
- theorem ruzsaSzemerediNumberNat_le_ruzsaSzemerediNumberNat
+/- theorem ruzsaSzemerediNumberNat_mono
Modified Mathlib/Data/Finsupp/Order.lean
Modified Mathlib/Data/Multiset/Defs.lean
+/- theorem Multiset.card_strictMono
Modified Mathlib/Data/Nat/Cast/Order/Basic.lean
- theorem GCongr.natCast_le_natCast
- theorem GCongr.natCast_lt_natCast
Modified Mathlib/Data/Rat/Cast/Order.lean
Modified Mathlib/Data/Real/Sqrt.lean
Modified Mathlib/LinearAlgebra/Basis/Flag.lean
+/- theorem Module.Basis.flag_le_flag
Modified Mathlib/MeasureTheory/Function/SimpleFunc.lean
Modified Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean
Modified Mathlib/Order/Filter/Map.lean
- theorem GCongr.Filter.comap_le_comap
- theorem GCongr.Filter.map_le_map
Modified Mathlib/Order/Hom/Basic.lean
Modified Mathlib/Order/KrullDimension.lean
Modified Mathlib/Tactic/GCongr/Core.lean
Modified MathlibTest/GCongr/inequalities.lean
+ def GCongrTests.myAnti
+ theorem GCongrTests.myAnti_strictAnti
+ theorem GCongrTests.myAnti_strictAntiOn
+ def GCongrTests.myCons
+ theorem GCongrTests.myCons_antitone
+ theorem GCongrTests.myCons_antitoneOn
+ theorem GCongrTests.myCons_monotone'
+ theorem GCongrTests.myCons_monotone
+ theorem GCongrTests.myCons_monotoneOn
+ def GCongrTests.myMono
+ theorem GCongrTests.myMono_strictMono
+ theorem GCongrTests.myMono_strictMonoOn
2025-10-27 15:32:19 4086670
feat(Geometry/Euclidean/Incenter): `dist_excenter_eq_dist_excenter` (#30935)
Add lemmas
```lean
lemma ExcenterExists.dist_excenter_eq_dist_excenter {signs : Finset (Fin (n + 1))}
(h : s.ExcenterExists signs) (i₁ i₂ : Fin (n + 1)) :
dist (s.excenter signs) (s.touchpoint signs i₁) =
dist (s.excenter signs) (s.touchpoint signs i₂) := by
```
```lean
lemma dist_incenter_eq_dist_incenter (i₁ i₂ : Fin (n + 1)) :
dist s.incenter (s.touchpoint ∅ i₁) = dist s.incenter (s.touchpoint ∅ i₂) :=
```
that an excenter of a simplex is equidistant to any two of its touchpoints. These are trivial variants of the existing lemmas that the distance equals the exradius, but they are useful several times when relating excenters to angle bisection, so it seems worth having them as separate lemmas.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Incenter.lean
+ theorem Affine.Simplex.ExcenterExists.dist_excenter_eq_dist_excenter
+ theorem Affine.Simplex.dist_incenter_eq_dist_incenter
2025-10-27 15:32:17 d1e0be9
feat(Geometry/Euclidean/Incenter): cases for excenters of triangles (#30918)
Add lemmas that all choices of signs give a valid excenter for a triangle, and that any excenter for a triangle is either the incenter or the excenter opposite a vertex.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Incenter.lean
+ theorem Affine.Simplex.excenter_compl
+ theorem Affine.Simplex.exradius_compl
+ theorem Affine.Simplex.exsphere_compl
+ theorem Affine.Triangle.excenterExists
+ theorem Affine.Triangle.excenter_eq_incenter_or_excenter_singleton
+ theorem Affine.Triangle.excenter_eq_incenter_or_excenter_singleton_of_ne
2025-10-27 15:32:15 01318ac
feat(Geometry/Euclidean/Incenter): excenters are not vertices (#30916)
Add lemmas that excenters of a simplex do not equal any of the vertices of that simplex.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Incenter.lean
+ theorem Affine.Simplex.ExcenterExists.affineCombination_eq_excenter_iff
+ theorem Affine.Simplex.ExcenterExists.excenterWeights_ne_zero
+ theorem Affine.Simplex.ExcenterExists.excenter_ne_point
+ theorem Affine.Simplex.excenterWeightsUnnorm_ne_zero
+ theorem Affine.Simplex.incenter_ne_point
2025-10-27 15:32:14 c9becdb
fix(Tactic/Lift): don't clear a variable if it's impossible (#30850)
Closes #19160.
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Finite/Basic.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Basic.lean
Modified Mathlib/Order/WithBot.lean
+/- theorem WithBot.lt_unbot_iff
+/- theorem WithBot.unbot_lt_iff
Modified Mathlib/Tactic/Lift.lean
Modified MathlibTest/lift.lean
+ def foo
2025-10-27 15:32:12 d7286e8
feat(LinearAlgebra/AffineSpace/Independent): `inf_affineSpan_eq_affineSpan_inter` (#30702)
Add a lemma
```lean
lemma AffineIndependent.inf_affineSpan_eq_affineSpan_inter [Nontrivial k] {p : ι → P}
(ha : AffineIndependent k p) (s₁ s₂ : Set ι) :
affineSpan k (p '' s₁) ⊓ affineSpan k (p '' s₂) = affineSpan k (p '' (s₁ ∩ s₂)) := by
```
with a proof adapted from that of the existing weaker `exists_mem_inter_of_exists_mem_inter_affineSpan`, and change `exists_mem_inter_of_exists_mem_inter_affineSpan` to be proved using the new lemma.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/Independent.lean
+ theorem AffineIndependent.inf_affineSpan_eq_affineSpan_inter
2025-10-27 15:32:10 502d38e
feat(Geometry/Euclidean/Projection): characteristic property (#30698)
Add a lemma
```lean
lemma orthogonalProjection_eq_iff_mem {s : AffineSubspace ℝ P} [Nonempty s]
[s.direction.HasOrthogonalProjection] {p q : P} :
orthogonalProjection s p = q ↔ q ∈ s ∧ p -ᵥ q ∈ s.directionᗮ := by
```
that gives the characteristic property of the orthogonal projection in a more convenient form to use than the existing
`inter_eq_singleton_orthogonalProjection` (from which it is derived).
Deduce a lemma `orthogonalProjection_eq_orthogonalProjection_iff_vsub_mem` about equality of two projections onto the same subspace.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Projection.lean
+ theorem EuclideanGeometry.coe_orthogonalProjection_eq_iff_mem
+ theorem EuclideanGeometry.orthogonalProjection_eq_iff_mem
+ theorem EuclideanGeometry.orthogonalProjection_eq_orthogonalProjection_iff_vsub_mem
2025-10-27 15:32:08 f70c739
feat(Analysis/SpecialFunctions/Trigonometric/Angle): equality from equality of twice angles (#30598)
Add lemmas that two angles less than `π / 2` are equal if and only if twice those angles are equal, along with a separate lemma
```lean
lemma toReal_neg_eq_neg_toReal_iff {θ : Angle} : (-θ).toReal = -(θ.toReal) ↔ θ ≠ π := by
```
which isn't directly connected but turns out to be useful in the same application (dealing with angles in right-angled triangles that are less then `π / 2`, when you have two such triangles that are oppositely-oriented).
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean
+ theorem Real.Angle.toReal_neg_eq_neg_toReal_iff
+ theorem Real.Angle.two_nsmul_eq_iff_eq_of_abs_toReal_lt_pi_div_two
+ theorem Real.Angle.two_zsmul_eq_iff_eq_of_abs_toReal_lt_pi_div_two
2025-10-27 15:32:06 6e974c7
feat(Geometry/Euclidean/Angle): angles with orthogonal projections (#30522)
Add some lemmas that angles involving orthogonal projections are right angles. The unoriented versions abstract something used multiple times in `Mathlib.Geometry.Euclidean.Angle.Bisector` (which is thus refactored to use the new lemmas); I expect the oriented versions may be of use in future in further oriented angle bisection lemmas building on top of #30477.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Geometry/Euclidean/Angle/Bisector.lean
Added Mathlib/Geometry/Euclidean/Angle/Oriented/Projection.lean
+ theorem EuclideanGeometry.oangle_orthogonalProjection_self
+ theorem EuclideanGeometry.oangle_self_orthogonalProjection
+ theorem EuclideanGeometry.two_zsmul_oangle_orthogonalProjection_self
+ theorem EuclideanGeometry.two_zsmul_oangle_self_orthogonalProjection
Added Mathlib/Geometry/Euclidean/Angle/Unoriented/Projection.lean
+ theorem EuclideanGeometry.angle_orthogonalProjection_self
+ theorem EuclideanGeometry.angle_self_orthogonalProjection
2025-10-27 15:32:03 1835445
feat: more lemmas on `AntisymmRel` (#30489)
ESTIMATED CHANGES
Modified Mathlib/Order/Antisymmetrization.lean
+ theorem not_antisymmRel_of_gt
+ theorem not_antisymmRel_of_lt
+ theorem not_gt_of_antisymmRel
+ theorem not_lt_of_antisymmRel
2025-10-27 15:32:01 714a52c
feat(Geometry/Euclidean/Incenter): touchpoints are not vertices (#30485)
Add lemmas that touchpoints of a simplex do not equal any of the vertices (in two or more dimensions, this isn't true for a 1-simplex).
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Incenter.lean
+ theorem Affine.Simplex.ExcenterExists.touchpoint_ne_point
+ theorem Affine.Simplex.touchpoint_empty_ne_point
2025-10-27 15:31:59 529ccf0
feat: remove separability assumption from Algebra.dvd_algebraMap_intNorm_self (#30478)
Continuing the work of #30323 and #30448 we remove the separability assumption from `Algebra.dvd_algebraMap_intNorm_self`.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Ideal/Norm/RelNorm.lean
+/- theorem Ideal.relNorm_le_comap
+/- theorem Ideal.spanNorm_le_comap
Modified Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean
+/- theorem Algebra.dvd_algebraMap_intNorm_self
2025-10-27 15:31:57 d5cab0e
refactor(CategoryTheory/Generator): use ObjectProperty instead of Set (#30269)
In certain applications (see #30247), it becomes unpractical to have certains notions like `IsSeparating` defined for `Set C`, while the API for the relatively new `ObjectProperty` is expanding. In this PR, we move the definition of `IsSeparating` to the `ObjectProperty` namespace.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/ModuleCat/AB.lean
Modified Mathlib/Algebra/Category/ModuleCat/Presheaf/Generator.lean
+/- theorem PresheafOfModules.freeYoneda.isDetecting
+/- theorem PresheafOfModules.freeYoneda.isSeparating
+/- def PresheafOfModules.freeYoneda
Modified Mathlib/CategoryTheory/Abelian/GrothendieckCategory/EnoughInjectives.lean
Modified Mathlib/CategoryTheory/Abelian/GrothendieckCategory/ModuleEmbedding/GabrielPopescu.lean
Modified Mathlib/CategoryTheory/Adjunction/AdjointFunctorTheorems.lean
+/- theorem CategoryTheory.Limits.hasColimits_of_hasLimits_of_isCoseparating
+/- theorem CategoryTheory.Limits.hasLimits_of_hasColimits_of_isSeparating
Modified Mathlib/CategoryTheory/Comma/StructuredArrow/Small.lean
Modified Mathlib/CategoryTheory/Generator/Basic.lean
+ theorem CategoryTheory.CostructuredArrow.isSeparating_inverseImage_proj
- theorem CategoryTheory.CostructuredArrow.isSeparating_proj_preimage
- theorem CategoryTheory.IsCodetecting.isCoseparating
- theorem CategoryTheory.IsCodetecting.isIso_iff_of_epi
- theorem CategoryTheory.IsCodetecting.mono
- def CategoryTheory.IsCodetecting
- theorem CategoryTheory.IsCoseparating.isCodetecting
- theorem CategoryTheory.IsCoseparating.mono
- theorem CategoryTheory.IsCoseparating.of_equivalence
- def CategoryTheory.IsCoseparating
- theorem CategoryTheory.IsDetecting.isIso_iff_of_mono
- theorem CategoryTheory.IsDetecting.isSeparating
- theorem CategoryTheory.IsDetecting.mono
- def CategoryTheory.IsDetecting
- theorem CategoryTheory.IsSeparating.isDetecting
- theorem CategoryTheory.IsSeparating.isSeparator_coproduct
- theorem CategoryTheory.IsSeparating.mono
- theorem CategoryTheory.IsSeparating.of_equivalence
- def CategoryTheory.IsSeparating
+ theorem CategoryTheory.ObjectProperty.IsCodetecting.isCoseparating
+ theorem CategoryTheory.ObjectProperty.IsCodetecting.isIso_iff_of_epi
+ theorem CategoryTheory.ObjectProperty.IsCodetecting.of_le
+ def CategoryTheory.ObjectProperty.IsCodetecting
+ theorem CategoryTheory.ObjectProperty.IsCoseparating.isCodetecting
+ theorem CategoryTheory.ObjectProperty.IsCoseparating.of_equivalence
+ theorem CategoryTheory.ObjectProperty.IsCoseparating.of_le
+ def CategoryTheory.ObjectProperty.IsCoseparating
+ theorem CategoryTheory.ObjectProperty.IsDetecting.isIso_iff_of_mono
+ theorem CategoryTheory.ObjectProperty.IsDetecting.isSeparating
+ theorem CategoryTheory.ObjectProperty.IsDetecting.of_le
+ def CategoryTheory.ObjectProperty.IsDetecting
+ theorem CategoryTheory.ObjectProperty.IsSeparating.isDetecting
+ theorem CategoryTheory.ObjectProperty.IsSeparating.isSeparator_coproduct
+ theorem CategoryTheory.ObjectProperty.IsSeparating.of_equivalence
+ theorem CategoryTheory.ObjectProperty.IsSeparating.of_le
+ def CategoryTheory.ObjectProperty.IsSeparating
+ theorem CategoryTheory.ObjectProperty.isCodetecting_bot_of_isGroupoid
+ theorem CategoryTheory.ObjectProperty.isCodetecting_iff_isCoseparating
+ theorem CategoryTheory.ObjectProperty.isCodetecting_op_iff
+ theorem CategoryTheory.ObjectProperty.isCodetecting_unop_iff
+ theorem CategoryTheory.ObjectProperty.isCoseparating_bot_of_isThin
+ theorem CategoryTheory.ObjectProperty.isCoseparating_iff_mono
+ theorem CategoryTheory.ObjectProperty.isCoseparating_op_iff
+ theorem CategoryTheory.ObjectProperty.isCoseparating_unop_iff
+ theorem CategoryTheory.ObjectProperty.isDetecting_bot_of_isGroupoid
+ theorem CategoryTheory.ObjectProperty.isDetecting_iff_isSeparating
+ theorem CategoryTheory.ObjectProperty.isDetecting_op_iff
+ theorem CategoryTheory.ObjectProperty.isDetecting_unop_iff
+ theorem CategoryTheory.ObjectProperty.isGroupoid_of_isCodetecting_bot
+ theorem CategoryTheory.ObjectProperty.isGroupoid_of_isDetecting_bot
+ theorem CategoryTheory.ObjectProperty.isSeparating_bot_of_isThin
+ theorem CategoryTheory.ObjectProperty.isSeparating_iff_epi
+ theorem CategoryTheory.ObjectProperty.isSeparating_op_iff
+ theorem CategoryTheory.ObjectProperty.isSeparating_unop_iff
+ theorem CategoryTheory.ObjectProperty.isThin_of_isCoseparating_bot
+ theorem CategoryTheory.ObjectProperty.isThin_of_isSeparating_bot
+ theorem CategoryTheory.StructuredArrow.isCoseparating_inverseImage_proj
- theorem CategoryTheory.StructuredArrow.isCoseparating_proj_preimage
+/- theorem CategoryTheory.Subobject.eq_of_isDetecting
+/- theorem CategoryTheory.Subobject.eq_of_le_of_isDetecting
+/- theorem CategoryTheory.Subobject.inf_eq_of_isDetecting
- theorem CategoryTheory.groupoid_of_isCodetecting_empty
- theorem CategoryTheory.groupoid_of_isDetecting_empty
- theorem CategoryTheory.isCodetecting_empty_of_groupoid
- theorem CategoryTheory.isCodetecting_iff_isCoseparating
- theorem CategoryTheory.isCodetecting_op_iff
- theorem CategoryTheory.isCodetecting_unop_iff
- theorem CategoryTheory.isCoseparating_empty_of_thin
- theorem CategoryTheory.isCoseparating_iff_mono
- theorem CategoryTheory.isCoseparating_op_iff
- theorem CategoryTheory.isCoseparating_unop_iff
+ theorem CategoryTheory.isCoseparator_iff_of_isLimit_fan
+ theorem CategoryTheory.isCoseparator_of_isLimit_fan
- theorem CategoryTheory.isDetecting_empty_of_groupoid
- theorem CategoryTheory.isDetecting_iff_isSeparating
- theorem CategoryTheory.isDetecting_op_iff
- theorem CategoryTheory.isDetecting_unop_iff
- theorem CategoryTheory.isSeparating_empty_of_thin
- theorem CategoryTheory.isSeparating_iff_epi
- theorem CategoryTheory.isSeparating_op_iff
- theorem CategoryTheory.isSeparating_unop_iff
+ theorem CategoryTheory.isSeparator_iff_of_isColimit_cofan
- theorem CategoryTheory.thin_of_isCoseparating_empty
- theorem CategoryTheory.thin_of_isSeparating_empty
+/- theorem CategoryTheory.wellPowered_of_isDetecting
Modified Mathlib/CategoryTheory/Generator/HomologicalComplex.lean
Modified Mathlib/CategoryTheory/Generator/Indization.lean
+/- theorem CategoryTheory.Ind.isSeparating_range_yoneda
Modified Mathlib/CategoryTheory/Generator/Preadditive.lean
+/- theorem CategoryTheory.Preadditive.isCoseparating_iff
+/- theorem CategoryTheory.Preadditive.isSeparating_iff
Modified Mathlib/CategoryTheory/Generator/Presheaf.lean
+/- theorem CategoryTheory.Presheaf.isSeparating
+/- theorem CategoryTheory.Presheaf.isSeparator
Modified Mathlib/CategoryTheory/Generator/Sheaf.lean
+/- theorem CategoryTheory.Sheaf.isSeparating
+/- theorem CategoryTheory.Sheaf.isSeparator
2025-10-27 15:31:56 4b88792
feat: constructor for submodules and pointed cones from two-element closures (#27578)
in Algebra/Module/Submodule/Defs.lean
- Construct a submodule from closure under two-element linear combinations.
in Geometry/Convex/Cone/Pointed.lean
- Construct a pointed cone from closure under two-element conical combinations.
- lemma mem_span_set
ESTIMATED CHANGES
Modified Mathlib/Algebra/Module/Submodule/Defs.lean
+ def Submodule.ofLinearComb
Modified Mathlib/Geometry/Convex/Cone/Pointed.lean
+ theorem PointedCone.mem_span_set
+ def PointedCone.ofConeComb
2025-10-27 15:02:54 0cf8d72
chore(RingTheory/TensorProduct/Basic): split RingTheory.TensorProduct.Basic (#30806)
This PR splits the file
* Mathlib/RingTheory/TensorProduct/Basic.lean
into
* Mathlib/RingTheory/TensorProduct/Basic.lean
* Mathlib/RingTheory/TensorProduct/Maps.lean
Everything from the file `Basic.lean` related to maps between tensor products of `R`-algebras has been moved to a new file `Maps.lean`, unless it is required for constructions.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean
Modified Mathlib/Algebra/Azumaya/Basic.lean
Modified Mathlib/Algebra/Category/AlgCat/Monoidal.lean
Modified Mathlib/LinearAlgebra/Dual/Lemmas.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Opposite.lean
Modified Mathlib/LinearAlgebra/TensorProduct/RightExactness.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean
Modified Mathlib/RingTheory/Bialgebra/Basic.lean
Modified Mathlib/RingTheory/IsTensorProduct.lean
Modified Mathlib/RingTheory/MatrixAlgebra.lean
Modified Mathlib/RingTheory/Nilpotent/Exp.lean
Modified Mathlib/RingTheory/Spectrum/Prime/RingHom.lean
Modified Mathlib/RingTheory/TensorProduct/Basic.lean
- theorem Algebra.TensorProduct.adjoin_tmul_eq_top
- def Algebra.TensorProduct.algEquivOfLinearEquivTensorProduct
- theorem Algebra.TensorProduct.algEquivOfLinearEquivTensorProduct_apply
- def Algebra.TensorProduct.algEquivOfLinearEquivTripleTensorProduct
- theorem Algebra.TensorProduct.algEquivOfLinearEquivTripleTensorProduct_apply
- def Algebra.TensorProduct.algHomOfLinearMapTensorProduct
- theorem Algebra.TensorProduct.algHomOfLinearMapTensorProduct_apply
- theorem Algebra.TensorProduct.assoc_aux_1
- theorem Algebra.TensorProduct.assoc_aux_2
- theorem Algebra.TensorProduct.assoc_symm_tmul
- theorem Algebra.TensorProduct.assoc_tmul
- theorem Algebra.TensorProduct.assoc_toLinearEquiv
- def Algebra.TensorProduct.cancelBaseChange
- theorem Algebra.TensorProduct.cancelBaseChange_symm_tmul
- theorem Algebra.TensorProduct.cancelBaseChange_tmul
- theorem Algebra.TensorProduct.comm_comp_includeLeft
- theorem Algebra.TensorProduct.comm_comp_includeRight
- theorem Algebra.TensorProduct.comm_comp_map
- theorem Algebra.TensorProduct.comm_comp_map_apply
- theorem Algebra.TensorProduct.comm_symm
- theorem Algebra.TensorProduct.comm_symm_tmul
- theorem Algebra.TensorProduct.comm_tmul
- theorem Algebra.TensorProduct.comm_toLinearEquiv
- def Algebra.TensorProduct.congr
- theorem Algebra.TensorProduct.congr_apply
- theorem Algebra.TensorProduct.congr_refl
- theorem Algebra.TensorProduct.congr_symm
- theorem Algebra.TensorProduct.congr_symm_apply
- theorem Algebra.TensorProduct.congr_toLinearEquiv
- theorem Algebra.TensorProduct.congr_trans
- def Algebra.TensorProduct.equivOfCompatibleSMul
- theorem Algebra.TensorProduct.includeLeft_bijective
- theorem Algebra.TensorProduct.includeRight_bijective
- def Algebra.TensorProduct.leftComm
- theorem Algebra.TensorProduct.leftComm_symm_tmul
- theorem Algebra.TensorProduct.leftComm_tmul
- theorem Algebra.TensorProduct.leftComm_toLinearEquiv
- def Algebra.TensorProduct.lidOfCompatibleSMul
- theorem Algebra.TensorProduct.lidOfCompatibleSMul_tmul
- theorem Algebra.TensorProduct.lid_symm_apply
- theorem Algebra.TensorProduct.lid_tmul
- theorem Algebra.TensorProduct.lid_toLinearEquiv
- def Algebra.TensorProduct.lift
- def Algebra.TensorProduct.liftEquiv
- theorem Algebra.TensorProduct.lift_comp_includeLeft
- theorem Algebra.TensorProduct.lift_comp_includeRight
- theorem Algebra.TensorProduct.lift_includeLeft_includeRight
- theorem Algebra.TensorProduct.lift_tmul
- def Algebra.TensorProduct.lmul''
- theorem Algebra.TensorProduct.lmul''_eq_lid_comp_mapOfCompatibleSMul
- def Algebra.TensorProduct.lmul'
- theorem Algebra.TensorProduct.lmul'_apply_tmul
- theorem Algebra.TensorProduct.lmul'_comp_includeLeft
- theorem Algebra.TensorProduct.lmul'_comp_includeRight
- theorem Algebra.TensorProduct.lmul'_comp_map
- theorem Algebra.TensorProduct.lmul'_toLinearMap
- def Algebra.TensorProduct.lmulEquiv
- theorem Algebra.TensorProduct.lmulEquiv_eq_lidOfCompatibleSMul
- def Algebra.TensorProduct.map
- def Algebra.TensorProduct.mapOfCompatibleSMul'
- def Algebra.TensorProduct.mapOfCompatibleSMul
- theorem Algebra.TensorProduct.mapOfCompatibleSMul_surjective
- theorem Algebra.TensorProduct.mapOfCompatibleSMul_tmul
- theorem Algebra.TensorProduct.map_bijective
- theorem Algebra.TensorProduct.map_comp
- theorem Algebra.TensorProduct.map_comp_id
- theorem Algebra.TensorProduct.map_comp_includeLeft
- theorem Algebra.TensorProduct.map_comp_includeRight
- theorem Algebra.TensorProduct.map_id
- theorem Algebra.TensorProduct.map_id_comp
- theorem Algebra.TensorProduct.map_range
- theorem Algebra.TensorProduct.map_restrictScalars_comp_includeRight
- theorem Algebra.TensorProduct.map_tmul
- def Algebra.TensorProduct.productMap
- theorem Algebra.TensorProduct.productMap_apply_tmul
- theorem Algebra.TensorProduct.productMap_eq_comp_map
- theorem Algebra.TensorProduct.productMap_left
- theorem Algebra.TensorProduct.productMap_left_apply
- theorem Algebra.TensorProduct.productMap_range
- theorem Algebra.TensorProduct.productMap_right
- theorem Algebra.TensorProduct.productMap_right_apply
- theorem Algebra.TensorProduct.rid_symm_apply
- theorem Algebra.TensorProduct.rid_tmul
- theorem Algebra.TensorProduct.rid_toLinearEquiv
- def Algebra.TensorProduct.tensorTensorTensorComm
- theorem Algebra.TensorProduct.tensorTensorTensorComm_symm
- theorem Algebra.TensorProduct.tensorTensorTensorComm_symm_tmul
- theorem Algebra.TensorProduct.tensorTensorTensorComm_tmul
- theorem Algebra.TensorProduct.tensorTensorTensorComm_toLinearEquiv
- theorem Algebra.TensorProduct.tmul_one_eq_one_tmul
- theorem Algebra.TensorProduct.toLinearEquiv_tensorTensorTensorComm
- theorem LinearMap.map_mul_of_map_mul_tmul
- def LinearMap.tensorProduct
- def LinearMap.tensorProductEnd
- def Module.End.lTensorAlgHom
- def Module.End.rTensorAlgHom
- def Module.endTensorEndAlgHom
- theorem Module.endTensorEndAlgHom_apply
Modified Mathlib/RingTheory/TensorProduct/Finite.lean
Added Mathlib/RingTheory/TensorProduct/Maps.lean
+ theorem Algebra.TensorProduct.adjoin_tmul_eq_top
+ def Algebra.TensorProduct.algEquivOfLinearEquivTensorProduct
+ theorem Algebra.TensorProduct.algEquivOfLinearEquivTensorProduct_apply
+ def Algebra.TensorProduct.algEquivOfLinearEquivTripleTensorProduct
+ theorem Algebra.TensorProduct.algEquivOfLinearEquivTripleTensorProduct_apply
+ def Algebra.TensorProduct.algHomOfLinearMapTensorProduct
+ theorem Algebra.TensorProduct.algHomOfLinearMapTensorProduct_apply
+ theorem Algebra.TensorProduct.assoc_aux_1
+ theorem Algebra.TensorProduct.assoc_aux_2
+ theorem Algebra.TensorProduct.assoc_symm_tmul
+ theorem Algebra.TensorProduct.assoc_tmul
+ theorem Algebra.TensorProduct.assoc_toLinearEquiv
+ def Algebra.TensorProduct.cancelBaseChange
+ theorem Algebra.TensorProduct.cancelBaseChange_symm_tmul
+ theorem Algebra.TensorProduct.cancelBaseChange_tmul
+ theorem Algebra.TensorProduct.comm_comp_includeLeft
+ theorem Algebra.TensorProduct.comm_comp_includeRight
+ theorem Algebra.TensorProduct.comm_comp_map
+ theorem Algebra.TensorProduct.comm_comp_map_apply
+ theorem Algebra.TensorProduct.comm_symm
+ theorem Algebra.TensorProduct.comm_symm_tmul
+ theorem Algebra.TensorProduct.comm_tmul
+ theorem Algebra.TensorProduct.comm_toLinearEquiv
+ def Algebra.TensorProduct.congr
+ theorem Algebra.TensorProduct.congr_apply
+ theorem Algebra.TensorProduct.congr_refl
+ theorem Algebra.TensorProduct.congr_symm
+ theorem Algebra.TensorProduct.congr_symm_apply
+ theorem Algebra.TensorProduct.congr_toLinearEquiv
+ theorem Algebra.TensorProduct.congr_trans
+ def Algebra.TensorProduct.equivOfCompatibleSMul
+ theorem Algebra.TensorProduct.includeLeft_bijective
+ theorem Algebra.TensorProduct.includeRight_bijective
+ def Algebra.TensorProduct.leftComm
+ theorem Algebra.TensorProduct.leftComm_symm_tmul
+ theorem Algebra.TensorProduct.leftComm_tmul
+ theorem Algebra.TensorProduct.leftComm_toLinearEquiv
+ def Algebra.TensorProduct.lidOfCompatibleSMul
+ theorem Algebra.TensorProduct.lidOfCompatibleSMul_tmul
+ theorem Algebra.TensorProduct.lid_symm_apply
+ theorem Algebra.TensorProduct.lid_tmul
+ theorem Algebra.TensorProduct.lid_toLinearEquiv
+ def Algebra.TensorProduct.lift
+ def Algebra.TensorProduct.liftEquiv
+ theorem Algebra.TensorProduct.lift_comp_includeLeft
+ theorem Algebra.TensorProduct.lift_comp_includeRight
+ theorem Algebra.TensorProduct.lift_includeLeft_includeRight
+ theorem Algebra.TensorProduct.lift_tmul
+ def Algebra.TensorProduct.lmul''
+ theorem Algebra.TensorProduct.lmul''_eq_lid_comp_mapOfCompatibleSMul
+ def Algebra.TensorProduct.lmul'
+ theorem Algebra.TensorProduct.lmul'_apply_tmul
+ theorem Algebra.TensorProduct.lmul'_comp_includeLeft
+ theorem Algebra.TensorProduct.lmul'_comp_includeRight
+ theorem Algebra.TensorProduct.lmul'_comp_map
+ theorem Algebra.TensorProduct.lmul'_toLinearMap
+ def Algebra.TensorProduct.lmulEquiv
+ theorem Algebra.TensorProduct.lmulEquiv_eq_lidOfCompatibleSMul
+ def Algebra.TensorProduct.map
+ def Algebra.TensorProduct.mapOfCompatibleSMul'
+ def Algebra.TensorProduct.mapOfCompatibleSMul
+ theorem Algebra.TensorProduct.mapOfCompatibleSMul_surjective
+ theorem Algebra.TensorProduct.mapOfCompatibleSMul_tmul
+ theorem Algebra.TensorProduct.map_bijective
+ theorem Algebra.TensorProduct.map_comp
+ theorem Algebra.TensorProduct.map_comp_id
+ theorem Algebra.TensorProduct.map_comp_includeLeft
+ theorem Algebra.TensorProduct.map_comp_includeRight
+ theorem Algebra.TensorProduct.map_id
+ theorem Algebra.TensorProduct.map_id_comp
+ theorem Algebra.TensorProduct.map_range
+ theorem Algebra.TensorProduct.map_restrictScalars_comp_includeRight
+ theorem Algebra.TensorProduct.map_tmul
+ def Algebra.TensorProduct.productMap
+ theorem Algebra.TensorProduct.productMap_apply_tmul
+ theorem Algebra.TensorProduct.productMap_eq_comp_map
+ theorem Algebra.TensorProduct.productMap_left
+ theorem Algebra.TensorProduct.productMap_left_apply
+ theorem Algebra.TensorProduct.productMap_range
+ theorem Algebra.TensorProduct.productMap_right
+ theorem Algebra.TensorProduct.productMap_right_apply
+ theorem Algebra.TensorProduct.rid_symm_apply
+ theorem Algebra.TensorProduct.rid_tmul
+ theorem Algebra.TensorProduct.rid_toLinearEquiv
+ def Algebra.TensorProduct.tensorTensorTensorComm
+ theorem Algebra.TensorProduct.tensorTensorTensorComm_symm
+ theorem Algebra.TensorProduct.tensorTensorTensorComm_symm_tmul
+ theorem Algebra.TensorProduct.tensorTensorTensorComm_tmul
+ theorem Algebra.TensorProduct.tensorTensorTensorComm_toLinearEquiv
+ theorem Algebra.TensorProduct.tmul_one_eq_one_tmul
+ theorem Algebra.TensorProduct.toLinearEquiv_tensorTensorTensorComm
+ theorem LinearMap.map_mul_of_map_mul_tmul
+ def LinearMap.tensorProduct
+ def LinearMap.tensorProductEnd
+ def Module.End.lTensorAlgHom
+ def Module.End.rTensorAlgHom
+ def Module.endTensorEndAlgHom
+ theorem Module.endTensorEndAlgHom_apply
Modified Mathlib/RingTheory/TensorProduct/Pi.lean
2025-10-27 15:02:52 21401e5
feat: API for dealing with divisors attached to meromorphic functions (#30794)
Provide supporting API useful in the discussion of (zero/pole) divisors attached to meromorphic functions.
ESTIMATED CHANGES
Modified Mathlib/Topology/LocallyFinsupp.lean
+ theorem Function.locallyFinsuppWithin.negPart_apply
+ theorem Function.locallyFinsuppWithin.nsmul_negPart
+ theorem Function.locallyFinsuppWithin.nsmul_posPart
+ theorem Function.locallyFinsuppWithin.posPart_apply
2025-10-27 15:02:50 65a039a
feat(MvPolynomial/Expand): more lemmas (#28833)
ESTIMATED CHANGES
Modified Mathlib/Algebra/MvPolynomial/Eval.lean
+/- theorem MvPolynomial.aeval_X
+ theorem MvPolynomial.aeval_eq_eval
+/- theorem MvPolynomial.coe_aeval_eq_eval
Modified Mathlib/Algebra/MvPolynomial/Expand.lean
+ theorem MvPolynomial.aeval_comp_expand
+ theorem MvPolynomial.aeval_expand
+ theorem MvPolynomial.coeff_expand_of_not_dvd
+ theorem MvPolynomial.coeff_expand_smul
+ theorem MvPolynomial.eval_expand
+ theorem MvPolynomial.eval₂Hom_comp_expand
+ theorem MvPolynomial.eval₂_expand
+ theorem MvPolynomial.expand_mul
+ theorem MvPolynomial.expand_mul_eq_comp
+/- theorem MvPolynomial.expand_one_apply
+ theorem MvPolynomial.expand_zero
+ theorem MvPolynomial.expand_zero_apply
+ theorem MvPolynomial.support_expand
+ theorem MvPolynomial.support_expand_subset
2025-10-27 14:40:43 bd73402
chore(CMField): refactor the definition of `IsCMField` (#30965)
Change the definition to
```lean
class IsCMField (K : Type*) [Field K] [NumberField K] : Prop where
[to_isTotallyComplex : IsTotallyComplex K]
[is_quadratic : IsQuadraticExtension (maximalRealSubfield K) K]
```
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/CMField.lean
2025-10-27 14:26:26 bb68410
chore: construct LEAN_SRC_PATH programmatically in CI (#30844)
Followup to #30839
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
2025-10-27 13:29:54 0c8813a
refactor(Probability): change stopping times to take values in `WithTop` (#29430)
This PR changes stopping times to have type `Ω → WithTop ι` instead of `Ω → ι`.
Previously, a stopping time for a filtration indexed by Nat had to have value in Nat. That's not representative of the way stopping times are used in probability. A typical stopping time is the first time at which we see a head in an infinite sequence of coin flips. That time could be infinite (although it is almost surely finite). We can't represent it with a `Ω → Nat` stopping time: if we choose an arbitrary value in Nat for the event that it is infinite, we destroy the stopping time property.
We faced that issue in the `BorelCantelli` file, in which we avoided such a possibly infinite stopping time by introducing a sequence of bounded stopping times. We had to prove additional lemmas about them since we could not directly use the API for stopped processes. With the new type, that file is greatly simplified as the API is directly usable, and we can write the proof as we would on paper.
The issue with the previous stopping time implementation was noted in [Ying and Degenne, A Formalization of Doob’s Martingale Convergence Theorems in mathlib, CPP 2023, https://dl.acm.org/doi/pdf/10.1145/3573105.3575675].
Other changes:
- the sigma-algebra generated by a stopping time is now a sub-sigma algebra by definition
- `measurableSet_eq_stopping_time` is generalized and the now useless `measurableSet_eq_stopping_time_of_countable` is removed
- `hitting` is renamed to `hittingBtwn`
- a new `hittingAfter` is introduced and used in the Borel-Cantelli proof. That proof is now much simpler since we can use a stopped process as intended instead of going around the limitations of the previous stopping time implementation.
ESTIMATED CHANGES
Modified Mathlib/Order/WithBot.lean
+ theorem WithTop.le_untopA_iff
+ theorem WithTop.lt_untopA_iff
+ theorem WithTop.untopA_le
+ theorem WithTop.untopA_le_iff
+ theorem WithTop.untopA_lt_iff
+ theorem WithTop.untopA_mono
+ theorem WithTop.untopD_le
+ theorem WithTop.untopD_le_iff
+ theorem WithTop.untopD_lt_iff
+ theorem WithTop.untopD_mono
+ theorem WithTop.untop_mono
Modified Mathlib/Probability/Martingale/Basic.lean
Modified Mathlib/Probability/Martingale/BorelCantelli.lean
+/- theorem MeasureTheory.Adapted.isStoppingTime_leastGE
+ theorem MeasureTheory.Submartingale.eLpNorm_stoppedAbove_le'
+ theorem MeasureTheory.Submartingale.eLpNorm_stoppedAbove_le
- theorem MeasureTheory.Submartingale.stoppedValue_leastGE
- theorem MeasureTheory.Submartingale.stoppedValue_leastGE_eLpNorm_le'
- theorem MeasureTheory.Submartingale.stoppedValue_leastGE_eLpNorm_le
- theorem MeasureTheory.leastGE_eq_min
- theorem MeasureTheory.leastGE_le
- theorem MeasureTheory.leastGE_mono
- theorem MeasureTheory.norm_stoppedValue_leastGE_le
+ theorem MeasureTheory.stoppedAbove_le
- theorem MeasureTheory.stoppedValue_stoppedValue_leastGE
Modified Mathlib/Probability/Martingale/OptionalSampling.lean
+/- theorem MeasureTheory.Martingale.condExp_stopping_time_ae_eq_restrict_eq_const
Modified Mathlib/Probability/Martingale/OptionalStopping.lean
- theorem MeasureTheory.smul_le_stoppedValue_hitting
+ theorem MeasureTheory.smul_le_stoppedValue_hittingBtwn
Modified Mathlib/Probability/Martingale/Upcrossing.lean
+/- theorem MeasureTheory.lowerCrossingTime_zero
Modified Mathlib/Probability/Process/HittingTime.lean
+ theorem MeasureTheory.hittingAfter_bot_le_iff
+ theorem MeasureTheory.hittingAfter_def
+ theorem MeasureTheory.hittingAfter_eq_sInf
+ theorem MeasureTheory.hittingAfter_eq_top_iff
+ theorem MeasureTheory.hittingAfter_isStoppingTime
+ theorem MeasureTheory.hittingAfter_le_iff
+ theorem MeasureTheory.hittingAfter_le_of_mem
+ theorem MeasureTheory.hittingAfter_lt_iff
+ theorem MeasureTheory.hittingAfter_mem_set
+ theorem MeasureTheory.hittingAfter_mem_set_of_ne_top
+ theorem MeasureTheory.hittingBtwn_bot_le_iff
+ theorem MeasureTheory.hittingBtwn_def
+ theorem MeasureTheory.hittingBtwn_eq_end_iff
+ theorem MeasureTheory.hittingBtwn_eq_hittingBtwn_of_exists
+ theorem MeasureTheory.hittingBtwn_eq_sInf
+ theorem MeasureTheory.hittingBtwn_isStoppingTime
+ theorem MeasureTheory.hittingBtwn_le
+ theorem MeasureTheory.hittingBtwn_le_iff_of_exists
+ theorem MeasureTheory.hittingBtwn_le_iff_of_lt
+ theorem MeasureTheory.hittingBtwn_le_of_mem
+ theorem MeasureTheory.hittingBtwn_lt_iff
+ theorem MeasureTheory.hittingBtwn_mem_Icc
+ theorem MeasureTheory.hittingBtwn_mem_set
+ theorem MeasureTheory.hittingBtwn_mem_set_of_hittingBtwn_lt
+ theorem MeasureTheory.hittingBtwn_mono
+ theorem MeasureTheory.hittingBtwn_of_le
+ theorem MeasureTheory.hittingBtwn_of_lt
- theorem MeasureTheory.hitting_bot_le_iff
- theorem MeasureTheory.hitting_def
- theorem MeasureTheory.hitting_eq_end_iff
- theorem MeasureTheory.hitting_eq_hitting_of_exists
- theorem MeasureTheory.hitting_eq_sInf
- theorem MeasureTheory.hitting_isStoppingTime
- theorem MeasureTheory.hitting_le
- theorem MeasureTheory.hitting_le_iff_of_exists
- theorem MeasureTheory.hitting_le_iff_of_lt
- theorem MeasureTheory.hitting_le_of_mem
- theorem MeasureTheory.hitting_lt_iff
- theorem MeasureTheory.hitting_mem_Icc
- theorem MeasureTheory.hitting_mem_set
- theorem MeasureTheory.hitting_mem_set_of_hitting_lt
- theorem MeasureTheory.hitting_mono
- theorem MeasureTheory.hitting_of_le
- theorem MeasureTheory.hitting_of_lt
+ theorem MeasureTheory.isStoppingTime_hittingBtwn_isStoppingTime
- theorem MeasureTheory.isStoppingTime_hitting_isStoppingTime
- theorem MeasureTheory.le_hitting
+ theorem MeasureTheory.le_hittingAfter
+ theorem MeasureTheory.le_hittingBtwn
+ theorem MeasureTheory.le_hittingBtwn_of_exists
- theorem MeasureTheory.le_hitting_of_exists
- theorem MeasureTheory.notMem_of_lt_hitting
+ theorem MeasureTheory.notMem_of_lt_hittingAfter
+ theorem MeasureTheory.notMem_of_lt_hittingBtwn
+ theorem MeasureTheory.stoppedValue_hittingBtwn_mem
- theorem MeasureTheory.stoppedValue_hitting_mem
Modified Mathlib/Probability/Process/Stopping.lean
+/- theorem MeasureTheory.IsStoppingTime.add
+/- theorem MeasureTheory.IsStoppingTime.add_const_nat
+/- theorem MeasureTheory.IsStoppingTime.measurableSet_eq_stopping_time
+ theorem MeasureTheory.IsStoppingTime.measurableSet_eq_stopping_time_min
- theorem MeasureTheory.IsStoppingTime.measurableSet_eq_stopping_time_of_countable
+ theorem MeasureTheory.IsStoppingTime.measurableSet_stopping_time_le_min
+/- theorem MeasureTheory.IsStoppingTime.measurableSpace_le
- theorem MeasureTheory.IsStoppingTime.measurableSpace_le_of_countable
+/- def MeasureTheory.IsStoppingTime
+/- theorem MeasureTheory.condExp_min_stopping_time_ae_eq_restrict_le
+ theorem MeasureTheory.measurableSet_preimage_stoppedValue_inter
+/- def MeasureTheory.stoppedProcess
+/- theorem MeasureTheory.stoppedProcess_eq_of_ge
+/- theorem MeasureTheory.stoppedProcess_eq_of_le
+/- theorem MeasureTheory.stoppedProcess_eq_stoppedValue
+/- def MeasureTheory.stoppedValue
+/- theorem MeasureTheory.stoppedValue_eq_of_mem_finset
+/- theorem MeasureTheory.stoppedValue_piecewise_const'
+/- theorem MeasureTheory.stoppedValue_piecewise_const
+/- theorem MeasureTheory.stoppedValue_stoppedProcess
+ theorem MeasureTheory.stoppedValue_stoppedProcess_ae_eq
+/- theorem MeasureTheory.stoppedValue_sub_eq_sum
2025-10-27 12:39:54 a5c1f74
feat(ZeroLEOne): add instances for (indexed) product types (#30506)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/ZeroLEOne.lean
2025-10-27 12:10:19 a36ed51
feat: `f r = r` for `f : ℝ →+* ℝ` (#30486)
ESTIMATED CHANGES
Modified Mathlib/Data/Real/CompleteField.lean
+ theorem Real.ringHom_apply
2025-10-27 10:32:58 2f09753
chore: update Mathlib dependencies 2025-10-27 (#30964)
This PR updates the Mathlib dependencies.
[workflow run for this PR](https://github.com/leanprover-community/mathlib4/actions/runs/18835607221)
ESTIMATED CHANGES
Modified lake-manifest.json
2025-10-27 10:32:56 ffc0e77
doc(Algebra/Group/Basic): fix broken link (#30951)
The first paragraph of https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Group/Basic.html contains a broken link to Algebra/Group/Basic.lean, which should be Mathlib/Algebra/Group/Basic.lean.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Basic.lean
2025-10-27 10:19:31 2b63991
chore: allow 'exe cache' to upload Canonical oleans (#30952)
See https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Canonical
ESTIMATED CHANGES
Modified Cache/IO.lean
2025-10-27 10:19:28 f8329ef
feat(Nat/Nth): inequalities about Nat.nth (#27742)
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Nth.lean
+ theorem Nat.eq_nth_of_strictMonoOn_of_mapsTo_of_surjOn
+ theorem Nat.le_nth_of_monotoneOn_of_surjOn
+ theorem Nat.nth_le_of_strictMonoOn_of_mapsTo
2025-10-27 09:15:44 9209df7
chore: only run post_update hook when versions match (#30956)
See [#lean4 > Lake new errors @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/Lake.20new.20errors/near/547175291)
ESTIMATED CHANGES
Modified lakefile.lean
2025-10-27 09:15:42 ac430c1
feat(Topology): add `IsCompact.closure_eq_nhdsKer` (#30123)
ESTIMATED CHANGES
Modified Mathlib/Topology/Separation/Regular.lean
+ theorem IsCompact.closure_eq_nhdsKer
2025-10-27 09:15:40 180a3c4
refactor(CategoryTheory/ObjectProperty): IsClosedUnderLimitsOfShape (#29881)
This PR renames `ClosedUnderLimitsOfShape` as `ObjectProperty.IsClosedUnderLimitsOfShape`, and make it a typeclass.
The stability condition of a property `P` by (co)limits of shape `J` is now expressed as `P.colimitsOfShape J ≤ P`. This facilitates the connection with the relatively new API `ColimitPresentation` #29382 (and the related `ObjectProperty.ColimitOfShape`).
By using a typeclass for the stability condition, it will be possible to add instances `HasLimitsOfShape` instances for fullsubcategories.
This also makes the design more parallel to what we have for the stability under (co)limits of `MorphismProperty`.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/FullSubcategory.lean
- def CategoryTheory.Limits.ClosedUnderColimitsOfShape
- def CategoryTheory.Limits.ClosedUnderLimitsOfShape
- theorem CategoryTheory.Limits.closedUnderColimitsOfShape_of_colimit
- theorem CategoryTheory.Limits.closedUnderLimitsOfShape_of_limit
+/- def CategoryTheory.Limits.createsColimitFullSubcategoryInclusionOfClosed
- def CategoryTheory.Limits.createsColimitsOfShapeFullSubcategoryInclusion
+/- def CategoryTheory.Limits.createsLimitFullSubcategoryInclusionOfClosed
- def CategoryTheory.Limits.createsLimitsOfShapeFullSubcategoryInclusion
+/- theorem CategoryTheory.Limits.hasColimit_of_closedUnderColimits
- theorem CategoryTheory.Limits.hasColimitsOfShape_of_closedUnderColimits
+/- theorem CategoryTheory.Limits.hasLimit_of_closedUnderLimits
- theorem CategoryTheory.Limits.hasLimitsOfShape_of_closedUnderLimits
Modified Mathlib/CategoryTheory/Limits/Indization/Category.lean
Modified Mathlib/CategoryTheory/Limits/Indization/Equalizers.lean
- theorem CategoryTheory.Limits.closedUnderLimitsOfShape_walkingParallelPair_isIndObject
Modified Mathlib/CategoryTheory/Limits/MorphismProperty.lean
- theorem CategoryTheory.CostructuredArrow.closedUnderLimitsOfShape_discrete_empty
- theorem CategoryTheory.MorphismProperty.Comma.hasColimitsOfShape_of_closedUnderColimitsOfShape
- theorem CategoryTheory.MorphismProperty.Comma.hasLimitsOfShape_of_closedUnderLimitsOfShape
- theorem CategoryTheory.Over.closedUnderLimitsOfShape_discrete_empty
- theorem CategoryTheory.Over.closedUnderLimitsOfShape_pullback
Modified Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean
Modified Mathlib/CategoryTheory/ObjectProperty/ColimitsOfShape.lean
+ theorem CategoryTheory.ObjectProperty.ColimitOfShape.prop
+ theorem CategoryTheory.ObjectProperty.IsClosedUnderColimitsOfShape.mk'
+ theorem CategoryTheory.ObjectProperty.prop_colimit
+ theorem CategoryTheory.ObjectProperty.prop_of_isColimit
Modified Mathlib/CategoryTheory/ObjectProperty/LimitsOfShape.lean
+ theorem CategoryTheory.ObjectProperty.IsClosedUnderLimitsOfShape.mk'
+ theorem CategoryTheory.ObjectProperty.LimitOfShape.prop
+ theorem CategoryTheory.ObjectProperty.prop_limit
+ theorem CategoryTheory.ObjectProperty.prop_of_isLimit
Modified Mathlib/CategoryTheory/Subobject/MonoOver.lean
- theorem CategoryTheory.MonoOver.closedUnderLimitsOfShape_isMono
2025-10-27 09:15:38 453ea3b
feat(Logic/Equiv/List): add `decodeList_encodeList_eq_self` and removed unnecessary linter options (#28831)
ESTIMATED CHANGES
Modified Mathlib/Logic/Equiv/List.lean
+ theorem Encodable.decodeList_encodeList_eq_self
2025-10-27 08:05:24 747d81a
feat(Algebra/Group/Torsion): characterise when `a ^ n = 1` (#30680)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Torsion.lean
- theorem IsMulTorsionFree.pow_eq_one_iff'
+/- theorem IsMulTorsionFree.pow_eq_one_iff
+ theorem IsMulTorsionFree.pow_eq_one_iff_left
+ theorem IsMulTorsionFree.pow_eq_one_iff_right
+ theorem IsMulTorsionFree.zpow_eq_one_iff
+ theorem IsMulTorsionFree.zpow_eq_one_iff_left
+ theorem IsMulTorsionFree.zpow_eq_one_iff_right
+/- theorem sq_eq_one
Modified Mathlib/Algebra/GroupWithZero/Torsion.lean
Modified Mathlib/Algebra/Ring/NonZeroDivisors.lean
2025-10-27 04:03:01 cd0d357
feat(Topology/UniformSpace/OfCompactT2): generalize theorem (#30917)
This PR continues the work from #24103.
Original PR: https://github.com/leanprover-community/mathlib4/pull/24103
ESTIMATED CHANGES
Modified Mathlib/Topology/Separation/Regular.lean
+ theorem disjoint_nested_nhds_of_not_inseparable
Modified Mathlib/Topology/UniformSpace/OfCompactT2.lean
+ def uniformSpaceOfCompactR1
- def uniformSpaceOfCompactT2
Modified scripts/noshake.json
2025-10-27 04:02:59 59f196f
feat: `Set.prod_image_left` (#30701)
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Operations.lean
+ theorem Set.prod_image_left
+ theorem Set.prod_image_right
2025-10-27 02:53:45 88d330e
feat: characterise when `Set.rangeFactorization` is injective (#30126)
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Image.lean
- theorem Set.rangeFactorization_surjective
Modified Mathlib/Data/Set/Operations.lean
+ theorem Set.rangeFactorization_bijective
+ theorem Set.rangeFactorization_injective
+ theorem Set.rangeFactorization_surjective
2025-10-26 22:22:38 540c589
chore(RingTheory/TensorProduct): golf `tensorTensorTensorComm_symm` and `toLinearEquiv_tensorTensorTensorComm` using `rfl` (#30947)
ESTIMATED CHANGES
Modified Mathlib/RingTheory/TensorProduct/Basic.lean
2025-10-26 19:41:08 b49483a
chore(CategoryTheory/Preadditive): golf `Biproduct.column_nonzero_of_iso'` using `grind` (#30941)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Preadditive/Biproducts.lean
2025-10-26 19:22:04 a15689b
chore(Data/List/SplitBy): golf theorems (#30896)
ESTIMATED CHANGES
Modified Mathlib/Data/List/SplitBy.lean
+/- theorem List.ne_nil_of_mem_splitBy
2025-10-26 18:30:54 e771c6f
feat(Topology/Algebra/Module): `prod` and `coprod` as `ContinuousLinearEquiv`s (#28906)
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean
Modified Mathlib/Topology/Algebra/Module/StrongTopology.lean
+ def ContinuousLinearMap.coprodEquivL
+ def ContinuousLinearMap.prodL
2025-10-26 17:45:06 7743d59
feat(Data/Sign/Defs): `sign_eq_sign_or_eq_neg` (#30929)
Add the lemma that, in a linear order with zero, two nonzero values have the same sign or opposite signs.
```lean
lemma sign_eq_sign_or_eq_neg {b : α} (ha : a ≠ 0) (hb : b ≠ 0) :
sign a = sign b ∨ sign a = -sign b := by
```
ESTIMATED CHANGES
Modified Mathlib/Data/Sign/Defs.lean
+ theorem sign_eq_sign_or_eq_neg
2025-10-26 16:48:11 442e00c
feat(Data/Finset/BooleanAlgebra): `singleton_ne_univ` (#30930)
Add a `simp` lemma `Finset.singleton_ne_univ`, for which the corresponding `Set` lemma already exists.
```lean
@[simp] lemma singleton_ne_univ [Nontrivial α] (a : α) : {a} ≠ univ := by
```
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/BooleanAlgebra.lean
+ theorem Finset.singleton_ne_univ
2025-10-26 16:07:39 05253d6
feat(DivergenceTheorem): add 2 versions (#30396)
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Integral/DivergenceTheorem.lean
+ theorem MeasureTheory.integral2_divergence_prod_of_hasFDerivAt
+ theorem MeasureTheory.integral_divergence_prod_Icc_of_hasFDerivAt_of_le
2025-10-26 15:49:25 61d564b
feat(NumberTheory): order of inertia group = ramification index (#30675)
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/RamificationInertia/Galois.lean
+ theorem Ideal.card_inertia_eq_ramificationIdxIn
+ theorem Ideal.ncard_primesOver_mul_card_inertia_mul_finrank
Modified Mathlib/RingTheory/Ideal/Over.lean
+ theorem Ideal.Quotient.ker_stabilizerHom
+ theorem Ideal.Quotient.map_ker_stabilizer_subtype
Modified Mathlib/RingTheory/Ideal/Pointwise.lean
+ theorem Ideal.inertia_le_stabilizer
2025-10-26 14:28:43 849e626
chore: tidy various files (#30919)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Action/Defs.lean
Modified Mathlib/Algebra/Lie/Abelian.lean
Modified Mathlib/Algebra/Lie/Basic.lean
Modified Mathlib/Algebra/Lie/Character.lean
Modified Mathlib/Algebra/Lie/Weights/IsSimple.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplices.lean
Modified Mathlib/Analysis/CStarAlgebra/Basic.lean
Modified Mathlib/Analysis/Complex/ValueDistribution/FirstMainTheorem.lean
Modified Mathlib/Analysis/InnerProductSpace/GramMatrix.lean
Modified Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/Summable.lean
Modified Mathlib/CategoryTheory/Limits/Presentation.lean
Modified Mathlib/CategoryTheory/ObjectProperty/LimitsOfShape.lean
Modified Mathlib/CategoryTheory/Subobject/MonoOver.lean
Modified Mathlib/CategoryTheory/Types/Monomorphisms.lean
Modified Mathlib/FieldTheory/KummerExtension.lean
Modified Mathlib/GroupTheory/DivisibleHull.lean
Modified Mathlib/GroupTheory/Finiteness.lean
Modified Mathlib/GroupTheory/OrderOfElement.lean
Modified Mathlib/LinearAlgebra/Determinant.lean
Modified Mathlib/NumberTheory/ArithmeticFunction.lean
Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean
Modified Mathlib/NumberTheory/NumberField/CMField.lean
Modified Mathlib/NumberTheory/NumberField/Norm.lean
+/- theorem RingOfIntegers.algebraMap_norm_algebraMap
Modified Mathlib/NumberTheory/SumTwoSquares.lean
Modified Mathlib/Probability/Distributions/Beta.lean
Modified Mathlib/Probability/Distributions/Gaussian/Basic.lean
Modified Mathlib/Probability/Kernel/CondDistrib.lean
Modified Mathlib/RingTheory/DividedPowers/Padic.lean
Modified Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean
Modified Mathlib/RingTheory/RootsOfUnity/CyclotomicUnits.lean
Modified Mathlib/RingTheory/Valuation/ValuationSubring.lean
Modified Mathlib/Topology/Instances/AddCircle/Defs.lean
2025-10-26 13:57:09 84a53aa
chore: rename duplicate lemmas about leadingCoeff (map ..) (#30923)
Neither name was great; the new one is more in line with Polynomial.leadingCoeff_map and Polynomial.leadingCoeff_map_of_leadingCoeff_ne_zero.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Monic.lean
- theorem Polynomial.leadingCoeff_map'
+ theorem Polynomial.leadingCoeff_map_of_injective
- theorem Polynomial.leadingCoeff_of_injective
2025-10-26 13:57:07 5cdb67d
chore: deprecate duplicate Polynomial.Monic.natDegree_eq_zero_iff_eq_one (#30922)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Degree/Operations.lean
Modified Mathlib/Algebra/Polynomial/Monic.lean
- theorem Polynomial.Monic.natDegree_eq_zero_iff_eq_one
Modified Mathlib/Topology/Algebra/Polynomial.lean
2025-10-26 13:57:06 e7d09b1
chore: golf `nondegenerate_of_det_ne_zero`, `num_zero` and `sum_to_range` using `simp_all` (#30520)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean
Modified Mathlib/RingTheory/Localization/NumDen.lean
Modified Mathlib/Topology/Category/Profinite/Nobeling/Successor.lean
2025-10-26 12:59:40 bf1dbb9
chore(Order/Defs): golf `min_def` (#30924)
After this change, `min_def` has a proof term that indicates that it is an alias of `LinearOrder.min_def`. So the duplicate declaration linter will not report it.
ESTIMATED CHANGES
Modified Mathlib/Order/Defs/LinearOrder.lean
+/- theorem max_def
+/- theorem min_def
2025-10-26 12:40:30 9b82ea7
refactor(FieldTheory/Galois/IsGaloisGroup): Generalize to rings (#30791)
This allows you to talk about Galois groups of extensions of rings without having to pass to the field of fractions. The connection with the field of fractions is given in #30792.
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/Galois/IsGaloisGroup.lean
2025-10-26 12:40:28 1e2effc
doc(LinearAlgebra/Matrix/PosDef): module docstring (#30677)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Matrix/PosDef.lean
2025-10-26 11:35:56 9ef6aec
feat(FlexibleLinter): mark field tactic as flexible and normalising (#30820)
It is essentially `field_simp; ring1`, both of which are flexible and normalising.
Also add `ring1`, `ring1_nf` and their `!` variants as normalising: those were simply missing before.
ESTIMATED CHANGES
Modified Mathlib/Tactic/Linter/FlexibleLinter.lean
Modified MathlibTest/ImportHeavyFlexibleLinter.lean
2025-10-26 10:07:37 8dc6b85
feat: a sufficient condition for stochastic processes to be independent (#30878)
We prove that two stochastic processes $(X\_s)\_{s \in S}$ and $(Y\_t)\_{t \in T}$ are independent if for all $s_1, ..., s_p \in S$ and $t_1, ..., t_q \in T$ the two families $(X_{s_1}, ..., X_{s_p})$ and $(Y_{t_1}, ..., Y_{t_q})$ are independent. We prove an analogous condition for a family of stochastic processes.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Probability/Independence/Process.lean
+ theorem ProbabilityTheory.IndepFun.indepFun_process
+ theorem ProbabilityTheory.Kernel.IndepFun.indepFun_process
+ theorem ProbabilityTheory.Kernel.iIndepFun.iIndepFun_process
+ theorem ProbabilityTheory.iIndepFun.iIndepFun_process
2025-10-26 10:07:36 0ca8fa2
chore(Data/List/Perm): golf `Perm.bagInter_right` using `grind` (#30589)
ESTIMATED CHANGES
Modified Mathlib/Data/List/Perm/Lattice.lean
2025-10-26 09:23:57 841fd68
chore: rename lemmas with 'ltOnePart' in their name (#30903)
There's no such thing as ltOnePart; they're referring to leOnePart.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Group/PosPart.lean
+ theorem one_lt_leOnePart
+ theorem one_lt_leOnePart_iff
- theorem one_lt_ltOnePart
- theorem one_lt_ltOnePart_iff
2025-10-26 07:53:14 2108383
chore(Condensed): fix typo (#30846)
This PR fixes several typos in `Condensed/Light/Module.lean` and `Condensed/Solid.lean`.
ESTIMATED CHANGES
Modified Mathlib/Condensed/Light/Module.lean
Modified Mathlib/Condensed/Solid.lean
2025-10-26 07:39:09 b35d3c7
feat(CategoryTheory/Sites): pre-`0`-hypercover families (#30910)
When defining a precoverage on a category, it is sometimes convenient to only define it on indexed covers. For this,
we introduce a structure `PreZeroHypercoverFamily` that is the data of a property on the pre-`0`-hypercovers of every object that is invariant under deduplication. This induces a precoverage and conversely every precoverage induces such a family.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Sites/Hypercover/ZeroFamily.lean
+ theorem CategoryTheory.PreZeroHypercover.presieve₀_mem_precoverage_iff
+ theorem CategoryTheory.PreZeroHypercoverFamily.mem_precoverage_iff
+ def CategoryTheory.PreZeroHypercoverFamily.precoverage
+ inductive CategoryTheory.PreZeroHypercoverFamily.presieve
+ structure CategoryTheory.PreZeroHypercoverFamily
+ theorem CategoryTheory.Precoverage.HasIsos.of_preZeroHypercoverFamily
+ theorem CategoryTheory.Precoverage.IsStableUnderBaseChange.of_preZeroHypercoverFamily_of_isClosedUnderIsomorphisms
+ theorem CategoryTheory.Precoverage.IsStableUnderComposition.of_preZeroHypercoverFamily
+ def CategoryTheory.Precoverage.equivPreZeroHypercoverFamily
+ def CategoryTheory.Precoverage.preZeroHypercoverFamily
2025-10-26 07:20:43 f9cb3f9
feat: independence and uncurrying (#30184)
Consider `((Xᵢⱼ)ⱼ)ᵢ` a family of families of random variables. Assume that for any `i`, the random variables `(Xᵢⱼ)ⱼ` are independent. Assume furthermore that the random variables `((Xᵢⱼ)ⱼ)ᵢ` are independent. Then the random variables `(Xᵢⱼ)` indexed by pairs `(i, j)` are independent.
This PR also drops the `IsProbabilityMeasure` assumption from [MeasureTheory.Measure.infinitePi](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Probability/ProductMeasure.html#MeasureTheory.Measure.infinitePi) to avoid weird errors with `congr`.
ESTIMATED CHANGES
Modified Mathlib/Probability/Independence/InfinitePi.lean
+/- theorem ProbabilityTheory.iIndepFun_iff_map_fun_eq_infinitePi_map₀'
+/- theorem ProbabilityTheory.iIndepFun_iff_map_fun_eq_infinitePi_map₀
+/- theorem ProbabilityTheory.iIndepFun_infinitePi
+ theorem ProbabilityTheory.iIndepFun_uncurry'
+ theorem ProbabilityTheory.iIndepFun_uncurry
+ theorem ProbabilityTheory.iIndepFun_uncurry_infinitePi'
+ theorem ProbabilityTheory.iIndepFun_uncurry_infinitePi
Modified Mathlib/Probability/ProductMeasure.lean
+ theorem MeasureTheory.Measure.infinitePi_map_eval
2025-10-25 23:37:10 f4dee01
feat(Combinatorics/Additive/VerySmallDoubling): Hamidoune's Freiman-Kneser theorem for nonabelian groups (#28296)
Prove the noncommutative Freiman-Kneser theorem for doubling less than 2 - ε
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Additive/VerySmallDoubling.lean
+ theorem Finset.card_mul_finset_lt_two
+ theorem Finset.doubling_lt_two
2025-10-25 22:49:43 086483d
feat(CategoryTheory/Sites): more API for zero hypercovers (#30906)
We add constructors for isomorphisms of (pre)-`0`-hypercovers and operations relating `Presieve`s and pre-`0`-hypercovers.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
+ theorem CategoryTheory.PreZeroHypercover.Hom.ext'
+ theorem CategoryTheory.PreZeroHypercover.Hom.ext'_iff
+ def CategoryTheory.PreZeroHypercover.fromShrink
+ theorem CategoryTheory.PreZeroHypercover.hom_inv_h₀
+ theorem CategoryTheory.PreZeroHypercover.hom_inv_s₀_apply
+ theorem CategoryTheory.PreZeroHypercover.inv_hom_h₀
+ theorem CategoryTheory.PreZeroHypercover.inv_hom_s₀_apply
+ def CategoryTheory.PreZeroHypercover.isoMk
+ theorem CategoryTheory.PreZeroHypercover.presieve₀_eq_presieve₀_iff
+ theorem CategoryTheory.PreZeroHypercover.presieve₀_shrink
+ def CategoryTheory.PreZeroHypercover.shrink
+ theorem CategoryTheory.PreZeroHypercover.shrink_eq_shrink_of_presieve₀_eq_presieve₀
+ def CategoryTheory.PreZeroHypercover.toShrink
+ def CategoryTheory.Precoverage.ZeroHypercover.isoMk
+ theorem CategoryTheory.Precoverage.le_of_zeroHypercover
+ theorem CategoryTheory.Presieve.exists_eq_preZeroHypercover
+ def CategoryTheory.Presieve.preZeroHypercover
+ theorem CategoryTheory.Presieve.presieve₀_preZeroHypercover
2025-10-25 22:36:58 b26242b
feat(AlgebraicGeometry/Morphisms/Flat): add a simple lemma (#30237)
This PR introduces the following simple lemma:
- `AlgebraicGeometry.Flat.flat_and_surjective_iff_faithfullyFlat_of_isAffine`: A morphism between affine schemes is flat and surjective if and only if the corresponding map on global sections is faithfully flat.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/Morphisms/Flat.lean
+ theorem AlgebraicGeometry.Flat.flat_and_surjective_iff_faithfullyFlat_of_isAffine
2025-10-25 21:04:26 f6f9225
chore(CategoryTheory/Sites/Precoverage): remove universe parameters in `IsStableUnderBaseChange` etc. (#30835)
The additional universe parameters provide little value and I am not aware of any practical applications. Moreover, it is a theorem that being `max u v`-stable under base change (resp. stable under composition) implies being `w`-stable under base change (resp. stable under composition) for any `w`.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
Modified Mathlib/CategoryTheory/Sites/Precoverage.lean
+ theorem CategoryTheory.Precoverage.comp_mem_coverings
+ theorem CategoryTheory.Precoverage.mem_coverings_of_isPullback
+/- theorem CategoryTheory.Precoverage.pullbackArrows_mem
Modified Mathlib/CategoryTheory/Sites/Sieves.lean
+ theorem CategoryTheory.Presieve.ofArrows.eq_eqToHom_comp_hom_idx
+ theorem CategoryTheory.Presieve.ofArrows.hom_idx
+ def CategoryTheory.Presieve.ofArrows.idx
+ theorem CategoryTheory.Presieve.ofArrows.obj_idx
+ theorem CategoryTheory.Presieve.ofArrows_eq_ofArrows_uncurry
2025-10-25 20:23:26 1ab7b2e
chore: rephrase leOnePart_le_one/negPart_nonpos (#30899)
The current phrasing is identical to that of the primed lemmas.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Group/PosPart.lean
+/- theorem leOnePart_le_one
2025-10-25 20:23:24 76f1b46
chore: remove duplicate `Ordinal.deriv_id_of_nfp_id` (#30893)
ESTIMATED CHANGES
Modified Mathlib/SetTheory/Ordinal/FixedPoint.lean
- theorem Ordinal.deriv_id_of_nfp_id
2025-10-25 19:37:51 2d528fd
chore: deprecate duplicate Rat.{nat,int}Cast_eq_zero and rename _eq_one lemmas (#30868)
ESTIMATED CHANGES
Modified Mathlib/Data/Rat/Defs.lean
- theorem Rat.intCast_eq_one
+ theorem Rat.intCast_eq_one_iff
- theorem Rat.intCast_eq_zero
- theorem Rat.natCast_eq_one
+ theorem Rat.natCast_eq_one_iff
- theorem Rat.natCast_eq_zero
Modified Mathlib/NumberTheory/Padics/PadicNumbers.lean
2025-10-25 18:20:54 985bd66
feat(RingTheory): Noetherian ring of fractions is semilocal (#30837)
A step towards showing invertible modules over Noetherian (comm.) rings are isomorphic to ideals, see https://mathoverflow.net/a/499611.
The argument is [due to Gemini](https://gemini.google.com/share/0266bae9b43b) even though it was initially mistaken.
A ring of fractions is a ring `R` that is its own ring of fractions (i.e. satisfying `IsFractionRing R R`). We show this is equivalent to the condition that all non-zerodivisors are units.
ESTIMATED CHANGES
Modified Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean
+ theorem isUnit_le_nonZeroDivisors
Modified Mathlib/RingTheory/Ideal/AssociatedPrime/Basic.lean
+ theorem biUnion_associatedPrimes_eq_compl_nonZeroDivisors
Modified Mathlib/RingTheory/Ideal/AssociatedPrime/Finiteness.lean
+ theorem Ideal.IsMaximal.mem_associatedPrimes_of_isFractionRing
Modified Mathlib/RingTheory/Localization/Basic.lean
Modified Mathlib/RingTheory/Localization/FractionRing.lean
+ theorem IsFractionRing.idem
+ theorem IsFractionRing.nonZeroDivisors_eq_isUnit
+ theorem IsFractionRing.self_iff_bijective
+ theorem IsFractionRing.self_iff_nonZeroDivisors_eq_isUnit
+ theorem IsFractionRing.self_iff_nonZeroDivisors_le_isUnit
+ theorem IsFractionRing.self_iff_surjective
+ theorem IsFractionRing.trans
2025-10-25 17:18:20 36f4b59
chore(Data/ENNReal): deprecate duplicate `sup_eq_zero` (#30883)
`ENNReal.sup_eq_zero` is a duplicate of `ENNReal.max_eq_zero_iff`, so it is deprecated.
ESTIMATED CHANGES
Modified Mathlib/Data/ENNReal/Real.lean
Modified Mathlib/Topology/MetricSpace/HausdorffDistance.lean
2025-10-25 17:18:18 b07925b
feat(AlgebraicGeometry): quasi-affine if covered by affine basic opens of global sections (#30286)
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean
+ theorem AlgebraicGeometry.Scheme.ker_toSpecΓ
Modified Mathlib/AlgebraicGeometry/Morphisms/Affine.lean
- theorem AlgebraicGeometry.isAffineOpen_of_isAffineOpen_basicOpen_aux
+ theorem AlgebraicGeometry.isRetrocompact_basicOpen
Modified Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.of_forall_source_exists_preimage
Modified Mathlib/AlgebraicGeometry/Morphisms/Immersion.lean
+/- theorem AlgebraicGeometry.IsImmersion.of_comp
Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean
Modified Mathlib/AlgebraicGeometry/QuasiAffine.lean
+ theorem AlgebraicGeometry.Scheme.IsQuasiAffine.isBasis_basicOpen
+ theorem AlgebraicGeometry.Scheme.IsQuasiAffine.of_forall_exists_mem_basicOpen
+ theorem AlgebraicGeometry.Scheme.IsQuasiAffine.of_isAffineHom
Modified Mathlib/Topology/Constructible.lean
+ theorem QuasiSeparatedSpace.of_isOpenCover
2025-10-25 16:12:01 9c935d6
chore(Data/Fintype/Sets): deprecate duplicate `toFinset_subset_toFinset_of_subset` (#30884)
I accidentally added the duplicate `toFinset_subset_toFinset_of_subset` of `toFinset_mono` when working on `grw`. So this PR deprecates it.
ESTIMATED CHANGES
Modified Mathlib/Data/Fintype/Sets.lean
2025-10-25 11:48:29 aa1b475
feat(CategoryTheory/Adjunction/PartialAdjunction): add symm naturality lemmas for HomEquiv and lift functor (#30143)
Add two lemmas for `partialRightAdjointHomEquiv` to help work with `partialRightAdjointHomEquiv.symm`.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Adjunction/PartialAdjoint.lean
+ theorem CategoryTheory.Functor.partialLeftAdjointHomEquiv_comp_symm
+ theorem CategoryTheory.Functor.partialLeftAdjointHomEquiv_symm_comp
+ theorem CategoryTheory.Functor.partialRightAdjointHomEquiv_comp_symm
+ theorem CategoryTheory.Functor.partialRightAdjointHomEquiv_symm_comp
2025-10-25 11:09:37 0852c3e
chore: don't push oleans to Cloudflare (#30875)
It's apparent that no one has the bandwidth right now to diagnose/deal with the problems we regularly see with the Cloudflare uploads, so I'm just switching them off.
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
2025-10-25 10:31:03 4b9bae0
feat(CategoryTheory/Limits/Shapes): (co)kernel as a functor (#30674)
and (co)kernel inclusion/projection as a natural transformation. Also fix a typo.
From ClassFieldTheory
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/Limits/Cones.lean
Added Mathlib/CategoryTheory/Limits/FunctorCategory/Shapes/Kernels.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean
+ theorem CategoryTheory.Limits.coker.condition
+ def CategoryTheory.Limits.coker.π
+ theorem CategoryTheory.Limits.ker.condition
+ def CategoryTheory.Limits.ker.ι
2025-10-25 08:12:12 aac77d1
feat(Algebra/BigOperators/Finsupp/Fin): add finTwoArrowEquiv (#30538)
Co-authored by: @AntoineChambert-Loir
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Finsupp/Fin.lean
+ theorem Finsupp.ofSupportFinite_fin_two_eq
+ theorem finTwoArrowEquiv'_sum_eq
2025-10-25 05:43:25 dc82ad5
chore: bump leantar to v0.1.16 (#30874)
ESTIMATED CHANGES
Modified Cache/IO.lean
2025-10-24 22:09:28 97d68c4
chore: deprecate duplicate Polynomial.monic_of_degree_le_of_coeff_eq_one (#30865)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Degree/Operations.lean
+ theorem Polynomial.monic_of_degree_le
- theorem Polynomial.monic_of_degree_le_of_coeff_eq_one
Modified Mathlib/Algebra/Polynomial/Monic.lean
- theorem Polynomial.monic_of_degree_le
Modified Mathlib/RingTheory/Polynomial/IntegralNormalization.lean
2025-10-24 20:56:08 668ca25
Fix: change how multigoal linter handles focus. (#30470)
Se #20081, moves focus to exclusions rather than ignoreBranch to get get multigoal linting inside haves and suffices. Fixes the places in the library where the linter now shows multiple goals; mostly this was just adding · but sometimes some small rearrangement. Adds a test for the new behaviour.
ESTIMATED CHANGES
Modified Archive/Wiedijk100Theorems/CubingACube.lean
Modified Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean
Modified Mathlib/Algebra/Lie/Weights/IsSimple.lean
Modified Mathlib/Algebra/Polynomial/Monomial.lean
Modified Mathlib/Algebra/Polynomial/Sequence.lean
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean
Modified Mathlib/AlgebraicGeometry/RationalMap.lean
Modified Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean
Modified Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean
Modified Mathlib/Analysis/InnerProductSpace/Harmonic/Constructions.lean
Modified Mathlib/Analysis/Meromorphic/Order.lean
Modified Mathlib/Analysis/SpecialFunctions/BinaryEntropy.lean
Modified Mathlib/Analysis/SpecialFunctions/ImproperIntegrals.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean
Modified Mathlib/CategoryTheory/Monad/Comonadicity.lean
Modified Mathlib/CategoryTheory/Monad/Monadicity.lean
Modified Mathlib/Data/List/NodupEquivFin.lean
Modified Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean
Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean
Modified Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean
Modified Mathlib/Order/RelSeries.lean
Modified Mathlib/RingTheory/Unramified/Finite.lean
Modified Mathlib/Tactic/Linter/Multigoal.lean
Modified MathlibTest/Multigoal.lean
2025-10-24 20:19:08 6d6ec67
chore: drop duplicate instance Rat.hasSolidNorm (#30864)
Also move the three concrete instances together.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Normed/Order/Lattice.lean
2025-10-24 20:19:06 39cfbec
feat: if the order topology for a dense linear ordering is discrete, the space has at most one point (#30856)
See also [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Characterisation.20of.20the.20integers/with/546911488)
ESTIMATED CHANGES
Modified Mathlib/Analysis/NormedSpace/PiTensorProduct/InjectiveSeminorm.lean
Modified Mathlib/Topology/Order/DenselyOrdered.lean
+ theorem DenselyOrdered.subsingleton_of_discreteTopology
2025-10-24 20:19:04 b820384
feat(Combinatorics/SimpleGraph): inducing a walk (#30590)
A walk which is fully contained within a set of vertices becomes a walk on the corresponding induced graph.
From the ProofBench workshop
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Maps.lean
+ theorem SimpleGraph.induce_adj
Modified Mathlib/Combinatorics/SimpleGraph/Walk.lean
+ theorem SimpleGraph.Walk.induce_cons
+ theorem SimpleGraph.Walk.induce_nil
+ theorem SimpleGraph.Walk.map_induce
+ theorem SimpleGraph.Walk.support_induce
2025-10-24 20:19:01 d9c991c
feat(CategoryTheory): LeftBousfield.W is stable under transfinite compositions (#30509)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Localization/BousfieldTransfiniteComposition.lean
Modified Mathlib/CategoryTheory/SmallObject/WellOrderInductionData.lean
2025-10-24 19:16:19 e2ef164
fix: make Set.Subsingleton.offDiag_eq_empty match its name (#30863)
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Prod.lean
2025-10-24 19:16:17 7d5591e
refactor(Algebra/Polynomial/Splits): switch from `Splits` to `Factors` (#30284)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Splits.lean
+/- theorem Polynomial.splits_C
+/- theorem Polynomial.splits_mul
+/- theorem Polynomial.splits_of_map_eq_C
+/- theorem Polynomial.splits_of_splits_id
+/- theorem Polynomial.splits_zero
Modified Mathlib/FieldTheory/IsAlgClosed/Basic.lean
Modified Mathlib/FieldTheory/IsSepClosed.lean
Modified Mathlib/FieldTheory/SeparableDegree.lean
2025-10-24 18:46:47 afceaae
chore: deprecate Nat.factorization_eq_zero_of_non_prime (#30862)
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Choose/Factorization.lean
Modified Mathlib/Data/Nat/Factorization/Basic.lean
Modified Mathlib/Data/Nat/Factorization/Defs.lean
- theorem Nat.factorization_eq_zero_of_non_prime
+ theorem Nat.factorization_eq_zero_of_not_prime
Modified Mathlib/Data/Nat/Factorization/PrimePow.lean
Modified Mathlib/Data/Nat/Squarefree.lean
Modified Mathlib/NumberTheory/Bertrand.lean
2025-10-24 16:40:49 a0a0b57
feat(GroupTheory/Finiteness): submonoid finiteness from well-quasi-order, Gordan's lemma (#30840)
We show that in a monoid whose algebraic order is a well-quasi-order (typical example is `ℕ ^ k`), any subtractive submonoid is finitely generated. As a corollary, `AddMonoidHom.eqLocusM f g` is finitely generated, which is also known as [a version of Gordan's lemma](https://en.wikipedia.org/wiki/Gordan%27s_lemma) when specialized for `ℕ ^ k`.
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Finiteness.lean
+ theorem AddSubmonoid.fg_eqLocusM
+ theorem AddSubmonoid.fg_of_subtractive
2025-10-24 15:50:23 f9c58af
feat: `isProperMap_fst_of_compactSpace`, `IsProperMap.restrictPreimage` (#30410)
ESTIMATED CHANGES
Modified Mathlib/Topology/Compactness/Compact.lean
- theorem isClosedMap_fst_of_compactSpace
- theorem isClosedMap_snd_of_compactSpace
Modified Mathlib/Topology/IsClosedRestrict.lean
Modified Mathlib/Topology/LocalAtTarget.lean
+ theorem IsProperMap.restrictPreimage
Modified Mathlib/Topology/Maps/Proper/Basic.lean
+ theorem isClosedMap_fst_of_compactSpace
+ theorem isClosedMap_snd_of_compactSpace
+ theorem isProperMap_const
+ theorem isProperMap_const_iff
+ theorem isProperMap_fst_of_compactSpace
+ theorem isProperMap_snd_of_compactSpace
2025-10-24 15:50:21 f055b42
feat(Topology): the topology generated by a family of spaces (#29341)
Some categories of topological spaces are "convenient" in the sense that they have nice categorical properties (e.g. they have limits, colimits and are cartesian closed). This PR is the first in a series towards showing that delta generated spaces form a cartesian closed monoidal category (see https://github.com/joelriou/topcat-model-category/blob/852a514c1d955ab586507bcd5a7b5efb99c6c3df/TopCatModelCategory/Convenient/CartesianClosed.lean#L92 for the general result), and this result is part of my formalization effort towards the Quillen model category structure on simplicial sets.
In this PR, given a family `X` of topological spaces, and a topological space `Y`, we introduce the `X`-generated topology on `Y`, which is coinduced by all continuous maps `X i → Y`.
(Eventually, this will generalize previous works by Dagur Asgeirsson and Ben Eltschig about compactly/delta generated spaces in mathlib. At some point, their definitions will be refactored as particular cases of the definitions in this PR series.)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Topology/Convenient/GeneratedBy.lean
+ def TopologicalSpace.generatedBy
+ theorem TopologicalSpace.generatedBy_le
+ theorem TopologicalSpace.generatedBy_mono
+ theorem Topology.IsGeneratedBy.continuous_iff
+ theorem Topology.IsGeneratedBy.equiv_symm_comp_continuous_iff
+ theorem Topology.IsGeneratedBy.generatedBy_eq
+ def Topology.IsGeneratedBy.homeomorph
+ theorem Topology.IsGeneratedBy.homeomorph_coe
+ theorem Topology.IsGeneratedBy.homeomorph_symm_coe
+ theorem Topology.IsGeneratedBy.iff_le_generatedBy
+ theorem Topology.IsGeneratedBy.isClosed_iff
+ theorem Topology.IsGeneratedBy.isOpen_iff
+ theorem Topology.IsGeneratedBy.le_generatedBy
+ theorem Topology.IsQuotientMap.isGeneratedBy
+ theorem Topology.WithGeneratedByTopology.continuous_equiv
+ theorem Topology.WithGeneratedByTopology.continuous_from_iff
+ def Topology.WithGeneratedByTopology.equiv
+ theorem Topology.WithGeneratedByTopology.isClosed_iff
+ theorem Topology.WithGeneratedByTopology.isOpen_iff
+ def Topology.WithGeneratedByTopology
Modified docs/references.bib
2025-10-24 14:57:48 c65bb0b
refactor(Topology/UniformSpace): use `SetRel` (#23181)
What's left in `UniformSpace.Defs` is precisely the theory of the uniformity filter.
The motivation is that the theory of coverings and packings in both high dimensional probability and dynamics can be based on entourages, while they have little to do with the uniformity filter (indeed, entourages are in a sense a quantitative version of the uniformity filter).
ESTIMATED CHANGES
Modified Mathlib/Data/Rel.lean
+ theorem SetRel.prod_subset_comm
Modified Mathlib/Dynamics/TopologicalEntropy/CoverEntropy.lean
+/- theorem Dynamics.IsDynCoverOf.coverMincard_le_card
+/- theorem Dynamics.IsDynCoverOf.iterate_le_pow
+/- theorem Dynamics.IsDynCoverOf.nonempty
+/- theorem Dynamics.IsDynCoverOf.nonempty_inter
+/- theorem Dynamics.IsDynCoverOf.of_entourage_subset
+/- theorem Dynamics.IsDynCoverOf.of_le
+/- def Dynamics.IsDynCoverOf
+/- theorem Dynamics.coverEntropyEntourage_empty
+/- theorem Dynamics.coverEntropyEntourage_le_coverEntropy
+/- theorem Dynamics.coverEntropyEntourage_nonneg
+/- theorem Dynamics.coverEntropyInfEntourage_empty
+/- theorem Dynamics.coverEntropyInfEntourage_le_coverEntropyEntourage
+/- theorem Dynamics.coverEntropyInfEntourage_le_coverEntropyInf
+/- theorem Dynamics.coverEntropyInfEntourage_nonneg
+/- theorem Dynamics.coverEntropyInf_eq_iSup_basis
+/- theorem Dynamics.coverEntropy_eq_iSup_basis
+/- theorem Dynamics.coverMincard_empty
+/- theorem Dynamics.coverMincard_eq_zero_iff
+/- theorem Dynamics.coverMincard_finite_iff
+/- theorem Dynamics.coverMincard_le_pow
+/- theorem Dynamics.coverMincard_monotone_time
+/- theorem Dynamics.coverMincard_mul_le_pow
+/- theorem Dynamics.coverMincard_zero
+/- theorem Dynamics.isDynCoverOf_empty
+/- theorem Dynamics.isDynCoverOf_zero
+/- theorem Dynamics.nonempty_inter_of_coverMincard
+/- theorem Dynamics.one_le_coverMincard_iff
Modified Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean
+/- theorem Dynamics.ball_dynEntourage_mem_nhds
+/- def Dynamics.dynEntourage
+/- theorem Dynamics.dynEntourage_antitone
+/- theorem Dynamics.dynEntourage_comp_subset
+/- theorem Dynamics.dynEntourage_eq_inter_Ico
+/- theorem Dynamics.dynEntourage_mem_uniformity
+/- theorem Dynamics.dynEntourage_one
+/- theorem Dynamics.dynEntourage_zero
+/- theorem Dynamics.mem_ball_dynEntourage
+/- theorem Dynamics.mem_ball_dynEntourage_comp
+/- theorem Dynamics.mem_dynEntourage
Modified Mathlib/Dynamics/TopologicalEntropy/NetEntropy.lean
+/- theorem Dynamics.IsDynNetIn.card_le_card_of_isDynCoverOf
+/- theorem Dynamics.IsDynNetIn.card_le_netMaxcard
+/- theorem Dynamics.IsDynNetIn.of_entourage_subset
+/- theorem Dynamics.IsDynNetIn.of_le
+/- def Dynamics.IsDynNetIn
+/- theorem Dynamics.coverEntropyEntourage_le_netEntropyEntourage
+/- theorem Dynamics.coverEntropyInfEntourage_le_netEntropyInfEntourage
+/- theorem Dynamics.coverMincard_le_netMaxcard
+/- theorem Dynamics.isDynNetIn_empty
+/- theorem Dynamics.isDynNetIn_singleton
+/- theorem Dynamics.netEntropyEntourage_empty
+/- theorem Dynamics.netEntropyEntourage_le_coverEntropy
+/- theorem Dynamics.netEntropyEntourage_le_coverEntropyEntourage
+/- theorem Dynamics.netEntropyEntourage_nonneg
+/- theorem Dynamics.netEntropyInfEntourage_empty
+/- theorem Dynamics.netEntropyInfEntourage_le_coverEntropyInf
+/- theorem Dynamics.netEntropyInfEntourage_le_coverEntropyInfEntourage
+/- theorem Dynamics.netEntropyInfEntourage_le_netEntropyEntourage
+/- theorem Dynamics.netEntropyInfEntourage_nonneg
+/- theorem Dynamics.netMaxcard_empty
+/- theorem Dynamics.netMaxcard_eq_zero_iff
+/- theorem Dynamics.netMaxcard_finite_iff
+/- theorem Dynamics.netMaxcard_infinite_iff
+/- theorem Dynamics.netMaxcard_le_coverMincard
+/- theorem Dynamics.netMaxcard_monotone_time
+/- theorem Dynamics.netMaxcard_univ
+/- theorem Dynamics.netMaxcard_zero
+/- theorem Dynamics.one_le_netMaxcard_iff
Modified Mathlib/Dynamics/TopologicalEntropy/Semiconj.lean
+/- theorem Dynamics.IsDynCoverOf.image
+/- theorem Dynamics.IsDynCoverOf.preimage
+/- theorem Dynamics.coverEntropyEntourage_image_le
+/- theorem Dynamics.coverEntropyInfEntourage_image_le
+/- theorem Dynamics.coverMincard_image_le
+/- theorem Dynamics.le_coverEntropyEntourage_image
+/- theorem Dynamics.le_coverEntropyInfEntourage_image
+/- theorem Dynamics.le_coverMincard_image
Modified Mathlib/Dynamics/TopologicalEntropy/Subset.lean
Modified Mathlib/InformationTheory/Hamming.lean
Modified Mathlib/MeasureTheory/Measure/RegularityCompacts.lean
Modified Mathlib/Topology/MetricSpace/BundledFun.lean
- theorem PseudoMetric.IsUltra.isTransitiveRel_ball
- theorem PseudoMetric.IsUltra.isTransitiveRel_closedBall
- theorem PseudoMetric.isSymmetricRel_ball
- theorem PseudoMetric.isSymmetricRel_closedBall
Modified Mathlib/Topology/MetricSpace/PiNat.lean
Modified Mathlib/Topology/Metrizable/Uniformity.lean
Modified Mathlib/Topology/UniformSpace/Ascoli.lean
Modified Mathlib/Topology/UniformSpace/Basic.lean
+/- theorem Dense.biUnion_uniformity_ball
+/- theorem Filter.HasBasis.mem_uniformity_iff
+/- theorem Filter.HasBasis.uniformity_closure
- theorem IsSymmetricRel.entourageProd
+/- theorem UniformSpace.isClosed_ball
+/- theorem UniformSpace.isOpen_ball
+/- theorem UniformSpace.uniformSpace_eq_bot
+/- theorem ball_entourageProd
+/- theorem ball_preimage
+/- theorem bot_uniformity
+/- theorem closure_eq_inter_uniformity
+/- theorem comp_open_symm_mem_uniformity_sets
+/- theorem discreteTopology_of_discrete_uniformity
+/- def entourageProd
+/- theorem entourageProd_mem_uniformity
+/- theorem eventually_uniformity_comp_subset
+/- theorem eventually_uniformity_iterate_comp_subset
+/- theorem interior_mem_uniformity
+/- theorem mem_entourageProd
+/- theorem mem_uniformity_isClosed
+/- theorem nhdset_of_mem_uniformity
+/- theorem uniformity_hasBasis_closure
+/- theorem uniformity_hasBasis_open
+/- theorem union_mem_uniformity_sum
Modified Mathlib/Topology/UniformSpace/Cauchy.lean
+/- theorem CauchySeq.subseq_mem
+/- theorem CauchySeq.subseq_subseq_mem
+/- theorem Filter.HasBasis.cauchy_iff
+/- theorem Filter.HasBasis.totallyBounded_iff
+/- theorem Filter.Tendsto.subseq_mem_entourage
+/- theorem TotallyBounded.exists_subset
+/- theorem UniformSpace.complete_of_convergent_controlled_sequences
+/- theorem cauchySeq_of_controlled
+/- def interUnionBalls
+/- theorem isCompact_closure_interUnionBalls
+/- theorem totallyBounded_interUnionBalls
+ theorem totallyBounded_of_forall_isSymm
- theorem totallyBounded_of_forall_symm
Modified Mathlib/Topology/UniformSpace/Compact.lean
Modified Mathlib/Topology/UniformSpace/CompactConvergence.lean
Modified Mathlib/Topology/UniformSpace/Completion.lean
+/- theorem CauchyFilter.basis_uniformity
+/- def CauchyFilter.gen
+/- theorem CauchyFilter.monotone_gen
Modified Mathlib/Topology/UniformSpace/Defs.lean
+/- theorem Filter.HasBasis.biInter_biUnion_ball
+/- theorem IsSymmetricRel.eq
+/- theorem IsSymmetricRel.iInter
+/- theorem IsSymmetricRel.inter
+/- theorem IsSymmetricRel.mk_mem_comm
+/- theorem IsSymmetricRel.sInter
+/- def IsSymmetricRel
+/- theorem Monotone.compRel
+ theorem SetRel.mem_filter_prod_comm
+/- theorem UniformSpace.ball_eq_of_symmetry
+/- theorem UniformSpace.ball_mem_nhds
+/- theorem UniformSpace.ball_mem_nhdsWithin
+/- theorem UniformSpace.mem_ball_self
+/- theorem UniformSpace.mem_ball_symmetry
+/- theorem UniformSpace.mem_comp_comp
+/- theorem UniformSpace.mem_comp_of_mem_ball
+/- theorem UniformSpace.mem_uniformity_ofCore_iff
+/- theorem comp3_mem_uniformity
+/- def compRel
+/- theorem compRel_assoc
- theorem compRel_mono
+/- theorem comp_comp_symm_mem_uniformity_sets
+/- theorem comp_le_uniformity3
+/- theorem comp_le_uniformity
+/- theorem comp_mem_uniformity_sets
+/- theorem comp_symm_mem_uniformity_sets
+/- theorem comp_symm_of_uniformity
- theorem eq_singleton_prod_subset_idRel
+/- theorem idRel_subset
+/- theorem id_compRel
- theorem isSymmetricRel_idRel
- theorem isSymmetricRel_univ
+/- theorem left_subset_compRel
+/- theorem lift'_comp_uniformity
+/- theorem mem_compRel
+/- theorem mem_nhds_left
+/- theorem mem_nhds_right
+/- theorem mem_uniformity_of_eq
+/- theorem nhds_basis_uniformity'
+/- theorem nhds_basis_uniformity
- theorem prodMk_mem_compRel
+/- theorem refl_le_uniformity
+/- theorem refl_mem_uniformity
+/- theorem right_subset_compRel
+/- theorem subset_comp_self
+/- theorem subset_comp_self_of_mem_uniformity
+/- theorem subset_iterate_compRel
+/- theorem symm_of_uniformity
+/- theorem symmetric_symmetrizeRel
+/- def symmetrizeRel
+/- theorem symmetrizeRel_subset_self
+/- theorem symmetrize_mem_uniformity
+/- theorem symmetrize_mono
+/- theorem uniformity_lift_le_comp
+/- theorem uniformity_lift_le_swap
Modified Mathlib/Topology/UniformSpace/DiscreteUniformity.lean
- theorem DiscreteUniformity.eq_principal_idRel
+ theorem DiscreteUniformity.eq_principal_relId
- theorem DiscreteUniformity.idRel_mem_uniformity
+ theorem DiscreteUniformity.relId_mem_uniformity
- theorem discreteUniformity_iff_eq_principal_idRel
+ theorem discreteUniformity_iff_eq_principal_relId
- theorem discreteUniformity_iff_idRel_mem_uniformity
+ theorem discreteUniformity_iff_relId_mem_uniformity
Modified Mathlib/Topology/UniformSpace/Equicontinuity.lean
Modified Mathlib/Topology/UniformSpace/HeineCantor.lean
Modified Mathlib/Topology/UniformSpace/OfCompactT2.lean
Modified Mathlib/Topology/UniformSpace/OfFun.lean
Modified Mathlib/Topology/UniformSpace/Separation.lean
Modified Mathlib/Topology/UniformSpace/Ultra/Basic.lean
- theorem IsTransitiveRel.ball_subset_of_mem
+/- theorem IsTransitiveRel.comp_eq_of_idRel_subset
+/- theorem IsTransitiveRel.comp_subset_self
+/- theorem IsTransitiveRel.iInter
+/- theorem IsTransitiveRel.inter
- theorem IsTransitiveRel.isOpen_ball_of_mem_uniformity
+/- theorem IsTransitiveRel.mem_filter_prod_trans
+/- theorem IsTransitiveRel.prod_subset_trans
+/- theorem IsTransitiveRel.sInter
+/- theorem IsTransitiveRel.symmetrizeRel
+/- def IsTransitiveRel
+/- theorem IsUltraUniformity.mk_of_hasBasis
- theorem UniformSpace.ball_eq_of_mem_of_isSymmetricRel_of_isTransitiveRel
+ theorem UniformSpace.isClopen_ball_of_isSymm_of_isTrans_of_mem_uniformity
- theorem UniformSpace.isClopen_ball_of_isSymmetricRel_of_isTransitiveRel_of_mem_uniformity
+ theorem UniformSpace.isClosed_ball_of_isSymm_of_isTrans_of_mem_uniformity
- theorem UniformSpace.isClosed_ball_of_isSymmetricRel_of_isTransitiveRel_of_mem_uniformity
+ theorem UniformSpace.isOpen_ball_of_mem_uniformity
+ theorem ball_eq_of_mem
+ theorem ball_subset_of_mem
- theorem isTransitiveRel_idRel
+/- theorem isTransitiveRel_iff_comp_subset_self
Modified Mathlib/Topology/UniformSpace/Ultra/Completion.lean
- theorem IsSymmetricRel.cauchyFilter_gen
- theorem IsTransitiveRel.cauchyFilter_gen
Modified Mathlib/Topology/UniformSpace/Ultra/Constructions.lean
- theorem IsTransitiveRel.entourageProd
Modified Mathlib/Topology/UniformSpace/UniformApproximation.lean
Modified Mathlib/Topology/UniformSpace/UniformConvergence.lean
Modified Mathlib/Topology/UniformSpace/UniformEmbedding.lean
2025-10-24 11:00:10 50c7f34
feat(RingTheory/IsTensorProduct): add `IsPushout.cancelBaseChange` (#28772)
This is a cancel-on-the-left version of `AlgebraTensorModule.cancelBaseChange`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Basic.lean
Modified Mathlib/Algebra/RingQuot.lean
Modified Mathlib/Analysis/RCLike/Inner.lean
Modified Mathlib/RingTheory/IsTensorProduct.lean
+ def Algebra.IsPushout.cancelBaseChange
+ def Algebra.IsPushout.cancelBaseChangeAux
+ theorem Algebra.IsPushout.cancelBaseChangeAux_symm_tmul
+ theorem Algebra.IsPushout.cancelBaseChange_symm_tmul
+ theorem Algebra.IsPushout.cancelBaseChange_tmul
2025-10-24 11:00:07 31888ce
chore(Data): `SetLike Finset` (#28241)
ESTIMATED CHANGES
Modified Counterexamples/AharoniKorman.lean
+/- theorem Hollom.chainBetween_isChain
Modified Mathlib/Algebra/BigOperators/Field.lean
+/- theorem Finset.dens_biUnion
Modified Mathlib/Algebra/BigOperators/Finprod.lean
Modified Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean
+/- theorem Finset.card_biUnion
Modified Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean
Modified Mathlib/Algebra/GroupWithZero/Action/Pointwise/Finset.lean
Modified Mathlib/Algebra/Module/FinitePresentation.lean
Modified Mathlib/Algebra/MvPolynomial/Variables.lean
+/- theorem MvPolynomial.aeval_ite_mem_eq_self
Modified Mathlib/Algebra/Polynomial/Roots.lean
Modified Mathlib/Algebra/Squarefree/Basic.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean
Modified Mathlib/Analysis/Normed/Affine/Convex.lean
Modified Mathlib/Combinatorics/Additive/RuzsaCovering.lean
Modified Mathlib/Combinatorics/Additive/VerySmallDoubling.lean
Modified Mathlib/Combinatorics/SetFamily/LYM.lean
+/- theorem Finset.lubell_yamamoto_meshalkin_inequality_sum_inv_choose
+/- theorem IsAntichain.sperner
Modified Mathlib/Combinatorics/SimpleGraph/Clique.lean
Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/WalkCounting.lean
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean
Modified Mathlib/Data/DFinsupp/Defs.lean
Modified Mathlib/Data/ENNReal/BigOperators.lean
Modified Mathlib/Data/Finset/Attach.lean
+/- theorem Finset.coe_attach
Modified Mathlib/Data/Finset/Basic.lean
+/- def Finset.equivToSet
Modified Mathlib/Data/Finset/Defs.lean
+/- theorem Finset.coe_ssubset
- def Finset.toSet
Modified Mathlib/Data/Finset/Insert.lean
Modified Mathlib/Data/Finset/Pi.lean
Modified Mathlib/Data/Finset/Union.lean
Modified Mathlib/Data/Set/Card.lean
Modified Mathlib/Data/Set/Card/Arithmetic.lean
Modified Mathlib/FieldTheory/Finite/GaloisField.lean
Modified Mathlib/FieldTheory/Perfect.lean
Modified Mathlib/GroupTheory/Finiteness.lean
Modified Mathlib/GroupTheory/Perm/Centralizer.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Basic.lean
Modified Mathlib/LinearAlgebra/Basis/Cardinality.lean
Modified Mathlib/LinearAlgebra/Dimension/Constructions.lean
Modified Mathlib/LinearAlgebra/Finsupp/Supported.lean
Modified Mathlib/LinearAlgebra/LinearIndependent/Basic.lean
Modified Mathlib/LinearAlgebra/LinearIndependent/Defs.lean
Modified Mathlib/MeasureTheory/Integral/IntegrableOn.lean
Modified Mathlib/MeasureTheory/Measure/Restrict.lean
Modified Mathlib/ModelTheory/FinitelyGenerated.lean
Modified Mathlib/ModelTheory/Semantics.lean
Modified Mathlib/Order/CountableDenseLinearOrder.lean
Modified Mathlib/Probability/Independence/InfinitePi.lean
Modified Mathlib/Probability/Independence/Kernel.lean
Modified Mathlib/Probability/Process/Filtration.lean
Modified Mathlib/Probability/ProductMeasure.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/Functoriality.lean
Modified Mathlib/RingTheory/Extension/Generators.lean
Modified Mathlib/RingTheory/GradedAlgebra/FiniteType.lean
Modified Mathlib/RingTheory/Ideal/Quotient/Index.lean
Modified Mathlib/RingTheory/IntegralClosure/IsIntegral/Basic.lean
Modified Mathlib/RingTheory/Kaehler/Basic.lean
Modified Mathlib/RingTheory/Noetherian/OfPrime.lean
Modified Mathlib/RingTheory/Polynomial/ContentIdeal.lean
+/- def Polynomial.contentIdeal
+/- theorem Polynomial.contentIdeal_def
Modified Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean
Modified Mathlib/RingTheory/Spectrum/Prime/Polynomial.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/SummationFilter.lean
Modified Mathlib/Topology/ClopenBox.lean
Modified Mathlib/Topology/Compactness/Bases.lean
Modified Mathlib/Topology/Compactness/Compact.lean
Modified Mathlib/Topology/DiscreteQuotient.lean
Modified Mathlib/Topology/Instances/ENNReal/Lemmas.lean
Modified Mathlib/Topology/Order/HullKernel.lean
Modified Mathlib/Topology/Separation/Basic.lean
2025-10-24 10:20:09 301d992
chore(GroupTheory/Index): move awkwardly placed lemmas (#30832)
The lemmas `Subgroup.toSubmonoid_zpowers` and `Submonoid.powers_le_zpowers` were awkwardly placed at the top of `Index.lean` despite being unrelated to the contents of that file. I have moved them to directly afterward `closure_toSubmonoid` which is thematically similar and also the key ingredient in the proof.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Subgroup/Pointwise.lean
+ theorem Subgroup.toSubmonoid_zpowers
+ theorem Submonoid.powers_le_zpowers
Modified Mathlib/GroupTheory/Index.lean
- theorem Subgroup.toSubmonoid_zpowers
- theorem Submonoid.powers_le_zpowers
2025-10-24 09:13:58 3d2dfe8
feat(Data/Finset/Card): add some more Pigeonhole Principle theorems `exists_ne_map_eq_of_card_image_lt` and `not_injOn_of_card_image_lt` (#28077)
`exists_ne_map_eq_of_card_image_lt` is a special case of `exists_ne_map_eq_of_card_lt_of_maps_to` where `t` is `s.image f`, and `not_injOn_of_card_image_lt` is its variant using `Set.InjOn`. I ran into some cases where such theorems would save me some time.
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/Card.lean
+ theorem Finset.exists_ne_map_eq_of_card_image_lt
+ theorem Finset.not_injOn_of_card_image_lt
2025-10-24 05:21:51 be9d1e4
feat(DedekindDomain): formulas for the different ideal in the compositum of disjoint extensions (#29770)
Let `A ⊆ B` be a finite extension of Dedekind domains and assume that `A ⊆ R₁, R₂ ⊆ B` are two subrings such that `R₁ ⊔ R₂ = B`, their fractions fields are linearly disjoint (over the fraction field of `A`) and that `𝓓(R₁/A)` and `𝓓(R₂/A)` are coprime, where `𝓓` denote the different ideal.
We prove in particular: `𝓓(B/A) = 𝓓(R₁/A) * 𝓓(R₂/A)`
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/RingTheory/DedekindDomain/Different.lean
Added Mathlib/RingTheory/DedekindDomain/LinearDisjoint.lean
+ theorem FractionalIdeal.differentIdeal_dvd_map_differentIdeal
+ theorem FractionalIdeal.differentIdeal_eq_differentIdeal_mul_differentIdeal_of_isCoprime
+ theorem FractionalIdeal.differentIdeal_eq_map_differentIdeal
+ theorem FractionalIdeal.map_differentIdeal_dvd_differentIdeal
+ theorem Submodule.traceDual_le_span_map_traceDual
Modified Mathlib/RingTheory/FractionalIdeal/Extended.lean
+ theorem FractionalIdeal.coe_extendedHomₐ_eq_span
+ theorem FractionalIdeal.extended_le_one_of_le_one
+ theorem FractionalIdeal.one_le_extended_of_one_le
2025-10-24 01:54:07 4c627ad
chore: LEAN_SRC_PATH for reap (#30839)
Followup to #30818. We also need to update the LEAN_SRC_PATH pre-emptively.
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
2025-10-23 23:46:50 e37e4dc
feat(FieldTheory): construct extension of finite field (#30738)
We develop the theory of extensions of finite fields: given any finite field `k` and any `n > 0` there is a unique (up to in geneeral non-unique isomorphism) extension of `k` of degree `n`, which is galois with cyclic galois group generated by the (arithmetic) Frobenius map `x ↦ x ^ Nat.card k`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Ring/GeomSum.lean
+ theorem dvd_pow_pow_sub_self_of_dvd
+ theorem dvd_pow_sub_one_of_dvd
Added Mathlib/FieldTheory/Finite/Extension.lean
+ theorem FiniteField.Extension.exists_frob_pow_eq
+ theorem FiniteField.Extension.frob_apply
+ def FiniteField.Extension
+ theorem FiniteField.card_algEquiv_extension
+ theorem FiniteField.finrank_extension
+ theorem FiniteField.finrank_zmod_extension
+ theorem FiniteField.natCard_algEquiv_extension
+ theorem FiniteField.natCard_extension
+ theorem FiniteField.nonempty_algHom_extension
Modified Mathlib/FieldTheory/Finite/GaloisField.lean
+ theorem FiniteField.card_algHom_of_finrank_dvd
+ theorem FiniteField.natCard_algHom_of_finrank_dvd
+ theorem FiniteField.nonempty_algHom_iff_finrank_dvd
+ theorem FiniteField.nonempty_algHom_of_finrank_dvd
+ theorem FiniteField.pow_finrank_eq_card
+ theorem FiniteField.pow_finrank_eq_natCard
2025-10-23 22:55:32 b1e4080
chore: do not double-build nightly-testing non-fork PRs (#30834)
They are already built by build.yml as part of branch pushes
ESTIMATED CHANGES
Modified .github/workflows/build_fork.yml
Modified .github/workflows/mk_build_yml.sh
2025-10-23 22:33:20 e091017
feat: convexOn_rpow_left (#30829)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean
+ theorem convexOn_rpow_left
2025-10-23 21:34:26 090ad2e
feat: add `ContinuousSMul` instances for `ℚ≥0` (#28474)
ESTIMATED CHANGES
Modified Mathlib/Topology/Instances/Rat.lean
2025-10-23 20:35:52 0808490
feat: enorm_div_rev (#30830)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Normed/Group/Basic.lean
+ theorem enorm_div_rev
2025-10-23 20:09:56 e3d2a83
feat(Algebra/Star): define the intrinsic star on linear maps (#29941)
This pr defines the _intrinsic_ star operation on linear maps `E →ₗ F` where `(star f) x = star (f (star x))`.
This corresponds to a map being star-preserving, i.e., a map is self-adjoint iff it is star-preserving.
This is scoped to `IntrinsicStar` as to not conflict with the global instance on `E →ₗ[𝕜] E` on finite-dimensional Hilbert spaces, where `star` is defined as `LinearMap.adjoint`. These are mathematically distinct instances.
In a finite-dimensional C⋆-algebra with a positive linear functional, which induces the GNS Hilbert space (TODO) and a coalgebra given by the adjoint of the multiplication map and the algebra unit map (TODO), we get a star ring where multiplication is given by the convolution product (#25183) and star is given by the intrinsic star.
In such a space, we can then define the isomorphism `(E →ₗ[ℂ] F) ≃⋆ₐ (F ⊗[ℂ] Eᵐᵒᵖ)`, which is an important identification in the theory of non-commutative graphs.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Algebra/Star/LinearMap.lean
+ def LinearMap.intrinsicInvolutiveStar
+ def LinearMap.intrinsicStar
+ def LinearMap.intrinsicStarAddMonoid
+ theorem LinearMap.intrinsicStarModule
+ theorem LinearMap.intrinsicStar_apply
+ theorem LinearMap.intrinsicStar_comp
+ theorem LinearMap.intrinsicStar_id
+ theorem LinearMap.intrinsicStar_mulLeft
+ theorem LinearMap.intrinsicStar_mulRight
+ theorem LinearMap.intrinsicStar_zero
+ theorem LinearMap.isSelfAdjoint_iff_map_star
2025-10-23 17:08:45 0ceaa55
feat: interplay of posPart, negPart, untop₀, min and max (#30774)
Add a host of elementary (but somewhat delicate) lemmas on the interplay of posPart, negPart, untop₀, min, and max.
This material is used in [Project VD](https://github.com/kebekus/ProjectVD), which aims to formalize Value Distribution Theory for meromorphic functions on the complex plane. It will be used in follow-up PRs to compare pole- and zero-divisors attached to meromorphic functions on the complex plane, and their behavior under algebraic manipulations of the functions.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Group/PosPart.lean
+ theorem leOnePart_max
+ theorem leOnePart_min
+ theorem oneLePart_max
+ theorem oneLePart_min
Modified Mathlib/Algebra/Order/WithTop/Untop0.lean
+ theorem WithTop.le_of_untop₀_le_untop₀
+/- def WithTop.untop₀
+ theorem WithTop.untop₀_le_untop₀
+ theorem WithTop.untop₀_le_untop₀_iff
+ theorem WithTop.untop₀_max
+ theorem WithTop.untop₀_min
+/- theorem WithTop.untop₀_neg
+/- theorem WithTop.untop₀_nonneg
2025-10-23 17:08:44 66ac8ae
chore: remove more instance fields (#30753)
This PR is a follow up on #30734, doing some cases that weren't done in that PR.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/ULift.lean
Modified Mathlib/Algebra/RingQuot.lean
Modified Mathlib/Algebra/Star/Pointwise.lean
Modified Mathlib/Analysis/Matrix.lean
Modified Mathlib/Geometry/Convex/Cone/Basic.lean
Modified Mathlib/NumberTheory/ArithmeticFunction.lean
2025-10-23 17:08:42 0fb521d
feat(Data/Set/Pairwise): prove pairwise results for Chains, move `Set.pairwise_iUnion₂` (#28119)
Initiate a new file `Data/Set/Pairwise/Chain.lean` which makes some `Pairwise` results available to the `IsChain` predicate.
In the process, move `Set.pairwise_iUnion₂` to group it with similar results. Perform some variable harmonization.
Part of Carleson, original result by Edward van de Meent.
Moves:
- `Set.pairwise_iUnion₂`: from `Data.Set.Lattice` to `Data.Set.Pairwise.Lattice`
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Data/Set/Lattice.lean
- theorem Set.pairwise_iUnion₂
Added Mathlib/Data/Set/Pairwise/Chain.lean
+ theorem IsChain.pairwiseDisjoint_iUnion₂
+ theorem IsChain.pairwiseDisjoint_sUnion
+ theorem IsChain.pairwise_iUnion₂
+ theorem IsChain.pairwise_sUnion
Modified Mathlib/Data/Set/Pairwise/Lattice.lean
+/- theorem Set.pairwise_iUnion
+ theorem Set.pairwise_iUnion₂
+ theorem Set.pairwise_iUnion₂_iff
+/- theorem Set.pairwise_sUnion
2025-10-23 17:08:40 0a19b1f
feat: sharp bounds for `‖exp (I * x) - 1‖` when `x` is real (#27252)
From Carleson
ESTIMATED CHANGES
Modified Mathlib/Analysis/Complex/Trigonometric.lean
+ theorem Complex.enorm_exp_I_mul_ofReal
+ theorem Complex.enorm_exp_ofReal_mul_I
+ theorem Complex.nnnorm_exp_I_mul_ofReal
+ theorem Complex.nnnorm_exp_ofReal_mul_I
+ theorem Complex.norm_exp_I_mul_ofReal
+ theorem Complex.norm_exp_I_mul_ofReal_sub_one
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Bounds.lean
+ theorem Real.enorm_exp_I_mul_ofReal_sub_one_le
+ theorem Real.nnnorm_exp_I_mul_ofReal_sub_one_le
+ theorem Real.norm_exp_I_mul_ofReal_sub_one_le
2025-10-23 14:48:48 32bd6c7
style(Data): fix whitespace (#30778)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/Data/Fin/Fin2.lean
Modified Mathlib/Data/Finmap.lean
Modified Mathlib/Data/Finset/Card.lean
Modified Mathlib/Data/Finset/Insert.lean
+/- theorem Finset.not_nontrivial_empty
+/- theorem Finset.not_nontrivial_singleton
Modified Mathlib/Data/Finset/Lattice/Basic.lean
+/- theorem Finset.subset_union_right
Modified Mathlib/Data/Fintype/Fin.lean
Modified Mathlib/Data/Int/Bitwise.lean
Modified Mathlib/Data/Int/Cast/Defs.lean
Modified Mathlib/Data/List/Basic.lean
Modified Mathlib/Data/List/Destutter.lean
Modified Mathlib/Data/List/Nodup.lean
Modified Mathlib/Data/List/Perm/Basic.lean
Modified Mathlib/Data/List/Rotate.lean
Modified Mathlib/Data/List/TakeWhile.lean
Modified Mathlib/Data/Multiset/Basic.lean
Modified Mathlib/Data/Multiset/UnionInter.lean
Modified Mathlib/Data/Nat/Bits.lean
Modified Mathlib/Data/Nat/Cast/Defs.lean
Modified Mathlib/Data/Nat/Choose/Basic.lean
Modified Mathlib/Data/Nat/Choose/Mul.lean
Modified Mathlib/Data/Nat/Factorial/SuperFactorial.lean
Modified Mathlib/Data/Nat/Log.lean
Modified Mathlib/Data/Option/Basic.lean
Modified Mathlib/Data/PSigma/Order.lean
Modified Mathlib/Data/Part.lean
+/- theorem Part.inv_def
Modified Mathlib/Data/Seq/Computation.lean
Modified Mathlib/Data/Set/Basic.lean
+/- theorem Set.powerset_empty
+/- theorem Set.powerset_inter
+/- theorem Set.powerset_univ
Modified Mathlib/Data/Set/Defs.lean
Modified Mathlib/Data/Set/Function.lean
+/- theorem Set.exists_image_eq_and_injOn
Modified Mathlib/Data/Sigma/Order.lean
Modified Mathlib/Data/Stream/Init.lean
+/- theorem Stream'.take_succ'
Modified Mathlib/Data/Sum/Basic.lean
Modified Mathlib/Data/Sym/Sym2.lean
Modified Mathlib/Data/TypeVec.lean
Modified Mathlib/Data/Vector/Basic.lean
2025-10-23 14:48:46 69098f8
feat(Order/WellFoundedSet): `partiallyWellOrderedOn_univ_iff` and `Pi.wellQuasiOrderedLE` (#30275)
Connect `Set.PartiallyWellOrderedOn` with `WellQuasiOrdered` and `Set.IsPWO` with `WellQuasiOrderedLE`. Add an instance `Pi.wellQuasiOrderedLE` for Dickson's lemma.
ESTIMATED CHANGES
Modified Mathlib/Order/RelIso/Set.lean
+ def RelIso.subrelUnivIso
Modified Mathlib/Order/WellFoundedSet.lean
+ theorem Set.isPWO_of_wellQuasiOrderedLE
+ theorem Set.isPWO_univ_iff
+ theorem Set.partiallyWellOrderedOn_of_wellQuasiOrdered
+ theorem Set.partiallyWellOrderedOn_univ_iff
Modified Mathlib/Order/WellQuasiOrder.lean
+ theorem RelIso.wellQuasiOrdered_iff
2025-10-23 14:48:44 7baeab8
feat: properties of sesquilinear forms over a star ring (#30274)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/LinearAlgebra/SesquilinearForm/Star.lean
+ theorem LinearMap.isPosSemidef_iff_posSemidef_toMatrix
+ theorem LinearMap.isSymm_iff_basis
+ theorem LinearMap.isSymm_iff_isHermitian_toMatrix
+ theorem apply_eq_star_dotProduct_toMatrix₂_mulVec
+ theorem star_dotProduct_toMatrix₂_mulVec
Modified Mathlib/Tactic/Linter/DirectoryDependency.lean
2025-10-23 14:48:41 725562e
refactor: make `PosMulMono` and alike custom classes (#29395)
In the current setup, users get confusing non-beta-reduced goals involving a subtype when trying to provide an instance of `PosMulMono`.
This PR changes it to be a custom structure with the expected fields.
This follows `PosSMulMono` and alike.
ESTIMATED CHANGES
Modified Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean
- theorem Counterexample.Nxzmod2.add_le_add_left
- theorem Counterexample.Nxzmod2.add_left_cancel
- theorem Counterexample.Nxzmod2.le_of_add_le_add_left
Modified Mathlib/Algebra/Algebra/Operations.lean
Modified Mathlib/Algebra/Order/GroupWithZero/Canonical.lean
Modified Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean
Modified Mathlib/Algebra/Order/GroupWithZero/Unbundled/Defs.lean
+/- theorem mul_le_mul_of_nonneg_left
+/- theorem mul_le_mul_of_nonneg_right
+/- theorem mul_lt_mul_of_pos_left
+/- theorem mul_lt_mul_of_pos_right
Modified Mathlib/Algebra/Order/GroupWithZero/WithZero.lean
Modified Mathlib/Algebra/Order/Pi.lean
Modified Mathlib/Algebra/Order/Ring/Canonical.lean
Modified Mathlib/Algebra/Order/Ring/Defs.lean
Modified Mathlib/Algebra/Order/Ring/InjSurj.lean
Modified Mathlib/Algebra/Order/Ring/Nat.lean
Modified Mathlib/Algebra/Order/Ring/Opposite.lean
Modified Mathlib/Algebra/Order/Ring/Prod.lean
Modified Mathlib/Algebra/Order/Ring/Star.lean
Modified Mathlib/Algebra/Order/Ring/WithTop.lean
Modified Mathlib/Data/NNRat/Defs.lean
Modified Mathlib/Data/Num/Lemmas.lean
Modified Mathlib/Order/Filter/FilterProduct.lean
Modified Mathlib/Order/Filter/Ring.lean
Modified Mathlib/SetTheory/Ordinal/Arithmetic.lean
Modified Mathlib/SetTheory/Ordinal/NaturalOps.lean
Modified MathlibTest/GRewrite.lean
2025-10-23 13:34:21 d5b0059
feat(GroupTheory/FreeGroup/Orbit): The orbit of a point generated by parts of a free group can be "duplicated" (#30130)
Applying `w⁻¹` to the orbit generated by all elements of a free group that start with `w` yields
the orbit generated by all the words that start with every letter execpt `w⁻` (and the original point)
The orbit of a point `x` generated by a set of group elements `s` defined as all the points that can be reached by applying the elements of `s` to `x`.
A special case of this result is needed for the banach tarski theorem.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Dynamics/Flow.lean
+/- theorem Flow.mem_orbit
+/- theorem Flow.mem_orbit_iff
+/- def Flow.orbit
Added Mathlib/GroupTheory/FreeGroup/Orbit.lean
+ theorem FreeGroup.Orbit.duplicate
+ theorem FreeGroup.startsWith.Injective
+ theorem FreeGroup.startsWith.disjoint_iff_ne
+ theorem FreeGroup.startsWith.ne_one
+ theorem FreeGroup.startsWith.smul_def
+ def FreeGroup.startsWith
+ theorem FreeGroup.startsWith_mk_mul
Modified Mathlib/GroupTheory/GroupAction/Defs.lean
+/- theorem MulAction.mem_orbit
+/- theorem MulAction.mem_orbit_iff
2025-10-23 12:52:13 a6e83a0
chore(MeasureTheory/Covering/Differentiation): simp adaptation notes (#30783)
Two adaptation notes from 2024 in `MeasureTheory/Covering/Differentiation` no longer apply, I replace them with the previously used `simpa`/`simp_rw`.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Covering/Differentiation.lean
2025-10-23 12:28:40 2d881d4
perf(Probability/Kernel/Disintegration/Density): smile more (#30819)
Reverts an unintentional regression from #30691 ([benchmark output](https://leanprover.zulipchat.com/#narrow/channel/116290-rss/topic/Benchmark.20results.20for.20mathlib4/near/546585656)).
There was even a comment about this already.
Without this, elaborating the first two lemmas takes 8--10 seconds on my fast computer.
Add one more smile (without it, the exact takes half a second on my computer).
ESTIMATED CHANGES
Modified Mathlib/Probability/Kernel/Disintegration/Density.lean
2025-10-23 12:28:38 c192723
feat: better `norm_num` for `rpow` (#30615)
- Use recently added `Nat.nthRoot` to make `(a : ℝ) ^ (b : ℝ)` work for rational `a ≥ 0` and `b`.
- Simplify the logic by using `.eqTrans`.
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Pow/Real.lean
+ theorem Mathlib.Meta.NormNum.IsInt.rpow_eq_inv_pow
+ theorem Mathlib.Meta.NormNum.IsNNRat.rpow_isNNRat
+ theorem Mathlib.Meta.NormNum.IsNat.rpow_eq_pow
+ theorem Mathlib.Meta.NormNum.IsNat.rpow_isNNRat
+/- def Mathlib.Meta.NormNum.evalRPow
+ def Mathlib.Meta.NormNum.proveIsNatRPowIsNNRat
+ theorem Mathlib.Meta.NormNum.rpow_isRat_eq_inv_rpow
Modified MathlibTest/norm_num_rpow.lean
2025-10-23 12:28:35 84ed40c
feat: computations with the matrix associated to a sesquilinear form (#30276)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Matrix/BilinearForm.lean
Modified Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean
+ theorem apply_eq_dotProduct_toMatrix₂_mulVec
+ theorem dotProduct_toMatrix₂_mulVec
2025-10-23 10:55:14 ba4e2b0
chore: allow uploading oleans for Reap (#30818)
`reap` is a promising neural theorem prover, with an API and public weights, that we can use in Mathlib already. In #29953 we're trying to prepare a branch that requires `reap`, and imports it in `Tactic.Common`, so that oleans are available. However because this requires a change to Cache.lean, we need to merge that to `master` before oleans can be uploaded, even from another branch.
ESTIMATED CHANGES
Modified Cache/IO.lean
2025-10-23 10:55:12 abe6652
chore: use 'cache put-unpacked' for Archive and Counterexamples (#30815)
Previously we were uploading all the oleans 5 times over!
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
2025-10-23 10:55:10 7e9ba32
doc: normalize spacing in text (#30804)
This PR normalizes instances of repeated white-space in documentation text, only in places it seems clear that a single space was intended.
ESTIMATED CHANGES
Modified Mathlib/Algebra/AddConstMap/Basic.lean
Modified Mathlib/Algebra/Category/Grp/Limits.lean
Modified Mathlib/Algebra/Group/Fin/Basic.lean
Modified Mathlib/Analysis/Calculus/VectorField.lean
Modified Mathlib/Analysis/MeanInequalities.lean
Modified Mathlib/Analysis/Meromorphic/NormalForm.lean
Modified Mathlib/Analysis/Normed/Unbundled/FiniteExtension.lean
Modified Mathlib/Analysis/Normed/Unbundled/IsPowMulFaithful.lean
Modified Mathlib/CategoryTheory/Limits/Presheaf.lean
Modified Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean
Modified Mathlib/Data/Set/Card.lean
Modified Mathlib/Data/ZMod/Defs.lean
Modified Mathlib/GroupTheory/GroupAction/Blocks.lean
Modified Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean
Modified Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/FinTwo.lean
Modified Mathlib/LinearAlgebra/Matrix/PosDef.lean
Modified Mathlib/Logic/Equiv/Sum.lean
Modified Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean
Modified Mathlib/MeasureTheory/Measure/Prod.lean
Modified Mathlib/NumberTheory/LSeries/ZMod.lean
Modified Mathlib/NumberTheory/NumberField/FinitePlaces.lean
Modified Mathlib/RepresentationTheory/Coinduced.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean
Modified Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean
Modified Mathlib/RingTheory/Polynomial/GaussNorm.lean
Modified Mathlib/SetTheory/Cardinal/Finite.lean
2025-10-23 10:55:08 8acb4f3
feat: local frames in a vector bundle (#30338)
We define a predicate `IsLocalFrameOn`, for a collection of sections of a vector bundle to be a local frame.
We provide some basic API, such as the coefficients of a section `t` w.r.t. a local frame, or proving smoothness of `t` via proving the smoothness of its local frame coefficients.
A future PR will construct actual local frames, and use these to define the local extension of a tangent vector to a vector field near a point.
From the path towards geodesics and the Levi-Civita connection.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean
+ def IsLocalFrameOn.coeff
+ theorem IsLocalFrameOn.coeff_apply_of_mem
+ theorem IsLocalFrameOn.coeff_apply_of_notMem
+ theorem IsLocalFrameOn.coeff_apply_zero_at
+ theorem IsLocalFrameOn.coeff_congr
+ theorem IsLocalFrameOn.coeff_eq_of_eq
+ theorem IsLocalFrameOn.coeff_sum_eq
+ theorem IsLocalFrameOn.congr
+ theorem IsLocalFrameOn.contMDiffAt
+ theorem IsLocalFrameOn.contMDiffAt_of_coeff
+ theorem IsLocalFrameOn.contMDiffAt_of_coeff_aux
+ theorem IsLocalFrameOn.contMDiffOn_of_coeff
+ theorem IsLocalFrameOn.eq_iff_coeff
+ theorem IsLocalFrameOn.eventually_eq_sum_coeff_smul
+ theorem IsLocalFrameOn.mdifferentiableAt_of_coeff
+ theorem IsLocalFrameOn.mdifferentiableAt_of_coeff_aux
+ theorem IsLocalFrameOn.mdifferentiableOn_of_coeff
+ theorem IsLocalFrameOn.mono
+ def IsLocalFrameOn.toBasisAt
+ theorem IsLocalFrameOn.toBasisAt_coe
+ structure IsLocalFrameOn
2025-10-23 10:10:59 98b1401
chore: generalize `tprod_ite_eq` (#30810)
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/l2Space.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Monad.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Basic.lean
+/- theorem tprod_ite_eq
2025-10-23 09:27:06 766e19e
chore: remove `MulAction ℚ α → MulAction ℚ≥0 α` instances (#30671)
This fixes the instances diamond in the `NNRat` action.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Rat.lean
- theorem NNRat.cast_smul_eq_nnqsmul
- theorem Rat.cast_smul_eq_qsmul
Modified Mathlib/Algebra/Module/Rat.lean
+ theorem NNRat.cast_smul_eq_nnqsmul
+ theorem Rat.cast_smul_eq_qsmul
Modified Mathlib/Algebra/Order/Module/Rat.lean
Modified Mathlib/Data/NNRat/Lemmas.lean
2025-10-23 09:11:31 615903a
chore: ignore Mathlib.Tactic.Field imports in shake (#30816)
ESTIMATED CHANGES
Modified scripts/noshake.json
2025-10-23 19:05:01+11:00 4cc49eb
chore: revert #30788 and #30785 (#30807)
ESTIMATED CHANGES
Modified .github/workflows/nightly-docgen.yml
Modified Cache/IO.lean
+/- def Cache.IO.rootHashGeneration
Modified Cache/Requests.lean
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/StrictPositivity.lean
Modified Mathlib/Algebra/BigOperators/Group/List/Basic.lean
Modified Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean
Modified Mathlib/Algebra/Notation/Defs.lean
- theorem SMul.smul_eq_hSMul
Modified Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
Modified Mathlib/Analysis/LocallyConvex/WithSeminorms.lean
Modified Mathlib/Computability/DFA.lean
Modified Mathlib/Computability/RegularExpressions.lean
Modified Mathlib/Control/Monad/Cont.lean
Modified Mathlib/Data/Finsupp/Notation.lean
Modified Mathlib/Data/Fintype/EquivFin.lean
Modified Mathlib/Data/Int/LeastGreatest.lean
Modified Mathlib/Data/List/Chain.lean
Modified Mathlib/Data/List/Flatten.lean
Modified Mathlib/Data/List/SplitOn.lean
Modified Mathlib/Data/Nat/Digits/Defs.lean
+/- theorem Nat.repr_length
Modified Mathlib/Data/Set/Insert.lean
Modified Mathlib/Data/String/Basic.lean
- theorem List.asString_inj
- theorem List.length_asString
+/- theorem List.toList_asString
+/- theorem String.asString_toList
- theorem String.endPos_empty
- theorem String.length_data
+ theorem String.ltb_cons_addChar'
+/- theorem String.ltb_cons_addChar
+/- theorem String.toList_inj
Modified Mathlib/Data/String/Defs.lean
Modified Mathlib/Data/String/Lemmas.lean
+/- theorem String.congr_append
Added Mathlib/Lean/Elab/InfoTree.lean
+ def Lean.Elab.collectTryThisSuggestions
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/LebesgueDifferentiationThm.lean
Modified Mathlib/SetTheory/PGame/Basic.lean
Modified Mathlib/Tactic/Basic.lean
+ structure Mathlib.Tactic.withResetServerInfo.Result
+ def Mathlib.Tactic.withResetServerInfo
Modified Mathlib/Tactic/DeclarationNames.lean
+/- def Mathlib.Linter.getNamesFrom
Modified Mathlib/Tactic/Hint.lean
+/- def Mathlib.Tactic.Hint.suggestion
- def Mathlib.Tactic.Hint.withMessageLog
- def Mathlib.Tactic.Hint.withoutInfoTrees
Modified Mathlib/Tactic/Linter/CommandRanges.lean
Modified Mathlib/Tactic/Linter/CommandStart.lean
+/- def Mathlib.Linter.CommandStart.endPos
Modified Mathlib/Tactic/Linter/DocString.lean
Modified Mathlib/Tactic/Linter/FindDeprecations.lean
+/- def Mathlib.Tactic.getPosAfterImports
+/- def Mathlib.Tactic.parseLine
Modified Mathlib/Tactic/Linter/HashCommandLinter.lean
Modified Mathlib/Tactic/Linter/Header.lean
+/- def Mathlib.Linter.authorsLineChecks
+/- def Mathlib.Linter.parseUpToHere
+/- def Mathlib.Linter.toSyntax
Modified Mathlib/Tactic/Linter/PPRoundtrip.lean
Modified Mathlib/Tactic/Linter/TextBased.lean
Modified Mathlib/Tactic/Linter/UpstreamableDecl.lean
Modified Mathlib/Tactic/Says.lean
- def Mathlib.Tactic.Says.evalTacticCapturingInfo
- def Mathlib.Tactic.Says.evalTacticCapturingMessages
Modified Mathlib/Tactic/SuccessIfFailWithMsg.lean
Modified Mathlib/Tactic/ToAdditive/Frontend.lean
Modified Mathlib/Tactic/ToAdditive/GuessName.lean
Modified Mathlib/Tactic/ToExpr.lean
Modified Mathlib/Tactic/Widget/Calc.lean
Modified Mathlib/Tactic/Widget/CongrM.lean
Modified Mathlib/Tactic/Widget/Conv.lean
Modified Mathlib/Tactic/Widget/GCongr.lean
Modified Mathlib/Tactic/Widget/InteractiveUnfold.lean
Modified Mathlib/Tactic/Widget/LibraryRewrite.lean
Modified Mathlib/Tactic/Widget/SelectPanelUtils.lean
Modified Mathlib/Util/CompileInductive.lean
Modified Mathlib/Util/Superscript.lean
Modified MathlibTest/CalcQuestionMark.lean
Modified MathlibTest/Change.lean
Modified MathlibTest/DeprecateTo.lean
Modified MathlibTest/FieldSimp.lean
Modified MathlibTest/FindSyntax.lean
Modified MathlibTest/LibraryRewrite.lean
Modified MathlibTest/LibrarySearch/basic.lean
Modified MathlibTest/LibrarySearch/mathlib.lean
Modified MathlibTest/LibrarySearch/observe.lean
Modified MathlibTest/Subsingleton.lean
Modified MathlibTest/Use.lean
Modified MathlibTest/Util/PrintSorries.lean
Modified MathlibTest/Variable.lean
Modified MathlibTest/fast_instance.lean
Modified MathlibTest/hint.lean
Modified MathlibTest/propose.lean
Modified MathlibTest/rewrites.lean
Modified MathlibTest/ring.lean
Modified MathlibTest/says.lean
Modified MathlibTest/says_whitespace.lean
Modified MathlibTest/success_if_fail_with_msg.lean
Modified MathlibTest/toAdditive.lean
Modified lake-manifest.json
Modified lakefile.lean
Modified lean-toolchain
Modified scripts/check-yaml.lean
Modified scripts/noshake.json
2025-10-23 06:37:37 3ae8eef
chore: bump leantar to 0.1.16-pre4 (#30813)
ESTIMATED CHANGES
Modified Cache/IO.lean
2025-10-23 02:07:25 8a246bc
chore: use `lake build --no-build --rehash` when verifying the cache in CI (#30805)
See [#mathlib4 > Build error in Tactic file @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Build.20error.20in.20Tactic.20file/near/546563514).
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
2025-10-23 01:53:22 9c7fedb
feat: trapezoidal rule for integration (#29040)
This PR defines the trapezoidal rule and proves the standard error bound on it in terms of bounds on the second derivative.
I have vague plans of using this plus interval arithmetic to develop a tactic that can automatically close goals of the form `\integral x in a..b, f x < y` or similar.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/MeasureTheory/Integral/IntervalIntegral/TrapezoidalRule.lean
+ theorem sum_trapezoidal_error_adjacent_intervals
+ theorem sum_trapezoidal_integral_adjacent_intervals
+ theorem trapezoidal_error_eq
+ theorem trapezoidal_error_le
+ theorem trapezoidal_error_le_of_c2
+ theorem trapezoidal_error_symm
+ theorem trapezoidal_integral_eq
+ theorem trapezoidal_integral_ext
+ theorem trapezoidal_integral_one
+ theorem trapezoidal_integral_symm
Modified scripts/noshake.json
2025-10-23 00:20:05 2f46caa
feat: ignore `#adaptation_note` in the `mergeWithGrind` linter (#30803)
This PR, following the example of the `hashCommand` linter, adds a set `mergeWithGrindAllowed` which is used to exclude `#adaptation_note` from the `mergeWithGrind` linter.
ESTIMATED CHANGES
Modified Mathlib/Tactic/TacticAnalysis/Declarations.lean
Modified MathlibTest/TacticAnalysis.lean
2025-10-23 00:20:02 5fdb78b
style(misc): fix whitespace (#30691)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean
Modified Mathlib/Combinatorics/SimpleGraph/Triangle/Removal.lean
Modified Mathlib/Computability/TuringMachine.lean
Modified Mathlib/Control/ULiftable.lean
Modified Mathlib/Geometry/Manifold/PoincareConjecture.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/SmoothSection.lean
Modified Mathlib/GroupTheory/ArchimedeanDensely.lean
Modified Mathlib/GroupTheory/CoprodI.lean
Modified Mathlib/GroupTheory/Coxeter/Basic.lean
Modified Mathlib/GroupTheory/Coxeter/Inversion.lean
Modified Mathlib/GroupTheory/Coxeter/Length.lean
Modified Mathlib/GroupTheory/FixedPointFree.lean
Modified Mathlib/GroupTheory/GroupAction/Blocks.lean
Modified Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean
Modified Mathlib/GroupTheory/GroupAction/Primitive.lean
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean
Modified Mathlib/GroupTheory/HNNExtension.lean
Modified Mathlib/GroupTheory/MonoidLocalization/Basic.lean
Modified Mathlib/GroupTheory/Perm/Centralizer.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Concrete.lean
Modified Mathlib/GroupTheory/PushoutI.lean
Modified Mathlib/GroupTheory/SpecificGroups/Dihedral.lean
+/- theorem DihedralGroup.r_pow
+/- theorem DihedralGroup.r_zpow
Modified Mathlib/GroupTheory/SpecificGroups/Quaternion.lean
Modified Mathlib/LinearAlgebra/BilinearForm/TensorProduct.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/EvenEquiv.lean
Modified Mathlib/LinearAlgebra/CliffordAlgebra/Prod.lean
Modified Mathlib/LinearAlgebra/Eigenspace/Matrix.lean
Modified Mathlib/LinearAlgebra/FreeProduct/Basic.lean
Modified Mathlib/LinearAlgebra/Matrix/Adjugate.lean
Modified Mathlib/LinearAlgebra/Matrix/Determinant/TotallyUnimodular.lean
Modified Mathlib/LinearAlgebra/Matrix/FixedDetMatrices.lean
Modified Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Card.lean
Modified Mathlib/LinearAlgebra/Matrix/Ideal.lean
Modified Mathlib/LinearAlgebra/Matrix/Notation.lean
Modified Mathlib/LinearAlgebra/QuadraticForm/TensorProduct.lean
Modified Mathlib/LinearAlgebra/RootSystem/Base.lean
Modified Mathlib/LinearAlgebra/RootSystem/Chain.lean
Modified Mathlib/LinearAlgebra/RootSystem/Finite/G2.lean
+/- theorem RootPairing.EmbeddedG2.pairing_long_short
Modified Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Basic.lean
Modified Mathlib/LinearAlgebra/RootSystem/RootPairingCat.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Graded/External.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean
Modified Mathlib/LinearAlgebra/Vandermonde.lean
Modified Mathlib/Logic/Equiv/Defs.lean
Modified Mathlib/Logic/Equiv/Option.lean
+/- def Equiv.optionEquivSumPUnit.{v,
Modified Mathlib/Logic/Equiv/Prod.lean
+/- def Equiv.uniqueSigma
Modified Mathlib/Logic/Function/Iterate.lean
Modified Mathlib/Logic/Small/Defs.lean
Modified Mathlib/MeasureTheory/Function/ConditionalExpectation/AEMeasurable.lean
Modified Mathlib/MeasureTheory/Function/Holder.lean
Modified Mathlib/MeasureTheory/Function/UniformIntegrable.lean
Modified Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean
Modified Mathlib/MeasureTheory/Integral/Average.lean
Modified Mathlib/MeasureTheory/Measure/AddContent.lean
Modified Mathlib/MeasureTheory/Measure/LogLikelihoodRatio.lean
Modified Mathlib/MeasureTheory/Measure/Tilted.lean
Modified Mathlib/ModelTheory/Syntax.lean
Modified Mathlib/NumberTheory/Dioph.lean
Modified Mathlib/NumberTheory/FLT/Basic.lean
Modified Mathlib/NumberTheory/FLT/MasonStothers.lean
Modified Mathlib/NumberTheory/FLT/Three.lean
Modified Mathlib/NumberTheory/FactorisationProperties.lean
Modified Mathlib/NumberTheory/Multiplicity.lean
Modified Mathlib/NumberTheory/PellMatiyasevic.lean
Modified Mathlib/NumberTheory/Zsqrtd/Basic.lean
Modified Mathlib/Probability/Distributions/Gamma.lean
Modified Mathlib/Probability/Distributions/Gaussian/Real.lean
Modified Mathlib/Probability/Distributions/Geometric.lean
+/- def ProbabilityTheory.geometricPMFReal
Modified Mathlib/Probability/Distributions/Poisson.lean
+/- def ProbabilityTheory.poissonPMFReal
Modified Mathlib/Probability/Independence/Conditional.lean
Modified Mathlib/Probability/Independence/ZeroOne.lean
Modified Mathlib/Probability/Kernel/Condexp.lean
Modified Mathlib/Probability/Kernel/Disintegration/Density.lean
Modified Mathlib/Probability/Kernel/WithDensity.lean
Modified Mathlib/Probability/Moments/Basic.lean
+/- theorem ProbabilityTheory.mgf_add_const
Modified Mathlib/Probability/Moments/Covariance.lean
+/- theorem ProbabilityTheory.covariance_fun_neg_left
+/- theorem ProbabilityTheory.covariance_fun_neg_right
Modified Mathlib/Probability/Moments/IntegrableExpMul.lean
Modified Mathlib/Probability/Moments/MGFAnalytic.lean
Modified Mathlib/Probability/Moments/SubGaussian.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Binomial.lean
Modified Mathlib/Probability/StrongLaw.lean
Modified Mathlib/RepresentationTheory/Homological/GroupCohomology/LowDegree.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/Basic.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean
Modified Mathlib/RepresentationTheory/Homological/Resolution.lean
Modified Mathlib/SetTheory/Cardinal/Defs.lean
+/- theorem Cardinal.mk_arrow
Modified Mathlib/Tactic/ApplyAt.lean
Modified Mathlib/Tactic/FastInstance.lean
Modified Mathlib/Topology/Algebra/Constructions/DomMulAct.lean
Modified Mathlib/Topology/Algebra/RestrictedProduct/Basic.lean
Modified Mathlib/Topology/UniformSpace/Defs.lean
Modified Mathlib/Topology/VectorBundle/Riemannian.lean
2025-10-23 00:20:00 acca40f
feat(RingTheory/Localization/FractionRing): `R` is nontrivial iff `S` is nontrivial (#30645)
This PR shows that if `S` is the fraction ring of `R`, then `R` is nontrivial iff `S` is nontrivial.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Localization/FractionRing.lean
+ theorem IsFractionRing.nontrivial_iff_nontrivial
2025-10-23 00:03:59 0fd80fa
doc: document `ToAdditive.insertTranslation` (#30784)
* Document `ToAdditive.insertTranslation`
* Shorten invocations
* Update comments
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Coset/Defs.lean
Modified Mathlib/GroupTheory/FreeGroup/Basic.lean
Modified Mathlib/GroupTheory/MonoidLocalization/Basic.lean
Modified Mathlib/Tactic/ToAdditive/Frontend.lean
Modified MathlibTest/toAdditive.lean
2025-10-23 00:03:57 c03073a
doc: Cartesian-closed -> Cartesian closed (#30777)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Category/Cat/CartesianClosed.lean
Modified Mathlib/CategoryTheory/Closed/Cartesian.lean
Modified Mathlib/CategoryTheory/Closed/Functor.lean
Modified Mathlib/CategoryTheory/Closed/Ideal.lean
Modified Mathlib/CategoryTheory/Closed/Monoidal.lean
Modified Mathlib/CategoryTheory/Closed/Zero.lean
Modified Mathlib/CategoryTheory/Functor/Currying.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/StrictInitial.lean
Modified Mathlib/CategoryTheory/Subterminal.lean
Modified Mathlib/Condensed/CartesianClosed.lean
Modified Mathlib/Condensed/Light/CartesianClosed.lean
Modified Mathlib/Order/Heyting/Basic.lean
Modified Mathlib/Topology/Category/DeltaGenerated.lean
Modified MathlibTest/fun_prop_dev.lean
2025-10-23 00:03:55 87ab66e
refactor: generalise `Set.eq_empty_of_isEmpty` (#30722)
We don't need to know that the full type is empty, but merely the set itself.
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Basic.lean
+/- theorem Set.eq_empty_of_isEmpty
Modified Mathlib/Topology/Category/Profinite/CofilteredLimit.lean
2025-10-23 00:03:52 3167cff
chore(Algebra/Order/Monoid/Unbundled/MinMax): golf 2 lemmas using `grind` (#30280)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Monoid/Unbundled/MinMax.lean
2025-10-23 00:03:50 41772ea
feat(Algebra/Polynomial/Factors): Introduce predicate and basic API (#30212)
This PR introduces a predicate `Polynomial.Factors` that generalizes `Polynomial.Splits` beyond fields. This PR contains the definition of `Polynomial.Factors` along with most of API for `Polynomial.Splits`. The end goal is to either redefine `Polynomial.Splits` in terms of `Polynomial.Factors` or deprecate `Polynomial.Splits` entirely.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Generalizing.20.60Polynomial.2ESplits.60.20to.20rings
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Algebra/Polynomial/Factors.lean
+ theorem Polynomial.Factors.C_mul_X_pow
+ theorem Polynomial.Factors.X_add_C
+ theorem Polynomial.Factors.X_pow
+ theorem Polynomial.Factors.X_sub_C
+ theorem Polynomial.Factors.eq_prod_roots
+ theorem Polynomial.Factors.exists_eval_eq_zero
+ theorem Polynomial.Factors.listProd
+ theorem Polynomial.Factors.monomial
+ theorem Polynomial.Factors.multisetProd
+ theorem Polynomial.Factors.natDegree_eq_card_roots
+ theorem Polynomial.Factors.natDegree_le_one_of_irreducible
+ theorem Polynomial.Factors.of_degree_eq_one
+ theorem Polynomial.Factors.of_degree_le_one
+ theorem Polynomial.Factors.of_dvd
+ theorem Polynomial.Factors.of_natDegree_eq_one
+ theorem Polynomial.Factors.of_natDegree_le_one
+ theorem Polynomial.Factors.roots_ne_zero
+ theorem Polynomial.Factors.splits
+ def Polynomial.Factors
+ theorem Polynomial.factors_X_sub_C_mul_iff
+ theorem Polynomial.factors_iff_exists_multiset'
+ theorem Polynomial.factors_iff_exists_multiset
+ theorem Polynomial.factors_iff_splits
+ theorem Polynomial.factors_mul_iff
+ theorem Polynomial.factors_neg_iff
+ theorem Polynomial.factors_of_degree_le_zero
+ theorem Polynomial.factors_of_natDegree_eq_zero
Modified Mathlib/Algebra/Polynomial/Monic.lean
+ theorem Polynomial.not_isUnit_X_add_C
Modified Mathlib/Algebra/Polynomial/Splits.lean
2025-10-23 00:03:47 9fdf911
feat(AdjoinRoot): bundle operations as `AlgHom`s (#29132)
In particular, generalise and rename `liftHom` to use a general `eval₂` instead of `aeval`.
From Toric
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
Modified Mathlib/FieldTheory/Isaacs.lean
Modified Mathlib/FieldTheory/KummerExtension.lean
Modified Mathlib/FieldTheory/Minpoly/IsIntegrallyClosed.lean
Modified Mathlib/RingTheory/Adjoin/Field.lean
Modified Mathlib/RingTheory/AdjoinRoot.lean
+ theorem AdjoinRoot.algHom_ext'
+ theorem AdjoinRoot.coe_liftAlgHom
+ theorem AdjoinRoot.coe_ofAlgHom
+ def AdjoinRoot.liftAlgHom
+ theorem AdjoinRoot.liftAlgHom_eq_algHom
+ theorem AdjoinRoot.liftAlgHom_mk
+ theorem AdjoinRoot.liftAlgHom_of
+ theorem AdjoinRoot.liftAlgHom_root
+/- theorem AdjoinRoot.liftHom_mk
+ theorem AdjoinRoot.toRingHom_liftAlgHom
+ theorem AdjoinRoot.toRingHom_ofAlgHom
+/- def AdjoinRoot
Modified Mathlib/RingTheory/Localization/Away/AdjoinRoot.lean
2025-10-23 00:03:45 f64ce1e
feat(Analysis/Normed/Group/Quotient): isometric versions of isomorphisms (#27000)
This PR adds an isometric version of the third isomorphism theorem for groups and modules.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Normed/Group/Quotient.lean
+ def QuotientGroup.quotientBotIsometryEquiv
+ def QuotientGroup.quotientQuotientIsometryEquivQuotient
+ def Subgroup.quotientIsometryEquivOfEq
+ def Submodule.quotLIEOfEq
+ def Submodule.quotientQuotientLIEQuotient
+ def Submodule.quotientQuotientLIEQuotientSup
2025-10-22 23:09:26 0a7093c
chore(MeasureTheory/Function/SimpleFunc): deprecate `SimpleFunc.coe_le` (#30737)
This PR deprecates the duplicate `MeasureTheory.SimpleFunc.coe_le` of `coe_le_coe` that seems to have accidentally slipped in via #18707.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Function/SimpleFunc.lean
- theorem MeasureTheory.SimpleFunc.coe_le
+/- theorem MeasureTheory.SimpleFunc.coe_le_coe
2025-10-22 23:09:25 f329f8c
chore(Data/Finset): golf `powersetCard_succ_insert` using `grind` (#30593)
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/Powerset.lean
2025-10-22 23:09:23 e789890
chore(CauSeq): Add `lim_sub` lemma to CauSeq. (#30395)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/CauSeq/Completion.lean
+ theorem CauSeq.lim_sub
2025-10-22 23:09:21 bbfa916
feat(Algebra/Ring/Basic): add `a / -b = -a / b` (#30261)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/Basic.lean
+ theorem div_neg_eq_neg_div'
+/- theorem neg_div'
2025-10-22 23:09:20 3d0794d
chore(RingTheory/AdicValuation,LaurentSeries): switch to `WithZero.exp` instead of coercions of `Multiplicative.ofAdd` (#29642)
as requested at
https://github.com/leanprover-community/mathlib4/pull/27339#issuecomment-3285102305
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/RatFunc/AsPolynomial.lean
Modified Mathlib/NumberTheory/NumberField/FinitePlaces.lean
Modified Mathlib/RingTheory/DedekindDomain/AdicValuation.lean
Modified Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean
Modified Mathlib/RingTheory/LaurentSeries.lean
+/- theorem PowerSeries.intValuation_X
2025-10-22 23:09:18 599f81d
feat(RingTheory/Valuation): Valuation.leAddSubgroup and ideal/submodule versions of ltAddSubgroup (#26829)
Extracted from #25450 without changing how Valued works
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Valuation/Basic.lean
+ def Valuation.leAddSubgroup
+ theorem Valuation.leAddSubgroup_monotone
+ theorem Valuation.leAddSubgroup_zero
+ theorem Valuation.ltAddSubgroup_le_leAddSubgroup
+ theorem Valuation.ltAddSubgroup_monotone
+ theorem Valuation.mem_leAddSubgroup_iff
Modified Mathlib/RingTheory/Valuation/Integers.lean
+ def Valuation.leIdeal
+ theorem Valuation.leIdeal_map_algebraMap_eq_leSubmodule_min
+ theorem Valuation.leIdeal_mono
+ theorem Valuation.leIdeal_v_le_of_mem
+ theorem Valuation.leIdeal_zero
+ def Valuation.leSubmodule
+ theorem Valuation.leSubmodule_comap_algebraMap_eq_leIdeal
+ theorem Valuation.leSubmodule_monotone
+ theorem Valuation.leSubmodule_v_le_of_mem
+ theorem Valuation.leSubmodule_zero
+ def Valuation.ltIdeal
+ theorem Valuation.ltIdeal_le_leIdeal
+ theorem Valuation.ltIdeal_mono
+ theorem Valuation.ltIdeal_v_le_of_mem
+ def Valuation.ltSubmodule
+ theorem Valuation.ltSubmodule_le_leSubmodule
+ theorem Valuation.ltSubmodule_monotone
+ theorem Valuation.ltSubmodule_v_le_of_mem
+ theorem Valuation.mem_leIdeal_iff
+ theorem Valuation.mem_leSubmodule_iff
+ theorem Valuation.mem_ltIdeal_iff
+ theorem Valuation.mem_ltSubmodule_iff
2025-10-22 23:09:16 f52115b
chore: shortcut instance `CompleteLattice α → PartialOrder α` (#25758)
This avoids using the path `CompleteLattice α → CompletePartialOrder α → PartialOrder α` that goes through `Order.CompletePartialOrder` and makes it appear used to our automation, such as `shake` or `#min_imports`.
This is a followup to #25358.
ESTIMATED CHANGES
Modified Mathlib/Order/CompleteLattice/Defs.lean
2025-10-22 20:30:30 71a105d
feat(Analysis/SpecialFunctions/Log): log_prod for Lists and Multisets (#30681)
We add
```
lemma log_list_prod {l : List ℝ} (h : ∀ x ∈ l, x ≠ 0) : log l.prod = (l.map (fun x ↦ log x)).sum
```
and
```
lemma log_multiset_prod {s : Multiset ℝ} (h : ∀ x ∈ s, x ≠ 0) : log s.prod = (s.map (fun x ↦ log x)).sum
```
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean
+ theorem Multiset.prod_map_toList
Modified Mathlib/Analysis/Meromorphic/FactorizedRational.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/Basic.lean
+ theorem Real.log_list_prod
+ theorem Real.log_multiset_prod
+/- theorem Real.log_prod
Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean
Modified Mathlib/Probability/Moments/Basic.lean
2025-10-22 20:30:28 663fc8b
feat(RingTheory): define the dual of a basis for the trace and prove basic properties (#26396)
Specialize the construction of `BilinForm.dualBasis` to the case of the trace and proves basic results about it.
This will be useful for future works on the [Submodule.traceDual](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/DedekindDomain/Different.html#Submodule.traceDual)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/BilinearForm/DualLattice.lean
Modified Mathlib/LinearAlgebra/BilinearForm/Properties.lean
+/- theorem LinearMap.BilinForm.apply_dualBasis_left
+/- theorem LinearMap.BilinForm.apply_dualBasis_right
+/- theorem LinearMap.BilinForm.dualBasis_dualBasis
+/- theorem LinearMap.BilinForm.dualBasis_dualBasis_flip
+ theorem LinearMap.BilinForm.dualBasis_eq_iff
+/- theorem LinearMap.BilinForm.dualBasis_flip_dualBasis
+ theorem LinearMap.BilinForm.dualBasis_injective
+ theorem LinearMap.BilinForm.dualBasis_involutive
+/- theorem LinearMap.BilinForm.dualBasis_repr_apply
Modified Mathlib/RingTheory/DedekindDomain/Different.lean
+ theorem Submodule.traceDual_span_of_basis
Modified Mathlib/RingTheory/PowerBasis.lean
- def Module.Basis.PowerBasis
Modified Mathlib/RingTheory/Trace/Basic.lean
+ theorem Algebra.isNilpotent_trace_of_isNilpotent
+/- theorem Algebra.traceMatrix_of_basis_mulVec
- theorem Algebra.trace_isNilpotent_of_isNilpotent
+ theorem Module.Basis.traceDual_def
+ theorem Module.Basis.traceDual_eq_iff
+ theorem Module.Basis.traceDual_inj
+ theorem Module.Basis.traceDual_injective
+ theorem Module.Basis.traceDual_involutive
+ theorem Module.Basis.traceDual_powerBasis_eq
+ theorem Module.Basis.traceDual_repr_apply
+ theorem Module.Basis.traceDual_traceDual
+ theorem Module.Basis.trace_mul_traceDual
+ theorem Module.Basis.trace_traceDual_mul
+/- theorem det_traceForm_ne_zero
- theorem traceForm_dualBasis_powerBasis_eq
2025-10-22 19:38:08 df375c2
feat(SetTheory/Cardinal): generalize and rename theorems on `Cardinal.sum` (#29351)
Some theorems on `Cardinal.sum f` are taking `f : ι → Cardinal.{max u v}`, which can be generalized to `f : ι → Cardinal.{v}`. Also rename `sum_le_iSup_lift`, `sum_eq_iSup_lift` etc. to reflect their signatures in names.
ESTIMATED CHANGES
Modified Mathlib/Data/W/Cardinal.lean
Modified Mathlib/ModelTheory/Encoding.lean
Modified Mathlib/SetTheory/Cardinal/Arithmetic.lean
- theorem Cardinal.sum_eq_iSup
- theorem Cardinal.sum_eq_iSup_lift
+ theorem Cardinal.sum_eq_iSup_of_lift_mk_le_iSup
+ theorem Cardinal.sum_eq_iSup_of_mk_le_iSup
+ theorem Cardinal.sum_eq_lift_iSup_of_lift_mk_le_lift_iSup
Modified Mathlib/SetTheory/Cardinal/Basic.lean
+ theorem Cardinal.lift_iSup_le_sum
- theorem Cardinal.sum_le_iSup
- theorem Cardinal.sum_le_iSup_lift
+ theorem Cardinal.sum_le_lift_mk_mul_iSup
+ theorem Cardinal.sum_le_lift_mk_mul_iSup_lift
+ theorem Cardinal.sum_le_mk_mul_iSup
Modified Mathlib/SetTheory/Cardinal/Cofinality.lean
Modified Mathlib/SetTheory/Cardinal/Defs.lean
+ theorem Cardinal.lift_power_sum
+/- theorem Cardinal.power_sum
Modified Mathlib/SetTheory/Cardinal/Order.lean
+/- theorem Cardinal.le_sum
+ theorem Cardinal.lift_le_sum
Modified Mathlib/SetTheory/Cardinal/Ordinal.lean
Modified Mathlib/SetTheory/Cardinal/Pigeonhole.lean
Modified Mathlib/SetTheory/Cardinal/Regular.lean
2025-10-22 18:34:27 92204ff
feat(GroupTheory/Index): criteria for subgroup to have index 2 (#30466)
A few variations on the existing `Subgroup.index_eq_two_iff`.
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Index.lean
+ theorem Subgroup.index_dvd_two_iff'
+ theorem Subgroup.index_dvd_two_iff
+ theorem Subgroup.index_eq_two_iff'
+ theorem Subgroup.index_eq_two_iff_exists_notMem_and'
+ theorem Subgroup.index_eq_two_iff_exists_notMem_and
+ theorem Subgroup.relIindex_dvd_two_iff'
+ theorem Subgroup.relIindex_eq_two_iff'
+ theorem Subgroup.relIndex_dvd_two_iff
+ theorem Subgroup.relIndex_eq_two_iff
+ theorem Subgroup.relIndex_eq_two_iff_exists_notMem_and'
+ theorem Subgroup.relIndex_eq_two_iff_exists_notMem_and
2025-10-22 14:25:51-04:00 2521caa
chore: revert #30740 and #30748 (#30788)
cf. [#mathlib4 > Build error in Tactic file @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Build.20error.20in.20Tactic.20file/near/546455276)
ESTIMATED CHANGES
Modified .github/workflows/nightly-docgen.yml
Modified Cache/IO.lean
+/- def Cache.IO.rootHashGeneration
Modified Cache/Requests.lean
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/StrictPositivity.lean
Modified Mathlib/Algebra/BigOperators/Group/List/Basic.lean
Modified Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean
Modified Mathlib/Algebra/Notation/Defs.lean
+ theorem SMul.smul_eq_hSMul
Modified Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
Modified Mathlib/Analysis/LocallyConvex/WithSeminorms.lean
Modified Mathlib/Computability/DFA.lean
Modified Mathlib/Computability/RegularExpressions.lean
Modified Mathlib/Control/Monad/Cont.lean
Modified Mathlib/Data/Finsupp/Notation.lean
Modified Mathlib/Data/Fintype/EquivFin.lean
Modified Mathlib/Data/Int/LeastGreatest.lean
Modified Mathlib/Data/List/Chain.lean
Modified Mathlib/Data/List/Flatten.lean
Modified Mathlib/Data/List/SplitOn.lean
Modified Mathlib/Data/Nat/Digits/Defs.lean
+/- theorem Nat.repr_length
Modified Mathlib/Data/Set/Insert.lean
Modified Mathlib/Data/String/Basic.lean
+ theorem List.asString_inj
+ theorem List.length_asString
+/- theorem List.toList_asString
+/- theorem String.asString_toList
+ theorem String.endPos_empty
+ theorem String.length_data
- theorem String.ltb_cons_addChar'
+/- theorem String.ltb_cons_addChar
+/- theorem String.toList_inj
Modified Mathlib/Data/String/Defs.lean
Modified Mathlib/Data/String/Lemmas.lean
+/- theorem String.congr_append
Deleted Mathlib/Lean/Elab/InfoTree.lean
- def Lean.Elab.collectTryThisSuggestions
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/LebesgueDifferentiationThm.lean
Modified Mathlib/SetTheory/PGame/Basic.lean
Modified Mathlib/Tactic/Basic.lean
- structure Mathlib.Tactic.withResetServerInfo.Result
- def Mathlib.Tactic.withResetServerInfo
Modified Mathlib/Tactic/DeclarationNames.lean
+/- def Mathlib.Linter.getNamesFrom
Modified Mathlib/Tactic/Hint.lean
+/- def Mathlib.Tactic.Hint.suggestion
+ def Mathlib.Tactic.Hint.withMessageLog
+ def Mathlib.Tactic.Hint.withoutInfoTrees
Modified Mathlib/Tactic/Linter/CommandRanges.lean
Modified Mathlib/Tactic/Linter/CommandStart.lean
+/- def Mathlib.Linter.CommandStart.endPos
Modified Mathlib/Tactic/Linter/DocString.lean
Modified Mathlib/Tactic/Linter/FindDeprecations.lean
+/- def Mathlib.Tactic.getPosAfterImports
+/- def Mathlib.Tactic.parseLine
Modified Mathlib/Tactic/Linter/HashCommandLinter.lean
Modified Mathlib/Tactic/Linter/Header.lean
+/- def Mathlib.Linter.authorsLineChecks
+/- def Mathlib.Linter.parseUpToHere
+/- def Mathlib.Linter.toSyntax
Modified Mathlib/Tactic/Linter/PPRoundtrip.lean
Modified Mathlib/Tactic/Linter/TextBased.lean
Modified Mathlib/Tactic/Linter/UpstreamableDecl.lean
Modified Mathlib/Tactic/Says.lean
+ def Mathlib.Tactic.Says.evalTacticCapturingInfo
+ def Mathlib.Tactic.Says.evalTacticCapturingMessages
Modified Mathlib/Tactic/SuccessIfFailWithMsg.lean
Modified Mathlib/Tactic/ToAdditive/Frontend.lean
Modified Mathlib/Tactic/ToAdditive/GuessName.lean
Modified Mathlib/Tactic/ToExpr.lean
Modified Mathlib/Tactic/Widget/Calc.lean
Modified Mathlib/Tactic/Widget/CongrM.lean
Modified Mathlib/Tactic/Widget/Conv.lean
Modified Mathlib/Tactic/Widget/GCongr.lean
Modified Mathlib/Tactic/Widget/InteractiveUnfold.lean
Modified Mathlib/Tactic/Widget/LibraryRewrite.lean
Modified Mathlib/Tactic/Widget/SelectPanelUtils.lean
Modified Mathlib/Util/CompileInductive.lean
Modified Mathlib/Util/Superscript.lean
Modified MathlibTest/CalcQuestionMark.lean
Modified MathlibTest/Change.lean
Modified MathlibTest/DeprecateTo.lean
Modified MathlibTest/FieldSimp.lean
Modified MathlibTest/FindSyntax.lean
Modified MathlibTest/LibraryRewrite.lean
Modified MathlibTest/LibrarySearch/basic.lean
Modified MathlibTest/LibrarySearch/mathlib.lean
Modified MathlibTest/LibrarySearch/observe.lean
Modified MathlibTest/Subsingleton.lean
Modified MathlibTest/Use.lean
Modified MathlibTest/Util/PrintSorries.lean
Modified MathlibTest/Variable.lean
Modified MathlibTest/fast_instance.lean
Modified MathlibTest/hint.lean
Modified MathlibTest/propose.lean
Modified MathlibTest/rewrites.lean
Modified MathlibTest/ring.lean
Modified MathlibTest/says.lean
Modified MathlibTest/says_whitespace.lean
Modified MathlibTest/success_if_fail_with_msg.lean
Modified MathlibTest/toAdditive.lean
Modified lake-manifest.json
Modified lakefile.lean
Modified lean-toolchain
Modified scripts/check-yaml.lean
Modified scripts/noshake.json
2025-10-22 17:48:30 40d354e
feat(ValMinAbs): add lemmas (#28837)
ESTIMATED CHANGES
Modified Mathlib/Data/ZMod/ValMinAbs.lean
+ theorem ZMod.abs_valMinAbs_eq_abs_valMinAbs
+ theorem ZMod.eq_neg_of_valMinAbs_eq_neg_valMinAbs
+ theorem ZMod.natAbs_valMinAbs_eq_natAbs_valMinAbs
+/- theorem ZMod.valMinAbs_eq_zero
+ theorem ZMod.valMinAbs_inj
2025-10-22 16:00:51 ce36371
feat(Combinators/SimpleGraph/Hamiltonian): `p.support.length = Fintype.card α` (#30206)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean
+ theorem SimpleGraph.Walk.IsHamiltonian.length_support
2025-10-22 16:00:49 f31d6cc
chore(Data/Typevec): Move variables into `variable` declaration in typevec (#27552)
This will be needed to allow `M.corec` to be generic across universes
ESTIMATED CHANGES
Modified Mathlib/Data/TypeVec.lean
+/- theorem TypeVec.Arrow.ext
+/- def TypeVec.Arrow
+/- def TypeVec.comp
+/- theorem TypeVec.comp_assoc
+/- theorem TypeVec.comp_id
+/- theorem TypeVec.id_comp
+/- def TypeVec.«repeat»
2025-10-22 11:41:41 e8336e1
chore: Revert "chore: bump toolchain to v4.25.0-rc2 (#30772)" (#30785)
This reverts commit d9d1cc1012eccfc8d01215b1b7943b0e7f8b7757.
cf. [#mathlib4 > Build error in Tactic file](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Build.20error.20in.20Tactic.20file/with/546423630)
ESTIMATED CHANGES
Modified lake-manifest.json
Modified lean-toolchain
2025-10-22 09:45:44 52404eb
chore: normalize doc heading spacing (#30760)
This PR removes superfluous white-space in the markdown headers of the docs: remove repeated spaces before a `#`, or between it and the actual heading.
I've tried to figure out whether there exists subtle reasons why one might want to have more than one space after the #-symbol, but I've been unable to find any.
ESTIMATED CHANGES
Modified Mathlib/Algebra/MonoidAlgebra/NoZeroDivisors.lean
Modified Mathlib/Algebra/MonoidAlgebra/Support.lean
Modified Mathlib/Algebra/Polynomial/Laurent.lean
Modified Mathlib/Algebra/SkewMonoidAlgebra/Support.lean
Modified Mathlib/Data/Finset/NatDivisors.lean
Modified Mathlib/Data/Nat/Dist.lean
Modified Mathlib/MeasureTheory/Integral/RieszMarkovKakutani/Basic.lean
Modified Mathlib/MeasureTheory/Integral/RieszMarkovKakutani/NNReal.lean
Modified Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean
Modified Mathlib/RingTheory/Polynomial/Opposites.lean
Modified Mathlib/RingTheory/PowerSeries/NoZeroDivisors.lean
Modified Mathlib/Tactic/ComputeDegree.lean
Modified Mathlib/Tactic/DeprecateTo.lean
Modified Mathlib/Tactic/ExtendDoc.lean
Modified Mathlib/Tactic/ExtractGoal.lean
Modified Mathlib/Tactic/FindSyntax.lean
Modified Mathlib/Tactic/Linter/CommandRanges.lean
Modified Mathlib/Tactic/Linter/CommandStart.lean
Modified Mathlib/Tactic/Linter/DeprecatedModule.lean
Modified Mathlib/Tactic/Linter/DocString.lean
Modified Mathlib/Tactic/Linter/FlexibleLinter.lean
Modified Mathlib/Tactic/Linter/HaveLetLinter.lean
Modified Mathlib/Tactic/Linter/Header.lean
Modified Mathlib/Tactic/Linter/Lint.lean
Modified Mathlib/Tactic/Linter/MinImports.lean
Modified Mathlib/Tactic/Linter/Multigoal.lean
Modified Mathlib/Tactic/Linter/PPRoundtrip.lean
Modified Mathlib/Tactic/Linter/Style.lean
Modified Mathlib/Tactic/Linter/UnusedTactic.lean
Modified Mathlib/Tactic/MoveAdd.lean
Modified Mathlib/Util/CountHeartbeats.lean
Modified MathlibTest/MoveAdd.lean
Modified scripts/create_deprecated_modules.lean
Modified scripts/declarations_diff.sh
2025-10-22 09:45:41 dc784dc
feat(Algebra/Order/Ring/Unbundled/Rat): exact form for `|q|` (#30263)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean
+ theorem Rat.abs_def'
+ theorem Rat.den_abs_eq_den
+ theorem Rat.num_abs_eq_abs_num
2025-10-22 09:45:39 85017a1
feat: uncurrying the product measure gives the product measure (#30179)
ESTIMATED CHANGES
Modified Mathlib/Probability/ProductMeasure.lean
+ theorem MeasureTheory.Measure.infinitePi_map_curry
+ theorem MeasureTheory.Measure.infinitePi_map_curry_symm
+ theorem MeasureTheory.Measure.infinitePi_map_piCurry
+ theorem MeasureTheory.Measure.infinitePi_map_piCurry_symm
2025-10-22 08:45:21 26ace33
chore(Analysis): Remove a transitive import and an unused scoped ENNReal (#30765)
ESTIMATED CHANGES
Modified Mathlib/Analysis/BoundedVariation.lean
2025-10-22 07:35:44 f8b9dcc
refactor(Analysis/Calculus/IteratedDeriv/Defs): tweak statement of `iteratedDerivWithin_one` (#29324)
This PR removes the `x` from `iteratedDerivWithin_one` to make it match `iteratedDerivWithin_zero`.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/IteratedDeriv/Defs.lean
+/- theorem iteratedDerivWithin_one
2025-10-22 03:58:15 d9d1cc1
chore: bump toolchain to v4.25.0-rc2 (#30772)
ESTIMATED CHANGES
Modified lake-manifest.json
Modified lean-toolchain
2025-10-22 00:08:25 1bbe77d
feat(Data/{Finset,Multiset}/Sort): give sort functions ≤ default argument (#27864)
Changes the `Finset.sort` and `Multiset.sort` functions to take `≤` as the default relation argument. Then removes this argument where possible through the rest of the library.
This involves switching the order of arguments, but I think this is fine, as this function is mostly called by dot notation anyway, and I think it is more typical for the first argument of such functions to have the type that matches the namespace.
Thanks to @eric-wieser for suggesting this approach
Zulip discussion: [#mathlib4 > Redefine {Fin/Multi}set.sort to take linear order?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Redefine.20.7BFin.2FMulti.7Dset.2Esort.20to.20take.20linear.20order.3F/with/532398325)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Basic.lean
Modified Mathlib/Data/Finset/Sort.lean
+/- theorem Finset.length_sort
+/- theorem Finset.map_sort
+/- theorem Finset.mem_sort
+/- def Finset.sort
+/- theorem Finset.sort_cons
+/- theorem Finset.sort_empty
+/- theorem Finset.sort_eq
+/- theorem Finset.sort_insert
+/- theorem Finset.sort_mk
+/- theorem Finset.sort_nodup
+/- theorem Finset.sort_perm_toList
+/- theorem Finset.sort_range
+/- theorem Finset.sort_singleton
+/- theorem Finset.sort_sorted
+/- theorem Finset.sort_sorted_gt
+/- theorem Finset.sort_sorted_lt
+/- theorem Finset.sort_toFinset
+/- theorem Finset.sort_val
+/- theorem Finset.sorted_zero_eq_min'
+/- theorem Finset.sorted_zero_eq_min'_aux
Modified Mathlib/Data/Multiset/Sort.lean
+/- theorem Multiset.coe_sort
+/- theorem Multiset.length_sort
+/- theorem Multiset.map_sort
+/- theorem Multiset.mem_sort
+/- def Multiset.sort
+/- theorem Multiset.sort_cons
+/- theorem Multiset.sort_eq
+/- theorem Multiset.sort_range
+/- theorem Multiset.sort_singleton
+/- theorem Multiset.sort_sorted
+/- theorem Multiset.sort_zero
Modified Mathlib/Data/Nat/Nth.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Factors.lean
Modified Mathlib/GroupTheory/Perm/Sign.lean
Modified Mathlib/Logic/Equiv/Finset.lean
Modified Mathlib/Logic/Equiv/Multiset.lean
Modified Mathlib/NumberTheory/ADEInequality.lean
2025-10-21 22:20:04 4994494
style(Algebra): fix whitespace (#30688)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean
+/- def ModuleCat.ExtendRestrictScalarsAdj.counit
+/- def ModuleCat.ExtendRestrictScalarsAdj.unit
Modified Mathlib/Algebra/Divisibility/Basic.lean
Modified Mathlib/Algebra/EuclideanDomain/Basic.lean
+/- theorem EuclideanDomain.mul_add_div_left
Modified Mathlib/Algebra/Group/Commute/Defs.lean
Modified Mathlib/Algebra/Group/Hom/CompTypeclasses.lean
Modified Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean
Modified Mathlib/Algebra/Group/Semiconj/Basic.lean
Modified Mathlib/Algebra/Group/Semiconj/Units.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean
+/- theorem CochainComplex.HomComplex.δ_neg
Modified Mathlib/Algebra/Homology/HomotopyCategory/HomComplexShift.lean
Modified Mathlib/Algebra/MvPolynomial/Equiv.lean
Modified Mathlib/Algebra/Notation/Defs.lean
Modified Mathlib/Algebra/Notation/Pi/Defs.lean
+/- theorem Pi.div_apply
Modified Mathlib/Algebra/Order/Antidiag/Pi.lean
Modified Mathlib/Algebra/Polynomial/Laurent.lean
Modified Mathlib/Algebra/Polynomial/Sequence.lean
+/- theorem Polynomial.Sequence.basis_degree_strictMono
+/- theorem Polynomial.Sequence.basis_natDegree_strictMono
+/- theorem Polynomial.Sequence.degree_strictMono
+/- theorem Polynomial.Sequence.natDegree_strictMono
Modified Mathlib/Algebra/Polynomial/Smeval.lean
+/- theorem Polynomial.smeval_X_pow_mul
+/- theorem Polynomial.smeval_at_zero
+/- theorem Polynomial.smeval_comp
+/- theorem Polynomial.smeval_mul
+/- theorem Polynomial.smeval_mul_X_pow
+/- theorem Polynomial.smeval_neg
+/- theorem Polynomial.smeval_pow
+/- def Polynomial.smul_pow
Modified Mathlib/Algebra/Quaternion.lean
Modified Mathlib/Algebra/Ring/Ext.lean
2025-10-21 20:48:58 1f2d45d
style(Order): fix whitespace (#30762)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/Order/Bounds/Image.lean
Modified Mathlib/Order/Filter/Cocardinal.lean
Modified Mathlib/Order/Heyting/Basic.lean
Modified Mathlib/Order/KonigLemma.lean
Modified Mathlib/Order/Monotone/Basic.lean
+/- theorem StrictMono.add_le_nat
Modified Mathlib/Order/PiLex.lean
Modified Mathlib/Order/RelClasses.lean
Modified Mathlib/Order/SetNotation.lean
+/- theorem Set.sSup_eq_sUnion
Modified Mathlib/Order/WithBot.lean
+/- theorem WithTop.coe_untopD_le
2025-10-21 20:48:55 95d8f63
chore(Analysis): remove unused variable declarations (#30761)
...and also remove a docstring containing only an empty header.
ESTIMATED CHANGES
Modified Mathlib/Analysis/BoundedVariation.lean
2025-10-21 20:48:53 6776574
style(RingTheory): fix whitespace (#30685)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/AdicCompletion/LocalRing.lean
Modified Mathlib/RingTheory/Binomial.lean
+/- theorem Ring.multichoose_neg_self
Modified Mathlib/RingTheory/DedekindDomain/Factorization.lean
Modified Mathlib/RingTheory/DedekindDomain/SelmerGroup.lean
+/- def IsDedekindDomain.HeightOneSpectrum.valuationOfNeZeroMod
+/- def IsDedekindDomain.selmerGroup.fromUnitLift
+/- def IsDedekindDomain.selmerGroup
Modified Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean
Modified Mathlib/RingTheory/Flat/Domain.lean
Modified Mathlib/RingTheory/Grassmannian.lean
Modified Mathlib/RingTheory/HahnSeries/HEval.lean
Modified Mathlib/RingTheory/Ideal/IsPrincipalPowQuotient.lean
Modified Mathlib/RingTheory/Invariant/Basic.lean
Modified Mathlib/RingTheory/LaurentSeries.lean
Modified Mathlib/RingTheory/Localization/Defs.lean
Modified Mathlib/RingTheory/MvPowerSeries/Evaluation.lean
Modified Mathlib/RingTheory/MvPowerSeries/LinearTopology.lean
Modified Mathlib/RingTheory/Nilpotent/Exp.lean
Modified Mathlib/RingTheory/Norm/Transitivity.lean
Modified Mathlib/RingTheory/Polynomial/Pochhammer.lean
Modified Mathlib/RingTheory/SimpleModule/Isotypic.lean
2025-10-21 20:48:51 df90d22
feat(RingTheory): meta properties of bijective ring homomorphisms (#28695)
In particular, we show that bijective is a property local on the (algebraic) source.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/Basic.lean
+ theorem Algebra.algebraMapSubmonoid_self
Modified Mathlib/Algebra/Algebra/Hom.lean
+ theorem AlgHom.coe_toLinearMap
Modified Mathlib/LinearAlgebra/TensorProduct/Basic.lean
+ theorem TensorProduct.map_bijective
Modified Mathlib/RingTheory/LocalProperties/Exactness.lean
+ theorem bijective_of_isLocalization_of_span_eq_top
+ theorem injective_of_isLocalization_of_span_eq_top
+ theorem surjective_of_isLocalization_of_span_eq_top
Modified Mathlib/RingTheory/Localization/Algebra.lean
+ theorem IsLocalization.mapExtendScalars_eq_toLinearMap_mapₐ
+ theorem IsLocalization.map_eq_toLinearMap_mapₐ
+ theorem IsLocalization.map_linearMap_eq_toLinearMap_mapₐ
Modified Mathlib/RingTheory/Localization/Away/Basic.lean
Modified Mathlib/RingTheory/Localization/Basic.lean
Added Mathlib/RingTheory/RingHom/Bijective.lean
+ theorem RingHom.Bijective.containsIdentities
+ theorem RingHom.Bijective.isStableUnderBaseChange
+ theorem RingHom.Bijective.ofLocalizationSpan
+ theorem RingHom.Bijective.respectsIso
+ theorem RingHom.Bijective.stableUnderComposition
Modified Mathlib/RingTheory/TensorProduct/Basic.lean
+ theorem Algebra.TensorProduct.includeLeft_bijective
+ theorem Algebra.TensorProduct.includeRight_bijective
+ theorem Algebra.TensorProduct.map_bijective
2025-10-21 20:13:55 dc03831
feat(LinearAlgebra/Matrix/PosDef): add `posSemidef_sum` (#29868)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Star/BigOperators.lean
+ theorem isSelfAdjoint_sum
Modified Mathlib/LinearAlgebra/Matrix/PosDef.lean
+ theorem Matrix.posDef_sum
+ theorem Matrix.posSemidef_sum
2025-10-21 18:22:15 3218e4a
chore(AlgebraicGeometry): add missing lemmas about morphism classes (#30596)
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Affine.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean
+ theorem AlgebraicGeometry.Scheme.Hom.app_surjective
+ theorem AlgebraicGeometry.isClosedImmersion_iff_isAffineHom
Modified Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean
+ theorem AlgebraicGeometry.AffineTargetMorphismProperty.diagonal_of_openCover_source
Modified Mathlib/AlgebraicGeometry/Morphisms/Descent.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Finite.lean
+ theorem AlgebraicGeometry.IsFinite.comp_iff
+ theorem AlgebraicGeometry.IsFinite.of_comp
Modified Mathlib/AlgebraicGeometry/Morphisms/FinitePresentation.lean
+/- theorem AlgebraicGeometry.Scheme.Hom.isConstructible_image
+/- theorem AlgebraicGeometry.Scheme.Hom.isConstructible_preimage
Modified Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Flat.lean
+/- theorem AlgebraicGeometry.Flat.epi_of_flat_of_surjective
Modified Mathlib/AlgebraicGeometry/Morphisms/Immersion.lean
+/- def AlgebraicGeometry.Scheme.Hom.coborderRange
+/- theorem AlgebraicGeometry.Scheme.Hom.isLocallyClosed_range
+/- def AlgebraicGeometry.Scheme.Hom.liftCoborder
+/- theorem AlgebraicGeometry.Scheme.Hom.liftCoborder_ι
Modified Mathlib/AlgebraicGeometry/Morphisms/Integral.lean
+ theorem AlgebraicGeometry.IsIntegralHom.comp_iff
+ theorem AlgebraicGeometry.IsIntegralHom.of_comp
Modified Mathlib/AlgebraicGeometry/Morphisms/Proper.lean
+ theorem AlgebraicGeometry.IsProper.comp_iff
+ theorem AlgebraicGeometry.IsProper.of_comp
- theorem AlgebraicGeometry.IsProper.of_comp_of_isSeparated
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean
- theorem AlgebraicGeometry.quasiCompact_over_affine_iff
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean
+/- theorem AlgebraicGeometry.IsAffineOpen.isQuasiSeparated
+ theorem AlgebraicGeometry.QuasiCompact.of_comp
+/- theorem AlgebraicGeometry.QuasiSeparated.of_comp
+ theorem AlgebraicGeometry.Scheme.quasiSeparatedSpace_of_isOpenCover
+/- theorem AlgebraicGeometry.quasiCompact_affineProperty_iff_quasiSeparatedSpace
+ theorem AlgebraicGeometry.quasiCompact_iff_compactSpace
- theorem AlgebraicGeometry.quasiSeparatedSpace_iff_affine
+ theorem AlgebraicGeometry.quasiSeparatedSpace_iff_forall_affineOpens
+/- theorem AlgebraicGeometry.quasiSeparatedSpace_of_quasiSeparated
+ theorem AlgebraicGeometry.quasiSeparated_iff_quasiSeparatedSpace
- theorem AlgebraicGeometry.quasiSeparated_over_affine_iff
Modified Mathlib/AlgebraicGeometry/Morphisms/Separated.lean
+/- theorem AlgebraicGeometry.IsAffineHom.comp_iff
+ theorem AlgebraicGeometry.IsClosedImmersion.comp_iff
+/- theorem AlgebraicGeometry.isSeparated_of_injective
Modified Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean
Modified Mathlib/AlgebraicGeometry/Noetherian.lean
Modified Mathlib/AlgebraicGeometry/Pullbacks.lean
+/- def AlgebraicGeometry.Scheme.Pullback.openCoverOfBase'
+/- def AlgebraicGeometry.Scheme.Pullback.openCoverOfBase
+/- def AlgebraicGeometry.Scheme.Pullback.openCoverOfLeft
+/- def AlgebraicGeometry.Scheme.Pullback.openCoverOfLeftRight
+/- def AlgebraicGeometry.Scheme.Pullback.openCoverOfRight
Modified Mathlib/AlgebraicGeometry/QuasiAffine.lean
Modified Mathlib/AlgebraicGeometry/ValuativeCriterion.lean
2025-10-21 16:00:25 a194863
CI: remove deprecations automatically (#30070)
This workflow automates the removal of deprecated declarations. The action is currently configured to run once a week to automatically remove all deprecations older than 6 months.
This is managed by the `remove_deprecated_decls` action and depends on the two files `Mathlib/Tactic/Linter/CommandRanges.lean` and `Mathlib/Tactic/Linter/FindDeprecations.lean`.
The action can be manually triggered and there is the option of passing two dates in `YYYY-MM-DD` format or also the more human "3 months ago", as long as it is a valid input for `date -d`.
The lean files take care of identifying the declarations with the deprecated attribute whose `since` field is between the given ranges.
Those declarations then get automatically removed and, if there are no errors, the bot creates a PR with the changes.
These PRs then go, naturally, through CI, where issues related to having removed the deprecated declarations will be picked up. The bot also posts a comment on Zulip mentioning when the PR has been opened.
Zulip thread: [#mathlib reviewers > auto-removing oudated deprecations](https://leanprover.zulipchat.com/#narrow/channel/345428-mathlib-reviewers/topic/auto-removing.20oudated.20deprecations/with/541052056) (in reviewers channel)
ESTIMATED CHANGES
Added .github/workflows/remove_deprecated_decls.yml
Modified Mathlib.lean
Modified Mathlib/Tactic.lean
Added Mathlib/Tactic/Linter/CommandRanges.lean
+ def Mathlib.Linter.CommandRanges.commandRangesLinter
Added Mathlib/Tactic/Linter/FindDeprecations.lean
+ structure Mathlib.Tactic.DeprecationInfo
+ def Mathlib.Tactic.addAfterImports
+ def Mathlib.Tactic.deprecatedHashMap
+ def Mathlib.Tactic.getDeprecatedInfo
+ def Mathlib.Tactic.getPosAfterImports
+ def Mathlib.Tactic.importLT
+ def Mathlib.Tactic.parseLine
+ def Mathlib.Tactic.removeDeprecations
+ def Mathlib.Tactic.removeRanges
+ def Mathlib.Tactic.repos
+ def Mathlib.Tactic.rewriteOneFile
Added MathlibTest/FindDeprecations.lean
2025-10-21 15:08:16 409ca75
feat: define `CFC.abs`, the absolute value in a C⋆-algebra (#30314)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Star/Basic.lean
Added Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Abs.lean
+ theorem CFC.abs_add_self
+ theorem CFC.abs_algebraMap
+ theorem CFC.abs_algebraMap_nnreal
+ theorem CFC.abs_eq_cfc_norm
+ theorem CFC.abs_eq_cfcₙ_coe_norm
+ theorem CFC.abs_eq_cfcₙ_norm
+ theorem CFC.abs_eq_zero_iff
+ theorem CFC.abs_intCast
+ theorem CFC.abs_mul_abs
+ theorem CFC.abs_mul_self
+ theorem CFC.abs_natCast
+ theorem CFC.abs_neg
+ theorem CFC.abs_nnrpow
+ theorem CFC.abs_nnrpow_two
+ theorem CFC.abs_nnrpow_two_mul
+ theorem CFC.abs_nonneg
+ theorem CFC.abs_ofNat
+ theorem CFC.abs_of_nonneg
+ theorem CFC.abs_of_nonpos
+ theorem CFC.abs_one
+ theorem CFC.abs_smul
+ theorem CFC.abs_smul_nonneg
+ theorem CFC.abs_sq
+ theorem CFC.abs_star
+ theorem CFC.abs_sub_self
+ theorem CFC.abs_zero
+ theorem CFC.cfcAbs_cfcAbs
+ theorem CFC.commute_abs_self
+ theorem CFC.norm_abs
+ theorem CFC.quasispectrum_abs
+ theorem CFC.spectrum_abs
+ theorem Commute.cfcAbs_cfcAbs
+ theorem Commute.cfcAbs_left
+ theorem Commute.cfcAbs_mul_eq
+ theorem Commute.cfcAbs_right
+ theorem cfc_comp_norm
+ theorem cfcₙ_comp_norm
+ theorem cfcₙ_norm_nonneg
+ theorem cfcₙ_norm_sq_nonneg
2025-10-21 15:08:14 7072112
feat(SkewMonoidAlgebra): Lifts for skew monoid algebras (#29314)
Lemmas about different kinds of "lifts" to `SkewMonoidAlgebra` - Similar in spirit to the MonoidAlgebra.Lift file.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean
Added Mathlib/Algebra/SkewMonoidAlgebra/Lift.lean
+ theorem SkewMonoidAlgebra.coeff_equivMapDomain
+ def SkewMonoidAlgebra.domCongr
+ def SkewMonoidAlgebra.domCongrAlg
+ theorem SkewMonoidAlgebra.domCongrAlg_apply
+ theorem SkewMonoidAlgebra.domCongrAlg_toAlgHom
+ theorem SkewMonoidAlgebra.domCongr_refl
+ theorem SkewMonoidAlgebra.domCongr_single
+ theorem SkewMonoidAlgebra.domCongr_support
+ theorem SkewMonoidAlgebra.domCongr_symm
+ def SkewMonoidAlgebra.domLCongr
+ def SkewMonoidAlgebra.equivMapDomain
+ theorem SkewMonoidAlgebra.equivMapDomain_eq_mapDomain
+ theorem SkewMonoidAlgebra.equivMapDomain_refl
+ theorem SkewMonoidAlgebra.equivMapDomain_single
+ theorem SkewMonoidAlgebra.equivMapDomain_trans
+ def SkewMonoidAlgebra.lift
+ def SkewMonoidAlgebra.liftNCAlgHom
+ theorem SkewMonoidAlgebra.lift_apply'
+ theorem SkewMonoidAlgebra.lift_apply
+ theorem SkewMonoidAlgebra.lift_def
+ theorem SkewMonoidAlgebra.lift_of
+ theorem SkewMonoidAlgebra.lift_single
+ theorem SkewMonoidAlgebra.lift_symm_apply
+ theorem SkewMonoidAlgebra.lift_unique'
+ theorem SkewMonoidAlgebra.lift_unique
+ def SkewMonoidAlgebra.mapDomainAlgHom
+ def SkewMonoidAlgebra.submoduleOfSmulMem
+ theorem SkewMonoidAlgebra.toFinsupp_equivMapDomain
2025-10-21 15:08:11 58e54de
chore(Analysis/Fourier): golf entire `fourier_zero` and `fourier_zero'` using `simp` (#28260)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Fourier/AddCircle.lean
+/- theorem fourier_zero'
2025-10-21 14:19:42 2c2e856
feat: remove unnecessary nonempty assumption at expect lemmas (#30502)
feat: Dropped unnecessary `Nonempty` assumptions in
`expect_eq_zero_iff_of_nonpos` and `expect_eq_zero_iff_of_nonneg`
(the `Finset` and `Fintype` versions)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/BigOperators/Expect.lean
+/- theorem Finset.expect_eq_zero_iff_of_nonneg
+/- theorem Finset.expect_eq_zero_iff_of_nonpos
+/- theorem Fintype.expect_eq_zero_iff_of_nonneg
+/- theorem Fintype.expect_eq_zero_iff_of_nonpos
2025-10-21 14:19:39 c59d921
feat: application of twice uncurried differential form (#30491)
We add a formula that expresses the value of the twice uncurried&alternatized form
as a sum of terms of the form `f a b u - f b a u`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Fin.lean
+ theorem Fin.prod_prod_eq_prod_triangle_mul
Modified Mathlib/LinearAlgebra/Alternating/Uncurry/Fin.lean
+ theorem AlternatingMap.alternatizeUncurryFin_alternatizeUncurryFinLM_comp_apply
2025-10-21 13:36:28 726f8bc
chore(CompactlySupported): rename ContinuousMap.liftCompactlySupported (#30726)
ESTIMATED CHANGES
Modified Mathlib/Topology/ContinuousMap/CompactlySupported.lean
- def CompactlySupportedContinuousMap.ContinuousMap.liftCompactlySupported
+ def CompactlySupportedContinuousMap.continuousMapEquiv
2025-10-21 13:36:26 af5e957
feat(Algebra/Group/Subgroup): membership of toAddSubgroup etc (#30461)
Some simp lemmas for statements of the form `g ∈ Subgroup.toAddSubgroup H`
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Subgroup/Lattice.lean
+ theorem AddSubgroup.mem_toSubgroup'
+ theorem Additive.mem_toAddSubgroup
+ theorem Multiplicative.mem_toSubgroup
+ theorem Subgroup.mem_toAddSubgroup'
2025-10-21 12:12:35 b758e76
chore: remove redundant fields from instances (#30734)
This PR removes all occurrences of patterns like `mul := (· * ·)` in definitions of instances. These patterns are unneccessary, and sometimes they cause the instance to behave inefficiently during unification.
I have no idea why these patterns were there in the first place. Maybe it was a Lean3 thing?
As a result, we get a pretty good speedup: 0.63% less instructions.
ESTIMATED CHANGES
Modified Counterexamples/LinearOrderWithPosMulPosEqZero.lean
Modified Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean
Modified Mathlib/Algebra/Algebra/Basic.lean
Modified Mathlib/Algebra/Algebra/RestrictScalars.lean
Modified Mathlib/Algebra/GradedMonoid.lean
Modified Mathlib/Algebra/Group/Action/Defs.lean
Modified Mathlib/Algebra/Group/Action/Hom.lean
Modified Mathlib/Algebra/Group/Action/Opposite.lean
Modified Mathlib/Algebra/Group/Action/Option.lean
Modified Mathlib/Algebra/Group/Action/Pi.lean
Modified Mathlib/Algebra/Group/InjSurj.lean
Modified Mathlib/Algebra/Group/Pointwise/Set/Basic.lean
Modified Mathlib/Algebra/Group/TypeTags/Basic.lean
Modified Mathlib/Algebra/Group/WithOne/Defs.lean
Modified Mathlib/Algebra/GroupWithZero/Action/Defs.lean
Modified Mathlib/Algebra/GroupWithZero/Action/Units.lean
Modified Mathlib/Algebra/GroupWithZero/Associated.lean
Modified Mathlib/Algebra/GroupWithZero/InjSurj.lean
Modified Mathlib/Algebra/Module/GradedModule.lean
Modified Mathlib/Algebra/Module/LocalizedModule/Basic.lean
Modified Mathlib/Algebra/Module/Submodule/Pointwise.lean
Modified Mathlib/Algebra/Module/ULift.lean
Modified Mathlib/Algebra/Order/Interval/Basic.lean
Modified Mathlib/Algebra/Order/Ring/WithTop.lean
Modified Mathlib/Algebra/Order/UpperLower.lean
Modified Mathlib/Algebra/Quaternion.lean
Modified Mathlib/Algebra/Ring/BooleanRing.lean
Modified Mathlib/Algebra/Ring/Defs.lean
Modified Mathlib/Algebra/Ring/Hom/Defs.lean
Modified Mathlib/Algebra/Ring/InjSurj.lean
Modified Mathlib/Algebra/Ring/Pi.lean
Modified Mathlib/Algebra/RingQuot.lean
Modified Mathlib/Algebra/Symmetrized.lean
Modified Mathlib/Algebra/TrivSqZeroExt.lean
Modified Mathlib/Algebra/Tropical/Basic.lean
Modified Mathlib/CategoryTheory/Abelian/NonPreadditive.lean
Modified Mathlib/CategoryTheory/Preadditive/OfBiproducts.lean
Modified Mathlib/Combinatorics/Enumerative/IncidenceAlgebra.lean
Modified Mathlib/Computability/Language.lean
Modified Mathlib/Data/Complex/Basic.lean
Modified Mathlib/Data/ENNReal/Action.lean
Modified Mathlib/Data/Finsupp/SMulWithZero.lean
Modified Mathlib/Data/Matrix/Mul.lean
Modified Mathlib/Data/NNReal/Defs.lean
Modified Mathlib/Data/Nat/PartENat.lean
Modified Mathlib/Data/Num/Lemmas.lean
Modified Mathlib/Data/Num/ZNum.lean
Modified Mathlib/Data/Rat/Defs.lean
Modified Mathlib/Data/Real/Basic.lean
Modified Mathlib/Data/Sign/Defs.lean
Modified Mathlib/FieldTheory/PerfectClosure.lean
Modified Mathlib/FieldTheory/RatFunc/Basic.lean
Modified Mathlib/Geometry/Manifold/Algebra/SmoothFunctions.lean
Modified Mathlib/GroupTheory/FreeGroup/Basic.lean
Modified Mathlib/GroupTheory/GroupAction/SubMulAction.lean
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/Pointwise.lean
Modified Mathlib/LinearAlgebra/Complex/Module.lean
Modified Mathlib/LinearAlgebra/LinearPMap.lean
Modified Mathlib/LinearAlgebra/PiTensorProduct.lean
Modified Mathlib/LinearAlgebra/Ray.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Basic.lean
Modified Mathlib/NumberTheory/Dioph.lean
Modified Mathlib/NumberTheory/MulChar/Basic.lean
Modified Mathlib/NumberTheory/Zsqrtd/Basic.lean
Modified Mathlib/Order/Filter/Pointwise.lean
Modified Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean
Modified Mathlib/RingTheory/HahnSeries/Addition.lean
Modified Mathlib/RingTheory/HahnSeries/Summable.lean
Modified Mathlib/RingTheory/MvPowerSeries/Basic.lean
Modified Mathlib/SetTheory/Cardinal/Order.lean
Modified Mathlib/SetTheory/Ordinal/Arithmetic.lean
Modified Mathlib/SetTheory/Ordinal/Basic.lean
Modified Mathlib/SetTheory/Ordinal/NaturalOps.lean
Modified Mathlib/SetTheory/Ordinal/Notation.lean
Modified Mathlib/SetTheory/Surreal/Basic.lean
Modified Mathlib/Topology/Algebra/Module/LinearMap.lean
Modified Mathlib/Topology/Algebra/UniformMulAction.lean
Modified Mathlib/Topology/ContinuousMap/Algebra.lean
Modified MathlibTest/Simps.lean
+/- def coercing.bar
+/- def coercing.new_bar
2025-10-21 12:12:33 91a64a7
fix(AlgebraicTopology/SimplexCategory/GeneratorsRelations): ungrind `IsAdmissible.singleton` (#30732)
As pointed in the thread for #30586, the attribute `[grind →]` on `IsAdmissible.singleton` causes unwanted instantiations as the only hypothesis is too generic.
The lemma is un-grinded and the only proof that uses it now calls it explicitly.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
2025-10-21 12:12:31 24c5360
doc: fix recurring instances of "this files" (#30719)
I noticed that there were a lot of instances of the typo "this files" in the repo. I fixed these while doing some drive-by typo fixes in the files I touched while I was at it.
The drive-by fixes are due to Codex and consist of:
- Minor textual tweaks to improve flow of sentences.
- Punctuation, like adding commas and full stops where appropriate in sentences.
- Trimming superfluous white space and adding missing white space.
- Swapping a `∪`-operator for a `∩`, where the latter was intended.
- Swapping `𝒱(α, β, 𝔖 uβ)` for `𝒱(α, β, 𝔖, uβ)` where the latter was intended.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Homology/HomotopyCategory/ShiftSequence.lean
Modified Mathlib/Algebra/Order/Group/Opposite.lean
Modified Mathlib/Algebra/Order/Ring/Opposite.lean
Modified Mathlib/Analysis/Convex/Star.lean
Modified Mathlib/Analysis/LocallyConvex/Barrelled.lean
Modified Mathlib/Analysis/LocallyConvex/ContinuousOfBounded.lean
Modified Mathlib/CategoryTheory/Limits/ConeCategory.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean
Modified Mathlib/CategoryTheory/Triangulated/TStructure/Basic.lean
Modified Mathlib/Combinatorics/Quiver/Push.lean
Modified Mathlib/Condensed/Light/Module.lean
+/- def LightCondensed.freeForgetAdjunction
Modified Mathlib/Condensed/Module.lean
Modified Mathlib/Data/Finsupp/Weight.lean
Modified Mathlib/Data/List/Lattice.lean
Modified Mathlib/Data/Sym/Sym2/Order.lean
Modified Mathlib/GroupTheory/QuotientGroup/Basic.lean
Modified Mathlib/LinearAlgebra/Matrix/SemiringInverse.lean
Modified Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean
Modified Mathlib/Logic/Equiv/PartialEquiv.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Integrals.lean
Modified Mathlib/RingTheory/MvPowerSeries/PiTopology.lean
Modified Mathlib/RingTheory/TensorProduct/Quotient.lean
Modified Mathlib/Tactic/HaveI.lean
Modified Mathlib/Topology/Algebra/Group/ClosedSubgroup.lean
Modified Mathlib/Topology/Algebra/GroupCompletion.lean
Modified Mathlib/Topology/Algebra/Module/ClosedSubmodule.lean
Modified Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean
Modified Mathlib/Topology/Algebra/OpenSubgroup.lean
Modified Mathlib/Topology/Algebra/UniformFilterBasis.lean
Modified Mathlib/Topology/Algebra/UniformRing.lean
Modified Mathlib/Topology/Category/LightProfinite/Sequence.lean
Modified Mathlib/Topology/Category/TopCat/Sphere.lean
Modified Mathlib/Topology/MetricSpace/Equicontinuity.lean
Modified Mathlib/Topology/MetricSpace/HausdorffDistance.lean
Modified Mathlib/Topology/UniformSpace/Separation.lean
Modified Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean
2025-10-21 12:12:29 e78e779
feat(NumberField/Cyclotomic): splitting of the prime `p` in the `p^k`-th cyclotomic field (#30682)
The prime ideal above the prime `p` in the `p^k`-th cyclotomic field is totally ramified.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
+ theorem IsCyclotomicExtension.Rat.finrank
Added Mathlib/NumberTheory/NumberField/Cyclotomic/Ideal.lean
+ theorem IsCyclotomicExtension.Rat.absNorm_span_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.associated_norm_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.eq_span_zeta_sub_one_of_liesOver
+ theorem IsCyclotomicExtension.Rat.inertiaDeg_eq_of_prime_pow
+ theorem IsCyclotomicExtension.Rat.inertiaDeg_span_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.liesOver_span_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.map_eq_span_zeta_sub_one_pow
+ theorem IsCyclotomicExtension.Rat.ncard_primesOver_of_prime_pow
+ theorem IsCyclotomicExtension.Rat.p_mem_span_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.ramificationIdx_eq_of_prime_pow
+ theorem IsCyclotomicExtension.Rat.ramificationIdx_span_zeta_sub_one
+ theorem IsCyclotomicExtension.Rat.span_zeta_sub_one_ne_bot
Modified Mathlib/NumberTheory/RamificationInertia/Basic.lean
+ theorem Ideal.absNorm_eq_pow_inertiaDeg'
Modified Mathlib/RingTheory/RootsOfUnity/CyclotomicUnits.lean
+ theorem IsPrimitiveRoot.associated_map_sub_one_map_sub_one
+ theorem IsPrimitiveRoot.associated_sub_one_map_sub_one
2025-10-21 12:12:27 6880a16
feat(LinearAlgebra/AffineSpace/FiniteDimensional): `finiteDimensional_direction_affineSpan_insert_set` (#30521)
Add an instance
```lean
instance finiteDimensional_direction_affineSpan_insert_set (s : Set P)
[FiniteDimensional k (affineSpan k s).direction] (p : P) :
FiniteDimensional k (affineSpan k (insert p s)).direction := by
```
which is what is needed in a Euclidean context to be able to talk about an `orthogonalProjection` onto a `line` (i.e. the affine span of two points).
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean
2025-10-21 12:12:25 d865df9
feat: `empty_ne_singleton` (#30493)
This slightly strengthens our simp set.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Group/Finset.lean
Modified Mathlib/Data/Finset/Insert.lean
+ theorem Finset.empty_ne_singleton
Modified Mathlib/Data/Set/Insert.lean
+ theorem Set.empty_ne_singleton
2025-10-21 12:12:23 7702f1c
chore(Algebra/Order/BigOperators/Group/List): remove commutativity assumptions (#30488)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/BigOperators/Group/List.lean
+/- theorem List.monotone_prod_take
+/- theorem List.prod_eq_one_iff
2025-10-21 12:12:21 b72a2be
feat(CategoryTheory): local objects with respect to a MorphismProperty (#30472)
Given `W : MorphismProperty C`, we define `W.isLocal : ObjectProperty C` which is the property of objects `Z` such that for any `f : X ⟶ Y` satisfying `W`, the precomposition with `f` gives a bijection `(Y ⟶ Z) ≃ (X ⟶ Z)`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/Localization/Bousfield.lean
+ theorem CategoryTheory.Localization.LeftBousfield.galoisConnection
+ theorem CategoryTheory.Localization.LeftBousfield.le_W_iff
+ theorem CategoryTheory.MorphismProperty.le_leftBousfieldW_isLocal
+ theorem CategoryTheory.ObjectProperty.le_isLocal_W
Added Mathlib/CategoryTheory/ObjectProperty/Local.lean
+ def CategoryTheory.MorphismProperty.isLocal
+ theorem CategoryTheory.MorphismProperty.isLocal_iff
2025-10-21 12:12:19 2785cc1
feat(CategoryTheory/Limits): sections of functors and precomposition with initial functors (#30403)
Given `F : C ⥤ D` and `P : D ⥤ Type w`, we define a map `sectionsPrecomp F : P.sections → (F ⋙ P).sections` and show that it is a bijection when `F` is initial.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Limits/Final/Type.lean
+ theorem CategoryTheory.Functor.bijective_sectionsPrecomp
+ def CategoryTheory.Functor.sectionsPrecomp
2025-10-21 12:12:17 f37cfa7
feat(RingTheory/RootsOfUnity): `rootsOfUnity_inf_rootsOfUnity` (#30264)
towards torsion subgroup as union of roots of unity of prime powers
ESTIMATED CHANGES
Modified Mathlib/RingTheory/RootsOfUnity/Basic.lean
+ theorem disjoint_rootsOfUnity_of_coprime
+ theorem rootsOfUnity_inf_rootsOfUnity
2025-10-21 12:12:15 c3836ff
feat(CategoryTheory/Limits/Opposites) : add opposites of coforks and forks (#30200)
This PR adds missing definitions surrounding `op` and `unop` of coforks and forks.
In `CategoryTheory/Limits/Shapes/Equalizers.lean`:
- `CoforkOfπ.ext` : Adds an extensionality `def` corresponding to the existing `ForkOfι.ext`
In `CategoryTheory/Limits/Opposites.lean`:
- `parallelPairOpIso`: the dual behavior for `parallelPair` (similar to `spanOp`, `cospanOp`)
- `pullbackIsoOpPushout`: the dual version of the existing `pullbackIsoUnopPushout`
- `Cofork.unop`, `Cofork.op`, `Fork.unop`, `Fork.op`: define `unop` and `op` of `Cofork` and `Fork`
- `isColimitEquivIsLimitOp`: A cofork in `C` is a colimit if and only if its opposite is limit in `Cᵒᵖ`
- `isColimitOfπEquivIsLimitOp`: `Cofork.ofπ π` is colimit in `C` if and only if `Fork.ofι π.op` is limit in `Cᵒᵖ`
- `isColimitCoforkPushoutEquivIsColimitForkOpPullback`: `Cofork.ofπ f pullback.condition` is colimit in `C` if and only if `Fork.ofι f.op pushout.condition` is limit in `Cᵒᵖ`.
Relevant dual statements have also been added.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean
+ def CategoryTheory.Limits.CoforkOfπ.ext
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_hom_app_op_one
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_hom_app_op_zero
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_inv_app_op_one
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_inv_app_op_zero
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_unitIso_hom_app_one
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_unitIso_hom_app_zero
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_unitIso_inv_app_one
+ theorem CategoryTheory.Limits.walkingParallelPairOpEquiv_unitIso_inv_app_zero
Modified Mathlib/CategoryTheory/Limits/Shapes/Opposites/Equalizers.lean
+ def CategoryTheory.Limits.Cofork.isColimitCoforkPushoutEquivIsColimitForkOpPullback
+ def CategoryTheory.Limits.Cofork.isColimitCoforkPushoutEquivIsColimitForkUnopPullback
+ def CategoryTheory.Limits.Cofork.isColimitEquivIsLimitOp
+ def CategoryTheory.Limits.Cofork.isColimitEquivIsLimitUnop
+ def CategoryTheory.Limits.Cofork.isColimitOfπEquivIsLimitOp
+ def CategoryTheory.Limits.Cofork.isColimitOfπEquivIsLimitUnop
+ def CategoryTheory.Limits.Cofork.ofπOpIsoOfι
+ def CategoryTheory.Limits.Cofork.ofπUnopIsoOfι
+ def CategoryTheory.Limits.Cofork.op
+ def CategoryTheory.Limits.Cofork.opUnopIso
+ theorem CategoryTheory.Limits.Cofork.op_unop_π
+ theorem CategoryTheory.Limits.Cofork.op_ι
+ theorem CategoryTheory.Limits.Cofork.op_π_app_one
+ theorem CategoryTheory.Limits.Cofork.op_π_app_zero
+ def CategoryTheory.Limits.Cofork.unop
+ def CategoryTheory.Limits.Cofork.unopOpIso
+ theorem CategoryTheory.Limits.Cofork.unop_op_π
+ theorem CategoryTheory.Limits.Cofork.unop_ι
+ theorem CategoryTheory.Limits.Cofork.unop_π_app_one
+ theorem CategoryTheory.Limits.Cofork.unop_π_app_zero
+ def CategoryTheory.Limits.Fork.isLimitEquivIsColimitOp
+ def CategoryTheory.Limits.Fork.isLimitEquivIsColimitUnop
+ def CategoryTheory.Limits.Fork.isLimitForkPushoutEquivIsColimitForkOpPullback
+ def CategoryTheory.Limits.Fork.isLimitForkPushoutEquivIsColimitForkUnopPullback
+ def CategoryTheory.Limits.Fork.isLimitOfιEquivIsColimitOp
+ def CategoryTheory.Limits.Fork.isLimitOfιEquivIsColimitUnop
+ def CategoryTheory.Limits.Fork.ofιOpIsoOfπ
+ def CategoryTheory.Limits.Fork.ofιUnopIsoOfπ
+ def CategoryTheory.Limits.Fork.op
+ def CategoryTheory.Limits.Fork.opUnopIso
+ theorem CategoryTheory.Limits.Fork.op_unop_ι
+ theorem CategoryTheory.Limits.Fork.op_ι_app_one
+ theorem CategoryTheory.Limits.Fork.op_ι_app_zero
+ theorem CategoryTheory.Limits.Fork.op_π
+ def CategoryTheory.Limits.Fork.unop
+ def CategoryTheory.Limits.Fork.unopOpIso
+ theorem CategoryTheory.Limits.Fork.unop_op_ι
+ theorem CategoryTheory.Limits.Fork.unop_ι_app_one
+ theorem CategoryTheory.Limits.Fork.unop_ι_app_zero
+ theorem CategoryTheory.Limits.Fork.unop_π
+ def CategoryTheory.Limits.opParallelPairIso
+ theorem CategoryTheory.Limits.opParallelPairIso_hom_app_one
+ theorem CategoryTheory.Limits.opParallelPairIso_hom_app_zero
+ theorem CategoryTheory.Limits.opParallelPairIso_inv_app_one
+ theorem CategoryTheory.Limits.opParallelPairIso_inv_app_zero
+ def CategoryTheory.Limits.parallelPairOpIso
+ theorem CategoryTheory.Limits.parallelPairOpIso_hom_app_one
+ theorem CategoryTheory.Limits.parallelPairOpIso_hom_app_zero
+ theorem CategoryTheory.Limits.parallelPairOpIso_inv_app_one
+ theorem CategoryTheory.Limits.parallelPairOpIso_inv_app_zero
Modified Mathlib/CategoryTheory/Limits/Shapes/Opposites/Pullbacks.lean
- def CategoryTheory.Limits.PullbackCone.opUnop
+ def CategoryTheory.Limits.PullbackCone.opUnopIso
- def CategoryTheory.Limits.PullbackCone.unopOp
+ def CategoryTheory.Limits.PullbackCone.unopOpIso
- def CategoryTheory.Limits.PushoutCocone.opUnop
+ def CategoryTheory.Limits.PushoutCocone.opUnopIso
- def CategoryTheory.Limits.PushoutCocone.unopOp
+ def CategoryTheory.Limits.PushoutCocone.unopOpIso
+ theorem CategoryTheory.Limits.pullbackIsoOpPushout_hom_inl
+ theorem CategoryTheory.Limits.pullbackIsoOpPushout_hom_inr
+ theorem CategoryTheory.Limits.pullbackIsoOpPushout_inv_fst
+ theorem CategoryTheory.Limits.pullbackIsoOpPushout_inv_snd
+ theorem CategoryTheory.Limits.pushoutIsoOpPullback_inl_hom
+ theorem CategoryTheory.Limits.pushoutIsoOpPullback_inr_hom
+ theorem CategoryTheory.Limits.pushoutIsoOpPullback_inv_fst
+ theorem CategoryTheory.Limits.pushoutIsoOpPullback_inv_snd
2025-10-21 12:12:13 c090988
refactor: generalize LinearMap.toMatrix₂ and Matrix.toLinearMap₂ to sesquilinear forms (#30108)
Generalize [LinearMap.toMatrix₂](https://leanprover-community.github.io/mathlib4_docs/Mathlib/LinearAlgebra/Matrix/SesquilinearForm.html#LinearMap.toMatrix%E2%82%82) to take a sesquilinear map as input. Create `Matrix.toLinearMapₛₗ₂` to generalize [Matrix.toLinearMap₂](https://leanprover-community.github.io/mathlib4_docs/Mathlib/LinearAlgebra/Matrix/SesquilinearForm.html#Matrix.toLinearMap%E2%82%82) to sesquilinear maps, while still keeping [Matrix.toLinearMap₂](https://leanprover-community.github.io/mathlib4_docs/Mathlib/LinearAlgebra/Matrix/SesquilinearForm.html#Matrix.toLinearMap%E2%82%82) to avoid specifying `RingHom.id R` in the bilinear case. Only do so for maps which are semilinear in the first coordinate to avoid specifying `RingHom.id R` for the second homomorphism.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean
+/- theorem LinearMap.toMatrix₂Aux_eq
+/- theorem LinearMap.toMatrix₂_apply
+ theorem LinearMap.toMatrix₂_symm'
+ theorem LinearMap.toMatrix₂_toLinearMapₛₗ₂
+ theorem Matrix.toLinearMap₂_apply_basis
+ theorem Matrix.toLinearMapₛₗ₂_apply
+ theorem Matrix.toLinearMapₛₗ₂_apply_basis
+ theorem Matrix.toLinearMapₛₗ₂_symm
+ theorem Matrix.toLinearMapₛₗ₂_toMatrix₂
2025-10-21 12:12:10 df398e5
feat(FieldTheory/RatFunc/Basic): add characteristic instances for `RatFunc` (#29356)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/Basic.lean
+ theorem algebraMap.coe_eq_zero_iff
+ theorem algebraMap.coe_inj
+ theorem algebraMap.lift_map_eq_zero_iff
Modified Mathlib/Algebra/Algebra/Field.lean
- theorem algebraMap.coe_inj
- theorem algebraMap.lift_map_eq_zero_iff
Added Mathlib/Algebra/Algebra/IsSimpleRing.lean
Modified Mathlib/Algebra/CharP/Algebra.lean
+ theorem ExpChar.of_injective_algebraMap'
+/- theorem charP_of_injective_algebraMap'
Modified Mathlib/Analysis/RCLike/Basic.lean
Modified Mathlib/FieldTheory/Differential/Liouville.lean
Modified Mathlib/FieldTheory/Finite/Basic.lean
Modified Mathlib/FieldTheory/Finite/GaloisField.lean
Modified Mathlib/FieldTheory/RatFunc/Basic.lean
Modified Mathlib/RingTheory/Localization/FractionRing.lean
2025-10-21 11:51:10 f07bd03
feat(AlgebraicTopology): the type of nondegenerate simplices not in a given subcomplex (#28330)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplices.lean
+ theorem SSet.N.ext_iff
Added Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplicesSubcomplex.lean
+ theorem SSet.Subcomplex.N.cast_eq_self
+ theorem SSet.Subcomplex.N.ext_iff
+ theorem SSet.Subcomplex.N.mk'_surjective
+ def SSet.Subcomplex.N.mk
+ theorem SSet.Subcomplex.N.mk_surjective
+ structure SSet.Subcomplex.N
2025-10-21 11:18:25 7f43b3a
feat(GroupTheory/FreeGroup): add cyclic reduction of words (#27673)
This PR adds the definition of `reduceCyclically`. This function produces a subword of a word `w` by cancelling the first and last letters of `w` as long as possible. If `w` is reduced, the resulting word will be cyclically reduced.
It is a part of a series of PR on the theory of cyclically reduced words.
Upstreamed from the [EquationalTheories](https://github.com/teorth/equational_theories) project.
- [x] depends on: #25966
- [x] depends on: #27672
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/FreeGroup/CyclicallyReduced.lean
- theorem FreeGroup.IsCyclicallyReduced.nil
- theorem FreeGroup.IsCyclicallyReduced.singleton
+ theorem FreeGroup.reduceCyclically.conj_conjugator_reduceCyclically
+ def FreeGroup.reduceCyclically.conjugator
+ theorem FreeGroup.reduceCyclically.isCyclicallyReduced
+ def FreeGroup.reduceCyclically
2025-10-21 22:10:07+11:00 da2fd30
chore: fix bad merge of bump/v4.25.0 (#30748)
ESTIMATED CHANGES
Modified Cache/IO.lean
+/- def Cache.IO.rootHashGeneration
2025-10-21 18:15:21+11:00 258b485
chore: merge bump/v4.25.0 (#30740)
ESTIMATED CHANGES
Modified .github/workflows/nightly-docgen.yml
Modified Cache/IO.lean
+/- def Cache.IO.rootHashGeneration
Modified Cache/Requests.lean
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/StrictPositivity.lean
Modified Mathlib/Algebra/BigOperators/Group/List/Basic.lean
Modified Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean
Modified Mathlib/Algebra/Notation/Defs.lean
- theorem SMul.smul_eq_hSMul
Modified Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean
Modified Mathlib/Algebra/Polynomial/RuleOfSigns.lean
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
Modified Mathlib/Analysis/LocallyConvex/WithSeminorms.lean
Modified Mathlib/Computability/DFA.lean
Modified Mathlib/Computability/RegularExpressions.lean
Modified Mathlib/Control/Monad/Cont.lean
Modified Mathlib/Data/Finsupp/Notation.lean
Modified Mathlib/Data/Fintype/EquivFin.lean
Modified Mathlib/Data/Int/LeastGreatest.lean
Modified Mathlib/Data/List/Chain.lean
Modified Mathlib/Data/List/Flatten.lean
Modified Mathlib/Data/List/SplitOn.lean
Modified Mathlib/Data/Nat/Digits/Defs.lean
+/- theorem Nat.repr_length
Modified Mathlib/Data/Set/Insert.lean
Modified Mathlib/Data/String/Basic.lean
- theorem List.asString_inj
- theorem List.length_asString
+/- theorem List.toList_asString
+/- theorem String.asString_toList
- theorem String.endPos_empty
- theorem String.length_data
+ theorem String.ltb_cons_addChar'
+/- theorem String.ltb_cons_addChar
+/- theorem String.toList_inj
Modified Mathlib/Data/String/Defs.lean
Modified Mathlib/Data/String/Lemmas.lean
+/- theorem String.congr_append
Added Mathlib/Lean/Elab/InfoTree.lean
+ def Lean.Elab.collectTryThisSuggestions
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/LebesgueDifferentiationThm.lean
Modified Mathlib/SetTheory/PGame/Basic.lean
Modified Mathlib/Tactic/Basic.lean
+ structure Mathlib.Tactic.withResetServerInfo.Result
+ def Mathlib.Tactic.withResetServerInfo
Modified Mathlib/Tactic/DeclarationNames.lean
+/- def Mathlib.Linter.getNamesFrom
Modified Mathlib/Tactic/Hint.lean
+/- def Mathlib.Tactic.Hint.suggestion
- def Mathlib.Tactic.Hint.withMessageLog
- def Mathlib.Tactic.Hint.withoutInfoTrees
Modified Mathlib/Tactic/Linter/CommandStart.lean
+/- def Mathlib.Linter.CommandStart.endPos
Modified Mathlib/Tactic/Linter/DocString.lean
Modified Mathlib/Tactic/Linter/HashCommandLinter.lean
Modified Mathlib/Tactic/Linter/Header.lean
+/- def Mathlib.Linter.authorsLineChecks
+/- def Mathlib.Linter.parseUpToHere
+/- def Mathlib.Linter.toSyntax
Modified Mathlib/Tactic/Linter/PPRoundtrip.lean
Modified Mathlib/Tactic/Linter/TextBased.lean
Modified Mathlib/Tactic/Linter/UpstreamableDecl.lean
Modified Mathlib/Tactic/Says.lean
- def Mathlib.Tactic.Says.evalTacticCapturingInfo
- def Mathlib.Tactic.Says.evalTacticCapturingMessages
Modified Mathlib/Tactic/SuccessIfFailWithMsg.lean
Modified Mathlib/Tactic/ToAdditive/Frontend.lean
Modified Mathlib/Tactic/ToAdditive/GuessName.lean
Modified Mathlib/Tactic/ToExpr.lean
Modified Mathlib/Tactic/Widget/Calc.lean
Modified Mathlib/Tactic/Widget/CongrM.lean
Modified Mathlib/Tactic/Widget/Conv.lean
Modified Mathlib/Tactic/Widget/GCongr.lean
Modified Mathlib/Tactic/Widget/InteractiveUnfold.lean
Modified Mathlib/Tactic/Widget/LibraryRewrite.lean
Modified Mathlib/Tactic/Widget/SelectPanelUtils.lean
Modified Mathlib/Util/CompileInductive.lean
Modified Mathlib/Util/Superscript.lean
Modified MathlibTest/CalcQuestionMark.lean
Modified MathlibTest/Change.lean
Modified MathlibTest/DeprecateTo.lean
Modified MathlibTest/FieldSimp.lean
Modified MathlibTest/FindSyntax.lean
Modified MathlibTest/LibraryRewrite.lean
Modified MathlibTest/LibrarySearch/basic.lean
Modified MathlibTest/LibrarySearch/mathlib.lean
Modified MathlibTest/LibrarySearch/observe.lean
Modified MathlibTest/Subsingleton.lean
Modified MathlibTest/Use.lean
Modified MathlibTest/Util/PrintSorries.lean
Modified MathlibTest/Variable.lean
Modified MathlibTest/fast_instance.lean
Modified MathlibTest/hint.lean
Modified MathlibTest/propose.lean
Modified MathlibTest/rewrites.lean
Modified MathlibTest/ring.lean
Modified MathlibTest/says.lean
Modified MathlibTest/says_whitespace.lean
Modified MathlibTest/success_if_fail_with_msg.lean
Modified MathlibTest/toAdditive.lean
Modified lake-manifest.json
Modified lakefile.lean
Modified lean-toolchain
Modified scripts/check-yaml.lean
Modified scripts/noshake.json
2025-10-21 04:10:30 9486513
feat(Geometry/Euclidean/Angle/Oriented): oriented/unoriented equality and bisection lemmas (#30476)
Add lemmas
```lean
lemma oangle_eq_neg_of_angle_eq_of_sign_eq_neg {w x y z : V}
(h : InnerProductGeometry.angle w x = InnerProductGeometry.angle y z)
(hs : (o.oangle w x).sign = -(o.oangle y z).sign) : o.oangle w x = -o.oangle y z := by
```
and
```lean
lemma angle_eq_iff_oangle_eq_neg_of_sign_eq_neg {w x y z : V} (hw : w ≠ 0) (hx : x ≠ 0)
(hy : y ≠ 0) (hz : z ≠ 0) (hs : (o.oangle w x).sign = -(o.oangle y z).sign) :
InnerProductGeometry.angle w x = InnerProductGeometry.angle y z ↔
o.oangle w x = -o.oangle y z := by
```
and similar affine versions, corresponding to such lemmas that already exist when the signs are equal rather than negations of each other. Deduce lemmas relating oriented and unoriented versions of angle bisection:
```lean
lemma angle_eq_iff_oangle_eq_or_sameRay {x y z : V} (hx : x ≠ 0) (hz : z ≠ 0) :
InnerProductGeometry.angle x y = InnerProductGeometry.angle y z ↔
o.oangle x y = o.oangle y z ∨ SameRay ℝ x z := by
```
and
```lean
lemma angle_eq_iff_oangle_eq_or_wbtw {p₁ p₂ p₃ p₄ : P} (hp₁ : p₁ ≠ p₂) (hp₄ : p₄ ≠ p₂) :
∠ p₁ p₂ p₃ = ∠ p₃ p₂ p₄ ↔ ∡ p₁ p₂ p₃ = ∡ p₃ p₂ p₄ ∨ Wbtw ℝ p₂ p₁ p₄ ∨ Wbtw ℝ p₂ p₄ p₁ := by
```
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Angle/Oriented/Affine.lean
+ theorem EuclideanGeometry.angle_eq_iff_oangle_eq_neg_of_sign_eq_neg
+ theorem EuclideanGeometry.angle_eq_iff_oangle_eq_or_wbtw
+ theorem EuclideanGeometry.oangle_eq_neg_of_angle_eq_of_sign_eq_neg
Modified Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean
+ theorem Orientation.angle_eq_iff_oangle_eq_neg_of_sign_eq_neg
+ theorem Orientation.angle_eq_iff_oangle_eq_or_sameRay
+ theorem Orientation.oangle_eq_neg_of_angle_eq_of_sign_eq_neg
2025-10-21 00:59:55 5be0e07
chore(CategoryTheory): add deprecated module for Localization.Monoidal (#30728)
Follow-up to #25794
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Localization/Monoidal.lean
2025-10-20 23:25:44 560872a
feat(LinearAlgebra/AffineSpace/AffineSubspace/Defs): nonempty sup (#30699)
Add instances that the supremum of two affine subspaces, either one nonempty, is nonempty. These are useful when working with orthogonal projections onto such a supremum.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean
2025-10-20 22:29:39 a443129
chore: add tests about the differential geometry elaborators inferring the type of x (#30577)
A first version of the in-progress elaborator for `IsImmersionAt` had a bug where this fails.
It turns out this already worked for `CMDiffAt` and friends (without any further changes); let's add a test for it.
ESTIMATED CHANGES
Modified MathlibTest/DifferentialGeometry/Notation.lean
Modified MathlibTest/DifferentialGeometry/NotationAdvanced.lean
2025-10-20 21:55:52 7468d44
feat: norm_num support for Int.fract (#26428)
ESTIMATED CHANGES
Modified Mathlib/Data/Rat/Floor.lean
+ def Rat.evalIntFract
+ theorem Rat.isNNRat_intFract_of_isNNRat
+ theorem Rat.isNat_intFract_of_isInt
+ theorem Rat.isNat_intFract_of_isNat
+ theorem Rat.isRat_intFract_of_isRat_negOfNat
Modified MathlibTest/norm_num_ext.lean
2025-10-20 21:41:52 5b59b3a
chore(Analysis/SpecialFunctions): golf entire `mulExpNegMulSq_eq_sqrt_mul_mulExpNegMulSq_one` using `grind` (#30320)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/MulExpNegMulSq.lean
2025-10-20 19:14:21 39996ca
feat(push): `@[push]` annotations for `fun` (#30038)
This PR adds the annotations for the tactics `push fun _ ↦ _` and `pull fun _ ↦ _` and the simprocs `pushFun` and `pullFun`.
The following operations are supported: `1`, `0`, `*`, `+`, `⁻¹`, `-`, `/`, `^`, `•`, `+ᵥ`, `-ᵥ`, `star`, `ofNat`, `natCast`, `intCast`, `⊔`, `⊓`, `| |`, `∆`, `⇔`, `⇨`, `⊥`, `⊤`, `ᶜ`, `\`, `default`, `algebraMap`, `kstar`, `⌊/⌋`, `⁺`, `⁻`, `⁺ᵐ`, `⁻ᵐ`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/AddTorsor/Basic.lean
Modified Mathlib/Algebra/Algebra/Pi.lean
Modified Mathlib/Algebra/Notation/Pi/Defs.lean
Modified Mathlib/Algebra/Order/Floor/Div.lean
Modified Mathlib/Algebra/Order/Group/PosPart.lean
+/- theorem Pi.leOnePart_def
+/- theorem Pi.oneLePart_def
Modified Mathlib/Algebra/Order/Group/Unbundled/Abs.lean
Modified Mathlib/Algebra/Order/Kleene.lean
Modified Mathlib/Data/Int/Cast/Pi.lean
Modified Mathlib/Data/Nat/Cast/Basic.lean
Modified Mathlib/Logic/Unique.lean
Modified Mathlib/Order/Basic.lean
Modified Mathlib/Order/BoundedOrder/Basic.lean
Modified Mathlib/Order/Heyting/Basic.lean
Modified Mathlib/Order/Lattice.lean
Modified Mathlib/Order/SymmDiff.lean
Modified MathlibTest/push.lean
2025-10-20 16:23:01 dde1cff
feat(CategoryTheory): localization preserves braided structure (#25794)
ESTIMATED CHANGES
Modified Mathlib.lean
Renamed Mathlib/CategoryTheory/Localization/Monoidal.lean to Mathlib/CategoryTheory/Localization/Monoidal/Basic.lean
+ theorem CategoryTheory.associator_hom
+ theorem CategoryTheory.associator_inv
Added Mathlib/CategoryTheory/Localization/Monoidal/Braided.lean
+ theorem CategoryTheory.Localization.Monoidal.braidingNatIso_hom_app
+ theorem CategoryTheory.Localization.Monoidal.braidingNatIso_hom_app_naturality_μ_left
+ theorem CategoryTheory.Localization.Monoidal.braidingNatIso_hom_app_naturality_μ_right
+ theorem CategoryTheory.Localization.Monoidal.map_hexagon_forward
+ theorem CategoryTheory.Localization.Monoidal.map_hexagon_reverse
+ theorem CategoryTheory.Localization.Monoidal.β_hom_app
Modified Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean
+ def CategoryTheory.BraidedCategory.curriedBraidingNatIso
Modified Mathlib/CategoryTheory/Monoidal/Braided/Multifunctor.lean
+ def CategoryTheory.SymmetricCategory.ofCurried
Modified Mathlib/CategoryTheory/Sites/Monoidal.lean
2025-10-20 15:33:54 59e3f72
style: fix whitespace (#30725)
Found by extending the commandStart linter to proof bodies. Extracted from #30658.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Azumaya/Basic.lean
Modified Mathlib/Algebra/BigOperators/Associated.lean
Modified Mathlib/Algebra/BigOperators/Ring/Nat.lean
Modified Mathlib/Analysis/SpecificLimits/Basic.lean
+/- theorem tendsto_one_div_atTop_nhds_zero_nat
Modified Mathlib/CategoryTheory/Adjunction/Basic.lean
+/- theorem CategoryTheory.Adjunction.comp_homEquiv
Modified Mathlib/CategoryTheory/ConcreteCategory/Basic.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean
Modified Mathlib/CategoryTheory/Monoidal/Action/Basic.lean
Modified Mathlib/CategoryTheory/Monoidal/Action/LinearFunctor.lean
Modified Mathlib/CategoryTheory/ObjectProperty/Small.lean
Modified Mathlib/Data/EReal/Inv.lean
+/- theorem EReal.div_lt_iff
Modified Mathlib/Data/EReal/Operations.lean
Modified Mathlib/Data/FP/Basic.lean
Modified Mathlib/Data/Fin/Tuple/Embedding.lean
Modified Mathlib/Data/List/Sort.lean
Modified Mathlib/Data/List/Sym.lean
Modified Mathlib/Data/Nat/ChineseRemainder.lean
Modified Mathlib/Data/Num/Lemmas.lean
Modified Mathlib/Data/Num/ZNum.lean
Modified Mathlib/Data/Ordmap/Invariants.lean
Modified Mathlib/Data/Prod/TProd.lean
Modified Mathlib/Data/Sign/Defs.lean
Modified Mathlib/Data/Sym/Sym2.lean
Modified Mathlib/Data/Vector/MapLemmas.lean
Modified Mathlib/GroupTheory/FreeGroup/CyclicallyReduced.lean
Modified Mathlib/Order/Filter/Partial.lean
Modified Mathlib/Order/ScottContinuity/Prod.lean
Modified Mathlib/Probability/Kernel/Composition/KernelLemmas.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Binomial.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean
Modified Mathlib/SetTheory/Cardinal/UnivLE.lean
+/- theorem univLE_iff_cardinal_le
Modified Mathlib/Topology/Instances/ENNReal/Lemmas.lean
Modified Mathlib/Topology/Instances/EReal/Lemmas.lean
+/- theorem EReal.liminf_neg
+/- theorem EReal.limsup_neg
Modified Mathlib/Topology/Order/IntermediateValue.lean
2025-10-20 14:46:16 b7404f6
feat(Algebra/GroupWithZero/Action/Defs): add `smul_div₀'` (#30644)
This PR adds a lemma `g • (x / y) = (g • x) / (g • y)` for a `MulDistribMulAction` of a `Group` on a `GroupWithZero`.
The prime at the end is to match the other `MulDistribMulAction` lemmas `smul_mul'`, `smul_inv'`, and `smul_div'`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/GroupWithZero/Action/Basic.lean
+ theorem smul_zpow₀'
Modified Mathlib/Algebra/GroupWithZero/Action/Defs.lean
+ theorem smul_div₀'
+ theorem smul_inv₀'
2025-10-20 13:51:32 4964959
style: fix whitespace (#30724)
Found by extending the commandStart linter to proof bodies. Extracted from #30658.
ESTIMATED CHANGES
Modified Mathlib/Algebra/AddConstMap/Equiv.lean
Modified Mathlib/Algebra/Category/ModuleCat/Basic.lean
Modified Mathlib/Algebra/Category/MonCat/Limits.lean
Modified Mathlib/CategoryTheory/Category/ULift.lean
+ def CategoryTheory.ULiftHom.{w,
- def CategoryTheory.ULiftHom.{w,u}
Modified Mathlib/CategoryTheory/Comma/Over/Basic.lean
+/- def CategoryTheory.Under.mapFunctor
Modified Mathlib/CategoryTheory/Filtered/Basic.lean
Modified Mathlib/CategoryTheory/Limits/HasLimits.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/WidePullbacks.lean
Modified Mathlib/CategoryTheory/Limits/Types/Colimits.lean
Modified Mathlib/CategoryTheory/Monoidal/Functor.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Factorization.lean
Modified Mathlib/CategoryTheory/Skeletal.lean
Modified Mathlib/Data/Finset/Lattice/Fold.lean
Modified Mathlib/Data/Set/Monotone.lean
Modified Mathlib/GroupTheory/Congruence/Hom.lean
Modified Mathlib/GroupTheory/NoncommPiCoprod.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Basic.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Factors.lean
Modified Mathlib/GroupTheory/Perm/Fin.lean
Modified Mathlib/GroupTheory/Perm/Finite.lean
Modified Mathlib/LinearAlgebra/BilinearMap.lean
Modified Mathlib/Order/ConditionallyCompleteLattice/Basic.lean
Modified Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Binomial.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean
Modified Mathlib/RingTheory/DedekindDomain/Instances.lean
Modified Mathlib/RingTheory/DualNumber.lean
Modified Mathlib/RingTheory/Etale/Field.lean
Modified Mathlib/RingTheory/LaurentSeries.lean
Modified Mathlib/RingTheory/LocalProperties/Semilocal.lean
Modified Mathlib/RingTheory/Polynomial/Eisenstein/Distinguished.lean
Modified Mathlib/RingTheory/TwoSidedIdeal/Lattice.lean
+/- theorem TwoSidedIdeal.mem_top
Modified Mathlib/RingTheory/WittVector/Frobenius.lean
Modified Mathlib/Topology/Algebra/ClopenNhdofOne.lean
Modified Mathlib/Topology/CWComplex/Classical/Subcomplex.lean
Modified Mathlib/Topology/Category/Profinite/Nobeling/Successor.lean
Modified Mathlib/Topology/ContinuousMap/Bounded/ArzelaAscoli.lean
Modified Mathlib/Topology/Covering.lean
Modified Mathlib/Topology/EMetricSpace/PairReduction.lean
Modified Mathlib/Topology/Order/HullKernel.lean
Modified Mathlib/Topology/UniformSpace/Ascoli.lean
2025-10-20 13:08:43 5e2da96
style(Probability/Distributions/Fernique): fix whitespace (#30723)
Found by extending the commandStart linter to bodies of proofs. Extracted from #30658.
ESTIMATED CHANGES
Modified Mathlib/Probability/Distributions/Fernique.lean
2025-10-20 12:55:17 af74401
feat: add an implication in the Portmanteau theorem (#30402)
Add the implication from closed sets to convergence: if for all closed sets `F` we have the limsup condition `limsup μsₙ(F) ≤ μ(F)`, then the measures `μsₙ` converge weakly to the measure `μ`.
Also add variants of the implications where the hypothesis features a coercion from `ProbabilityMeasure` to `Measure`, as those were sometimes easier to get in the proofs I encountered in #30348.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Measure/Portmanteau.lean
+ theorem MeasureTheory.tendsto_of_forall_isClosed_limsup_le'
+ theorem MeasureTheory.tendsto_of_forall_isClosed_limsup_le
+ theorem MeasureTheory.tendsto_of_forall_isClosed_limsup_le_nat
+ theorem MeasureTheory.tendsto_of_forall_isOpen_le_liminf'
+ theorem MeasureTheory.tendsto_of_forall_isOpen_le_liminf_nat'
2025-10-20 11:16:06 c06a96f
feat: add tactic analysis linters for converting tauto to grind (#30619)
ESTIMATED CHANGES
Modified Mathlib/Init.lean
Modified Mathlib/Tactic/Tauto.lean
+ def tautoToGrind
+ def tautoToGrindRegressions
2025-10-20 11:16:04 fa41ffe
chore: backport grind annotation changes from nightly-testing (#30572)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Units/Defs.lean
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog.lean
+/- theorem CFC.log_one
+/- theorem CFC.log_zero
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean
Modified Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean
Modified Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean
Modified Mathlib/Data/Finset/Attach.lean
Modified Mathlib/Data/Finset/Defs.lean
Modified Mathlib/Data/Finset/Empty.lean
Modified Mathlib/Data/Fintype/Defs.lean
Modified Mathlib/Data/List/Triplewise.lean
Modified Mathlib/Data/Multiset/ZeroCons.lean
Modified Mathlib/Data/Set/Basic.lean
Modified Mathlib/Data/Set/Insert.lean
Modified Mathlib/Data/Set/Operations.lean
Modified Mathlib/Order/CompleteLattice/MulticoequalizerDiagram.lean
Modified MathlibTest/Simps.lean
Modified MathlibTest/grind/pairwise_disjoint.lean
2025-10-20 10:39:32 b744c7b
chore(README): add linters to Damiano's interests (#30715)
As discussed via DM.
ESTIMATED CHANGES
Modified README.md
2025-10-20 10:39:29 63cd909
chore(Analysis/InnerProductSpace/MulOpposite): `NormedAddCommGroup` -> `SeminormedAddCommGroup` (#30695)
Also generalize one `InnerProductSpace` to `Module` and move section to earlier file.
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/MulOpposite.lean
- theorem MulOpposite.isometry_opLinearEquiv
- def MulOpposite.opLinearIsometryEquiv
- theorem MulOpposite.toContinuousLinearEquiv_opLinearIsometryEquiv
- theorem MulOpposite.toLinearEquiv_opLinearIsometryEquiv
+ theorem OrthonormalBasis.toBasis_mulOpposite
Modified Mathlib/Analysis/Normed/Operator/LinearIsometry.lean
+ theorem MulOpposite.isometry_opLinearEquiv
+ def MulOpposite.opLinearIsometryEquiv
+ theorem MulOpposite.toContinuousLinearEquiv_opLinearIsometryEquiv
+ theorem MulOpposite.toLinearEquiv_opLinearIsometryEquiv
2025-10-20 10:08:44 147c92b
chore: change `disc` to `discr` to denote the discriminant (#30709)
See [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60disc.60.20or.20.60discr.60/with/545818093)
ESTIMATED CHANGES
Modified Mathlib/Algebra/CubicDiscriminant.lean
- theorem Cubic.card_roots_of_disc_ne_zero
+ theorem Cubic.card_roots_of_discr_ne_zero
- def Cubic.disc
- theorem Cubic.disc_eq_prod_three_roots
- theorem Cubic.disc_ne_zero_iff_roots_ne
- theorem Cubic.disc_ne_zero_iff_roots_nodup
+ def Cubic.discr
+ theorem Cubic.discr_eq_prod_three_roots
+ theorem Cubic.discr_ne_zero_iff_roots_ne
+ theorem Cubic.discr_ne_zero_iff_roots_nodup
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean
- theorem WeierstrassCurve.twoTorsionPolynomial_disc
- theorem WeierstrassCurve.twoTorsionPolynomial_disc_isUnit
- theorem WeierstrassCurve.twoTorsionPolynomial_disc_ne_zero
- theorem WeierstrassCurve.twoTorsionPolynomial_disc_ne_zero_of_isElliptic
- theorem WeierstrassCurve.twoTorsionPolynomial_disc_of_char_three
- theorem WeierstrassCurve.twoTorsionPolynomial_disc_of_char_two
+ theorem WeierstrassCurve.twoTorsionPolynomial_discr
+ theorem WeierstrassCurve.twoTorsionPolynomial_discr_isUnit
+ theorem WeierstrassCurve.twoTorsionPolynomial_discr_ne_zero
+ theorem WeierstrassCurve.twoTorsionPolynomial_discr_ne_zero_of_isElliptic
+ theorem WeierstrassCurve.twoTorsionPolynomial_discr_of_char_three
+ theorem WeierstrassCurve.twoTorsionPolynomial_discr_of_char_two
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Disc.lean
- theorem Matrix.disc_fin_two
- theorem Matrix.disc_of_card_eq_two
+ theorem Matrix.discr_fin_two
+ theorem Matrix.discr_of_card_eq_two
Modified Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/FinTwo.lean
+/- def Matrix.IsElliptic
+/- def Matrix.IsHyperbolic
+/- def Matrix.IsParabolic
- theorem Matrix.disc_conj'
- theorem Matrix.disc_conj
+ theorem Matrix.discr_conj'
+ theorem Matrix.discr_conj
- theorem Matrix.sub_scalar_sq_eq_disc
+ theorem Matrix.sub_scalar_sq_eq_discr
Modified Mathlib/NumberTheory/ModularForms/Cusps.lean
Modified Mathlib/RingTheory/Polynomial/Resultant/Basic.lean
- theorem Polynomial.disc_C
- theorem Polynomial.disc_of_degree_eq_one
- theorem Polynomial.disc_of_degree_eq_three
- theorem Polynomial.disc_of_degree_eq_two
+ theorem Polynomial.discr_C
+ theorem Polynomial.discr_of_degree_eq_one
+ theorem Polynomial.discr_of_degree_eq_three
+ theorem Polynomial.discr_of_degree_eq_two
Modified Mathlib/Topology/Compactification/OnePoint/ProjectiveLine.lean
2025-10-20 10:08:42 a30886d
feat(Algebra): index of posSubgroup (#30422)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Algebra/Order/Ring/Units.lean
+ theorem Units.index_posSubgroup
2025-10-20 09:26:59 577ebdb
chore: fix some typos (#30705)
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/Basic.lean
Modified Mathlib/Analysis/InnerProductSpace/Defs.lean
Modified Mathlib/CategoryTheory/Limits/IndYoneda.lean
Modified Mathlib/Combinatorics/Quiver/Basic.lean
Modified Mathlib/RingTheory/Ideal/Maps.lean
2025-10-20 09:02:20 0d83798
chore(Analysis/Convex/Combination): remove an unused variable (#30707)
Not sure how this went undetected.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Combination.lean
2025-10-20 09:02:18 1a99d26
style(Analysis): fix whitespace (#30687)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/Laplacian.lean
Modified Mathlib/Analysis/Seminorm.lean
Modified Mathlib/Analysis/SpecialFunctions/Gaussian/FourierTransform.lean
2025-10-20 08:46:05 57a8e09
chore(Analysis/SpecialFunctions/Log/PosLog): golf a proof using `grw` (#30704)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean
+ theorem Real.posLog_le_posLog
2025-10-20 07:59:59 c736069
chore: remove unused variables (#30670)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Module/NatInt.lean
2025-10-19 23:18:36 9e57458
feat(LinearAlgebra/AffineSpace/FiniteDimensional): `finiteDimensional_sup` (#30700)
Add an instance that the supremum of two finite-dimensional affine subspaces is finite-dimensional. This is useful when working with orthogonal projections.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean
2025-10-19 17:51:16 8aa3ccd
style(CategoryTheory): fix whitespace (#30689)
Extracted from #30658. Found by extending the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/FiberedCategory/Cocartesian.lean
Modified Mathlib/CategoryTheory/Functor/Basic.lean
Modified Mathlib/CategoryTheory/Functor/KanExtension/Preserves.lean
Modified Mathlib/CategoryTheory/Iso.lean
Modified Mathlib/CategoryTheory/Limits/Preserves/Bifunctor.lean
Modified Mathlib/CategoryTheory/Limits/Types/Shapes.lean
Modified Mathlib/CategoryTheory/Monoidal/DayConvolution.lean
2025-10-19 15:27:01 7c64d37
feat(CategoryTheory/Abelian): iso between image and coimage functors (#30673)
From ClassFieldTheory
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Abelian/Basic.lean
+ theorem CategoryTheory.Abelian.coimage.comp_π_eq_zero
+ def CategoryTheory.Abelian.coimageFunctor
+ def CategoryTheory.Abelian.coimageFunctorIsoImageFunctor
+ theorem CategoryTheory.Abelian.image.ι_comp_eq_zero
+ def CategoryTheory.Abelian.imageFunctor
2025-10-19 14:27:25 aa7a3d9
chore: miscellaneous linter whitespace fixes (#30663)
Extracted from #30658. Found by `adomani`'s extension of the commandStart linter to proof bodies.
ESTIMATED CHANGES
Modified Mathlib/Algebra/CharP/Defs.lean
+/- theorem CharP.cast_eq_iff_mod_eq
Modified Mathlib/Algebra/Group/NatPowAssoc.lean
+/- theorem npow_add
Modified Mathlib/Algebra/GroupWithZero/Associated.lean
Modified Mathlib/Algebra/GroupWithZero/WithZero.lean
+/- theorem WithZero.exp_neg
+/- theorem WithZero.exp_sub
Modified Mathlib/Algebra/Order/GroupWithZero/Canonical.lean
Modified Mathlib/Algebra/Ring/Ext.lean
Modified Mathlib/Algebra/Ring/Subsemiring/Defs.lean
Modified Mathlib/Algebra/Star/MonoidHom.lean
+/- theorem StarMonoidHom.coe_mk
Modified Mathlib/Algebra/Star/StarRingHom.lean
+/- theorem NonUnitalStarRingHom.coe_mk
Modified Mathlib/CategoryTheory/EpiMono.lean
Modified Mathlib/CategoryTheory/Equivalence.lean
Modified Mathlib/CategoryTheory/Functor/FullyFaithful.lean
Modified Mathlib/CategoryTheory/Join/Basic.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Images.lean
Modified Mathlib/CategoryTheory/Limits/Types/Limits.lean
Modified Mathlib/CategoryTheory/ObjectProperty/FullSubcategory.lean
Modified Mathlib/CategoryTheory/Sums/Products.lean
Modified Mathlib/Combinatorics/Graph/Basic.lean
Modified Mathlib/Data/BitVec.lean
+/- theorem BitVec.ofFin_intCast
Modified Mathlib/Data/Bool/Basic.lean
+/- theorem Bool.toNat_beq_one
+/- theorem Bool.toNat_bne_zero
Modified Mathlib/Data/DFinsupp/Multiset.lean
+/- theorem DFinsupp.toMultiset_sup
Modified Mathlib/Data/Fin/Tuple/Basic.lean
Modified Mathlib/Data/List/Chain.lean
Modified Mathlib/Data/List/Induction.lean
Modified Mathlib/Data/List/Iterate.lean
Modified Mathlib/Data/Multiset/DershowitzManna.lean
Modified Mathlib/Data/Nat/Bits.lean
Modified Mathlib/Data/Nat/Bitwise.lean
Modified Mathlib/Data/Nat/NthRoot/Defs.lean
Modified Mathlib/Data/Nat/Prime/Basic.lean
+/- theorem Nat.coprime_of_lt_minFac
Modified Mathlib/Data/Set/Enumerate.lean
Modified Mathlib/Data/Set/Subsingleton.lean
+/- theorem Set.univ_set_eq_singleton_empty_iff
Modified Mathlib/GroupTheory/Perm/List.lean
Modified Mathlib/LinearAlgebra/Matrix/SemiringInverse.lean
Modified Mathlib/LinearAlgebra/Multilinear/Basic.lean
+/- theorem MultilinearMap.coe_smul
Modified Mathlib/Order/Hom/Order.lean
2025-10-19 13:37:58 548eafd
feat: add `smul_zpow'` (#30664)
This matches `smul_div'` and `smul_inv'`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Action/Basic.lean
+ theorem smul_zpow'
2025-10-19 11:35:37 0231ea9
chore(Data/Fin): deprecate `Fin.mul_one'`, `Fin.one_mul'`, `Fin.mul_zero'` and `Fin.zero_mul'` (#28422)
ESTIMATED CHANGES
Modified Mathlib/Data/Fin/Basic.lean
Modified Mathlib/Data/ZMod/Defs.lean
2025-10-19 10:56:47 1838dfb
feat: better API for `T1Space` and `DiscreteSpace` on quotients by non-normal subgroups (#30383)
This is motivated by #29743, which led me to realize that the current proof of [Subgroup.isOpen_of_isClosed_of_finiteIndex](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Algebra/Group/ClosedSubgroup.html#Subgroup.isOpen_of_isClosed_of_finiteIndex) is quite complicated. Morally, the proof should be "`G / H` is T1 because `H` is closed, finite because `H` has finite index in `G`, hence it is discrete, hence `H` is open".
The issue is that too much of our API on quotient groups (and in particular the separation criterion) was restricted to quotients by *normal* subgroups. This PR fixes this, and cleans some things along the way.
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Coset/Defs.lean
+ theorem QuotientGroup.preimage_mk_one
Modified Mathlib/Topology/Algebra/ConstMulAction.lean
+ theorem MulAction.IsPretransitive.discreteTopology_iff
+ theorem MulAction.IsPretransitive.t1Space_iff
Modified Mathlib/Topology/Algebra/Group/Basic.lean
Modified Mathlib/Topology/Algebra/Group/ClosedSubgroup.lean
Modified Mathlib/Topology/Algebra/Group/Quotient.lean
+ theorem QuotientGroup.discreteTopology
+ theorem QuotientGroup.discreteTopology_iff
+ theorem QuotientGroup.t1Space_iff
Modified Mathlib/Topology/Algebra/OpenSubgroup.lean
2025-10-19 08:57:04 d95168e
feat(DedekindDomain/Different): add the transitivity formula (#26155)
This PR proves the transitivity formula for the different ideal.
The PR also adds one new instance:
- `FiniteDimensional (FractionRing A) (FractionRing B)` deduced from `Module.Finite A B`.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Algebraic/Integral.lean
Modified Mathlib/RingTheory/DedekindDomain/Different.lean
+ theorem FractionalIdeal.dual_eq_dual_mul_dual
+ theorem FractionalIdeal.smul_mem_dual_one
+ theorem FractionalIdeal.trace_mem_dual_one
+ theorem differentIdeal_eq_differentIdeal_mul_differentIdeal
Modified Mathlib/RingTheory/DedekindDomain/IntegralClosure.lean
Modified Mathlib/RingTheory/FractionalIdeal/Extended.lean
+ theorem FractionalIdeal.extendedHomₐ_coeIdeal_eq_map
+ theorem FractionalIdeal.extendedHomₐ_eq_zero_iff
+ theorem FractionalIdeal.extended_coeIdeal_eq_map
+ theorem FractionalIdeal.extended_eq_zero_iff
+ theorem FractionalIdeal.extended_ne_zero
Modified Mathlib/RingTheory/Localization/Basic.lean
+ theorem IsLocalization.map_injective_of_injective'
2025-10-19 08:16:23 d914c7c
chore: tag `Polynomial.coeff` lemmas with `aesop simp` (#30445)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Basic.lean
2025-10-18 21:25:43 5c98c22
chore: use `positivity [h, h']` once more (#30656)
Continuation of #30654.
ESTIMATED CHANGES
Modified Mathlib/Computability/AkraBazzi/SumTransform.lean
2025-10-18 20:48:21 3af1c0a
chore: use the `positivity [h, h']` syntax when useful (#30654)
Since #30388, `have := foo; positivity` can be shortened to `positivity [foo]`.
Make use of that when sensible.
I searched for all occurrences of `have :.*\n\s*positi` (using VS Code, i.e. using `rg` internally) and inspected them manually. In a few cases, keeping the `have` separate seemed more readable to me.
ESTIMATED CHANGES
Modified Archive/Wiedijk100Theorems/BallotProblem.lean
Modified Mathlib/Analysis/Complex/Positivity.lean
Modified Mathlib/Analysis/Convex/Strong.lean
Modified Mathlib/Analysis/Convex/Visible.lean
Modified Mathlib/Analysis/SpecialFunctions/BinaryEntropy.lean
Modified Mathlib/Computability/AkraBazzi/AkraBazzi.lean
Modified Mathlib/GroupTheory/CommutingProbability.lean
Modified Mathlib/NumberTheory/LSeries/PrimesInAP.lean
Modified Mathlib/Probability/Distributions/Geometric.lean
Modified Mathlib/Probability/Distributions/Pareto.lean
Modified MathlibTest/positivity.lean
2025-10-18 20:48:18 9692a75
feat(Analysis): PathConnectedSpace ℂˣ (#30418)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Complex/Convex.lean
2025-10-18 20:48:16 55b7972
feat: `Field`, `FiniteDimensional` and `Algebra.IsSeparable` instances for `WithAbs` (#27974)
This PR continues the work from #24870.
Original PR: https://github.com/leanprover-community/mathlib4/pull/24870
ESTIMATED CHANGES
Modified Mathlib/Analysis/Normed/Field/WithAbs.lean
2025-10-18 20:18:00 60413e1
refactor(AlgebraicGeometry) : an argument is incorrectly explicit (#30629)
An argument `W'` is incorrectly implicit in [`WeierstrassCurve.Affine.CoordinateRing`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.html#WeierstrassCurve.Affine.CoordinateRing) and [`WeierstrassCurve.Affine.FunctionField`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.html#WeierstrassCurve.Affine.FunctionField). This issue has not surfaced because the dot notation (`W'.CoordinateRing`) is always used.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean
2025-10-18 20:17:58 632f086
feat: the action underlying a topological additive torsor is proper (#30411)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Topology/Algebra/ProperAction/AddTorsor.lean
2025-10-18 20:17:57 9af14e5
chore: move `isProperMap_iff_isClosedMap_filter` next to the ultrafilter version (#30409)
I don't quite know/remember what the motivation for having `Mathlib.Topology.Maps.Proper.UniversallyClosed` be a separate file, but certainly [isProperMap_iff_isClosedMap_filter](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Maps/Proper/Basic.html#isProperMap_iff_isClosedMap_filter) and [isProperMap_iff_isClosedMap_ultrafilter](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Maps/Proper/UniversallyClosed.html#isProperMap_iff_isClosedMap_ultrafilter) should be together.
ESTIMATED CHANGES
Modified Mathlib/Topology/Maps/Proper/Basic.lean
- theorem isProperMap_iff_isClosedMap_filter
Modified Mathlib/Topology/Maps/Proper/UniversallyClosed.lean
+ theorem isProperMap_iff_isClosedMap_filter
2025-10-18 20:17:55 c1dddc7
feat(Analysis/InnerProductSpace/Positive): `U.starProjection ≤ V.starProjection` iff `U ≤ V` (#27162)
For symmetric projections `p` and `q`, `p ≤ q` iff `range p ≤ range q`, so then: `U.starProjection ≤ V.starProjection` iff `U ≤ V`, which implies that `Submodule.starProjection` is an injective function.
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/Positive.lean
- theorem LinearMap.IsPositive.of_isSymmetricProjection
+ theorem LinearMap.IsSymmetricProjection.isPositive
+ theorem LinearMap.IsSymmetricProjection.le_iff_range_le_range
+ theorem Submodule.starProjection_inj
+ theorem Submodule.starProjection_le_starProjection_iff
Modified Mathlib/Analysis/InnerProductSpace/Symmetric.lean
+ theorem LinearMap.IsSymmetricProjection.sub_of_range_le_range
2025-10-18 19:47:22 41e1a24
feat(LinearAlgebra/Matrix/PosDef): kronecker of positive (semi-)definite matrices is positive (semi-)definite (#28097)
This first shows that `U * x * star U` is positive (semi-)definite if and only if `x` is, for an invertible matrix `U` in a not necessarily commutative star-ring. Then using the spectral theorem, it follows that the kronecker of positive (semi-)definite matrices is positive (semi-)definite.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/StrictPositivity.lean
+ theorem IsUnit.isStrictlyPositive_conjugate_iff'
+ theorem IsUnit.isStrictlyPositive_conjugate_iff
Modified Mathlib/Algebra/Order/Star/Basic.lean
+ theorem IsUnit.conjugate_nonneg_iff'
+ theorem IsUnit.conjugate_nonneg_iff
Modified Mathlib/Algebra/Star/SelfAdjoint.lean
+ theorem IsUnit.isSelfAdjoint_conjugate_iff'
+ theorem IsUnit.isSelfAdjoint_conjugate_iff
- theorem isSelfAdjoint_conjugate_iff_of_isUnit'
- theorem isSelfAdjoint_conjugate_iff_of_isUnit
Modified Mathlib/Analysis/Matrix/Order.lean
+ theorem Matrix.PosDef.kronecker
+ theorem Matrix.PosSemidef.kronecker
Modified Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Defs.lean
+ theorem Matrix.IsUnit.kronecker
Modified Mathlib/LinearAlgebra/Matrix/Hermitian.lean
+ theorem Matrix.isHermitian_iff_isSelfAdjoint
Modified Mathlib/LinearAlgebra/Matrix/PosDef.lean
+ theorem Matrix.IsUnit.posDef_conjugate_iff'
+ theorem Matrix.IsUnit.posDef_conjugate_iff
+ theorem Matrix.IsUnit.posSemidef_conjugate_iff'
+ theorem Matrix.IsUnit.posSemidef_conjugate_iff
2025-10-18 17:29:55 2c2d756
chore(AlgebraicTopology): clean up FundamentalGroupoid (#28234)
+ Extract `FundamentalGroupoid.map (f : C(X, Y)) : FundamentalGroupoid X ⥤ FundamentalGroupoid Y` from `fundamentalGroupoidFunctor : TopCat ⥤ CategoryTheory.Grpd`
+ Define `FundamentalGroup.map (f : C(X, Y)) (x : X) : FundamentalGroup X x →* FundamentalGroup Y (f x)` and `mapOfEq : FundamentalGroup X x →* FundamentalGroup Y y` that takes an assumption `f x = y`.
+ Redefine `FundamentalGroup` to be `End` rather than `Aut`: since `FundamentalGroupoid` is a groupoid, `End` already has a group structure. This requires fixing some proofs about `HomotopyGroup`s, so we take this opportunity to golf a few proofs and replace `=>` by `↦`.
+ Golf within the file FundamentalGroupoid/Basic.
+ Generalize `toArrow` up to `fromPath` in `FundamentalGroupoid/FundamentalGroup` from `X : TopCat` to `[TopologicalSpace X]`.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean
+ theorem FundamentalGroupoid.conj_eqToHom
+ theorem FundamentalGroupoid.eqToHom_eq
+/- def FundamentalGroupoid.fundamentalGroupoidFunctor
+ def FundamentalGroupoid.map
+/- structure FundamentalGroupoid
Modified Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean
+ def FundamentalGroup.map
+ def FundamentalGroup.mapOfEq
+ theorem FundamentalGroup.mapOfEq_apply
+/- def FundamentalGroup
Modified Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean
Modified Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnected.lean
Modified Mathlib/CategoryTheory/Groupoid.lean
Modified Mathlib/Topology/Covering.lean
Modified Mathlib/Topology/Homotopy/HomotopyGroup.lean
Modified Mathlib/Topology/Homotopy/Product.lean
2025-10-18 16:44:11 a93525e
chore: remove `@[gcongr]` from `opow_le_opow_right` (#30651)
This tag was accidentally added in #30508, but it is redundant
ESTIMATED CHANGES
Modified Mathlib/SetTheory/Ordinal/Exponential.lean
2025-10-18 16:44:10 06ed561
feat(FieldTheory): abelian extensions (#23669)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/FieldTheory/Galois/Abelian.lean
+ theorem IsAbelianGalois.of_algHom
+ theorem IsAbelianGalois.of_isCyclic
+ theorem IsAbelianGalois.tower_bot
+ theorem IsAbelianGalois.tower_top
Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean
+ theorem IsCyclotomicExtension.isAbelianGalois
2025-10-18 16:04:21 94c059e
feat(Algebra/Order/Module): add missing instances (#30544)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Module/Defs.lean
2025-10-18 15:19:37 ded3210
feat(Analysis): semilinearize `ContinuousLinearMapWOT` (#30597)
ESTIMATED CHANGES
Modified Mathlib/Analysis/LocallyConvex/WeakOperatorTopology.lean
+/- theorem ContinuousLinearMap.toWOT_apply
+/- def ContinuousLinearMapWOT.ContinuousLinearMap.toWOTCLM
+/- theorem ContinuousLinearMapWOT.add_apply
+/- theorem ContinuousLinearMapWOT.continuous_dual_apply
+/- theorem ContinuousLinearMapWOT.continuous_inducingFn
+/- theorem ContinuousLinearMapWOT.continuous_of_dual_apply_continuous
+/- theorem ContinuousLinearMapWOT.ext
+/- theorem ContinuousLinearMapWOT.ext_dual
+/- theorem ContinuousLinearMapWOT.ext_iff
+/- theorem ContinuousLinearMapWOT.hasBasis_seminorms
+/- def ContinuousLinearMapWOT.inducingFn
+/- theorem ContinuousLinearMapWOT.inducingFn_apply
+/- theorem ContinuousLinearMapWOT.isEmbedding_inducingFn
+/- theorem ContinuousLinearMapWOT.isInducing_inducingFn
+/- theorem ContinuousLinearMapWOT.le_nhds_iff_forall_dual_apply_le_nhds
+/- theorem ContinuousLinearMapWOT.neg_apply
+/- def ContinuousLinearMapWOT.seminorm
+/- def ContinuousLinearMapWOT.seminormFamily
+/- theorem ContinuousLinearMapWOT.smul_apply
+/- theorem ContinuousLinearMapWOT.sub_apply
+/- theorem ContinuousLinearMapWOT.tendsto_iff_forall_dual_apply_tendsto
+/- theorem ContinuousLinearMapWOT.withSeminorms
+/- theorem ContinuousLinearMapWOT.zero_apply
+/- def ContinuousLinearMapWOT
2025-10-18 14:55:33 e568f0d
feat: a topological group acts on itself properly (#30387)
Both on the left and right, and the same is true (essentially by `inferInstance`) for actions by closed subgroups.
As a consequence we get that the quotient by a closed subgroup is Hausdorff (note that [QuotientGroup.instT3Space](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Algebra/Group/Quotient.html#QuotientGroup.instT3Space) requires the subgroup to be normal !).
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/ProperAction/Basic.lean
- theorem t2Space_quotient_mulAction_of_properSMul
2025-10-17 19:01:28 a77a0ae
chore(Analysis/Matrix/Order): `IsStrictlyPositive x` iff `x.PosDef` (#30050)
ESTIMATED CHANGES
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean
+ theorem IsStrictlyPositive.commute_iff
Modified Mathlib/Analysis/Matrix/Order.lean
+ theorem Matrix.isStrictlyPositive_iff_posDef
2025-10-17 18:28:01 6e8691f
refactor(Analysis/InnerProductSpace/Positive): generalize positivity to use `IsSymmetric` instead of `IsSelfAdjoint` and `CompleteSpace` (#30000)
The definition of `ContinuousLinearMap.IsPositive` remains the same in complete spaces, but this allows us to use positivity and the partial order without needing completeness. The new definition is now exactly the same as `LinearMap.IsPositive` but for continuous linear maps.
To use the old definition (i.e., `IsSelfAdjoint` and ...), instead of unfolding, use `ContinuousLinearMap.isPositive_def'`.
`isPositive_iff` is renamed to `isPositive_iff'`, and `isPositive_iff` points to the same thing but with `IsSymmetric` instead of `IsSelfAdjoint`.
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/Positive.lean
+/- theorem ContinuousLinearMap.IsIdempotentElem.TFAE
+/- theorem ContinuousLinearMap.IsIdempotentElem.isPositive_iff_isSelfAdjoint
+/- theorem ContinuousLinearMap.IsPositive.adjoint_conj
+/- theorem ContinuousLinearMap.IsPositive.conj_adjoint
+/- theorem ContinuousLinearMap.IsPositive.inner_left_eq_inner_right
+/- theorem ContinuousLinearMap.IsPositive.isSelfAdjoint
+ theorem ContinuousLinearMap.IsPositive.isSymmetric
+/- theorem ContinuousLinearMap.IsPositive.of_isStarProjection
+/- theorem ContinuousLinearMap.isPositive_adjoint_comp_self
+ theorem ContinuousLinearMap.isPositive_def'
+ theorem ContinuousLinearMap.isPositive_def
+ theorem ContinuousLinearMap.isPositive_id
+ theorem ContinuousLinearMap.isPositive_iff'
+/- theorem ContinuousLinearMap.isPositive_one
+/- theorem ContinuousLinearMap.isPositive_self_comp_adjoint
+/- theorem ContinuousLinearMap.isPositive_zero
+/- theorem ContinuousLinearMap.isUnit_of_forall_le_norm_inner_map
+ theorem LinearMap.isPositive_id
Modified Mathlib/Analysis/InnerProductSpace/StarOrder.lean
2025-10-17 16:51:18 d167cc6
chore(Analysis/SpecialFunctions/CFC/Rpow/Basic): extra TFAE conditions for nonnegativity (#30340)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean
+ theorem CStarAlgebra.nonneg_iff_isSelfAdjoint_and_negPart_eq_zero
2025-10-17 16:51:16 0b3ea7e
feat(Topology/Connected): locally (path-)connected compact spaces have finitely many (path-)connected components (#30316)
feat(Topology/Connected): locally (path-)connected compact spaces have finitely many (path-)connected components
Locally (path-)connectedness implies all (path-)connected components are open, so they form an open cover. Compactness implies there's a finite subcover. Since the components are disjoint, the subcover must equal the cover.
ESTIMATED CHANGES
Modified Mathlib/Topology/Connected/Clopen.lean
Modified Mathlib/Topology/Connected/LocPathConnected.lean
Modified Mathlib/Topology/Connected/LocallyConnected.lean
Modified Mathlib/Topology/Connected/PathConnected.lean
+ theorem ZerothHomotopy.preimage_singleton_eq_pathComponent
2025-10-17 16:01:59 4b2be98
chore: missing fun_prop attribute (#30635)
ESTIMATED CHANGES
Modified Mathlib/Topology/Continuous.lean
2025-10-17 16:01:57 799e512
chore(Algebra/Group/EvenFunction): don't import torsion-free modules (#30628)
All we need here is torsion-free groups.
As a prerequisite, restate `neg_eq_zero` and friends for torsion-free groups. They were stated for torsion-free `R`-modules where `R` has char zero, but any such module is a torsion-free group, so this was fake generality.
ESTIMATED CHANGES
Modified Archive/Imo/Imo1961Q3.lean
Modified Mathlib/Algebra/Group/EvenFunction.lean
+/- theorem Function.Odd.map_zero
Modified Mathlib/Algebra/Group/Torsion.lean
+ theorem inv_eq_self
+ theorem inv_ne_self
+ theorem self_eq_inv
+ theorem self_ne_inv
+ theorem sq_eq_one
Modified Mathlib/Algebra/NoZeroSMulDivisors/Basic.lean
- theorem neg_eq_self
- theorem neg_ne_self
- theorem self_eq_neg
- theorem self_ne_neg
- theorem two_nsmul_eq_zero
Modified Mathlib/Analysis/Normed/Module/Ball/Action.lean
+/- theorem ne_neg_of_mem_sphere
Modified Mathlib/Data/Complex/Basic.lean
Modified Mathlib/MeasureTheory/Group/Integral.lean
Modified Mathlib/NumberTheory/LSeries/ZMod.lean
2025-10-17 16:01:54 5227167
feat: add module instance to ContDiffMapSupportedIn (#30198)
Add a module instance for the type `ContDiffMapSupportedIn` of n-times continuously differentiable maps supported in a fixed compact.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean
+ theorem ContDiffMapSupportedIn.add_apply
+ def ContDiffMapSupportedIn.coeHom
+ theorem ContDiffMapSupportedIn.coeHom_injective
+ theorem ContDiffMapSupportedIn.coe_add
+ theorem ContDiffMapSupportedIn.coe_coeHom
+ theorem ContDiffMapSupportedIn.coe_neg
+ theorem ContDiffMapSupportedIn.coe_smul
+ theorem ContDiffMapSupportedIn.coe_sub
+ theorem ContDiffMapSupportedIn.coe_zero
+ theorem ContDiffMapSupportedIn.neg_apply
+ theorem ContDiffMapSupportedIn.smul_apply
+ theorem ContDiffMapSupportedIn.sub_apply
+ theorem ContDiffMapSupportedIn.toBoundedContinuousFunction_apply
+ theorem ContDiffMapSupportedIn.zero_apply
Modified Mathlib/Data/Set/Function.lean
+ theorem Set.EqOn.comp_left₂
2025-10-17 16:01:52 4630367
feat: Finsupp.comapDomain_surjective (#29756)
ESTIMATED CHANGES
Modified Mathlib/Data/Finsupp/Basic.lean
+ theorem Finsupp.comapDomain_surjective
2025-10-17 15:40:11 49d2652
chore(Algebra/ModEq): don't import modules (#30614)
In particular, don't import torsion-free modules, as here all we need are torsion groups.
ESTIMATED CHANGES
Modified Mathlib/Algebra/ModEq.lean
+/- theorem AddCommGroup.nsmul_modEq_nsmul
+/- theorem AddCommGroup.zsmul_modEq_zsmul
2025-10-17 15:40:08 c4286cf
feat(CategoryTheory/Monoidal): `mapMon` of a lax-braided functor is lax-braided (#29136)
From Toric
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Monoidal/Grp_.lean
Modified Mathlib/CategoryTheory/Monoidal/Mon_.lean
2025-10-17 14:39:52 9823cfe
chore: generalize Egorov file to measurable edist assumption (#30604)
This PR generalizes the lemmas of the Egorov theorem file to use measurability of distances instead of strong measurability of the processes.
For the proof of the Kolmogorov-Chentsov theorem in the Brownian process project, we don't have strong measurability of the processes but we have measurability of the distances and we want to use an equivalent of `tendstoInMeasure_of_tendsto_ae`.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean
+ theorem MeasureTheory.tendstoInMeasure_of_tendsto_ae_of_measurable_edist
- theorem MeasureTheory.tendstoInMeasure_of_tendsto_ae_of_stronglyMeasurable
Modified Mathlib/MeasureTheory/Function/Egorov.lean
+/- theorem MeasureTheory.Egorov.exists_notConvergentSeq_lt
+/- def MeasureTheory.Egorov.iUnionNotConvergentSeq
+/- theorem MeasureTheory.Egorov.iUnionNotConvergentSeq_measurableSet
+/- theorem MeasureTheory.Egorov.iUnionNotConvergentSeq_subset
+/- theorem MeasureTheory.Egorov.measure_iUnionNotConvergentSeq
+/- def MeasureTheory.Egorov.notConvergentSeqLTIndex
+/- theorem MeasureTheory.Egorov.notConvergentSeqLTIndex_spec
+ theorem MeasureTheory.tendstoUniformlyOn_of_ae_tendsto_of_measurable_edist'
+ theorem MeasureTheory.tendstoUniformlyOn_of_ae_tendsto_of_measurable_edist
2025-10-17 14:39:50 9254cb8
feat: add Finset lemmas (#30539)
Co-authored by: @AntoineChambert-Loir
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean
+ theorem Finset.prod_comp_equiv
+ theorem Finset.prod_map_equiv
Modified Mathlib/Data/Finsupp/Defs.lean
+ theorem Finsupp.ofSupportFinite_support
2025-10-17 14:39:48 b163c0b
chore: mark one lemma as simp (#30529)
From `fpvandoorn` and my upcoming Lean course; this seems like a useful simp lemma in general.
ESTIMATED CHANGES
Modified Mathlib/Algebra/GroupWithZero/Units/Basic.lean
2025-10-17 14:39:47 108140a
chore: use `grw`, `gcongr` more (#30508)
Golf many proofs using `grw`, `gcongr`, `cutsat`, `linarith`... For this, tag a few more lemmas with `gcongr`, and make some existing ones stronger.
The goal here is not necessarily to golf (although it usually is the case), but instead to reduce the number of explicit mentions of lemmas, as these are a maintainability concern.
The precise golfs that are performed are motivated by #30242, where four pairs of very basic and widespread lemmas get swapped. The best way to reduce the number of swaps needed is to simply not mention the lemmas explicitly.
ESTIMATED CHANGES
Modified Archive/Imo/Imo2001Q3.lean
Modified Mathlib/Algebra/AddConstMap/Basic.lean
Modified Mathlib/Algebra/AlgebraicCard.lean
Modified Mathlib/Algebra/MonoidAlgebra/Degree.lean
+/- theorem AddMonoidAlgebra.le_inf_support_mul
+/- theorem AddMonoidAlgebra.sup_support_mul_le
Modified Mathlib/Algebra/MvPolynomial/Degrees.lean
Modified Mathlib/Algebra/MvPolynomial/SchwartzZippel.lean
Modified Mathlib/Algebra/Order/BigOperators/Group/Finset.lean
Modified Mathlib/Algebra/Order/BigOperators/Group/List.lean
Modified Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean
Modified Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean
Modified Mathlib/Algebra/Order/CauSeq/BigOperators.lean
Modified Mathlib/Algebra/Order/Field/Canonical.lean
Modified Mathlib/Algebra/Order/Group/Abs.lean
+/- theorem mabs_mul_three
Modified Mathlib/Algebra/Order/Group/Finset.lean
Modified Mathlib/Algebra/Order/Group/Int/Sum.lean
Modified Mathlib/Algebra/Order/Group/Pointwise/Interval.lean
Modified Mathlib/Algebra/Order/Group/Unbundled/Abs.lean
Modified Mathlib/Algebra/Order/GroupWithZero/WithZero.lean
Modified Mathlib/Algebra/Order/Interval/Set/Monoid.lean
Modified Mathlib/Algebra/Order/Kleene.lean
+/- theorem kstar_mul_le
+/- theorem mul_kstar_le
Modified Mathlib/Algebra/Order/Monoid/Basic.lean
Modified Mathlib/Algebra/Order/Monoid/NatCast.lean
Modified Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean
Modified Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean
Modified Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean
Modified Mathlib/Algebra/Order/Quantale.lean
Modified Mathlib/Algebra/Order/Ring/Basic.lean
Modified Mathlib/Algebra/Order/Ring/GeomSum.lean
Modified Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean
Modified Mathlib/Algebra/Order/Star/Basic.lean
Modified Mathlib/Algebra/Order/Sub/Defs.lean
+/- theorem add_le_add_add_tsub
Modified Mathlib/Algebra/Order/Sub/Unbundled/Basic.lean
+/- theorem add_le_of_le_tsub_left_of_le
+/- theorem add_le_of_le_tsub_right_of_le
Modified Mathlib/Algebra/Polynomial/AlgebraMap.lean
Modified Mathlib/Algebra/Polynomial/Degree/Definitions.lean
Modified Mathlib/Algebra/Polynomial/Degree/Lemmas.lean
Modified Mathlib/Algebra/Polynomial/Degree/Operations.lean
Modified Mathlib/Algebra/Polynomial/Monic.lean
Modified Mathlib/Algebra/Polynomial/UnitTrinomial.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean
Modified Mathlib/Analysis/Analytic/CPolynomialDef.lean
Modified Mathlib/Analysis/Asymptotics/TVS.lean
Modified Mathlib/Analysis/BoxIntegral/Box/Basic.lean
Modified Mathlib/Analysis/BoxIntegral/Integrability.lean
Modified Mathlib/Analysis/CStarAlgebra/Multiplier.lean
Modified Mathlib/Analysis/Calculus/ContDiff/Basic.lean
Modified Mathlib/Analysis/Calculus/ContDiff/Bounds.lean
Modified Mathlib/Analysis/Calculus/ContDiff/Defs.lean
Modified Mathlib/Analysis/Calculus/FDeriv/Measurable.lean
Modified Mathlib/Analysis/Calculus/LocalExtr/Polynomial.lean
Modified Mathlib/Analysis/Complex/Exponential.lean
Modified Mathlib/Analysis/Convex/Birkhoff.lean
Modified Mathlib/Analysis/Convex/Gauge.lean
Modified Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean
Modified Mathlib/Analysis/InnerProductSpace/Projection/Minimal.lean
Modified Mathlib/Analysis/Normed/Affine/ContinuousAffineMap.lean
Modified Mathlib/Analysis/Normed/Algebra/Spectrum.lean
Modified Mathlib/Analysis/Normed/Group/Uniform.lean
Modified Mathlib/Analysis/Normed/Order/UpperLower.lean
Modified Mathlib/Analysis/Normed/Unbundled/SeminormFromConst.lean
Modified Mathlib/Analysis/NormedSpace/ENormedSpace.lean
Modified Mathlib/Analysis/NormedSpace/Extr.lean
Modified Mathlib/Analysis/ODE/Gronwall.lean
Modified Mathlib/Analysis/ODE/PicardLindelof.lean
Modified Mathlib/Analysis/PSeries.lean
Modified Mathlib/Analysis/Real/Hyperreal.lean
+/- theorem Hyperreal.isSt_sSup
Modified Mathlib/Analysis/SpecialFunctions/Exp.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/Summable.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean
Modified Mathlib/Analysis/SpecificLimits/Basic.lean
Modified Mathlib/Analysis/SpecificLimits/FloorPow.lean
Modified Mathlib/Analysis/Subadditive.lean
Modified Mathlib/Combinatorics/Additive/CauchyDavenport.lean
Modified Mathlib/Combinatorics/Additive/VerySmallDoubling.lean
Modified Mathlib/Combinatorics/Enumerative/Composition.lean
Modified Mathlib/Combinatorics/Extremal/RuzsaSzemeredi.lean
+ theorem ruzsaSzemerediNumberNat_le_ruzsaSzemerediNumberNat
+/- theorem ruzsaSzemerediNumberNat_mono
Modified Mathlib/Combinatorics/Matroid/Basic.lean
Modified Mathlib/Combinatorics/Matroid/Rank/ENat.lean
Modified Mathlib/Combinatorics/Schnirelmann.lean
Modified Mathlib/Combinatorics/SetFamily/HarrisKleitman.lean
Modified Mathlib/Combinatorics/SetFamily/Kleitman.lean
Modified Mathlib/Combinatorics/SetFamily/KruskalKatona.lean
Modified Mathlib/Combinatorics/SetFamily/LYM.lean
Modified Mathlib/Combinatorics/SimpleGraph/Clique.lean
Modified Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Bound.lean
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Increment.lean
Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean
+ theorem Finpartition.card_nonuniformWitnesses_le
Modified Mathlib/Combinatorics/SimpleGraph/Triangle/Removal.lean
Modified Mathlib/Computability/Ackermann.lean
Modified Mathlib/Computability/Language.lean
Modified Mathlib/Data/DFinsupp/Lex.lean
Modified Mathlib/Data/ENNReal/Operations.lean
Modified Mathlib/Data/ENat/Lattice.lean
Modified Mathlib/Data/EReal/Operations.lean
Modified Mathlib/Data/Finset/Filter.lean
Modified Mathlib/Data/Finset/Union.lean
Modified Mathlib/Data/Finsupp/MonomialOrder.lean
Modified Mathlib/Data/Int/Basic.lean
Modified Mathlib/Data/Int/LeastGreatest.lean
Modified Mathlib/Data/NNReal/Defs.lean
Modified Mathlib/Data/Nat/Cast/Order/Ring.lean
Modified Mathlib/Data/Nat/Choose/Factorization.lean
Modified Mathlib/Data/Nat/Count.lean
+/- theorem Nat.count_mono_left
Modified Mathlib/Data/Nat/Digits/Defs.lean
Modified Mathlib/Data/Nat/Dist.lean
+/- theorem Nat.dist_add_add_right
+/- theorem Nat.dist_eq_intro
+/- theorem Nat.dist_eq_max_sub_min
+/- theorem Nat.dist_eq_sub_of_le
+/- theorem Nat.dist_eq_zero
+/- theorem Nat.dist_pos_of_ne
+/- theorem Nat.dist_succ_succ
+/- theorem Nat.dist_tri_left'
+/- theorem Nat.dist_tri_left
+/- theorem Nat.dist_tri_right'
+/- theorem Nat.dist_tri_right
+/- theorem Nat.dist_zero_left
+/- theorem Nat.dist_zero_right
+/- theorem Nat.eq_of_dist_eq_zero
Modified Mathlib/Data/Nat/Factorization/Basic.lean
Modified Mathlib/Data/Nat/Fib/Zeckendorf.lean
Modified Mathlib/Data/Nat/Totient.lean
Modified Mathlib/Data/Num/ZNum.lean
Modified Mathlib/Data/Set/Equitable.lean
Modified Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean
Modified Mathlib/Geometry/Manifold/VectorField/LieBracket.lean
Modified Mathlib/GroupTheory/Archimedean.lean
Modified Mathlib/GroupTheory/Index.lean
Modified Mathlib/GroupTheory/MonoidLocalization/Order.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Type.lean
Modified Mathlib/InformationTheory/Hamming.lean
Modified Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean
Modified Mathlib/LinearAlgebra/AffineSpace/Ordered.lean
Modified Mathlib/LinearAlgebra/Dimension/LinearMap.lean
Modified Mathlib/MeasureTheory/Constructions/Polish/Basic.lean
Modified Mathlib/MeasureTheory/Covering/Besicovitch.lean
Modified Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean
Modified Mathlib/MeasureTheory/Covering/Differentiation.lean
Modified Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean
Modified Mathlib/MeasureTheory/Function/Jacobian.lean
Modified Mathlib/MeasureTheory/Function/L1Space/Integrable.lean
Modified Mathlib/MeasureTheory/Function/LpSpace/Indicator.lean
Modified Mathlib/MeasureTheory/Function/SimpleFuncDense.lean
Modified Mathlib/MeasureTheory/Function/UniformIntegrable.lean
Modified Mathlib/MeasureTheory/Integral/Bochner/Basic.lean
Modified Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean
Modified Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean
Modified Mathlib/MeasureTheory/Integral/SetToL1.lean
Modified Mathlib/MeasureTheory/Measure/Content.lean
Modified Mathlib/MeasureTheory/Measure/Decomposition/Hahn.lean
Modified Mathlib/MeasureTheory/Measure/Doubling.lean
Modified Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
Modified Mathlib/MeasureTheory/Measure/Regular.lean
Modified Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean
Modified Mathlib/MeasureTheory/Measure/WithDensity.lean
Modified Mathlib/MeasureTheory/OuterMeasure/Caratheodory.lean
Modified Mathlib/MeasureTheory/VectorMeasure/Basic.lean
Modified Mathlib/ModelTheory/Encoding.lean
Modified Mathlib/ModelTheory/Semantics.lean
Modified Mathlib/ModelTheory/Syntax.lean
Modified Mathlib/NumberTheory/AbelSummation.lean
Modified Mathlib/NumberTheory/Bertrand.lean
Modified Mathlib/NumberTheory/Dioph.lean
+/- theorem Poly.sumsq_nonneg
Modified Mathlib/NumberTheory/Divisors.lean
Modified Mathlib/NumberTheory/EllipticDivisibilitySequence.lean
Modified Mathlib/NumberTheory/Harmonic/Bounds.lean
Modified Mathlib/NumberTheory/Padics/PadicVal/Basic.lean
Modified Mathlib/NumberTheory/PellMatiyasevic.lean
Modified Mathlib/NumberTheory/PrimeCounting.lean
Modified Mathlib/NumberTheory/Primorial.lean
Modified Mathlib/NumberTheory/SmoothNumbers.lean
Modified Mathlib/NumberTheory/SumPrimeReciprocals.lean
Modified Mathlib/NumberTheory/Zsqrtd/Basic.lean
Modified Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean
Modified Mathlib/Order/Filter/AtTopBot/Monoid.lean
Modified Mathlib/Order/Filter/Germ/OrderedMonoid.lean
Modified Mathlib/Order/Height.lean
Modified Mathlib/Order/KrullDimension.lean
Modified Mathlib/Order/SuccPred/LinearLocallyFinite.lean
Modified Mathlib/Probability/Kernel/Disintegration/Basic.lean
Modified Mathlib/Probability/Kernel/WithDensity.lean
Modified Mathlib/Probability/StrongLaw.lean
Modified Mathlib/RingTheory/DedekindDomain/Factorization.lean
Modified Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean
Modified Mathlib/RingTheory/DedekindDomain/PID.lean
Modified Mathlib/RingTheory/Finiteness/Subalgebra.lean
Modified Mathlib/RingTheory/GradedAlgebra/Radical.lean
Modified Mathlib/RingTheory/HahnSeries/Multiplication.lean
Modified Mathlib/RingTheory/KrullDimension/NonZeroDivisors.lean
Modified Mathlib/RingTheory/MvPolynomial/Groebner.lean
Modified Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean
Modified Mathlib/RingTheory/MvPowerSeries/Inverse.lean
Modified Mathlib/RingTheory/MvPowerSeries/Order.lean
Modified Mathlib/RingTheory/PowerSeries/Order.lean
Modified Mathlib/RingTheory/Valuation/Archimedean.lean
Modified Mathlib/RingTheory/Valuation/ExtendToLocalization.lean
Modified Mathlib/RingTheory/Valuation/Integers.lean
Modified Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean
Modified Mathlib/SetTheory/Cardinal/Aleph.lean
Modified Mathlib/SetTheory/Cardinal/Arithmetic.lean
Modified Mathlib/SetTheory/Cardinal/CountableCover.lean
Modified Mathlib/SetTheory/Cardinal/Order.lean
Modified Mathlib/SetTheory/Ordinal/Arithmetic.lean
Modified Mathlib/SetTheory/Ordinal/Exponential.lean
Modified Mathlib/SetTheory/Ordinal/FixedPoint.lean
Modified Mathlib/SetTheory/Ordinal/NaturalOps.lean
Modified Mathlib/SetTheory/Ordinal/Notation.lean
Modified Mathlib/SetTheory/Ordinal/Principal.lean
Modified Mathlib/SetTheory/PGame/Algebra.lean
Modified Mathlib/SetTheory/Surreal/Dyadic.lean
Modified Mathlib/Tactic/LinearCombination/Lemmas.lean
Modified Mathlib/Topology/Algebra/Order/LiminfLimsup.lean
Modified Mathlib/Topology/Algebra/Valued/ValuedField.lean
Modified Mathlib/Topology/CWComplex/Classical/Basic.lean
Modified Mathlib/Topology/ContinuousMap/Bounded/Normed.lean
Modified Mathlib/Topology/ContinuousMap/ZeroAtInfty.lean
Modified Mathlib/Topology/EMetricSpace/BoundedVariation.lean
Modified Mathlib/Topology/EMetricSpace/Defs.lean
+/- theorem edist_triangle4
Modified Mathlib/Topology/Instances/ENNReal/Lemmas.lean
Modified Mathlib/Topology/MetricSpace/Algebra.lean
Modified Mathlib/Topology/MetricSpace/Antilipschitz.lean
Modified Mathlib/Topology/MetricSpace/Bounded.lean
Modified Mathlib/Topology/MetricSpace/Contracting.lean
Modified Mathlib/Topology/MetricSpace/Dilation.lean
Modified Mathlib/Topology/MetricSpace/Gluing.lean
+/- theorem Metric.Sum.one_le_dist_inl_inr
Modified Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean
Modified Mathlib/Topology/MetricSpace/HausdorffDistance.lean
Modified Mathlib/Topology/MetricSpace/Pseudo/Defs.lean
Modified Mathlib/Topology/MetricSpace/Thickening.lean
Modified Mathlib/Topology/Metrizable/Uniformity.lean
Modified Mathlib/Topology/UnitInterval.lean
Modified Mathlib/Topology/UrysohnsLemma.lean
2025-10-17 12:35:31 5a6cfc3
fix: Improve definition of `SimplexCategoryGenRel.IsAdmissible` (#30586)
Give `SimplexCategoryGenRel.IsAdmissible` an inductive definition equivalent to its prior definition.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
+/- theorem SimplexCategoryGenRel.IsAdmissible.cons
+/- def SimplexCategoryGenRel.IsAdmissible.getElemAsFin
+ theorem SimplexCategoryGenRel.IsAdmissible.getElem_lt
+/- def SimplexCategoryGenRel.IsAdmissible.head
+/- theorem SimplexCategoryGenRel.IsAdmissible.head_lt
+ theorem SimplexCategoryGenRel.IsAdmissible.isChain
+/- theorem SimplexCategoryGenRel.IsAdmissible.le
+ theorem SimplexCategoryGenRel.IsAdmissible.mono
- theorem SimplexCategoryGenRel.IsAdmissible.nil
+ theorem SimplexCategoryGenRel.IsAdmissible.of_cons
+ theorem SimplexCategoryGenRel.IsAdmissible.pairwise
+ theorem SimplexCategoryGenRel.IsAdmissible.simplicialEvalσ_succ_getElem
- theorem SimplexCategoryGenRel.IsAdmissible.sorted
- theorem SimplexCategoryGenRel.IsAdmissible.tail
+ inductive SimplexCategoryGenRel.IsAdmissible
- def SimplexCategoryGenRel.IsAdmissible
+ theorem SimplexCategoryGenRel.isAdmissible_cons_cons_iff
+ theorem SimplexCategoryGenRel.isAdmissible_cons_iff
+ theorem SimplexCategoryGenRel.isAdmissible_iff_isChain_and_le
+ theorem SimplexCategoryGenRel.isAdmissible_iff_pairwise_and_le
+ theorem SimplexCategoryGenRel.isAdmissible_of_isChain_of_forall_getElem_le
+ theorem SimplexCategoryGenRel.isAdmissible_singleton_iff
+ theorem SimplexCategoryGenRel.simplicialEvalσ_of_le_mem
- theorem SimplexCategoryGenRel.simplicialEvalσ_of_lt_mem
Modified Mathlib/Data/List/Chain.lean
- theorem List.IsChain.cons'
+ theorem List.IsChain.cons
+ theorem List.IsChain.of_cons
+/- theorem List.IsChain.tail
- theorem List.isChain_cons'
+ theorem List.isChain_cons
Modified Mathlib/Data/List/SplitBy.lean
Modified Mathlib/Data/Nat/Fib/Zeckendorf.lean
Modified Mathlib/GroupTheory/CoprodI.lean
Modified Mathlib/GroupTheory/HNNExtension.lean
Modified Mathlib/Order/Height.lean
Modified Mathlib/Topology/Category/Profinite/Nobeling/Span.lean
Modified scripts/nolints_prime_decls.txt
2025-10-17 12:10:18 40f9b4e
feat(CategoryTheory): `Exists` gives images (#30088)
We show that (the underlying arrow of) `(exists f.obj) x` is an image.
This is a prerequisite of the [MTT project](https://github.com/kyoDralliam/model-theory-topos), which aims to use the internal language of toposes to reason about e.g. sheaves.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Shapes/Images.lean
+ def CategoryTheory.Limits.Image.imageFactorisation
+ def CategoryTheory.Limits.ImageFactorisation.copy
+ def CategoryTheory.Limits.ImageFactorisation.ofIsoI
+ def CategoryTheory.Limits.IsImage.copy
+ def CategoryTheory.Limits.IsImage.ofIsoI
+ def CategoryTheory.Limits.MonoFactorisation.copy
+ def CategoryTheory.Limits.MonoFactorisation.ofIsoI
Modified Mathlib/CategoryTheory/Skeletal.lean
Modified Mathlib/CategoryTheory/Subobject/Basic.lean
+ def CategoryTheory.Subobject.existsCompRepresentativeIso
+ def CategoryTheory.Subobject.existsIsoImage
+ def CategoryTheory.Subobject.imageFactorisation
+ def CategoryTheory.Subobject.lowerCompRepresentativeIso
2025-10-17 10:08:37 ae97c1b
doc(Combinatorics): fix typos (#30621)
Found with the help of Codex.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Additive/FreimanHom.lean
Modified Mathlib/Combinatorics/Enumerative/DyckWord.lean
Modified Mathlib/Combinatorics/Quiver/Cast.lean
Modified Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean
Modified Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean
Modified Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean
Modified Mathlib/Combinatorics/SimpleGraph/Copy.lean
Modified Mathlib/Combinatorics/SimpleGraph/Extremal/TuranDensity.lean
Modified Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean
2025-10-17 08:48:49 2528a23
feat(Analysis/InnerProductSpace/TensorProduct): `LinearIsometry.lTensor` and `.rTensor` (#30613)
This adds the linear isometry versions of `LinearMap.lTensor` and `LinearMap.rTensor`.
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/TensorProduct.lean
+ def LinearIsometry.lTensor
+ theorem LinearIsometry.lTensor_apply
+ theorem LinearIsometry.lTensor_def
+ def LinearIsometry.rTensor
+ theorem LinearIsometry.rTensor_apply
+ theorem LinearIsometry.rTensor_def
+ theorem LinearIsometry.toLinearMap_lTensor
+ theorem LinearIsometry.toLinearMap_rTensor
+ def LinearIsometryEquiv.lTensor
+ theorem LinearIsometryEquiv.lTensor_apply
+ theorem LinearIsometryEquiv.lTensor_def
+ def LinearIsometryEquiv.rTensor
+ theorem LinearIsometryEquiv.rTensor_apply
+ theorem LinearIsometryEquiv.rTensor_def
+ theorem LinearIsometryEquiv.symm_lTensor
+ theorem LinearIsometryEquiv.symm_rTensor
+ theorem LinearIsometryEquiv.toLinearEquiv_lTensor
+ theorem LinearIsometryEquiv.toLinearEquiv_rTensor
+ theorem LinearIsometryEquiv.toLinearIsometry_lTensor
+ theorem LinearIsometryEquiv.toLinearIsometry_rTensor
+ theorem TensorProduct.congrIsometry_refl_refl
+ theorem TensorProduct.mapIsometry_id_id
2025-10-17 08:10:26 397c810
chore(NumberTheory/ArithmeticFunction): remove notation scope (#30465)
Right now, the notations `ζ`, `σ`, `ω`, `Ω` and `μ` for arithmetic functions exist in the scope `ArithmeticFunction` and in additional scopes `ArithmeticFunction.zeta` etc. This leads to an "ambiguous notation" error when both are open (even though both interpretations result in exactly the same term).
We fix this by removing the notations from `ArithmeticFunction`, only leaving the fine-grained per-function access.
(Cleaning up after myself here; I had introduced the duplication at some point. A better solution would be for Lean to check whether conflicting notations actually lead to the same result and in this case not give an error.)
ESTIMATED CHANGES
Modified Archive/Wiedijk100Theorems/PerfectNumbers.lean
Modified Mathlib/Algebra/Order/Antidiag/Nat.lean
Modified Mathlib/NumberTheory/ArithmeticFunction.lean
Modified Mathlib/NumberTheory/LSeries/Dirichlet.lean
Modified Mathlib/NumberTheory/TsumDivsorsAntidiagonal.lean
Modified Mathlib/NumberTheory/VonMangoldt.lean
Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean
Modified MathlibTest/ArithMult.lean
2025-10-17 07:57:00 fb8b831
chore(IsPrimitiveRoot): cleanup statement of `IsPrimitiveRoot.prime_dvd_of_dvd_norm_sub_one` (#30581)
A hypothesis in the statement of this function uses a `let` as can be seen in the doc: [IsPrimitiveRoot.prime_dvd_of_dvd_norm_sub_one](https://leanprover-community.github.io/mathlib4_docs/Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.html#IsPrimitiveRoot.prime_dvd_of_dvd_norm_sub_one). It should be a `haveI`. This is fixed in this PR.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
2025-10-17 07:05:29 acb60b6
chore: golf proof for `choose_le_two_pow` (#30617)
This is a quick PR for golf I noticed on a lemma bounding `Nat.choose`
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Choose/Bounds.lean
2025-10-16 23:23:40 0008c2f
doc(AlgebraicTopology): fix typos (#30616)
Issues found with the help of Codex.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/DoldKan/NReflectsIso.lean
Modified Mathlib/AlgebraicTopology/ModelCategory/Basic.lean
Modified Mathlib/AlgebraicTopology/RelativeCellComplex/Basic.lean
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/Basic.lean
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
Modified Mathlib/AlgebraicTopology/SimplicialNerve.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/Horn.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/NerveNondegenerate.lean
2025-10-16 23:23:38 298f0c4
doc: fixes for Turing machine docs (#30500)
Fixes found by Junie Pro.
ESTIMATED CHANGES
Modified Mathlib/Computability/PostTuringMachine.lean
Modified Mathlib/Computability/TuringMachine.lean
2025-10-16 22:37:38 d3bd8e5
feat(Positivity): add support for `positivity [h₁, h₂]` syntax (#30388)
Related issue: #2427
ESTIMATED CHANGES
Modified Mathlib/Tactic/Positivity/Core.lean
Modified MathlibTest/positivity.lean
2025-10-16 19:17:46 4e56e21
feat(Data/Nat): define `Nat.nthRoot` (#28768)
Define `Nat.nthRoot n a` to be the `n`th root of a natural number `a`.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/SpecialFunctions/Pow/NthRootLemmas.lean
+ theorem Nat.exists_pow_eq_iff'
+ theorem Nat.exists_pow_eq_iff
+ theorem Nat.le_nthRoot_iff
+ theorem Nat.lt_pow_nthRoot_add_one
+ theorem Nat.nthRoot.lt_pow_go_succ_aux
+ theorem Nat.nthRoot_eq_of_le_of_lt
+ theorem Nat.nthRoot_lt_iff
+ theorem Nat.nthRoot_one_left
+ theorem Nat.nthRoot_one_right
+ theorem Nat.nthRoot_pow
+ theorem Nat.nthRoot_zero_left
+ theorem Nat.nthRoot_zero_right
+ theorem Nat.pow_nthRoot_le_iff
Added Mathlib/Data/Nat/NthRoot/Defs.lean
+ def Nat.nthRoot
2025-10-16 16:35:38 4b0359c
refactor: define `≤`/`<` on `WithBot`/`WithTop` by induction (#19668)
The motivation for this change is that it is really confusing to run `intro r s shouldnthaveintroedthat` on a goal of the form `∀ r s : ℝ≥0∞, r ≤ s` and get the nonsense-looking goal `r = ↑shouldnthaveintroedthat → ∃ b : α, s = ↑b ∧ shouldnthaveintroedthat ≤ b⟩` instead of an error, and similarly when destructing something of the form `∃ r s : ℝ≥0∞, r < s`.
Furthermore, I suspect this improves performance.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/GroupWithZero/Canonical.lean
+/- theorem WithZero.coe_le_coe
+/- theorem WithZero.coe_le_iff
+ theorem WithZero.le_coe_iff
+/- theorem WithZero.le_def
+ theorem WithZero.le_unzero_iff
+ theorem WithZero.lt_coe_iff
+/- theorem WithZero.lt_def
+ theorem WithZero.lt_iff_exists_coe
+ theorem WithZero.lt_unzero_iff
+/- theorem WithZero.not_coe_le_zero
+ theorem WithZero.unbot_le_iff
+/- theorem WithZero.unzero_le_unzero
+ theorem WithZero.unzero_lt_iff
+/- theorem WithZero.zero_le
Modified Mathlib/Analysis/Analytic/OfScalars.lean
Modified Mathlib/Analysis/Oscillation.lean
Modified Mathlib/Data/Finset/Lattice/Fold.lean
Modified Mathlib/Data/Finset/Max.lean
+/- theorem Finset.max_of_mem
+/- theorem Finset.min_of_mem
Modified Mathlib/LinearAlgebra/Eigenspace/Triangularizable.lean
Modified Mathlib/MeasureTheory/Integral/Lebesgue/Countable.lean
Modified Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
Modified Mathlib/Order/Interval/Basic.lean
Modified Mathlib/Order/Interval/Set/WithBotTop.lean
+/- theorem WithBot.range_coe
Modified Mathlib/Order/KrullDimension.lean
Modified Mathlib/Order/WithBot.lean
+/- theorem WithBot.coe_le_iff
+/- theorem WithBot.le_coe_iff
+/- theorem WithBot.le_def
+ theorem WithBot.le_iff_forall
+/- theorem WithBot.lt_def
+ theorem WithBot.unbot_le_unbot
+ theorem WithBot.unbot_lt_unbot
+/- theorem WithTop.coe_le_iff
+/- theorem WithTop.le_coe_iff
+/- theorem WithTop.le_def
+ theorem WithTop.le_iff_forall
+/- theorem WithTop.lt_def
Modified Mathlib/Probability/Moments/Variance.lean
Modified Mathlib/RingTheory/PowerBasis.lean
Modified Mathlib/Topology/MetricSpace/Holder.lean
Modified Mathlib/Topology/MetricSpace/HolderNorm.lean
Modified Mathlib/Topology/Order/WithTop.lean
Modified MathlibTest/hint.lean
2025-10-16 16:17:02 21259a9
feat(Analysis/InnerProductSpace): define the inner product on tensor products (#27228)
This defines the inner product on tensor product spaces. Also defines `OrthonormalBasis.tensorProduct`.
The implementation is based on [here](https://github.com/ocfnash/lean-shannon-lovasz/blob/e63e535599ffb3c2a7e995e1621847693dd68fab/src/to_mathlib/analysis/inner_product_space/tensor_product.lean#L404) (by @jjaassoonn), which defines the inner product on real tensor product spaces. The exact same implementation also applies for the general case.
Closes #6020
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/InnerProductSpace/Basic.lean
+ theorem ext_iff_inner_left
+ theorem ext_iff_inner_right
Added Mathlib/Analysis/InnerProductSpace/TensorProduct.lean
+ theorem Orthonormal.basisTensorProduct
+ theorem Orthonormal.tmul
+ theorem OrthonormalBasis.tensorProduct_apply'
+ theorem OrthonormalBasis.tensorProduct_apply
+ theorem OrthonormalBasis.tensorProduct_repr_tmul_apply'
+ theorem OrthonormalBasis.tensorProduct_repr_tmul_apply
+ theorem OrthonormalBasis.toBasis_tensorProduct
+ theorem RCLike.inner_tmul_eq
+ theorem TensorProduct.adjoint_map
+ def TensorProduct.assocIsometry
+ theorem TensorProduct.assocIsometry_apply
+ theorem TensorProduct.assocIsometry_symm_apply
+ def TensorProduct.commIsometry
+ theorem TensorProduct.commIsometry_apply
+ theorem TensorProduct.commIsometry_symm
+ def TensorProduct.congrIsometry
+ theorem TensorProduct.congrIsometry_apply
+ theorem TensorProduct.congrIsometry_symm
+ theorem TensorProduct.dist_tmul_le
+ theorem TensorProduct.edist_tmul_le
+ theorem TensorProduct.enorm_assoc
+ theorem TensorProduct.enorm_comm
+ theorem TensorProduct.enorm_lid
+ theorem TensorProduct.enorm_map
+ theorem TensorProduct.enorm_tmul
+ theorem TensorProduct.ext_iff_inner_left_threefold'
+ theorem TensorProduct.ext_iff_inner_left_threefold
+ theorem TensorProduct.ext_iff_inner_right_threefold'
+ theorem TensorProduct.ext_iff_inner_right_threefold
+ theorem TensorProduct.inner_assoc_assoc
+ theorem TensorProduct.inner_comm_comm
+ theorem TensorProduct.inner_lid_lid
+ theorem TensorProduct.inner_mapIncl_mapIncl
+ theorem TensorProduct.inner_map_map
+ theorem TensorProduct.inner_tmul
+ def TensorProduct.lidIsometry
+ theorem TensorProduct.lidIsometry_apply
+ theorem TensorProduct.lidIsometry_symm_apply
+ def TensorProduct.mapInclIsometry
+ theorem TensorProduct.mapInclIsometry_apply
+ def TensorProduct.mapIsometry
+ theorem TensorProduct.mapIsometry_apply
+ theorem TensorProduct.nndist_tmul_le
+ theorem TensorProduct.nnnorm_assoc
+ theorem TensorProduct.nnnorm_comm
+ theorem TensorProduct.nnnorm_lid
+ theorem TensorProduct.nnnorm_map
+ theorem TensorProduct.nnnorm_tmul
+ theorem TensorProduct.norm_assoc
+ theorem TensorProduct.norm_comm
+ theorem TensorProduct.norm_lid
+ theorem TensorProduct.norm_map
+ theorem TensorProduct.norm_tmul
+ theorem TensorProduct.toLinearEquiv_assocIsometry
+ theorem TensorProduct.toLinearEquiv_commIsometry
+ theorem TensorProduct.toLinearEquiv_congrIsometry
+ theorem TensorProduct.toLinearEquiv_lidIsometry
+ theorem TensorProduct.toLinearMap_mapInclIsometry
+ theorem TensorProduct.toLinearMap_mapIsometry
2025-10-16 15:36:47 18d7b57
feat: asymptotic cone of a set (#27292)
This PR defines the asymptotic cone of a set in a normed affine space and proves its main properties. This is partial progress towards showing that an unbounded finite-dimensional convex set contains a ray.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/Normed/Affine/AsymptoticCone.lean
+ theorem AffineSpace.asymptoticNhds_le_cobounded
+ theorem AffineSpace.cobounded_eq_iSup_sphere_asymptoticNhds
+ theorem asymptoticCone_subset_singleton_of_bounded
+ theorem isBounded_iff_asymptoticCone_subset_singleton
+ theorem not_bounded_iff_exists_ne_zero_mem_asymptoticCone
Modified Mathlib/Order/Filter/Map.lean
+ theorem Filter.biSup_pure_eq_principal
+ theorem Filter.iSup_pure_eq_top
Added Mathlib/Topology/Algebra/AsymptoticCone.lean
+ def AffineSpace.asymptoticNhds
+ theorem AffineSpace.asymptoticNhds_bind_asymptoticNhds
+ theorem AffineSpace.asymptoticNhds_bind_nhds
+ theorem AffineSpace.asymptoticNhds_eq_smul
+ theorem AffineSpace.asymptoticNhds_eq_smul_vadd
+ theorem AffineSpace.asymptoticNhds_smul
+ theorem AffineSpace.asymptoticNhds_vadd_pure
+ theorem AffineSpace.asymptoticNhds_zero
+ theorem AffineSpace.nhds_bind_asymptoticNhds
+ theorem AffineSpace.vadd_asymptoticNhds
+ theorem Convex.smul_vadd_mem_of_isClosed_of_mem_asymptoticCone
+ theorem Convex.smul_vadd_mem_of_mem_nhds_of_mem_asymptoticCone
+ theorem Filter.Tendsto.asymptoticNhds_vadd_const
+ theorem Filter.Tendsto.atTop_smul_const_tendsto_asymptoticNhds
+ theorem Filter.Tendsto.atTop_smul_nhds_tendsto_asymptoticNhds
+ theorem Filter.Tendsto.const_vadd_asymptoticNhds
+ theorem StarConvex.smul_vadd_mem_of_isClosed_of_mem_asymptoticCone
+ def asymptoticCone
+ theorem asymptoticCone_affineSubspace
+ theorem asymptoticCone_asymptoticCone
+ theorem asymptoticCone_biUnion
+ theorem asymptoticCone_closure
+ theorem asymptoticCone_empty
+ theorem asymptoticCone_eq_closure_of_forall_smul_mem
+ theorem asymptoticCone_iUnion_of_finite
+ theorem asymptoticCone_mono
+ theorem asymptoticCone_nonempty
+ theorem asymptoticCone_sUnion
+ theorem asymptoticCone_submodule
+ theorem asymptoticCone_union
+ theorem asymptoticCone_univ
+ theorem isClosed_asymptoticCone
+ theorem mem_asymptoticCone_iff
+ theorem smul_mem_asymptoticCone
+ theorem smul_mem_asymptoticCone_iff
+ theorem zero_mem_asymptoticCone
2025-10-16 14:12:21 3bde458
fix: update the continuity lemma library note (#30606)
One previously failing example elaborates fine now, and update the lemma examples to follow mathlib's naming convention.
ESTIMATED CHANGES
Modified Mathlib/Topology/Continuous.lean
2025-10-16 13:41:54 f1634b7
chore: rename fields in `ImplicitFunctionData` (#30607)
Make them match the naming convention, as discussed on zulip: [#mathlib4 > Naming convention @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Naming.20convention/near/545300205)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/Implicit.lean
2025-10-16 09:16:33 c092d56
chore(Data/Seq): address porting note in `terminates_parallel.aux` by golfing (#30603)
ESTIMATED CHANGES
Modified Mathlib/Data/Seq/Parallel.lean
2025-10-16 08:58:03 a03b172
chore: generalize `Adapted` to dependent types (#30549)
This PR generalizes `Adapted` to be a predicate about functions `(i : ι) → Ω → β i` instead of `ι → Ω → β`.
From the LeanBandits project, in which we have a sequence of random variables `X 0, X 1, ...` and want to says that `n => (X_0, ..., X_n)` is adapted to the natural filtration.
ESTIMATED CHANGES
Modified Mathlib/Probability/BorelCantelli.lean
Modified Mathlib/Probability/Process/Adapted.lean
+/- def MeasureTheory.Adapted
+/- theorem MeasureTheory.Filtration.adapted_natural
+ theorem MeasureTheory.adapted_const'
+/- theorem MeasureTheory.adapted_const
+ theorem MeasureTheory.adapted_zero'
+/- theorem MeasureTheory.adapted_zero
Modified Mathlib/Probability/Process/Filtration.lean
+/- theorem MeasureTheory.Filtration.filtrationOfSet_eq_natural
+/- def MeasureTheory.Filtration.natural
2025-10-16 08:58:00 7841a15
chore: move Data/Real/GoldenRatio and RingTheory/Real/Irrational to NumberTheory/Real (#30498)
Neither file is about data structures, so let's find a better home for them.
Create a new directory `NumberTheory/Real` for them. Moving these files was suggested [on zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Cleaning.20up.20.60Data.60/with/544442456).
ESTIMATED CHANGES
Modified Counterexamples/IrrationalPowerOfIrrational.lean
Modified Mathlib.lean
Modified Mathlib/Analysis/Real/Pi/Irrational.lean
Modified Mathlib/Analysis/SpecificLimits/Fibonacci.lean
Modified Mathlib/Combinatorics/Additive/VerySmallDoubling.lean
Modified Mathlib/Data/Real/Irrational.lean
Modified Mathlib/NumberTheory/DiophantineApproximation/Basic.lean
Modified Mathlib/NumberTheory/Rayleigh.lean
Renamed Mathlib/Data/Real/GoldenRatio.lean to Mathlib/NumberTheory/Real/GoldenRatio.lean
Renamed Mathlib/RingTheory/Real/Irrational.lean to Mathlib/NumberTheory/Real/Irrational.lean
Modified Mathlib/NumberTheory/Transcendental/Liouville/Basic.lean
Modified Mathlib/Tactic/NormNum/Irrational.lean
Modified Mathlib/Topology/Instances/AddCircle/DenseSubgroup.lean
Modified Mathlib/Topology/Instances/Irrational.lean
2025-10-16 08:57:58 463a9d1
chore: split test file for differential geometry elaborators (#30412)
The test file was getting quite long (with more tests to come for future features), and accumulating too many imports: once mathlib was tweaked to make use of the elaborators, recompilation after a basic change would take too long.
Split it into a basic file with minimal imports, and another file for all more advanced features.
ESTIMATED CHANGES
Modified MathlibTest/DifferentialGeometry/Notation.lean
Added MathlibTest/DifferentialGeometry/NotationAdvanced.lean
2025-10-16 08:57:56 2a99dbc
feat: solutions to $C^n$ vector fields are $C^n$ in time (#26393)
I prove that solutions to $C^n$ vector fields are also $C^n$ in time, where $n ≤ \infty$.
This PR continues the work from #21286.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/Deriv/Basic.lean
+ theorem HasDerivWithinAt.continuousOn
Modified Mathlib/Analysis/ODE/PicardLindelof.lean
+ theorem ODE.contDiffOn_enat_Icc_of_hasDerivWithinAt
+ theorem ODE.contDiffOn_enat_picard_Icc
+ theorem ODE.contDiffOn_nat_picard_Icc
+ theorem ODE.picard_eq_of_hasDerivAt
2025-10-16 08:57:54 acf42d3
feat(Topology): Add PairReduction.lean (#26243)
Add file PairReduction.lean which proves the theorem `pair_reduction` which is needed for the proof of the general Kolmogorov-Chentsov theorem in the Brownian Motion project.
- [x] depends on: #27239
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Topology/EMetricSpace/PairReduction.lean
+ theorem EMetric.pair_reduction
+ theorem PairReduction.antitone_logSizeBallSeq_add_one_subset
+ theorem PairReduction.card_finset_logSizeBallSeq_add_one_lt
+ theorem PairReduction.card_finset_logSizeBallSeq_card_eq_zero
+ theorem PairReduction.card_finset_logSizeBallSeq_le
+ theorem PairReduction.card_le_logSizeRadius_le_pow_logSizeRadius
+ theorem PairReduction.card_pairSetSeq_le_logSizeRadius_mul
+ theorem PairReduction.card_pairSet_le
+ theorem PairReduction.disjoint_smallBall_logSizeBallSeq
+ theorem PairReduction.edist_le_of_mem_pairSet
+ theorem PairReduction.exists_radius_le
+ theorem PairReduction.finset_logSizeBallSeq_add_one
+ theorem PairReduction.finset_logSizeBallSeq_add_one_ssubset
+ theorem PairReduction.finset_logSizeBallSeq_add_one_subset
+ theorem PairReduction.finset_logSizeBallSeq_subset_logSizeBallSeq_init
+ theorem PairReduction.finset_logSizeBallSeq_zero
+ theorem PairReduction.iSup_edist_pairSet
+ def PairReduction.logSizeBallSeq
+ def PairReduction.logSizeBallStruct.ball
+ def PairReduction.logSizeBallStruct.smallBall
+ structure PairReduction.logSizeBallStruct
+ def PairReduction.logSizeRadius
+ theorem PairReduction.logSizeRadius_le_card_smallBall
+ theorem PairReduction.one_le_logSizeRadius
+ theorem PairReduction.one_le_radius_logSizeBallSeq
+ def PairReduction.pairSet
+ def PairReduction.pairSetSeq
+ theorem PairReduction.pairSet_empty_eq_empty
+ theorem PairReduction.pairSet_subset
+ theorem PairReduction.point_logSizeBallSeq_add_one
+ theorem PairReduction.point_logSizeBallSeq_zero
+ theorem PairReduction.point_mem_finset_logSizeBallSeq
+ theorem PairReduction.point_mem_logSizeBallSeq_init
+ theorem PairReduction.point_notMem_finset_logSizeBallSeq_add_one
+ theorem PairReduction.pow_logSizeRadius_le_card_le_logSizeRadius
+ theorem PairReduction.radius_logSizeBallSeq_add_one
+ theorem PairReduction.radius_logSizeBallSeq_le
+ theorem PairReduction.radius_logSizeBallSeq_zero
Modified docs/references.bib
2025-10-16 08:08:25 7065ce7
feat: Borel space on WithTop (#30543)
- add `untopA`, abbreviation of `untopD` with `Classical.arbitrary` as default value
- prove continuity of functions related to `WithTop`: coercion from the base type, `untop`, `untopD`, `untopA`
- define the Borel measurable space on `WithTop`, and prove measurability of the same functions (from continuity)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Data/Countable/Basic.lean
+ theorem untopD_coe_enat
Added Mathlib/MeasureTheory/Constructions/BorelSpace/WithTop.lean
+ theorem Measurable.untopA
+ theorem Measurable.untopD
+ theorem Measurable.withTop_coe
+ def WithTop.MeasurableEquiv.neTopEquiv
+ def WithTop.measurableEquivSum
+ theorem WithTop.measurable_coe
+ theorem WithTop.measurable_of_measurable_comp_coe
+ theorem WithTop.measurable_untopA
+ theorem WithTop.measurable_untopD
Modified Mathlib/Order/WithBot.lean
+ theorem WithBot.unbotA_eq_unbot
+ theorem WithTop.untopA_eq_untop
Modified Mathlib/Topology/Order/WithTop.lean
+ theorem WithTop.continuousOn_untopA
+ theorem WithTop.continuousOn_untopD
+ theorem WithTop.continuous_coe
+ theorem WithTop.continuous_untop
+ theorem WithTop.isEmbedding_coe
+ theorem WithTop.isOpenEmbedding_coe
+ def WithTop.neTopHomeomorph
+ theorem WithTop.nhds_coe
+ def WithTop.sumHomeomorph
+ theorem WithTop.tendsto_untop
+ theorem WithTop.tendsto_untopA
+ theorem WithTop.tendsto_untopD
2025-10-16 07:51:24 b2a9ee2
feat(CategoryTheory): functors that are dense at an object (#29556)
Given a functor `F : C ⥤ D` and `Y : D`, we say that `F` is dense at `Y` if `Y` identifies to the colimit of all `F.obj X` for `X : C` and `f : F.obj X ⟶ Y`, i.e. the obvious natural transformation makes the identity functor of `D` a pointwise left Kan extension of `F` along `F` at `Y`.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Functor/KanExtension/DenseAt.lean
+ def CategoryTheory.Functor.DenseAt.ofIso
+ def CategoryTheory.Functor.DenseAt.ofNatIso
+ theorem CategoryTheory.Functor.congr_isDenseAt
+ def CategoryTheory.Functor.isDenseAt
+ theorem CategoryTheory.Functor.isDenseAt_eq_isPointwiseLeftKanExtensionAt
Modified Mathlib/CategoryTheory/Functor/KanExtension/Pointwise.lean
+ theorem CategoryTheory.Functor.LeftExtension.IsPointwiseLeftKanExtensionAt.hom_ext'
+ def CategoryTheory.Functor.LeftExtension.isPointwiseLeftKanExtensionAt
+ theorem CategoryTheory.Functor.RightExtension.IsPointwiseRightKanExtensionAt.hom_ext'
+ def CategoryTheory.Functor.RightExtension.isPointwiseRightKanExtensionAt
2025-10-16 07:51:23 a7bcf93
feat(PNat/Factors): add attrs and lemmas (#28812)
ESTIMATED CHANGES
Modified Mathlib/Data/PNat/Factors.lean
+ theorem PNat.mem_factorMultiset
+ theorem PrimeMultiset.mem_ofNatList
+ theorem PrimeMultiset.mem_ofNatMultiset
+ theorem PrimeMultiset.toPNatMultiset_ofPNatList
2025-10-16 07:33:11 ed5b08c
feat: notation for galois group (#30266)
This PR adds support for the notation `Gal(L/K) := L ≃ₐ[K] L`. `Gal(L/K)` is a simple macro for `L ≃ₐ[K] L`, but `L ≃ₐ[K] L` only delaborates to `Gal(L/K)` when `L` and `K` are fields.
Zulip thread: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Notation.20for.20Galois.20group/with/543320864
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean
+/- theorem spectralNorm_eq_of_equiv
Modified Mathlib/FieldTheory/AbelRuffini.lean
Modified Mathlib/FieldTheory/Finite/Basic.lean
Modified Mathlib/FieldTheory/Fixed.lean
Modified Mathlib/FieldTheory/Galois/Basic.lean
+/- theorem IntermediateField.fixedField_bot
+/- theorem IntermediateField.fixedField_le
+/- def IntermediateField.fixingSubgroupEquiv
+/- theorem IntermediateField.restrictRestrictAlgEquivMapHom_apply
+/- def IntermediateField.subgroupEquivAlgEquiv
+/- theorem IsGalois.finiteDimensional_of_finite
+/- theorem IsGalois.map_fixingSubgroup
Modified Mathlib/FieldTheory/Galois/GaloisClosure.lean
+/- theorem FiniteGaloisIntermediateField.adjoin_simple_map_algEquiv
Modified Mathlib/FieldTheory/Galois/Infinite.lean
+/- theorem InfiniteGalois.fixingSubgroup_fixedField
+/- theorem InfiniteGalois.restrict_fixedField
Modified Mathlib/FieldTheory/Galois/IsGaloisGroup.lean
Modified Mathlib/FieldTheory/Galois/NormalBasis.lean
+/- theorem IsGalois.normalBasis_apply
Added Mathlib/FieldTheory/Galois/Notation.lean
Modified Mathlib/FieldTheory/Galois/Profinite.lean
+/- theorem InfiniteGalois.krullTopology_mem_nhds_one_iff_of_isGalois
Modified Mathlib/FieldTheory/KrullTopology.lean
+/- def fixedByFinite
+/- def galBasis
+/- theorem mem_galBasis_iff
Modified Mathlib/FieldTheory/KummerExtension.lean
+/- theorem autEquivRootsOfUnity_apply_rootOfSplit
+/- theorem autEquivRootsOfUnity_smul
+/- theorem exists_root_adjoin_eq_top_of_isCyclic
+/- theorem isCyclic_of_isSplittingField_X_pow_sub_C
Modified Mathlib/FieldTheory/Minpoly/ConjRootClass.lean
Modified Mathlib/FieldTheory/Minpoly/Field.lean
Modified Mathlib/FieldTheory/Minpoly/IsConjRoot.lean
Modified Mathlib/FieldTheory/Normal/Basic.lean
Modified Mathlib/FieldTheory/Normal/Closure.lean
+/- theorem IntermediateField.normalClosure_def''
+/- theorem IntermediateField.normal_iff_forall_map_eq'
+/- theorem IntermediateField.normal_iff_forall_map_le'
Modified Mathlib/FieldTheory/Normal/Defs.lean
+/- def AlgEquiv.restrictNormal
+/- def AlgEquiv.restrictNormalHom
+/- def AlgHom.restrictNormal'
+/- def Normal.algHomEquivAut
Modified Mathlib/FieldTheory/PolynomialGaloisGroup.lean
+/- theorem Polynomial.Gal.galActionHom_restrict
+/- def Polynomial.Gal.restrict
+/- theorem Polynomial.Gal.restrict_smul
Modified Mathlib/NumberTheory/Cyclotomic/CyclotomicCharacter.lean
Modified Mathlib/NumberTheory/Cyclotomic/Gal.lean
Modified Mathlib/NumberTheory/NumberField/CMField.lean
+/- theorem NumberField.IsCMField.of_forall_isConj
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
+/- theorem NumberField.ComplexEmbedding.IsConj.comp
+/- theorem NumberField.ComplexEmbedding.IsConj.ext
+/- theorem NumberField.ComplexEmbedding.IsConj.ext_iff
+/- theorem NumberField.ComplexEmbedding.isConj_one_iff
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Ramification.lean
+/- theorem NumberField.InfinitePlace.mem_stabilizer_mk_iff
Modified Mathlib/NumberTheory/NumberField/Norm.lean
Modified Mathlib/NumberTheory/RamificationInertia/Galois.lean
+/- theorem Ideal.coe_smul_primesOver_eq_map_galRestrict
+/- theorem Ideal.coe_smul_primesOver_mk_eq_map_galRestrict
Modified Mathlib/RepresentationTheory/Homological/GroupCohomology/Hilbert90.lean
+/- theorem groupCohomology.Hilbert90.aux_ne_zero
Modified Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean
+/- theorem algebraMap_galRestrict_apply
+/- theorem coe_galRestrict_apply
+/- def galRestrict
+/- theorem galRestrict_apply
Modified Mathlib/RingTheory/Invariant/Basic.lean
Modified Mathlib/RingTheory/Norm/Transitivity.lean
Modified Mathlib/RingTheory/Trace/Basic.lean
Added MathlibTest/GalNotation.lean
Modified scripts/noshake.json
2025-10-16 05:14:02 c4bf6be
feat: affine homotopy between continuous maps (#30569)
Cherry-picked from #24019
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Topology/Homotopy/Affine.lean
+ def ContinuousMap.Homotopy.affine
+ theorem ContinuousMap.Homotopy.evalAt_affine
2025-10-16 04:35:03 a59d17e
feat(Analysis/Fourier): Parseval for FourierCoeffOn (#30023)
`tsum_sq_fourierCoeffOn` proved via the existing `tsum_sq_fourierCoeff`. The lemmas I needed, particularly `memLp_liftIoc_of_memLp` which shows that the lift of an Lp function on the interval is Lp on AddCircle, turned out to be much messier than I anticipated. Hopefully someone can suggest improvements.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Fourier/AddCircle.lean
+ theorem AddCircle.integral_haarAddCircle
+ theorem MeasureTheory.memLp_haarAddCircle_iff
+ theorem fourierCoeffOn_congr_ae
+ theorem fourierCoeff_congr_ae
+ theorem hasSum_sq_fourierCoeff
+ theorem hasSum_sq_fourierCoeffOn
+ theorem tsum_sq_fourierCoeffOn
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/Periodic.lean
+ theorem AddCircle.integral_liftIoc_eq_intervalIntegral
+ theorem AddCircle.measurePreserving_equivIoc
+ theorem MeasureTheory.MemLp.memLp_liftIoc
Modified Mathlib/Topology/Instances/AddCircle/Defs.lean
+ theorem AddCircle.Ico_ext
+ theorem AddCircle.Ioc_ext
+ theorem AddCircle.equivIco_coe_eq
+ theorem AddCircle.equivIoc_coe_eq
+ theorem AddCircle.liftIco_comp_apply
+ theorem AddCircle.liftIoc_comp_apply
2025-10-16 04:20:10 27036ae
feat: Limits for ProfiniteAddGrp (#30341)
`to_additive` was not working in the construction of limits in the category of profinite groups; I believe the fix was to add `@[to_additive self]` to the `Profinite` declaration.
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean
Modified Mathlib/Topology/Category/Profinite/Basic.lean
2025-10-16 03:54:15 c0b3860
chore: simplify cache's treatment of nightly-testing (#30571)
See discussion at [#ecosystem infrastructure > `cache get` fails when depending on Mathlib nightly-testing](https://leanprover.zulipchat.com/#narrow/channel/536994-ecosystem-infrastructure/topic/.60cache.20get.60.20fails.20when.20depending.20on.20Mathlib.20nightly-testing/with/544872705)
ESTIMATED CHANGES
Modified Cache/Requests.lean
2025-10-16 03:33:05 7f60989
doc(AlgebraicGeometry): fix typos (#30591)
Found with help from Codex.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/AffineAnd.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Separated.lean
Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean
Modified Mathlib/AlgebraicGeometry/PointsPi.lean
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean
Modified Mathlib/AlgebraicGeometry/QuasiAffine.lean
Modified Mathlib/AlgebraicGeometry/Scheme.lean
Modified Mathlib/AlgebraicGeometry/ValuativeCriterion.lean
2025-10-16 02:52:28 68304f2
chore(SetTheory): deprecate `mk_multiset_of_countable` and `iSup_succ`. remove `cast_succ`. (#28488)
ESTIMATED CHANGES
Modified Mathlib/SetTheory/Cardinal/Basic.lean
Modified Mathlib/SetTheory/Cardinal/Finsupp.lean
- theorem Cardinal.mk_multiset_of_countable
Modified Mathlib/SetTheory/Ordinal/Family.lean
- theorem Ordinal.iSup_succ
Modified Mathlib/SetTheory/Ordinal/NaturalOps.lean
2025-10-16 02:52:25 c6fb381
feat(LinearAlgebra/Projectivization/Subspace): correspondence between linear and projective subspaces (#26909)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Projectivization/Subspace.lean
+ theorem Projectivization.Subspace.mem_submodule_iff
+ def Projectivization.Subspace.submodule
+ theorem Submodule.mem_projectivization_iff_submodule_le
+ theorem Submodule.mk_mem_projectivization_iff
2025-10-16 01:38:47 bf6c674
feat: `AEMeasurable.dist` (#30585)
Add the lemma `AEMeasurable.dist` and remove a few `@` in the same file.
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Constructions/BorelSpace/Metric.lean
+ theorem AEMeasurable.dist
2025-10-16 01:38:46 ca47b81
chore: rename pow_eq_zero to eq_zero_of_pow_eq_zero (#30443)
For consistency with eq_zero_of_zpow_eq_zero.
ESTIMATED CHANGES
Modified Archive/Imo/Imo1961Q3.lean
Modified Archive/Imo/Imo1962Q4.lean
Modified Mathlib/Algebra/GroupWithZero/Basic.lean
+ theorem eq_zero_of_pow_eq_zero
- theorem pow_eq_zero
+/- theorem pow_ne_zero
Modified Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean
Modified Mathlib/Algebra/IsPrimePow.lean
Modified Mathlib/Algebra/Polynomial/DenomsClearable.lean
Modified Mathlib/Algebra/Polynomial/SumIteratedDerivative.lean
Modified Mathlib/Algebra/Quaternion.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean
Modified Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean
Modified Mathlib/Analysis/InnerProductSpace/Defs.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/Basic.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean
Modified Mathlib/Analysis/SpecificLimits/Normed.lean
Modified Mathlib/FieldTheory/Finite/Basic.lean
Modified Mathlib/FieldTheory/Finite/GaloisField.lean
Modified Mathlib/FieldTheory/PurelyInseparable/Tower.lean
Modified Mathlib/GroupTheory/Schreier.lean
Modified Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean
Modified Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean
Modified Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean
Modified Mathlib/NumberTheory/Cyclotomic/Discriminant.lean
Modified Mathlib/NumberTheory/Cyclotomic/PrimitiveRoots.lean
Modified Mathlib/NumberTheory/FLT/Four.lean
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean
Modified Mathlib/NumberTheory/PythagoreanTriples.lean
Modified Mathlib/RingTheory/Coprime/Basic.lean
Modified Mathlib/RingTheory/DiscreteValuationRing/Basic.lean
Modified Mathlib/RingTheory/Ideal/Operations.lean
Modified Mathlib/RingTheory/Jacobson/Ring.lean
Modified Mathlib/RingTheory/Nilpotent/Defs.lean
Modified Mathlib/RingTheory/Perfection.lean
Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Expand.lean
Modified Mathlib/RingTheory/Polynomial/Selmer.lean
Modified Mathlib/Tactic/LinearCombination'.lean
Modified Mathlib/Tactic/LinearCombination/Lemmas.lean
Modified Mathlib/Topology/Instances/ENNReal/Lemmas.lean
2025-10-16 01:38:44 504041d
feat(Analysis/Fourier): Plancherel's theorem (#29860)
The Plancherel theorem states that the Fourier transform is unitary on L^2. We prove the main step which is that the Fourier transform on Schwartz space preserves the L^2-norm.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Complex/Basic.lean
+ theorem Complex.ofRealLI_apply
Modified Mathlib/Analysis/Distribution/FourierSchwartz.lean
+ theorem SchwartzMap.fourier_inversion
+ theorem SchwartzMap.fourier_inversion_inv
+ theorem SchwartzMap.inner_fourierTransformCLM_toL2_eq
+ theorem SchwartzMap.integral_bilin_fourierIntegral_eq
+ theorem SchwartzMap.integral_inner_fourier_fourier
+ theorem SchwartzMap.integral_norm_sq_fourier
+ theorem SchwartzMap.integral_sesq_fourierIntegral_eq
+ theorem SchwartzMap.integral_sesq_fourier_fourier
+ theorem SchwartzMap.norm_fourierTransformCLM_toL2_eq
Modified Mathlib/Analysis/Distribution/SchwartzSpace.lean
+ theorem SchwartzMap.inner_toL2_toL2_eq
Modified Mathlib/Analysis/Fourier/FourierTransform.lean
+ theorem VectorFourier.integral_fourierIntegral_swap
+ theorem VectorFourier.integral_sesq_fourierIntegral_eq_neg_flip
Modified docs/1000.yaml
Modified docs/undergrad.yaml
2025-10-16 01:23:42 5aecb23
chore: rename `Grp_` to `Grp` (#30496)
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Removing.20underscores.20from.20docs.23Mon_.2C.20docs.23Grp_.20.2E.2E.2E)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/Grp/LeftExactFunctor.lean
Modified Mathlib/CategoryTheory/Monoidal/Cartesian/CommGrp_.lean
Modified Mathlib/CategoryTheory/Monoidal/Cartesian/Grp_.lean
+ def Grp.homMk
+ theorem Grp.homMk_hom'
- def Grp_.homMk
- theorem Grp_.homMk_hom'
+/- def yonedaGrp
Modified Mathlib/CategoryTheory/Monoidal/CommGrp_.lean
+/- theorem CategoryTheory.Functor.comp_mapCommGrp_mul
+/- theorem CategoryTheory.Functor.comp_mapCommGrp_one
+/- def CategoryTheory.Functor.mapCommGrp
+/- def CategoryTheory.Functor.mapCommGrpIdIso
+/- theorem CategoryTheory.Functor.mapCommGrp_id_one
+/- theorem CategoryTheory.Functor.mapCommpGrp_id_mul
+ theorem CommGrp.comp'
+ theorem CommGrp.comp_hom
+ def CommGrp.forget
+ def CommGrp.forget₂CommMon
+ theorem CommGrp.forget₂CommMon_comp_forget
+ theorem CommGrp.forget₂CommMon_map_hom
+ theorem CommGrp.forget₂CommMon_obj_mul
+ theorem CommGrp.forget₂CommMon_obj_one
+ def CommGrp.forget₂Grp
+ theorem CommGrp.forget₂Grp_comp_forget
+ theorem CommGrp.forget₂Grp_map_hom
+ theorem CommGrp.forget₂Grp_obj_mul
+ theorem CommGrp.forget₂Grp_obj_one
+ def CommGrp.fullyFaithfulForget₂CommMon
+ def CommGrp.fullyFaithfulForget₂Grp
+ theorem CommGrp.hom_ext
+ theorem CommGrp.id'
+ theorem CommGrp.id_hom
+ def CommGrp.mkIso'
+ def CommGrp.toCommMon
+ def CommGrp.toGrp
+ def CommGrp.trivial
+ structure CommGrp
- theorem CommGrp_.comp'
- theorem CommGrp_.comp_hom
- def CommGrp_.forget
- def CommGrp_.forget₂CommMon
- theorem CommGrp_.forget₂CommMon_comp_forget
- theorem CommGrp_.forget₂CommMon_map_hom
- theorem CommGrp_.forget₂CommMon_obj_mul
- theorem CommGrp_.forget₂CommMon_obj_one
- def CommGrp_.forget₂Grp_
- theorem CommGrp_.forget₂Grp_comp_forget
- theorem CommGrp_.forget₂Grp_map_hom
- theorem CommGrp_.forget₂Grp_obj_mul
- theorem CommGrp_.forget₂Grp_obj_one
- def CommGrp_.fullyFaithfulForget₂CommMon
- def CommGrp_.fullyFaithfulForget₂Grp_
- theorem CommGrp_.hom_ext
- theorem CommGrp_.id'
- theorem CommGrp_.id_hom
- def CommGrp_.mkIso'
- def CommGrp_.toCommMon
- def CommGrp_.toGrp_
- def CommGrp_.trivial
- structure CommGrp_
Modified Mathlib/CategoryTheory/Monoidal/Grp_.lean
+ theorem Grp.comp'
+ theorem Grp.comp_hom
+ theorem Grp.hom_ext
+ theorem Grp.id'
+ theorem Grp.id_hom
+ def Grp.toMon
+ def Grp.trivial
+ structure Grp
+/- def GrpObj.tensorObj.CategoryTheory.Equivalence.mapGrp
+/- theorem GrpObj.tensorObj.CategoryTheory.Functor.comp_mapGrp_mul
+/- theorem GrpObj.tensorObj.CategoryTheory.Functor.comp_mapGrp_one
+/- theorem GrpObj.tensorObj.CategoryTheory.Functor.essImage_mapGrp
+/- def GrpObj.tensorObj.CategoryTheory.Functor.mapGrp
+/- def GrpObj.tensorObj.CategoryTheory.Functor.mapGrpIdIso
+/- theorem GrpObj.tensorObj.CategoryTheory.Functor.mapGrp_id_mul
+/- theorem GrpObj.tensorObj.CategoryTheory.Functor.mapGrp_id_one
+ theorem GrpObj.tensorObj.Grp.associator_hom_hom
+ theorem GrpObj.tensorObj.Grp.associator_inv_hom
+ theorem GrpObj.tensorObj.Grp.braiding_hom_hom
+ theorem GrpObj.tensorObj.Grp.braiding_inv_hom
+ def GrpObj.tensorObj.Grp.forget
+ def GrpObj.tensorObj.Grp.forget₂Mon
+ theorem GrpObj.tensorObj.Grp.forget₂Mon_comp_forget
+ theorem GrpObj.tensorObj.Grp.forget₂Mon_map_hom
+ theorem GrpObj.tensorObj.Grp.forget₂Mon_obj_mul
+ theorem GrpObj.tensorObj.Grp.forget₂Mon_obj_one
+ theorem GrpObj.tensorObj.Grp.fst_hom
+ def GrpObj.tensorObj.Grp.fullyFaithfulForget₂Mon
+ theorem GrpObj.tensorObj.Grp.leftUnitor_hom_hom
+ theorem GrpObj.tensorObj.Grp.leftUnitor_inv_hom
+ theorem GrpObj.tensorObj.Grp.lift_hom
+ def GrpObj.tensorObj.Grp.mkIso'
+ theorem GrpObj.tensorObj.Grp.rightUnitor_hom_hom
+ theorem GrpObj.tensorObj.Grp.rightUnitor_inv_hom
+ theorem GrpObj.tensorObj.Grp.snd_hom
+ theorem GrpObj.tensorObj.Grp.tensorObj_mul
+ theorem GrpObj.tensorObj.Grp.tensorObj_one
+ theorem GrpObj.tensorObj.Grp.tensorUnit_X
+ theorem GrpObj.tensorObj.Grp.tensorUnit_mul
+ theorem GrpObj.tensorObj.Grp.tensorUnit_one
+ theorem GrpObj.tensorObj.Grp.whiskerLeft_hom
+ theorem GrpObj.tensorObj.Grp.whiskerRight_hom
- theorem GrpObj.tensorObj.Grp_.associator_hom_hom
- theorem GrpObj.tensorObj.Grp_.associator_inv_hom
- theorem GrpObj.tensorObj.Grp_.braiding_hom_hom
- theorem GrpObj.tensorObj.Grp_.braiding_inv_hom
- def GrpObj.tensorObj.Grp_.forget
- def GrpObj.tensorObj.Grp_.forget₂Mon
- theorem GrpObj.tensorObj.Grp_.forget₂Mon_comp_forget
- theorem GrpObj.tensorObj.Grp_.forget₂Mon_map_hom
- theorem GrpObj.tensorObj.Grp_.forget₂Mon_obj_mul
- theorem GrpObj.tensorObj.Grp_.forget₂Mon_obj_one
- theorem GrpObj.tensorObj.Grp_.fst_hom
- def GrpObj.tensorObj.Grp_.fullyFaithfulForget₂Mon
- theorem GrpObj.tensorObj.Grp_.leftUnitor_hom_hom
- theorem GrpObj.tensorObj.Grp_.leftUnitor_inv_hom
- theorem GrpObj.tensorObj.Grp_.lift_hom
- def GrpObj.tensorObj.Grp_.mkIso'
- theorem GrpObj.tensorObj.Grp_.rightUnitor_hom_hom
- theorem GrpObj.tensorObj.Grp_.rightUnitor_inv_hom
- theorem GrpObj.tensorObj.Grp_.snd_hom
- theorem GrpObj.tensorObj.Grp_.tensorObj_mul
- theorem GrpObj.tensorObj.Grp_.tensorObj_one
- theorem GrpObj.tensorObj.Grp_.tensorUnit_X
- theorem GrpObj.tensorObj.Grp_.tensorUnit_mul
- theorem GrpObj.tensorObj.Grp_.tensorUnit_one
- theorem GrpObj.tensorObj.Grp_.whiskerLeft_hom
- theorem GrpObj.tensorObj.Grp_.whiskerRight_hom
- theorem Grp_.comp'
- theorem Grp_.comp_hom
- theorem Grp_.hom_ext
- theorem Grp_.id'
- theorem Grp_.id_hom
- def Grp_.toMon
- def Grp_.trivial
- structure Grp_
Modified Mathlib/CategoryTheory/Monoidal/Internal/Types/CommGrp_.lean
Modified Mathlib/CategoryTheory/Monoidal/Internal/Types/Grp_.lean
Modified Mathlib/CategoryTheory/Preadditive/CommGrp_.lean
+/- def CategoryTheory.Preadditive.commGrpEquivalence
+/- def CategoryTheory.Preadditive.commGrpEquivalenceAux
+/- def CategoryTheory.Preadditive.toCommGrp
2025-10-15 16:19:02 6b1d0f0
doc(README): add Michael Rothgang to the maintainer list (#30588)
ESTIMATED CHANGES
Modified README.md
2025-10-15 16:18:59 97ffe6c
feat(NumberTheory/SumTwoSquares): it is decidable whether a number is the sum of two squares (#30273)
Add a `Decidable` instance for the already proven theorem of being the sum of two squares.
Try `#eval Finset.range 50 |>.filter (∃ x y, · = x ^ 2 + y ^ 2)`
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/SumTwoSquares.lean
- theorem Nat.Prime.mod_four_ne_three_of_dvd_isSquare_neg_one
+ theorem Nat.mod_four_ne_three_of_mem_primeFactors_of_isSquare_neg_one
- theorem ZMod.isSquare_neg_one_iff
+ theorem ZMod.isSquare_neg_one_iff_forall_mem_primeFactors_mod_four_ne_three
2025-10-15 16:18:56 cb5b0e5
feat: add Mathlib.RingTheory.RootsOfUnity.CyclotomicUnits (#30085)
We add basic results about cyclotomic units.
From `flt-regular`.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/RingTheory/RootsOfUnity/CyclotomicUnits.lean
+ theorem IsPrimitiveRoot.associated_pow_add_sub_sub_one
+ theorem IsPrimitiveRoot.associated_pow_sub_one_pow_of_coprime
+ theorem IsPrimitiveRoot.associated_sub_one_pow_sub_one_of_coprime
+ theorem IsPrimitiveRoot.geom_sum_isUnit'
+ theorem IsPrimitiveRoot.geom_sum_isUnit
+ theorem IsPrimitiveRoot.ntRootsFinset_pairwise_associated_sub_one_sub_of_prime
+ theorem IsPrimitiveRoot.pow_sub_one_eq_geom_sum_mul_geom_sum_inv_mul_pow_sub_one
+ theorem IsPrimitiveRoot.pow_sub_one_mul_geom_sum_eq_pow_sub_one_mul_geom_sum
2025-10-15 15:17:59 a38ceed
chore(NumberField): follow-up to #30536 (#30583)
Create the deprecated module files for the files moved in #30536
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/NumberTheory/Cyclotomic/Embeddings.lean
Added Mathlib/NumberTheory/Cyclotomic/PID.lean
Added Mathlib/NumberTheory/Cyclotomic/Rat.lean
Added Mathlib/NumberTheory/Cyclotomic/Three.lean
2025-10-15 15:17:57 ab46cf6
refactor: weaken HasPullbacks to HasPullback in MorphismProperty.OverAdjuction (#29810)
This PR replaces the global assumption of `HasPullback T` with the weaker assumption that pullbacks exist along the morphism only.
For the sake of readability I also moved the variable `(f : X -> Y)` into the statement of each theorem. As instructed in https://github.com/leanprover-community/mathlib4/pull/29795#discussion_r2363310388
- [ ] depends on: #29795
- [ ] depends on: #29812
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/MorphismProperty/OverAdjunction.lean
+/- def CategoryTheory.MorphismProperty.Over.map
+/- def CategoryTheory.MorphismProperty.Over.mapComp
+/- theorem CategoryTheory.MorphismProperty.Over.map_comp
+/- theorem CategoryTheory.MorphismProperty.Over.pullbackComp_left_fst_fst
+/- theorem CategoryTheory.MorphismProperty.Over.pullbackCongr_hom_app_left_fst
2025-10-15 15:17:54 192b6cc
feat(Tactic/Simproc): nested quantifiers in `existsAndEq` (#26843)
Generalize the `existsAndEq` simproc to nested existential quantifiers.
For example `∃ a, p a ∧ ∃ b, a = f b ∧ q b` now simplifies to `∃ b, p (f b) ∧ q b`.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Maps.lean
Modified Mathlib/Data/List/ProdSigma.lean
Modified Mathlib/Tactic/Simproc/ExistsAndEq.lean
+ inductive ExistsAndEq.GoTo
+ def ExistsAndEq.mkNestedExists
+ def ExistsAndEq.withExistsElimAlongPath
+ def ExistsAndEq.withNestedExistsElim
+ def ExistsAndEq.withNestedExistsIntro
Modified MathlibTest/Simproc/ExistsAndEq.lean
2025-10-15 14:27:44 83d59d3
feat(Combinatorics/Quiver): add congruence theorems for reflexive prefunctors (#30580)
An equality of reflexive prefunctors gives an equality on homs (`ReflPrefunctor.congr_hom`) and objects (`ReflPrefunctor.congr_obj`). Mirrors the existing theorems `Prefunctor.congr_hom` and `Prefunctor.congr_obj`.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Quiver/ReflQuiver.lean
+ theorem CategoryTheory.ReflPrefunctor.congr_hom
+ theorem CategoryTheory.ReflPrefunctor.congr_obj
2025-10-15 14:27:42 f4df4df
doc(CategoryTheory): fix typos (#30573)
Found with help from Codex.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/ConnectedComponents.lean
Modified Mathlib/CategoryTheory/EssentialImage.lean
Modified Mathlib/CategoryTheory/Join/Basic.lean
Modified Mathlib/CategoryTheory/Join/Final.lean
Modified Mathlib/CategoryTheory/Join/Opposites.lean
Modified Mathlib/CategoryTheory/Join/Pseudofunctor.lean
Modified Mathlib/CategoryTheory/Join/Sum.lean
Modified Mathlib/CategoryTheory/Sites/LocallyBijective.lean
Modified Mathlib/CategoryTheory/Sites/LocallyFullyFaithful.lean
Modified Mathlib/CategoryTheory/Sites/Sheaf.lean
2025-10-15 14:27:40 9cef17b
chore: tidy various files (#30442)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Subsemigroup/Defs.lean
Modified Mathlib/Analysis/Complex/SummableUniformlyOn.lean
Modified Mathlib/Analysis/SpecialFunctions/BinaryEntropy.lean
Modified Mathlib/Data/Nat/Factorization/Basic.lean
Modified Mathlib/Data/PFunctor/Univariate/M.lean
Modified Mathlib/GroupTheory/GroupAction/Jordan.lean
Modified Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean
Modified Mathlib/LinearAlgebra/Dual/Defs.lean
Modified Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
Modified Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean
Modified Mathlib/Probability/Distributions/Fernique.lean
Modified Mathlib/RingTheory/PowerSeries/Restricted.lean
Modified Mathlib/Topology/EMetricSpace/BoundedVariation.lean
2025-10-15 14:13:29 3294938
chore(NumberField): create directory `Cyclotomic` and move relevant files there (#30536)
Create the directory `NumberTheory/NumberField/Cyclotomic` and move there the files concerning cyclotomic fields over `ℚ`.
Deprecated modules files are added in #30583
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/NumberTheory/FLT/Three.lean
Renamed Mathlib/NumberTheory/Cyclotomic/Rat.lean to Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean
Renamed Mathlib/NumberTheory/Cyclotomic/Embeddings.lean to Mathlib/NumberTheory/NumberField/Cyclotomic/Embeddings.lean
Renamed Mathlib/NumberTheory/Cyclotomic/PID.lean to Mathlib/NumberTheory/NumberField/Cyclotomic/PID.lean
Renamed Mathlib/NumberTheory/Cyclotomic/Three.lean to Mathlib/NumberTheory/NumberField/Cyclotomic/Three.lean
Modified Mathlib/NumberTheory/NumberField/Ideal/Basic.lean
2025-10-15 13:28:35 111da03
chore: update Mathlib dependencies 2025-10-15 (#30578)
This PR updates the Mathlib dependencies.
[workflow run for this PR](https://github.com/leanprover-community/mathlib4/actions/runs/18528440265)
ESTIMATED CHANGES
Modified lake-manifest.json
2025-10-15 13:28:33 8a93fbd
feat(Analysis/SpecificLimits/Fibonacci): prove that the ratio of consecutive Fibonacci numbers tends to the golden ratio (#29759)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/SpecificLimits/Fibonacci.lean
+ theorem tendsto_fib_div_fib_succ_atTop
+ theorem tendsto_fib_succ_div_fib_atTop
2025-10-15 13:28:29 ea2b21a
feat(IntermediateField/LinearDisjoint): Two fields are linearly disjoint over `K` iff their intersection is `K` in the Galois case (#27273)
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/Galois/Basic.lean
+ theorem IsGalois.sup_right
Modified Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean
+ theorem IntermediateField.lift_inf
+ theorem IntermediateField.lift_sup
+ theorem IntermediateField.restrictScalars_eq_top_iff
Modified Mathlib/FieldTheory/IntermediateField/Basic.lean
+ theorem IntermediateField.lift_inj
+ theorem IntermediateField.restrictScalars_inj
Modified Mathlib/FieldTheory/LinearDisjoint.lean
+ theorem IntermediateField.LinearDisjoint.iff_inf_eq_bot
+ theorem IntermediateField.LinearDisjoint.of_inf_eq_bot
2025-10-15 12:44:51 6652a12
feat: `lineMap` is continuous in all arguments (#30568)
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/Affine.lean
+ theorem AffineMap.lineMap_continuous_uncurry
+ theorem Continuous.lineMap
+ theorem ContinuousAt.lineMap
+ theorem ContinuousOn.lineMap
+ theorem ContinuousWithinAt.lineMap
2025-10-15 12:44:49 5f6a1bb
chore(Algebra/Order/Ring/Unbundled/Rat): golf (#30282)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean
+/- theorem Rat.ofScientific_nonneg
2025-10-15 12:44:47 b1e43fa
feat: miscellaneous improvements to the differential geometry elaborators (#28032)
- Support inferring the model with corners on a `TangentBundle`.
- Support inferring the model with corners on the space `H` a manifold is modelled on.
- Correct the grammar in an error message.
- Extend the tracing to show a bit more information.
- Use backticks in all tracing (and other) error messages, per [zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Style.3A.20Backticks.20in.20messages.3F/with/544859886)
- Add some more tests, including one which is currently failing.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Manifold/Notation.lean
Modified MathlibTest/DifferentialGeometry/Notation.lean
2025-10-15 12:31:05 758089c
chore: remove ancient version test in cache (#30566)
ESTIMATED CHANGES
Modified Cache/Main.lean
2025-10-15 11:11:39 06bd309
feat: missing basic API for uniformly continuous functions (#30531)
ESTIMATED CHANGES
Modified Mathlib/Topology/UniformSpace/Basic.lean
+ theorem UniformContinuous.comp_uniformContinuousOn
+/- theorem UniformContinuous.continuous
+ theorem UniformContinuous.uniformContinuousOn
+ theorem UniformContinuousOn.comp
+ theorem UniformContinuousOn.mono
+ theorem uniformContinuous_swap
Modified Mathlib/Topology/UniformSpace/UniformConvergence.lean
2025-10-15 10:28:28 bfa61d1
chore: rename IrreducibleCloseds fields to match naming convention (#30550)
ESTIMATED CHANGES
Modified Mathlib/Topology/KrullDimension.lean
Modified Mathlib/Topology/Sets/Closeds.lean
+/- theorem TopologicalSpace.IrreducibleCloseds.isClosed
+/- theorem TopologicalSpace.IrreducibleCloseds.isIrreducible
2025-10-15 10:28:26 4cea329
chore(algebra): generalize mul_mem_smul_iff to rings (#30254)
Generalize mul_mem_smul_iff to rings instead of just commutative rings.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Operations.lean
+/- theorem Submodule.mul_mem_smul_iff
2025-10-15 10:06:17 ff11cd5
chore(CategoryTheory/Limits/Opposites): split the file Limits.Opposites (#30517)
This PR splits the file
- `Mathlib/CategoryTheory/Limits/Opposites.lean`
into
- `Mathlib/CategoryTheory/Limits/Opposites.lean`
- `Mathlib/CategoryTheory/Limits/Shapes/Opposites/`
This was suggested in a review of #30200.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Homology/ShortComplex/RightHomology.lean
Modified Mathlib/AlgebraicGeometry/Limits.lean
Modified Mathlib/CategoryTheory/Generator/Basic.lean
Modified Mathlib/CategoryTheory/Limits/Constructions/Filtered.lean
Modified Mathlib/CategoryTheory/Limits/FormalCoproducts.lean
Modified Mathlib/CategoryTheory/Limits/Opposites.lean
- def CategoryTheory.Limits.Cofan.op
- def CategoryTheory.Limits.CokernelCofork.IsColimit.ofπOp
- def CategoryTheory.Limits.CokernelCofork.IsColimit.ofπUnop
- def CategoryTheory.Limits.Fan.op
- def CategoryTheory.Limits.KernelFork.IsLimit.ofιOp
- def CategoryTheory.Limits.KernelFork.IsLimit.ofιUnop
- def CategoryTheory.Limits.PullbackCone.isLimitEquivIsColimitOp
- def CategoryTheory.Limits.PullbackCone.isLimitEquivIsColimitUnop
- def CategoryTheory.Limits.PullbackCone.op
- def CategoryTheory.Limits.PullbackCone.opUnop
- theorem CategoryTheory.Limits.PullbackCone.op_inl
- theorem CategoryTheory.Limits.PullbackCone.op_inr
- def CategoryTheory.Limits.PullbackCone.unop
- def CategoryTheory.Limits.PullbackCone.unopOp
- theorem CategoryTheory.Limits.PullbackCone.unop_inl
- theorem CategoryTheory.Limits.PullbackCone.unop_inr
- def CategoryTheory.Limits.PushoutCocone.isColimitEquivIsLimitOp
- def CategoryTheory.Limits.PushoutCocone.isColimitEquivIsLimitUnop
- def CategoryTheory.Limits.PushoutCocone.op
- def CategoryTheory.Limits.PushoutCocone.opUnop
- theorem CategoryTheory.Limits.PushoutCocone.op_fst
- theorem CategoryTheory.Limits.PushoutCocone.op_snd
- def CategoryTheory.Limits.PushoutCocone.unop
- def CategoryTheory.Limits.PushoutCocone.unopOp
- theorem CategoryTheory.Limits.PushoutCocone.unop_fst
- theorem CategoryTheory.Limits.PushoutCocone.unop_snd
- def CategoryTheory.Limits.cospanOp
- theorem CategoryTheory.Limits.desc_op_comp_opCoproductIsoProduct'_hom
- theorem CategoryTheory.Limits.desc_op_comp_opCoproductIsoProduct_hom
- theorem CategoryTheory.Limits.fst_opProdIsoCoprod_hom
- theorem CategoryTheory.Limits.hasCoproductsOfShape_of_opposite
- theorem CategoryTheory.Limits.hasCoproducts_of_opposite
- theorem CategoryTheory.Limits.hasFiniteCoproducts_of_opposite
- theorem CategoryTheory.Limits.hasFiniteProducts_of_opposite
- theorem CategoryTheory.Limits.hasProductsOfShape_of_opposite
- theorem CategoryTheory.Limits.hasProducts_of_opposite
- theorem CategoryTheory.Limits.has_cofiltered_limits_of_has_filtered_colimits_op
- theorem CategoryTheory.Limits.has_filtered_colimits_of_has_cofiltered_limits_op
- theorem CategoryTheory.Limits.inl_opProdIsoCoprod_inv
- theorem CategoryTheory.Limits.inr_opProdIsoCoprod_inv
- def CategoryTheory.Limits.opCoproductIsoProduct'
- theorem CategoryTheory.Limits.opCoproductIsoProduct'_comp_self
- theorem CategoryTheory.Limits.opCoproductIsoProduct'_hom_comp_proj
- theorem CategoryTheory.Limits.opCoproductIsoProduct'_inv_comp_inj
- def CategoryTheory.Limits.opCoproductIsoProduct
- theorem CategoryTheory.Limits.opCoproductIsoProduct_hom_comp_π
- theorem CategoryTheory.Limits.opCoproductIsoProduct_inv_comp_ι
- def CategoryTheory.Limits.opCospan
- def CategoryTheory.Limits.opProdIsoCoprod
- theorem CategoryTheory.Limits.opProdIsoCoprod_hom_fst
- theorem CategoryTheory.Limits.opProdIsoCoprod_hom_snd
- theorem CategoryTheory.Limits.opProdIsoCoprod_inv_inl
- theorem CategoryTheory.Limits.opProdIsoCoprod_inv_inr
- def CategoryTheory.Limits.opProductIsoCoproduct'
- theorem CategoryTheory.Limits.opProductIsoCoproduct'_comp_self
- theorem CategoryTheory.Limits.opProductIsoCoproduct'_inv_comp_lift
- def CategoryTheory.Limits.opProductIsoCoproduct
- theorem CategoryTheory.Limits.opProductIsoCoproduct_inv_comp_lift
- def CategoryTheory.Limits.opSpan
- theorem CategoryTheory.Limits.proj_comp_opProductIsoCoproduct'_hom
- theorem CategoryTheory.Limits.pullbackIsoUnopPushout_hom_inl
- theorem CategoryTheory.Limits.pullbackIsoUnopPushout_hom_inr
- theorem CategoryTheory.Limits.pullbackIsoUnopPushout_inv_fst
- theorem CategoryTheory.Limits.pullbackIsoUnopPushout_inv_snd
- theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inl_hom
- theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inr_hom
- theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inv_fst
- theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inv_snd
- theorem CategoryTheory.Limits.snd_opProdIsoCoprod_hom
- def CategoryTheory.Limits.spanOp
- theorem CategoryTheory.Limits.π_comp_opProductIsoCoproduct_hom
Modified Mathlib/CategoryTheory/Limits/Preserves/Shapes/Pullbacks.lean
Added Mathlib/CategoryTheory/Limits/Shapes/Opposites/Equalizers.lean
Added Mathlib/CategoryTheory/Limits/Shapes/Opposites/Filtered.lean
+ theorem CategoryTheory.Limits.has_cofiltered_limits_of_has_filtered_colimits_op
+ theorem CategoryTheory.Limits.has_filtered_colimits_of_has_cofiltered_limits_op
Added Mathlib/CategoryTheory/Limits/Shapes/Opposites/Kernels.lean
+ def CategoryTheory.Limits.CokernelCofork.IsColimit.ofπOp
+ def CategoryTheory.Limits.CokernelCofork.IsColimit.ofπUnop
+ def CategoryTheory.Limits.KernelFork.IsLimit.ofιOp
+ def CategoryTheory.Limits.KernelFork.IsLimit.ofιUnop
Added Mathlib/CategoryTheory/Limits/Shapes/Opposites/Products.lean
+ def CategoryTheory.Limits.Cofan.op
+ def CategoryTheory.Limits.Fan.op
+ theorem CategoryTheory.Limits.desc_op_comp_opCoproductIsoProduct'_hom
+ theorem CategoryTheory.Limits.desc_op_comp_opCoproductIsoProduct_hom
+ theorem CategoryTheory.Limits.fst_opProdIsoCoprod_hom
+ theorem CategoryTheory.Limits.hasCoproductsOfShape_of_opposite
+ theorem CategoryTheory.Limits.hasCoproducts_of_opposite
+ theorem CategoryTheory.Limits.hasFiniteCoproducts_of_opposite
+ theorem CategoryTheory.Limits.hasFiniteProducts_of_opposite
+ theorem CategoryTheory.Limits.hasProductsOfShape_of_opposite
+ theorem CategoryTheory.Limits.hasProducts_of_opposite
+ theorem CategoryTheory.Limits.inl_opProdIsoCoprod_inv
+ theorem CategoryTheory.Limits.inr_opProdIsoCoprod_inv
+ def CategoryTheory.Limits.opCoproductIsoProduct'
+ theorem CategoryTheory.Limits.opCoproductIsoProduct'_comp_self
+ theorem CategoryTheory.Limits.opCoproductIsoProduct'_hom_comp_proj
+ theorem CategoryTheory.Limits.opCoproductIsoProduct'_inv_comp_inj
+ def CategoryTheory.Limits.opCoproductIsoProduct
+ theorem CategoryTheory.Limits.opCoproductIsoProduct_hom_comp_π
+ theorem CategoryTheory.Limits.opCoproductIsoProduct_inv_comp_ι
+ def CategoryTheory.Limits.opProdIsoCoprod
+ theorem CategoryTheory.Limits.opProdIsoCoprod_hom_fst
+ theorem CategoryTheory.Limits.opProdIsoCoprod_hom_snd
+ theorem CategoryTheory.Limits.opProdIsoCoprod_inv_inl
+ theorem CategoryTheory.Limits.opProdIsoCoprod_inv_inr
+ def CategoryTheory.Limits.opProductIsoCoproduct'
+ theorem CategoryTheory.Limits.opProductIsoCoproduct'_comp_self
+ theorem CategoryTheory.Limits.opProductIsoCoproduct'_inv_comp_lift
+ def CategoryTheory.Limits.opProductIsoCoproduct
+ theorem CategoryTheory.Limits.opProductIsoCoproduct_inv_comp_lift
+ theorem CategoryTheory.Limits.proj_comp_opProductIsoCoproduct'_hom
+ theorem CategoryTheory.Limits.snd_opProdIsoCoprod_hom
+ theorem CategoryTheory.Limits.π_comp_opProductIsoCoproduct_hom
Added Mathlib/CategoryTheory/Limits/Shapes/Opposites/Pullbacks.lean
+ def CategoryTheory.Limits.PullbackCone.isLimitEquivIsColimitOp
+ def CategoryTheory.Limits.PullbackCone.isLimitEquivIsColimitUnop
+ def CategoryTheory.Limits.PullbackCone.op
+ def CategoryTheory.Limits.PullbackCone.opUnop
+ theorem CategoryTheory.Limits.PullbackCone.op_inl
+ theorem CategoryTheory.Limits.PullbackCone.op_inr
+ def CategoryTheory.Limits.PullbackCone.unop
+ def CategoryTheory.Limits.PullbackCone.unopOp
+ theorem CategoryTheory.Limits.PullbackCone.unop_inl
+ theorem CategoryTheory.Limits.PullbackCone.unop_inr
+ def CategoryTheory.Limits.PushoutCocone.isColimitEquivIsLimitOp
+ def CategoryTheory.Limits.PushoutCocone.isColimitEquivIsLimitUnop
+ def CategoryTheory.Limits.PushoutCocone.op
+ def CategoryTheory.Limits.PushoutCocone.opUnop
+ theorem CategoryTheory.Limits.PushoutCocone.op_fst
+ theorem CategoryTheory.Limits.PushoutCocone.op_snd
+ def CategoryTheory.Limits.PushoutCocone.unop
+ def CategoryTheory.Limits.PushoutCocone.unopOp
+ theorem CategoryTheory.Limits.PushoutCocone.unop_fst
+ theorem CategoryTheory.Limits.PushoutCocone.unop_snd
+ def CategoryTheory.Limits.cospanOp
+ def CategoryTheory.Limits.opCospan
+ def CategoryTheory.Limits.opSpan
+ theorem CategoryTheory.Limits.pullbackIsoUnopPushout_hom_inl
+ theorem CategoryTheory.Limits.pullbackIsoUnopPushout_hom_inr
+ theorem CategoryTheory.Limits.pullbackIsoUnopPushout_inv_fst
+ theorem CategoryTheory.Limits.pullbackIsoUnopPushout_inv_snd
+ theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inl_hom
+ theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inr_hom
+ theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inv_fst
+ theorem CategoryTheory.Limits.pushoutIsoUnopPullback_inv_snd
+ def CategoryTheory.Limits.spanOp
Modified Mathlib/CategoryTheory/Sites/Hypercover/Homotopy.lean
Modified Mathlib/CategoryTheory/Sites/Preserves.lean
Modified Mathlib/CategoryTheory/SmallObject/Iteration/Basic.lean
Modified Mathlib/Topology/Category/CompHausLike/SigmaComparison.lean
Modified Mathlib/Topology/Category/TopCat/Yoneda.lean
2025-10-15 10:06:15 c368e9e
chore(AlgebraicGeometry): autumn cleaning (#30426)
(everything is in the `AlgebraicGeometry` namespace; "x" means auto-generated)
### Important change
Added `instance {X Y : Scheme.{u}} : CoeFun (X ⟶ Y) (fun _ ↦ X → Y)`.
In particular, the preferred way to apply `f : X ⟶ Y` to `x : X` is `f x` instead of `f.base x`, and the lemma names should be updated accordingly. The pretty printer doesn't work yet but this will be added in a future PR.
### Renamed
`Scheme.Hom.image_le_image_of_le` -> `Scheme.Hom.image_mono`
`Scheme.Hom.image_preimage_eq_opensRange_inter` -> `Scheme.Hom.image_preimage_eq_opensRange_inf`
`Scheme.Hom.map_mem_image_iff` -> `Scheme.Hom.apply_mem_image_iff`
`Scheme.basic_open_isOpenImmersion` -> `Scheme.isOpenImmersion_SpecMap_localizationAway`
`IsOpenImmersion.to_iso` -> `IsOpenImmersion.isIso`
`IsOpenImmersion.of_stalk_iso` -> `IsOpenImmersion.of_isIso_stalkMap`
`IsOpenImmersion.iff_stalk_iso` -> `IsOpenImmersion.iff_isIso_stalkMap`
`isIso_iff_stalk_iso` -> `isIso_iff_isIso_stalkMap`
`IsOpenImmersion.range_pullback_snd_of_left` -> `IsOpenImmersion.range_pullbackSnd`
`IsOpenImmersion.opensRange_pullback_snd_of_left` -> `Scheme.Hom.opensRange_pullbackSnd`
`IsOpenImmersion.range_pullback_fst_of_right` -> `IsOpenImmersion.range_pullbackFst`
`IsOpenImmersion.opensRange_pullback_fst_of_right` -> `Scheme.Hom.opensRange_pullbackFst`
`IsOpenImmersion.map_ΓIso_hom` -> `IsOpenImmersion.app_ΓIso_hom`
`isBasis_affine_open` -> `Scheme.isBasis_affineOpens`
`Scheme.Hom.ι_base_apply` -> `Scheme.Hom.ι_apply`
`Scheme.map_basicOpen` -> `Scheme.Opens.ι_image_basicOpen`'
`Scheme.map_basicOpen_map` -> `Scheme.Opens.ι_image_basicOpen_topIso_inv`
`Scheme.Hom.le_preimage_resLE_iff` -> `Scheme.Hom.le_resLE_preimage_iff`
`Scheme.Hom.coe_resLE_base` -> `Scheme.Hom.coe_resLE_apply`
`Scheme.Hom.preimage_iSup_eq_top` -> `Scheme.Hom.iSup_preimage_eq_top`
`Scheme.Hom.preimage_le_preimage_of_le` -> `Scheme.Hom.preimage_mono`
`Scheme.preimage_comp` -> `Scheme.Hom.comp_preimage`
`Scheme.id.base` -> `Scheme.Hom.id_base`
`Scheme.id_app` -> `Scheme.Hom.id_app`
`Scheme.id_appTop` -> `Scheme.Hom.id_appTop`
`Scheme.comp_toLRSHom` -> `Scheme.Hom.comp_toLRSHom`
`Scheme.comp_toLRSHom_assoc` -> `Scheme.Hom.comp_toLRSHom_assoc`
`Scheme.comp_coeBase` -> `Scheme.Hom.comp_base`
`Scheme.comp_coeBase_assoc` -> `Scheme.Hom.comp_base_assoc`
`Scheme.comp_base` -> `Scheme.Hom.comp_base`
`Scheme.comp_base_assoc` -> `Scheme.Hom.comp_base_assoc`
`Scheme.comp_base_apply` -> `Scheme.Hom.comp_apply`
`Scheme.comp_app` -> `Scheme.Hom.comp_app`
`Scheme.comp_app_assoc` -> `Scheme.Hom.comp_app_assoc`
`Scheme.comp_appTop` -> `Scheme.Hom.comp_appTop`
`Scheme.comp_appTop_assoc` -> `Scheme.Hom.comp_appTop_assoc`
`Scheme.appLE_comp_appLE` -> `Scheme.Hom.appLE_comp_appLE`
`Scheme.comp_appLE` -> `Scheme.Hom.comp_appLE`
`Scheme.comp_appLE_assoc` -> `Scheme.Hom.comp_appLE_assoc`
`Scheme.congr_app` -> `Scheme.Hom.congr_app`
`Scheme.app_eq` -> `Scheme.Hom.app_eq`
`Scheme.eqToHom_c_app` -> `Scheme.Hom.eqToHom_app`
`Scheme.inv_app` -> `Scheme.Hom.inv_app`
`Scheme.inv_appTop` -> `Scheme.Hom.inv_appTop`
`Spec.map_base_apply` -> `Spec.map_apply`
`Scheme.iso_hom_base_inv_base` -> `Scheme.hom_base_inv_base`
`Scheme.iso_hom_base_inv_base_apply` -> `Scheme.hom_inv_apply`
`Scheme.iso_inv_base_hom_base` -> `Scheme.inv_base_hom_base`
`Scheme.iso_inv_base_hom_base_apply` -> `Scheme.inv_hom_apply`
`Scheme.stalkMap_id` -> `Scheme.Hom.stalkMap_id`
`Scheme.stalkMap_comp` -> `Scheme.Hom.stalkMap_comp`
`Scheme.stalkSpecializes_stalkMap` -> `Scheme.Hom.stalkSpecializes_stalkMap`
`Scheme.stalkSpecializes_stalkMap_assoc` -> `Scheme.Hom.stalkSpecializes_stalkMap_assoc`
`Scheme.stalkSpecializes_stalkMap_apply` -> `Scheme.Hom.stalkSpecializes_stalkMap_apply`
`Scheme.stalkMap_congr` -> `Scheme.Hom.stalkMap_congr`
`Scheme.stalkMap_congr_assoc` -> `Scheme.Hom.stalkMap_congr_assoc`
`Scheme.stalkMap_congr_hom` -> `Scheme.Hom.stalkMap_congr_hom`
`Scheme.stalkMap_congr_hom_assoc` -> `Scheme.Hom.stalkMap_congr_hom_assoc`
`Scheme.stalkMap_congr_point` -> `Scheme.Hom.stalkMap_congr_point`
`Scheme.stalkMap_congr_point_assoc` -> `Scheme.Hom.stalkMap_congr_point_assoc`
`Scheme.stalkMap_hom_inv` -> `Scheme.Hom.stalkMap_hom_inv`
`Scheme.stalkMap_hom_inv_assoc` -> `Scheme.Hom.stalkMap_hom_inv_assoc`
`Scheme.stalkMap_hom_inv_apply` -> `Scheme.Hom.stalkMap_hom_inv_apply`
`Scheme.stalkMap_inv_hom` -> `Scheme.Hom.stalkMap_inv_hom`
`Scheme.stalkMap_inv_hom_assoc` -> `Scheme.Hom.stalkMap_inv_hom_assoc`
`Scheme.stalkMap_inv_hom_apply` -> `Scheme.Hom.stalkMap_inv_hom_apply`
`Scheme.stalkMap_germ` -> `Scheme.Hom.germ_stalkMap`
`Scheme.stalkMap_germ_assoc` -> `Scheme.Hom.germ_stalkMap_assoc`
`Scheme.stalkMap_germ_apply` -> `Scheme.Hom.germ_stalkMap_apply`
`Scheme.arrowStalkMapIsoOfEq` -> `Scheme.Hom.arrowStalkMapIsoOfEq`
`quasiCompact_iff_spectral` -> `quasiCompact_iff_isSpectralMap`
`IsAffineOpen.Spec_map_appLE_fromSpec` -> `IsAffineOpen.SpecMap_appLE_fromSpec`
`IsAffineOpen.Spec_map_appLE_fromSpec_assoc` -> `IsAffineOpen.SpecMap_appLE_fromSpec_assoc`
`AffineSpace.map_Spec_map` -> `AffineSpace.map_SpecMap`
`Scheme.Pullback.Triplet.Spec_map_tensor_isPullback` -> `Scheme.Pullback.Triplet.isPullback_SpecMap_tensor`
`Scheme.Pullback.Triplet.Spec_map_tensorInl_fromSpecResidueField` -> `Scheme.Pullback.Triplet.SpecMap_tensorInl_fromSpecResidueField`
`Scheme.Spec_map_presheaf_map_eqToHom` -> `Scheme.SpecMap_presheaf_map_eqToHom`
`Scheme.Spec_map_residue_apply` -> `Scheme.SpecMap_residue_apply`
`Scheme.Hom.Spec_map_residueFieldMap_fromSpecResidueField` -> `Scheme.Hom.SpecMap_residueFieldMap_fromSpecResidueField`
`Scheme.Spec_map_stalkSpecializes_fromSpecStalk` -> `Scheme.SpecMap_stalkSpecializes_fromSpecStalk`
`Scheme.Spec_map_stalkSpecializes_fromSpecStalk_assoc` -> `Scheme.SpecMap_stalkSpecializes_fromSpecStalk_assoc`
`Scheme.Spec_map_stalkMap_fromSpecStalk` -> `Scheme.SpecMap_stalkMap_fromSpecStalk`
`Scheme.Spec_map_stalkMap_fromSpecStalk_assoc` -> `Scheme.SpecMap_stalkMap_fromSpecStalk_assoc`
`IsClosedImmersion.Spec_map_residue` -> `IsClosedImmersion.SpecMap_residue`
`Spec_map_localization_isIso` -> `isIso_SpecMap_stakMap_localization`
`stalkwise_Spec_map_iff` -> `stalkwise_SpecMap_iff`
`IsPreimmersion.Spec_map_iff` -> `IsPreimmersion.SpecMap_iff`
`IsPreimmersion.mk_Spec_map` -> `IsPreimmersion.mk_SpecMap`
`diagonal_Spec_map` -> `diagonal_SpecMap`
`isPullback_Spec_map_isPushout` -> `isPullback_SpecMap_of_isPushout`
`isPullback_Spec_map_pushout` -> `isPullback_SpecMap_pushout`
`IsOpenImmersion.forget_preservesOfLeft` -> x
`IsOpenImmersion.forget_preservesOfRight` -> x
`IsOpenImmersion.pullback_snd_of_left` -> x
`IsOpenImmersion.pullback_fst_of_right` -> x
`IsOpenImmersion.pullback_to_base` -> x
`IsOpenImmersion.forgetToTop_preserves_of_left` -> x
`IsOpenImmersion.forgetToTop_preserves_of_right` -> x
`fromGlued_stalk_iso` -> x
`fromGlued_open_map` -> `isOpenMap_fromGlued`
`fromGlued_isOpenEmbedding` -> `isOpenEmbedding_fromGlued`
`fromGlued_open_immersion` -> x
`IsAffineOpen.isoSpec_hom_base_apply` -> `IsAffineOpen.isoSpec_hom_apply`
`isoSpec_hom_base_apply` -> `isoSpec_hom_apply`
`Scheme.Pullback.Triplet.specTensorTo_base_fst` -> `Scheme.Pullback.Triplet.fst_SpecTensorTo_apply`
`Scheme.Pullback.Triplet.specTensorTo_base_snd` -> `Scheme.Pullback.Triplet.snd_SpecTensorTo_apply`
`Scheme.toSpecΓ_base` -> `Scheme.toSpecΓ_apply`
`basicOpen_union_eq_self_iff` -> `iSup_basicOpen_eq_self_iff`
`self_le_basicOpen_union_iff` -> `self_le_iSup_basicOpen_iff`
`Scheme.Opens.toSpecΓ_SpecMap_map` -> `Scheme.Opens.toSpecΓ_SpecMap_presheaf_map`
`Scheme.Opens.toSpecΓ_SpecMap_map_assoc` -> `Scheme.Opens.toSpecΓ_SpecMap_presheaf_map_assoc`
`isIso_iff_isOpenImmersion` -> `isIso_iff_isOpenImmersion_and_epi_base`
`isCompactOpen_iff_eq_finset_affine_union` -> `isCompact_and_isOpen_iff_finite_and_eq_biUnion_affineOpens`
`isCompactOpen_iff_eq_basicOpen_union` -> `isCompact_and_isOpen_iff_finite_and_eq_biUnion_basicOpen`
### Removed
`Scheme.presheaf_map_eqToHom_op`
`affinePreimage`
`instance : Inhabited Scheme`
`Γ_map_morphismRestrict`
`eqToHom_eq_homOfLE`
### Added
`instance {X Y : Scheme.{u}} : CoeFun (X ⟶ Y) (fun _ ↦ X → Y)`
`Scheme.Opens.toSpecΓ_preimage_basicOpen`
`Scheme.Hom.isSpectralMap`
`isCompact_iff_finite_and_eq_biUnion_affineOpens`
`Scheme.Hom.coe_image`
`Scheme.Hom.comp_image`
`Scheme.Hom.id_image`
`Scheme.Hom.inv_image`
`Scheme.Hom.mem_preimage`
`Scheme.Hom.coe_preimage`
`Scheme.Hom.preimage_sup`
`Scheme.Hom.preimage_inf`
`Scheme.Hom.preimage_top`
`Scheme.Hom.preimage_bot`
`Scheme.Hom.id_preimage`
`Scheme.Opens.mem_ι_image_iff`
`IsAffine.iff_of_isIso`
`SpecMap_ΓSpecIso_inv_toSpecΓ`
`SpecMap_ΓSpecIso_inv_toSpecΓ_assoc`
`toSpecΓ_SpecMap_ΓSpecIso_inv`
`toSpecΓ_SpecMap_ΓSpecIso_inv_assoc`
`Scheme.Opens.toSpecΓ_SpecMap_map_top`
`Scheme.Opens.toSpecΓ_SpecMap_map_top_assoc`
`Scheme.Opens.toSpecΓ_naturality`
`Scheme.Opens.toSpecΓ_naturality_assoc`
`IsAffineOpen.fromSpec_toSpecΓ`
`IsAffineOpen.fromSpec_toSpecΓ_assoc`
`IsAffineOpen.preimage_of_isOpenImmersion`
`Scheme.Hom.image_le_opensRange`
`Scheme.Hom.image_preimage_le`
`Scheme.Opens.mem_basicOpen_toScheme`
`Scheme.homOfLE_appLE`
`Scheme.opensRange_homOfLE`
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/AffineScheme.lean
+ theorem AlgebraicGeometry.IsAffine.iff_of_isIso
+ theorem AlgebraicGeometry.IsAffineOpen.SpecMap_appLE_fromSpec
- theorem AlgebraicGeometry.IsAffineOpen.Spec_map_appLE_fromSpec
- theorem AlgebraicGeometry.IsAffineOpen.basicOpen_union_eq_self_iff
+ theorem AlgebraicGeometry.IsAffineOpen.fromSpec_toSpecΓ
+ theorem AlgebraicGeometry.IsAffineOpen.iSup_basicOpen_eq_self_iff
+/- theorem AlgebraicGeometry.IsAffineOpen.isLocalization_stalk'
+ theorem AlgebraicGeometry.IsAffineOpen.isoSpec_hom_apply
- theorem AlgebraicGeometry.IsAffineOpen.isoSpec_hom_base_apply
+ theorem AlgebraicGeometry.IsAffineOpen.preimage_of_isOpenImmersion
- theorem AlgebraicGeometry.IsAffineOpen.self_le_basicOpen_union_iff
+ theorem AlgebraicGeometry.IsAffineOpen.self_le_iSup_basicOpen_iff
- theorem AlgebraicGeometry.Scheme.Opens.toSpecΓ_SpecMap_map
+ theorem AlgebraicGeometry.Scheme.Opens.toSpecΓ_SpecMap_presheaf_map
+ theorem AlgebraicGeometry.Scheme.Opens.toSpecΓ_SpecMap_presheaf_map_top
+ theorem AlgebraicGeometry.Scheme.Opens.toSpecΓ_naturality
+ theorem AlgebraicGeometry.Scheme.Opens.toSpecΓ_preimage_basicOpen
+/- theorem AlgebraicGeometry.Scheme.Opens.toSpecΓ_preimage_zeroLocus
+ theorem AlgebraicGeometry.Scheme.isBasis_affineOpens
- theorem AlgebraicGeometry.isBasis_affine_open
Modified Mathlib/AlgebraicGeometry/AffineSpace.lean
+/- theorem AlgebraicGeometry.AffineSpace.isOpenMap_over
+ theorem AlgebraicGeometry.AffineSpace.map_SpecMap
- theorem AlgebraicGeometry.AffineSpace.map_Spec_map
Modified Mathlib/AlgebraicGeometry/AffineTransitionLimit.lean
Modified Mathlib/AlgebraicGeometry/Cover/Directed.lean
Modified Mathlib/AlgebraicGeometry/Cover/MorphismProperty.lean
Modified Mathlib/AlgebraicGeometry/Cover/Open.lean
Modified Mathlib/AlgebraicGeometry/Cover/Sigma.lean
Modified Mathlib/AlgebraicGeometry/Fiber.lean
+/- def AlgebraicGeometry.Scheme.Hom.asFiber
+/- def AlgebraicGeometry.Scheme.Hom.fiber
+/- def AlgebraicGeometry.Scheme.Hom.fiberHomeo
+/- theorem AlgebraicGeometry.Scheme.Hom.fiberHomeo_apply
+/- def AlgebraicGeometry.Scheme.Hom.fiberToSpecResidueField
+/- theorem AlgebraicGeometry.Scheme.Hom.fiberToSpecResidueField_apply
+/- def AlgebraicGeometry.Scheme.Hom.fiberι
+/- theorem AlgebraicGeometry.Scheme.Hom.fiberι_asFiber
+/- theorem AlgebraicGeometry.Scheme.Hom.fiberι_fiberHomeo_symm
+/- theorem AlgebraicGeometry.Scheme.Hom.finite_preimage
+/- theorem AlgebraicGeometry.Scheme.Hom.range_fiberι
Modified Mathlib/AlgebraicGeometry/FunctionField.lean
+/- theorem AlgebraicGeometry.genericPoint_eq_of_isOpenImmersion
Modified Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean
+ theorem AlgebraicGeometry.Scheme.toSpecΓ_apply
- theorem AlgebraicGeometry.Scheme.toSpecΓ_base
+ theorem AlgebraicGeometry.SpecMap_ΓSpecIso_inv_toSpecΓ
+ theorem AlgebraicGeometry.toSpecΓ_SpecMap_ΓSpecIso_inv
Modified Mathlib/AlgebraicGeometry/Gluing.lean
+/- theorem AlgebraicGeometry.Scheme.Cover.fromGlued_injective
- theorem AlgebraicGeometry.Scheme.Cover.fromGlued_isOpenEmbedding
- theorem AlgebraicGeometry.Scheme.Cover.fromGlued_open_map
+ theorem AlgebraicGeometry.Scheme.Cover.isOpenEmbedding_fromGlued
+ theorem AlgebraicGeometry.Scheme.Cover.isOpenMap_fromGlued
+/- theorem AlgebraicGeometry.Scheme.GlueData.isOpen_iff
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Functorial.lean
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean
Modified Mathlib/AlgebraicGeometry/Limits.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Affine.lean
- def AlgebraicGeometry.affinePreimage
Modified Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean
+ theorem AlgebraicGeometry.stalkwise_SpecMap_iff
- theorem AlgebraicGeometry.stalkwise_Spec_map_iff
Modified Mathlib/AlgebraicGeometry/Morphisms/Descent.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FinitePresentation.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Flat.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FormallyUnramified.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Immersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Integral.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/IsIso.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/OpenImmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Preimmersion.lean
+ theorem AlgebraicGeometry.IsPreimmersion.SpecMap_iff
- theorem AlgebraicGeometry.IsPreimmersion.Spec_map_iff
+ theorem AlgebraicGeometry.IsPreimmersion.mk_SpecMap
- theorem AlgebraicGeometry.IsPreimmersion.mk_Spec_map
Modified Mathlib/AlgebraicGeometry/Morphisms/Proper.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean
+ theorem AlgebraicGeometry.Scheme.Hom.isSpectralMap
- theorem AlgebraicGeometry.isCompactOpen_iff_eq_basicOpen_union
- theorem AlgebraicGeometry.isCompactOpen_iff_eq_finset_affine_union
+ theorem AlgebraicGeometry.isCompact_and_isOpen_iff_finite_and_eq_biUnion_affineOpens
+ theorem AlgebraicGeometry.isCompact_and_isOpen_iff_finite_and_eq_biUnion_basicOpen
+ theorem AlgebraicGeometry.isCompact_iff_finite_and_eq_biUnion_affineOpens
- theorem AlgebraicGeometry.quasiCompact_iff_forall_affine
+ theorem AlgebraicGeometry.quasiCompact_iff_forall_isAffineOpen
+ theorem AlgebraicGeometry.quasiCompact_iff_isSpectralMap
- theorem AlgebraicGeometry.quasiCompact_iff_spectral
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Separated.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/SurjectiveOnStalks.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UnderlyingMap.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UniversallyInjective.lean
Modified Mathlib/AlgebraicGeometry/Noetherian.lean
Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean
+ theorem AlgebraicGeometry.IsOpenImmersion.app_ΓIso_hom
+/- theorem AlgebraicGeometry.IsOpenImmersion.comp_lift
+ theorem AlgebraicGeometry.IsOpenImmersion.iff_isIso_stalkMap
- theorem AlgebraicGeometry.IsOpenImmersion.iff_stalk_iso
+ theorem AlgebraicGeometry.IsOpenImmersion.isIso
+/- def AlgebraicGeometry.IsOpenImmersion.isoOfRangeEq
+/- def AlgebraicGeometry.IsOpenImmersion.isoRestrict
+/- def AlgebraicGeometry.IsOpenImmersion.lift
+/- theorem AlgebraicGeometry.IsOpenImmersion.lift_fac
+/- theorem AlgebraicGeometry.IsOpenImmersion.lift_uniq
+ theorem AlgebraicGeometry.IsOpenImmersion.of_isIso_stalkMap
- theorem AlgebraicGeometry.IsOpenImmersion.of_stalk_iso
- theorem AlgebraicGeometry.IsOpenImmersion.opensRange_pullback_fst_of_right
- theorem AlgebraicGeometry.IsOpenImmersion.opensRange_pullback_snd_of_left
+ theorem AlgebraicGeometry.IsOpenImmersion.range_pullbackFst
+ theorem AlgebraicGeometry.IsOpenImmersion.range_pullbackSnd
- theorem AlgebraicGeometry.IsOpenImmersion.range_pullback_fst_of_right
- theorem AlgebraicGeometry.IsOpenImmersion.range_pullback_snd_of_left
- theorem AlgebraicGeometry.IsOpenImmersion.to_iso
- theorem AlgebraicGeometry.IsOpenImmersion.ΓIso_hom_map
+ theorem AlgebraicGeometry.Scheme.Hom.apply_mem_image_iff
+ theorem AlgebraicGeometry.Scheme.Hom.coe_image
+ theorem AlgebraicGeometry.Scheme.Hom.comp_image
+ theorem AlgebraicGeometry.Scheme.Hom.id_image
- theorem AlgebraicGeometry.Scheme.Hom.image_le_image_of_le
+ theorem AlgebraicGeometry.Scheme.Hom.image_le_opensRange
+ theorem AlgebraicGeometry.Scheme.Hom.image_mono
+ theorem AlgebraicGeometry.Scheme.Hom.image_preimage_eq_opensRange_inf
- theorem AlgebraicGeometry.Scheme.Hom.image_preimage_eq_opensRange_inter
+ theorem AlgebraicGeometry.Scheme.Hom.image_preimage_le
+ theorem AlgebraicGeometry.Scheme.Hom.inv_image
+/- theorem AlgebraicGeometry.Scheme.Hom.isOpenEmbedding
- theorem AlgebraicGeometry.Scheme.Hom.map_mem_image_iff
+ def AlgebraicGeometry.Scheme.Hom.opensFunctor
+ theorem AlgebraicGeometry.Scheme.Hom.opensRange_pullbackFst
+ theorem AlgebraicGeometry.Scheme.Hom.opensRange_pullbackSnd
+/- theorem AlgebraicGeometry.Scheme.Hom.preimage_opensRange
+ theorem AlgebraicGeometry.isIso_iff_isIso_stalkMap
- theorem AlgebraicGeometry.isIso_iff_isOpenImmersion
+ theorem AlgebraicGeometry.isIso_iff_isOpenImmersion_and_epi_base
- theorem AlgebraicGeometry.isIso_iff_stalk_iso
Modified Mathlib/AlgebraicGeometry/PointsPi.lean
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean
Modified Mathlib/AlgebraicGeometry/Properties.lean
+/- theorem AlgebraicGeometry.isIntegral_of_isOpenImmersion
+/- theorem AlgebraicGeometry.isReduced_of_isOpenImmersion
Modified Mathlib/AlgebraicGeometry/PullbackCarrier.lean
+ theorem AlgebraicGeometry.Scheme.Pullback.Triplet.SpecMap_tensorInl_fromSpecResidueField
- theorem AlgebraicGeometry.Scheme.Pullback.Triplet.Spec_map_tensorInl_fromSpecResidueField
- theorem AlgebraicGeometry.Scheme.Pullback.Triplet.Spec_map_tensor_isPullback
+ theorem AlgebraicGeometry.Scheme.Pullback.Triplet.fst_SpecTensorTo_apply
+ theorem AlgebraicGeometry.Scheme.Pullback.Triplet.isPullback_SpecMap_tensor
+/- def AlgebraicGeometry.Scheme.Pullback.Triplet.mk'
+ theorem AlgebraicGeometry.Scheme.Pullback.Triplet.snd_SpecTensorTo_apply
- theorem AlgebraicGeometry.Scheme.Pullback.Triplet.specTensorTo_base_fst
- theorem AlgebraicGeometry.Scheme.Pullback.Triplet.specTensorTo_base_snd
+/- theorem AlgebraicGeometry.Scheme.Pullback.exists_preimage_pullback
+/- theorem AlgebraicGeometry.Scheme.Pullback.range_fst
+/- theorem AlgebraicGeometry.Scheme.Pullback.range_snd
Modified Mathlib/AlgebraicGeometry/Pullbacks.lean
+ theorem AlgebraicGeometry.diagonal_SpecMap
- theorem AlgebraicGeometry.diagonal_Spec_map
+ theorem AlgebraicGeometry.isPullback_SpecMap_of_isPushout
+ theorem AlgebraicGeometry.isPullback_SpecMap_pushout
- theorem AlgebraicGeometry.isPullback_Spec_map_isPushout
- theorem AlgebraicGeometry.isPullback_Spec_map_pushout
Modified Mathlib/AlgebraicGeometry/QuasiAffine.lean
Modified Mathlib/AlgebraicGeometry/RationalMap.lean
Modified Mathlib/AlgebraicGeometry/ResidueField.lean
+ theorem AlgebraicGeometry.Scheme.Hom.SpecMap_residueFieldMap_fromSpecResidueField
- theorem AlgebraicGeometry.Scheme.Hom.Spec_map_residueFieldMap_fromSpecResidueField
+/- def AlgebraicGeometry.Scheme.Hom.residueFieldMap
+ theorem AlgebraicGeometry.Scheme.SpecMap_residue_apply
- theorem AlgebraicGeometry.Scheme.Spec_map_residue_apply
+/- theorem AlgebraicGeometry.Scheme.evaluation_naturality
+/- theorem AlgebraicGeometry.Scheme.evaluation_naturality_apply
Modified Mathlib/AlgebraicGeometry/Restrict.lean
+ theorem AlgebraicGeometry.Scheme.Hom.coe_resLE_apply
- theorem AlgebraicGeometry.Scheme.Hom.coe_resLE_base
+/- def AlgebraicGeometry.Scheme.Hom.isoOpensRange
+/- theorem AlgebraicGeometry.Scheme.Hom.isoOpensRange_hom_ι
+/- theorem AlgebraicGeometry.Scheme.Hom.isoOpensRange_inv_comp
- theorem AlgebraicGeometry.Scheme.Hom.le_preimage_resLE_iff
+ theorem AlgebraicGeometry.Scheme.Hom.le_resLE_preimage_iff
+/- theorem AlgebraicGeometry.Scheme.Hom.preimageIso_hom_ι
+/- theorem AlgebraicGeometry.Scheme.Hom.preimageIso_inv_ι
+/- theorem AlgebraicGeometry.Scheme.Opens.isoOfLE_hom_ι
+/- theorem AlgebraicGeometry.Scheme.Opens.isoOfLE_inv_ι
+ theorem AlgebraicGeometry.Scheme.Opens.mem_basicOpen_toScheme
+ theorem AlgebraicGeometry.Scheme.Opens.mem_ι_image_iff
+/- theorem AlgebraicGeometry.Scheme.Opens.range_ι
+ theorem AlgebraicGeometry.Scheme.Opens.ι_apply
- theorem AlgebraicGeometry.Scheme.Opens.ι_base_apply
+ theorem AlgebraicGeometry.Scheme.Opens.ι_image_basicOpen'
+ theorem AlgebraicGeometry.Scheme.Opens.ι_image_basicOpen_topIso_inv
+ theorem AlgebraicGeometry.Scheme.homOfLE_appLE
- theorem AlgebraicGeometry.Scheme.map_basicOpen
- theorem AlgebraicGeometry.Scheme.map_basicOpen_map
+ theorem AlgebraicGeometry.Scheme.opensRange_homOfLE
- theorem AlgebraicGeometry.eqToHom_eq_homOfLE
+/- def AlgebraicGeometry.morphismRestrictOpensRange
- theorem AlgebraicGeometry.Γ_map_morphismRestrict
Modified Mathlib/AlgebraicGeometry/Scheme.lean
+ theorem AlgebraicGeometry.Scheme.Hom.Spec_closedPoint
+ theorem AlgebraicGeometry.Scheme.Hom.appLE_comp_appLE
+ theorem AlgebraicGeometry.Scheme.Hom.app_eq
+ theorem AlgebraicGeometry.Scheme.Hom.coe_preimage
+ theorem AlgebraicGeometry.Scheme.Hom.comp_app
+ theorem AlgebraicGeometry.Scheme.Hom.comp_appLE
+ theorem AlgebraicGeometry.Scheme.Hom.comp_appTop
+ theorem AlgebraicGeometry.Scheme.Hom.comp_apply
+ theorem AlgebraicGeometry.Scheme.Hom.comp_base
+ theorem AlgebraicGeometry.Scheme.Hom.comp_preimage
+ theorem AlgebraicGeometry.Scheme.Hom.comp_toLRSHom
+ theorem AlgebraicGeometry.Scheme.Hom.congr_app
+/- theorem AlgebraicGeometry.Scheme.Hom.continuous
+/- def AlgebraicGeometry.Scheme.Hom.copyBase
+/- theorem AlgebraicGeometry.Scheme.Hom.copyBase_eq
+ theorem AlgebraicGeometry.Scheme.Hom.eqToHom_app
+ theorem AlgebraicGeometry.Scheme.Hom.germ_stalkMap
+ theorem AlgebraicGeometry.Scheme.Hom.germ_stalkMap_apply
+/- theorem AlgebraicGeometry.Scheme.Hom.homeomorph_apply
+ theorem AlgebraicGeometry.Scheme.Hom.iSup_preimage_eq_top
+ theorem AlgebraicGeometry.Scheme.Hom.id_app
+ theorem AlgebraicGeometry.Scheme.Hom.id_appTop
+ theorem AlgebraicGeometry.Scheme.Hom.id_base
+ theorem AlgebraicGeometry.Scheme.Hom.id_preimage
+ theorem AlgebraicGeometry.Scheme.Hom.inv_app
+ theorem AlgebraicGeometry.Scheme.Hom.inv_appTop
+ theorem AlgebraicGeometry.Scheme.Hom.mem_preimage
+ theorem AlgebraicGeometry.Scheme.Hom.preimage_bot
- theorem AlgebraicGeometry.Scheme.Hom.preimage_iSup_eq_top
+ theorem AlgebraicGeometry.Scheme.Hom.preimage_inf
- theorem AlgebraicGeometry.Scheme.Hom.preimage_le_preimage_of_le
+ theorem AlgebraicGeometry.Scheme.Hom.preimage_mono
+ theorem AlgebraicGeometry.Scheme.Hom.preimage_sup
+ theorem AlgebraicGeometry.Scheme.Hom.preimage_top
+/- def AlgebraicGeometry.Scheme.Hom.stalkMap
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_comp
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_congr
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_congr_hom
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_congr_point
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_hom_inv
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_hom_inv_apply
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_id
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_inv_hom
+ theorem AlgebraicGeometry.Scheme.Hom.stalkMap_inv_hom_apply
+ theorem AlgebraicGeometry.Scheme.Hom.stalkSpecializes_stalkMap
+ theorem AlgebraicGeometry.Scheme.Hom.stalkSpecializes_stalkMap_apply
+ theorem AlgebraicGeometry.Scheme.SpecMap_presheaf_map_eqToHom
- theorem AlgebraicGeometry.Scheme.Spec_map_presheaf_map_eqToHom
- theorem AlgebraicGeometry.Scheme.appLE_comp_appLE
- theorem AlgebraicGeometry.Scheme.app_eq
- theorem AlgebraicGeometry.Scheme.comp_app
- theorem AlgebraicGeometry.Scheme.comp_appLE
- theorem AlgebraicGeometry.Scheme.comp_appTop
- theorem AlgebraicGeometry.Scheme.comp_base
- theorem AlgebraicGeometry.Scheme.comp_base_apply
- theorem AlgebraicGeometry.Scheme.comp_coeBase
- theorem AlgebraicGeometry.Scheme.comp_toLRSHom
- theorem AlgebraicGeometry.Scheme.congr_app
- theorem AlgebraicGeometry.Scheme.eqToHom_c_app
+/- theorem AlgebraicGeometry.Scheme.forget_map
+ theorem AlgebraicGeometry.Scheme.hom_base_inv_base
+ theorem AlgebraicGeometry.Scheme.hom_inv_apply
- theorem AlgebraicGeometry.Scheme.id.base
- theorem AlgebraicGeometry.Scheme.id_app
- theorem AlgebraicGeometry.Scheme.id_appTop
- theorem AlgebraicGeometry.Scheme.inv_app
- theorem AlgebraicGeometry.Scheme.inv_appTop
+ theorem AlgebraicGeometry.Scheme.inv_base_hom_base
+ theorem AlgebraicGeometry.Scheme.inv_hom_apply
- theorem AlgebraicGeometry.Scheme.iso_hom_base_inv_base
- theorem AlgebraicGeometry.Scheme.iso_hom_base_inv_base_apply
- theorem AlgebraicGeometry.Scheme.iso_inv_base_hom_base
- theorem AlgebraicGeometry.Scheme.iso_inv_base_hom_base_apply
- theorem AlgebraicGeometry.Scheme.preimage_comp
- theorem AlgebraicGeometry.Scheme.presheaf_map_eqToHom_op
- theorem AlgebraicGeometry.Scheme.stalkMap_comp
- theorem AlgebraicGeometry.Scheme.stalkMap_congr
- theorem AlgebraicGeometry.Scheme.stalkMap_congr_hom
- theorem AlgebraicGeometry.Scheme.stalkMap_congr_point
- theorem AlgebraicGeometry.Scheme.stalkMap_germ
- theorem AlgebraicGeometry.Scheme.stalkMap_germ_apply
- theorem AlgebraicGeometry.Scheme.stalkMap_hom_inv
- theorem AlgebraicGeometry.Scheme.stalkMap_hom_inv_apply
- theorem AlgebraicGeometry.Scheme.stalkMap_id
- theorem AlgebraicGeometry.Scheme.stalkMap_inv_hom
- theorem AlgebraicGeometry.Scheme.stalkMap_inv_hom_apply
- theorem AlgebraicGeometry.Scheme.stalkSpecializes_stalkMap
- theorem AlgebraicGeometry.Scheme.stalkSpecializes_stalkMap_apply
+ theorem AlgebraicGeometry.Spec.map_apply
- theorem AlgebraicGeometry.Spec.map_base_apply
+ theorem AlgebraicGeometry.SpecMap_preimage_basicOpen
- theorem AlgebraicGeometry.Spec_closedPoint
Modified Mathlib/AlgebraicGeometry/Sites/MorphismProperty.lean
Modified Mathlib/AlgebraicGeometry/Sites/SmallAffineZariski.lean
Modified Mathlib/AlgebraicGeometry/Spec.lean
- theorem AlgebraicGeometry.Spec_map_localization_isIso
+ theorem AlgebraicGeometry.isIso_SpecMap_stakMap_localization
Modified Mathlib/AlgebraicGeometry/SpreadingOut.lean
Modified Mathlib/AlgebraicGeometry/Stalk.lean
+ theorem AlgebraicGeometry.Scheme.SpecMap_stalkMap_fromSpecStalk
+ theorem AlgebraicGeometry.Scheme.SpecMap_stalkSpecializes_fromSpecStalk
- theorem AlgebraicGeometry.Scheme.Spec_map_stalkMap_fromSpecStalk
- theorem AlgebraicGeometry.Scheme.Spec_map_stalkSpecializes_fromSpecStalk
+/- theorem AlgebraicGeometry.Scheme.germ_stalkClosedPointTo
Modified Mathlib/AlgebraicGeometry/ValuativeCriterion.lean
2025-10-15 09:16:44 9d6530c
chore(*): use `gcongr`/`grw` (#30561)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean
Modified Mathlib/Analysis/Distribution/FourierSchwartz.lean
Modified Mathlib/Analysis/Normed/Field/Ultra.lean
Modified Mathlib/Analysis/Normed/Operator/BoundedLinearMaps.lean
Modified Mathlib/Analysis/Normed/Unbundled/RingSeminorm.lean
Modified Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean
Modified Mathlib/LinearAlgebra/Matrix/DotProduct.lean
Modified Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean
Modified Mathlib/MeasureTheory/Function/LpSpace/Indicator.lean
Modified Mathlib/MeasureTheory/Integral/FinMeasAdditive.lean
Modified Mathlib/MeasureTheory/Measure/AddContent.lean
Modified Mathlib/ModelTheory/Skolem.lean
Modified Mathlib/Probability/StrongLaw.lean
Modified Mathlib/SetTheory/Cardinal/Order.lean
2025-10-15 08:28:01 3088711
feat: `{x | p x}⁻¹ = {x | p x⁻¹}` (#30487)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean
+ theorem Finset.inv_filter
+ theorem Finset.inv_filter_univ
Modified Mathlib/Algebra/Group/Pointwise/Set/Basic.lean
+ theorem Set.inv_setOf
2025-10-15 07:38:47 24899e1
doc(CategoryTheory): fix typos (#30558)
Found with the help of Codex.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Abelian/Basic.lean
Modified Mathlib/CategoryTheory/Abelian/FreydMitchell.lean
Modified Mathlib/CategoryTheory/Action.lean
Modified Mathlib/CategoryTheory/Adjunction/Basic.lean
Modified Mathlib/CategoryTheory/Bicategory/EqToHom.lean
Modified Mathlib/CategoryTheory/Bicategory/Functor/StrictlyUnitary.lean
Modified Mathlib/CategoryTheory/Bicategory/Kan/Adjunction.lean
Modified Mathlib/CategoryTheory/CodiscreteCategory.lean
Modified Mathlib/CategoryTheory/CofilteredSystem.lean
Modified Mathlib/CategoryTheory/CommSq.lean
Modified Mathlib/CategoryTheory/Functor/Derived/PointwiseRightDerived.lean
Modified Mathlib/CategoryTheory/Join/Basic.lean
Modified Mathlib/CategoryTheory/Limits/ConcreteCategory/Basic.lean
Modified Mathlib/CategoryTheory/Limits/Constructions/Over/Products.lean
Modified Mathlib/CategoryTheory/Limits/Final.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean
Modified Mathlib/CategoryTheory/Limits/Sifted.lean
Modified Mathlib/CategoryTheory/Localization/Resolution.lean
Modified Mathlib/CategoryTheory/Monoidal/Bimon_.lean
Modified Mathlib/CategoryTheory/Monoidal/Braided/Multifunctor.lean
Modified Mathlib/CategoryTheory/Monoidal/Category.lean
Modified Mathlib/CategoryTheory/Monoidal/DayConvolution.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Local.lean
Modified Mathlib/CategoryTheory/Products/Basic.lean
Modified Mathlib/CategoryTheory/Shift/Adjunction.lean
Modified Mathlib/CategoryTheory/Sites/MayerVietorisSquare.lean
Modified Mathlib/CategoryTheory/SmallObject/Basic.lean
Modified Mathlib/CategoryTheory/Sums/Basic.lean
2025-10-15 07:38:45 385a951
chore(Probability/Distributions/Gaussian): golf `integrable_exp_sq_of_conv_neg` using `grind` (#30556)
ESTIMATED CHANGES
Modified Mathlib/Probability/Distributions/Gaussian/Fernique.lean
2025-10-15 07:25:27 1a640d9
feat(Homotopy/Path): add missing lemmas (#30552)
- Add `@[simps]` to `ContinuousMap.Homotopy.evalAt`.
- Add `ContinuousMap.Homotopy.pathExtend_evalAt`.
- Reuse section `variable`s.
ESTIMATED CHANGES
Modified Mathlib/Topology/Homotopy/Path.lean
+/- def ContinuousMap.Homotopy.evalAt
+ theorem ContinuousMap.Homotopy.pathExtend_evalAt
2025-10-15 07:25:25 f7e96f4
chore: fix the lemma name `condIndepFun_iff_condDistrib_prod_ae_eq_prodMkRight` (#30545)
There is a `prodMkRight` in the statement, not a `prodMkLeft`.
ESTIMATED CHANGES
Modified Mathlib/Probability/Independence/Conditional.lean
- theorem ProbabilityTheory.condIndepFun_iff_condDistrib_prod_ae_eq_prodMkLeft
+ theorem ProbabilityTheory.condIndepFun_iff_condDistrib_prod_ae_eq_prodMkRight
2025-10-15 06:33:18 4c1ded9
chore: drop Nat.Basic import from List.Basic (#30555)
A slight import win for a minimal change.
ESTIMATED CHANGES
Modified Mathlib/Data/List/Basic.lean
+/- theorem List.getElem?_length
Modified Mathlib/Data/List/Infix.lean
Modified Mathlib/Data/List/InsertIdx.lean
Modified Mathlib/Data/List/Lex.lean
Modified Mathlib/Data/List/Nodup.lean
Modified Mathlib/Data/List/Zip.lean
Modified Mathlib/Data/Multiset/Defs.lean
2025-10-15 06:00:01 60c559f
feat(GeneralLinearGroup/FinTwo): the addChar sending x to [1,x;0,1] (#30475)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/AddChar.lean
Modified Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/FinTwo.lean
+ theorem Matrix.GeneralLinearGroup.injective_upperRightHom
+ theorem Matrix.GeneralLinearGroup.isParabolic_iff_of_upperTriangular
+ theorem Matrix.GeneralLinearGroup.isParabolic_iff_of_upperTriangular_of_det
+ def Matrix.GeneralLinearGroup.upperRightHom
+ theorem Matrix.isParabolic_iff_of_upperTriangular
Modified Mathlib/NumberTheory/ModularForms/Cusps.lean
+ theorem Subgroup.HasDetPlusMinusOne.isParabolic_iff_of_upperTriangular
Modified Mathlib/Topology/Instances/Matrix.lean
+ theorem Matrix.GeneralLinearGroup.continuous_upperRightHom
2025-10-15 01:27:18 a0187b2
chore: update Mathlib dependencies 2025-10-15 (#30565)
This PR updates the Mathlib dependencies.
[workflow run for this PR](https://github.com/leanprover-community/mathlib4/actions/runs/18513921009)
ESTIMATED CHANGES
Modified lake-manifest.json
2025-10-14 23:42:35 4c492e5
feat: the unitary group in a C⋆-algebra is locally path connected (#30311)
When `A` is a unital C⋆-algebra and `u : unitary A` is a unitary element whose distance to `1` is
less that `2`, the spectrum of `u` is contained in the slit plane, so the principal branch of the
logarithm is continuous on the spectrum of `u` (or equivalently, `Complex.arg` is continuous on the
spectrum). The continuous functional calculus can then be used to define a selfadjoint element `x`
such that `u = exp (I • x)`. Moreover, there is a relatively nice relationship between the norm of
`x` and the norm of `u - 1`, namely `‖u - 1‖ ^ 2 = 2 * (1 - cos ‖x‖)`. In fact, these maps `u ↦ x`
and `x ↦ u` establish a partial homeomorphism between `ball (1 : unitary A) 2` and
`ball (0 : selfAdjoint A) π`.
The map `t ↦ exp (t • (I • x))` constitutes a path from `1` to `u`, showing that unitary elements
sufficiently close (i.e., within a distance `2`) to `1 : unitary A` are path connected to `1`.
This property can be translated around the unitary group to show that if `u v : unitary A` are
unitary elements with `‖u - v‖ < 2`, then there is a path joining them. In fact, this path has the
property that it lies within `closedBall u ‖u - v‖`, and consequently any ball of radius `δ < 2` in
`unitary A` is path connected. Therefore, the unitary group is locally path connected.
Finally, we provide the standard characterization of the path component of `1 : unitary A` as finite
products of exponential unitaries.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/CStarAlgebra/Spectrum.lean
+ theorem spectrum.norm_eq_one_of_unitary
Added Mathlib/Analysis/CStarAlgebra/Unitary/Connected.lean
+ theorem IsSelfAdjoint.cfc_arg
+ theorem argSelfAdjoint_expUnitary
+ theorem expUnitary_argSelfAdjoint
+ theorem selfAdjoint.joined_one_expUnitary
+ theorem selfAdjoint.norm_sq_expUnitary_sub_one
+ theorem unitary.continuousOn_argSelfAdjoint
+ theorem unitary.expUnitary_eq_mul_inv
+ theorem unitary.isPathConnected_ball
+ theorem unitary.joined
+ theorem unitary.mem_pathComponentOne_iff
+ theorem unitary.norm_argSelfAdjoint
+ theorem unitary.norm_argSelfAdjoint_le_pi
+ theorem unitary.norm_expUnitary_smul_argSelfAdjoint_sub_one_le
+ theorem unitary.norm_sub_eq
+ theorem unitary.norm_sub_one_lt_two_iff
+ theorem unitary.norm_sub_one_sq_eq
+ theorem unitary.spectrum_subset_slitPlane_iff_norm_lt_two
+ theorem unitary.two_mul_one_sub_cos_norm_argSelfAdjoint
+ theorem unitary.two_mul_one_sub_le_norm_sub_one_sq
2025-10-14 23:03:52 8a1a1e3
refactor(Analysis/LocallyConvex/AbsConvex): Redefine AbsConvex to use a single ring of scalars (#29342)
Currently the definition of Absolutely Convex in Mathlib is a little unexpected:
```
def AbsConvex (s : Set E) : Prop := Balanced 𝕜 s ∧ Convex ℝ s
```
At the time this definition was formulated, Mathlib's definition of `Convex` required the scalars to be an `OrderedSemiring` whereas the definition of `Balanced` required the scalars to be a `SeminormedRing`. Mathlib didn't have a concept of a semi-normed ordered ring, so a set was defined as `AbsConvex` if it is balanced over a `SeminormedRing` `𝕜` and convex over `ℝ`.
Recently the requirements for the definition of `Convex` have been relaxed (#24392, #20595) so it is now possible to use a single scalar ring in common with the literature.
Previous discussion:
- https://github.com/leanprover-community/mathlib4/pull/17029#discussion_r1782249323
- https://github.com/leanprover-community/mathlib4/pull/26345#discussion_r2287535746
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Basic.lean
+/- theorem Convex.is_linear_preimage
+/- theorem Convex.linear_preimage
Modified Mathlib/Analysis/LocallyConvex/AbsConvex.lean
+/- def AbsConvex
+/- theorem absConvexHull_eq_convexHull_balancedHull
+/- theorem convex_absConvexHull
+/- theorem nhds_hasBasis_absConvex_open
+/- theorem zero_mem_absConvexHull
Modified Mathlib/Analysis/LocallyConvex/AbsConvexOpen.lean
+/- theorem AbsConvexOpenSets.coe_convex
Modified Mathlib/Analysis/LocallyConvex/Basic.lean
Modified Mathlib/Analysis/Normed/Module/Dual.lean
2025-10-14 22:19:40 37ee77c
feat(Topology/Algebra): discrete iff finite index subgroup discrete (#29743)
Show that if G is a topological group and H is a finite-index subgroup, then H is discrete iff G is. As application, show that arithmetic subgroups of GL(2, R), which are by definition those commensurable with SL(2, Z), are discrete.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Data/Set/Constructions.lean
+ theorem Set.biUnion_empty_finset
Modified Mathlib/NumberTheory/ModularForms/ArithmeticSubgroups.lean
Modified Mathlib/Topology/Algebra/ContinuousMonoidHom.lean
+ def ContinuousMulEquiv.Simps.symm_apply
+ theorem MulEquiv.symm_toContinuousMulEquiv
+ def MulEquiv.toContinuousMulEquiv
+ theorem MulEquiv.toHomeomorph_toContinuousMulEquiv
+ theorem MulEquiv.toMulEquiv_toContinuousMulEquiv
Added Mathlib/Topology/Algebra/IsUniformGroup/DiscreteSubgroup.lean
+ theorem Subgroup.Commensurable.discreteTopology_iff
+ theorem Subgroup.discreteTopology_iff_of_finiteIndex
+ theorem Subgroup.discreteTopology_iff_of_isFiniteRelIndex
+ def Subgroup.subgroupOfContinuousMulEquivOfLe
+ theorem Subgroup.subgroupOfContinuousMulEquivOfLe_symm_apply
+ theorem Subgroup.subgroupOfContinuousMulEquivOfLe_toMulEquiv
Modified Mathlib/Topology/Constructions.lean
- theorem discreteTopology_subtype_iff
Modified Mathlib/Topology/DiscreteSubset.lean
+ theorem compl_mem_codiscrete_iff
+ theorem discreteTopology_biUnion_finset
+ theorem discreteTopology_iUnion_fintype
+ theorem discreteTopology_subtype_iff'
+ theorem discreteTopology_subtype_iff
+ theorem discreteTopology_union
Modified Mathlib/Topology/Homeomorph/Defs.lean
+ theorem Equiv.symm_toHomeomorph
- theorem Equiv.toHomeomorph_symm
2025-10-14 22:19:38 1f0a5ce
feat(RingTheory/Cotangent): cotangent of composition with localization away from an element (#28699)
Let `R → S → T` be algebras such that `T` is the localization of `S` away from one
element, where `S` is generated over `R` by `P : R[X] → S` with kernel `I` and
`Q : S[Y] → T` is the canonical `S`-presentation of `T` with kernel `K`.
Denote by `J` the kernel of the composition `R[X,Y] → T`.
We deduce `J/J² ≃ₗ[T] T ⊗[S] (I/I²) × K/K²` from the Jacobi Zariski sequence.
From Pi1.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Extension/Cotangent/LocalizationAway.lean
+ theorem Algebra.Generators.cotangentCompAwaySec_apply
+ def Algebra.Generators.cotangentCompLocalizationAwayEquiv
+ theorem Algebra.Generators.cotangentCompLocalizationAwayEquiv_symm_comp_inl
+ theorem Algebra.Generators.cotangentCompLocalizationAwayEquiv_symm_inl
+ theorem Algebra.Generators.cotangentCompLocalizationAwayEquiv_symm_inr
+ theorem Algebra.Generators.map_comp_cotangentCompAwaySec
+ theorem Algebra.Generators.snd_comp_cotangentCompLocalizationAwayEquiv
+ theorem Algebra.Generators.snd_cotangentCompLocalizationAwayEquiv
Modified Mathlib/RingTheory/Extension/Generators.lean
+ theorem Algebra.Generators.Hom.algebraMap_toAlgHom'
Modified Mathlib/RingTheory/Extension/Presentation/Basic.lean
+ theorem Algebra.Generators.C_mul_X_sub_one_mem_ker
Modified Mathlib/RingTheory/Smooth/StandardSmoothCotangent.lean
+ def Algebra.Generators.basisCotangentAway
+ theorem Algebra.Generators.basisCotangentAway_apply
+ theorem Algebra.Generators.cMulXSubOneCotangent_eq
+ theorem Algebra.SubmersivePresentation.basisCotangent_localizationAway_apply
2025-10-14 21:17:40 9c4daf9
chore: remove linters from mathlibStandardSet which don't work downstream (#30541)
See discussion at [#general > weak.linter.mathlibStandardSet and lint-style-action @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/weak.2Elinter.2EmathlibStandardSet.20and.20lint-style-action/near/544726745)
ESTIMATED CHANGES
Modified Mathlib/Init.lean
Modified Mathlib/Tactic/Linter/TextBased.lean
Modified lakefile.lean
2025-10-14 19:39:17 1af1826
chore(LinearAlgebra): golf `of_mem_specialOrthogonalGroup_fin_two_iff` using `grind` (#30516)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/UnitaryGroup.lean
2025-10-14 19:24:45 bab341f
feat(RingTheory/DividedPowers/Basic): add divided power structure on pZp (#26956)
We construct a divided power structure on the ideal `(p) ⊆ ℤ_[p]`, given by the family of maps `fun n x ↦ x^n / n!`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/NumberTheory/Padics/PadicIntegers.lean
+ theorem PadicInt.coe_sum
Modified Mathlib/NumberTheory/Padics/PadicVal/Basic.lean
+ theorem padicValNat_factorial_le
+ theorem padicValNat_factorial_lt_of_ne_zero
+ theorem sub_one_mul_padicValNat_factorial_lt_of_ne_zero
Added Mathlib/RingTheory/DividedPowers/Padic.lean
+ theorem PadicInt.coe_dpow_eq
2025-10-14 16:26:30 6e58d23
feat(Tactic/Order): frontend for `order` (#27066)
* Support `order [h1, h2]` and `order only [h1, h2]` syntax.
* Split conjunctions while extracting facts from the context. E.g. hypotheses in the form `A ∧ B` are converted into two facts `A` and `B`.
* Similarly, extract facts from existential quantifiers in the hypotheses.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Tactic/Linarith/Frontend.lean
- def Mathlib.Tactic.Linarith.elabLinarithArg
Modified Mathlib/Tactic/Order.lean
+ def Mathlib.Tactic.Order.orderCore
Modified Mathlib/Tactic/Order/CollectFacts.lean
+/- def Mathlib.Tactic.Order.collectFacts
- def Mathlib.Tactic.Order.collectFactsImp
Added Mathlib/Util/ElabWithoutMVars.lean
+ def elabTermWithoutNewMVars
Modified MathlibTest/order.lean
2025-10-14 15:44:19 8c31e48
feat(Algebra/Module/LinearMap/Defs): add lemmas (#30546)
Co-authored by: @AntoineChambert-Loir
ESTIMATED CHANGES
Modified Mathlib/Algebra/Module/LinearMap/Defs.lean
+ theorem LinearMap.restrictScalars_id
+ theorem LinearMap.restrictScalars_self
2025-10-14 15:30:42 4e6ecfb
chore(Algebra/Order/Module/PositiveLinearMap): generalize `OrderHomClass.ofLinear` (#29626)
Generalize `OrderHomClass.ofLinear` from linear maps to additive group homomorphisms.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Module/PositiveLinearMap.lean
- theorem OrderHomClass.ofLinear
+ theorem OrderHomClass.of_addMonoidHom
Modified Mathlib/Analysis/CStarAlgebra/CompletelyPositiveMap.lean
2025-10-14 14:50:25 946cb31
chore: notation for (conditional) independence (#30419)
Add notations:
- `X ⟂ᵢ[μ] Y` for independence of X and Y. Simplified to `X ⟂ᵢ Y` if the measure is `volume`.
- `X ⟂ᵢ[Z, hZ; μ] Y` for independence of X and Y given Z. Simplified to `X ⟂ᵢ[Z, hZ] Y` if the measure is `volume`.
I don't use a double uptack because neither my browser nor my vscode font have that character (U+2AEB). Instead I have chosen a \perp with an i for indepedence.
ESTIMATED CHANGES
Modified Mathlib/Probability/HasLaw.lean
Modified Mathlib/Probability/IdentDistrib.lean
Modified Mathlib/Probability/Independence/Basic.lean
Modified Mathlib/Probability/Independence/CharacteristicFunction.lean
Modified Mathlib/Probability/Independence/Conditional.lean
Modified Mathlib/Probability/Independence/Integrable.lean
Modified Mathlib/Probability/Independence/Integration.lean
Modified Mathlib/Probability/Moments/Basic.lean
+/- theorem ProbabilityTheory.IndepFun.cgf_add
+/- theorem ProbabilityTheory.IndepFun.exp_mul
+/- theorem ProbabilityTheory.IndepFun.integrable_exp_mul_add
+/- theorem ProbabilityTheory.IndepFun.mgf_add'
+/- theorem ProbabilityTheory.IndepFun.mgf_add
Modified Mathlib/Probability/Moments/Covariance.lean
+/- theorem ProbabilityTheory.IndepFun.covariance_eq_zero
Modified Mathlib/Probability/Moments/SubGaussian.lean
Modified Mathlib/Probability/Moments/Variance.lean
Modified Mathlib/Probability/StrongLaw.lean
2025-10-14 14:50:23 2f41e4a
feat(Algebra/Polynomial): Descartes' Rule of signs (#26331)
This PR continues the work from #23681.
Original PR: https://github.com/leanprover-community/mathlib4/pull/23681
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Polynomial/CoeffList.lean
Modified Mathlib/Algebra/Polynomial/Degree/Operations.lean
+ theorem Polynomial.coeff_X_sub_C_mul
Modified Mathlib/Algebra/Polynomial/EraseLead.lean
+ theorem Polynomial.eraseLead_mul_eq_mul_eraseLead_of_nextCoeff_zero
Added Mathlib/Algebra/Polynomial/RuleOfSigns.lean
+ theorem Polynomial.roots_countP_pos_le_signVariations
+ def Polynomial.signVariations
+ theorem Polynomial.signVariations_C_mul
+ theorem Polynomial.signVariations_X_sub_C_mul_eraseLead_le
+ theorem Polynomial.signVariations_eq_eraseLead_add_ite
+ theorem Polynomial.signVariations_eraseLead
+ theorem Polynomial.signVariations_eraseLead_le
+ theorem Polynomial.signVariations_eraseLead_mul_X_sub_C
+ theorem Polynomial.signVariations_le_eraseLead_succ
+ theorem Polynomial.signVariations_monomial
+ theorem Polynomial.signVariations_neg
+ theorem Polynomial.signVariations_zero
+ theorem Polynomial.succ_signVariations_X_sub_C_mul_monomial
+ theorem Polynomial.succ_signVariations_le_X_sub_C_mul
Modified Mathlib/Data/Sign/Defs.lean
+ theorem SignType.trichotomy
Modified docs/100.yaml
2025-10-14 13:52:57 60b581d
feat: support coercions in the differential geometry elaborators (#30307)
Generalise the `CMDiff`, `MDiff` and `mfderiv` elaborators (and its friends) to apply to any object which coerces to a function. We can such speak about the smoothness of a `PartialEquiv`, `OpenPartialHomeomorph` (or the future `ClosedPartialHomeomorph` and `PartialHomeomorph`), smooth section or bundled smooth map without the need for a coercion.
As a by-product, add new functions `Lean.Meta.ensure{HasType,IsFunction,IsSort}` which apply the respective coercion if necessary.
While at it, add more sections (and section headers) to the test file for the elaborators.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Manifold/Notation.lean
Modified Mathlib/Lean/Meta/Basic.lean
+ def Lean.Meta.ensureHasType
+ def Lean.Meta.ensureIsFunction
+ def Lean.Meta.ensureIsSort
Modified MathlibTest/DifferentialGeometry/Notation.lean
2025-10-14 11:53:59 ac33158
feat: `gaussianReal_ext_iff` (#30414)
Two real Gaussian distributions are equal iff they have the same mean and variance.
ESTIMATED CHANGES
Modified Mathlib/Probability/Distributions/Gaussian/Real.lean
+ theorem ProbabilityTheory.gaussianReal_ext_iff
2025-10-14 11:19:07 e1ca12e
feat: field tactic (#29089)
This PR creates a `field` tactic, i.e. an analogue of `ring` but for fields -- a finishing tactic for equality goals in fields. It is basically `field_simp; ring1`, with a few tweaks for better error reporting!
We could have done this at any point in the last five years, but since `field_simp` is more performant as of #28658, now seems like a good time.
I propose that `field` be preferred to terminal `field_simp`/`field_simp; ring` from now on. I'll follow up with a PR ([preview](https://github.com/leanprover-community/mathlib4/commit/44c0136fb8650f57416733d0b336c60b338f3d99)) making this change widely across the library. In the current PR I also rewrote the docstrings of `field_simp` and friends to nudge users in this direction.
Closes #4837
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Tactic.lean
Added Mathlib/Tactic/Field.lean
Modified Mathlib/Tactic/FieldSimp.lean
Modified MathlibTest/FieldSimp.lean
2025-10-14 10:42:37 89e22b1
refactor: add LinearMapClass and LinearEquivClass instances to Lie(Module)Hom and Equiv (#30450)
Adding these instances means we can use general linearity lemmas like `map_add` without needing a specialized version like `LieHom.map_add`. Because these specialized lemmata become superfluous, this PR deprecates them.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Lie/Abelian.lean
Modified Mathlib/Algebra/Lie/Basic.lean
- theorem LieHom.map_add
- theorem LieHom.map_neg
- theorem LieHom.map_smul
- theorem LieHom.map_sub
- theorem LieHom.map_zero
- theorem LieModuleHom.map_add
- theorem LieModuleHom.map_neg
- theorem LieModuleHom.map_smul
- theorem LieModuleHom.map_sub
- theorem LieModuleHom.map_zero
Modified Mathlib/Algebra/Lie/CartanExists.lean
Modified Mathlib/Algebra/Lie/Character.lean
Modified Mathlib/Algebra/Lie/EngelSubalgebra.lean
Modified Mathlib/Algebra/Lie/Ideal.lean
Modified Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean
Modified Mathlib/Algebra/Lie/OfAssociative.lean
Modified Mathlib/Algebra/Lie/TensorProduct.lean
Modified Mathlib/Algebra/Lie/Weights/Basic.lean
Modified Mathlib/Algebra/Lie/Weights/Killing.lean
Modified Mathlib/Algebra/Lie/Weights/Linear.lean
2025-10-14 10:22:59 60a1d0a
feat(Analysis/Normed/Unbundled/SpectralNorm): add API (#26668)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/FieldDivision.lean
+ theorem Polynomial.monic_mapAlg_iff
Modified Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean
+/- theorem spectralAlgNorm_mul
+/- def spectralMulAlgNorm
+/- theorem spectralMulAlgNorm_def
+/- def spectralNorm.metricSpace
+/- def spectralNorm.normedAddCommGroup
+/- def spectralNorm.normedField
+/- def spectralNorm.normedSpace
+/- def spectralNorm.seminormedAddCommGroup
+ theorem spectralNorm.spectralMulAlgNorm_eq_of_mem_roots
+ theorem spectralNorm.spectralNorm_eq_norm_coeff_zero_rpow
+ theorem spectralNorm.spectralNorm_pow_natDegree_eq_prod_roots
+/- def spectralNorm.uniformSpace
+ theorem spectralValue_le_one_iff
2025-10-14 09:29:54 f897ebc
chore: replace some `tac; grind` where `grind` suffices (#30528)
Found by a bot driving the tactic analysis framework: [#mathlib4 > Weekly linting log @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/near/544462480)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog.lean
Modified Mathlib/Data/Finset/Card.lean
Modified Mathlib/Data/List/Chain.lean
Modified Mathlib/GroupTheory/GroupAction/Jordan.lean
2025-10-14 07:54:45 c48ea03
chore: bump toolchain to v4.24.0 (#30530)
ESTIMATED CHANGES
Modified lake-manifest.json
Modified lean-toolchain
2025-10-14 04:17:33 3aa3aca
fix: remove second type from test in `order.lean` (#30510)
When the `order` tactic fails, it prints all the types it was run on. The order in which these types are printed is arbitrary, and any changes in the transitive imports of `order.lean` can change this order and cause the test to fail.
For example [#mathlib4 > MathlibTest.order error](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/MathlibTest.2Eorder.20error/with/544585480)
This PR removes the second type from the test.
ESTIMATED CHANGES
Modified MathlibTest/order.lean
2025-10-14 04:17:31 91f98c4
feat: group instances on `Colex α` (#30483)
This is just copy-paste + replace `Lex` with `Colex` throughout.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Group/Synonym.lean
+ theorem ofColex_div
+ theorem ofColex_eq_one
+ theorem ofColex_inv
+ theorem ofColex_mul
+ theorem ofColex_one
+ theorem ofColex_pow
+/- theorem ofLex_eq_one
+ theorem pow_ofColex
+ theorem pow_toColex
+ theorem toColex_div
+ theorem toColex_eq_one
+ theorem toColex_inv
+ theorem toColex_mul
+ theorem toColex_one
+ theorem toColex_pow
+/- theorem toLex_eq_one
2025-10-14 03:59:16 2c51cf4
feat(LinearAlgebra/Matrix/Charpoly): `trace_eq_neg_charpoly_coeff` using `nextCoeff` (#30231)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean
+ theorem Matrix.trace_eq_neg_charpoly_nextCoeff
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Eigs.lean
2025-10-14 03:26:47 7893dd0
feat(Data/List/Sigma): grind annotations, some missing API (#30313)
- `grind` annotations for `List.keys`, `List.NodupKeys`, and `List.lookup`, with some shortening of proofs
- upstream `keys_append`, `sublist_dlookup`, and `nodupKeys_middle` from https://github.com/leanprover/cslib/pull/68
ESTIMATED CHANGES
Modified Mathlib/Data/List/Sigma.lean
+ theorem List.NodupKeys.map₁
+ theorem List.NodupKeys.map₂
+/- theorem List.dlookup_isSome
+ theorem List.keys_append
+/- theorem List.map_dlookup_eq_find
+ theorem List.map₂_keys
+/- theorem List.ne_key
+ theorem List.nodupKeys_middle
+/- theorem List.notMem_keys
+/- theorem List.of_mem_dlookup
+ theorem List.sublist_dlookup
2025-10-14 00:50:11 1d03283
chore(MonoidAlgebra/Defs): reorder, rename variables (#29207)
Sort the declarations according to typeclass assumptions, *and* according to the order in which we need them to be for #25273.
Rename the semiring variable to `R` and the monoid one to `M`. Simultaneously golf. The rename is motivated by the idea that variables should reflect the generality, if such generality is used, and indeed such generality is definitely used since polynomials over a ring are the same thing as `AddMonoidAlgebra R ℕ`, and we neither have `R` a field nor `ℕ` a group. Furthermore, the file isn't entirely consistent with its use of variables to begin with, and that was causing me issues when resectioning.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/Ring/Adjunctions.lean
Modified Mathlib/Algebra/MonoidAlgebra/Basic.lean
Modified Mathlib/Algebra/MonoidAlgebra/Defs.lean
+/- theorem AddMonoidAlgebra.induction_on
+/- def AddMonoidAlgebra.of'
+/- theorem AddMonoidAlgebra.of'_apply
+/- theorem AddMonoidAlgebra.of'_commute
+/- theorem AddMonoidAlgebra.of'_eq_of
+/- def AddMonoidAlgebra.of
+/- def AddMonoidAlgebra.ofMagma
+/- theorem AddMonoidAlgebra.of_apply
+/- theorem AddMonoidAlgebra.of_injective
+/- theorem AddMonoidAlgebra.ringHom_ext'
+/- def AddMonoidAlgebra.singleHom
- theorem AddMonoidAlgebra.smul_single'
+/- theorem MonoidAlgebra.addHom_ext'
+/- theorem MonoidAlgebra.ext
+/- theorem MonoidAlgebra.induction_linear
+/- theorem MonoidAlgebra.induction_on
+/- theorem MonoidAlgebra.intCast_def
+/- def MonoidAlgebra.mul'
+/- theorem MonoidAlgebra.mul_apply
+/- theorem MonoidAlgebra.mul_apply_antidiagonal
+/- theorem MonoidAlgebra.mul_apply_left
+/- theorem MonoidAlgebra.mul_apply_right
+/- theorem MonoidAlgebra.mul_def
+/- theorem MonoidAlgebra.mul_single_apply
+/- theorem MonoidAlgebra.mul_single_apply_aux
+/- theorem MonoidAlgebra.mul_single_apply_of_not_exists_mul
+/- theorem MonoidAlgebra.mul_single_one_apply
+/- theorem MonoidAlgebra.natCast_def
+/- def MonoidAlgebra.of
+/- def MonoidAlgebra.ofMagma
+/- theorem MonoidAlgebra.of_commute
+/- theorem MonoidAlgebra.of_injective
+/- theorem MonoidAlgebra.one_def
+/- theorem MonoidAlgebra.prod_single
+/- theorem MonoidAlgebra.ringHom_ext'
+/- theorem MonoidAlgebra.ringHom_ext
+ def MonoidAlgebra.singleAddHom
- theorem MonoidAlgebra.singleAddHom_apply
+/- def MonoidAlgebra.singleHom
+/- def MonoidAlgebra.singleOneRingHom
+/- theorem MonoidAlgebra.single_add
+/- theorem MonoidAlgebra.single_apply
+/- theorem MonoidAlgebra.single_commute
+/- theorem MonoidAlgebra.single_commute_single
+/- theorem MonoidAlgebra.single_eq_zero
+/- theorem MonoidAlgebra.single_mul_apply
+/- theorem MonoidAlgebra.single_mul_apply_aux
+/- theorem MonoidAlgebra.single_mul_apply_of_not_exists_mul
+/- theorem MonoidAlgebra.single_mul_single
+/- theorem MonoidAlgebra.single_ne_zero
+/- theorem MonoidAlgebra.single_neg
+/- theorem MonoidAlgebra.single_one_comm
+/- theorem MonoidAlgebra.single_one_mul_apply
+/- theorem MonoidAlgebra.single_pow
+/- theorem MonoidAlgebra.single_zero
+/- theorem MonoidAlgebra.smul_apply
+ theorem MonoidAlgebra.smul_single'
+/- theorem MonoidAlgebra.smul_single
+/- theorem MonoidAlgebra.sum_single
+/- theorem MonoidAlgebra.sum_single_index
+/- def MonoidAlgebra
Modified Mathlib/Algebra/MonoidAlgebra/Division.lean
Modified Mathlib/Algebra/MonoidAlgebra/Grading.lean
Modified Mathlib/Algebra/MonoidAlgebra/MapDomain.lean
Modified Mathlib/Algebra/MonoidAlgebra/Module.lean
- theorem MonoidAlgebra.smul_single'
Modified Mathlib/Algebra/MvPolynomial/Basic.lean
Modified Mathlib/Algebra/Polynomial/Laurent.lean
2025-10-13 20:44:11 57f5895
chore: add module deprecations for removed files (#30519)
The files were moved in:
- 50229ae534b8cbd5ed798d38dbb2b3f27d20d20b
- 1a3e03e5d2f2be462a184a221fc72456f992987a
- fefa0fbec28fb2dfc1b78741499d9d177ee75c94
- 27e8b12514da477e4b681ba3134b0c42ac19bc5d (two files)
- c3104a0a6e21b2926b505f47ac9c96eacf24aa3a
- a778305ec3a679802f7dcfa64e2b903d4679ee21
- 1b18558289ee0c58c43f196a3d628f9be728f5d7
- eaa1502e407c6ce4bb367d12df0f15ff3f14e25a
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Algebra/ArithmeticGeometric.lean
Added Mathlib/Analysis/InnerProductSpace/Harmonic/Analytic.lean
Added Mathlib/Analysis/NormedSpace/ConformalLinearMap.lean
Added Mathlib/CategoryTheory/Bicategory/Functor/Strict.lean
Added Mathlib/CategoryTheory/Bicategory/Strict.lean
Added Mathlib/Data/Nat/PowModTotient.lean
Added Mathlib/Data/Real/Irrational.lean
Added Mathlib/LinearAlgebra/AffineSpace/ContinuousAffineEquiv.lean
Added Mathlib/Probability/Moments/CovarianceBilin.lean
2025-10-13 14:40:57 7a9e177
refactor: make ContinuousLinearMap.id protected (#30362)
As it is for many other kinds of homomorphisms.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean
Modified Mathlib/Analysis/Calculus/FDeriv/Add.lean
+/- theorem hasFDerivAt_sub_const
+/- theorem hasStrictFDerivAt_sub_const
Modified Mathlib/Analysis/Calculus/FDeriv/Basic.lean
+/- theorem fderivWithin_id
+/- theorem fderiv_id
+/- theorem hasFDerivAtFilter_id
+/- theorem hasFDerivAt_id
+/- theorem hasFDerivWithinAt_id
+/- theorem hasStrictFDerivAt_id
Modified Mathlib/Analysis/Normed/Operator/Basic.lean
+/- theorem ContinuousLinearMap.norm_id_le
+/- theorem ContinuousLinearMap.norm_id_of_nontrivial_seminorm
Modified Mathlib/Analysis/Normed/Operator/Bilinear.lean
Modified Mathlib/Analysis/Normed/Operator/Conformal.lean
+/- theorem isConformalMap_const_smul
+/- theorem isConformalMap_id
Modified Mathlib/Analysis/Normed/Operator/NormedSpace.lean
+/- theorem ContinuousLinearMap.nnnorm_id
+/- theorem ContinuousLinearMap.norm_id
Modified Mathlib/Topology/Algebra/Module/Equiv.lean
+/- theorem ContinuousLinearMap.inverse_eq
+/- theorem ContinuousLinearMap.inverse_id
Modified Mathlib/Topology/Algebra/Module/LinearMap.lean
+/- theorem ContinuousLinearMap.coe_eq_id
+/- theorem ContinuousLinearMap.coe_id'
+/- theorem ContinuousLinearMap.coe_id
+/- theorem ContinuousLinearMap.comp_id
- def ContinuousLinearMap.id
+/- theorem ContinuousLinearMap.id_apply
+/- theorem ContinuousLinearMap.id_comp
+/- theorem ContinuousLinearMap.one_def
Modified Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean
+/- theorem ContinuousLinearMap.fst_prod_snd
2025-10-13 13:57:48 3c90d00
feat(CategoryTheory/Sites): small `0`-hypercovers (#30321)
A `w`-`0`-hypercover `E` is `w'`-small if there exists an indexing type `ι` in `Type w'` and a
restriction map `ι → E.I₀` such that the restriction of `E` to `ι` is still covering.
This is weaker than `E.I₀` being `w'`-small. For example, every Zariski cover of `X : Scheme.{u}` is `u`-small,
because `X` itself suffices as indexing type.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/Cover/MorphismProperty.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Local.lean
+ theorem CategoryTheory.MorphismProperty.of_zeroHypercover_source
+ theorem CategoryTheory.MorphismProperty.of_zeroHypercover_target
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
+ theorem CategoryTheory.PreZeroHypercover.presieve₀_restrictIndex_equiv
+ def CategoryTheory.PreZeroHypercover.restrictIndex
+ def CategoryTheory.Precoverage.ZeroHypercover.Small.Index
+ theorem CategoryTheory.Precoverage.ZeroHypercover.Small.mem₀
+ def CategoryTheory.Precoverage.ZeroHypercover.restrictIndexOfSmall
Modified Mathlib/CategoryTheory/Sites/MorphismProperty.lean
2025-10-13 13:12:20 5b27418
feat: commutativity of `mul` and `finprod` (#30326)
For (semi-)rings without zero divisors, show that multiplication commutes with `finprod`. Following a [brief discussion of Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Naming.20inconstency.2C.20finsum.20and.20multiplication/with/543461589), unify naming between theorems about multiplication and theorems about scalar multiplication.
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Finprod.lean
+ theorem finsum_mem_mul'
+/- theorem finsum_mem_mul
+ theorem finsum_mul'
+/- theorem finsum_mul
+ theorem mul_finsum'
+/- theorem mul_finsum
+ theorem mul_finsum_mem'
+/- theorem mul_finsum_mem
2025-10-13 12:21:27 45dfe1b
doc: typo fixes (#30501)
Fixes found by Junie Pro
ESTIMATED CHANGES
Modified Mathlib/Computability/TuringDegree.lean
2025-10-13 10:58:47 c557aff
chore(Algebra): generalize subalgebra operations to semirings (#30250)
Relax Subalgebra operations to work over `CommSemiring` structures instead of demanding commutative rings.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Subalgebra/Operations.lean
2025-10-13 10:44:50 eaa1502
refactor: rename covarianceBilin to covarianceBilinDual (#30417)
This allows to define `covarianceBilin` on a Hilbert space in #30324, following the naming scheme `charFunDual/charFun`.
ESTIMATED CHANGES
Modified Mathlib.lean
Renamed Mathlib/Probability/Moments/CovarianceBilin.lean to Mathlib/Probability/Moments/CovarianceBilinDual.lean
- def ProbabilityTheory.covarianceBilin
+ def ProbabilityTheory.covarianceBilinDual
+ theorem ProbabilityTheory.covarianceBilinDual_apply'
+ theorem ProbabilityTheory.covarianceBilinDual_apply
+ theorem ProbabilityTheory.covarianceBilinDual_comm
+ theorem ProbabilityTheory.covarianceBilinDual_eq_covariance
+ theorem ProbabilityTheory.covarianceBilinDual_of_not_memLp
+ theorem ProbabilityTheory.covarianceBilinDual_self_eq_variance
+ theorem ProbabilityTheory.covarianceBilinDual_zero
- theorem ProbabilityTheory.covarianceBilin_apply'
- theorem ProbabilityTheory.covarianceBilin_apply
- theorem ProbabilityTheory.covarianceBilin_comm
- theorem ProbabilityTheory.covarianceBilin_eq_covariance
- theorem ProbabilityTheory.covarianceBilin_of_not_memLp
- theorem ProbabilityTheory.covarianceBilin_self_eq_variance
- theorem ProbabilityTheory.covarianceBilin_zero
+ theorem ProbabilityTheory.norm_uncenteredCovarianceBilinDual_le
- theorem ProbabilityTheory.norm_uncenteredCovarianceBilin_le
- def ProbabilityTheory.uncenteredCovarianceBilin
+ def ProbabilityTheory.uncenteredCovarianceBilinDual
+ theorem ProbabilityTheory.uncenteredCovarianceBilinDual_apply
+ theorem ProbabilityTheory.uncenteredCovarianceBilinDual_of_not_memLp
+ theorem ProbabilityTheory.uncenteredCovarianceBilinDual_zero
- theorem ProbabilityTheory.uncenteredCovarianceBilin_apply
- theorem ProbabilityTheory.uncenteredCovarianceBilin_of_not_memLp
- theorem ProbabilityTheory.uncenteredCovarianceBilin_zero
2025-10-13 09:56:15 9b3e142
chore: delete unused test file (#30497)
This file as added in #29513, but never hooked up to the unit tests. It is thus unused; delete it.
ESTIMATED CHANGES
Deleted MathlibTest/LintStyle2.lean
2025-10-13 08:40:46 c7448d4
doc: fix repeated words in documentation (#30479)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean
Modified Mathlib/AlgebraicGeometry/Restrict.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/Coskeletal.lean
Modified Mathlib/Analysis/Complex/Hadamard.lean
Modified Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean
Modified Mathlib/Analysis/NormedSpace/Alternating/Basic.lean
Modified Mathlib/Analysis/ODE/PicardLindelof.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean
Modified Mathlib/CategoryTheory/Abelian/GrothendieckCategory/ColimCoyoneda.lean
Modified Mathlib/CategoryTheory/Category/ReflQuiv.lean
Modified Mathlib/CategoryTheory/Comma/Over/OverClass.lean
Modified Mathlib/CategoryTheory/Limits/Final.lean
Modified Mathlib/CategoryTheory/Monoidal/Action/Basic.lean
Modified Mathlib/CategoryTheory/Monoidal/Action/LinearFunctor.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Factorization.lean
Modified Mathlib/CategoryTheory/SmallObject/IsCardinalForSmallObjectArgument.lean
Modified Mathlib/Combinatorics/Matroid/Constructions.lean
Modified Mathlib/Combinatorics/Matroid/Minor/Contract.lean
Modified Mathlib/Combinatorics/Matroid/Rank/ENat.lean
Modified Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean
Modified Mathlib/Combinatorics/SimpleGraph/Matching.lean
Modified Mathlib/Combinatorics/SimpleGraph/Tutte.lean
Modified Mathlib/Condensed/Discrete/Basic.lean
Modified Mathlib/Control/Bifunctor.lean
Modified Mathlib/Data/Int/ConditionallyCompleteOrder.lean
Modified Mathlib/FieldTheory/Galois/GaloisClosure.lean
Modified Mathlib/FieldTheory/IsAlgClosed/Classification.lean
Modified Mathlib/Geometry/Manifold/Bordism.lean
Modified Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean
Modified Mathlib/GroupTheory/GroupAction/Support.lean
Modified Mathlib/GroupTheory/Submonoid/Center.lean
Modified Mathlib/LinearAlgebra/RootSystem/IsValuedIn.lean
Modified Mathlib/LinearAlgebra/Vandermonde.lean
Modified Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean
Modified Mathlib/NumberTheory/KummerDedekind.lean
Modified Mathlib/NumberTheory/Padics/Complex.lean
Modified Mathlib/NumberTheory/Padics/MahlerBasis.lean
Modified Mathlib/Probability/Kernel/Disintegration/Density.lean
Modified Mathlib/Probability/Moments/SubGaussian.lean
Modified Mathlib/Probability/Process/Filtration.lean
Modified Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean
Modified Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean
Modified Mathlib/RingTheory/MvPowerSeries/Order.lean
Modified Mathlib/RingTheory/Valuation/Discrete/Basic.lean
Modified Mathlib/Tactic/FunProp.lean
Modified Mathlib/Tactic/FunProp/Core.lean
Modified Mathlib/Tactic/GCongr/Core.lean
Modified Mathlib/Tactic/Linter/DirectoryDependency.lean
Modified Mathlib/Tactic/Linter/FlexibleLinter.lean
Modified Mathlib/Tactic/MoveAdd.lean
Modified Mathlib/Topology/Category/Compactum.lean
Modified Mathlib/Topology/LocallyFinsupp.lean
Modified Mathlib/Topology/Sheaves/PresheafOfFunctions.lean
Modified Mathlib/Topology/VectorBundle/Riemannian.lean
2025-10-13 08:18:06 ccfa0e6
doc: refer to the ASCII asterisk as more common (#30495)
Following up on #29668. @kbuzzard made a last-minute suggestion to keep referring to the ASCII asterisk as more common than the Unicode operator. I reintroduce that language in this PR.
I also make some further small changes that I think are beneficial to the flow of the text.
ESTIMATED CHANGES
Modified Mathlib/Computability/Language.lean
2025-10-13 07:43:09 4e9ce78
chore: `Polynomial.eval_X_pow` (#30446)
This is of course just `eval_pow` + `eval_X`, but I believe it appears commonly enough to warrant its own shortcut.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Eval/Defs.lean
+ theorem Polynomial.eval_X_pow
Modified Mathlib/Algebra/Polynomial/GroupRingAction.lean
Modified Mathlib/Algebra/Polynomial/UnitTrinomial.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean
Modified Mathlib/Analysis/Normed/Algebra/GelfandFormula.lean
Modified Mathlib/FieldTheory/IsAlgClosed/Spectrum.lean
Modified Mathlib/FieldTheory/Minpoly/MinpolyDiv.lean
Modified Mathlib/FieldTheory/SeparableDegree.lean
Modified Mathlib/RingTheory/LittleWedderburn.lean
Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean
Modified Mathlib/RingTheory/RootsOfUnity/Minpoly.lean
2025-10-13 07:43:08 ef523e2
chore(CategoryTheory): split Limits.Presentation (#29903)
The part of the code involving "set theory" (via finitely presentable objects) is moved to `CategoryTheory.Presentable.ColimitPresentation`. As `ColimitPresentation` is going to be used more widely, this will reduce dependencies to set theory for some files.
- [x] depends on: #29851
- [x] depends on: #29849
- [x] depends on: #29843
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/Limits/Presentation.lean
- def CategoryTheory.Limits.ColimitPresentation.Total.Hom.comp
- structure CategoryTheory.Limits.ColimitPresentation.Total.Hom
- theorem CategoryTheory.Limits.ColimitPresentation.Total.exists_hom_of_hom
- def CategoryTheory.Limits.ColimitPresentation.Total
- def CategoryTheory.Limits.ColimitPresentation.bind
Modified Mathlib/CategoryTheory/ObjectProperty/Ind.lean
Added Mathlib/CategoryTheory/Presentable/ColimitPresentation.lean
+ def CategoryTheory.Limits.ColimitPresentation.Total.Hom.comp
+ structure CategoryTheory.Limits.ColimitPresentation.Total.Hom
+ theorem CategoryTheory.Limits.ColimitPresentation.Total.exists_hom_of_hom
+ def CategoryTheory.Limits.ColimitPresentation.Total
+ def CategoryTheory.Limits.ColimitPresentation.bind
2025-10-13 07:28:39 537040d
doc: cleanup of kleene star docs (#29668)
This PR:
- Corrects "Kleene's star" to "Kleene star"
- Clarifies a comment about notation.
ESTIMATED CHANGES
Modified Mathlib/Computability/Language.lean
2025-10-13 06:34:23 91ddcb0
fix(lint-style): parse linter options and load environment extensions correctly (#29513)
Parse options and load linter set extension correctly.
This fixes two issues:
- We never called the `toOptions` function that parses Lakefile options into a `Lean.Options` structure: the function we use instead is only meant for command-line options and doesn't handle the `weak.` prefix correctly.
- The way we load linter sets was incorrect: `withImportModules` stopped updating environment extensions since [lean4#6325](https://github.com/leanprover/lean4/pull/6325), and that is exactly what we use to store linter sets. At the time of writing, `importModules` might be a suitable replacement (but this is not very safe, and not documented to be stable). Instead, write a small elaborator returning the environment at the point of elaboration, and use that instead.
ESTIMATED CHANGES
Modified Mathlib/Tactic/Polyrith.lean
Added MathlibTest/LintStyle2.lean
Modified scripts/README.md
Modified scripts/lint-style.lean
+/- def toLeanOptions
2025-10-13 01:40:41 a778305
chore: move Data/Real/Irrational to RingTheory (#29002)
It certainly has nothing to do with data (structures).
ESTIMATED CHANGES
Modified Counterexamples/IrrationalPowerOfIrrational.lean
Modified Mathlib.lean
Modified Mathlib/Analysis/Real/Pi/Irrational.lean
Modified Mathlib/Data/Real/GoldenRatio.lean
Modified Mathlib/NumberTheory/DiophantineApproximation/Basic.lean
Modified Mathlib/NumberTheory/Rayleigh.lean
Modified Mathlib/NumberTheory/Transcendental/Liouville/Basic.lean
Renamed Mathlib/Data/Real/Irrational.lean to Mathlib/RingTheory/Real/Irrational.lean
Modified Mathlib/Tactic/NormNum/Irrational.lean
Modified Mathlib/Topology/Instances/AddCircle/DenseSubgroup.lean
Modified Mathlib/Topology/Instances/Irrational.lean
2025-10-13 00:20:35 b2bc3a5
feat(Geometry/Euclidean/Sphere/Tangent) add isTangentAt with right-angle (#30235)
This PR mainly adds two theorems:
- `IsTangentAt.dist_eq_of_mem_of_mem` : Two tangent lines through same point yield equal distances
- `IsTangentAt_iff_angle_eq_pi_div_two`: Characterization of tangency via angle.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Angle/Sphere.lean
+ theorem EuclideanGeometry.Sphere.IsTangentAt.angle_eq_pi_div_two
+ theorem EuclideanGeometry.Sphere.IsTangentAt_iff_angle_eq_pi_div_two
+ theorem EuclideanGeometry.Sphere.IsTangentAt_of_angle_eq_pi_div_two
Modified Mathlib/Geometry/Euclidean/Sphere/Tangent.lean
+ theorem EuclideanGeometry.Sphere.IsTangentAt.dist_eq_of_mem_of_mem
2025-10-12 23:36:14 50803f9
feat(SetTheory/Ordinal/Exponential): generalize theorems from `y = succ x` to `x < y` (#29042)
ESTIMATED CHANGES
Modified Mathlib/SetTheory/Ordinal/Exponential.lean
+ theorem Ordinal.opow_mul_add_lt_opow
+ theorem Ordinal.opow_mul_add_lt_opow_mul
2025-10-12 23:06:50 837b150
test(Data/DFinsupp/Lex): make `irreducible` decidability instances reducible (#30480)
ESTIMATED CHANGES
Modified Mathlib/Data/DFinsupp/Lex.lean
2025-10-12 20:35:56 98ff46e
feat(CategoryTheory): Colimits in `Subobject X` (#29863)
Adds colimits to `Subobject X`. Together with https://github.com/leanprover-community/mathlib4/pull/29253, this will show existence of lubs in the poset of subobjects.
This is a prerequisite of the [MTT project](https://github.com/kyoDralliam/model-theory-topos), which aims to use the internal language of toposes to reason about e.g. sheaves.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Subobject/Basic.lean
Modified Mathlib/CategoryTheory/Subobject/MonoOver.lean
+ def CategoryTheory.MonoOver.coconeOfHasStrongEpiMonoFactorisation
+ theorem CategoryTheory.MonoOver.commSqOfHasStrongEpiMonoFactorisation
+ def CategoryTheory.MonoOver.isColimitCoconeOfHasStrongEpiMonoFactorisation
+ def CategoryTheory.MonoOver.liftStructOfHasStrongEpiMonoFactorisation
+ def CategoryTheory.MonoOver.strongEpiMonoFactorisationSigmaDesc
2025-10-12 18:01:19 2ffecf4
chore: rename `Grp` to `GrpCat` (#30191)
This frees up the name for `Grp_` to be renamed to `Grp`. We leave no deprecation since the name will be reused instantly.
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Removing.20underscores.20from.20docs.23Mon_.2C.20docs.23Grp_.20.2E.2E.2E)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/Grp/AB.lean
Modified Mathlib/Algebra/Category/Grp/Abelian.lean
- def AddCommGrp.normalEpi
- def AddCommGrp.normalMono
+ def AddCommGrpCat.normalEpi
+ def AddCommGrpCat.normalMono
Modified Mathlib/Algebra/Category/Grp/Adjunctions.lean
- def AddCommGrp.adj
- def AddCommGrp.free
- theorem AddCommGrp.free_map_coe
- theorem AddCommGrp.free_obj_coe
+ def AddCommGrpCat.adj
+ def AddCommGrpCat.free
+ theorem AddCommGrpCat.free_map_coe
+ theorem AddCommGrpCat.free_obj_coe
- def CommGrp.forget₂CommMonAdj
+ def CommGrpCat.forget₂CommMonAdj
+/- def CommMonCat.units
- def Grp.abelianize
- def Grp.abelianizeAdj
- def Grp.adj
- def Grp.forget₂MonAdj
- def Grp.free
+ def GrpCat.abelianize
+ def GrpCat.abelianizeAdj
+ def GrpCat.adj
+ def GrpCat.forget₂MonAdj
+ def GrpCat.free
+/- def MonCat.units
Modified Mathlib/Algebra/Category/Grp/Basic.lean
- structure AddCommGrp.Hom
- def AddCommGrp.asHom
- theorem AddCommGrp.asHom_injective
- theorem AddCommGrp.injective_of_mono
- theorem AddCommGrp.int_hom_ext
- structure AddCommGrp
+ structure AddCommGrpCat.Hom
+ def AddCommGrpCat.asHom
+ theorem AddCommGrpCat.asHom_injective
+ theorem AddCommGrpCat.injective_of_mono
+ theorem AddCommGrpCat.int_hom_ext
+ structure AddCommGrpCat
- structure AddGrp.Hom
- structure AddGrp
+ structure AddGrpCat.Hom
+ structure AddGrpCat
+/- def CategoryTheory.Aut.isoPerm
+/- def CategoryTheory.Iso.commGroupIsoToMulEquiv
+/- def CategoryTheory.Iso.groupIsoToMulEquiv
- def CommGrp.Hom.Simps.hom
- structure CommGrp.Hom
- theorem CommGrp.coe_comp
- theorem CommGrp.coe_id
- theorem CommGrp.coe_of
- theorem CommGrp.comp_apply
- theorem CommGrp.ext
- theorem CommGrp.forget_map
- theorem CommGrp.forget₂_commMonCat_map_ofHom
- theorem CommGrp.forget₂_grp_map_ofHom
- def CommGrp.fullyFaithfulForget₂ToGrp
- theorem CommGrp.hom_comp
- theorem CommGrp.hom_ext
- theorem CommGrp.hom_id
- theorem CommGrp.hom_inv_apply
- theorem CommGrp.hom_ofHom
- theorem CommGrp.id_apply
- theorem CommGrp.inv_hom_apply
- theorem CommGrp.ofHom_apply
- theorem CommGrp.ofHom_comp
- theorem CommGrp.ofHom_hom
- theorem CommGrp.ofHom_id
- theorem CommGrp.ofHom_injective
- theorem CommGrp.one_apply
- def CommGrp.uliftFunctor
- structure CommGrp
+ def CommGrpCat.Hom.Simps.hom
+ structure CommGrpCat.Hom
+ theorem CommGrpCat.coe_comp
+ theorem CommGrpCat.coe_id
+ theorem CommGrpCat.coe_of
+ theorem CommGrpCat.comp_apply
+ theorem CommGrpCat.ext
+ theorem CommGrpCat.forget_map
+ theorem CommGrpCat.forget₂_commMonCat_map_ofHom
+ theorem CommGrpCat.forget₂_grp_map_ofHom
+ def CommGrpCat.fullyFaithfulForget₂ToGrp
+ theorem CommGrpCat.hom_comp
+ theorem CommGrpCat.hom_ext
+ theorem CommGrpCat.hom_id
+ theorem CommGrpCat.hom_inv_apply
+ theorem CommGrpCat.hom_ofHom
+ theorem CommGrpCat.id_apply
+ theorem CommGrpCat.inv_hom_apply
+ theorem CommGrpCat.ofHom_apply
+ theorem CommGrpCat.ofHom_comp
+ theorem CommGrpCat.ofHom_hom
+ theorem CommGrpCat.ofHom_id
+ theorem CommGrpCat.ofHom_injective
+ theorem CommGrpCat.one_apply
+ def CommGrpCat.uliftFunctor
+ structure CommGrpCat
- def Grp.Hom.Simps.hom
- structure Grp.Hom
- theorem Grp.coe_comp
- theorem Grp.coe_id
- theorem Grp.coe_of
- theorem Grp.comp_apply
- theorem Grp.ext
- theorem Grp.forget_map
- theorem Grp.forget₂_map_ofHom
- def Grp.fullyFaithfulForget₂ToMonCat
- theorem Grp.hom_comp
- theorem Grp.hom_ext
- theorem Grp.hom_id
- theorem Grp.hom_inv_apply
- theorem Grp.hom_ofHom
- theorem Grp.id_apply
- theorem Grp.inv_hom_apply
- theorem Grp.ofHom_apply
- theorem Grp.ofHom_comp
- theorem Grp.ofHom_hom
- theorem Grp.ofHom_id
- theorem Grp.ofHom_injective
- theorem Grp.one_apply
- def Grp.uliftFunctor
- structure Grp
+ def GrpCat.Hom.Simps.hom
+ structure GrpCat.Hom
+ theorem GrpCat.coe_comp
+ theorem GrpCat.coe_id
+ theorem GrpCat.coe_of
+ theorem GrpCat.comp_apply
+ theorem GrpCat.ext
+ theorem GrpCat.forget_map
+ theorem GrpCat.forget₂_map_ofHom
+ def GrpCat.fullyFaithfulForget₂ToMonCat
+ theorem GrpCat.hom_comp
+ theorem GrpCat.hom_ext
+ theorem GrpCat.hom_id
+ theorem GrpCat.hom_inv_apply
+ theorem GrpCat.hom_ofHom
+ theorem GrpCat.id_apply
+ theorem GrpCat.inv_hom_apply
+ theorem GrpCat.ofHom_apply
+ theorem GrpCat.ofHom_comp
+ theorem GrpCat.ofHom_hom
+ theorem GrpCat.ofHom_id
+ theorem GrpCat.ofHom_injective
+ theorem GrpCat.one_apply
+ def GrpCat.uliftFunctor
+ structure GrpCat
+/- theorem MonoidHom.comp_id_commGrp
+/- theorem MonoidHom.comp_id_grp
+/- theorem MonoidHom.id_commGrp_comp
+/- theorem MonoidHom.id_grp_comp
+/- def MulEquiv.toCommGrpIso
+/- def MulEquiv.toGrpIso
+/- def mulEquivIsoCommGroupIso
+/- def mulEquivIsoGroupIso
Modified Mathlib/Algebra/Category/Grp/Biproducts.lean
- def AddCommGrp.HasLimit.lift
- def AddCommGrp.HasLimit.productLimitCone
- def AddCommGrp.binaryProductLimitCone
- theorem AddCommGrp.binaryProductLimitCone_cone_π_app_left
- theorem AddCommGrp.binaryProductLimitCone_cone_π_app_right
- theorem AddCommGrp.biprodIsoProd_inv_comp_fst
- theorem AddCommGrp.biprodIsoProd_inv_comp_snd
- theorem AddCommGrp.biproductIsoPi_inv_comp_π
+ def AddCommGrpCat.HasLimit.lift
+ def AddCommGrpCat.HasLimit.productLimitCone
+ def AddCommGrpCat.binaryProductLimitCone
+ theorem AddCommGrpCat.binaryProductLimitCone_cone_π_app_left
+ theorem AddCommGrpCat.binaryProductLimitCone_cone_π_app_right
+ theorem AddCommGrpCat.biprodIsoProd_inv_comp_fst
+ theorem AddCommGrpCat.biprodIsoProd_inv_comp_snd
+ theorem AddCommGrpCat.biproductIsoPi_inv_comp_π
Modified Mathlib/Algebra/Category/Grp/CartesianMonoidal.lean
- theorem AddCommGrp.tensorObj_eq
- theorem AddCommGrp.μ_forget_apply
+ theorem AddCommGrpCat.tensorObj_eq
+ theorem AddCommGrpCat.μ_forget_apply
- def AddGrp.binaryProductLimitCone
- theorem AddGrp.tensorObj_eq
- theorem AddGrp.μ_forget_apply
+ def AddGrpCat.binaryProductLimitCone
+ theorem AddGrpCat.tensorObj_eq
+ theorem AddGrpCat.μ_forget_apply
- def CommGrp.binaryProductLimitCone
- theorem CommGrp.tensorObj_eq
- theorem CommGrp.μ_forget_apply
+ def CommGrpCat.binaryProductLimitCone
+ theorem CommGrpCat.tensorObj_eq
+ theorem CommGrpCat.μ_forget_apply
- def Grp.binaryProductLimitCone
- theorem Grp.tensorObj_eq
- theorem Grp.μ_forget_apply
+ def GrpCat.binaryProductLimitCone
+ theorem GrpCat.tensorObj_eq
+ theorem GrpCat.μ_forget_apply
Modified Mathlib/Algebra/Category/Grp/Colimits.lean
- theorem AddCommGrp.Colimits.Quot.addMonoidHom_ext
- def AddCommGrp.Colimits.Quot.desc
- theorem AddCommGrp.Colimits.Quot.desc_colimitCocone
- theorem AddCommGrp.Colimits.Quot.desc_quotQuotUliftAddEquiv
- theorem AddCommGrp.Colimits.Quot.desc_toCocone_desc
- theorem AddCommGrp.Colimits.Quot.desc_toCocone_desc_app
- theorem AddCommGrp.Colimits.Quot.map_ι
- def AddCommGrp.Colimits.Quot.ι
- theorem AddCommGrp.Colimits.Quot.ι_desc
- def AddCommGrp.Colimits.Quot
- def AddCommGrp.Colimits.quotQuotUliftAddEquiv
- def AddCommGrp.Colimits.quotToQuotUlift
- theorem AddCommGrp.Colimits.quotToQuotUlift_ι
- def AddCommGrp.Colimits.quotUliftToQuot
- theorem AddCommGrp.Colimits.quotUliftToQuot_ι
- def AddCommGrp.Colimits.toCocone
- theorem AddCommGrp.hasColimit_of_small_quot
+ theorem AddCommGrpCat.Colimits.Quot.addMonoidHom_ext
+ def AddCommGrpCat.Colimits.Quot.desc
+ theorem AddCommGrpCat.Colimits.Quot.desc_colimitCocone
+ theorem AddCommGrpCat.Colimits.Quot.desc_quotQuotUliftAddEquiv
+ theorem AddCommGrpCat.Colimits.Quot.desc_toCocone_desc
+ theorem AddCommGrpCat.Colimits.Quot.desc_toCocone_desc_app
+ theorem AddCommGrpCat.Colimits.Quot.map_ι
+ def AddCommGrpCat.Colimits.Quot.ι
+ theorem AddCommGrpCat.Colimits.Quot.ι_desc
+ def AddCommGrpCat.Colimits.Quot
+ def AddCommGrpCat.Colimits.quotQuotUliftAddEquiv
+ def AddCommGrpCat.Colimits.quotToQuotUlift
+ theorem AddCommGrpCat.Colimits.quotToQuotUlift_ι
+ def AddCommGrpCat.Colimits.quotUliftToQuot
+ theorem AddCommGrpCat.Colimits.quotUliftToQuot_ι
+ def AddCommGrpCat.Colimits.toCocone
+ theorem AddCommGrpCat.hasColimit_of_small_quot
Modified Mathlib/Algebra/Category/Grp/EnoughInjectives.lean
Modified Mathlib/Algebra/Category/Grp/EpiMono.lean
- theorem AddGrp.epi_iff_range_eq_top
- theorem AddGrp.epi_iff_surjective
+ theorem AddGrpCat.epi_iff_range_eq_top
+ theorem AddGrpCat.epi_iff_surjective
- theorem CommGrp.epi_iff_range_eq_top
- theorem CommGrp.epi_iff_surjective
- theorem CommGrp.ker_eq_bot_of_mono
- theorem CommGrp.mono_iff_injective
- theorem CommGrp.mono_iff_ker_eq_bot
- theorem CommGrp.range_eq_top_of_epi
+ theorem CommGrpCat.epi_iff_range_eq_top
+ theorem CommGrpCat.epi_iff_surjective
+ theorem CommGrpCat.ker_eq_bot_of_mono
+ theorem CommGrpCat.mono_iff_injective
+ theorem CommGrpCat.mono_iff_ker_eq_bot
+ theorem CommGrpCat.range_eq_top_of_epi
- inductive Grp.SurjectiveOfEpiAuxs.XWithInfinity
- theorem Grp.SurjectiveOfEpiAuxs.agree
- theorem Grp.SurjectiveOfEpiAuxs.comp_eq
- theorem Grp.SurjectiveOfEpiAuxs.fromCoset_eq_of_mem_range
- theorem Grp.SurjectiveOfEpiAuxs.fromCoset_ne_of_nin_range
- def Grp.SurjectiveOfEpiAuxs.g
- theorem Grp.SurjectiveOfEpiAuxs.g_apply_fromCoset
- theorem Grp.SurjectiveOfEpiAuxs.g_apply_infinity
- theorem Grp.SurjectiveOfEpiAuxs.g_ne_h
- def Grp.SurjectiveOfEpiAuxs.h
- theorem Grp.SurjectiveOfEpiAuxs.h_apply_fromCoset'
- theorem Grp.SurjectiveOfEpiAuxs.h_apply_fromCoset
- theorem Grp.SurjectiveOfEpiAuxs.h_apply_fromCoset_nin_range
- theorem Grp.SurjectiveOfEpiAuxs.h_apply_infinity
- theorem Grp.SurjectiveOfEpiAuxs.mul_smul
- theorem Grp.SurjectiveOfEpiAuxs.one_smul
- theorem Grp.SurjectiveOfEpiAuxs.τ_apply_fromCoset'
- theorem Grp.SurjectiveOfEpiAuxs.τ_apply_fromCoset
- theorem Grp.SurjectiveOfEpiAuxs.τ_apply_infinity
- theorem Grp.SurjectiveOfEpiAuxs.τ_symm_apply_fromCoset
- theorem Grp.SurjectiveOfEpiAuxs.τ_symm_apply_infinity
- theorem Grp.epi_iff_range_eq_top
- theorem Grp.epi_iff_surjective
- theorem Grp.ker_eq_bot_of_mono
- theorem Grp.mono_iff_injective
- theorem Grp.mono_iff_ker_eq_bot
- theorem Grp.surjective_of_epi
+ inductive GrpCat.SurjectiveOfEpiAuxs.XWithInfinity
+ theorem GrpCat.SurjectiveOfEpiAuxs.agree
+ theorem GrpCat.SurjectiveOfEpiAuxs.comp_eq
+ theorem GrpCat.SurjectiveOfEpiAuxs.fromCoset_eq_of_mem_range
+ theorem GrpCat.SurjectiveOfEpiAuxs.fromCoset_ne_of_nin_range
+ def GrpCat.SurjectiveOfEpiAuxs.g
+ theorem GrpCat.SurjectiveOfEpiAuxs.g_apply_fromCoset
+ theorem GrpCat.SurjectiveOfEpiAuxs.g_apply_infinity
+ theorem GrpCat.SurjectiveOfEpiAuxs.g_ne_h
+ def GrpCat.SurjectiveOfEpiAuxs.h
+ theorem GrpCat.SurjectiveOfEpiAuxs.h_apply_fromCoset'
+ theorem GrpCat.SurjectiveOfEpiAuxs.h_apply_fromCoset
+ theorem GrpCat.SurjectiveOfEpiAuxs.h_apply_fromCoset_nin_range
+ theorem GrpCat.SurjectiveOfEpiAuxs.h_apply_infinity
+ theorem GrpCat.SurjectiveOfEpiAuxs.mul_smul
+ theorem GrpCat.SurjectiveOfEpiAuxs.one_smul
+ theorem GrpCat.SurjectiveOfEpiAuxs.τ_apply_fromCoset'
+ theorem GrpCat.SurjectiveOfEpiAuxs.τ_apply_fromCoset
+ theorem GrpCat.SurjectiveOfEpiAuxs.τ_apply_infinity
+ theorem GrpCat.SurjectiveOfEpiAuxs.τ_symm_apply_fromCoset
+ theorem GrpCat.SurjectiveOfEpiAuxs.τ_symm_apply_infinity
+ theorem GrpCat.epi_iff_range_eq_top
+ theorem GrpCat.epi_iff_surjective
+ theorem GrpCat.ker_eq_bot_of_mono
+ theorem GrpCat.mono_iff_injective
+ theorem GrpCat.mono_iff_ker_eq_bot
+ theorem GrpCat.surjective_of_epi
Modified Mathlib/Algebra/Category/Grp/EquivalenceGroupAddGroup.lean
- def AddCommGrp.toCommGrp
+ def AddCommGrpCat.toCommGrp
- def AddGrp.toGrp
+ def AddGrpCat.toGrp
- def CommGrp.toAddCommGrp
+ def CommGrpCat.toAddCommGrp
- def Grp.toAddGrp
+ def GrpCat.toAddGrp
+/- def commGroupAddCommGroupEquivalence
+/- def groupAddGroupEquivalence
Modified Mathlib/Algebra/Category/Grp/FilteredColimits.lean
- theorem Grp.FilteredColimits.G.mk_eq
- def Grp.FilteredColimits.colimitInvAux
- theorem Grp.FilteredColimits.colimitInvAux_eq_of_rel
- theorem Grp.FilteredColimits.colimit_inv_mk_eq
- theorem Grp.FilteredColimits.colimit_mul_mk_eq'
- theorem Grp.FilteredColimits.colimit_mul_mk_eq
- theorem Grp.FilteredColimits.colimit_one_eq
+ theorem GrpCat.FilteredColimits.G.mk_eq
+ def GrpCat.FilteredColimits.colimitInvAux
+ theorem GrpCat.FilteredColimits.colimitInvAux_eq_of_rel
+ theorem GrpCat.FilteredColimits.colimit_inv_mk_eq
+ theorem GrpCat.FilteredColimits.colimit_mul_mk_eq'
+ theorem GrpCat.FilteredColimits.colimit_mul_mk_eq
+ theorem GrpCat.FilteredColimits.colimit_one_eq
Modified Mathlib/Algebra/Category/Grp/FiniteGrp.lean
Modified Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean
- def AddCommGrp.coyonedaObjIsoForget
+ def AddCommGrpCat.coyonedaObjIsoForget
- def AddGrp.coyonedaObjIsoForget
+ def AddGrpCat.coyonedaObjIsoForget
- def CommGrp.coyonedaObjIsoForget
+ def CommGrpCat.coyonedaObjIsoForget
- def Grp.coyonedaObjIsoForget
+ def GrpCat.coyonedaObjIsoForget
Modified Mathlib/Algebra/Category/Grp/Images.lean
- def AddCommGrp.factorThruImage
- theorem AddCommGrp.image.fac
- theorem AddCommGrp.image.lift_fac
- def AddCommGrp.image.ι
- def AddCommGrp.image
- def AddCommGrp.monoFactorisation
+ def AddCommGrpCat.factorThruImage
+ theorem AddCommGrpCat.image.fac
+ theorem AddCommGrpCat.image.lift_fac
+ def AddCommGrpCat.image.ι
+ def AddCommGrpCat.image
+ def AddCommGrpCat.monoFactorisation
Modified Mathlib/Algebra/Category/Grp/Injective.lean
- theorem AddCommGrp.injective_as_module_iff
+ theorem AddCommGrpCat.injective_as_module_iff
Modified Mathlib/Algebra/Category/Grp/IsFinite.lean
- def AddCommGrp.isFinite
- theorem AddCommGrp.prop_isFinite_iff
+ def AddCommGrpCat.isFinite
+ theorem AddCommGrpCat.prop_isFinite_iff
Modified Mathlib/Algebra/Category/Grp/Kernels.lean
- def AddCommGrp.cokernelCocone
- def AddCommGrp.cokernelIsColimit
- def AddCommGrp.kernelCone
- def AddCommGrp.kernelIsLimit
+ def AddCommGrpCat.cokernelCocone
+ def AddCommGrpCat.cokernelIsColimit
+ def AddCommGrpCat.kernelCone
+ def AddCommGrpCat.kernelIsLimit
Modified Mathlib/Algebra/Category/Grp/LargeColimits.lean
- theorem AddCommGrp.hasColimit_iff_small_quot
- theorem AddCommGrp.isColimit_iff_bijective_desc
+ theorem AddCommGrpCat.hasColimit_iff_small_quot
+ theorem AddCommGrpCat.isColimit_iff_bijective_desc
Modified Mathlib/Algebra/Category/Grp/LeftExactFunctor.lean
Modified Mathlib/Algebra/Category/Grp/Limits.lean
- def AddCommGrp.kernelIsoKer
- def AddCommGrp.kernelIsoKerOver
- theorem AddCommGrp.kernelIsoKer_hom_comp_subtype
- theorem AddCommGrp.kernelIsoKer_inv_comp_ι
+ def AddCommGrpCat.kernelIsoKer
+ def AddCommGrpCat.kernelIsoKerOver
+ theorem AddCommGrpCat.kernelIsoKer_hom_comp_subtype
+ theorem AddCommGrpCat.kernelIsoKer_inv_comp_ι
- theorem CommGrp.hasLimit_iff_small_sections
+ theorem CommGrpCat.hasLimit_iff_small_sections
- theorem Grp.hasLimit_iff_small_sections
- def Grp.sectionsSubgroup
- def Grp.sectionsπMonoidHom
+ theorem GrpCat.hasLimit_iff_small_sections
+ def GrpCat.sectionsSubgroup
+ def GrpCat.sectionsπMonoidHom
Modified Mathlib/Algebra/Category/Grp/Preadditive.lean
- def AddCommGrp.homAddEquiv
- theorem AddCommGrp.hom_add
- theorem AddCommGrp.hom_add_apply
- theorem AddCommGrp.hom_neg
- theorem AddCommGrp.hom_nsmul
- theorem AddCommGrp.hom_sub
- theorem AddCommGrp.hom_zero
- theorem AddCommGrp.hom_zsmul
+ def AddCommGrpCat.homAddEquiv
+ theorem AddCommGrpCat.hom_add
+ theorem AddCommGrpCat.hom_add_apply
+ theorem AddCommGrpCat.hom_neg
+ theorem AddCommGrpCat.hom_nsmul
+ theorem AddCommGrpCat.hom_sub
+ theorem AddCommGrpCat.hom_zero
+ theorem AddCommGrpCat.hom_zsmul
Modified Mathlib/Algebra/Category/Grp/Subobject.lean
Modified Mathlib/Algebra/Category/Grp/Ulift.lean
- def CommGrp.uliftFunctorFullyFaithful
+ def CommGrpCat.uliftFunctorFullyFaithful
- def Grp.uliftFunctorFullyFaithful
+ def GrpCat.uliftFunctorFullyFaithful
Modified Mathlib/Algebra/Category/Grp/Yoneda.lean
- def CommGrp.coyoneda
- def CommGrp.coyonedaForget
- def CommGrp.coyonedaType
+ def CommGrpCat.coyoneda
+ def CommGrpCat.coyonedaForget
+ def CommGrpCat.coyonedaType
Modified Mathlib/Algebra/Category/Grp/ZModuleEquivalence.lean
Modified Mathlib/Algebra/Category/Grp/Zero.lean
- theorem CommGrp.isZero_of_subsingleton
+ theorem CommGrpCat.isZero_of_subsingleton
- theorem Grp.isZero_of_subsingleton
+ theorem GrpCat.isZero_of_subsingleton
Modified Mathlib/Algebra/Category/ModuleCat/AB.lean
Modified Mathlib/Algebra/Category/ModuleCat/Abelian.lean
Modified Mathlib/Algebra/Category/ModuleCat/Basic.lean
+/- def ModuleCat.mkOfSMul'
+/- def ModuleCat.smul
+/- def ModuleCat.smulNatTrans
Modified Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean
Modified Mathlib/Algebra/Category/ModuleCat/Colimits.lean
Modified Mathlib/Algebra/Category/ModuleCat/EnoughInjectives.lean
Modified Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean
+/- def ModuleCat.FilteredColimits.M
Modified Mathlib/Algebra/Category/ModuleCat/Limits.lean
Modified Mathlib/Algebra/Category/ModuleCat/Presheaf.lean
Modified Mathlib/Algebra/Category/ModuleCat/Presheaf/Colimits.lean
Modified Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean
Modified Mathlib/Algebra/Category/ModuleCat/Presheaf/Sheafification.lean
Modified Mathlib/Algebra/Category/ModuleCat/Presheaf/Sheafify.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/Abelian.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/Colimits.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/Free.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/Generators.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/Limits.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/PullbackContinuous.lean
Modified Mathlib/Algebra/Category/ModuleCat/Sheaf/Quasicoherent.lean
Modified Mathlib/Algebra/Category/ModuleCat/Tannaka.lean
Modified Mathlib/Algebra/Category/Ring/Adjunctions.lean
Modified Mathlib/Algebra/Category/Ring/Basic.lean
Modified Mathlib/Algebra/Category/Ring/FilteredColimits.lean
Modified Mathlib/Algebra/Category/Ring/Limits.lean
Modified Mathlib/Algebra/HierarchyDesign.lean
Modified Mathlib/Algebra/Homology/DerivedCategory/Ext/Basic.lean
Modified Mathlib/Algebra/Homology/DerivedCategory/Ext/ExactSequences.lean
Modified Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean
+/- def CochainComplex.HomComplex
Modified Mathlib/Algebra/Homology/ShortComplex/Ab.lean
+/- theorem CategoryTheory.ShortComplex.abLeftHomologyData_f'
Modified Mathlib/Algebra/Homology/ShortComplex/ConcreteCategory.lean
Modified Mathlib/AlgebraicGeometry/Modules/Sheaf.lean
Modified Mathlib/AlgebraicGeometry/Modules/Tilde.lean
Modified Mathlib/CategoryTheory/Abelian/Yoneda.lean
Modified Mathlib/CategoryTheory/Action/Basic.lean
Modified Mathlib/CategoryTheory/Adjunction/Additive.lean
Modified Mathlib/CategoryTheory/Galois/Prorepresentability.lean
Modified Mathlib/CategoryTheory/Generator/Preadditive.lean
Modified Mathlib/CategoryTheory/Linear/Yoneda.lean
Modified Mathlib/CategoryTheory/Monoidal/Cartesian/CommGrp_.lean
+/- def CommGrpObj.ofRepresentableBy
Modified Mathlib/CategoryTheory/Monoidal/Cartesian/Grp_.lean
+/- def GrpObj.ofRepresentableBy
+/- def yonedaGrp
+/- def yonedaGrpObj
+/- def yonedaGrpObjIsoOfRepresentableBy
Modified Mathlib/CategoryTheory/Monoidal/CommGrp_.lean
Modified Mathlib/CategoryTheory/Monoidal/CommMon_.lean
Modified Mathlib/CategoryTheory/Monoidal/Grp_.lean
Modified Mathlib/CategoryTheory/Monoidal/Internal/Types/CommGrp_.lean
+/- theorem CommGrpTypeEquivalenceCommGrp.inverse_obj_X
+/- theorem CommGrpTypeEquivalenceCommGrp.inverse_obj_inv
+/- theorem CommGrpTypeEquivalenceCommGrp.inverse_obj_mul
+/- theorem CommGrpTypeEquivalenceCommGrp.inverse_obj_one
Modified Mathlib/CategoryTheory/Monoidal/Internal/Types/Grp_.lean
Modified Mathlib/CategoryTheory/Monoidal/Mon_.lean
Modified Mathlib/CategoryTheory/Preadditive/Indization.lean
Modified Mathlib/CategoryTheory/Preadditive/Yoneda/Basic.lean
- def AddCommGrp.preadditiveCoyonedaIso
+ def AddCommGrpCat.preadditiveCoyonedaIso
+/- def CategoryTheory.preadditiveCoyoneda
+/- def CategoryTheory.preadditiveYoneda
Modified Mathlib/CategoryTheory/Preadditive/Yoneda/Injective.lean
Modified Mathlib/CategoryTheory/Preadditive/Yoneda/Projective.lean
Modified Mathlib/CategoryTheory/Sites/MayerVietorisSquare.lean
+/- theorem CategoryTheory.GrothendieckTopology.MayerVietorisSquare.isPushoutAddCommGrpFreeSheaf
Modified Mathlib/CategoryTheory/Sites/NonabelianCohomology/H1.lean
Modified Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean
Modified Mathlib/CategoryTheory/Triangulated/Yoneda.lean
Modified Mathlib/Geometry/Manifold/Sheaf/Smooth.lean
Modified Mathlib/GroupTheory/Abelianization/Defs.lean
Modified Mathlib/GroupTheory/FreeAbelianGroup.lean
Modified Mathlib/GroupTheory/FreeGroup/Basic.lean
Modified Mathlib/RepresentationTheory/Homological/GroupCohomology/LowDegree.lean
Modified Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean
Modified Mathlib/Topology/Sheaves/SheafCondition/UniqueGluing.lean
Modified MathlibTest/Algebra/Category/Grp/Injective.lean
Modified MathlibTest/CategoryTheory/ConcreteCategory/Grp.lean
Modified scripts/nolints_prime_decls.txt
2025-10-12 17:44:44 417cda3
feat: remove separability assumption from Algebra.norm_eq_norm_adjoin and Algebra.norm_eq_prod_roots (#30448)
Continuing the work of #30323 we remove the separability assumption from `Algebra.norm_eq_norm_adjoin` and `Algebra.norm_eq_prod_roots`.
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/Finite/GaloisField.lean
Modified Mathlib/NumberTheory/Cyclotomic/PrimitiveRoots.lean
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
Modified Mathlib/NumberTheory/NumberField/Norm.lean
+/- theorem RingOfIntegers.dvd_norm
+/- theorem RingOfIntegers.isUnit_norm_of_isGalois
Modified Mathlib/RingTheory/Discriminant.lean
Modified Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean
Modified Mathlib/RingTheory/Norm/Basic.lean
- theorem Algebra.norm_eq_norm_adjoin
- theorem Algebra.norm_eq_prod_automorphisms
- theorem Algebra.norm_eq_prod_embeddings
- theorem Algebra.norm_eq_prod_roots
Modified Mathlib/RingTheory/Norm/Transitivity.lean
+/- theorem Algebra.isIntegral_norm
+ theorem Algebra.norm_eq_norm_adjoin
+ theorem Algebra.norm_eq_prod_automorphisms
+ theorem Algebra.norm_eq_prod_embeddings
+ theorem Algebra.norm_eq_prod_roots
2025-10-12 16:50:20 74170ab
doc(CategoryTheory/Abelian/NonPreadditive): mention `NonPreadditiveAbelian.preadditive` in docstring of `NonPreadditiveAbelian` (#30469)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Abelian/NonPreadditive.lean
2025-10-12 15:57:33 efc2282
doc(CategoryTheory/Iso): mention `AsIso` and `inv` in the docstring for `IsIso` (#30467)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Iso.lean
2025-10-12 14:20:00 1a7fef6
feat(CategoryTheory): pseudofunctors to Cat (#25971)
This PR adds convenience lemmas for pseudofunctors to `Cat`, mostly using the `to_app` attribute. The simp set for the `to_app` attribute is extended in order to take into account that in `Cat`, associators and unitors induce identities.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Bicategory/Functor/Cat.lean
+ theorem CategoryTheory.Pseudofunctor.mapComp'_hom_naturality
+ theorem CategoryTheory.Pseudofunctor.mapComp'_inv_naturality
+ theorem CategoryTheory.Pseudofunctor.mapComp'_naturality_1
+ theorem CategoryTheory.Pseudofunctor.mapComp'_naturality_2
+ theorem CategoryTheory.Pseudofunctor.mapId'_hom_naturality
+ theorem CategoryTheory.Pseudofunctor.mapId'_inv_naturality
Modified Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean
Modified Mathlib/CategoryTheory/Bicategory/Grothendieck.lean
Modified Mathlib/CategoryTheory/Bicategory/Strict/Pseudofunctor.lean
+ theorem CategoryTheory.Pseudofunctor.mapComp'_comp_id_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'_comp_id_inv
- theorem CategoryTheory.Pseudofunctor.mapComp'_hom_comp_mapComp'_hom_whiskerRight
- theorem CategoryTheory.Pseudofunctor.mapComp'_hom_comp_whiskerLeft_mapComp'_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'_id_comp_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'_id_comp_inv
- theorem CategoryTheory.Pseudofunctor.mapComp'_inv_comp_mapComp'_hom
- theorem CategoryTheory.Pseudofunctor.mapComp'_inv_whiskerRight_comp_mapComp'_inv
+ theorem CategoryTheory.Pseudofunctor.mapComp'_inv_whiskerRight_mapComp'₀₂₃_inv
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₁₃_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₁₃_hom_comp_whiskerLeft_mapComp'_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₁₃_inv
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₁₃_inv_comp_mapComp'₀₂₃_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₂₃_hom
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₂₃_hom_comp_mapComp'_hom_whiskerRight
+ theorem CategoryTheory.Pseudofunctor.mapComp'₀₂₃_inv
- theorem CategoryTheory.Pseudofunctor.whiskerLeft_mapComp'_inv_comp_mapComp'_inv
+ theorem CategoryTheory.Pseudofunctor.whiskerLeft_mapComp'_inv_comp_mapComp'₀₁₃_inv
Modified Mathlib/Tactic/CategoryTheory/ToApp.lean
Modified MathlibTest/CategoryTheory/ToApp.lean
2025-10-12 13:56:13 cb38ed1
refactor(RingTheory/AdjoinRoot): generalise `algEquivOfAssociated` (#30456)
Generalise `algEquivOfAssociated` from fields to commutative rings, and use it to define `algEquivOfEq`. Also make the `f` and `g` arguments explicit to avoid there only being Prop arguments to the defs.
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
- theorem AdjoinRoot.algEquivOfAssociated_apply_root
- theorem AdjoinRoot.algEquivOfAssociated_toAlgHom
- theorem AdjoinRoot.algHomOfDvd_apply_root
- theorem AdjoinRoot.coe_algEquivOfAssociated
- theorem AdjoinRoot.coe_algHomOfDvd
Modified Mathlib/RingTheory/AdjoinRoot.lean
+ theorem AdjoinRoot.algEquivOfAssociated_root
+ theorem AdjoinRoot.algEquivOfAssociated_symm
+ theorem AdjoinRoot.algEquivOfAssociated_toAlgHom
- def AdjoinRoot.algEquivOfEq
+/- theorem AdjoinRoot.algEquivOfEq_root
+/- theorem AdjoinRoot.algEquivOfEq_symm
+ theorem AdjoinRoot.algEquivOfEq_toAlgHom
+ theorem AdjoinRoot.algHomOfDvd_root
+ theorem AdjoinRoot.coe_algEquivOfAssociated
+ theorem AdjoinRoot.coe_algEquivOfEq
+ theorem AdjoinRoot.coe_algHomOfDvd
2025-10-12 13:56:11 ef123dc
refactor(RingTheory/FinitePresentation): generalise instances (#30455)
Previously, they only proved that `R[X]` (or alike) is finitely presented over `R`. Now they prove that `A[X]` is finite presented over `R` if `A` is. As a result, generalise the (non-)instance for `AdjoinRoot` and make it an instance
ESTIMATED CHANGES
Modified Mathlib/RingTheory/AdjoinRoot.lean
- theorem AdjoinRoot.finitePresentation
- theorem AdjoinRoot.finiteType
Modified Mathlib/RingTheory/FinitePresentation.lean
2025-10-12 13:56:09 5fb64f8
feat(Counterexamples): Euler's sum of powers conjecture (#29110)
feat(Counterexamples): Euler's sum of powers conjecture
ESTIMATED CHANGES
Modified Counterexamples.lean
Added Counterexamples/EulerSumOfPowers.lean
+ theorem Counterexample.LanderParkinSelfridgeConjecture_of_sumOfPowersConjectureWith
+ theorem Counterexample.existsEqualSumsOfLikePowersFor_of_sumOfPowersConjectureWith
+ theorem Counterexample.fermatLastTheoremWith_of_sumOfPowersConjectureWith
+ theorem Counterexample.fermatLastTheorem_of_sumOfPowersConjecture
+ theorem Counterexample.sumOfPowersConjectureFor_five_false
+ theorem Counterexample.sumOfPowersConjectureFor_four_false
+ theorem Counterexample.sumOfPowersConjectureFor_le_three
+ theorem Counterexample.sumOfPowersConjectureWith_three_iff_fermatLastTheoremWith_three
+ theorem Counterexample.sumOfPowersConjecture_of_injective
+ theorem Counterexample.sumOfPowersConjecture_of_ringHom
2025-10-12 13:15:53 36533cb
feat: `(Algebra.ofId R A).toRingHom = algebraMap R A` (#30454)
A simple lemma which is missing.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Hom.lean
+ theorem Algebra.toRingHom_ofId
Modified Mathlib/RingTheory/LocalRing/ResidueField/Instances.lean
2025-10-12 11:37:05 c4b611e
feat(LinearAlgebra/Matrix/PosDef): `vecMulVec a (star a)` is positive semi-definite (#29861)
The matrices `vecMulVec a (star a)` and `vecMulVec (star a) a` are always positive semi-definite.
ESTIMATED CHANGES
Modified Mathlib/Data/Matrix/Mul.lean
+ theorem exists_ne_zero_dotProduct_eq_zero
+ theorem not_injective_dotProduct_left
+ theorem not_injective_dotProduct_right
Modified Mathlib/LinearAlgebra/Matrix/PosDef.lean
+ theorem Matrix.PosDef.mul_conjTranspose_self
+ theorem Matrix.posSemidef_vecMulVec_self_star
+ theorem Matrix.posSemidef_vecMulVec_star_self
2025-10-12 08:25:40 29be66d
chore(Mathlib/Order/BooleanAlgebra/Basic): some golf (#30427)
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/SDiff.lean
Modified Mathlib/Order/BooleanAlgebra/Basic.lean
- theorem sdiff_eq_self_iff_disjoint'
+/- theorem sdiff_eq_self_iff_disjoint
+/- theorem sup_inf_inf_sdiff
2025-10-12 08:10:14 55c0690
chore: update Mathlib dependencies 2025-10-12 (#30453)
This PR updates the Mathlib dependencies.
[workflow run for this PR](https://github.com/leanprover-community/mathlib4/actions/runs/18440664752)
ESTIMATED CHANGES
Modified lake-manifest.json
2025-10-12 04:58:07 cfcfdad
chore(Order/Defs/PartialOrder): golf non-instance (#30062)
Golf `decidableLTOfDecidableLE`
ESTIMATED CHANGES
Modified Mathlib/Order/Defs/PartialOrder.lean
+/- def decidableLTOfDecidableLE
2025-10-12 03:26:04 4b9a202
CI: run a weekly linter workflow (#29769)
This PR adds a workflow analogous to the nightly regression lints, that reports possible refactors using the tactic analysis framework. Those would be too noisy or take too much time to run in regular CI.
As a first linter, we have the `mergeWithGrind` linter that reports when a sequence of tactics followed by `grind` can become just `grind`.
ESTIMATED CHANGES
Added .github/workflows/weekly-lints.yml
Modified Mathlib/Init.lean
2025-10-12 02:38:46 5f8806f
chore: update Mathlib dependencies 2025-10-12 (#30449)
This PR updates the Mathlib dependencies.
[workflow run for this PR](https://github.com/leanprover-community/mathlib4/actions/runs/18437370407)
ESTIMATED CHANGES
Modified lake-manifest.json
2025-10-12 00:30:37 54c708e
chore: adaptations for batteries#1456 (#30444)
ESTIMATED CHANGES
Modified Mathlib/Data/Fin/Basic.lean
- theorem Fin.coe_divNat
- theorem Fin.coe_modNat
- def Fin.divNat
- def Fin.modNat
Modified Mathlib/Logic/Equiv/Fin/Basic.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Binomial.lean
Modified lake-manifest.json
2025-10-12 00:03:53 11ddf68
feat(Combinatorics/SimpleGraph/Walk): `p.getVert` and `p.support.get` have the same range (#30225)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Walk.lean
+ theorem SimpleGraph.Walk.range_getVert_eq_range_support_getElem
2025-10-11 23:02:24 150a34d
feat: add `NullMeasurableSet` version of `setIntegral_mono_on` (#30385)
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Integral/Bochner/Set.lean
+ theorem MeasureTheory.setIntegral_mono_on_ae₀
+ theorem MeasureTheory.setIntegral_mono_on₀
Modified Mathlib/MeasureTheory/Integral/DominatedConvergence.lean
2025-10-11 23:02:22 c859402
chore(Algebra/BigOperators): move factorial theorem to `Data/Nat/Factorial/BigOperators` (#30183)
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Intervals.lean
- theorem Finset.prod_range_add_one_eq_factorial
Modified Mathlib/Analysis/SpecificLimits/Basic.lean
Modified Mathlib/Data/Nat/Factorial/BigOperators.lean
+ theorem Finset.prod_range_add_one_eq_factorial
+ theorem Nat.factorial_eq_prod_range_add_one
Modified Mathlib/Data/ZMod/Factorial.lean
Modified Mathlib/LinearAlgebra/Vandermonde.lean
2025-10-11 23:02:20 e2faeeb
feat: invariant dual submodules define Lie ideals (#29979)
Invariant dual submodules define Lie ideals
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Algebra/Lie/Weights/IsSimple.lean
+ theorem LieAlgebra.IsKilling.eq_top_of_invtSubmodule_ne_bot
Modified Mathlib/Algebra/Lie/Weights/RootSystem.lean
- theorem LieAlgebra.IsKilling.eq_top_of_invtSubmodule_ne_bot
Modified Mathlib/LinearAlgebra/RootSystem/Finite/Lemmas.lean
+ theorem RootPairing.pairingIn_eq_zero_of_add_notMem_of_sub_notMem
+ theorem RootPairing.pairing_eq_zero_of_add_notMem_of_sub_notMem
2025-10-11 22:15:14 698d306
chore(LinearAlgebra/TensorProduct/Finiteness): rename `_of_finite` lemmas to `_of_setFinite` (#30435)
`TensorProduct.exists_finite_submodule_of_finite` and its variants are confusing since the `finite` in the name refers to different things, so we change it to `_of_setFinite`.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/LinearDisjoint.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Finiteness.lean
- theorem TensorProduct.exists_finite_submodule_left_of_finite'
- theorem TensorProduct.exists_finite_submodule_left_of_finite
+ theorem TensorProduct.exists_finite_submodule_left_of_setFinite'
+ theorem TensorProduct.exists_finite_submodule_left_of_setFinite
- theorem TensorProduct.exists_finite_submodule_of_finite'
- theorem TensorProduct.exists_finite_submodule_of_finite
+ theorem TensorProduct.exists_finite_submodule_of_setFinite'
+ theorem TensorProduct.exists_finite_submodule_of_setFinite
- theorem TensorProduct.exists_finite_submodule_right_of_finite'
- theorem TensorProduct.exists_finite_submodule_right_of_finite
+ theorem TensorProduct.exists_finite_submodule_right_of_setFinite'
+ theorem TensorProduct.exists_finite_submodule_right_of_setFinite
Modified Mathlib/RingTheory/LinearDisjoint.lean
2025-10-11 22:15:12 a1428e3
feat(Combinatorics/SimpleGraph/Acyclic): a tree is a minimal connected graph (#30428)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
+ theorem SimpleGraph.isTree_iff_minimal_connected
2025-10-11 22:15:11 d8281f5
feat(Combinatorics/SimpleGraph/Acyclic): homomorphisms into an acyclic graph implies acyclic (#30317)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
+ theorem SimpleGraph.IsAcyclic.anti
+ theorem SimpleGraph.IsAcyclic.comap
+ theorem SimpleGraph.IsAcyclic.embedding
+ theorem SimpleGraph.IsAcyclic.induce
+ theorem SimpleGraph.IsAcyclic.isTree_connectedComponent
+ theorem SimpleGraph.IsAcyclic.of_comap
+ theorem SimpleGraph.IsAcyclic.of_map
+ theorem SimpleGraph.IsAcyclic.subgraph
+ theorem SimpleGraph.Iso.isAcyclic_iff
+ theorem SimpleGraph.Iso.isTree_iff
2025-10-11 22:15:09 69c9f3a
feat(Data/List/Nodup): `get` is bijective iff `count = 1` (#30223)
ESTIMATED CHANGES
Modified Mathlib/Data/List/Nodup.lean
+ theorem List.getElem_bijective_iff
+ theorem List.get_bijective_iff
2025-10-11 22:15:07 32acb95
chore(Data/List/Nodup): golf `nodup_iff_injective_get` (#30220)
ESTIMATED CHANGES
Modified Mathlib/Data/List/Nodup.lean
+/- theorem List.nodup_iff_injective_get
2025-10-11 22:15:04 bd91ab1
feat(Combinatorics/SimpleGraph/Paths): path iff `p.support.get` is injective (#30219)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Paths.lean
+ theorem SimpleGraph.Walk.isPath_iff_injective_get_support
2025-10-11 22:01:29 bdf1052
chore(Combinatorics/SimpleGraph): avoid importing linarith (#30430)
Avoid importing linarith, make minor style changes.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean
2025-10-11 22:01:27 e771538
feat(Combinatorics/SimpleGraph/Walk): `p.getVert` is `p.support.get` (#30205)
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Walk.lean
+ theorem SimpleGraph.Walk.getVert_comp_val_eq_get_support
+ theorem SimpleGraph.Walk.getVert_eq_getD_support
2025-10-11 21:45:57 ecf7753
chore: adaptations for batteries#1457 (#30447)
After [batteries#1457](https://github.com/leanprover-community/batteries/pull/1457) is merged:
- [x] Edit the lakefile to point to leanprover-community/batteries:main
- [x] Run lake update batteries
- [x] Merge leanprover-community/mathlib4:master
- [ ] Wait for CI and merge
ESTIMATED CHANGES
Modified Mathlib/Probability/ProbabilityMassFunction/Binomial.lean
Modified lake-manifest.json
2025-10-11 20:21:06 f9f5e91
feat(NumberTheory/ArithmeticFunction): add some lemmas (#30147)
feat(NumberTheory/ArithmeticFunction): add a few lemmas:
- `ζ` commutes with everything
- `f.ppow 1 = f` and `pow 1 = id`
- An expression for `σ` using prime factorization, generalizing `Nat.sum_divisors`
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/ArithmeticFunction.lean
+ theorem ArithmeticFunction.coe_zeta_mul_comm
+ theorem ArithmeticFunction.pow_one_eq_id
+ theorem ArithmeticFunction.ppow_one
+ theorem ArithmeticFunction.sigma_eq_prod_primeFactors_sum_range_factorization_pow_mul
+ theorem ArithmeticFunction.zeta_mul_comm
2025-10-11 20:00:54 702b830
feat: Ideal.ramificationIdx_mul_inertiaDeg_of_isLocalRing (#29729)
We add the special case `Ideal.ramificationIdx_mul_inertiaDeg_of_isLocalRing` of `Ideal.sum_ramification_inertia` in the local (DVR) case: the product of the ramification index and the inertia degree equals the degree of the field extension.
Also make the argument `p` implicit in `Ideal.sum_ramification_inertia`.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/RamificationInertia/Basic.lean
+ theorem Ideal.ramificationIdx_mul_inertiaDeg_of_isLocalRing
Modified Mathlib/NumberTheory/RamificationInertia/Galois.lean
Modified Mathlib/RingTheory/DedekindDomain/Basic.lean
+ theorem IsLocalRing.primesOver_eq
Modified Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean
+ theorem IsLocalRing.primesOverFinset_eq
2025-10-11 18:49:49 0c1a3a6
feat: bundled C^n maps supported in a fixed compact set (#30197)
Add a type of n-times continuously differentiable maps supported in a fixed compact set and related notation.
Co-authored by: @ADedecker
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean
+ def ContDiffMapSupportedIn.Simps.apply
+ theorem ContDiffMapSupportedIn.coe_copy
+ theorem ContDiffMapSupportedIn.copy_eq
+ theorem ContDiffMapSupportedIn.ext
+ theorem ContDiffMapSupportedIn.toFun_eq_coe
+ structure ContDiffMapSupportedIn
2025-10-11 18:15:05 831fa5a
chore: generalise extensionality lemmas for localization (#30173)
This PR generalises some extensionality lemmas for morphisms from localization. The codomains are generalised from `CommMonoid` to `Monoid`, and from `CommSemiring` to `Semiring`. Then two new extensionality lemmas for algebra morphisms are added.
Currently `Submonoid.LocalizationMap.epic_of_localizationMap` says that if `M` and `P` are commutative monoids, and `f : M →* N` is a localization map for a submonoid `S`, then two monoid homs `j k : N →* P` are equal if they are equal after composing with `f`. This PR relaxes the assumption on `P` from `CommMonoid` to `Monoid`. Similar generalisations are made in other places, and then two new lemmas for `AlgHom` are added.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Category/Ring/Instances.lean
Modified Mathlib/AlgebraicGeometry/StructureSheaf.lean
Modified Mathlib/GroupTheory/MonoidLocalization/Basic.lean
+/- theorem Submonoid.LocalizationMap.epic_of_localizationMap
Modified Mathlib/RingTheory/Localization/Basic.lean
+ theorem IsLocalization.algHom_ext
+ theorem Localization.algHom_ext
Modified Mathlib/RingTheory/Localization/Defs.lean
+/- theorem IsLocalization.monoidHom_ext
+/- theorem IsLocalization.ringHom_ext
2025-10-11 16:48:17 02905c8
docs(LinearAlgebra.Eigenspace.Basic): fix repeated word in module doc (#30434)
Replace Eigenvalues and eigenvalues by eigenvalues and eigenvectors
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean
2025-10-11 16:33:49 7950cd5
feat (RingTheory/HahnSeries/Multiplication): Add group instances to HahnModule (#29772)
This PR adds `Zero` and `AddCommGroup` instances to `HahnModule` when appropriate. We also add comparison lemmas for subtraction in the `AddCommGroup` case, and reorganize some `variables`.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/HahnSeries/Multiplication.lean
+/- theorem HahnModule.coeff_smul
+/- theorem HahnModule.of_add
+ theorem HahnModule.of_sub
+/- theorem HahnModule.of_symm_add
+ theorem HahnModule.of_symm_sub
+/- theorem HahnModule.of_symm_zero
+/- theorem HahnModule.of_zero
2025-10-11 15:38:08 b1b0f15
feat(RingTheory): an algebra that is an invertible module is isomorphic to the base ring (#29954)
This PR considers the case where we have an `R`-algebra `A` which is also an invertible `R`-module, then constructs an isomorphism between `R` and `A` as `R`-algebras:
```lean
variable (R A : Type*) [CommSemiring R] [Semiring A] [Algebra R A] [Module.Invertible R A]
def algEquivOfRing : R ≃ₐ[R] A :=
```
ESTIMATED CHANGES
Modified Mathlib/Algebra/Algebra/Equiv.lean
+ def LinearEquiv.algEquivOfRing
Modified Mathlib/RingTheory/PicardGroup.lean
+ theorem Module.Invertible.algEquivOfRing_apply
+ theorem Module.Invertible.leftInverse_iff_rightInverse
+ theorem Module.Invertible.leftInverse_of_rightInverse
+ def Module.Invertible.linearEquivOfLeftInverse
+ theorem Module.Invertible.linearEquivOfLeftInverse_apply
+ theorem Module.Invertible.linearEquivOfLeftInverse_symm_apply
+ def Module.Invertible.linearEquivOfRightInverse
+ theorem Module.Invertible.linearEquivOfRightInverse_apply
+ theorem Module.Invertible.linearEquivOfRightInverse_symm_apply
+ theorem Module.Invertible.of_isLocalization
+ theorem Module.Invertible.rightInverse_of_leftInverse
2025-10-11 15:22:30 cfb4670
docs(Analysis.Analytic.IsolatedZeros): Fix name of referenced theorem (#30433)
Fix the docstring for AnalyticOnNhd.preimage_mem_codiscreteWithin, the theorem to see also was missing "mem" in its name.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Analytic/IsolatedZeros.lean
2025-10-11 15:09:00 3da7809
feat: Hahn embedding theorem (#27268)
This proves [Hahn embedding theorem](https://en.wikipedia.org/wiki/Hahn_embedding_theorem), one among the 1000+ theorems project.
Note on file location: I originally placed it in Algebra/Order/Group, but got prompted that Algebra can't import Analysis (needed for `Real` being a `Rat`-module` and related fact), so now I moved it under HahnSeries
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Order/Module/HahnEmbedding.lean
Added Mathlib/RingTheory/HahnSeries/HahnEmbedding.lean
+ theorem hahnEmbedding_isOrderedAddMonoid
+ theorem hahnEmbedding_isOrderedModule_rat
Modified docs/1000.yaml
Modified docs/references.bib
2025-10-11 15:08:58 26fbcd9
feat: introduce Gram matrices (#25883)
A Gram matrix has entry `⟪v i, v j⟫` at `i j : n`, where `v : n → α` is an `InnerProductSpace 𝕜 α`.
Give this notion and show that Gram matrices are positive semi-definite.
This will be used later in order to show that the covariance matrix for Brownian Motion is positive semi-definite.
[](https://gitpod.io/from-referrer/)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/InnerProductSpace/GramMatrix.lean
+ def Matrix.gram
+ theorem Matrix.gram_apply
+ theorem Matrix.gram_single
+ theorem Matrix.gram_zero
+ theorem Matrix.isHermitian_gram
+ theorem Matrix.linearIndependent_of_posDef_gram
+ theorem Matrix.posDef_gram_iff_linearIndependent
+ theorem Matrix.posDef_gram_of_linearIndependent
+ theorem Matrix.posSemidef_gram
+ theorem Matrix.star_dotProduct_gram_mulVec
+ theorem Matrix.submatrix_gram
Modified Mathlib/MeasureTheory/Function/L2Space.lean
+ theorem MeasureTheory.L2.inner_indicatorConstLp_indicatorConstLp
+ theorem MeasureTheory.L2.inner_indicatorConstLp_one_indicatorConstLp_one
+ theorem MeasureTheory.L2.real_inner_indicatorConstLp_one_indicatorConstLp_one
2025-10-11 14:50:53 2fb8b41
chore(TangentCone): split `uniqueDiffWithinAt_convex` (#30376)
I need the new lemma for #24019
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/TangentCone.lean
+ theorem Convex.span_tangentConeAt
2025-10-11 14:31:45 723f276
feat(CategoryTheory): monomorphisms in Type are stable under transfinite compositions (#28219)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/Limits/Types/Shapes.lean
+ theorem CategoryTheory.Limits.Types.Types.pushoutCocone_inr_injective_of_isColimit
+ theorem CategoryTheory.Limits.Types.Types.pushoutCocone_inr_mono_of_isColimit
Added Mathlib/CategoryTheory/Types/Monomorphisms.lean
Added MathlibTest/CategoryTheory/TransfiniteComposition.lean
2025-10-11 13:15:51 a2df56f
feat(Filter): a finite set is eventually a subset of any exhaustion (#30152)
This will be used to prove a sort of compactness result for finite minors of a graph.
From the ProofBench workshop
ESTIMATED CHANGES
Modified Mathlib/Order/Filter/Finite.lean
+ theorem Filter.eventually_subset_of_finite
2025-10-11 10:18:21 bd2b5c4
feat(Analysis/SpecialFunctions/Log): one trivial fact about posLog (#30369)
This is a trivial fact about `posLog`.
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean
+ theorem Real.posLog_eq_log_max_one
2025-10-11 05:45:29 c4b0fc9
feat: a `PointedCone`-valued version of `Submodule.span` (#28140)
This is merely to guide typing.
From Toric
ESTIMATED CHANGES
Modified Mathlib/Geometry/Convex/Cone/Dual.lean
+/- theorem PointedCone.dual_span
Modified Mathlib/Geometry/Convex/Cone/Pointed.lean
+/- theorem PointedCone.mem_toConvexCone
+ theorem PointedCone.subset_span
2025-10-11 00:32:15 06d95e5
test(TacticAnalysis): ensure `classical`'s effects are picked up (#29501)
This test case used to fail, and needed a fix to the `classical` tactic in the standard library:
- [x] depends on: https://github.com/leanprover/lean4/pull/10332
ESTIMATED CHANGES
Modified MathlibTest/TacticAnalysis.lean
+ theorem forall_imp_iff_exists_imp
2025-10-10 19:44:16 2b8db8b
chore: some renames around `DiscreteTopology` (#30397)
Renames:
- `forall_open_iff_discrete` to `discreteTopology_iff_forall_isOpen`, for consistency with `discreteTopology_iff_forall_isClosed`
- `singletons_open_iff_discrete` to `discreteTopology_iff_isOpen_singleton`, for consistency with `discreteTopology_iff_singleton_mem_nhds`
ESTIMATED CHANGES
Modified Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean
Modified Counterexamples/SorgenfreyLine.lean
Modified Mathlib/Geometry/Manifold/ChartedSpace.lean
Modified Mathlib/Topology/Algebra/Group/Basic.lean
Modified Mathlib/Topology/Algebra/OpenSubgroup.lean
Modified Mathlib/Topology/Constructions.lean
Modified Mathlib/Topology/Covering.lean
Modified Mathlib/Topology/DiscreteQuotient.lean
Modified Mathlib/Topology/DiscreteSubset.lean
Modified Mathlib/Topology/Instances/Discrete.lean
Modified Mathlib/Topology/IsLocalHomeomorph.lean
Modified Mathlib/Topology/JacobsonSpace.lean
Modified Mathlib/Topology/Order.lean
+ theorem discreteTopology_iff_forall_isOpen
+ theorem discreteTopology_iff_isOpen_singleton
2025-10-10 19:12:55 c2f4acd
chore: switch arguments of `IsProperMap.comp` (#30406)
For consistency with the rest of the library (e.g [Continuous.comp](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Continuous.html#Continuous.comp))
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/ProperAction/Basic.lean
Modified Mathlib/Topology/Algebra/ProperAction/ProperlyDiscontinuous.lean
Modified Mathlib/Topology/Maps/Proper/Basic.lean
+/- theorem IsProperMap.comp
2025-10-10 18:04:37 89875f4
refactor: weaken HasPullbacks to HasPullback in MorphismProperty.Limits (#29812)
The `HasPullbacks` instance on a category `C` for defining the `baseChange` / pullback functor along a map `f : X -> Y` between their over categories can be weakened to just a `HasPullback` condition on `f`.
- [ ] depends on: #29795
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/CommSq.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Limits.lean
+/- theorem CategoryTheory.MorphismProperty.baseChange_map
+/- theorem CategoryTheory.MorphismProperty.baseChange_obj
2025-10-10 17:24:26 3a3edd3
feat: the `ConvexCone` generated by a set (#25292)
Define `ConvexCone.copy` and `ConvexCone.hull` and use them to golf the `CompleteLattice` instance.
From Toric
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Cone/Basic.lean
Modified Mathlib/Geometry/Convex/Cone/Basic.lean
+ theorem ConvexCone.coe_hull_of_convex
+ theorem ConvexCone.copy_eq
+ theorem ConvexCone.disjoint_coe
+ theorem ConvexCone.disjoint_hull_left_of_convex
+ theorem ConvexCone.disjoint_hull_right_of_convex
+ theorem ConvexCone.gc_hull_coe
+ def ConvexCone.hull
+ theorem ConvexCone.hull_le_iff
+ theorem ConvexCone.hull_min
+ theorem ConvexCone.mem_hull_of_convex
+ theorem ConvexCone.subset_hull
2025-10-10 16:52:45 5e62b58
feat: add `LaxMonoidal` instance for `Applicative` functors (#30407)
Since similar conversions exist for `Functor`s and `Monad`s.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Monoidal/Functor/Types.lean
2025-10-10 16:18:36 5207100
feat(CategoryTheory/MarkovCategory): Add Markov category (#29925)
This PR introduces Markov categories, extending copy-discard categories with natural discard to model categorical probability theory.
This PR builds on #29939 and #29919 and was split up from #29657.
## Main additions
### 1. Markov categories (`MarkovCategory`)
Extends `CopyDiscardCategory` where discard is natural: `f ≫ ε[Y] = ε[X]` for all morphisms `f : X → Y`. This forces a probabilistic interpretation where morphisms preserve normalization (probability measures sum to 1).
## Mathematical significance
Markov categories capture probability theory categorically:
- Morphisms: Stochastic processes/Markov kernels
- Copy: Perfect correlation (both outputs always equal)
- Discard: Marginalization (integrating out variables)
- Natural discard: Preservation of total probability
The same framework handles finite probability (stochastic matrices), measure-theoretic
probability (Markov kernels), and quantum probability (completely positive maps).
## Design decisions
- Terminal unit follows from axioms. We prove `unit_terminal` and `unit_isTerminal` rather than assuming them
## Implementation notes
- Built on top of `CopyDiscardCategory` per suggestion [#mathlib4 > Markov categories PR @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Markov.20categories.20PR/near/539656225)
- Includes both computational (`unit_terminal`) and categorical (`unit_isTerminal`) characterizations of the terminal object
## References
Cho & Jacobs (2019) and Fritz (2020)
[](https://gitpod.io/from-referrer/)
- [x] depends on: #29939
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/MarkovCategory/Basic.lean
+ theorem CategoryTheory.MarkovCategory.eq_discard
+ def CategoryTheory.MarkovCategory.isTerminalUnit
Added MathlibTest/CategoryTheory/MarkovCategory.lean
2025-10-10 15:14:54 1ddcdac
chore: update Mathlib dependencies 2025-10-10 (#30401)
This PR updates the Mathlib dependencies.
[workflow run for this PR](https://github.com/leanprover-community/mathlib4/actions/runs/18408982943)
ESTIMATED CHANGES
Modified lake-manifest.json
2025-10-10 14:40:00 e978dd5
feat: `thickenedIndicator` is Lipschitz (#30346)
ESTIMATED CHANGES
Modified Mathlib/Data/ENNReal/Operations.lean
+ theorem ENNReal.sub_sub_sub_cancel_left
Modified Mathlib/Topology/MetricSpace/ThickenedIndicator.lean
+ theorem lipschitzWith_thickenedIndicator
+ theorem thickenedIndicatorAux_mono_infEdist
+ theorem thickenedIndicator_mono_infEdist
2025-10-10 14:00:11 108075f
feat(RingTheory/PowerSeries): Multipliable (1 + f i) for when the order tends to infinity (#30210)
As `Summable f` and `Multipliable (1 + f ·)` are often related, this shares the same condition as `summable_of_tendsto_order_atTop_nhds_top`
ESTIMATED CHANGES
Modified Mathlib/RingTheory/MvPowerSeries/PiTopology.lean
+ theorem MvPowerSeries.WithPiTopology.multipliable_one_add_of_tendsto_order_atTop_nhds_top
+ theorem MvPowerSeries.WithPiTopology.multipliable_one_add_of_tendsto_weightedOrder_atTop_nhds_top
+ theorem MvPowerSeries.WithPiTopology.summable_prod_of_tendsto_order_atTop_nhds_top
+ theorem MvPowerSeries.WithPiTopology.summable_prod_of_tendsto_weightedOrder_atTop_nhds_top
Modified Mathlib/RingTheory/PowerSeries/PiTopology.lean
+ theorem PowerSeries.WithPiTopology.multipliable_one_add_of_tendsto_order_atTop_nhds_top
+ theorem PowerSeries.WithPiTopology.summable_prod_of_tendsto_order_atTop_nhds_top
2025-10-10 13:18:00 5da8203
ci(update_dependencies.yml): use lake-manifest.json in working directory rather than HEAD (#30381)
This fixes an embarrassing mistake in #30095: the script currently compares `lake-manifest.json` in the `update-dependencies-bot-use-only` branch to itself rather than to the changes made in the working directory. This has caused the update workflow to fail to push changes for about a week or so.
ESTIMATED CHANGES
Modified .github/workflows/update_dependencies.yml
2025-10-10 11:36:11 883384f
fix(Tactic/NormNum): do not hang on large powers (#28311)
This uses `Lean.checkExponent` to guard against large powers.
Unfortunately the log messages it emits are currently swallowed, but surfacing these may require changing the API for norm_num extensions (to live in `OptionT MetaM`) and so is left to future work.
ESTIMATED CHANGES
Modified Mathlib/Tactic/NormNum/Pow.lean
Modified Mathlib/Tactic/Ring/Basic.lean
Modified MathlibTest/norm_num.lean
+ theorem large1
Modified MathlibTest/norm_num_ext.lean
2025-10-10 10:01:13 61e5c4c
style: fix capitalisation `Valued.isOpen_closedball -> Valued.isOpen_closedBall` (#30358)
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/Valued/LocallyCompact.lean
Modified Mathlib/Topology/Algebra/Valued/ValuationTopology.lean
+ theorem Valued.isOpen_closedBall
- theorem Valued.isOpen_closedball
2025-10-10 10:01:11 fae5d20
chore(Topology/ContinuousMap/CompactlySupported): golf `exists_add_nnrealPart_add_eq` (#30353)
This PR shortens the proof of `exists_add_nnrealPart_add_eq`, based on #29866
ESTIMATED CHANGES
Modified Mathlib/Topology/ContinuousMap/CompactlySupported.lean
2025-10-10 09:41:45 2e7f87e
feat: `IsRoot.mul_div_eq` (#30249)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/FieldDivision.lean
Modified Mathlib/RingTheory/AdjoinRoot.lean
2025-10-10 08:52:44 aec4d45
feat(NumberField/IsCM): compute ratio of regulators (#26104)
This PR continues the work from #23696.
Compute the ratio between the regulator of `K` and the regulator of its maximal real subfield.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/CMField.lean
+ theorem NumberField.IsCMField.closure_realFundSystem_sup_torsion
+ theorem NumberField.IsCMField.equivInfinitePlace_apply
+ theorem NumberField.IsCMField.equivInfinitePlace_symm_apply
+ theorem NumberField.IsCMField.regOfFamily_realFunSystem
+ theorem NumberField.IsCMField.regulator_div_regulator_eq_two_pow_mul_indexRealUnits_inv
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean
+ theorem NumberField.IsTotallyComplex.mult_eq
+ theorem NumberField.IsTotallyReal.mult_eq
2025-10-10 07:59:54 702baa5
chore(Order/Interval/Set): golf entire `{Icc,Ici,Ico,Iic,Iio,Ioc,Ioi,Ioo}_coe` (#30268)
ESTIMATED CHANGES
Modified Mathlib/Order/Interval/Set/WithBotTop.lean
+/- theorem WithBot.Icc_coe
+/- theorem WithBot.Ici_coe
+/- theorem WithBot.Ico_coe
+/- theorem WithBot.Ioc_coe
+/- theorem WithBot.Ioi_coe
+/- theorem WithBot.Ioo_coe
+/- theorem WithTop.Icc_coe
+/- theorem WithTop.Ico_coe
+/- theorem WithTop.Iic_coe
+/- theorem WithTop.Iio_coe
+/- theorem WithTop.Ioc_coe
+/- theorem WithTop.Ioo_coe
2025-10-10 06:53:31 029f3b6
refactor: weaken HasPullbacks to HasPullback in Over.Pullback (#29795)
Add an abbreviation `HasPullbackAlong f` to mean that all maps into the codomain of `f` have pullbacks along `f`. As discussed in zulip [#mathlib4 > Hom.HasPullback](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Hom.2EHasPullback/with/541055666)
The `HasPullbacks` instance on a category `C` for defining the pullback functor along a map `f : X -> Y` between their over categories can be weakened to just a `HasPullbackAlong` condition on `f`.
Dually, for `HasPushout` and undercategories.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Comma/Over/Pullback.lean
+/- def CategoryTheory.Over.mapPullbackAdj
+/- def CategoryTheory.Over.postAdjunctionLeft
+/- def CategoryTheory.Over.pullback
+/- def CategoryTheory.Over.pullbackComp
+/- def CategoryTheory.Under.mapPushoutAdj
+/- def CategoryTheory.Under.pushout
+/- def CategoryTheory.Under.pushoutComp
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean
2025-10-10 06:35:07 364c5af
chore(CategoryTheory/Subpresheaf): golf entire `of_equiv` (#30394)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Subpresheaf/Finite.lean
2025-10-10 05:35:26 4a3989c
chore(RingTheory/AdjoinRoot): move `AdjoinRoot.algEquivOfEq` earlier (#30300)
Before this PR it was in `Mathlib.FieldTheory.IntermediateField.Adjoin.Basic` and required `Field K`. This PR moves it to `Mathlib.RingTheory.AdjoinRoot` and replaces the `Field` assumption by `CommRing` while simplifying the proof.
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean
- theorem AdjoinRoot.algEquivOfEq_apply_root
- theorem AdjoinRoot.algEquivOfEq_toAlgHom
- theorem AdjoinRoot.coe_algEquivOfEq
Modified Mathlib/RingTheory/AdjoinRoot.lean
+/- theorem AdjoinRoot.aeval_eq
+ theorem AdjoinRoot.aeval_eq_of_algebra
+ def AdjoinRoot.algEquivOfEq
+ theorem AdjoinRoot.algEquivOfEq_root
+ theorem AdjoinRoot.algEquivOfEq_symm
2025-10-10 02:55:55 81a5aaa
feat: C⋆-algebras are spanned by their unitary elements (#30308)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/CStarAlgebra/Unitary/Span.lean
+ theorem CStarAlgebra.exists_sum_four_unitary
+ theorem CStarAlgebra.norm_smul_two_inv_smul_add_four_unitary
+ theorem CStarAlgebra.span_unitary
+ theorem IsSelfAdjoint.self_add_I_smul_cfcSqrt_sub_sq_mem_unitary
+ theorem selfAdjoint.realPart_unitarySelfAddISMul
+ theorem selfAdjoint.star_coe_unitarySelfAddISMul
2025-10-09 20:31:53 6955cd0
chore: drastically speed up `LieModule.Cohomology.d₂₃` (#30377)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Lie/Cochain.lean
2025-10-09 20:31:52 d71aff6
chore(CategoryTheory/Presentable/IsCardinalFiltered): fix name (#30306)
The wrong name `isFiltered_of_isCardinalDirected` is fixed: the correct name is `isFiltered_of_isCardinalFiltered`.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Abelian/GrothendieckCategory/ColimCoyoneda.lean
Modified Mathlib/CategoryTheory/Abelian/GrothendieckCategory/Subobject.lean
Modified Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean
- theorem CategoryTheory.isFiltered_of_isCardinalDirected
+ theorem CategoryTheory.isFiltered_of_isCardinalFiltered
Modified Mathlib/CategoryTheory/Presentable/Limits.lean
2025-10-09 20:05:03 d12bacd
chore(*): rename note 'CategoryTheory universes' to 'category theory universes' (#30360)
Discussed in #23767 but spun off to its own PR to keep the diff smaller.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Adjunction/Opposites.lean
Modified Mathlib/CategoryTheory/Category/Basic.lean
Modified Mathlib/CategoryTheory/Comma/Arrow.lean
Modified Mathlib/CategoryTheory/Comma/Over/Basic.lean
Modified Mathlib/CategoryTheory/Comma/StructuredArrow/Basic.lean
Modified Mathlib/CategoryTheory/Comma/StructuredArrow/Small.lean
Modified Mathlib/CategoryTheory/Core.lean
Modified Mathlib/CategoryTheory/Discrete/Basic.lean
Modified Mathlib/CategoryTheory/EqToHom.lean
Modified Mathlib/CategoryTheory/Functor/Basic.lean
Modified Mathlib/CategoryTheory/Functor/Category.lean
Modified Mathlib/CategoryTheory/Groupoid.lean
Modified Mathlib/CategoryTheory/InducedCategory.lean
Modified Mathlib/CategoryTheory/Iso.lean
Modified Mathlib/CategoryTheory/Limits/Cones.lean
Modified Mathlib/CategoryTheory/Limits/Constructions/Over/Connected.lean
Modified Mathlib/CategoryTheory/Limits/FunctorCategory/Basic.lean
Modified Mathlib/CategoryTheory/Limits/HasLimits.lean
Modified Mathlib/CategoryTheory/Limits/Preserves/Basic.lean
Modified Mathlib/CategoryTheory/Monad/Basic.lean
Modified Mathlib/CategoryTheory/Monad/Kleisli.lean
Modified Mathlib/CategoryTheory/NatTrans.lean
Modified Mathlib/CategoryTheory/Opposites.lean
Modified Mathlib/CategoryTheory/PEmpty.lean
Modified Mathlib/CategoryTheory/PUnit.lean
Modified Mathlib/CategoryTheory/Types/Basic.lean
Modified Mathlib/CategoryTheory/Yoneda.lean
Modified Mathlib/Combinatorics/Quiver/Basic.lean
Modified Mathlib/Data/Opposite.lean
2025-10-09 19:29:37 a2e710e
feat: the Laplacian in Real is the second derivative (#30384)
ESTIMATED CHANGES
Modified Mathlib/Analysis/InnerProductSpace/Laplacian.lean
+ theorem InnerProductSpace.laplacianWithin_eq_iteratedDerivWithin_real
+ theorem InnerProductSpace.laplacian_eq_iteratedDeriv_real
2025-10-09 19:29:35 8b55e79
chore: use `fun_prop` in Homeomorph (#28929)
Let's make the continuity auto-parameters use `fun_prop`, instead of `continuity`.
Open question: should we use `first |fun_prop; |dsimp; fun_prop` instead?
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/Group/Measure.lean
Modified Mathlib/Topology/Algebra/Algebra/Equiv.lean
Modified Mathlib/Topology/Algebra/Constructions/DomMulAct.lean
Modified Mathlib/Topology/Algebra/ContinuousMonoidHom.lean
Modified Mathlib/Topology/Constructions/SumProd.lean
Modified Mathlib/Topology/Homeomorph/Defs.lean
2025-10-09 18:59:44 14871d5
chore(Topology): some more fun_prop tagging (#23137)
ESTIMATED CHANGES
Modified Mathlib/Dynamics/Flow.lean
Modified Mathlib/Topology/Algebra/Monoid.lean
2025-10-09 18:05:05 7014959
feat(Analysis/Polynomial/MahlerMeasure): add a couple of easy facts (#30370)
We add a couple of easy facts about `mahlerMeasure`.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Polynomial/MahlerMeasure.lean
+ theorem Polynomial.logMahlerMeasure_mul_eq_add_logMahelerMeasure
+ theorem Polynomial.mahlerMeasure_pos_of_ne_zero
+ theorem Polynomial.prod_mahlerMeasure_eq_mahlerMeasure_prod
2025-10-09 18:05:03 afac0c2
feat(LinearAlgebra): roots of charpoly are the eigenvalues/spectrum (#29478)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/LinearAlgebra/Determinant.lean
+/- theorem LinearMap.bot_lt_ker_of_det_eq_zero
+ theorem LinearMap.det_eq_zero_iff_ker_ne_bot
+ theorem LinearMap.finite_of_det_ne_one
Added Mathlib/LinearAlgebra/Eigenspace/Charpoly.lean
+ theorem Module.End.hasEigenvalue_iff_isRoot_charpoly
+ theorem Module.End.mem_spectrum_iff_isRoot_charpoly
Modified Mathlib/LinearAlgebra/Eigenspace/Matrix.lean
+ theorem LinearMap.spectrum_toMatrix'
+ theorem LinearMap.spectrum_toMatrix
+/- theorem Matrix.maxGenEigenspace_toLin'_diagonal_eq_eigenspace
+/- theorem Matrix.maxGenEigenspace_toLin_diagonal_eq_eigenspace
+ theorem Matrix.spectrum_toLin'
+ theorem Matrix.spectrum_toLin
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Eigs.lean
+/- theorem Matrix.det_eq_prod_roots_charpoly
+/- theorem Matrix.det_eq_prod_roots_charpoly_of_splits
+ theorem Matrix.mem_spectrum_iff_isRoot_charpoly
+ theorem Matrix.mem_spectrum_of_isRoot_charpoly
+/- theorem Matrix.trace_eq_sum_roots_charpoly
+/- theorem Matrix.trace_eq_sum_roots_charpoly_of_splits
2025-10-09 17:08:11 16d3e09
feat(Order/ScottContinuity): Scott continuity on product spaces (#26338)
Some further results on Scott Continuity:
- `scottContinuous_iff_map_sSup`: `f` is Scott continuous if and only if it commutes with `sSup` on directed sets
- `ScottContinuous_prod_of_ScottContinuous`: `f` is Scott continuous on a product space if it is Scott continuous in each variable
- `ScottContinuousOn.inf₂`: For complete linear orders, the meet operation is Scott continuous
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Order/Bounds/Basic.lean
+ theorem IsGLB.prod
+ theorem IsLUB.prod
+ theorem lowerBounds_prod
+ theorem upperBounds_prod
Modified Mathlib/Order/ScottContinuity.lean
Added Mathlib/Order/ScottContinuity/Complete.lean
+ theorem ScottContinuous.inf₂
+ theorem scottContinuous_iff_map_sSup
+ theorem scottContinuous_inf_left
+ theorem scottContinuous_inf_right
Added Mathlib/Order/ScottContinuity/Prod.lean
+ theorem ScottContinuous.fromProd
+ theorem ScottContinuous.prod
+ theorem ScottContinuousOn.fromProd
2025-10-09 16:24:41 724a6cb
feat(Cardinal/Finite): ENat powers and cardinality (#27216)
This PR continues the work from #25574.
Original PR: https://github.com/leanprover-community/mathlib4/pull/25574
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Data/ENat/Basic.lean
Added Mathlib/Data/ENat/Pow.lean
+ theorem ENat.epow_add
+ theorem ENat.epow_eq_one_iff
+ theorem ENat.epow_eq_zero_iff
+ theorem ENat.epow_left_mono
+ theorem ENat.epow_mul
+ theorem ENat.epow_natCast
+ theorem ENat.epow_one
+ theorem ENat.epow_right_mono
+ theorem ENat.epow_top
+ theorem ENat.epow_zero
+ theorem ENat.mul_epow
+ theorem ENat.one_epow
+ theorem ENat.one_le_epow
+ theorem ENat.top_epow
+ theorem ENat.top_epow_top
+ theorem ENat.zero_epow
+ theorem ENat.zero_epow_top
Modified Mathlib/SetTheory/Cardinal/Finite.lean
+ theorem ENat.card_eq_one_iff_unique
+ theorem ENat.card_fun
+/- theorem ENat.card_prod
+ theorem ENat.one_le_card_iff_nonempty
2025-10-09 15:27:05 0d2a45f
feat: `UniformEquiv.subtype` (#30361)
`e : α ≃ᵤ β` lifts to subtypes `{ a : α // p a } ≃ᵤ { b : β // q b }` provided `p = q ∘ e`.
ESTIMATED CHANGES
Modified Mathlib/Topology/UniformSpace/Basic.lean
+ theorem UniformContinuous.subtype_map
Modified Mathlib/Topology/UniformSpace/Equiv.lean
+ def UniformEquiv.subtype
2025-10-09 13:58:12 cc0d5cb
feat(IsCyclotomicExtension): some results for the sub-algebra case (#29665)
We add some results about cyclotomic extensions which are also contained in an extension `A ⊆ B` of rings. In this case,
the cyclotomic extension `IsCyclotomicExtension S A C` is determined by `S` and thus we can prove various statements such as the fact that the compositum of `A[ζₙ]` and `A[ζₘ]` is `A[ζₗ]` where `l` is the lcm of `n` and `m`.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean
+ theorem IntermediateField.isCyclotomicExtension_eq
+ theorem IntermediateField.isCyclotomicExtension_lcm_sup
+ theorem IntermediateField.isCyclotomicExtension_le_of_dvd
+ theorem IntermediateField.isCyclotomicExtension_singleton_iff_eq_adjoin
- theorem IsCyclotomicExtension.empty
+ theorem IsCyclotomicExtension.eq
+ theorem IsCyclotomicExtension.isCyclotomicExtension_zero_iff
+ theorem IsCyclotomicExtension.lcm_sup
+ theorem IsCyclotomicExtension.le_of_dvd
+ theorem IsCyclotomicExtension.mem_of_pow_eq_one
+ theorem isCyclotomicExtension_iff_eq_adjoin
+ theorem isCyclotomicExtension_singleton_iff_eq_adjoin
2025-10-09 13:01:55 b7b295a
chore (Topology/UniformSpace/Ultra): deprecate `IsTransitiveRel.mem_filter_prod_comm` (#30319)
ESTIMATED CHANGES
Modified Mathlib/Topology/UniformSpace/Ultra/Basic.lean
- theorem IsTransitiveRel.mem_filter_prod_comm
Modified Mathlib/Topology/UniformSpace/Ultra/Completion.lean
2025-10-09 13:01:52 946a829
feat(AlgebraicTopology/SimplicialSet): nondegenerate simplices in the standard simplex (#28395)
In this PR, we show that `d`-dimensional nondegenerate simplices in `Δ[n]` identify to `Fin (d + 1) ↪o Fin (n + 1)`.
(This PR also contains some general additional API for (non)degenerate simplices. For this reason, three definitions related to subcomplexes generated by a simplex had to be moved from `StdSimplex.lean` to `Subcomplex.lean`.)
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/SimplicialSet/Degenerate.lean
+ theorem SSet.Subcomplex.degenerate_eq_top_iff
+ theorem SSet.Subcomplex.eq_top_iff_contains_nonDegenerate
+ theorem SSet.Subcomplex.iSup_ofSimplex_nonDegenerate_eq_top
+ theorem SSet.Subcomplex.le_iff_contains_nonDegenerate
+ theorem SSet.Subcomplex.mem_degenerate_iff
+ theorem SSet.Subcomplex.mem_nonDegenerate_iff
+ theorem SSet.degenerate_app_apply
+ theorem SSet.degenerate_iff_of_isIso
+ theorem SSet.degenerate_iff_of_mono
+ theorem SSet.degenerate_le_preimage
+ theorem SSet.image_degenerate_le
+ def SSet.nonDegenerateEquivOfIso
+ theorem SSet.nonDegenerate_iff_of_isIso
+ theorem SSet.nonDegenerate_iff_of_mono
Modified Mathlib/AlgebraicTopology/SimplicialSet/Simplices.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean
- theorem SSet.Subcomplex.mem_ofSimplex_obj
- theorem SSet.Subcomplex.mem_ofSimplex_obj_iff
- theorem SSet.Subcomplex.ofSimplex_le_iff
+ def SSet.stdSimplex.isoNerve
+ theorem SSet.stdSimplex.isoNerve_hom_app_apply
+ theorem SSet.stdSimplex.isoNerve_inv_app_apply
+ theorem SSet.stdSimplex.mem_nonDegenerate_iff_mono
+ theorem SSet.stdSimplex.mem_nonDegenerate_iff_strictMono
+ theorem SSet.stdSimplex.monotone_apply
+ def SSet.stdSimplex.nonDegenerateEquiv
+ theorem SSet.stdSimplex.objEquiv_symm_mem_nonDegenerate_iff_mono
Modified Mathlib/AlgebraicTopology/SimplicialSet/Subcomplex.lean
+ theorem SSet.Subcomplex.mem_ofSimplex_obj
+ theorem SSet.Subcomplex.mem_ofSimplex_obj_iff
+ theorem SSet.Subcomplex.ofSimplex_le_iff
+ theorem SSet.Subcomplex.toRange_app_val
+ theorem SSet.Subcomplex.toRange_ι
Modified Mathlib/Order/Hom/Basic.lean
+ def ULift.orderIso
2025-10-09 12:15:26 e11b36c
feat: interpret `HasTemperateGrowth` in terms of `IsBigO` (#30251)
Prompted by some thinking about #30176
ESTIMATED CHANGES
Modified Mathlib/Analysis/Distribution/SchwartzSpace.lean
+ theorem Function.HasTemperateGrowth.isBigO
+ theorem Function.HasTemperateGrowth.isBigO_uniform
+ theorem Function.hasTemperateGrowth_iff_isBigO
2025-10-09 12:15:24 6a1dc6b
feat(GroupTheory): add DivisibleHull (#29275)
This is part of Hahn embedding theorem #27268, where an a ordered group is first embedded in a divisible group / Q-module. I am aware at #25662 there is also an ongoing rewrite of `LocalizedModule` that this PR uses. Hopefully I avoided interfering it by using mostly with public API.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Order/Monoid/Defs.lean
+ theorem IsOrderedCancelMonoid.of_mul_lt_mul_left
Added Mathlib/Algebra/Order/Monoid/PNat.lean
+ def PNat.equivNonZeroDivisorsNat
Modified Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean
- theorem le_of_pow_le_pow_left'
+ theorem pow_le_pow_iff_left
Modified Mathlib/Data/NNRat/Defs.lean
+/- theorem NNRat.divNat_zero
+ theorem NNRat.mk_zero
Added Mathlib/GroupTheory/DivisibleHull.lean
+ theorem DivisibleHull.archimedeanClassMk_mk_eq
+ def DivisibleHull.archimedeanClassOrderHom
+ def DivisibleHull.archimedeanClassOrderHomInv
+ def DivisibleHull.archimedeanClassOrderIso
+ theorem DivisibleHull.archimedeanClassOrderIso_apply
+ theorem DivisibleHull.archimedeanClassOrderIso_symm_apply
+ def DivisibleHull.coeAddMonoidHom
+ def DivisibleHull.coeOrderAddMonoidHom
+ theorem DivisibleHull.coe_add
+ theorem DivisibleHull.coe_inj
+ theorem DivisibleHull.coe_injective
+ theorem DivisibleHull.ind
+ def DivisibleHull.liftOn
+ theorem DivisibleHull.liftOn_mk
+ def DivisibleHull.liftOn₂
+ theorem DivisibleHull.liftOn₂_mk
+ def DivisibleHull.mk
+ theorem DivisibleHull.mk_add_mk
+ theorem DivisibleHull.mk_add_mk_left
+ theorem DivisibleHull.mk_eq_mk
+ theorem DivisibleHull.mk_eq_mk_iff_smul_eq_smul
+ theorem DivisibleHull.mk_le_mk
+ theorem DivisibleHull.mk_left_injective
+ theorem DivisibleHull.mk_lt_mk
+ theorem DivisibleHull.mk_zero
+ theorem DivisibleHull.neg_mk
+ theorem DivisibleHull.nnqsmul_mk
+ theorem DivisibleHull.nsmul_mk
+ theorem DivisibleHull.qsmul_def
+ theorem DivisibleHull.qsmul_mk
+ theorem DivisibleHull.qsmul_of_nonneg
+ theorem DivisibleHull.qsmul_of_nonpos
+ theorem DivisibleHull.zero_qsmul
+ theorem DivisibleHull.zsmul_mk
2025-10-09 11:58:52 b68e7aa
chore(Topology/Category): golf entire `finiteCoproduct.ι_desc_apply`, `piIsoPi_hom_apply`, `prodIsoProd_hom_apply` and `pullbackIsoProdSubtype_hom_apply` using `tauto` and `rfl` (#28574)
ESTIMATED CHANGES
Modified Mathlib/Topology/Category/CompHausLike/Limits.lean
Modified Mathlib/Topology/Category/TopCat/Limits/Products.lean
Modified Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean
2025-10-09 10:59:05 d554a18
refactor: make library notes a definition (#23767)
Make library notes a definition of `Unit` type, whose doc-string is the note's content. As a consequence,
- doc-gen will display all library notes without any custom logic,
- library notes are shown upon hover (via the use of the doc-string),
- go to definition for library notes is easy
Automate this using a macro, which also enforces that all library notes are inside the Mathlib.LibraryNote namespace.
*Temporarily*, we use the `library_note2` name; if/when the batteries version is changed, we can reclaim the original name.
This PR does not address how to *refer* to library notes nicely (in a way that is shown in the documentation, checked for typos, with sufficient imports ensured etc.). That is left to a future PR.
This is proposal 2a from this zulip discussion: [#mathlib4 > library notes @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/library.20notes/near/510614740)
ESTIMATED CHANGES
Modified Archive/Imo/Imo2019Q2.lean
Modified Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean
Modified Mathlib/Algebra/Category/Ring/Limits.lean
Modified Mathlib/Algebra/Group/Action/Defs.lean
Modified Mathlib/Algebra/Group/Conj.lean
Modified Mathlib/Algebra/Group/Defs.lean
Modified Mathlib/Algebra/Group/Hom/Defs.lean
Modified Mathlib/Algebra/Group/Pointwise/Set/Basic.lean
Modified Mathlib/Algebra/Group/Pointwise/Set/Scalar.lean
Modified Mathlib/Algebra/Group/Submonoid/Operations.lean
Modified Mathlib/Algebra/HierarchyDesign.lean
Modified Mathlib/Algebra/Order/Hom/Basic.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Note.lean
Modified Mathlib/Analysis/RCLike/Lemmas.lean
Modified Mathlib/CategoryTheory/Category/Basic.lean
Modified Mathlib/Data/NNRat/Defs.lean
Modified Mathlib/Data/Nat/Cast/Defs.lean
Modified Mathlib/Data/Nat/Init.lean
Modified Mathlib/Geometry/Manifold/Algebra/Monoid.lean
Modified Mathlib/Geometry/Manifold/ChartedSpace.lean
Modified Mathlib/Logic/Basic.lean
Modified Mathlib/Tactic/Basic.lean
+ def LibraryNote
Modified Mathlib/Tactic/NormNum/Basic.lean
Modified Mathlib/Tactic/SetLike.lean
Modified Mathlib/Tactic/Simps/Basic.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Defs.lean
Modified Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean
Modified Mathlib/Topology/Continuous.lean
2025-10-09 10:29:52 14d639d
feat(Geometry/Euclidean/Incenter): touchpoints in `interior` and `Sbtw` (#29837)
Add lemmas showing that touchpoints for the incenter are in the interior of a face, as is the touchpoint opposite a vertex for the excenter opposite that vertex, and corresponding `Sbtw` statements in the case of a triangle including `Sbtw` statements about the other touchpoints (not in the interior of a side) for an excenter in that case.
The `Sbtw` statements are expected to be used in followups together with #29656 to give statements about the incenter and excenters lying on angle bisectors as expressed in terms of angles involving vertices rather than touchpoints.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Euclidean/Incenter.lean
+ theorem Affine.Simplex.sign_excenterWeights_singleton_neg
+ theorem Affine.Simplex.sign_excenterWeights_singleton_pos
+ theorem Affine.Simplex.sign_touchpointWeights_singleton_neg
+ theorem Affine.Simplex.sign_touchpointWeights_singleton_pos
+ theorem Affine.Simplex.touchpointWeights_empty_pos
+/- theorem Affine.Simplex.touchpointWeights_eq_zero
+ theorem Affine.Simplex.touchpointWeights_singleton_neg
+ theorem Affine.Simplex.touchpointWeights_singleton_pos
+ theorem Affine.Simplex.touchpoint_empty_mem_interior_faceOpposite
+ theorem Affine.Simplex.touchpoint_singleton_mem_interior_faceOpposite
+ theorem Affine.Triangle.sbtw_touchpoint_empty
+ theorem Affine.Triangle.sbtw_touchpoint_singleton
+ theorem Affine.Triangle.touchpoint_singleton_sbtw
2025-10-09 10:11:32 66ed00a
feat(AlgebraicTopology): the type of non degenerate simplices of a simplicial set (#28224)
In this PR, we introduce the ordered type `X.N` of nondegenerate simplices in a simplicial set `X`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicTopology/SimplicialSet/Degenerate.lean
+ theorem SSet.mono_of_nonDegenerate
Added Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplices.lean
+ theorem SSet.N.cast_eq_self
+ theorem SSet.N.dim_le_of_le
+ theorem SSet.N.dim_lt_of_lt
+ theorem SSet.N.eq_iff
+ theorem SSet.N.le_iff
+ theorem SSet.N.le_iff_exists_mono
+ theorem SSet.N.mk'_surjective
+ def SSet.N.mk
+ theorem SSet.N.mk_surjective
+ theorem SSet.N.subcomplex_injective
+ theorem SSet.N.subcomplex_injective_iff
+ structure SSet.N
+ theorem SSet.S.existsUnique_n
+ theorem SSet.S.subcomplex_toN
+ theorem SSet.S.toN_eq_iff
+ def SSet.orderEmbeddingN
Modified Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean
+ theorem SSet.Subcomplex.mem_ofSimplex_obj_iff
Modified Mathlib/CategoryTheory/EpiMono.lean
+ def CategoryTheory.SplitEpi.op
+ def CategoryTheory.SplitMono.op
2025-10-09 10:11:29 4d783e9
feat(Combinatorics/Additive/VerySmallDoubling): weak non-commutative Kneser's theorem (#26660)
add theorem about the structure of a doubling smaller than the golden ratio
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Action/Pointwise/Finset.lean
+ theorem Finset.mul_mem_smul_finset_iff
Modified Mathlib/Combinatorics/Additive/VerySmallDoubling.lean
+ theorem Finset.doubling_lt_golden_ratio
2025-10-09 09:24:31 3305d4b
feat(Algebra/Group/Submonoid): add `(Add)Submonoid.closure_pi` (#29823)
This generalizes and moves some proofs from subgroups to submonoids in order to add `(Add)Submonoid.closure_pi`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Group/Subgroup/Finite.lean
+ theorem Subgroup.closure_pi
Added Mathlib/Algebra/Group/Submonoid/Finite.lean
+ theorem Submonoid.closure_pi
+ theorem Submonoid.pi_le_iff
+ theorem Submonoid.pi_mem_of_mulSingle_mem
+ theorem Submonoid.pi_mem_of_mulSingle_mem_aux
2025-10-09 09:24:29 917d337
feat(Geometry/Euclidean/Angle/Bisector): bisecting angles and equal distances (#29656)
Prove a lemma
```lean
/-- A point `p` is equidistant to two affine subspaces if and only if the angles at a point `p'`
in their intersection between `p` and its orthogonal projections onto the subspaces are equal. -/
lemma dist_orthogonalProjection_eq_iff_angle_eq {p p' : P} {s₁ s₂ : AffineSubspace ℝ P}
[s₁.direction.HasOrthogonalProjection] [s₂.direction.HasOrthogonalProjection]
(hp' : p' ∈ s₁ ⊓ s₂) :
haveI : Nonempty s₁ := ⟨p', hp'.1⟩
haveI : Nonempty s₂ := ⟨p', hp'.2⟩
dist p (orthogonalProjection s₁ p) = dist p (orthogonalProjection s₂ p) ↔
∠ p p' (orthogonalProjection s₁ p) = ∠ p p' (orthogonalProjection s₂ p) := by
```
that gives the basic fact relating equal distances to affine subspaces, and bisecting angles involving those subspaces, needed to connect `incenter` and `excenter` to bisecting angles. (Other pieces involved in getting such a statement for angles involving vertices of a triangle rather than just touchpoints include #29410, #29413, #29418 and their dependencies.)
I expect the new file `Bisector.lean` to be an appropriate place to end up with actual definitions of bisectors as submodules and affine subspaces; those definitions aren't needed for my immediate goals with `incenter` and `excenter`, but it seems appropriate to use such a file for lemmas relating to bisectors whether or not they explicitly involve such definitions.
I do expect to add similar statements involving oriented angles in a followup, so the imports of this new file should be expected to increase.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Geometry/Euclidean/Angle/Bisector.lean
+ theorem EuclideanGeometry.dist_orthogonalProjection_eq_iff_angle_eq
2025-10-09 08:14:14 1ed2bab
feat: remove separability assumption from Algebra.isIntegral_norm (#30323)
We generalize `Algebra.isIntegral_norm` removing the assumption that `L/K` is separable.
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/NumberField/Norm.lean
+/- theorem RingOfIntegers.algebraMap_norm_algebraMap
+/- theorem RingOfIntegers.coe_algebraMap_norm
+/- theorem RingOfIntegers.coe_norm
+/- theorem RingOfIntegers.norm_algebraMap
+/- theorem RingOfIntegers.norm_norm
Modified Mathlib/RingTheory/Ideal/Norm/RelNorm.lean
+/- theorem Ideal.relNorm_le_comap
+/- theorem Ideal.spanNorm_le_comap
Modified Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean
+/- def Algebra.intNormAux
+/- theorem Algebra.map_intNormAux
Modified Mathlib/RingTheory/Norm/Basic.lean
- theorem Algebra.isIntegral_norm
Modified Mathlib/RingTheory/Norm/Transitivity.lean
+ theorem Algebra.isIntegral_norm
Modified Mathlib/RingTheory/Polynomial/Eisenstein/IsIntegral.lean
2025-10-09 08:14:12 03556d0
feat(Data/Nat/BinaryRec): equational lemmas for variants of binary recursion (#30221)
Adds the missing equational lemmas for `binaryRec'` and `binaryRecFromOne`. The statements and implicitness are chosen to match the existing ones for `binaryRec`, which seem to work quite well.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/BinaryRec.lean
+ theorem Nat.binaryRec'_eq
+ theorem Nat.binaryRec'_one
+ theorem Nat.binaryRec'_zero
+ theorem Nat.binaryRecFromOne_eq
+ theorem Nat.binaryRecFromOne_one
+ theorem Nat.binaryRecFromOne_zero
2025-10-09 08:14:10 dc9234a
feat: Fernique's theorem for Gaussian distributions (#30167)
For a Gaussian measure on a second-countable normed space, there exists `C > 0` such that the function `x ↦ exp (C * ‖x‖ ^ 2)` is integrable. As a consequence, a Gaussian measure in a second-countable Banach space has finite moments of all orders.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Order/Field/Basic.lean
+ theorem two_mul_le_add_mul_sq
Modified Mathlib/Probability/Distributions/Gaussian/Basic.lean
Added Mathlib/Probability/Distributions/Gaussian/Fernique.lean
+ theorem ProbabilityTheory.IsGaussian.charFunDual_eq_of_forall_strongDual_eq_zero
+ theorem ProbabilityTheory.IsGaussian.charFunDual_eq_of_integral_eq_zero
+ theorem ProbabilityTheory.IsGaussian.eq_dirac_of_variance_eq_zero
+ theorem ProbabilityTheory.IsGaussian.exists_integrable_exp_sq
+ theorem ProbabilityTheory.IsGaussian.integrable_exp_sq_of_conv_neg
+ theorem ProbabilityTheory.IsGaussian.integrable_fun_id
+ theorem ProbabilityTheory.IsGaussian.integrable_id
+ theorem ProbabilityTheory.IsGaussian.integral_dual
+ theorem ProbabilityTheory.IsGaussian.integral_dual_conv_map_neg_eq_zero
+ theorem ProbabilityTheory.IsGaussian.map_rotation_eq_self
+ theorem ProbabilityTheory.IsGaussian.map_rotation_eq_self_of_forall_strongDual_eq_zero
+ theorem ProbabilityTheory.IsGaussian.memLp_id
+ theorem ProbabilityTheory.IsGaussian.memLp_two_fun_id
+ theorem ProbabilityTheory.IsGaussian.memLp_two_id
+ theorem ProbabilityTheory.IsGaussian.noAtoms
Modified docs/1000.yaml
2025-10-09 08:14:09 67f5eec
feat: composing a continuous multilinear map with continuous linear maps is analytic in both variables (#30111)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Analytic/CPolynomial.lean
+ theorem ContinuousMultilinearMap.analyticAt_uncurry_compContinuousLinearMap
+ theorem ContinuousMultilinearMap.analyticAt_uncurry_of_linear
+ theorem ContinuousMultilinearMap.analyticOnNhd_uncurry_compContinuousLinearMap
+ theorem ContinuousMultilinearMap.analyticOnNhd_uncurry_of_linear
+ theorem ContinuousMultilinearMap.analyticOn_uncurry_compContinuousLinearMap
+ theorem ContinuousMultilinearMap.analyticOn_uncurry_of_linear
+ theorem ContinuousMultilinearMap.analyticWithinAt_uncurry_compContinuousLinearMap
+ theorem ContinuousMultilinearMap.analyticWithinAt_uncurry_of_linear
+ theorem ContinuousMultilinearMap.cpolynomialAt_uncurry_compContinuousLinearMap
+ theorem ContinuousMultilinearMap.cpolynomialAt_uncurry_of_linear
+ theorem ContinuousMultilinearMap.cpolynomialOn_uncurry_compContinuousLinearMap
+ theorem ContinuousMultilinearMap.cpolyomialOn_uncurry_of_linear
Modified Mathlib/Analysis/NormedSpace/Multilinear/Basic.lean
+ theorem ContinuousLinearMap.coe_flipMultilinearEquiv
+ theorem ContinuousLinearMap.coe_symm_flipMultilinearEquiv
+ theorem ContinuousLinearMap.flipLinear_flipMultilinear
+ def ContinuousLinearMap.flipMultilinearEquiv
+ def ContinuousLinearMap.flipMultilinearEquivₗ
+ def ContinuousMultilinearMap.flipLinear
+ theorem ContinuousMultilinearMap.flipMultilinear_flipLinear
2025-10-09 08:14:07 760bc88
chore: move some results from `Analysis/Normed/Algebra/Spectrum` to `Analysis/{Real, Complex}/Spectrum` (#29916)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean
Added Mathlib/Analysis/Complex/Spectrum.lean
+ theorem QuasispectrumRestricts.real_iff
+ theorem SpectrumRestricts.real_iff
Modified Mathlib/Analysis/Normed/Algebra/Spectrum.lean
- theorem QuasispectrumRestricts.le_nnreal_iff
- theorem QuasispectrumRestricts.lt_nnreal_iff
- theorem QuasispectrumRestricts.nnreal_iff
- theorem QuasispectrumRestricts.nnreal_of_nonneg
- theorem QuasispectrumRestricts.real_iff
- theorem SpectrumRestricts.le_nnreal_iff
- theorem SpectrumRestricts.lt_nnreal_iff
- theorem SpectrumRestricts.nnreal_iff
- theorem SpectrumRestricts.nnreal_le_iff
- theorem SpectrumRestricts.nnreal_lt_iff
- theorem SpectrumRestricts.nnreal_of_nonneg
- theorem SpectrumRestricts.real_iff
- theorem coe_mem_spectrum_real_of_nonneg
Added Mathlib/Analysis/Real/Spectrum.lean
+ theorem QuasispectrumRestricts.le_nnreal_iff
+ theorem QuasispectrumRestricts.lt_nnreal_iff
+ theorem QuasispectrumRestricts.nnreal_iff
+ theorem QuasispectrumRestricts.nnreal_of_nonneg
+ theorem SpectrumRestricts.le_nnreal_iff
+ theorem SpectrumRestricts.lt_nnreal_iff
+ theorem SpectrumRestricts.nnreal_iff
+ theorem SpectrumRestricts.nnreal_le_iff
+ theorem SpectrumRestricts.nnreal_lt_iff
+ theorem SpectrumRestricts.nnreal_of_nonneg
+ theorem coe_mem_spectrum_real_of_nonneg
2025-10-09 08:14:05 6011733
chore(Algebra/Order/BigOperators/Group/{Finset, Multiset}): generalize results to `(Mul)(Add)LeftMono` (#29864)
Generalize some stuff from `IsOrdered(Add)Monoid` to `(Mul)(Add)LeftMono`.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/BigOperators/Group/Finset.lean
+/- theorem Finset.abs_sum_of_nonneg'
+/- theorem Finset.abs_sum_of_nonneg
+/- theorem Finset.apply_union_le_sum
+/- theorem Finset.exists_lt_of_prod_lt'
+/- theorem Finset.le_prod_nonempty_of_submultiplicative
+/- theorem Finset.le_prod_nonempty_of_submultiplicative_on_pred
+/- theorem Finset.le_prod_of_submultiplicative
+/- theorem Finset.le_prod_of_submultiplicative_on_pred
+/- theorem Finset.mul_le_prod
+/- theorem Finset.one_le_prod''
+/- theorem Finset.one_le_prod'
+/- theorem Finset.one_lt_prod_iff_of_one_le
+/- theorem Finset.pow_card_le_prod
+/- theorem Finset.prod_eq_one_iff_of_le_one'
+/- theorem Finset.prod_eq_one_iff_of_one_le'
+/- theorem Finset.prod_fiberwise_le_prod_of_one_le_prod_fiber'
+/- theorem Finset.prod_image_le_of_one_le
+/- theorem Finset.prod_le_one'
+/- theorem Finset.prod_le_pow_card
+/- theorem Finset.prod_le_prod'
+/- theorem Finset.prod_le_prod_fiberwise_of_prod_fiber_le_one'
+/- theorem Finset.prod_le_prod_of_subset_of_one_le'
+/- theorem Finset.prod_le_univ_prod_of_one_le'
+/- theorem Finset.prod_lt_one_iff_of_le_one
+/- theorem Finset.prod_mono_set_of_one_le'
+/- theorem Finset.single_le_prod'
Modified Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean
+/- theorem Multiset.all_one_of_le_one_le_of_prod_eq_one
+/- theorem Multiset.one_le_prod_of_one_le
+/- theorem Multiset.pow_card_le_prod
+/- theorem Multiset.prod_le_pow_card
+/- theorem Multiset.prod_le_prod_map
+/- theorem Multiset.prod_le_prod_of_rel_le
+/- theorem Multiset.prod_map_le_prod
+/- theorem Multiset.prod_map_le_prod_map
+/- theorem Multiset.single_le_prod
Modified Mathlib/Algebra/Order/Group/Int/Sum.lean
Modified Mathlib/Data/NNRat/BigOperators.lean
Modified Mathlib/Tactic/Positivity/Finset.lean
2025-10-09 07:55:49 41c5057
feat(Algebra/HahnEmbedding): ArchimedeanStrata is non-empty (#30101)
This is a small part of #27268 (Hahn embedding theorem). Separated out for easy review while waiting for the other dependency.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Module/HahnEmbedding.lean
2025-10-09 02:34:28 5592362
feat: the Hölder conjugate of an `ENNReal` (#30174)
ESTIMATED CHANGES
Modified Mathlib/Data/Real/ConjExponents.lean
+ theorem ENNReal.HolderConjugate.inv_one_sub_inv'
2025-10-09 01:02:37 0b0ba00
chore(SimpleGraph/Subgraph): remove duplicate def and fix names (#29690)
We previously had `Subgraph.topEquiv` and `Subgraph.topIso` for the graph isomorphism `(⊤ : G.Subgraph).coe ≃g G`.
`Subgraph.topIso` seems preferable as a name for this so this PR deprecates the other name.
Also rename and deprecate `Subgraph.botEquiv` to `Subgraph.botIso`.
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/SimpleGraph/Subgraph.lean
- def SimpleGraph.Subgraph.botEquiv
+ def SimpleGraph.Subgraph.botIso
- def SimpleGraph.Subgraph.topEquiv
2025-10-08 22:58:46 3540854
feat (Algebra/Lie): Define low-degree cochains and differentials (#29154)
This PR defines 1-cochains and 2-cochains of a Lie algebra `L` with coefficients in an `L`-module `M`. This special case is useful for constructing central extensions of Lie algebras, while not needing the general machinery of Lie algebra cohomology.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Lie/Abelian.lean
+ def TrivialLieModule.equiv
+ def TrivialLieModule
Added Mathlib/Algebra/Lie/Cochain.lean
+ theorem LieModule.Cohomology.add_apply_apply
+ def LieModule.Cohomology.d₁₂
+ theorem LieModule.Cohomology.d₁₂_apply_apply
+ theorem LieModule.Cohomology.d₁₂_apply_apply_ofTrivial
+ def LieModule.Cohomology.d₂₃
+ theorem LieModule.Cohomology.d₂₃_apply
+ theorem LieModule.Cohomology.d₂₃_comp_d₁₂
+ theorem LieModule.Cohomology.mem_twoCocycle_iff
+ theorem LieModule.Cohomology.mem_twoCocycle_iff_of_trivial
+ theorem LieModule.Cohomology.smul_apply_apply
+ def LieModule.Cohomology.twoCochain
+ theorem LieModule.Cohomology.twoCochain_alt
+ theorem LieModule.Cohomology.twoCochain_skew
+ theorem LieModule.Cohomology.twoCochain_val_apply
+ def LieModule.Cohomology.twoCocycle
2025-10-08 22:31:47 9ccce5c
feat (TopCat.Sphere) : add the open ball, instances (#29789)
* Adds `𝔹 n`, the open `n`-ball, as a bundled object in `TopCat`, and accompanying notation and inclusion hom
* Adds instances witnessing that both inclusions are mono and that the disk and disk-boundary are compact
ESTIMATED CHANGES
Modified Mathlib/Topology/Category/TopCat/Sphere.lean
+ def TopCat.ballInclusion
Modified Mathlib/Topology/MetricSpace/ProperSpace.lean
2025-10-08 20:10:20 b6e83e5
chore: rename polynomial lemmas (#30270)
Renaming the lemmas `Polynomial.prod_roots_eq_coeff_zero_of_monic_of_splits` and `Polynomial.sum_roots_eq_nextCoeff_of_monic_of_split` to agree with the equality order.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Polynomial/Splits.lean
+ theorem Polynomial.coeff_zero_eq_prod_roots_of_monic_of_splits
+ theorem Polynomial.nextCoeff_eq_neg_sum_roots_of_monic_of_splits
- theorem Polynomial.prod_roots_eq_coeff_zero_of_monic_of_splits
- theorem Polynomial.sum_roots_eq_nextCoeff_of_monic_of_split
Modified Mathlib/LinearAlgebra/Matrix/Charpoly/Eigs.lean
Modified Mathlib/RingTheory/Norm/Basic.lean
Modified Mathlib/RingTheory/Trace/Basic.lean
2025-10-08 19:13:44 04ab3ec
feat (Algebra/Group/Action/Basic): add IsLeftCancelSMul (#28876)
This PR adds classes `IsLeftCancelSMul` and `IsLeftCancelVAdd`, for actions that are injective on the left. This property automatically holds for group actions, and for the left multiplication action of a left cancellative monoid.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Action/Defs.lean
+ theorem IsCancelSMul.left_cancel
+ theorem IsCancelSMul.right_cancel
+ theorem IsLeftCancelSMul.left_cancel
Modified Mathlib/Algebra/Order/AddTorsor.lean
2025-10-08 18:52:20 03f8d3a
feat(Algebra/Polynomial/Degree/SmallDegree): eq_quadratic_of_degree_le_two (#29981)
Expansion of a polynomial of degree 2.
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Polynomial/SmallDegreeVieta.lean
+ theorem Polynomial.eq_quadratic_of_degree_le_two
2025-10-08 18:11:42 61ed277
feat: currying as a measurable equivalence (#30161)
ESTIMATED CHANGES
Modified Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean
+ theorem measurable_curry
+ theorem measurable_equivCurry
+ theorem measurable_equivCurry_symm
+ theorem measurable_piCurry
+ theorem measurable_piCurry_symm
+ theorem measurable_sigmaCurry
+ theorem measurable_sigmaUncurry
+ theorem measurable_uncurry
Modified Mathlib/MeasureTheory/MeasurableSpace/Embedding.lean
+ theorem MeasurableEquiv.coe_curry
+ theorem MeasurableEquiv.coe_curry_symm
+ theorem MeasurableEquiv.coe_piCurry
+ theorem MeasurableEquiv.coe_piCurry_symm
+ def MeasurableEquiv.curry
+ def MeasurableEquiv.piCurry
2025-10-08 17:24:15 3c8f6c9
chore: rename `MonoidHom.toAdditive''` to `MonoidHom.toAdditiveLeft` (#29800)
and alike
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Action/End.lean
+/- def AddAction.toPermHom
Modified Mathlib/Algebra/Group/Equiv/TypeTags.lean
- def AddEquiv.toMultiplicative''
- def AddEquiv.toMultiplicative'
+ def AddEquiv.toMultiplicativeLeft
+ def AddEquiv.toMultiplicativeRight
Modified Mathlib/Algebra/Group/Nat/Hom.lean
Modified Mathlib/Algebra/Group/TypeTags/Hom.lean
- theorem AddMonoidHom.coe_toMultiplicative''
- theorem AddMonoidHom.coe_toMultiplicative'
+ theorem AddMonoidHom.coe_toMultiplicativeLeft
+ theorem AddMonoidHom.coe_toMultiplicativeRight
- def AddMonoidHom.toMultiplicative''
- def AddMonoidHom.toMultiplicative'
+ def AddMonoidHom.toMultiplicativeLeft
+ def AddMonoidHom.toMultiplicativeRight
- theorem MonoidHom.coe_toAdditive''
- theorem MonoidHom.coe_toAdditive'
+ theorem MonoidHom.coe_toAdditiveLeft
+ theorem MonoidHom.coe_toAdditiveRight
- def MonoidHom.toAdditive''
- def MonoidHom.toAdditive'
+ def MonoidHom.toAdditiveLeft
+ def MonoidHom.toAdditiveRight
Modified Mathlib/Algebra/Order/Hom/TypeTags.lean
- def OrderAddMonoidIso.toMultiplicative''
- def OrderAddMonoidIso.toMultiplicative'
+ def OrderAddMonoidIso.toMultiplicativeLeft
+ def OrderAddMonoidIso.toMultiplicativeRight
Modified Mathlib/Data/Finsupp/Ext.lean
Modified Mathlib/Data/Int/Cast/Lemmas.lean
Modified Mathlib/FieldTheory/KummerExtension.lean
Modified Mathlib/GroupTheory/ArchimedeanDensely.lean
Modified Mathlib/GroupTheory/FiniteAbelian/Basic.lean
Modified Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean
Modified Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean
Modified Mathlib/RingTheory/FreeCommRing.lean
Modified Mathlib/RingTheory/Valuation/RankOne.lean
2025-10-08 15:47:49 49fb0bc
feat(Algebra/Ring/Invertible): add `eq_of_invOf_add_eq_invOf_add_invOf` (#29477)
Formalize statement and prove eq_of_invOf_add_eq_invOf_add_invOf
⅟(a + b) = ⅟a + ⅟b → a * ⅟b * a = b * ⅟a * b (for a, b in a ring; a, b invertible)
This will be useful to formalize a proof in https://github.com/eric-wieser/lean-matrix-cookbook.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/Invertible.lean
+ theorem eq_of_invOf_add_eq_invOf_add_invOf
+ theorem neg_add_eq_mul_invOf_mul_same_iff
+ theorem neg_one_eq_invOf_mul_add_invOf_mul_iff
2025-10-08 14:28:43 c7bb793
feat: custom elaborators for differential geometry (#27021)
Add two sets of custom elaborators for differential geometry, to
- infer the model with corners in `MDifferentiable{WithinAt,At,On}` or `ContMDiff{WithinAt,At,On}` expressions from the local context, and provide shorter notation in that setting
- do the same for mfderiv: `mfderiv% f` is shorthand for `mfderiv I J f`; `mfderiv[s] f x` is short for `mfderivWithin I J f s`
- convert a fibre bundle section from a dependent section to a function into the total space, making working with differentiability of sections of fibre bundles less cumbersome
This was [discussed on zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Differential.20geometry.20elaborators.20experiment/with/528035295), to overall broad consensus.
This code has substantial tests (which have caught bugs in the past). It has also been tested in the branch in #26221 (uncovering minor issues, but not substantial ones
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Geometry/Manifold/Notation.lean
+ def Manifold.Elab.Elab.findModel
+ def Manifold.Elab.Elab.findModels
Added MathlibTest/DifferentialGeometry/Notation.lean
Modified scripts/noshake.json
2025-10-08 13:41:02 d9328bf
feat: separable but not second countable LOTS (#29920)
ESTIMATED CHANGES
Modified Counterexamples.lean
Added Counterexamples/SeparableNotSecondCountable.lean
+ theorem RealProdLexBool.not_secondCountableTopology
Modified Mathlib/Data/Prod/Lex.lean
+ theorem WCovBy.fst_ofLex
2025-10-08 13:06:36 f51758c
feat: exterior derivative of a differential form (#29985)
Define the exterior derivative of a differential form on a normed space
taking values in another normed space.
Also prove that $d^2\omega=0$ provided that $\omega$ is a sufficiently smooth form.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/Calculus/DifferentialForm/Basic.lean
+ theorem Filter.EventuallyEq.extDerivWithin'
+ theorem Filter.EventuallyEq.extDerivWithin_eq
+ theorem Filter.EventuallyEq.extDerivWithin_eq_nhds
+ theorem Filter.EventuallyEq.extDerivWithin_eq_of_insert
+ theorem Filter.EventuallyEq.extDerivWithin_eq_of_mem
+ theorem Filter.EventuallyEq.extDeriv_eq
+ theorem extDerivWithin_add
+ theorem extDerivWithin_apply
+ theorem extDerivWithin_congr'
+ theorem extDerivWithin_congr
+ theorem extDerivWithin_constOfIsEmpty
+ theorem extDerivWithin_extDerivWithin_apply
+ theorem extDerivWithin_extDerivWithin_eqOn
+ theorem extDerivWithin_fun_add
+ theorem extDerivWithin_fun_smul
+ theorem extDerivWithin_smul
+ theorem extDerivWithin_univ
+ theorem extDeriv_add
+ theorem extDeriv_apply
+ theorem extDeriv_constOfIsEmpty
+ theorem extDeriv_extDeriv
+ theorem extDeriv_extDeriv_apply
+ theorem extDeriv_fun_add
+ theorem extDeriv_fun_smul
+ theorem extDeriv_smul
Modified Mathlib/Analysis/NormedSpace/Alternating/Basic.lean
+ def ContinuousAlternatingMap.constOfIsEmptyLIE
Modified Mathlib/Analysis/NormedSpace/Alternating/Uncurry/Fin.lean
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_constOfIsEmptyLIE_comp
2025-10-08 12:44:23 595bf89
refactor(LinearAlgebra): move SesquilinearForm file in a SesquilinearForm folder (#30277)
This is motivated by #30274 where I create a new file in the folder for sesquilinear forms over a star ring.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/InnerProductSpace/Orthogonal.lean
Modified Mathlib/Analysis/InnerProductSpace/Symmetric.lean
Modified Mathlib/Analysis/LocallyConvex/Polar.lean
Modified Mathlib/LinearAlgebra/Dual/Lemmas.lean
Modified Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean
Modified Mathlib/LinearAlgebra/SesquilinearForm.lean
- theorem LinearEquiv.isAdjointPair_symm_iff
- theorem LinearMap.BilinForm.apply_apply_same_eq_zero_iff
- theorem LinearMap.BilinForm.apply_mul_apply_le_of_forall_zero_le
- theorem LinearMap.BilinForm.apply_mul_apply_lt_iff_linearIndependent
- theorem LinearMap.BilinForm.apply_smul_sub_smul_sub_eq
- theorem LinearMap.BilinForm.apply_sq_le_of_symm
- theorem LinearMap.BilinForm.apply_sq_lt_iff_linearIndependent_of_symm
- theorem LinearMap.BilinForm.nondegenerate_iff'
- theorem LinearMap.BilinForm.nondegenerate_iff
- theorem LinearMap.BilinForm.nondegenerate_restrict_iff_disjoint_ker
- theorem LinearMap.BilinForm.not_linearIndependent_of_apply_mul_apply_eq
- theorem LinearMap.BilinMap.isSymm_iff_eq_flip
- theorem LinearMap.IsAdjointPair.add
- theorem LinearMap.IsAdjointPair.comp
- theorem LinearMap.IsAdjointPair.mul
- theorem LinearMap.IsAdjointPair.smul
- theorem LinearMap.IsAdjointPair.sub
- def LinearMap.IsAdjointPair
- theorem LinearMap.IsAlt.eq_of_add_add_eq_zero
- theorem LinearMap.IsAlt.isRefl
- theorem LinearMap.IsAlt.neg
- theorem LinearMap.IsAlt.ortho_comm
- theorem LinearMap.IsAlt.self_eq_zero
- def LinearMap.IsAlt
- structure LinearMap.IsNonneg
- def LinearMap.IsOrtho
- def LinearMap.IsOrthogonal
- theorem LinearMap.IsOrthoᵢ.nondegenerate_of_not_isOrtho_basis_self
- theorem LinearMap.IsOrthoᵢ.not_isOrtho_basis_self_of_separatingLeft
- theorem LinearMap.IsOrthoᵢ.not_isOrtho_basis_self_of_separatingRight
- theorem LinearMap.IsOrthoᵢ.separatingLeft_of_not_isOrtho_basis_self
- theorem LinearMap.IsOrthoᵢ.separatingRight_iff_not_isOrtho_basis_self
- def LinearMap.IsOrthoᵢ
- def LinearMap.IsPairSelfAdjoint
- structure LinearMap.IsPosSemidef
- theorem LinearMap.IsRefl.domRestrict
- theorem LinearMap.IsRefl.eq_iff
- theorem LinearMap.IsRefl.eq_zero
- theorem LinearMap.IsRefl.flip_isRefl_iff
- theorem LinearMap.IsRefl.ker_eq_bot_iff_ker_flip_eq_bot
- theorem LinearMap.IsRefl.ker_flip_eq_bot
- theorem LinearMap.IsRefl.nondegenerate_iff_separatingLeft
- theorem LinearMap.IsRefl.nondegenerate_iff_separatingRight
- theorem LinearMap.IsRefl.ortho_comm
- def LinearMap.IsRefl
- def LinearMap.IsSkewAdjoint
- theorem LinearMap.IsSymm.domRestrict
- theorem LinearMap.IsSymm.isRefl
- theorem LinearMap.IsSymm.nondegenerate_restrict_of_isCompl_ker
- theorem LinearMap.IsSymm.ortho_comm
- structure LinearMap.IsSymm
- def LinearMap.Nondegenerate
- theorem LinearMap.SeparatingLeft.congr
- theorem LinearMap.SeparatingLeft.ne_zero
- def LinearMap.SeparatingLeft
- def LinearMap.SeparatingRight
- theorem LinearMap.disjoint_ker_of_nondegenerate_restrict
- theorem LinearMap.flip_nondegenerate
- theorem LinearMap.flip_separatingLeft
- theorem LinearMap.flip_separatingRight
- theorem LinearMap.isAdjointPair_id
- theorem LinearMap.isAdjointPair_iff_comp_eq_compl₂
- theorem LinearMap.isAdjointPair_one
- theorem LinearMap.isAdjointPair_zero
- theorem LinearMap.isAlt_iff_eq_neg_flip
- theorem LinearMap.isCompl_span_singleton_orthogonal
- theorem LinearMap.isNonneg_def
- theorem LinearMap.isNonneg_zero
- theorem LinearMap.isOrtho_def
- theorem LinearMap.isOrtho_flip
- theorem LinearMap.isOrtho_zero_left
- theorem LinearMap.isOrtho_zero_right
- theorem LinearMap.isOrthogonal_of_forall_apply_same
- theorem LinearMap.isOrthoᵢ_def
- theorem LinearMap.isOrthoᵢ_flip
- def LinearMap.isPairSelfAdjointSubmodule
- theorem LinearMap.isPairSelfAdjoint_equiv
- theorem LinearMap.isPosSemidef_def
- theorem LinearMap.isPosSemidef_zero
- theorem LinearMap.isSkewAdjoint_iff_neg_self_adjoint
- theorem LinearMap.isSymm_def
- theorem LinearMap.isSymm_iff_eq_flip
- theorem LinearMap.isSymm_zero
- theorem LinearMap.linearIndependent_of_isOrthoᵢ
- theorem LinearMap.mem_isPairSelfAdjointSubmodule
- theorem LinearMap.mem_selfAdjointSubmodule
- theorem LinearMap.mem_skewAdjointSubmodule
- theorem LinearMap.nondegenerate_restrict_of_disjoint_orthogonal
- theorem LinearMap.not_separatingLeft_zero
- theorem LinearMap.ortho_smul_left
- theorem LinearMap.ortho_smul_right
- theorem LinearMap.orthogonal_span_singleton_eq_to_lin_ker
- def LinearMap.selfAdjointSubmodule
- theorem LinearMap.separatingLeft_congr_iff
- theorem LinearMap.separatingLeft_iff_ker_eq_bot
- theorem LinearMap.separatingLeft_iff_linear_nontrivial
- theorem LinearMap.separatingRight_iff_flip_ker_eq_bot
- theorem LinearMap.separatingRight_iff_linear_flip_nontrivial
- def LinearMap.skewAdjointSubmodule
- theorem LinearMap.span_singleton_inf_orthogonal_eq_bot
- theorem LinearMap.span_singleton_sup_orthogonal_eq_top
- theorem Submodule.le_orthogonalBilin_orthogonalBilin
- theorem Submodule.mem_orthogonalBilin_iff
- def Submodule.orthogonalBilin
- theorem Submodule.orthogonalBilin_le
Added Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean
+ theorem LinearEquiv.isAdjointPair_symm_iff
+ theorem LinearMap.BilinForm.apply_apply_same_eq_zero_iff
+ theorem LinearMap.BilinForm.apply_mul_apply_le_of_forall_zero_le
+ theorem LinearMap.BilinForm.apply_mul_apply_lt_iff_linearIndependent
+ theorem LinearMap.BilinForm.apply_smul_sub_smul_sub_eq
+ theorem LinearMap.BilinForm.apply_sq_le_of_symm
+ theorem LinearMap.BilinForm.apply_sq_lt_iff_linearIndependent_of_symm
+ theorem LinearMap.BilinForm.nondegenerate_iff'
+ theorem LinearMap.BilinForm.nondegenerate_iff
+ theorem LinearMap.BilinForm.nondegenerate_restrict_iff_disjoint_ker
+ theorem LinearMap.BilinForm.not_linearIndependent_of_apply_mul_apply_eq
+ theorem LinearMap.BilinMap.isSymm_iff_eq_flip
+ theorem LinearMap.IsAdjointPair.add
+ theorem LinearMap.IsAdjointPair.comp
+ theorem LinearMap.IsAdjointPair.mul
+ theorem LinearMap.IsAdjointPair.smul
+ theorem LinearMap.IsAdjointPair.sub
+ def LinearMap.IsAdjointPair
+ theorem LinearMap.IsAlt.eq_of_add_add_eq_zero
+ theorem LinearMap.IsAlt.isRefl
+ theorem LinearMap.IsAlt.neg
+ theorem LinearMap.IsAlt.ortho_comm
+ theorem LinearMap.IsAlt.self_eq_zero
+ def LinearMap.IsAlt
+ structure LinearMap.IsNonneg
+ def LinearMap.IsOrtho
+ def LinearMap.IsOrthogonal
+ theorem LinearMap.IsOrthoᵢ.nondegenerate_of_not_isOrtho_basis_self
+ theorem LinearMap.IsOrthoᵢ.not_isOrtho_basis_self_of_separatingLeft
+ theorem LinearMap.IsOrthoᵢ.not_isOrtho_basis_self_of_separatingRight
+ theorem LinearMap.IsOrthoᵢ.separatingLeft_of_not_isOrtho_basis_self
+ theorem LinearMap.IsOrthoᵢ.separatingRight_iff_not_isOrtho_basis_self
+ def LinearMap.IsOrthoᵢ
+ def LinearMap.IsPairSelfAdjoint
+ structure LinearMap.IsPosSemidef
+ theorem LinearMap.IsRefl.domRestrict
+ theorem LinearMap.IsRefl.eq_iff
+ theorem LinearMap.IsRefl.eq_zero
+ theorem LinearMap.IsRefl.flip_isRefl_iff
+ theorem LinearMap.IsRefl.ker_eq_bot_iff_ker_flip_eq_bot
+ theorem LinearMap.IsRefl.ker_flip_eq_bot
+ theorem LinearMap.IsRefl.nondegenerate_iff_separatingLeft
+ theorem LinearMap.IsRefl.nondegenerate_iff_separatingRight
+ theorem LinearMap.IsRefl.ortho_comm
+ def LinearMap.IsRefl
+ def LinearMap.IsSkewAdjoint
+ theorem LinearMap.IsSymm.domRestrict
+ theorem LinearMap.IsSymm.isRefl
+ theorem LinearMap.IsSymm.nondegenerate_restrict_of_isCompl_ker
+ theorem LinearMap.IsSymm.ortho_comm
+ structure LinearMap.IsSymm
+ def LinearMap.Nondegenerate
+ theorem LinearMap.SeparatingLeft.congr
+ theorem LinearMap.SeparatingLeft.ne_zero
+ def LinearMap.SeparatingLeft
+ def LinearMap.SeparatingRight
+ theorem LinearMap.disjoint_ker_of_nondegenerate_restrict
+ theorem LinearMap.flip_nondegenerate
+ theorem LinearMap.flip_separatingLeft
+ theorem LinearMap.flip_separatingRight
+ theorem LinearMap.isAdjointPair_id
+ theorem LinearMap.isAdjointPair_iff_comp_eq_compl₂
+ theorem LinearMap.isAdjointPair_one
+ theorem LinearMap.isAdjointPair_zero
+ theorem LinearMap.isAlt_iff_eq_neg_flip
+ theorem LinearMap.isCompl_span_singleton_orthogonal
+ theorem LinearMap.isNonneg_def
+ theorem LinearMap.isNonneg_zero
+ theorem LinearMap.isOrtho_def
+ theorem LinearMap.isOrtho_flip
+ theorem LinearMap.isOrtho_zero_left
+ theorem LinearMap.isOrtho_zero_right
+ theorem LinearMap.isOrthogonal_of_forall_apply_same
+ theorem LinearMap.isOrthoᵢ_def
+ theorem LinearMap.isOrthoᵢ_flip
+ def LinearMap.isPairSelfAdjointSubmodule
+ theorem LinearMap.isPairSelfAdjoint_equiv
+ theorem LinearMap.isPosSemidef_def
+ theorem LinearMap.isPosSemidef_zero
+ theorem LinearMap.isSkewAdjoint_iff_neg_self_adjoint
+ theorem LinearMap.isSymm_def
+ theorem LinearMap.isSymm_iff_eq_flip
+ theorem LinearMap.isSymm_zero
+ theorem LinearMap.linearIndependent_of_isOrthoᵢ
+ theorem LinearMap.mem_isPairSelfAdjointSubmodule
+ theorem LinearMap.mem_selfAdjointSubmodule
+ theorem LinearMap.mem_skewAdjointSubmodule
+ theorem LinearMap.nondegenerate_restrict_of_disjoint_orthogonal
+ theorem LinearMap.not_separatingLeft_zero
+ theorem LinearMap.ortho_smul_left
+ theorem LinearMap.ortho_smul_right
+ theorem LinearMap.orthogonal_span_singleton_eq_to_lin_ker
+ def LinearMap.selfAdjointSubmodule
+ theorem LinearMap.separatingLeft_congr_iff
+ theorem LinearMap.separatingLeft_iff_ker_eq_bot
+ theorem LinearMap.separatingLeft_iff_linear_nontrivial
+ theorem LinearMap.separatingRight_iff_flip_ker_eq_bot
+ theorem LinearMap.separatingRight_iff_linear_flip_nontrivial
+ def LinearMap.skewAdjointSubmodule
+ theorem LinearMap.span_singleton_inf_orthogonal_eq_bot
+ theorem LinearMap.span_singleton_sup_orthogonal_eq_top
+ theorem Submodule.le_orthogonalBilin_orthogonalBilin
+ theorem Submodule.mem_orthogonalBilin_iff
+ def Submodule.orthogonalBilin
+ theorem Submodule.orthogonalBilin_le
Modified Mathlib/RingTheory/Polynomial/Wronskian.lean
2025-10-08 12:30:32 98ed3e3
feat: beta distribution (#26785)
Add the Beta distribution to the probability distributions in mathlib4
This PR introduces the Beta distribution on the reals.
Main definitions:
- betaPDFReal (α β x : ℝ) — the probability density function as a real-valued function
- betaPDF (α β x : ℝ) — the pdf as a ℝ≥0∞-valued function
- betaMeasure (α β : ℝ) — the probability measure associated with the Beta distribution
Main results:
- lintegral_betaPDF_eq_one — proof that the pdf integrates to 1 (normalization)
- Lemmas on positivity, measurability, and integrability of the pdf
- isProbabilityMeasureBeta — the Beta measure is a probability measure
Notes:
- Follows the general structure of other distributions in mathlib (e.g. Gamma).
- Several unused helper lemmas were removed, and proofs streamlined in response to reviewer feedback.
- Thanks to @EtienneC30 and @RemyDegenne for detailed reviews across multiple rounds.
This is a clean version of the PR originally opened as [#25608](https://github.com/leanprover-community/mathlib4/pull/25608) and temporarily migrated in [#26325](https://github.com/leanprover-community/mathlib4/pull/26325).
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean
+ theorem Complex.betaIntegral_eq_Gamma_mul_div
Added Mathlib/Probability/Distributions/Beta.lean
+ def ProbabilityTheory.betaMeasure
+ theorem ProbabilityTheory.betaPDFReal_pos
+ theorem ProbabilityTheory.betaPDF_eq
+ theorem ProbabilityTheory.betaPDF_eq_zero_of_nonpos
+ theorem ProbabilityTheory.betaPDF_eq_zero_of_one_le
+ theorem ProbabilityTheory.betaPDF_of_pos_lt_one
+ theorem ProbabilityTheory.beta_eq_betaIntegralReal
+ theorem ProbabilityTheory.beta_pos
+ theorem ProbabilityTheory.isProbabilityMeasureBeta
+ theorem ProbabilityTheory.lintegral_betaPDF
+ theorem ProbabilityTheory.lintegral_betaPDF_eq_one
+ theorem ProbabilityTheory.measurable_betaPDFReal
+ theorem ProbabilityTheory.stronglyMeasurable_betaPDFReal
2025-10-08 09:30:55 577300f
feat(CategoryTheory): the opposite of a property of objects (#30294)
This PR adds the prerequisites for the refactor PR #30269, mostly the addition of `ObjectProperty.op` and constructors for `ObjectProperty` given by families of objects.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/ObjectProperty/Basic.lean
+ inductive CategoryTheory.ObjectProperty.ofObj
+ theorem CategoryTheory.ObjectProperty.ofObj_apply
+ theorem CategoryTheory.ObjectProperty.ofObj_iff
+ theorem CategoryTheory.ObjectProperty.ofObj_le_iff
+ def CategoryTheory.ObjectProperty.pair
+ theorem CategoryTheory.ObjectProperty.pair_iff
+ theorem CategoryTheory.ObjectProperty.singleton_iff
+ theorem CategoryTheory.ObjectProperty.singleton_le_iff
+ inductive CategoryTheory.ObjectProperty.strictMap
+ theorem CategoryTheory.ObjectProperty.strictMap_iff
+ theorem CategoryTheory.ObjectProperty.strictMap_obj
+ theorem CategoryTheory.ObjectProperty.strictMap_ofObj
+ theorem CategoryTheory.ObjectProperty.strictMap_singleton
Added Mathlib/CategoryTheory/ObjectProperty/Opposite.lean
+ theorem CategoryTheory.ObjectProperty.op_iff
+ theorem CategoryTheory.ObjectProperty.op_injective
+ theorem CategoryTheory.ObjectProperty.op_injective_iff
+ theorem CategoryTheory.ObjectProperty.op_isoClosure
+ theorem CategoryTheory.ObjectProperty.op_monotone
+ theorem CategoryTheory.ObjectProperty.op_monotone_iff
+ theorem CategoryTheory.ObjectProperty.op_ofObj
+ theorem CategoryTheory.ObjectProperty.op_singleton
+ theorem CategoryTheory.ObjectProperty.op_unop
+ def CategoryTheory.ObjectProperty.subtypeOpEquiv
+ theorem CategoryTheory.ObjectProperty.unop_iff
+ theorem CategoryTheory.ObjectProperty.unop_injective
+ theorem CategoryTheory.ObjectProperty.unop_injective_iff
+ theorem CategoryTheory.ObjectProperty.unop_isoClosure
+ theorem CategoryTheory.ObjectProperty.unop_monotone
+ theorem CategoryTheory.ObjectProperty.unop_monotone_iff
+ theorem CategoryTheory.ObjectProperty.unop_ofObj
+ theorem CategoryTheory.ObjectProperty.unop_op
+ theorem CategoryTheory.ObjectProperty.unop_singleton
Modified Mathlib/CategoryTheory/ObjectProperty/Small.lean
2025-10-08 08:36:27 390a021
docs: use `CoxeterMatrix.Group` in doc-strings (#30304)
I observed this looking at the docs and noticing that `CoxeterMatrix.group` was not linked (second paragraph of [file#Mathlib.GroupTheory.Coxeter.Basic](https://leanprover-community.github.io/mathlib4_docs/Mathlib/GroupTheory/Coxeter/Basic.html)).
Also note that [docs#CoxeterMatrix.Group](https://leanprover-community.github.io/mathlib4_docs/Mathlib/GroupTheory/Coxeter/Basic.html#CoxeterMatrix.Group) exists, while [docs#CoxeterMatrix.group](https://leanprover-community.github.io/mathlib4_docs/Mathlib/GroupTheory/Coxeter/Basic.html#CoxeterMatrix.group) does not!
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Coxeter/Basic.lean
2025-10-08 08:36:26 ce443a7
feat(GroupTheory): finitely generated groups are quotients of free groups on finite generators (#30056)
This is equivalent to the formulation that finitely generated groups/monoids are quotients of FreeGroups/Monoids over the same generators, though I think the phrasing as a surjective homomorphism is more useful.
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Finiteness.lean
+ theorem Group.fg_iff_exists_freeGroup_hom_surjective
+ theorem Monoid.fg_iff_exists_freeMonoid_hom_surjective
Modified Mathlib/GroupTheory/FreeGroup/Basic.lean
+ theorem FreeGroup.closure_eq_range
2025-10-08 08:14:07 c32a3cf
feat(Probability): existence of independent random variables with a given sequence of distributions (#29959)
In some sense none of these are necessary, especially `exists_hasLaw`, because one could just use the identity or the projections of the product explicitly, but I think using these lemmas when one wants to introduce random variables in probabilistic proofs will be much more natural.
Also added needed `fun_prop` tags to `aemeasurable_id` lemmas which randomly generalized `charFun_map_smul` to
not need `SecondCountableTopology` (detected by the linter).
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/MeasureTheory/Measure/CharacteristicFunction.lean
+/- theorem MeasureTheory.charFun_map_smul
Modified Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean
Modified Mathlib/Probability/HasLaw.lean
Added Mathlib/Probability/HasLawExists.lean
+ theorem Measure.exists_hasLaw
+ theorem ProbabilityTheory.exists_hasLaw_indepFun
+ theorem ProbabilityTheory.exists_iid
2025-10-08 04:09:33 64ce1d7
feat: define positive semidefinite sesquilinear maps (#28162)
Following what is done for `IsSymm`, we duplicate the definition for bilinear forms.
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/BilinearForm/Properties.lean
+ structure LinearMap.BilinForm.IsNonneg
+ structure LinearMap.BilinForm.IsPosSemidef
+ theorem LinearMap.BilinForm.isNonneg_def
+ theorem LinearMap.BilinForm.isNonneg_iff
+ theorem LinearMap.BilinForm.isNonneg_zero
+ theorem LinearMap.BilinForm.isPosSemidef_def
+ theorem LinearMap.BilinForm.isPosSemidef_iff
+ theorem LinearMap.BilinForm.isPosSemidef_zero
Modified Mathlib/LinearAlgebra/SesquilinearForm.lean
+ structure LinearMap.IsNonneg
+ structure LinearMap.IsPosSemidef
+ theorem LinearMap.isNonneg_def
+ theorem LinearMap.isNonneg_zero
+ theorem LinearMap.isPosSemidef_def
+ theorem LinearMap.isPosSemidef_zero
2025-10-08 02:50:08 1464c2e
feat: add lemmata about selfadjoint elements (#30301)
This contains:
- a `NormedSpace 𝕜 (selfAdjoint E)` instance.
- `‖x * x‖ = ‖x‖ ^ 2` for selfadjoint `x` in a non-unital C⋆-ring.
- some improved `simp` lemmas for `realPart` and `imaginaryPart` which supersede existing ones.
ESTIMATED CHANGES
Modified Mathlib/Analysis/CStarAlgebra/Basic.lean
+ theorem IsSelfAdjoint.nnnorm_mul_self
+/- theorem IsSelfAdjoint.nnnorm_pow_two_pow
+ theorem IsSelfAdjoint.norm_mul_self
+ theorem IsSelfAdjoint.norm_pow_two_pow
- theorem selfAdjoint.nnnorm_pow_two_pow
Modified Mathlib/LinearAlgebra/Complex/Module.lean
+ theorem selfAdjoint.imaginaryPart_coe
+ theorem selfAdjoint.realPart_coe
2025-10-08 02:34:59 e503dc1
chore(LinearAlgebra/Matrix/PosDef): deprecate `PosSemidef.sqrt` in favour of `CFC` (#29896)
We deprecate `PosSemidef.sqrt` and all related results in favour of using more general results (i.e., `CFC.sqrt` and results in C*-algebras). This also defines the partial order and `StarOrderedRing` instances on matrices.
This also moves all results related to `PosSemidef.sqrt` to `Analysis/Matrix/Order` to minimize imports.
The partial order instance on matrices is scoped to `MatrixOrder` (analogous to `ComplexOrder`).
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean
+ theorem commute_iff_mul_nonneg
Added Mathlib/Analysis/Matrix/Order.lean
+ theorem Matrix.PosDef.commute_iff
+ def Matrix.PosDef.matrixInnerProductSpace
+ theorem Matrix.PosDef.posDef_sqrt
+ theorem Matrix.PosSemidef.commute_iff
+ theorem Matrix.PosSemidef.dotProduct_mulVec_zero_iff
+ theorem Matrix.PosSemidef.eq_sqrt_iff_sq_eq
+ theorem Matrix.PosSemidef.inv_sqrt
+ theorem Matrix.PosSemidef.isUnit_sqrt_iff
+ theorem Matrix.PosSemidef.posDef_iff_isUnit
+ theorem Matrix.PosSemidef.posSemidef_sqrt
+ theorem Matrix.PosSemidef.sq_eq_sq_iff
+ theorem Matrix.PosSemidef.sq_sqrt
+ theorem Matrix.PosSemidef.sqrt_eq_iff_eq_sq
+ theorem Matrix.PosSemidef.sqrt_eq_one_iff
+ theorem Matrix.PosSemidef.sqrt_eq_zero_iff
+ theorem Matrix.PosSemidef.sqrt_mul_self
+ theorem Matrix.PosSemidef.sqrt_sq
+ theorem Matrix.PosSemidef.toLinearMap₂'_zero_iff
+ theorem Matrix.instIsOrderedAddMonoid
+ theorem Matrix.instNonnegSpectrumClass
+ theorem Matrix.instStarOrderedRing
+ theorem Matrix.le_iff
+ theorem Matrix.nonneg_iff_posSemidef
+ theorem Matrix.posDef_iff_eq_conjTranspose_mul_self
+ theorem Matrix.posSemidef_iff_eq_conjTranspose_mul_self
+ theorem Matrix.posSemidef_iff_isHermitian_and_spectrum_nonneg
Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean
+ theorem CFC.mul_self_eq_mul_self_iff
+ theorem CFC.sq_eq_sq_iff
+ theorem CFC.sqrt_eq_one_iff'
+ theorem CFC.sqrt_eq_one_iff
Modified Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean
Modified Mathlib/LinearAlgebra/Matrix/PosDef.lean
- theorem Matrix.PosDef.commute_iff
- def Matrix.PosDef.matrixInnerProductSpace
- theorem Matrix.PosDef.posDef_sqrt
- theorem Matrix.PosSemidef.commute_iff
- def Matrix.PosSemidef.delabSqrt
- theorem Matrix.PosSemidef.dotProduct_mulVec_zero_iff
- theorem Matrix.PosSemidef.eq_of_sq_eq_sq
- theorem Matrix.PosSemidef.eq_sqrt_iff_sq_eq
- theorem Matrix.PosSemidef.inv_sqrt
- theorem Matrix.PosSemidef.isUnit_sqrt_iff
- theorem Matrix.PosSemidef.posDef_iff_isUnit
- theorem Matrix.PosSemidef.posSemidef_sqrt
- theorem Matrix.PosSemidef.sq_eq_sq_iff
- theorem Matrix.PosSemidef.sq_sqrt
- theorem Matrix.PosSemidef.sqrt_eq_iff_eq_sq
- theorem Matrix.PosSemidef.sqrt_eq_one_iff
- theorem Matrix.PosSemidef.sqrt_eq_zero_iff
- theorem Matrix.PosSemidef.sqrt_mul_self
- theorem Matrix.PosSemidef.sqrt_sq
- theorem Matrix.PosSemidef.toLinearMap₂'_zero_iff
+ theorem Matrix.PosSemidef.trace_eq_zero_iff
- theorem Matrix.posDef_iff_eq_conjTranspose_mul_self
- theorem Matrix.posSemidef_iff_eq_conjTranspose_mul_self
- theorem Matrix.posSemidef_iff_isHermitian_and_spectrum_nonneg
Deleted MathlibTest/PosDef.lean
2025-10-07 21:16:08 2634a31
chore(AlgebraicGeometry): replace `IsLocalAtTarget` by `IsZariskiLocalAtTarget` (#30310)
`IsZariskiLocalAtTarget` is an `abbrev` for `MorphismProperty.IsLocalAtTarget Scheme.zariskiPrecoverage`. The same is done for `Source`.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/AffineSpace.lean
Modified Mathlib/AlgebraicGeometry/Cover/Sigma.lean
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/AffineAnd.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
- theorem AlgebraicGeometry.HasAffineProperty.isLocalAtSource
+ theorem AlgebraicGeometry.HasAffineProperty.isZariskiLocalAtSource
- theorem AlgebraicGeometry.HasAffineProperty.of_isLocalAtTarget
+ theorem AlgebraicGeometry.HasAffineProperty.of_isZariskiLocalAtTarget
- theorem AlgebraicGeometry.IsLocalAtSource.comp
- theorem AlgebraicGeometry.IsLocalAtSource.iff_exists_resLE
- theorem AlgebraicGeometry.IsLocalAtSource.iff_of_iSup_eq_top
- theorem AlgebraicGeometry.IsLocalAtSource.iff_of_openCover
- theorem AlgebraicGeometry.IsLocalAtSource.isLocalAtTarget
- theorem AlgebraicGeometry.IsLocalAtSource.of_iSup_eq_top
- theorem AlgebraicGeometry.IsLocalAtSource.of_isOpenImmersion
- theorem AlgebraicGeometry.IsLocalAtSource.of_openCover
- theorem AlgebraicGeometry.IsLocalAtSource.resLE
- theorem AlgebraicGeometry.IsLocalAtSource.sigmaDesc
- theorem AlgebraicGeometry.IsLocalAtTarget.iff_of_iSup_eq_top
- theorem AlgebraicGeometry.IsLocalAtTarget.iff_of_openCover
- theorem AlgebraicGeometry.IsLocalAtTarget.of_iSup_eq_top
- theorem AlgebraicGeometry.IsLocalAtTarget.of_isPullback
- theorem AlgebraicGeometry.IsLocalAtTarget.of_openCover
- theorem AlgebraicGeometry.IsLocalAtTarget.of_range_subset_iSup
- theorem AlgebraicGeometry.IsLocalAtTarget.restrict
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.comp
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.iff_exists_resLE
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.iff_of_iSup_eq_top
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.iff_of_openCover
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.isZariskiLocalAtTarget
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.of_iSup_eq_top
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.of_isOpenImmersion
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.of_openCover
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.resLE
+ theorem AlgebraicGeometry.IsZariskiLocalAtSource.sigmaDesc
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.iff_of_iSup_eq_top
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.iff_of_openCover
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.of_iSup_eq_top
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.of_isPullback
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.of_openCover
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.of_range_subset_iSup
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.restrict
Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean
- theorem AlgebraicGeometry.AffineTargetMorphismProperty.isStableUnderBaseChange_of_isStableUnderBaseChangeOnAffine_of_isLocalAtTarget
+ theorem AlgebraicGeometry.AffineTargetMorphismProperty.isStableUnderBaseChange_of_isStableUnderBaseChangeOnAffine_of_isZariskiLocalAtTarget
- theorem AlgebraicGeometry.stalkwiseIsLocalAtTarget_of_respectsIso
+ theorem AlgebraicGeometry.stalkwiseIsZariskiLocalAtTarget_of_respectsIso
- theorem AlgebraicGeometry.stalkwise_isLocalAtSource_of_respectsIso
+ theorem AlgebraicGeometry.stalkwise_isZariskiLocalAtSource_of_respectsIso
- theorem AlgebraicGeometry.topologically_isLocalAtSource'
- theorem AlgebraicGeometry.topologically_isLocalAtSource
- theorem AlgebraicGeometry.topologically_isLocalAtTarget'
- theorem AlgebraicGeometry.topologically_isLocalAtTarget
+ theorem AlgebraicGeometry.topologically_isZariskiLocalAtSource'
+ theorem AlgebraicGeometry.topologically_isZariskiLocalAtSource
+ theorem AlgebraicGeometry.topologically_isZariskiLocalAtTarget'
+ theorem AlgebraicGeometry.topologically_isZariskiLocalAtTarget
- theorem AlgebraicGeometry.universally_isLocalAtSource
- theorem AlgebraicGeometry.universally_isLocalAtTarget
+ theorem AlgebraicGeometry.universally_isZariskiLocalAtSource
+ theorem AlgebraicGeometry.universally_isZariskiLocalAtTarget
Modified Mathlib/AlgebraicGeometry/Morphisms/Descent.lean
- theorem AlgebraicGeometry.IsLocalAtTarget.descendsAlong
- theorem AlgebraicGeometry.IsLocalAtTarget.descendsAlong_inf_quasiCompact
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.descendsAlong
+ theorem AlgebraicGeometry.IsZariskiLocalAtTarget.descendsAlong_inf_quasiCompact
- theorem AlgebraicGeometry.Scheme.exists_hom_isAffine_of_isLocalAtSource
+ theorem AlgebraicGeometry.Scheme.exists_hom_isAffine_of_isZariskiLocalAtSource
Modified Mathlib/AlgebraicGeometry/Morphisms/Finite.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Flat.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FormallyUnramified.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Immersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Integral.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/IsIso.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/LocalClosure.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/LocalIso.lean
- theorem AlgebraicGeometry.IsLocalIso.le_of_isLocalAtSource
+ theorem AlgebraicGeometry.IsLocalIso.le_of_isZariskiLocalAtSource
Modified Mathlib/AlgebraicGeometry/Morphisms/OpenImmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Preimmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Proper.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
- theorem AlgebraicGeometry.HasRingHomProperty.isLocal_ringHomProperty_of_isLocalAtSource_of_isLocalAtTarget
+ theorem AlgebraicGeometry.HasRingHomProperty.isLocal_ringHomProperty_of_isZariskiLocalAtSource_of_isZariskiLocalAtTarget
- theorem AlgebraicGeometry.HasRingHomProperty.of_isLocalAtSource_of_isLocalAtTarget
+ theorem AlgebraicGeometry.HasRingHomProperty.of_isZariskiLocalAtSource_of_isZariskiLocalAtTarget
Modified Mathlib/AlgebraicGeometry/Morphisms/Separated.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/SurjectiveOnStalks.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UnderlyingMap.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UniversallyInjective.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UniversallyOpen.lean
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean
Modified Mathlib/AlgebraicGeometry/Sites/MorphismProperty.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Local.lean
+ theorem CategoryTheory.MorphismProperty.IsLocalAtSource.mk_of_iff
+ theorem CategoryTheory.MorphismProperty.IsLocalAtTarget.mk_of_iff
Modified Mathlib/CategoryTheory/Sites/Precoverage.lean
2025-10-07 21:16:07 1ab7069
feat: a few lemmata about `ℂ` (#30305)
These are useful for facts about unitary elements in C⋆-algebras.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Complex/Basic.lean
+ theorem Complex.subset_slitPlane_iff_of_subset_sphere
Modified Mathlib/Analysis/Complex/Norm.lean
+ theorem Complex.normSq_ofReal_add_I_mul_sqrt_one_sub
+ theorem Complex.normSq_ofReal_sub_I_mul_sqrt_one_sub
+ theorem Complex.norm_sub_one_sq_eqOn_sphere
+ theorem Complex.norm_sub_one_sq_eq_of_norm_one
Modified Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean
+ theorem Complex.continuousOn_arg
2025-10-07 20:49:59 d88ac22
feat(Combinatorics/Quiver): add strongly connected quivers (#29754)
Define strongly connected quivers and their components. Add both standard strong connectivity (allowing length-0 paths) and positive-path strong connectivity. Establish basic properties and relationships to weak connectivity via symmetrification.
This is part of Perron Frobenius theorem and grounds its characterization/def of Irreducible matrices and Markov chain analysis in subsequent PRs.
split from #28728
ESTIMATED CHANGES
Modified Mathlib/Combinatorics/Quiver/ConnectedComponent.lean
+ theorem Quiver.IsSStronglyConnected.exists_pos_cycle
+ theorem Quiver.IsSStronglyConnected.exists_pos_path
+ theorem Quiver.IsSStronglyConnected.isStronglyConnected
+ def Quiver.IsSStronglyConnected
+ theorem Quiver.IsStronglyConnected.isSStronglyConnected_of_hom
+ theorem Quiver.IsStronglyConnected.isStronglyConnected_symmetrify
+ theorem Quiver.IsStronglyConnected.nonempty_path
+ def Quiver.IsStronglyConnected
+ theorem Quiver.StronglyConnectedComponent.IsSStronglyConnected.pos_cycle
+ theorem Quiver.StronglyConnectedComponent.mk_eq_mk
+ def Quiver.StronglyConnectedComponent
+ theorem Quiver.exists_path_of_stronglyConnectedComponent_eq
+ theorem Quiver.isSStronglyConnected_iff
+ theorem Quiver.isStronglyConnected_iff
+ theorem Quiver.stronglyConnectedComponent_eq_of_path
+ theorem Quiver.stronglyConnectedComponent_singleton_iff
+ def Quiver.stronglyConnectedSetoid
Modified Mathlib/Combinatorics/Quiver/Symmetric.lean
- def Quiver.IsPreconnected
2025-10-07 19:30:54 a673886
feat: toLp and ofLp are analytic (#28473)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/Analytic/WithLp.lean
+ theorem PiLp.analyticOn_ofLp
+ theorem PiLp.analyticOn_toLp
+ theorem WithLp.analyticOn_ofLp
+ theorem WithLp.analyticOn_toLp
2025-10-07 19:06:05 57004e7
chore(Analysis/LocallyConvex): deprecate `polar_weak_closed` (#28390)
ESTIMATED CHANGES
Modified Mathlib/Analysis/LocallyConvex/Polar.lean
- theorem LinearMap.polar_weak_closed
2025-10-07 17:36:42 20bb1ba
chore(Data): golf entire `equivFunOnFintype_single`, `predAbove_right_zero`, `snoc_zero` and more using `rfl` (#28561)
ESTIMATED CHANGES
Modified Mathlib/Data/DFinsupp/Defs.lean
Modified Mathlib/Data/Fin/Tuple/Basic.lean
Modified Mathlib/Data/Fin/Tuple/Take.lean
Modified Mathlib/Data/Finmap.lean
Modified Mathlib/Data/Finsupp/AList.lean
+/- theorem AList.empty_lookupFinsupp
Modified Mathlib/Data/Finsupp/Single.lean
+/- theorem Finsupp.zero_update
Modified Mathlib/Data/Matrix/Basic.lean
Modified Mathlib/Data/Matrix/Block.lean
Modified Mathlib/Data/PFunctor/Multivariate/W.lean
Modified Mathlib/Data/PFunctor/Univariate/M.lean
Modified Mathlib/Data/QPF/Multivariate/Constructions/Cofix.lean
Modified Mathlib/Data/Seq/Computation.lean
+/- theorem Computation.tail_think
Modified Mathlib/Data/Set/Piecewise.lean
Modified Mathlib/Data/Set/Sups.lean
+/- theorem Set.image_inf_prod
Modified Mathlib/Data/TypeVec.lean
+/- theorem TypeVec.dropFun_diag
Modified Mathlib/Data/Vector/Basic.lean
+/- theorem List.Vector.scanl_cons
Modified Mathlib/Data/Vector/Defs.lean
Modified Mathlib/Topology/Connected/PathConnected.lean
2025-10-07 17:22:51 14831fe
ci(label_new_contributor.yml): only trigger when PR is opened (#30162)
Currently, this is triggered even when new bots push a commit to a PR (e.g. the pre-commit.ci bot); adding the `types` filter will prevent the `new-contributor` label being added in such cases.
ESTIMATED CHANGES
Modified .github/workflows/label_new_contributor.yml
2025-10-07 15:54:03 1f467e3
feat: first main theorem of value distribution theory (#30103)
Establish the first main theorem of value distribution theory in full.
This PR completes a major milestone in [Project VD](https://github.com/kebekus/ProjectVD), which aims to formalize Value Distribution Theory for meromorphic functions on the complex plane.
ESTIMATED CHANGES
Modified Mathlib/Analysis/Complex/ValueDistribution/FirstMainTheorem.lean
- theorem ValueDistribution.abs_characteristic_sub_characteristic_shift_eqO
+ theorem ValueDistribution.characteristic_sub_characteristic_inv
+ theorem ValueDistribution.characteristic_sub_characteristic_inv_at_zero
+ theorem ValueDistribution.characteristic_sub_characteristic_inv_le
+ theorem ValueDistribution.characteristic_sub_characteristic_inv_of_ne_zero
+ theorem ValueDistribution.isBigO_characteristic_sub_characteristic_inv
+ theorem ValueDistribution.isBigO_characteristic_sub_characteristic_shift
Modified docs/overview.yaml
2025-10-07 15:26:30 1dcc303
feat: define `curveIntegral` (#24754)
Define the integral of a 1-form along a (piecewise smooth) path in a normed space.
This is a step towards a formalization of the Poincaré lemma for 1-forms.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Convex/PathConnected.lean
+ theorem Path.eqOn_extend_segment
Modified Mathlib/Analysis/Normed/Module/Basic.lean
+ theorem NormedSpace.restrictScalars_eq
Added Mathlib/MeasureTheory/Integral/CurveIntegral/Basic.lean
+ theorem ContinuousOn.curveIntegrable_of_contDiffOn
+ theorem CurveIntegrable.fun_neg
+ theorem CurveIntegrable.fun_zero
+ theorem CurveIntegrable.intervalIntegrable_curveIntegralFun_trans_left
+ theorem CurveIntegrable.intervalIntegrable_curveIntegralFun_trans_right
+ theorem CurveIntegrable.neg
+ theorem CurveIntegrable.refl
+ theorem CurveIntegrable.smul
+ theorem CurveIntegrable.zero
+ def CurveIntegrable
+ theorem HasFDerivAt.curveIntegral_segment_source'
+ theorem HasFDerivAt.curveIntegral_segment_source
+ theorem HasFDerivWithinAt.curveIntegral_segment_source'
+ theorem HasFDerivWithinAt.curveIntegral_segment_source
+ theorem curveIntegrable_cast_iff
+ theorem curveIntegrable_fun_neg_iff
+ theorem curveIntegrable_neg_iff
+ theorem curveIntegrable_restrictScalars_iff
+ theorem curveIntegrable_segment
+ theorem curveIntegrable_smul_iff
+ theorem curveIntegrable_symm
+ theorem curveIntegralFun_add
+ theorem curveIntegralFun_cast
+ theorem curveIntegralFun_def
+ theorem curveIntegralFun_fun_zero
+ theorem curveIntegralFun_neg
+ theorem curveIntegralFun_refl
+ theorem curveIntegralFun_restrictScalars
+ theorem curveIntegralFun_segment
+ theorem curveIntegralFun_smul
+ theorem curveIntegralFun_sub
+ theorem curveIntegralFun_symm
+ theorem curveIntegralFun_symm_apply
+ theorem curveIntegralFun_trans_aeeq_left
+ theorem curveIntegralFun_trans_aeeq_right
+ theorem curveIntegralFun_trans_of_half_lt
+ theorem curveIntegralFun_trans_of_lt_half
+ theorem curveIntegralFun_zero
+ theorem curveIntegral_add
+ theorem curveIntegral_cast
+ theorem curveIntegral_def
+ theorem curveIntegral_eq_intervalIntegral_deriv
+ theorem curveIntegral_fun_add
+ theorem curveIntegral_fun_neg
+ theorem curveIntegral_fun_smul
+ theorem curveIntegral_fun_sub
+ theorem curveIntegral_fun_zero
+ theorem curveIntegral_neg
+ theorem curveIntegral_of_not_completeSpace
+ theorem curveIntegral_refl
+ theorem curveIntegral_restrictScalars
+ theorem curveIntegral_segment
+ theorem curveIntegral_segment_const
+ theorem curveIntegral_smul
+ theorem curveIntegral_sub
+ theorem curveIntegral_symm
+ theorem curveIntegral_trans
+ theorem curveIntegral_zero
+ theorem norm_curveIntegral_segment_le
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean
- theorem IntervalIntegrable.congr
+ theorem IntervalIntegrable.congr_ae
+ theorem intervalIntegrable_congr
+ theorem intervalIntegrable_congr_ae
Modified Mathlib/MeasureTheory/Integral/IntervalIntegral/ContDiff.lean
2025-10-07 14:48:27 0bba669
chore: tidy various files (#30296)
ESTIMATED CHANGES
Modified Archive/Wiedijk100Theorems/CubingACube.lean
Modified Mathlib/Algebra/Group/Embedding.lean
Modified Mathlib/Algebra/Lie/Solvable.lean
Modified Mathlib/Algebra/Module/LinearMap/DivisionRing.lean
Modified Mathlib/Algebra/Order/BigOperators/Group/List.lean
Modified Mathlib/Algebra/Order/Floor/Ring.lean
Modified Mathlib/Algebra/Order/Ring/InjSurj.lean
Modified Mathlib/Algebra/Polynomial/Splits.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Commute.lean
Modified Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean
Modified Mathlib/Analysis/Calculus/FDeriv/Norm.lean
Modified Mathlib/Analysis/Polynomial/MahlerMeasure.lean
Modified Mathlib/Analysis/SpecialFunctions/Integrals/PosLogEqCircleAverage.lean
Modified Mathlib/CategoryTheory/Quotient.lean
Modified Mathlib/CategoryTheory/Sites/JointlySurjective.lean
Modified Mathlib/Combinatorics/Enumerative/IncidenceAlgebra.lean
Modified Mathlib/Combinatorics/SimpleGraph/Clique.lean
Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
Modified Mathlib/Data/Finsupp/BigOperators.lean
Modified Mathlib/Data/Nat/Digits/Defs.lean
Modified Mathlib/Data/Real/Embedding.lean
Modified Mathlib/FieldTheory/Minpoly/IsIntegrallyClosed.lean
Modified Mathlib/LinearAlgebra/Basis/Defs.lean
Modified Mathlib/LinearAlgebra/Dual/Lemmas.lean
Modified Mathlib/LinearAlgebra/Projectivization/Cardinality.lean
Modified Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean
Modified Mathlib/NumberTheory/ModularForms/Basic.lean
Modified Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean
Modified Mathlib/RingTheory/Flat/Tensor.lean
Modified Mathlib/RingTheory/Ideal/Int.lean
Modified Mathlib/RingTheory/Regular/Depth.lean
Modified Mathlib/Topology/Bases.lean
Modified Mathlib/Topology/CWComplex/Classical/Finite.lean
Modified Mathlib/Topology/Order/HullKernel.lean
2025-10-07 14:17:27 5cc7567
chore: fix formatting for deprecation dates (#30297)
Also update the date to when the PR (#27699) was actually landed.
ESTIMATED CHANGES
Modified Mathlib/Analysis/LocallyConvex/Polar.lean
Modified Mathlib/Topology/Algebra/Module/LinearMap.lean
2025-10-07 14:02:49 68d6b9a
ci: remove "CI Success" job (#30283)
Currently we have a job named "CI Success" which passes if and only if the "Lint style" and the "Post-Build Step" succeed. This was added in #25614 when we moved to a fork-based contribution model because I thought that bors would have trouble recognizing CI jobs on PRs from forks, since those job names end with "(fork)".
However, this was wrong: in fact, the `status` field in `bors.toml` only checks that the required status checks pass on the `staging` branch and doesn't apply to the PR branches at all. (There is a separate config field named `pr_status`, which checks that commits on PR branches have passed certain CI checks before `bors r+` works on them, but we haven't been using this.)
The downside of only having "CI Success" in the `status` field is that when an earlier job fails, bors won't be able to link to the logs of that run in the comments it posts on GitHub and Zulip. We could just add all of the earlier jobs to `status` and keep "CI Success", but since my original concern was unfounded, I've opted to just remove the unnecessary job completely and replace the `status` field with all "Build", "Lint style" and "Post-Build Step" so that all of the logs are easily available again.
Thanks to @kckennylau for bringing this up in [#mathlib4 > Build failed: CI Success](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Build.20failed.3A.20CI.20Success/with/543367124).
ESTIMATED CHANGES
Modified .github/build.in.yml
Modified .github/workflows/bors.yml
Modified .github/workflows/build.yml
Modified .github/workflows/build_fork.yml
Modified bors.toml
2025-10-07 12:53:49 98c8639
refactor: Nat.minFac: avoid reducing wfrec (#30291)
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Prime/Defs.lean
+/- def Nat.minFacAux
Modified Mathlib/Data/Num/Prime.lean
2025-10-07 11:23:36 2f9b481
chore: Rename Proj.openCoverOfIsOpenCover to Proj.affineOpenCoverOfIrrelevantLESpan (#30288)
#30072 renamed `AlgebraicGeometry.Scheme.openCoverOfISupEqTop` to `AlgebraicGeometry.Scheme.openCoverOfIsOpenCover` with deprecation, but it also moved `AlgebraicGeometry.Proj.openCoverOfISupEqTop` to `AlgebraicGeometry.Proj.openCoverOfIsOpenCover` by [accident](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Proj.2EopenCoverOfISupEqTop/near/543421929), and without deprecation.
This PR is a partial revert of that Proj renaming, but also renames it to the [more sensible](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Proj.2EopenCoverOfISupEqTop/near/543422249) `Proj.affineOpenCoverOfIrrelevantLESpan`.
Deprecation is added for the old name `Proj.openCoverOfISupEqTop`, but not for the current `Proj.openCoverOfIsOpenCover`, because this current erroneous `Proj.openCoverOfIsOpenCover` has only existed for 4 days.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean
+ def AlgebraicGeometry.Proj.affineOpenCoverOfIrrelevantLESpan
- def AlgebraicGeometry.Proj.openCoverOfIsOpenCover
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean
2025-10-07 10:51:29 c049c5a
chore(GroupTheory/Perm): deprecate `mem_of_formPerm_ne_self` and `formPerm_eq_self_of_notMem` (#28441)
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Perm/Cycle/Concrete.lean
Modified Mathlib/GroupTheory/Perm/List.lean
- theorem List.formPerm_eq_self_of_notMem
- theorem List.mem_of_formPerm_ne_self
2025-10-07 09:43:34 ee76732
refactor: Category.Filtered.Small: avoid reducing wfrec (#30292)
Using `rw!` this isn’t too bad.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Filtered/Small.lean
2025-10-07 09:26:55 51d6a5e
refactor: Chebyshev: avoid reducing wfrec (#30290)
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Polynomial/Chebyshev.lean
+/- theorem Polynomial.Chebyshev.C_neg_one
+/- theorem Polynomial.Chebyshev.C_one
+/- theorem Polynomial.Chebyshev.C_zero
+/- theorem Polynomial.Chebyshev.S_one
+/- theorem Polynomial.Chebyshev.S_zero
+/- theorem Polynomial.Chebyshev.T_neg_one
+/- theorem Polynomial.Chebyshev.T_one
+/- theorem Polynomial.Chebyshev.T_zero
+/- theorem Polynomial.Chebyshev.U_one
+/- theorem Polynomial.Chebyshev.U_zero
2025-10-07 09:26:53 1d1cff0
feat(RingTheory): make Euclidean domain from DVR (#29693)
ESTIMATED CHANGES
Modified Mathlib/RingTheory/DiscreteValuationRing/Basic.lean
+ theorem IsDiscreteValuationRing.bot_lt_toWithBotNat_iff
+ theorem IsDiscreteValuationRing.dvd_of_toWithBotNat_le_toWithBotNat
+ def IsDiscreteValuationRing.quotient
+ def IsDiscreteValuationRing.remainder
+ def IsDiscreteValuationRing.toEuclideanDomain
+ def IsDiscreteValuationRing.toWithBotNat
+ theorem IsDiscreteValuationRing.toWithBotNat_eq_bot_iff
+ theorem IsDiscreteValuationRing.toWithBotNat_le_toWithBotNat_iff
+ theorem IsDiscreteValuationRing.toWithBotNat_zero
2025-10-07 09:12:35 cd149dd
refactor: FrobeniusFractionField: avoid reducing wfrec (#30289)
ESTIMATED CHANGES
Modified Mathlib/RingTheory/WittVector/FrobeniusFractionField.lean
2025-10-07 08:33:08 ef24a29
feat: factorization of cyclotomic polynomial over finite fields (#30032)
We compute the degree of the factors of the `n`-th cyclotomic polynomial over a finite field of characteristic `p` when `p` and `n` are coprime.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/CharP/CharAndCard.lean
+/- theorem charP_of_card_eq_prime
+ theorem charP_of_card_eq_prime_pow
+/- theorem not_isUnit_prime_of_dvd_card
Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean
- theorem Polynomial.separable_cyclotomic
Modified Mathlib/NumberTheory/GaussSum.lean
Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean
+ theorem Polynomial.separable_cyclotomic
+ theorem Polynomial.squarefree_cyclotomic
Added Mathlib/RingTheory/Polynomial/Cyclotomic/Factorization.lean
+ theorem Polynomial.irreducible_of_dvd_cyclotomic_of_natDegree
+ theorem Polynomial.natDegree_of_dvd_cyclotomic_of_irreducible
+ theorem Polynomial.natDegree_of_mem_normalizedFactors_cyclotomic
+ theorem Polynomial.normalizedFactors_cyclotomic_card
+ theorem ZMod.irreducible_of_dvd_cyclotomic_of_natDegree
2025-10-07 08:33:06 29c47b6
chore(GroupTheory/Perm/Cycle): deprecate `Disjoint.cycleType` (#28429)
ESTIMATED CHANGES
Modified Mathlib/GroupTheory/Perm/Centralizer.lean
Modified Mathlib/GroupTheory/Perm/Cycle/Type.lean
- theorem Equiv.Perm.Disjoint.cycleType
+/- theorem Equiv.Perm.Disjoint.cycleType_mul
Modified Mathlib/GroupTheory/SpecificGroups/Alternating.lean
2025-10-07 08:33:04 53db35f
feat(RingTheory/Presentation): core of a presentation (#24794)
If `P` is a presentation of `S` as an `R`-algebra and `R₀` a subring of `R` containing the coefficients of the relations of `P`, then there exists an `R₀`-algebra `S₀` such that `S` is isomorphic to the base change of `S₀` to `R`.
This is a tool to remove Noetherian hypothesis in certain situations.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Algebra/Subalgebra/Basic.lean
+ theorem Subalgebra.algebraMap_apply
+ theorem Subalgebra.setRange_algebraMap
Modified Mathlib/Algebra/Algebra/Subalgebra/Tower.lean
Modified Mathlib/Algebra/Algebra/Tower.lean
+ theorem AlgEquiv.coe_restrictScalars_symm'
+ theorem AlgEquiv.coe_restrictScalars_symm
+ theorem AlgEquiv.restrictScalars_symm_apply
Modified Mathlib/RingTheory/AlgebraicIndependent/Transcendental.lean
Added Mathlib/RingTheory/Extension/Presentation/Core.lean
+ def Algebra.Presentation.Core
+ theorem Algebra.Presentation.HasCoeffs.coeffs_relation_mem_range
+ theorem Algebra.Presentation.HasCoeffs.of_isScalarTower
+ theorem Algebra.Presentation.HasCoeffs.relation_mem_range_map
+ theorem Algebra.Presentation.aeval_val_relationOfHasCoeffs
+ theorem Algebra.Presentation.algebraTensorAlgEquiv_symm_relation
+ def Algebra.Presentation.coeffs
+ theorem Algebra.Presentation.coeffs_relation_subset_coeffs
+ theorem Algebra.Presentation.coeffs_relation_subset_core
+ theorem Algebra.Presentation.coeffs_subset_core
+ theorem Algebra.Presentation.coeffs_subset_range
+ def Algebra.Presentation.core
+ theorem Algebra.Presentation.finite_coeffs
+ theorem Algebra.Presentation.map_relationOfHasCoeffs
+ theorem Algebra.Presentation.tensorModelOfHasCoeffsEquiv_symm_tmul
+ theorem Algebra.Presentation.tensorModelOfHasCoeffsEquiv_tmul
+ theorem Algebra.Presentation.tensorModelOfHasCoeffsHom_tmul
+ theorem Algebra.Presentation.tensorModelOfHasCoeffsInv_aeval_val
Modified Mathlib/RingTheory/FiniteType.lean
+ theorem Algebra.FiniteType.adjoin_of_finite
Modified Mathlib/RingTheory/Ideal/Quotient/Basic.lean
+ theorem Ideal.Quotient.mk_span_range
Modified Mathlib/RingTheory/LinearDisjoint.lean
Modified Mathlib/RingTheory/TensorProduct/MvPolynomial.lean
+ theorem MvPolynomial.algebraTensorAlgEquiv_symm_comp_aeval
+ theorem MvPolynomial.algebraTensorAlgEquiv_symm_map
2025-10-07 07:59:22 f9996fc
feat(Nat/Log): add lemma for `log b (n / b ^ k)` (#30222)
This lemma is a simple consequence of the previous by induction, but is often useful for calculation, especially since the natural number division and natural number subtraction play very nicely here.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Log.lean
+ theorem Nat.log_div_base_pow
2025-10-06 23:15:37 c857041
feat(Nat/Log): log of Nat.bit (#30227)
A useful rewrite lemma in applications, especially when `b` is a more complex expression.
Mathlib already has a preference for using `Nat.log 2` over `Nat.log2`, since the former has many more lemmas about it, and better tactic support, so we follow the established pattern here.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Log.lean
+ theorem Nat.log_two_bit
2025-10-06 22:42:41 cd0687a
chore(Nat/Log): swap Nat.pow_le_iff_le_log lemmas (#30229)
Swap the order of the following four lemmas:
- `Nat.pow_le_iff_le_log`
- `Nat.lt_pow_iff_log_lt`
- `Nat.le_pow_iff_clog_le`
- `Nat.pow_lt_iff_lt_clog`
This is to match the pattern used everywhere else in mathlib, eg for Real.log, and the pattern used in core, eg for Nat.log2.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Digits/Lemmas.lean
Modified Mathlib/Data/Nat/Log.lean
+ theorem Nat.clog_le_iff_le_pow
+ theorem Nat.le_log_iff_pow_le
+/- theorem Nat.le_pow_iff_clog_le
+ theorem Nat.log_lt_iff_lt_pow
+ theorem Nat.lt_clog_iff_pow_lt
Modified Mathlib/Tactic/NormNum/NatLog.lean
2025-10-06 22:42:40 e324732
feat(Data/List): relate destutter and dedup (#30228)
ESTIMATED CHANGES
Modified Mathlib/Data/List/Dedup.lean
+ theorem List.dedup_cons'
+ theorem List.dedup_cons
Modified Mathlib/Data/List/Destutter.lean
+ theorem List.Pairwise.destutter_eq_dedup
2025-10-06 22:06:01 7e091d1
chore(Analysis/Calculus/Deriv): deprecate `differentiableAt_comp_const_add` (#28376)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Calculus/Deriv/Add.lean
- theorem differentiableAt_comp_const_add
2025-10-06 21:14:27 e9a7887
chore(RingTheory/MvPolynomial): deprecate `weightedHomogeneousComponent_of_isWeightedHomogeneous_same` and `weightedHomogeneousComponent_of_isWeightedHomogeneous_ne` (#28305)
ESTIMATED CHANGES
Modified Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean
- theorem MvPolynomial.weightedHomogeneousComponent_of_isWeightedHomogeneous_ne
- theorem MvPolynomial.weightedHomogeneousComponent_of_isWeightedHomogeneous_same
2025-10-06 20:40:10 900513a
feat(AlgebraicGeometry): quasi-affine schemes (#30256)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/OpenImmersion.lean
+ theorem AlgebraicGeometry.IsOpenImmersion.of_forall_source_exists
+ theorem AlgebraicGeometry.IsOpenImmersion.of_openCover_source
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean
- theorem AlgebraicGeometry.isIso_ΓSpec_adjunction_unit_app_basicOpen
Modified Mathlib/AlgebraicGeometry/Morphisms/Separated.lean
Added Mathlib/AlgebraicGeometry/QuasiAffine.lean
+ theorem AlgebraicGeometry.Scheme.IsQuasiAffine.of_isImmersion
2025-10-06 20:40:08 b9b63f9
chore(RingTheory): golf entire `smul_eq_zero_of_mem`, `hasEval`, `eq_of_prod_eq_prod` and `isIntegral_of_mem_ringOfIntegers` (#28487)
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Extension/Basic.lean
Modified Mathlib/RingTheory/PowerSeries/Substitution.lean
Modified Mathlib/RingTheory/UniqueFactorizationDomain/FactorSet.lean
- theorem Associates.eq_of_prod_eq_prod
Modified Mathlib/RingTheory/Valuation/AlgebraInstances.lean
2025-10-06 20:25:30 ff6e6b5
chore(AlgebraicGeometry/PullbackCarrier): remove duplicate lemma (#30279)
`AlgebraicGeometry.Scheme.pullbackComparison_forget_surjective` is a duplicate of `AlgebraicGeometry.Scheme.Pullback.forget_comparison_surjective`. These were added in #29894 resp. #30020. We keep the one with the correct name. We keep the first one, because it has the correct name.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/PullbackCarrier.lean
- theorem AlgebraicGeometry.Scheme.Pullback.forget_comparison_surjective
2025-10-06 18:32:02 2a770fb
feat(Algebra/Subgroup/Lattice): `mem_biSup_of_directedOn` (#29990)
Generalization of existing `mem_iSup_of_directed`
On the way to characterization of the torsion subgroup as the sup over all subgroups of roots of unity
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Subgroup/Lattice.lean
+ theorem Subgroup.mem_biSup_of_directedOn
+ theorem Subgroup.mem_iSup_prop
Modified Mathlib/Algebra/Group/Submonoid/Membership.lean
+ theorem Submonoid.mem_biSup_of_directedOn
+ theorem Submonoid.mem_iSup_prop
Modified Mathlib/Algebra/Group/Subsemigroup/Membership.lean
+ theorem Subsemigroup.mem_biSup_of_directedOn
+ theorem Subsemigroup.mem_iSup_prop
Modified Mathlib/Order/Directed.lean
+ theorem directedOn_onFun_iff
2025-10-06 17:04:21 f4f1bfc
feat(RingTheory/Noetherian): add `IsNoetherianRing.of_prime` (#28451)
This PR introduces the first usage of `Ideal.IsOka` introduced in #27200 to prove that if all prime ideals of a `CommRing` are finitely generated then this ring is Noetherian.
To do so, we also added the lemma `Ideal.mem_span_range_self`.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/RingTheory/Ideal/Span.lean
+ theorem Ideal.mem_span_range_self
+/- theorem Ideal.span_pair_eq_span_left_iff_dvd
+/- theorem Ideal.span_pair_eq_span_right_iff_dvd
Added Mathlib/RingTheory/Noetherian/OfPrime.lean
+ theorem Ideal.isOka_fg
+ theorem IsNoetherianRing.of_prime
Modified docs/references.bib
2025-10-06 16:30:14 5b550d3
chore(AlgebraicGeometry): remove `Spec()` notation (#30272)
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/AffineScheme.lean
Modified Mathlib/AlgebraicGeometry/AffineSpace.lean
Modified Mathlib/AlgebraicGeometry/Cover/Open.lean
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean
Modified Mathlib/AlgebraicGeometry/Limits.lean
+/- def AlgebraicGeometry.coprodSpec
+/- def AlgebraicGeometry.sigmaSpec
Modified Mathlib/AlgebraicGeometry/Modules/Tilde.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Proper.lean
+/- theorem AlgebraicGeometry.finite_appTop_of_universallyClosed
+/- theorem AlgebraicGeometry.isField_of_universallyClosed
Modified Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean
Modified Mathlib/AlgebraicGeometry/Noetherian.lean
Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean
Modified Mathlib/AlgebraicGeometry/PointsPi.lean
+/- def AlgebraicGeometry.pointsPi
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean
+/- def AlgebraicGeometry.Proj.awayι
+/- def AlgebraicGeometry.Proj.basicOpenIsoSpec
+/- def AlgebraicGeometry.Proj.basicOpenToSpec
+/- def AlgebraicGeometry.Proj.toSpecZero
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean
Modified Mathlib/AlgebraicGeometry/Pullbacks.lean
Modified Mathlib/AlgebraicGeometry/ResidueField.lean
Modified Mathlib/AlgebraicGeometry/Restrict.lean
Modified Mathlib/AlgebraicGeometry/Scheme.lean
+/- theorem AlgebraicGeometry.Scheme.default_asIdeal
Modified Mathlib/AlgebraicGeometry/Stalk.lean
Modified Mathlib/AlgebraicGeometry/ValuativeCriterion.lean
2025-10-06 16:30:12 207daae
feat(RingTheory/Valuation/ValuativeRel): strict valuative relation (#30262)
extracted out of #27163
a way of discussing unbundled `posSubmonoid`
ESTIMATED CHANGES
Modified Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean
+ theorem Valuation.Compatible.srel_iff_lt
+ theorem ValuativeExtension.srel_iff_srel
+ theorem ValuativeRel.not_srel_iff
+/- theorem ValuativeRel.posSubmonoid_def
+ def ValuativeRel.srel
+ theorem ValuativeRel.srel_iff
+ theorem ValuativeRel.zero_srel_mul
+ theorem ValuativeRel.zero_srel_one
2025-10-06 15:37:35 95fae5d
feat(Data/Set/Subsingleton): added new lemma `Subsingleton.union_subsingleton` along with some trivial code cleanup (#29955)
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Subsingleton.lean
+/- theorem Set.subsingleton_isBot
+/- theorem Set.subsingleton_isTop
+/- theorem Set.subsingleton_of_subsingleton
+ theorem Set.subsingleton_of_subsingleton_inter_left
+ theorem Set.subsingleton_of_subsingleton_inter_right
2025-10-06 15:21:50 70adeca
chore: golf `sin_pi_mul_eq` and `isCyclic_units_iff` using `grind` (#30193)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/EulerSineProd.lean
Modified Mathlib/RingTheory/ZMod/UnitsCyclic.lean
2025-10-06 14:26:09 c61c9d2
chore(AlgebraicGeometry/Sites): golf entire `pretopology_eq_inf` using `rfl` (#30243)
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/Sites/Pretopology.lean
+/- theorem AlgebraicGeometry.Scheme.pretopology_eq_inf
2025-10-06 14:26:08 103639b
chore(Tactic/Positivity): golf entire `min_ne` and `max_ne` using `grind` (#30211)
ESTIMATED CHANGES
Modified Mathlib/Tactic/Positivity/Basic.lean
2025-10-06 14:26:06 56b17cd
chore(Data): golf entire `getElem_insertIdx_add_succ` and `inv_sqrt_two_sub_one` using `grind` (#30207)
ESTIMATED CHANGES
Modified Mathlib/Data/List/InsertIdx.lean
Modified Mathlib/Data/Real/Sqrt.lean
2025-10-06 14:26:04 b4c621d
chore(Data/Rat): golf entire `inv_intCast_num_of_pos` and `den_inv_of_ne_zero` using `simp` (#30117)
ESTIMATED CHANGES
Modified Mathlib/Data/Rat/Lemmas.lean
2025-10-06 14:26:01 a64b5cc
chore(Data/Finset): golf entire `powersetCard_zero` using `grind` (#30114)
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/Powerset.lean
2025-10-06 14:26:00 6d8cd6c
chore(Data): golf entire `tail_cons` using `rfl`. fix `coe_eq_image_val` theorem statement. (#29661)
ESTIMATED CHANGES
Modified Mathlib/Data/Seq/Defs.lean
+/- theorem Stream'.Seq.tail_cons
Modified Mathlib/Data/Set/Functor.lean
2025-10-06 14:25:58 d799b46
feat(Positivity): add positivity extensions for `NNReal.rpow` and `ENNReal.rpow` (#29463)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
+ theorem ENNReal.rpow_zero_pos
+ def Mathlib.Meta.Positivity.evalENNRealRpow
+ def Mathlib.Meta.Positivity.evalNNRealRpow
+ theorem NNReal.rpow_zero_pos
Modified MathlibTest/positivity.lean
2025-10-06 14:25:56 d8b0cfb
chore: remove redundant `rintro` invocations (before `omega`) (#29221)
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Intervals.lean
Modified Mathlib/Data/List/Range.lean
2025-10-06 14:25:54 a153b15
chore(Topology/PartialHomeomorph): add module deprecation (#29116)
This is the follow-up PR of #29113 adding the deprecated module after the file was renamed.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Topology/PartialHomeomorph.lean
2025-10-06 14:25:52 f3ad651
chore: golf entire `epi_of_cokernel_π_eq_zero`, `bottom_row_coprime`, `congr_of_eventuallyEq` and `Invertible.congr` (#28490)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Group/Invertible/Defs.lean
Modified Mathlib/CategoryTheory/Abelian/Basic.lean
+/- theorem CategoryTheory.Abelian.epi_of_cokernel_π_eq_zero
Modified Mathlib/Topology/ContinuousOn.lean
2025-10-06 13:48:56 65b9734
chore(Tactic/CancelDenoms): golf entire `cancel_factors_eq` using `grind` (#27370)
ESTIMATED CHANGES
Modified Mathlib/Tactic/CancelDenoms/Core.lean
2025-10-06 13:19:57 33b8ef0
feat(AlgebraicGeometry): qc immersion = open immersion >> closed immersion (#30257)
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Functorial.lean
+ theorem AlgebraicGeometry.Scheme.IdealSheafData.ker_fst_of_isClosedImmersion
+ theorem AlgebraicGeometry.isPullback_of_isClosedImmersion
Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean
+ theorem AlgebraicGeometry.IsClosedImmersion.isIso_lift
+ theorem AlgebraicGeometry.IsClosedImmersion.isIso_of_ker_eq
Modified Mathlib/AlgebraicGeometry/Morphisms/Immersion.lean
+ theorem AlgebraicGeometry.IsImmersion.isImmersion_iff_exists_of_quasiCompact
+ theorem AlgebraicGeometry.IsImmersion.isPullback_toImage_liftCoborder
+ theorem AlgebraicGeometry.Scheme.Hom.liftCoborder_preimage
+ theorem AlgebraicGeometry.liftCoborder_app
2025-10-06 12:30:02 4a88b7e
feat: preimage of Set.pi by uncurry (#30178)
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Prod.lean
+ theorem Set.uncurry_preimage_prod_pi
Modified Mathlib/Data/Set/Sigma.lean
+ theorem Set.uncurry_preimage_sigma_pi
2025-10-06 12:30:00 abf8c9d
feat(Topology/Algebra/InfiniteSum): generalise to allow summation filters (#29914)
We introduce a notion of a "summation filter" on a type, which is (a structure wrapper around) a filter on the finsets of that type. Then we can define tsums / tprods "along L" for any summation filter L, giving a formalism that specializes to the existing notion of unconditional summation, but also covers conditional summation on `ℕ` etc. This is implemented using an **optional parameter** to `HasSum`, `tsum` etc which defaults to the standard unconditional sum, so the vast majority of existing code using unconditional summation will work without change.
Co-authored by Chris Birkbeck.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Analytic/Uniqueness.lean
Modified Mathlib/Analysis/Complex/Basic.lean
+/- theorem Complex.conj_tsum
+/- theorem Complex.hasSum_conj'
+/- theorem Complex.hasSum_conj
+/- theorem Complex.hasSum_im
+/- theorem Complex.hasSum_ofReal
+/- theorem Complex.hasSum_re
+/- theorem Complex.im_tsum
+/- theorem Complex.ofReal_tsum
+/- theorem Complex.re_tsum
+/- theorem Complex.summable_ofReal
+/- theorem RCLike.conj_tsum
+/- theorem RCLike.hasSum_conj'
+/- theorem RCLike.hasSum_conj
+/- theorem RCLike.hasSum_im
+/- theorem RCLike.hasSum_ofReal
+/- theorem RCLike.hasSum_re
+/- theorem RCLike.im_tsum
+/- theorem RCLike.ofReal_tsum
+/- theorem RCLike.re_tsum
+/- theorem RCLike.summable_conj
+/- theorem RCLike.summable_ofReal
Modified Mathlib/Analysis/Quaternion.lean
+/- theorem Quaternion.hasSum_coe
+/- theorem Quaternion.summable_coe
+/- theorem Quaternion.tsum_coe
Modified Mathlib/Analysis/SpecialFunctions/Log/Summable.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/SmoothSection.lean
Modified Mathlib/MeasureTheory/Measure/MeasureSpace.lean
Modified Mathlib/NumberTheory/EulerProduct/Basic.lean
Modified Mathlib/NumberTheory/TsumDivsorsAntidiagonal.lean
Modified Mathlib/RingTheory/MvPowerSeries/PiTopology.lean
Modified Mathlib/RingTheory/MvPowerSeries/Substitution.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Basic.lean
+ theorem Function.LeftInverse.map_tprod
+/- theorem HasProd.congr_fun
+/- theorem HasProd.mul
+/- theorem HasProd.update'
+/- theorem Multipliable.congr
+/- theorem Multipliable.map_tprod
+/- theorem Multipliable.mul
+/- theorem Multipliable.of_finite
+ theorem Topology.IsClosedEmbedding.map_tprod
+/- theorem eq_mul_of_hasProd_ite
+/- theorem hasProd_empty
+/- theorem hasProd_ite_eq
+/- theorem hasProd_one
+/- theorem hasProd_single
+/- theorem hasProd_unique
+/- theorem hasProd_zero_of_exists_eq_zero
+/- theorem multipliable_congr
+/- theorem multipliable_empty
+/- theorem multipliable_of_exists_eq_zero
+/- theorem multipliable_of_finite_mulSupport
+/- theorem multipliable_one
+/- theorem multipliable_prod
+/- theorem prod_eq_tprod_mulIndicator
+/- theorem tprod_congr₂
+/- theorem tprod_empty
+/- theorem tprod_eq_finprod
+/- theorem tprod_eq_mulSingle
+/- theorem tprod_eq_prod'
+/- theorem tprod_eq_prod
+/- theorem tprod_fintype
+/- theorem tprod_ite_eq
+/- theorem tprod_of_exists_eq_zero
+/- theorem tprod_one
+/- theorem tprod_tprod_eq_mulSingle
Modified Mathlib/Topology/Algebra/InfiniteSum/Constructions.lean
+/- theorem HasProd.prodMk
+/- theorem HasSum.op
+/- theorem HasSum.star
+/- theorem HasSum.unop
+/- theorem Pi.multipliable
+/- theorem Summable.ofStar
+/- theorem Summable.op
+/- theorem Summable.star
+/- theorem Summable.unop
+/- theorem hasSum_op
+/- theorem summable_op
+/- theorem summable_star_iff'
+/- theorem summable_star_iff
+/- theorem summable_unop
+/- theorem tprod_apply
+/- theorem tsum_op
+/- theorem tsum_star
+/- theorem tsum_unop
Modified Mathlib/Topology/Algebra/InfiniteSum/Defs.lean
+ theorem Finset.hasProd_support
+ theorem Function.Injective.hasProd_comap_iff
+ theorem Function.Injective.hasProd_comap_iff_of_hasSupport
+ theorem Function.Injective.hasProd_map_iff
+/- theorem HasProd.multipliable
+/- theorem HasProd.tprod_eq
+/- theorem HasProd.unique
+/- def HasProd
+/- theorem Multipliable.hasProd
+/- theorem Multipliable.hasProd_iff
+ theorem Multipliable.mono_filter
+/- def Multipliable
+ theorem hasProd_bot
+/- theorem hasProd_fintype
+ theorem hasProd_fintype_support
+/- theorem hasProd_prod_of_ne_finset_one
+ theorem hasProd_prod_support_of_ne_finset_one
+ theorem hasProd_subtype_comap_iff_of_mulSupport_subset
+ theorem multipliable_bot
+/- theorem multipliable_of_ne_finset_one
+ theorem tprod_bot
+/- theorem tprod_eq_one_of_not_multipliable
Modified Mathlib/Topology/Algebra/InfiniteSum/Group.lean
+/- theorem HasProd.div
+/- theorem HasProd.inv
+/- theorem HasProd.update
+/- theorem Multipliable.div
+/- theorem Multipliable.inv
+/- theorem Multipliable.of_inv
+/- theorem Multipliable.trans_div
+/- theorem Multipliable.update
+/- theorem hasProd_ite_div_hasProd
+/- theorem multipliable_iff_of_multipliable_div
+/- theorem multipliable_inv_iff
+/- theorem tprod_inv
Modified Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean
+/- theorem Summable.toCompl_tsum
Modified Mathlib/Topology/Algebra/InfiniteSum/Module.lean
+/- theorem ContinuousLinearEquiv.tsum_eq_iff
+/- theorem HasSum.const_smul
+/- theorem HasSum.smul_const
+/- theorem Summable.const_smul
+/- theorem Summable.smul_const
Modified Mathlib/Topology/Algebra/InfiniteSum/NatInt.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Order.lean
+/- theorem HasProd.le_one
+/- theorem HasProd.one_le
+/- theorem hasProd_le
+/- theorem hasProd_le_of_prod_le
+/- theorem hasProd_lt
+/- theorem hasProd_mono
+/- theorem hasProd_one_iff_of_one_le
+/- theorem le_hasProd
+/- theorem le_hasProd_of_le_prod
+/- theorem lt_hasProd
+/- theorem one_le_tprod
+/- theorem prod_le_hasProd
+/- theorem tprod_le_of_prod_le'
+/- theorem tprod_le_one
Modified Mathlib/Topology/Algebra/InfiniteSum/Ring.lean
+/- theorem Commute.tsum_left
+/- theorem Commute.tsum_right
+/- theorem HasSum.const_div
+/- theorem HasSum.div_const
+/- theorem HasSum.mul_left
+/- theorem HasSum.mul_right
+/- theorem Summable.const_div
+/- theorem Summable.div_const
+/- theorem Summable.mul_left
+/- theorem Summable.mul_right
+/- theorem hasSum_div_const_iff
+/- theorem hasSum_mul_left_iff
+/- theorem hasSum_mul_right_iff
+/- theorem summable_const_div_iff
+/- theorem summable_div_const_iff
+/- theorem summable_mul_left_iff
+/- theorem summable_mul_right_iff
+/- theorem tsum_div_const
+/- theorem tsum_mul_left
+/- theorem tsum_mul_right
Added Mathlib/Topology/Algebra/InfiniteSum/SummationFilter.lean
+ def SummationFilter.comap
+ theorem SummationFilter.comap_unconditional
+ def SummationFilter.conditional
+ theorem SummationFilter.conditional_filter_eq_map_Ici
+ theorem SummationFilter.conditional_filter_eq_map_Iic
+ theorem SummationFilter.conditional_filter_eq_map_range
+ theorem SummationFilter.eq_unconditional_of_finite
+ theorem SummationFilter.eventually_mem_or_not_mem
+ theorem SummationFilter.leAtTop_of_not_NeBot
+ def SummationFilter.map
+ theorem SummationFilter.neBot_or_eq_bot
+ def SummationFilter.support
+ theorem SummationFilter.support_comap
+ theorem SummationFilter.support_eq_limsInf
+ theorem SummationFilter.support_eq_univ
+ theorem SummationFilter.support_eq_univ_iff
+ theorem SummationFilter.support_map
+ def SummationFilter.unconditional
+ structure SummationFilter
Modified Mathlib/Topology/ContinuousMap/Algebra.lean
Modified Mathlib/Topology/Instances/ENNReal/Lemmas.lean
Modified Mathlib/Topology/Instances/Matrix.lean
+/- theorem HasSum.matrix_diag
+/- theorem HasSum.matrix_diagonal
+/- theorem HasSum.matrix_transpose
+/- theorem Matrix.transpose_tsum
+/- theorem Summable.matrix_blockDiag'
+/- theorem Summable.matrix_blockDiag
+/- theorem Summable.matrix_blockDiagonal
+/- theorem Summable.matrix_diag
+/- theorem Summable.matrix_diagonal
+/- theorem Summable.matrix_transpose
Modified Mathlib/Topology/Instances/NNReal/Lemmas.lean
+/- theorem NNReal.coe_tsum
+/- theorem NNReal.hasSum_coe
+/- theorem NNReal.hasSum_real_toNNReal_of_nonneg
+/- theorem NNReal.summable_coe
2025-10-06 12:00:08 3681a10
chore: new file for constructions of uniform groups (#30026)
The split between `Defs` and `Basic` was a bit messy (e.g the `Prod` instance was in `Defs` but the `Pi` instance was in `Basic`), and I'm going to make these files longer when introducing left and right uniform groups, so I figured the best solution was to move everything in an intermediate `Constructions` file.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/CStarAlgebra/Module/Synonym.lean
Modified Mathlib/RingTheory/MvPowerSeries/PiTopology.lean
Modified Mathlib/Topology/Algebra/IsUniformGroup/Basic.lean
- theorem IsUniformInducing.isUniformGroup
Added Mathlib/Topology/Algebra/IsUniformGroup/Constructions.lean
+ theorem IsUniformInducing.isUniformGroup
+ theorem isUniformGroup_iInf
+ theorem isUniformGroup_inf
+ theorem isUniformGroup_sInf
Modified Mathlib/Topology/Algebra/IsUniformGroup/Defs.lean
- theorem isUniformGroup_iInf
- theorem isUniformGroup_inf
- theorem isUniformGroup_sInf
Modified Mathlib/Topology/Instances/TrivSqZeroExt.lean
Modified Mathlib/Topology/UniformSpace/Matrix.lean
2025-10-06 10:49:40 c9e5385
feat(Algebra/Order/Ring): make `IsOrderedRing.toStrictOrderedRing` an instance (#27178)
Requiring `IsStrictOrderedRing` on a `Field` is a footgun (the current instances come from a find and replace on `LinearOrderedField`). Weakening typeclasses can incur a performance hit so will be done where appropriate in future PRs.
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Ring/Defs.lean
- theorem IsOrderedRing.toIsStrictOrderedRing
2025-10-06 10:18:47 686ba3a
feat: `Rat.padicValuation` is surjective (#30170)
ESTIMATED CHANGES
Modified Mathlib/NumberTheory/Padics/PadicNumbers.lean
+ theorem Rat.surjective_padicValuation
2025-10-06 09:32:22 23a8b67
feat(Algebra/Order/Ring/Ordering): basic results about ring (pre)orderings (#28295)
* Basic automation for membership of ring orderings
* Alternative constructors for ring preorderings and ring orderings
* Basic results about ring preorderings and their supports, including the special case over a field
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Group/Subgroup/Defs.lean
+ theorem HasMemOrInvMem.inv_mem_of_notMem
+ theorem HasMemOrInvMem.mem_of_inv_notMem
Added Mathlib/Algebra/Order/Ring/Ordering/Basic.lean
+ theorem RingPreordering.HasIdealSupport.neg_smul_mem
+ theorem RingPreordering.HasIdealSupport.smul_mem
+ theorem RingPreordering.IsOrdering.mk'
+ theorem RingPreordering.coe_mk'
+ theorem RingPreordering.hasIdealSupport_of_isUnit_two
+ theorem RingPreordering.inv_mem
+ theorem RingPreordering.isOrdering_iff
+ theorem RingPreordering.mem_mk'
+ theorem RingPreordering.mem_of_isSumSq
+ def RingPreordering.mk'
+ theorem RingPreordering.one_notMem_support
+ theorem RingPreordering.one_notMem_supportAddSubgroup
+ theorem RingPreordering.supportAddSubgroup_eq_bot
+ theorem RingPreordering.supportAddSubgroup_ne_top
+ theorem RingPreordering.support_eq_bot
+ theorem RingPreordering.support_ne_top
+ theorem RingPreordering.toSubsemiring_le_toSubsemiring
+ theorem RingPreordering.toSubsemiring_lt_toSubsemiring
+ theorem RingPreordering.toSubsemiring_mono
+ theorem RingPreordering.toSubsemiring_strictMono
+ theorem RingPreordering.unitsInv_mem
2025-10-06 08:37:22 928504d
chore(Data/Int): deprecate `ediv_ediv_eq_ediv_mul` (#30265)
ESTIMATED CHANGES
Modified Mathlib/Data/Int/DivMod.lean
- theorem Int.ediv_ediv_eq_ediv_mul
2025-10-06 08:23:25 eb00e00
feat(Mathlib/AlgebraicGeometry/AffineScheme): add preservation of limits of affine schemes (#30034)
This PR adds simple results about affine schemes.
Main changes:
* `createsLimitsForgetToScheme`: The forgetful functor `AffineScheme ⥤ Scheme` creates small limits.
* (written by Andrew Yang) `preservesLimit_rightOp_Γ`: Shows that `Scheme.Γ.rightOp : Scheme ⥤ CommRingCatᵒᵖ` preserves limits of diagrams consisting of affine schemes.
* `preservesColimit_Γ`: The dual statement.
This PR reopens #30015, which was acidentally closed by myself.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/AffineScheme.lean
2025-10-06 08:23:23 afc966d
feat(Topology/WithVal): ValuativeRel (WithVal v) (#27207)
with a helper valuation defined that does not pierce defeq
ESTIMATED CHANGES
Modified Mathlib/Topology/Algebra/Valued/WithVal.lean
+ def WithVal.valuation
+ theorem WithVal.valuation_equiv_symm
2025-10-06 07:59:35 7039b57
chore: make Opposite.small an instance (#30159)
If `X` is small, so is `Xᵒᵖ`. It no longer seems to be dangerous to have such an instance. (Which shall be convenient for #30160.)
ESTIMATED CHANGES
Modified Mathlib/Data/Opposite.lean
- theorem Opposite.small
2025-10-05 14:36:52 586e9c3
feat(CategoryTheory): limits of objects satisfying a property (#29851)
This PR dualises #29843.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/ObjectProperty/ColimitsOfShape.lean
Added Mathlib/CategoryTheory/ObjectProperty/LimitsOfShape.lean
+ theorem CategoryTheory.ObjectProperty.LimitOfShape.limitsOfShape
+ def CategoryTheory.ObjectProperty.LimitOfShape.ofIso
+ def CategoryTheory.ObjectProperty.LimitOfShape.ofLE
+ structure CategoryTheory.ObjectProperty.LimitOfShape
+ theorem CategoryTheory.ObjectProperty.isoClosure_strictLimitsOfShape
+ def CategoryTheory.ObjectProperty.limitsOfShape
+ theorem CategoryTheory.ObjectProperty.limitsOfShape_isoClosure
+ theorem CategoryTheory.ObjectProperty.limitsOfShape_monotone
+ inductive CategoryTheory.ObjectProperty.strictLimitsOfShape
+ theorem CategoryTheory.ObjectProperty.strictLimitsOfShape_le_limitsOfShape
+ theorem CategoryTheory.ObjectProperty.strictLimitsOfShape_monotone
2025-10-05 14:23:26 010a30c
feat(CategoryTheory): extremal epimorphisms (#29518)
An extremal epimorphism `p : X ⟶ Y` is an epimorphism which does not factor through any proper subobject of `Y`. In case the category has equalizers, we show that a morphism `p : X ⟶ Y` which does not factor through any proper subobject of `Y` is automatically an epimorphism, and also an extremal epimorphism. We also show that a strong epimorphism is an extremal epimorphism, and that both notions coincide when the category has pullbacks.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/ExtremalEpi.lean
+ theorem CategoryTheory.ExtremalEpi.mk_of_hasEqualizers
+ theorem CategoryTheory.ExtremalEpi.subobject_eq_top
+ theorem CategoryTheory.extremalEpi_iff_strongEpi_of_hasPullbacks
2025-10-05 12:08:38 75a2970
feat(Analysis/Distribution): a smooth function with compact support is a Schwartz function (#30175)
ESTIMATED CHANGES
Modified Mathlib/Analysis/Distribution/SchwartzSpace.lean
+ def HasCompactSupport.toSchwartzMap
2025-10-05 11:42:56 34812cd
feat(Nat/Digits): use fuel in `Nat.digits` (#25864)
Add a `fuel` parameter to `Nat.digitsAux` to make it structurally recursive.
ESTIMATED CHANGES
Modified Mathlib/Data/Nat/Digits/Defs.lean
+ theorem Nat.digitsAux.go_fuel_irrel
+ theorem Nat.digitsAux.go_succ
+ theorem Nat.digitsAux.go_zero
+/- def Nat.digitsAux
+/- theorem Nat.digitsAux_zero
2025-10-05 10:39:22 b1f909f
chore(Lean/Expr): remove Batteries imports (#30188)
And make the remaining import linter exceptions more fine-grained.
ESTIMATED CHANGES
Modified Mathlib/Lean/Expr/Rat.lean
Modified Mathlib/Tactic/Linter/DirectoryDependency.lean
2025-10-05 10:19:21 bfc2799
chore(RingTheory/PrimitiveRoots): switch argument for `isUnit` from `0 < k` to `k ≠ 0` (#29988)
Did not do this for all lemmas in `IsPrimitiveRoot` namespace which is still heterogeneous between
- `NeZero k`
- `0 < k`
- `k ≠ 0`
Note: there will always be some mismatch in hypotheses, because core has lemmas about divisibility in `0 < k` hypothesis form
On the way to describing the torsion subgroup,
as requested in #29517
ESTIMATED CHANGES
Modified Mathlib/FieldTheory/KummerExtension.lean
Modified Mathlib/NumberTheory/Cyclotomic/CyclotomicCharacter.lean
Modified Mathlib/NumberTheory/Cyclotomic/Rat.lean
Modified Mathlib/NumberTheory/MulChar/Lemmas.lean
Modified Mathlib/RingTheory/Frobenius.lean
Modified Mathlib/RingTheory/RootsOfUnity/EnoughRootsOfUnity.lean
Modified Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean
+/- theorem IsPrimitiveRoot.isUnit
+/- theorem IsPrimitiveRoot.pow_ne_one_of_pos_of_lt
2025-10-05 10:19:19 b8ab47b
feat(RingTheory): local properties of semilocal rings (#29924)
Proves local properties of semilocal rings, which wiil be used in Iwasawa theory. For a natural language proof, see [lean-iwasawa](https://acmepjz.github.io/lean-iwasawa/blueprint/sect0002.html#a0000000013) (slightly different from this PR).
>
> >
> [](https://gitpod.io/from-referrer/)
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/RingTheory/DedekindDomain/PID.lean
+ theorem IsPrincipalIdealRing.of_finite_maximals
Modified Mathlib/RingTheory/Ideal/Height.lean
+ theorem Ring.krullDimLE_of_isLocalization_maximal
Modified Mathlib/RingTheory/LocalProperties/IntegrallyClosed.lean
+ theorem IsIntegrallyClosed.of_isLocalization_maximal
Added Mathlib/RingTheory/LocalProperties/Semilocal.lean
+ theorem IsNoetherianRing.of_isLocalization_maximal
+ theorem Module.Finite.of_isLocalized_maximal
+ theorem Module.Finite.of_localized_maximal
+ theorem Submodule.fg_of_isLocalized_maximal
+ theorem Submodule.fg_of_localized_maximal
+ theorem isPrincipalIdealRing_of_isPrincipalIdealRing_isLocalization_maximal
Modified Mathlib/RingTheory/Localization/AtPrime/Basic.lean
+ theorem IsLocalization.isDomain_of_atPrime
2025-10-05 10:04:50 d19e914
feat: the definition of nonarchimedean local fields (#27465)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/NumberTheory/LocalField/Basic.lean
+ theorem IsNonarchimedeanLocalField.isCompact_closedBall
+ def IsNonarchimedeanLocalField.valueGroupWithZeroIsoInt
Modified Mathlib/RingTheory/Valuation/RankOne.lean
Modified Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean
+ theorem ValuativeRel.ValueGroupWithZero.mk_eq_valuation
+ theorem ValuativeRel.exists_valuation_div_valuation_eq
+/- theorem ValuativeRel.isNontrivial_iff_isNontrivial
+/- theorem ValuativeRel.valuation_surjective
Modified Mathlib/Topology/Algebra/Valued/ValuativeRel.lean
+ theorem IsValuativeTopology.hasBasis_nhds'
+ theorem IsValuativeTopology.hasBasis_nhds_zero'
+ theorem IsValuativeTopology.v_eq_valuation
2025-10-05 07:59:02 245959d
feat: {forall,exists}_ne_{top,bot} (#30208)
Working towards #27918.
ESTIMATED CHANGES
Modified Mathlib/Data/ENNReal/Basic.lean
+/- theorem ENNReal.exists_ne_top
+/- theorem ENNReal.forall_ne_top
Modified Mathlib/Data/ENat/Basic.lean
+ theorem ENat.exists_ne_top
+ theorem ENat.forall_ne_top
Modified Mathlib/Order/WithBot.lean
+ theorem WithBot.exists_ne_bot
+ theorem WithBot.forall_ne_bot
+ theorem WithTop.exists_ne_top
+ theorem WithTop.forall_ne_top
Modified Mathlib/Topology/Instances/ENat.lean
2025-10-04 20:24:12 9bee9f3
feat: a theorem of Jordan on primitive subgroups of the permutation group (#26282)
A theorem of Jordan on the primitive subgroups of a permutation group:
* if it contains a swap, it is equal to the permutation group,
* if it contains a 3-cycle, it contains the alternating group.
This PR continues the work from #24131.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Data/Set/Card.lean
+ theorem Set.ncard_le_card
+ theorem Set.ncard_lt_card
+ theorem Set.ncard_range_of_injective
+ theorem Set.ncard_union_eq_iff
+ theorem Set.ncard_union_lt
+ theorem Set.nonempty_inter_compl_of_ncard_add_ncard_lt
+ theorem Set.nonempty_inter_of_le_ncard_add_ncard
+ theorem Set.nonempty_inter_of_lt_ncard_add_ncard
+ theorem Set.union_ne_univ_of_ncard_add_ncard_lt
Modified Mathlib/GroupTheory/GroupAction/FixingSubgroup.lean
+ theorem fixingSubgroup_empty
Added Mathlib/GroupTheory/GroupAction/Jordan.lean
+ theorem Equiv.Perm.alternatingGroup_le_of_isPreprimitive_of_isThreeCycle_mem
+ theorem Equiv.Perm.eq_top_of_isPreprimitive_of_isSwap_mem
+ theorem Equiv.Perm.isMultiplyPretransitive_of_nontrivial
+ theorem Equiv.Perm.isPretransitive_of_isCycle_mem
+ theorem Equiv.Perm.subgroup_eq_top_of_nontrivial
+ theorem MulAction.IsPreprimitive.isMultiplyPreprimitive
+ theorem MulAction.IsPreprimitive.is_two_motive_of_is_motive
+ theorem MulAction.IsPreprimitive.is_two_preprimitive
+ theorem MulAction.IsPreprimitive.is_two_pretransitive
+ theorem normalClosure_of_stabilizer_eq_top
Modified Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean
Modified Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean
- theorem Equiv.Perm.eq_top_if_isMultiplyPretransitive
- theorem Equiv.Perm.isMultiplyPretransitive
+ theorem IsMultiplyPretransitive.alternatingGroup_le
- theorem SubMulAction.ofFixingSubgroup.isMultiplyPretransitive'
- theorem SubMulAction.ofFixingSubgroup.isMultiplyPretransitive
+ theorem SubMulAction.ofStabilizer.AlternatingGroup.isMultiplyPretransitive
+ theorem SubMulAction.ofStabilizer.AlternatingGroup.isPreprimitive_of_three_le_card
+ theorem SubMulAction.ofStabilizer.AlternatingGroup.isPretransitive_of_three_le_card
+ theorem SubMulAction.ofStabilizer.AlternatingGroup.isTrivialBlock_of_isBlock
+ theorem SubMulAction.ofStabilizer.Equiv.Perm.eq_top_of_isMultiplyPretransitive
+ theorem SubMulAction.ofStabilizer.Equiv.Perm.isMultiplyPretransitive
+ theorem SubMulAction.ofStabilizer.MulAction.IsMultiplyPretransitive.index_of_fixingSubgroup_eq
+ theorem SubMulAction.ofStabilizer.MulAction.IsMultiplyPretransitive.index_of_fixingSubgroup_mul
+ theorem SubMulAction.ofStabilizer.ofFixingSubgroup.isMultiplyPretransitive'
+ theorem SubMulAction.ofStabilizer.ofFixingSubgroup.isMultiplyPretransitive
Modified Mathlib/GroupTheory/GroupAction/Primitive.lean
+ theorem MulAction.isTrivialBlock_of_card_le_two
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean
+ theorem SubMulAction.IsPreprimitive.isPreprimitive_ofFixingSubgroup_inter
+ theorem SubMulAction.IsPretransitive.isPretransitive_ofFixingSubgroup_inter
Modified Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean
+ theorem SubMulAction.ENat_card_ofStabilizer_add_one_eq
- theorem SubMulAction.Enat_card_ofStabilizer_eq_add_one
+ theorem SubMulAction.nat_card_ofStabilizer_add_one_eq
Modified Mathlib/GroupTheory/Perm/Cycle/Type.lean
+ theorem Equiv.Perm.IsSwap.orderOf
+ theorem Equiv.Perm.isSwap_iff_cycleType
Modified Mathlib/SetTheory/Cardinal/Embedding.lean
+ theorem Fin.Embedding.restrictSurjective_of_le_ENatCard
+ theorem Fin.Embedding.restrictSurjective_of_le_natCard
2025-10-04 19:42:01 0751bf5
chore: add a space before "with" in finset sum notation (#30194)
Currently, `∑ i ∈ Finset.range 10 with Even i, i ^ i` prints as `∑ i ∈ Finset.range 10with Even i, i ^ i`. This PR fixes that.
ESTIMATED CHANGES
Modified Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean
2025-10-04 13:07:05 b557810
chore(Data): golf entire `mem_image_const`, `natCast_pred_of_pos` and `div_sqrt` using `grind` (#30186)
ESTIMATED CHANGES
Modified Mathlib/Data/Finset/Image.lean
Modified Mathlib/Data/Int/Init.lean
Modified Mathlib/Data/Real/Sqrt.lean
2025-10-04 10:27:47 6a6dd70
feat(Order): generalize `Finset.exists_maximalFor` to transitive orders (#30113)
Currently `exists_maximalFor` and it's related analogs are only defined for Preorders. I generalize the results where it is possible to do so to transitive relations without requiring reflexivity. This was necessary for work where I needed to work with < and find maximums.
ESTIMATED CHANGES
Modified Mathlib/Order/Basic.lean
Modified Mathlib/Order/Preorder/Finite.lean
2025-10-04 09:36:09 b4264fb
feat(NormedSpace/Alternating/Uncurry/Fin): new file (#29957)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/NormedSpace/Alternating/Uncurry/Fin.lean
+ theorem ContinuousAlternatingMap.alternatizeUncurryFinCLM_apply
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_add
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_alternatizeUncurryFinCLM_comp_of_symmetric
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_apply
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_curryLeft
+ theorem ContinuousAlternatingMap.alternatizeUncurryFin_smul
+ theorem ContinuousAlternatingMap.map_insertNth
+ theorem ContinuousAlternatingMap.neg_one_pow_smul_map_insertNth
+ theorem ContinuousAlternatingMap.neg_one_pow_smul_map_removeNth_add_eq_zero_of_eq
+ theorem ContinuousAlternatingMap.norm_alternatizeUncurryFinCLM_le
+ theorem ContinuousAlternatingMap.norm_alternatizeUncurryFin_le
+ theorem ContinuousAlternatingMap.toAlternatingMap_alternatizeUncurryFin
Modified Mathlib/LinearAlgebra/Alternating/Uncurry/Fin.lean
+ def AlternatingMap.alternatizeUncurryFin
+ def AlternatingMap.alternatizeUncurryFinLM
+ theorem AlternatingMap.alternatizeUncurryFin_add
+ theorem AlternatingMap.alternatizeUncurryFin_alternatizeUncurryFinLM_comp_of_symmetric
+ theorem AlternatingMap.alternatizeUncurryFin_apply
+ theorem AlternatingMap.alternatizeUncurryFin_curryLeft
+ theorem AlternatingMap.alternatizeUncurryFin_smul
- def AlternatingMap.uncurryFin
- def AlternatingMap.uncurryFinLM
- theorem AlternatingMap.uncurryFin_add
- theorem AlternatingMap.uncurryFin_apply
- theorem AlternatingMap.uncurryFin_curryLeft
- theorem AlternatingMap.uncurryFin_smul
- theorem AlternatingMap.uncurryFin_uncurryFinLM_comp_of_symmetric
2025-10-04 08:50:36 b501241
feat(Analysis/Convex): functoriality of the standard simplex (#28891)
When `f : X → Y` is a map between finite types, and `S` is an ordered semiring, we define the maps `stdSimplex.map f : stdSimplex S X → stdSimplex S Y`. In the case `S := ℝ`, we show that these maps are continuous. In a future PR #28893, the definition of the topological simplex in `AlgebraicTopology` shall be refactored.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Convex/StdSimplex.lean
+ theorem stdSimplex.continuous_map
+ theorem stdSimplex.ext
+ theorem stdSimplex.image_linearMap
+ theorem stdSimplex.le_one
+ theorem stdSimplex.map_coe
+ theorem stdSimplex.map_comp_apply
+ theorem stdSimplex.map_id_apply
+ theorem stdSimplex.map_vertex
+ theorem stdSimplex.sum_eq_one
+ theorem stdSimplex.vertex_coe
+ theorem stdSimplex.zero_le
Modified Mathlib/LinearAlgebra/Finsupp/Pi.lean
+ theorem FunOnFinite.linearMap_apply_apply
+ theorem FunOnFinite.linearMap_comp
+ theorem FunOnFinite.linearMap_id
+ theorem FunOnFinite.linearMap_piSingle
+ theorem FunOnFinite.map_apply_apply
+ theorem FunOnFinite.map_comp
+ theorem FunOnFinite.map_id
+ theorem FunOnFinite.map_piSingle
Added Mathlib/Topology/Algebra/Monoid/FunOnFinite.lean
+ theorem FunOnFinite.continuous_linearMap
+ theorem FunOnFinite.continuous_map
2025-10-04 08:50:34 321bb74
Add q-expansion identities for Eisenstein series. (#27844)
This is PR contains some q-expansion identities that are needed to give the q-expansions of Eisenstein series, which will be added as part of #27606.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Complex/Exponential.lean
+ theorem Complex.exp_nsmul'
Added Mathlib/Analysis/Complex/SummableUniformlyOn.lean
+ theorem SummableLocallyUniformlyOn.differentiableOn
Modified Mathlib/Analysis/Normed/Module/FiniteDimension.lean
+ theorem summable_norm_mul_geometric_of_norm_lt_one'
Modified Mathlib/NumberTheory/LSeries/RiemannZeta.lean
+ theorem two_mul_riemannZeta_eq_tsum_int_inv_pow_of_even
Modified Mathlib/NumberTheory/ModularForms/EisensteinSeries/Defs.lean
+ theorem EisensteinSeries.gammaSetDivGcdEquiv_eq
Added Mathlib/NumberTheory/ModularForms/EisensteinSeries/QExpansion.lean
+ theorem EisensteinSeries.qExpansion_identity
+ theorem EisensteinSeries.qExpansion_identity_pnat
+ theorem contDiffOn_tsum_cexp
+ theorem differentiableAt_iteratedDerivWithin_cexp
+ theorem iteratedDerivWithin_tsum_cexp_eq
+ theorem summableLocallyUniformlyOn_iteratedDerivWithin_cexp
+ theorem summableLocallyUniformlyOn_iteratedDerivWithin_smul_cexp
+ theorem summable_pow_mul_cexp
2025-10-04 08:50:31 5903e2b
feat(AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms): Normal forms for `P_σ`s (#25736)
We prove that admissible lists introduced in #21744 indeed provide a suitable normal form for morphisms of `SimplexCategoryGenRel` satisfying `P_σ` (i.e that are compositions of degeneracies).
To this end, we introduce `standardσ`, a construction that takes a list and turn it into a composition of `σ i`s in `SimplexCategoryGenRel`. We then prove that, thanks to the fifth simplicial identity, composition on the right by some `σ i` corresponds to simplicial insertion of `i` in the list. This gives existence of a normal form for every morphism satisfying `P_σ`, i.e exhibits such morphism as some `standardσ`.
For unicity, we introduce an auxiliary function `simplicialEvalσ : (List ℕ) → ℕ → ℕ` and show that for admissible lists, it lifts to `ℕ` the `orderHom` attached to `toSimplexCategory.map standardσ` and that we can recover elements of the list only by looking at values of this function. Since admissible lists are sorted, this fully characterizes the list, and thus shows that the list only depends on the morphism `standardσ` attached to it.
Part of a series of PR formalising that `SimplexCategoryGenRel` is equivalent to `SimplexCategory`.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean
+ theorem SimplexCategoryGenRel.exists_normal_form_P_σ
+ theorem SimplexCategoryGenRel.lt_and_eval_eq_eval_add_one_of_mem_isAdmissible
+ theorem SimplexCategoryGenRel.mem_isAdmissible_iff
+ theorem SimplexCategoryGenRel.mem_isAdmissible_of_lt_and_eval_eq_eval_add_one
+ def SimplexCategoryGenRel.simplicialEvalσ
+ theorem SimplexCategoryGenRel.simplicialEvalσ_monotone
+ theorem SimplexCategoryGenRel.simplicialEvalσ_of_isAdmissible
+ theorem SimplexCategoryGenRel.simplicialEvalσ_of_lt_mem
+ def SimplexCategoryGenRel.standardσ
+ theorem SimplexCategoryGenRel.standardσ_comp_standardσ
+ theorem SimplexCategoryGenRel.standardσ_cons
+ theorem SimplexCategoryGenRel.standardσ_nil
+ theorem SimplexCategoryGenRel.standardσ_simplicialInsert
2025-10-04 07:54:24 08f5cd2
chore(Lean/Expr/Basic): move material about rewriting to a new file (#30156)
These methods should go into Lean.Meta.Tactic.Rewrite instead, so move them to a new file. I credit Kim, Kyle and Patrick from #3801 for this; Kim's final clean-up eventually introduced these methods.
With this moved, the imports for Lean.Expr.Basic can be reduced to just Lean.Expr, which we do.
Noticed during work on #26221.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Lean/Expr/Basic.lean
- def Lean.Expr.rewrite
- def Lean.Expr.rewriteType
Added Mathlib/Lean/Meta/Tactic/Rewrite.lean
+ def Lean.Expr.rewrite
+ def Lean.Expr.rewriteType
Modified Mathlib/Order/Defs/PartialOrder.lean
Modified Mathlib/Tactic/Common.lean
Modified Mathlib/Tactic/DeprecateTo.lean
Modified Mathlib/Tactic/Linarith/Preprocessing.lean
Modified Mathlib/Tactic/ToAdditive/Frontend.lean
Modified MathlibTest/Lint.lean
2025-10-04 05:32:36 bc0b6c6
chore(SpecialFunctions/Pow/Real): adjust intCast lemma to use int (#30172)
The old statement was identical to the natCast one, and did not mention int or intCast at all, so we correct the statement.
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Pow/Real.lean
+/- theorem Real.rpow_sub_intCast
2025-10-04 03:18:29 468e675
chore(Analysis/NormedSpace/Extend): deprecate module (#30165)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/Analysis/NormedSpace/Extend.lean
2025-10-04 03:18:28 57b34ca
chore(Lean/Elab/Term): reduce import to match file name (#30155)
This file only requires importing Lean.Elab.Term, and it's good practice anyway for the file name and only import to match.
Discovering in #26221.
ESTIMATED CHANGES
Modified Mathlib/Lean/Elab/Term.lean
2025-10-04 03:18:26 1b1f528
feat(RingTheory): {Mv}PowerSeries.{le_}{weighted}Order_prod (#29820)
The big operator version of `{le}_{weighted}Order_mul`
ESTIMATED CHANGES
Modified Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean
+ theorem MvPowerSeries.order_prod
+ theorem MvPowerSeries.weightedOrder_prod
Modified Mathlib/RingTheory/MvPowerSeries/Order.lean
+ theorem MvPowerSeries.le_order_prod
+ theorem MvPowerSeries.le_weightedOrder_prod
+ theorem MvPowerSeries.weightedOrder_one
Modified Mathlib/RingTheory/PowerSeries/Order.lean
+ theorem PowerSeries.le_order_prod
+ theorem PowerSeries.order_prod
2025-10-04 03:18:25 9358199
chore(Data/Finite): deprecate `card_le_of_injective`, `card_le_of_surjective` and `card_sum` (#28492)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Galois/Basic.lean
Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/WalkCounting.lean
Modified Mathlib/Combinatorics/SimpleGraph/Tutte.lean
Modified Mathlib/Data/Finite/Card.lean
- theorem Finite.card_le_of_injective
- theorem Finite.card_le_of_surjective
- theorem Finite.card_sum
Modified Mathlib/GroupTheory/CommutingProbability.lean
Modified Mathlib/GroupTheory/Index.lean
2025-10-04 02:47:21 5bcb7f8
chore(Order/Filter/Finite): clean up (#30154)
`protected alias` works now. Also write a module doc.
ESTIMATED CHANGES
Modified Mathlib/Order/Filter/Finite.lean
2025-10-03 22:56:44 0607ff2
feat(CategoryTheory/MorphismProperty): locality conditions (#30164)
These are "upstreamed" from the corresponding definitions for morphism properties of schemes. The old definitions for schemes will be deprecated in a follow-up PR.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/MorphismProperty/Basic.lean
Added Mathlib/CategoryTheory/MorphismProperty/Local.lean
+ theorem CategoryTheory.MorphismProperty.IsLocalAtSource.iff_of_zeroHypercover
+ theorem CategoryTheory.MorphismProperty.IsLocalAtSource.of_le
+ theorem CategoryTheory.MorphismProperty.IsLocalAtTarget.iff_of_zeroHypercover
+ theorem CategoryTheory.MorphismProperty.IsLocalAtTarget.mk_of_isStableUnderBaseChange
+ theorem CategoryTheory.MorphismProperty.IsLocalAtTarget.of_isPullback
+ theorem CategoryTheory.MorphismProperty.IsLocalAtTarget.of_le
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
+ def CategoryTheory.Precoverage.ZeroHypercover.weaken
2025-10-03 20:46:39 f16a915
chore(Topology/Constructions): avoid some defeq abuse (#30097)
Uses `x ∈ s` instead of `s x` for `s : Set X`.
ESTIMATED CHANGES
Modified Mathlib/Topology/Constructions.lean
2025-10-03 19:27:41 1d31a94
feat(CategoryTheory/Limits/Sifted): characterization of sifted categories (#25735)
Characterize small sifted as those for which the `Type`-valued colimit functor preserves finite product. Deduce that filtered categories, and that categories admitting a final functor from a sifted categories are also sifted.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Indization/FilteredColimits.lean
Modified Mathlib/CategoryTheory/Limits/Sifted.lean
+ theorem CategoryTheory.IsSifted.factorization_prodComparison_colim
+ theorem CategoryTheory.IsSifted.isSiftedOrEmpty_of_colim_preservesBinaryProducts
+ theorem CategoryTheory.IsSifted.isSiftedOrEmpty_of_colim_preservesFiniteProducts
+ theorem CategoryTheory.IsSifted.nonempty_of_colim_preservesLimitsOfShapeFinZero
+ theorem CategoryTheory.IsSifted.of_colim_preservesFiniteProducts
+ theorem CategoryTheory.IsSifted.of_final_functor_from_sifted'
+ theorem CategoryTheory.IsSifted.of_final_functor_from_sifted
2025-10-03 17:59:36 bd5729a
doc(CategoryTheory/Limits): update docstrings of `HasPullbacks` etc (#30145)
Update the docstrings of `HasPullbacks`, `HasEqualizers` etc. to reflect that those declarations are propositions and no longer carry any choices of limits as data. This came up in #29795.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/FiniteLimits.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/WideEqualizers.lean
Modified Mathlib/CategoryTheory/Limits/Shapes/WidePullbacks.lean
2025-10-03 17:59:34 fe0511b
feat(CategoryTheory/CopyDiscardCategory): add Copy-Discard categories (#29939)
This PR introduces copy-discard categories for categorical probability theory (see #29657 for future work).
This PR builds on #29919.
## Main additions
### 1. Copy-discard categories (`CopyDiscardCategory`)
A symmetric monoidal category where every object has commutative comonoid structure (copy and discard operations) compatible with the tensor product.
### 2. Deterministic morphisms
Morphisms that preserve copy-discard structure. In probabilistic interpretations, these lack randomness. In Cartesian categories, all morphisms are deterministic.
## Mathematical significance
Copy-discard categories provide the base for categorical probability (a later PR will build Markov categories from this); morphisms model stochastic processes, copy creates perfect correlation, discard marginalizes.
## Implementation notes
- Builds on the `CommComonObj` class in #29919
- Uses type class instances to provide copy/discard for all objects
- The `Deterministic` type class abbreviates `IsComonHom` for readability
## References
Added citations to:
- Cho & Jacobs (2019) on disintegration and Bayesian inversion with string diagrams
- Fritz (2020) on categorical approaches to statistics and conditional independence
[](https://gitpod.io/from-referrer/)
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/CopyDiscardCategory/Basic.lean
Added Mathlib/CategoryTheory/CopyDiscardCategory/Cartesian.lean
Added Mathlib/CategoryTheory/CopyDiscardCategory/Deterministic.lean
+ theorem CategoryTheory.Deterministic.copy_natural
+ theorem CategoryTheory.Deterministic.discard_natural
Modified docs/references.bib
2025-10-03 17:59:33 a07ecdd
feat(CategoryTheory/Limits/Shapes/Products): add limMapPi and sigmaMapColim (#27815)
Add the canonical morphism from a limit to the product over its objects. Prove that it is a monomorphism.
Dually, add the canonical morphism to a colimit from the coproduc of its objects and prove that it is an epimorphism.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/Shapes/Products.lean
2025-10-03 17:24:40 ddbd4d2
feat(CharP/*): generalize a lemma, add `ringChar_eq_one` (#29952)
ESTIMATED CHANGES
Modified Mathlib/Algebra/CharP/Defs.lean
+ theorem ringChar.ringChar_eq_one
+ theorem ringChar.ringChar_subsingleton
Modified Mathlib/Algebra/CharP/Invertible.lean
+/- theorem not_ringChar_dvd_of_invertible
2025-10-03 16:11:14 32e6452
feat(Algebra): IsDomain R[X] ↔ IsDomain R ∧ IsCancelAdd R (#27238)
ESTIMATED CHANGES
Modified Counterexamples.lean
Added Counterexamples/PolynomialIsDomain.lean
+ theorem NatMaxAdd.natCast_eq_one
+ theorem NatMaxAdd.noZeroDivisors_polynomial
+ theorem NatMaxAdd.not_isCancelAdd
+ theorem NatMaxAdd.not_isDomain_polynomial
+ def NatMaxAdd
+ theorem not_isDomain_commSemiring_imp_isDomain_polynomial
Modified Mathlib/Algebra/Group/Defs.lean
Modified Mathlib/Algebra/Group/Opposite.lean
Modified Mathlib/Algebra/GroupWithZero/TransferInstance.lean
Modified Mathlib/Algebra/Opposites.lean
+ theorem MulOpposite.isLeftCancelAdd_iff
+ theorem MulOpposite.isRightCancelAdd_iff
Modified Mathlib/Algebra/Polynomial/Basic.lean
+ theorem Polynomial.noZeroDivisors_iff
Modified Mathlib/RingTheory/Polynomial/Opposites.lean
+ theorem Polynomial.isDomain_iff
+ theorem Polynomial.isLeftCancelMulZero_iff
+ theorem Polynomial.isRightCancelMulZero_iff
2025-10-03 15:29:23 17b380c
chore(Algebra/Ring/Invertible): fix two names (#30166)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Ring/Invertible.lean
+ theorem AddUnits.neg_mulLeft
+ theorem AddUnits.neg_mulRight
- theorem AddUnits.neg_mul_left
- theorem AddUnits.neg_mul_right
2025-10-03 14:43:36 3bddb2a
chore: replace CategoryTheory.FreeGroupoid with Quiver.FreeGroupoid (#30115)
As suggested by Riou in #29279, when we build the free groupoid on a category the name `CategoryTheory.FreeGroupoid` will be inappropriate and confusing. We put definitions in the file `CategoryTheory.FreeGroupoid` in the namespace `Quiver.FreeGroupoid` instead.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Groupoid/FreeGroupoid.lean
- def CategoryTheory.FreeGroupoid
- theorem CategoryTheory.Groupoid.Free.congr_comp_reverse
- theorem CategoryTheory.Groupoid.Free.congr_reverse
- theorem CategoryTheory.Groupoid.Free.congr_reverse_comp
- theorem CategoryTheory.Groupoid.Free.freeGroupoidFunctor_comp
- theorem CategoryTheory.Groupoid.Free.freeGroupoidFunctor_id
- def CategoryTheory.Groupoid.Free.lift
- theorem CategoryTheory.Groupoid.Free.lift_spec
- theorem CategoryTheory.Groupoid.Free.lift_unique
- def CategoryTheory.Groupoid.Free.of
- theorem CategoryTheory.Groupoid.Free.of_eq
- def CategoryTheory.Groupoid.Free.quotInv
- inductive CategoryTheory.Groupoid.Free.redStep
- def CategoryTheory.freeGroupoidFunctor
+ theorem Quiver.FreeGroupoid.congr_comp_reverse
+ theorem Quiver.FreeGroupoid.congr_reverse
+ theorem Quiver.FreeGroupoid.congr_reverse_comp
+ def Quiver.FreeGroupoid.lift
+ theorem Quiver.FreeGroupoid.lift_spec
+ theorem Quiver.FreeGroupoid.lift_unique
+ def Quiver.FreeGroupoid.of
+ theorem Quiver.FreeGroupoid.of_eq
+ def Quiver.FreeGroupoid.quotInv
+ inductive Quiver.FreeGroupoid.redStep
+ def Quiver.FreeGroupoid
+ def Quiver.freeGroupoidFunctor
+ theorem Quiver.freeGroupoidFunctor_comp
+ theorem Quiver.freeGroupoidFunctor_id
2025-10-03 14:29:07 f962fa3
chore(CategoryTheory/Monoidal/Mon): reorder (#30157)
Move the `BraidedCategory (Mon_ C)` instance earlier in the file. Indeed I think it makes more sense like this (defining `MonClass`, then `Mon`, then `Functor.mapMon`).
This is necessary for the material in #29136 to be placed in a relatively non-silly order within the file.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Monoidal/Mon_.lean
- theorem CategoryTheory.Equivalence.Mon.associator_hom_hom
- theorem CategoryTheory.Equivalence.Mon.associator_inv_hom
- theorem CategoryTheory.Equivalence.Mon.braiding_hom_hom
- theorem CategoryTheory.Equivalence.Mon.braiding_inv_hom
- theorem CategoryTheory.Equivalence.Mon.forget_δ
- theorem CategoryTheory.Equivalence.Mon.forget_ε
- theorem CategoryTheory.Equivalence.Mon.forget_η
- theorem CategoryTheory.Equivalence.Mon.forget_μ
- theorem CategoryTheory.Equivalence.Mon.leftUnitor_hom_hom
- theorem CategoryTheory.Equivalence.Mon.leftUnitor_inv_hom
- theorem CategoryTheory.Equivalence.Mon.rightUnitor_hom_hom
- theorem CategoryTheory.Equivalence.Mon.rightUnitor_inv_hom
- theorem CategoryTheory.Equivalence.Mon.tensorObj_mul
- theorem CategoryTheory.Equivalence.Mon.tensorObj_one
- theorem CategoryTheory.Equivalence.Mon.tensorUnit_X
- theorem CategoryTheory.Equivalence.Mon.tensorUnit_mul
- theorem CategoryTheory.Equivalence.Mon.tensorUnit_one
- theorem CategoryTheory.Equivalence.Mon.tensor_mul
- theorem CategoryTheory.Equivalence.Mon.tensor_one
- theorem CategoryTheory.Equivalence.Mon.whiskerLeft_hom
- theorem CategoryTheory.Equivalence.Mon.whiskerRight_hom
- theorem CategoryTheory.Equivalence.MonObj.Mon_tensor_mul_assoc
- theorem CategoryTheory.Equivalence.MonObj.Mon_tensor_mul_one
- theorem CategoryTheory.Equivalence.MonObj.Mon_tensor_one_mul
- theorem CategoryTheory.Equivalence.MonObj.mul_associator
- theorem CategoryTheory.Equivalence.MonObj.mul_braiding
- theorem CategoryTheory.Equivalence.MonObj.mul_leftUnitor
- theorem CategoryTheory.Equivalence.MonObj.mul_rightUnitor
- theorem CategoryTheory.Equivalence.MonObj.one_associator
- theorem CategoryTheory.Equivalence.MonObj.one_braiding
- theorem CategoryTheory.Equivalence.MonObj.one_leftUnitor
- theorem CategoryTheory.Equivalence.MonObj.one_rightUnitor
+ theorem Mon.associator_hom_hom
+ theorem Mon.associator_inv_hom
+ theorem Mon.braiding_hom_hom
+ theorem Mon.braiding_inv_hom
+ theorem Mon.forget_δ
+ theorem Mon.forget_ε
+ theorem Mon.forget_η
+ theorem Mon.forget_μ
+ theorem Mon.leftUnitor_hom_hom
+ theorem Mon.leftUnitor_inv_hom
+ theorem Mon.rightUnitor_hom_hom
+ theorem Mon.rightUnitor_inv_hom
+ theorem Mon.tensorObj_mul
+ theorem Mon.tensorObj_one
+ theorem Mon.tensorUnit_X
+ theorem Mon.tensorUnit_mul
+ theorem Mon.tensorUnit_one
+ theorem Mon.tensor_mul
+ theorem Mon.tensor_one
+ theorem Mon.whiskerLeft_hom
+ theorem Mon.whiskerRight_hom
+ theorem MonObj.Mon_tensor_mul_assoc
+ theorem MonObj.Mon_tensor_mul_one
+ theorem MonObj.Mon_tensor_one_mul
+ theorem MonObj.mul_associator
+ theorem MonObj.mul_braiding
+ theorem MonObj.mul_leftUnitor
+ theorem MonObj.mul_rightUnitor
+ theorem MonObj.one_associator
+ theorem MonObj.one_braiding
+ theorem MonObj.one_leftUnitor
+ theorem MonObj.one_rightUnitor
2025-10-03 10:42:17 4b5fe0e
feat(Probability): Fernique's theorem for distributions that are invariant by rotation (#28343)
Let `μ` be a finite measure on a second-countable normed space `E` such that the product measure `μ.prod μ` on `E × E` is invariant by rotation of angle `-π/4`.
Then there exists a constant `C > 0` such that the function `x ↦ exp (C * ‖x‖ ^ 2)` is integrable with respect to `μ`.
The main application of this theorem will be for Gaussian measures.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Data/Real/Sqrt.lean
+ theorem Real.inv_sqrt_two_sub_one
Added Mathlib/Probability/Distributions/Fernique.lean
+ def ContinuousLinearMap.rotation
+ theorem ContinuousLinearMap.rotation_apply
+ theorem ProbabilityTheory.Fernique.lintegral_closedBall_diff_exp_logRatio_mul_sq_le
+ theorem ProbabilityTheory.Fernique.lintegral_exp_mul_sq_norm_le_mul
+ theorem ProbabilityTheory.Fernique.logRatio_mono
+ theorem ProbabilityTheory.Fernique.logRatio_mul_normThreshold_add_one_le
+ theorem ProbabilityTheory.Fernique.logRatio_nonneg
+ theorem ProbabilityTheory.Fernique.logRatio_pos
+ theorem ProbabilityTheory.Fernique.lt_normThreshold_zero
+ theorem ProbabilityTheory.Fernique.measure_gt_normThreshold_le_exp
+ theorem ProbabilityTheory.Fernique.measure_gt_normThreshold_le_rpow
+ theorem ProbabilityTheory.Fernique.measure_le_mul_measure_gt_normThreshold_le_of_map_rotation_eq_self
+ theorem ProbabilityTheory.Fernique.normThreshold_add_one
+ theorem ProbabilityTheory.Fernique.normThreshold_eq
+ theorem ProbabilityTheory.Fernique.normThreshold_strictMono
+ theorem ProbabilityTheory.Fernique.normThreshold_zero
+ theorem ProbabilityTheory.Fernique.sq_normThreshold_add_one_le
+ theorem ProbabilityTheory.Fernique.tendsto_normThreshold_atTop
+ theorem ProbabilityTheory.exists_integrable_exp_sq_of_map_rotation_eq_self'
+ theorem ProbabilityTheory.exists_integrable_exp_sq_of_map_rotation_eq_self
+ theorem ProbabilityTheory.exists_integrable_exp_sq_of_map_rotation_eq_self_of_isProbabilityMeasure
+ theorem ProbabilityTheory.lintegral_exp_mul_sq_norm_le_of_map_rotation_eq_self
+ theorem ProbabilityTheory.measure_le_mul_measure_gt_le_of_map_rotation_eq_self
+ theorem StrictMono.exists_between_of_tendsto_atTop
Modified docs/references.bib
2025-10-03 07:54:37 452e1c3
chore: remove tactic `simp_lex` and use `simp` instead (#28111)
Motivation: `simp_lex` is just shorthand for `refine toLex.surjective.forall₃.2 ?_; rintro (a | a) (b | b) (c | c) <;> simp`, so plain `simp` seems preferable.
ESTIMATED CHANGES
Modified Mathlib/Data/Sum/Interval.lean
2025-10-03 07:18:19 f44f6a5
feature(Analysis/LocallyConvex/WeakSpace): weak closed convex hull equals closed convex hull (#29258)
The weak closed convex hull is equal to the closed convex hull in the original topology.
ESTIMATED CHANGES
Modified Mathlib/Analysis/LocallyConvex/WeakSpace.lean
+ theorem toWeakSpace_closedConvexHull_eq
Modified Mathlib/Topology/Algebra/Module/WeakDual.lean
2025-10-03 06:19:43 6dcfd42
refactor(AlgebraicGeometry): replace `Scheme.Cover` by an `abbrev` for `ZeroHypercover` (#29061)
We replace `Scheme.Cover` by an `abbrev` for `Coverage.ZeroHypercover`. The main motivation is to allow for a generalization of `IsLocalAtTarget`, `IsLocalAtSource` etc. to arbitrary coverages. The second motivation is to reduce duplication in the upcoming introduction of categories of analytic spaces (e.g. adic spaces), by generalizing notions of `Cover` to suitable general categories.
Future work: Besides the generalisation of `IsLocalAtTarget`, the content of `AlgebraicGeometry.Cover.Over` and `AlgebraicGeometry.Sites.Small` shall be generalized to general coverages instead of the coverage induced by a morphism property.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/AffineSpace.lean
Modified Mathlib/AlgebraicGeometry/AffineTransitionLimit.lean
Modified Mathlib/AlgebraicGeometry/Cover/Directed.lean
Modified Mathlib/AlgebraicGeometry/Cover/MorphismProperty.lean
+/- def AlgebraicGeometry.Scheme.AffineCover.cover
+/- def AlgebraicGeometry.Scheme.Cover.Hom.comp
+/- def AlgebraicGeometry.Scheme.Cover.Hom.id
+/- structure AlgebraicGeometry.Scheme.Cover.Hom
- def AlgebraicGeometry.Scheme.Cover.add
- def AlgebraicGeometry.Scheme.Cover.bind
+/- def AlgebraicGeometry.Scheme.Cover.changeProp
+/- theorem AlgebraicGeometry.Scheme.Cover.comp_app
+/- theorem AlgebraicGeometry.Scheme.Cover.comp_idx_apply
+/- def AlgebraicGeometry.Scheme.Cover.copy
+ theorem AlgebraicGeometry.Scheme.Cover.covers
+/- theorem AlgebraicGeometry.Scheme.Cover.exists_eq
+/- theorem AlgebraicGeometry.Scheme.Cover.iUnion_range
+/- theorem AlgebraicGeometry.Scheme.Cover.id_app
+/- theorem AlgebraicGeometry.Scheme.Cover.id_idx_apply
+ def AlgebraicGeometry.Scheme.Cover.idx
- def AlgebraicGeometry.Scheme.Cover.inter
+ theorem AlgebraicGeometry.Scheme.Cover.map_prop
- def AlgebraicGeometry.Scheme.Cover.pullbackCover'
- def AlgebraicGeometry.Scheme.Cover.pullbackCover
- def AlgebraicGeometry.Scheme.Cover.reindex
+/- def AlgebraicGeometry.Scheme.Cover.ulift
- structure AlgebraicGeometry.Scheme.Cover
+ theorem AlgebraicGeometry.Scheme.presieve₀_mem_precoverage_iff
Modified Mathlib/AlgebraicGeometry/Cover/Open.lean
Modified Mathlib/AlgebraicGeometry/Cover/Over.lean
+/- def AlgebraicGeometry.Scheme.Cover.pullbackCoverOver'
+/- def AlgebraicGeometry.Scheme.Cover.pullbackCoverOver
+/- def AlgebraicGeometry.Scheme.Cover.pullbackCoverOverProp'
+/- def AlgebraicGeometry.Scheme.Cover.pullbackCoverOverProp
Modified Mathlib/AlgebraicGeometry/Cover/Sigma.lean
Modified Mathlib/AlgebraicGeometry/FunctionField.lean
Modified Mathlib/AlgebraicGeometry/Gluing.lean
- theorem AlgebraicGeometry.Scheme.IsLocallyDirected.openCover_I₀
- theorem AlgebraicGeometry.Scheme.IsLocallyDirected.openCover_X
- theorem AlgebraicGeometry.Scheme.IsLocallyDirected.openCover_f
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean
Modified Mathlib/AlgebraicGeometry/Limits.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Finite.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FinitePresentation.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/FormallyUnramified.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/LocalClosure.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Separated.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/SurjectiveOnStalks.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/UnderlyingMap.lean
Modified Mathlib/AlgebraicGeometry/Noetherian.lean
Modified Mathlib/AlgebraicGeometry/Properties.lean
Modified Mathlib/AlgebraicGeometry/Pullbacks.lean
Modified Mathlib/AlgebraicGeometry/RationalMap.lean
Modified Mathlib/AlgebraicGeometry/Restrict.lean
Modified Mathlib/AlgebraicGeometry/Sites/Pretopology.lean
+/- theorem AlgebraicGeometry.Scheme.Cover.mem_grothendieckTopology
+/- theorem AlgebraicGeometry.Scheme.Cover.mem_pretopology
Modified Mathlib/AlgebraicGeometry/Sites/Small.lean
+/- theorem AlgebraicGeometry.Scheme.Cover.overEquiv_generate_toPresieveOver_eq_ofArrows
+/- def AlgebraicGeometry.Scheme.Cover.toPresieveOver
+/- def AlgebraicGeometry.Scheme.Cover.toPresieveOverProp
+/- theorem AlgebraicGeometry.Scheme.Cover.toPresieveOver_le_arrows_iff
Modified Mathlib/AlgebraicGeometry/SpreadingOut.lean
Modified Mathlib/AlgebraicGeometry/Stalk.lean
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
2025-10-03 04:27:24 3fdbf34
chore(Data): golf `Data/` using `grind` (#26640)
ESTIMATED CHANGES
Modified Mathlib/Data/EReal/Operations.lean
Modified Mathlib/Data/Finset/Powerset.lean
Modified Mathlib/Data/List/Basic.lean
Modified Mathlib/Data/List/Cycle.lean
Modified Mathlib/Data/List/FinRange.lean
+/- theorem List.finRange_succ_eq_map
Modified Mathlib/Data/List/Induction.lean
Modified Mathlib/Data/List/Nodup.lean
Modified Mathlib/Data/List/Sigma.lean
Modified Mathlib/Data/PEquiv.lean
Modified Mathlib/Data/PNat/Xgcd.lean
Modified Mathlib/Data/Prod/Lex.lean
Modified Mathlib/Data/Real/GoldenRatio.lean
Modified Mathlib/Data/Set/Lattice.lean
Modified Mathlib/Data/Stream/Init.lean
2025-10-02 21:48:35 3407d8a
chore: Revert "chore: deprecate `Traversable` deriving handler (#29573)" (#29931)
This reverts commit f4506f7151c9057fd9f8714b2a1f13a647fe2352.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Tactic.lean
Renamed Mathlib/Deprecated/Tactic/DeriveTraversable.lean to Mathlib/Tactic/DeriveTraversable.lean
Modified MathlibTest/Traversable.lean
2025-10-02 21:06:29 e793704
chore(Convex/Extreme): redefine `IsExtreme` and `extremePoints` (#29950)
Remove a redundant conclusion from the definitions, so that it's easier to prove these statements now.
As suggested by @YaelDillies in a comment to #23458
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Exposed.lean
Modified Mathlib/Analysis/Convex/Extreme.lean
+ theorem IsExtreme.right_mem_of_mem_openSegment
+ structure IsExtreme
- def IsExtreme
Modified Mathlib/Analysis/Convex/KreinMilman.lean
Modified Mathlib/Dynamics/Ergodic/Extreme.lean
2025-10-02 20:11:11 3c14b55
doc(Logic): update library note [fact non-instances] (#30125)
Going through all library notes I noticed that this note still refers Lean 3's instance search mechanisms. Instance synthesis is still not a good proof search mechanism, but it's smarter than before and looks at more than the head symbol now.
ESTIMATED CHANGES
Modified Mathlib/Logic/Basic.lean
2025-10-02 19:28:18 3da1779
feat(Order): synchronize IsAntichain API with IsChain (#29834)
For `IsAntichain`, make `empty`/`singleton` two simp lemmas that exactly match the API in `IsChain`, and add an analogous `isAntichain_union` lemma.
For `IsChain`, add a `preimage` lemma matching IsAntichain's and copy over a set of lemmas about different mappings preserving the predicate.
ESTIMATED CHANGES
Modified Mathlib/Order/Antichain.lean
- theorem isAntichain_singleton
+ theorem isAntichain_union
Modified Mathlib/Order/Preorder/Chain.lean
+ theorem IsChain.image_embedding
+ theorem IsChain.image_embedding_iff
+ theorem IsChain.image_iso
+ theorem IsChain.image_iso_iff
+ theorem IsChain.image_relEmbedding
+ theorem IsChain.image_relEmbedding_iff
+ theorem IsChain.image_relIso
+ theorem IsChain.image_relIso_iff
+ theorem IsChain.preimage
+ theorem IsChain.preimage_embedding
+ theorem IsChain.preimage_iso
+ theorem IsChain.preimage_iso_iff
+ theorem IsChain.preimage_relEmbedding
+ theorem IsChain.preimage_relIso
2025-10-02 18:41:23 84a5d74
chore(VectorBundle/Riemannian): use `grw` (#29915)
ESTIMATED CHANGES
Modified Mathlib/Topology/VectorBundle/Riemannian.lean
2025-10-02 18:14:39 18226f6
feature(Analysis/Convex/Basic): Convexity and the algebra map (#29248)
Let `R` and `A` be ordered rings, `A` an `R`-algebra and `R`, `A`, `M` a scalar tower. We provide sufficient conditions for an `R`-convex subset of `M` to be `A`-convex and for an `A`-convex subset of `M` to be `R`-convex.
These are used to show that, when `K` is `RCLike` and `ℝ` `K` `E` is a scalar tower, a set is `K`-convex if and only if it is `ℝ`-convex.
Used in #29258
ESTIMATED CHANGES
Modified Mathlib/Analysis/Convex/Basic.lean
+ theorem convex_of_nonneg_surjective_algebraMap
Modified Mathlib/Analysis/RCLike/Lemmas.lean
+ theorem convex_RCLike_iff_convex_real
2025-10-02 17:50:27 27e8b12
chore(Bicategory/Strict): move around files related to strict bicategories (#30134)
This PR moves around some files in preparation for #30132, which introduces the notion of "strict" pseudofunctors.
I want to add this new definition to the file `Bicategory/Functor/Strict.lean`, which already contains API for pseudofunctors *between* strict bicategories. My addition is about strict pseudofunctors between arbitrary bicategories.
To make the distinction more clear I have decided to rearrange the file structure slightly. First I created a folder `Bicategory/Strict/` to which I move the file `Bicategory/Strict.lean` (as `Bicategory/Strict/Basic.lean`). Then I move the current file `Bicategory/Functor/Strict.lean` to `Bicategory/Strict/Pseudofunctor.lean` as I believe this fits better with the contents of the file. Then the name `Bicategory/Functor/Strict.lean` is freed up to contain the notion of a "strict" pseudofunctor in the upcoming #30132.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean
Renamed Mathlib/CategoryTheory/Bicategory/Strict.lean to Mathlib/CategoryTheory/Bicategory/Strict/Basic.lean
Renamed Mathlib/CategoryTheory/Bicategory/Functor/Strict.lean to Mathlib/CategoryTheory/Bicategory/Strict/Pseudofunctor.lean
Modified Mathlib/CategoryTheory/Category/Cat.lean
Modified Mathlib/CategoryTheory/FiberedCategory/BasedCategory.lean
2025-10-02 17:25:09 3576a64
feat(CategoryTheory/Bicategory): EqToHom for bicategories (#28242)
We generalize the `eqToHom` construction from `Category` to `CategoryStruct`, allowing its usage in bicategorical contexts.
We introduce a file `CategoryTheory/Bicategory/EqToHom` that records some of the properties of `eqToHom`s 1-morphisms and 2-morphisms, such as the transitivity up to isomorphism of `eqToHom` 1-morphisms, and congruence lemmas for unitors, associators and whiskering with respects to `eqToHom` 2-morphisms.
This generalization and these congruence lemmas will be used to define icons between lax functors, and work with categories of strictly unitary lax/pseudo-functors (e.g for pseudocomposable arrows and lax-composable arrows in bicategories, which are part of the definitions of nerve constructions in bicategories).
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Bicategory/EqToHom.lean
+ theorem CategoryTheory.Bicategory.associator_eqToHom_hom
+ theorem CategoryTheory.Bicategory.associator_eqToHom_inv
+ theorem CategoryTheory.Bicategory.associator_hom_congr
+ theorem CategoryTheory.Bicategory.associator_inv_congr
+ theorem CategoryTheory.Bicategory.congr_whiskerLeft
+ def CategoryTheory.Bicategory.eqToHomTransIso
+ theorem CategoryTheory.Bicategory.eqToHomTransIso_refl_left
+ theorem CategoryTheory.Bicategory.eqToHomTransIso_refl_refl
+ theorem CategoryTheory.Bicategory.eqToHomTransIso_refl_right
+ theorem CategoryTheory.Bicategory.leftUnitor_hom_congr
+ theorem CategoryTheory.Bicategory.leftUnitor_inv_congr
+ theorem CategoryTheory.Bicategory.rightUnitor_hom_congr
+ theorem CategoryTheory.Bicategory.rightUnitor_inv_congr
+ theorem CategoryTheory.Bicategory.whiskerRight_congr
Modified Mathlib/CategoryTheory/EqToHom.lean
+/- def CategoryTheory.eqToHom
+/- theorem CategoryTheory.eqToHom_refl
2025-10-02 16:21:32 adb7d97
feat(Set): generalize Set.(e)ncard_prod (#30128)
Currently Set.(e)ncard_prod computes the cardinality of a product when both s and t are of type `Set α`, perform the trivial generalization of allowing t to be of a different type.
ESTIMATED CHANGES
Modified Mathlib/Data/Set/Card.lean
+/- theorem Set.encard_prod
+/- theorem Set.ncard_prod
2025-10-02 15:37:59 3a826f5
feat: `Colex` order on pi types (#29080)
We define an order instance on `Colex (∀ i, β i)`, so that its `<` relation is `Pi.Lex (· > ·) (· < ·)`.
ESTIMATED CHANGES
Modified Mathlib/Order/PiLex.lean
+ theorem Pi.Colex.noMaxOrder'
+ theorem Pi.colex_asc
+ theorem Pi.le_toColex_update_self_iff
+ theorem Pi.lt_toColex_update_self_iff
+ theorem Pi.toColex_monotone
+ theorem Pi.toColex_strictMono
+ theorem Pi.toColex_update_le_self_iff
+ theorem Pi.toColex_update_lt_self_iff
2025-10-02 15:01:54 4dd34c0
feat(CategoryTheory/Limits/MorphismProperty): dualise lemmas on limits (#30127)
We also add the object properties induced by morphism properties for `Comma`, `CostructuredArrow` and `StructuredArrow` and use them accordingly.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Limits/MorphismProperty.lean
+ theorem CategoryTheory.MorphismProperty.Comma.hasColimit_of_closedUnderColimitsOfShape
+ theorem CategoryTheory.MorphismProperty.Comma.hasColimitsOfShape_of_closedUnderColimitsOfShape
Modified Mathlib/CategoryTheory/MorphismProperty/Comma.lean
+ def CategoryTheory.MorphismProperty.commaObj
+ theorem CategoryTheory.MorphismProperty.commaObj_iff
+ def CategoryTheory.MorphismProperty.costructuredArrowObj
+ theorem CategoryTheory.MorphismProperty.costructuredArrowObj_iff
+ def CategoryTheory.MorphismProperty.structuredArrowObj
+ theorem CategoryTheory.MorphismProperty.structuredArrowObj_iff
2025-10-02 14:28:55 e4f93e7
feat(Probability): characterize conditional independence with conditional distributions (#30024)
Two random variables `f, g` are conditionally independent given a third `k` iff the conditional distribution of `f` given `k` and `g` is equal to the conditional distribution of `f` given `k`.
```lean
CondIndepFun (mγ.comap k) hk.comap_le g f μ ↔
condDistrib f (fun ω ↦ (k ω, g ω)) μ =ᵐ[μ.map (fun ω ↦ (k ω, g ω))]
(condDistrib f k μ).prodMkRight _
```
From the LeanBandits project.
ESTIMATED CHANGES
Modified Mathlib/Probability/Independence/Conditional.lean
+ theorem ProbabilityTheory.condIndepFun_iff_condDistrib_prod_ae_eq_prodMkLeft
+ theorem ProbabilityTheory.condIndepFun_iff_map_prod_eq_prod_condDistrib_prod_condDistrib
Modified Mathlib/Probability/Kernel/Composition/Lemmas.lean
+ theorem ProbabilityTheory.Kernel.prod_prodMkLeft_comp_prod_deterministic
+ theorem ProbabilityTheory.Kernel.prod_prodMkRight_comp_deterministic_prod
Modified Mathlib/Probability/Kernel/Composition/Prod.lean
+ theorem ProbabilityTheory.Kernel.prodAssoc_symm_prod
+ theorem ProbabilityTheory.Kernel.prodComm_prod
2025-10-02 14:13:44 f5bc879
chore(Mathlib/AlgebraicGeometry/Restrict): change openCoverOfISupEqTop to openCoverOfIsOpenCover (#30072)
This PR changes [AlgebraicGeometry.Scheme.openCoverOfISupEqTop](https://leanprover-community.github.io/mathlib4_docs/Mathlib/AlgebraicGeometry/Restrict.html#AlgebraicGeometry.Scheme.openCoverOfISupEqTop) into `AlgebraicGeometry.Scheme.openCoverOfISupEqTop`, which now takes `TopologicalSpace.IsOpenCover`.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Basic.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean
Modified Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean
- def AlgebraicGeometry.Proj.openCoverOfISupEqTop
+ def AlgebraicGeometry.Proj.openCoverOfIsOpenCover
Modified Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean
Modified Mathlib/AlgebraicGeometry/Restrict.lean
- def AlgebraicGeometry.Scheme.openCoverOfISupEqTop
+ def AlgebraicGeometry.Scheme.openCoverOfIsOpenCover
2025-10-02 13:49:15 ae4763b
refactor(AlgebraicGeometry/Sites): redefine pretopologies via precoverages (#29894)
We redefine the pretopology defined by a morphism property via `Precoverage` and make it independent of `Scheme.Cover`. This changes the definition of `AlgebraicGeometry.Scheme.pretopology`, because covering presieves are now allowed to be large. This does not matter, because the generated Grothendieck topology remains the same.
This allows us to redefine `Scheme.Cover` to be a `ZeroHypercover` with respect to this new precoverage, which will be done in the next PR.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/AlgebraicGeometry/Cover/MorphismProperty.lean
- theorem AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving.exists_preimage_snd_triplet_of_prop
Modified Mathlib/AlgebraicGeometry/GluingOneHypercover.lean
Modified Mathlib/AlgebraicGeometry/PullbackCarrier.lean
+ theorem AlgebraicGeometry.Scheme.Pullback.pullbackComparison_forget_surjective
Modified Mathlib/AlgebraicGeometry/Sites/BigZariski.lean
Modified Mathlib/AlgebraicGeometry/Sites/Etale.lean
Modified Mathlib/AlgebraicGeometry/Sites/MorphismProperty.lean
+ theorem AlgebraicGeometry.Scheme.IsJointlySurjectivePreserving.exists_preimage_snd_triplet_of_prop
- theorem AlgebraicGeometry.Scheme.grothendieckTopology_cover
- theorem AlgebraicGeometry.Scheme.grothendieckTopology_eq_inf
- theorem AlgebraicGeometry.Scheme.grothendieckTopology_le_grothendieckTopology
- def AlgebraicGeometry.Scheme.jointlySurjectivePretopology
- def AlgebraicGeometry.Scheme.jointlySurjectiveTopology
- theorem AlgebraicGeometry.Scheme.jointlySurjectiveTopology_eq_toGrothendieck_jointlySurjectivePretopology
- theorem AlgebraicGeometry.Scheme.mem_jointlySurjectiveTopology_iff_jointlySurjectivePretopology
+ theorem AlgebraicGeometry.Scheme.ofArrows_mem_precoverage_iff
+ def AlgebraicGeometry.Scheme.precoverage
- def AlgebraicGeometry.Scheme.pretopology
- theorem AlgebraicGeometry.Scheme.pretopology_cover
- theorem AlgebraicGeometry.Scheme.pretopology_le_inf
- theorem AlgebraicGeometry.Scheme.pretopology_le_pretopology
Added Mathlib/AlgebraicGeometry/Sites/Pretopology.lean
+ theorem AlgebraicGeometry.Scheme.Cover.mem_grothendieckTopology
+ theorem AlgebraicGeometry.Scheme.Cover.mem_pretopology
+ theorem AlgebraicGeometry.Scheme.grothendieckTopology_eq_inf
+ theorem AlgebraicGeometry.Scheme.grothendieckTopology_monotone
+ def AlgebraicGeometry.Scheme.jointlySurjectivePretopology
+ def AlgebraicGeometry.Scheme.jointlySurjectiveTopology
+ theorem AlgebraicGeometry.Scheme.jointlySurjectiveTopology_eq_toGrothendieck_jointlySurjectivePretopology
+ theorem AlgebraicGeometry.Scheme.mem_grothendieckTopology_iff
+ theorem AlgebraicGeometry.Scheme.mem_jointlySurjectiveTopology_iff_jointlySurjectivePretopology
+ theorem AlgebraicGeometry.Scheme.mem_pretopology_iff
+ def AlgebraicGeometry.Scheme.pretopology
+ theorem AlgebraicGeometry.Scheme.pretopology_eq_inf
+ theorem AlgebraicGeometry.Scheme.pretopology_monotone
Modified Mathlib/AlgebraicGeometry/Sites/Representability.lean
Modified Mathlib/AlgebraicGeometry/Sites/Small.lean
Modified Mathlib/CategoryTheory/Sites/JointlySurjective.lean
+ theorem CategoryTheory.Presieve.ofArrows_mem_comap_jointlySurjectivePrecoverage_iff
Modified Mathlib/CategoryTheory/Sites/Sieves.lean
+ theorem CategoryTheory.Presieve.map_monotone
2025-10-02 13:23:13 48541a8
feat(RepresentationTheory/Homological): add standard resolution for finite cyclic groups (#27363)
Let `k` be a commutative ring and `G` a finite commutative group. Given `g : G` and `A : Rep k G`, we can define a periodic chain complex in `Rep k G` given by `... ⟶ A --N--> A --(ρ(g) - 𝟙)--> A --N--> A --(ρ(g) - 𝟙)--> A ⟶ 0` where `N` is the norm map sending `a : A` to `∑ ρ(g)(a)` for all `g` in `G`.
When `G` is generated by `g` and `A` is the left regular representation `k[G]`, this chain complex is a projective resolution of `k` as a trivial representation, which we prove in this PR.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/RepresentationTheory/Homological/FiniteCyclic.lean
+ theorem Rep.FiniteCyclicGroup.leftRegular.range_applyAsHom_sub_eq_ker_linearCombination
+ theorem Rep.FiniteCyclicGroup.leftRegular.range_applyAsHom_sub_eq_ker_norm
+ theorem Rep.FiniteCyclicGroup.leftRegular.range_norm_eq_ker_applyAsHom_sub
+ theorem Rep.FiniteCyclicGroup.resolution_quasiIso
+ theorem Representation.FiniteCyclicGroup.coinvariantsKer_eq_range
+ theorem Representation.FiniteCyclicGroup.coinvariantsKer_leftRegular_eq_ker
Modified Mathlib/RepresentationTheory/Invariants.lean
+ theorem Representation.mem_invariants_iff_of_forall_mem_zpowers
2025-10-02 12:58:47 ca55add
feat(Mathlib/CategoryTheory/EffectiveEpi/Types): Effective epi in types (#29958)
This PR characterizes effective epimorphisms in the category `Type u`, proving that a function of types is an effective epimorphism if and only if it is surjective.
The main results:
`regularEpi_iff_surjective`: A function f : `X → Y` in `Type u` is a regular epimorphism if and only if it is surjective.
`effectiveEpi_iff_surjective`: A function f : `X → Y` in `Type u` is an effective epimorphism if and only if it is surjective.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Types/Basic.lean
+ theorem CategoryTheory.isSplitEpi_iff_surjective
2025-10-02 12:29:01 cb7170f
chore(CategoryTheory/Localization/CalculusOfFractions): golf entire `symm_add` using `grind` (#30118)
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Localization/CalculusOfFractions/Preadditive.lean
2025-10-02 11:57:41 570711a
feat(Algebra/Homology): add injective dimension (#30080)
In this PR, we created `Mathlib.CategoryTheory.Abelian.Injective.Dimension` corresponding to `Mathlib.CategoryTheory.Abelian.Projective.Dimension`
This is a preliminary for Gorenstein ring.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/CategoryTheory/Abelian/Injective/Dimension.lean
+ theorem CategoryTheory.Abelian.Ext.eq_zero_of_hasInjectiveDimensionLT
+ theorem CategoryTheory.HasInjectiveDimensionLT.mk
+ theorem CategoryTheory.HasInjectiveDimensionLT.subsingleton
+ theorem CategoryTheory.Limits.IsZero.hasInjectiveDimensionLT_zero
+ theorem CategoryTheory.Retract.hasInjectiveDimensionLT
+ theorem CategoryTheory.Retract.injectiveDimension_le
+ theorem CategoryTheory.ShortComplex.ShortExact.hasInjectiveDimensionLT_X₁
+ theorem CategoryTheory.ShortComplex.ShortExact.hasInjectiveDimensionLT_X₂
+ theorem CategoryTheory.ShortComplex.ShortExact.hasInjectiveDimensionLT_X₃
+ theorem CategoryTheory.ShortComplex.ShortExact.hasInjectiveDimensionLT_X₃_iff
+ theorem CategoryTheory.hasInjectiveDimensionLT_iff
+ theorem CategoryTheory.hasInjectiveDimensionLT_of_ge
+ theorem CategoryTheory.hasInjectiveDimensionLT_of_iso
+ theorem CategoryTheory.hasInjectiveDimensionLT_zero_iff_isZero
+ theorem CategoryTheory.injectiveDimension_eq_bot_iff
+ theorem CategoryTheory.injectiveDimension_eq_of_iso
+ theorem CategoryTheory.injectiveDimension_ge_iff
+ theorem CategoryTheory.injectiveDimension_le_iff
+ theorem CategoryTheory.injectiveDimension_lt_iff
+ theorem CategoryTheory.injectiveDimension_ne_top_iff
+ theorem CategoryTheory.injective_iff_hasInjectiveDimensionLT_one
+ theorem CategoryTheory.injective_iff_subsingleton_ext_one
+ theorem CategoryTheory.isZero_of_hasInjectiveDimensionLT_zero
2025-10-02 10:12:22 1f85fdf
feat(MeasureTheory): add absolutely continuous functions (#29504)
Add absolutely continuous functions. Part of originally planned #29092.
ESTIMATED CHANGES
Modified Mathlib.lean
Added Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean
+ theorem AbsolutelyContinuousOnInterval.add
+ theorem AbsolutelyContinuousOnInterval.boundedVariationOn
+ theorem AbsolutelyContinuousOnInterval.const_mul
+ theorem AbsolutelyContinuousOnInterval.const_smul
+ theorem AbsolutelyContinuousOnInterval.continuousOn
+ def AbsolutelyContinuousOnInterval.disjWithin
+ theorem AbsolutelyContinuousOnInterval.disjWithin_comm
+ theorem AbsolutelyContinuousOnInterval.disjWithin_mono
+ theorem AbsolutelyContinuousOnInterval.exists_bound
+ theorem AbsolutelyContinuousOnInterval.fun_add
+ theorem AbsolutelyContinuousOnInterval.fun_mul
+ theorem AbsolutelyContinuousOnInterval.fun_neg
+ theorem AbsolutelyContinuousOnInterval.fun_smul
+ theorem AbsolutelyContinuousOnInterval.fun_sub
+ theorem AbsolutelyContinuousOnInterval.hasBasis_totalLengthFilter
+ theorem AbsolutelyContinuousOnInterval.mono
+ theorem AbsolutelyContinuousOnInterval.mul
+ theorem AbsolutelyContinuousOnInterval.neg
+ theorem AbsolutelyContinuousOnInterval.smul
+ theorem AbsolutelyContinuousOnInterval.sub
+ theorem AbsolutelyContinuousOnInterval.symm
+ def AbsolutelyContinuousOnInterval.totalLengthFilter
+ theorem AbsolutelyContinuousOnInterval.uniformity_eq_comap_totalLengthFilter
+ theorem AbsolutelyContinuousOnInterval.uniformlyContinuousOn
+ def AbsolutelyContinuousOnInterval
+ theorem LipschitzOnWith.absolutelyContinuousOnInterval
+ theorem absolutelyContinuousOnInterval_iff
Modified Mathlib/Topology/EMetricSpace/BoundedVariation.lean
+ theorem eVariationOn.sum'
+ theorem eVariationOn.sum
2025-10-02 09:32:22 fc44d8a
feat(LinearAlgebra/Eigenspace/Minpoly): reduce typeclass assumptions (#29898)
ESTIMATED CHANGES
Modified Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean
+/- theorem Module.End.aeval_apply_of_hasEigenvector
+/- theorem Module.End.hasEigenvalue_iff_isRoot
+/- theorem Module.End.hasEigenvalue_of_isRoot
+/- theorem Module.End.isRoot_of_hasEigenvalue
+/- theorem Module.End.ker_aeval_ring_hom'_unit_polynomial
2025-10-02 09:10:16 a50a869
chore: rename PartialHomeomorph to OpenPartialHomeomorph (#29113)
This PR renames `PartialHomeomorph` to `OpenPartialHomeomorph` as discussed in [#mathlib4 > Generalizing `PartialHomeomorph`?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Generalizing.20.60PartialHomeomorph.60.3F). This is the first step towards generalizing `PartialHomeomorph` to allow arbitrary sources and targets.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Analysis/Analytic/Inverse.lean
+ theorem OpenPartialHomeomorph.hasFPowerSeriesAt_symm
- theorem PartialHomeomorph.hasFPowerSeriesAt_symm
Modified Mathlib/Analysis/Asymptotics/Defs.lean
Modified Mathlib/Analysis/Asymptotics/Lemmas.lean
+ theorem OpenPartialHomeomorph.isBigOWith_congr
+ theorem OpenPartialHomeomorph.isBigO_congr
+ theorem OpenPartialHomeomorph.isLittleO_congr
- theorem PartialHomeomorph.isBigOWith_congr
- theorem PartialHomeomorph.isBigO_congr
- theorem PartialHomeomorph.isLittleO_congr
Modified Mathlib/Analysis/Calculus/ContDiff/Operations.lean
+ theorem OpenPartialHomeomorph.contDiffAt_symm
+ theorem OpenPartialHomeomorph.contDiffAt_symm_deriv
+ theorem OpenPartialHomeomorph.contDiffOn_restrContDiff_source
+ theorem OpenPartialHomeomorph.contDiffOn_restrContDiff_target
+ def OpenPartialHomeomorph.restrContDiff
- theorem PartialHomeomorph.contDiffAt_symm
- theorem PartialHomeomorph.contDiffAt_symm_deriv
- theorem PartialHomeomorph.contDiffOn_restrContDiff_source
- theorem PartialHomeomorph.contDiffOn_restrContDiff_target
- def PartialHomeomorph.restrContDiff
Modified Mathlib/Analysis/Calculus/Deriv/Inverse.lean
+ theorem OpenPartialHomeomorph.hasDerivAt_symm
+ theorem OpenPartialHomeomorph.hasStrictDerivAt_symm
- theorem PartialHomeomorph.hasDerivAt_symm
- theorem PartialHomeomorph.hasStrictDerivAt_symm
Modified Mathlib/Analysis/Calculus/FDeriv/Analytic.lean
+ theorem OpenPartialHomeomorph.analyticAt_symm'
+ theorem OpenPartialHomeomorph.analyticAt_symm
- theorem PartialHomeomorph.analyticAt_symm'
- theorem PartialHomeomorph.analyticAt_symm
Modified Mathlib/Analysis/Calculus/FDeriv/Equiv.lean
+ theorem OpenPartialHomeomorph.hasFDerivAt_symm
+ theorem OpenPartialHomeomorph.hasStrictFDerivAt_symm
- theorem PartialHomeomorph.hasFDerivAt_symm
- theorem PartialHomeomorph.hasStrictFDerivAt_symm
Modified Mathlib/Analysis/Calculus/Implicit.lean
+ def HasStrictFDerivAt.implicitToOpenPartialHomeomorph
+ def HasStrictFDerivAt.implicitToOpenPartialHomeomorphOfComplemented
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorphOfComplemented_apply
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorphOfComplemented_apply_ker
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorphOfComplemented_fst
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorphOfComplemented_self
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorph_apply_ker
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorph_fst
+ theorem HasStrictFDerivAt.implicitToOpenPartialHomeomorph_self
- def HasStrictFDerivAt.implicitToPartialHomeomorph
- def HasStrictFDerivAt.implicitToPartialHomeomorphOfComplemented
- theorem HasStrictFDerivAt.implicitToPartialHomeomorphOfComplemented_apply
- theorem HasStrictFDerivAt.implicitToPartialHomeomorphOfComplemented_apply_ker
- theorem HasStrictFDerivAt.implicitToPartialHomeomorphOfComplemented_fst
- theorem HasStrictFDerivAt.implicitToPartialHomeomorphOfComplemented_self
- theorem HasStrictFDerivAt.implicitToPartialHomeomorph_apply_ker
- theorem HasStrictFDerivAt.implicitToPartialHomeomorph_fst
- theorem HasStrictFDerivAt.implicitToPartialHomeomorph_self
+ theorem HasStrictFDerivAt.mem_implicitToOpenPartialHomeomorphOfComplemented_source
+ theorem HasStrictFDerivAt.mem_implicitToOpenPartialHomeomorphOfComplemented_target
+ theorem HasStrictFDerivAt.mem_implicitToOpenPartialHomeomorph_source
+ theorem HasStrictFDerivAt.mem_implicitToOpenPartialHomeomorph_target
- theorem HasStrictFDerivAt.mem_implicitToPartialHomeomorphOfComplemented_source
- theorem HasStrictFDerivAt.mem_implicitToPartialHomeomorphOfComplemented_target
- theorem HasStrictFDerivAt.mem_implicitToPartialHomeomorph_source
- theorem HasStrictFDerivAt.mem_implicitToPartialHomeomorph_target
+ theorem ImplicitFunctionData.map_pt_mem_toOpenPartialHomeomorph_target
- theorem ImplicitFunctionData.map_pt_mem_toPartialHomeomorph_target
+ theorem ImplicitFunctionData.pt_mem_toOpenPartialHomeomorph_source
- theorem ImplicitFunctionData.pt_mem_toPartialHomeomorph_source
+ def ImplicitFunctionData.toOpenPartialHomeomorph
+ theorem ImplicitFunctionData.toOpenPartialHomeomorph_apply
+ theorem ImplicitFunctionData.toOpenPartialHomeomorph_coe
- def ImplicitFunctionData.toPartialHomeomorph
- theorem ImplicitFunctionData.toPartialHomeomorph_apply
- theorem ImplicitFunctionData.toPartialHomeomorph_coe
Modified Mathlib/Analysis/Calculus/InverseFunctionTheorem/ApproximatesLinearOn.lean
+ def ApproximatesLinearOn.toOpenPartialHomeomorph
+ theorem ApproximatesLinearOn.toOpenPartialHomeomorph_coe
+ theorem ApproximatesLinearOn.toOpenPartialHomeomorph_source
+ theorem ApproximatesLinearOn.toOpenPartialHomeomorph_target
- def ApproximatesLinearOn.toPartialHomeomorph
- theorem ApproximatesLinearOn.toPartialHomeomorph_coe
- theorem ApproximatesLinearOn.toPartialHomeomorph_source
- theorem ApproximatesLinearOn.toPartialHomeomorph_target
Modified Mathlib/Analysis/Calculus/InverseFunctionTheorem/ContDiff.lean
+ theorem ContDiffAt.image_mem_toOpenPartialHomeomorph_target
- theorem ContDiffAt.image_mem_toPartialHomeomorph_target
+ theorem ContDiffAt.mem_toOpenPartialHomeomorph_source
- theorem ContDiffAt.mem_toPartialHomeomorph_source
+ def ContDiffAt.toOpenPartialHomeomorph
+ theorem ContDiffAt.toOpenPartialHomeomorph_coe
- def ContDiffAt.toPartialHomeomorph
- theorem ContDiffAt.toPartialHomeomorph_coe
Modified Mathlib/Analysis/Calculus/InverseFunctionTheorem/FDeriv.lean
+ theorem HasStrictFDerivAt.image_mem_toOpenPartialHomeomorph_target
- theorem HasStrictFDerivAt.image_mem_toPartialHomeomorph_target
+ theorem HasStrictFDerivAt.mem_toOpenPartialHomeomorph_source
- theorem HasStrictFDerivAt.mem_toPartialHomeomorph_source
+ def HasStrictFDerivAt.toOpenPartialHomeomorph
+ theorem HasStrictFDerivAt.toOpenPartialHomeomorph_coe
- def HasStrictFDerivAt.toPartialHomeomorph
- theorem HasStrictFDerivAt.toPartialHomeomorph_coe
Modified Mathlib/Analysis/Complex/Tietze.lean
Modified Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean
+/- def UpperHalfPlane.ofComplex
Modified Mathlib/Analysis/InnerProductSpace/Calculus.lean
+ theorem OpenPartialHomeomorph.contDiffOn_univBall_symm
+ theorem OpenPartialHomeomorph.contDiffOn_univUnitBall_symm
+ theorem OpenPartialHomeomorph.contDiff_unitBallBall
+ theorem OpenPartialHomeomorph.contDiff_unitBallBall_symm
+ theorem OpenPartialHomeomorph.contDiff_univBall
+ theorem OpenPartialHomeomorph.contDiff_univUnitBall
- theorem PartialHomeomorph.contDiffOn_univBall_symm
- theorem PartialHomeomorph.contDiffOn_univUnitBall_symm
- theorem PartialHomeomorph.contDiff_unitBallBall
- theorem PartialHomeomorph.contDiff_unitBallBall_symm
- theorem PartialHomeomorph.contDiff_univBall
- theorem PartialHomeomorph.contDiff_univUnitBall
Modified Mathlib/Analysis/Normed/Module/Ball/Homeomorph.lean
+ theorem OpenPartialHomeomorph.ball_subset_univBall_target
+ theorem OpenPartialHomeomorph.continuousOn_univBall_symm
+ theorem OpenPartialHomeomorph.continuous_univBall
+ def OpenPartialHomeomorph.unitBallBall
+ def OpenPartialHomeomorph.univBall
+ theorem OpenPartialHomeomorph.univBall_apply_zero
+ theorem OpenPartialHomeomorph.univBall_source
+ theorem OpenPartialHomeomorph.univBall_symm_apply_center
+ theorem OpenPartialHomeomorph.univBall_target
+ def OpenPartialHomeomorph.univUnitBall
+ theorem OpenPartialHomeomorph.univUnitBall_apply_zero
+ theorem OpenPartialHomeomorph.univUnitBall_symm_apply_zero
- theorem PartialHomeomorph.ball_subset_univBall_target
- theorem PartialHomeomorph.continuousOn_univBall_symm
- theorem PartialHomeomorph.continuous_univBall
- def PartialHomeomorph.unitBallBall
- def PartialHomeomorph.univBall
- theorem PartialHomeomorph.univBall_apply_zero
- theorem PartialHomeomorph.univBall_source
- theorem PartialHomeomorph.univBall_symm_apply_center
- theorem PartialHomeomorph.univBall_target
- def PartialHomeomorph.univUnitBall
- theorem PartialHomeomorph.univUnitBall_apply_zero
- theorem PartialHomeomorph.univUnitBall_symm_apply_zero
Modified Mathlib/Analysis/SpecialFunctions/Arsinh.lean
Modified Mathlib/Analysis/SpecialFunctions/Complex/LogDeriv.lean
Modified Mathlib/Analysis/SpecialFunctions/Log/Basic.lean
Modified Mathlib/Analysis/SpecialFunctions/PolarCoord.lean
+/- def polarCoord
Modified Mathlib/Analysis/SpecialFunctions/Sqrt.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean
+/- def Real.tanPartialHomeomorph
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean
+/- def Real.sinPartialHomeomorph
Modified Mathlib/Deprecated/AnalyticManifold.lean
+/- theorem mem_analyticGroupoid
+/- theorem mem_analyticGroupoid_of_boundaryless
+/- theorem symm_trans_mem_analyticGroupoid
Modified Mathlib/Geometry/Manifold/ChartedSpace.lean
+ def OpenPartialHomeomorph.singletonChartedSpace
+ theorem OpenPartialHomeomorph.singletonChartedSpace_chartAt_eq
+ theorem OpenPartialHomeomorph.singletonChartedSpace_chartAt_source
+ theorem OpenPartialHomeomorph.singletonChartedSpace_mem_atlas_eq
+ theorem OpenPartialHomeomorph.singleton_hasGroupoid
+ def OpenPartialHomeomorph.toStructomorph
- def PartialHomeomorph.singletonChartedSpace
- theorem PartialHomeomorph.singletonChartedSpace_chartAt_eq
- theorem PartialHomeomorph.singletonChartedSpace_chartAt_source
- theorem PartialHomeomorph.singletonChartedSpace_mem_atlas_eq
- theorem PartialHomeomorph.singleton_hasGroupoid
- def PartialHomeomorph.toStructomorph
+/- theorem StructureGroupoid.compatible_of_mem_maximalAtlas
+/- theorem StructureGroupoid.id_mem
+/- theorem StructureGroupoid.id_mem_maximalAtlas
+/- theorem StructureGroupoid.locality
+/- def StructureGroupoid.maximalAtlas
+/- theorem StructureGroupoid.mem_maximalAtlas_of_eqOnSource
+/- theorem StructureGroupoid.mem_maximalAtlas_of_mem_groupoid
+/- theorem StructureGroupoid.mem_of_eqOnSource
+/- theorem StructureGroupoid.subtypeRestr_mem_maximalAtlas
+/- theorem StructureGroupoid.symm
+/- theorem StructureGroupoid.trans
+/- theorem StructureGroupoid.trans_restricted
+/- theorem TopologicalSpace.Opens.chart_eq'
+/- theorem TopologicalSpace.Opens.chart_eq
+/- theorem chartedSpaceSelf_atlas
+/- theorem coe_achart
+/- theorem hasGroupoid_of_pregroupoid
+/- theorem mem_groupoid_of_pregroupoid
+/- theorem mem_maximalAtlas_iff
+/- theorem mem_pregroupoid_of_eqOnSource
Modified Mathlib/Geometry/Manifold/ConformalGroupoid.lean
Modified Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean
+/- theorem contMDiffOn_of_mem_contDiffGroupoid
+/- theorem isLocalStructomorphOn_contDiffGroupoid_iff
+/- theorem isLocalStructomorphOn_contDiffGroupoid_iff_aux
Modified Mathlib/Geometry/Manifold/ContMDiff/Basic.lean
Modified Mathlib/Geometry/Manifold/ContMDiff/Defs.lean
Modified Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean
Modified Mathlib/Geometry/Manifold/Diffeomorph.lean
+ theorem Diffeomorph.toOpenPartialHomeomorph_mdifferentiable
- theorem Diffeomorph.toPartialHomeomorph_mdifferentiable
Modified Mathlib/Geometry/Manifold/Instances/Icc.lean
Modified Mathlib/Geometry/Manifold/Instances/Real.lean
Modified Mathlib/Geometry/Manifold/Instances/Sphere.lean
+/- def stereographic
Modified Mathlib/Geometry/Manifold/IsManifold/Basic.lean
+/- theorem ContDiffGroupoid.mem_of_source_eq_empty
+/- theorem ContinuousGroupoid.mem_of_source_eq_empty
+/- theorem IsManifold.compatible_of_mem_maximalAtlas
+/- theorem ModelWithCorners.uniqueDiffOn_preimage_source
+ theorem OpenPartialHomeomorph.isManifold_singleton
- theorem PartialHomeomorph.isManifold_singleton
+/- theorem symm_trans_mem_contDiffGroupoid
Modified Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean
+ theorem OpenPartialHomeomorph.contDiffOn_extend_coord_change
+ theorem OpenPartialHomeomorph.contDiffWithinAt_extend_coord_change'
+ theorem OpenPartialHomeomorph.contDiffWithinAt_extend_coord_change
+ theorem OpenPartialHomeomorph.continuousAt_extend
+ theorem OpenPartialHomeomorph.continuousAt_extend_symm'
+ theorem OpenPartialHomeomorph.continuousAt_extend_symm
+ theorem OpenPartialHomeomorph.continuousOn_extend
+ theorem OpenPartialHomeomorph.continuousOn_extend_symm
+ theorem OpenPartialHomeomorph.continuousOn_writtenInExtend_iff
+ theorem OpenPartialHomeomorph.continuousWithinAt_writtenInExtend_iff
+ def OpenPartialHomeomorph.extend
+ theorem OpenPartialHomeomorph.extend_coe
+ theorem OpenPartialHomeomorph.extend_coe_symm
+ theorem OpenPartialHomeomorph.extend_coord_change_source
+ theorem OpenPartialHomeomorph.extend_coord_change_source_mem_nhdsWithin'
+ theorem OpenPartialHomeomorph.extend_coord_change_source_mem_nhdsWithin
+ theorem OpenPartialHomeomorph.extend_image_nhds_mem_nhds_of_boundaryless
+ theorem OpenPartialHomeomorph.extend_image_nhds_mem_nhds_of_mem_interior_range
+ theorem OpenPartialHomeomorph.extend_image_source_inter
+ theorem OpenPartialHomeomorph.extend_image_target_mem_nhds
+ theorem OpenPartialHomeomorph.extend_left_inv'
+ theorem OpenPartialHomeomorph.extend_left_inv
+ theorem OpenPartialHomeomorph.extend_preimage_inter_eq
+ theorem OpenPartialHomeomorph.extend_preimage_mem_nhds
+ theorem OpenPartialHomeomorph.extend_preimage_mem_nhdsWithin
+ theorem OpenPartialHomeomorph.extend_preimage_mem_nhds_of_mem_nhdsWithin
+ theorem OpenPartialHomeomorph.extend_source
+ theorem OpenPartialHomeomorph.extend_source_mem_nhds
+ theorem OpenPartialHomeomorph.extend_source_mem_nhdsWithin
+ theorem OpenPartialHomeomorph.extend_symm_continuousWithinAt_comp_right_iff
+ theorem OpenPartialHomeomorph.extend_symm_preimage_inter_range_eventuallyEq
+ theorem OpenPartialHomeomorph.extend_symm_preimage_inter_range_eventuallyEq_aux
+ theorem OpenPartialHomeomorph.extend_target'
+ theorem OpenPartialHomeomorph.extend_target
+ theorem OpenPartialHomeomorph.extend_target_eventuallyEq
+ theorem OpenPartialHomeomorph.extend_target_mem_nhdsWithin
+ theorem OpenPartialHomeomorph.extend_target_subset_range
+ theorem OpenPartialHomeomorph.interior_extend_target_subset_interior_range
+ theorem OpenPartialHomeomorph.isOpen_extend_preimage'
+ theorem OpenPartialHomeomorph.isOpen_extend_preimage
+ theorem OpenPartialHomeomorph.isOpen_extend_source
+ theorem OpenPartialHomeomorph.isOpen_extend_target
+ theorem OpenPartialHomeomorph.map_extend_nhds
+ theorem OpenPartialHomeomorph.map_extend_nhdsWithin
+ theorem OpenPartialHomeomorph.map_extend_nhdsWithin_eq_image
+ theorem OpenPartialHomeomorph.map_extend_nhdsWithin_eq_image_of_subset
+ theorem OpenPartialHomeomorph.map_extend_nhds_of_boundaryless
+ theorem OpenPartialHomeomorph.map_extend_nhds_of_mem_interior_range
+ theorem OpenPartialHomeomorph.map_extend_symm_nhdsWithin
+ theorem OpenPartialHomeomorph.map_extend_symm_nhdsWithin_range
+ theorem OpenPartialHomeomorph.mapsTo_extend
+ theorem OpenPartialHomeomorph.mem_interior_extend_target
+ theorem OpenPartialHomeomorph.nhdsWithin_extend_target_eq
+ theorem OpenPartialHomeomorph.tendsto_extend_comp_iff
- theorem PartialHomeomorph.contDiffOn_extend_coord_change
- theorem PartialHomeomorph.contDiffWithinAt_extend_coord_change'
- theorem PartialHomeomorph.contDiffWithinAt_extend_coord_change
- theorem PartialHomeomorph.continuousAt_extend
- theorem PartialHomeomorph.continuousAt_extend_symm'
- theorem PartialHomeomorph.continuousAt_extend_symm
- theorem PartialHomeomorph.continuousOn_extend
- theorem PartialHomeomorph.continuousOn_extend_symm
- theorem PartialHomeomorph.continuousOn_writtenInExtend_iff
- theorem PartialHomeomorph.continuousWithinAt_writtenInExtend_iff
- def PartialHomeomorph.extend
- theorem PartialHomeomorph.extend_coe
- theorem PartialHomeomorph.extend_coe_symm
- theorem PartialHomeomorph.extend_coord_change_source
- theorem PartialHomeomorph.extend_coord_change_source_mem_nhdsWithin'
- theorem PartialHomeomorph.extend_coord_change_source_mem_nhdsWithin
- theorem PartialHomeomorph.extend_image_nhds_mem_nhds_of_boundaryless
- theorem PartialHomeomorph.extend_image_nhds_mem_nhds_of_mem_interior_range
- theorem PartialHomeomorph.extend_image_source_inter
- theorem PartialHomeomorph.extend_image_target_mem_nhds
- theorem PartialHomeomorph.extend_left_inv'
- theorem PartialHomeomorph.extend_left_inv
- theorem PartialHomeomorph.extend_preimage_inter_eq
- theorem PartialHomeomorph.extend_preimage_mem_nhds
- theorem PartialHomeomorph.extend_preimage_mem_nhdsWithin
- theorem PartialHomeomorph.extend_preimage_mem_nhds_of_mem_nhdsWithin
- theorem PartialHomeomorph.extend_source
- theorem PartialHomeomorph.extend_source_mem_nhds
- theorem PartialHomeomorph.extend_source_mem_nhdsWithin
- theorem PartialHomeomorph.extend_symm_continuousWithinAt_comp_right_iff
- theorem PartialHomeomorph.extend_symm_preimage_inter_range_eventuallyEq
- theorem PartialHomeomorph.extend_symm_preimage_inter_range_eventuallyEq_aux
- theorem PartialHomeomorph.extend_target'
- theorem PartialHomeomorph.extend_target
- theorem PartialHomeomorph.extend_target_eventuallyEq
- theorem PartialHomeomorph.extend_target_mem_nhdsWithin
- theorem PartialHomeomorph.extend_target_subset_range
- theorem PartialHomeomorph.interior_extend_target_subset_interior_range
- theorem PartialHomeomorph.isOpen_extend_preimage'
- theorem PartialHomeomorph.isOpen_extend_preimage
- theorem PartialHomeomorph.isOpen_extend_source
- theorem PartialHomeomorph.isOpen_extend_target
- theorem PartialHomeomorph.map_extend_nhds
- theorem PartialHomeomorph.map_extend_nhdsWithin
- theorem PartialHomeomorph.map_extend_nhdsWithin_eq_image
- theorem PartialHomeomorph.map_extend_nhdsWithin_eq_image_of_subset
- theorem PartialHomeomorph.map_extend_nhds_of_boundaryless
- theorem PartialHomeomorph.map_extend_nhds_of_mem_interior_range
- theorem PartialHomeomorph.map_extend_symm_nhdsWithin
- theorem PartialHomeomorph.map_extend_symm_nhdsWithin_range
- theorem PartialHomeomorph.mapsTo_extend
- theorem PartialHomeomorph.mem_interior_extend_target
- theorem PartialHomeomorph.nhdsWithin_extend_target_eq
- theorem PartialHomeomorph.tendsto_extend_comp_iff
Modified Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean
Modified Mathlib/Geometry/Manifold/LocalDiffeomorph.lean
+ def PartialDiffeomorph.toOpenPartialHomeomorph
- def PartialDiffeomorph.toPartialHomeomorph
Modified Mathlib/Geometry/Manifold/LocalInvariantProperties.lean
+ theorem OpenPartialHomeomorph.isLocalStructomorphWithinAt_iff'
+ theorem OpenPartialHomeomorph.isLocalStructomorphWithinAt_iff
+ theorem OpenPartialHomeomorph.isLocalStructomorphWithinAt_source_iff
- theorem PartialHomeomorph.isLocalStructomorphWithinAt_iff'
- theorem PartialHomeomorph.isLocalStructomorphWithinAt_iff
- theorem PartialHomeomorph.isLocalStructomorphWithinAt_source_iff
+/- theorem StructureGroupoid.LocalInvariantProp.left_invariance
+/- theorem StructureGroupoid.LocalInvariantProp.liftPropWithinAt_indep_chart_target_aux
+/- theorem StructureGroupoid.LocalInvariantProp.right_invariance
Modified Mathlib/Geometry/Manifold/MFDeriv/Atlas.lean
+ theorem OpenPartialHomeomorph.MDifferentiable.comp_symm_deriv
+ theorem OpenPartialHomeomorph.MDifferentiable.ker_mfderiv_eq_bot
+ theorem OpenPartialHomeomorph.MDifferentiable.mdifferentiableAt_symm
+ theorem OpenPartialHomeomorph.MDifferentiable.mfderiv_bijective
+ theorem OpenPartialHomeomorph.MDifferentiable.mfderiv_injective
+ theorem OpenPartialHomeomorph.MDifferentiable.mfderiv_surjective
+ theorem OpenPartialHomeomorph.MDifferentiable.range_mfderiv_eq_top
+ theorem OpenPartialHomeomorph.MDifferentiable.range_mfderiv_eq_univ
+ theorem OpenPartialHomeomorph.MDifferentiable.symm_comp_deriv
+ theorem OpenPartialHomeomorph.MDifferentiable.trans
- theorem PartialHomeomorph.MDifferentiable.comp_symm_deriv
- theorem PartialHomeomorph.MDifferentiable.ker_mfderiv_eq_bot
- theorem PartialHomeomorph.MDifferentiable.mdifferentiableAt_symm
- theorem PartialHomeomorph.MDifferentiable.mfderiv_bijective
- theorem PartialHomeomorph.MDifferentiable.mfderiv_injective
- theorem PartialHomeomorph.MDifferentiable.mfderiv_surjective
- theorem PartialHomeomorph.MDifferentiable.range_mfderiv_eq_top
- theorem PartialHomeomorph.MDifferentiable.range_mfderiv_eq_univ
- theorem PartialHomeomorph.MDifferentiable.symm_comp_deriv
- theorem PartialHomeomorph.MDifferentiable.trans
Modified Mathlib/Geometry/Manifold/MFDeriv/Basic.lean
Modified Mathlib/Geometry/Manifold/MFDeriv/Defs.lean
+ def OpenPartialHomeomorph.MDifferentiable
- def PartialHomeomorph.MDifferentiable
Modified Mathlib/Geometry/Manifold/MFDeriv/Tangent.lean
Modified Mathlib/Geometry/Manifold/MFDeriv/UniqueDifferential.lean
+/- theorem UniqueMDiffOn.uniqueMDiffOn_preimage
Modified Mathlib/Geometry/Manifold/PartitionOfUnity.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/Basic.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/FiberwiseLinear.lean
+ def FiberwiseLinear.openPartialHomeomorph
- def FiberwiseLinear.partialHomeomorph
+ theorem FiberwiseLinear.source_trans_openPartialHomeomorph
- theorem FiberwiseLinear.source_trans_partialHomeomorph
+ theorem FiberwiseLinear.target_trans_openPartialHomeomorph
- theorem FiberwiseLinear.target_trans_partialHomeomorph
+ theorem FiberwiseLinear.trans_openPartialHomeomorph_apply
- theorem FiberwiseLinear.trans_partialHomeomorph_apply
+/- theorem mem_contMDiffFiberwiseLinear_iff
Modified Mathlib/Geometry/Manifold/VectorBundle/Hom.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean
Modified Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean
Modified Mathlib/Logic/Equiv/PartialEquiv.lean
Modified Mathlib/MeasureTheory/Function/Jacobian.lean
+/- theorem MeasureTheory.integral_target_eq_integral_abs_det_fderiv_smul
Modified Mathlib/NumberTheory/ModularForms/EisensteinSeries/UniformConvergence.lean
Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean
+/- def NumberField.mixedEmbedding.fundamentalCone.expMap
+/- def NumberField.mixedEmbedding.fundamentalCone.expMapBasis
+/- def NumberField.mixedEmbedding.fundamentalCone.expMap_single
Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/PolarCoord.lean
+/- def NumberField.mixedEmbedding.polarCoordReal
+/- def NumberField.mixedEmbedding.polarSpaceCoord
Modified Mathlib/Topology/Covering.lean
Modified Mathlib/Topology/FiberBundle/Basic.lean
+/- def FiberBundleCore.trivChange
Modified Mathlib/Topology/FiberBundle/Constructions.lean
+ theorem Bundle.Trivial.toOpenPartialHomeomorph_trivialization_symm_apply
- theorem Bundle.Trivial.toPartialHomeomorph_trivialization_symm_apply
Modified Mathlib/Topology/FiberBundle/Trivialization.lean
+/- theorem Trivialization.apply_symm_apply
+/- theorem Trivialization.coe_coe
+/- theorem Trivialization.coe_mk
+/- theorem Trivialization.ext'
+/- theorem Trivialization.map_target
+/- theorem Trivialization.symm_apply_mk_proj
+/- structure Trivialization
Modified Mathlib/Topology/Instances/AddCircle/Defs.lean
+ def AddCircle.openPartialHomeomorphCoe
- def AddCircle.partialHomeomorphCoe
Modified Mathlib/Topology/IsLocalHomeomorph.lean
+/- theorem IsLocalHomeomorph.mk
+ theorem IsLocalHomeomorphOn.OpenPartialHomeomorph.isLocalHomeomorphOn
- theorem IsLocalHomeomorphOn.PartialHomeomorph.isLocalHomeomorphOn
+/- theorem IsLocalHomeomorphOn.mk
Renamed Mathlib/Topology/PartialHomeomorph.lean to Mathlib/Topology/OpenPartialHomeomorph.lean
+ theorem Homeomorph.refl_toOpenPartialHomeomorph
- theorem Homeomorph.refl_toPartialHomeomorph
+ theorem Homeomorph.symm_toOpenPartialHomeomorph
- theorem Homeomorph.symm_toPartialHomeomorph
+ def Homeomorph.toOpenPartialHomeomorph
+ def Homeomorph.toOpenPartialHomeomorphOfImageEq
- def Homeomorph.toPartialHomeomorph
- def Homeomorph.toPartialHomeomorphOfImageEq
+ def Homeomorph.transOpenPartialHomeomorph
+ theorem Homeomorph.transOpenPartialHomeomorph_eq_trans
+ theorem Homeomorph.transOpenPartialHomeomorph_trans
- def Homeomorph.transPartialHomeomorph
- theorem Homeomorph.transPartialHomeomorph_eq_trans
- theorem Homeomorph.transPartialHomeomorph_trans
+ theorem Homeomorph.trans_toOpenPartialHomeomorph
- theorem Homeomorph.trans_toPartialHomeomorph
+ theorem Homeomorph.trans_transOpenPartialHomeomorph
- theorem Homeomorph.trans_transPartialHomeomorph
+ theorem OpenPartialHomeomorph.EqOnSource.eqOn
+ theorem OpenPartialHomeomorph.EqOnSource.restr
+ theorem OpenPartialHomeomorph.EqOnSource.source_eq
+ theorem OpenPartialHomeomorph.EqOnSource.symm'
+ theorem OpenPartialHomeomorph.EqOnSource.symm_eqOn_target
+ theorem OpenPartialHomeomorph.EqOnSource.target_eq
+ theorem OpenPartialHomeomorph.EqOnSource.trans'
+ def OpenPartialHomeomorph.EqOnSource
+ theorem OpenPartialHomeomorph.IsImage.apply_mem_iff
+ theorem OpenPartialHomeomorph.IsImage.iff_preimage_eq'
+ theorem OpenPartialHomeomorph.IsImage.iff_preimage_eq
+ theorem OpenPartialHomeomorph.IsImage.iff_symm_preimage_eq'
+ theorem OpenPartialHomeomorph.IsImage.iff_symm_preimage_eq
+ theorem OpenPartialHomeomorph.IsImage.image_eq
+ theorem OpenPartialHomeomorph.IsImage.inter_eq_of_inter_eq_of_eqOn
+ theorem OpenPartialHomeomorph.IsImage.isOpen_iff
+ theorem OpenPartialHomeomorph.IsImage.leftInvOn_piecewise
+ theorem OpenPartialHomeomorph.IsImage.map_nhdsWithin_eq
+ theorem OpenPartialHomeomorph.IsImage.of_image_eq
+ theorem OpenPartialHomeomorph.IsImage.of_symm_image_eq
+ def OpenPartialHomeomorph.IsImage.restr
+ theorem OpenPartialHomeomorph.IsImage.symm_apply_mem_iff
+ theorem OpenPartialHomeomorph.IsImage.symm_eqOn_of_inter_eq_of_eqOn
+ theorem OpenPartialHomeomorph.IsImage.symm_iff
+ theorem OpenPartialHomeomorph.IsImage.symm_image_eq
+ theorem OpenPartialHomeomorph.IsImage.symm_mapsTo
+ theorem OpenPartialHomeomorph.IsImage.toPartialEquiv
+ def OpenPartialHomeomorph.IsImage
+ theorem OpenPartialHomeomorph.Set.EqOn.restr_eqOn_source
+ def OpenPartialHomeomorph.Simps.apply
+ def OpenPartialHomeomorph.Simps.symm_apply
+ theorem OpenPartialHomeomorph.coe_coe
+ theorem OpenPartialHomeomorph.coe_coe_symm
+ theorem OpenPartialHomeomorph.coe_trans
+ theorem OpenPartialHomeomorph.coe_trans_symm
+ def OpenPartialHomeomorph.const
+ theorem OpenPartialHomeomorph.const_apply
+ theorem OpenPartialHomeomorph.const_source
+ theorem OpenPartialHomeomorph.const_target
+ theorem OpenPartialHomeomorph.continuousAt_iff_continuousAt_comp_left
+ theorem OpenPartialHomeomorph.continuousAt_iff_continuousAt_comp_right
+ theorem OpenPartialHomeomorph.continuousAt_symm
+ theorem OpenPartialHomeomorph.continuousOn_iff_continuousOn_comp_left
+ theorem OpenPartialHomeomorph.continuousOn_iff_continuousOn_comp_right
+ theorem OpenPartialHomeomorph.continuousOn_symm
+ theorem OpenPartialHomeomorph.continuousWithinAt_iff_continuousWithinAt_comp_left
+ theorem OpenPartialHomeomorph.continuousWithinAt_iff_continuousWithinAt_comp_right
+ theorem OpenPartialHomeomorph.continuous_iff_continuous_comp_left
+ def OpenPartialHomeomorph.disjointUnion
+ theorem OpenPartialHomeomorph.eqOnSource_iff
+ theorem OpenPartialHomeomorph.eqOnSource_refl
+ theorem OpenPartialHomeomorph.eq_of_eqOnSource_univ
+ theorem OpenPartialHomeomorph.eq_symm_apply
+ theorem OpenPartialHomeomorph.eventually_left_inverse'
+ theorem OpenPartialHomeomorph.eventually_left_inverse
+ theorem OpenPartialHomeomorph.eventually_ne_nhdsWithin
+ theorem OpenPartialHomeomorph.eventually_nhds'
+ theorem OpenPartialHomeomorph.eventually_nhds
+ theorem OpenPartialHomeomorph.eventually_nhdsWithin'
+ theorem OpenPartialHomeomorph.eventually_nhdsWithin
+ theorem OpenPartialHomeomorph.eventually_right_inverse'
+ theorem OpenPartialHomeomorph.eventually_right_inverse
+ def OpenPartialHomeomorph.homeomorphOfImageSubsetSource
+ theorem OpenPartialHomeomorph.image_eq_target_inter_inv_preimage
+ theorem OpenPartialHomeomorph.image_mem_nhds
+ theorem OpenPartialHomeomorph.image_source_eq_target
+ theorem OpenPartialHomeomorph.image_source_inter_eq'
+ theorem OpenPartialHomeomorph.image_source_inter_eq
+ theorem OpenPartialHomeomorph.image_trans_source
+ theorem OpenPartialHomeomorph.invFun_eq_coe
+ theorem OpenPartialHomeomorph.inv_image_trans_target
+ theorem OpenPartialHomeomorph.isImage_source_target
+ theorem OpenPartialHomeomorph.isImage_source_target_of_disjoint
+ theorem OpenPartialHomeomorph.isOpenEmbedding_restrict
+ theorem OpenPartialHomeomorph.isOpen_image_iff_of_subset_source
+ theorem OpenPartialHomeomorph.isOpen_image_of_subset_source
+ theorem OpenPartialHomeomorph.isOpen_image_source_inter
+ theorem OpenPartialHomeomorph.isOpen_image_symm_of_subset_target
+ theorem OpenPartialHomeomorph.isOpen_inter_preimage
+ theorem OpenPartialHomeomorph.isOpen_inter_preimage_symm
+ theorem OpenPartialHomeomorph.isOpen_symm_image_iff_of_subset_target
+ theorem OpenPartialHomeomorph.left_inv
+ theorem OpenPartialHomeomorph.lift_openEmbedding_apply
+ theorem OpenPartialHomeomorph.lift_openEmbedding_source
+ theorem OpenPartialHomeomorph.lift_openEmbedding_symm
+ theorem OpenPartialHomeomorph.lift_openEmbedding_symm_source
+ theorem OpenPartialHomeomorph.lift_openEmbedding_symm_target
+ theorem OpenPartialHomeomorph.lift_openEmbedding_target
+ theorem OpenPartialHomeomorph.lift_openEmbedding_toFun
+ theorem OpenPartialHomeomorph.lift_openEmbedding_trans
+ theorem OpenPartialHomeomorph.lift_openEmbedding_trans_apply
+ theorem OpenPartialHomeomorph.map_nhdsWithin_eq
+ theorem OpenPartialHomeomorph.map_nhdsWithin_preimage_eq
+ theorem OpenPartialHomeomorph.map_nhds_eq
+ theorem OpenPartialHomeomorph.map_source''
+ theorem OpenPartialHomeomorph.map_source
+ theorem OpenPartialHomeomorph.map_subtype_source
+ theorem OpenPartialHomeomorph.map_target
+ theorem OpenPartialHomeomorph.mk_coe
+ theorem OpenPartialHomeomorph.mk_coe_symm
+ theorem OpenPartialHomeomorph.nhdsWithin_source_inter
+ theorem OpenPartialHomeomorph.nhdsWithin_target_inter
+ theorem OpenPartialHomeomorph.nhds_eq_comap_inf_principal
+ def OpenPartialHomeomorph.ofContinuousOpen
+ def OpenPartialHomeomorph.ofContinuousOpenRestrict
+ def OpenPartialHomeomorph.ofSet
+ theorem OpenPartialHomeomorph.ofSet_symm
+ theorem OpenPartialHomeomorph.ofSet_toPartialEquiv
+ theorem OpenPartialHomeomorph.ofSet_trans'
+ theorem OpenPartialHomeomorph.ofSet_trans
+ theorem OpenPartialHomeomorph.ofSet_trans_ofSet
+ theorem OpenPartialHomeomorph.ofSet_univ_eq_refl
+ def OpenPartialHomeomorph.pi
+ def OpenPartialHomeomorph.piecewise
+ theorem OpenPartialHomeomorph.preimage_closure
+ theorem OpenPartialHomeomorph.preimage_eventuallyEq_target_inter_preimage_inter
+ theorem OpenPartialHomeomorph.preimage_frontier
+ theorem OpenPartialHomeomorph.preimage_interior
+ def OpenPartialHomeomorph.prod
+ theorem OpenPartialHomeomorph.prod_eq_prod_of_nonempty'
+ theorem OpenPartialHomeomorph.prod_eq_prod_of_nonempty
+ theorem OpenPartialHomeomorph.prod_symm
+ theorem OpenPartialHomeomorph.prod_trans
+ theorem OpenPartialHomeomorph.refl_partialEquiv
+ theorem OpenPartialHomeomorph.refl_prod_refl
+ theorem OpenPartialHomeomorph.refl_symm
+ theorem OpenPartialHomeomorph.refl_trans
+ def OpenPartialHomeomorph.replaceEquiv
+ theorem OpenPartialHomeomorph.replaceEquiv_eq_self
+ theorem OpenPartialHomeomorph.restrOpen_source
+ theorem OpenPartialHomeomorph.restrOpen_toPartialEquiv
+ theorem OpenPartialHomeomorph.restr_eqOnSource_restr
+ theorem OpenPartialHomeomorph.restr_eq_of_source_subset
+ theorem OpenPartialHomeomorph.restr_inter_source
+ theorem OpenPartialHomeomorph.restr_source'
+ theorem OpenPartialHomeomorph.restr_source_inter
+ theorem OpenPartialHomeomorph.restr_symm_trans
+ theorem OpenPartialHomeomorph.restr_toPartialEquiv'
+ theorem OpenPartialHomeomorph.restr_toPartialEquiv
+ theorem OpenPartialHomeomorph.restr_trans
+ theorem OpenPartialHomeomorph.restr_univ
+ theorem OpenPartialHomeomorph.right_inv
+ theorem OpenPartialHomeomorph.secondCountableTopology_source
+ theorem OpenPartialHomeomorph.self_trans_symm
+ theorem OpenPartialHomeomorph.source_inter_preimage_inv_preimage
+ theorem OpenPartialHomeomorph.source_inter_preimage_target_inter
+ theorem OpenPartialHomeomorph.source_preimage_target
+ theorem OpenPartialHomeomorph.subtypeRestr_coe
+ theorem OpenPartialHomeomorph.subtypeRestr_def
+ theorem OpenPartialHomeomorph.subtypeRestr_source
+ theorem OpenPartialHomeomorph.subtypeRestr_symm_eqOn
+ theorem OpenPartialHomeomorph.subtypeRestr_symm_eqOn_of_le
+ theorem OpenPartialHomeomorph.subtypeRestr_symm_trans_subtypeRestr
+ theorem OpenPartialHomeomorph.symm_bijective
+ theorem OpenPartialHomeomorph.symm_image_eq_source_inter_preimage
+ theorem OpenPartialHomeomorph.symm_image_target_eq_source
+ theorem OpenPartialHomeomorph.symm_image_target_inter_eq
+ theorem OpenPartialHomeomorph.symm_map_nhds_eq
+ theorem OpenPartialHomeomorph.symm_piecewise
+ theorem OpenPartialHomeomorph.symm_source
+ theorem OpenPartialHomeomorph.symm_symm
+ theorem OpenPartialHomeomorph.symm_target
+ theorem OpenPartialHomeomorph.symm_toPartialEquiv
+ theorem OpenPartialHomeomorph.symm_trans_restr
+ theorem OpenPartialHomeomorph.symm_trans_self
+ theorem OpenPartialHomeomorph.target_inter_inv_preimage_preimage
+ theorem OpenPartialHomeomorph.tendsto_symm
+ def OpenPartialHomeomorph.toFun'
+ theorem OpenPartialHomeomorph.toFun_eq_coe
+ def OpenPartialHomeomorph.toHomeomorphOfSourceEqUnivTargetEqUniv
+ def OpenPartialHomeomorph.toHomeomorphSourceTarget
+ theorem OpenPartialHomeomorph.toPartialEquiv_injective
+ theorem OpenPartialHomeomorph.to_isOpenEmbedding
+ def OpenPartialHomeomorph.transHomeomorph
+ theorem OpenPartialHomeomorph.transHomeomorph_eq_trans
+ theorem OpenPartialHomeomorph.transHomeomorph_transHomeomorph
+ theorem OpenPartialHomeomorph.trans_apply
+ theorem OpenPartialHomeomorph.trans_assoc
+ theorem OpenPartialHomeomorph.trans_ofSet
+ theorem OpenPartialHomeomorph.trans_of_set'
+ theorem OpenPartialHomeomorph.trans_refl
+ theorem OpenPartialHomeomorph.trans_source''
+ theorem OpenPartialHomeomorph.trans_source'
+ theorem OpenPartialHomeomorph.trans_source
+ theorem OpenPartialHomeomorph.trans_symm_eq_symm_trans_symm
+ theorem OpenPartialHomeomorph.trans_target''
+ theorem OpenPartialHomeomorph.trans_target'
+ theorem OpenPartialHomeomorph.trans_target
+ theorem OpenPartialHomeomorph.trans_toPartialEquiv
+ theorem OpenPartialHomeomorph.trans_transHomeomorph
+ structure OpenPartialHomeomorph
- theorem PartialHomeomorph.EqOnSource.eqOn
- theorem PartialHomeomorph.EqOnSource.restr
- theorem PartialHomeomorph.EqOnSource.source_eq
- theorem PartialHomeomorph.EqOnSource.symm'
- theorem PartialHomeomorph.EqOnSource.symm_eqOn_target
- theorem PartialHomeomorph.EqOnSource.target_eq
- theorem PartialHomeomorph.EqOnSource.trans'
- def PartialHomeomorph.EqOnSource
- theorem PartialHomeomorph.IsImage.apply_mem_iff
- theorem PartialHomeomorph.IsImage.iff_preimage_eq'
- theorem PartialHomeomorph.IsImage.iff_preimage_eq
- theorem PartialHomeomorph.IsImage.iff_symm_preimage_eq'
- theorem PartialHomeomorph.IsImage.iff_symm_preimage_eq
- theorem PartialHomeomorph.IsImage.image_eq
- theorem PartialHomeomorph.IsImage.inter_eq_of_inter_eq_of_eqOn
- theorem PartialHomeomorph.IsImage.isOpen_iff
- theorem PartialHomeomorph.IsImage.leftInvOn_piecewise
- theorem PartialHomeomorph.IsImage.map_nhdsWithin_eq
- theorem PartialHomeomorph.IsImage.of_image_eq
- theorem PartialHomeomorph.IsImage.of_symm_image_eq
- def PartialHomeomorph.IsImage.restr
- theorem PartialHomeomorph.IsImage.symm_apply_mem_iff
- theorem PartialHomeomorph.IsImage.symm_eqOn_of_inter_eq_of_eqOn
- theorem PartialHomeomorph.IsImage.symm_iff
- theorem PartialHomeomorph.IsImage.symm_image_eq
- theorem PartialHomeomorph.IsImage.symm_mapsTo
- theorem PartialHomeomorph.IsImage.toPartialEquiv
- def PartialHomeomorph.IsImage
- theorem PartialHomeomorph.Set.EqOn.restr_eqOn_source
- def PartialHomeomorph.Simps.apply
- def PartialHomeomorph.Simps.symm_apply
- theorem PartialHomeomorph.coe_coe
- theorem PartialHomeomorph.coe_coe_symm
- theorem PartialHomeomorph.coe_trans
- theorem PartialHomeomorph.coe_trans_symm
- def PartialHomeomorph.const
- theorem PartialHomeomorph.const_apply
- theorem PartialHomeomorph.const_source
- theorem PartialHomeomorph.const_target
- theorem PartialHomeomorph.continuousAt_iff_continuousAt_comp_left
- theorem PartialHomeomorph.continuousAt_iff_continuousAt_comp_right
- theorem PartialHomeomorph.continuousAt_symm
- theorem PartialHomeomorph.continuousOn_iff_continuousOn_comp_left
- theorem PartialHomeomorph.continuousOn_iff_continuousOn_comp_right
- theorem PartialHomeomorph.continuousOn_symm
- theorem PartialHomeomorph.continuousWithinAt_iff_continuousWithinAt_comp_left
- theorem PartialHomeomorph.continuousWithinAt_iff_continuousWithinAt_comp_right
- theorem PartialHomeomorph.continuous_iff_continuous_comp_left
- def PartialHomeomorph.disjointUnion
- theorem PartialHomeomorph.eqOnSource_iff
- theorem PartialHomeomorph.eqOnSource_refl
- theorem PartialHomeomorph.eq_of_eqOnSource_univ
- theorem PartialHomeomorph.eq_symm_apply
- theorem PartialHomeomorph.eventually_left_inverse'
- theorem PartialHomeomorph.eventually_left_inverse
- theorem PartialHomeomorph.eventually_ne_nhdsWithin
- theorem PartialHomeomorph.eventually_nhds'
- theorem PartialHomeomorph.eventually_nhds
- theorem PartialHomeomorph.eventually_nhdsWithin'
- theorem PartialHomeomorph.eventually_nhdsWithin
- theorem PartialHomeomorph.eventually_right_inverse'
- theorem PartialHomeomorph.eventually_right_inverse
- def PartialHomeomorph.homeomorphOfImageSubsetSource
- theorem PartialHomeomorph.image_eq_target_inter_inv_preimage
- theorem PartialHomeomorph.image_mem_nhds
- theorem PartialHomeomorph.image_source_eq_target
- theorem PartialHomeomorph.image_source_inter_eq'
- theorem PartialHomeomorph.image_source_inter_eq
- theorem PartialHomeomorph.image_trans_source
- theorem PartialHomeomorph.invFun_eq_coe
- theorem PartialHomeomorph.inv_image_trans_target
- theorem PartialHomeomorph.isImage_source_target
- theorem PartialHomeomorph.isImage_source_target_of_disjoint
- theorem PartialHomeomorph.isOpenEmbedding_restrict
- theorem PartialHomeomorph.isOpen_image_iff_of_subset_source
- theorem PartialHomeomorph.isOpen_image_of_subset_source
- theorem PartialHomeomorph.isOpen_image_source_inter
- theorem PartialHomeomorph.isOpen_image_symm_of_subset_target
- theorem PartialHomeomorph.isOpen_inter_preimage
- theorem PartialHomeomorph.isOpen_inter_preimage_symm
- theorem PartialHomeomorph.isOpen_symm_image_iff_of_subset_target
- theorem PartialHomeomorph.left_inv
- theorem PartialHomeomorph.lift_openEmbedding_apply
- theorem PartialHomeomorph.lift_openEmbedding_source
- theorem PartialHomeomorph.lift_openEmbedding_symm
- theorem PartialHomeomorph.lift_openEmbedding_symm_source
- theorem PartialHomeomorph.lift_openEmbedding_symm_target
- theorem PartialHomeomorph.lift_openEmbedding_target
- theorem PartialHomeomorph.lift_openEmbedding_toFun
- theorem PartialHomeomorph.lift_openEmbedding_trans
- theorem PartialHomeomorph.lift_openEmbedding_trans_apply
- theorem PartialHomeomorph.map_nhdsWithin_eq
- theorem PartialHomeomorph.map_nhdsWithin_preimage_eq
- theorem PartialHomeomorph.map_nhds_eq
- theorem PartialHomeomorph.map_source''
- theorem PartialHomeomorph.map_source
- theorem PartialHomeomorph.map_subtype_source
- theorem PartialHomeomorph.map_target
- theorem PartialHomeomorph.mk_coe
- theorem PartialHomeomorph.mk_coe_symm
- theorem PartialHomeomorph.nhdsWithin_source_inter
- theorem PartialHomeomorph.nhdsWithin_target_inter
- theorem PartialHomeomorph.nhds_eq_comap_inf_principal
- def PartialHomeomorph.ofContinuousOpen
- def PartialHomeomorph.ofContinuousOpenRestrict
- def PartialHomeomorph.ofSet
- theorem PartialHomeomorph.ofSet_symm
- theorem PartialHomeomorph.ofSet_toPartialEquiv
- theorem PartialHomeomorph.ofSet_trans'
- theorem PartialHomeomorph.ofSet_trans
- theorem PartialHomeomorph.ofSet_trans_ofSet
- theorem PartialHomeomorph.ofSet_univ_eq_refl
- def PartialHomeomorph.pi
- def PartialHomeomorph.piecewise
- theorem PartialHomeomorph.preimage_closure
- theorem PartialHomeomorph.preimage_eventuallyEq_target_inter_preimage_inter
- theorem PartialHomeomorph.preimage_frontier
- theorem PartialHomeomorph.preimage_interior
- def PartialHomeomorph.prod
- theorem PartialHomeomorph.prod_eq_prod_of_nonempty'
- theorem PartialHomeomorph.prod_eq_prod_of_nonempty
- theorem PartialHomeomorph.prod_symm
- theorem PartialHomeomorph.prod_trans
- theorem PartialHomeomorph.refl_partialEquiv
- theorem PartialHomeomorph.refl_prod_refl
- theorem PartialHomeomorph.refl_symm
- theorem PartialHomeomorph.refl_trans
- def PartialHomeomorph.replaceEquiv
- theorem PartialHomeomorph.replaceEquiv_eq_self
- theorem PartialHomeomorph.restrOpen_source
- theorem PartialHomeomorph.restrOpen_toPartialEquiv
- theorem PartialHomeomorph.restr_eqOnSource_restr
- theorem PartialHomeomorph.restr_eq_of_source_subset
- theorem PartialHomeomorph.restr_inter_source
- theorem PartialHomeomorph.restr_source'
- theorem PartialHomeomorph.restr_source_inter
- theorem PartialHomeomorph.restr_symm_trans
- theorem PartialHomeomorph.restr_toPartialEquiv'
- theorem PartialHomeomorph.restr_toPartialEquiv
- theorem PartialHomeomorph.restr_trans
- theorem PartialHomeomorph.restr_univ
- theorem PartialHomeomorph.right_inv
- theorem PartialHomeomorph.secondCountableTopology_source
- theorem PartialHomeomorph.self_trans_symm
- theorem PartialHomeomorph.source_inter_preimage_inv_preimage
- theorem PartialHomeomorph.source_inter_preimage_target_inter
- theorem PartialHomeomorph.source_preimage_target
- theorem PartialHomeomorph.subtypeRestr_coe
- theorem PartialHomeomorph.subtypeRestr_def
- theorem PartialHomeomorph.subtypeRestr_source
- theorem PartialHomeomorph.subtypeRestr_symm_eqOn
- theorem PartialHomeomorph.subtypeRestr_symm_eqOn_of_le
- theorem PartialHomeomorph.subtypeRestr_symm_trans_subtypeRestr
- theorem PartialHomeomorph.symm_bijective
- theorem PartialHomeomorph.symm_image_eq_source_inter_preimage
- theorem PartialHomeomorph.symm_image_target_eq_source
- theorem PartialHomeomorph.symm_image_target_inter_eq
- theorem PartialHomeomorph.symm_map_nhds_eq
- theorem PartialHomeomorph.symm_piecewise
- theorem PartialHomeomorph.symm_source
- theorem PartialHomeomorph.symm_symm
- theorem PartialHomeomorph.symm_target
- theorem PartialHomeomorph.symm_toPartialEquiv
- theorem PartialHomeomorph.symm_trans_restr
- theorem PartialHomeomorph.symm_trans_self
- theorem PartialHomeomorph.target_inter_inv_preimage_preimage
- theorem PartialHomeomorph.tendsto_symm
- def PartialHomeomorph.toFun'
- theorem PartialHomeomorph.toFun_eq_coe
- def PartialHomeomorph.toHomeomorphOfSourceEqUnivTargetEqUniv
- def PartialHomeomorph.toHomeomorphSourceTarget
- theorem PartialHomeomorph.toPartialEquiv_injective
- theorem PartialHomeomorph.to_isOpenEmbedding
- def PartialHomeomorph.transHomeomorph
- theorem PartialHomeomorph.transHomeomorph_eq_trans
- theorem PartialHomeomorph.transHomeomorph_transHomeomorph
- theorem PartialHomeomorph.trans_apply
- theorem PartialHomeomorph.trans_assoc
- theorem PartialHomeomorph.trans_ofSet
- theorem PartialHomeomorph.trans_of_set'
- theorem PartialHomeomorph.trans_refl
- theorem PartialHomeomorph.trans_source''
- theorem PartialHomeomorph.trans_source'
- theorem PartialHomeomorph.trans_source
- theorem PartialHomeomorph.trans_symm_eq_symm_trans_symm
- theorem PartialHomeomorph.trans_target''
- theorem PartialHomeomorph.trans_target'
- theorem PartialHomeomorph.trans_target
- theorem PartialHomeomorph.trans_toPartialEquiv
- theorem PartialHomeomorph.trans_transHomeomorph
- structure PartialHomeomorph
+ theorem TopologicalSpace.Opens.openPartialHomeomorphSubtypeCoe_coe
+ theorem TopologicalSpace.Opens.openPartialHomeomorphSubtypeCoe_source
+ theorem TopologicalSpace.Opens.openPartialHomeomorphSubtypeCoe_target
- theorem TopologicalSpace.Opens.partialHomeomorphSubtypeCoe_coe
- theorem TopologicalSpace.Opens.partialHomeomorphSubtypeCoe_source
- theorem TopologicalSpace.Opens.partialHomeomorphSubtypeCoe_target
+ theorem Topology.IsOpenEmbedding.toOpenPartialHomeomorph_left_inv
+ theorem Topology.IsOpenEmbedding.toOpenPartialHomeomorph_right_inv
- theorem Topology.IsOpenEmbedding.toPartialHomeomorph_left_inv
- theorem Topology.IsOpenEmbedding.toPartialHomeomorph_right_inv
Modified Mathlib/Topology/VectorBundle/Basic.lean
+/- def VectorBundleCore.trivChange
Modified MathlibTest/MfldSetTac.lean
+ theorem OpenPartialHomeomorph.coe_coe
+ theorem OpenPartialHomeomorph.coe_coe_symm
+ theorem OpenPartialHomeomorph.left_inv
+ def OpenPartialHomeomorph.symm
+ theorem OpenPartialHomeomorph.symm_to_PartialEquiv
+ structure OpenPartialHomeomorph
- theorem PartialHomeomorph.coe_coe
- theorem PartialHomeomorph.coe_coe_symm
- theorem PartialHomeomorph.left_inv
- def PartialHomeomorph.symm
- theorem PartialHomeomorph.symm_to_PartialEquiv
- structure PartialHomeomorph
2025-10-02 08:08:40 74c7a5c
feat(Topology/Algebra/InfiniteSum/NatInt): add more pnat tsum lemmas (#27841)
ESTIMATED CHANGES
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean
Modified Mathlib/NumberTheory/TsumDivsorsAntidiagonal.lean
Modified Mathlib/Topology/Algebra/InfiniteSum/Basic.lean
+ theorem tprod_comp_neg
Modified Mathlib/Topology/Algebra/InfiniteSum/NatInt.lean
+ theorem multipliable_pnat_iff_multipliable_succ
- theorem pnat_multipliable_iff_multipliable_succ
+ theorem tprod_int_eq_zero_mul_tprod_pnat_sq
+/- theorem tprod_pnat_eq_tprod_succ
+ theorem tprod_zero_pnat_eq_tprod_nat
2025-10-02 07:53:13 8d736b5
feat: add ContMDiff.congr (#28527)
I wanted this lemma both while working on an early version of #28056 and while working on #23040: time to add it.
Besides, it fills a natural API gap.
ESTIMATED CHANGES
Modified Mathlib/Geometry/Manifold/ContMDiff/Defs.lean
+ theorem ContMDiff.congr
+ theorem contMDiff_congr
2025-10-02 05:40:18 18a54b0
chore: remove redundant `generalize`, `induction`, `repeat'` and `unfold` invocations (#29317)
ESTIMATED CHANGES
Modified Mathlib/Algebra/Order/Archimedean/Class.lean
Modified Mathlib/Data/ENNReal/Real.lean
Modified Mathlib/RingTheory/Polynomial/Opposites.lean
+/- theorem Polynomial.support_opRingEquiv
2025-10-01 22:02:13 c697341
feat(CategoryTheory/Sites): the category of `1`-hypercovers up to homotopy (#29551)
We define the category of `1`-hypercovers up to homotopy as the category of `1`-hypercovers where morphisms are considered up to existence of a homotopy. We show that this category is cofiltered if the base category has pullbacks.
This category will be used to define a second construction of sheafification by taking certain colimits of multiequalizers over this category.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Sites/Hypercover/Homotopy.lean
+ def CategoryTheory.GrothendieckTopology.OneHypercover.homotopicRel
+ theorem CategoryTheory.PreOneHypercover.Homotopy.map_eq_map
Modified Mathlib/CategoryTheory/Sites/Hypercover/One.lean
+ def CategoryTheory.GrothendieckTopology.OneHypercover.inter
+ def CategoryTheory.GrothendieckTopology.OneHypercover.isoMk
+ def CategoryTheory.GrothendieckTopology.OneHypercover.toZeroHypercover
+ def CategoryTheory.GrothendieckTopology.OneHypercover.trivial
+ def CategoryTheory.PreOneHypercover.inter
+ def CategoryTheory.PreOneHypercover.interFst
+ def CategoryTheory.PreOneHypercover.interLift
+ def CategoryTheory.PreOneHypercover.interSnd
+ theorem CategoryTheory.PreOneHypercover.sieve₀_trivial
+ theorem CategoryTheory.PreOneHypercover.sieve₁_inter
+ theorem CategoryTheory.PreOneHypercover.sieve₁_trivial
+ def CategoryTheory.PreOneHypercover.trivial
Modified Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean
+ def CategoryTheory.PreZeroHypercover.interFst
+ def CategoryTheory.PreZeroHypercover.interLift
+ def CategoryTheory.PreZeroHypercover.interSnd
2025-10-01 21:33:12 9699f52
feat: prove Gauss-Lucas theorem (#29630)
The proof was found by Aristotle AI,
then rewritten by me in Mathlib style.
ESTIMATED CHANGES
Modified Mathlib.lean
Modified Mathlib/Algebra/Polynomial/Eval/Defs.lean
+ theorem Polynomial.eval_listSum
+/- theorem Polynomial.eval_mul_X
+ theorem Polynomial.eval_multisetSum
Modified Mathlib/Algebra/Polynomial/Splits.lean
+ theorem Polynomial.aeval_derivative_of_splits
+ theorem Polynomial.eval_derivative_div_eval_of_ne_zero_of_splits
+ theorem Polynomial.eval_derivative_eq_eval_mul_sum_of_splits
+ theorem Polynomial.eval_derivative_of_splits
+ theorem Polynomial.eval₂_derivative_of_splits
Added Mathlib/Analysis/Complex/Polynomial/GaussLucas.lean
+ theorem Polynomial.derivRootWeight_nonneg
+ theorem Polynomial.eq_centerMass_of_eval_derivative_eq_zero
+ theorem Polynomial.rootSet_derivative_subset_convexHull_rootSet
+ theorem Polynomial.sum_derivRootWeight_pos
Modified docs/1000.yaml
2025-10-01 20:18:22 69ebb74
perf(Algebra/IsPrimePow): speed up decidability for Nat IsPrimePow (#30093)
Previously, this decidability instance was defined using `isPrimePow_nat_iff_bounded`, which (as I understand it) means that it undertook a search over all pairs `p, k` of numbers below `n` until it finds one where `p` is prime, and `p^k = n`, or else loops through all possibilities.
This PR creates a new theorem which instead searches over possible values of the exponent first, bounding the search at the binary logarithm of `n`, and then a further theorem which uses `n.minFac` for `p`. This massively reduces the time for large `n`.
In principle this could be made polynomial time, if we were to compute the putative prime factor for each `k` by taking the `k`th root and checking primality with AKS. But until that is implemented, this seems like a fine improvement.
ESTIMATED CHANGES
Modified Mathlib/Algebra/IsPrimePow.lean
+ theorem isPrimePow_nat_iff_bounded_log
+ theorem isPrimePow_nat_iff_bounded_log_minFac
2025-10-01 17:16:18 12fc3da
feat(CategoryTheory/Closed): variant of `cartesianClosedOfReflective` with better definitional equalities (#30017)
A variant of `cartesianClosedOfReflective` that allows for better control over the resulting exponentials. The main application of this is that exponentials of sheaves are now computed as exponentials of presheaves up to definitional equality.
ESTIMATED CHANGES
Modified Mathlib/CategoryTheory/Closed/Ideal.lean
+ def CategoryTheory.cartesianClosedOfReflective'
+/- def CategoryTheory.cartesianClosedOfReflective
Modified Mathlib/CategoryTheory/Sites/CartesianClosed.lean
2025-10-01 15:29:52 3cf5388
feat(AbsoluteValue/Equivalence): two absolute values `v` and `w` are equivalent if and only if `WithAbs v` and `WithAbs w` are homeomorphic (#29966)
ESTIMATED CHANGES
Modified Mathlib/Analysis/AbsoluteValue/Equivalence.lean
+ theorem AbsoluteValue.IsEquiv.equivWithAbs_image_mem_nhds_zero
+ theorem AbsoluteValue.IsEquiv.isEmbedding_equivWithAbs
+ theorem AbsoluteValue.isEquiv_iff_isHomeomorph
Modified Mathlib/Analysis/Normed/Ring/WithAbs.lean
+ def WithAbs.equivWithAbs
+ theorem WithAbs.equivWithAbs_equiv_symm_apply
+ theorem WithAbs.equivWithAbs_symm
+ theorem WithAbs.equivWithAbs_symm_equiv_symm_apply
+ theorem WithAbs.equiv_equivWithAbs_symm_apply
2025-10-01 13:25:46 2c3f8ca
chore: remove non-terminal simps (#30106)
Found by the flexible linter; extracted from https://github.com/leanprover-community/mathlib4/pull/28962.
I consider these changes improvements as well, given they improve robustness.
ESTIMATED CHANGES
Modified Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean
Modified Mathlib/Analysis/Analytic/Binomial.lean
Modified Mathlib/Analysis/Calculus/FDeriv/Pow.lean
Modified Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean
Modified Mathlib/Analysis/Complex/ValueDistribution/FirstMainTheorem.lean
Modified Mathlib/Analysis/Meromorphic/TrailingCoefficient.lean
Modified Mathlib/CategoryTheory/SmallObject/Construction.lean
Modified Mathlib/Combinatorics/SetFamily/FourFunctions.lean
Modified Mathlib/Data/ENNReal/BigOperators.lean
Modified Mathlib/Data/Nat/Digits/Lemmas.lean
Modified Mathlib/Probability/Kernel/IonescuTulcea/PartialTraj.lean
Modified Mathlib/Probability/ProbabilityMassFunction/Constructions.lean
Modified Mathlib/Topology/Instances/EReal/Lemmas.lean
2025-10-01 13:25:44 486ed12
ci(nolints.yml): use peter-evans/create-pull-request instead of bash script (#30096)
We simplify the workflow by using peter-evans/create-pull-request instead of our custom bash script to create the PR.
Testing result in #30094.
ESTIMATED CHANGES
Modified .github/workflows/nolints.yml
Modified scripts/README.md
Deleted scripts/update_nolints_CI.sh
2025-10-01 13:25:41 057a6c8
chore: remove non-terminal simps (#30091)
Found by the flexible linter; extracted from #28962.
This is a subset of changes which I consider improvements on its own.
ESTIMATED CHANGES
Modified Archive/Arithcc.lean
Modified Archive/Imo/Imo2008Q2.lean
Modified Archive/Wiedijk100Theorems/CubingACube.lean
Modified Counterexamples/Phillips.lean
Modified Mathlib/Algebra/BigOperators/Fin.lean
Modified Mathlib/Algebra/Category/ModuleCat/Subobject.lean
Modified Mathlib/Algebra/Lie/Weights/RootSystem.lean
Modified Mathlib/AlgebraicGeometry/Gluing.lean
Modified Mathlib/AlgebraicGeometry/StructureSheaf.lean
Modified Mathlib/AlgebraicGeometry/ValuativeCriterion.lean
Modified Mathlib/Analysis/Analytic/OfScalars.lean
Modified Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean
Modified Mathlib/Analysis/Meromorphic/NormalForm.lean
Modified Mathlib/Analysis/NormedSpace/MultipliableUniformlyOn.lean
Modified Mathlib/Analysis/ODE/Gronwall.lean
Modified Mathlib/Analysis/Real/Pi/Irrational.lean
Modified Mathlib/Analysis/SpecialFunctions/BinaryEntropy.lean
Modified Mathlib/Analysis/SpecialFunctions/MulExpNegMulSq.lean
Modified Mathlib/Analysis/SpecialFunctions/MulExpNegMulSqIntegral.lean
Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean
Modified Mathlib/Analysis/SpecificLimits/Normed.lean
Modified Mathlib/Combinatorics/Enumerative/Composition.lean
Modified Mathlib/Combinatorics/SetFamily/KruskalKatona.lean
Modified Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean
Modified Mathlib/Geometry/Euclidean/Triangle.lean
Modified Mathlib/Geometry/Manifold/Riemannian/Basic.lean
Modified Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean
Modified Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean
Modified Mathlib/LinearAlgebra/TensorProduct/Associator.lean
Modified Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean
Modified Mathlib/RingTheory/HahnSeries/Lex.lean
Modified Mathlib/RingTheory/KrullDimension/Module.lean
Modified Mathlib/Topology/DiscreteSubset.lean
Modified Mathlib/Topology/Order.lean
Modified Mathlib/Topology/Order/Monotone.lean
Modified Mathlib/Topology/PartialHomeomorph.lean
Modified Mathlib/Topology/PartitionOfUnity.lean
2025-10-01 13:25:39 caee90c
feat(Probability/Independence): relate conditional independence and factorization of a kernel (#29884)
```lean
CondIndepFun m' hm' f g μ
↔ (condExpKernel μ m').map (fun ω ↦ (f ω, g ω))
=ᵐ[μ.trim hm'] (condExpKernel μ m').map f ×ₖ (condExpKernel μ m').map g
```
From the LeanBandits project.
ESTIMATED CHANGES
Modified Mathlib/Probability/Independence/Conditional.lean
+ theorem ProbabilityTheory.condIndepFun_iff_compProd_map_prod_eq_compProd_prod_map_map
+ theorem ProbabilityTheory.condIndepFun_iff_map_prod_eq_prod_comp_trim
+ theorem ProbabilityTheory.condIndepFun_iff_map_prod_eq_prod_map_map
Modified Mathlib/Probability/Independence/Kernel.lean
+ theorem ProbabilityTheory.Kernel.indepFun_iff_compProd_map_prod_eq_compProd_prod_map_map
2025-10-01 13:25:37 11f59c5
feat(Probability): `condDistrib` lemmas (#29555)
From the LeanBandits project.
ESTIMATED CHANGES
Modified Mathlib/Probability/Kernel/CondDistrib.lean
+ theorem ProbabilityTheory.condDistrib_ae_eq_iff_measure_eq_compProd
+/- theorem ProbabilityTheory.condDistrib_ae_eq_of_measure_eq_compProd
+ theorem ProbabilityTheory.condDistrib_ae_eq_of_measure_eq_compProd_of_measurable
+ theorem ProbabilityTheory.condDistrib_comp
+ theorem ProbabilityTheory.condDistrib_comp_map
+ theorem ProbabilityTheory.condDistrib_comp_self
+ theorem ProbabilityTheory.condDistrib_congr
+ theorem ProbabilityTheory.condDistrib_congr_left
+ theorem ProbabilityTheory.condDistrib_congr_right
+ theorem ProbabilityTheory.condDistrib_const
+ theorem ProbabilityTheory.condDistrib_fst_prod
+ theorem ProbabilityTheory.condDistrib_map
+ theorem ProbabilityTheory.condDistrib_self
+ theorem ProbabilityTheory.condDistrib_snd_prod
Modified Mathlib/Probability/Kernel/Condexp.lean
+ theorem ProbabilityTheory.condDistrib_apply_ae_eq_condExpKernel_map
2025-10-01 13:25:36 fd89053
doc(ModelTheory): clarify free and (in-scope) bound variables in `BoundedFormula` (#29373)
The current design of `BoundedFormula` is actually a locally nameless representation. Following PL convention, we should call the `α` indexed variables as free variables, and the `Fin n` indexed variables as (in-scope) bound variables.
Also clarify that the bound variables are actually de Bruijn levels.
Some references:
- Show trace profiling of isSheafFor_bind
### Before
```
ℹ [838/838] Replayed Mathlib.CategoryTheory.Sites.Canonical
info: Mathlib/CategoryTheory/Sites/Canonical.lean:48:0: [Elab.command] [0.014550] /--
To show `P` is a sheaf for the binding of `U` with `B`, it suffices to show that `P` is a sheaf for
`U`, that `P` is a sheaf for each sieve in `B`, and that it is separated for any pullback of any
sieve in `B`.
This is mostly an auxiliary lemma to show `isSheafFor_trans`.
Adapted from [Elephant], Lemma C2.1.7(i) with suggestions as mentioned in
https://math.stackexchange.com/a/358709/
-/
theorem isSheafFor_bind (P : Cᵒᵖ ⥤ Type v) (U : Sieve X) (B : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄, U f → Sieve Y)
(hU : Presieve.IsSheafFor P (U : Presieve X))
(hB : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), Presieve.IsSheafFor P (B hf : Presieve Y))
(hB' :
∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (h : U f) ⦃Z⦄ (g : Z ⟶ Y), Presieve.IsSeparatedFor P (((B h).pullback g) : Presieve Z)) :
Presieve.IsSheafFor P (Sieve.bind (U : Presieve X) B : Presieve X) :=
by
intro s hs
let y : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), Presieve.FamilyOfElements P (B hf : Presieve Y) := fun Y f hf Z g hg =>
s _ (Presieve.bind_comp _ _ hg)
have hy : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), (y hf).Compatible :=
by
intro Y f H Y₁ Y₂ Z g₁ g₂ f₁ f₂ hf₁ hf₂ comm
apply hs
apply reassoc_of% comm
let t : Presieve.FamilyOfElements P (U : Presieve X) := fun Y f hf => (hB hf).amalgamate (y hf) (hy hf)
have ht : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), (y hf).IsAmalgamation (t f hf) := fun Y f hf => (hB hf).isAmalgamation _
have hT : t.Compatible := by
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply]
refine ⟨hU.amalgamate t hT, ?_, ?_⟩
· rintro Z _ ⟨Y, f, g, hg, hf, rfl⟩
rw [op_comp, FunctorToTypes.map_comp_apply, Presieve.IsSheafFor.valid_glue _ _ _ hg]
apply ht hg _ hf
· intro y hy
apply hU.isSeparatedFor.ext
intro Y f hf
apply (hB hf).isSeparatedFor.ext
intro Z g hg
rw [← FunctorToTypes.map_comp_apply, ← op_comp, hy _ (Presieve.bind_comp _ _ hg), hU.valid_glue _ _ hf,
ht hf _ hg]
[Elab.definition.header] [0.013428] CategoryTheory.Sheaf.isSheafFor_bind
info: Mathlib/CategoryTheory/Sites/Canonical.lean:48:0: [Elab.async] [0.114179] elaborating proof of CategoryTheory.Sheaf.isSheafFor_bind
[Elab.definition.value] [0.110524] CategoryTheory.Sheaf.isSheafFor_bind
[Elab.step] [0.104029]
intro s hs
let y : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), Presieve.FamilyOfElements P (B hf : Presieve Y) := fun Y f hf Z g hg =>
s _ (Presieve.bind_comp _ _ hg)
have hy : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), (y hf).Compatible :=
by
intro Y f H Y₁ Y₂ Z g₁ g₂ f₁ f₂ hf₁ hf₂ comm
apply hs
apply reassoc_of% comm
let t : Presieve.FamilyOfElements P (U : Presieve X) := fun Y f hf => (hB hf).amalgamate (y hf) (hy hf)
have ht : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), (y hf).IsAmalgamation (t f hf) := fun Y f hf =>
(hB hf).isAmalgamation _
have hT : t.Compatible := by
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply]
refine ⟨hU.amalgamate t hT, ?_, ?_⟩
· rintro Z _ ⟨Y, f, g, hg, hf, rfl⟩
rw [op_comp, FunctorToTypes.map_comp_apply, Presieve.IsSheafFor.valid_glue _ _ _ hg]
apply ht hg _ hf
· intro y hy
apply hU.isSeparatedFor.ext
intro Y f hf
apply (hB hf).isSeparatedFor.ext
intro Z g hg
rw [← FunctorToTypes.map_comp_apply, ← op_comp, hy _ (Presieve.bind_comp _ _ hg), hU.valid_glue _ _ hf,
ht hf _ hg]
[Elab.step] [0.104019]
intro s hs
let y : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), Presieve.FamilyOfElements P (B hf : Presieve Y) :=
fun Y f hf Z g hg => s _ (Presieve.bind_comp _ _ hg)
have hy : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), (y hf).Compatible :=
by
intro Y f H Y₁ Y₂ Z g₁ g₂ f₁ f₂ hf₁ hf₂ comm
apply hs
apply reassoc_of% comm
let t : Presieve.FamilyOfElements P (U : Presieve X) := fun Y f hf => (hB hf).amalgamate (y hf) (hy hf)
have ht : ∀ ⦃Y⦄ ⦃f : Y ⟶ X⦄ (hf : U f), (y hf).IsAmalgamation (t f hf) := fun Y f hf =>
(hB hf).isAmalgamation _
have hT : t.Compatible := by
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply]
refine ⟨hU.amalgamate t hT, ?_, ?_⟩
· rintro Z _ ⟨Y, f, g, hg, hf, rfl⟩
rw [op_comp, FunctorToTypes.map_comp_apply, Presieve.IsSheafFor.valid_glue _ _ _ hg]
apply ht hg _ hf
· intro y hy
apply hU.isSeparatedFor.ext
intro Y f hf
apply (hB hf).isSeparatedFor.ext
intro Z g hg
rw [← FunctorToTypes.map_comp_apply, ← op_comp, hy _ (Presieve.bind_comp _ _ hg), hU.valid_glue _ _ hf,
ht hf _ hg]
[Elab.step] [0.070744] have hT : t.Compatible :=
by
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply]
[Elab.step] [0.070651] focus
refine
no_implicit_lambda%
(have hT : t.Compatible := ?body✝;
?_)
case body✝ =>
with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070647]
refine
no_implicit_lambda%
(have hT : t.Compatible := ?body✝;
?_)
case body✝ =>
with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070644]
refine
no_implicit_lambda%
(have hT : t.Compatible := ?body✝;
?_)
case body✝ =>
with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070400] case body✝ =>
with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070383] with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070380] with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by
simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070377] with_annotate_state"by"
( rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by
simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070374] (
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by
simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply])
[Elab.step] [0.070371]
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by
simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply]
[Elab.step] [0.070366]
rw [Presieve.compatible_iff_sieveCompatible]
intro Z W f h hf
apply (hB (U.downward_closed hf h)).isSeparatedFor.ext
intro Y l hl
apply (hB' hf (l ≫ h)).ext
intro M m hm
have : bind U B (m ≫ l ≫ h ≫ f) := by
simpa using (Presieve.bind_comp f hf hm : bind U B _)
trans s (m ≫ l ≫ h ≫ f) this
· have := ht (U.downward_closed hf h) _ ((B _).downward_closed hl m)
rw [op_comp, FunctorToTypes.map_comp_apply] at this
rw [this]
change
s _ _ =
s _
_
-- Porting note: the proof was `by simp`
congr 1
simp only [assoc]
· have h : s _ _ = _ := (ht hf _ hm).symm
conv_lhs at h => congr; rw [assoc, assoc]
rw [h]
simp only [op_comp, assoc, FunctorToTypes.map_comp_apply]
[Elab.step] [0.048056] have : bind U B (m ≫ l ≫ h ≫ f) := by
simpa using (Presieve.bind_comp f hf hm : bind U B _)
[Elab.step] [0.048035] focus
refine
no_implicit_lambda%
(have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_)
case body✝ =>
with_annotate_state"by" (simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.048032]
refine
no_implicit_lambda%
(have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_)
case body✝ =>
with_annotate_state"by"
(simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.048029]
refine
no_implicit_lambda%
(have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_)
case body✝ =>
with_annotate_state"by"
(simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.018655] refine
no_implicit_lambda%
(have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_)
[Elab.step] [0.018606] expected type: P.map m.op (P.map l.op (t (h ≫ f) ⋯)) =
P.map m.op (P.map l.op (P.map h.op (t f hf))), term
no_implicit_lambda%
(have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_)
[Elab.step] [0.018603] expected type: P.map m.op (P.map l.op (t (h ≫ f) ⋯)) =
P.map m.op (P.map l.op (P.map h.op (t f hf))), term
(have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_)
[Elab.step] [0.018598] expected type: P.map m.op
(P.map l.op (t (h ≫ f) ⋯)) =
P.map m.op (P.map l.op (P.map h.op (t f hf))), term
have : bind U B (m ≫ l ≫ h ≫ f) := ?body✝;
?_
[Elab.step] [0.018298] expected type: Prop, term
bind U B (m ≫ l ≫ h ≫ f)
[Elab.step] [0.012305] expected type: M ⟶ X, term
(m ≫ l ≫ h ≫ f)
[Elab.step] [0.012300] expected type: M ⟶ X, term
m ≫ l ≫ h ≫ f
[Elab.step] [0.010181] expected type: M ⟶ X, term
CategoryStruct.comp✝ m (l ≫ h ≫ f)
[Elab.step] [0.029363] case body✝ =>
with_annotate_state"by"
(simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.029326] with_annotate_state"by"
(simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.029323] with_annotate_state"by"
(simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.029319] with_annotate_state"by"
(simpa using (Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.029316] (simpa using
(Presieve.bind_comp f hf hm : bind U B _))
[Elab.step] [0.029313] simpa using
(Presieve.bind_comp f hf hm : bind U B _)
[Elab.step] [0.029309] simpa using
(Presieve.bind_comp f hf hm : bind U B _)
[Elab.step] [0.029303] simpa using
(Presieve.bind_comp f hf hm : bind U B _)
[Elab.step] [0.011381] expected type: ... (truncated)
Commits
f807b33Clarify and fix typo in changelog (#123)- See full diff in compare view
Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting `@dependabot rebase`. [//]: # (dependabot-automerge-start) [//]: # (dependabot-automerge-end) ESTIMATED CHANGES Modified .github/workflows/add_label_from_diff.yaml Modified .github/workflows/bench_summary_comment.yml Modified .github/workflows/bors.yml Modified .github/workflows/bot_fix_style.yaml Modified .github/workflows/build.yml Modified .github/workflows/build_fork.yml Modified .github/workflows/daily.yml Modified .github/workflows/discover-lean-pr-testing.yml Modified .github/workflows/latest_import.yml Modified .github/workflows/lint_and_suggest_pr.yml Modified .github/workflows/nightly_merge_master.yml Modified .github/workflows/nolints.yml Modified .github/workflows/update_dependencies.yml 2025-05-01 14:26:22 640e70f chore(deps): bump actions/setup-python from 5.5.0 to 5.6.0 in /.github/workflows (#24509) Bumps [actions/setup-python](https://github.com/actions/setup-python) from 5.5.0 to 5.6.0.
Release notes
Sourced from actions/setup-python's releases.
v5.6.0
What's Changed
- Workflow updates related to Ubuntu 20.04 by
@aparnajyothi-yin actions/setup-python#1065- Fix for Candidate Not Iterable Error by
@aparnajyothi-yin actions/setup-python#1082- Upgrade semver and
@types/semverby@dependabotin actions/setup-python#1091- Upgrade prettier from 2.8.8 to 3.5.3 by
@dependabotin actions/setup-python#1046- Upgrade ts-jest from 29.1.2 to 29.3.2 by
@dependabotin actions/setup-python#1081Full Changelog: https://github.com/actions/setup-python/compare/v5...v5.6.0
Commits
a26af69Bump ts-jest from 29.1.2 to 29.3.2 (#1081)30eafe9Bump prettier from 2.8.8 to 3.5.3 (#1046)5d95bc1Bump semver and@types/semver(#1091)6ed2c67Fix for Candidate Not Iterable Error (#1082)e348410Remove Ubuntu 20.04 from workflows due to deprecation from 2025-04-15 (#1065)- See full diff in compare view
[](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores) Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting `@dependabot rebase`. [//]: # (dependabot-automerge-start) [//]: # (dependabot-automerge-end) ESTIMATED CHANGES Modified .github/workflows/PR_summary.yml Modified .github/workflows/bors.yml Modified .github/workflows/bot_fix_style.yaml Modified .github/workflows/build.yml Modified .github/workflows/build_fork.yml Modified .github/workflows/lint_and_suggest_pr.yml Modified .github/workflows/maintainer_bors.yml Modified .github/workflows/update_dependencies_zulip.yml Modified .github/workflows/zulip_emoji_awaiting_author.yaml Modified .github/workflows/zulip_emoji_closed_pr.yaml Modified .github/workflows/zulip_emoji_merge_delegate.yaml 2025-05-01 14:26:21 5c459c6 chore(deps): bump actions/setup-python from 5.5.0 to 5.6.0 in /.github (#24508) Bumps [actions/setup-python](https://github.com/actions/setup-python) from 5.5.0 to 5.6.0.
Release notes
Sourced from actions/setup-python's releases.
v5.6.0
What's Changed
- Workflow updates related to Ubuntu 20.04 by
@aparnajyothi-yin actions/setup-python#1065- Fix for Candidate Not Iterable Error by
@aparnajyothi-yin actions/setup-python#1082- Upgrade semver and
@types/semverby@dependabotin actions/setup-python#1091- Upgrade prettier from 2.8.8 to 3.5.3 by
@dependabotin actions/setup-python#1046- Upgrade ts-jest from 29.1.2 to 29.3.2 by
@dependabotin actions/setup-python#1081Full Changelog: https://github.com/actions/setup-python/compare/v5...v5.6.0
Commits
a26af69Bump ts-jest from 29.1.2 to 29.3.2 (#1081)30eafe9Bump prettier from 2.8.8 to 3.5.3 (#1046)5d95bc1Bump semver and@types/semver(#1091)6ed2c67Fix for Candidate Not Iterable Error (#1082)e348410Remove Ubuntu 20.04 from workflows due to deprecation from 2025-04-15 (#1065)- See full diff in compare view
[](https://docs.github.com/en/github/managing-security-vulnerabilities/about-dependabot-security-updates#about-compatibility-scores) Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting `@dependabot rebase`. [//]: # (dependabot-automerge-start) [//]: # (dependabot-automerge-end) ESTIMATED CHANGES Modified .github/build.in.yml 2025-05-01 14:26:20 f3c9455 chore(deps): bump leanprover/lean-action from e18f2df7f0d4f30d11a4b963bff9b1140999480c to f807b338d95de7813c5c50d018f1c23c9b93b4ec in /.github (#24507) Bumps [leanprover/lean-action](https://github.com/leanprover/lean-action) from e18f2df7f0d4f30d11a4b963bff9b1140999480c to f807b338d95de7813c5c50d018f1c23c9b93b4ec.
Changelog
Sourced from leanprover/lean-action's changelog.
Changelog
All notable changes to
lean-actionwill be documented in this file.The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.
Unreleased
Added
- add option to always reinstall
lean4-pr-releasestoolchains, ensuring CI runs with the latest versionv1.1.2 - 2025-03-28
Fixed
- include runner architecture in cache key to avoid reusing
.lakeacross different runner architecturesv1.1.1 - 2024-11-23
Fixed
- fix bug with passing multiple arguments to
lake buildviabuild-argsinput- fix false feature flag logic when using
auto-config: truev1.1.0 - 2024-9-16
Added
- Windows GitHub runner support
Fixed
- replace
actions/cachewithactions/cache/restoreto prevent redundant cache saving previously caused by the combination ofactions/cacheandactions/cache/savev1.0.2 - 2024-8-26
Changed
- use empty string as default value for status outputs instead of "NOT_RUN" to avoid
set-output-parametersfinal step breaking log group expansionFixed
- correct typo of in configuration step: "lake check-test failed" -> "lake check-lint failed"
- fix log group expansion in failing steps due to
set-output-parametersstep and removing the end log group command when a step fails
... (truncated)
Commits
f807b33Clarify and fix typo in changelog (#123)- See full diff in compare view
Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting `@dependabot rebase`. [//]: # (dependabot-automerge-start) [//]: # (dependabot-automerge-end) ESTIMATED CHANGES Modified .github/build.in.yml 2025-05-01 14:19:43 223f70f chore: make dependabot group updates into a single PR (#23549) cf. docs at https://docs.github.com/en/code-security/dependabot/dependabot-version-updates/optimizing-pr-creation-version-updates ESTIMATED CHANGES Modified .github/dependabot.yml 2025-05-01 14:04:24 22a178a refactor(Geometry/Euclidean): split out altitudes (#24504) Move the definition of `Affine.Simplex.altitude` and associated API from `MongePoint.lean` to a separate file, in preparation for setting up other associated definitions (as discussed in #23752) that are of use without involving the Monge point / orthocenter. There are no changes to definitions, statements or proofs; this is just moving content from one file to another. ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/Geometry/Euclidean/Altitude.lean + theorem Affine.Simplex.affineSpan_pair_eq_altitude_iff + def Affine.Simplex.altitude + theorem Affine.Simplex.altitude_def + theorem Affine.Simplex.direction_altitude + theorem Affine.Simplex.finrank_direction_altitude + theorem Affine.Simplex.mem_altitude + theorem Affine.Simplex.vectorSpan_isOrtho_altitude_direction Modified Mathlib/Geometry/Euclidean/MongePoint.lean - theorem Affine.Simplex.affineSpan_pair_eq_altitude_iff - def Affine.Simplex.altitude - theorem Affine.Simplex.altitude_def - theorem Affine.Simplex.direction_altitude - theorem Affine.Simplex.finrank_direction_altitude - theorem Affine.Simplex.mem_altitude - theorem Affine.Simplex.vectorSpan_isOrtho_altitude_direction 2025-05-01 13:57:26 0aba093 refactor(Geometry/Euclidean): use `orthogonalProjectionSpan` more (#24503) Make more use of `orthogonalProjectionSpan` in `Mathlib.Geometry.Euclidean.Projection` and `Mathlib.Geometry.Euclidean.SignedDist`. Split out from #23752. ESTIMATED CHANGES Modified Mathlib/Geometry/Euclidean/Projection.lean Modified Mathlib/Geometry/Euclidean/SignedDist.lean 2025-05-01 12:28:33 f4adaa2 chore: whitespace still (#24501) Mostly whitespace changes found by the linter at #24465. ESTIMATED CHANGES Modified Archive/Imo/Imo2019Q4.lean Modified Mathlib/GroupTheory/CoprodI.lean +/- inductive Monoid.CoprodI.Rel Modified Mathlib/GroupTheory/PushoutI.lean Modified Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean Modified Mathlib/ModelTheory/Order.lean Modified Mathlib/NumberTheory/FactorisationProperties.lean +/- theorem Nat.Prime.deficient_pow Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean +/- theorem NumberField.mixedEmbedding.fundamentalCone.realSpaceToLogSpace_apply Modified Mathlib/RingTheory/Binomial.lean +/- theorem Ring.descPochhammer_smeval_add Modified Mathlib/RingTheory/Ideal/IsPrincipalPowQuotient.lean +/- def Ideal.quotEquivPowQuotPowSucc Modified Mathlib/RingTheory/LocalRing/Subring.lean +/- theorem IsLocalRing.of_subring Modified Mathlib/RingTheory/Regular/RegularSequence.lean Modified Mathlib/RingTheory/TwoSidedIdeal/Operations.lean +/- def TwoSidedIdeal.orderIsoIsTwoSided Modified Mathlib/SetTheory/Surreal/Multiplication.lean +/- inductive Surreal.Multiplication.Args Modified Mathlib/Tactic/FunProp/ContDiff.lean Modified Mathlib/Topology/CWComplex/Classical/Basic.lean 2025-05-01 12:20:41 4ba0443 chore: use more modern config options (#24502) ESTIMATED CHANGES Modified Mathlib/Algebra/GCDMonoid/Basic.lean Modified Mathlib/Algebra/Group/Equiv/Opposite.lean Modified Mathlib/Analysis/Fourier/AddCircle.lean Modified Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean Modified Mathlib/CategoryTheory/Comma/Over/Pullback.lean Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean Modified Mathlib/Data/List/Chain.lean Modified Mathlib/Data/List/SplitLengths.lean Modified Mathlib/Data/Multiset/Fintype.lean Modified Mathlib/Geometry/Euclidean/Circumcenter.lean Modified Mathlib/Geometry/Manifold/IsManifold/Basic.lean Modified Mathlib/LinearAlgebra/Pi.lean Modified Mathlib/LinearAlgebra/QuadraticForm/Complex.lean Modified Mathlib/Logic/Embedding/Basic.lean Modified Mathlib/MeasureTheory/Covering/Differentiation.lean Modified Mathlib/MeasureTheory/Function/Jacobian.lean Modified Mathlib/MeasureTheory/Function/SimpleFuncDense.lean Modified Mathlib/MeasureTheory/PiSystem.lean Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/Basic.lean Modified Mathlib/Order/Interval/Set/Image.lean Modified Mathlib/RingTheory/LittleWedderburn.lean Modified Mathlib/Tactic/CategoryTheory/Coherence.lean Modified Mathlib/Tactic/Lift.lean Modified Mathlib/Topology/Algebra/Field.lean Modified MathlibTest/SimpRw.lean 2025-05-01 10:40:22 09a9022 docs(Topology/Sets/Closeds): fix docs (#24491) Fix docs for `TopologicalSpace.Closeds.gi`. ESTIMATED CHANGES Modified Mathlib/Topology/Sets/Closeds.lean 2025-05-01 10:33:45 e6d28fe chore(MathlibTest/norm_num): don't indent sections (#24500) This matches mathlib style elsewhere. Found by the linter in #24465. ESTIMATED CHANGES Modified MathlibTest/norm_num.lean 2025-05-01 09:22:05 429a671 chore: clear Data.Fin.basic doc (#24446) chore: clear Fin.basic doc These declarations are not in this file. ESTIMATED CHANGES Modified Mathlib/Data/Fin/Basic.lean 2025-05-01 09:09:21 9e67d11 feat(Algebra/Exact): add `Function.Exact.[iff_]rangeFactorization` etc (#23446) Two maps `f : M → N` and `g : N → P` are exact if and only if the induced maps `Set.range f → N → Set.range g` are exact. Same for `AddMonoidHom` and `LinearMap`. ESTIMATED CHANGES Modified Mathlib/Algebra/Exact.lean + theorem Function.Exact.iff_addMonoidHom_rangeRestrict + theorem Function.Exact.iff_linearMap_rangeRestrict +/- theorem Function.Exact.iff_of_ladder_linearEquiv + theorem Function.Exact.iff_rangeFactorization +/- theorem Function.Exact.of_ladder_linearEquiv_of_exact + theorem Function.Exact.rangeFactorization 2025-05-01 09:00:22 32308cd feat: congruence lemmas for divisors of meromorphic functions (#23363) Deliver on open TODO and state elementary congruence lemmas for divisors of meromorphic functions. This material is used in [Project VD](https://github.com/kebekus/ProjectVD), which aims to formalize Value Distribution Theory for meromorphic functions on the complex plane. ESTIMATED CHANGES Modified Mathlib/Analysis/Meromorphic/Basic.lean + theorem MeromorphicOn.congr_codiscreteWithin + theorem MeromorphicOn.congr_codiscreteWithin_of_eqOn_compl Modified Mathlib/Analysis/Meromorphic/Divisor.lean + theorem MeromorphicOn.divisor_congr_codiscreteWithin + theorem MeromorphicOn.divisor_congr_codiscreteWithin_of_eqOn_compl 2025-05-01 08:53:42 ce77935 feat: add logarithmic counting function of Value Distribution Theory (#23627) Implement the logarithmic counting function of Value Distribution Theory and provide supporting API. This material is used in [Project VD](https://github.com/kebekus/ProjectVD), which aims to formalize Value Distribution Theory for meromorphic functions on the complex plane. ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/Analysis/Complex/ValueDistribution/CountingFunction.lean + theorem Function.locallyFinsuppWithin.logCounting_eval_zero + theorem ValueDistribution.logCounting_add_analyticOn + theorem ValueDistribution.logCounting_add_const + theorem ValueDistribution.logCounting_coe + theorem ValueDistribution.logCounting_coe_eq_logCounting_sub_const_zero + theorem ValueDistribution.logCounting_eval_zero + theorem ValueDistribution.logCounting_inv + theorem ValueDistribution.logCounting_sub_const + theorem ValueDistribution.logCounting_top + theorem ValueDistribution.logCounting_zero + theorem ValueDistribution.log_counting_zero_sub_logCounting_top 2025-05-01 08:12:39 0f6b664 feat(RingTheory/Ideal/AssociatedPrime/Basic): associated primes and exact sequence (#24453) Added properties of associated primes with respect to exact sequence. Also added another equivalent characterization of being an associated prime. ESTIMATED CHANGES Modified Mathlib/RingTheory/Ideal/AssociatedPrime/Basic.lean + theorem associatedPrimes.prod +/- theorem associatedPrimes.subset_of_injective + theorem associatedPrimes.subset_union_of_exact + theorem isAssociatedPrime_iff_exists_injective_linearMap 2025-05-01 08:12:38 9cfa3ae feat(Algebra/Module/Submodule/Map): add `LinearMap.submoduleComap` (#24451) For a linear map `f`, we define the map `LinearMap.submoduleComap` for convenience (similar to the existing `MonoidHom.submonoidComap` and `MonoidHom.subgroupComap`), from `Submodule.comap q f` to `q` obtained from restricting `f` using `LinearMap.restrict`. It has a particular property that if `f` is surjective, then itself is also surjective. This property also added to existing ones. ESTIMATED CHANGES Modified Mathlib/Algebra/Group/Subgroup/Map.lean + theorem MonoidHom.subgroupComap_surjective_of_surjective Modified Mathlib/Algebra/Group/Submonoid/Operations.lean + theorem MonoidHom.submonoidComap_surjective_of_surjective Modified Mathlib/Algebra/Module/Submodule/Map.lean + def LinearMap.submoduleComap + theorem LinearMap.submoduleComap_surjective_of_surjective 2025-05-01 08:12:36 a8f8e75 refactor(Order/Heyting): convert toBiheytingHomClass from lemma to instance (#24437) Previously toBiheytingHomClass was a lemma due to concerns about typeclass loops. These concerns are no longer relevant in Lean 4, so we can now make it a proper instance. Remove the outdated porting note as well. ESTIMATED CHANGES Modified Mathlib/Order/Heyting/Hom.lean - theorem BoundedLatticeHomClass.toBiheytingHomClass 2025-05-01 06:42:35 95eff17 chore(Data/Finset/Insert): make `cons` branch explicit in `Finset.induction` (#24487) Changes ```lean @[elab_as_elim] protected theorem induction {α : Type*} {motive : Finset α → Prop} [DecidableEq α] (empty : motive ∅) (insert : ∀ ⦃a : α⦄ {s : Finset α}, a ∉ s → motive s → motive (insert a s)) : ∀ s, motive s := ``` to ```lean @[elab_as_elim] protected theorem induction {α : Type*} {motive : Finset α → Prop} [DecidableEq α] (empty : motive ∅) (insert : ∀ (a : α) (s : Finset α), a ∉ s → motive s → motive (insert a s)) : ∀ s, motive s := ``` and the same for `Finset.cons_induction_on`, `Finset.induction_on`, and `Finset.induction_on'`. ESTIMATED CHANGES Modified Mathlib/Algebra/BigOperators/Associated.lean Modified Mathlib/Algebra/BigOperators/Finsupp/Basic.lean Modified Mathlib/Algebra/BigOperators/GroupWithZero/Action.lean Modified Mathlib/Algebra/BigOperators/GroupWithZero/Finset.lean Modified Mathlib/Algebra/BigOperators/Ring/Finset.lean Modified Mathlib/Algebra/Group/Subgroup/Finite.lean Modified Mathlib/Algebra/Lie/Submodule.lean Modified Mathlib/Algebra/MvPolynomial/Variables.lean Modified Mathlib/Algebra/Polynomial/PartialFractions.lean Modified Mathlib/Analysis/Asymptotics/ExpGrowth.lean Modified Mathlib/Analysis/Calculus/ContDiff/Bounds.lean Modified Mathlib/Analysis/Convex/Exposed.lean Modified Mathlib/Analysis/Normed/Group/Ultra.lean Modified Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean Modified Mathlib/Analysis/SpecialFunctions/Log/Summable.lean Modified Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean Modified Mathlib/CategoryTheory/Subobject/Lattice.lean Modified Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean Modified Mathlib/Combinatorics/SetFamily/Compression/Down.lean Modified Mathlib/Combinatorics/SetFamily/FourFunctions.lean Modified Mathlib/Combinatorics/SetFamily/HarrisKleitman.lean Modified Mathlib/Data/Finset/Insert.lean Modified Mathlib/Data/Finset/Lattice/Fold.lean Modified Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean Modified Mathlib/GroupTheory/Perm/Cycle/Type.lean Modified Mathlib/GroupTheory/Perm/Support.lean Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean Modified Mathlib/LinearAlgebra/Eigenspace/Pi.lean Modified Mathlib/LinearAlgebra/FiniteDimensional/Basic.lean Modified Mathlib/LinearAlgebra/LinearIndependent/Basic.lean Modified Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean Modified Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean Modified Mathlib/LinearAlgebra/Multilinear/Basic.lean Modified Mathlib/LinearAlgebra/TensorProduct/Basic.lean Modified Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean Modified Mathlib/MeasureTheory/Function/SimpleFunc.lean Modified Mathlib/MeasureTheory/Integral/Bochner/Basic.lean Modified Mathlib/MeasureTheory/Integral/Bochner/Set.lean Modified Mathlib/MeasureTheory/Integral/Marginal.lean Modified Mathlib/MeasureTheory/Integral/MeanInequalities.lean Modified Mathlib/MeasureTheory/Measure/AddContent.lean Modified Mathlib/MeasureTheory/Measure/Hausdorff.lean Modified Mathlib/MeasureTheory/Measure/Real.lean Modified Mathlib/MeasureTheory/OuterMeasure/Caratheodory.lean Modified Mathlib/MeasureTheory/SetSemiring.lean Modified Mathlib/NumberTheory/ArithmeticFunction.lean Modified Mathlib/NumberTheory/EulerProduct/Basic.lean Modified Mathlib/Order/Disjointed.lean Modified Mathlib/Order/Filter/Finite.lean Modified Mathlib/Probability/Moments/SubGaussian.lean Modified Mathlib/RingTheory/DividedPowers/Basic.lean Modified Mathlib/RingTheory/Finiteness/Basic.lean Modified Mathlib/RingTheory/Ideal/IsPrimary.lean Modified Mathlib/RingTheory/Ideal/Operations.lean Modified Mathlib/RingTheory/Ideal/Quotient/Index.lean Modified Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean Modified Mathlib/RingTheory/MvPowerSeries/Basic.lean Modified Mathlib/RingTheory/MvPowerSeries/Order.lean Modified Mathlib/RingTheory/Nilpotent/Basic.lean Modified Mathlib/Topology/Category/TopCat/Limits/Cofiltered.lean Modified Mathlib/Topology/Connected/Basic.lean Modified Mathlib/Topology/Connected/Clopen.lean Modified Mathlib/Topology/Instances/ENNReal/Lemmas.lean Modified Mathlib/Topology/Irreducible.lean Modified Mathlib/Topology/Semicontinuous.lean Modified Mathlib/Topology/Separation/Basic.lean Modified Mathlib/Topology/Sets/Closeds.lean 2025-05-01 06:42:34 14fb067 chore(BigOperators/Fin): sections, type variables (#24197) General cleanup: - use `M` instead of Greek letters for the codomain of lemmas about products and sums; - move `[CommMonoid M]` to `variable`; - rename `Fin.prod_univ_get` to `Fin.prod_univ_getElem`, similarly for the additive version; - rename `Fin.prod_univ_get'` to `Fin.prod_univ_fun_getElem`, similarly for the additive version; - add a missing `to_additive` for `Fin.prod_const`; ESTIMATED CHANGES Modified Mathlib/Algebra/BigOperators/Fin.lean +/- theorem Fin.prod_Ioi_succ +/- theorem Fin.prod_Ioi_zero +/- theorem Fin.prod_congr' +/- theorem Fin.prod_cons +/- theorem Fin.prod_const +/- theorem Fin.prod_ofFn +/- theorem Fin.prod_snoc +/- theorem Fin.prod_trunc +/- theorem Fin.prod_univ_add +/- theorem Fin.prod_univ_castSucc +/- theorem Fin.prod_univ_def +/- theorem Fin.prod_univ_eight +/- theorem Fin.prod_univ_five +/- theorem Fin.prod_univ_four + theorem Fin.prod_univ_fun_getElem - theorem Fin.prod_univ_get' - theorem Fin.prod_univ_get + theorem Fin.prod_univ_getElem +/- theorem Fin.prod_univ_one +/- theorem Fin.prod_univ_seven +/- theorem Fin.prod_univ_six +/- theorem Fin.prod_univ_succ +/- theorem Fin.prod_univ_succAbove +/- theorem Fin.prod_univ_three +/- theorem Fin.prod_univ_two' +/- theorem Fin.prod_univ_two +/- theorem Fin.prod_univ_zero - theorem Fin.sum_const +/- theorem Finset.prod_range Modified Mathlib/NumberTheory/Ostrowski.lean 2025-05-01 06:42:33 3c29632 feat: preliminaries for Wedderburn–Artin (#24119) ESTIMATED CHANGES Modified Mathlib/Algebra/Algebra/Opposite.lean + def AlgEquiv.moduleEndSelf + def AlgEquiv.moduleEndSelfOp Modified Mathlib/Algebra/Azumaya/Basic.lean Modified Mathlib/Algebra/Equiv/TransferInstance.lean Modified Mathlib/Algebra/Lie/Semisimple/Basic.lean +/- theorem LieAlgebra.IsSimple.eq_top_of_isAtom - theorem LieAlgebra.IsSimple.isAtom_iff_eq_top - theorem LieAlgebra.IsSimple.isAtom_top Modified Mathlib/Algebra/Module/Equiv/Basic.lean +/- def LinearEquiv.arrowCongrAddEquiv +/- def LinearEquiv.conjRingEquiv + def LinearEquiv.domMulActCongrRight Modified Mathlib/Algebra/Module/LinearMap/Defs.lean + theorem LinearMap.ne_zero_of_injective + theorem LinearMap.ne_zero_of_surjective Modified Mathlib/Algebra/Module/LinearMap/End.lean +/- theorem Module.End.intCast_def +/- theorem Module.End.natCast_def - def Module.moduleEndSelf - def Module.moduleEndSelfOp +/- def Module.toModuleEnd + def RingEquiv.moduleEndSelf + def RingEquiv.moduleEndSelfOp Modified Mathlib/Algebra/Module/Submodule/Ker.lean + theorem LinearMap.exists_ne_zero_of_sSup_eq_top + theorem LinearMap.le_ker_iff_comp_subtype_eq_zero Modified Mathlib/Data/Matrix/Basic.lean + def AlgEquiv.mopMatrix Modified Mathlib/FieldTheory/IsAlgClosed/Basic.lean + theorem IsAlgClosed.algebraMap_bijective_of_isIntegral - theorem IsAlgClosed.algebraMap_surjective_of_isIntegral + theorem IsAlgClosed.ringHom_bijective_of_isIntegral Modified Mathlib/LinearAlgebra/Matrix/ToLin.lean +/- def LinearEquiv.algConj Modified Mathlib/LinearAlgebra/Projection.lean + theorem Submodule.linearProjOfIsCompl_surjective Modified Mathlib/LinearAlgebra/Span/Basic.lean + theorem LinearMap.exists_ne_zero_of_sSup_eq Modified Mathlib/Logic/Equiv/Defs.lean + theorem Equiv.nontrivial_congr Modified Mathlib/Order/Atoms.lean + theorem isAtom_iff_eq_top + theorem isCoatom_iff_eq_bot +/- theorem «Prop».isAtom_iff +/- theorem «Prop».isCoatom_iff Modified Mathlib/RingTheory/Congruence/Basic.lean + theorem RingCon.nontrivial_iff + theorem RingCon.subsingleton_iff Modified Mathlib/RingTheory/Ideal/Defs.lean Modified Mathlib/RingTheory/Jacobson/Ideal.lean - theorem Ideal.jacobson_mul_mem_right Modified Mathlib/RingTheory/LocalRing/RingHom/Basic.lean Modified Mathlib/RingTheory/Nullstellensatz.lean Modified Mathlib/RingTheory/SimpleRing/Congr.lean + theorem isSimpleRing_iff_isTwoSided_imp Modified Mathlib/RingTheory/SimpleRing/Defs.lean Modified Mathlib/RingTheory/TwoSidedIdeal/Operations.lean +/- theorem Ideal.asIdeal_toTwoSided +/- theorem Ideal.coe_toTwoSided +/- theorem Ideal.mem_toTwoSided +/- def Ideal.toTwoSided +/- theorem Ideal.toTwoSided_asIdeal + theorem TwoSidedIdeal.bot_asIdeal + def TwoSidedIdeal.orderIsoIsTwoSided + theorem TwoSidedIdeal.top_asIdeal Modified Mathlib/RingTheory/Unramified/Field.lean 2025-05-01 06:42:31 d831fbe doc(Topology/CWComplex): cross-reference abstract and classical approaches (#24069) * Add implementation notes to both Abstract/Basic.lean and Classical/Basic.lean explaining the relationship between the two approaches to CW complexes * Add TODO noting the missing connection between the approaches * Clarify that Abstract/Basic.lean uses a categorical approach while Classical/Basic.lean uses Whitehead's classical approach ESTIMATED CHANGES Modified Mathlib/Topology/CWComplex/Abstract/Basic.lean Modified Mathlib/Topology/CWComplex/Classical/Basic.lean 2025-05-01 06:20:33 9895d54 chore: reorganize and rename the Embedding --> Homeomorph constructions (#24113) This is the updated version of #12994 - rename [Homeomorph.ofIsEmbedding](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Homeomorph/Lemmas.html#Homeomorph.ofIsEmbedding) to `IsEmbedding.toHomeomorph` - move [Topology.IsEmbedding.toHomeomorph_of_surjective](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/IsLocalHomeomorph.html#Topology.IsEmbedding.toHomeomorph_of_surjective) earlier (and PascalCase it) - rename [Homeomorph.homeomorphOfContinuousOpen](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Homeomorph/Defs.html#Homeomorph.homeomorphOfContinuousOpen) to `Equiv.toHomeomorphOfContinuousOpen`, and similarly for the closed version. ESTIMATED CHANGES Modified Mathlib/AlgebraicGeometry/Fiber.lean Modified Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean Modified Mathlib/AlgebraicGeometry/Morphisms/IsIso.lean Modified Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean Modified Mathlib/AlgebraicGeometry/Properties.lean Modified Mathlib/Geometry/RingedSpace/OpenImmersion.lean Modified Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Induction.lean Modified Mathlib/Topology/Category/TopCat/Basic.lean Modified Mathlib/Topology/Category/TopCat/Limits/Products.lean Modified Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean Modified Mathlib/Topology/Constructions/SumProd.lean Modified Mathlib/Topology/Gluing.lean Modified Mathlib/Topology/Homeomorph/Defs.lean + def Equiv.toHomeomorphOfContinuousClosed + theorem Equiv.toHomeomorphOfContinuousClosed_apply + theorem Equiv.toHomeomorphOfContinuousClosed_symm_apply + def Equiv.toHomeomorphOfContinuousOpen + theorem Equiv.toHomeomorphOfContinuousOpen_apply + theorem Equiv.toHomeomorphOfContinuousOpen_symm_apply - def Homeomorph.homeomorphOfContinuousClosed - def Homeomorph.homeomorphOfContinuousOpen - theorem Homeomorph.homeomorphOfContinuousOpen_apply - theorem Homeomorph.homeomorphOfContinuousOpen_symm_apply Modified Mathlib/Topology/Homeomorph/Lemmas.lean Modified Mathlib/Topology/IsLocalHomeomorph.lean Modified Mathlib/Topology/LocalAtTarget.lean Modified Mathlib/Topology/TietzeExtension.lean 2025-05-01 02:40:55 9bd9792 chore(Tactic/Linter): use logLint instead of logWarning (#24479) Also adds `logLint0Disable` for those linters which use nat-valued options. Linters should never use `logWarning` to report linter warnings; `logLint` ensures a consistent style for all linter warnings which includes in particular the name of the linter which is firing. ESTIMATED CHANGES Modified Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean Modified Mathlib/Tactic/CategoryTheory/Coherence/Datatypes.lean Modified Mathlib/Tactic/DeclarationNames.lean + def Mathlib.Linter.logLint0Disable Modified Mathlib/Tactic/Linter/HaveLetLinter.lean Modified Mathlib/Tactic/Linter/Style.lean Modified MathlibTest/HaveLetLinter.lean Modified MathlibTest/LintStyle.lean Modified MathlibTest/LongFile.lean 2025-05-01 02:12:32 203067e chore: whitespace adaptations (#24488) Found by #24465. ESTIMATED CHANGES Modified Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean Modified Mathlib/Algebra/Group/UniqueProds/Basic.lean Modified Mathlib/Algebra/Order/Floor/Defs.lean Modified Mathlib/Analysis/Calculus/FDeriv/Basic.lean +/- theorem HasFDerivWithinAt.of_nhdsWithin_eq_bot Modified Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean +/- theorem MeasureTheory.eLpNorm_le_eLpNorm_fderiv_of_eq_inner +/- theorem MeasureTheory.eLpNorm_le_eLpNorm_fderiv_one Modified Mathlib/CategoryTheory/Monoidal/Subcategory.lean Modified Mathlib/Computability/Language.lean Modified Mathlib/Condensed/TopCatAdjunction.lean +/- def CondensedSet.condensedSetToCompactlyGenerated +/- def CondensedSet.topCatAdjunctionCounit +/- def CondensedSet.topCatAdjunctionCounitEquiv +/- theorem CondensedSet.topCatAdjunctionCounit_bijective +/- def condensedSetToTopCat Modified Mathlib/RingTheory/Ideal/IsPrincipalPowQuotient.lean +/- def Ideal.quotEquivPowQuotPowSuccEquiv 2025-05-01 01:14:12 e052dad feat(Fin/Basic): add 2 simp attrs and a simp lemma (#24196) ESTIMATED CHANGES Modified Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean Modified Mathlib/Data/Fin/Basic.lean + theorem Fin.castSucc_ne_last +/- theorem Fin.predAbove_last_castSucc +/- theorem Fin.predAbove_zero_succ +/- theorem Fin.succ_succAbove_zero Modified Mathlib/Data/Fin/Tuple/Basic.lean Modified Mathlib/GroupTheory/Perm/Fin.lean Modified Mathlib/LinearAlgebra/Basis/Flag.lean Modified Mathlib/LinearAlgebra/InvariantBasisNumber.lean Modified Mathlib/Order/JordanHolder.lean Modified Mathlib/RingTheory/Idempotents.lean Modified Mathlib/RingTheory/NoetherNormalization.lean Modified MathlibTest/matrix.lean 2025-04-30 22:27:22 ffa0da4 chore(LpSeminorm/CompareExp): generalise to enormed spaces, part 1 (#24481) ESTIMATED CHANGES Modified Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean Modified Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean +/- theorem MeasureTheory.MemLp.mono_exponent +/- theorem MeasureTheory.MemLp.mono_exponent_of_measure_support_ne_top 2025-04-30 20:56:49 3f501c8 feat(AlgebraicGeometry): section of a k-scheme is a closed immersion (#23470) ESTIMATED CHANGES Modified Mathlib/AlgebraicGeometry/Limits.lean Modified Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean Modified Mathlib/AlgebraicGeometry/OpenImmersion.lean + theorem AlgebraicGeometry.IsOpenImmersion.isPullback_lift_id Modified Mathlib/AlgebraicGeometry/PullbackCarrier.lean + theorem AlgebraicGeometry.Scheme.isEmpty_pullback_iff Modified Mathlib/AlgebraicGeometry/Pullbacks.lean + theorem AlgebraicGeometry.Scheme.isEmpty_pullback Modified Mathlib/AlgebraicGeometry/Scheme.lean + theorem AlgebraicGeometry.Scheme.isEmpty_of_commSq 2025-04-30 18:37:04 2c6431a chore: add deprecation module message for recently deleted files (#24484) From #23654 ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/MeasureTheory/Integral/BochnerL1.lean Added Mathlib/MeasureTheory/Integral/FundThmCalculus.lean Added Mathlib/MeasureTheory/Integral/IntegrationByParts.lean Added Mathlib/MeasureTheory/Integral/VitaliCaratheodory.lean 2025-04-30 16:43:55 bcc1a2a feat(Algebra/Order/BigOperator): add lemmas (#23266) ESTIMATED CHANGES Modified Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean + theorem Finset.le_prod_of_submultiplicative_of_nonneg + theorem Finset.le_prod_of_submultiplicative_on_pred_of_nonneg Modified Mathlib/Algebra/Order/BigOperators/Ring/Multiset.lean + theorem Multiset.le_prod_of_submultiplicative_of_nonneg + theorem Multiset.le_prod_of_submultiplicative_on_pred_of_nonneg Modified Mathlib/Data/Finset/Max.lean + theorem Multiset.exists_max_image + theorem Multiset.exists_min_image 2025-04-30 15:39:58 53c38dd fix: write `≃ᴬ[k]` (instead of `≃ᵃL[k]`) for `ContinuousAffineEquiv` (#24357) This PR changes the notation for `ContinuousAffineEquiv` from `≃ᵃL[k]` to `≃ᴬ[k]`. This is consistent with the notation for `ContinuousAffineMap`, namely `→ᴬ[k]`. I would like to change the notation for continuous bundled functions in the future (see [#mathlib4 > RFC: notation for continuous maps in algebra](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/RFC.3A.20notation.20for.20continuous.20maps.20in.20algebra)), but before that we should at least have the `Map` and `Equiv` versions be consistent. ESTIMATED CHANGES Modified Mathlib/Analysis/Convex/AmpleSet.lean +/- theorem AmpleSet.image +/- theorem AmpleSet.image_iff +/- theorem AmpleSet.preimage +/- theorem AmpleSet.preimage_iff Modified Mathlib/LinearAlgebra/AffineSpace/ContinuousAffineEquiv.lean +/- def ContinuousAffineEquiv.Simps.apply +/- def ContinuousAffineEquiv.Simps.symm_apply +/- theorem ContinuousAffineEquiv.apply_eq_iff_eq +/- theorem ContinuousAffineEquiv.apply_eq_iff_eq_symm_apply +/- theorem ContinuousAffineEquiv.apply_symm_apply +/- theorem ContinuousAffineEquiv.coe_coe +/- theorem ContinuousAffineEquiv.coe_injective +/- theorem ContinuousAffineEquiv.coe_toContinuousAffineMap +/- theorem ContinuousAffineEquiv.coe_toEquiv +/- theorem ContinuousAffineEquiv.coe_trans +/- def ContinuousAffineEquiv.constVAdd +/- theorem ContinuousAffineEquiv.eq_symm_apply +/- theorem ContinuousAffineEquiv.ext +/- theorem ContinuousAffineEquiv.image_preimage +/- theorem ContinuousAffineEquiv.image_symm +/- theorem ContinuousAffineEquiv.image_symm_image +/- theorem ContinuousAffineEquiv.preimage_image +/- theorem ContinuousAffineEquiv.preimage_symm +/- def ContinuousAffineEquiv.refl +/- theorem ContinuousAffineEquiv.refl_trans +/- theorem ContinuousAffineEquiv.self_trans_symm +/- def ContinuousAffineEquiv.symm +/- theorem ContinuousAffineEquiv.symm_apply_apply +/- theorem ContinuousAffineEquiv.symm_apply_eq +/- theorem ContinuousAffineEquiv.symm_bijective +/- theorem ContinuousAffineEquiv.symm_image_image +/- theorem ContinuousAffineEquiv.symm_symm +/- theorem ContinuousAffineEquiv.symm_symm_apply +/- theorem ContinuousAffineEquiv.symm_toAffineEquiv +/- theorem ContinuousAffineEquiv.symm_toEquiv +/- theorem ContinuousAffineEquiv.symm_trans_self +/- theorem ContinuousAffineEquiv.toAffineEquiv_injective +/- def ContinuousAffineEquiv.toContinuousAffineMap +/- theorem ContinuousAffineEquiv.toContinuousAffineMap_toAffineMap +/- theorem ContinuousAffineEquiv.toContinuousAffineMap_toContinuousMap +/- def ContinuousAffineEquiv.toHomeomorph +/- def ContinuousAffineEquiv.trans +/- theorem ContinuousAffineEquiv.trans_apply +/- theorem ContinuousAffineEquiv.trans_assoc +/- theorem ContinuousAffineEquiv.trans_refl +/- theorem ContinuousAffineEquiv.trans_toContinuousAffineMap +/- def ContinuousLinearEquiv.toContinuousAffineEquiv 2025-04-30 15:39:56 6a8f791 feat: generalise nondegeneracy of root pairing forms to allow coefficients in subring (#23329) This PR adds generalized versions of existing results, where the original base ring is no longer necessarily linearly ordered, but is an algebra over a LinearOrderedCommRing. ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/LinearAlgebra/RootSystem/Base.lean Modified Mathlib/LinearAlgebra/RootSystem/BaseChange.lean Modified Mathlib/LinearAlgebra/RootSystem/Defs.lean - theorem RootPairing.IsValuedIn.trans - theorem RootPairing.algebraMap_coxeterWeightIn - theorem RootPairing.algebraMap_pairingIn - theorem RootPairing.coroot'_apply_apply_mem_of_mem_span - theorem RootPairing.corootSpan_dualAnnihilator_map_eq - theorem RootPairing.corootSpan_dualAnnihilator_map_eq_iInf_ker_coroot' - theorem RootPairing.corootSpan_map_toDualRight - theorem RootPairing.corootSpan_mem_invtSubmodule_coreflection - theorem RootPairing.corootSpan_ne_bot - def RootPairing.coxeterWeightIn - theorem RootPairing.iInf_ker_coroot'_eq - theorem RootPairing.iInf_ker_root'_eq - theorem RootPairing.isValuedIn_iff_mem_range - def RootPairing.pairingIn - theorem RootPairing.pairingIn_reflection_perm_self_left - theorem RootPairing.pairingIn_reflection_perm_self_right - theorem RootPairing.pairingIn_same - theorem RootPairing.root'_apply_apply_mem_of_mem_span - theorem RootPairing.rootSpan_dualAnnihilator_map_eq - theorem RootPairing.rootSpan_dualAnnihilator_map_eq_iInf_ker_root' - theorem RootPairing.rootSpan_map_toDualLeft - theorem RootPairing.rootSpan_mem_invtSubmodule_reflection - theorem RootPairing.rootSpan_ne_bot - theorem RootPairing.span_coroot'_eq_top - theorem RootPairing.span_root'_eq_top Modified Mathlib/LinearAlgebra/RootSystem/Finite/CanonicalBilinear.lean + def RootPairing.CoPolarizationIn + theorem RootPairing.CoPolarizationIn_apply + theorem RootPairing.CoPolarizationIn_eq + def RootPairing.PolarizationIn + theorem RootPairing.PolarizationIn_apply + theorem RootPairing.PolarizationIn_eq + def RootPairing.RootFormIn + theorem RootPairing.algebraMap_posRootForm_posForm + theorem RootPairing.algebraMap_rootFormIn +/- theorem RootPairing.exists_ge_zero_eq_rootForm +/- def RootPairing.posRootForm + theorem RootPairing.posRootForm_eq + theorem RootPairing.posRootForm_posForm_apply_apply + theorem RootPairing.prod_rootFormIn_smul_coroot_mem_range_PolarizationIn + theorem RootPairing.range_polarizationIn + theorem RootPairing.range_polarizationIn_le_span_coroot + theorem RootPairing.rootFormIn_self_smul_coroot + theorem RootPairing.toPerfectPairing_apply_PolarizationIn + theorem RootPairing.zero_le_posForm Modified Mathlib/LinearAlgebra/RootSystem/Finite/Lemmas.lean Modified Mathlib/LinearAlgebra/RootSystem/Finite/Nondegenerate.lean + theorem RootPairing.exists_coroot_ne + theorem RootPairing.finrank_corootSpan_eq' +/- theorem RootPairing.finrank_corootSpan_eq + theorem RootPairing.finrank_range_polarization_eq_finrank_span_coroot + theorem RootPairing.polarizationIn_Injective + theorem RootPairing.posRootForm_posForm_anisotropic + theorem RootPairing.posRootForm_posForm_nondegenerate + theorem RootPairing.posRootForm_posForm_pos_of_ne_zero +/- theorem RootPairing.rootForm_pos_of_ne_zero Modified Mathlib/LinearAlgebra/RootSystem/Irreducible.lean Added Mathlib/LinearAlgebra/RootSystem/IsValuedIn.lean + theorem RootPairing.IsValuedIn.trans + theorem RootPairing.algebraMap_coroot'In_apply + theorem RootPairing.algebraMap_coxeterWeightIn + theorem RootPairing.algebraMap_pairingIn + theorem RootPairing.algebraMap_root'In_apply + def RootPairing.coroot'In + theorem RootPairing.coroot'In_rootSpanMem_eq_pairingIn + theorem RootPairing.coroot'_apply_apply_mem_of_mem_span + theorem RootPairing.corootSpan_dualAnnihilator_map_eq + theorem RootPairing.corootSpan_dualAnnihilator_map_eq_iInf_ker_coroot' + theorem RootPairing.corootSpan_map_toDualRight + theorem RootPairing.corootSpan_mem_invtSubmodule_coreflection + theorem RootPairing.corootSpan_ne_bot + def RootPairing.coxeterWeightIn + theorem RootPairing.iInf_ker_coroot'_eq + theorem RootPairing.iInf_ker_root'_eq + theorem RootPairing.isValuedIn_iff_mem_range + def RootPairing.pairingIn + theorem RootPairing.pairingIn_reflection_perm + theorem RootPairing.pairingIn_reflection_perm_self_left + theorem RootPairing.pairingIn_reflection_perm_self_right + theorem RootPairing.pairingIn_same + def RootPairing.root'In + theorem RootPairing.root'In_corootSpanMem_eq_pairingIn + theorem RootPairing.root'_apply_apply_mem_of_mem_span + theorem RootPairing.rootSpan_dualAnnihilator_map_eq + theorem RootPairing.rootSpan_dualAnnihilator_map_eq_iInf_ker_root' + theorem RootPairing.rootSpan_map_toDualLeft + theorem RootPairing.rootSpan_mem_invtSubmodule_reflection + theorem RootPairing.rootSpan_ne_bot + theorem RootPairing.span_coroot'_eq_top + theorem RootPairing.span_root'_eq_top Modified Mathlib/LinearAlgebra/RootSystem/Reduced.lean Modified Mathlib/LinearAlgebra/RootSystem/RootPositive.lean 2025-04-30 14:55:24 c8dd625 chore: use modern config syntax (#24469) For example, `simp +contextual` is much more readable than `simp (config := { contextual := true })`. This PR replaces about 150 occurrences; mathlib has another 200 occurrences remaining. (Two dozen of those are from the "apply with" tactic, which doesn't support modern syntax yet.) Helps with auto-formatting: the spacing was not quite uniform in mathlib. ESTIMATED CHANGES Modified Mathlib/Algebra/AddConstMap/Equiv.lean Modified Mathlib/Algebra/BigOperators/Fin.lean Modified Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean Modified Mathlib/Algebra/Category/Grp/AB.lean Modified Mathlib/Algebra/CharZero/Quotient.lean Modified Mathlib/Algebra/Group/Action/End.lean Modified Mathlib/Algebra/Group/Submonoid/Operations.lean Modified Mathlib/Algebra/Group/Subsemigroup/Operations.lean Modified Mathlib/Algebra/GroupWithZero/Action/Basic.lean Modified Mathlib/Algebra/GroupWithZero/Units/Equiv.lean Modified Mathlib/Algebra/Homology/LocalCohomology.lean Modified Mathlib/Algebra/Module/Submodule/RestrictScalars.lean Modified Mathlib/Algebra/MonoidAlgebra/Defs.lean Modified Mathlib/Algebra/Order/Group/OrderIso.lean Modified Mathlib/Algebra/Order/GroupWithZero/Canonical.lean Modified Mathlib/Algebra/Order/GroupWithZero/Unbundled/OrderIso.lean Modified Mathlib/Algebra/Order/Interval/Set/Group.lean Modified Mathlib/Algebra/Ring/AddAut.lean Modified Mathlib/Analysis/Analytic/ChangeOrigin.lean Modified Mathlib/Analysis/Analytic/Composition.lean Modified Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean Modified Mathlib/Analysis/BoxIntegral/Box/Basic.lean Modified Mathlib/Analysis/BoxIntegral/Partition/Split.lean Modified Mathlib/Analysis/Complex/Basic.lean Modified Mathlib/Analysis/Convolution.lean Modified Mathlib/Analysis/Normed/Field/Lemmas.lean Modified Mathlib/Analysis/SpecialFunctions/Log/Basic.lean Modified Mathlib/CategoryTheory/Category/KleisliCat.lean Modified Mathlib/CategoryTheory/GlueData.lean Modified Mathlib/CategoryTheory/Limits/Shapes/SequentialProduct.lean Modified Mathlib/CategoryTheory/Preadditive/Mat.lean Modified Mathlib/CategoryTheory/Sites/Coherent/ExtensiveColimits.lean Modified Mathlib/Combinatorics/Quiver/Covering.lean Modified Mathlib/Combinatorics/SimpleGraph/Regularity/Increment.lean Modified Mathlib/Control/Basic.lean Modified Mathlib/Control/Functor/Multivariate.lean Modified Mathlib/Data/Complex/Basic.lean Modified Mathlib/Data/Complex/Module.lean Modified Mathlib/Data/Fin/Tuple/Basic.lean Modified Mathlib/Data/Fintype/Pi.lean Modified Mathlib/Data/Holor.lean Modified Mathlib/Data/List/Chain.lean Modified Mathlib/Data/List/EditDistance/Defs.lean Modified Mathlib/Data/List/Indexes.lean Modified Mathlib/Data/List/Nodup.lean Modified Mathlib/Data/List/Permutation.lean Modified Mathlib/Data/Matroid/Closure.lean Modified Mathlib/Data/Matroid/Constructions.lean Modified Mathlib/Data/QPF/Multivariate/Constructions/Comp.lean Modified Mathlib/Data/QPF/Univariate/Basic.lean Modified Mathlib/Data/Rel.lean +/- theorem Function.graph_id Modified Mathlib/Data/Set/Piecewise.lean Modified Mathlib/Data/Stream/Init.lean Modified Mathlib/Data/Sym/Sym2.lean Modified Mathlib/Data/WSeq/Relation.lean Modified Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean Modified Mathlib/Geometry/Manifold/VectorBundle/Basic.lean Modified Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean Modified Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean Modified Mathlib/GroupTheory/CoprodI.lean Modified Mathlib/LinearAlgebra/Basis/Defs.lean Modified Mathlib/LinearAlgebra/Multilinear/Basic.lean Modified Mathlib/LinearAlgebra/Pi.lean Modified Mathlib/LinearAlgebra/QuadraticForm/Basic.lean Modified Mathlib/LinearAlgebra/QuadraticForm/IsometryEquiv.lean Modified Mathlib/Logic/Basic.lean Modified Mathlib/Logic/Embedding/Basic.lean Modified Mathlib/MeasureTheory/Function/SimpleFunc.lean Modified Mathlib/MeasureTheory/Integral/CircleIntegral.lean Modified Mathlib/MeasureTheory/Integral/TorusIntegral.lean Modified Mathlib/MeasureTheory/OuterMeasure/Induced.lean Modified Mathlib/NumberTheory/NumberField/House.lean Modified Mathlib/NumberTheory/Padics/RingHoms.lean Modified Mathlib/Order/Closure.lean Modified Mathlib/Order/Hom/Basic.lean Modified Mathlib/Order/Interval/Set/OrdConnectedComponent.lean Modified Mathlib/Order/Minimal.lean Modified Mathlib/Order/SuccPred/Archimedean.lean Modified Mathlib/Probability/Kernel/Composition/CompProd.lean Modified Mathlib/Probability/Martingale/BorelCantelli.lean Modified Mathlib/Probability/Martingale/Upcrossing.lean Modified Mathlib/Probability/StrongLaw.lean Modified Mathlib/RepresentationTheory/GroupCohomology/Resolution.lean Modified Mathlib/RingTheory/Unramified/Finite.lean Modified Mathlib/RingTheory/Valuation/Basic.lean Modified Mathlib/RingTheory/WittVector/Basic.lean Modified Mathlib/RingTheory/WittVector/IsPoly.lean Modified Mathlib/SetTheory/Ordinal/Family.lean Modified Mathlib/Topology/Algebra/Group/Basic.lean Modified Mathlib/Topology/Algebra/Module/Alternating/Basic.lean Modified Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean Modified Mathlib/Topology/Algebra/Monoid.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Basic.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Induction.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Successor.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/ZeroLimit.lean Modified Mathlib/Topology/Constructions.lean Modified Mathlib/Topology/ContinuousMap/Basic.lean Modified Mathlib/Topology/Exterior.lean Modified Mathlib/Topology/MetricSpace/GromovHausdorff.lean Modified Mathlib/Topology/MetricSpace/Isometry.lean Modified Mathlib/Topology/MetricSpace/ThickenedIndicator.lean Modified Mathlib/Topology/UniformSpace/Pi.lean 2025-04-30 14:55:23 0f346fa fix: warn if to_additive helper functions try to reorder lists that are too small (#24329) Currently, code like the following, which attempts to permute arguments out of the range of the argument list, causes a panic in the helper functions `reorderForall` and `reorderLambda`: ```lean @[to_additive (reorder := 3 4 51)] def reorderMulThree' {α : Type _} [Mul α] (x y z : α) : α := x * y * z ``` We change from using `forallTelescope` and `lambdaTelescope` to their bounded versions `forallBoundedTelescope` and `lambdaBoundedTelescope` with an explicit bound which ensures that we always expand as much as possible, and also add a warning if the bound does not match the size of the argument list. Extracted from #21719 ESTIMATED CHANGES Modified Mathlib/Tactic/ToAdditive/Frontend.lean Modified MathlibTest/toAdditive.lean + def Test.reorderMulThree' 2025-04-30 14:12:58 4505602 chore: update Mathlib dependencies 2025-04-30 (#24475) This PR updates the Mathlib dependencies. ESTIMATED CHANGES Modified lake-manifest.json 2025-04-30 13:43:47 4a5bed5 feat: a continuous meromorphic function is analytic (#24370) We also characterize the order of a meromorphic function being `< 0`, or `= 0`, or `> 0`, as the convergence of the function to infinity, resp. a nonzero constant, resp. zero. This is used to generalize `analyticAt_mem_codiscreteWithin`, and from there remove completeness assumptions throughout the meromorphic functions theory. ESTIMATED CHANGES Modified Mathlib/Analysis/Analytic/Basic.lean Modified Mathlib/Analysis/Meromorphic/Basic.lean + theorem MeromorphicAt.eventually_continuousAt - theorem MeromorphicOn.analyticAt_mem_codiscreteWithin Modified Mathlib/Analysis/Meromorphic/Divisor.lean +/- theorem MeromorphicOn.divisor_inv +/- theorem MeromorphicOn.divisor_mul +/- theorem MeromorphicOn.divisor_smul Modified Mathlib/Analysis/Meromorphic/NormalForm.lean +/- theorem MeromorphicNFOn.divisor_nonneg_iff_analyticOnNhd +/- theorem MeromorphicNFOn.zero_set_eq_divisor_support +/- theorem MeromorphicOn.divisor_of_toMeromorphicNFOn +/- theorem MeromorphicOn.meromorphicNFAt_mem_codiscreteWithin +/- theorem MeromorphicOn.toMeromorphicNFOn_eq_self_on_nhdNE +/- theorem meromorphicNFOn_toMeromorphicNFOn +/- theorem order_toMeromorphicNFOn +/- theorem toMeromorphicNFOn_eqOn_codiscrete +/- theorem toMeromorphicNFOn_eq_self +/- theorem toMeromorphicNFOn_eq_toMeromorphicNFAt +/- theorem toMeromorphicNFOn_eq_toMeromorphicNFAt_on_nhd Modified Mathlib/Analysis/Meromorphic/Order.lean + theorem MeromorphicAt.tendsto_cobounded_iff_order_neg + theorem MeromorphicAt.tendsto_cobounded_of_order_neg + theorem MeromorphicAt.tendsto_ne_zero_iff_order_eq_zero + theorem MeromorphicAt.tendsto_ne_zero_of_order_eq_zero + theorem MeromorphicAt.tendsto_nhds_iff_order_nonneg + theorem MeromorphicAt.tendsto_nhds_of_order_nonneg + theorem MeromorphicAt.tendsto_zero_iff_order_pos + theorem MeromorphicAt.tendsto_zero_of_order_pos + theorem MeromorphicOn.analyticAt_mem_codiscreteWithin +/- theorem MeromorphicOn.codiscrete_setOf_order_eq_zero_or_top + theorem MeromorphicOn.eventually_analyticAt + theorem MeromorphicOn.eventually_analyticAt_or_mem_compl 2025-04-30 13:43:45 fafe840 chore: use Std.TreeMap in `linarith` (#24367) This PR avoids use of `Batteries.RBMap` in the implementation of `linarith`, where the new `Std.TreeMap` suffices. ESTIMATED CHANGES Modified Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean + def Std.TreeSet.sdiff + def Std.TreeSet.union Modified Mathlib/Tactic/Linarith/Parsing.lean +/- def Linarith.Monom.one +/- def Linarith.Sum.one +/- def Linarith.one + def Std.TreeMap.beq 2025-04-30 12:59:49 78ec36c chore: more whitespace fixes (#24472) Found by the upcoming linter in #24465. ESTIMATED CHANGES Modified Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean +/- theorem AlgHom.eqOn_adjoin_iff Modified Mathlib/Algebra/BigOperators/Finsupp/Basic.lean Modified Mathlib/Algebra/Category/ModuleCat/Sheaf.lean Modified Mathlib/Algebra/Category/MonCat/Limits.lean Modified Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean Modified Mathlib/Algebra/Group/UniqueProds/Basic.lean Modified Mathlib/Algebra/Homology/BifunctorAssociator.lean Modified Mathlib/Algebra/Homology/HomotopyCategory/MappingCone.lean Modified Mathlib/Algebra/Homology/LocalCohomology.lean +/- def localCohomology.isoSelfLERadical Modified Mathlib/Algebra/Homology/Localization.lean Modified Mathlib/Algebra/Homology/Square.lean Modified Mathlib/Algebra/Module/LocalizedModule/AtPrime.lean Modified Mathlib/Algebra/Module/LocalizedModule/Away.lean Modified Mathlib/Algebra/Order/Hom/Basic.lean Modified Mathlib/Algebra/Quaternion.lean +/- def QuaternionAlgebra.equivProd +/- def QuaternionAlgebra.equivTuple Modified Mathlib/Algebra/Ring/Subring/Basic.lean Modified Mathlib/Algebra/Ring/Subsemiring/Basic.lean Modified Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean +/- def SimplexCategory.factor_δ +/- def SimplexCategory.mkOfLe Modified Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean +/- def SSet.stdSimplex.const +/- def SSet.stdSimplex.edge +/- def SSet.stdSimplex.triangle Modified Mathlib/CategoryTheory/Bicategory/Functor/Lax.lean +/- structure CategoryTheory.LaxFunctor Modified Mathlib/CategoryTheory/Comma/Over/Pullback.lean Modified Mathlib/CategoryTheory/Grothendieck.lean +/- def CategoryTheory.Grothendieck.functor Modified Mathlib/CategoryTheory/Limits/Preserves/Shapes/Pullbacks.lean Modified Mathlib/CategoryTheory/Monoidal/Subcategory.lean +/- theorem CategoryTheory.ObjectProperty.ihom_map Modified Mathlib/CategoryTheory/ObjectProperty/FullSubcategory.lean +/- theorem CategoryTheory.ObjectProperty.FullSubcategory.lift_comp_inclusion_eq Modified Mathlib/CategoryTheory/Shift/Opposite.lean Modified Mathlib/Combinatorics/Enumerative/Composition.lean +/- theorem Composition.sigma_eq_iff_blocks_eq Modified Mathlib/Condensed/TopCatAdjunction.lean +/- def CondensedSet.compactlyGeneratedAdjunctionCounitHomeo Modified Mathlib/Condensed/TopComparison.lean Modified Mathlib/Data/ENNReal/Inv.lean +/- def ENNReal.mulLeftOrderIso +/- def ENNReal.mulRightOrderIso Modified Mathlib/Data/Finset/Lattice/Fold.lean Modified Mathlib/Data/Finsupp/Basic.lean +/- def Finsupp.splitSupport Modified Mathlib/Data/Matrix/Basis.lean Modified Mathlib/Data/Matrix/Invertible.lean +/- theorem Matrix.invOf_add_mul_mul +/- def Matrix.invertibleAddMulMul Modified Mathlib/Data/Real/Sqrt.lean Modified Mathlib/Data/W/Basic.lean +/- def WType.elim Modified Mathlib/FieldTheory/Minpoly/IsConjRoot.lean +/- theorem IsConjRoot.trans Modified Mathlib/GroupTheory/NoncommPiCoprod.lean Modified Mathlib/GroupTheory/Perm/Sign.lean +/- def Equiv.Perm.signBijAux Modified Mathlib/LinearAlgebra/BilinearForm/TensorProduct.lean Modified Mathlib/LinearAlgebra/Finsupp/VectorSpace.lean +/- theorem Basis.repr_smul' Modified Mathlib/LinearAlgebra/FreeModule/Basic.lean +/- theorem Module.free_def Modified Mathlib/Order/WellFoundedSet.lean Modified Mathlib/RingTheory/Derivation/ToSquareZero.lean +/- def derivationToSquareZeroOfLift +/- def liftOfDerivationToSquareZero Modified Mathlib/RingTheory/NonUnitalSubring/Basic.lean Modified Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean Modified Mathlib/RingTheory/Polynomial/Eisenstein/Criterion.lean Modified Mathlib/Tactic/Linarith/Lemmas.lean +/- theorem Linarith.sub_neg_of_lt Modified Mathlib/Topology/Category/CompHausLike/Limits.lean +/- def CompHausLike.isTerminalPUnit Modified Mathlib/Topology/Category/TopCat/Limits/Basic.lean +/- def TopCat.coconeOfCoconeForget Modified Mathlib/Topology/Constructions/SumProd.lean Modified Mathlib/Topology/Sheaves/SheafCondition/Sites.lean +/- theorem TopCat.Presheaf.coveringOfPresieve_apply 2025-04-30 12:59:47 c80f685 fix(Tactic/Polyrith): correct `Quote ℤ` instance (#24470) Fixes the `Quote ℤ` instance to make it return the correct value on negatives. This doesn't actually break anything yet, but could become problematic in the future. ESTIMATED CHANGES Modified Mathlib/Tactic/Polyrith.lean 2025-04-30 12:59:46 dbb2b01 fix: formatting of discover-lean-pr-testing.yml messages (#24468) ESTIMATED CHANGES Modified .github/workflows/discover-lean-pr-testing.yml 2025-04-30 12:59:44 ad93d6e style: further whitespace fixes (#24467) Found by the upcoming linter in #24465. ESTIMATED CHANGES Modified Mathlib/Algebra/Module/ZLattice/Covolume.lean Modified Mathlib/Algebra/Star/Subsemiring.lean +/- def StarSubsemiring.center Modified Mathlib/Algebra/Vertex/HVertexOperator.lean Modified Mathlib/AlgebraicTopology/SimplicialSet/Horn.lean +/- def SSet.horn.edge +/- def SSet.horn.edge₃ +/- def SSet.horn.face +/- def SSet.horn.primitiveEdge +/- def SSet.horn.primitiveTriangle Modified Mathlib/Analysis/Analytic/Linear.lean +/- theorem analyticAt_fst Modified Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean Modified Mathlib/Analysis/Convex/Body.lean +/- theorem ConvexBody.zero_mem_of_symmetric Modified Mathlib/Analysis/Fourier/FourierTransformDeriv.lean Modified Mathlib/Analysis/MellinTransform.lean Modified Mathlib/Analysis/Normed/Field/WithAbs.lean +/- theorem AbsoluteValue.Completion.locallyCompactSpace Modified Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean Modified Mathlib/CategoryTheory/Category/ReflQuiv.lean +/- def CategoryTheory.ReflQuiv.isoOfEquiv Modified Mathlib/CategoryTheory/ChosenFiniteProducts/Cat.lean +/- def CategoryTheory.Cat.prodCone Modified Mathlib/CategoryTheory/ConnectedComponents.lean +/- def CategoryTheory.ConnectedComponents.functorToDiscrete +/- def CategoryTheory.ConnectedComponents.liftFunctor Modified Mathlib/CategoryTheory/FiberedCategory/Fibered.lean Modified Mathlib/CategoryTheory/Localization/Pi.lean Modified Mathlib/CategoryTheory/WithTerminal/Basic.lean +/- def CategoryTheory.WithInitial.mkCommaMorphism +/- def CategoryTheory.WithInitial.ofCommaMorphism +/- def CategoryTheory.WithTerminal.mkCommaMorphism +/- def CategoryTheory.WithTerminal.ofCommaMorphism Modified Mathlib/Combinatorics/SimpleGraph/Clique.lean +/- theorem SimpleGraph.isIndepSet_neighborSet_of_triangleFree Modified Mathlib/Data/MLList/BestFirst.lean Modified Mathlib/Data/Matroid/IndepAxioms.lean Modified Mathlib/FieldTheory/Minpoly/IsConjRoot.lean +/- theorem IsConjRoot.exists_algEquiv Modified Mathlib/FieldTheory/Normal/Basic.lean +/- theorem minpoly.exists_algEquiv_of_root' Modified Mathlib/Geometry/Manifold/Algebra/Structures.lean +/- theorem topologicalSemiring_of_contMDiffRing Modified Mathlib/Geometry/Manifold/ChartedSpace.lean Modified Mathlib/Geometry/Manifold/VectorBundle/Basic.lean Modified Mathlib/GroupTheory/GroupExtension/Basic.lean Modified Mathlib/GroupTheory/GroupExtension/Defs.lean Modified Mathlib/GroupTheory/SemidirectProduct.lean Modified Mathlib/LinearAlgebra/FreeProduct/Basic.lean +/- theorem DirectSum.induction_lon Modified Mathlib/LinearAlgebra/Matrix/Spectrum.lean Modified Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean Modified Mathlib/MeasureTheory/Group/MeasurableEquiv.lean Modified Mathlib/MeasureTheory/Integral/Asymptotics.lean Modified Mathlib/MeasureTheory/Integral/MeanInequalities.lean Modified Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean +/- theorem measurable_update' Modified Mathlib/MeasureTheory/MeasurableSpace/EventuallyMeasurable.lean +/- def EventuallyMeasurableSet Modified Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean +/- theorem Basis.parallelepiped_eq_map Modified Mathlib/MeasureTheory/Measure/Regular.lean Modified Mathlib/Order/LiminfLimsup.lean Modified Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean +/- def ProfiniteGrp.ofClosedSubgroup Modified Mathlib/Topology/Algebra/OpenSubgroup.lean +/- theorem Subgroup.isOpen_of_one_mem_interior Modified Mathlib/Topology/Algebra/Valued/WithVal.lean Modified Mathlib/Topology/ContinuousMap/Algebra.lean Modified Mathlib/Topology/ContinuousMap/Bounded/Normed.lean Modified Mathlib/Topology/LocallyConstant/Algebra.lean +/- def LocallyConstant.comapMonoidHom Modified Mathlib/Topology/MetricSpace/Dilation.lean Modified Mathlib/Topology/MetricSpace/Gluing.lean +/- def Metric.inductiveLimitDist +/- theorem Metric.inductiveLimitDist_eq_dist Modified Mathlib/Topology/Sheaves/SheafCondition/Sites.lean +/- def TopCat.Presheaf.presieveOfCovering.indexOfHom +/- theorem TopCat.Presheaf.presieveOfCovering.indexOfHom_spec 2025-04-30 12:59:43 952f77f perf(aesop_cat): use `apply_rfl` in `rfl_cat` (#24458) `rfl` is a macro that calls both `eq_rfl` and `apply_rfl` (for backwards compatability reasons). When `rfl` succeeds this is no problem. But if `rfl` fails, it takes twice as long to fail. Since `rfl_cat` is intended to fail often, I let it call `apply_rfl` directly instead of `rfl`. ESTIMATED CHANGES Modified Mathlib/CategoryTheory/Category/Basic.lean 2025-04-30 12:12:16 5b76dec feat(Combinatorics/SimpleGraph): part of Tutte's theorem (#22119) Adds three key parts of the proof of Tutte's theorem, with some supporting lemma's: - necessity of the Tutte condition (`not_isTutteViolator`) - the fact that the empty set violates the Tutte condition if the number of vertices is odd (`IsTutteViolator.empty`) - the construction of a perfect matching in a graph that decomposes into cliques (`Subgraph.IsPerfectMatching.exists_of_isClique_supp`) Definitions added: `IsTutteViolator`. ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/Represents.lean + theorem SimpleGraph.ConnectedComponent.Represents.ConnectedComponent.even_ncard_supp_sdiff_rep + theorem SimpleGraph.ConnectedComponent.Represents.ncard_eq Modified Mathlib/Combinatorics/SimpleGraph/Matching.lean + theorem SimpleGraph.IsClique.even_iff_exists_isMatching + theorem SimpleGraph.Subgraph.IsMatching.eq_of_adj_left + theorem SimpleGraph.Subgraph.IsMatching.eq_of_adj_right +/- theorem SimpleGraph.Subgraph.IsMatching.not_adj_left_of_ne +/- theorem SimpleGraph.Subgraph.IsMatching.not_adj_right_of_ne Added Mathlib/Combinatorics/SimpleGraph/Tutte.lean + theorem SimpleGraph.IsTutteViolator.empty + def SimpleGraph.IsTutteViolator + theorem SimpleGraph.Subgraph.IsPerfectMatching.exists_of_isClique_supp + theorem SimpleGraph.not_isTutteViolator_of_isPerfectMatching Modified Mathlib/Combinatorics/SimpleGraph/UniversalVerts.lean + theorem SimpleGraph.disjoint_image_val_universalVerts + theorem SimpleGraph.even_ncard_image_val_supp_sdiff_image_val_rep_union Modified Mathlib/Data/Set/Card.lean + theorem Set.even_ncard_compl_iff + theorem Set.odd_ncard_compl_iff 2025-04-30 12:12:15 d8c00d3 feat(LinearAlgebra/PiTensorProduct): dependent version of tmulEquiv (#18534) Given a family of `R`-modules `N` indexed by `ι ⊕ ι'`, we obtain a linear equivalence `tmulEquivDep : (⨂[R] i₁, N (.inl i₁)) ⊗[R] (⨂[R] i₂, N (.inr i₂)) ≃ₗ[R] ⨂[R] i, N i`, which generalizes `tmulEquiv` (which is the case all `N i` are the same module). ESTIMATED CHANGES Modified Mathlib/Data/Sum/Basic.lean + theorem Sum.update_inl_apply_inl' + theorem Sum.update_inr_apply_inr' Modified Mathlib/LinearAlgebra/Multilinear/Basic.lean Modified Mathlib/LinearAlgebra/Multilinear/Curry.lean +/- theorem MultilinearMap.coe_currySumEquiv +/- theorem MultilinearMap.coe_currySumEquiv_symm +/- def MultilinearMap.currySum +/- def MultilinearMap.currySumEquiv + theorem MultilinearMap.currySum_add + theorem MultilinearMap.currySum_apply' +/- theorem MultilinearMap.currySum_apply + theorem MultilinearMap.currySum_smul + theorem MultilinearMap.currySum_uncurrySum +/- def MultilinearMap.uncurrySum + theorem MultilinearMap.uncurrySum_add + theorem MultilinearMap.uncurrySum_apply - theorem MultilinearMap.uncurrySum_aux_apply + theorem MultilinearMap.uncurrySum_currySum + theorem MultilinearMap.uncurrySum_smul Modified Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean + def MultilinearMap.domCoprodDep' + theorem MultilinearMap.domCoprodDep'_apply + def MultilinearMap.domCoprodDep Modified Mathlib/LinearAlgebra/PiTensorProduct.lean +/- def PiTensorProduct.tmulEquiv + def PiTensorProduct.tmulEquivDep + theorem PiTensorProduct.tmulEquivDep_apply + theorem PiTensorProduct.tmulEquivDep_symm_apply Modified Mathlib/Logic/Function/Basic.lean + theorem Function.update_apply_of_injective 2025-04-30 10:47:23 d31099d feat(QuotientGroup): surjectivity and kernel of `QuotientGroup.map` (#23205) Prove formulas for the kernel of `QuotientGroup.lift` and `QuotientGroup.map` and that these maps are surjective if the corresponding functions are surjective. ESTIMATED CHANGES Modified Mathlib/Algebra/Group/Subgroup/Ker.lean +/- theorem MonoidHom.comap_ker + theorem MonoidHom.ker_toSubmonoid Modified Mathlib/Algebra/Group/Subgroup/Map.lean + theorem Subgroup.map_toSubmonoid Modified Mathlib/Algebra/Group/Submonoid/Operations.lean + theorem Submonoid.map_comap_eq_self_of_surjective Modified Mathlib/Data/Quot.lean + theorem Quotient.lift_surjective + theorem Quotient.lift_surjective_iff Modified Mathlib/GroupTheory/QuotientGroup/Defs.lean + theorem QuotientGroup.ker_lift + theorem QuotientGroup.ker_map + theorem QuotientGroup.lift_comp_mk' + theorem QuotientGroup.lift_surjective_of_surjective + theorem QuotientGroup.map_surjective_of_surjective 2025-04-30 09:03:52 819ba93 feat(FDeriv/Basic): add `HasFDerivWithinAt.of_finite` (#24466) ... and some corollaries ESTIMATED CHANGES Modified Mathlib/Analysis/Calculus/FDeriv/Basic.lean + theorem DifferentiableWithinAt.of_finite + theorem DifferentiableWithinAt.of_subsingleton + theorem HasFDerivWithinAt.of_finite + theorem HasFDerivWithinAt.of_subsingleton 2025-04-30 09:03:50 9525089 chore: `erw` in `Topology/Order/` (#23336) ESTIMATED CHANGES Modified Mathlib/Topology/Order/LawsonTopology.lean Modified Mathlib/Topology/Order/LowerUpperTopology.lean Modified Mathlib/Topology/Order/ScottTopology.lean Modified Mathlib/Topology/Order/UpperLowerSetTopology.lean 2025-04-30 08:14:09 d801031 chore: prepare for the next lean version bump (#24449) ESTIMATED CHANGES Modified Archive/Imo/Imo1998Q2.lean Modified Archive/Imo/Imo2008Q3.lean Modified Mathlib/Algebra/ContinuedFractions/Computation/TerminatesIffRat.lean Modified Mathlib/Algebra/GCDMonoid/Nat.lean Modified Mathlib/Algebra/Group/Basic.lean Modified Mathlib/Algebra/Group/Int/Defs.lean Modified Mathlib/Algebra/Group/WithOne/Defs.lean Modified Mathlib/Algebra/GroupWithZero/Basic.lean Modified Mathlib/Algebra/Homology/Embedding/Connect.lean Modified Mathlib/Algebra/Polynomial/Laurent.lean Modified Mathlib/Analysis/Calculus/Deriv/ZPow.lean Modified Mathlib/Analysis/SpecialFunctions/Integrals.lean Modified Mathlib/CategoryTheory/Localization/Construction.lean Modified Mathlib/Combinatorics/Derangements/Finite.lean Modified Mathlib/Computability/Tape.lean Modified Mathlib/Data/ENNReal/Inv.lean Modified Mathlib/Data/Fin/Basic.lean Modified Mathlib/Data/Int/Basic.lean Modified Mathlib/Data/Int/Bitwise.lean Modified Mathlib/Data/Int/Cast/Basic.lean Modified Mathlib/Data/Int/DivMod.lean + theorem Int.add_emod_left + theorem Int.add_emod_right + theorem Int.natCast_emod + theorem Int.sub_emod_right Modified Mathlib/Data/Int/GCD.lean Modified Mathlib/Data/Int/Init.lean +/- theorem Int.natCast_div +/- theorem Int.natCast_ediv Modified Mathlib/Data/Int/Interval.lean Modified Mathlib/Data/Int/Sqrt.lean Modified Mathlib/Data/List/Perm/Lattice.lean Modified Mathlib/Data/NNRat/Floor.lean Modified Mathlib/Data/Nat/Init.lean + theorem Nat.not_dvd_iff_lt_mul_succ Modified Mathlib/Data/Nat/ModEq.lean Modified Mathlib/Data/Nat/Multiplicity.lean Modified Mathlib/Data/Nat/Prime/Int.lean Modified Mathlib/Data/Option/Defs.lean Modified Mathlib/Data/PFun.lean Modified Mathlib/Data/ZMod/Basic.lean Modified Mathlib/Dynamics/PeriodicPts/Defs.lean Modified Mathlib/GroupTheory/Coxeter/Basic.lean Modified Mathlib/LinearAlgebra/Matrix/ZPow.lean Modified Mathlib/Logic/Basic.lean - theorem beq_eq_decide Modified Mathlib/MeasureTheory/Integral/CircleIntegral.lean Modified Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean Modified Mathlib/NumberTheory/LegendreSymbol/QuadraticChar/Basic.lean Modified Mathlib/NumberTheory/LucasLehmer.lean Modified Mathlib/NumberTheory/Multiplicity.lean Modified Mathlib/NumberTheory/Padics/PadicIntegers.lean Modified Mathlib/NumberTheory/PellMatiyasevic.lean Modified Mathlib/NumberTheory/PythagoreanTriples.lean Modified Mathlib/NumberTheory/Transcendental/Liouville/Measure.lean Modified Mathlib/NumberTheory/Zsqrtd/Basic.lean Modified Mathlib/Order/Monotone/Basic.lean Modified Mathlib/Order/WithBot.lean Modified Mathlib/RingTheory/DedekindDomain/Factorization.lean Modified Mathlib/RingTheory/MvPowerSeries/Substitution.lean Modified Mathlib/RingTheory/WittVector/StructurePolynomial.lean Modified Mathlib/Tactic/Group.lean Modified Mathlib/Tactic/NormNum/LegendreSymbol.lean 2025-04-30 08:01:47 7c8e0d5 feat: `CyclotomicField`s are `NumberField`s (#24461) This can't be inferred automatically due to the extra set argument. ESTIMATED CHANGES Modified Mathlib/NumberTheory/Cyclotomic/Basic.lean 2025-04-30 07:12:17 0bdb916 chore: whitespace adaptations (#24459) Found by a newer version of a whitespace linter, with a prototype at #24465. ESTIMATED CHANGES Modified Mathlib/Algebra/Group/Subgroup/ZPowers/Basic.lean Modified Mathlib/Algebra/Star/StarRingHom.lean +/- def StarRingEquiv.trans Modified Mathlib/CategoryTheory/Abelian/GrothendieckAxioms/Basic.lean Modified Mathlib/CategoryTheory/Monoidal/Category.lean +/- def CategoryTheory.MonoidalCategory.Pentagon Modified Mathlib/Data/Fin/Tuple/Basic.lean +/- theorem Fin.sigma_eq_iff_eq_comp_cast Modified Mathlib/Data/Int/LeastGreatest.lean Modified Mathlib/Data/Vector/Basic.lean +/- def List.Vector.casesOn₂ +/- def List.Vector.casesOn₃ Modified Mathlib/GroupTheory/Coset/Defs.lean Modified Mathlib/GroupTheory/GroupAction/SubMulAction.lean Modified Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean Modified Mathlib/Order/Fin/Finset.lean Modified Mathlib/Probability/ConditionalProbability.lean +/- theorem ProbabilityTheory.inter_pos_of_cond_ne_zero Modified Mathlib/Tactic/Abel.lean Modified Mathlib/Tactic/FieldSimp.lean Modified Mathlib/Tactic/Positivity/Basic.lean 2025-04-30 06:48:01 b3d0c08 doc(RingTheory/Valuation/Basic): fix docstring at `Valuation` (#24457) ESTIMATED CHANGES Modified Mathlib/RingTheory/Valuation/Basic.lean 2025-04-30 06:41:14 43baf3e feat: generalize `MemHolder.smul` (#24464) ESTIMATED CHANGES Modified Mathlib/Topology/MetricSpace/Holder.lean +/- theorem HolderWith.smul Modified Mathlib/Topology/MetricSpace/HolderNorm.lean +/- theorem MemHolder.smul 2025-04-30 06:34:05 f509796 feat(RingTheory/DedekindDomain): lemmas on S-integers (#24279) Identify S-integers where S = univ and S = empty. Part of a mini-project at "Swiss-French Workshops in Arithmetic Geometry", Charmey, January 2025. ESTIMATED CHANGES Modified Mathlib/RingTheory/DedekindDomain/SInteger.lean + theorem IsDedekindDomain.integer_empty + theorem IsDedekindDomain.integer_univ 2025-04-29 22:53:44 9c6a148 chore: update Mathlib dependencies 2025-04-29 (#24456) This PR updates the Mathlib dependencies. ESTIMATED CHANGES Modified lake-manifest.json 2025-04-29 16:50:14 7e75795 chore: make the argument of CharP as semiOutParam (#24216) Without this on v4.20.0 we will need `set_option synthInstance.checkSynthOrder false` when connecting `CharP` to `Lean.Grind.IsCharP` (which uses an `outParam`). ESTIMATED CHANGES Modified Mathlib/Algebra/CharP/Defs.lean 2025-04-29 16:34:52 587458d chore(L1Space/HasFiniteIntegral): generalise a few lemmas to enorm (#24343) These are necessary to speak about `IntegrableOn` well. Similarly to previous PRs, when a statement needs more than trivial changes, this PR just adds enorm analogues (without deprecating existing lemmas) and tries to golf the existing version in terms of the enorm result. (In this PR, I chose to not always golf one-line proofs. For multi-line proofs, this PR shows that work can really be re-used.) ESTIMATED CHANGES Modified Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean +/- theorem MeasureTheory.HasFiniteIntegral.add_measure + theorem MeasureTheory.HasFiniteIntegral.congr'_enorm +/- theorem MeasureTheory.HasFiniteIntegral.congr + theorem MeasureTheory.HasFiniteIntegral.enorm +/- theorem MeasureTheory.HasFiniteIntegral.left_of_add_measure + theorem MeasureTheory.HasFiniteIntegral.mono'_enorm + theorem MeasureTheory.HasFiniteIntegral.mono_enorm +/- theorem MeasureTheory.HasFiniteIntegral.mono_measure +/- theorem MeasureTheory.HasFiniteIntegral.right_of_add_measure +/- theorem MeasureTheory.HasFiniteIntegral.smul_measure + theorem MeasureTheory.ae_enorm_le_bound + theorem MeasureTheory.ae_tendsto_enorm +/- theorem MeasureTheory.hasFiniteIntegral_add_measure + theorem MeasureTheory.hasFiniteIntegral_congr'_enorm +/- theorem MeasureTheory.hasFiniteIntegral_congr + theorem MeasureTheory.hasFiniteIntegral_const_enorm + theorem MeasureTheory.hasFiniteIntegral_const_iff_enorm + theorem MeasureTheory.hasFiniteIntegral_const_iff_isFiniteMeasure_enorm + theorem MeasureTheory.hasFiniteIntegral_enorm_iff +/- theorem MeasureTheory.hasFiniteIntegral_iff_enorm + theorem MeasureTheory.hasFiniteIntegral_of_bounded_enorm +/- theorem MeasureTheory.hasFiniteIntegral_of_dominated_convergence + theorem MeasureTheory.hasFiniteIntegral_of_dominated_convergence_enorm +/- theorem MeasureTheory.hasFiniteIntegral_zero +/- theorem MeasureTheory.hasFiniteIntegral_zero_measure +/- theorem MeasureTheory.tendsto_lintegral_norm_of_dominated_convergence 2025-04-29 15:12:39 6943d23 feat(LpSeminorm/Basic): generalise a few more lemmas to enorms (#24355) - For some lemmas, this was as easy as changing the co-domain. - Weaken a few enorm typeclasses: make shadowing explicit by using named sections. - For other lemmas, the enorm version requires a new explicit hypothesis (typically, around some constant being non-zero). For those, we add a new enorm version, and golf the existing result in terms of that. For the Carleson project. ESTIMATED CHANGES Modified Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean +/- theorem MeasureTheory.MemLp.of_measure_le_smul +/- theorem MeasureTheory.MemLp.smul_measure + theorem MeasureTheory.eLpNorm_const_lt_top_iff_enorm +/- theorem MeasureTheory.eLpNorm_indicator_eq_eLpNorm_restrict +/- theorem MeasureTheory.eLpNorm_one_smul_measure +/- theorem MeasureTheory.eLpNorm_restrict_le +/- theorem MeasureTheory.memLp_const + theorem MeasureTheory.memLp_const_enorm + theorem MeasureTheory.memLp_const_iff_enorm + theorem MeasureTheory.memLp_top_const_enorm 2025-04-29 11:49:27 61ea3c0 feat(LinearAlgebra/Span/Defs): span (s \ {0}) is equal to span s (#24360) `simp` would be able to solve `Submodule.span (s \ {0}) = Submodule.span s`. ESTIMATED CHANGES Modified Mathlib/LinearAlgebra/Span/Defs.lean + theorem Submodule.span_sdiff_singleton_zero 2025-04-29 10:02:52 3f25563 feat(Algebra/MvPolynomial): total degrees of some constructions (#24346) ESTIMATED CHANGES Modified Mathlib/Algebra/MvPolynomial/Degrees.lean + theorem MvPolynomial.totalDegree_renameEquiv Modified Mathlib/Algebra/MvPolynomial/Equiv.lean + theorem MvPolynomial.natDegree_optionEquivLeft + theorem MvPolynomial.totalDegree_coeff_optionEquivLeft_add_le + theorem MvPolynomial.totalDegree_coeff_optionEquivLeft_le Modified Mathlib/Data/Finsupp/Basic.lean + theorem Finsupp.embDomain_some_none + theorem Finsupp.some_embDomain_some Modified Mathlib/RingTheory/Algebraic/MvPolynomial.lean 2025-04-29 09:29:39 c00c2f8 chore(LapMatrix): fix a name (#24443) Rename `card_ConnectedComponent_eq_rank_ker_lapMatrix` to `card_connectedComponent_eq_finrank_ker_toLin'_lapMatrix`: - fix `c` to lowercase; - change `rank` to `finrank`; - mention `toLin'`. ESTIMATED CHANGES Modified Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean - theorem SimpleGraph.card_ConnectedComponent_eq_rank_ker_lapMatrix + theorem SimpleGraph.card_connectedComponent_eq_finrank_ker_toLin'_lapMatrix 2025-04-29 08:58:16 072b045 feat(NumberField): add `ComplexEmbedding.lift` (#24137) A (random) lift of a complex embedding `φ : k →+* ℂ` to an extension `K` of `k`. ESTIMATED CHANGES Modified Mathlib/NumberTheory/NumberField/Embeddings.lean + theorem NumberField.ComplexEmbedding.lift_algebraMap_apply + theorem NumberField.ComplexEmbedding.lift_comp_algebraMap + theorem NumberField.InfinitePlace.comap_mk_lift 2025-04-29 06:40:50 6824591 feat(CategoryTheory/Center): linear structures and ring morphisms (#23815) If `C` is a category and `R` a ring, we relate `R`-linear structures on `C` and ring morphisms `R →+* CatCenter C`. ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/CategoryTheory/Center/Linear.lean + def CategoryTheory.Linear.homModuleOfRingMorphism + def CategoryTheory.Linear.ofRingMorphism + def CategoryTheory.Linear.smulOfRingMorphism + theorem CategoryTheory.Linear.smulOfRingMorphism_smul_eq' + theorem CategoryTheory.Linear.smulOfRingMorphism_smul_eq + def CategoryTheory.Linear.toCatCenter 2025-04-29 05:56:08 f9f11e7 feat(Algebra): add Submodule.submoduleOf (#23903) In this PR we added the definition `Submodule.submoduleOf` and `Submodule.submoduleOfEquivOfLe` as the corrsponding version for `Subgroup.subgroupOf` ESTIMATED CHANGES Modified Mathlib/Algebra/Module/Submodule/Map.lean + def Submodule.submoduleOf + def Submodule.submoduleOfEquivOfLe 2025-04-28 20:03:37 ab000e4 chore: tidy various files (#24420) ESTIMATED CHANGES Modified Mathlib/Algebra/Homology/GrothendieckAbelian.lean Modified Mathlib/Algebra/Module/End.lean Modified Mathlib/Algebra/Order/Floor/Ring.lean Modified Mathlib/Algebra/Order/Monoid/Prod.lean Modified Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean Modified Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Formula.lean Modified Mathlib/Analysis/Distribution/SchwartzSpace.lean Modified Mathlib/CategoryTheory/Adjunction/Mates.lean Modified Mathlib/CategoryTheory/ConcreteCategory/BundledHom.lean Modified Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean Modified Mathlib/Combinatorics/SimpleGraph/IncMatrix.lean Modified Mathlib/Combinatorics/SimpleGraph/Prod.lean Modified Mathlib/Data/Finsupp/AList.lean Modified Mathlib/Data/List/Cycle.lean +/- theorem Cycle.not_mem_nil Modified Mathlib/Data/Matroid/Basic.lean +/- def Matroid.ExchangeProperty +/- def Matroid.ExistsMaximalSubsetProperty +/- structure Matroid Modified Mathlib/Data/Nat/Fib/Basic.lean Modified Mathlib/Data/Nat/Init.lean Modified Mathlib/Data/Nat/MaxPowDiv.lean Modified Mathlib/GroupTheory/GroupAction/Quotient.lean Modified Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean Modified Mathlib/MeasureTheory/MeasurableSpace/MeasurablyGenerated.lean Modified Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean Modified Mathlib/NumberTheory/Ostrowski.lean Modified Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean Modified Mathlib/RingTheory/Ideal/Operations.lean Modified Mathlib/RingTheory/PowerSeries/NoZeroDivisors.lean Modified Mathlib/RingTheory/RootsOfUnity/Basic.lean Modified Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Basic.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Induction.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Span.lean Modified Mathlib/Topology/Category/Profinite/Nobeling/Successor.lean 2025-04-28 19:52:26 734b51c feat(Combinatorics/SimpleGraph): define extremalNumber (#19865) Define the extremal number `extremalNumber n H` of a natural number `n` and a simple graph `H`: `extremalNumber n H` is the maximum number of edges in a `H`-free simple graph on `n` vertices, if `H` is contained in all simple graphs on `n` vertices, then this is `0`. Also define the predicate that a simple graph is an extremal graph `IsExtremal` satisfying some predicate. ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/Combinatorics/SimpleGraph/Copy.lean +/- theorem SimpleGraph.free_congr + theorem SimpleGraph.free_congr_left + theorem SimpleGraph.free_congr_right +/- theorem SimpleGraph.isContained_congr + theorem SimpleGraph.isContained_congr_left + theorem SimpleGraph.isContained_congr_right Added Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean + theorem SimpleGraph.IsContained.extremalNumber_le + theorem SimpleGraph.IsContained.of_extremalNumber_lt_card_edgeFinset + theorem SimpleGraph.IsExtremal.prop + def SimpleGraph.IsExtremal + theorem SimpleGraph.card_edgeFinset_le_extremalNumber + theorem SimpleGraph.card_edgeFinset_of_isExtremal_free + theorem SimpleGraph.exists_isExtremal_free + theorem SimpleGraph.exists_isExtremal_iff_exists + theorem SimpleGraph.extremalNumber_congr + theorem SimpleGraph.extremalNumber_congr_right + theorem SimpleGraph.extremalNumber_le_iff + theorem SimpleGraph.extremalNumber_le_iff_of_nonneg + theorem SimpleGraph.extremalNumber_of_fintypeCard_eq + theorem SimpleGraph.isExtremal_free_iff + theorem SimpleGraph.lt_extremalNumber_iff + theorem SimpleGraph.lt_extremalNumber_iff_of_nonneg 2025-04-28 17:47:31 12e7ef9 chore(CategoryTheory.Preadditive): add stacks project tag attribute to `Preadditive` and `Functor.Additive` (#24398) Both `Preadditive` and `Functor.Additive` are covered in the Stacks Project tag [00ZY](https://stacks.math.columbia.edu/tag/00ZY). Part of the [ICERM Workshop on Autoformalization](https://icerm.brown.edu/program/hot_topics_workshop/htw-25-aftwm). ESTIMATED CHANGES Modified Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean Modified Mathlib/CategoryTheory/Preadditive/Basic.lean 2025-04-28 17:33:04 3640ff5 chore(CategoryTheory): fix some Fintype/Finite assumptions (#24423) Found by the linter in #10235 Assume `[Finite J]` instead of `[Fintype J]` here and there. IMHO, the right way to fix this is to use `Fin n` in the typeclass definition, then use `{J : Type*} [Finite J]` in the instance, cf. [CategoryTheory.Limits.PreservesFiniteCoproducts](https://leanprover-community.github.io/mathlib4_docs/Mathlib/CategoryTheory/Limits/Preserves/Finite.html#CategoryTheory.Limits.PreservesFiniteCoproducts) I didn't take that path, because I never used this part of the library, so - I failed to quickly prove equivalence between `PreservesFiniteCoproducts` given `Equiv` between domains; - my opinion about design choices has higher chances of being wrong. ESTIMATED CHANGES Modified Mathlib/CategoryTheory/Limits/Preserves/Shapes/Biproducts.lean Modified Mathlib/CategoryTheory/Monoidal/Preadditive.lean +/- theorem CategoryTheory.biproduct_ι_comp_leftDistributor_hom +/- theorem CategoryTheory.biproduct_ι_comp_leftDistributor_inv +/- theorem CategoryTheory.biproduct_ι_comp_rightDistributor_hom +/- theorem CategoryTheory.biproduct_ι_comp_rightDistributor_inv +/- def CategoryTheory.leftDistributor +/- theorem CategoryTheory.leftDistributor_assoc +/- theorem CategoryTheory.leftDistributor_ext_left +/- theorem CategoryTheory.leftDistributor_ext_right +/- theorem CategoryTheory.leftDistributor_ext₂_left +/- theorem CategoryTheory.leftDistributor_ext₂_right +/- theorem CategoryTheory.leftDistributor_hom_comp_biproduct_π +/- theorem CategoryTheory.leftDistributor_inv_comp_biproduct_π +/- theorem CategoryTheory.leftDistributor_rightDistributor_assoc +/- def CategoryTheory.rightDistributor +/- theorem CategoryTheory.rightDistributor_assoc +/- theorem CategoryTheory.rightDistributor_ext_left +/- theorem CategoryTheory.rightDistributor_ext_right +/- theorem CategoryTheory.rightDistributor_ext₂_left +/- theorem CategoryTheory.rightDistributor_ext₂_right +/- theorem CategoryTheory.rightDistributor_hom_comp_biproduct_π +/- theorem CategoryTheory.rightDistributor_inv_comp_biproduct_π Modified Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean Modified Mathlib/CategoryTheory/Preadditive/Biproducts.lean 2025-04-28 16:25:46 f74ebec chore(Algebra/Module/PID): fix universe level (#24403) Originally the structure theorem of finitely generated torsion modules `N` over PID `R : Type u` required that `N : Type max u v`. This PR fixes it to `M : Type v`. Now that `lequivProdOfRightSplitExact` is universe polymorphic, we can also drop the use of `ULift.moduleEquiv` in the proofs. ESTIMATED CHANGES Modified Mathlib/Algebra/Module/PID.lean +/- theorem Module.equiv_directSum_of_isTorsion +/- theorem Module.equiv_free_prod_directSum +/- theorem Module.torsion_by_prime_power_decomposition 2025-04-28 15:18:03 812fedb feat(Algebra/Polynomial): add lemmas (#23252) ESTIMATED CHANGES Modified Mathlib/Algebra/Polynomial/BigOperators.lean + theorem Polynomial.natDegree_finset_prod_X_sub_C_eq_card Modified Mathlib/Algebra/Polynomial/Lifts.lean + theorem Polynomial.monic_of_monic_mapAlg Modified Mathlib/Algebra/Polynomial/Monic.lean + theorem Polynomial.monic_finprod_of_monic Modified Mathlib/Algebra/Polynomial/RingDivision.lean + theorem Polynomial.natDegree_pos_of_monic_of_aeval_eq_zero Modified Mathlib/Algebra/Polynomial/Roots.lean + theorem Polynomial.monic_finprod_X_sub_C + theorem Polynomial.monic_multisetProd_X_sub_C + theorem Polynomial.monic_prod_X_sub_C - theorem Polynomial.monic_prod_multiset_X_sub_C Modified Mathlib/Algebra/Polynomial/Splits.lean + theorem Polynomial.aeval_root_of_mapAlg_eq_multiset_prod_X_sub_C 2025-04-28 14:59:32 c768c54 chore(Analysis/Convex): drop unused arguments (#24392) Also weaken typeclass assumptions here and there. ESTIMATED CHANGES Modified Mathlib/Analysis/Convex/Basic.lean +/- theorem Convex.starConvex_iff +/- theorem Set.OrdConnected.convex +/- theorem Set.OrdConnected.convex_of_chain +/- theorem convex_iff_openSegment_subset +/- theorem convex_segment +/- theorem convex_stdSimplex +/- theorem stdSimplex_unique Modified Mathlib/Analysis/Convex/Between.lean +/- def affineSegment Modified Mathlib/Analysis/Convex/BetweenList.lean +/- theorem List.sbtw_cons +/- theorem List.sbtw_four +/- theorem List.sbtw_iff_triplewise_and_ne_pair +/- theorem List.sbtw_triple Modified Mathlib/Analysis/Convex/Function.lean +/- theorem ConcaveOn.convex_strict_hypograph +/- theorem ConvexOn.convex_strict_epigraph Modified Mathlib/Analysis/Convex/Hull.lean +/- theorem convexHull_pair Modified Mathlib/Analysis/Convex/Independent.lean Modified Mathlib/Analysis/Convex/Join.lean Modified Mathlib/Analysis/Convex/Piecewise.lean Modified Mathlib/Analysis/Convex/Quasiconvex.lean Modified Mathlib/Analysis/Convex/Segment.lean +/- theorem segment_inter_eq_endpoint_of_linearIndependent_sub + theorem segment_inter_subset_endpoint_of_linearIndependent_sub Modified Mathlib/Analysis/Convex/SimplicialComplex/Basic.lean Modified Mathlib/Analysis/Convex/Star.lean +/- theorem Set.OrdConnected.starConvex +/- theorem StarConvex.mem +/- def StarConvex +/- theorem starConvex_iff_openSegment_subset Modified Mathlib/Analysis/Convex/Strict.lean +/- theorem StrictConvex.add_smul_mem +/- theorem StrictConvex.add_smul_sub_mem +/- theorem StrictConvex.eq_of_openSegment_subset_frontier +/- theorem StrictConvex.smul_mem_of_zero_mem +/- def StrictConvex Modified Mathlib/Analysis/Convex/StrictConvexSpace.lean Modified Mathlib/Analysis/Convex/Topology.lean Modified Mathlib/Analysis/Convex/Visible.lean +/- theorem IsVisible.rfl +/- theorem isVisible_comm 2025-04-28 14:19:10 111f5c1 chore(*): fix some Fintype/Finite assumptions (#24424) Found by the linter in #10235 Also drop a `DecidableEq` assumption and fix `_inj` vs `_injective` name. ESTIMATED CHANGES Modified Mathlib/Combinatorics/Nullstellensatz.lean Modified Mathlib/Combinatorics/SimpleGraph/Diam.lean +/- theorem SimpleGraph.connected_iff_diam_ne_zero Modified Mathlib/Data/DFinsupp/Defs.lean Modified Mathlib/Data/Finset/Card.lean Modified Mathlib/RepresentationTheory/Tannaka.lean - theorem TannakaDuality.FiniteGroup.equivHom_inj + theorem TannakaDuality.FiniteGroup.equivHom_injective Modified Mathlib/RingTheory/LocalRing/NonLocalRing.lean +/- theorem IsLocalRing.not_isLocalRing_of_nontrivial_pi Modified Mathlib/RingTheory/MvPolynomial/Homogeneous.lean +/- theorem MvPolynomial.weightedTotalDegree_rename_of_injective 2025-04-28 14:11:30 24c69d5 chore(NumberTheory/Harmonic/EulerMascheroni): shorten proof of tendsto_eulerMascheroniSeq' (#24438) Replaces 6 lines of the proof of `tendsto_eulerMascheroniSeq'` with an invocation of [`tendsto_log_comp_add_sub_log`](https://github.com/leanprover-community/mathlib4/blob/be41d01fc2b49f941ba389a98c13fcfb5721dea8/Mathlib/Analysis/SpecialFunctions/Log/Basic.lean#L462-L469). Found by [`tryAtEachStep`](https://github.com/dwrensha/tryAtEachStep). ESTIMATED CHANGES Modified Mathlib/NumberTheory/Harmonic/EulerMascheroni.lean 2025-04-28 13:45:53 bff59ee chore(PeriodicPts): review API, fix (#24422) - fix some lemma names introduced in #23086; - fix some `Fintype`/`Finite` assumptions (found by the linter in #10235); - golf some proofs. ESTIMATED CHANGES Modified Mathlib/Dynamics/PeriodicPts/Defs.lean - theorem Function.iUnion_pNat_ptsOfPeriod + theorem Function.iUnion_pnat_ptsOfPeriod - theorem Function.periodicPts_subset_image + theorem Function.periodicPts_subset_range Modified Mathlib/Dynamics/PeriodicPts/Lemmas.lean + theorem Function.Injective.mem_periodicPts - theorem Function.directed_ptsOfPeriod_pNat + theorem Function.directed_ptsOfPeriod_pnat - theorem Function.injective_iff_forall_mem_periodicPts +/- theorem Function.injective_iff_iterate_factorial_card_eq_id + theorem Function.injective_iff_periodicPts_eq_univ +/- theorem Function.isPeriodicPt_factorial_card_of_mem_periodicPts +/- theorem Function.mem_periodicPts_iff_isPeriodicPt_factorial_card - theorem Function.mem_periodicPts_of_injective +/- theorem Function.minimalPeriod_le_card 2025-04-28 13:10:46 0550cf4 chore(Cardinal): rename `mk_pNat` -> `mk_pnat` (#24429) ESTIMATED CHANGES Modified Mathlib/SetTheory/Cardinal/Basic.lean - theorem Cardinal.mk_pNat + theorem Cardinal.mk_pnat 2025-04-28 13:10:44 8a1d355 chore(TangentCone): fix names (#24426) Use `tangentConeAt`, not `tangentCone` in lemma names. ESTIMATED CHANGES Modified Mathlib/Analysis/Calculus/TangentCone.lean + theorem mapsTo_tangentConeAt_pi - theorem mapsTo_tangentCone_pi + theorem mem_tangentConeAt_of_openSegment_subset + theorem mem_tangentConeAt_of_segment_subset - theorem mem_tangentCone_of_openSegment_subset - theorem mem_tangentCone_of_segment_subset + theorem subset_tangentConeAt_prod_left + theorem subset_tangentConeAt_prod_right - theorem subset_tangentCone_prod_left - theorem subset_tangentCone_prod_right + theorem tangentConeAt_congr + theorem tangentConeAt_eq_univ + theorem tangentConeAt_inter_nhds + theorem tangentConeAt_mono + theorem tangentConeAt_mono_nhds + theorem tangentConeAt_nonempty_of_properSpace + theorem tangentConeAt_univ - theorem tangentCone_congr - theorem tangentCone_eq_univ - theorem tangentCone_inter_nhds - theorem tangentCone_mono - theorem tangentCone_mono_nhds - theorem tangentCone_nonempty_of_properSpace - theorem tangentCone_univ 2025-04-28 13:10:43 203cf53 refactor: generalize `unbounded_of_tendsto_atTop` (#23531) ESTIMATED CHANGES Modified Mathlib/Order/Filter/AtTopBot/Basic.lean + theorem Filter.not_bddAbove_of_tendsto_atTop + theorem Filter.not_bddBelow_of_tendsto_atBot - theorem Filter.unbounded_of_tendsto_atBot' - theorem Filter.unbounded_of_tendsto_atBot - theorem Filter.unbounded_of_tendsto_atTop' - theorem Filter.unbounded_of_tendsto_atTop Modified Mathlib/Probability/Martingale/BorelCantelli.lean 2025-04-28 12:33:50 40300dd chore: scope Interval notation (#24433) ESTIMATED CHANGES Modified Mathlib/Analysis/Calculus/ParametricIntegral.lean Modified Mathlib/Analysis/SpecialFunctions/Complex/CircleMap.lean Modified Mathlib/MeasureTheory/Function/LocallyIntegrable.lean Modified Mathlib/MeasureTheory/Integral/DominatedConvergence.lean Modified Mathlib/MeasureTheory/Measure/AEMeasurable.lean Modified Mathlib/MeasureTheory/Measure/Restrict.lean Modified Mathlib/MeasureTheory/Measure/Typeclasses/NoAtoms.lean Modified Mathlib/NumberTheory/AbelSummation.lean Modified Mathlib/Order/Interval/Set/OrdConnected.lean Modified Mathlib/Order/Interval/Set/UnorderedInterval.lean 2025-04-28 11:54:05 be41d01 chore(Algebra/Polynomial/BigOperators): shorten proof of coeff_list_prod_of_natDegree_le (#24436) Replaces 7 lines of proof with an invocation of [`coeff_mul_add_eq_of_natDegree_le`](https://github.com/leanprover-community/mathlib4/blob/d60509c1f95a860ce33563b93bc82a3856f67fb2/Mathlib/Algebra/Polynomial/Degree/Operations.lean#L439-L451) Found by [`tryAtEachStep`](https://github.com/dwrensha/tryAtEachStep). ESTIMATED CHANGES Modified Mathlib/Algebra/Polynomial/BigOperators.lean 2025-04-28 10:53:23 91299a5 feat(RingTheory): tensor product of l.i. families over domains (#24224) There are also different conditions where the result is true. But I have yet to find a more general statement that encompasses all these results. See #24219 or https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Tensor.20product.20of.20linearly.20independent.20families/near/513258021 ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/RingTheory/Flat/Basic.lean + theorem LinearIndependent.tmul_of_flat_left + theorem LinearIndependent.tmul_of_flat_right +/- theorem Module.Flat.tensorProduct_mapIncl_injective_of_left +/- theorem Module.Flat.tensorProduct_mapIncl_injective_of_right + theorem TensorProduct.map_injective_of_flat_flat' + theorem TensorProduct.map_injective_of_flat_flat Added Mathlib/RingTheory/Flat/Domain.lean + theorem LinearIndependent.tmul_of_isDomain + theorem TensorProduct.map_injective_of_flat_flat_of_isDomain 2025-04-28 09:04:17 d60509c chore: move `Module.End`-related decls to the `Module.End` namespace (#23705) No deprecations, since they would clash across namespaces. From Toric ESTIMATED CHANGES Modified Mathlib/Algebra/Algebra/Basic.lean + theorem Module.End.algebraMap_isUnit_inv_apply_eq_iff' + theorem Module.End.algebraMap_isUnit_inv_apply_eq_iff - theorem Module.End_algebraMap_isUnit_inv_apply_eq_iff' - theorem Module.End_algebraMap_isUnit_inv_apply_eq_iff Modified Mathlib/Algebra/Algebra/Bilinear.lean Modified Mathlib/Algebra/Group/ForwardDiff.lean +/- theorem fwdDiff_aux.shiftₗ_apply Modified Mathlib/Algebra/Lie/CartanExists.lean Modified Mathlib/Algebra/Lie/Derivation/Basic.lean Modified Mathlib/Algebra/Lie/Engel.lean Modified Mathlib/Algebra/Lie/EngelSubalgebra.lean Modified Mathlib/Algebra/Lie/LieTheorem.lean Modified Mathlib/Algebra/Lie/Nilpotent.lean Modified Mathlib/Algebra/Lie/OfAssociative.lean Modified Mathlib/Algebra/Lie/Sl2.lean Modified Mathlib/Algebra/Lie/TraceForm.lean Modified Mathlib/Algebra/Lie/Weights/Basic.lean Modified Mathlib/Algebra/Lie/Weights/Cartan.lean Modified Mathlib/Algebra/Lie/Weights/Chain.lean Modified Mathlib/Algebra/Lie/Weights/Killing.lean Modified Mathlib/Algebra/Module/Equiv/Basic.lean + theorem Module.End.isUnit_iff - theorem Module.End_isUnit_iff Modified Mathlib/Algebra/Module/FinitePresentation.lean Modified Mathlib/Algebra/Module/LinearMap/End.lean - theorem LinearMap.coe_mul - theorem LinearMap.coe_one - theorem LinearMap.coe_pow - theorem LinearMap.commute_pow_left_of_commute - theorem LinearMap.id_pow - theorem LinearMap.injective_of_iterate_injective - theorem LinearMap.iterate_bijective - theorem LinearMap.iterate_injective - theorem LinearMap.iterate_succ - theorem LinearMap.iterate_surjective - theorem LinearMap.mul_apply - theorem LinearMap.mul_eq_comp - theorem LinearMap.one_apply - theorem LinearMap.one_eq_id - theorem LinearMap.pow_apply - theorem LinearMap.pow_map_zero_of_le - theorem LinearMap.surjective_of_iterate_surjective + theorem Module.End.coe_mul + theorem Module.End.coe_one + theorem Module.End.coe_pow + theorem Module.End.commute_pow_left_of_commute + theorem Module.End.id_pow + theorem Module.End.injective_of_iterate_injective +/- theorem Module.End.intCast_apply + theorem Module.End.isUnit_apply_inv_apply_of_isUnit + theorem Module.End.isUnit_inv_apply_apply_of_isUnit + theorem Module.End.iterate_bijective + theorem Module.End.iterate_injective + theorem Module.End.iterate_succ + theorem Module.End.iterate_surjective + theorem Module.End.mul_apply + theorem Module.End.mul_eq_comp +/- theorem Module.End.natCast_apply +/- theorem Module.End.ofNat_apply + theorem Module.End.one_apply + theorem Module.End.one_eq_id + theorem Module.End.pow_apply + theorem Module.End.pow_map_zero_of_le + theorem Module.End.surjective_of_iterate_surjective - theorem Module.End_isUnit_apply_inv_apply_of_isUnit - theorem Module.End_isUnit_inv_apply_apply_of_isUnit Modified Mathlib/Algebra/Module/LocalizedModule/Basic.lean Modified Mathlib/Algebra/Module/LocalizedModule/Submodule.lean Modified Mathlib/Algebra/Module/Submodule/Ker.lean Modified Mathlib/Algebra/Module/Submodule/LinearMap.lean - theorem LinearMap.pow_apply_mem_of_forall_mem - theorem LinearMap.pow_restrict - theorem LinearMap.submodule_pow_eq_zero_of_pow_eq_zero + theorem Module.End.pow_apply_mem_of_forall_mem + theorem Module.End.pow_restrict + theorem Module.End.submodule_pow_eq_zero_of_pow_eq_zero Modified Mathlib/Algebra/Module/Submodule/Map.lean +/- theorem Submodule.le_comap_pow_of_le_comap Modified Mathlib/Algebra/Module/Submodule/Range.lean Modified Mathlib/Algebra/Polynomial/Derivative.lean Modified Mathlib/Algebra/Polynomial/Module/Basic.lean Modified Mathlib/AlgebraicGeometry/Modules/Tilde.lean Modified Mathlib/Analysis/Calculus/LagrangeMultipliers.lean Modified Mathlib/Analysis/InnerProductSpace/Adjoint.lean Modified Mathlib/Analysis/InnerProductSpace/Symmetric.lean Modified Mathlib/Data/Matrix/Bilinear.lean Modified Mathlib/FieldTheory/JacobsonNoether.lean Modified Mathlib/LinearAlgebra/Charpoly/Basic.lean Modified Mathlib/LinearAlgebra/Eigenspace/Basic.lean Modified Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean Modified Mathlib/LinearAlgebra/Eigenspace/Pi.lean Modified Mathlib/LinearAlgebra/Eigenspace/Triangularizable.lean Modified Mathlib/LinearAlgebra/Eigenspace/Zero.lean Modified Mathlib/LinearAlgebra/FiniteDimensional/Basic.lean Modified Mathlib/LinearAlgebra/Matrix/InvariantBasisNumber.lean Modified Mathlib/LinearAlgebra/Matrix/ToLin.lean Modified Mathlib/LinearAlgebra/Projection.lean Modified Mathlib/LinearAlgebra/QuadraticForm/Basic.lean Modified Mathlib/LinearAlgebra/QuadraticForm/Dual.lean Modified Mathlib/LinearAlgebra/Quotient/Basic.lean Modified Mathlib/LinearAlgebra/Reflection.lean Modified Mathlib/LinearAlgebra/RootSystem/Defs.lean Modified Mathlib/LinearAlgebra/RootSystem/Hom.lean Modified Mathlib/LinearAlgebra/Semisimple.lean Modified Mathlib/LinearAlgebra/Span/Basic.lean Modified Mathlib/LinearAlgebra/TensorProduct/Basic.lean Modified Mathlib/LinearAlgebra/Trace.lean +/- theorem LinearMap.trace_id Modified Mathlib/RepresentationTheory/Basic.lean Modified Mathlib/RepresentationTheory/FDRep.lean Modified Mathlib/RepresentationTheory/GroupCohomology/LowDegree.lean Modified Mathlib/RepresentationTheory/GroupCohomology/Resolution.lean Modified Mathlib/RepresentationTheory/Invariants.lean Modified Mathlib/RepresentationTheory/Rep.lean Modified Mathlib/RingTheory/Artinian/Module.lean +/- theorem LinearMap.eventually_codisjoint_ker_pow_range_pow +/- theorem LinearMap.eventually_isCompl_ker_pow_range_pow Modified Mathlib/RingTheory/CotangentLocalizationAway.lean Modified Mathlib/RingTheory/Derivation/Lie.lean Modified Mathlib/RingTheory/Finiteness/Nilpotent.lean + theorem Module.End.isNilpotent_iff_of_finite - theorem Module.Finite.Module.End.isNilpotent_iff_of_finite Modified Mathlib/RingTheory/IsTensorProduct.lean Modified Mathlib/RingTheory/Kaehler/TensorProduct.lean Modified Mathlib/RingTheory/LocalProperties/Projective.lean Modified Mathlib/RingTheory/Localization/Algebra.lean Modified Mathlib/RingTheory/Nilpotent/Exp.lean Modified Mathlib/RingTheory/Nilpotent/Lemmas.lean Modified Mathlib/RingTheory/Noetherian/Defs.lean - theorem LinearMap.eventually_disjoint_ker_pow_range_pow + theorem Module.End.eventually_disjoint_ker_pow_range_pow Modified Mathlib/RingTheory/Polynomial/Basic.lean Modified Mathlib/RingTheory/Polynomial/Bernstein.lean Modified Mathlib/RingTheory/SimpleModule/Basic.lean Modified Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean Modified Mathlib/RingTheory/TensorProduct/Basic.lean 2025-04-28 07:37:29 c7cf6b6 refactor(Topology/UniformSpace): clarify def of TendstoLocallyUniformly (#24342) Split `Mathlib.Topology.UniformSpace.UniformConvergence` into 3 files, and add a detailed explanation of how our definition of `TendstoLocallyUniformly` differs from the one usually found in the literature. See discussion on Zulip: https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Locally.20uniform.20convergence/with/514097469 ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/Topology/EMetricSpace/Basic.lean Added Mathlib/Topology/UniformSpace/LocallyUniformConvergence.lean + theorem TendstoLocallyUniformly.comp + def TendstoLocallyUniformly + theorem TendstoLocallyUniformlyOn.comp + theorem TendstoLocallyUniformlyOn.congr + theorem TendstoLocallyUniformlyOn.congr_right + theorem TendstoLocallyUniformlyOn.mono + theorem TendstoLocallyUniformlyOn.tendsto_at + theorem TendstoLocallyUniformlyOn.union + theorem TendstoLocallyUniformlyOn.unique + def TendstoLocallyUniformlyOn + theorem tendstoLocallyUniformlyOn_TFAE + theorem tendstoLocallyUniformlyOn_biUnion + theorem tendstoLocallyUniformlyOn_iUnion + theorem tendstoLocallyUniformlyOn_iff_filter + theorem tendstoLocallyUniformlyOn_iff_forall_isCompact + theorem tendstoLocallyUniformlyOn_iff_forall_tendsto + theorem tendstoLocallyUniformlyOn_iff_tendstoLocallyUniformly_comp_coe + theorem tendstoLocallyUniformlyOn_iff_tendstoUniformlyOn_of_compact + theorem tendstoLocallyUniformlyOn_sUnion + theorem tendstoLocallyUniformlyOn_univ + theorem tendstoLocallyUniformly_iff_filter + theorem tendstoLocallyUniformly_iff_forall_isCompact + theorem tendstoLocallyUniformly_iff_forall_tendsto + theorem tendstoLocallyUniformly_iff_tendstoUniformly_of_compactSpace Added Mathlib/Topology/UniformSpace/UniformApproximation.lean + theorem TendstoLocallyUniformly.tendsto_comp + theorem TendstoLocallyUniformlyOn.tendsto_comp + theorem TendstoUniformly.tendsto_comp + theorem TendstoUniformlyOn.tendsto_comp + theorem continuousAt_of_locally_uniform_approx_of_continuousAt + theorem continuousOn_of_locally_uniform_approx_of_continuousWithinAt + theorem continuousOn_of_uniform_approx_of_continuousOn + theorem continuousWithinAt_of_locally_uniform_approx_of_continuousWithinAt + theorem continuous_of_locally_uniform_approx_of_continuousAt + theorem continuous_of_uniform_approx_of_continuous + theorem tendsto_comp_of_locally_uniform_limit + theorem tendsto_comp_of_locally_uniform_limit_within Modified Mathlib/Topology/UniformSpace/UniformConvergence.lean - theorem TendstoLocallyUniformly.comp - theorem TendstoLocallyUniformly.tendsto_comp - def TendstoLocallyUniformly - theorem TendstoLocallyUniformlyOn.comp - theorem TendstoLocallyUniformlyOn.congr - theorem TendstoLocallyUniformlyOn.congr_right - theorem TendstoLocallyUniformlyOn.mono - theorem TendstoLocallyUniformlyOn.tendsto_at - theorem TendstoLocallyUniformlyOn.tendsto_comp - theorem TendstoLocallyUniformlyOn.union - theorem TendstoLocallyUniformlyOn.unique - def TendstoLocallyUniformlyOn - theorem TendstoUniformly.tendsto_comp +/- theorem TendstoUniformlyOn.mono +/- theorem TendstoUniformlyOn.tendsto_at - theorem TendstoUniformlyOn.tendsto_comp +/- theorem UniformCauchySeqOn.mono +/- theorem UniformContinuousOn.tendstoUniformly +/- theorem UniformContinuousOn.tendstoUniformlyOn - theorem continuousAt_of_locally_uniform_approx_of_continuousAt - theorem continuousOn_of_locally_uniform_approx_of_continuousWithinAt - theorem continuousOn_of_uniform_approx_of_continuousOn - theorem continuousWithinAt_of_locally_uniform_approx_of_continuousWithinAt - theorem continuous_of_locally_uniform_approx_of_continuousAt - theorem continuous_of_uniform_approx_of_continuous - theorem tendstoLocallyUniformlyOn_TFAE - theorem tendstoLocallyUniformlyOn_biUnion - theorem tendstoLocallyUniformlyOn_iUnion - theorem tendstoLocallyUniformlyOn_iff_filter - theorem tendstoLocallyUniformlyOn_iff_forall_isCompact - theorem tendstoLocallyUniformlyOn_iff_forall_tendsto - theorem tendstoLocallyUniformlyOn_iff_tendstoLocallyUniformly_comp_coe - theorem tendstoLocallyUniformlyOn_iff_tendstoUniformlyOn_of_compact - theorem tendstoLocallyUniformlyOn_sUnion - theorem tendstoLocallyUniformlyOn_univ - theorem tendstoLocallyUniformly_iff_filter - theorem tendstoLocallyUniformly_iff_forall_isCompact - theorem tendstoLocallyUniformly_iff_forall_tendsto - theorem tendstoLocallyUniformly_iff_tendstoUniformly_of_compactSpace +/- theorem tendstoUniformlyOn_iff_tendsto +/- theorem tendstoUniformly_congr +/- theorem tendstoUniformly_iff_tendsto - theorem tendsto_comp_of_locally_uniform_limit - theorem tendsto_comp_of_locally_uniform_limit_within Modified Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean 2025-04-28 07:13:22 c7a52c0 feat: sliced adjoint functors (#24388) This is Proposition 3.8 in https://ncatlab.org/nlab/show/adjoint+functor. From Toric ESTIMATED CHANGES Modified Mathlib/CategoryTheory/Comma/Over/Basic.lean + def CategoryTheory.Over.postAdjunctionRight + def CategoryTheory.Under.postAdjunctionLeft Modified Mathlib/CategoryTheory/Comma/Over/Pullback.lean + def CategoryTheory.Over.postAdjunctionLeft + def CategoryTheory.Under.postAdjunctionRight 2025-04-28 07:13:20 3ae008e feat(Algebra/Homology/Embedding): the cokernel sequence of a truncation (#24276) Given an embedding `e` of complex shapes which satisfies `e.IsTruncLE` and an homological complex `K`, we study the cokernel sequence `0 ⟶ K.truncLE e ⟶ K ⟶ cokernel (K.ιTruncLE e) ⟶ 0`. ESTIMATED CHANGES Modified Mathlib/Algebra/Homology/Embedding/TruncLEHomology.lean + theorem HomologicalComplex.isIso_homologyMap_shortComplexTruncLE_g + theorem HomologicalComplex.mono_homologyMap_shortComplexTruncLE_g + theorem HomologicalComplex.quasiIsoAt_shortComplexTruncLE_g + theorem HomologicalComplex.shortComplexTruncLE_X₃_isSupportedOutside + theorem HomologicalComplex.shortComplexTruncLE_shortExact + theorem HomologicalComplex.shortComplexTruncLE_shortExact_δ_eq_zero 2025-04-28 07:13:19 82734e7 feat(CategoryTheory): left derivability structures (#22450) Using the duality result from #22447, we dualise the notion of right derivability structure introduced in #12633 in order to formalize left derivability structures. This shall be used in order to construct left derived functors. ESTIMATED CHANGES Modified Mathlib/CategoryTheory/GuitartExact/Opposite.lean Modified Mathlib/CategoryTheory/Localization/DerivabilityStructure/Basic.lean + theorem CategoryTheory.LocalizerMorphism.guitartExact_of_isLeftDerivabilityStructure' + theorem CategoryTheory.LocalizerMorphism.guitartExact_of_isLeftDerivabilityStructure + theorem CategoryTheory.LocalizerMorphism.isLeftDerivabilityStructure_iff + theorem CategoryTheory.LocalizerMorphism.isLeftDerivabilityStructure_iff_op Modified Mathlib/CategoryTheory/Localization/Resolution.lean 2025-04-28 06:56:21 f77211d feat: drop completeness assumption in two integral lemmas (#24428) ESTIMATED CHANGES Modified Mathlib/MeasureTheory/Integral/Bochner/ContinuousLinearMap.lean +/- theorem integral_const_mul_of_integrable +/- theorem integral_mul_const_of_integrable 2025-04-28 06:56:19 e187052 chore(Geometry): reinstate some not-slow `field_simp`s (#24253) A while ago I made `field_simp` a bit faster. So now, some of the `field_simp` calls tracked in #15486 now aren't slow anymore. ESTIMATED CHANGES Modified Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean Modified Mathlib/Geometry/Euclidean/MongePoint.lean Modified Mathlib/Geometry/Manifold/Instances/Sphere.lean 2025-04-28 06:56:18 795cc06 feat(CategoryTheory/Abelian): Ext when there are enough injectives (#23797) In this PR, it is shown that `Ext`-groups of positive degree to an injective object vanish. It follows that if `C` is a `w`-small abelian category with enough injectives, then `Ext`-groups are `w`-small (i.e. `HasExt.{w}` holds). This PR dualizes the results in #19591. ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/Algebra/Homology/DerivedCategory/Ext/Basic.lean Added Mathlib/Algebra/Homology/DerivedCategory/Ext/EnoughInjectives.lean + theorem CategoryTheory.Abelian.Ext.eq_zero_of_injective + theorem CategoryTheory.hasExt_of_enoughInjectives + theorem CochainComplex.isSplitMono_from_singleFunctor_obj_of_injective + theorem DerivedCategory.to_singleFunctor_obj_eq_zero_of_injective Modified Mathlib/Algebra/Homology/DerivedCategory/Ext/EnoughProjectives.lean + theorem DerivedCategory.from_singleFunctor_obj_eq_zero_of_projective - theorem DerivedCategory.from_singleFunctor_obj_projective_eq_zero Modified Mathlib/Algebra/Homology/SingleHomology.lean + theorem HomologicalComplex.pOpcycles_singleObjOpcyclesSelfIso_inv Modified Mathlib/CategoryTheory/Abelian/Projective/Dimension.lean Modified Mathlib/CategoryTheory/Preadditive/Injective/Basic.lean 2025-04-28 06:37:57 f660ba7 feat: make `lequivProdOfRightSplitExact` universe polymorphic (#24419) When transferring a result from category theory, the theorem at the boundary should be responsible for immediately generalizing the universes if possible. Downstream cleanup from this change is left to a future PR. Arguably we should avoid going through category theory at all here, as the current construction fails to characterize the resulting isomorphism. ESTIMATED CHANGES Modified Mathlib/Algebra/Category/ModuleCat/Biproducts.lean 2025-04-28 06:28:31 5d6aefe feat: behavior of AnalyticAt.order under addition (#22680) Deliver on one of the open TODOs and establish the behavior of `AnalyticAt.order` under addition. Add missing `fun_prop` lemma on the stability of analytic functions under `HPow.hPow`. Generalize the statement on the behavior of `AnalyticAt.order` under multiplication to scalar multiplication. This material is used in [Project VD](https://github.com/kebekus/ProjectVD), which aims to formalize Value Distribution Theory for meromorphic functions on the complex plane. ESTIMATED CHANGES Modified Mathlib/Analysis/Analytic/Order.lean + theorem AnalyticAt.analyticAt_centeredMonomial + theorem AnalyticAt.analyticAt_order_centeredMonomial + theorem AnalyticAt.order_add + theorem AnalyticAt.order_add_of_order_lt_order + theorem AnalyticAt.order_add_of_order_ne_order + theorem AnalyticAt.order_congr - theorem AnalyticAt.order_mul_of_order_eq_top + theorem AnalyticAt.order_smul 2025-04-28 05:53:52 6895497 feat(GroupTheory/GroupAction/FixingSubgroup): additivize (#24117) Additivize what wasn't. ESTIMATED CHANGES Modified Mathlib/Algebra/Group/Subgroup/Actions.lean Modified Mathlib/Algebra/Group/Submonoid/MulAction.lean Modified Mathlib/GroupTheory/GroupAction/FixedPoints.lean Modified Mathlib/GroupTheory/GroupAction/FixingSubgroup.lean 2025-04-28 05:18:44 e875e2b chore: deprecate stub files left over from #20676 (#23936) As I noted [on Zulip](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2320676.20unbundling.20ordered.20algebra/near/511192094): * `Mathlib/Algebra/Order/Field/InjSurj.lean` (deprecated stuff only) * `Mathlib/Algebra/Order/Group/InjSurj.lean` (ditto) * `Mathlib/Algebra/Order/Group/Instances.lean` (no declarations) * `Mathlib/Algebra/Order/Group/Prod.lean` (ditto) * `Mathlib/Algebra/Order/Group/TypeTags.lean` (ditto) ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Field/InjSurj.lean Modified Mathlib/Algebra/Order/Group/InjSurj.lean Modified Mathlib/Algebra/Order/Group/Instances.lean Modified Mathlib/Algebra/Order/Group/Prod.lean Modified Mathlib/Algebra/Order/Group/TypeTags.lean Modified Mathlib/Algebra/Order/Monoid/Basic.lean Modified Mathlib/Algebra/Order/Ring/InjSurj.lean 2025-04-28 04:18:25 ac984cc chore(LinearAlgebra): golf two proofs and remove porting notes (#24078) ESTIMATED CHANGES Modified Mathlib/LinearAlgebra/Dimension/DivisionRing.lean Modified Mathlib/LinearAlgebra/LinearIndependent/Basic.lean 2025-04-28 03:42:49 ff8f787 chore(RingTheory/Polynomial/Eisenstein/Distinguished): fix namespace (#24404) From `IsDistinguishedAt.XXX` to `Polynomial.IsDistinguishedAt.XXX` which enables dot notation. Also changed some variables into implicit. ESTIMATED CHANGES Modified Mathlib/RingTheory/Polynomial/Eisenstein/Distinguished.lean - theorem IsDistinguishedAt.degree_eq_order_map - theorem IsDistinguishedAt.map_eq_X_pow + theorem Polynomial.IsDistinguishedAt.degree_eq_order_map + theorem Polynomial.IsDistinguishedAt.map_eq_X_pow 2025-04-28 03:19:43 70fb092 chore(Asymptotics/TVS): add a whitespace to notation (#24425) I think that we should put whitespaces after punctuation. ESTIMATED CHANGES Modified Mathlib/Analysis/Asymptotics/TVS.lean +/- theorem Asymptotics.IsLittleOTVS.bot +/- theorem Asymptotics.IsLittleOTVS.congr' +/- theorem Asymptotics.IsLittleOTVS.congr +/- theorem Asymptotics.IsLittleOTVS.congr_left +/- theorem Asymptotics.IsLittleOTVS.congr_right +/- theorem Asymptotics.IsLittleOTVS.mono +/- theorem Asymptotics.IsLittleOTVS.tendsto_inv_smul +/- theorem Asymptotics.IsLittleOTVS.trans +/- theorem Asymptotics.IsLittleOTVS.zero +/- theorem Asymptotics.isLittleOTVS_one Modified Mathlib/Analysis/Calculus/FDeriv/Basic.lean 2025-04-28 02:20:04 9120e17 chore(*): use the preferred spelling for `ne` (#24408) ESTIMATED CHANGES Modified Mathlib/Analysis/Meromorphic/Order.lean + theorem MeromorphicAt.order_add_of_order_ne - theorem MeromorphicAt.order_add_of_unequal_order Modified Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean Modified Mathlib/Combinatorics/SimpleGraph/Path.lean + theorem SimpleGraph.Walk.IsCycle.getVert_sub_one_ne_getVert_add_one - theorem SimpleGraph.Walk.IsCycle.getVert_sub_one_neq_getVert_add_one Modified Mathlib/Data/Fin/Basic.lean + theorem Fin.eq_one_of_ne_zero - theorem Fin.eq_one_of_neq_zero Modified Mathlib/Data/List/Sigma.lean + theorem List.ne_key - theorem List.not_eq_key Modified Mathlib/LinearAlgebra/Projectivization/Independence.lean + theorem Projectivization.independent_pair_iff_ne - theorem Projectivization.independent_pair_iff_neq 2025-04-28 01:46:29 efd09be feat(CategoryTheory/Localization): the calculus of fractions that is deduced from an adjunction (#22748) If `G ⊣ F` is an adjunction, and `F` is fully faithful, then there is a left calculus of fractions for the inverse image by `G` of the class of isomorphisms. (The dual statement is also obtained.) ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/CategoryTheory/Localization/CalculusOfFractions/OfAdjunction.lean + theorem CategoryTheory.Adjunction.hasLeftCalculusOfFractions + theorem CategoryTheory.Adjunction.hasRightCalculusOfFractions Modified Mathlib/CategoryTheory/MorphismProperty/Basic.lean + theorem CategoryTheory.MorphismProperty.isomorphisms_op 2025-04-28 01:17:58 0668daa feat(FieldTheory/Finitness): add `Module.natCard_eq_pow` (#24407) Unblocks #22994 ESTIMATED CHANGES Modified Mathlib/FieldTheory/Finiteness.lean + theorem Module.natCard_eq_pow_finrank 2025-04-28 00:02:49 b8e91f6 feat(MeasureTheory): multiplication by a constant can be pulled out of an integral (#24397) This PR shows that `∫ x, f x * c ∂μ = (∫ x, f x ∂μ) * c` and `∫ x, c * f x ∂μ = c * ∫ x, f x ∂μ` when `c` is a constant, and where `f` takes values in a Banach algebra. ESTIMATED CHANGES Modified Archive/Hairer.lean Modified Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean Modified Mathlib/Analysis/Calculus/Rademacher.lean Modified Mathlib/Analysis/Convolution.lean Modified Mathlib/Analysis/Distribution/SchwartzSpace.lean Modified Mathlib/Analysis/Fourier/AddCircle.lean Modified Mathlib/Analysis/Fourier/FourierTransformDeriv.lean Modified Mathlib/Analysis/Fourier/Inversion.lean Modified Mathlib/Analysis/ODE/PicardLindelof.lean Modified Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean Modified Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean Modified Mathlib/Analysis/SpecialFunctions/Gaussian/FourierTransform.lean Modified Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean Modified Mathlib/MeasureTheory/Integral/Average.lean Modified Mathlib/MeasureTheory/Integral/Bochner/Basic.lean + theorem MeasureTheory.integral_const_mul + theorem MeasureTheory.integral_mul_const - theorem MeasureTheory.integral_mul_left - theorem MeasureTheory.integral_mul_right Modified Mathlib/MeasureTheory/Integral/Bochner/ContinuousLinearMap.lean + theorem integral_const_mul_of_integrable + theorem integral_mul_const_of_integrable Modified Mathlib/MeasureTheory/Integral/Bochner/Set.lean Modified Mathlib/MeasureTheory/Integral/Gamma.lean Modified Mathlib/MeasureTheory/Integral/PeakFunction.lean Modified Mathlib/MeasureTheory/Measure/CharacteristicFunction.lean Modified Mathlib/MeasureTheory/Measure/Haar/Unique.lean Modified Mathlib/MeasureTheory/Measure/Tilted.lean Modified Mathlib/NumberTheory/AbelSummation.lean Modified Mathlib/NumberTheory/LSeries/MellinEqDirichlet.lean Modified Mathlib/NumberTheory/LSeries/SumCoeff.lean Modified Mathlib/Probability/Distributions/Gamma.lean Modified Mathlib/Probability/Distributions/Gaussian.lean Modified Mathlib/Probability/Distributions/Pareto.lean Modified Mathlib/Probability/Martingale/Upcrossing.lean Modified Mathlib/Probability/Moments/Basic.lean Modified Mathlib/Probability/Moments/MGFAnalytic.lean Modified Mathlib/Probability/Moments/SubGaussian.lean Modified Mathlib/Probability/StrongLaw.lean Modified Mathlib/Probability/Variance.lean 2025-04-27 19:30:33 fed914b chore: prepare for the next lean version bump (#24417) Mostly lemmas that were renamed in core and syntax changes related to dot notation that should not have worked before. ESTIMATED CHANGES Modified Archive/Imo/Imo2024Q5.lean Modified Archive/MiuLanguage/DecisionSuf.lean Modified Mathlib/Algebra/Algebra/Basic.lean Modified Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean Modified Mathlib/Algebra/Category/ModuleCat/Abelian.lean Modified Mathlib/Algebra/Category/ModuleCat/Images.lean Modified Mathlib/Algebra/Category/ModuleCat/Kernels.lean Modified Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean Modified Mathlib/Algebra/Field/Rat.lean Modified Mathlib/Algebra/GCDMonoid/Nat.lean Modified Mathlib/Algebra/Group/Submonoid/Membership.lean Modified Mathlib/Algebra/Group/Submonoid/Operations.lean +/- theorem MonoidHom.comap_mker +/- theorem MonoidHom.map_mrange +/- theorem MonoidHom.restrict_mker Modified Mathlib/Algebra/Module/FinitePresentation.lean Modified Mathlib/Algebra/Module/Submodule/Ker.lean +/- theorem LinearMap.comp_ker_subtype +/- theorem LinearMap.ker_toAddSubmonoid Modified Mathlib/Algebra/Module/Submodule/Range.lean Modified Mathlib/Algebra/Order/Floor/Ring.lean Modified Mathlib/Algebra/Order/Group/Int/Sum.lean Modified Mathlib/Algebra/Order/Group/Unbundled/Int.lean Modified Mathlib/Algebra/Polynomial/Degree/SmallDegree.lean Modified Mathlib/Algebra/Squarefree/Basic.lean Modified Mathlib/Algebra/Star/NonUnitalSubalgebra.lean Modified Mathlib/Analysis/Calculus/ContDiff/Bounds.lean Modified Mathlib/Analysis/Normed/Unbundled/RingSeminorm.lean Modified Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean Modified Mathlib/Combinatorics/SimpleGraph/Matching.lean Modified Mathlib/Combinatorics/SimpleGraph/Subgraph.lean Modified Mathlib/Computability/Partrec.lean Modified Mathlib/Computability/PartrecCode.lean Modified Mathlib/Computability/PostTuringMachine.lean Modified Mathlib/Data/BitVec.lean Modified Mathlib/Data/ENNReal/Basic.lean Modified Mathlib/Data/Fin/Tuple/NatAntidiagonal.lean Modified Mathlib/Data/Finset/Powerset.lean Modified Mathlib/Data/Int/Basic.lean +/- theorem Int.natAbs_surjective Modified Mathlib/Data/Int/GCD.lean + theorem Int.coe_lcm_dvd + theorem Int.dvd_coe_gcd - theorem Int.dvd_gcd - theorem Int.lcm_dvd Modified Mathlib/Data/Int/Init.lean Modified Mathlib/Data/Int/ModEq.lean Modified Mathlib/Data/Int/Sqrt.lean +/- theorem Int.sqrt_natCast Modified Mathlib/Data/List/Basic.lean Modified Mathlib/Data/List/Cycle.lean Modified Mathlib/Data/List/Lemmas.lean Modified Mathlib/Data/List/Permutation.lean Modified Mathlib/Data/List/Zip.lean Modified Mathlib/Data/Nat/ModEq.lean Modified Mathlib/Data/Nat/Prime/Int.lean Modified Mathlib/Data/Option/Defs.lean Modified Mathlib/Data/Ordmap/Ordset.lean Modified Mathlib/Data/PEquiv.lean Modified Mathlib/Data/Rat/Lemmas.lean Modified Mathlib/Data/ZMod/Basic.lean Modified Mathlib/Data/ZMod/ValMinAbs.lean Modified Mathlib/FieldTheory/PurelyInseparable/PerfectClosure.lean Modified Mathlib/GroupTheory/CoprodI.lean Modified Mathlib/GroupTheory/HNNExtension.lean Modified Mathlib/GroupTheory/SpecificGroups/Alternating.lean Modified Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean Modified Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean Modified Mathlib/LinearAlgebra/CliffordAlgebra/Conjugation.lean Modified Mathlib/LinearAlgebra/Dimension/LinearMap.lean Modified Mathlib/LinearAlgebra/Dual/Defs.lean Modified Mathlib/LinearAlgebra/Dual/Lemmas.lean Modified Mathlib/LinearAlgebra/FreeModule/PID.lean Modified Mathlib/LinearAlgebra/Goursat.lean Modified Mathlib/LinearAlgebra/Isomorphisms.lean Modified Mathlib/LinearAlgebra/Quotient/Basic.lean +/- theorem LinearMap.range_mkQ_comp Modified Mathlib/Logic/Encodable/Basic.lean Modified Mathlib/Logic/Equiv/Fin/Basic.lean Modified Mathlib/ModelTheory/Encoding.lean Modified Mathlib/NumberTheory/ArithmeticFunction.lean Modified Mathlib/NumberTheory/DiophantineApproximation/Basic.lean Modified Mathlib/NumberTheory/FLT/Four.lean Modified Mathlib/NumberTheory/LegendreSymbol/GaussEisensteinLemmas.lean Modified Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean Modified Mathlib/NumberTheory/Multiplicity.lean Modified Mathlib/NumberTheory/Padics/RingHoms.lean Modified Mathlib/NumberTheory/PythagoreanTriples.lean Modified Mathlib/NumberTheory/SiegelsLemma.lean Modified Mathlib/NumberTheory/ZetaValues.lean Modified Mathlib/Order/JordanHolder.lean Modified Mathlib/Order/WithBot.lean Modified Mathlib/RingTheory/Artinian/Module.lean Modified Mathlib/RingTheory/Etale/Kaehler.lean Modified Mathlib/RingTheory/FinitePresentation.lean +/- theorem AlgHom.FinitePresentation.of_surjective +/- theorem Algebra.FinitePresentation.of_surjective +/- theorem RingHom.FinitePresentation.of_surjective Modified Mathlib/RingTheory/Finiteness/Finsupp.lean Modified Mathlib/RingTheory/Finiteness/Ideal.lean Modified Mathlib/RingTheory/Ideal/Cotangent.lean +/- theorem Ideal.map_toCotangent_ker Modified Mathlib/RingTheory/Ideal/GoingUp.lean Modified Mathlib/RingTheory/Ideal/Maps.lean +/- theorem RingHom.comap_ker Modified Mathlib/RingTheory/Ideal/Quotient/Operations.lean Modified Mathlib/RingTheory/Int/Basic.lean Modified Mathlib/RingTheory/Jacobson/Ideal.lean Modified Mathlib/RingTheory/Jacobson/Ring.lean Modified Mathlib/RingTheory/LaurentSeries.lean Modified Mathlib/RingTheory/Noetherian/Basic.lean Modified Mathlib/RingTheory/Polynomial/Basic.lean Modified Mathlib/RingTheory/Polynomial/Cyclotomic/Eval.lean Modified Mathlib/RingTheory/UniqueFactorizationDomain/Basic.lean Modified Mathlib/Tactic/NormNum/DivMod.lean Modified Mathlib/Tactic/NormNum/GCD.lean Modified Mathlib/Tactic/NormNum/Result.lean Modified Mathlib/Topology/Algebra/Module/FiniteDimension.lean Modified Mathlib/Topology/Algebra/Module/Simple.lean Modified Mathlib/Topology/Instances/AddCircle.lean Modified Mathlib/Topology/Instances/ENat.lean 2025-04-27 19:30:32 95930a2 chore(RingTheory): add Stacks project tags attribute to `RingHom.Finite`, `RingHom.Finite.to_isIntegral`, `RingHom.IsIntegral` (#24413) `RingHom.Finite`, covered in the Stacks Project tag [0563](https://stacks.math.columbia.edu/tag/0563). `RingHom.Finite.to_isIntegral`, covered in the Stacks Project tag [00GK](https://stacks.math.columbia.edu/tag/00GK). `RingHom.IsIntegral`, covered in the Stacks Project tag [00GI](https://stacks.math.columbia.edu/tag/00GI). Part of the [ICERM Workshop on Autoformalization](https://icerm.brown.edu/program/hot_topics_workshop/htw-25-aftwm). ESTIMATED CHANGES Modified Mathlib/RingTheory/Finiteness/Defs.lean Modified Mathlib/RingTheory/IntegralClosure/Algebra/Basic.lean Modified Mathlib/RingTheory/IntegralClosure/IsIntegral/Defs.lean 2025-04-27 19:30:31 61570b5 feat(Analysis/Asymptotics): add `IsEquivalent.pow/zpow` (#24410) ESTIMATED CHANGES Modified Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean 2025-04-27 18:32:01 04fc112 feat(CategoryTheory): the center of a category (#23777) This PR introduces an abbrevation `CatCenter C` for the center of a category `C`, i.e. the type of endomorphisms of the identity functor of `C`. ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/CategoryTheory/Center/Basic.lean + theorem CategoryTheory.CatCenter.ext + theorem CategoryTheory.CatCenter.mul_app' + theorem CategoryTheory.CatCenter.mul_app 2025-04-27 17:20:51 7b2ce89 feat: ‖x i‖ ≤ ‖x‖ for ProdLp (#24415) This is a followup to #24402. ESTIMATED CHANGES Modified Mathlib/Analysis/Normed/Lp/ProdLp.lean + theorem WithLp.dist_fst_le + theorem WithLp.dist_snd_le + theorem WithLp.edist_fst_le + theorem WithLp.edist_snd_le + theorem WithLp.enorm_fst_le + theorem WithLp.enorm_snd_le + theorem WithLp.nndist_fst_le + theorem WithLp.nndist_snd_le + theorem WithLp.nnnorm_fst_le + theorem WithLp.nnnorm_snd_le + theorem WithLp.norm_fst_le + theorem WithLp.norm_snd_le 2025-04-27 14:08:15 a569d48 feat: pull `Function.update` through recursors (#24318) This adds a quite technical lemma that can be used to generalize some existing lemmas for `Sum` The general version would in principle work for any enumerative inductive type, though only after currying the constructor arguments first. These are `simp` (in the direction pulling `update` to the outside) since that seemed to be useful for #18534, though I could see it either way. ESTIMATED CHANGES Modified Mathlib/Data/Option/Basic.lean + theorem Option.elim'_update Modified Mathlib/Data/Sum/Basic.lean +/- theorem Sum.elim_update_left +/- theorem Sum.elim_update_right + theorem Sum.rec_update_left + theorem Sum.rec_update_right Modified Mathlib/Data/ULift.lean + theorem ULift.rec_update Modified Mathlib/Logic/Function/Basic.lean + theorem Function.rec_update + theorem Option.rec_update 2025-04-27 13:12:32 a801654 chore(*): fix some `Decidable*`/`Fintype` assumptions (#24400) Cherry-picked from #10235 ESTIMATED CHANGES Modified Mathlib/Algebra/Module/ZLattice/Covolume.lean +/- theorem ZLattice.covolume_eq_det_inv +/- theorem ZLattice.volume_image_eq_volume_div_covolume Modified Mathlib/Combinatorics/SimpleGraph/Clique.lean +/- theorem SimpleGraph.IsClique.card_le_cliqueNum +/- theorem SimpleGraph.exists_isNClique_cliqueNum +/- theorem SimpleGraph.exists_isNIndepSet_indepNum +/- theorem SimpleGraph.isIndepSet_neighborSet_of_triangleFree Modified Mathlib/Data/DFinsupp/Defs.lean Modified Mathlib/Data/Matrix/Bilinear.lean 2025-04-27 05:05:27 44f760b feat: `‖x i‖ ≤ ‖x‖` for PiLp (#24402) ESTIMATED CHANGES Modified Mathlib/Analysis/Normed/Lp/PiLp.lean + theorem PiLp.dist_apply_le + theorem PiLp.edist_apply_le + theorem PiLp.enorm_apply_le +/- theorem PiLp.lipschitzWith_equiv_aux + theorem PiLp.nndist_apply_le + theorem PiLp.nnnorm_apply_le + theorem PiLp.norm_apply_le 2025-04-26 23:10:12 99dfc6c feat(Algebra/BigOperators): simprocify `prod_univ_one/two/three/...` (#23425) Add a simproc `prod_univ_many` that rewrites `∏ (i : Fin n), f i` as `f 0 * f 1 * ... * f (n - 1)`, generalizing `prod_univ_one`, `prod_univ_two`, ..., `prod_univ_eight`. ESTIMATED CHANGES Modified Mathlib/Data/Fin/Tuple/Reflection.lean + def FinVec.mkProdEqQ + def FinVec.mkSumEqQ Added MathlibTest/Simproc/ProdUnivMany.lean + theorem prod_test 2025-04-26 22:41:19 a7411a8 refactor(TangentCone): use `AccPt` (#24227) - weaken assumptions in `zero_mem_tangentCone` from `(𝓝[s \ {x}] x).NeBot` to `x ∈ closure s`; - change assumptions here and there from `(𝓝[s \ {x}] x).NeBot` to `AccPt x (𝓟 s)`; - prove `uniqueDiffWithinAt_iff_accPt`. ESTIMATED CHANGES Modified Mathlib/Analysis/Calculus/Deriv/Add.lean Modified Mathlib/Analysis/Calculus/Deriv/Basic.lean + theorem derivWithin_zero_of_not_accPt + theorem derivWithin_zero_of_not_uniqueDiffWithinAt Modified Mathlib/Analysis/Calculus/Deriv/Comp.lean Modified Mathlib/Analysis/Calculus/Deriv/Inv.lean Modified Mathlib/Analysis/Calculus/Deriv/Mul.lean Modified Mathlib/Analysis/Calculus/Deriv/Pow.lean Modified Mathlib/Analysis/Calculus/Deriv/Prod.lean Modified Mathlib/Analysis/Calculus/Deriv/Slope.lean Modified Mathlib/Analysis/Calculus/Deriv/Star.lean Modified Mathlib/Analysis/Calculus/FDeriv/Basic.lean +/- theorem HasFDerivWithinAt.of_nhdsWithin_eq_bot + theorem HasFDerivWithinAt.of_not_accPt + theorem HasFDerivWithinAt.of_not_mem_closure +/- theorem fderivWithin_zero_of_nmem_closure + theorem fderivWithin_zero_of_not_accPt - theorem hasFDerivWithinAt_of_nmem_closure Modified Mathlib/Analysis/Calculus/FDeriv/Extend.lean Modified Mathlib/Analysis/Calculus/IteratedDeriv/Defs.lean Modified Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean Modified Mathlib/Analysis/Calculus/TangentCone.lean + theorem UniqueDiffWithinAt.accPt + theorem tangentConeAt_subset_zero +/- theorem tangentCone_eq_univ + theorem uniqueDiffWithinAt_iff_accPt +/- theorem zero_mem_tangentCone 2025-04-26 15:45:39 cb0f568 refactor(Geometry/Euclidean/Projection): split out orthogonal projections (#24389) Split the definitions and lemmas about orthogonal projections from `Mathlib.Geometry.Euclidean.Basic` (plus some pieces in `Mathlib.Geometry.Euclidean.Circumcenter`) into a separate file `Mathlib.Geometry.Euclidean.Projection`. No definitions, statements or proofs are changed, just moved from one place to another (plus `shake`, plus fixing up the results of `shake` including import removals that worked but weren't pointed out by `shake`). ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/Geometry/Euclidean/Basic.lean - theorem Affine.Simplex.dist_orthogonalProjection_faceOpposite_pos - theorem Affine.Simplex.ne_orthogonalProjection_faceOpposite - theorem EuclideanGeometry.dist_orthogonalProjection_eq_infDist - theorem EuclideanGeometry.dist_orthogonalProjection_eq_infNndist - theorem EuclideanGeometry.dist_orthogonalProjection_eq_zero_iff - theorem EuclideanGeometry.dist_orthogonalProjection_ne_zero_of_not_mem - theorem EuclideanGeometry.dist_reflection - theorem EuclideanGeometry.dist_reflection_eq_of_mem - theorem EuclideanGeometry.dist_sq_eq_dist_orthogonalProjection_sq_add_dist_orthogonalProjection_sq - theorem EuclideanGeometry.dist_sq_smul_orthogonal_vadd_smul_orthogonal_vadd - theorem EuclideanGeometry.eq_orthogonalProjection_of_eq_subspace - theorem EuclideanGeometry.eq_reflection_of_eq_subspace - theorem EuclideanGeometry.inter_eq_singleton_orthogonalProjection - theorem EuclideanGeometry.inter_eq_singleton_orthogonalProjectionFn - def EuclideanGeometry.orthogonalProjectionFn - theorem EuclideanGeometry.orthogonalProjectionFn_eq - theorem EuclideanGeometry.orthogonalProjectionFn_mem - theorem EuclideanGeometry.orthogonalProjectionFn_mem_orthogonal - theorem EuclideanGeometry.orthogonalProjectionFn_vsub_mem_direction_orthogonal - theorem EuclideanGeometry.orthogonalProjection_affineSpan_singleton - theorem EuclideanGeometry.orthogonalProjection_contLinear - theorem EuclideanGeometry.orthogonalProjection_eq_self_iff - theorem EuclideanGeometry.orthogonalProjection_linear - theorem EuclideanGeometry.orthogonalProjection_mem - theorem EuclideanGeometry.orthogonalProjection_mem_orthogonal - theorem EuclideanGeometry.orthogonalProjection_mem_subspace_eq_self - theorem EuclideanGeometry.orthogonalProjection_orthogonalProjection - theorem EuclideanGeometry.orthogonalProjection_vadd_eq_self - theorem EuclideanGeometry.orthogonalProjection_vadd_smul_vsub_orthogonalProjection - theorem EuclideanGeometry.orthogonalProjection_vsub_mem_direction - theorem EuclideanGeometry.orthogonalProjection_vsub_mem_direction_orthogonal - theorem EuclideanGeometry.orthogonalProjection_vsub_orthogonalProjection - def EuclideanGeometry.reflection - theorem EuclideanGeometry.reflection_apply - theorem EuclideanGeometry.reflection_eq_iff_orthogonalProjection_eq - theorem EuclideanGeometry.reflection_eq_self_iff - theorem EuclideanGeometry.reflection_involutive - theorem EuclideanGeometry.reflection_mem_of_le_of_mem - theorem EuclideanGeometry.reflection_orthogonal_vadd - theorem EuclideanGeometry.reflection_reflection - theorem EuclideanGeometry.reflection_symm - theorem EuclideanGeometry.reflection_vadd_smul_vsub_orthogonalProjection - theorem EuclideanGeometry.vsub_orthogonalProjection_mem_direction - theorem EuclideanGeometry.vsub_orthogonalProjection_mem_direction_orthogonal Modified Mathlib/Geometry/Euclidean/Circumcenter.lean - theorem Affine.Simplex.coe_orthogonalProjection_vadd_smul_vsub_orthogonalProjection - theorem Affine.Simplex.dist_sq_eq_dist_orthogonalProjection_sq_add_dist_orthogonalProjection_sq - def Affine.Simplex.orthogonalProjectionSpan - theorem Affine.Simplex.orthogonalProjection_vadd_smul_vsub_orthogonalProjection - theorem EuclideanGeometry.dist_eq_iff_dist_orthogonalProjection_eq - theorem EuclideanGeometry.dist_set_eq_iff_dist_orthogonalProjection_eq - theorem EuclideanGeometry.exists_dist_eq_iff_exists_dist_orthogonalProjection_eq Added Mathlib/Geometry/Euclidean/Projection.lean + theorem Affine.Simplex.coe_orthogonalProjection_vadd_smul_vsub_orthogonalProjection + theorem Affine.Simplex.dist_orthogonalProjection_faceOpposite_pos + theorem Affine.Simplex.dist_sq_eq_dist_orthogonalProjection_sq_add_dist_orthogonalProjection_sq + theorem Affine.Simplex.ne_orthogonalProjection_faceOpposite + def Affine.Simplex.orthogonalProjectionSpan + theorem Affine.Simplex.orthogonalProjection_vadd_smul_vsub_orthogonalProjection + theorem EuclideanGeometry.dist_eq_iff_dist_orthogonalProjection_eq + theorem EuclideanGeometry.dist_orthogonalProjection_eq_infDist + theorem EuclideanGeometry.dist_orthogonalProjection_eq_infNndist + theorem EuclideanGeometry.dist_orthogonalProjection_eq_zero_iff + theorem EuclideanGeometry.dist_orthogonalProjection_ne_zero_of_not_mem + theorem EuclideanGeometry.dist_reflection + theorem EuclideanGeometry.dist_reflection_eq_of_mem + theorem EuclideanGeometry.dist_set_eq_iff_dist_orthogonalProjection_eq + theorem EuclideanGeometry.dist_sq_eq_dist_orthogonalProjection_sq_add_dist_orthogonalProjection_sq + theorem EuclideanGeometry.dist_sq_smul_orthogonal_vadd_smul_orthogonal_vadd + theorem EuclideanGeometry.eq_orthogonalProjection_of_eq_subspace + theorem EuclideanGeometry.eq_reflection_of_eq_subspace + theorem EuclideanGeometry.exists_dist_eq_iff_exists_dist_orthogonalProjection_eq + theorem EuclideanGeometry.inter_eq_singleton_orthogonalProjection + theorem EuclideanGeometry.inter_eq_singleton_orthogonalProjectionFn + def EuclideanGeometry.orthogonalProjectionFn + theorem EuclideanGeometry.orthogonalProjectionFn_eq + theorem EuclideanGeometry.orthogonalProjectionFn_mem + theorem EuclideanGeometry.orthogonalProjectionFn_mem_orthogonal + theorem EuclideanGeometry.orthogonalProjectionFn_vsub_mem_direction_orthogonal + theorem EuclideanGeometry.orthogonalProjection_affineSpan_singleton + theorem EuclideanGeometry.orthogonalProjection_contLinear + theorem EuclideanGeometry.orthogonalProjection_eq_self_iff + theorem EuclideanGeometry.orthogonalProjection_linear + theorem EuclideanGeometry.orthogonalProjection_mem + theorem EuclideanGeometry.orthogonalProjection_mem_orthogonal + theorem EuclideanGeometry.orthogonalProjection_mem_subspace_eq_self + theorem EuclideanGeometry.orthogonalProjection_orthogonalProjection + theorem EuclideanGeometry.orthogonalProjection_vadd_eq_self + theorem EuclideanGeometry.orthogonalProjection_vadd_smul_vsub_orthogonalProjection + theorem EuclideanGeometry.orthogonalProjection_vsub_mem_direction + theorem EuclideanGeometry.orthogonalProjection_vsub_mem_direction_orthogonal + theorem EuclideanGeometry.orthogonalProjection_vsub_orthogonalProjection + def EuclideanGeometry.reflection + theorem EuclideanGeometry.reflection_apply + theorem EuclideanGeometry.reflection_eq_iff_orthogonalProjection_eq + theorem EuclideanGeometry.reflection_eq_self_iff + theorem EuclideanGeometry.reflection_involutive + theorem EuclideanGeometry.reflection_mem_of_le_of_mem + theorem EuclideanGeometry.reflection_orthogonal_vadd + theorem EuclideanGeometry.reflection_reflection + theorem EuclideanGeometry.reflection_symm + theorem EuclideanGeometry.reflection_vadd_smul_vsub_orthogonalProjection + theorem EuclideanGeometry.vsub_orthogonalProjection_mem_direction + theorem EuclideanGeometry.vsub_orthogonalProjection_mem_direction_orthogonal Modified Mathlib/Geometry/Euclidean/SignedDist.lean Modified Mathlib/Geometry/Euclidean/Sphere/Tangent.lean 2025-04-26 15:06:52 48c5b81 feat(RingTheory/Polynomial): irreducible polynomials are primitive (#24348) ESTIMATED CHANGES Modified Mathlib/RingTheory/Polynomial/Content.lean + theorem Irreducible.isPrimitive 2025-04-26 09:48:02 a0dbca2 chore(Order): process some porting notes (#24362) ESTIMATED CHANGES Modified Mathlib/Order/ConditionallyCompleteLattice/Basic.lean Modified Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean Modified Mathlib/Order/Filter/Tendsto.lean Modified Mathlib/Order/Fin/Basic.lean Modified Mathlib/Order/Hom/Basic.lean + theorem OrderIso.lt_symm_apply + theorem OrderIso.symm_apply_lt 2025-04-26 03:37:40 a91fc5c feat(Algebra/Order/Field/Defs): generalize lemmas (#24377) ... from linear ordered semifields to (commutative) groups with zero. ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Field/Defs.lean - theorem inv_mul_le_one - theorem inv_mul_left_le - theorem inv_mul_right_le - theorem le_inv_mul_left - theorem le_inv_mul_right - theorem le_mul_div_mul_left - theorem le_mul_div_mul_right - theorem le_mul_inv_left - theorem le_mul_inv_right - theorem mul_div_mul_left_le - theorem mul_div_mul_right_le - theorem mul_inv_le_one - theorem mul_inv_left_le - theorem mul_inv_right_le Modified Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean + theorem inv_mul_le_one + theorem inv_mul_left_le + theorem inv_mul_right_le + theorem le_inv_mul_left + theorem le_inv_mul_right + theorem le_mul_div_mul_left + theorem le_mul_div_mul_right + theorem le_mul_inv_left + theorem le_mul_inv_right + theorem mul_div_mul_left_le + theorem mul_div_mul_right_le + theorem mul_inv_le_one + theorem mul_inv_left_le + theorem mul_inv_right_le 2025-04-26 03:11:58 cb4d0ad chore(Data): remove erw (#24332) Removes three instances of `erw` in `Data` ESTIMATED CHANGES Modified Mathlib/Data/Multiset/Fintype.lean + theorem Multiset.map_univ_comp_coe Modified Mathlib/Data/TypeVec.lean 2025-04-25 13:55:56 5fd096b chore: use TreeMap in to_additive (#24366) This PR avoids use of `Lean.RBMap` in the implementation of `to_additive`, where the new `Std.TreeMap` suffices. ESTIMATED CHANGES Modified Mathlib/Tactic/ToAdditive/Frontend.lean +/- def ToAdditive.endCapitalNames 2025-04-25 13:55:54 ce2c549 chore: use Std.TreeMap in itauto (#24365) This PR avoids use of `Lean.RBMap` in the implementation of `itauto`, where the new `Std.TreeMap` suffices. ESTIMATED CHANGES Modified Mathlib/Tactic/ITauto.lean - def Mathlib.Tactic.ITauto.Context 2025-04-25 13:36:44 fb36f5e feat: add ENormedAddCommMonoid ENNReal instance (#24368) ESTIMATED CHANGES Modified Mathlib/Analysis/Normed/Group/Basic.lean 2025-04-25 13:11:27 c4fc2e6 feat: add iSup lemmas (#23178) ESTIMATED CHANGES Modified Mathlib/Topology/Instances/NNReal/Lemmas.lean + theorem ENNReal.iSup_pow + theorem ENNReal.iSup_pow_of_ne_zero + def ENNReal.powOrderIso + theorem NNReal.iSup_pow + theorem NNReal.iSup_pow_of_ne_zero + theorem Real.iSup_pow + theorem Real.iSup_pow_of_ne_zero 2025-04-25 10:48:06 aaf7807 doc: better example in Module.finrank docstring (#24363) Q has finrank 1 over Z but isn't finitely-generated as a Z-module. ESTIMATED CHANGES Modified Mathlib/LinearAlgebra/Dimension/Finrank.lean 2025-04-25 07:22:49 11cedf3 chore(AlgebraicGeometry/EllipticCurve/*): refactor VariableChange (#23217) Drop certain definitions in `VariableChange` in favor of mathlib's built-in notation: - `VariableChange.id` -> `(1 : VariableChange R)` - `VariableChange.comp C C'` -> `C * C'` - `VariableChange.inv C` -> `C⁻¹` - `W.variableChange C` -> `C • W` ESTIMATED CHANGES Modified Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean Modified Mathlib/AlgebraicGeometry/EllipticCurve/IsomOfJ.lean +/- theorem WeierstrassCurve.exists_variableChange_of_j_eq Modified Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean +/- theorem WeierstrassCurve.exists_variableChange_isCharNeTwoNF +/- theorem WeierstrassCurve.exists_variableChange_isCharThreeNF +/- theorem WeierstrassCurve.exists_variableChange_isCharTwoNF +/- theorem WeierstrassCurve.exists_variableChange_isShortNF +/- theorem WeierstrassCurve.toCharThreeNF_spec_of_b₂_eq_zero +/- theorem WeierstrassCurve.toShortNFOfCharThree_a₂ +/- theorem WeierstrassCurve.toShortNFOfCharThree_spec Modified Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean - def WeierstrassCurve.VariableChange.comp - theorem WeierstrassCurve.VariableChange.comp_assoc - theorem WeierstrassCurve.VariableChange.comp_id - theorem WeierstrassCurve.VariableChange.comp_left_inv - def WeierstrassCurve.VariableChange.id - theorem WeierstrassCurve.VariableChange.id_comp - def WeierstrassCurve.VariableChange.inv + theorem WeierstrassCurve.VariableChange.inv_def + theorem WeierstrassCurve.VariableChange.mul_def + theorem WeierstrassCurve.VariableChange.one_def +/- theorem WeierstrassCurve.coe_inv_variableChange_Δ' +/- theorem WeierstrassCurve.coe_variableChange_Δ' +/- theorem WeierstrassCurve.inv_variableChange_Δ' +/- theorem WeierstrassCurve.map_variableChange - def WeierstrassCurve.variableChange + theorem WeierstrassCurve.variableChange_a₁ + theorem WeierstrassCurve.variableChange_a₂ + theorem WeierstrassCurve.variableChange_a₃ + theorem WeierstrassCurve.variableChange_a₄ + theorem WeierstrassCurve.variableChange_a₆ +/- theorem WeierstrassCurve.variableChange_b₂ +/- theorem WeierstrassCurve.variableChange_b₄ +/- theorem WeierstrassCurve.variableChange_b₆ +/- theorem WeierstrassCurve.variableChange_b₈ - theorem WeierstrassCurve.variableChange_comp +/- theorem WeierstrassCurve.variableChange_c₄ +/- theorem WeierstrassCurve.variableChange_c₆ + theorem WeierstrassCurve.variableChange_def - theorem WeierstrassCurve.variableChange_id +/- theorem WeierstrassCurve.variableChange_j +/- theorem WeierstrassCurve.variableChange_Δ' +/- theorem WeierstrassCurve.variableChange_Δ 2025-04-25 07:04:21 7d8506d feat(FieldTheory): add the class `IsQuadraticExtension` (#24114) ESTIMATED CHANGES Modified Mathlib/FieldTheory/Fixed.lean + theorem AlgEquiv.card_le + theorem AlgHom.card_le Modified Mathlib/FieldTheory/Galois/Basic.lean Modified Mathlib/FieldTheory/KummerExtension.lean Modified Mathlib/FieldTheory/Normal/Basic.lean - theorem normal_of_finrank_eq_two Modified Mathlib/LinearAlgebra/Dimension/Finrank.lean Modified Mathlib/LinearAlgebra/FiniteDimensional/Basic.lean 2025-04-25 06:33:09 8cb295b feat(Algebra/BigOperators/Finprod): add `mul_finsum_mem` / `finsum_mem_mul` (#24336) This PR adds the analogues of `mul_finsum` and `finsum_mul` for `finsum_mem`. ESTIMATED CHANGES Modified Mathlib/Algebra/BigOperators/Finprod.lean + theorem finsum_mem_mul + theorem mul_finsum_mem 2025-04-25 04:02:43 50ab41a feat(Bicategory/Oplax): Fix simp lemmas and renaming (#18252) This PR renames `OplaxNatTrans` to `OplaxTrans` and puts it in the `Oplax` namespace (as there should also be oplax natural transformations between lax functors, so this is more fitting). It also removes `@[simp]` from `OplaxTrans.id` and `OplaxTrans.vcomp`, and instead adds `@[simp!]` to the `CategoryStruct` instance. This is needed as for example, right now, in order to prove that `(η ≫ θ).app a = η.app a ≫ θ.app a` simp needs to first convert this to `(OplaxTrans.vcomp η θ).app a` which is not ideal (in particular it converts `(η ≫ θ)` to `OplaxTrans.vcomp η θ`). This is part of some of the restructuring that I want to do before constructing the bicategory of pseudofunctors. ESTIMATED CHANGES Modified Mathlib/CategoryTheory/Bicategory/Modification/Oplax.lean Modified Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Oplax.lean + def CategoryTheory.Oplax.OplaxTrans.id + def CategoryTheory.Oplax.OplaxTrans.vcomp + theorem CategoryTheory.Oplax.OplaxTrans.whiskerLeft_naturality_comp + theorem CategoryTheory.Oplax.OplaxTrans.whiskerLeft_naturality_id + theorem CategoryTheory.Oplax.OplaxTrans.whiskerLeft_naturality_naturality + theorem CategoryTheory.Oplax.OplaxTrans.whiskerRight_naturality_comp + theorem CategoryTheory.Oplax.OplaxTrans.whiskerRight_naturality_id + theorem CategoryTheory.Oplax.OplaxTrans.whiskerRight_naturality_naturality + structure CategoryTheory.Oplax.OplaxTrans - structure CategoryTheory.OplaxNatTrans.StrongCore - def CategoryTheory.OplaxNatTrans.id - def CategoryTheory.OplaxNatTrans.vcomp - theorem CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_comp - theorem CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_id - theorem CategoryTheory.OplaxNatTrans.whiskerLeft_naturality_naturality - theorem CategoryTheory.OplaxNatTrans.whiskerRight_naturality_comp - theorem CategoryTheory.OplaxNatTrans.whiskerRight_naturality_id - theorem CategoryTheory.OplaxNatTrans.whiskerRight_naturality_naturality - structure CategoryTheory.OplaxNatTrans Modified Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Strong.lean + structure CategoryTheory.OplaxTrans.StrongCore - theorem CategoryTheory.StrongOplaxNatTrans.id.toOplax - def CategoryTheory.StrongOplaxNatTrans.id - def CategoryTheory.StrongOplaxNatTrans.mkOfOplax - def CategoryTheory.StrongOplaxNatTrans.toOplax - def CategoryTheory.StrongOplaxNatTrans.vcomp - theorem CategoryTheory.StrongOplaxNatTrans.whiskerLeft_naturality_comp - theorem CategoryTheory.StrongOplaxNatTrans.whiskerLeft_naturality_id - theorem CategoryTheory.StrongOplaxNatTrans.whiskerLeft_naturality_naturality - theorem CategoryTheory.StrongOplaxNatTrans.whiskerRight_naturality_comp - theorem CategoryTheory.StrongOplaxNatTrans.whiskerRight_naturality_id - theorem CategoryTheory.StrongOplaxNatTrans.whiskerRight_naturality_naturality - structure CategoryTheory.StrongOplaxNatTrans + theorem CategoryTheory.StrongOplaxTrans.id.toOplax + def CategoryTheory.StrongOplaxTrans.id + def CategoryTheory.StrongOplaxTrans.mkOfOplax + def CategoryTheory.StrongOplaxTrans.toOplax + def CategoryTheory.StrongOplaxTrans.vcomp + theorem CategoryTheory.StrongOplaxTrans.whiskerLeft_naturality_comp + theorem CategoryTheory.StrongOplaxTrans.whiskerLeft_naturality_id + theorem CategoryTheory.StrongOplaxTrans.whiskerLeft_naturality_naturality + theorem CategoryTheory.StrongOplaxTrans.whiskerRight_naturality_comp + theorem CategoryTheory.StrongOplaxTrans.whiskerRight_naturality_id + theorem CategoryTheory.StrongOplaxTrans.whiskerRight_naturality_naturality + structure CategoryTheory.StrongOplaxTrans 2025-04-25 00:52:14 c2e3118 feat(LinearAlgebra/AffineSpace/ContinuousAffineEquiv): `toContinuousAffineMap` (#23732) Add the conversion from `ContinuousAffineEquiv` to `ContinuousAffineMap`, which seems to be missing from mathlib. I'm not sure exactly what API such conversions are meant to have - `toHomeomorph` doesn't have any - but I added `rfl` lemmas about converting to a function either directly or via `toContinuousAffineMap`, and about different pairs of conversion paths involving `toContinuousAffineMap` producing the same result, as well as injectivity of `toContinuousAffineMap`. ESTIMATED CHANGES Modified Mathlib/LinearAlgebra/AffineSpace/ContinuousAffineEquiv.lean + theorem ContinuousAffineEquiv.coe_toContinuousAffineMap + def ContinuousAffineEquiv.toContinuousAffineMap + theorem ContinuousAffineEquiv.toContinuousAffineMap_injective + theorem ContinuousAffineEquiv.toContinuousAffineMap_toAffineMap + theorem ContinuousAffineEquiv.toContinuousAffineMap_toContinuousMap + theorem ContinuousAffineEquiv.trans_toContinuousAffineMap + theorem ContinuousLinearEquiv.toContinuousAffineEquiv_toContinuousAffineMap 2025-04-24 23:11:28 0d05f2a feat (LinearAlgebra/BilinearMap): restrict scalars and range of a linear map (#24345) This PR introduces `restrictScalarsRange`, which is a linear map that restricts the scalars and range of a linear map. The function previously named `restrictScalarsRange` is about bilinear maps, and is renamed `restrictScalarsRange₂`. ESTIMATED CHANGES Modified Mathlib/LinearAlgebra/BilinearMap.lean +/- theorem LinearMap.eq_restrictScalarsRange_iff + theorem LinearMap.eq_restrictScalarsRange₂_iff +/- theorem LinearMap.restrictScalarsRange_apply +/- theorem LinearMap.restrictScalarsRange_apply_eq_zero_iff + theorem LinearMap.restrictScalarsRange₂_apply + theorem LinearMap.restrictScalarsRange₂_apply_eq_zero_iff Modified Mathlib/LinearAlgebra/PerfectPairing/Restrict.lean Modified Mathlib/LinearAlgebra/RootSystem/RootPositive.lean 2025-04-24 23:11:27 2b50f1c feat: restrict `to_additive existing` syntax (#24280) Previously, you could write `to_additive (attr := simp) existing`, and `existing` could even be written multiple times, which doesn't make sense. This PR only allows one occurrence of `existing`, and it must come before `(attr := ..)` and `(reorder := ..)`. ESTIMATED CHANGES Modified Mathlib/Algebra/BigOperators/Pi.lean Modified Mathlib/Analysis/Normed/Group/Seminorm.lean Modified Mathlib/Combinatorics/Additive/DoublingConst.lean Modified Mathlib/Data/ZMod/Basic.lean Modified Mathlib/Tactic/ToAdditive/Frontend.lean Modified Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean 2025-04-24 23:11:26 f962d8d chore: remove @[trans] annotations on orders (#24277) `trans` can use the `Trans` and `IsTrans` typeclasses to determine the transitivity of `≤` and `<`. So all these general `@[trans]` tags on these lemmas are redundant (or even bad). There is also a bug in `trans` that causes the tactic to not work with lemmas about `≤` and `<` that are tagged with `@[trans]`, so these tags weren't doing anything anyways. ESTIMATED CHANGES Modified Mathlib/Order/Antisymmetrization.lean Modified Mathlib/Order/Defs/PartialOrder.lean +/- theorem ge_trans +/- theorem gt_of_ge_of_gt +/- theorem gt_of_gt_of_ge +/- theorem gt_trans +/- theorem le_trans +/- theorem lt_of_le_of_lt +/- theorem lt_of_lt_of_le +/- theorem lt_trans 2025-04-24 23:04:43 24e9a8f chore(RingTheory/DedekindDomain): fix doc (#24319) ESTIMATED CHANGES Modified Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean 2025-04-24 21:27:34 3804f24 feat: distributive Haar characters (#23603) The name is made up in analogy with modular characters. From FLT ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/MeasureTheory/Measure/Haar/DistribChar.lean + theorem MeasureTheory.addHaarScalarFactor_smul_eq_distribHaarChar + theorem MeasureTheory.addHaarScalarFactor_smul_eq_distribHaarChar_inv + theorem MeasureTheory.addHaarScalarFactor_smul_inv_eq_distribHaarChar + theorem MeasureTheory.distribHaarChar_eq_div + theorem MeasureTheory.distribHaarChar_eq_of_measure_smul_eq_mul + theorem MeasureTheory.distribHaarChar_mul + theorem MeasureTheory.distribHaarChar_pos 2025-04-24 21:17:17 feaee44 feat(CategoryTheory): categories of homological complexes are Grothendieck abelian (#20230) ESTIMATED CHANGES Modified Mathlib.lean Added Mathlib/Algebra/Homology/GrothendieckAbelian.lean 2025-04-24 20:38:33 fd19b25 chore(Ring/Basic): merge `inv_neg` and `inv_neg'` (#24335) The non-primed version was strictly more general. Also rename `instHasDistribNeg` to `MulOpposite.instHasDistribNeg`. ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Field/Power.lean Modified Mathlib/Algebra/Ring/Basic.lean - theorem inv_neg' Modified Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean Modified Mathlib/LinearAlgebra/Orientation.lean 2025-04-24 20:38:32 67bb601 feat(Topology/Module): `ContinuousNeg.of_continuousConstSMul` (#24334) This lemma is useful if we already assume `[ContinuousConstSMul R M]` but don't assume `[IsTopologicalAddGroup M]`. ESTIMATED CHANGES Modified Mathlib/Topology/Algebra/Module/Basic.lean + theorem ContinuousNeg.of_continuousConstSMul 2025-04-24 20:38:31 bd9c5bb chore(CStarAlgebra): remove `PositiveLinearMapClass` (#24300) This PR removes the typeclass `PositiveLinearMapClass`, meant as the morphism class corresponding to `PositiveLinearMap`. This class is equivalent to a combination of `LinearMapClass` and `OrderHomClass`, and it is probably best to remove it as it mixes algebra and order; in fact, it caused performance problems while I was experimenting with completely positive maps. ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Module/PositiveLinearMap.lean Modified Mathlib/Analysis/CStarAlgebra/PositiveLinearMap.lean 2025-04-24 20:04:38 8ca285c chore(Algebra/Order/GroupWithZero): review (#24301) Reorder lemmas, unify assumptions, generalize from `LinearOrder` to `PartialOrder`. Lemmas in this file used to have many different sets of typeclass assumptions, so they were sorted according to the assumptions. Recently, I've reduced the number of sets of assumptions, but didn't reorder the lemmas. In this PR, I further unify assumptions and reorder theorems. ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Group/Pointwise/Interval.lean +/- theorem Set.image_affine_Icc' +/- theorem Set.image_affine_Ico +/- theorem Set.image_affine_Ioc +/- theorem Set.image_affine_Ioo Modified Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean + theorem MulPosReflectLE.of_posMulReflectLT_of_mulPosMono + theorem Right.inv_nonneg +/- theorem div_le_div_iff_of_pos_left +/- theorem div_le_div_iff_of_pos_right +/- theorem div_lt_div_iff_of_pos_left +/- theorem div_lt_div_iff_of_pos_right +/- theorem div_lt_div_of_pos_left +/- theorem div_nonpos_of_nonpos_of_nonneg +/- theorem inv_le_one_of_one_le₀ +/- theorem inv_mul_le_iff₀ +/- theorem inv_mul_lt_iff₀ +/- theorem le_inv_mul_iff₀ +/- theorem le_mul_inv_iff₀ +/- theorem lt_inv_mul_iff₀ +/- theorem lt_mul_inv_iff₀ +/- theorem mul_inv_le_iff₀ +/- theorem mul_inv_lt_iff₀ +/- theorem one_le_inv_iff₀ +/- theorem zpow_nonneg +/- theorem zpow_pos 2025-04-24 19:56:05 a23b5d5 refactor(ChosenFiniteProducts): don't make finite-product-preserving functors monoidal (#24049) Instead, reprove all the theorems about finite-product-preserving functors under the appropriate `LaxMonoidal`/ `OplaxMonoidal`/`Monoidal` assumptions. Also take the opportunity to sort the file slightly, correct docstrings and a few names. From Toric ESTIMATED CHANGES Modified Mathlib/Algebra/Category/Grp/ChosenFiniteProducts.lean Modified Mathlib/Algebra/Category/Grp/LeftExactFunctor.lean Modified Mathlib/CategoryTheory/ChosenFiniteProducts.lean + theorem CategoryTheory.ChosenFiniteProducts.leftUnitor_hom + theorem CategoryTheory.ChosenFiniteProducts.rightUnitor_hom + theorem CategoryTheory.ChosenFiniteProducts.whiskerLeft_toUnit_comp_rightUnitor_hom + theorem CategoryTheory.ChosenFiniteProducts.whiskerRight_toUnit_comp_leftUnitor_hom - theorem CategoryTheory.Functor.EssImageSubcategory.associator_hom_def - theorem CategoryTheory.Functor.EssImageSubcategory.associator_inv_def - theorem CategoryTheory.Functor.EssImageSubcategory.fst_def - theorem CategoryTheory.Functor.EssImageSubcategory.lift_def - theorem CategoryTheory.Functor.EssImageSubcategory.snd_def - theorem CategoryTheory.Functor.EssImageSubcategory.tensor_obj - theorem CategoryTheory.Functor.EssImageSubcategory.toUnit_def - theorem CategoryTheory.Functor.EssImageSubcategory.whiskerLeft_def - theorem CategoryTheory.Functor.EssImageSubcategory.whiskerRight_def - theorem CategoryTheory.Functor.Monoidal.lift_δ - theorem CategoryTheory.Functor.Monoidal.lift_μ - theorem CategoryTheory.Functor.Monoidal.toUnit_ε - theorem CategoryTheory.Functor.Monoidal.δ_fst - theorem CategoryTheory.Functor.Monoidal.δ_snd - theorem CategoryTheory.Functor.Monoidal.ε_of_chosenFiniteProducts - theorem CategoryTheory.Functor.Monoidal.μ_comp - theorem CategoryTheory.Functor.Monoidal.μ_fst - theorem CategoryTheory.Functor.Monoidal.μ_of_chosenFiniteProducts - theorem CategoryTheory.Functor.Monoidal.μ_snd + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.associator_hom_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.associator_inv_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.fst_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.lift_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.snd_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.tensor_obj + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.toUnit_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.whiskerLeft_def + theorem CategoryTheory.Functor.OplaxMonoidal.EssImageSubcategory.whiskerRight_def + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.lift_δ + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.lift_μ + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.nonempty_monoidal_iff_preservesFiniteProducts + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.toUnit_ε + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.δ_fst + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.δ_snd + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.ε_of_chosenFiniteProducts + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.μ_comp + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.μ_fst + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.μ_of_chosenFiniteProducts + theorem CategoryTheory.Functor.OplaxMonoidal.Monoidal.μ_snd + def CategoryTheory.Functor.OplaxMonoidal.ofChosenFiniteProducts + theorem CategoryTheory.Functor.OplaxMonoidal.δ_of_chosenFiniteProducts + theorem CategoryTheory.Functor.OplaxMonoidal.η_of_chosenFiniteProducts - def CategoryTheory.Functor.oplaxMonoidalOfChosenFiniteProducts - theorem CategoryTheory.Functor.δ_of_chosenFiniteProducts - theorem CategoryTheory.Functor.η_of_chosenFiniteProducts Modified Mathlib/CategoryTheory/Closed/Cartesian.lean Modified Mathlib/CategoryTheory/Monoidal/CommGrp_.lean Modified Mathlib/CategoryTheory/Monoidal/Grp_.lean 2025-04-24 18:18:14 156e745 feat(Algebra/Polynomial): add `mapAlgEquiv_toAlgHom` (#24349) ESTIMATED CHANGES Modified Mathlib/Algebra/Polynomial/AlgebraMap.lean +/- theorem Polynomial.mapAlgEquiv_comp + theorem Polynomial.mapAlgEquiv_toAlgHom 2025-04-24 17:34:46 d9004fd feat(Dynamics/TopologicalEntropy): Topological entropy and subsets (#24262) This file implements basic facts about the topological entropy of subsets of a dynamical system: monotonicity, closure, unions. ESTIMATED CHANGES Modified Mathlib.lean Modified Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean + theorem Dynamics.ball_dynEntourage_mem_nhds Added Mathlib/Dynamics/TopologicalEntropy/Subset.lean + theorem Dynamics.IsDynCoverOf.closure + theorem Dynamics.IsDynCoverOf.monotone_subset + theorem Dynamics.IsDynCoverOf.union + theorem Dynamics.IsDynNetIn.monotone_subset + theorem Dynamics.coverEntropyEntourage_closure + theorem Dynamics.coverEntropyEntourage_monotone + theorem Dynamics.coverEntropyEntourage_union + theorem Dynamics.coverEntropyInfEntourage_closure + theorem Dynamics.coverEntropyInfEntourage_monotone + theorem Dynamics.coverEntropyInf_biUnion_le + theorem Dynamics.coverEntropyInf_closure + theorem Dynamics.coverEntropyInf_iUnion_le + theorem Dynamics.coverEntropyInf_monotone + theorem Dynamics.coverEntropy_biUnion_finset + theorem Dynamics.coverEntropy_biUnion_le + theorem Dynamics.coverEntropy_closure + theorem Dynamics.coverEntropy_iUnion_le + theorem Dynamics.coverEntropy_iUnion_of_finite + theorem Dynamics.coverEntropy_monotone + theorem Dynamics.coverEntropy_union + theorem Dynamics.coverMincard_closure_le + theorem Dynamics.coverMincard_monotone_subset + theorem Dynamics.coverMincard_union_le + theorem Dynamics.netEntropyEntourage_monotone + theorem Dynamics.netEntropyInfEntourage_monotone + theorem Dynamics.netMaxcard_monotone_subset Modified Mathlib/Topology/UniformSpace/Defs.lean + theorem UniformSpace.ball_iInter 2025-04-24 17:05:54 81a25d1 chore: fix recently introduced name (#24340) This was added yesterday. As such, I don't think this warrants a deprecation at all. ESTIMATED CHANGES Modified Mathlib/CategoryTheory/Closed/Ideal.lean - theorem CategoryTheory.Limits.PreservesFiniteProducts._of_exponentialIdeal + theorem CategoryTheory.Limits.PreservesFiniteProducts.of_exponentialIdeal 2025-04-24 17:05:52 e8eb83f chore: generalise results about `x ^ n = ⊤` to `WithTop` (#24339) And mark them simp ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Ring/WithTop.lean + theorem WithTop.eq_top_of_pow + theorem WithTop.pow_eq_top_iff + theorem WithTop.pow_lt_top + theorem WithTop.pow_lt_top_iff + theorem WithTop.pow_ne_top + theorem WithTop.pow_ne_top_iff +/- theorem WithTop.top_pow Modified Mathlib/Analysis/SpecialFunctions/Log/ENNRealLog.lean Modified Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean Modified Mathlib/Data/ENNReal/Inv.lean Modified Mathlib/Data/ENNReal/Operations.lean + theorem ENNReal.eq_top_of_pow - theorem ENNReal.pow_eq_top +/- theorem ENNReal.pow_eq_top_iff +/- theorem ENNReal.pow_lt_top + theorem ENNReal.pow_lt_top_iff +/- theorem ENNReal.pow_ne_top + theorem ENNReal.pow_ne_top_iff +/- theorem ENNReal.top_pow Modified Mathlib/Data/ENat/Basic.lean + theorem ENat.eq_top_of_pow + theorem ENat.pow_eq_top_iff + theorem ENat.pow_lt_top_iff + theorem ENat.pow_ne_top_iff +/- theorem ENat.top_pow Modified Mathlib/Dynamics/TopologicalEntropy/CoverEntropy.lean Modified Mathlib/MeasureTheory/Measure/Hausdorff.lean Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/ConvexBody.lean Modified Mathlib/Probability/Variance.lean 2025-04-24 16:21:49 dffc587 feat(Prod/Lex): prove `Prod.Lex.covBy_iff` (#24185) Also - move the definitions of `CovBy` and `WCovBy` to `Defs/PartialOrder`; - rename instances to use `inst*`; - golf a proof using `aesop`. ESTIMATED CHANGES Modified Mathlib/Algebra/Module/LinearMap/Defs.lean Modified Mathlib/Algebra/Module/Submodule/Map.lean Modified Mathlib/Data/Fin/FlagRange.lean Modified Mathlib/Data/Prod/Lex.lean + theorem Prod.Lex.covBy_iff + theorem Prod.Lex.monotone_fst_ofLex + theorem Prod.Lex.toLex_covBy_toLex_iff Modified Mathlib/Order/Cover.lean - def CovBy - def WCovBy Modified Mathlib/Order/Defs/PartialOrder.lean + def CovBy + def WCovBy 2025-04-24 15:36:41 acfb1af refactor: generalise `Finset.isLUB_sup` to an arbitrary function (#24325) ESTIMATED CHANGES Modified Mathlib/Data/Finset/Lattice/Fold.lean +/- theorem Finset.isGLB_inf + theorem Finset.isGLB_inf_id +/- theorem Finset.isLUB_sup + theorem Finset.isLUB_sup_id 2025-04-24 15:29:57 9062fa8 feat: `insert (b + 1) (Ioc a b) = Ioc a (b + 1)` (#24037) And shorten recently introduced names for consistency ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Interval/Finset/SuccPred.lean - theorem Finset.insert_Icc_eq_Icc_add_one_right - theorem Finset.insert_Icc_eq_Icc_sub_one_left + theorem Finset.insert_Icc_left_eq_Icc_sub_one + theorem Finset.insert_Icc_right_eq_Icc_add_one + theorem Finset.insert_Ico_left_eq_Ico_sub_one + theorem Finset.insert_Ico_left_eq_Ico_sub_one_of_not_isMin + theorem Finset.insert_Ico_right_eq_Ico_add_one + theorem Finset.insert_Ico_right_eq_Ico_add_one_of_not_isMax - theorem Finset.insert_Ico_right_eq_Ico_add_one_right - theorem Finset.insert_Ico_right_eq_Ico_add_one_right_of_not_isMax + theorem Finset.insert_Ico_sub_one_right_eq_Ico + theorem Finset.insert_Ioc_add_one_left_eq_Ioc + theorem Finset.insert_Ioc_left_eq_Ioc_sub_one - theorem Finset.insert_Ioc_left_eq_Ioc_sub_one_left - theorem Finset.insert_Ioc_left_eq_Ioc_sub_one_left_of_not_isMin + theorem Finset.insert_Ioc_left_eq_Ioc_sub_one_of_not_isMin + theorem Finset.insert_Ioc_right_eq_Ioc_add_one + theorem Finset.insert_Ioc_right_eq_Ioc_add_one_of_not_isMax Modified Mathlib/Algebra/Order/Interval/Set/SuccPred.lean - theorem Set.insert_Icc_eq_Icc_add_one_right - theorem Set.insert_Icc_eq_Icc_sub_one_left + theorem Set.insert_Icc_left_eq_Icc_sub_one + theorem Set.insert_Icc_right_eq_Icc_add_one + theorem Set.insert_Ico_left_eq_Ico_sub_one + theorem Set.insert_Ico_left_eq_Ico_sub_one_of_not_isMin + theorem Set.insert_Ico_right_eq_Ico_add_one + theorem Set.insert_Ico_right_eq_Ico_add_one_of_not_isMax - theorem Set.insert_Ico_right_eq_Ico_add_one_right - theorem Set.insert_Ico_right_eq_Ico_add_one_right_of_not_isMax + theorem Set.insert_Ico_sub_one_right_eq_Ico + theorem Set.insert_Ioc_add_one_left_eq_Ioc + theorem Set.insert_Ioc_left_eq_Ioc_sub_one - theorem Set.insert_Ioc_left_eq_Ioc_sub_one_left - theorem Set.insert_Ioc_left_eq_Ioc_sub_one_left_of_not_isMin + theorem Set.insert_Ioc_left_eq_Ioc_sub_one_of_not_isMin + theorem Set.insert_Ioc_right_eq_Ioc_add_one + theorem Set.insert_Ioc_right_eq_Ioc_add_one_of_not_isMax Modified Mathlib/Order/Interval/Finset/SuccPred.lean - theorem Finset.insert_Icc_eq_Icc_pred_left - theorem Finset.insert_Icc_eq_Icc_succ_right + theorem Finset.insert_Icc_left_eq_Icc_pred + theorem Finset.insert_Icc_right_eq_Icc_succ + theorem Finset.insert_Ico_left_eq_Ico_pred + theorem Finset.insert_Ico_left_eq_Ico_pred_of_not_isMin + theorem Finset.insert_Ico_pred_right_eq_Ico + theorem Finset.insert_Ico_right_eq_Ico_succ + theorem Finset.insert_Ico_right_eq_Ico_succ_of_not_isMax - theorem Finset.insert_Ico_right_eq_Ico_succ_right - theorem Finset.insert_Ico_right_eq_Ico_succ_right_of_not_isMax + theorem Finset.insert_Ioc_left_eq_Ioc_pred - theorem Finset.insert_Ioc_left_eq_Ioc_pred_left - theorem Finset.insert_Ioc_left_eq_Ioc_pred_left_of_not_isMin + theorem Finset.insert_Ioc_left_eq_Ioc_pred_of_not_isMin + theorem Finset.insert_Ioc_right_eq_Ioc_succ + theorem Finset.insert_Ioc_right_eq_Ioc_succ_of_not_isMax + theorem Finset.insert_Ioc_succ_left_eq_Ioc Modified Mathlib/Order/Interval/Set/SuccPred.lean - theorem Set.insert_Icc_eq_Icc_pred_left - theorem Set.insert_Icc_eq_Icc_succ_right + theorem Set.insert_Icc_left_eq_Icc_pred + theorem Set.insert_Icc_right_eq_Icc_succ + theorem Set.insert_Ico_left_eq_Ico_pred + theorem Set.insert_Ico_left_eq_Ico_pred_of_not_isMin + theorem Set.insert_Ico_pred_right_eq_Ico + theorem Set.insert_Ico_right_eq_Ico_succ + theorem Set.insert_Ico_right_eq_Ico_succ_of_not_isMax - theorem Set.insert_Ico_right_eq_Ico_succ_right - theorem Set.insert_Ico_right_eq_Ico_succ_right_of_not_isMax + theorem Set.insert_Ioc_left_eq_Ioc_pred - theorem Set.insert_Ioc_left_eq_Ioc_pred_left - theorem Set.insert_Ioc_left_eq_Ioc_pred_left_of_not_isMin + theorem Set.insert_Ioc_left_eq_Ioc_pred_of_not_isMin + theorem Set.insert_Ioc_right_eq_Ioc_succ + theorem Set.insert_Ioc_right_eq_Ioc_succ_of_not_isMax + theorem Set.insert_Ioc_succ_left_eq_Ioc 2025-04-24 13:51:59 3a0bc63 feat(NumberField/CanonicalEmbedding/NormLeOne): prove that the frontier of `normLeOne` has zero-volume (#22779) This is the last PR about `normLeOne K`. We prove that it is a bounded set and that its frontier has volume zero. This PR is part of the proof of the Analytic Class Number Formula. ESTIMATED CHANGES Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/Basic.lean + theorem NumberField.mixedEmbedding.continuous_normAtAllPlaces Modified Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean + theorem NumberField.mixedEmbedding.fundamentalCone.closure_normLeOne_subset + theorem NumberField.mixedEmbedding.fundamentalCone.closure_paramSet + theorem NumberField.mixedEmbedding.fundamentalCone.closure_paramSet_ae_interior + theorem NumberField.mixedEmbedding.fundamentalCone.compactSet_ae + theorem NumberField.mixedEmbedding.fundamentalCone.compactSet_eq_union + theorem NumberField.mixedEmbedding.fundamentalCone.compactSet_eq_union_aux₁ + theorem NumberField.mixedEmbedding.fundamentalCone.compactSet_eq_union_aux₂ + theorem NumberField.mixedEmbedding.fundamentalCone.expMapBasis_closure_subset_compactSet + theorem NumberField.mixedEmbedding.fundamentalCone.interior_paramSet + theorem NumberField.mixedEmbedding.fundamentalCone.isBounded_normLeOne + theorem NumberField.mixedEmbedding.fundamentalCone.isCompact_compactSet + theorem NumberField.mixedEmbedding.fundamentalCone.measurableSet_interior_paramSet + theorem NumberField.mixedEmbedding.fundamentalCone.nonneg_of_mem_compactSet + theorem NumberField.mixedEmbedding.fundamentalCone.subset_interior_normLeOne + theorem NumberField.mixedEmbedding.fundamentalCone.volume_frontier_normLeOne + theorem NumberField.mixedEmbedding.fundamentalCone.volume_interior_eq_volume_closure + theorem NumberField.mixedEmbedding.fundamentalCone.zero_mem_compactSet 2025-04-24 13:19:47 788d3e0 feat (Algebra/Module/Submodule/LinearMap): Lift a linear map that takes values in the range of an injective linear map. (#24306) Given a linear map `f : M → N` whose values lie in the image of an injective linear map `p : P → N`, one has a unique lift to a linear map `M → P` that makes the triangle commute. ESTIMATED CHANGES Modified Mathlib/Algebra/Module/Submodule/LinearMap.lean + theorem LinearMap.codLift_apply + theorem LinearMap.comp_codLift 2025-04-24 12:56:46 c3c5337 feature(Algebra/Order/Ring/Basic): Add Odd.pow_eq_pow (#24308) Use the injectivity of strict monotonic functions to show that `a^n = b^n ↔ a = b` for `n` odd in a strict linear ordered semiring. ESTIMATED CHANGES Modified Mathlib/Algebra/Order/Ring/Basic.lean + theorem Odd.pow_inj + theorem Odd.pow_injective + theorem Odd.pow_le_pow + theorem Odd.pow_lt_pow 2025-04-24 11:48:38 2e9484d feat: add the strict triangle inequality for non-Wbtw points, a related AffineIndependent lemma (#24104) Adds `dist_lt_dist_add_dist_iff` and `AffineIndependent.not_wbtw_of_injective`. These can be composed to prove that the strict triangle inequality holds for the points of an `Affine.Triangle`. See [this zulip thread](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/strict.20triangle.20inequality.20in.20Euclidean.20space/near/512427539). ESTIMATED CHANGES Modified Mathlib/Analysis/Convex/Between.lean + theorem AffineIndependent.not_wbtw_of_injective Modified Mathlib/Analysis/Convex/StrictConvexBetween.lean + theorem dist_lt_dist_add_dist_iff 2025-04-24 11:24:14 1afbc43 fix(CI): use Lean error message in problem-matcher-wrap (#24316) This PR fixes the missing build error message annotations in GitHub. Lean switched to a different syntax for error messages, and the action we used to annotate the commit/PR with those errors did not have support for that format. I made a fork of the action that does know how to parse Lean error messages, and use that to wrap the builds. For example, see the output of [this build](https://github.com/leanprover-community/mathlib4/actions/runs/14617507898/job/41009027153):