Welcome to the PR triage page! This page is perfect if you intend to look for pull request which seem to have stalled.
Feedback on designing this page or further information to include is very welcome.
Quick links: PR statistics | Not yet landed PRs | Review status | Needs triage: unassigned PRs | Needs triage: assigned PRs | Likely-spurious CI failures | Tech debt PRs | PRs blocked on a zulip discussion | PRs with just a merge conflict | Stale new contributor PRs | PRs not into master | PRs with an 'approved' review | All open PRs | Other lists of PRs
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 25473 | adomani | feat(CI): check that Mathlib files have lean or md extension | Twice recently there have been files with an "intended" `.lean` extension in `Mathlib/`: * #24942, ending in `;lean`; * #25457, ending in `.Lean`. `mk_all` does not add these files to `Mathlib.lean`, since they do not end in `.lean` and this later causes problems. This CI step checks that all files in `Mathlib/` end with `.lean` or `.md`. See #25474 for a test where the new step [correctly fails](https://github.com/leanprover-community/mathlib4/actions/runs/15464097783/job/43532018379?pr=25474). --- [](https://gitpod.io/from-referrer/) | CI delegated | 10/0 | .github/workflows/lint_and_suggest_pr.yml | 1 | 10 | ['adomani', 'bryangingechen', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 10 months ago | 330 days ago | 2 hours |
| 29855 | eric-wieser | chore(Data/Finset/Sort): lemmas about `0 : Fin _` and `Fin.last _` | We already had these for `⟨0, ⋯⟩` and `⟨k - 1, ⋯⟩`. Moves: - `Finset.orderEmbOfFin_zero` -> `Finset.orderEmbOfFin_mk_zero` - `Finset.orderEmbOfFin_last` -> `Finset.orderEmbOfFin_mk_last` --- [](https://gitpod.io/from-referrer/) | t-data t-order delegated easy | 17/7 | Mathlib/Combinatorics/Enumerative/Composition.lean,Mathlib/Data/Finset/Sort.lean | 2 | 4 | ['eric-wieser', 'github-actions', 'mathlib-bors', 'ocfnash'] | nobody | 6 months ago | 218 days ago | 3 days |
| 27180 | ADedecker | feat: quotient of a monoid with zero by a multiplicative congruence | --- My motivation is getting a more conceptual construction of [ValuativeRel.ValueGroupWithZero](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Valuation/ValuativeRel.html#ValuativeRel.ValueGroupWithZero), but I think this is of independent interest. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra delegated | 141/26 | Mathlib.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/GroupWithZero.lean | 5 | 32 | ['ADedecker', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'ocfnash'] | ocfnash | 6 months ago | 261 days ago | 28 days |
| 25765 | JovanGerb | feat(gcongr): lemma for rewriting inside divisibility | TODO: add test to show that we can rewrite using `a ≡ b [ZMOD n]` inside `n ∣ 2 * a + 1`. edit: it's not yet entirely clear if this is the right thing to do. edit: This lemma should be written using iff (or =), so that we can use it specifically when rewriting with a symmetric relation. Supporting equality in `gcongr` is still work in progress. --- [](https://gitpod.io/from-referrer/) | delegated t-data | 5/0 | Mathlib/Data/Int/ModEq.lean | 1 | 3 | ['fpvandoorn', 'github-actions', 'mathlib-bors'] | nobody | 5 months ago | 322 days ago | 1 day |
| 25500 | eric-wieser | feat: delaborators for metadata | Being able to see these is very important when debugging tactic failures. Probably these could be upstreamed, but I don't think that's a reason not to merge them here first. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict awaiting-author delegated t-meta | 75/3 | Mathlib/Util/Delaborators.lean,Mathlib/Util/PPOptions.lean,MathlibTest/delaborators.lean | 3 | 19 | ['JovanGerb', 'Rob23oba', 'eric-wieser', 'github-actions', 'kmill', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'plp127'] | nobody | 3 months ago | 246 days ago | 43 days |
| 27702 | FLDutchmann | feat(NumberTheory/SelbergSieve): define Lambda-squared sieves and prove important properties | This PR continues the work from #22052. Original PR: https://github.com/leanprover-community/mathlib4/pull/22052 - [x] depends on: #27820 | t-number-theory delegated merge-conflict | 186/7 | Mathlib/NumberTheory/SelbergSieve.lean | 1 | 44 | ['FLDutchmann', 'MichaelStollBayreuth', 'bryangingechen', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | MichaelStollBayreuth | 2 months ago | 141 days ago | 15 days |
| 24965 | erdOne | refactor: Make `IsLocalHom` take unbundled map | Under the current definition, `IsLocalHom f` and `IsLocalHom f.toMonoidHom` are not defeq, which causes quite some annoyances. We also have a consensus to not use `*HomClass` in definitions. As a result, we change `IsLocalHom` to take an unbundled function instead of a funlike. --- [](https://gitpod.io/from-referrer/) | t-algebra delegated merge-conflict | 18/9 | Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/Geometry/RingedSpace/LocallyRingedSpace.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean | 5 | 15 | ['adomani', 'alreadydone', 'erdOne', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp'] | mattrobball | 2 months ago | 164 days ago | 24 days |
| 34932 | erdOne | feat(AlgebraicGeometry): formally etale morphisms | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry merge-conflict delegated | 163/12 | Mathlib.lean,Mathlib/AlgebraicGeometry/Morphisms/Etale.lean,Mathlib/AlgebraicGeometry/Morphisms/FormallyEtale.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/RingTheory/RingHom/Etale.lean | 5 | 17 | ['chrisflav', 'erdOne', 'github-actions', 'joneugster', 'mathlib-bors', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 2 months ago | 65 days ago | 11 days |
| 25737 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms): Normal forms for `P_δ`s | We prove that admissible lists indeed provide a normal form for morphisms of satisfying `P_δ`. 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 first simplicial identity, composition on the left corresponds to simplicial insertion in the list. This gives existence of a normal form for every morphism satisfying `P_δ`. 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. Part of a series of PR formalising that `SimplexCategoryGenRel` is equivalent to `SimplexCategory`. --- - [x] depends on: #25736 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #21746.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/21746* | t-algebraic-topology delegated t-category-theory | 181/2 | Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean | 1 | 6 | ['github-actions', 'joelriou', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 193 days ago | 6 hours |
| 35436 | daniel-carranza | feat(CategoryTheory/Monoidal/Closed): Prove the isomorphism of internal hom objects C(x \otimes y, z) and C(y, C(x, z)) | Prove the currying-uncurrying isomorphism `C(x \otimes y, z) \iso C(y, C(x, z))` between internal hom objects of a closed monoidal category `C`. --- This result is connected to the infinity-cosmos project, and is used to prove that a closed monoidal category enriched in itself admits all cotensors. ~Line 81 currently contains a one-line proof in tactics mode `exact rfl`. When trying to use `rfl` outside of tactics mode, an error is thrown~ (Fixed, thank you @robin-carlier!). Any help with this (or any other aspect of the formalization) is greatly appreciated! [](https://gitpod.io/from-referrer/) | new-contributor t-category-theory infinity-cosmos delegated | 89/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Closed/InternalCurrying.lean | 2 | 15 | ['dagurtomas', 'daniel-carranza', 'github-actions', 'joelriou', 'mathlib-bors', 'riccardobrasca', 'robin-carlier'] | adamtopaz | 1 month ago | 63 days ago | 7 days |
| 33691 | kim-em | feat(scripts): add find-ci-errors.sh to diagnose widespread CI failures | This PR adds a script that searches through recent failed CI workflow runs to find open PRs whose current CI contains a specific error string. Useful for diagnosing widespread CI issues affecting multiple PRs (e.g., infrastructure problems, toolchain bugs). **Usage:** ```bash # Find all PRs currently failing with a specific error ./scripts/find-ci-errors.sh "Error parsing args: cannot parse arguments" # Find PRs and automatically add please-merge-master label to trigger rebuilds ./scripts/find-ci-errors.sh --please-merge-master "cannot parse arguments" ``` The `--please-merge-master` flag skips PRs with merge conflicts, and the label is automatically removed by CI once the build completes. 🤖 Prepared with Claude Code | CI delegated merge-conflict LLM-generated | 196/0 | scripts/README.md,scripts/find-ci-errors.sh | 2 | 6 | ['bryangingechen', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 114 days ago | 1 hour |
| 31092 | FlAmmmmING | feat(Algebra/Group/ForwardDiff.lean): Add theorem `sum_shift_eq_fwdDiff_iter`. | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor delegated | 17/1 | Mathlib/Algebra/Group/ForwardDiff.lean | 1 | 20 | ['BeibeiX0', 'FlAmmmmING', 'Ruben-VandeVelde', 'dagurtomas', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 99 days ago | 54 days |
| 35588 | eric-wieser | chore(Util/Qq): remove `meta` | These are wrappers of existing functions on `Expr`s which are also not marked `meta`. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-CI delegated | 7/7 | Mathlib/Data/Multiset/Sort.lean,Mathlib/Tactic/FieldSimp/Lemmas.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/Order/ToInt.lean,Mathlib/Tactic/Simproc/Divisors.lean,Mathlib/Tactic/Simproc/FinsetInterval.lean,Mathlib/Util/Qq.lean | 7 | 3 | ['Vierkantor', 'github-actions', 'mathlib-bors'] | nobody | 1 month ago | 69 days ago | 1 minute |
| 26911 | JovanGerb | chore: fix naming of `mono` and `monotone` | The naming convention says: "We use `_mono` for `a ≤ b → f a ≤ f b` and `_anti` for `a ≤ b → f b ≤ f a`, so we also use `_monotone` for `Monotone f`, `_antitone` for `Antitone f`, `_strictMono` for `StrictMono f`, `_strictAnti` for `StrictAnti f`, etc..." This PR swaps `mono`/`anti` and `monotone`/`antitone` where required so that `monotone` refers to `Monotone`, while `mono` refers to a lemma that might be tagged with `@[gcongr]` This PR does not address - `monotone_right`/`mono_right` vs `right_monotone`/`right_mono` - `monotone_arcsin` vs `arcsin_monotone` edit: TODO: `ideal_mono` and friends --- [](https://gitpod.io/from-referrer/) | delegated merge-conflict | 235/169 | Archive/Imo/Imo1962Q1.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Group/Basic.lean,Mathlib/Algebra/Order/Group/Finset.lean,Mathlib/Algebra/Order/Group/PosPart.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Polynomial/Degree/CardPowDegree.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Convex/Deriv.lean,Mathlib/Analysis/Normed/Order/UpperLower.lean,Mathlib/Analysis/Normed/Unbundled/SeminormFromConst.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/Combinatorics/SetFamily/Kleitman.lean,Mathlib/Combinatorics/SimpleGraph/Girth.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Lemma.lean,Mathlib/Data/ENNReal/Inv.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Pow.lean,Mathlib/Data/Nat/Choose/Factorization.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/MeasurableSpace/MeasurablyGenerated.lean,Mathlib/MeasureTheory/OuterMeasure/Operations.lean,Mathlib/NumberTheory/Bertrand.lean,Mathlib/NumberTheory/FermatPsp.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/ModularForms/Bounds.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/WithVal.lean,Mathlib/Order/Concept.lean,Mathlib/Order/Filter/AtTopBot/Archimedean.lean,Mathlib/Order/Filter/AtTopBot/Defs.lean,Mathlib/Order/Fin/Basic.lean,Mathlib/Order/Heyting/Basic.lean,Mathlib/Order/Heyting/Boundary.lean,Mathlib/Order/Heyting/Regular.lean,Mathlib/Order/Hom/Set.lean,Mathlib/Order/Interval/Set/Fin.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/UpperLower/Closure.lean,Mathlib/Probability/StrongLaw.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Basic.lean,Mathlib/RingTheory/FractionalIdeal/Basic.lean,Mathlib/RingTheory/WittVector/Basic.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean,Mathlib/Topology/MetricSpace/Antilipschitz.lean | 63 | 11 | ['JovanGerb', 'bryangingechen', 'github-actions', 'leanprover-community-bot-assistant', 'linesthatinterlace', 'mathlib-bors', 'mathlib-merge-conflicts'] | bryangingechen | 1 month ago | 294 days ago | 2 days |
| 37232 | mathlib-splicebot | chore(Algebra/Order): bound on `|n / m|ₘ` and `|n - m|` | This PR was automatically created from PR #34722 by @GrigorenkoPV via a [review comment](https://github.com/leanprover-community/mathlib4/pull/34722#discussion_r2996870566) by @Vierkantor. | t-algebra delegated | 5/0 | Mathlib/Algebra/Order/Group/Unbundled/Abs.lean | 1 | 6 | ['Vierkantor', 'bryangingechen', 'github-actions', 'mathlib-bors'] | nobody | 1 month ago | 36 days ago | 9 minutes |
| 37507 | gasparattila | chore(Topology/Algebra/Module/Star): tag continuity lemmas with `fun_prop` | --- [](https://gitpod.io/from-referrer/) | t-topology easy delegated | 4/4 | Mathlib/Topology/Algebra/Module/Star.lean | 1 | 3 | ['gasparattila', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 1 month ago | 30 days ago | 35 minutes |
| 31135 | kckennylau | feat(RingTheory): is localization iff is localization on saturation | In this PR we show that `A` is a localization of `R` on the submonoid `S` iff it is so on the saturation of `S`. Crucially, the saturation of `S` is precisely the elements that become a unit in `A`. --- - [x] depends on: #31132 [](https://gitpod.io/from-referrer/) | t-ring-theory delegated | 53/0 | Mathlib.lean,Mathlib/RingTheory/Localization/Saturation.lean | 2 | 15 | ['alreadydone', 'chrisflav', 'github-actions', 'kckennylau', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | chrisflav | 24 days ago | 24 days ago | 32 days |
| 37889 | LLaurance | chore(Algebra): shorten proof by using tactic mode instead of calc mode | --- [](https://gitpod.io/from-referrer/) | t-algebra delegated | 4/13 | Mathlib/Algebra/Star/Center.lean | 1 | 16 | ['JovanGerb', 'LLaurance', 'faenuccio', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-bors', 'themathqueen'] | nobody | 12 days ago | 20 days ago | 1 day |
| 31425 | robertmaxton42 | feat(Topology): implement delaborators for non-standard topology notation | Add delaborators for unary and binary notation related to non-standard topologies in the TopologicalSpace namespace. --- [](https://gitpod.io/from-referrer/) | t-topology delegated | 274/5 | Mathlib.lean,Mathlib/Topology/Defs/Basic.lean,Mathlib/Util/DelabNonCanonical.lean,MathlibTest/Delab/TopologicalSpace.lean | 4 | 73 | ['Vierkantor', 'eric-wieser', 'github-actions', 'j-loreaux', 'jcommelin', 'kckennylau', 'mathlib-bors', 'robertmaxton42'] | alreadydone | 7 days ago | 16 days ago | 125 days |
| 31607 | grunweg | chore: rename `continuous{,On,At,Within}_const` to `ContinuousFoo.const` | Zulip discussion: [#mathlib4 > Naming convention @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Naming.20convention/near/447491526) --- - [x] depends on: #34441 - [x] depends on: #34688 [](https://gitpod.io/from-referrer/) | delegated merge-conflict | 412/378 | Archive/Hairer.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/BoxIntegral/UnitPartition.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Continuity.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/MeanValue.lean,Mathlib/Analysis/Calculus/DiffContOnCl.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/MeanValue.lean,Mathlib/Analysis/Calculus/Rademacher.lean,Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Complex/AbsMax.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/HalfPlane.lean,Mathlib/Analysis/Complex/LocallyUniformLimit.lean,Mathlib/Analysis/Complex/PhragmenLindelof.lean,Mathlib/Analysis/Complex/RemovableSingularity.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Measure.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Metric.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean,Mathlib/Analysis/Convex/Cone/InnerDual.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/PartitionOfUnity.lean,Mathlib/Analysis/Convex/Side.lean,Mathlib/Analysis/Convex/StdSimplex.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Continuous.lean,Mathlib/Analysis/InnerProductSpace/Harmonic/HarmonicContOnCl.lean,Mathlib/Analysis/InnerProductSpace/LinearPMap.lean,Mathlib/Analysis/InnerProductSpace/MeanErgodic.lean,Mathlib/Analysis/InnerProductSpace/OfNorm.lean,Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Meromorphic/Order.lean,Mathlib/Analysis/Meromorphic/TrailingCoefficient.lean,Mathlib/Analysis/Normed/Affine/AddTorsor.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/Normed/Group/Lemmas.lean,Mathlib/Analysis/Normed/Module/Ball/Homeomorph.lean,Mathlib/Analysis/Normed/Module/Connected.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Normed/Operator/Completeness.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Isometric.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Deligne.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/PoissonSummation.lean,Mathlib/Analysis/SpecialFunctions/Integrability/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Analysis/SpecialFunctions/MulExpNegMulSq.lean,Mathlib/Analysis/SpecialFunctions/PolarCoord.lean,Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean,Mathlib/Computability/AkraBazzi/SumTransform.lean,Mathlib/Condensed/Light/TopCatAdjunction.lean,Mathlib/Condensed/TopCatAdjunction.lean,Mathlib/Dynamics/OmegaLimit.lean,Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean,Mathlib/Geometry/Manifold/Bordism.lean,Mathlib/Geometry/Manifold/Complex.lean,Mathlib/Geometry/Manifold/Instances/Icc.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/SmoothApprox.lean,Mathlib/MeasureTheory/Function/SpecialFunctions/Basic.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Integral/CircleIntegral.lean,Mathlib/MeasureTheory/Integral/CircleTransform.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,Mathlib/MeasureTheory/Integral/RieszMarkovKakutani/Real.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/NumberTheory/Cyclotomic/CyclotomicCharacter.lean,Mathlib/NumberTheory/Harmonic/ZetaAsymp.lean,Mathlib/NumberTheory/LSeries/AbstractFuncEq.lean,Mathlib/NumberTheory/LSeries/Deriv.lean,Mathlib/NumberTheory/LSeries/Dirichlet.lean,Mathlib/NumberTheory/LSeries/DirichletContinuation.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaOdd.lean,Mathlib/NumberTheory/LSeries/PrimesInAP.lean | 185 | 15 | ['github-actions', 'j-loreaux', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 days ago | 168 days ago | 1 second |
| 37441 | lecopivo | fix(FunProp): be less strict about the shape of morphism theorems | Don't be so restrictive about the shape of morphism theorems Right now, `fun_prop` has a problem with a bundled morphism `Foo α` that coerces to `α → α → α` . The coerced function has two arguments and there is an unnecessary restriction about this. This PR lifts that restriction. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60fun_prop.60.20in.20.60FunLike.60.20with.20multiple.20arguments/with/582731349) --- [](https://gitpod.io/from-referrer/) | t-meta delegated | 42/14 | Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,MathlibTest/fun_prop_dev.lean | 3 | 6 | ['Vierkantor', 'github-actions', 'joneugster', 'mathlib-bors'] | joneugster | 4 days ago | 4 days ago | 26 days |
| 36794 | vihdzp | doc(SetTheory/Ordinal/Principal): improve documentation | The module docstring now contains a description of what an `op`-principal actually is. I've also added some additional names for discoverability. --- [](https://gitpod.io/from-referrer/) | t-set-theory documentation delegated | 24/18 | Mathlib/SetTheory/Ordinal/Principal.lean,Mathlib/SetTheory/Ordinal/Veblen.lean | 2 | 16 | ['SnirBroshi', 'Vierkantor', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 day ago | 1 day ago | 42 days |
| 38732 | eric-wieser | fix: revert and fix #38703 | #38703 removed the canary intended to detect a broken lemma, without fixing the lemma. --- [](https://gitpod.io/from-referrer/) | t-algebra delegated | 4/11 | Mathlib/Algebra/Group/Action/Units.lean | 1 | 5 | ['github-actions', 'kbuzzard', 'mathlib-bors'] | nobody | 1 day ago | 1 day ago | 15 hours |
| 36891 | vihdzp | feat(SetTheory/Ordinal/Exponential): characterization of `a ^ b = 1` | Used in the CGT repo. --- [](https://gitpod.io/from-referrer/) | t-set-theory delegated | 12/0 | Mathlib/SetTheory/Ordinal/Exponential.lean | 1 | 9 | ['SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'vihdzp'] | b-mehta | 1 day ago | 1 day ago | 41 days |
There are currently 453 PRs awaiting review. Among these,
On the other hand, 124 PRs are unassigned and have not seen a status change in three days, and 14 PRs are assigned and have seen no review movement in two weeks.
These are triage-oriented views, not the main review queue. Updating a PR may remove it from one of these lists, but does not remove it from the review queue unless the PR's status changes out of awaiting review.
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Approval(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 37179 | IvanRenison | feat(Combinatorics/SimpleGraph): add lemmas about left and right elements of `SimpleGraph.sum` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 18/0 | Mathlib/Combinatorics/SimpleGraph/Sum.lean | 1 | 3 | ['WilliamCoram', 'github-actions'] | nobody | none | 1 month ago | 36 days ago | 36 days |
| 37443 | SnirBroshi | feat(Combinatorics/SimpleGraph/Walks/Operations): permutations of support | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 15/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | none | 29 days ago | 29 days ago | 30 days |
| 32583 | MJ141592 | refactor(SimpleGraph): change bridges not to require the edge to be present | Remove the requirement for edges to exist in definition of isBridge, and then change the related lemmas to adjust for this, by renaming, fixing the statements and fixing the proofs, including in Acyclic. Closes #31690. --- - [x] depends on: #36802 - [x] depends on: #36804 | t-combinatorics new-contributor | 84/84 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean | 4 | 20 | ['MJ141592', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | none | 29 days ago | 29 days ago | 29 days |
| 36832 | KryptosAI | chore(Data/Finset/Card): rename `pred_card_le_card_erase` to `sub_one_card_le_card_erase` | ## Summary The name `pred_card_le_card_erase` suggests `Nat.pred` but the statement uses `- 1` (i.e., `Nat.sub 1`). Rename to `sub_one_card_le_card_erase` to match the actual statement. A deprecated alias is added for backwards compatibility. ### Files changed - `Mathlib/Data/Finset/Card.lean` — definition renamed + deprecated alias - `Mathlib/Data/Finset/Powerset.lean` — reference updated - `Mathlib/Combinatorics/Additive/SubsetSum.lean` — reference updated - `Mathlib/Algebra/Polynomial/EraseLead.lean` — reference updated Addresses the `Finset.pred_card_le_card_erase` item in #21584. ## AI disclosure I used Claude Code to explore the codebase (finding all references to rename) and to draft the PR description. I reviewed and understand all changes — these are straightforward renames with a deprecated alias. | new-contributor | 22/15 | Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Combinatorics/Additive/SubsetSum.lean,Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean,Mathlib/Combinatorics/SetFamily/Shadow.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Set/Card.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/RingTheory/Ideal/Operations.lean | 9 | 5 | ['KryptosAI', 'Multramate', 'github-actions', 'ooovi'] | nobody | 1 | 28 days ago | 28 days ago | 42 days |
| 37248 | harahu | doc(Tactic): avoid lazy continuation lines | We resolve the ambiguity inherent in lazy (un-indented) list item continuation lines by either indenting them or separating them by inserting a newline in the cases where the item continuation was a mistake. --- [](https://gitpod.io/from-referrer/) | documentation | 131/116 | Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/ComputeDegree.lean,Mathlib/Tactic/DepRewrite.lean,Mathlib/Tactic/Finiteness.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/SimpIntro.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Widget/InteractiveUnfold.lean | 17 | 1 | ['Multramate', 'github-actions'] | nobody | 1 | 28 days ago | 35 days ago | 35 days |
| 37495 | IvanRenison | feat(Combinatorics/SimpleGraph/Sum): add homomorphism, embedding and isomorphism of sums | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 58/2 | Mathlib/Combinatorics/SimpleGraph/Sum.lean | 1 | 15 | ['IvanRenison', 'YaelDillies', 'github-actions', 'mkaratarakis'] | nobody | none | 28 days ago | 28 days ago | 29 days |
| 37399 | SnirBroshi | feat(Combinatorics/SimpleGraph/Paths): `IsPath` and `Nil` lemmas | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 10/3 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean | 2 | 4 | ['Rida-Hamadani', 'SnirBroshi', 'github-actions'] | nobody | none | 28 days ago | 31 days ago | 31 days |
| 37624 | IvanRenison | feat(Combinatorics/SimpleGraph/Maps): add theorems about composition | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 25/4 | Mathlib/Combinatorics/SimpleGraph/Maps.lean | 1 | 1 | ['github-actions'] | nobody | none | 27 days ago | 27 days ago | 27 days |
| 37702 | grunweg | chore: golf using {norm,push}_cast | Not exhaustive --- [](https://gitpod.io/from-referrer/) | 23/22 | Archive/Imo/Imo2025Q3.lean,Mathlib/Algebra/Ring/GeomSum.lean,Mathlib/Analysis/Asymptotics/LinearGrowth.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Data/Int/Log.lean,Mathlib/GroupTheory/CommutingProbability.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/QExpansion.lean,Mathlib/NumberTheory/SumFourSquares.lean,Mathlib/RingTheory/DividedPowers/RatAlgebra.lean,Mathlib/RingTheory/LittleWedderburn.lean,Mathlib/RingTheory/WittVector/WittPolynomial.lean | 12 | 5 | ['github-actions', 'grunweg', 'j-loreaux'] | nobody | none | 24 days ago | 24 days ago | 25 days | |
| 37690 | yuanyi-350 | feat(Combinatorics/Enumerative/Bell): sum over partition shapes | ## Summary - add multiplicative lemmas relating `Multiset.bell` when inserting a part - prove `Nat.bell` as a sum of `Multiset.bell` over partition shapes - Kill TODO in `Mathlib/Combinatorics/Enumerative/Bell.lean` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 153/16 | Mathlib/Combinatorics/Enumerative/Bell.lean | 1 | 1 | ['github-actions'] | nobody | none | 24 days ago | 25 days ago | 25 days |
| 37762 | EtienneC30 | feat: scalar multiplication of an `NNReal` against `1 : ENNReal` | --- [](https://gitpod.io/from-referrer/) | t-data | 4/3 | Mathlib/Data/ENNReal/Action.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Probability.lean,Mathlib/Probability/Distributions/SetBernoulli.lean | 3 | 1 | ['github-actions'] | nobody | none | 24 days ago | 24 days ago | 24 days |
| 37642 | SnirBroshi | chore(Combinatorics/SimpleGraph): tidy various files | --- Concept inspired by @Ruben-VandeVelde :) [](https://gitpod.io/from-referrer/) | t-combinatorics | 89/72 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Copy.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/IncMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Subwalks.lean | 8 | 2 | ['SnirBroshi', 'github-actions'] | nobody | none | 24 days ago | 24 days ago | 26 days |
| 37784 | SnirBroshi | feat(Order/ConditionallyCompleteLattice/Basic): `ConditionallyCompleteLinearOrderBot (WithBot α)` | --- [](https://gitpod.io/from-referrer/) | t-order | 29/0 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | 1 | 1 | ['github-actions'] | nobody | none | 23 days ago | 23 days ago | 23 days |
| 37185 | gasparattila | chore(Data/Finset/Lattice/Fold): rename `comp_sup_*` to `apply_sup_*` | These lemmas are of the form `g (s.sup f) = s.sup (g ∘ f)` with no composition on the LHS. --- - [x] depends on: #37047 [](https://gitpod.io/from-referrer/) | 44/26 | Mathlib/Algebra/Order/Ring/Finset.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/Normed/Group/Ultra.lean,Mathlib/Data/ENNReal/Lemmas.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/NNReal/Basic.lean,Mathlib/Order/PartialSups.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/Topology/ContinuousMap/CompactlySupported.lean,Mathlib/Topology/ContinuousMap/Ordered.lean | 11 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | none | 22 days ago | 22 days ago | 22 days | |
| 37697 | IvanRenison | feat(Combinatorics/SimpleGraph/Clique): add theorems about cliques and induced graphs | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 22/0 | Mathlib/Combinatorics/SimpleGraph/Clique.lean | 1 | 9 | ['Rida-Hamadani', 'SnirBroshi', 'github-actions'] | nobody | 1 | 21 days ago | 25 days ago | 25 days |
| 36764 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `DirectSum.lequivCongrLeft_lof`: unchanged 🎉 * `AnalyticOnNhd.preimage_mem_codiscreteWithin`: unchanged 🎉 * `mem_permsOfList_of_mem`: unchanged 🎉 * `PNat.mod_le`: unchanged 🎉 * `Computation.map_parallel`: unchanged 🎉 * `Sigma.curry_update`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 11/41 | Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Data/Fintype/Perm.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Seq/Parallel.lean,Mathlib/Data/Sigma/Basic.lean | 6 | 13 | ['chenson2018', 'euprunin', 'github-actions', 'mathlib-merge-conflicts'] | nobody | none | 20 days ago | 20 days ago | 45 days | |
| 37055 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `OreLocalization.smul'_char`: unchanged 🎉 * `Equiv.Perm.cycleOf_mem_cycleFactorsFinset_iff`: unchanged 🎉 * `StrictMono.ite'`: unchanged 🎉 * `Mathlib.Meta.NormNum.isInt_ediv`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 10/29 | Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Factors.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Tactic/NormNum/DivMod.lean | 4 | 11 | ['chenson2018', 'euprunin', 'github-actions'] | nobody | none | 20 days ago | 20 days ago | 38 days | |
| 36693 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Equiv.Perm.ofSubtype_swap_eq`: unchanged 🎉 * `Filter.hasBasis_biInf_of_directed'`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 2/10 | Mathlib/GroupTheory/Perm/Support.lean | 1 | 4 | ['artie2000', 'chenson2018', 'euprunin', 'github-actions'] | nobody | 2 | 20 days ago | 46 days ago | 46 days | |
| 37700 | IvanRenison | feat(Combinatorics/SimpleGraph/Maps): add `Iso.induceIso` | Similar to `induceHom` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 29/0 | Mathlib/Combinatorics/SimpleGraph/Maps.lean | 1 | 3 | ['github-actions', 'vlad902'] | nobody | none | 19 days ago | 19 days ago | 25 days |
| 37928 | AlexeyMilovanov | refactor(Computability.Encoding): unbundle Γ and remove FinEncoding | This PR unbundles the alphabet `Γ` from the `Encoding` structure and completely removes `FinEncoding`. `Encoding`: The alphabet `Γ` is now an explicit parameter: `structure Encoding (α : Type u) (Γ : Type v)`. `FinEncoding`: Removed. Finiteness is now handled via standard typeclasses (e.g., `[Fintype Γ] (e : Encoding α Γ)`). Combinators: Functions like `finEncodingPair` are simplified to `encodingPair`, dropping the `fin` prefix and `[Fintype]` requirements where no longer needed. Downstream: Mechanically updated `Mathlib.Computability` and `Mathlib.ModelTheory` to pass the explicit `Γ` and use `[Fintype Γ]` where `FinEncoding` was previously required. | new-contributor | 30/67 | Mathlib/Computability/Encoding.lean,Mathlib/ModelTheory/Encoding.lean | 2 | 5 | ['github-actions', 'vihdzp'] | nobody | none | 19 days ago | 20 days ago | 20 days |
| 37720 | cjrl | feat(Data/Fintype/Card): existsUnique_notMem_image_of_injective_of_card_succ | This pull requests adds a small theorem `existsUnique_notMem_image_of_injective_of_card_succ` to `Mathlib/Data/Fintype/Card` that says given an injective map f : α → β such that β has cardinality one more than α, there exists a unique element of β not in the image of f. This can be viewed as going in the opposite direction of `card_lt_of_injective_of_notMem`. This little fact is needed for our Latin Square PR #36698. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor t-set-theory | 15/0 | Mathlib/Data/Fintype/Card.lean | 1 | 6 | ['IvanRenison', 'cjrl', 'github-actions'] | nobody | none | 18 days ago | 18 days ago | 24 days |
| 37190 | cjrl | feat(Combinatorics): Set-Valued Pigeonhole Principle | This PR contributes two theorems to combinatorics: - `exists_lt_card_cover_of_card_biUnion_lt_card` is a set-valued version of the pigeonhole principle. - `sum_card_eq_sum_card_cover_biUnion` is a set theoretic corollary of a double counting result proved for bipartite graphs (`Finset.sum_card_bipartiteAbove_eq_sum_card_bipartiteBelow`). This was needed to prove the above pigeonhole principle. The motivation for these results is our Latin Square PR #36698. These results were proved in less general terms in that PR, but are independent of Latin Square considerations and so we have generalized and moved them into more relevant files. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics | 38/0 | Mathlib/Combinatorics/Enumerative/DoubleCounting.lean,Mathlib/Combinatorics/Pigeonhole.lean | 2 | 16 | ['IvanRenison', 'cjrl', 'ghseeli', 'github-actions', 'j-loreaux', 'vlad902'] | nobody | none | 18 days ago | 18 days ago | 34 days |
| 34675 | YaelDillies | feat: comultiplication as a bialgebra hom | From Toric --- - [x] depends on: #32245 [](https://gitpod.io/from-referrer/) | t-ring-theory toric | 71/12 | Mathlib/RingTheory/Bialgebra/TensorProduct.lean,Mathlib/RingTheory/Coalgebra/TensorProduct.lean | 2 | 6 | ['YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'riccardobrasca'] | nobody | none | 18 days ago | 19 days ago | 19 days |
| 38021 | IvanRenison | feat(Data/Int/ModEq): add theorem `modEq_two_abs` | --- [](https://gitpod.io/from-referrer/) | t-data | 4/0 | Mathlib/Data/Int/ModEq.lean | 1 | 1 | ['github-actions'] | nobody | none | 17 days ago | 17 days ago | 17 days |
| 37053 | artie2000 | refactor(Analysis/Convex/Cone): use `PointedCone` in Riesz extension theorem | Change the statement of the Riesz extension theorem to take a `PointedCone` rather than a `ConvexCone`. This PR is part of a series replacing `ConvexCone` with `PointedCone`. https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Replacing.20.60ConvexCone.60.20with.20.60PointedCone.60/near/581184307 --- [](https://gitpod.io/from-referrer/) | t-convex-geometry maintainer-merge | 15/12 | Mathlib/Analysis/Convex/Cone/Extension.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 8 | ['YaelDillies', 'artie2000', 'github-actions', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 1 | 17 days ago | 17 days ago | 36 days |
| 38018 | matthewjasper | feat(Algebra): expand Subalgebra.restrictScalars API | Add an instance for the original algebra structure, the implied scalar tower instances, and the algebra equivalence with the original subalgebra. Use this to remove some `set_option backward.isDefEq.respectTransparency`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 53/14 | Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/RingTheory/AlgebraicIndependent/TranscendenceBasis.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean | 4 | 2 | ['eric-wieser', 'github-actions'] | nobody | none | 16 days ago | 17 days ago | 17 days |
| 38047 | mbkybky | feat(RingTheory/Finiteness/Ideal): `I` is finitely generated if `f(I)` and `I ∩ ker(f)` are finitely generated | Let `f : R →+* S` be a surjective ring homomorphism, and let `I` be an ideal of `R`. If `f(I)` and `I ∩ ker(f)` are finitely generated ideals, then `I` is also finitely generated. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 13/3 | Mathlib/RingTheory/Finiteness/Ideal.lean | 1 | 1 | ['github-actions'] | nobody | none | 16 days ago | 16 days ago | 16 days |
| 36219 | gasparattila | chore(Order/SupClosed): use `to_dual` | --- [](https://gitpod.io/from-referrer/) | t-order | 66/215 | Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/SupClosed.lean | 2 | 6 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | none | 16 days ago | 16 days ago | 20 days |
| 38087 | kbuzzard | perf: add some fast_instance% | --- [](https://gitpod.io/from-referrer/) `fast_instance%` experts should take a look at this and say which if any are spurious. I confess to throwing them around rather randomly. Zulip thread [#mathlib4 > random fast_instance% makes gains @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/random.20fast_instance.25.20makes.20gains/near/585737520) | t-algebra | 10/9 | Mathlib/Algebra/EuclideanDomain/Field.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 3 | 3 | ['github-actions', 'kbuzzard', 'leanprover-radar'] | nobody | none | 16 days ago | 16 days ago | 16 days |
| 37865 | Jun2M | feat(Combinatorics/Graph): Edge cut of `Graph` | This PR introduces - `edgeCut`: A function on set of vertices that returns the set of edges with exactly one end in the set. - `IsEdgeCut`: A predicate for set of edges that promises it is `edgeCut` of some set. - `IsBridge`: An edge `e` is a bridge iff it is a singleton edge cut. - `IsBond`: An edge Set `B` is bond iff it is minimal nonempty edge cut. --- - [x] depends on: #35879 [](https://gitpod.io/from-referrer/) | t-combinatorics | 194/0 | Mathlib/Combinatorics/Graph/Connected/EdgeCut.Lean,Mathlib/Combinatorics/Graph/Subgraph.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | none | 15 days ago | 16 days ago | 16 days |
| 38098 | astrainfinita | chore: make `SMul.comp.smul` `implicit_reducible` | --- [](https://gitpod.io/from-referrer/) | t-algebra | 2/1 | Mathlib/Algebra/Group/Action/Defs.lean | 1 | 3 | ['astrainfinita', 'github-actions', 'leanprover-radar'] | nobody | none | 15 days ago | 15 days ago | 15 days |
| 37420 | artie2000 | refactor: change definitions to avoid `ConvexCone` | Change the definitions of `PointedCone.positive` and `PointedCone.closure` to avoid mentioning `ConvexCone`. This PR is part of a series deprecating `ConvexCone`: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Replacing.20.60ConvexCone.60.20with.20.60PointedCone.60/with/582738985 --- [](https://gitpod.io/from-referrer/) | t-convex-geometry maintainer-merge | 10/4 | Mathlib/Analysis/Convex/Cone/Closure.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 3 | ['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'ooovi', 'vihdzp'] | nobody | 3 | 15 days ago | 15 days ago | 30 days |
| 36676 | euprunin | chore: replace long terminal `simp only […]`:s (≥3 lemmas) with bare `simp`:s | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Polynomial.map_comp`: unchanged 🎉 * `AlgebraicGeometry.IsClosedImmersion.Spec_iff`: 152 ms before, 107 ms after 🎉 * `nnnorm_pow_le`: unchanged 🎉 * `norm_pow_le`: unchanged 🎉 * `integral_sin`: unchanged 🎉 * `SimpleGraph.Subgraph.le_induce_union`: unchanged 🎉 * `ENNReal.iSup_add_iSup`: unchanged 🎉 * `ENat.iSup_add_iSup`: unchanged 🎉 * `ENat.mul_epow`: unchanged 🎉 * `EReal.abs_eq_zero_iff`: unchanged 🎉 * `Finset.disjoint_biUnion_left`: unchanged 🎉 * `List.splitOnP.go_acc`: unchanged 🎉 * `Multiset.count_map_eq_count`: unchanged 🎉 * `Nat.toDigitsCore_length`: unchanged 🎉 * `PartENat.pos_iff_one_le`: unchanged 🎉 * `Rat.intCast_div_self`: unchanged 🎉 * `Set.biUnion_empty_finset`: unchanged 🎉 * `Quot.subsingleton_iff`: unchanged 🎉 * `Equiv.Perm.support_closure_subset_union`: unchanged 🎉 * `Module.Basis.reindexRange_repr'`: unchanged 🎉 * `MeasureTheory.mul_le_addHaar_image_of_lt_det`: unchanged 🎉 * `MeasureTheory.memLp_finset_sum`: unchanged 🎉 * `MeasureTheory.exists_lt_lowerSemicontinuous_integral_lt`: 450 ms before, 404 ms after 🎉 * `BoundedContinuousFunction.toReal_lintegral_coe_eq_integral`: unchanged 🎉 * `nullMeasurableSet_region_between_oc`: unchanged 🎉 * `nullMeasurableSet_region_between_co`: unchanged 🎉 * `nullMeasurableSet_region_between_cc`: unchanged 🎉 * `MeasureTheory.integral_le_liminf_integral_of_forall_isOpen_measure_le_liminf_measure`: unchanged 🎉 * `padicValNat.pow_add_pow`: unchanged 🎉 * `Monotone.biUnion_Ico_Ioc_map_succ`: unchanged 🎉 * `ProbabilityTheory.condIndepSets_singleton_iff`: unchanged 🎉 * `ProbabilityTheory.sum_variance_truncation_le`: unchanged 🎉 * `IsLocalRing.CotangentSpace.span_image_eq_top_iff`: unchanged 🎉 * `galRestrict'_galLift`: 163 ms before, 48 ms after 🎉 * `Valuation.ne_zero_of_isUnit`: unchanged 🎉 * `hasProd_prod`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 35/35 | Mathlib/Algebra/Polynomial/Eval/Defs.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Lattice.lean,Mathlib/Data/ENat/Pow.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Rat/Lemmas.lean,Mathlib/Data/Set/Constructions.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Perm/Finite.lean,Mathlib/LinearAlgebra/Basis/Defs.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Integral/BoundedContinuousFunction.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/Portmanteau.lean,Mathlib/NumberTheory/Multiplicity.lean,Mathlib/Order/SuccPred/IntervalSucc.lean,Mathlib/Probability/Independence/Conditional.lean,Mathlib/Probability/StrongLaw.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | 30 | 4 | ['euprunin', 'github-actions', 'mathlib-merge-conflicts'] | nobody | none | 14 days ago | 26 days ago | 45 days | |
| 36774 | euprunin | chore: replace long terminal `rw […]`:s (≥4 lemmas) with bare `simp`:s | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Finset.lcm_union`: unchanged 🎉 * `Finset.gcd_union`: unchanged 🎉 * `Polynomial.derivative_eval₂_C`: unchanged 🎉 * `Polynomial.expand_pow`: unchanged 🎉 * `Cardinal.mk_real`: unchanged 🎉 * `Real.log_zpow`: unchanged 🎉 * `Matroid.eRank_le_encard_add_eRk_compl`: unchanged 🎉 * `DFinsupp.single_tsub`: unchanged 🎉 * `EReal.inv_neg`: unchanged 🎉 * `Finsupp.toMultiset_map`: unchanged 🎉 * `Finsupp.single_tsub`: unchanged 🎉 * `Multiset.countP_map`: unchanged 🎉 * `Nat.ascFactorial_eq_factorial_mul_choose'`: unchanged 🎉 * `Real.sign_intCast`: unchanged 🎉 * `Real.volume_eball`: unchanged 🎉 * `Real.volume_closedEBall`: unchanged 🎉 * `LFunction_ne_zero_of_not_quadratic_or_ne_one`: 295 ms before, 152 ms after 🎉 * `hasSum_one_div_nat_pow_mul_cos`: unchanged 🎉 * `inv_eq_of_aeval_divX_ne_zero`: unchanged 🎉 * `AlgebraicIndependent.aeval_comp_mvPolynomialOptionEquivPolynomialAdjoin`: unchanged 🎉 * `Ordinal.deriv_mul_eq_opow_omega0_mul`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 22/24 | Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Expand.lean,Mathlib/Analysis/Real/Cardinality.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Combinatorics/Matroid/Rank/ENat.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finsupp/Multiset.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Nat/Choose/Basic.lean,Mathlib/Data/Real/Sign.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/NumberTheory/LSeries/Nonvanishing.lean,Mathlib/NumberTheory/ZetaValues.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/AlgebraicIndependent/Basic.lean,Mathlib/SetTheory/Ordinal/FixedPoint.lean | 19 | 2 | ['artie2000', 'euprunin', 'github-actions'] | nobody | 1 | 14 days ago | 45 days ago | 45 days | |
| 38095 | astrainfinita | perf(Algebra/*/{InjSurj, TransferInstance}): reduce instance `Expr`s | --- We can not just use `fast_instance%`, because `fast_instance%` reduces instances into constructor applications, but their arguments may still not be reduced. This PR continues the work from #13795. Original PR: https://github.com/leanprover-community/mathlib4/pull/13795 [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/instance.20unfolding.20phenomenon/) | t-algebra | 401/219 | Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/TransferInstance.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Action/TransferInstance.lean,Mathlib/Algebra/Group/InjSurj.lean,Mathlib/Algebra/Group/TransferInstance.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/End.lean,Mathlib/Algebra/GroupWithZero/Action/TransferInstance.lean,Mathlib/Algebra/GroupWithZero/InjSurj.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/TransferInstance.lean,Mathlib/Util/TermReduce.lean,scripts/noshake.json | 16 | 7 | ['astrainfinita', 'github-actions', 'leanprover-radar'] | nobody | none | 14 days ago | 15 days ago | 15 days |
| 38141 | Jun2M | feat(Order/Partition): Partition induced by symmetric, transitive relation | We introduce a constructor for Partition from a symmetric, transitive relation, with `copy` function baked into the definition.
Co-authored-by: Peter Nelson |
t-order | 41/7 | Mathlib/Order/Partition/Basic.lean | 1 | 1 | ['github-actions'] | nobody | none | 14 days ago | 14 days ago | 14 days |
| 35569 | goliath-klein | refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): deprecate `injectiveSeminorm` | This PR: * Deprecates `PiTensorProduct.injectiveSeminorm` and supporting lemmas. * Moves the theory of `liftEquiv` from InjectiveSeminorm.lean to ProjectiveSeminorm.lean. No changes are introduced beyond adding deprecation notices, adapting docstrings, and moving material between files. The PR leaves InjectiveSeminorm.lean almost empty. A new implementation of `injectiveSeminorm`, one which reflects the common mathematical definition, is to be done. This is the third in a series of three PRs with the goal to [deprecate `PiTensorProuduct.injectiveSeminorm`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798633). --- - [ ] depends on: #35567 - [ ] depends on: #35568 Deprecations: - injectiveSeminorm - dualSeminorms_bounded - injectiveSeminorm_apply - norm_eval_le_injectiveSeminorm - injectiveSeminorm_le_projectiveSeminorm - injectiveSeminorm_tprod_le Preliminary work toward a reimplementation is at #33969. I've added Davood and myself to the "Authors" field, as we have now significantly refactored this module. Co-authored-by: Davood H. T. Tehrani [](https://gitpod.io/from-referrer/) | new-contributor | 222/233 | Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean | 2 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | none | 14 days ago | 14 days ago | 31 days |
| 38049 | WilliamCoram | feat: lemmas towards showing gaussNorm on MvPowerSeries is an absolute value | We prove lemmas: ``gaussNorm_mul_le`` and ``gaussNorm_le_mul`` which will allow us to show it is an absolute value on Mv restricted power series. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor | 144/1 | Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean | 1 | 4 | ['WilliamCoram', 'github-actions'] | nobody | none | 13 days ago | 17 days ago | 17 days |
| 38185 | Jun2M | feat(Order/Partition): operations over Frame | This PR introduces:
* `Partition.induce`: The induce of a partition by a frame element.
* `Partition.disjUnion`: The disjoint union of two partitions.
* `Partition.bind`: The finer partition obtained by family of partitions for each part of the original partition.
Co-authored-by: Peter Nelson |
t-order | 89/11 | Mathlib/Order/Partition/Basic.lean,Mathlib/Order/SupIndep.lean | 2 | 1 | ['github-actions'] | nobody | none | 13 days ago | 13 days ago | 13 days |
| 38186 | tb65536 | feat(RingTheory/QuasiFinite/Basic): Localizations of the fiber are finite over the residue field | This PR adds an instance stating that localizations of the fiber are finite over the residue field. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 4/0 | Mathlib/RingTheory/QuasiFinite/Basic.lean | 1 | 1 | ['github-actions'] | nobody | none | 13 days ago | 13 days ago | 13 days |
| 38200 | Parcly-Taxel | feat: Turán numbers and their strict monotonicity | `strictMonoOn_turanNumber` and `sum_mul_le_twice_turanNumber` were initially proved by @Aristotle-Harmonic, then hand-polished.
Co-authored-by: Aristotle (Harmonic) |
t-combinatorics | 55/20 | Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean | 1 | 1 | ['github-actions'] | nobody | none | 13 days ago | 13 days ago | 13 days |
| 38173 | JovanGerb | chore(CategoryTheory/EpiMono): use `to_dual` | Generate declarations about `Mono`, `SplitMono` and `SplitMonoCategory` from the epic versions. --- [](https://gitpod.io/from-referrer/) | 40/120 | Mathlib/CategoryTheory/EpiMono.lean,Mathlib/Tactic/Translate/ToDual.lean | 2 | 1 | ['github-actions'] | nobody | none | 13 days ago | 13 days ago | 13 days | |
| 37649 | IvanRenison | feat(Data): add theorem `Finset.image_eq_iff_eq_preimage` | --- [](https://gitpod.io/from-referrer/) | t-data | 19/0 | Mathlib/Data/Finset/Preimage.lean,Mathlib/Data/Set/Function.lean | 2 | 4 | ['Rida-Hamadani', 'github-actions', 'themathqueen'] | nobody | none | 12 days ago | 26 days ago | 26 days |
| 38199 | vihdzp | chore: add items to set theory overview | --- [](https://gitpod.io/from-referrer/) | documentation t-set-theory | 11/2 | docs/overview.yaml | 1 | 3 | ['SnirBroshi', 'github-actions', 'vihdzp'] | nobody | none | 12 days ago | 13 days ago | 13 days |
| 38224 | plp127 | fix(QuadraticAlgebra): `Rat` algebra diamond | Fix a diamond for `Algebra Rat (QuadraticAlgebra Rat a b)` at default transparency by overriding the default implementation of the `qsmul` and `ratCast` fields with one that does not create a diamond. The diamond is still present at reducible-and-instances transparency. --- [](https://gitpod.io/from-referrer/) | t-algebra | 59/7 | Mathlib/Algebra/QuadraticAlgebra/Basic.lean,Mathlib/Algebra/QuadraticAlgebra/Defs.lean,MathlibTest/Algebra/QuadraticAlgebra/RatAlgebraDiamond.lean | 3 | 1 | ['github-actions'] | nobody | none | 12 days ago | 12 days ago | 12 days |
| 31892 | jsm28 | feat(Geometry/Euclidean/Sphere/PolePolar): poles and polars | Define poles and polars for spheres in Euclidean affine spaces, and set up some basic API, including in particular La Hire's theorem (`p₁` lies on the polar of `p₂` if and only if `p₂` lies on the polar of `p₁`). Poles and polars are actually meaningful for any quadric in a projective space over any field, but I think it's reasonable to set up this theory for spheres in the Euclidean context and potentially link it in future to more general projective geometry. --- - [ ] depends on: #31891 - [ ] depends on: #32296 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 159/0 | Mathlib.lean,Mathlib/Geometry/Euclidean/Sphere/PolePolar.lean | 2 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | none | 12 days ago | 35 days ago | 35 days |
| 32294 | jsm28 | feat(Geometry/Euclidean/Angle/Incenter): distance from second intersection with circumcircle | Add the following lemma: given a triangle ABC, suppose an angle bisector from A through the incenter or excenter I meets the circumcircle again at X (including the case of an external bisector at A tangent to the circle, in which case X = A). Then XB = XI (= XC, by applying this lemma again). This is a standard configuration: https://en.wikipedia.org/wiki/Incenter%E2%80%93excenter_lemma --- - [ ] depends on: #30981 - [ ] depends on: #30982 - [ ] depends on: #32019 - [ ] depends on: #32021 - [ ] depends on: #32023 - [ ] depends on: #32270 - [ ] depends on: #32290 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 189/0 | Mathlib/Geometry/Euclidean/Angle/Incenter.lean | 1 | 5 | ['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'peakpoint'] | nobody | none | 12 days ago | 35 days ago | 35 days |
| 38208 | mbkybky | chore: rename two instances | Rename [Module.Free.Module.free_shrink](https://leanprover-community.github.io/mathlib4_docs/Mathlib/LinearAlgebra/FreeModule/Basic.html#Module.Free.Module.free_shrink) to `Module.Free.shrink` and rename [Module.Finite.Module.finite_shrink](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Finiteness/Basic.html#Module.Finite.Module.finite_shrink) to `Module.Finite.shrink`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-ring-theory | 6/2 | Mathlib/LinearAlgebra/FreeModule/Basic.lean,Mathlib/RingTheory/Finiteness/Basic.lean | 2 | 3 | ['github-actions', 'mbkybky', 'plp127'] | nobody | none | 12 days ago | 13 days ago | 13 days |
| 38231 | NoneMore | feat(ModelTheory/Definablity): add syntax-to-definability bridge lemmas | Add bridge lemmas from syntax to definability and refactor downstream proofs to use them. --- [](https://gitpod.io/from-referrer/) | t-logic | 88/56 | Mathlib/ModelTheory/Definability.lean,Mathlib/ModelTheory/ElementarySubstructures.lean | 2 | 1 | ['github-actions'] | nobody | none | 12 days ago | 12 days ago | 12 days |
| 38245 | RemyDegenne | feat: CountableSupClosed | Define the property for a set of being closed by countable supremum (resp. infimum). The new file is adapted from the `SupClosed` file, which describes sets closed by binary supremum. Also use `to_dual` on `SupClosed`. `CountableInfClosed` will be used in measure theory, for developments related to compact systems used for Kolmogorov's extension theorem and Choquet's capacitability theorem. --- [](https://gitpod.io/from-referrer/) | t-order brownian | 308/66 | Mathlib.lean,Mathlib/Order/CountableSupClosed.lean,Mathlib/Order/SupClosed.lean | 3 | 14 | ['RemyDegenne', 'b-mehta', 'github-actions', 'vihdzp'] | nobody | none | 12 days ago | 12 days ago | 12 days |
| 34952 | joneugster | feat(scripts/autolabel): use `Cli` and integrate `curl` call into `autolabel` | - use `Cli` for `lake exe autolabel`
- add arguments `--pr xxx --gh` and `--pr xxx --curl |
CI | 86/73 | .github/workflows/add_label_from_diff.yaml,scripts/autolabel.lean | 2 | 4 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | none | 11 days ago | 33 days ago | 65 days |
| 32282 | jsm28 | feat(Geometry/Euclidean/Angle/Incenter): unoriented angle bisection | Add lemmas giving unoriented angles involving the incenter and excenters of a triangle as expressions involving dividing angles of the triangle by 2, deduced from oriented bisection lemmas. --- - [ ] depends on: #30981 - [ ] depends on: #30982 - [ ] depends on: #31205 - [ ] depends on: #32019 - [ ] depends on: #32021 - [ ] depends on: #32259 - [ ] depends on: #32260 - [ ] depends on: #32270 - [ ] depends on: #32273 - [ ] depends on: #32278 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 98/0 | Mathlib/Geometry/Euclidean/Angle/Incenter.lean | 1 | 8 | ['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'wwylele'] | nobody | 1 | 11 days ago | 35 days ago | 35 days |
| 37527 | bryanboehnke | feat(LocalRing/Etale): Finite étale extensions of local rings are monogenic | Formalization of Lemma 3.2 from https://arxiv.org/abs/2503.07846: Given a finite extension of local rings R -> S, if the extension is étale, then there exists β ∈ S such that R[β] = S. Furthermore, if f(z) ∈ R[z] is the minimal polynomial of β, then f′(β) is a unit in S. This file also includes some relevant intermediate results used in the formalization of the proof of Lemma 3.1 from the same paper.
Co-authored-by: George Peykanu |
t-ring-theory new-contributor | 148/0 | Mathlib.lean,Mathlib/RingTheory/LocalRing/Etale.lean | 2 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | none | 11 days ago | 11 days ago | 11 days |
| 38282 | JovanGerb | chore(Algebra/Lie/Submodule): remove duplicate instance | This PR removes the explicit `CoeSort` instance on `LieSubmodule`, because it is identical to the one inherited from its `SetLike` instance. This instance was added in #16509, and I'm not quite sure why it was needed then and not anymore. --- [](https://gitpod.io/from-referrer/) | t-algebra | 0/3 | Mathlib/Algebra/Lie/Submodule.lean | 1 | 1 | ['github-actions'] | nobody | none | 11 days ago | 11 days ago | 11 days |
| 38234 | vihdzp | chore: make `IsSuccLimit` a structure | This lets us name the fields. Note that the `mk_iff` lemma overwrites a recently deprecated theorem. --- [](https://gitpod.io/from-referrer/) | t-order | 35/28 | Mathlib/Order/SuccPred/InitialSeg.lean,Mathlib/Order/SuccPred/Limit.lean | 2 | 5 | ['github-actions', 'plp127'] | nobody | none | 11 days ago | 11 days ago | 11 days |
| 38309 | ntapiam | feat(Algebra/NonAssoc): dendriform algebras | Define dendriform semirings and algebras --- This PR introduces dendriform structures such as dendriform semirings and algebras, and proves basic facts linking them to their pre-Lie counterparts. [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 270/0 | Mathlib.lean,Mathlib/Algebra/NonAssoc/Dendriform/Defs.lean,docs/references.bib | 3 | 3 | ['github-actions'] | nobody | none | 11 days ago | 11 days ago | 11 days |
| 38310 | ZRTMRH | feat(Combinatorics/Quiver/Schreier): word evaluation and reachability | Adds word evaluation and reachability results to the Schreier graph API. * `SchreierGraph.evalWord` : evaluates a word `List (S × Bool)` as an element of the ambient group, where `(s, true)` contributes `ι s` and `(s, false)` contributes `(ι s)⁻¹`. * `SchreierGraph.evalWord_eq_lift` : agreement with `FreeGroup.lift`. * `SchreierGraph.evalWord_mem_closure` : every word evaluates into the subgroup generated by `ι`. * `SchreierGraph.pathFromWord` : a Bool-tagged word yields a path in `Symmetrify (SchreierGraph V ι)` from `x` to `evalWord ι w • x`. * `SchreierGraph.reachable_iff` : two vertices are connected by a path in the symmetrification iff some element of the subgroup closure carries one to the other. Follow-up to #36320. This PR was written with AI assistance (Claude). The code has been reviewed by the author. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics large-import | 157/0 | Mathlib/Combinatorics/Quiver/Schreier.lean | 1 | 2 | ['github-actions'] | nobody | none | 10 days ago | 10 days ago | 10 days |
| 38317 | WenrongZou | feat(Date/Choose): add some lemmas about choose of prime pow | In this PR, I add some lemma about choose of prime pow. 1) For primes `p` and positive integer `n`, assume that for all `i ∈ Icc 1 (n - 1)`, `choose n i` congruent to `0` module `p`, then `n = p ^ multiplicity p n`. 2) For a prime power `n`, the greatest common divisor of `choose n 1, ⋯, choose n (n - 1)` is actually the minimal prime factor of `n`. 3) For a natural number `n` greater than `1`, assume that `n` is not a prime power, then the greatest common divisor of `choose n 1, ⋯, choose n (n - 1)` is `1`. --- [](https://gitpod.io/from-referrer/) | t-data | 88/1 | Mathlib/Data/Nat/Choose/Lucas.lean | 1 | 1 | ['github-actions'] | nobody | none | 10 days ago | 10 days ago | 10 days |
| 38323 | NoahW314 | feat(RingTheory/MvPolynomial/MonomialOrder): remove unnecessary hypothesis | Some results had a nonzero hypothesis which can be eliminated since the result holds trivially when the polynomial is zero. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 13/5 | Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean | 1 | 1 | ['github-actions'] | nobody | none | 10 days ago | 10 days ago | 10 days |
| 38036 | JovanGerb | feat: `NSMul`/`NPow` type class | This PR is adds `NSMul`, `NPow`, `ZSMul` and `ZPow` classes for the `nsmul`, `npow`, `zsmul`, `zpow` data fields. This has a few advantages: - If you first declare a `SMul` instance, then you don't need to manually write `nsmul := (· • ·)` and `zsmul := (· • ·)` . For `Pow`, the extra benefit is that inferring the instance is preferred over the default field `npowRecAuto`. So this helps avoid accidental diamonds. - If you first declare a `SMul` instance on a type synonym, then `inferInstanceAs` will infer the `nsmul` field from the `SMul` instance. This makes it easier to avoid diamonds on type synonyms like `Matrix` and `MonoidAlgebra`. - The not-yet-merged instance diamond linter will be able to detect cases where the `NSMul` and `SMul` classes do not agree. In the process of making this PR, I have identified two existing `NPow` diamonds: - In `Mathlib.Algebra.Order.Positive.Field`, there were two conflicting `NPow` instances. - For `Fin`, there are two conflicting `NPow` instances. I have overwritten the one in core lean with the one from mathlib that is more computationally efficient. TODO: the same for `QSMul` and `NNQSMul`. --- [](https://gitpod.io/from-referrer/) | 276/273 | Mathlib/Algebra/Colimit/DirectLimit.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/Group/Action/Opposite.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Opposite.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Positive/Field.lean,Mathlib/Algebra/Order/Ring/Archimedean.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Ring/MinimalAxioms.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/CategoryTheory/Triangulated/Basic.lean,Mathlib/Data/BitVec.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/ZMod/Defs.lean,Mathlib/Data/ZMod/IntUnitsPower.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/LinearAlgebra/Matrix/Defs.lean,Mathlib/LinearAlgebra/Matrix/ZPow.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Defs.lean,Mathlib/NumberTheory/ArithmeticFunction/Defs.lean,Mathlib/RingTheory/PolynomialLaw/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Tactic/Abel.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,MathlibTest/instance_diamonds.lean | 41 | 16 | ['JovanGerb', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-radar', 'vihdzp'] | nobody | none | 10 days ago | 10 days ago | 10 days | |
| 38189 | artie2000 | feat: simplify proof of `IsAdjoinRootMonic.mkOfAdjoinEqTop'` | * Simplify the proof of `IsAdjoinRootMonic.mkOfAdjoinEqTop'` by factoring out a lemma `OrzechProperty.bijective_of_surjective_of_finrank_le` and making use of the existing lemma `finrank_le_iff_exists_linearMap`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 22/21 | Mathlib/LinearAlgebra/Dimension/Free.lean,Mathlib/RingTheory/IsAdjoinRoot.lean | 2 | 6 | ['Vierkantor', 'artie2000', 'github-actions'] | nobody | none | 9 days ago | 13 days ago | 13 days |
| 38337 | Jun2M | feat(Combinatorics/Graph): supremum | This PR introduces the union of `Graph`, as `sup`.
Due to compatibility issue, in general, `sup` is not very well-behaved: `SemilatticeSup` is not true. In the case of incompatible edge, unlike `inf` which simply removed such edge, we include it following its incidence in the left graph. This has the benefit of associativity being true in general at the cost of commutativity.
Assuming compatibility or existence of mutual supergraph, which are shown to be equivalent in this PR, everything behaves nicely.
Co-authored-by: Peter Nelson |
t-combinatorics | 86/1 | Mathlib/Combinatorics/Graph/Lattice.lean | 1 | 2 | ['github-actions', 'vihdzp'] | nobody | none | 9 days ago | 10 days ago | 10 days |
| 38343 | mortarsanjaya | chore(Data/Nat/Cast/Order/Ring): move two Nat lemmas to Data/Nat/Basic | These two lemmas have no correlation with `Nat.cast`, and the proof can be golfed to fit `Data/Nat/Basic`. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 22/27 | Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Cast/Order/Ring.lean | 2 | 2 | ['github-actions'] | nobody | none | 9 days ago | 10 days ago | 10 days |
| 38356 | SnirBroshi | feat(Order/ConditionallyCompleteLattice/Finset): `sSup s ≠ ⊤` in a `CompleteLinearOrder` for a finite set without `⊤` | --- btw `to_dual` here is blocked on #35213 [](https://gitpod.io/from-referrer/) | t-order | 20/0 | Mathlib/Order/ConditionallyCompleteLattice/Finset.lean | 1 | 1 | ['github-actions'] | nobody | none | 9 days ago | 9 days ago | 9 days |
| 38340 | xroblot | refactor(Data/ZMod): move `coe_int_isUnit_iff_isCoprime` to `ZMod.Units` | Move `ZMod.coe_int_isUnit_iff_isCoprime` from `Mathlib.Data.ZMod.Coprime` to `Mathlib.Data.ZMod.Units`, where it more naturally belongs as a statement about units in `ZMod`. The proof is rewritten to only use tools available in `Mathlib.Data.ZMod.Units`, avoiding the dependency on `Mathlib.Algebra.EuclideanDomain.Int`. This is motivated by the desire to use `coe_int_isUnit_iff_isCoprime` without the overhead of importing `Mathlib.Data.ZMod.Coprime` (see #38339 for a use case). 🤖 Co-Authored with [Claude Code](https://claude.com/claude-code) | t-data | 10/7 | Mathlib/Data/ZMod/Coprime.lean,Mathlib/Data/ZMod/Units.lean | 2 | 1 | ['github-actions'] | nobody | none | 9 days ago | 9 days ago | 9 days |
| 38316 | tannerduve | feat(Order/OmegaCompletePartialOrder): least fixed point and Scott induction | Add `lfp` for endomorphisms on an ωCPO with a least element and its basic API (`map_lfp`, `isFixedPt_lfp`, `lfp_le_fixed`, `isLeast_lfp`) and the Scott induction theorem `lfp_induction` Also add corresponding induction principles for `Part.fix`: `fix_scott_induction` (ω-Scott continuous functional, admissible predicate) and `fix_scott_induction_pointwise` | new-contributor | 110/0 | Mathlib/Control/LawfulFix.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,docs/references.bib | 3 | 2 | ['github-actions'] | nobody | none | 8 days ago | 10 days ago | 10 days |
| 38325 | Jun2M | feat(Combinatorics/Graph): EndPoint function | This PR introduces `endPoints`: `Set` of incident vertices, given an edge (in the case of non-edge, return empty). **Import change**: `Graph/Basic` now imports `Data/Set/Card` to allow reasoning about card of `endPoints`. [Relavent Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/New.20graph.20definitions/with/588616269) --- [](https://gitpod.io/from-referrer/) | t-combinatorics large-import | 83/3 | Mathlib/Combinatorics/Graph/Basic.lean | 1 | 9 | ['Jun2M', 'SnirBroshi', 'eric-wieser', 'github-actions', 'mathlib-bors'] | nobody | none | 8 days ago | 8 days ago | 10 days |
| 38393 | staroperator | refactor(ModelTheory): add typeclasses for algebraic symbols | `Language.ring` and `Language.presburger` share the same symbols `0`, `1` and `+` and have duplicated instances on `Term` and `realize` simp lemmas. This PR makes these symbols certain typeclasses (similar to [`Language.IsOrdered`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/ModelTheory/Order.html#FirstOrder.Language.IsOrdered)) and removes the duplication. It also adds certain definability lemmas that `fun_prop` can use. --- [](https://gitpod.io/from-referrer/) | t-logic | 332/201 | Mathlib.lean,Mathlib/ModelTheory/Algebra/Classes.lean,Mathlib/ModelTheory/Algebra/Field/IsAlgClosed.lean,Mathlib/ModelTheory/Algebra/Ring/Basic.lean,Mathlib/ModelTheory/Algebra/Ring/FreeCommRing.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Basic.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Definability.lean | 7 | 1 | ['github-actions'] | nobody | none | 8 days ago | 8 days ago | 8 days |
| 38375 | WenrongZou | feat(MvPowerSeries): some lemmas `truncTotal` of `subst` | This PR adds some lemmas about truncation of total degree of a substitution. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 124/7 | Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean | 2 | 3 | ['BryceT233', 'github-actions'] | nobody | none | 8 days ago | 9 days ago | 9 days |
| 38406 | plp127 | chore(ModelTheory/Skolem): remove unnecessary `[Nonempty M]` assumption | Removes a `[Nonempty M]` assumption by slightly modifying two proofs. --- [](https://gitpod.io/from-referrer/) | t-logic | 7/1 | Mathlib/ModelTheory/Skolem.lean | 1 | 1 | ['github-actions'] | nobody | none | 8 days ago | 8 days ago | 8 days |
| 38373 | Nicola9Falciola | feat (Algebra/FreeAbelianGroup /Finsupp) : The support of non zero element in a freeabeliangroup is non empty | Add the lemma that for a nonzero a : FreeAbelianGroup X the support of it is non empty. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 3/0 | Mathlib/Algebra/FreeAbelianGroup/Finsupp.lean | 1 | 7 | ['Nicola9Falciola', 'SnirBroshi', 'github-actions'] | nobody | none | 8 days ago | 8 days ago | 9 days |
| 38409 | chrisflav | feat(RingTheory): totally split algebras over a field | We show that for a totally split algebra over a field, the `k`-rational points are in bijection with the prime spectrum. We also show that an étale algebra over a separably closed field is totally split. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 122/2 | Mathlib/Algebra/Algebra/Pi.lean,Mathlib/FieldTheory/IsSepClosed.lean,Mathlib/RingTheory/Artinian/Module.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Field.lean,Mathlib/RingTheory/TotallySplit.lean | 6 | 1 | ['github-actions'] | nobody | none | 8 days ago | 8 days ago | 8 days |
| 38214 | emlis42 | feat(Algebra/ContinuedFractions): add Euler's continued fraction | This PR formalizes Euler’s continued fractions by providing `Euler` which construct one by giving head term and coefficients with some basic property. We also introduce a transformation `GenContFract.toEuler` that maps a generalized continued fraction `g : GenContFract K` to an equivalent Euler-form continued fraction. | new-contributor t-algebra | 262/0 | Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Euler.lean | 2 | 15 | ['github-actions', 'mathlib-bors', 'wwylele'] | nobody | none | 8 days ago | 8 days ago | 8 days |
| 37914 | j-loreaux | feat: transfer `star`-related instances across equivalences | This also adds `Function.Injective.{InvolutiveStar,...}` and related lemmas. In addition we rename the existing `Equiv.star` to `Equiv.Perm.star` (without a deprecation) so that the name can be used for the declaration which transfers a `Star` instance across an `Equiv`. --- [](https://gitpod.io/from-referrer/) | t-algebra | 95/2 | Mathlib.lean,Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/TransferInstance.lean | 4 | 5 | ['SnirBroshi', 'github-actions', 'themathqueen'] | nobody | none | 8 days ago | 8 days ago | 8 days |
| 36451 | SnirBroshi | feat(Combinatorics/SimpleGraph/Matching): `edgeSet` is injective and strictly monotonic on matchings, and more API | --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 36/10 | Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 2 | 13 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 | 8 days ago | 8 days ago | 36 days |
| 38422 | SnirBroshi | feat(Combinatorics/SimpleGraph/Maps): `G →g G.map f` | The existing `SimpleGraph.Embedding.map` takes an embedding and lifts it to a graph embedding `G ↪g G.map f`. #36130 generalized `SimpleGraph.map` from embeddings to functions, so now we can get a graph homomorphism `G →g G.map f` without requiring that `f` is injective, although we still have to require that it is injective on adjacent vertices (aka a valid coloring). This adds `Coloring.homMap`, and `Hom.map` which is identical but avoids coloring terminology/spelling. --- I'd love for suggestions to improve the docstring of `Coloring.homMap`, I'm not sure about it :) Are the two versions a good idea, or should we just have the coloring one? (we have `{Hom,Embedding,Iso}.comap` but only `{Embedding,Iso}.map`) [](https://gitpod.io/from-referrer/) | t-combinatorics | 16/0 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean | 2 | 4 | ['SnirBroshi', 'eric-wieser', 'github-actions'] | nobody | none | 7 days ago | 8 days ago | 8 days |
| 35415 | joneugster | feat(Cache): enable partial cache in downstream projects | Migrated to fork from: #21238. Enable partial cache retrieval in downstream projects: `lake exe cache get MyProject.Basic` downloads only the relevant cache to build `MyProject/Basic.lean` --- ### Notes: - replaces: #21195 - should address: #8767 - should address: #20568 ### Completed: - [x] depends on: #21632 - [x] ~~depends on: #21663~~ - [x] depends on: #21666 - [x] depends on: #21701 - [x] depends on: #21703 - [x] depends on: #21704 - [x] depends on: #21705 - [x] depends on: #21707 - [x] depends on: #21711 - [x] depends on: #21750 - [x] depends on: #21815 - [x] depends on: #21816 - [x] depends on: #21817 - [x] depends on: #21818 - [x] depends on: #21822 - [x] depends on: #21830 - [x] depends on: #21848 - [x] depends on: #21834 [](https://gitpod.io/from-referrer/) | CI t-meta | 27/15 | Cache/Hashing.lean,Cache/IO.lean,Cache/Main.lean | 3 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | none | 7 days ago | 7 days ago | 41 days |
| 38380 | linesthatinterlace | feat(Data/Set): add Set.diag API | Introduces `Set.diag (s : Set α) : Set (α × α) = {(a, a) | a ∈ s}` as the set-level companion to `Set.offDiag`, mirroring the existing `Finset.diag` / `Finset.offDiag` pairing. The type-level `Set.diagonal : Type* → Set (α × α)` is retained unchanged; `diag_univ : (univ : Set α).diag = diagonal α` (`@[simp]`) keeps it canonical when the underlying set is `univ`. Parallels to the existing `offDiag` API (`diag_mono`, `diag_nonempty`, `diag_eq_empty`, `diag_empty`, `diag_singleton`, `diag_subset_prod`, `diag_eq_sep_prod`, `diag_inter`, `diag_union`, `diag_insert`) plus bridges `diag_union_offDiag`, `disjoint_diag_offDiag`, `prod_sdiff_diag`, `prod_sdiff_offDiag`. Also `diag_eq_image`, `image_diag` (matching `Finset.image_diag`), `preimage_coe_coe_diag`, and `Finset.coe_diag`. Note `diag_union` and `diag_insert` are unconditional (no `Disjoint` / `a ∉ s` hypothesis). To free the `diag_` prefix for the set sense, the existing lemmas about the diagonal *map* `fun x => (x, x)` are renamed with deprecation aliases: `range_diag` → `range_diagMap`, `diag_preimage_prod` → `diagMap_preimage_prod`, `diag_preimage_prod_self` → `diagMap_preimage_prod_self`. `diag_image` and `preimage_coe_coe_diagonal` are marked `@[deprecated]`. | t-data | 124/15 | Mathlib/Data/Finset/Prod.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Data/Set/Prod.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Compactness/Lindelof.lean,Mathlib/Topology/NhdsSet.lean | 7 | 2 | ['github-actions', 'linesthatinterlace'] | nobody | none | 7 days ago | 8 days ago | 8 days |
| 38466 | Thmoas-Guan | feat(ModuleCat): some lemmas for `Ext` over `ModuleCat` | some lemmas for `Ext` over `ModuleCat` --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 67/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean | 4 | 1 | ['github-actions'] | nobody | none | 7 days ago | 7 days ago | 7 days |
| 38142 | SnirBroshi | feat(Order/SuccPred/CompleteLinearOrder): generalize `csSup_mem_of_not_isSuccLimit` | Given `s.Nonempty` and `BddAbove s` we can conclude `sSup s ∈ s` using either: - `csSup_mem_of_not_isSuccPrelimit`, given `ConditionallyCompleteLinearOrder` and `¬IsSuccPrelimit (sSup s)` - `csSup_mem_of_not_isSuccLimit`, given `ConditionallyCompleteLinearOrderBot` and `¬IsSuccLimit (sSup s)` We generalize both to a theorem that requires `ConditionallyCompleteLinearOrder` and `¬IsSuccLimit (sSup s)`. This creates 8 theorems that require `¬IsSuccPrelimit` but are now easily proved with the `¬IsSuccLimit` theorems, we replace `csSup_mem_of_not_isSuccPrelimit`/`exists_eq_ciSup_of_not_isSuccPrelimit` with their primed `ConditionallyCompleteLinearOrderBot` theorems, and deprecates the other 6. Tags a couple of random `to_dual`s (in `ConditionallyCompleteLattice/Basic.lean`) to let us `to_dual`ize the new lemmas. --- ~~Should we also deprecate the 8 theorems that require `¬IsSuccPrelimit` and now use `mt`?~~ [](https://gitpod.io/from-referrer/) | t-order | 56/45 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/SetTheory/Cardinal/Order.lean | 3 | 8 | ['SnirBroshi', 'github-actions', 'vihdzp'] | nobody | none | 6 days ago | 6 days ago | 14 days |
| 38424 | SnirBroshi | feat(Combinatorics/SimpleGraph/Coloring/VertexColoring): `chromaticNumber ⊤` and other small lemmas | - Golf `isEmpty_of_colorable_zero` and rename to `Colorable.isEmpty` - `colorable_one_iff`: `G.Colorable 1 ↔ G = ⊥` - Combine `chromaticNumber_eq_zero_of_isEmpty`/`isEmpty_of_chromaticNumber_eq_zero` into `chromaticNumber_eq_zero_iff : G.chromaticNumber = 0 ↔ IsEmpty V` and deprecate the `→` side - `chromaticNumber_top_eq_enat_card`: `chromaticNumber ⊤ = ENat.card V` - Tag `chromaticNumber_top_eq_top_of_infinite`/`chromaticNumber_eq_zero_of_isEmpty` as `simp` - Golf `chromaticNumber_eq_one_iff` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 33/26 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean | 1 | 3 | ['SnirBroshi', 'github-actions', 'vlad902'] | nobody | none | 6 days ago | 8 days ago | 8 days |
| 38220 | wwylele | feat(LinearAlgebra/AffineSpace): shifting a subspace towards a point | Split off from #36018 and excluded the Simplex part. This is preparing to calculate the volume of a simplex by integrating the cross-section created by shifting the base plane. Part of https://github.com/leanprover-community/mathlib4/pull/34826. --- [](https://gitpod.io/from-referrer/) | t-algebra | 137/0 | Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean | 2 | 1 | ['github-actions'] | nobody | none | 6 days ago | 12 days ago | 12 days |
| 38442 | Parcly-Taxel | feat: arbitrary-order induction on `Nat` | This can be used as e.g. ```lean induction n using stepInduction 3 with | base n hn => ... | step n ih => ... ``` | t-data | 10/2 | Mathlib/Data/Nat/Init.lean | 1 | 3 | ['Parcly-Taxel', 'SnirBroshi', 'github-actions'] | nobody | none | 6 days ago | 7 days ago | 7 days |
| 38489 | Jun2M | feat(Topology/Algebra/InfiniteSum): Generalize ENNReal lemmas | This PR generalizes many theorems in Topology/Algebra/InfiniteSum/ENNReal.lean from `ENNREal` to any type that satisfies a list of order-related instances, mostly `[CommMonoid α] [CompleteLattice α] [CanonicallyOrderedMul α] [TopologicalSpace α] [SupConvergenceClass α]` Deprecation of the original `ENNReal` lemmas are done in the next PR: #38193. Related Zulip thread: [#Is there code for X? > Summing `ENat`s without topology](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/588756615) --- [](https://gitpod.io/from-referrer/) | 191/1 | Mathlib/Probability/ProbabilityMassFunction/Monad.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean | 2 | 2 | ['SnirBroshi', 'github-actions'] | nobody | none | 6 days ago | 6 days ago | 6 days | |
| 38498 | SnirBroshi | feat(Order/RelIso/Basic): lift a function to an order morphism into `Relation.Map` or from `Function.onFun` | For an `α`-relation `r` we have: ``` mapRelHom (f : α → β) : r →r Relation.Map r f f mapRelEmbedding (f : α ↪ β) : r ↪r Relation.Map r f f mapRelIso (f : α ≃ β) : r ≃r Relation.Map r f f ``` For a `β`-relation `r` we have: ``` onFunRelHom (f : α → β) : r.onFun f →r r onFunRelEmbedding (f : α ↪ β) : r.onFun f ↪r r onFunRelIso (f : α ≃ β) : r.onFun f ≃r r ``` --- These are pretty similar to `SimpleGraph.{Embedding/Iso}.map` and `SimpleGraph.{Hom/Embedding/Iso}.comap`, as [`comap`](https://github.com/leanprover-community/mathlib4/blob/9268b22206b0425419498769f780a91dee03bcf3/Mathlib/Combinatorics/SimpleGraph/Maps.lean#L117-L118) on graphs is a wrapper around `onFun`, and [`map`](https://github.com/leanprover-community/mathlib4/blob/9268b22206b0425419498769f780a91dee03bcf3/Mathlib/Combinatorics/SimpleGraph/Maps.lean#L57-L58) on graphs is *almost* a wrapper around `Relation.Map`. btw `@[simps]` is angry at me when I try to use it on the structures that use spread syntax. [](https://gitpod.io/from-referrer/) | t-order | 42/0 | Mathlib/Order/RelIso/Basic.lean | 1 | 1 | ['github-actions'] | nobody | none | 6 days ago | 6 days ago | 6 days |
| 38488 | b-mehta | feat(Data/Finset/Card): iterating a function's image on a finite set stabilises | ...and does so in a bounded number of steps (which is why this is Finset-specific). In a later PR, I'll add this for endofunctions on a fintype, as well as add a Set.Finite version. --- [](https://gitpod.io/from-referrer/) | t-data | 40/0 | Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Image.lean | 2 | 16 | ['SnirBroshi', 'b-mehta', 'github-actions'] | nobody | none | 6 days ago | 6 days ago | 6 days |
| 38344 | robo7179 | feat(SimpleGraph/Coloring/VertexColoring): Matching is 2 colorable | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 51/0 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean | 1 | 5 | ['SnirBroshi', 'github-actions', 'vlad902'] | nobody | none | 6 days ago | 9 days ago | 9 days |
| 38512 | gasparattila | chore(MeasureTheory): replace remaining `@[measurability]` attributes by `@[fun_prop]` | Since #30511, the `@[measurability]` attribute is equivalent to `@[fun_prop]` when applied to lemmas about measurability of functions. This PR replaces these attributes by `@[fun_prop]` and adds a warning for this use of `@[measurability]`. Note that `@[measurability]` is still used for lemmas about measurability of sets. --- [](https://gitpod.io/from-referrer/) | 45/41 | Mathlib/Analysis/Complex/UpperHalfPlane/Measure.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/AEStronglyMeasurable.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Group/Arithmetic.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/Measure/AEMeasurable.lean,Mathlib/MeasureTheory/Order/Lattice.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Tactic/Measurability.lean | 9 | 1 | ['github-actions'] | nobody | none | 6 days ago | 6 days ago | 6 days | |
| 38222 | IvanRenison | feat(Combinatorics/SimpleGraph/Girth): add lemmas about isomorphism and girth | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 19/1 | Mathlib/Combinatorics/SimpleGraph/Girth.lean | 1 | 6 | ['IvanRenison', 'SnirBroshi', 'github-actions', 'vlad902'] | nobody | none | 6 days ago | 12 days ago | 12 days |
| 38528 | SnirBroshi | feat(Combinatorics/SimpleGraph/Paths): some cycle lemmas are true for circuits | Add `IsCircuit.{not_of_nil,ne_bot,three_le_length}` by using their corresponding `IsCycle` proofs. Also golfs a bit. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 17/9 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 1 | ['github-actions'] | nobody | none | 6 days ago | 6 days ago | 6 days |
| 36686 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `List.prod_map_ite`: unchanged 🎉 * `Path.Homotopy.trans_assoc_reparam`: 2938 ms before, 717 ms after 🎉 * `SimplexCategory.δ_comp_δ`: 522 ms before, 316 ms after 🎉 * `Finsupp.ext_iff'`: unchanged 🎉 * `Computation.bind_assoc`: unchanged 🎉 * `Set.piecewise_insert`: unchanged 🎉 * `ZMod.valMinAbs_mem_Ioc`: unchanged 🎉 * `Matrix.det_eq_of_forall_row_eq_smul_add_pred_aux`: 2141 ms before, 2004 ms after 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 11/50 | Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/Set/Piecewise.lean,Mathlib/Data/ZMod/ValMinAbs.lean,Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean | 8 | 12 | ['artie2000', 'chenson2018', 'euprunin', 'github-actions', 'mathlib-merge-conflicts', 'ooovi'] | nobody | 2 | 5 days ago | 5 days ago | 45 days | |
| 34855 | staroperator | feat(Order): use `to_dual` for `PFilter` | This PR redefines `PFilter` to get rid of `OrderDual` and uses `to_dual` to translate theorems. The whole file of `PFilter` is now deprecated. Some changes: - To align with `Filter`, the order on `PFilter` is changed to the reversed set inclusion. Ultrafilters, the dual notion of maximal ideals, become minimal in this order. - `to_dual` does not work on `sequenceOfCofinals`. I left `Order.Cofinal` and the Rasiowa–Sikorski lemma not `to_dual`-ized, and we should move them to a separate file later. - `IsLEChain` is added to tag `to_dual`. --- - [x] depends on: #34820 --- [](https://gitpod.io/from-referrer/) | t-order | 293/242 | Mathlib/Order/Atoms.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/BooleanAlgebra/Defs.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/Ideal.lean,Mathlib/Order/PFilter.lean,Mathlib/Order/Preorder/Chain.lean,Mathlib/Order/PrimeIdeal.lean,Mathlib/Order/PrimeSeparator.lean,Mathlib/Order/ZornAtoms.lean,Mathlib/RingTheory/IdealFilter/Basic.lean,Mathlib/RingTheory/IdealFilter/Topology.lean,Mathlib/Tactic/Translate/ToDual.lean | 13 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | none | 5 days ago | 6 days ago | 7 days |
| 38483 | jessealama | feat(Algebra/BigOperators): add `Antiperiodic.sum_Ico_shift` | Two lemmas about `Finset` sums of antiperiodic functions over `Ico` intervals. * `Function.Antiperiodic.sum_Ico_shift`: For an antiperiodic function `f` with antiperiod `c`, the sum of `f` over the shifted interval `[a + c, b + c)` equals the negation of the sum over `[a, b)`. * `Function.Antiperiodic.sum_Ico_mul_add_sum_Ico_mul_shift_eq_zero`: A bilinear cancellation variant. Spun off from #29713 (Euler-Poincaré formula), where the bilinear form is used. | t-algebra | 54/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Periodic.lean | 2 | 1 | ['github-actions'] | nobody | none | 5 days ago | 6 days ago | 6 days |
| 38539 | plp127 | fix(Data/Bool/Basic): fix `Bool.not` problem | Fix three lemmas which have a subterm of the form `!a = b`, which elaborates to `(!(decide (a = b))) = true`, where `(!a) = b` was probably intended. These were introduced in #534. --- [](https://gitpod.io/from-referrer/) | t-data | 3/3 | Mathlib/Data/Bool/Basic.lean | 1 | 2 | ['github-actions', 'grunweg'] | nobody | none | 5 days ago | 5 days ago | 5 days |
| 38531 | SnirBroshi | feat(Combinatorics/SimpleGraph/Paths): `Walk.map` preserves more properties | Adds some missing theorems about how `Walk.map` behaves with `IsTrail`/`IsPath`/`IsCircuit`/`IsCycle`. Summary of what we have now, with the 8 new theorems and 2 renames marked: ``` IsTrail.of_map : (p.map f).IsTrail → p.IsTrail -- new map_isTrail_iff_of_injective : f.Injective → (p.map f).IsTrail ↔ p.IsTrail IsTrail.map : f.Injective → p.IsTrail → (p.map f).IsTrail -- renamed from map_isTrail_of_injective IsPath.of_map : (p.map f).IsPath → p.IsPath map_isPath_iff_of_injective : f.Injective → (p.map f).IsPath ↔ p.IsPath IsPath.map : f.Injective f → p.IsPath → (p.map f).IsPath -- renamed from map_isPath_of_injective IsCircuit.of_map : (p.map f).IsCircuit → p.IsCircuit -- new map_isCircuit_iff_of_injective : f.Injective → (p.map f).IsCircuit ↔ p.IsCircuit -- new IsCircuit.map : f.Injective → p.IsCircuit → (p.map f).IsCircuit -- new IsCycle.of_map : (p.map f).IsCycle → p.IsCycle -- new map_isCycle_iff_of_injective : f.Injective → (p.map f).IsCycle ↔ p.IsCycle IsCycle.map : f.Injective → p.IsCycle → (p.map f).IsCycle mapLe_isTrail : G ≤ G' → (p.mapLe h).IsTrail ↔ p.IsTrail IsTrail.of_mapLe : G ≤ G' → (p.mapLe h).IsTrail → p.IsTrail IsTrail.mapLe : G ≤ G' → p.IsTrail → (p.mapLe h).IsTrail mapLe_isPath : G ≤ G' → (p.mapLe h).IsPath ↔ p.IsPath IsPath.of_mapLe : G ≤ G' → (p.mapLe h).IsPath → p.IsPath IsPath.mapLe : G ≤ G' → p.IsPath → (p.mapLe h).IsPath mapLe_isCircuit : G ≤ G' → (p.mapLe h).IsCircuit ↔ p.IsCircuit -- new IsCircuit.of_mapLe : G ≤ G' → (p.mapLe h).IsCircuit → p.IsCircuit -- new IsCircuit.mapLe : G ≤ G' → p.IsCircuit → (p.mapLe h).IsCircuit -- new mapLe_isCycle : G ≤ G' → (p.mapLe h).IsCycle ↔ p.IsCycle IsCycle.of_mapLe : G ≤ G' → (p.mapLe h).IsCycle → p.IsCycle IsCycle.mapLe : G ≤ G' → p.IsCycle → (p.mapLe h).IsCycle ``` --- Also golfs `map_isPath_of_injective`/`IsPath.of_map`/`map_isTrail_iff_of_injective`, they don't need induction. [](https://gitpod.io/from-referrer/) | t-combinatorics | 47/31 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 1 | ['github-actions'] | nobody | none | 5 days ago | 5 days ago | 5 days |
| 38549 | SnirBroshi | feat(Combinatorics/SimpleGraph/Copy): `Is(Ind)Contained` `completeGraph` lemmas | - `G ⊑ completeGraph V` - `G ⊑ completeGraph W ↔ Nonempty (V ↪ W)` - `completeGraph V ⊴ completeGraph W ↔ Nonempty (V ↪ W)` - `G ⊴ completeGraph W → G = ⊤` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 12/0 | Mathlib/Combinatorics/SimpleGraph/Copy.lean | 1 | 1 | ['github-actions'] | nobody | none | 5 days ago | 5 days ago | 5 days |
| 38529 | SnirBroshi | feat(Combinatorics/SimpleGraph/Girth): `egirth ⊤ = 3` when there are at least 3 vertices | Since `Nontrivial` is not enough, we use the condition `3 ≤ ENat.card α`. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 17/0 | Mathlib/Combinatorics/SimpleGraph/Girth.lean | 1 | 5 | ['SnirBroshi', 'github-actions', 'vlad902'] | nobody | none | 5 days ago | 6 days ago | 6 days |
| 38548 | adomasbaliuka | feat(Algebra/Ring/BooleanRing): definitional lemmas for `Bool` ring operations | Mathlib defines a ring structure on `Bool` but is missing definitional lemmas for the arithmetic operations. --- Discussed on Zulip ([#Is there code for X? > `Bool.xor` same as `+` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/.60Bool.2Exor.60.20same.20as.20.60.2B.60/near/590927417)), in particular, it's not immediately intuitive to everyone what the operations do. Note that the parentheses around `^^` and `&&` are needed due to operator precedence w.r.t. `=`, see also https://github.com/leanprover-community/mathlib4/pull/38539. [](https://gitpod.io/from-referrer/) | t-algebra | 12/0 | Mathlib/Algebra/Ring/BooleanRing.lean | 1 | 1 | ['github-actions'] | nobody | none | 5 days ago | 5 days ago | 5 days |
| 37835 | YaelDillies | doc(Algebra/Order): update mentions of `OrderedSemiring` and friends | As of #20676, it was replaced by `IsOrderedRing`. Not all docs were straightforward to update. --- [](https://gitpod.io/from-referrer/) | t-algebra t-order | 123/280 | Counterexamples/HomogeneousPrimeNotPrime.lean,Counterexamples/OrderedCancelAddCommMonoidWithBounds.lean,Mathlib/Algebra/Group/Subgroup/Order.lean,Mathlib/Algebra/Group/ULift.lean,Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Floor/Defs.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/Group/Cone.lean,Mathlib/Algebra/Order/Group/Cyclic.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Defs.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Interval/Set/Monoid.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/ExistsOfLE.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Algebra/Order/Ring/Basic.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/Algebra/Order/Star/Basic.lean,Mathlib/Algebra/Order/Sub/WithTop.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Order/WithTop/Untop0.lean,Mathlib/Combinatorics/Pigeonhole.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Cast/Order/Basic.lean,Mathlib/Data/Nat/Cast/Order/Ring.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/Order/Filter/Germ/OrderedMonoid.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Valuation.lean,Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean,Mathlib/Tactic/NormNum/Ineq.lean | 37 | 9 | ['NoahW314', 'SnirBroshi', 'github-actions', 'mathlib-merge-conflicts'] | nobody | none | 5 days ago | 5 days ago | 20 days |
| 38347 | artie2000 | doc(LinearAlgebra/FreeModule/StrongRankCondition): clarify context of `commRing_strongRankCondition` | * Replace mathematical documentation in `Mathlib.LinearAlgebra.FreeModule.StrongRankCondition`, with explanation that the file comprises a shortcut instance `commRing_strongRankCondition` * Signpost `commRing_strongRankCondition` at both its parent instances * Increase priority of shortcut instance `commRing_strongRankCondition` above that of its parent instances --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 28/41 | Mathlib/LinearAlgebra/FreeModule/StrongRankCondition.lean,Mathlib/LinearAlgebra/InvariantBasisNumber.lean,Mathlib/RingTheory/FiniteType.lean | 3 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | none | 5 days ago | 5 days ago | 9 days |
| 34713 | dennj | feat(Probability/Markov): stationary distributions for stochastic matrices | This PR proves that every row-stochastic matrix on a finite nonempty state space has a stationary distribution in the standard simplex. Main additions to `Mathlib/Probability/Markov/Stationary.lean`: - `IsStationary`: A distribution μ is stationary for matrix P if μ ᵥ* P = μ - `cesaroAverage`: Cesàro average of iterates of a vector under a matrix - `Matrix.rowStochastic.exists_stationary_distribution`: existence theorem The proof uses Cesàro averaging: start with uniform distribution, form averages, extract convergent subsequence by compactness, show limit is stationary via L¹ non-expansiveness. Also adds `vecMul_mem_stdSimplex` to `Stochastic.lean`: multiplying a probability vector by a row-stochastic matrix preserves simplex membership. This is human-made PR with AI help in golfing proof and documenting the code. | t-algebra new-contributor | 166/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Stochastic.lean,Mathlib/Probability/Markov/Stationary.lean | 3 | 16 | ['dennj', 'dupuisf', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts', 'riccardobrasca'] | nobody | none | 4 days ago | 4 days ago | 15 days |
| 38557 | SnirBroshi | feat(Order/Monotone/Defs): weaken `Preorder` to `LE`/`LT` | `Monotone`/`Antitone`/`MonotoneOn`/`AntitoneOn` can use any `LE`, and `StrictMono`/`StrictAnti`/`StrictMonoOn`/`StrictAntiOn` can use any `LT`. This makes it necessary to add some explicit type params (e.g. `(α := α)`) in some places that use monotone-related theorems (e.g. `Function.monotone_eval`). --- Currently `OrderEmbedding` and `OrderIso` can use `LE` but `OrderHom` requires `Preorder` because it's defined using `Monotone`. Generalizing `Monotone` and friends will let us fix this oddity. [](https://gitpod.io/from-referrer/) | t-order | 21/15 | Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Order/Interval/Lex.lean,Mathlib/Order/Monotone/Defs.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean,Mathlib/Topology/Order/MonotoneConvergence.lean | 7 | 1 | ['github-actions'] | nobody | none | 4 days ago | 4 days ago | 4 days |
| 38568 | SnirBroshi | feat(SimpleGraph/Connectivity/Subgraph): `w.toSubgraph.IsInduced ↔ w.IsChordless` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 6/0 | Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean | 1 | 1 | ['github-actions'] | nobody | none | 4 days ago | 4 days ago | 4 days |
| 37975 | Thmoas-Guan | feat(RingTheory): AdicCompletion of local ring is local | In this PR, we proved that AdicCompletion of local ring wrt the maximal ideal is local ring with maximal ideal equal to the map of the original maximal ideal. Also, removing some old junk produced by myself. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 173/5 | Mathlib/RingTheory/AdicCompletion/LocalRing.lean | 1 | 15 | ['BryceT233', 'Thmoas-Guan', 'github-actions'] | nobody | none | 4 days ago | 18 days ago | 18 days |
| 38414 | chrisflav | chore(RingTheory): move `IsLocalizedModule.Away` to the `Basic` file and use it everywhere | --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 42/48 | Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/Algebra/Module/LocalizedModule/Away.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/RingTheory/LocalProperties/Exactness.lean,Mathlib/RingTheory/LocalProperties/Submodule.lean,Mathlib/RingTheory/Localization/Finiteness.lean,Mathlib/RingTheory/Localization/Free.lean,Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean,Mathlib/RingTheory/Spectrum/Prime/Module.lean,Mathlib/RingTheory/Support.lean | 12 | 6 | ['chrisflav', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | none | 4 days ago | 4 days ago | 7 days |
| 38052 | WenrongZou | feat(FormalGroup): `F(X,0)=X` and `F(0,X)=X` | In this PR, I prove that given a formal group law `F`, then `F(X,0) = X` and `F(0,X) = X`. And modify the definition of `FormalGroup.Point` to be a subtype. And prove that this subtype is a `AddZeroClass`. Eventually we will prove that this is a `AddGroup`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 261/33 | Mathlib/RingTheory/FormalGroup/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Basic.lean,Mathlib/RingTheory/PowerSeries/Evaluation.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean | 5 | 17 | ['WenrongZou', 'eric-wieser', 'github-actions', 'mariainesdff'] | nobody | none | 4 days ago | 6 days ago | 16 days |
| 38554 | YaelDillies | chore(Combinatorics/SimpleGraph): use the auto-param in `loopless` more | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 5/13 | Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean,Mathlib/Order/Cover.lean | 8 | 6 | ['SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | none | 3 days ago | 4 days ago | 4 days |
| 38027 | 8e7 | feat(Combinatorics/SimpleGraph/Star): define star graphs | Add a new definition `starGraph` and several key lemmas. Star graphs are a trivial class of tree, often used in constructive proofs regarding trees. An example use case is shown in #38334. --- All lemmas are hand written first, then golfed with the help of Claude Code. [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 85/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Star.lean | 2 | 39 | ['8e7', 'IvanRenison', 'JovanGerb', 'SnirBroshi', 'github-actions', 'vihdzp', 'vlad902'] | nobody | none | 3 days ago | 15 days ago | 17 days |
| 38604 | wwylele | chore(Algebra/Module): remove some `backward.privateInPublic` | --- [](https://gitpod.io/from-referrer/) | t-algebra tech debt | 14/30 | Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean | 2 | 1 | ['github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38596 | JJYYY-JJY | Add an API for row echelon forms of matrices | We write this PR to add `Mathlib.LinearAlgebra.Matrix.Echelon`, which is a theorem-oriented API for row-equivalence, echelon form, and reduced row echelon form of matrices.
The main additions are elementary row-scaling matrices, `Matrix.RowEquivalent`, echelon and reduced-echelon predicates, semantic representative predicates, existence and uniqueness of reduced echelon representatives over fields, and the noncomputable canonical representative `Matrix.rref`.
This is intentionally a semantic/theorem API rather than an executable row-reduction algorithm.
Co-authored-by: Joseph Qian |
t-algebra new-contributor | 1495/4 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Echelon.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean | 3 | 6 | ['JJYYY-JJY', 'copilot-pull-request-reviewer', 'github-actions', 'wwylele'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38589 | vlad902 | feat(SimpleGraph): add universal vertex predicate | Add the predicate `G.IsUniversal v` to indicate that `v` is a universal vertex, i.e. connected to all other vertices in `G`. This matches the recently added `G.IsIsolated v` predicate for isolated vertices.
Co-authored-by: Justin Lai |
t-combinatorics | 51/10 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Tutte.lean,Mathlib/Combinatorics/SimpleGraph/UniversalVerts.lean | 5 | 4 | ['8e7', 'github-actions', 'vlad902'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38555 | SnirBroshi | feat(Order/Hom/Basic): `OrderEmbedding.refl` and `OrderEmbedding.trans` | Define `OrderEmbedding.refl` and `OrderEmbedding.trans`, and add missing associativity lemmas for `OrderHom` and `OrderIso`. Also unsqueezes a couple of terminal simps in proofs about `OrderEmbedding.birkhoffFinset`/`Finset.orderEmbOfFin`/`Finset.orderEmbOfCardLe` which use `.trans` on an `OrderEmbedding` and now get `OrderEmbedding.trans` instead of `RelEmbedding.trans`. --- [](https://gitpod.io/from-referrer/) | t-order | 53/13 | Mathlib/Data/Finset/Sort.lean,Mathlib/Order/Birkhoff.lean,Mathlib/Order/Hom/Basic.lean | 3 | 5 | ['SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | none | 3 days ago | 4 days ago | 4 days |
| 38613 | Thmoas-Guan | feat(Algebra/Grp): add variant of is zero iff subsingleton | Add variant `IsZero (GrpCat.of G)` iff `Subsingleton G` --- [](https://gitpod.io/from-referrer/) | t-algebra | 10/0 | Mathlib/Algebra/Category/Grp/Zero.lean | 1 | 1 | ['github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38619 | mariainesdff | feat(Algebra/SkewPolynomial/Basic): add API | We add API for SkewPolynomial, including monomial, coeff, C and X. Co-authored by: @xgenereux. --- [](https://gitpod.io/from-referrer/) | t-algebra | 315/20 | Mathlib/Algebra/SkewPolynomial/Basic.lean | 1 | 1 | ['github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38370 | FordUniver | feat(Data.Finset.Powerset): add filter_powerset_subset and filter_powersetCard_subset | Add four lemmas characterising subsets of `powerset` and `powersetCard` that contain a fixed set `s`:
- `Finset.powerset_filter_sdiff`: `t.powerset.filter (s ⊆ ·) = (t \ s).powerset.image (· ∪ s)`
- `Finset.card_powerset_filter`: the count is `2 ^ (t.card - s.card)`
- `Finset.powersetCard_filter_sdiff`: `(t.powersetCard n).filter (s ⊆ ·) = ((t \ s).powersetCard (n - s.card)).image (· ∪ s)`
- `Finset.card_powersetCard_filter`: the count is `Nat.choose (t.card - s.card) (n - s.card)`
The bijection lemmas are stated as set equalities, which is strictly stronger than asserting a bijection: they imply cardinality equality, give a direct membership characterisation, and are usable as rewrites. The cardinality lemmas follow in three lines via `card_image_of_injOn`, using `LeftInvOn.injOn` to derive injectivity from the left inverse `· \ s`.
The hypothesis `s.card ≤ n` in the `powersetCard` variants is necessary: without it, natural subtraction silently gives the wrong count (`Nat.choose k 0 = 1 ≠ 0`).
Co-authored-by: Malte Jackisch |
t-data new-contributor | 52/0 | Mathlib/Data/Finset/Powerset.lean | 1 | 13 | ['FordUniver', 'github-actions', 'mathlib-bors', 'wwylele'] | nobody | none | 3 days ago | 9 days ago | 9 days |
| 38205 | jcommelin | chore: reduce technical debt in FreimanHom | This PR reduces technical debt related to the `CommRing` instance on `Fin (n + 1)`. --- [](https://gitpod.io/from-referrer/) | t-combinatorics large-import | 65/27 | Mathlib/Combinatorics/Additive/FreimanHom.lean | 1 | 9 | ['Vierkantor', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | none | 3 days ago | 4 days ago | 8 days |
| 38628 | tautschnig | feat(Data/ZMod/Basic): unit characterization for ZMod (p ^ d) | Add two lemmas characterizing units in `ZMod (p ^ d)` for a prime `p`: * `ZMod.isUnit_natCast_of_not_dvd_pow`: a natural number not divisible by `p` is a unit in `ZMod (p ^ d)`. * `ZMod.prime_natCast_not_isUnit_pow`: the prime `p` is not a unit in `ZMod (p ^ d)` when `d ≥ 1`. These complement the existing `isUnit_prime_iff_not_dvd` (which characterizes when a *prime* is a unit in `ZMod n`) by characterizing when an *arbitrary* natural number is a unit in `ZMod (p ^ d)`. **Motivation.** Arithmetic verification over fixed-width bitvectors works in `ZMod (2 ^ d)`. A Gröbner basis solver over this ring needs to know which constants are invertible: odd constants are units (enabling algebraic simplification), while even constants are not (requiring fallback to SAT). These lemmas formalize that characterization for any prime, not just 2. Further work related to Gröbner basis will be published once #29203 (and, before that, #34873) have been merged. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 12/0 | Mathlib/Data/ZMod/Basic.lean | 1 | 2 | ['github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38606 | dennj | feat: preparation for Vanishing Sum of Roots of Unity | Adds the Mathlib API extensions needed for an upcoming formalization of the Lam-style classification theorem for vanishing sums of roots of unity. * Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean + `exists_eq_const_of_sum_smul_eq_zero_of_sum_eq_zero_of_linearIndependent`: if `∑ vᵢ = 0` and the first `n-1` of `n` vectors are linearly independent, every linear relation has constant coefficients. * Mathlib/RingTheory/Radical/NatInt.lean + `Nat.totient_eq_div_radical_mul_totient_radical`: Euler's totient splits as `φ(n) = (n / rad n) * φ(rad n)`. * Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean + `IsPrimitiveRoot.sum_range_pow_mul_div_eq_zero_of_dvd`: the `d` evenly-spaced powers of a primitive `k`-th root sum to zero, for `d ∣ k` and `1 < d`. * Mathlib/NumberTheory/Cyclotomic/LinearDisjoint.lean (new) + `IsPrimitiveRoot.linearDisjoint_adjoin_pow_of_coprime`: cyclotomic subfields of coprime orders are linearly disjoint over `ℚ`. * Mathlib/NumberTheory/Cyclotomic/LinearRelations.lean (new) + `IsPrimitiveRoot.coeffs_eq_of_sum_pow_eq_zero_prime_coprime`: in the cyclotomic field of order `p * m` with `p` prime coprime to `m`, any `ℚ⟮ζ^p⟯`-linear relation among powers of `ζ^m` has all coefficients equal. --- I need these as preparation to start formalizing the theorem: Let k be a positive integer. If a finite family of complex k-th roots of unity sums to zero, then the size of the family is a non-negative integer combination of the prime divisors of k. --- Human-made PR with AI used for golfing and documentation | new-contributor | 219/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/NumberTheory/Cyclotomic/LinearDisjoint.lean,Mathlib/NumberTheory/Cyclotomic/LinearRelations.lean,Mathlib/RingTheory/Radical/Totient.lean,Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean | 6 | 2 | ['github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38640 | yuanyi-350 | refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Constructions/Polish/EmbeddingReal` | - simplifies the finite-case measurable-range proof to `Set.finite_range ((↑) : Fin n → ℝ)).measurableSet` - simplifies the countably infinite-case measurable-range proof to `Nat.isClosedEmbedding_coe_real.isClosed_range.measurableSet` Extracted from #38104 [](https://gitpod.io/from-referrer/) | codex LLM-generated | 2/7 | Mathlib/MeasureTheory/Constructions/Polish/EmbeddingReal.lean | 1 | 2 | ['github-actions', 'leanprover-radar'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38649 | chrisflav | chore(RingTheory): equality of linear map with values in finite module spreads out | We add some corollaries of `Module.Finite.exists_smul_of_comp_eq_of_isLocalizedModule`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 75/1 | Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Module.lean | 3 | 2 | ['github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38592 | SnirBroshi | feat(Logic/Embedding/Basic): `refl_trans`/`trans_refl`/`trans_assoc` | - `(.refl α).trans f = f` - `f.trans (.refl β) = f` - `(f.trans g).trans h = f.trans (g.trans h)` --- [](https://gitpod.io/from-referrer/) | t-logic | 12/0 | Mathlib/Logic/Embedding/Basic.lean | 1 | 1 | ['github-actions', 'vihdzp'] | nobody | 1 | 3 days ago | 3 days ago | 3 days |
| 38656 | NoahW314 | feat(Data/Finsupp/Weight): add `Finsupp.degree_mapDomain` | Generalize a result by removing an unnecessary hypothesis. Also simplifies the proof. --- [](https://gitpod.io/from-referrer/) | t-data | 9/8 | Mathlib/Data/Finsupp/Weight.lean,Mathlib/Order/Filter/TendstoCofinite.lean | 2 | 2 | ['NoahW314', 'github-actions'] | nobody | none | 3 days ago | 3 days ago | 3 days |
| 38029 | Thmoas-Guan | feat(RingTheory): lemmas for minimal primes to lessen defeq abuse | Remove access by `.1.1` and `.1.2` to mem minimal primes. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 77/59 | Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean | 6 | 6 | ['Thmoas-Guan', 'chrisflav', 'github-actions', 'themathqueen'] | nobody | none | 3 days ago | 7 days ago | 16 days |
| 29701 | Thmoas-Guan | feat(Algebra/RingTheory): polynomial over regular ring | In this PR, we proved that polynomial over regular ring is regular. --- - [x] depends on: #28684 [](https://gitpod.io/from-referrer/) | t-ring-theory | 128/0 | Mathlib.lean,Mathlib/RingTheory/RegularLocalRing/Polynomial.lean | 2 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | none | 3 days ago | 8 days ago | 8 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Approval(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 37871 | JJYYY-JJY | feat: support intros and simple rintro in introMerge | * Extend the `introMerge` linter to handle `intros` and a safe subset of `rintro` tactics, allowing it to suggest merging a wider variety of adjacent introduction tactics. * Introduce helper functions to normalize supported `rcases` and `rintro` patterns into equivalent `intro` arguments for consistent analysis. * Add tests to verify the correct merging of mixed introduction tactics and ensure intervening tactics prevent merging. --- [](https://gitpod.io/from-referrer/) | t-meta new-contributor | 101/9 | Mathlib/Dynamics/OmegaLimit.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,MathlibTest/TacticAnalysis.lean | 3 | 3 | ['copilot-pull-request-reviewer', 'github-actions'] | dwrensha | none | 20 days ago | 21 days ago | 21 days |
| 37522 | matthewjasper | chore: adjust Module.Finite instance priority | Make instances that are rarely going to be helpful lower priority. Increase the priority of `FiniteDimensional.complexToReal`, because it's more likely correct than the other priority 100 `Module.Finite` instances. --- [](https://gitpod.io/from-referrer/) | t-algebra | 6/4 | Mathlib/LinearAlgebra/Complex/FiniteDimensional.lean,Mathlib/LinearAlgebra/Dimension/Free.lean,Mathlib/LinearAlgebra/Dual/Lemmas.lean | 3 | 3 | ['github-actions', 'grunweg', 'leanprover-radar'] | eric-wieser | none | 19 days ago | 29 days ago | 29 days |
| 36385 | CoolRmal | feat: a sequential and countably compact space is sequentially compact | The main result proved in this PR is that a sequential and countably compact space is sequentially compact. We also prove some lemmas: 1. If `f` is an embedding, then `A` is sequentially compact iff `f '' A` is sequentially compact. This result is then used to show the equivalence of `IsSeqCompact A` and `SeqCompactSpace A`. 2. If `f` is inducing, then `A` is countably compact iff `f '' A` is countably compact. This result is then used to show the equivalence of `IsCountablyCompact A` and `CountablyCompactSpace A`. 3. If `f` converges and `g` is another function such that `g x ∈ closure {f x}` for all `x`, then `g` also converges. --- - [x] depends on: #36174 [](https://gitpod.io/from-referrer/) | t-topology | 146/13 | Mathlib/Topology/Compactness/CountablyCompact.lean,Mathlib/Topology/Inseparable.lean,docs/references.bib | 3 | 33 | ['ADedecker', 'CoolRmal', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'scholzhannah'] | PatrickMassot | 1 | 19 days ago | 19 days ago | 31 days |
| 36155 | grunweg | feat: custom elaborators for TangentSpace and tangentMap(Within) | And use these to golf the differential geometry files a bit further. --- [](https://gitpod.io/from-referrer/) | t-differential-geometry t-meta | 85/30 | Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/MFDeriv/Tangent.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/Topology/FiberBundle/Constructions.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean | 8 | 5 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'ocfnash'] | PatrickMassot | 1 | 18 days ago | 18 days ago | 56 days |
| 37406 | vihdzp | feat(SetTheory/Cardinal): `IsStrongPrelimit` predicate | We introduce a predicate for cardinals `c` such that `x < c` implies `x < 2 ^ c`. This is to `IsStrongLimit` as `IsSuccPrelimit` is to `IsSuccLimit`. We then make use of it in a few places where we were writing down `∀ x < c, x < 2 ^ c` explicitly. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 56/25 | Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Cardinal/Regular.lean | 4 | 1 | ['github-actions'] | alreadydone | none | 17 days ago | 29 days ago | 31 days |
| 37534 | EtienneC30 | feat: cardinality of subsets of a given cardinality | Given a finite set `s`, the number of subsets of `s` with cardinality `n` is `s.ncard.choose n`. This is analog to [Finset.card_powersetCard](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finset/Powerset.html#Finset.card_powersetCard) and [Set.powersetCard.card](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Set/PowersetCard.html#Set.powersetCard.card) but with a set of sets rather than involving finsets. --- [](https://gitpod.io/from-referrer/) | t-data | 18/0 | Mathlib/Data/Set/Card.lean | 1 | 1 | ['github-actions'] | TwoFX | none | 16 days ago | 29 days ago | 29 days |
| 37718 | SabrinaJewson | feat(Order): add conversions from `Std` order typeclasses to Mathlib ones | `{Preorder, PartialOrder, LinearOrder}.ofStd` exist to facilitate convenient translation from `Std` order typeclasses to Mathlib ones. --- [](https://gitpod.io/from-referrer/) | t-order new-contributor | 366/0 | Mathlib.lean,Mathlib/Order/Std.lean,MathlibTest/OrderOfStd.lean | 3 | 2 | ['github-actions'] | bryangingechen | none | 16 days ago | 24 days ago | 24 days |
| 34702 | pfaffelh | feat(Data/FinsetPowerset): The set `{v : List.Vector Bool n | v.val.count = k}` has cardinality `n.choose k` | Show that `{v : List.Vector Bool n | v.val.count = k}` has cardinality `n.choose k`. The proof builds on `powersetCard k s` (the subsets of `s : Finset _` with cardinality `k`), and an equivalence to the above set. --- [](https://gitpod.io/from-referrer/) | large-import t-data | 52/1 | Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Fintype/Pi.lean,Mathlib/Logic/Equiv/Fintype.lean | 3 | 25 | ['DavidLedvinka', 'b-mehta', 'eric-wieser', 'github-actions', 'joneugster', 'pfaffelh'] | Vierkantor | none | 15 days ago | 84 days ago | 87 days |
| 32692 | WilliamCoram | feat: define multivariate restricted power series | We define multivariate restricted power series over a normed ring R, and show the properties that they form a ring when R has the ultrametric property. This work generalises my previous work in #26089 which will need to be refactored. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-number-theory new-contributor | 137/0 | Mathlib.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/RingTheory/MvPowerSeries/Restricted.lean | 3 | 43 | ['WilliamCoram', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts'] | alreadydone | none | 15 days ago | 15 days ago | 33 days |
| 37598 | IvanRenison | feat(Combinatorics/SimpleGraph/Coloring): add lemmas about coloring and maps | --- Idea from this Zulip thread: [graph theory>Second Order Monadic Logic for Graph](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Second.20Order.20Monadic.20Logic.20for.20Graph/with/583013775) [](https://gitpod.io/from-referrer/) | t-combinatorics | 37/13 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean | 2 | 18 | ['IvanRenison', 'SnirBroshi', 'b-mehta', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | b-mehta | none | 14 days ago | 14 days ago | 26 days |
| 37588 | Vierkantor | feat(Linter/DocString): ignore Verso linter errors about links and LaTeX | I went through [the weekly linting log](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/near/582485221) and found most of the warnings come from three sources. All of these are sensical syntax in our current Markdown dialect, and should be fixed automatically by a script, instead of manually. I expect after these changes we'll be down to hundreds of linter errors rather than two thousand.
* References [between square brackets] without a following link URL. Verso has different implementations for references depending on what kind they are, and since there are a thousand references we should be using a script to fix these.
* Autolinks: bare URLs or URLs between |
t-linter large-import maintainer-merge | 113/5 | Mathlib/Tactic/Linter/DocString.lean,MathlibTest/DocString.lean | 2 | 18 | ['Vierkantor', 'github-actions', 'thorimur'] | thorimur | none | 14 days ago | 14 days ago | 17 days |
| 37808 | JovanGerb | feat(Translate): locally modify name guessing dictionaries | This PR adds the feature to `to_dual` and `to_additive` that you can now locally modify the name translation dictionary. With this change, we run the risk of having the automated translations being harder to predict. For this reason, the changes to the dictionary do not persisted through imports. Instead, the change lasts until the end of the file (though it ignores sections). See https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Order.20dual.20tactic/near/580834166 --- [](https://gitpod.io/from-referrer/) | t-meta maintainer-merge | 111/39 | Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/GaloisConnection/Defs.lean,Mathlib/Order/Interval/Set/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/GuessName.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Tactic/Translate/ToDual.lean,MathlibTest/ToDual.lean | 9 | 4 | ['JovanGerb', 'bryangingechen', 'github-actions', 'joneugster'] | joneugster | 1 | 14 days ago | 19 days ago | 19 days |
| 36863 | artie2000 | refactor(Algebra/Order/Ring/Ordering): unbundle `RingPreordering` | The current design for [RingPreordering](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Ring/Ordering/Defs.html#RingPreordering) ran into issues at PR #32077. This PR unbundles [RingPreordering](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Ring/Ordering/Defs.html#RingPreordering) into a class predicate on [Subsemiring](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Ring/Subsemiring/Defs.html#Subsemiring), generalising the material on supports as far as possible. Zulip thread: https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Ring.20orderings.20-.20structure.20or.20predicate.3F/with/562594050 See #37298 for the analogous change to group and ring cones. --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 455/87 | Mathlib.lean,Mathlib/Algebra/Order/Ring/Ordering/Basic.lean,Mathlib/Algebra/Order/Ring/Ordering/Defs.lean,Mathlib/Algebra/Ring/Subsemiring/Support.lean | 4 | 13 | ['artie2000', 'chrisflav', 'github-actions'] | eric-wieser | none | 14 days ago | 14 days ago | 39 days |
| 37982 | chrisflav | feat(RingTheory/Etale): descent along faithfully flat maps | From Pi1. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 123/1 | Mathlib.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Descent.lean | 3 | 5 | ['chrisflav', 'github-actions', 'robin-carlier'] | mattrobball | none | 14 days ago | 14 days ago | 18 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 28803 | astrainfinita | refactor: unbundle algebra from `ENormed*` | Further speed up the search in the algebraic typeclass hierarchy by avoiding searching for `TopologicalSpace`. This PR continues the work from #23961. - Change `ESeminormed(Add)Monoid` and `ENormed(Add)Monoid` so they no longer carry algebraic data. - Deprecate `ESeminormed(Add)CommMonoid` and `ENormed(Add)CommMonoid` in favor of `ESeminormed(Add)Monoid` and `ENormed(Add)Monoid` with a commutative algebraic typeclass. |Old|New| |---|---| | `[ESeminormed(Add)(Comm)Monoid E]` | `[(Add)(Comm)Monoid E] [ESeminormed(Add)Monoid E]` | | `[ENormed(Add)(Comm)Monoid]` | `[(Add)(Comm)Monoid E] [ENormed(Add)Monoid]` | See [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2328803.20refactor.3A.20unbundle.20algebra.20from.20.60ENormed*.60/with/536024350) ------------ - [x] depends on: #28813 | t-algebra merge-conflict slow-typeclass-synthesis awaiting-zulip t-analysis | 80/63 | Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/NormedSpace/IndicatorFunction.lean,Mathlib/MeasureTheory/Function/L1Space/AEEqFun.lean,Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean | 14 | 28 | ['astrainfinita', 'bryangingechen', 'github-actions', 'grunweg', 'kbuzzard', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | grunweg | 7 months ago | 249 days ago | 5 hours |
| 25737 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms): Normal forms for `P_δ`s | We prove that admissible lists indeed provide a normal form for morphisms of satisfying `P_δ`. 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 first simplicial identity, composition on the left corresponds to simplicial insertion in the list. This gives existence of a normal form for every morphism satisfying `P_δ`. 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. Part of a series of PR formalising that `SimplexCategoryGenRel` is equivalent to `SimplexCategory`. --- - [x] depends on: #25736 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #21746.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/21746* | t-algebraic-topology delegated t-category-theory | 181/2 | Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean | 1 | 6 | ['github-actions', 'joelriou', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 193 days ago | 6 hours |
| 35436 | daniel-carranza | feat(CategoryTheory/Monoidal/Closed): Prove the isomorphism of internal hom objects C(x \otimes y, z) and C(y, C(x, z)) | Prove the currying-uncurrying isomorphism `C(x \otimes y, z) \iso C(y, C(x, z))` between internal hom objects of a closed monoidal category `C`. --- This result is connected to the infinity-cosmos project, and is used to prove that a closed monoidal category enriched in itself admits all cotensors. ~Line 81 currently contains a one-line proof in tactics mode `exact rfl`. When trying to use `rfl` outside of tactics mode, an error is thrown~ (Fixed, thank you @robin-carlier!). Any help with this (or any other aspect of the formalization) is greatly appreciated! [](https://gitpod.io/from-referrer/) | new-contributor t-category-theory infinity-cosmos delegated | 89/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Closed/InternalCurrying.lean | 2 | 15 | ['dagurtomas', 'daniel-carranza', 'github-actions', 'joelriou', 'mathlib-bors', 'riccardobrasca', 'robin-carlier'] | adamtopaz | 1 month ago | 63 days ago | 7 days |
| 33466 | Shreyas4991 | refactor(Combinatorics/Digraph): add vertex sets | --- [](https://gitpod.io/from-referrer/) | t-combinatorics merge-conflict please-adopt | 382/55 | Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/Digraph/Orientation.lean | 2 | 83 | ['IvanRenison', 'Shreyas4991', 'SnirBroshi', 'YaelDillies', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp', 'vlad902'] | awainverse | 1 month ago | 49 days ago | 27 days |
| 30451 | kckennylau | feat(HomogeneousIdeal): generalize to homogeneous submodule | Continuation of #30437 with permission from @jjaassoonn, which is a continuation of #9820 . The definitions, constructions and theorems in `HomogeneousIdeal.lean` are generalized to homogeneous submodules. Let `R` be a graded ring and `M` be a graded `R`-module. Say an `R`-submodule `N` of `M` is homogeneous if for every `x` in `N`, each projection of `x` to `M_i` is in `N`. None of this file's results depends on the grading on `R`, but we include the grading on `R` for technical reasons. We define the "homogeneous core" of a not necessarily homogeneous submodule N to be the biggest homogeneous submodule contained within N, and the "homogeneous hull" to be the smallest homogeneous submodule that contains N. All definitions/constructions/theorems are then copied for ideals/homogeneous ideals. The motivation of this generalization is graded quotient module. (#18716) --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author merge-conflict | 581/185 | Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/DirectSum/Finsupp.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean | 10 | 23 | ['github-actions', 'mariainesdff', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | mariainesdff | 1 month ago | 51 days ago | 22 days |
| 37386 | gasparattila | chore: call `dsimp` in the default tactic of `ContinuousLinearMap` | --- This will also reduce the breakage in https://github.com/leanprover-community/mathlib4/pull/35548. [](https://gitpod.io/from-referrer/) | t-topology awaiting-author | 33/76 | Mathlib/Algebra/Category/ContinuousCohomology/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Distribution/DerivNotation.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Fourier/Notation.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/ConjSqrt.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/Probability/Distributions/Fernique.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Basic.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/LinearMapCompletion.lean,Mathlib/Topology/Algebra/Module/Alternating/Topology.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Topology.lean,Mathlib/Topology/Algebra/Module/Star.lean,Mathlib/Topology/Algebra/Star/LinearMap.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousMap/Algebra.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/Instances/TrivSqZeroExt.lean | 36 | 15 | ['gasparattila', 'github-actions', 'j-loreaux', 'leanprover-radar', 'mathlib-bors', 'themathqueen'] | j-loreaux | 22 days ago | 24 days ago | 6 days |
| 37938 | SamuelSchlesinger | feat(Probability/Posterior): Posterior PMFs and Various Lemmas | Upstreaming the probability lemmas needed in https://github.com/leanprover/cslib/pull/464. | t-measure-probability new-contributor awaiting-author | 130/0 | Mathlib.lean,Mathlib/Probability/ProbabilityMassFunction/Posterior.lean | 2 | 5 | ['EtienneC30', 'SamuelSchlesinger', 'github-actions'] | RemyDegenne | 15 days ago | 15 days ago | 21 hours |
| 34875 | banrovegrie | feat(LinearAlgebra/Matrix): add Sherman-Morrison formula | Mathlib has the matrix determinant lemma (`det_add_replicateCol_mul_replicateRow` in SchurComplement.lean) but lacked the corresponding inverse formula. This PR fills that gap. - Add `Matrix.inv_add_vecMulVec`: Sherman-Morrison formula for `(A + uv^T)^{-1}` - Add `Matrix.inv_sub_vecMulVec`: subtraction variant - Add `Matrix.isUnit_det_add_vecMulVec`: invertibility under the formula's hypotheses ## Test plan - [x] `lake build` passes - [x] Lines within 100 char limit - [x] All declarations have docstrings **Any specific AI usage?**: Used Copilot for review purposes. | t-algebra new-contributor awaiting-author | 135/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/ShermanMorrison.lean | 2 | 13 | ['Xxxjdjdid', 'banrovegrie', 'chrisflav', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] | chrisflav | 14 days ago | 16 days ago | 69 days |
| 36218 | Brian-Nugent | feat(CategoryTheory): Add exact sequences for Sheaf Cohomology | In this PR, I add the long exact sequence for sheaf cohomology as well as prove that it is functorial. Since sheaf cohomology is defined in terms of `Ext`, this is done using the covariant sequence for `Ext`. --- - [ ] depends on: #34742 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-category-theory | 313/3 | Mathlib.lean,Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/ExactSequences.lean | 5 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 57 days ago | 32 seconds |
| 36553 | j-loreaux | feat: add IsMulCommutative instances for directed families of commutative subobjects | --- - [ ] depends on: #36549 [](https://gitpod.io/from-referrer/) | t-algebra | 169/1 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Membership.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | 11 | 5 | ['github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'themathqueen'] | kim-em | 8 days ago | 8 days ago | 30 days |
| 37851 | gaetanserre | feat(Category/Kernel): `Stoch` is a positive Markov category | Add several `Deterministic` instances for `SFinKer` and `Stoch` associators, unitors, braiding, counit, and comul morphisms. In particular, all isomorphisms in `Stoch` are `Deterministic`. To show that, I created `Kernel.IsDeterministicKernel` that encodes that a kernel is _deterministic_, in the sense of Markov category (see Definition 10.1 of _A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics_, Fritz 2020). I then followed the proof of Example 11.25 to show that `Stoch` is a positive Markov category (see `Kernel.parallelComp_id_comp_copy_comp`), inducing that all isomorphisms in `Stoch` are `Deterministic`. - [ ] depends on: #38211 - [ ] depends on: #38212 --- [](https://gitpod.io/from-referrer/) | t-measure-probability t-category-theory blocked-by-other-PR merge-conflict | 414/38 | Mathlib.lean,Mathlib/CategoryTheory/MarkovCategory/Positive.lean,Mathlib/CategoryTheory/Monoidal/Widesubcategory.lean,Mathlib/Probability/Kernel/Category/SFinKer.lean,Mathlib/Probability/Kernel/Category/Stoch.lean,Mathlib/Probability/Kernel/Composition/KernelLemmas.lean,Mathlib/Probability/Kernel/Deterministic.lean | 7 | 12 | ['RemyDegenne', 'dagurtomas', 'gaetanserre', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | RemyDegenne | 7 days ago | 15 days ago | 5 days |
| 37556 | edwin1729 | feat(Topology/Order): Locale.localePointOfSpacePoint if we have a Scott Topology from an Algebraic DCPO | (3/4) in a series of PRs proving that "Scott Topologies over Algebraic DCPOs are Sober" We prove here that the unit of the adjunction from `TopCat` to `Locale` defined in `Topology/Order/Category/FrameAdjunction.lean` is a surjective mapping, under the following condition: The underlying TopologicalSpace must be a Scott Topology generated with an underlying Algebraic DCPO structure. - [ ] depends on: #37445 --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor blocked-by-other-PR merge-conflict | 393/1 | Mathlib.lean,Mathlib/Topology/Order/ScottTopology.lean,Mathlib/Topology/Order/ScottTopologyDCPO.lean,docs/references.bib | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 29 days ago | 21 minutes |
| 38649 | chrisflav | chore(RingTheory): equality of linear map with values in finite module spreads out | We add some corollaries of `Module.Finite.exists_smul_of_comp_eq_of_isLocalizedModule`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 75/1 | Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Module.lean | 3 | 2 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 37753 | JovanGerb | chore(Order/Filter/Basic): use `to_dual` for `≤ᶠ` | Use `to_dual` on lemmas about `EventuallyLE`. --- [](https://gitpod.io/from-referrer/) | t-order | 19/6 | Mathlib/Order/Filter/Basic.lean | 1 | 2 | ['github-actions', 'vihdzp'] | bryangingechen | 2 days ago | 24 days ago | 24 days |
| 38584 | TJHeeringa | feat(Analysis/InnerProductSpace/Reproducing): Add outerKernel, mem_iff |
---
Adds the `outerKernel` definition and the theorem `mem_iff`. These are needed for proving statements involving embeddings of RKHS.
I can split `mem_of_posSemidef` and `mem_iff` off into a different pull request if that is preferred.
The theorems `mem_of_posSemidef` and `posSemidef_of_mem` are the two directions of `mem_iff`. `posSemidef_of_mem` is slightly stronger than the converse direction of `mem_iff` in the sense that it also specifies the constant `c` in the statement. The specified `c` is in fact the smallest possible `c` for which the statement holds.
The statement `mem_of_posSemidef` proves `∃ (g : H), (g : X → V) = f`. We could instead write `f ∈ (coeCLM 𝕜 (H:=H)).range`. Making this change would require the addition of the line `simp only [LinearMap.mem_range, coe_coe, coeCLM_apply]` in the beginning of the proof. The full beginning is then
```
lemma mem_of_posSemidef (f : X → V) {c : ℝ}
(hc : ((c : 𝕜) ^ 2 • kernel H - outerKernel 𝕜 f).PosSemidef) : f ∈ (coeCLM 𝕜 (H:=H)).range := by
simp only [LinearMap.mem_range, coe_coe, coeCLM_apply]
let Laux : ...
```
Making a `MemRKHS` like MemLp and MemSobolev and then writing `MemRKHS H f` is also an option. Happy to change it to whatever is preferred.
The proof of `mem_of_posSemidef` is based on the idea that any function f in the RKHS satisfies ` |
t-analysis new-contributor | 126/1 | Mathlib/Analysis/InnerProductSpace/Reproducing.lean | 1 | 2 | ['github-actions'] | ADedecker | 2 days ago | 4 days ago | 4 days |
| 35219 | kim-em | feat(GroupTheory/Artin): define Artin groups and their universal property | This PR defines Artin groups (also called Artin-Tits groups) as presented groups associated to Coxeter matrices, and establishes their universal property. - `CoxeterMatrix.ArtinGroup`: the Artin group associated to a Coxeter matrix - `CoxeterMatrix.artinGenerator`: the generators of the Artin group - `CoxeterMatrix.IsArtinLiftable`: the braid relation condition for liftability - `CoxeterMatrix.artinLift`: the universal property of Artin groups - `CoxeterMatrix.artinToCoxeter`: the canonical surjection to the Coxeter group - `CoxeterMatrix.artinToCoxeter_surjective`: surjectivity - [ ] depends on: #35218 🤖 Prepared with Claude Code | blocked-by-other-PR t-group-theory LLM-generated | 429/2 | Mathlib.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Artin/Basic.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/GroupTheory/Coxeter/Perm.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/GroupTheory/PresentedGroup.lean | 10 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 77 days ago | 10 minutes |
| 38659 | ldct | chore(Counterexamples/MapFloor): remove `respectTransparency` | It seemed better to make this an `abbrev` since we want to copy most of the instances over. --- [](https://gitpod.io/from-referrer/) | 7/13 | Counterexamples/MapFloor.lean | 1 | 4 | ['github-actions', 'grunweg'] | nobody | 1 day ago | 2 days ago | 2 days | |
| 38758 | TBUGTB | feat(LinearAlgebra/ConvexSpace): StdSimplex bind operation | Define the monadic bind operation for StdSimplex and add basic API lemmas. This operation is needed for formalising the Komlós lemma used in the construction of Stochastic Integrals (cf. [this PR](https://github.com/RemyDegenne/brownian-motion/pull/399) in the brownian-motion project). | t-algebra new-contributor brownian ready-to-merge | 40/0 | Mathlib/LinearAlgebra/ConvexSpace.lean | 1 | 17 | ['EtienneC30', 'RemyDegenne', 'TBUGTB', 'YaelDillies', 'github-actions', 'mathlib-bors'] | nobody | 4 hours ago | 4 hours ago | 1 day |
| 38169 | tb65536 | chore(GroupTheory/Finiteness): make `Subgroup.FG` a class | This PR refactors `Subgroup.FG` to be a class to match `Group.FG`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 37/20 | Mathlib/GroupTheory/Commutator/Finite.lean,Mathlib/GroupTheory/Finiteness.lean,Mathlib/GroupTheory/Rank.lean,Mathlib/GroupTheory/Schreier.lean | 4 | 10 | ['JovanGerb', 'github-actions', 'mathlib-bors', 'riccardobrasca', 'tb65536'] | riccardobrasca | 45 minutes ago | 4 hours ago | 14 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 13791 | digama0 | refactor: Primrec and Partrec | General cleanup of the `Primrec` and `Partrec` files, to better adjust to lean 4 things. The main user-visible change is that `Primrec₂` is no longer a `def` but an `abbrev`, because it was causing inference issues in lean 4. I also removed all the nonterminal `simp`s in `PartrecCode.lean`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability tech debt | 585/778 | Mathlib/Computability/Ackermann.lean,Mathlib/Computability/Halting.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/Primrec.lean | 5 | 2 | ['github-actions', 'grunweg'] | nobody | 1 year ago | 684 days ago | 1 day |
| 15448 | urkud | chore(*): deprecate `Option.elim'` | Use `Option.elim` instead. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt | 54/50 | Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/Calculus/LagrangeMultipliers.lean,Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/TMToPartrec.lean,Mathlib/Data/Option/Defs.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/Logic/Embedding/Set.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/Topology/Compactness/Paracompact.lean,Mathlib/Topology/LocallyFinite.lean | 17 | 12 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'grunweg', 'urkud'] | nobody | 1 year ago | 629 days ago | 7 days |
| 33138 | gasparattila | chore(MeasureTheory/Measure/Stieltjes): remove `backward.privateInPublic` | In #32482, some definitions in this file were rewritten using private declarations. However, this made `StieltjesFunction.length` unusable, since its API uses private declarations even in statements. This PR fixes this by problem by specializing `length_eq` to `NoMinOrder` and adding a new lemma for the `OrderBot` case. The other lemmas involving the private declarations are made private, except for `length_subadditive_Icc_Ioo`, which is reverted to the previous statement. --- [](https://gitpod.io/from-referrer/) | t-measure-probability tech debt awaiting-author | 35/30 | Mathlib/MeasureTheory/Measure/Stieltjes.lean | 1 | 6 | ['github-actions', 'grunweg', 'sgouezel', 'vihdzp'] | sgouezel | 4 months ago | 126 days ago | 5 days |
| 12879 | grunweg | feat: port ge_or_gt linter from mathlib3 | Code works and is essentially green: next step is to split up into separate PRs. Feedback welcome on whether: - all the test changes are good, or I should simply allow it in more cases - if calc blocks need to be explicitly exempt --- - [ ] depends on: #12933 - [ ] depends on: #12934 - [ ] depends on: #12931 [](https://gitpod.io/from-referrer/) | merge-conflict t-linter tech debt blocked-by-other-PR | 736/319 | Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2019Q4.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Star/CHSH.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/Normed/Group/ControlledClosure.lean,Mathlib/Analysis/NormedSpace/MStructure.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Computability/AkraBazzi/AkraBazzi.lean,Mathlib/Computability/AkraBazzi/GrowsPolynomially.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Int/Lemmas.lean,Mathlib/Data/Nat/Dist.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Nat/Upto.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/UInt.lean,Mathlib/GroupTheory/Coxeter/Length.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean,Mathlib/MeasureTheory/Integral/Layercake.lean,Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Rayleigh.lean,Mathlib/Order/Filter/AtTopBot.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/Adjoin/Basic.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CancelDenoms/Core.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/IntervalCases.lean,Mathlib/Tactic/Linarith/Datatypes.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter/GeOrGt.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/NormNum/GCD.lean,Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Topology/Category/Profinite/Nobeling.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/MetricSpace/Cauchy.lean,Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sequences.lean,scripts/lint-style.py,test/Explode.lean,test/GCongr/inequalities.lean,test/GeOrGt.lean,test/LibrarySearch/IsCompact.lean,test/LibrarySearch/basic.lean,test/Recall.lean,test/Rify.lean,test/Use.lean,test/cancel_denoms.lean,test/congr.lean,test/delabLinearIndependent.lean,test/delaborators.lean,test/interval_cases.lean,test/linarith.lean | 109 | 4 | ['github-actions', 'grunweg', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 3 months ago | 715 days ago | 4 hours |
| 24100 | eric-wieser | feat: restore some explicit binders from Lean 3 | Part of #24099 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt t-topology t-algebra | 39/42 | Mathlib/Data/FinEnum.lean,Mathlib/FieldTheory/Galois/Profinite.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Compactness/CompactlyGeneratedSpace.lean,Mathlib/Topology/MetricSpace/IsometricSMul.lean,Mathlib/Topology/Metrizable/CompletelyMetrizable.lean,Mathlib/Topology/Metrizable/Uniformity.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/LowerUpperTopology.lean,Mathlib/Topology/UniformSpace/UniformEmbedding.lean | 10 | 3 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 3 months ago | 380 days ago | 16 minutes |
| 36635 | Vierkantor | chore(*): turn comments before declarations into docstrings | This PR goes through the whole of Mathlib and replaces `/- comments -/` with `/-- docstrings -/` or `/-! module docs -/` whenever they appear before a declaration. A lot of these appear to be simple typos, where a docstring was actually intended. Where a comment was originally intended, I would argue it is still a good idea include the comments in the generated documentation, or at least it does not hurt anyone. These instances were found by a linter, in an upcoming PR: #36636. --- [](https://gitpod.io/from-referrer/) | tech debt merge-conflict | 253/260 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Abelian.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Subgroup/MulOppositeLemmas.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Basic.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Algebra/Order/Group/Unbundled/Basic.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Ring/Star.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Polynomial/CoeffList.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/Morphisms/WeaklyEtale.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Synonym.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Analysis/Fourier/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/InnerProductSpace/TensorProduct.lean,Mathlib/Analysis/LConvolution.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/Analysis/Meromorphic/Basic.lean,Mathlib/Analysis/Normed/Algebra/GelfandMazur.lean,Mathlib/Analysis/Normed/Algebra/Unitization.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/MStructure.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean,Mathlib/CategoryTheory/Action/Concrete.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/FintypeCat.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/Cones.lean,Mathlib/CategoryTheory/Limits/FintypeCat.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryBiproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean,Mathlib/CategoryTheory/Monoidal/Closed/Ideal.lean,Mathlib/CategoryTheory/Products/Basic.lean,Mathlib/Combinatorics/Hindman.lean,Mathlib/Combinatorics/SimpleGraph/Hall.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Counting.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/ENNReal/Holder.lean,Mathlib/Data/Finset/Sym.lean,Mathlib/Data/Fintype/Sets.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Set/Pointwise/Support.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign/Defs.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/FreeGroup/IsFreeGroup.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/MaximalSubgroups.lean,Mathlib/LinearAlgebra/CliffordAlgebra/SpinGroup.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/LinearAlgebra/DFinsupp.lean,Mathlib/LinearAlgebra/Isomorphisms.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/UnivLE.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalLExpectation.lean,Mathlib/MeasureTheory/Function/JacobianOneDim.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Group/Measure.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/MeasureTheory/Measure/Haar/NormedSpace.lean,Mathlib/MeasureTheory/Measure/Haar/OfBasis.lean,Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean,Mathlib/ModelTheory/Algebra/Field/CharP.lean,Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/BourbakiWitt.lean,Mathlib/Order/CompleteLattice/Basic.lean | 139 | 10 | ['JovanGerb', 'Vierkantor', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 38 days ago | 2 days |
| 36911 | jjdishere | fix(RingTheory/Valuation): change `ValueGroup` from taking HomClass to Hom | This PR refactors `MonoidWithZeroHom.valueMonoid`, `MonoidWithZeroHom.valueGroup`, `MonoidWithZeroHom.ValueGroup₀`, and `MonoidWithZeroHom.ValueGroup₀.embedding` to take a concrete `MonoidWithZeroHom` as input instead of a `MonoidWithZeroHomClass` instance, following rules described in [#mathlib4 > Mathlib's morphism hierarchy @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Mathlib.27s.20morphism.20hierarchy/near/554383157) As a result, we are able to remove several `erw` and many `set_option backward.isDefEq.respectTransparency false in`. The trade-off (foreseen by the same zulip thread) is that we now need to write an explicit coercion to `MonoidWithZeroHom` in `ValueGroup₀ (Valued.v (R := R) : R →*₀ Γ₀)`. Additionally, this PR fixes an instance on `NNReal`. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #36532 - [ ] depends on: #36777 | t-ring-theory tech debt blocked-by-other-PR merge-conflict | 559/483 | Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/Padics/Complex.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/WithVal.lean,Mathlib/NumberTheory/RatFunc/Ostrowski.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/RingTheory/Valuation/DiscreteValuativeRel.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Trivial.lean,Mathlib/Topology/Algebra/ValuativeRel/ValuativeTopology.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean | 24 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 42 days ago | 1 minute |
| 38604 | wwylele | chore(Algebra/Module): remove some `backward.privateInPublic` | --- [](https://gitpod.io/from-referrer/) | t-algebra tech debt | 14/30 | Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean | 2 | 1 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38564 | wwylele | chore(Algebra/Group): remove `backward.privateInPublic` | --- [](https://gitpod.io/from-referrer/) | t-algebra tech debt | 20/32 | Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Algebra/GroupWithZero/Basic.lean | 3 | 1 | ['github-actions'] | jcommelin | 1 day ago | 4 days ago | 4 days |
| 38774 | yuanyi-350 | chore(NumberTheory/Padics/Complex): remove an erw | - rewrites `norm_eq_norm'` to expand `Valuation.restrict_def`, `embedding_restrict₀`, and `PadicAlgCl.valuation_coe` inside `simp only` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-number-theory LLM-generated tech debt maintainer-merge | 2/3 | Mathlib/NumberTheory/Padics/Complex.lean | 1 | 4 | ['github-actions', 'loefflerd', 'riccardobrasca'] | MichaelStollBayreuth | 5 hours ago | 1 day ago | 1 day |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 17623 | astrainfinita | feat(Algebra/Order/GroupWithZero/Unbundled): add some lemmas | Some lemmas in `Algebra.Order.GroupWithZero.Unbundled` have incorrect or unsatisfactory names, or assumptions that can be omitted using `ZeroLEOneClass`. The lemmas added in this PR are versions of existing lemmas that use the correct or better name or `ZeroLEOneClass` to omit an assumption. The original lemmas will be deprecated in #17593. | New name | Old name | |-------------------------|-------------------------| | `mul_le_one_left₀` | `Left.mul_le_one_of_le_of_le` | | `mul_lt_one_of_le_of_lt_left₀` (`0 ≤ ·` version) / `mul_lt_one_of_le_of_lt_of_pos_left` | `Left.mul_lt_of_le_of_lt_one_of_pos` | | `mul_lt_one_of_lt_of_le_left₀` | `Left.mul_lt_of_lt_of_le_one_of_nonneg` | | `mul_le_one_right₀` | `Right.mul_le_one_of_le_of_le` | | `mul_lt_one_of_lt_of_le_right₀` (`0 ≤ ·` version) / `mul_lt_one_of_lt_of_le_of_pos_right` | `Right.mul_lt_one_of_lt_of_le_of_pos` | | `mul_lt_one_of_le_of_lt_right₀` | `Right.mul_lt_one_of_le_of_lt_of_nonneg` | The following lemmas use `ZeroLEOneClass`. | New name | Old name | |-------------------------|-------------------------| | `(Left.)one_le_mul₀` | `Left.one_le_mul_of_le_of_le` | | `Left.one_lt_mul_of_le_of_lt₀` | `Left.one_lt_mul_of_le_of_lt_of_pos` | | `Left.one_lt_mul_of_lt_of_le₀` | `Left.lt_mul_of_lt_of_one_le_of_nonneg` / `one_lt_mul_of_lt_of_le` (still there) | | `(Left.)one_lt_mul₀` | | | `Right.one_le_mul₀` | `Right.one_le_mul_of_le_of_le` | | `Right.one_lt_mul_of_lt_of_le₀` | `Right.one_lt_mul_of_lt_of_le_of_pos` | | `Right.one_lt_mul_of_le_of_lt₀` | `Right.one_lt_mul_of_le_of_lt_of_nonneg` / `one_lt_mul_of_le_of_lt` (still there) / `one_lt_mul` (still there) | | `Right.one_lt_mul₀` | `Right.one_lt_mul_of_lt_of_lt` | --- Split from #17593. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-zulip t-order | 146/44 | Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean | 2 | 11 | ['YaelDillies', 'astrainfinita', 'github-actions', 'j-loreaux'] | nobody | 1 year ago | 534 days ago | 33 days |
| 15654 | TpmKranz | feat(Computability): language-preserving maps between NFA and RE | Map REs to NFAs via Thompson's construction and NFAs to REs using GNFAs Last chunk of #12648 --- - [ ] depends on: #15651 - [ ] depends on: #15649 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-computability merge-conflict awaiting-zulip | 985/2 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Data/FinEnum/Option.lean,docs/references.bib | 7 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot', 'meithecatte'] | nobody | 11 months ago | 630 days ago | 2 minutes |
| 17458 | urkud | refactor(Algebra/Group): make `IsUnit` a typeclass | Also change some lemmas to assume `[IsUnit _]` instead of `[Invertible _]`. Motivated by potential non-defeq diamonds in #14986, see also [Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Invertible.20and.20data) I no longer plan to merge this PR, but I'm going to cherry-pick some changes to a new PR before closing this one. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-zulip | 82/72 | Mathlib/Algebra/CharP/Invertible.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Units.lean,Mathlib/Algebra/Polynomial/Splits.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/CategoryTheory/Linear/Basic.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Separable.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/GroupTheory/Submonoid/Inverses.lean,Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean,Mathlib/LinearAlgebra/AffineSpace/Combination.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Contraction.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Inversion.lean,Mathlib/LinearAlgebra/CliffordAlgebra/SpinGroup.lean,Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean,Mathlib/NumberTheory/MulChar/Basic.lean,Mathlib/RingTheory/Localization/NumDen.lean,Mathlib/RingTheory/Polynomial/Content.lean,Mathlib/RingTheory/Polynomial/GaussLemma.lean,Mathlib/RingTheory/Valuation/Basic.lean | 26 | 12 | ['MichaelStollBayreuth', 'acmepjz', 'eric-wieser', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 9 months ago | 572 days ago | 18 hours |
| 25218 | kckennylau | feat(AlgebraicGeometry): Tate normal form of elliptic curves | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry awaiting-zulip new-contributor | 291/26 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/IsomOfJ.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Modular/TateNormalForm.lean,Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 5 | 31 | ['MichaelStollBayreuth', 'Multramate', 'acmepjz', 'github-actions', 'grunweg', 'kckennylau', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 333 days ago | 6 days |
| 28803 | astrainfinita | refactor: unbundle algebra from `ENormed*` | Further speed up the search in the algebraic typeclass hierarchy by avoiding searching for `TopologicalSpace`. This PR continues the work from #23961. - Change `ESeminormed(Add)Monoid` and `ENormed(Add)Monoid` so they no longer carry algebraic data. - Deprecate `ESeminormed(Add)CommMonoid` and `ENormed(Add)CommMonoid` in favor of `ESeminormed(Add)Monoid` and `ENormed(Add)Monoid` with a commutative algebraic typeclass. |Old|New| |---|---| | `[ESeminormed(Add)(Comm)Monoid E]` | `[(Add)(Comm)Monoid E] [ESeminormed(Add)Monoid E]` | | `[ENormed(Add)(Comm)Monoid]` | `[(Add)(Comm)Monoid E] [ENormed(Add)Monoid]` | See [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2328803.20refactor.3A.20unbundle.20algebra.20from.20.60ENormed*.60/with/536024350) ------------ - [x] depends on: #28813 | t-algebra merge-conflict slow-typeclass-synthesis awaiting-zulip t-analysis | 80/63 | Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/NormedSpace/IndicatorFunction.lean,Mathlib/MeasureTheory/Function/L1Space/AEEqFun.lean,Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean | 14 | 28 | ['astrainfinita', 'bryangingechen', 'github-actions', 'grunweg', 'kbuzzard', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | grunweg | 7 months ago | 249 days ago | 5 hours |
| 28925 | grunweg | chore: remove `linear_combination'` tactic | When `linear_combination` was refactored in #15899, the old code was kept as the `linear_combination'` tactic, for easier migration. The consensus of the zulip discussion ([#mathlib4 > Narrowing the scope of `linear_combination` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Narrowing.20the.20scope.20of.20.60linear_combination.60/near/470237816)) was to wait, and "revisit this once people have experienced the various tactics in practice". One year later, the old tactic has almost no uses: it is unused in mathlib; [searching on github](https://github.com/search?q=linear_combination%27%20path%3A*.lean&type=code) yields 37 hits --- all of which are in various forks of mathlib. Thus, removing this tactic seems appropriate. --- Do not merge before the zulip discussion has concluded! [](https://gitpod.io/from-referrer/) | merge-conflict file-removed awaiting-zulip | 0/564 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/LinearCombination'.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,MathlibTest/linear_combination'.lean | 5 | 4 | ['euprunin', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 248 days ago | 1 second |
| 30150 | imbrem | feat(CategoryTheory/Monoidal): to_additive for MonoidalCategory | Add `AddMonoidalCategory`, the additive version of `MonoidalCategory`. To get this to work, I needed to _remove_ the `to_additive` attributes in `Discrete.lean`, since existing code relies on the `AddMonoid M → MonoidalCategory M` instance. For now, we simply implement the additive variants by hand instead. --- As discussed in #28718; I added an `AddMonoidalCategory` struct and tagged `MonoidalCategory` with `to_additive`, along with the lemmas in `Category.lean`. I think this is the right approach, since under this framework the "correct" additive version of `Discrete.lean` would be mapping an `AddMonoid` to an `AddMonoidalCategory`. Next steps would be to: - Make `monoidal_coherence` and `coherence` support `AddMonoidalCategory` - Add `CocartesianMonoidalCategory` extending `AddMonoidalCategory` [](https://gitpod.io/from-referrer/) | t-category-theory large-import new-contributor merge-conflict awaiting-zulip t-meta | 444/125 | Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 3 | 22 | ['JovanGerb', 'YaelDillies', 'github-actions', 'imbrem', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 209 days ago | 1 day |
| 15651 | TpmKranz | feat(Computability/NFA): operations for Thompson's construction | Lays the groundwork for a proof of equivalence of RE and NFA, w.r.t. described language. Actual connection to REs comes later, after the groundwork for the opposite direction has been laid. Third chunk of #12648 --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 307/5 | Mathlib/Computability/NFA.lean | 1 | 27 | ['TpmKranz', 'YaelDillies', 'dupuisf', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 5 months ago | 584 days ago | 45 days |
| 15649 | TpmKranz | feat(Computability): introduce Generalised NFA as bridge to Regular Expression | Lays the groundwork for a proof of equivalence of NFA and RE, w.r.t. described language. Actual connection to NFA comes later, after the groundwork for the opposite direction has been laid. Second chunk of #12648 --- - [x] depends on: #15647 [Data.FinEnum.Option unchanged since then] [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 298/0 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/RegularExpressions.lean,docs/references.bib | 5 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'trivial1711'] | nobody | 5 months ago | 509 days ago | 23 days |
| 20648 | anthonyde | feat: formalize regular expression -> εNFA | The file `Computability/RegularExpressionsToEpsilonNFA.lean` contains a formal definition of Thompson's method for constructing an `εNFA` from a `RegularExpression` and a proof of its correctness. --- - [x] depends on: #20644 - [x] depends on: #20645 [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-zulip new-contributor | 490/0 | Mathlib.lean,Mathlib/Computability/RegularExpressionsToEpsilonNFA.lean,docs/references.bib | 3 | 7 | ['anthonyde', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'qawbecrdtey'] | nobody | 5 months ago | 360 days ago | 75 days |
| 11800 | JADekker | feat: KappaLindelöf spaces | Define KappaLindelöf spaces by following the first one-third of the API for Lindelöf spaces. The remainder will be added in a future PR. --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-topology awaiting-zulip | 301/2 | Mathlib.lean,Mathlib/Topology/Compactness/KappaLindelof.lean,Mathlib/Topology/Compactness/Lindelof.lean | 3 | 38 | ['ADedecker', 'JADekker', 'PatrickMassot', 'StevenClontz', 'adomani', 'github-actions', 'grunweg', 'kim-em', 'urkud'] | nobody | 5 months ago | 638 days ago | 123 days |
| 30668 | astrainfinita | feat: `QuotType` | This typeclass is primarily for use by type synonyms of `Quot` and `Quotient`. Using `QuotType` API for type synonyms of `Quot` and `Quotient` will avoid defeq abuse caused by directly using `Quot` and `Quotient` APIs. This PR also adds some typeclasses to support different ways to find the quotient map that should be used. See the documentation comments of these typeclasses for examples of usage. --- It's not a typical design to use these auxiliary typeclasses and term elaborators, but I haven't found a better way to support these notations. Some of the naming may need to be discussed. For example: - `⟦·⟧` is currently called `mkQ` in names. This distinguishes it from other `.mk`s and makes it possible to write the quotient map as `mkQ` `mkQ'` ~~`mkQ_ h`~~. But this will also require changing the old lemma names. - It would be helpful if the names of new type classes explained their functionality better. [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/migrate.20to.20.60QuotLike.60.20API) This PR continues the work from #16421. Original PR: https://github.com/leanprover-community/mathlib4/pull/16421 | RFC t-data awaiting-zulip | 629/0 | Mathlib.lean,Mathlib/Data/QuotType.lean,MathlibTest/QuotType.lean | 3 | 20 | ['YaelDillies', 'astrainfinita', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | nobody | 4 months ago | 194 days ago | 1 minute |
| 33368 | urkud | feat: define `Complex.UnitDisc.shift` | Also review the existing API UPD: I'm going to define a `PSL(2, Real)` action instead. --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-zulip merge-conflict | 273/39 | Mathlib.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/Complex/UnitDisc/Shift.lean | 3 | 7 | ['github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'sgouezel', 'urkud'] | j-loreaux | 3 months ago | 115 days ago | 7 days |
| 32828 | Hagb | feat(Algebra/Order/Group/Defs): add `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid'` | It is similar to `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid`, while with different hypotheses. The conclusion `IsOrderedCancelMonoid α` on `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid` still holds when the hypothesis `CommGroup α` is weakened to `CancelCommMonoid α` while `PartialOrder α` is strengthened to `LinearOrder α`. --- [`IsOrderedAddMonoid.toIsOrderedCancelAddMonoid`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=IsOrderedAddMonoid.toIsOrderedCancelAddMonoid#doc) and `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid'`: https://github.com/leanprover-community/mathlib4/blob/97f78b1a4311fed1844b94f1c069219a48a098e1/Mathlib/Algebra/Order/Group/Defs.lean#L52-L62 [](https://gitpod.io/from-referrer/) | awaiting-zulip t-algebra | 4/0 | Mathlib/Algebra/Order/Group/Defs.lean | 1 | 8 | ['Garmelon', 'Vierkantor', 'artie2000', 'github-actions', 'leanprover-radar'] | eric-wieser | 3 months ago | 99 days ago | 40 days |
| 33031 | chiyunhsu | feat(Combinatorics/Enumerative/Partition): add combinatorial proof of Euler's partition theorem | The new file EulerComb.lean contains the combinatorial proof of Euler's partition theorem. The analytic proof of the theorem and its generalization of Glaisher's Theorem has already been formalized in [Glaisher.lean](https://github.com/leanprover-community/mathlib4/blob/master/Mathlib/Combinatorics/Enumerative/Partition/Glaisher.lean). The generalization of the combinatorial proof from this file to Glaisher's Theorem is within reach. --- Zulip discussion: [#mathlib4 > Glaisher’s Bijection on integer partitions](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Glaisher.E2.80.99s.20Bijection.20on.20integer.20partitions/with/570808111) [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-zulip | 531/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Partition/EulerComb.lean | 2 | 5 | ['chiyunhsu', 'github-actions', 'tb65536', 'vihdzp'] | b-mehta | 3 months ago | 92 days ago | 42 days |
| 32742 | LTolDe | feat(MeasureTheory/Constructions/Polish/Basic): add class SuslinSpace | add new class `SuslinSpace` for a topological space that is an analytic set in itself This will be useful to prove the **Effros Theorem**, see [zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/558712441). --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-zulip t-measure-probability | 4/0 | Mathlib/MeasureTheory/Constructions/Polish/Basic.lean | 1 | 9 | ['ADedecker', 'LTolDe', 'dupuisf', 'github-actions', 'jcommelin'] | PatrickMassot | 3 months ago | 115 days ago | 11 days |
| 34720 | Paul-Lez | feat(RingTheory/PowerSeries/Composition): define composition of power series | This PR defines the composition of two power series, and adds various pieces of API lemmas (this is mostly fixing up and upstreaming code from [this repo](https://github.com/rmhi/formal_deriv)).
This is the first of a series of PRs upstreaming work that was done at the CFT workshop in Oxford last summer, working towards proving some results about the `exp` and `log` power series (and their composition!), and constructing the isomorphism $(\mathfrak{m}_K ^ n, +) \cong (1 + \mathfrak{m}_K ^ n, \times)$ for sufficiently large $n$, where $K$ is a characteristic zero local field.
Co-authored-by: Richard Hill |
t-ring-theory awaiting-zulip | 844/0 | Mathlib.lean,Mathlib/RingTheory/PowerSeries/Composition.lean | 2 | 3 | ['Paul-Lez', 'github-actions', 'vihdzp'] | nobody | 2 months ago | 88 days ago | 10 seconds |
| 20238 | maemre | feat(Computability/DFA): Closure of regular languages under some set operations | This shows that regular languages are closed under complement and intersection by constructing DFAs for them. --- Closure under all other operations will be proved when someone adds the proof for DFA<->regular expression equivalence, so they are not part of this PR. [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 159/0 | Mathlib/Computability/DFA.lean,Mathlib/Computability/Language.lean | 2 | 60 | ['EtienneC30', 'YaelDillies', 'github-actions', 'maemre', 'mathlib4-merge-conflict-bot', 'meithecatte', 'urkud'] | nobody | 2 months ago | 410 days ago | 48 days |
| 22361 | rudynicolop | feat(Computability/NFA): nfa closure properties | Add the closure properties union, intersection and reversal for NFA. --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 218/2 | Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean | 2 | 91 | ['EtienneC30', 'b-mehta', 'ctchou', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 2 months ago | 361 days ago | 39 days |
| 23929 | meithecatte | feat(Computability/NFA): improve bound on pumping lemma | --- - [x] depends on: #25321 [](https://gitpod.io/from-referrer/) | t-computability awaiting-zulip new-contributor awaiting-author | 101/10 | Mathlib/Computability/EpsilonNFA.lean,Mathlib/Computability/NFA.lean | 2 | 42 | ['YaelDillies', 'dagurtomas', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'meithecatte'] | nobody | 2 months ago | 327 days ago | 34 days |
| 35524 | grunweg | feat: text-based linter against \t followed by tactic mode | Wait for the zulip discussion to converge. **If** there is consensus in favour of this change, summarise the motivation here. [zulip discuss](https://leanprover.zulipchat.com/#narrow/channel/345428-mathlib-reviewers/topic/proposal.3A.20no.20more.20use.20of.20.60.E2.96.B8.60.20in.20Mathlib.3F/with/574680826) --- There are currently 80 remaining exceptions in mathlib: ideally, these would get fixed before merging this. Works best when combined with #35523. [](https://gitpod.io/from-referrer/) | t-linter awaiting-zulip merge-conflict | 23/2 | Mathlib/Tactic/Linter/TextBased.lean | 1 | 5 | ['github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | 71 days ago | 3 minutes |
| 32608 | PrParadoxy | feat(LinearAlgebra/PiTensorProduct): API for PiTensorProducts indexed by sets | This PR addresses a TODO item in LinearAlgebra/PiTensorProduct.lean: * API for the various ways ι can be split into subsets; connect this with the binary tensor product -- specifically by describing tensors of type ⨂ (i : S), M i, for S : Set ι. Our primary motivation is to formalise the notion of "restricted tensor products". This will be the content of a follow-up PR. Beyond that, the Set API is natural in contexts where the index type has an independent interpretation. An example is quantum physics, where ι ranges over distinguishable degrees of freedom, and where its is common practice to annotate objects by the set of indices they are defined on. --- Stub file with preliminary definition of the restricted tensor product as a direct limit of tensors indexed by finite subsets of an index type: https://github.com/PrParadoxy/mathlib4/blob/restricted-stub/Mathlib/LinearAlgebra/PiTensorProduct/Restricted.lean --- - [x] depends on: #32598 [](https://gitpod.io/from-referrer/) | new-contributor awaiting-zulip t-algebra | 300/2 | Mathlib.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Set.lean | 3 | 28 | ['PrParadoxy', 'dagurtomas', 'eric-wieser', 'github-actions', 'goliath-klein', 'leanprover-radar', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 130 days ago | 10 days |
| 36890 | vihdzp | chore(SetTheory): `le_mul_left` → `le_mul_of_pos_left` | The new theorem names/statements match [`Nat.le_mul_of_pos_left`](https://leanprover-community.github.io/mathlib4_docs/Init/Data/Nat/Lemmas.html#Nat.le_mul_of_pos_left). The cardinal one has also been moved to an earlier file. --- [](https://gitpod.io/from-referrer/) | t-set-theory awaiting-zulip merge-conflict | 28/23 | Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Free.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Exponential.lean,Mathlib/SetTheory/Ordinal/Notation.lean | 6 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 42 days ago | 3 hours |
| 35578 | Shreyas4991 | fix: writer monad should use an additive logging type | The Writer monad's w type is supposed to be additive, not multiplicative. This is how it is conceptually used in Haskell (as a logging type). Haskell uses `Monoid` because it doesn't make a distinction between `AddMonoid` and `Monoid`. [#mathlib4 > Writer should use an additive monoid @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Writer.20should.20use.20an.20additive.20monoid/near/574990415) --- [](https://gitpod.io/from-referrer/) | t-data awaiting-zulip merge-conflict | 10/10 | Mathlib/Control/Monad/Cont.lean,Mathlib/Control/Monad/Writer.lean | 2 | 5 | ['Shreyas4991', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 69 days ago | 5 hours |
| 30750 | SnirBroshi | feat(Data/Quot): `toSet` and `equivClassOf` | Define `toSet` which gets the set corresponding to an element of a quotient, and `equivClassOf` which gets the equivalence class of an element under a quotient. --- I found these definitions helpful when working with quotients, specifically `ConnectedComponents` of a `TopologicalSpace`. [](https://gitpod.io/from-referrer/) | t-data awaiting-author awaiting-zulip | 162/0 | Mathlib/Data/Quot.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/Data/Setoid/Basic.lean | 4 | 8 | ['SnirBroshi', 'TwoFX', 'eric-wieser', 'github-actions', 'linesthatinterlace', 'mathlib-merge-conflicts'] | TwoFX | 17 days ago | 155 days ago | 35 days |
| 26299 | adomani | perf: the `whitespace` linter only acts on modified files | Introduces an `IO.Ref` to allow the `commandStart` linter to only run on files that git considers modified with respect to `master`. The linter is also active on files that have had some error, as these are likely being modified! The PR should also mitigate the speed-up that the linter introduced: [#mathlib4 > A whitespace linter @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/A.20whitespace.20linter/near/525091877) Assuming that this goes well, a similar mechanism could be applied to several linters that do not need to run on all code, just on the modified code. Implementation detail: the linter is currently either on or off in "whole" files. It may be also a future development to make this more granular and only run the linter on "modifed commands in modified files", but this is not currently the plan for this modification! --- [](https://gitpod.io/from-referrer/) | t-linter awaiting-zulip awaiting-author | 55/7 | Mathlib/Tactic/Linter/Whitespace.lean | 1 | 20 | ['adomani', 'eric-wieser', 'github-actions', 'grunweg', 'joneugster', 'kim-em', 'leanprover-bot', 'leanprover-radar', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | grunweg | 14 days ago | 245 days ago | 66 days |
| 34963 | Parcly-Taxel | feat(Archive): proof of the Robbins conjecture | Cf. [#mathlib4 > Alternative axiomatization of boolean algebras @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Alternative.20axiomatization.20of.20boolean.20algebras/near/558900960) and #31924. | t-algebra awaiting-zulip | 610/0 | Archive.lean,Archive/Robbins.lean | 2 | 2 | ['chrisflav', 'github-actions'] | chrisflav | 11 days ago | 11 days ago | 71 days |
| 38546 | yhx-12243 | fix: universe issue in injective module | Change the definition of ```lean class Module.Injective : Prop where out : ∀ ⦃X Y : Type v⦄ [AddCommGroup X] [AddCommGroup Y] [Module R X] [Module R Y] (f : X →ₗ[R] Y) (_ : Function.Injective f) (g : X →ₗ[R] Q), ∃ h : Y →ₗ[R] Q, ∀ x, h (f x) = g x ``` into ```lean class Module.Injective : Prop where out : ∀ ⦃X Y : Type u⦄ [AddCommGroup X] [AddCommGroup Y] [Module R X] [Module R Y] (f : X →ₗ[R] Y) (_ : Function.Injective f) (g : X →ₗ[R] Q), ∃ h : Y →ₗ[R] Q, ∀ x, h (f x) = g x ``` to make it agree with `Module.Baer` and real mathematical definition, **without universe issues**. Since the criterion `Module.Flat` also uses `Type u` on testing modules. See discussions in https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Universe.20issue.20about.20injective.20module . --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-zulip | 57/43 | Mathlib/Algebra/Category/ModuleCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Ulift.lean,Mathlib/Algebra/Module/Injective.lean,Mathlib/RepresentationTheory/FinGroupCharZero.lean,Mathlib/RingTheory/Flat/Tensor.lean,Mathlib/RingTheory/LocalProperties/Injective.lean | 6 | 5 | ['github-actions', 'grunweg', 'mathlib-bors', 'wwylele'] | nobody | 4 days ago | 4 days ago | 7 hours |
| 37934 | Thmoas-Guan | feat(FieldTheory): definition of transcendental separable field extension | In this PR, we introduce the concept of separably generated field extension and transcendental separable field extension. Further properties will be in #37838 --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-zulip | 69/0 | Mathlib.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean | 2 | 3 | ['Thmoas-Guan', 'github-actions', 'robin-carlier'] | robin-carlier | 4 days ago | 10 days ago | 8 days |
| 37346 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `✅️ SimpleGraph.Walk.IsPath.getVert_injOn`: unchanged 🎉 * `✅️ SimpleGraph.Walk.length_bypass_le`: unchanged 🎉 * `✅️ Rat.floor_intCast_div_natCast`: unchanged 🎉 * `✅️ InnerProductGeometry.norm_eq_of_angle_sub_eq_angle_sub_rev_of_angle_ne_pi`: unchanged 🎉 * `✅️ padicNorm.zero_of_padicNorm_eq_zero`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | maintainer-merge awaiting-zulip | 7/45 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Geometry/Euclidean/Triangle.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean | 4 | 22 | ['FernandoChu', 'bryangingechen', 'chenson2018', 'euprunin', 'faenuccio', 'github-actions', 'grunweg'] | nobody | 2 days ago | 2 days ago | 30 days |
| 37840 | tb65536 | chore(RingTheory/Localization/AtPrime/Basic): use `under` instead of `comap (algebraMap R S)` | This PR switches over from `comap (algebraMap R S)` to `under`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra awaiting-zulip | 161/144 | Mathlib/AlgebraicGeometry/Noetherian.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Frobenius.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/GoingUp.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/IntegralClosure/GoingDown.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/KrullDimension/Polynomial.lean,Mathlib/RingTheory/LocalProperties/Injective.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/AtPrime/Extension.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/Spectrum/Prime/Topology.lean | 19 | 9 | ['chrisflav', 'github-actions', 'robin-carlier', 'tb65536'] | chrisflav and erdOne | 1 day ago | 1 day ago | 20 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 10721 | urkud | feat(Order/FunLike): define `PointwiseLE` | - introduce a mixin class `DFunLike.PointwiseLE`, use it to define `DFunLike.instPartialOrder`; - add a generic `DFunLike.orderEmbeddingCoe` - add `DFunLike.PointwiseLE` instances here and there. With this refactor and #13022, I'm going to generalize lemmas like `MeasureTheory.ae_mono` to `OuterMeasureClass`. --- - [x] depends on: #12983 [](https://gitpod.io/from-referrer/) | merge-conflict t-order t-logic | 123/50 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Ring.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/GroupTheory/Congruence.lean,Mathlib/Order/FunLike.lean,Mathlib/Order/Heyting/Hom.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Hom/Bounded.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Topology/Order/Hom/Basic.lean | 13 | 48 | ['YaelDillies', 'dupuisf', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 689 days ago | 64 days |
| 8788 | FMLJohn | feat(Algebra/Module/GradeZeroModule): if `A` is a graded semiring and `M` is a graded `A`-module, then each grade of `M` is a module over the 0-th grade of `A`. | --- - [ ] depends on: #8187 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 237/4 | Mathlib.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean | 6 | 4 | ['FMLJohn', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 879 days ago | 1 day |
| 7875 | astrainfinita | chore: make `SMulCommClass A A B` and `SMulCommClass A B B` higher priority | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 54/48 | Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/Ring/CentroidHom.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/NormedSpace/lpSpace.lean,Mathlib/Data/Matrix/Basic.lean,Mathlib/GroupTheory/GroupAction/Prod.lean,Mathlib/GroupTheory/GroupAction/Ring.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/GroupTheory/Submonoid/Center.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/Topology/ContinuousFunction/ContinuousMapZero.lean,Mathlib/Topology/ContinuousFunction/StoneWeierstrass.lean,Mathlib/Topology/ContinuousFunction/ZeroAtInfty.lean | 27 | 15 | ['Parcly-Taxel', 'astrainfinita', 'jcommelin', 'leanprover-bot'] | nobody | 1 year ago | 693 days ago | 1 day |
| 6491 | eric-wieser | chore(Mathlib/Algebra/Hom/GroupAction): add `SMulHomClass.comp_smul` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 24/10 | Mathlib/Algebra/Hom/GroupAction.lean | 1 | 0 | [] | nobody | 1 year ago | 911 days ago | 83 days |
| 10629 | madvorak | feat: List.cons_sublist_append_iff_right | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 11/0 | Mathlib/Data/List/Basic.lean | 1 | 1 | ['eric-wieser'] | nobody | 1 year ago | 751 days ago | 53 days |
| 13791 | digama0 | refactor: Primrec and Partrec | General cleanup of the `Primrec` and `Partrec` files, to better adjust to lean 4 things. The main user-visible change is that `Primrec₂` is no longer a `def` but an `abbrev`, because it was causing inference issues in lean 4. I also removed all the nonterminal `simp`s in `PartrecCode.lean`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability tech debt | 585/778 | Mathlib/Computability/Ackermann.lean,Mathlib/Computability/Halting.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/Primrec.lean | 5 | 2 | ['github-actions', 'grunweg'] | nobody | 1 year ago | 684 days ago | 1 day |
| 12418 | rosborn | style: replace preimage_val with ↓∩ notation | --- This is a rough draft of what the new `↓∩` notation would look like within mathlib. I believe this is an improvement in clarity and would like to have `↓∩` as a standard notation (along with `''`, `⁻¹'`, `↑`, etc...). As `↓∩` is specialized for `Set`s, I have only changed `preimage_val` when the left-hand side of `↓∩` is a `Set`. The introduction of the `↓∩` notation to Data.Set.Image is temporary as it isn't possible to import Data.Set.Subset directly. If we want `↓∩` unscoped, where would be the best place to define it? An option is Data.Set.Defs, but the notation cannot be defined without additional imports as the file does not import `notation3`. [](https://gitpod.io/from-referrer/) | merge-conflict | 56/61 | Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Data/Set/Function.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Set/Subset.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Clopen.lean,Mathlib/Topology/Connected/Basic.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/LocalAtTarget.lean,Mathlib/Topology/LocallyConstant/Basic.lean,Mathlib/Topology/Separation.lean,Mathlib/Topology/Sober.lean | 18 | 3 | ['grunweg', 'rosborn'] | nobody | 1 year ago | 707 days ago | 29 days |
| 12751 | Command-Master | feat: add lemmas for Nat/Bits, Nat/Bitwise and Nat/Size | Remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 66/7 | Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Size.lean | 4 | 26 | ['Command-Master', 'Rida-Hamadani', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 655 days ago | 56 days |
| 10350 | Shamrock-Frost | feat(Data/Setoid): add the operations of taking the equivalence class of an element and of saturating a set wrt an equivalence relation | I'm open to suggestions about changing the name "saturate", someone on zulip rightly pointed out this is a very overloaded term in math. That said, I think it's unlikely to cause confusion and that there's only one reasonable interpretation in the context of setoids. --- - [x] depends on: #10347 - [x] depends on: #10348 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 169/3 | Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/Order/Closure.lean | 3 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 737 days ago | 19 days |
| 17127 | astrainfinita | chore: remove global `Quotient.mk` `⟦·⟧` notation | --- Merge this PR when we are ready to migrate to `QuotLike` API (#16421). [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 137/2 | Counterexamples/Pseudoelement.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Quandle.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Product.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnected.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/Limits/Shapes/SingleObj.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Skeletal.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Fintype/List.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean,Mathlib/Data/QPF/Univariate/Basic.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/Set/Finite.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/LinearAlgebra/Dual.lean,Mathlib/LinearAlgebra/Ray.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/Quotients.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/FundamentalCone.lean,Mathlib/NumberTheory/NumberField/Embeddings.lean,Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/RepresentationTheory/Action/Concrete.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Ordinal.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/Birthday.lean,Mathlib/SetTheory/Game/Impartial.lean,Mathlib/SetTheory/Game/Ordinal.lean,Mathlib/SetTheory/Game/State.lean,Mathlib/SetTheory/Lists.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Surreal/Basic.lean,Mathlib/SetTheory/Surreal/Dyadic.lean,Mathlib/SetTheory/Surreal/Multiplication.lean,Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Rank.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Homotopy/HomotopyGroup.lean,Mathlib/Topology/Homotopy/Path.lean,Mathlib/Topology/Homotopy/Product.lean,Mathlib/Topology/MetricSpace/GromovHausdorff.lean,Mathlib/Topology/UniformSpace/Separation.lean,test/interactiveUnfold.lean | 68 | 1 | ['github-actions'] | nobody | 1 year ago | 578 days ago | 4 days |
| 14598 | Command-Master | chore: add typeclasses to unify various `add_top`, `add_eq_top`, etc. | Add the four typeclasses `IsTopAbsorbing`, `IsBotAbsorbing`, `NoTopSum`, `NoBotSum`, as additive equivalents for `MulZeroClass` and `NoZeroDivisors`. Add instances of these for `ENNReal`, `WithTop α`, `WithBot α`, `PUnit`, `EReal`, `PartENat`, `Measure`, `Interval` and `Filter`. Also split `Algebra/Order/AddGroupWithTop` to `Algebra/Order/Group/WithTop` and `Algebra/Order/Monoid/WithTop` --- Previous usages of lemmas with quantified names like `WithTop.add_top` have to be changed to just `add_top`. `add_lt_top` is `@[simp]`, in accordance with `ENNReal.add_lt_top` being `@[simp]`. This affects `WithTop.add_lt_top` which previously hadn't been `@[simp]`. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-order new-contributor | 264/195 | Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib.lean,Mathlib/Algebra/Order/Group/WithTop.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/PUnitInstances/Order.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Analytic/Meromorphic.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/NormedSpace/ENorm.lean,Mathlib/Analysis/SpecialFunctions/JapaneseBracket.lean,Mathlib/Analysis/SpecialFunctions/Log/ENNRealLog.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Nat/WithBot.lean,Mathlib/Data/Real/EReal.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Decomposition/Lebesgue.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL1.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSpace.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/Bochner.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean,Mathlib/MeasureTheory/Integral/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Martingale/Convergence.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean,Mathlib/RingTheory/UniqueFactorizationDomain.lean,Mathlib/Topology/EMetricSpace/Defs.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,Mathlib/Topology/MetricSpace/Lipschitz.lean | 57 | 30 | ['Command-Master', 'YaelDillies', 'github-actions'] | nobody | 1 year ago | 541 days ago | 7 days |
| 19212 | Julian | feat(LinearAlgebra): add a variable_alias for VectorSpace | Taken directly from the variable_alias docs. Zulip: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/why.20.5Bvariable_alias.5D.20attribute.20is.20not.20used.20in.20Mathlib.3F --- This is the first actual variable alias added to mathlib. I haven't reviewed variable_alias fully, but it seems like there's at least 3 ways they could be distributed in Mathlib: * alongside whatever subfolder they "belong to" (which is what I've tentatively done here) * In a file called `Aliases` somewhere near the thing they alias (which seems less discoverable to me) * In a single file, a la `Mathlib.TrainingWheels` (with some less playful name) which is meant to define a bunch of more "friendly" aliases all in one place. I kind of like the idea of the third thing as a future module but perhaps it can be synthesized if/when there are more aliases? For now as I say I've done the first one, but please let me know if someone prefers something else. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 25/0 | Mathlib.lean,Mathlib/LinearAlgebra/VectorSpace.lean,scripts/noshake.json | 3 | 10 | ['Julian', 'PieterCuijpers', 'github-actions', 'urkud'] | nobody | 1 year ago | 521 days ago | 7 days |
| 19337 | zeramorphic | feat(Data/Finsupp): generalise `Finsupp` to any "zero" value | Remove the explicit dependence of `Finsupp` on `[Zero M]`, instead defining `Finsupp'` (better name pending) to be functions that are equal to a fixed value `z : M` cofinitely often. This PR is intended to do the initial work of replacing the definition of `Finsupp` with an instantiation of the more general definition, without adding any appropriate API. If accepted, the API development will follow in later PRs. Issues to consider: - Naming of `Finsupp'.` - Where should `Finsupp'` lemmas go? Do they need their own file/folder under `Data/`? Relevant Zulip threads: - https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Finsupp.20generalisations - https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Finsupp-like.20partial.20function Comments are welcome. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 203/83 | Archive/Wiedijk100Theorems/Partition.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Data/Finsupp/BigOperators.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/RingTheory/PowerBasis.lean,scripts/nolints_prime_decls.txt | 13 | 5 | ['github-actions', 'vihdzp', 'zeramorphic'] | nobody | 1 year ago | 519 days ago | 3 days |
| 18756 | astrainfinita | refactor: deprecate `DistribMulActionSemiHomClass` `MulSemiringActionSemiHomClass` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 50/28 | Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/GroupTheory/GroupAction/Hom.lean | 3 | 4 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 507 days ago | 31 days |
| 16120 | awainverse | feat(ModelTheory/Algebra/Ring/Basic): Ring homomorphisms are a `StrongHomClass` for the language of rings | Adds an `IsAlgebraic` instance to the language of rings Adds a `StrongHomClass` instance to the type of ring homomorphisms between rings with `CompatibleRing` structures --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra RFC t-logic | 34/13 | Mathlib/ModelTheory/Algebra/Ring/Basic.lean | 1 | 10 | ['ChrisHughes24', 'YaelDillies', 'awainverse', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 479 days ago | 135 days |
| 20527 | trivial1711 | refactor(Topology/UniformSpace/Completion): more descriptive names for `α → Completion α` | - We rename the various maps `α → Completion α` in order to make their names more consistent. - Let `α` be a uniform space. We rename the uniformly continuous function `α → Completion α` from `UniformSpace.Completion.coe'` to `UniformSpace.Completion.coe`. - Let `α` be a uniform additive group. We rename the additive group homomorphism `α →+ Completion α` from `UniformSpace.Completion.toCompl` to `UniformSpace.Completion.coeAddHom`. - Let `α` be a uniform ring. The ring homomorphism `α →+* Completion α` is called `UniformSpace.Completion.coeRingHom`; its name is unchanged. - Let `α` be a normed space over a field `𝕜`. We rename the linear isometry `α →ₗᵢ[𝕜] Completion α` from `UniformSpace.Completion.toComplₗᵢ` to `UniformSpace.Completion.coeₗᵢ`. - Let `α` be a normed space over a field `𝕜`. We rename the continuous linear map `α →L[𝕜] Completion α` from `UniformSpace.Completion.toComplL` to `UniformSpace.Completion.coeL`. - Let `α` be a normed additive group. We rename the norm preserving homomorphism `NormedAddGroupHom α (Completion α)` from `NormedAddCommGroup.toCompl` to `UniformSpace.Completion.coeNormedAddGroupHom`. - We analogously rename some other theorems. - We add some trivial theorems (all of which are proved by `rfl`) that state that the functions considered above are equal. We give all of them the `simp` and `norm_cast` attributes. - We add a new theorem `UniformSpace.Completion.coeAddHom_eq_coe` that states that `UniformSpace.Completion.coeAddHom` and `UniformSpace.Completion.coe` are equal as functions. - We similarly add a new theorem `UniformSpace.Completion.coeRingHom_eq_coe`. - We rename the theorem `UniformSpace.Completion.coe_toComplₗᵢ` to `UniformSpace.Completion.coeₗᵢ_eq_coe`. - We rename the theorem `UniformSpace.Completion.coe_toComplL` to `UniformSpace.Completion.coeL_eq_coe`. - We similarly add a new theorem `UniformSpace.Completion.coeNormedAddGroupHom_eq_coe`. - We change all occurrences of the string `((↑) : α → Completion α)` to `(coe : α → Completion α)` or just `coe`. - We put the statements of some theorems into simp normal form by using the plain function `coe` rather than the homomorphisms that carry more structure. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 130/92 | Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Complex/AbsMax.lean,Mathlib/Analysis/Complex/Liouville.lean,Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean,Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/Nonarchimedean.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformRing.lean,Mathlib/Topology/Category/UniformSpace.lean,Mathlib/Topology/MetricSpace/Completion.lean,Mathlib/Topology/UniformSpace/Completion.lean | 17 | 4 | ['eric-wieser', 'github-actions', 'trivial1711'] | nobody | 1 year ago | 473 days ago | 6 days |
| 18474 | astrainfinita | perf: lower the priority of `*WithOne.to*` instances | --- From #7873. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra t-data | 9/2 | Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/Data/Nat/Cast/Defs.lean | 3 | 7 | ['astrainfinita', 'eric-wieser', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 471 days ago | 76 days |
| 20372 | jvlmdr | feat(MeasureTheory/Function): Add ContinuousLinearMap.bilinearCompLp(L) | Introduce ContinuousLinearMap.bilinearCompLp and bilinearCompLpL. Generalize eLpNorm_le_eLpNorm_mul_eLpNorm theorems to include constant C in bound condition. --- Expect this may be useful for defining tempered distributions from functions in `L^p`. The definitions more or less follow `ContinuousLinearMap.compLp...`. Names are loosely analogous to `ContinuousLinearMap.bilinearComp` and `SchwartzMap.bilinLeftCLM`. Note: I preferred the spelling `hpqr : p⁻¹ + q⁻¹ = r⁻¹` with `f` in `L^p` and `g` in `L^q` to `hpqr : 1 / p = 1 / q + 1 / r`. It's easier to obtain from `ENNReal.IsConjExponent` too. A few questions: - [ ] I defined `bilinear{Left,Right}LpL` in addition to `bilinearCompLpL` because `LinearMap.mkContinuous₂` is marked as `noncomputable` and `LinearMap.mkContinuous` is not. Is this worth the extra definitions? (Note: This is not visible in the source due to `noncomputable section`.) - [ ] Should I use `C : ℝ` instead of `C : NNReal` for `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'`? - [ ] Is it going to be painful to have `[Fact (1 ≤ p)] [Fact (1 ≤ q)] [Fact (1 ≤ r)]`? I don't think there's a way to avoid it though. Maybe providing specialized versions for `p.IsConjExponent q` with `L^1`? Naming: - [ ] Is it satisfactory to add a `'` to the `eLpNorm_le_eLpNorm_mul_eLpNorm ` definitions in `CompareExp.lean` where `≤ ‖f x‖ * ‖g x‖` has been replaced with `≤ C * ‖f x‖ * ‖g x‖`? These could replace the existing theorems, although I don't want to break backwards compatibility. There are 5 instances: `eLpNorm_le_eLpNorm_top_mul_eLpNorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm_top'`, `eLpNorm'_le_eLpNorm'_mul_eLpNorm''`, `eLpNorm_le_eLpNorm_mul_eLpNorm_of_nnnorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'` (I'm not sure why the existing theorem `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm` has an internal `'`) - [ ] Is `bilinearLeftLpL` a suitable name? Other options: `bilinearCompLpLeftL`, `bilinearCompLeftLpL`, `bilinLeftLpL` (analogous to `SchwartzMap.bilinLeftCLM`) [](https://gitpod.io/from-referrer/) | merge-conflict t-measure-probability new-contributor | 203/40 | Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSpace.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 458 days ago | 27 days |
| 21959 | BGuillemet | feat(Topology/ContinuousMap): Stone-Weierstrass theorem for MvPolynomial | Add the subalgebra of multivariate polynomials and prove it separates points, on the same model as `ContinuousMap/Polynomial.lean`. Prove the Stone-Weierstrass theorem and some variations for multivariate polynomials. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology new-contributor | 285/1 | Mathlib.lean,Mathlib/Topology/ContinuousMap/MvPolynomial.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 422 days ago | 16 days |
| 18470 | astrainfinita | perf: lower the priority of `Normed*.to*` instances | --- From #7873. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra t-analysis | 28/0 | Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean | 2 | 9 | ['astrainfinita', 'github-actions', 'jcommelin', 'leanprover-bot'] | nobody | 1 year ago | 417 days ago | 129 days |
| 8767 | eric-wieser | refactor(Cache): tidy lake-manifest parsing in Cache | This now respects local copies of Mathlib dependencies (though in practice these invalidate the *online* cache because to point to local copies of Mathlib, the hash for `lakefile.lean` and `lake-manifest.json` is first invalidated). --- - [x] depends on: #11492 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 49/49 | Cache/Hashing.lean,Cache/IO.lean,lake-manifest.json | 3 | 8 | ['digama0', 'eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 596 days ago | 119 days |
| 22660 | Ruben-VandeVelde | chore: follow naming convention around Group.IsNilpotent | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 133/67 | Mathlib/GroupTheory/Frattini.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/SpecificGroups/ZGroup.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 410 days ago | 10 days |
| 21488 | imbrem | feat(CategoryTheory/Monoidal): premonoidal categories | Add support for premonoidal categories --- Still want to add support for: - Premonoidal braided/symmetric categories - The monoidal coherence theorem, which I've already ported in my `discretion` library - The `coherence` tactic, which should work fine for premonoidal categories too but wanted to get this in front of reviewers ASAP to make sure my general approach was alright [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory new-contributor | 900/361 | Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/End.lean,Mathlib/CategoryTheory/GradedObject/Monoidal.lean,Mathlib/CategoryTheory/Localization/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/CoherenceLemmas.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/CategoryTheory/Monoidal/End.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/FunctorCategory.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,MathlibTest/StringDiagram.lean | 21 | 9 | ['YaelDillies', 'github-actions', 'grunweg', 'imbrem', 'kim-em', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 387 days ago | 57 days |
| 21525 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Prelim) | This PR defines the basic preliminaries for defining locally cartesian closed categories (LCCCs). In particular, using the calculus of mates we define certain natural isomorphisms involving `Over.star` and `Over.pullback` which will be crucial in defining the right adjoint to the pullback functor in the development of LCCCs. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory large-import | 338/24 | Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Galois/Examples.lean | 3 | 13 | ['b-mehta', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'sinhp'] | nobody | 1 year ago | 387 days ago | 36 days |
| 16314 | astrainfinita | chore(Data/Quot): deprecate `ind*'` APIs | --- - [x] depends on: #16264 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 247/287 | Counterexamples/CliffordAlgebraNotInjective.lean,Mathlib/Algebra/Colimit/Module.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Subobject/FactorThru.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Computability/Reduce.lean,Mathlib/Computability/Tape.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/GroupTheory/Complement.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Hom.lean,Mathlib/GroupTheory/Coset/Basic.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean,Mathlib/GroupTheory/PresentedGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SchurZassenhaus.lean,Mathlib/GroupTheory/Sylow.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/LinearAlgebra/Projectivization/Basic.lean,Mathlib/LinearAlgebra/Quotient/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/RepresentationTheory/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Congruence/Basic.lean,Mathlib/RingTheory/Flat/FaithfullyFlat/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Valuation/Quotient.lean,Mathlib/Topology/Algebra/Group/TopologicalAbelianization.lean,Mathlib/Topology/Algebra/InfiniteSum/Module.lean,Mathlib/Topology/Separation/Basic.lean | 65 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 381 days ago | 55 days |
| 15483 | astrainfinita | chore(GroupTheory/Coset): reduce defeq abuse | --- - [x] depends on: #15482 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 114/60 | Mathlib/GroupTheory/Commensurable.lean,Mathlib/GroupTheory/Coset.lean,Mathlib/GroupTheory/QuotientGroup.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/MeasureTheory/Measure/Haar/Quotient.lean,Mathlib/Topology/Algebra/Group/Compact.lean | 6 | 14 | ['astrainfinita', 'eric-wieser', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball', 'mergify', 'urkud'] | nobody | 1 year ago | 629 days ago | 4 days |
| 16594 | astrainfinita | perf: reorder `extends` and remove some instances in algebra hierarchy | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 240/92 | Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Prod.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/Rat.lean,Mathlib/Algebra/Ring/SumsOfSquares.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/FieldTheory/SplittingField/Construction.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/Order/Interval/Finset/Box.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/Util/NoInstances.lean,scripts/noshake.json | 50 | 8 | ['astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | 585 days ago | 14 days |
| 23859 | urkud | feat(Topology/../Order/Field): generalize to `Semifield` | .. from a linear ordered field to a linear ordered semifield--- - [ ] depends on: #23857 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 245/219 | Mathlib/Algebra/Order/Group/Pointwise/Interval.lean,Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean,Mathlib/Topology/Algebra/Order/Field.lean,Mathlib/Topology/Order/Basic.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 387 days ago | 4 minutes |
| 23810 | b-reinke | chore(Order/Interval): generalize succ/pred lemmas to partial orders | Many lemmas in `Mathlib/Order/Interval/Set/SuccPred.lean`and `Mathlib/Order/Interval/Finset/SuccPred.lean` also work for partial orders. They are generalized in this PR by introducing different sections for `PartialOrder` and `LinearOrder` assumptions in the respective files. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order | 231/89 | Mathlib/Order/Interval/Finset/SuccPred.lean,Mathlib/Order/Interval/Set/SuccPred.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 372 days ago | 16 days |
| 24285 | madvorak | chore(Algebra/*-{Category,Homology}): remove unnecessary universe variables | Discussions: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Call.20for.20help.3A.20technical.2F.20organisational.20debt/with/513620128 https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Algebra.20and.20.60Type*.60/with/513558902 https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Task.2026.3A.20Replace.20Type.20u.20by.20Type*.20wherever.20possible/with/513592993 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 542/916 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Field.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Central/Basic.lean,Mathlib/Algebra/Central/Defs.lean,Mathlib/Algebra/Central/TensorProduct.lean,Mathlib/Algebra/CharP/Pi.lean,Mathlib/Algebra/CharP/Quotient.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Finsupp.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/Field/IsField.lean,Mathlib/Algebra/Field/MinimalAxioms.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Field/Subfield/Defs.lean,Mathlib/Algebra/FreeNonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Equiv/Finite.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Hom/End.lean,Mathlib/Algebra/Group/Hom/Instances.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Invertible/Defs.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/TypeTags/Finite.lean,Mathlib/Algebra/Group/TypeTags/Hom.lean,Mathlib/Algebra/Group/Units/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/Algebra/Group/WithOne/Basic.lean,Mathlib/Algebra/Group/WithOne/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Pi.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/NeZero.lean,Mathlib/Algebra/Lie/Abelian.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Lie/CartanMatrix.lean,Mathlib/Algebra/Lie/CartanSubalgebra.lean,Mathlib/Algebra/Lie/Character.lean,Mathlib/Algebra/Lie/Classical.lean,Mathlib/Algebra/Lie/DirectSum.lean,Mathlib/Algebra/Lie/Free.lean,Mathlib/Algebra/Lie/Ideal.lean,Mathlib/Algebra/Lie/IdealOperations.lean,Mathlib/Algebra/Lie/Matrix.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Lie/OfAssociative.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Lie/SkewAdjoint.lean,Mathlib/Algebra/Lie/Solvable.lean,Mathlib/Algebra/Lie/Subalgebra.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/Algebra/Lie/TensorProduct.lean,Mathlib/Algebra/Lie/UniversalEnveloping.lean,Mathlib/Algebra/Module/Basic.lean,Mathlib/Algebra/Module/CharacterModule.lean,Mathlib/Algebra/Module/DedekindDomain.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/Equiv/Opposite.lean,Mathlib/Algebra/Module/Lattice.lean,Mathlib/Algebra/Module/LinearMap/Basic.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/MinimalAxioms.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/Module/Opposite.lean,Mathlib/Algebra/Module/Pi.lean,Mathlib/Algebra/Module/Presentation/Differentials.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Algebra/Module/Rat.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Support.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean | 182 | 22 | ['erdOne', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'madvorak', 'mattrobball'] | nobody | 1 year ago | 371 days ago | 2 days |
| 23349 | BGuillemet | feat: add LocallyLipschitzOn.lipschitzOnWith_of_isCompact and two small lemmas about Lipschitz functions | Main feat (in Mathlib/Topology/EMetricSpace/Basic.lean): if a function `f` from an extended pseudometric space to a pseudometric space is locally Lipschitz on a compact subset `s`, then `f` is Lipschitz on `s`. The theorem is true only when the codomain of `f` is a pseudometric space, so it needs imports from Mathlib/Topology/MetricSpace. Other small feat (in Mathlib/Analysis/Calculus/ContDiff/RCLike.lean): a function that is continuously differentiable on an open subset is locally Lipschitz on this subset. --- - [ ] depends on: #22890 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology large-import new-contributor | 59/4 | Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean | 2 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | PatrickMassot | 11 months ago | 339 days ago | 35 days |
| 25340 | dupuisf | chore(Analysis/Convex): move files pertaining to convex/concave functions to their own folder | This PR creates a new folder under `Analysis/Convex` called `Analysis/Convex/Function`, which includes files that are mostly or entirely about convex/concave functions (as opposed to convex sets). --- [](https://gitpod.io/from-referrer/) | merge-conflict t-convex-geometry | 4264/4155 | Mathlib.lean,Mathlib/Analysis/Convex/Continuous.lean,Mathlib/Analysis/Convex/Deriv.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Convex/Extrema.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Convex/Function/Basic.lean,Mathlib/Analysis/Convex/Function/Continuous.lean,Mathlib/Analysis/Convex/Function/Deriv.lean,Mathlib/Analysis/Convex/Function/Extrema.lean,Mathlib/Analysis/Convex/Function/Integral.lean,Mathlib/Analysis/Convex/Function/Jensen.lean,Mathlib/Analysis/Convex/Function/Mul.lean,Mathlib/Analysis/Convex/Function/Piecewise.lean,Mathlib/Analysis/Convex/Function/Quasiconvex.lean,Mathlib/Analysis/Convex/Function/Slope.lean,Mathlib/Analysis/Convex/Function/Strong.lean,Mathlib/Analysis/Convex/Integral.lean,Mathlib/Analysis/Convex/Jensen.lean,Mathlib/Analysis/Convex/Mul.lean,Mathlib/Analysis/Convex/Piecewise.lean,Mathlib/Analysis/Convex/Quasiconvex.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convex/Strong.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/MeanInequalitiesPow.lean,Mathlib/Analysis/Normed/Module/Convex.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Analysis/SpecialFunctions/Log/NegMulLog.lean,Mathlib/Analysis/SpecialFunctions/Pochhammer.lean,Mathlib/MeasureTheory/Measure/Decomposition/IntegralRNDeriv.lean,Mathlib/NumberTheory/Harmonic/GammaDeriv.lean | 34 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 328 days ago | 6 days |
| 18441 | ADedecker | refactor(AdicTopology): use new API for algebraic filter bases, and factor some code | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 847/159 | Mathlib.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 3 | ['ADedecker', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 11 minutes |
| 18439 | ADedecker | refactor: use new algebraic filter bases API in `FiniteAdeleRing` | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 699/21 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 10 minutes |
| 18438 | ADedecker | refactor: adapt `KrullTopology` to the new algebraic filter bases API | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 771/168 | Mathlib.lean,Mathlib/FieldTheory/KrullTopology.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 5 | ['ADedecker', 'AntoineChambert-Loir', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 10 minutes |
| 13964 | pechersky | feat(Data/DigitExpansion): begin defining variant of reals without rationals | Based on a de Bruijn 1976 paper. This file is just the basic definition of a digit expansion. Will be followed up with further constructions. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 518/0 | Mathlib.lean,Mathlib/Data/DigitExpansion/Defs.lean,docs/references.bib | 3 | 11 | ['eric-wieser', 'github-actions', 'kim-em', 'pechersky'] | dupuisf | 10 months ago | 551 days ago | 129 days |
| 24823 | eric-wieser | refactor: add `hom` lemmas for the `MonoidalCategory` structure on `ModuleCat` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 148/164 | Mathlib/Algebra/Category/FGModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Free.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Generator.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Internal/Module.lean,Mathlib/RepresentationTheory/Coinvariants.lean,Mathlib/RepresentationTheory/Rep.lean | 11 | 21 | ['101damnations', 'YaelDillies', 'eric-wieser', 'github-actions', 'joelriou', 'kbuzzard', 'leanprover-community-bot-assistant'] | 101damnations | 9 months ago | 300 days ago | 40 days |
| 25071 | erdOne | feat(EllipticCurve): basic API for singular cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry | 320/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 3 | 35 | ['Multramate', 'acmepjz', 'erdOne', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 300 days ago | 45 days |
| 25988 | Multramate | refactor(AlgebraicGeometry/EllipticCurve/*): replace Fin 3 with products | This PR continues the work from #24593. Original PR: https://github.com/leanprover-community/mathlib4/pull/24593 | merge-conflict t-algebraic-geometry | 1000/1022 | Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean | 6 | 3 | ['Multramate', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 300 days ago | 18 days |
| 26067 | mapehe | feat(Topology/StoneCech): exists_continuous_surjection_from_StoneCech_to_dense_range | This lemma formalises the following version of the maximality property of the Stone–Čech compactification: If `f : α → β` is a continuous map from a topological space `α` to a Hausdorff space `β` with dense range, then there exists a continuous surjection from `StoneCech α` to `β` extending `f`. In particular, `StoneCech α` is the “largest” compact Hausdorff space into which `α` densely embeds, in the sense that any other such space is a continuous image of it. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 18/0 | Mathlib/Topology/StoneCech.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 297 days ago | 20 days |
| 25238 | Hagb | feat(Tactic/ComputeDegree): add support for scalar multiplication with different types | It would be able to deal with `a • (X : R[X])` where `a : S` is in a different type `S` with `[SMulZeroClass S R]`. --- - [x] depends on: #25237 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta new-contributor | 17/5 | Mathlib/Tactic/ComputeDegree.lean,MathlibTest/ComputeDegree.lean | 2 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 300 days ago | 38 days |
| 26200 | adomani | fix: add label when landrun fails | Adds the `permission-denied` label on PRs that get blocked by landrun. --- [](https://gitpod.io/from-referrer/) | merge-conflict CI | 68/8 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 268 days ago | 46 days |
| 27451 | kckennylau | feat(RingTheory/Valuation): define ball, closed ball, and sphere | *From the 2025 Local Class Field Theory Workshop.* --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 27/0 | Mathlib/RingTheory/Valuation/Basic.lean | 1 | 13 | ['JovanGerb', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'pechersky', 'wwylele'] | nobody | 8 months ago | 263 days ago | 17 days |
| 27987 | kckennylau | feat(RingTheory/Valuation): define ball, closed ball, and sphere | --- The pullback PR of #26827 and #27451. [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory large-import | 73/0 | Mathlib/RingTheory/Valuation/Basic.lean | 1 | 4 | ['JovanGerb', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 263 days ago | 6 days |
| 27003 | eric-wieser | chore: use `Simp.ResultQ` more often | Also uses `~q` in place of manual `isDefEq` matching. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 18/22 | Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/NormNum/Result.lean,Mathlib/Tactic/ReduceModChar.lean | 3 | 7 | ['JovanGerb', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | JovanGerb | 8 months ago | 261 days ago | 32 days |
| 25401 | digama0 | feat(Util): SuppressSorry option | See also leanprover/lean4#8611 and [#lean4 > Silent sorry @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/Silent.20sorry/near/503537964). This is a stop-gap solution while leanprover/lean4#8611 is underway, but it works about as well as any other built in option. Hooking declaration elaborators turns out to be a very powerful technique. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 342/0 | Mathlib.lean,Mathlib/Util/CommandElabHook.lean,Mathlib/Util/SuppressSorry.lean,MathlibTest/suppressSorry.lean | 4 | 15 | ['digama0', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | alexjbest | 8 months ago | 260 days ago | 71 days |
| 28622 | alreadydone | chore(Mathlib): replace `=>` by `↦` | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 51792/51792 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Bilinear.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Hom/Rat.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Opposite.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/Algebra/Rat.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Spectrum/Pi.lean,Mathlib/Algebra/Algebra/Spectrum/Quasispectrum.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Algebra/Subalgebra/IsSimpleOrder.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Algebra/Subalgebra/Matrix.lean,Mathlib/Algebra/Algebra/Subalgebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Subalgebra/Prod.lean,Mathlib/Algebra/Algebra/Subalgebra/Unitization.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/Algebra/ZMod.lean,Mathlib/Algebra/AlgebraicCard.lean,Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/BigOperators/Finsupp/Fin.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean,Mathlib/Algebra/BigOperators/Group/Finset/Sigma.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean,Mathlib/Algebra/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/BigOperators/Ring/Multiset.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/AlgCat/Limits.lean,Mathlib/Algebra/Category/AlgCat/Monoidal.lean,Mathlib/Algebra/Category/BialgCat/Basic.lean,Mathlib/Algebra/Category/BoolRing.lean,Mathlib/Algebra/Category/CoalgCat/Basic.lean,Mathlib/Algebra/Category/CoalgCat/ComonEquivalence.lean,Mathlib/Algebra/Category/FGModuleCat/Limits.lean,Mathlib/Algebra/Category/Grp/AB.lean,Mathlib/Algebra/Category/Grp/Adjunctions.lean,Mathlib/Algebra/Category/Grp/Basic.lean,Mathlib/Algebra/Category/Grp/Biproducts.lean,Mathlib/Algebra/Category/Grp/CartesianMonoidal.lean,Mathlib/Algebra/Category/Grp/Colimits.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/Grp/FilteredColimits.lean,Mathlib/Algebra/Category/Grp/Images.lean,Mathlib/Algebra/Category/Grp/Kernels.lean,Mathlib/Algebra/Category/Grp/LargeColimits.lean,Mathlib/Algebra/Category/Grp/LeftExactFunctor.lean,Mathlib/Algebra/Category/Grp/Limits.lean,Mathlib/Algebra/Category/Grp/Preadditive.lean,Mathlib/Algebra/Category/Grp/ZModuleEquivalence.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/GrpWithZero.lean,Mathlib/Algebra/Category/HopfAlgCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Biproducts.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Colimits.lean,Mathlib/Algebra/Category/ModuleCat/EpiMono.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Category/ModuleCat/Images.lean,Mathlib/Algebra/Category/ModuleCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Kernels.lean,Mathlib/Algebra/Category/ModuleCat/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Abelian.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Colimits.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Pushforward.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Sheafify.lean,Mathlib/Algebra/Category/ModuleCat/Products.lean | 3838 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 254 days ago | 18 hours |
| 28626 | alreadydone | chore(Archive, Counterexamples): replace => by ↦ | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 288/288 | Archive/Arithcc.lean,Archive/Examples/IfNormalization/Result.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Archive/Examples/PropEncodable.lean,Archive/Imo/Imo1959Q1.lean,Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q4.lean,Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo1977Q6.lean,Archive/Imo/Imo1981Q3.lean,Archive/Imo/Imo1987Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2006Q5.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q3.lean,Archive/Imo/Imo2013Q1.lean,Archive/Imo/Imo2019Q1.lean,Archive/Imo/Imo2024Q5.lean,Archive/MiuLanguage/Basic.lean,Archive/MiuLanguage/DecisionSuf.lean,Archive/OxfordInvariants/Summer2021/Week3P1.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/AscendingDescendingSequences.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/Konigsberg.lean,Archive/Wiedijk100Theorems/Partition.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Archive/ZagierTwoSquares.lean,Counterexamples/AharoniKorman.lean,Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean,Counterexamples/CharPZeroNeCharZero.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/DirectSumIsInternal.lean,Counterexamples/GameMultiplication.lean,Counterexamples/Girard.lean,Counterexamples/HomogeneousPrimeNotPrime.lean,Counterexamples/MapFloor.lean,Counterexamples/MonicNonRegular.lean,Counterexamples/Phillips.lean,Counterexamples/Pseudoelement.lean,Counterexamples/QuadraticForm.lean,Counterexamples/SorgenfreyLine.lean,Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean | 54 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 253 days ago | 2 days |
| 27403 | MoritzBeroRoos | fix: replace probably erroneous usage of ⬝ (with old \cdot) by · (with \centerdot) | Discussion at [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.5Ccdot.20!.3D.20.5Ccenterdot). Currently the abbreviations \cdot and \centerdot resolve to different, with the naked eye nearly undistinguishable symbols (despite the c in cdot surely standing for center..). This pr replaces instances of ⬝ where · was probably meant. All of the replacement is in comments, except for the file bench_summary.lean which is used for priting the github benchmark results. Since this file is about scientific notation of numbers, sure · was meant to be used, not a rectangle. [Related](https://github.com/leanprover-community/mathlib4/pull/27399) --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor | 195/195 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/DirectSum/Idempotents.lean,Mathlib/Algebra/Lie/Derivation/Basic.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/Basic.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/Normed/Unbundled/InvariantExtension.lean,Mathlib/Analysis/SpecialFunctions/Complex/CircleAddChar.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Matrix/Block.lean,Mathlib/Data/Matrix/ConjTranspose.lean,Mathlib/Data/Matrix/Hadamard.lean,Mathlib/Data/Matrix/Mul.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/Data/Matrix/RowCol.lean,Mathlib/Data/Matrix/Vec.lean,Mathlib/FieldTheory/PurelyInseparable/PerfectClosure.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/LinearAlgebra/CrossProduct.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/DotProduct.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/Orthogonal.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/PerfectPairing/Matrix.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/NumberTheory/NumberField/ProductFormula.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean,Mathlib/SetTheory/Ordinal/Veblen.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Homeomorph/Lemmas.lean,Mathlib/Topology/Instances/Matrix.lean,scripts/bench_summary.lean | 49 | 5 | ['eric-wieser', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 274 days ago | 7 days |
| 28042 | kckennylau | feat(Topology/ValuativeRel): a topological basis indexed by pairs of elements | --- The pullback PR of #27314 and #27163. [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 140/23 | Mathlib/RingTheory/Valuation/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 2 | 3 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 261 days ago | 7 days |
| 27399 | MoritzBeroRoos | chore: replace every usage of ⬝ᵥ (with old \cdot) by ·ᵥ (with \centerdot) | Discussion at [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.5Ccdot.20!.3D.20.5Ccenterdot). Currently the abbreviations `\cdot` and `\centerdot` resolve to different, with the naked eye nearly undistinguishable symbols (despite the c in cdot surely standing for `center`..): - `\cdot` gives ⬝ [U+2B1D](https://www.compart.com/en/unicode/U+2B1D) "Black Very Small Square" - `\centerdot` gives · [U+00B7](https://www.compart.com/en/unicode/U+00B7) "Middle Dot" Mathlib mostly uses the `\centerdot` variant, except for the dotProduct notation and some probably unsuspecting people wanting \centerdot but getting \cdot in their comments and 6 uses of a notation using the raw `\cdot` without any subscript at `Mathlib\Topology\Homotopy\Product.lean`. This PR replaces the dot product `⬝ᵥ` with its `\centerdot` counterpart `·ᵥ`. The related PR [here](https://github.com/leanprover/vscode-lean4/pull/639) can then overwrite the `\cdot` abbreviation, to produce the same symbol as the `centerdot` abbreviation does. --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor | 133/133 | Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Matrix/Block.lean,Mathlib/Data/Matrix/ConjTranspose.lean,Mathlib/Data/Matrix/Hadamard.lean,Mathlib/Data/Matrix/Mul.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/Data/Matrix/RowCol.lean,Mathlib/Data/Matrix/Vec.lean,Mathlib/LinearAlgebra/CrossProduct.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/DotProduct.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/Orthogonal.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/PerfectPairing/Matrix.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/Topology/Instances/Matrix.lean | 25 | 6 | ['MoritzBeroRoos', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 274 days ago | 7 days |
| 28148 | kckennylau | feat(Matrix): Simproc and Rw-proc for Matrix Transpose | Co-authored by Aaron Liu. ```lean example : !![1, 2, 3; 4, 5, 6]ᵀ = !![1, 4; 2, 5; 3, 6] := by rw [transpose_of% 2 3] example : !![1, 2, 3; 4, 5, 6]ᵀ = !![1, 4; 2, 5; 3, 6] := by rw [transpose_of] example : !![1, 2, 3; 4, 5, 6]ᵀ = !![1, 4; 2, 5; 3, 6] := by simp only [matrix_transpose] ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 267/8 | Mathlib.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/LinearAlgebra/UnitaryGroup.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/Matrix.lean,MathlibTest/Simproc/Matrix.lean,MathlibTest/matrix.lean,scripts/noshake.json | 8 | 32 | ['eric-wieser', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'plp127'] | eric-wieser | 8 months ago | 246 days ago | 13 days |
| 26908 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): alternative ext principle for unitors | Currently, our infrastructure for left/right unitors for Day convolution of functors `C ⥤ V` do not have satisfactory extensionality principle: the current way to characterize morphisms out of `U ⊛ F` is the default extensionality principle for Day convolution, which characterizes first such functors via functors out of `U ⊠ F`. Left unitors are then obtained using the fact `U ⊠ F` is a left Kan extension of a functor from `PUnit × C` (which is equivalent to `C`) but we did not record on its own this principle. Using the transitivity of left Kan extensions proved in #26899, we directly exhibit `U ⊛ F` as a left Kan extension of `F ⋙ tensorLeft (𝟙_ V)` along `tensorLeft (𝟙_ C)`. The unit of this Kan extension is composed exactly of the morphisms that appear in the [characterization of left unitors](https://leanprover-community.github.io/mathlib4_docs/Mathlib/CategoryTheory/Monoidal/DayConvolution.html#CategoryTheory.MonoidalCategory.DayConvolutionUnit.leftUnitor_hom_unit_app). We also slightly generalize the instances that express that external products with unitors are left Kan extensions, so that they can be used when taking external products with more complicated functors than currently. This is again useful when chaining extensionality lemmas for morphisms out of terms of the form `(F ⊛ U) ⊛ G`. We prove a similar thing for right unitors With this, it should be possible to have a much more satisfactory way of working with Day convolutions: this allows to "elimiinate" units without ending up with terms in an external product. --- - [ ] depends on: #26899 - [ ] depends on: #26906 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 307/18 | Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean | 2 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 235 days ago | 30 minutes |
| 27150 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): constructors for braided and symmetric structure on day convolutions monoidal categories | Following the pattern in #27119, we give API to construct `BraidedCategory` and `SymmetricCategory` structures on a monoidal category equipped with a `LawfulDayConvolutionMonoidalCategoryStruct`. To achieve this, we introduce an other type class `LawfulDayConvolutionBraidedCategoryStruct` that bundles an associator isomorphism that behaves like the one constructed for functors in #27067. We provide a noncomputable constructor for this typeclass that takes as input fullness of the "realization" functor to a category of functors, and we show that the typeclasses are sufficient to define the desired structures. --- - [x] depends on: #27067 - [x] depends on: #26820 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 826/9 | Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean | 2 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 290 days ago | 16 minutes |
| 27119 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): constructors for closed monoidal day convolution monoidal structures | Following the pattern introduced in #26798 and #26820 and using results of #26879, we introduce a typeclass `LawfulDayConvolutionClosedMonoidalCategoryStruct` that encodes the data needed on a `LawfulDayConvolutionMonoidalCategoryStruct` to define well-behaved internal homs. We give a constructor assuming existence of relevant ends, and prove that this data defines a `MonoidalClosed` instance on the monoidal category structures one can deduce from `LawfulDayConvolutionMonoidalCategoryStruct`. --- - [x] depends on: #27079 - [x] depends on: #27091 - [x] depends on: #26879 - [x] depends on: #26820 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 900/9 | Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Closed.lean | 2 | 6 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 291 days ago | 1 second |
| 28623 | gilesgshaw | feat(Logic/Basic): minor additions and simplification of proofs | Add new theorems and simplify proofs. Specifically, we add the family of related theorems `apply_dite_iff_exists`, `apply_dite_iff_forall`, `apply_ite_iff_and` and `apply_ite_iff_or`. For each other 'family' of theorems in the file that is analogous to the above, we do the following - Simplify proofs where possible, e.g. by appealing to the new theorems - Complete the family, if any of the corresponding four are missing - Rename to ensure consistency with the above pattern --- | merge-conflict t-logic new-contributor | 83/55 | Archive/Examples/IfNormalization/Result.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Notation/Indicator.lean,Mathlib/LinearAlgebra/Matrix/Rank.lean,Mathlib/Logic/Basic.lean,Mathlib/MeasureTheory/Measure/WithDensity.lean,Mathlib/SetTheory/Ordinal/Notation.lean | 9 | 12 | ['eric-wieser', 'gilesgshaw', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | awainverse | 7 months ago | 234 days ago | 10 days |
| 27933 | grunweg | chore(OrdNode): format code example in code blocks | Wrap them in code blocks (and unindent them; that indentation is not needed any more). This also avoids warnings from the linter in #27898. ------- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 459/212 | Mathlib/Data/Ordmap/Ordnode.lean | 1 | 4 | ['eric-wieser', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 230 days ago | 39 days |
| 26154 | ADedecker | refactor: add refactored APIs for algebraic filter bases | This PR continues the work from #18437. Original PR: https://github.com/leanprover-community/mathlib4/pull/18437 | merge-conflict t-topology | 651/0 | Mathlib.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 5 | 3 | ['ADedecker', 'github-actions', 'mathlib4-merge-conflict-bot'] | PatrickMassot | 7 months ago | 228 days ago | 87 days |
| 29330 | plp127 | chore: define `Fin.cycleIcc` with conditions | Redefine `Fin.cycleIcc` using conditionals instead of composing existing `Fin` operations together. Its worst-case runtime drops from O(n) to O(1). As a bonus, the definition no longer needs explaining. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-group-theory | 61/68 | Mathlib/GroupTheory/Perm/Fin.lean | 1 | 10 | ['JovanGerb', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'tb65536'] | nobody | 7 months ago | 219 days ago | 19 days |
| 21950 | erdOne | feat(NumberTheory/Padics): the completion of `ℚ` at a finite place is `ℚ_[p]` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-number-theory | 253/1 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroMulInt.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 7 | 33 | ['Ruben-VandeVelde', 'erdOne', 'faenuccio', 'github-actions', 'leanprover-community-bot-assistant', 'pechersky', 'smmercuri', 'xroblot'] | nobody | 7 months ago | 298 days ago | 73 days |
| 27214 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): Categorical pullback squares | In this PR, we give the definition and first basic properties of categorical pullback squares. Using our previous work on `CategoricalPullback`, we define a typeclass `CatPullbackSquare T L R B` that asserts that a given `CatCommSq T L R B` is a "pullback square": this is the data of a chosen adjoint equivalence to the canonical functor from the top left corner of the square to the categorical pulback of its leg. Using this equivalence, be derive a universal property for functors from `X`with values in the top left corner of the square: they are equivalent to `CatCommSqOver R B X`, the category of categorical commutative squares over the cospan `R, B` with top left corner `X`. We prove some coherence result for this equivalence, most notably an isomorphism that, given `S : CatCommSqOver R B X`, bundles the two commutative triangles formed by the induced functor, and the coherence between the squares that these isomorphisms satisfy: this is conveniently bundled in the data of a single isomorphisms of `CatCommSqOver R B X`. Finally, we provide a `Prop`-class `IsCatPullbackSquare` that merely asserts the existence (via `Nonempty`) of the relevant data: we show that it is tautotogically equivalent to the propopsition that the canonical functor to the categorical pullback is an equivalence. --- - [ ] depends on: #26679 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 786/1 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 214 days ago | 1 hour |
| 26466 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/Augmented): the canonical monoid object in the augmented simplex category | Show that in the augmented simplex category, `⦋0⦌` is an internal monoid object. Future work will show that this is in fact the universal monoid object: for any monoidal category `C`, evaluation at `⦋0⦌` induces an equivalence of categories between `Mon_ C` and the category of monoidal functors from `AugmentedSimplexCategory` to `C`. The resulting augmented cosimplicial object one gets from this construction is sometimes called the "monoidal bar construction" attached to a monoid. This PR was split from #25743. --- - [ ] depends on: #25743 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-topology t-category-theory | 571/111 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Mon_.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Monoidal.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean | 6 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 308 days ago | 28 minutes |
| 26578 | robin-carlier | feat(CategoryTheory/Limits/Pullbacks/Categorical/CatCospanTransform): adjunctions of categorical cospans | We build upon the bicategory-like structure developed in #26447 and #26412 to define the notion of adjunctions of categorical cospans. This is a structure encoding the data of two `CatCospanTransform`s, along with the usual unit and counit morphisms as part of the data, satisfying the usual left and right triangle identities. We provide basic API for these, such as extracting adjunctions between individual components. We also provide a proof that the notion satisfies a "coherence": with our chosen constructor, the forward direction of the structure `CatCommSq` on the left adjoints correspond to the inverse of the square for the right adjoints through `mateEquiv`. These adjunctions will be used as a substrate for defining equivalences of categorical cospans in a future PR: such an equivalence will be a structure extending a `CatCospanAdjunction` with isomorphisms data on the unit and co-unit (we will however provide alternative constructors in sync with the constructor for equivalences of categories). --- - [x] depends on: #26447 - [x] depends on: #26547 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory large-import | 205/0 | Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean | 1 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 304 days ago | 10 minutes |
| 23621 | astrainfinita | chore: deprecate `LinearOrderedComm{Monoid, Group}WithZero` | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #20676 | merge-conflict t-algebra t-order | 261/205 | Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/NNRat/Lemmas.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean,Mathlib/NumberTheory/FunctionField.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/RingTheory/Valuation/Archimedean.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/ExtendToLocalization.lean,Mathlib/RingTheory/Valuation/Integers.lean,Mathlib/RingTheory/Valuation/Integral.lean,Mathlib/RingTheory/Valuation/Minpoly.lean,Mathlib/RingTheory/Valuation/Quotient.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValExtension.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean,Mathlib/Topology/UnitInterval.lean,MathlibTest/instance_diamonds.lean,scripts/noshake.json | 44 | 24 | ['YaelDillies', 'astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | kbuzzard | 6 months ago | 379 days ago | 5 days |
| 27990 | kckennylau | feat(Counterexamples): a nontrivial valuation with discrete topology | This file constructs a valuation on `K[X]` satisfying `IsValuativeTopology K[X] ∧ Nonempty (valuation K[X]).RankOne ∧ IsNontrivial K[X] ∧ DiscreteTopology K[X]`, and proves that `IsValuativeTopology F ∧ IsNontrivial F ∧ DiscreteTopology F` is not possible if `F` is a field. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 172/0 | Counterexamples.lean,Counterexamples/DiscreteTopologyWithNontrivialValuation.lean | 2 | 14 | ['github-actions', 'grunweg', 'kckennylau', 'mathlib4-merge-conflict-bot', 'pechersky'] | nobody | 6 months ago | 201 days ago | 67 days |
| 28132 | dupuisf | feat: preliminary `grind` tags for `IsUnit` | This PR adds preliminary `grind` tags for the `IsUnit` predicate. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 61/17 | Mathlib/Algebra/Group/Action/Units.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Ring/Units.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean | 6 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | kim-em | 5 months ago | 177 days ago | 80 days |
| 26827 | pechersky | feat(Analysis/Normed/ValuativeRel): helper instance for NormedField | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26713 - [x] depends on: #26826 | merge-conflict t-algebra t-number-theory t-analysis | 211/27 | Mathlib.lean,Mathlib/Analysis/Normed/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 3 | 34 | ['ADedecker', 'adamtopaz', 'erdOne', 'github-actions', 'kbuzzard', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | kbuzzard | 5 months ago | 170 days ago | 122 days |
| 22662 | plp127 | feat: Localization.Away.lift (computably) | This PR adds `Localization.Away.lift'` and `Localization.Away.lift`, computable alternatives to `Localization.awayLift`. --- - [x] depends on: #24791 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 74/0 | Mathlib/RingTheory/Localization/Away/Basic.lean | 1 | 18 | ['eric-wieser', 'github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | kim-em | 5 months ago | 163 days ago | 257 days |
| 24850 | pechersky | feat(Topology/UniformSpace/Ultra): uniform spaces induced by pseudometrics are ultra if system is ultra | Any uniform space has a natural system of pseudometrics definable on it, comprised of those pseudometrics constructed from a descending chain of equivalence relation entourages. In a nonarchimedean uniformity, this pseudometric system induces the uniformity. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #23111 | merge-conflict t-topology | 509/1 | Mathlib.lean,Mathlib/Topology/MetricSpace/BundledFun.lean,Mathlib/Topology/UniformSpace/Ultra/Pseudometrizable.lean | 3 | 9 | ['ADedecker', 'fpvandoorn', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | urkud | 5 months ago | 163 days ago | 177 days |
| 26914 | quangvdao | feat(Data/PFunctor/Univariate): more definitions for univariate `PFunctor` | This PR defines several basic definitions of `PFunctor`, including zero, one, constants, monomials, coproduct (sum), product, sigma, pi, tensor product, universe lifting, and equivalence. We also add: (1) simple lemmas connecting the basic definitions, (2) an automatically derived ext lemma for `PFunctor` via `@[ext]` attribute Some things I'm not clear on: - I define `HAdd` and `HMul` instances for coproduct and product of poly functors having different universe levels. Should I also define `Add` and `Mul` instances for poly functors having the same universe level? - Is it ok to define notation for tensor product, i.e. `@[inherit_doc] scoped infixr:80 " ⊗ " => tensor`? I'm worried it might clash with other notation. - Need a double-check on the priority of notation. Some future definitions to add: - Various equivalences arising from arithmetic identities, e.g., `P + 0 ≃ₚ P`. - Definitions of Lenses and Charts (each of them will be a file or even a folder) - Exponential objects (corresponding to both `prod` and `tensor`) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 144/5 | Mathlib/Data/PFunctor/Univariate/Basic.lean | 1 | 20 | ['alexkeizer', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'quangvdao'] | eric-wieser | 5 months ago | 163 days ago | 133 days |
| 28125 | nonisomorphiclinearmap | feat(Combinatorics): basic definition of simplicial complexes | This PR introduces the basic definition of a finite (abstract) simplicial complex, located in Mathlib/Combinatorics/SimplicialComplex/Basic.lean. --- This is our first contribution to mathlib. This work was done as part of the Fields Institute Summer Undergraduate Program on formalization in topological combinatorics. Eventually, we aim to formalize Lovasz's proof of the Kneser Conjecture and this is a small stepping stone in that direction. Some other commits will shortly depend on this one. We would like to acknowledge the Fields Institute for Research in Mathematical Sciences for their sponsorship. We would also like to thank our supervisors, Professor Chris Kapulkin and Mr. Daniel Carranza, for their guidance and support throughout this project. We would also like to thank our group members Tom Lindquist and Quang Minh Nguyen for our fruitful discussions. | merge-conflict t-combinatorics new-contributor | 374/0 | Mathlib.lean,Mathlib/Combinatorics/SimplicialComplex/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Category.lean,Mathlib/Combinatorics/SimplicialComplex/FacePoset.lean,Mathlib/Combinatorics/SimplicialComplex/Hom.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 5 months ago | 163 days ago | 99 days |
| 28871 | JaafarTanoukhi | feat(Combinatorics/Digraph): Tournaments | Define orientations and tournaments. Related to #26771.
Co-authored-by: Rida Hamadani |
merge-conflict t-combinatorics new-contributor | 62/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/Digraph/Tournament.lean | 3 | 6 | ['JaafarTanoukhi', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'mathlib4-merge-conflict-bot'] | kmill | 5 months ago | 163 days ago | 71 days |
| 29526 | llllvvuu | feat: `Multiset.map f` identifies `f` up to permutation | Motivation: Reason about `Fintype`-indexed families via `Multiset` equality.
Example use case 1:
```lean
theorem Matrix.IsHermitian.cfc_eigenvalues {d : Type*} [Fintype d] [DecidableEq d]
{M : Matrix d d 𝕜} (hM : M.IsHermitian) (f : ℝ → ℝ)
(hcfc : Matrix.IsHermitian (cfc f M) := cfc_predicate f M) :
∃ (e : d ≃ d), hcfc.eigenvalues = f ∘ hM.eigenvalues ∘ e := by
have := hcfc.roots_charpoly_eq_eigenvalues.symm
rw [hM.charpoly_cfc_eq f, Polynomial.roots_prod] at this; swap
· simp [Finset.prod_ne_zero_iff, Polynomial.X_sub_C_ne_zero]
simp_rw [Polynomial.roots_X_sub_C, Multiset.bind_singleton] at this
have he := (Multiset.compTriple_equivOfMapUnivEq this).comp_eq
simp_rw [← Function.comp_def RCLike.ofReal, ← Function.comp_def f, Function.comp_assoc] at he
exact ⟨_, RCLike.ofReal_injective.comp_left he.symm⟩
```
Example use case 2 (on top of https://github.com/leanprover-community/mathlib4/pull/29610):
```lean
theorem LinearMap.Eigenbasis.μ_equiv {ι ι' R G : Type*} [Fintype ι] [Fintype ι']
[CommRing R] [IsDomain R] [AddCommGroup G] [Module R G] [Module.Free R G] [Module.Finite R G]
{f : Module.End R G} (B₁ : f.Eigenbasis ι) (B₂ : f.Eigenbasis ι') :
∃ e : ι ≃ ι', B₁.μ = B₂.μ ∘ e := by
classical
have := congr(Polynomial.roots $(B₁.charpoly_eq.symm.trans B₂.charpoly_eq))
rw [Polynomial.roots_prod, Polynomial.roots_prod] at this; rotate_left
· simp [Finset.prod_ne_zero_iff, Polynomial.X_sub_C_ne_zero]
· simp [Finset.prod_ne_zero_iff, Polynomial.X_sub_C_ne_zero]
simp_rw [Polynomial.roots_X_sub_C, Multiset.bind_singleton] at this
exact ⟨Multiset.equivOfMapUnivEq this, (Multiset.compTriple_equivOfMapUnivEq this).comp_eq.symm⟩
```
Co-authored-by: Aristotle Harmonic |
merge-conflict t-data | 35/0 | Mathlib/Data/Multiset/Fintype.lean | 1 | 9 | ['Ruben-VandeVelde', 'github-actions', 'llllvvuu', 'mathlib4-merge-conflict-bot', 'vihdzp', 'wwylele'] | pechersky | 5 months ago | 163 days ago | 69 days |
| 29947 | JaafarTanoukhi | feat(Combinatorics/Digraph): Maps | Ported `SimpleGraph/Maps.lean` to `Digraph/Maps.lean` for future PRs related to issue #[26771](https://github.com/leanprover-community/mathlib4/issues/26771) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics new-contributor | 476/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Maps.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 5 months ago | 163 days ago | 54 days |
| 31356 | adomani | feat: add inspect-like functions | Produces a tree-like formatting for `Syntax`, `Expr` and `InfoTree`. Especially for the `InfoTree`s, there are *many* parts of it that do not get printed. For instance, this is how the `InfoTree`s of `set_option linter.missingDocs true` get printed: ```lean inspectIT set_option linter.missingDocs true /- commandCtx |-Info.ofCommandInfo: Lean.Elab.Command.elabSetOption, 'set_option…gDocs true' | |-Info.ofCompletionInfo.CompletionInfo.option 'set_option…issingDocs' | |-Info.ofOptionInfo: linter.missingDocs, Linter.linter.missingDocs -/ ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 720/0 | Mathlib.lean,Mathlib/Util/Inspect.lean,MathlibTest/Inspect.lean | 3 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | kim-em | 5 months ago | 163 days ago | 11 days |
| 6993 | jjaassoonn | feat: lemmas about `AddMonoidAlgebra.{divOf, modOf}` | --- - [x] depends on: #7582 - [x] depends on: #8975 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 147/3 | Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/MvPolynomial/Basic.lean,Mathlib/Data/MvPolynomial/CommRing.lean,Mathlib/Data/MvPolynomial/Division.lean | 5 | 42 | ['YaelDillies', 'alreadydone', 'digama0', 'eric-wieser', 'github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 833 days ago | 103 days |
| 9339 | FMLJohn | feat(RingTheory/GradedAlgebra/HomogeneousIdeal): given a finitely generated homogeneous ideal of a graded semiring, construct a finite spanning set for the ideal which only contains homogeneous elements | --- - [ ] depends on: #8187 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 402/4 | Mathlib.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/RingTheory/Finiteness.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean | 8 | 11 | ['FMLJohn', 'github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 847 days ago | 6 days |
| 10349 | Shamrock-Frost | refactor(CategoryTheory/MorphismProperty): some clean-ups | We make explicit some of the galois connections/closure operators in the existing MorphismProperty file, rewrite some proofs to take advantage of these structures, and change map/inverseImage by (1) swapping their argument order, for consistency with Set.range and Set.preimage and (2) making "map" perform the strict, evil map while "essMap" (previously called map) forms the closure of the image under isomorphisms. Finally we add `IsMultiplicative` instances for isos/epis/monos, with an eye towards constructing the wide subcategory on these classes of maps. --- - [x] depends on: #10347 - [x] depends on: #10348 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 474/318 | Mathlib/CategoryTheory/Localization/Composition.lean,Mathlib/CategoryTheory/Localization/LocalizerMorphism.lean,Mathlib/CategoryTheory/MorphismProperty.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Order/Closure.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Order/RelIso/Basic.lean | 8 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 813 days ago | 6 minutes |
| 26890 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): more API for `DayFunctor` | We provide some lemmas that helps characterizing the monoidal structure on `DayFunctor`, they are special cases of the lemmas for `LawfulDayConvolutionMonoidalCategoryStruct`. --- - [x] depends on: #26824 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 1372/19 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean | 4 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 297 days ago | 8 minutes |
| 24016 | plp127 | feat: fine uniformity | Adds the fine uniformity, and proves some properties. --- - [ ] depends on: #24096 for showing the induced topology is equal on completely regular spaces [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 283/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/FineUniformity.lean,Mathlib/Topology/UniformSpace/Uniformizable.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 379 days ago | 2 days |
| 26912 | pechersky | chore(Algebra/Ring/Subring): simp tag `Subring.smul_def` | s-multiplying by a subtype is easiest to manipulate when both terms are in the ambient type. Many places that had to use the _def lemma for a rewrite, or to include it in a simp set, no longer have to. Ported from #25308 --- [](https://gitpod.io/from-referrer/) I found this being not-simp frustrating when talking about submodules over a valuation subring. | merge-conflict t-algebra | 67/66 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Group/Submonoid/MulAction.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/LocalizedModule/Exact.lean,Mathlib/Algebra/Module/LocalizedModule/IsLocalization.lean,Mathlib/Algebra/Module/LocalizedModule/Submodule.lean,Mathlib/Algebra/Ring/Periodic.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean,Mathlib/LinearAlgebra/RootSystem/Irreducible.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/RingTheory/Etale/Kaehler.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/LocalProperties/Projective.lean,Mathlib/RingTheory/Localization/InvSubmonoid.lean,Mathlib/RingTheory/OreLocalization/Basic.lean | 25 | 26 | ['artie2000', 'eric-wieser', 'github-actions', 'j-loreaux', 'kckennylau', 'leanprover-bot', 'leanprover-radar', 'linesthatinterlace', 'mathlib4-merge-conflict-bot', 'pechersky'] | joelriou | 4 months ago | 158 days ago | 60 days |
| 30375 | sinhp | feat(CategoryTheory): Basics of Locally Cartesian Closed Categories | Supersedes https://github.com/leanprover-community/mathlib4/pull/22321 This PR defines locally cartesian closed categories in terms of existence of the pushforward functors (right adjoint to the pullback functor) for all morphisms. We develop basic API and prove the following: 1. Existence of the pushforward functors is equivalent to cartesian closed slices. 2. Any locally cartesian closed category with a terminal object is cartesian closed. 3. The slices of a locally cartesian closed category are locally cartesian closed. --- - [ ] depends on: #31033 - [ ] depends on: #30373 - [ ] depends on: #31332 [](https://gitpod.io/from-referrer/) | t-category-theory merge-conflict | 703/0 | Mathlib.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ChosenPullbacksAlong.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ExponentiableMorphism.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Sections.lean | 5 | 9 | ['Jlh18', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 3 months ago | 204 days ago | 34 minutes |
| 33126 | CoolRmal | feat: function composition preserves boundedness | This PR adds the following theorem: if the range of a function `g` is bounded above, then `g ∘ f` is bounded above for all functions `f`. --- [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 12/0 | Mathlib/Order/Bounds/Basic.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | bryangingechen | 3 months ago | 105 days ago | 27 days |
| 29587 | uniwuni | feat(GroupTheory/Finiteness): define finitely generated semigroups | We define finitely generated semigroups and basics similarly to monoids and groups and prove that semigroups and monoids remain finitely generated when a congruence is quotiented out. This will be important when further developing semigroup theory. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-group-theory | 259/14 | Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/GroupTheory/Finiteness.lean | 2 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'uniwuni'] | dupuisf | 3 months ago | 205 days ago | 25 days |
| 29014 | ShreckYe | feat(Data/List/Scan): some theorems that relate `scanl` with `foldl` | I am not sure which is the best form of `getElem_scanl_eq_foldl_take` here, so I added several alternative forms. Feel free to remove any of them if necessary. | merge-conflict t-data | 35/0 | Mathlib/Data/List/Scan.lean | 1 | 15 | ['ShreckYe', 'github-actions', 'mathlib4-merge-conflict-bot', 'themathqueen', 'vlad902'] | pechersky | 3 months ago | 172 days ago | 74 days |
| 16074 | Rida-Hamadani | feat: combinatorial maps and planar graphs | We define combinatorial maps, then we define planar graph using combinatorial maps. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics | 243/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Planar.lean,Mathlib/Data/CombinatorialMap.lean | 3 | 29 | ['MrBrain295', 'Parcly-Taxel', 'Rida-Hamadani', 'github-actions', 'lambda-fairy', 'leanprover-community-bot-assistant'] | kmill | 3 months ago | 300 days ago | 72 days |
| 9820 | jjaassoonn | feat(RingTheory/GradedAlgebra/HomogeneousIdeal): generalize to homogeneous submodule | The definitions, constructions and theorems in `HomogeneousIdeal.lean` are generalized to a homogeneous submodules. So say $R$ is a ring and $M \cong \bigoplus_{i} M_i$ is an $R$-module. Then a homogeneous $R$-submodule of $M$ is an $R$-submodule $N$ such that for all $i$ and $n \in N$, $n_i \in N$. Note that this notion doesn't actually require $R$ to be graded and $M$ is a graded module. But for more interesting lemmas, we do need that $M$ is graded $R$-module. We bake the fact $R$ is graded into the definition of homogeneous submodule, otherwise, `CompleteLattice HomogeneousSubmodule` cannot find the order of synthesis (the proof depends on that $R$ is graded) All definitions/constructions/theorems have a copy for ideals as well, this is to make sure dot notation still works. The motivation of this generalization is graded quotient module --- - [x] depends on:#18728 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 516/185 | Mathlib/Algebra/Module/GradedModule.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,scripts/nolints_prime_decls.txt | 7 | 3 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 2 months ago | 300 days ago | 52 days |
| 34931 | eric-wieser | perf: make TensorProduct.lift irreducible with a unification hint | --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 6/2 | Mathlib/LinearAlgebra/TensorProduct/Basic.lean | 1 | 7 | ['eric-wieser', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | erdOne | 2 months ago | 78 days ago | 5 days |
| 33020 | FormulaRabbit81 | chore(Topology): Deprecate file | --- - [x] depends on: #30851 deprecation [](https://gitpod.io/from-referrer/) | t-topology large-import merge-conflict | 82/49 | Mathlib/Topology/Compactness/HilbertCubeEmbedding.lean,Mathlib/Topology/MetricSpace/HausdorffAlexandroff.lean,Mathlib/Topology/MetricSpace/PiNat.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 134 days ago | 4 hours |
| 33281 | michelsol | feat(Analysis/SpecialFunctions/Integrals): integral of 1/sqrt(1-x^2) and its integrability. | Add the integral of the derivative of arcsin and its integrability. --- - [ ] depends on: #33280 [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict t-analysis | 59/0 | Mathlib/Analysis/SpecialFunctions/Integrability/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 127 days ago | 47 minutes |
| 34156 | zcyemi | feat(Analysis/Convex/Between): add lemmas on convex combination of mem simplex interior | --- I add three lemmas of convex combinations preserving membership in the interior of a simplex. And also open a zulip thread [#mathlib4 > Best place for convex combination and simplex interior](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Best.20place.20for.20convex.20combination.20and.20simplex.20interior/with/568558406) deps: - [ ] depends on: #33852 | t-analysis merge-conflict | 170/0 | Mathlib/Analysis/Convex/Between.lean,Mathlib/LinearAlgebra/AffineSpace/Independent.lean | 2 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 75 days ago | 48 minutes |
| 25980 | Multramate | refactor(Algebra/Group/Submonoid/Operations): rename restrict to domRestrict and add restrict | And update the documentation for consistency | t-group-theory merge-conflict | 145/123 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/GroupTheory/FiniteAbelian/Duality.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/Maps.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/Transfer.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/NumberTheory/NumberField/CMField.lean,Mathlib/NumberTheory/NumberField/Ideal/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean | 14 | 10 | ['Multramate', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 72 days ago | 5 days |
| 25981 | Multramate | feat(GroupTheory/GroupAction/Basic): define homomorphisms of fixed subgroups induced by homomorphisms of groups | This PR continues the work from #10126. Original PR: https://github.com/leanprover-community/mathlib4/pull/10126 | t-group-theory large-import merge-conflict | 218/144 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Ring/Action/Submonoid.lean,Mathlib/GroupTheory/FiniteAbelian/Duality.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/Maps.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/Transfer.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/NumberTheory/NumberField/CMField.lean,Mathlib/NumberTheory/NumberField/Ideal/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean | 16 | 8 | ['copilot-pull-request-reviewer', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 72 days ago | 4 days |
| 33795 | alreadydone | feat(Topology/Sheaves): LocalPredicate prerequisite for étalé spaces | --- [](https://gitpod.io/from-referrer/) | t-topology merge-conflict | 418/143 | Mathlib/AlgebraicGeometry/ProjectiveSpectrum/StructureSheaf.lean,Mathlib/Geometry/Manifold/Sheaf/Smooth.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Topology/Sheaves/LocalPredicate.lean,Mathlib/Topology/Sheaves/Sheafify.lean,Mathlib/Topology/Sheaves/Stalks.lean | 6 | 12 | ['adamtopaz', 'alreadydone', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts'] | adamtopaz | 2 months ago | 72 days ago | 34 days |
| 34674 | Citronhat | feat(Algebra/Order/Ring): replace ENNReal lemmas with WithTop versions | * Add `WithTop` versions of basic multiplicative order lemmas. * Use the new `WithTop` lemmas to replace `ENNReal` proofs and address six TODOs. * Fix a typo in the `pos_of_ne_zero` alias name. | new-contributor t-algebra merge-conflict | 46/15 | Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Data/ENNReal/Operations.lean | 3 | 5 | ['Citronhat', 'Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | Ruben-VandeVelde | 2 months ago | 72 days ago | 17 days |
| 33746 | ster-oc | feat(Algebra/Module/ZLattice): align `ZSpan.floor` to `Int.floor` API | This PR adds some of the existent lemmas about `Int.floor`, `Int.ceil` and `Int.fract` to the `ZSpan` namespace. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor merge-conflict | 353/145 | Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 3 | 8 | ['github-actions', 'joelriou', 'mathlib-merge-conflicts', 'ster-oc'] | joelriou | 2 months ago | 67 days ago | 30 days |
| 33791 | PhoenixIra | feat: Generalization of FixedPointApproximants to CompletePartialOrder | --- This PR provides a generalization of FixedPointApproximants to CompletePartialOrder. Not every theorem can be generalized, as sometimes we require additional conditions (namely `x ≤ f x`) in order to guarantee that the set is directed and thus the supremum is well-defined. This is not necessary in a CompleteLattice. [](https://gitpod.io/from-referrer/) | new-contributor t-order merge-conflict | 223/100 | Mathlib/Order/CompletePartialOrder.lean,Mathlib/SetTheory/Ordinal/FixedPointApproximants.lean | 2 | 21 | ['PhoenixIra', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | PhoenixIra and vihdzp | 2 months ago | 62 days ago | 38 days |
| 26942 | pechersky | feat(RingTheory/Valuation/ValueGroupIso): isomorphism of value groups when compatible | and also to the ValuativeRel's value group by request from comment in https://github.com/leanprover-community/mathlib4/pull/26754#issuecomment-3051770901 - [ ] depends on: #26588 --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26939 - [x] depends on: #26940 - [x] depends on: #26941 | merge-conflict t-ring-theory t-order | 299/3 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Algebra/Order/GroupWithZero/Range.lean,Mathlib/Algebra/Order/GroupWithZero/WithZero.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/RingTheory/Valuation/ValueGroupIso.lean | 6 | 10 | ['faenuccio', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'pechersky'] | faenuccio | 1 month ago | 260 days ago | 10 days |
| 14712 | astrainfinita | perf: change instance priority and order about `OfNat` | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 49/20 | Mathlib/Algebra/Group/Nat.lean,Mathlib/Algebra/Group/ZeroOne.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Data/BitVec.lean,Mathlib/Data/Nat/Cast/Defs.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/UInt.lean,Mathlib/NumberTheory/ArithmeticFunction.lean | 9 | 26 | ['MichaelStollBayreuth', 'astrainfinita', 'eric-wieser', 'fpvandoorn', 'github-actions', 'j-loreaux', 'leanprover-bot', 'mathlib-bors'] | nobody | 1 month ago | 631 days ago | 20 days |
| 17627 | hrmacbeth | feat: universal properties of vector bundle constructions | Characterizations for the smoothness of maps into the total spaces of (1) the direct sum of two vector bundles; (2) the pullback of a vector bundle. This gap in the library was exposed by #17358. --- - [x] depends on: #22804 [](https://gitpod.io/from-referrer/) | merge-conflict t-differential-geometry | 311/9 | Mathlib/Data/Bundle.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/Pullback.lean,Mathlib/Topology/FiberBundle/Constructions.lean | 4 | 26 | ['PatrickMassot', 'fpvandoorn', 'github-actions', 'grunweg', 'hrmacbeth', 'j-loreaux', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'sgouezel'] | grunweg | 1 month ago | 316 days ago | 91 days |
| 27534 | PierreQuinton | feat: a typeclass for `sSup`/`sInf` to be lawful | Adds lawful infima and suprema type classes. A preorder with lawful suprema: whenever a set has a least upper bound, `sSup` returns a least upper bound for that set. A preorder with lawful infima: whenever a set has a greatest lower bound, `sInf` returns a greastest lower bound for that set. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order | 121/8 | Mathlib.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/LawfulSupInf.lean | 3 | 26 | ['PierreQuinton', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | nobody | 1 month ago | 163 days ago | 114 days |
| 35042 | JovanGerb | chore: remove `meta` form `import Mathlib.Tactic...` | This PR cleans up some imports of the form `import Mathlib.Tactic...`, by either removing them entirely, or removing the `meta` keyword. It should never be necessary to `meta import` a file from `Mathlib.Tactic`, because the relevant definitions should already have been marked as `meta`. The motivation is to reduce the amount of files that are `meta` imported when writing e.g. `import Mathlib`, hence reducing the amount of stuff that needs to be loaded. There are more other `meta import`s that need to be removed, but this PR is a good start. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 61/142 | Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/Group/Action/Hom.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/Data/List/ChainOfFn.lean,Mathlib/Dynamics/OmegaLimit.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/DomAct/Basic.lean,Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/ApplyFun.lean,Mathlib/Tactic/ArithMult.lean,Mathlib/Tactic/Bound.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Normalize.lean,Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/CheckCompositions.lean,Mathlib/Tactic/CategoryTheory/Coherence/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/Normalize.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/Elementwise.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/ToApp.lean,Mathlib/Tactic/Choose.lean,Mathlib/Tactic/DeclarationNames.lean,Mathlib/Tactic/DefEqTransformations.lean,Mathlib/Tactic/DeriveCountable.lean,Mathlib/Tactic/DeriveFintype.lean,Mathlib/Tactic/DeriveTraversable.lean,Mathlib/Tactic/ENatToNat.lean,Mathlib/Tactic/Explode.lean,Mathlib/Tactic/Explode/Pretty.lean,Mathlib/Tactic/FinCases.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GRewrite/Elab.lean,Mathlib/Tactic/Group.lean,Mathlib/Tactic/IrreducibleDef.lean,Mathlib/Tactic/Lift.lean,Mathlib/Tactic/Linarith.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/Gauss.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Preprocessing.lean,Mathlib/Tactic/Linarith/Verification.lean,Mathlib/Tactic/LinearCombination/Lemmas.lean,Mathlib/Tactic/Linter/DeprecatedSyntaxLinter.lean,Mathlib/Tactic/Linter/DocPrime.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Tactic/Linter/EmptyLine.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/Linter/GlobalAttributeIn.lean,Mathlib/Tactic/Linter/HashCommandLinter.lean,Mathlib/Tactic/Linter/Multigoal.lean,Mathlib/Tactic/Linter/OldObtain.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/Linter/TextBased.lean,Mathlib/Tactic/Linter/TextBased/UnicodeLinter.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,Mathlib/Tactic/Linter/UnusedTacticExtension.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Nontriviality/Core.lean,Mathlib/Tactic/NormNum/DivMod.lean,Mathlib/Tactic/NormNum/Ineq.lean,Mathlib/Tactic/NormNum/Prime.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/Order/CollectFacts.lean,Mathlib/Tactic/Order/Graph/Tarjan.lean,Mathlib/Tactic/PNatToNat.lean,Mathlib/Tactic/Peel.lean,Mathlib/Tactic/ProdAssoc.lean,Mathlib/Tactic/ProxyType.lean,Mathlib/Tactic/Push.lean,Mathlib/Tactic/Qify.lean,Mathlib/Tactic/RSuffices.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Tactic/Ring/Common.lean,Mathlib/Tactic/Ring/Compare.lean,Mathlib/Tactic/Ring/PNat.lean,Mathlib/Tactic/Simproc/Divisors.lean,Mathlib/Tactic/Simproc/FinsetInterval.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Subsingleton.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,Mathlib/Tactic/TautoSet.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/TagUnfoldBoundary.lean,Mathlib/Tactic/Widget/Calc.lean,Mathlib/Tactic/Widget/CommDiag.lean,Mathlib/Tactic/Widget/CongrM.lean | 107 | 9 | ['JovanGerb', 'dupuisf', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | robin-carlier | 1 month ago | 46 days ago | 26 days |
| 35213 | kim-em | chore: use @[to_dual] in ConditionallyCompleteLattice | This PR adds `@[to_dual]` annotations across all `ConditionallyCompleteLattice` files: `Defs`, `Basic`, `Indexed`, `Finset`, and `Group`. Auto-generates dual theorems and deletes hand-written versions. (Absorbs the former PR #35212.) [Diff relative to #35209](https://github.com/kim-em/mathlib4/compare/kim/to-dual-complete-lattice...kim/to-dual-ccl-extended) - [ ] depends on: #35209 - [ ] depends on: #35211 🤖 Prepared with Claude Code | merge-conflict LLM-generated | 189/485 | Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 77 days ago | 16 minutes |
| 35215 | kim-em | chore: use @[to_dual] in FixedPoints | This PR adds `@[to_dual]` annotations to 14 theorems about `lfp` in `Order/FixedPoints.lean`, auto-generating their `gfp` duals and deleting the hand-written versions. Also registers `OrderHom.lfp` as the dual of `OrderHom.gfp` via `attribute [to_dual existing]`. Auto-generated duals include: `le_gfp`, `gfp_le_fixed`, `gfp_le`, `gfp_le_map`, `map_gfp`, `isFixedPt_gfp`, `map_le_gfp`, `isGreatest_gfp_le`, `isGreatest_gfp`, `gfp_induction`, `map_gfp_comp`, `gfp_gfp`, `map_inf_fixedPoints_le`, `map_sInf_subset_fixedPoints_le`. [Diff relative to #35208](https://github.com/kim-em/mathlib4/compare/kim/to-dual-bounds-basic...kim/to-dual-fixed-points) - [x] depends on: #35208 🤖 Prepared with Claude Code | LLM-generated merge-conflict | 249/548 | Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/FixedPoints.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Topology/Order.lean | 8 | 11 | ['JovanGerb', 'github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | alexjbest | 1 month ago | 42 days ago | 24 days |
| 32918 | michelsol | feat: define `supEdist` and `supDist` | Create a new file Topology.MetricSpace.SupDistance and define the supremal distance in (extended) metric spaces. The defined `supEdist` and `supDist` will have similar theory to the already existing `infEdist` and `infDist`. The motivation is to be able to define the radius of a minimal bounding sphere as the infimum of the supDist later. [zulip discussion here](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Formalizing.20Jung's.20theorem.20and.20minimal.20bounding.20spheres) | t-topology new-contributor merge-conflict | 75/0 | Mathlib.lean,Mathlib/Topology/MetricSpace/SupDistance.lean | 2 | 5 | ['github-actions', 'mathlib4-merge-conflict-bot', 'michelsol', 'urkud'] | nobody | 1 month ago | 115 days ago | 21 days |
| 36165 | Parcly-Taxel | chore: deprecate `Nat.strongRec(On)'` | In favour of Batteries's `Nat.strongRec` for definitions and `Nat.strong_induction_on` for proofs. | t-data merge-conflict | 34/66 | Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Data/Int/GCD.lean,Mathlib/Data/Nat/Factorization/Induction.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean | 8 | 6 | ['JovanGerb', 'MichaelStollBayreuth', 'Parcly-Taxel', 'Vierkantor', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | Vierkantor | 1 month ago | 42 days ago | 15 days |
| 31595 | astrainfinita | chore: redefine `Ideal.IsPrime` | Redefine `Ideal.IsPrime` to make it correct for non-commutative cases --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 333/100 | Mathlib/Algebra/Order/Ring/Ordering/Defs.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Noetherian.lean,Mathlib/RingTheory/Ideal/Oka.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Ideal/Prime.lean,Mathlib/RingTheory/Ideal/Prod.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IsPrimary.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/Spectrum/Prime/Topology.lean,Mathlib/RingTheory/Valuation/Basic.lean | 22 | 33 | ['alreadydone', 'artie2000', 'astrainfinita', 'erdOne', 'github-actions', 'leanprover-bot', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | kim-em | 1 month ago | 33 days ago | 59 days |
| 11964 | adamtopaz | feat: The functor of points of a scheme | We construct the functor of points functor, and prove that it's full and faithful. --- - [x] depends on: #11947 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry t-category-theory | 210/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/FunctorOfPoints.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean | 3 | 4 | ['github-actions', 'grunweg'] | nobody | 28 days ago | 749 days ago | 20 minutes |
| 33434 | astrainfinita | chore: redefine `Finsupp.indicator` using `Finsupp.onFinset` | --- [](https://gitpod.io/from-referrer/) | t-data merge-conflict | 6/17 | Mathlib/Data/Finsupp/Indicator.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 21 days ago | 21 days ago | 5 days |
| 35802 | xroblot | feat(RamificationInertia): splitting in the decomposition field | --- - [x] depends on: #35798 - [ ] depends on: #35405 - [x] depends on: #35371 [](https://gitpod.io/from-referrer/) | t-number-theory large-import merge-conflict | 279/4 | Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Basic.lean | 4 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 21 days ago | 64 days ago | 8 minutes |
| 6777 | adomani | chore(Co*variantClass): replace eta-expanded (· * ·), (· + ·), (· ≤ ·), (· < ·) | Replace `CovariantClass X X (· * ·) (· ≤ ·)` with -> `CovariantClass X X HMul.hMul LE.le` and similarly for `HAdd`, `LT`, `Contravariant`.
This PR is inspired by [Issue #6646](https://github.com/leanprover-community/mathlib4/issues/6646) and, more specifically, [this comment](https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1692792066).
Note that https://github.com/leanprover/lean4/pull/2267 would make this unnecessary
---
```bash
# First sed command:
# the first captured pattern is `Co*variantClass |
merge-conflict | 703/678 | Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/Bounds.lean,Mathlib/Algebra/CovariantAndContravariant.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/GroupPower/Order.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Archimedean.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/MinMax.lean,Mathlib/Algebra/Order/Group/OrderIso.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Interval.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/LatticeGroup.lean,Mathlib/Algebra/Order/Module.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Cancel/Defs.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/Lemmas.lean,Mathlib/Algebra/Order/Monoid/MinMax.lean,Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Algebra/Order/Monoid/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Prod.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithZero/Basic.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Lemmas.lean,Mathlib/Algebra/Order/Sub/Basic.lean,Mathlib/Algebra/Order/Sub/Canonical.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Algebra/Parity.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Normed/Order/Lattice.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/List/BigOperators/Basic.lean,Mathlib/Data/List/BigOperators/Lemmas.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Nat/Cast/Order.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Real/ENNReal.lean,Mathlib/Data/Real/NNReal.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/VectorMeasure.lean,Mathlib/Order/ConditionallyCompleteLattice/Group.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Martingale/Basic.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/PGame.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/NaturalOps.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/Positivity/Basic.lean,Mathlib/Topology/ContinuousFunction/Algebra.lean,lean-toolchain,test/Recall.lean,test/propose.lean | 81 | 37 | ['adomani', 'alreadydone', 'digama0', 'eric-wieser', 'ericrbg', 'jcommelin', 'leanprover-bot', 'sgouezel', 'vihdzp'] | nobody | 14 days ago | 914 days ago | 35 days |
| 37530 | mcdoll | fix(Topology/Algebra): fix bad simps and make arguments implicit for `PointwiseConvergenceCLM` | We delete all `simps` calls in the definitions of operators on `PointwiseConvergenceCLM` and replace them with `apply_apply` lemmas that do not abuse the defeq between `SLₚₜ` and `SL`. This made the linter discover some typeclass duplications, which we remove by restructuring the file. As a consequence of the new `simp` lemmas, we can remove all `set_option backward.isDefEq.respectTransparency false in` in `Analysis.Distribution.TemperedDistribution`. Moreover, we make several arguments implicit, which can be inferred in almost all practical situations. --- [](https://gitpod.io/from-referrer/) | not-ready-to-merge merge-conflict | 88/69 | Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Topology/Algebra/Module/Spaces/PointwiseConvergenceCLM.lean | 2 | 5 | ['github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'mcdoll'] | nobody | 12 days ago | 12 days ago | 14 days |
| 37593 | IlPreteRosso | refactor(Data.Finset.*Antidiagonal): rename set-based defs to `set*Antidiagonal` | Renames set-based `Finset.mulAntidiagonal` → `setMulAntidiagonal` (and SMul/VAdd variants) to free the `mulAntidiagonal` name for the planned `HasMulAntidiagonal` typeclass. Deprecation aliases added. Supersedes #34551 | t-ring-theory new-contributor merge-conflict | 178/96 | Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Data/Finset/MulAntidiagonal.lean,Mathlib/Data/Finset/SMulAntidiagonal.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Summable.lean | 6 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 12 days ago | 15 days |
| 37444 | vihdzp | feat: typeclass for zero-dimensional spaces | --- - [ ] depends on: #37317 [](https://gitpod.io/from-referrer/) | t-topology large-import merge-conflict | 151/110 | Mathlib/Topology/Algebra/ClopenNhdofOne.lean,Mathlib/Topology/Category/LightProfinite/Basic.lean,Mathlib/Topology/Category/Profinite/Basic.lean,Mathlib/Topology/Category/Profinite/CofilteredLimit.lean,Mathlib/Topology/Category/Stonean/Basic.lean,Mathlib/Topology/ClopenBox.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/WithTop.lean,Mathlib/Topology/Separation/CompletelyRegular.lean,Mathlib/Topology/Separation/DisjointCover.lean,Mathlib/Topology/Separation/Lemmas.lean,Mathlib/Topology/Separation/Profinite.lean,Mathlib/Topology/UniformSpace/Ultra/Basic.lean | 13 | 17 | ['ADedecker', 'FernandoChu', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 10 days ago | 10 days ago | 1 hour |
| 38239 | vihdzp | chore(Order/SuccPred/Limit): reorganize sections | In an effort to keep the file better organized, we move theorems which use `SuccOrder`/`PredOrder` as an assumption to a new section. No theorems have been changed. --- [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 95/110 | Mathlib/Order/SuccPred/Limit.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 9 days ago | 2 days |
| 36236 | kim-em | chore: add module keyword to Archive and Counterexamples files | This PR converts 105 Archive and Counterexamples files to module format, adding `module`, `public import`, and `@[expose] public section`. Eight files are left unconverted for now: - Seven files containing `private` declarations that need further work (`Imo1962Q1`, `MiuLanguage/Basic`, `MiuLanguage/DecisionSuf`, `AscendingDescendingSequences`, `BallotProblem`, `AharoniKorman`, `TopologistsSineCurve`) - `Counterexamples/InvertibleModuleNotIdeal` which needs an import path update For `Archive/Examples/PropEncodable`, the `private` declarations were removed as part of this conversion. 🤖 Prepared with Claude Code | IMO LLM-generated merge-conflict | 735/309 | Archive/Arithcc.lean,Archive/Examples/Eisenstein.lean,Archive/Examples/Kuratowski.lean,Archive/Examples/PropEncodable.lean,Archive/Hairer.lean,Archive/Imo/Imo1959Q1.lean,Archive/Imo/Imo1959Q2.lean,Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1960Q2.lean,Archive/Imo/Imo1961Q3.lean,Archive/Imo/Imo1962Q4.lean,Archive/Imo/Imo1963Q5.lean,Archive/Imo/Imo1964Q1.lean,Archive/Imo/Imo1969Q1.lean,Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo1975Q1.lean,Archive/Imo/Imo1977Q6.lean,Archive/Imo/Imo1981Q3.lean,Archive/Imo/Imo1982Q1.lean,Archive/Imo/Imo1985Q2.lean,Archive/Imo/Imo1986Q5.lean,Archive/Imo/Imo1987Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1997Q3.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2001Q3.lean,Archive/Imo/Imo2001Q4.lean,Archive/Imo/Imo2001Q5.lean,Archive/Imo/Imo2001Q6.lean,Archive/Imo/Imo2002Q3.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2005Q4.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2006Q5.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2010Q5.lean,Archive/Imo/Imo2011Q3.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2013Q1.lean,Archive/Imo/Imo2013Q5.lean,Archive/Imo/Imo2015Q6.lean,Archive/Imo/Imo2019Q1.lean,Archive/Imo/Imo2019Q2.lean,Archive/Imo/Imo2019Q4.lean,Archive/Imo/Imo2020Q2.lean,Archive/Imo/Imo2021Q1.lean,Archive/Imo/Imo2024Q2.lean,Archive/Imo/Imo2024Q3.lean,Archive/Imo/Imo2024Q6.lean,Archive/Imo/Imo2025Q3.lean,Archive/Kuratowski.lean,Archive/MinimalSheffer.lean,Archive/OxfordInvariants/Summer2021/Week3P1.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/HeronsFormula.lean,Archive/Wiedijk100Theorems/InverseTriangleSum.lean,Archive/Wiedijk100Theorems/Konigsberg.lean,Archive/Wiedijk100Theorems/PerfectNumbers.lean,Archive/Wiedijk100Theorems/SolutionOfCubicQuartic.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Archive/ZagierTwoSquares.lean,Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean,Counterexamples/CharPZeroNeCharZero.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/Cyclotomic105.lean,Counterexamples/DimensionPolynomial.lean,Counterexamples/DirectSumIsInternal.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Counterexamples/EulerSumOfPowers.lean,Counterexamples/Girard.lean,Counterexamples/HeawoodUnitDistance.lean,Counterexamples/HomogeneousPrimeNotPrime.lean,Counterexamples/IrrationalPowerOfIrrational.lean,Counterexamples/MapFloor.lean,Counterexamples/MonicNonRegular.lean,Counterexamples/Motzkin.lean,Counterexamples/NowhereDifferentiable.lean,Counterexamples/OrderedCancelAddCommMonoidWithBounds.lean,Counterexamples/PeanoCurve.lean,Counterexamples/Phillips.lean,Counterexamples/PolynomialIsDomain.lean,Counterexamples/Pseudoelement.lean,Counterexamples/QuadraticForm.lean,Counterexamples/SeminormLatticeNotDistrib.lean,Counterexamples/SeparableNotSecondCountable.lean,Counterexamples/SorgenfreyLine.lean,Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean | 97 | 9 | ['JovanGerb', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | dwrensha | 7 days ago | 7 days ago | 6 days |
| 37461 | grunweg | chore: golf using the field tactic | --- In the spirit of #31314. [](https://gitpod.io/from-referrer/) | merge-conflict | 32/43 | Counterexamples/NowhereDifferentiable.lean,Mathlib/Analysis/Calculus/Monotone.lean,Mathlib/Analysis/Complex/BorelCaratheodory.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/Normed/Field/Lemmas.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/InformationTheory/KullbackLeibler/Basic.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Integral/MeanValue.lean,Mathlib/NumberTheory/ModularForms/Discriminant.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/Defs.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/MDifferentiable.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/Distributions/Gaussian/CharFun.lean,Mathlib/RepresentationTheory/Homological/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/PowerSeries/Exp.lean,Mathlib/Topology/UnitInterval.lean | 20 | 5 | ['github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 7 days ago | 22 days |
| 37774 | weisbrja | fix: change variables in `bicompl` to `Sort*` and add missing theorem mentioned in `bicompl` docs | [#mathlib4 > Why does Mathlib use Type* instead of Sort* in some places?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Why.20does.20Mathlib.20use.20Type.2A.20instead.20of.20Sort.2A.20in.20some.20places.3F/with/583882342) --- [](https://gitpod.io/from-referrer/) | new-contributor t-logic merge-conflict | 6/1 | Mathlib/Logic/Function/Basic.lean | 1 | 8 | ['github-actions', 'kbuzzard', 'leanprover-radar', 'mathlib-merge-conflicts', 'weisbrja'] | nobody | 4 days ago | 4 days ago | 19 days |
| 33478 | anishrajeev | feat(ModelTheory): define a subset of the topology over complete types | Define a subset of the Stone Space over a language expanded with countably many constants. Define the proposition to indicate if a language is countable. The subset's density and openness is a future goal to prove (have a branch where it is almost finished), in pursuit of formalizing the proof of the Omitting Types Theorem via properties of Baire spaces. - [ ] depends on: #32215 - [ ] depends on: #32546 | t-logic merge-conflict new-contributor | 160/1 | Mathlib.lean,Mathlib/ModelTheory/Topology/Types.lean,Mathlib/ModelTheory/Types.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 4 | 8 | ['NoneMore', 'anishrajeev', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'tb65536'] | nobody | 2 days ago | 109 days ago | 10 days |
| 35043 | winstonyin | refactor(Analysis/ODE): restate existence and uniqueness using integral curve API | * Create `Mathlib/Analysis/ODE/ExistUnique.lean` to collect existence and uniqueness results for ODEs stated in terms of the integral curve API (`IsIntegralCurve`, `IsIntegralCurveOn`, `IsIntegralCurveAt`). * Move and restate the Picard-Lindelöf existence theorems from `PicardLindelof.lean` and the $C^1$ vector field results using `IsIntegralCurveOn`/`IsIntegralCurveAt` instead of raw `HasDerivWithinAt`/`HasDerivAt`. * Move and restate the Grönwall-based uniqueness theorems from `Gronwall.lean` using `IsIntegralCurveOn` with half-open intervals (`Ico`/`Ioc`) instead of `HasDerivWithinAt … (Ici t)`/`HasDerivWithinAt … (Iic t)`. * Rename uniqueness theorems to use dot notation on the integral curve types (e.g. `ODE_solution_unique_of_mem_Icc_right` becomes `IsIntegralCurveOn.eqOn_Icc_right`). * Add `IsIntegralCurveOn.eqOn_inter`: if two integral curves on preconnected sets `I` and `J` agree at a point in both sets, they agree on `I ∩ J`. * Add deprecation aliases for all renamed lemmas. - [ ] depends on: #29186 --- [](https://gitpod.io/from-referrer/) | t-analysis merge-conflict | 421/308 | Mathlib.lean,Mathlib/Analysis/ODE/ExistUnique.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,docs/1000.yaml,docs/undergrad.yaml | 7 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mcdoll'] | sgouezel | 1 day ago | 1 day ago | 32 days |
| 36740 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `AlgebraicGeometry.Scheme.isBasis_affineOpens`: unchanged 🎉 * `SimpleGraph.Walk.takeUntil_eq_take`: 263 ms before, 180 ms after 🎉 * `SimpleGraph.Walk.dropUntil_eq_drop`: 382 ms before, 261 ms after 🎉 * `Int.image_Ico_emod`: unchanged 🎉 * `Equiv.Perm.ofSubtype_swap_eq`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 7/33 | Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Data/Int/Interval.lean,Mathlib/GroupTheory/Perm/Support.lean | 4 | 8 | ['artie2000', 'chenson2018', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 43 days |
| 37553 | grunweg | chore: golf using .ne and friends | ne_of_gt -> .ne' ne_of_lt -> .ne le_of_lt -> .le Drive-by golfs using gcongr and positivity and been split into separate PRs. --- - [x] depends on: #37462 - [x] depends on: #37715 - [x] depends on: #37554 - [x] depends on: #37845 [](https://gitpod.io/from-referrer/) | merge-conflict | 254/269 | Archive/Imo/Imo1981Q3.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Counterexamples/TopologistsSineCurve.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Finite.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Interval/Set/Instances.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/QuadraticDiscriminant.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/DerivativeTest.lean,Mathlib/Analysis/Calculus/FDeriv/Extend.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Defs.lean,Mathlib/Analysis/Calculus/LHopital.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/Convex/Caratheodory.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/Radon.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Subspace.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/MellinInversion.lean,Mathlib/Analysis/MellinTransform.lean,Mathlib/Analysis/Normed/Field/Approximation.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/Analysis/Normed/Unbundled/IsPowMulFaithful.lean,Mathlib/Analysis/Normed/Unbundled/SmoothingSeminorm.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Analysis/Oscillation.lean,Mathlib/Analysis/Real/Hyperreal.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/IntegralRepresentation.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/PolarCoord.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Int/Interval.lean,Mathlib/Data/Int/ModEq.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Log.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Real/ConjExponents.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/Dynamics/Ergodic/AddCircle.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/MeasureTheory/Covering/LiminfLimsup.lean,Mathlib/MeasureTheory/Integral/Gamma.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/MeasureTheory/Measure/RegularityCompacts.lean,Mathlib/MeasureTheory/OuterMeasure/Caratheodory.lean,Mathlib/NumberTheory/Harmonic/ZetaAsymp.lean,Mathlib/NumberTheory/PythagoreanTriples.lean | 92 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 6 days |
| 37603 | Parcly-Taxel | refactor: review of `SetSemiring` | * Rename `Set.up` and `SetSemiring.down` to `SetSemiring.ofSet` and `SetSemiring.toSet` respectively. Unprotect both and make them equivalences, following `FreeMonoid`. * Derive `CompleteAtomicBooleanAlgebra` for `SetSemiring` immediately. * Add `imageHom_id` and `imageHom_comp`. The three existing lemmas about `imageHom` are coalesced into `imageHom_apply`. Ultimately inspired by https://github.com/leanprover-community/mathlib4/pull/36934#issuecomment-4183475568. | maintainer-merge merge-conflict | 120/165 | Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Data/Set/Semiring.lean | 2 | 42 | ['Parcly-Taxel', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'sgouezel'] | nobody | 1 day ago | 1 day ago | 22 days |
| 38194 | ryanncode | feat(LinearAlgebra/BilinearForm): add indefinite metrics | Add the `IndefiniteMetric` structure to support vector spaces equipped with a non-degenerate, symmetric, indefinite bilinear form. Provide the algebraic foundation for indefinite inner product spaces by formalizing the metric via `LinearMap.BilinForm` and extracting its associated quadratic form without enforcing the `IsPosSemidef` typeclass. Previously, mathlib required strictly positive-definite metrics to instantiate inner product spaces (`InnerProductSpace`), which prevented the formalization of indefinite geometries without causing typeclass inference failures. Bridge this gap by isolating the symmetric bilinear form from topological and positivity constraints, allowing the library to handle generalized indefinite metric spaces safely. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor merge-conflict | 47/0 | Mathlib.lean,Mathlib/LinearAlgebra/BilinearForm/IndefiniteMetric.lean | 2 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 11 days |
| 38328 | astrainfinita | feat: `OrderSupSet` | This PR introduces `OrderSupSet` and `OrderInfSet`, which are typeclasses expressing that `sSup` (resp., `sInf`) returns the least upper bound (resp., the greatest lower bound) of a set whenever one exists. This allows us to prove properties about the `sSup` of specific sets (such as `∅`, singletons, finite sets, and `univ`) without any typeclasses asserting the existence of LUBs. For example, `sSup ∅ = ⊥` holds for any type equipped with `OrderBot` `OrderSupSet`, no longer requiring typeclasses like `ConditionallyCompleteLinearOrderBot`. For a general set `s`, this gives a uniform way to extend results about `IsLUB s a → motive a` to `motive (sSup s)`, `motive (⨆ i, f i)`, `motive (a ⊔ b)`, etc., which allows proof reuse for basic API such as [`csSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/ConditionallyCompleteLattice/Basic.html#csSup_insert), [`iSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/CompleteLattice/Basic.html#iSup_insert), and [`sSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/CompleteLattice/Basic.html#sSup_insert) and downstream code like [`csSup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.html#csSup_add), [`sSup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.html#sSup_add), and [`sup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Lattice.html#sup_add). Furthermore, this allows us to refactor incrementally, reducing the dependency of results about various completeness typeclasses on the specific implementation of `sSup`. --- [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F) [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 156/73 | Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Bounds/Defs.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/SetNotation.lean,Mathlib/Topology/UniformSpace/OfCompactT2.lean | 7 | 16 | ['JovanGerb', 'astrainfinita', 'b-mehta', 'github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'openendings', 'vihdzp'] | nobody | 1 day ago | 1 day ago | 5 days |
| 38329 | jcommelin | chore: tighten down public/exposed API of AlgebraicClosure | This PR tightens down the API of AlgebraicClosure, by making few parts of FieldTheory/IsAlgClosed/AlgebraicClosure.lean public and/or exposed. We still need to expose the main definition. It would be great if we can unexpose it in the future. --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 73/53 | Mathlib/Algebra/Lie/TraceForm.lean,Mathlib/FieldTheory/AxGrothendieck.lean,Mathlib/FieldTheory/Differential/Liouville.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/ModelTheory/Algebra/Field/IsAlgClosed.lean,Mathlib/RingTheory/Discriminant.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Norm/Transitivity.lean,Mathlib/RingTheory/Trace/Basic.lean | 9 | 26 | ['eric-wieser', 'github-actions', 'jcommelin', 'kbuzzard', 'leanprover-radar', 'mathlib-merge-conflicts', 'plp127', 'riccardobrasca'] | nobody | 1 day ago | 1 day ago | 7 days |
| 35394 | HugLycan | feat(Tactic/Positivity): make positivity work for types that are not partial orders | Make positivity work for types that are not partial orders Most PositivityExt haven't been updated for non partial order cases yet. They will be updated in the later PR. `Strictness` now does not depend `Q(PartialOrder $α)`, and the constructors of `Strictness` now have their order typeclass arguments. In order to help `Qq` synth instances property, we have to move `assertInstancesCommute` to inner branch, manually add `haveI'` or explicitly pass the order typeclass instance into `.positive`/`.nonnegative`. --- [](https://gitpod.io/from-referrer/) | new-contributor t-meta merge-conflict | 732/357 | Mathlib/Algebra/Order/AbsoluteValue/Basic.lean,Mathlib/Algebra/Order/Algebra.lean,Mathlib/Algebra/Order/BigOperators/Expect.lean,Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Field/Power.lean,Mathlib/Algebra/Order/Floor/Extended.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Module/Field.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/Order.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/SpecialFunctions/Bernstein.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/DerivHyp.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Bound.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Removal.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Real.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Factorial/DoubleFactorial.lean,Mathlib/Data/Nat/Totient.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/Geometry/Euclidean/Altitude.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Measure/Real.lean,Mathlib/NumberTheory/ArithmeticFunction/Misc.lean,Mathlib/NumberTheory/ArithmeticFunction/Zeta.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/Height/NumberField.lean,Mathlib/NumberTheory/Height/Projectivization.lean,Mathlib/NumberTheory/LucasLehmer.lean,Mathlib/NumberTheory/SelbergSieve.lean,Mathlib/Tactic/Positivity/Basic.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Tactic/Positivity/Finset.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean,MathlibTest/positivity.lean | 54 | 66 | ['HugLycan', 'JovanGerb', 'fpvandoorn', 'github-actions', 'joneugster', 'leanprover-radar', 'mathlib-merge-conflicts'] | dwrensha | 1 day ago | 1 day ago | 41 days |
| 37819 | YellPika | feat(Order/OmegaCompletePartialOrder): add `OmegaCompletePartialOrder` instance for `WithBot` with basic `ωScottContinuous` lemmas | This is a modification of #34093. See #34093 for details. --- - [x] depends on: #33941 - [x] depends on: #37258 [](https://gitpod.io/from-referrer/) | new-contributor t-order merge-conflict | 337/10 | Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/TypeTags.lean,Mathlib/Order/WithBot.lean | 6 | 5 | ['Komyyy', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | Komyyy | 14 hours ago | 14 hours ago | 22 days |
| 36103 | SnkXyx | feat(Algebra/MvPolynomial/CharacteristicSet): add Characteristic Set | This PR adds some definitions and theorems of Characteristic Set Method (also known as Wu's Method). Definitions: * `MvPolynomial.mainDegree` * `MvPolynomial.initialOf` * `MvPolynomial.reducedTo` * `TriangulatedSet` * `MvPolynomial.pseudo` * `MvPolynomial.setPseudo` * `MvPolynomial.isRemainder` * `MvPolynomial.isSetRemainder` * `AscendingSetTheory` * `TriangulatedSet.isAscendingSet` * `HasBasicSet` * `TriangulatedSet.isCharacteristicSet` * `MvPolynomial.List.characteristicSet` * `MvPolynomial.List.zeroDecomposition` Main Theorems: * `MvPolynomial.initialOf_mul_eq`: $init_i(p \cdot q) = init_i(p) \cdot init_i(q)$ if there is no zero divisors in the coefficient ring. * `TriangulatedSet.instWellFoundedLT`: The set of Triangulated Sets is well-founded under the lexicographic ordering. * `MvPolynomial.pseudo_remainder_isRemainder`: The remainder $r$ of $g$ by $f$ is reduced with respect to $f$ and satisfies $init(f)^s \cdot g = q \cdot f + r$ for some $s \in \mathbb{N}$ and $q \in R[X_{\sigma}]$. * `MvPolynomial.setPseudo_remainder_isSetRemainder`: The remainder $r$ of $g$ by a set $S$ is reduced with respect to $S$ and satisfies $(\prod S_i^{e_i}) \cdot g = \sum q_i \cdot S_i + r$ for some sequences $\{e_i\}$ and $\{q_i\}$. * `MvPolynomial.setPseudo_remainder_eq_zero_of_mem`: The remainder of $p$ by a set $S$ is $0$ if $p \in S$. * `MvPolynomial.List.basicSet_append_lt_of_exists_reducedToSet`: Appending an element which is reduced w.r.t. the basic set of list strictly decreases the order. * `MvPolynomial.List.characteristicSet_isCharacteristicSet`: The computed Characteristic Set $CS$ satisfies the key algebraic property (pseudo-remainder of input polynomials is 0) and the geometric property ( $Zero(PS) \subseteq Zero(CS)$ ). * `MvPolynomial.List.vanishingSet_eq_zeroDecomposition_union`: The zero set of a polynomial system $PS$ can be decomposed into a finite union of "quasi-varieties" defined by triangular sets: $Zero(PS) = \bigcup_{CS \in \mathcal{ZD}} Zero(CS / \text{InitialProd}(CS))$ The PR is upstreamized from [github.com/WuProver/lean_characteristic_set](https://github.com/WuProver/lean_characteristic_set) --- [](https://gitpod.io/from-referrer/) - [x] depends on: #36386 - [ ] depends on: #37791 | t-algebra new-contributor merge-conflict | 3878/0 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/AscendingSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/CharacteristicSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/Initial.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/MainDegree.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/Order.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/PseudoDivision.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/Reduce.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/StandardAscendingSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/TriangularSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/WeakAscendingSet.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,docs/references.bib | 13 | 20 | ['Hagb', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 8 hours ago | 8 hours ago | 3 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 14563 | awueth | feat: if-then-else of exclusive or statement | --- If `¬(P ∧ Q)` then `ite (P ∨ Q) a 1 = (ite P a 1) * (ite Q a 1)` [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 5/0 | Mathlib/Algebra/Group/Basic.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'kim-em'] | nobody | 1 year ago | 654 days ago | 6 days |
| 12751 | Command-Master | feat: add lemmas for Nat/Bits, Nat/Bitwise and Nat/Size | Remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 66/7 | Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Size.lean | 4 | 26 | ['Command-Master', 'Rida-Hamadani', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 655 days ago | 56 days |
| 15121 | Eloitor | feat: iff theorems for IsSplitEpi and IsSplitMono in opposite category | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-category-theory new-contributor | 40/0 | Mathlib/CategoryTheory/EpiMono.lean | 1 | 3 | ['github-actions', 'joelriou', 'mattrobball'] | nobody | 1 year ago | 638 days ago | 7 days |
| 14242 | js2357 | feat: Prove equivalence of `isDedekindDomain` and `isDedekindDomainDvr` | Prove that `isDedekindDomainDvr` is equivalent to both `isDedekindDomain` and `isDedekindDomainInv`. Specifically, prove `isDedekindDomainDvr A → isDedekindDomainInv A`, because `isDedekindDomain A → isDedekindDomainDvr A` and `IsDedekindDomain A ↔ IsDedekindDomainInv A` are already in Mathlib. - [x] depends on: #14099 - [x] depends on: #14216 - [ ] depends on: #14237 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR new-contributor | 269/1 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean,Mathlib/RingTheory/Localization/Basic.lean | 4 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 671 days ago | 4 minutes |
| 16887 | metinersin | feat(ModelTheory/Complexity): define conjunctive and disjunctive formulas | Defines `FirstOrder.Language.BoundedFormula.IsConjunctive` and `FirstOrder.Language.BoundedFormula.IsDisjunctive`. --- - [ ] depends on: #16885 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 300/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 21 minutes |
| 16888 | metinersin | feat(ModelTheory/Complexity): Define conjunctive and disjunctive normal forms | Define `FirstOrder.Language.BoundedFormula.IsDNF` and `FirstOrder.Language.BoundedFormula.IsCNF`. --- - [ ] depends on: #16887 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 415/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 17 minutes |
| 16889 | metinersin | feat(ModelTheory/Complexity): Normal forms | Defines `FirstOrder.Language.BoundedFormula.toDNF` and `FirstOrder.Language.BoundedFormula.toCNF` - given a quantifier-free formula, these construct a semantically equivalent formula in disjunctive normal form and conjunctive normal form, respectively. --- - [ ] depends on: #16888 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 525/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 10 minutes |
| 14619 | Command-Master | chore: Merge `Trunc` to `Squash` | Remove `Trunc` and use `Squash` instead --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP new-contributor | 197/211 | Mathlib/CategoryTheory/EpiMono.lean,Mathlib/CategoryTheory/Preadditive/Biproducts.lean,Mathlib/Data/DFinsupp/Basic.lean,Mathlib/Data/Fintype/Basic.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Data/Fintype/Option.lean,Mathlib/Data/Fintype/Perm.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Semiquot.lean,Mathlib/GroupTheory/Perm/Cycle/Factors.lean,Mathlib/GroupTheory/Perm/Sign.lean,Mathlib/Logic/Equiv/List.lean | 13 | 3 | ['Command-Master', 'github-actions', 'vihdzp'] | nobody | 1 year ago | unknown | 0 seconds |
| 12750 | Command-Master | feat: define Gray code | --- Define binary reflected gray code, both as a permutation of `Nat` and as a permutation of `BitVec n`, and prove some theorems about them. Additionally, remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. - [ ] depends on: #12751 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-data new-contributor merge-conflict awaiting-author | 226/0 | Mathlib.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/GrayCode.lean,Mathlib/Data/Nat/Size.lean | 5 | 5 | ['Rida-Hamadani', 'alreadydone', 'github-actions', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 707 days ago | 16 days |
| 14598 | Command-Master | chore: add typeclasses to unify various `add_top`, `add_eq_top`, etc. | Add the four typeclasses `IsTopAbsorbing`, `IsBotAbsorbing`, `NoTopSum`, `NoBotSum`, as additive equivalents for `MulZeroClass` and `NoZeroDivisors`. Add instances of these for `ENNReal`, `WithTop α`, `WithBot α`, `PUnit`, `EReal`, `PartENat`, `Measure`, `Interval` and `Filter`. Also split `Algebra/Order/AddGroupWithTop` to `Algebra/Order/Group/WithTop` and `Algebra/Order/Monoid/WithTop` --- Previous usages of lemmas with quantified names like `WithTop.add_top` have to be changed to just `add_top`. `add_lt_top` is `@[simp]`, in accordance with `ENNReal.add_lt_top` being `@[simp]`. This affects `WithTop.add_lt_top` which previously hadn't been `@[simp]`. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-order new-contributor | 264/195 | Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib.lean,Mathlib/Algebra/Order/Group/WithTop.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/PUnitInstances/Order.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Analytic/Meromorphic.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/NormedSpace/ENorm.lean,Mathlib/Analysis/SpecialFunctions/JapaneseBracket.lean,Mathlib/Analysis/SpecialFunctions/Log/ENNRealLog.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Nat/WithBot.lean,Mathlib/Data/Real/EReal.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Decomposition/Lebesgue.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL1.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSpace.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/Bochner.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean,Mathlib/MeasureTheory/Integral/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Martingale/Convergence.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean,Mathlib/RingTheory/UniqueFactorizationDomain.lean,Mathlib/Topology/EMetricSpace/Defs.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,Mathlib/Topology/MetricSpace/Lipschitz.lean | 57 | 30 | ['Command-Master', 'YaelDillies', 'github-actions'] | nobody | 1 year ago | 541 days ago | 7 days |
| 16885 | metinersin | feat(ModelTheory/Complexity): define literals | Defines `FirstOrder.Language.BoundedFormula.IsLiteral` and `FirstOrder.Language.BoundedFormula.simpleNot` - an auxiliary operation that takes the negation of a formula and does some simplification. --- - [x] depends on: #16800 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-logic | 148/5 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 4 | 20 | ['YaelDillies', 'awainverse', 'github-actions', 'mathlib4-dependent-issues-bot', 'metinersin'] | nobody | 1 year ago | 574 days ago | 5 hours |
| 13248 | hcWang942 | feat: basic concepts of auction theory | ## Description
Formalise some core concepts and results in auction theory: this includes definitions for first-price and second-price auctions, as well as several fundamental results and helping lemmas.
This is the very first PR of the project formalizing core concepts and results in auction theory.
Our group is working on more contributions on the formalization of game theory prefix.
Co-authored-by: Ma Jiajun |
merge-conflict awaiting-author new-contributor t-logic | 204/0 | Mathlib.lean,Mathlib/GameTheory/Auction/Basic.lean,docs/references.bib | 3 | 148 | ['Shreyas4991', 'YaelDillies', 'eric-wieser', 'faenuccio', 'github-actions', 'grunweg', 'hcWang942', 'tb65536', 'urkud', 'vihdzp'] | hcWang942 | 1 year ago | 548 days ago | 109 days |
| 19125 | yhtq | feat: add theorems to transfer `IsGalois` between pairs of fraction rings | feat: add theorems to transfer `IsGalois` between pairs of fraction rings. - [x] depends on: #18404 - [x] depends on: #19124 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra new-contributor | 121/0 | Mathlib.lean,Mathlib/FieldTheory/Galois/IsFractionRing.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'tb65536'] | nobody | 1 year ago | 531 days ago | 33 minutes |
| 17739 | Aaron1011 | feat(Topology/Order/DenselyOrdered): prove Not (IsOpen) for intervals | Prove that Iic/Ici/Ioc/Ico/Icc intervals are not open in densely ordered topologies with no min/max element --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology new-contributor | 27/0 | Mathlib/Topology/Order/DenselyOrdered.lean | 1 | 8 | ['github-actions', 'vihdzp'] | nobody | 1 year ago | 563 days ago | 1 hour |
| 15711 | znssong | feat(Combinatorics/SimpleGraph): Some lemmas about walk, cycle and Hamiltonian cycle | --- These lemmas are separated from the `meow-sister/BondyChvatal` branch and will be needed for the proof of the Bondy-Chvátal theorem. - [x] depends on: #15536 - [x] depends on: #16294 | merge-conflict awaiting-author t-combinatorics new-contributor | 407/3 | Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Combinatorics/SimpleGraph/Walk.lean | 4 | 22 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'mathlib4-dependent-issues-bot', 'znssong'] | nobody | 1 year ago | 591 days ago | 9 days |
| 18629 | tomaz1502 | feat(Computability.Timed): Formalization of runtime complexity of List.merge | This PR adds the formalization of the runtime complexity of the merge function, defined in `Data/List/Sort`. Requires: https://github.com/leanprover-community/mathlib4/pull/15450 References: - Previous PR on mathlib3: https://github.com/leanprover-community/mathlib3/pull/14494/ - First discussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/BSc.20Final.20Project/near/220647062 - Second disussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Formalization.20of.20Runtime.20Complexity.20of.20Sorting.20Algorithms/near/284184450 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author new-contributor | 186/0 | Mathlib.lean,Mathlib/Computability/Timed/InsertionSort.lean,Mathlib/Computability/Timed/Merge.lean | 3 | 2 | ['github-actions', 'trivial1711'] | nobody | 1 year ago | 509 days ago | 33 days |
| 18461 | hannahfechtner | feat: left and right common multiples mixins | add mixins for left and right common multiples. These carry the data of what factors are used to create the common multiples --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 78/0 | Mathlib/Algebra/Group/Defs.lean | 1 | 13 | ['github-actions', 'hannahfechtner', 'jcommelin', 'kbuzzard', 'kim-em', 'trivial1711'] | nobody | 1 year ago | 466 days ago | 69 days |
| 19291 | PieterCuijpers | feat(Algebra/Order/Hom): add quantale homomorphism | Definition of quantale homomorphisms as functions that are both semigroup homomorphisms and complete lattice homomorphisms. --- - [x] depends on: #19810 - [x] depends on: #19811 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 209/0 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Quantale.lean,scripts/noshake.json | 3 | 29 | ['PieterCuijpers', 'YaelDillies', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 470 days ago | 27 days |
| 20372 | jvlmdr | feat(MeasureTheory/Function): Add ContinuousLinearMap.bilinearCompLp(L) | Introduce ContinuousLinearMap.bilinearCompLp and bilinearCompLpL. Generalize eLpNorm_le_eLpNorm_mul_eLpNorm theorems to include constant C in bound condition. --- Expect this may be useful for defining tempered distributions from functions in `L^p`. The definitions more or less follow `ContinuousLinearMap.compLp...`. Names are loosely analogous to `ContinuousLinearMap.bilinearComp` and `SchwartzMap.bilinLeftCLM`. Note: I preferred the spelling `hpqr : p⁻¹ + q⁻¹ = r⁻¹` with `f` in `L^p` and `g` in `L^q` to `hpqr : 1 / p = 1 / q + 1 / r`. It's easier to obtain from `ENNReal.IsConjExponent` too. A few questions: - [ ] I defined `bilinear{Left,Right}LpL` in addition to `bilinearCompLpL` because `LinearMap.mkContinuous₂` is marked as `noncomputable` and `LinearMap.mkContinuous` is not. Is this worth the extra definitions? (Note: This is not visible in the source due to `noncomputable section`.) - [ ] Should I use `C : ℝ` instead of `C : NNReal` for `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'`? - [ ] Is it going to be painful to have `[Fact (1 ≤ p)] [Fact (1 ≤ q)] [Fact (1 ≤ r)]`? I don't think there's a way to avoid it though. Maybe providing specialized versions for `p.IsConjExponent q` with `L^1`? Naming: - [ ] Is it satisfactory to add a `'` to the `eLpNorm_le_eLpNorm_mul_eLpNorm ` definitions in `CompareExp.lean` where `≤ ‖f x‖ * ‖g x‖` has been replaced with `≤ C * ‖f x‖ * ‖g x‖`? These could replace the existing theorems, although I don't want to break backwards compatibility. There are 5 instances: `eLpNorm_le_eLpNorm_top_mul_eLpNorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm_top'`, `eLpNorm'_le_eLpNorm'_mul_eLpNorm''`, `eLpNorm_le_eLpNorm_mul_eLpNorm_of_nnnorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'` (I'm not sure why the existing theorem `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm` has an internal `'`) - [ ] Is `bilinearLeftLpL` a suitable name? Other options: `bilinearCompLpLeftL`, `bilinearCompLeftLpL`, `bilinLeftLpL` (analogous to `SchwartzMap.bilinLeftCLM`) [](https://gitpod.io/from-referrer/) | merge-conflict t-measure-probability new-contributor | 203/40 | Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSpace.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 458 days ago | 27 days |
| 20248 | peabrainiac | feat(Topology/Compactness): first-countable locally path-connected spaces are delta-generated | Shows that all first-countable locally path-connected spaces are delta-generated (so in particular all normed spaces and convex subsets thereof are), and that delta-generated spaces are equivalently generated by the unit interval or standard simplices. --- - [ ] depends on: #21616 In principle, this should be close to all that's required to show that all simplicial complexes and CW-complexes are delta-generated; I just haven't done it yet because I'm not sure which file to best do it in. [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import new-contributor merge-conflict awaiting-author t-topology | 1189/813 | Mathlib.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean,Mathlib/Topology/Compactness/DeltaGeneratedSpace.lean,Mathlib/Topology/Connected/LocPathConnected.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/Homotopy/HSpaces.lean,Mathlib/Topology/Path.lean | 9 | 22 | ['YaelDillies', 'github-actions', 'kbuzzard', 'mathlib4-dependent-issues-bot', 'peabrainiac'] | nobody | 1 year ago | 452 days ago | 39 days |
| 19943 | AlexLoitzl | feat(Computability): Add Chomsky Normal Form Grammar and translation | - Define Chomsky normal form grammars - Add language-preserving translation between context-free grammars and Chomsky normal form grammars Co-authored-by: Martin Dvorak martin.dvorak@matfyz.cz --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author new-contributor | 3151/0 | Mathlib.lean,Mathlib/Computability/ChomskyNormalForm/Basic.lean,Mathlib/Computability/ChomskyNormalForm/EmptyElimination.lean,Mathlib/Computability/ChomskyNormalForm/LengthRestriction.lean,Mathlib/Computability/ChomskyNormalForm/TerminalRestriction.lean,Mathlib/Computability/ChomskyNormalForm/Translation.lean,Mathlib/Computability/ChomskyNormalForm/UnitElimination.lean,Mathlib/Computability/ContextFreeGrammar.lean | 8 | 59 | ['AlexLoitzl', 'YaelDillies', 'github-actions', 'kim-em', 'madvorak'] | nobody | 1 year ago | 448 days ago | 37 days |
| 21501 | sksgurdldi | feat(List): add sum_zipWith_eq_finset_sum | ### **Description:** This PR adds the lemma `List.sum_zipWith_eq_finset_sum` to `Mathlib.Algebra.BigOperators.Group.Finset.Basic`. #### **Statement:** The sum of the `zipWith` operation on two lists equals the sum of applying the operation to corresponding elements of the two lists, indexed over the minimum of their lengths. #### **Formal Statement:** ```lean lemma sum_zipWith_eq_finset_sum [Inhabited α] [Inhabited β] [AddCommMonoid γ] {op : α → β → γ} (l : List α) (m : List β) : (List.zipWith op l m).sum = ∑ x ∈ (Finset.range (Nat.min l.length m.length)), op (l[x]!) (m[x]!) ``` #### **Remarks:** - This lemma provides a useful equivalence between `List.zipWith` and summation over a `Finset.range` indexed by `Nat.min l.length m.length`. - It can be helpful in algebraic manipulations involving list-based summations. #### **Dependencies:** No additional dependencies. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 43/0 | Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean | 1 | 1 | ['github-actions', 'j-loreaux'] | nobody | 1 year ago | 435 days ago | 13 days |
| 21959 | BGuillemet | feat(Topology/ContinuousMap): Stone-Weierstrass theorem for MvPolynomial | Add the subalgebra of multivariate polynomials and prove it separates points, on the same model as `ContinuousMap/Polynomial.lean`. Prove the Stone-Weierstrass theorem and some variations for multivariate polynomials. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology new-contributor | 285/1 | Mathlib.lean,Mathlib/Topology/ContinuousMap/MvPolynomial.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 422 days ago | 16 days |
| 15578 | znssong | feat(Function): Fixed points of function `f` with `f(x) >= x` | We added some lemmas of fixed points of function `f` with `f(x) >= x`, where `f : α → α` is a function on a finite type `α`. This will be needed in proof of Bondy-Chvátal theorem. --- See also branch `meow-sister/BondyChvatal`. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis new-contributor | 82/0 | Mathlib.lean,Mathlib/Dynamics/FixedPoints/Basic.lean,Mathlib/Dynamics/FixedPoints/Increasing.lean | 3 | 32 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'urkud', 'vihdzp', 'znssong'] | nobody | 1 year ago | 597 days ago | 29 days |
| 21018 | markimunro | feat(Data/Matrix): add file with key definitions and theorems about elementary row operations | Prove that each elementary row operation is equivalent to a multiplication by an elementary matrix, has another row operation which inverts it, and that each elementary matrix has a left inverse.
This is a very large PR and I understand it will take time. This is my first one and will likely have issues but I will be ready to answer questions/fix them as soon as possible.
Co-authored-by: Christopher Lynch |
t-data enhancement new-contributor merge-conflict awaiting-author | 1230/0 | Mathlib.lean,Mathlib/Data/Matrix/ElementaryRowOperations.lean,Mathlib/Data/Matrix/GaussianElimination.lean,Mathlib/Data/Matrix/GaussianEliminationOld,Mathlib/Data/Matrix/oldnames,et --hard 18533caba32,lean-toolchain | 7 | 17 | ['chrisflav', 'eric-wieser', 'github-actions', 'j-loreaux', 'markimunro'] | nobody | 1 year ago | 420 days ago | 23 days |
| 15212 | victorliu5296 | feat: Add fundamental theorem of calculus-2 for Banach spaces | add the Mean Value Theorem for Banach spaces to the library and include reference for the theorem statement This theorem states that if `f : X → Y` is differentiable along the line segment from `a` to `b`, then the change in `f` equals the integral of its derivative along this path. This extends the mean value theorem to Banach spaces. This can be used for the eventual proof of the Newton-Kantorovich theorem with 1 constant contained inside the added reference. Here is the discussion on Zulipchat: https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Contributing.20FTC-2.20for.20Banach.20spaces | t-measure-probability new-contributor merge-conflict awaiting-author t-analysis | 60/1 | Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | 1 | 3 | ['github-actions', 'hrmacbeth', 'victorliu5296'] | nobody | 1 year ago | 584 days ago | 51 days |
| 22308 | plp127 | feat (Analysis/Convex): Generalize `Convex` lemmas to `StarConvex` | This PR generalizes many lemmas assuming `Convex 𝕜 s` to assume `StarConvex 𝕜 0 s`. --- - [x] depends on: #22421 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis new-contributor | 30/18 | Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/GaugeRescale.lean,Mathlib/Analysis/Convex/Star.lean,Mathlib/Analysis/LocallyConvex/AbsConvexOpen.lean | 4 | 5 | ['Paul-Lez', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 21488 | imbrem | feat(CategoryTheory/Monoidal): premonoidal categories | Add support for premonoidal categories --- Still want to add support for: - Premonoidal braided/symmetric categories - The monoidal coherence theorem, which I've already ported in my `discretion` library - The `coherence` tactic, which should work fine for premonoidal categories too but wanted to get this in front of reviewers ASAP to make sure my general approach was alright [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory new-contributor | 900/361 | Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/End.lean,Mathlib/CategoryTheory/GradedObject/Monoidal.lean,Mathlib/CategoryTheory/Localization/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/CoherenceLemmas.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/CategoryTheory/Monoidal/End.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/FunctorCategory.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,MathlibTest/StringDiagram.lean | 21 | 9 | ['YaelDillies', 'github-actions', 'grunweg', 'imbrem', 'kim-em', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 387 days ago | 57 days |
| 20873 | vbeffara | feat(Topology/Covering): path lifting and homotopy lifting | This proves the existence and uniqueness of path and homotopy lifts through covering maps. --- I tried to separate as much of the proof as possible into separate PRs (which are already in Mathlib now), but the proof here relies on a monolithic construction of an explicit lift along a well-chosen subdivision, in `partial_lift`, with associated definitions. Only one standalone lean file added. An older WIP PR #10084 by Junyan Xu @alreadydone proves similar results using a very similar construction for path lifting, with a different argument to obtain continuity for homotopy lifting. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology new-contributor | 281/1 | Mathlib.lean,Mathlib/Topology/Covering/Basic.lean,Mathlib/Topology/Covering/Lift.lean | 3 | 9 | ['alreadydone', 'github-actions', 'grunweg', 'vbeffara'] | nobody | 1 year ago | 461 days ago | 5 days |
| 20313 | thefundamentaltheor3m | feat(Data/Complex/Exponential): prove some useful results about the complex exponential. | This PR proves two basic results about the complex exponential: * `abs_exp_mul_I (x : ℂ) : abs (Complex.exp (I * x)) = Real.exp (-x.im)` * `one_sub_rexp_re_le_abs_one_sub_cexp (x : ℂ) : 1 - Real.exp x.re ≤ Complex.abs (1 - Complex.exp x)` Both results were proved as part of the sphere packing project. There's a chance they're too specific for mathlib, but I thought they were worth PRing anyway. Would it also be a good idea to tag `abs_exp_mul_I` with `simp`? Feedback/suggestions welcome. Note: `one_sub_rexp_re_le_abs_one_sub_cexp` was proved by Bhavik Mehta @b-mehta --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis new-contributor | 167/141 | Mathlib.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/ERealExp.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev.lean,Mathlib/Data/Complex/Exponential/Defs.lean,Mathlib/Data/Complex/Exponential/Lemmas.lean,Mathlib/Data/Complex/ExponentialBounds.lean,Mathlib/Tactic/FunProp.lean,MathlibTest/Recall.lean,MathlibTest/positivity.lean | 10 | 12 | ['b-mehta', 'github-actions', 'kim-em', 'thefundamentaltheor3m', 'trivial1711'] | nobody | 1 year ago | 462 days ago | 8 days |
| 20730 | kuotsanhsu | feat(LinearAlgebra/Matrix/SchurTriangulation): prove Schur decomposition/triangulation | `Matrix.schur_triangulation` shows that a matrix over an algebraically closed field is unitarily similar to an upper triangular matrix --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 317/2 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Block.lean,Mathlib/LinearAlgebra/Matrix/SchurTriangulation.lean,Mathlib/Logic/Equiv/Basic.lean | 4 | 14 | ['eric-wieser', 'github-actions', 'kim-em', 'kuotsanhsu'] | nobody | 1 year ago | 458 days ago | 13 days |
| 22809 | b-reinke | feat: Category algebras and path algebras | This PR defines the category algebra of a linear category and path algebras of quivers. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory new-contributor | 218/0 | Mathlib/Algebra/Ring/Assoc.lean,Mathlib/CategoryTheory/Linear/CategoryAlgebra.lean,Mathlib/Combinatorics/Quiver/PathAlgebra.lean,Mathlib/Data/DFinsupp/BigOperators.lean | 4 | 2 | ['b-reinke', 'github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 15654 | TpmKranz | feat(Computability): language-preserving maps between NFA and RE | Map REs to NFAs via Thompson's construction and NFAs to REs using GNFAs Last chunk of #12648 --- - [ ] depends on: #15651 - [ ] depends on: #15649 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-computability merge-conflict awaiting-zulip | 985/2 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Data/FinEnum/Option.lean,docs/references.bib | 7 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot', 'meithecatte'] | nobody | 11 months ago | 630 days ago | 2 minutes |
| 24008 | meithecatte | chore(EpsilonNFA): replace manual lemmas with @[simps] | --- [](https://gitpod.io/from-referrer/) | t-computability awaiting-author new-contributor | 2/24 | Mathlib/Computability/EpsilonNFA.lean | 1 | 2 | ['YaelDillies', 'github-actions', 'urkud'] | nobody | 11 months ago | 355 days ago | 27 days |
| 23349 | BGuillemet | feat: add LocallyLipschitzOn.lipschitzOnWith_of_isCompact and two small lemmas about Lipschitz functions | Main feat (in Mathlib/Topology/EMetricSpace/Basic.lean): if a function `f` from an extended pseudometric space to a pseudometric space is locally Lipschitz on a compact subset `s`, then `f` is Lipschitz on `s`. The theorem is true only when the codomain of `f` is a pseudometric space, so it needs imports from Mathlib/Topology/MetricSpace. Other small feat (in Mathlib/Analysis/Calculus/ContDiff/RCLike.lean): a function that is continuously differentiable on an open subset is locally Lipschitz on this subset. --- - [ ] depends on: #22890 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology large-import new-contributor | 59/4 | Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean | 2 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | PatrickMassot | 11 months ago | 339 days ago | 35 days |
| 12799 | jstoobysmith | feat(LinearAlgebra/UnitaryGroup): Add properties of Special Unitary Group | Add properties of the special unitary group, mirroring the properties of found in Algebra/Star/Unitary.lean. In particular, I add an instance of `specialUnitaryGroup` as a `Group`, `Star`, `InvolutiveStar`, and `StarMul`. --- [](https://gitpod.io/from-referrer/) | please-adopt t-algebra new-contributor merge-conflict awaiting-author | 78/0 | Mathlib/LinearAlgebra/UnitaryGroup.lean | 1 | 8 | ['chrisflav', 'jcommelin', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 712 days ago | 9 days |
| 20334 | miguelmarco | feat: allow polyrith to use a local Singular/Sage install | Try to call a local install of Singular (either standalone or inside Sage) to find the witness for polyrith before trying to call the online sage cell server. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-meta | 171/48 | Mathlib/Tactic/Polyrith.lean,scripts/polyrith_sage.py | 2 | 16 | ['eric-wieser', 'github-actions', 'hanwenzhu', 'kim-em', 'miguelmarco', 'mkoeppe'] | nobody | 10 months ago | 460 days ago | 27 days |
| 25218 | kckennylau | feat(AlgebraicGeometry): Tate normal form of elliptic curves | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry awaiting-zulip new-contributor | 291/26 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/IsomOfJ.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Modular/TateNormalForm.lean,Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 5 | 31 | ['MichaelStollBayreuth', 'Multramate', 'acmepjz', 'github-actions', 'grunweg', 'kckennylau', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 333 days ago | 6 days |
| 10190 | jstoobysmith | feat(AlgebraicTopology): add Augmented Simplex Category | - Added the definition of the category FinLinOrd of finite linear ordered sets. - Added the definition of the augmented simplex category `AugmentedSimplexCategory`, and showed it is the Skeleton of FinLinOrd. - Showed that the category of augmented simplicial objects defined as a comma category is equivalent to the category of functors from `AugmentedSimplexCategory^\op` --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP t-category-theory new-contributor merge-conflict | 720/0 | Mathlib.lean,Mathlib/AlgebraicTopology/AugmentedSimplexCategory.lean,Mathlib/AlgebraicTopology/SimplicialObject.lean,Mathlib/Order/Category/FinLinOrd.lean | 4 | 5 | ['TwoFX', 'YaelDillies', 'joelriou', 'jstoobysmith'] | nobody | 9 months ago | 811 days ago | 7 days |
| 25238 | Hagb | feat(Tactic/ComputeDegree): add support for scalar multiplication with different types | It would be able to deal with `a • (X : R[X])` where `a : S` is in a different type `S` with `[SMulZeroClass S R]`. --- - [x] depends on: #25237 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta new-contributor | 17/5 | Mathlib/Tactic/ComputeDegree.lean,MathlibTest/ComputeDegree.lean | 2 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 300 days ago | 38 days |
| 18646 | jxjwan | feat(RingTheory): isotypic components | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory new-contributor | 308/0 | Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/RingTheory/Isotypic.lean,Mathlib/RingTheory/SimpleModule.lean | 3 | 1 | ['github-actions'] | nobody | 8 months ago | 542 days ago | 26 minutes |
| 20671 | thefundamentaltheor3m | feat(Analysis/Asymptotics/SpecificAsymptotics): Proving that 𝛔ₖ(n) = O(nᵏ⁺¹) | This PR proves a result about the $\sigma_k(n)$ arithmetic function, namely, that it is $O\left(n^{k+1}\right)$. Main theorem: `theorem sigma_asymptotic (k : ℕ) : (fun n ↦ (σ k n : ℝ)) =O[atTop] (fun n ↦ (n ^ (k + 1) : ℝ))` This result was proved as part of the sphere packing project. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor large-import merge-conflict awaiting-author | 29/0 | Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean | 1 | 3 | ['b-mehta', 'github-actions', 'mathlib4-merge-conflict-bot'] | b-mehta | 8 months ago | 465 days ago | 9 days |
| 22925 | ggranberry | feat(Mathlib/PlaceHolder/ToeplitzHausdorff): Toeplitz-Hausdorff | --- [](https://gitpod.io/from-referrer/) | WIP new-contributor will-close-soon awaiting-author help-wanted t-analysis | 411/0 | Mathlib/PlaceHolder/ToeplitzHausdorff.lean,Mathlib/PlaceHolder/ToeplitzHausdorff_v2.lean | 2 | 11 | ['faenuccio', 'ggranberry', 'github-actions'] | faenuccio | 8 months ago | 409 days ago | 21 minutes |
| 20722 | ctchou | feat(Counterexamples): the Vitali set is non-measurable | --- [](https://gitpod.io/from-referrer/) | please-adopt t-measure-probability new-contributor merge-conflict awaiting-author | 258/3 | Counterexamples.lean,Counterexamples/VitaliSetNotMeasurable.lean,Mathlib/MeasureTheory/Measure/NullMeasurable.lean,docs/1000.yaml | 4 | 76 | ['ctchou', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'vihdzp'] | vihdzp | 8 months ago | 472 days ago | 13 hours |
| 28502 | gilesgshaw | feat(Logic/Basic): avoid unnecessary uses of choice | Certain proofs are modified to remove a dependence on the axoim of choice --- - [ ] depends on: #28623 | blocked-by-other-PR new-contributor merge-conflict awaiting-author t-logic | 83/74 | Mathlib/Logic/Basic.lean | 1 | 7 | ['Ruben-VandeVelde', 'eric-wieser', 'gilesgshaw', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 258 days ago | 9 hours |
| 19582 | yu-yama | feat(GroupExtension/Abelian): define `OfMulDistribMulAction.equivH2` | Mainly defines: - `structure GroupExtension.OfMulDistribMulAction N G [MulDistribMulAction G N]`: group extensions of `G` by `N` where the multiplicative action of `G` on `N` is the conjugation - `structure GroupExtension.OfMulDistribMulActionWithSection N G [MulDistribMulAction G N]`: group extensions with specific choices of sections - `def GroupExtension.OfMulDistribMulAction.equivH2`: a bijection between the equivalence classes of group extensions and $H^2 (G, N)$ --- - [x] depends on: #20802 (split PR: contains changes to the `Defs` file) - [x] depends on: #20998 (split PR: mainly adds the `Basic` file) - [ ] depends on: #26670 (split PR: adds the first part of the `Abelian` file) Here is a relevant TODO in Mathlib: https://github.com/leanprover-community/mathlib4/blob/4e9fa40d7c480937e09cd6e47a591bd6f3b8be42/Mathlib/RepresentationTheory/GroupCohomology/LowDegree.lean#L46-L48 I would appreciate your comments. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR new-contributor | 750/14 | Mathlib.lean,Mathlib/GroupTheory/GroupExtension/Abelian.lean,Mathlib/GroupTheory/GroupExtension/Defs.lean,docs/references.bib | 4 | 5 | ['YaelDillies', 'erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 475 days ago | 43 days |
| 27403 | MoritzBeroRoos | fix: replace probably erroneous usage of ⬝ (with old \cdot) by · (with \centerdot) | Discussion at [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.5Ccdot.20!.3D.20.5Ccenterdot). Currently the abbreviations \cdot and \centerdot resolve to different, with the naked eye nearly undistinguishable symbols (despite the c in cdot surely standing for center..). This pr replaces instances of ⬝ where · was probably meant. All of the replacement is in comments, except for the file bench_summary.lean which is used for priting the github benchmark results. Since this file is about scientific notation of numbers, sure · was meant to be used, not a rectangle. [Related](https://github.com/leanprover-community/mathlib4/pull/27399) --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor | 195/195 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/DirectSum/Idempotents.lean,Mathlib/Algebra/Lie/Derivation/Basic.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/Basic.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/Normed/Unbundled/InvariantExtension.lean,Mathlib/Analysis/SpecialFunctions/Complex/CircleAddChar.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Matrix/Block.lean,Mathlib/Data/Matrix/ConjTranspose.lean,Mathlib/Data/Matrix/Hadamard.lean,Mathlib/Data/Matrix/Mul.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/Data/Matrix/RowCol.lean,Mathlib/Data/Matrix/Vec.lean,Mathlib/FieldTheory/PurelyInseparable/PerfectClosure.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/LinearAlgebra/CrossProduct.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/DotProduct.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/Orthogonal.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/PerfectPairing/Matrix.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/NumberTheory/NumberField/ProductFormula.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean,Mathlib/SetTheory/Ordinal/Veblen.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Homeomorph/Lemmas.lean,Mathlib/Topology/Instances/Matrix.lean,scripts/bench_summary.lean | 49 | 5 | ['eric-wieser', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 274 days ago | 7 days |
| 27399 | MoritzBeroRoos | chore: replace every usage of ⬝ᵥ (with old \cdot) by ·ᵥ (with \centerdot) | Discussion at [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.5Ccdot.20!.3D.20.5Ccenterdot). Currently the abbreviations `\cdot` and `\centerdot` resolve to different, with the naked eye nearly undistinguishable symbols (despite the c in cdot surely standing for `center`..): - `\cdot` gives ⬝ [U+2B1D](https://www.compart.com/en/unicode/U+2B1D) "Black Very Small Square" - `\centerdot` gives · [U+00B7](https://www.compart.com/en/unicode/U+00B7) "Middle Dot" Mathlib mostly uses the `\centerdot` variant, except for the dotProduct notation and some probably unsuspecting people wanting \centerdot but getting \cdot in their comments and 6 uses of a notation using the raw `\cdot` without any subscript at `Mathlib\Topology\Homotopy\Product.lean`. This PR replaces the dot product `⬝ᵥ` with its `\centerdot` counterpart `·ᵥ`. The related PR [here](https://github.com/leanprover/vscode-lean4/pull/639) can then overwrite the `\cdot` abbreviation, to produce the same symbol as the `centerdot` abbreviation does. --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor | 133/133 | Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Matrix/Block.lean,Mathlib/Data/Matrix/ConjTranspose.lean,Mathlib/Data/Matrix/Hadamard.lean,Mathlib/Data/Matrix/Mul.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/Data/Matrix/RowCol.lean,Mathlib/Data/Matrix/Vec.lean,Mathlib/LinearAlgebra/CrossProduct.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/DotProduct.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/Orthogonal.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/PerfectPairing/Matrix.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/Topology/Instances/Matrix.lean | 25 | 6 | ['MoritzBeroRoos', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 274 days ago | 7 days |
| 27479 | iu-isgood | feat: Abel's Binomial Theorem | We have formalized Abel's Binomial Theorem as part of an REU project. There are a few remaining sorrys, but we will finish them soon. I will edit this PR message later according to community rules. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data new-contributor | 326/0 | Mathlib/Data/Nat/Choose/AbelBinomial.lean | 1 | 28 | ['ElifUskuplu', 'FrankieNC', 'github-actions', 'iu-isgood'] | nobody | 8 months ago | 280 days ago | 3 minutes |
| 26462 | PSchwahn | feat(LinearAlgebra/Projection): add results about inverse of `Submodule.prodEquivOfIsCompl` | Add two theorems `Submodule.prodEquivOfIsCompl_symm_apply` and `Submodule.prodEquivOfIsCompl_symm_add`, which are API for `Submodule.prodEquivOfIsCompl`. We believe these theorems are useful; for example, we have used their statements in a [classification formalization project](https://github.com/LieLean/LowDimSolvClassification). Co-authored by: - [Viviana del Barco](https://github.com/vdelbarc) - [Gustavo Infanti](https://github.com/GuQOliveira) - [Exequiel Rivas](https://github.com/erivas) --- I am not sure whether the `prodEquivOfIsCompl_symm_apply` theorem should be tagged with `@[simp]`; this might lead to confluence issues. Opinions are welcome! [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 10/0 | Mathlib/LinearAlgebra/Projection.lean | 1 | 7 | ['PSchwahn', 'github-actions', 'joelriou', 'kckennylau'] | joelriou | 7 months ago | 235 days ago | 73 days |
| 28623 | gilesgshaw | feat(Logic/Basic): minor additions and simplification of proofs | Add new theorems and simplify proofs. Specifically, we add the family of related theorems `apply_dite_iff_exists`, `apply_dite_iff_forall`, `apply_ite_iff_and` and `apply_ite_iff_or`. For each other 'family' of theorems in the file that is analogous to the above, we do the following - Simplify proofs where possible, e.g. by appealing to the new theorems - Complete the family, if any of the corresponding four are missing - Rename to ensure consistency with the above pattern --- | merge-conflict t-logic new-contributor | 83/55 | Archive/Examples/IfNormalization/Result.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Notation/Indicator.lean,Mathlib/LinearAlgebra/Matrix/Rank.lean,Mathlib/Logic/Basic.lean,Mathlib/MeasureTheory/Measure/WithDensity.lean,Mathlib/SetTheory/Ordinal/Notation.lean | 9 | 12 | ['eric-wieser', 'gilesgshaw', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | awainverse | 7 months ago | 234 days ago | 10 days |
| 25778 | thefundamentaltheor3m | feat: Monotonicity of `setIntegral` for nonnegative functions | This PR makes it easier to prove monotonicity of the Bochner integral on sets for nonnegative functions by removing the stronger assumption required by the general monotonicity lemma that both of the functions being compared must be integrable. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-measure-probability new-contributor | 8/0 | Mathlib/MeasureTheory/Integral/Bochner/Set.lean | 1 | 6 | ['RemyDegenne', 'github-actions', 'sgouezel', 'thefundamentaltheor3m'] | nobody | 7 months ago | 323 days ago | 3 hours |
| 29588 | Periecle | feat(Analysis/Complex/Residue): Implement residue theory for complex functions at isolated singularities | # Add basic residue theory for complex functions This PR introduces the residue theory implementation in mathlib. ## Main additions - **`HasIsolatedSingularityAt f c`**: Predicate for functions with isolated singularities at point `c` - **`residue f c hf`**: The residue of `f` at isolated singularity `c`, defined via circle integrals - **Radius independence**: `residue_eq_two_pi_I_inv_smul_circleIntegral` - residue equals normalized circle integral for any valid radius - **Holomorphic residues**: `residue_of_holomorphic` - functions holomorphic in a neighborhood have zero residue - **Simple pole formula**: `residue_simple_pole` - for `f(z) = (z-c)⁻¹ * g(z)`, residue equals `g(c)` ## Implementation notes - Builds on existing circle integral infrastructure in `CauchyIntegral.lean` - Uses `Classical.choose` to extract witness radius from isolated singularity condition - Comprehensive documentation with mathematical context and examples - Establishes foundation for residue theorem, argument principle, and other applications ## Examples included - `residue(1/z, 0) = 1` (canonical simple pole) - Radius independence demonstration - Zero residues for holomorphic functions This provides the essential building blocks for complex analysis and first step to formalize residue theory. | awaiting-author t-analysis new-contributor | 383/0 | Mathlib/Analysis/Complex/Residue/Basic.lean | 1 | 17 | ['Periecle', 'github-actions', 'hrmacbeth', 'llllvvuu', 'loefflerd'] | nobody | 7 months ago | 231 days ago | 24 minutes |
| 29657 | jcreinhold | feat(CategoryTheory/MarkovCategory): add Markov categories | This PR adds Markov categories to the category theory library. A Markov category is a symmetric monoidal category where every object has canonical copy and delete morphisms that form commutative comonoids. ## What this gives mathlib In a Markov category, morphisms model probabilistic processes. The copy morphism `X → X ⊗ X` creates perfect correlation (both outputs always equal). The delete morphism `X → I` marginalizes (sums/integrates out variables). This structure captures probability theory categorically. The same theorem proves results for: - Finite probability (stochastic matrices) - Measure theory (Markov kernels) - Kleisli categories of probability monads Fritz (2020) used this to prove categorical versions of Fisher-Neyman, Basu's theorem, and other core statistics results. ## Implementation - `MarkovCategory`: Extends `SymmetricCategory` with canonical comonoid structure - `copyMor X : X ⟶ X ⊗ X` and `delMor X : X ⟶ I` for each object - Coherence axioms: commutativity, counitality, coassociativity - Compatibility with tensor products Key design point: The comonoid structure is canonical (fields of the typeclass), not chosen. This matches the probability interpretation where there's exactly one way to copy/marginalize. ## Examples included 1. Cartesian categories: Every cartesian monoidal category forms a Markov category where copy is the diagonal `x ↦ (x,x)` and delete is the terminal morphism. All morphisms are deterministic. 2. FinStoch: Objects are finite types. Morphisms are stochastic matrices (rows sum to 1). This models finite probability spaces with the usual matrix multiplication for composition. ## Scope and review notes This PR provides the basic structure only. Future PRs would add: - Conditional independence - Sufficient statistics - Connection to measure-theoretic probability - More examples (Kleisli categories, Gaussian categories) I'm neither an expert in this material nor in Lean; I've only read a few papers on Markov categories and have gone through tutorial material in Lean. Please review for mathematical correctness and idiomatic Lean. I kept this PR small to check if mathlib wants this addition and to ensure it meets repository standards. ## Why add this now Markov categories provide a useful abstraction level for probability in type theory. Adding it to mathlib enables future work on categorical probability and statistics. In particular, I'm working on a probabilistic programming library and would like to write some proofs using these constructs. ## References - Fritz, T. (2020). [A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics](https://arxiv.org/abs/1908.07021). *Advances in Mathematics*, 370, 107239. - Cho, K., & Jacobs, B. (2019). [Disintegration and Bayesian inversion via string diagrams](https://arxiv.org/abs/1709.00322). *Mathematical Structures in Computer Science*, 29(7), 938-971. --- All definitions include docstrings. The PR has tests for the core functionality. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 2414/7 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Monad/Basic.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Basic.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Deterministic.lean,Mathlib/CategoryTheory/MarkovCategory/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/Cartesian.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Braided.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/CopyDiscard.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Markov.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Bimon_.lean,Mathlib/CategoryTheory/Monoidal/CommComon_.lean,Mathlib/CategoryTheory/Monoidal/Comon_.lean,MathlibTest/CategoryTheory/MarkovCategory.lean,docs/references.bib | 16 | 28 | ['github-actions', 'jcreinhold', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 223 days ago | 2 hours |
| 26178 | ppls-nd-prs | feat(CategoryTheory/Limits): Fubini for products | We show that the product of products is a product indexed by the sigma type. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 17/0 | Mathlib/CategoryTheory/Limits/Shapes/Products.lean | 1 | 6 | ['chrisflav', 'github-actions', 'leanprover-community-bot-assistant', 'ppls-nd-prs', 'robin-carlier'] | nobody | 7 months ago | 315 days ago | 13 hours |
| 28630 | Antidite | feat(Archive/Imo): right isosceles configuration in the complex plane | feat(Archive/Imo): right isosceles configuration in the complex plane This adds `Archive/Imo/Imo1975Q3.lean`, formalizing a triangle configuration with points A=0, B=1, C=z and auxiliary points R, P, Q built via complex rotations and sine-based scale factors. Main results: * `angle_and_distance`: ∠QRP = π/2 and dist Q R = dist R P. * Key identity `QRP_rot90`: (Q z).z − R.z = e^{iπ/2} · ((P z).z − R.z). Design/Style: * Minimal imports; module docstring; semantic lemma names; all definitions and theorems live under the namespace `IMO.TriangleConfig`. Moves: - (none) Deletions: - (none) --- [](https://gitpod.io/from-referrer/) | IMO awaiting-author new-contributor | 196/0 | Archive.lean,Archive/Imo/Imo1975Q3.lean | 2 | 36 | ['Antidite', 'LLaurance', 'github-actions', 'jsm28'] | jsm28 | 6 months ago | 208 days ago | 46 days |
| 29926 | jcreinhold | feat(CategoryTheory/MarkovCategory): add basic finite stochastic matrices definitions to Markov category | This PR introduces FinStoch, the category of finite stochastic matrices, as a concrete example of a Markov category. This PR builds on #29925, #29939, and #29919 and was split up from #29657. ## Main additions ### 1. Core definitions (`FinStoch/Basic.lean`) - `StochasticMatrix m n`: Matrices where rows sum to 1, representing conditional probabilities P(j|i) - `FinStoch`: The category with finite types as objects and stochastic matrices as morphisms - `DetMorphism`: Deterministic matrices (exactly one 1 per row) with their underlying functions - Composition: Matrix multiplication preserves row-stochasticity via the Chapman-Kolmogorov equation Key design choices: - Row-stochastic convention: entry (i,j) is P(output=j | input=i) - Deterministic morphisms tracked separately for structural isomorphisms ### 2. Monoidal structure (`FinStoch/Monoidal.lean`) Implements tensor products modeling independent parallel processes: - Tensor on objects: Cartesian product of finite types - Tensor on morphisms: Kronecker product P((j₁,j₂)|(i₁,i₂)) = P(j₁|i₁) × P(j₂|i₂) - Structural morphisms: Associator, unitors use deterministic permutations - Coherence**: Pentagon and triangle identities verified computationally ## Mathematical significance FinStoch provides the canonical example of a Markov category: - Morphisms: Stochastic matrices/Markov chains - Composition: Chapman-Kolmogorov equation for multi-step transitions - Tensor: Independent parallel processes This models finite probability spaces categorically, where: - Objects represent sample spaces - Morphisms represent probabilistic transitions - Tensor products model independence ## References Fritz (2020) - [ ] depends on: #29925 | merge-conflict t-category-theory new-contributor | 1437/0 | Mathlib.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Basic.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Deterministic.lean,Mathlib/CategoryTheory/MarkovCategory/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/Cartesian.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Monoidal.lean,MathlibTest/CategoryTheory/MarkovCategory.lean,docs/references.bib | 9 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 16773 | arulandu | feat(Probability/Distributions): formalize Beta distribution | Formalize Beta distribution, using Gamma distribution as a reference. Added real-valued beta wrapper, in the manner of gamma. Thanks to @EtienneC30 for help with casting real <-> complex. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability | 286/1 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean,Mathlib/Probability/Distributions/Beta.lean | 3 | 50 | ['EtienneC30', 'arulandu', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] | arulandu | 6 months ago | 593 days ago | 1 day |
| 30460 | janithamalith | feat(Nat): add lemma nat_card_orbit_mul_card_stabilizer_eq_card_group | Added a lemma `nat_card_orbit_mul_card_stabilizer_eq_card_group` which is the Nat.card version of MulAction.card_orbit_mul_card_stabilizer_eq_card_group --- [](https://gitpod.io/from-referrer/) | awaiting-author t-group-theory new-contributor | 6/0 | Mathlib/GroupTheory/GroupAction/CardCommute.lean | 1 | 17 | ['github-actions', 'kckennylau', 'plp127', 'tb65536'] | tb65536 | 6 months ago | 193 days ago | 8 days |
| 25225 | xcloudyunx | feat(Combinatorics/SimpleGraph): Eulerian walk in connected graph contains all vertices | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 16/0 | Mathlib/Combinatorics/SimpleGraph/Trails.lean | 1 | 6 | ['IvanRenison', 'github-actions', 'vlad902'] | kmill | 6 months ago | 191 days ago | 148 days |
| 30828 | DeVilhena-Paulo | feat: implementation of `Finmap.merge` | The main contribution of this pull request is the implementation of a `merge` function for finite maps (`Finmap`). The construction relies on the definition of a `merge` function for association lists (`AList`). There is also a side (unrelated) contribution on `Mathlib/Data/List/Permutation.lean`: the addition of a theorem about the permutation of a list with a head element (that is, a list of the form `a :: l`). --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 449/3 | Mathlib/Data/Finmap.lean,Mathlib/Data/List/AList.lean,Mathlib/Data/List/Permutation.lean,Mathlib/Data/List/Sigma.lean | 4 | 1 | ['github-actions'] | nobody | 6 months ago | 190 days ago | 1 minute |
| 28676 | sun123zxy | feat(NumberTheory/ArithmeticFunction): wrap `Nat.totient` as an `ArithmeticFunction` | This wraps the Euler's totient function `Nat.totient` into a new `ArithmeticFunction` `ϕ`, with some basic identities such as `ϕ * ζ = id` and `μ * id = ϕ.` --- We use the notation `ϕ` to distinguish from `Nat.totient`'s notation `φ`, however this might be controversial. Suggestions are welcome! [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor large-import merge-conflict awaiting-author | 45/5 | Mathlib/NumberTheory/ArithmeticFunction.lean | 1 | 19 | ['MichaelStollBayreuth', 'SnirBroshi', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'riccardobrasca', 'sun123zxy'] | MichaelStollBayreuth | 6 months ago | 201 days ago | 47 days |
| 30299 | franv314 | feat(Topology/Instances): Cantor set | Prove that the Cantor set has empty interior and the cardinality of the continuum as discussed on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/A.20few.20results.20about.20the.20Cantor.20set/with/543560670) Moves: - Mathlib.Topology.Instances.CantorSet -> Mathlib.Topology.Instances.CantorSet.Basic --- [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict file-removed awaiting-author t-topology | 355/2 | Mathlib.lean,Mathlib/Topology/Instances/CantorSet/Basic.lean,Mathlib/Topology/Instances/CantorSet/Cardinality.lean,Mathlib/Topology/Instances/CantorSet/Lemmas.lean | 4 | 5 | ['github-actions', 'grunweg', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 206 days ago | 40 minutes |
| 30303 | franv314 | chore(Topology/Instances): add deprecated module | Add deprecated module to moved Cantor set file. --- - [ ] depends on: #30299 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor | 486/124 | Mathlib.lean,Mathlib/Topology/Instances/CantorSet.lean,Mathlib/Topology/Instances/CantorSet/Basic.lean,Mathlib/Topology/Instances/CantorSet/Cardinality.lean,Mathlib/Topology/Instances/CantorSet/Lemmas.lean | 5 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 206 days ago | 5 minutes |
| 29871 | zach1502 | feat(Matrix/Transvection): Gauss pivot determinant identity and pivot preservation | This PR adds two lemmas formalizing standard Gaussian pivot identities: * `Matrix.Transvection.listTransvecCol_mul_mul_listTransvecRow_pivot`: After applying the canonical left/right transvection products that clear the last column and row, the pivot (bottom-right) entry of a matrix is unchanged. Marked `@[simp]`. * `Matrix.Transvection.det_eq_detTopLeft_mul_pivot`: If the pivot entry is nonzero, then the determinant of the matrix factors as the determinant of the top-left block times the pivot entry, after performing the canonical transvections. This is the usual Gauss–pivot determinant identity. * Added simple usage tests in `MathlibTest/matrix.lean` to check that the new lemmas are usable by `simp`/`simpa`. --- --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 94/0 | Mathlib/LinearAlgebra/Matrix/Transvection.lean,MathlibTest/matrix.lean | 2 | 3 | ['github-actions', 'riccardobrasca', 'zach1502'] | nobody | 5 months ago | 179 days ago | 41 days |
| 30158 | nicolaviolette | feat: combinatorics simplegraph basic | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 9/4 | Mathlib/Combinatorics/SimpleGraph/Basic.lean | 1 | 3 | ['b-mehta', 'github-actions'] | b-mehta | 5 months ago | 178 days ago | 31 days |
| 26901 | 5hv5hvnk | feat: a simproc version of `compute_degree` | Wrap `compute_degree` in a simproc for use by simp. Closes #22219. --- | awaiting-CI new-contributor merge-conflict awaiting-author t-meta | 198/0 | Mathlib.lean,Mathlib/Tactic/Simproc/PolynomialDegree.lean,MathlibTest/polynomial_degree_simproc.lean | 3 | 19 | ['5hv5hvnk', 'YaelDillies', 'adomani', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 297 days ago | 4 minutes |
| 30150 | imbrem | feat(CategoryTheory/Monoidal): to_additive for MonoidalCategory | Add `AddMonoidalCategory`, the additive version of `MonoidalCategory`. To get this to work, I needed to _remove_ the `to_additive` attributes in `Discrete.lean`, since existing code relies on the `AddMonoid M → MonoidalCategory M` instance. For now, we simply implement the additive variants by hand instead. --- As discussed in #28718; I added an `AddMonoidalCategory` struct and tagged `MonoidalCategory` with `to_additive`, along with the lemmas in `Category.lean`. I think this is the right approach, since under this framework the "correct" additive version of `Discrete.lean` would be mapping an `AddMonoid` to an `AddMonoidalCategory`. Next steps would be to: - Make `monoidal_coherence` and `coherence` support `AddMonoidalCategory` - Add `CocartesianMonoidalCategory` extending `AddMonoidalCategory` [](https://gitpod.io/from-referrer/) | t-category-theory large-import new-contributor merge-conflict awaiting-zulip t-meta | 444/125 | Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 3 | 22 | ['JovanGerb', 'YaelDillies', 'github-actions', 'imbrem', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 209 days ago | 1 day |
| 15651 | TpmKranz | feat(Computability/NFA): operations for Thompson's construction | Lays the groundwork for a proof of equivalence of RE and NFA, w.r.t. described language. Actual connection to REs comes later, after the groundwork for the opposite direction has been laid. Third chunk of #12648 --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 307/5 | Mathlib/Computability/NFA.lean | 1 | 27 | ['TpmKranz', 'YaelDillies', 'dupuisf', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 5 months ago | 584 days ago | 45 days |
| 15649 | TpmKranz | feat(Computability): introduce Generalised NFA as bridge to Regular Expression | Lays the groundwork for a proof of equivalence of NFA and RE, w.r.t. described language. Actual connection to NFA comes later, after the groundwork for the opposite direction has been laid. Second chunk of #12648 --- - [x] depends on: #15647 [Data.FinEnum.Option unchanged since then] [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 298/0 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/RegularExpressions.lean,docs/references.bib | 5 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'trivial1711'] | nobody | 5 months ago | 509 days ago | 23 days |
| 5919 | MithicSpirit | feat: implement orthogonality for AffineSubspace | Define `AffineSubspace.orthogonal` and `AffineSubspace.IsOrtho`, as well as develop an API emulating that of `Submodule.orthogonal` and `Submodule.IsOrtho`, respectively. Additionally, provide some relevant lemmas exclusive to affine subspaces, which are mostly to do with the relationship between orthogonality and `AffineSubspace.Parallel`. Closes #5539 --- Still WIP as I need to add more docstrings as well as notations for the new definitions. [](https://gitpod.io/from-referrer/) | WIP new-contributor merge-conflict help-wanted t-analysis | 287/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/AffineSubspace.lean | 2 | 7 | ['MithicSpirit', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | MithicSpirit | 5 months ago | 846 days ago | 7 minutes |
| 13442 | dignissimus | feat: mabel tactic for multiplicative abelian groups | Mabel tactic for multiplicative abelian groups (#10361) --- [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict modifies-tactic-syntax awaiting-author help-wanted t-meta | 439/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MAbel.lean,MathlibTest/mabel.lean | 4 | 11 | ['BoltonBailey', 'dignissimus', 'github-actions', 'joneugster', 'kbuzzard', 'mathlib4-merge-conflict-bot'] | joneugster | 5 months ago | 613 days ago | 16 seconds |
| 14237 | js2357 | feat: Define the localization of a fractional ideal at a prime ideal | Define the localization of a fractional ideal at a prime ideal, and prove some basic properties. --- This PR is part 3 out of 4 of a proof of `isDedekindDomain_iff_isDedekindDomainDvr`. Part 4 is available here: #14242 - [x] depends on: #14099 Part 1 - [x] depends on: #14216 Part 2 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 230/0 | Mathlib.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean,Mathlib/RingTheory/Localization/Basic.lean | 3 | 22 | ['Vierkantor', 'YaelDillies', 'github-actions', 'js2357', 'kbuzzard', 'leanprover-community-bot-assistant', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | Vierkantor | 5 months ago | 584 days ago | 26 days |
| 15224 | AnthonyBordg | feat(CategoryTheory/Sites): covering families and their associated Grothendieck topology | Define covering families on a category and their associated Grothendieck topology by using the API for `Coverage`. Give an explicit characterization of the covering sieves of the said topology. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 112/0 | Mathlib.lean,Mathlib/CategoryTheory/Sites/CoveringFamilies.lean | 2 | 21 | ['AnthonyBordg', 'adamtopaz', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 639 days ago | 1 day |
| 17587 | kmill | feat: Sym2-as-Finset theory | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 105/3 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/RingTheory/Polynomial/Vieta.lean | 4 | 11 | ['FordUniver', 'YaelDillies', 'github-actions', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 18630 | tomaz1502 | feat(Computability.Timed): Formalization of runtime complexity of List.mergeSort | This PR adds the formalization of the runtime complexity of the merge sort algorithm, defined in `Data/List/Sort`. Requires: https://github.com/leanprover-community/mathlib4/pull/15451 References: - Previous PR on mathlib3: https://github.com/leanprover-community/mathlib3/pull/14494/ - First discussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/BSc.20Final.20Project/near/220647062 - Second disussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Formalization.20of.20Runtime.20Complexity.20of.20Sorting.20Algorithms/near/284184450 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability new-contributor | 526/0 | Mathlib.lean,Mathlib/Computability/Timed/InsertionSort.lean,Mathlib/Computability/Timed/Merge.lean,Mathlib/Computability/Timed/MergeSort.lean,Mathlib/Computability/Timed/Split.lean | 5 | 9 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 542 days ago | 21 hours |
| 20648 | anthonyde | feat: formalize regular expression -> εNFA | The file `Computability/RegularExpressionsToEpsilonNFA.lean` contains a formal definition of Thompson's method for constructing an `εNFA` from a `RegularExpression` and a proof of its correctness. --- - [x] depends on: #20644 - [x] depends on: #20645 [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-zulip new-contributor | 490/0 | Mathlib.lean,Mathlib/Computability/RegularExpressionsToEpsilonNFA.lean,docs/references.bib | 3 | 7 | ['anthonyde', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'qawbecrdtey'] | nobody | 5 months ago | 360 days ago | 75 days |
| 21903 | yhtq | feat: add from/toList between `FreeSemigroup` and `List` with relative theorems | Add from/toList between `FreeSemigroup` and `List` with relative theorems, as well as an incidental definition of lexicographic order on `FreeSemigroup`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-CI large-import merge-conflict | 169/0 | Mathlib/Algebra/Free.lean | 1 | 12 | ['YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 390 days ago | 50 days |
| 22159 | shetzl | feat: add definition of pushdown automata | Add the definition of pushdown automata and their two acceptance conditions: acceptance based on empty stack and acceptance based on final state.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 70/0 | Mathlib.lean,Mathlib/Computability/PDA.lean | 2 | 35 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 5 months ago | 410 days ago | 20 days |
| 22302 | 658060 | feat: add `CategoryTheory.Topos.Power` | This is a continuation of #21281 with the end goal of defining topoi in Mathlib. It introduces the notion of a power object in a category with a subobject classifier, which is a special case of an internal hom. The definition `HasPowerObjects C` contained in this PR is all that remains before `IsTopos C` can be defined. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 312/0 | Mathlib.lean,Mathlib/CategoryTheory/Topos/Power.lean | 2 | 3 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | b-mehta | 5 months ago | 429 days ago | 25 minutes |
| 22790 | mhk119 | feat: Extend `taylor_mean_remainder_lagrange` to `x < x_0` | The `taylor_mean_remainder_lagrange` theorem has the assumption that $x_0 < x$. In many applications, we need $x < x_0$ and one cannot use the current version to obtain this (see [zulip](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Taylor's.20theorem)). This PR introduces a set of theorems that push negations through Taylor expansions so that one can extend `taylor_mean_remainder_lagrange` to the case when $x < x_0$. These theorems should also be useful elsewhere since they are quite general. | merge-conflict awaiting-author t-analysis new-contributor | 111/1 | Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/Calculus/Taylor.lean | 3 | 13 | ['Paul-Lez', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'mhk119'] | nobody | 5 months ago | 391 days ago | 23 days |
| 24333 | xcloudyunx | feat(Combinatorics/SimpleGraph): cycle graph implementation for generic vertex types | The existing `cycleGraph` implementation under Combinatorics/SimpleGraph/Circulant.lean only operates over `Fin n`. This PR implements a cycle graph implementation over any generic vertex type. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics new-contributor | 187/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Cycle.lean | 2 | 42 | ['IvanRenison', 'github-actions', 'mathlib4-merge-conflict-bot', 'vlad902'] | kmill | 5 months ago | 249 days ago | 123 days |
| 25739 | literandltx | feat(NumberTheory/LegendreSymbol): Add sqrt‐of‐residue theorems for p=4k+3 and p=8k+5 | Add a new file `QuadraticResidueRoots.lean` under `Mathlib/NumberTheory/LegendreSymbol/` that proves two explicit “square-root of quadratic residue” theorems for primes of the specific form. - **`exists_sqrt_of_residue_mod4_eq3`** for primes `p = 4*k + 3` - **`exists_sqrt_of_residue_mod8_eq5`** for primes `p = 8*k + 5` It also introduces the helper lemmas `euler_criterion_traditional` and `legendreSym.at_two_mod8_eq_5`. Import lines in `Mathlib.lean` and `Mathlib/NumberTheory/LegendreSymbol/Basic.lean` have been updated accordingly. | merge-conflict awaiting-author t-number-theory new-contributor | 217/0 | Mathlib.lean,Mathlib/NumberTheory/LegendreSymbol/Basic.lean,Mathlib/NumberTheory/LegendreSymbol/QuadraticReciprocity.lean,Mathlib/NumberTheory/LegendreSymbol/QuadraticResidueRoots.lean | 4 | 3 | ['github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | literandltx | 5 months ago | 305 days ago | 17 days |
| 26594 | metakunt | feat(Algebra/Polynomial/ZMod): Add Polynomial.equiv_of_nat_of_polynomial_zmod | This adds an explicit bijection between the naturals and $$\mathbb{Z}/n\mathbb{Z}[X]$$ in a canonical way. --- I feel that some API is missing to make the theorem shorter, I have no idea what lemmas to extract though. Also I don't know when to use spaces and when not, so I did it best effort. | merge-conflict awaiting-author t-algebra new-contributor | 465/0 | Mathlib.lean,Mathlib/Algebra/Polynomial/ZMod.lean | 2 | 3 | ['Ruben-VandeVelde', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 278 days ago | 25 days |
| 26757 | fweth | feat(CategoryTheory/Topos): define elementary topos | This commit begins the formalization of the notion of an *elementary topos*, following the definition in \[Mac Lane & Moerdijk, *Sheaves in Geometry and Logic* (1992), Ch. IV, Section 1]. It introduces the file `Mathlib/CategoryTheory/Topos/Basic.lean`, which currently includes: * The definition of an elementary topos. * Proof that the power object map is a functor * Theorem about pullbacks of characterstic maps Subobject classifiers, which are used in the definition, have already been defined in `CategoryTheory/Topos/Classifier.lean` Work in progress: further formalization of the section is planned. Questions: * Should the definition of power objects be separated into its own file/module, perhaps under `CategoryTheory/Topos/PowerObject.lean`? * Is the notation `P` / `P_morph` / `P_functor` for the power object functor on objects / morphisms / total acceptable? * Should the comments and docstrings rather use the notation from the book, where `g ∘ f` denotes arrow composition from righ to left, or the Lean variant `f ≫ g`? Klaus Gy klausgy@gmail.com --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 401/66 | Mathlib.lean,Mathlib/CategoryTheory/Closed/PowerObjects.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/CommSq.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Equalizer.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Topos/Classifier.lean | 9 | 17 | ['fweth', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | joelriou | 5 months ago | 192 days ago | 62 days |
| 27155 | Pjotr5 | feat: Shearer's bound on the independence number of triangle free graphs | I added the file IndependenceNumber.lean to the Mathlib.Combinatorics.SimpleGraph.Triangle folder. It contains a proof of a theorem by Shearer on the independence number of triangle-free graphs . I was told this might be useful to add to Mathlib a Zullip thread linked [here](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Convexity.20of.20a.20specific.20function/with/510469526). I tried to comply as much as I could with the Mathlib style guide, but I realise that there is probably still a significant amount of editing to be done. For one thing: there are probably some lemmas and theorems in there that might be better suited in other files, but since this is my first PR I though I would all put it in one file before starting to edit a bunch of files. I was also advised to split up the file into multiple smaller PRs, but since everything is basically serving this one proof I could not really find a natural way to do that. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics new-contributor | 1266/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/IndependenceNumber.lean | 2 | 10 | ['Pjotr5', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 290 days ago | 4 minutes |
| 27753 | YunkaiZhang233 | feat(CategoryTheory): implemented proofs for factorisation categories being equivalent to iterated comma categories in two ways | --- Completed one of the tasks in TODOs, shown and implemented the details for (X/C)/f ≌ Factorisation f ≌ f/(C/Y). This is migrated from my previous PR #22390 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 70/1 | Mathlib/CategoryTheory/Category/Factorisation.lean | 1 | 13 | ['YunkaiZhang233', 'b-mehta', 'github-actions', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 5 months ago | 274 days ago | 57 minutes |
| 27850 | fyqing | feat: 0-dimensional manifolds are discrete and countable | This is the converse direction of the classification of 0-dimensional manifolds. The other direction was shown in #22105. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-differential-geometry new-contributor | 80/0 | Mathlib.lean,Mathlib/Geometry/Manifold/ZeroDim.lean | 2 | 14 | ['fyqing', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'tb65536'] | grunweg | 5 months ago | 272 days ago | 1 hour |
| 28125 | nonisomorphiclinearmap | feat(Combinatorics): basic definition of simplicial complexes | This PR introduces the basic definition of a finite (abstract) simplicial complex, located in Mathlib/Combinatorics/SimplicialComplex/Basic.lean. --- This is our first contribution to mathlib. This work was done as part of the Fields Institute Summer Undergraduate Program on formalization in topological combinatorics. Eventually, we aim to formalize Lovasz's proof of the Kneser Conjecture and this is a small stepping stone in that direction. Some other commits will shortly depend on this one. We would like to acknowledge the Fields Institute for Research in Mathematical Sciences for their sponsorship. We would also like to thank our supervisors, Professor Chris Kapulkin and Mr. Daniel Carranza, for their guidance and support throughout this project. We would also like to thank our group members Tom Lindquist and Quang Minh Nguyen for our fruitful discussions. | merge-conflict t-combinatorics new-contributor | 374/0 | Mathlib.lean,Mathlib/Combinatorics/SimplicialComplex/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Category.lean,Mathlib/Combinatorics/SimplicialComplex/FacePoset.lean,Mathlib/Combinatorics/SimplicialComplex/Hom.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 5 months ago | 163 days ago | 99 days |
| 28530 | nonisomorphiclinearmap | feat(Combinatorics/SimplicialComplex/Topology): add standard simplices and geometric realisation (colimit + functoriality) | Introduce the standard simplex on a finite vertex set and build the geometric realisation |X| of a simplicial complex. Prove that |X| is the colimit of the face diagram δ_X : X.faces ⥤ TopCat, and define the induced map on realisations |φ| : |X| ⟶ |Y| for a simplicial map φ. Show that the abstract map from colimit functoriality agrees with the concrete push-forward of barycentric coordinates. Package these into a functor SimplicialComplexCat ⥤ TopCat. --- This is our first contribution to mathlib. This work was done as part of the Fields Institute Summer Undergraduate Program on formalization in topological combinatorics. Eventually, we aim to formalize Lovasz's proof of the Kneser Conjecture and this lays the groundwork to do this. We would like to acknowledge the Fields Institute for Research in Mathematical Sciences for their sponsorship. We would also like to thank our supervisors, Professor Chris Kapulkin and Mr. Daniel Carranza, for their guidance and support throughout this project. I would also like to thank our group members Sebastian Kumar, Tom Lindquist and Quang Minh Nguyen for our fruitful discussions. - [ ] depends on: #28125 | merge-conflict blocked-by-other-PR t-combinatorics new-contributor | 1826/0 | Mathlib.lean,Mathlib/Combinatorics/SimplicialComplex/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Category.lean,Mathlib/Combinatorics/SimplicialComplex/FacePoset.lean,Mathlib/Combinatorics/SimplicialComplex/Hom.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Colimit.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Diagram.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Functor.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Map.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/Simplex.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/SimplexMap.lean | 12 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 257 days ago | 9 minutes |
| 28871 | JaafarTanoukhi | feat(Combinatorics/Digraph): Tournaments | Define orientations and tournaments. Related to #26771.
Co-authored-by: Rida Hamadani |
merge-conflict t-combinatorics new-contributor | 62/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/Digraph/Tournament.lean | 3 | 6 | ['JaafarTanoukhi', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'mathlib4-merge-conflict-bot'] | kmill | 5 months ago | 163 days ago | 71 days |
| 29947 | JaafarTanoukhi | feat(Combinatorics/Digraph): Maps | Ported `SimpleGraph/Maps.lean` to `Digraph/Maps.lean` for future PRs related to issue #[26771](https://github.com/leanprover-community/mathlib4/issues/26771) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics new-contributor | 476/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Maps.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 5 months ago | 163 days ago | 54 days |
| 30230 | CoolRmal | feat(MeasureTheory): Basic properties of the integral against a vector measure with a bilinear form. | Create a folder named Integral in the folder about vector measures. Define the integral of a function against a vector measure with a bilinear form, and prove that integral is a linear operator on functions, bilinear forms, and vector measures, respectively. Several useful lemmas are added into the file about variations of a vector measure (e.g. triangle inequality). --- - [ ] depends on: #28499 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-measure-probability | 1353/0 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Integral/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Integral/L1.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Lemmas.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 14704 | Command-Master | feat(FieldTheory): define typeclass for simple extensions, and prove some properties | Define `SimpleExtension F K`, which says that `K` is a simple field extension of `F`, and show that together with transcendentality it implies `IsFractionRing F[X] K`. --- - [x] depends on: #14710 [](https://gitpod.io/from-referrer/) | WIP t-algebra new-contributor merge-conflict awaiting-author | 120/0 | Mathlib.lean,Mathlib/FieldTheory/SimpleExtension.lean | 2 | 19 | ['Command-Master', 'acmepjz', 'github-actions', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot', 'tb65536'] | nobody | 5 months ago | 607 days ago | 48 days |
| 11021 | jstoobysmith | feat(AlgebraicTopology): add join of augmented SSets | This pull-request adds the definition of the join of augmented SSets defined as contravariant functors from `WithInitial SimplexCategory` to `Type u`. In addition it shows that the join of two standard augmented SSets is again an augmented SSets. From this the definition of the join of simplicial sets should follow easily. To aid the above theory, an api for `WithInitial SimplexCategory` has been created, with the notion of the `join` and `split` (forming a sort of inverse to join) of objects in this category are defined. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-topology new-contributor | 2137/1 | .gitignore,Mathlib.lean,Mathlib/AlgebraicTopology/Join.lean,Mathlib/AlgebraicTopology/SimplexCategory.lean,Mathlib/AlgebraicTopology/SimplexCategoryWithInitial.lean,Mathlib/AlgebraicTopology/SimplicialSet.lean | 6 | 47 | ['github-actions', 'jcommelin'] | nobody | 5 months ago | 792 days ago | 1 day |
| 18626 | hannahfechtner | feat: define Artin braid groups | Define the Artin braid group on infinitely many strands. Includes a toGroup function which defines a function out of the braid group to any other group (given a function which satisfies the braid relations) (more to come in this file; next up: Artin braid groups on finitely many strands) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 91/0 | Mathlib.lean,Mathlib/GroupTheory/SpecificGroups/BraidGroup/Basic.lean | 2 | 22 | ['github-actions', 'hannahfechtner', 'jcommelin', 'joelriou'] | nobody | 5 months ago | 526 days ago | 15 days |
| 20029 | FrederickPu | feat(Tactic/simps): allow for Config attributes to be set directly | Allow for Config attributes to be set directly when using initialize_simp_projection as per issue #19895 Basically modified initialize_simp_projection so that the user has the option of specifying a tuple of config option values. Ex: ``` initialize_simp_projection MulEquiv (toFun → apply, invFun → symm_apply) (fullyApplied := false) ``` These config options are then converted into projections. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP new-contributor t-meta | 34/4 | Mathlib/Tactic/Simps/Basic.lean | 1 | 11 | ['FrederickPu', 'YaelDillies', 'fpvandoorn', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 5 months ago | 499 days ago | 9 hours |
| 21269 | 658060 | feat(CategoryTheory/Topos): basic definitions and results in topos theory | This code contains basic definitions and results in topos theory, including the definition of a subobject classifier, power objects, and topoi. It is proved that every topos has exponential objects, i.e. "internal homs". The mathematical content follows chapter IV sections 1-2 of Mac Lane and Moerdijk's text "Sheaves in Geometry and Logic". --- - [x] depends on: #21281 [](https://gitpod.io/from-referrer/) | WIP t-category-theory new-contributor merge-conflict awaiting-author | 1269/0 | Mathlib.lean,Mathlib/CategoryTheory/Topos/Basic.lean,Mathlib/CategoryTheory/Topos/Classifier.lean,Mathlib/CategoryTheory/Topos/Exponentials.lean,Mathlib/CategoryTheory/Topos/Power.lean | 5 | 10 | ['658060', 'gio256', 'github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 455 days ago | 3 hours |
| 23990 | robertmaxton42 | feat(Types.Colimits): Quot is functorial and colimitEquivQuot is natural | Add `Functor.quotFunctor` to parallel `Functor.sectionsFunctor`, witnessing that `Quot` is functorial; add `colimNatIsoQuotFunctor` to parallel `limNatIsoSectionsFunctor`, witnessing that `colimitEquivQuot` is natural in the diagram $F$. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 33/0 | Mathlib/CategoryTheory/Limits/Types/Colimits.lean | 1 | 5 | ['github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'robertmaxton42'] | nobody | 5 months ago | 375 days ago | 8 days |
| 27991 | sinianluoye | feat(Rat): add Rat.den_eq_of_add_den_eq_one and its dependent lemmas | ```lean4 example {q r : ℚ} (h : (q + r).den = 1) : q.den = r.den := by ``` It is so simple, but I couldn't find it in current mathlib repo. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data new-contributor | 22/0 | Mathlib/Data/Rat/Lemmas.lean | 1 | 33 | ['github-actions', 'kim-em', 'mathlib-bors', 'pechersky', 'sinianluoye', 'themathqueen'] | pechersky | 5 months ago | 192 days ago | 74 days |
| 28215 | 5hv5hvnk | feat: strong and Weak connectivity for Digraphs | strong and weak connectivity in Digraphs --- Should resolve a part of issue #26771 Main additions in the PR: 1. Walks in Digraphs (Walk.lean) - Basic walk structure with start and end vertices - Support for walk operations: append, reverse, length - Support functions: getVert, copy, support 2. Walk Decompositions (WalkDecomp.lean) - takeUntil and dropUntil functions to split walks - rotate operation for loop walks - Theorems relating to walk decomposition properties 3. Subgraphs (subgraph.lean) - Subgraph structure for digraphs - Induced and spanning subgraph predicates - Lattice structure (sup, inf, top, bot) - Coercion to standalone digraphs 4. Paths (Paths.lean) - Trail, Path, Circuit, Cycle definitions - Path structure with no repeating vertices - Theorems relating different path types - Basic connectivity definitions (reachable, weakly/strongly connected) 5. Connectivity (Connected.lean) - Reachability relations and properties - Strong and weak connectivity definitions - Connected component types: - StronglyConnectedComponent - WeaklyConnectedComponent - ConnectedComponent - Component properties and equivalence relations --> [](https://gitpod.io/from-referrer/) | WIP new-contributor merge-conflict awaiting-author t-combinatorics | 1266/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Connected.lean,Mathlib/Combinatorics/Digraph/Paths.lean,Mathlib/Combinatorics/Digraph/Subgraph.lean,Mathlib/Combinatorics/Digraph/Walk.lean,Mathlib/Combinatorics/Digraph/WalkDecomp.lean | 6 | 4 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 263 days ago | 7 minutes |
| 29574 | JarodAlper | feat: regular local rings are domains | We have added three new files in Mathlib/RingTheory/LocalRing * EmbeddingDimension.lean * LocalRingDimension.lean * RegularLocalRings.lean We have added two lemmas and an instance in Mathlib/RingTheory/LocalRing/RingHom/Basic.lean This work was done by Jarod Alper and Brian Nugent. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory new-contributor | 910/3 | Mathlib.lean,Mathlib/RingTheory/LocalRing/EmbeddingDimension.lean,Mathlib/RingTheory/LocalRing/LocalRingDimension.lean,Mathlib/RingTheory/LocalRing/RegularLocalRings.lean,Mathlib/RingTheory/LocalRing/RingHom/Basic.lean,lake-manifest.json | 6 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 230 days ago | 17 minutes |
| 28718 | imbrem | feat: class for chosen finite coproducts | Added basic `ChosenFiniteCoproducts` class, and started porting some of the lemmas about `ChosenFiniteProducts` suitably translated --- This, combined with #20182 modified to use chosen finite coproducts and premonoidal categories (#21488), should be enough for me to formalize strong Elgot categories, and hence a lot of categorical iteration theory for my PhD thesis. Re-done from #21603 to deal with changes in #24399 and #24390 Eventually, if we really want to harmonize approaches, we could introduce an `AddMonoidalCategory` struct and do the analogous to #24399 and #24390 for additive monoidal structure, but that seems like a massive overcomplication for now. It would allow formalizing fun things like rig categories, though. - [ ] depends on: #30150 | blocked-by-other-PR t-category-theory new-contributor merge-conflict awaiting-author | 290/0 | Mathlib.lean,Mathlib/CategoryTheory/ChosenFiniteCoproducts.lean | 2 | 9 | ['YaelDillies', 'github-actions', 'imbrem', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 5 months ago | 253 days ago | 9 minutes |
| 26765 | KiringYJ | feat(MeasureTheory/PiSystem): add π-λ theorem and SetLike instance | Add two small features to `MeasureTheory/PiSystem`: 1. SetLike instance `instance : SetLike (DynkinSystem α) (Set α)` This lets us write `s ⊆ d` and `t ∈ d` for a DynkinSystem `d`, matching usual mathlib style. 2. `DynkinSystem.pi_lambda` lemma Classical π‑λ theorem: if a π‑system `s` is contained in a Dynkin system `d`, every set measurable for `σ(s)` is also in `d`. Currently, mathlib exposes this result only indirectly (e.g. via `generateFrom_eq`). Although logically equivalent, it is not obvious at first glance that those lemmas are the π‑λ theorem. The new lemma states the result in its familiar textbook form, so users can recognise and cite it immediately. Both pieces are under 10 lines, term‑mode only, and do not modify existing APIs. No breaking changes. No dependencies. | awaiting-author t-measure-probability new-contributor | 13/0 | Mathlib/MeasureTheory/PiSystem.lean | 1 | 14 | ['EtienneC30', 'KiringYJ', 'dagurtomas', 'github-actions', 'ocfnash'] | RemyDegenne | 5 months ago | 162 days ago | 138 days |
| 30637 | strihanje01 | feat(Combinatorics/SetFamily/Lindstrom): Lindstrom's theorem for subfamilies with equal unions | add Lindstrom's theorem and its strengthening for equal intersections --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 209/0 | Mathlib/Combinatorics/SetFamily/Lindstrom.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | b-mehta | 5 months ago | 160 days ago | 31 days |
| 31796 | dobronx1325 | feat(Data/Real/EReal): add mul_lt_mul_of_pos_left theorem | This PR adds the theorem `EReal.mul_lt_mul_of_pos_left`, which states that for a positive real number `a` and extended reals `b < c`, left multiplication by `a` preserves the strict order: `(a : EReal) * b < (a : EReal) * c`. The theorem complements existing order-preserving properties for addition in `EReal` and extends the algebraic structure for multiplication. The proof uses basic properties of extended reals and order relations. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 23/0 | Mathlib/Data/EReal/Operations.lean | 1 | 4 | ['JovanGerb', 'LLaurance', 'dobronx1325', 'github-actions'] | nobody | 5 months ago | 157 days ago | 6 days |
| 32169 | saodimao20 | feat: add convolution_comp_add_right | This PR adds a lemma `convolution_comp_translation_right` showing that convolution commutes with translation on the right operand. Specifically, it proves that for an additive commutative group $G$, the convolution of a function $f$ with a translated function $x \mapsto g(a + x)$ is equal to the convolution of $f$ and $g$ evaluated at $x + a$. --- [](https://gitpod.io/from-referrer/) | t-analysis new-contributor awaiting-author | 14/0 | Mathlib/Analysis/Convolution.lean | 1 | 3 | ['github-actions', 'urkud'] | nobody | 5 months ago | 154 days ago | 22 hours |
| 32126 | nielsvoss | feat(Analysis/Normed/Operator): definition of singular values for linear maps | This PR defines a generalization of singular values, the approximation numbers, for continuous linear maps between normed vector spaces. It proves basic lemmas about the approximation numbers and shows that for finite-dimensional vector spaces, the approximation numbers coincide with the standard definition of singular values.
See the discussion on Zulip: https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Singular.20Value.20Decomposition/with/558914024
Co-authored-by: Arnav Mehta |
WIP t-analysis new-contributor | 331/0 | Mathlib/Analysis/Normed/Operator/SingularValues.lean | 1 | 2 | ['github-actions', 'nielsvoss'] | nobody | 5 months ago | unknown | 0 seconds |
| 31898 | ntapiam | feat(LinearAlgebra/TensorAlgebra): implement HopfAlgebra for TensorAlgebra | implementation of the natural Hopf algebra structure on the TensorAlgebra | new-contributor t-ring-theory awaiting-author | 253/0 | Mathlib.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean,Mathlib/RingTheory/Bialgebra/FreeAlgebra.lean,Mathlib/RingTheory/Bialgebra/TensorAlgebra.lean,Mathlib/RingTheory/HopfAlgebra/TensorAlgebra.lean | 6 | 64 | ['YaelDillies', 'github-actions', 'kckennylau', 'ntapiam'] | nobody | 4 months ago | 159 days ago | 9 hours |
| 30525 | 515801431 | feat(Mathlib/Combinatorics/Enumerative/Polya): Add Polya Counting | This PR introduces basic definitions and results about colorings under permutation group actions. A coloring is defined as a function X → Y, and the permutation group Equiv.Perm X acts on colorings by precomposition: (g • c) x = c (g⁻¹ • x) This formalizes the natural action of relabeling the elements of X. Main definitions MulAction (Equiv.Perm X) (X → Y): The action of the permutation group on colorings via precomposition. coloringEquiv (c₁ c₂ : X → Y) : Prop: Two colorings are equivalent if they lie in the same orbit under this action, i.e. ∃ f : Equiv.Perm X, f • c₁ = c₂. Main results smul_eq_iff_mem_stabilizer: Characterizes when two group actions on the same coloring are equal, showing that g • c = f • c ↔ f⁻¹ * g ∈ stabilizer c. coloringEquiv_equivalence: Proves that coloringEquiv defines an equivalence relation on X → Y. orbit_size_eq_index: Reformulates the orbit–stabilizer theorem in the context of colorings: |orbit c| = |Perm X| / |stabilizer c| Motivation These results provide foundational infrastructure for studying Burnside’s lemma and Pólya’s enumeration theorem in Mathlib, where the enumeration of distinct colorings up to symmetry plays a central role. | t-combinatorics new-contributor awaiting-author merge-conflict | 113/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Polya.lean | 2 | 8 | ['IvanRenison', 'alreadydone', 'github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 4 months ago | 155 days ago | 39 days |
| 31113 | 515801431 | feat(Mathlib/Combinatorics/Enumerative/Polya.lean): Add additional theorem in `Polya.lean` | --- - [ ] depends on: #30525 --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor blocked-by-other-PR merge-conflict | 302/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Polya.lean | 2 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | b-mehta | 4 months ago | 156 days ago | 16 days |
| 24441 | MrSumato | feat(Data/List): add Lyndon-Schutzenberger theorem on list commutativity | Add Lyndon-Schutzenberger theorem on list commutativity. Included definition for List.repeatSelf that returns list repeated n times. --- This is my first mathlib PR, so any comments are highly appreciated. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data new-contributor | 129/1 | Mathlib.lean,Mathlib/Data/List/Commutativity.lean,Mathlib/Data/List/Defs.lean,Mathlib/Data/List/Lemmas.lean | 4 | 38 | ['MrSumato', 'github-actions', 'grunweg', 'madvorak', 'mathlib4-merge-conflict-bot', 'plp127'] | grunweg | 4 months ago | 329 days ago | 29 days |
| 31147 | daefigueroa | feat(Dynamics): point transitive monoid actions and transitive points | We define point transitivity for a monoid action on a topological space and define the set of transitive points. We add some basic lemmas and implications between topological transitivity and point transitivity. --- - [x] depends on: #28001 [](https://gitpod.io/from-referrer/) | t-dynamics new-contributor awaiting-author | 114/6 | Mathlib/Dynamics/Transitive.lean | 1 | 6 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 4 months ago | 144 days ago | 18 days |
| 31987 | saodimao20 | feat: add monotonicity and relation lemmas for mgf and cgf | Add two lemmas about moment-generating and cumulant-generating functions: - `mgf_mono_in_t_of_nonneg`: For nonnegative random variables, the mgf is monotone in the parameter `t` - `cgf_zero_of_mgf_one`: The cgf equals zero iff the mgf equals one These lemmas are useful for studying properties of mgf and cgf in probability theory. Contributed by sequential-intelligence-lab(SIL), University of Virginia --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor awaiting-author | 21/0 | Mathlib/Probability/Moments/Basic.lean | 1 | 5 | ['DavidLedvinka', 'github-actions'] | RemyDegenne | 4 months ago | 138 days ago | 21 days |
| 32938 | 0xTerencePrime | feat(Order/LocallyFinite): prove DenselyOrdered and LocallyFiniteOrder are incompatible | ## Summary This PR proves that a nontrivial densely ordered linear order cannot be locally finite. ## Main results * `not_locallyFiniteOrder`: A densely ordered locally finite linear order must be subsingleton. * `not_locallyFiniteOrder_of_nontrivial`: The main theorem - incompatibility of the two properties. Note: This implementation imports `Mathlib.Order.Interval.Set.Infinite` to reuse the existing `Set.Icc_infinite` theorem, ensuring standard library consistency. ## Mathematical content The key insight is that in a densely ordered type, we can always find a new element between any two distinct elements. This means any nontrivial interval contains infinitely many elements. However, `LocallyFiniteOrder` requires intervals to be finite. This contradiction implies that such a type cannot exist (unless it is trivial). ## Motivation This resolves a TODO mentioned in #7987 (Data/Finset/LocallyFinite entry). ## Verification - [x] `lake build Mathlib.Order.LocallyFinite.Basic` passes - [x] `lake exe runLinter Mathlib.Order.LocallyFinite.Basic` passes | t-order new-contributor awaiting-author | 28/0 | Mathlib/Order/Interval/Finset/Basic.lean | 1 | 10 | ['0xTerencePrime', 'CoolRmal', 'github-actions', 'jcommelin', 'plp127'] | nobody | 4 months ago | 133 days ago | 3 days |
| 32698 | farruhx | feat(List): add aesop / simp annotations to selected lemmas for improved automation | This PR adds `@[aesop safe]` and `@[simp]` annotations to a set of List lemmas whose proofs are routine and benefit from standardized automation. No statements or definitions are changed; only proof annotations are added. The lemmas updated in this PR are: * `or_exists_of_exists_mem_cons` * `append_subset_of_subset_of_subset` * `map_subset_iff` * `append_eq_has_append` * `append_right_injective` * `append_left_injective` * `reverse_surjective` * `reverse_bijective` * `mem_getLast?_append_of_mem_getLast?` * `mem_dropLast_of_mem_of_ne_getLast` * `idxOf_eq_length_iff` * `idxOf_append_of_mem` * `length_eraseP_add_one` The goal is to make these commonly used lemmas easier for `aesop`-based automation to resolve, while avoiding any interference with simp-normal-form lemmas or canonical rewrite rules. There are no API changes and no new theorems—only improved automation behavior. | t-data new-contributor awaiting-author | 18/1 | Mathlib/Data/List/Basic.lean | 1 | 8 | ['artie2000', 'euprunin', 'farruhx', 'github-actions'] | pechersky | 4 months ago | 132 days ago | 7 days |
| 27817 | zhuyizheng | feat: add IMO2025P1 | Add a solution to IMO2025P1, the original problem statement from https://github.com/jsm28/IMOLean --- [](https://gitpod.io/from-referrer/) | IMO awaiting-author new-contributor merge-conflict | 1310/0 | Archive.lean,Archive/Imo/Imo2025Q1.lean | 2 | 9 | ['github-actions', 'kim-em', 'mathlib4-merge-conflict-bot', 'zhuyizheng'] | dwrensha | 4 months ago | 191 days ago | 54 days |
| 26923 | oliver-butterley | feat(Dynamics/BirkhoffSum): add the pointwise ergodic theorem (Birkhoff's) | The Pointwise Ergodic Theorem, also known as Birkhoff's Ergodic Theorem.
Co-authored-by: Lua Viana Reis |
t-dynamics new-contributor awaiting-author | 398/0 | Mathlib.lean,Mathlib/Dynamics/BirkhoffSum/Pointwise.lean | 2 | 31 | ['D-Thomine', 'github-actions', 'leanprover-community-bot-assistant', 'lua-vr', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel', 'urkud'] | sgouezel | 4 months ago | 135 days ago | 98 days |
| 33218 | Blackfeather007 | feat(Algebra): Define the associated graded ring to filtered ring | Define the associated graded ring to a filtered ring. --- - [ ] depends on: #33217 migrated from https://github.com/leanprover-community/mathlib4/pull/26858 | t-ring-theory new-contributor blocked-by-other-PR | 450/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 2 minutes |
| 33219 | Blackfeather007 | feat(Algebra): Define associated graded algebra | Define the associated graded algebra of a filtered algebra, constructed from a special case of associated graded ring. --- - [ ] depends on: #33218 migrated from #26859 | t-ring-theory new-contributor blocked-by-other-PR | 563/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 2 minutes |
| 33220 | Blackfeather007 | feat(Algebra): Define associated graded module | Define the associated graded module to a filtered module. --- - [ ] depends on: #33218 migrated from #26860 | t-ring-theory new-contributor blocked-by-other-PR | 669/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 2 minutes |
| 33227 | Blackfeather007 | feat(Algebra): exact of associated graded exact | We proved that a chain complex is exact if its associated graded complex is exact. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33226 migrated from #26869 | t-ring-theory new-contributor blocked-by-other-PR | 728/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/Exactness.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 4 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 20 minutes |
| 33226 | Blackfeather007 | feat(Algebra): associated graded exact of exact and strict | In this file, we define the concept of exhaustive filtrations. We also prove a AssociatedGradedRingHom sequence is exact iff each GradedPieceHom is exact. And when a sequence is strict exact, the corresponding AssociatedGradedRingHom sequence is also exact. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33222 migrated from #26868 | t-ring-theory new-contributor blocked-by-other-PR | 529/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/Exactness.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 4 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 23 minutes |
| 33225 | Blackfeather007 | feat(Algebra): filtered module hom | In this PR we defined the filtered semi-linear map for filtered module and the associated graded module hom. --- - [ ] depends on: #33220 - [ ] depends on: #33223 migrated from #26867 | t-ring-theory new-contributor blocked-by-other-PR | 1205/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 30 minutes |
| 33224 | Blackfeather007 | feat(Algebra): define filtered alghom | In this PR, we define the filtered algebra homomorphisms on algebras and prove some basic properties of them. --- - [ ] depends on: #33219 - [ ] depends on: #33223 migrated from #26863 | t-ring-theory new-contributor blocked-by-other-PR | 1055/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 34 minutes |
| 33223 | Blackfeather007 | feat(Algebra): define filtered ring homomorphism | In this PR, we define the filtered ring morphisms on rings and prove some basic properties of them. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33218 - [ ] depends on: #33222 migrated from #26862 | t-ring-theory new-contributor blocked-by-other-PR | 824/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 37 minutes |
| 33222 | Blackfeather007 | feat(Algebra): define filtered add group hom | In this file we define filtered hom and the corresponding associated graded hom for abelian groups. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33217 migrated from #26861 | new-contributor t-ring-theory blocked-by-other-PR | 368/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 39 minutes |
| 33178 | gw90 | feat(Analysis/CStarAlgebra/Spectrum): Adding lemmas that the CStarAlgebra norm equals the square root of the spectral radius of star a * a | Adds lemmas that the ||a||^2_A=sqrt(spectralRadius C (star a * a)). I think it would be helpful to have these lemmas available in Mathlib. It'll help with some of the other things I'm working on. Feel free to move them to a different file or rename them as you see fit. | new-contributor t-analysis awaiting-author | 24/0 | Mathlib/Analysis/CStarAlgebra/Spectrum.lean | 1 | 15 | ['github-actions', 'gw90', 'themathqueen', 'vihdzp'] | nobody | 4 months ago | 130 days ago | 4 hours |
| 32264 | jjtowery | feat(Bicategory): add lax slice bicategory | --- In this PR, I define the lax slice bicategory for a lax functor over an object. I also give the change of slice strict pseudofunctor. These are from Section 7.1 of Johnson & Yau and are essential for their Whitehead theorem for bicategories (lax functor biequivalence iff essentially surjective, essentially full, and fully faithful), which I'd like to prove at some point. [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author | 527/0 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/LaxSlice.lean | 2 | 12 | ['dagurtomas', 'github-actions', 'jjtowery', 'robin-carlier'] | dagurtomas | 4 months ago | 148 days ago | 3 days |
| 32960 | dleijnse | feat(FieldTheory): adjoin pth roots | For a field `k` of exponential characteristic `p` and a subset `S` of `k`, we define the extension of `k` obtained by adjoining all `p`-th roots of elements of `S`. We prove that this is a purely inseparable extension, and provide some basic API. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 131/0 | Mathlib.lean,Mathlib/FieldTheory/PurelyInseparable/AdjoinPthRoots.lean | 2 | 13 | ['artie2000', 'chrisflav', 'dleijnse', 'erdOne', 'github-actions', 'leanprover-radar'] | erdOne | 4 months ago | 125 days ago | 10 days |
| 33163 | Aaron1011 | feat: prove subgroup of (M -> Z) is finitely generated | --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 5/0 | Mathlib/RingTheory/DedekindDomain/Dvr.lean | 1 | 2 | ['erdOne', 'github-actions'] | alreadydone | 4 months ago | 124 days ago | 5 days |
| 33133 | 0xTerencePrime | feat(Algebra/Group/Center): add Decidable (IsMulCentral a) instance | This PR adds a `Decidable` instance for `IsMulCentral a`. ### Summary The structure `IsMulCentral` was missing a `Decidable` instance. This PR provides the instance by leveraging `isMulCentral_iff`, enabling decidability for both multiplicative and additive (via `to_additive`) structures. ### Verification - `lake build Mathlib.Algebra.Group.Center` passed. - `lake exe runLinter Mathlib.Algebra.Group.Center` passed. | t-algebra new-contributor awaiting-author | 7/0 | Mathlib/Algebra/Group/Center.lean | 1 | 3 | ['github-actions', 'robin-carlier'] | ocfnash | 3 months ago | 119 days ago | 12 days |
| 33502 | MrQubo | fix(Tactic/ProxyType): Pass params explicitly in proxy_equiv% implementation | Fix [#mathlib4 > `deriving Fintype` with Prop](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60deriving.20Fintype.60.20with.20Prop/with/566118621) --- [](https://gitpod.io/from-referrer/) | new-contributor t-meta WIP | 12/2 | Mathlib/Tactic/ProxyType.lean,MathlibTest/DeriveFintype.lean | 2 | 7 | ['MrQubo', 'github-actions', 'kmill'] | kmill | 3 months ago | 117 days ago | 16 hours |
| 17176 | arulandu | feat: integrals and integrability with .re | Lemmas for swapping order of .re and integration/integrability. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability please-adopt | 49/0 | Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean | 4 | 32 | ['EtienneC30', 'arulandu', 'github-actions', 'loefflerd'] | nobody | 3 months ago | 563 days ago | 9 days |
| 33756 | dleijnse | feat(FieldTheory): root of polynomial with p power coefficients | This PR proves the results in https://stacks.math.columbia.edu/tag/031V, which gives a criterion for a root of a polynomial over a field `k` of characteristic `p` to be a `p`-th power. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 88/0 | Mathlib.lean,Mathlib/FieldTheory/PthPowerCoeffPoly.lean | 2 | 1 | ['github-actions'] | nobody | 3 months ago | unknown | 0 seconds |
| 33299 | kingiler | feat: Add decidable membership for Interval | Implemented membership and corresponding decidable instance for `Interval`. Related [#mathlib4 > Proposal: Add decidable membership for Interval](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Proposal.3A.20Add.20decidable.20membership.20for.20Interval/with/565438009). --- [](https://gitpod.io/from-referrer/) | awaiting-author new-contributor t-order | 16/1 | Mathlib/Order/Interval/Basic.lean | 1 | 5 | ['Vierkantor', 'eric-wieser', 'github-actions', 'kingiler'] | Vierkantor | 3 months ago | 113 days ago | 13 days |
| 32880 | 0xTerencePrime | feat(Analysis/Asymptotics): define subpolynomial growth | ## Main definitions * `Asymptotics.IsSubpolynomial l f g`: A function `f` has subpolynomial growth with respect to `g` along filter `l` if `f = O(1 + ‖g‖^k)` for some natural `k`. ## Main results * `IsSubpolynomial.const`: Constant functions have subpolynomial growth * `IsSubpolynomial.id`: Identity has subpolynomial growth * `IsSubpolynomial.add`: Closure under addition * `IsSubpolynomial.neg`: Closure under negation * `IsSubpolynomial.sub`: Closure under subtraction * `IsSubpolynomial.mul`: Closure under multiplication * `IsSubpolynomial.pow`: Closure under powers * `isSubpolynomial_iff_one_add`: Equivalence with `(1 + ‖g‖)^k` formulation * `IsSubpolynomial.uniform`: Uniform bounds for finite families ## Implementation notes The definition uses `1 + ‖g‖^k` rather than `(1 + ‖g‖)^k` as the primary form, with the equivalence established in `isSubpolynomial_iff_one_add`. Four private auxiliary lemmas handle the key inequalities needed for closure proofs. Closes #32658 | awaiting-author t-analysis new-contributor | 185/0 | Mathlib.lean,Mathlib/Analysis/Asymptotics/Subpolynomial.lean | 2 | 28 | ['0xTerencePrime', 'ADedecker', 'github-actions', 'j-loreaux'] | ADedecker | 3 months ago | 109 days ago | 22 days |
| 33948 | anivegesana | feat(Analysis/Normed/Algebra): matrix exponential of nilpotent matrix | Where the matrix exponential and nilpotent elements are defined, both the matrix exponential and the nilpotent element exponential. I had to add a different theorem for normed space exponential and the matrix exponential since the right instances wouldn't be synthesized. Help with golfing would be appreciated. --- [](https://gitpod.io/from-referrer/) | new-contributor t-analysis | 34/0 | Mathlib/Analysis/Normed/Algebra/Exponential.lean,Mathlib/Analysis/Normed/Algebra/MatrixExponential.lean | 2 | 1 | ['github-actions'] | nobody | 3 months ago | 107 days ago | 57 minutes |
| 30391 | rudynicolop | feat(Data/List): list splitting definitions and lemmas | This PR continues the work from #24395. Original PR: https://github.com/leanprover-community/mathlib4/pull/24395 | t-data new-contributor awaiting-author | 108/2 | Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/List/TakeDrop.lean | 2 | 50 | ['BoltonBailey', 'IlPreteRosso', 'TwoFX', 'Vierkantor', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'rudynicolop'] | TwoFX | 3 months ago | 105 days ago | 93 days |
| 29282 | Jlh18 | feat(CategoryTheory): HasColimits instance on Grpd | Show that the category of groupoids has all small colimits, as a coreflective subcategory of `Cat`, which has all small colimits. The right adjoint of the forgetful functor is the core functor `CategoryTheory.Core.functor`. - [ ] depends on: #29283 [Core of a category as a functor] --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-category-theory | 140/4 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/CategoryTheory/Category/Grpd.lean,Mathlib/CategoryTheory/Core.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Colimit.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Core.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 240 days ago | 6 minutes |
| 34141 | gululu996-ui | feat(Combinatorics/SimpleGraph/Acyclic): finite trees have at least two degree-one vertices | Add a lemma showing that a finite tree with at least two vertices has at least two vertices of degree 1. - Introduce a helper lemma `SimpleGraph.Connected.one_le_degree` for connected graphs on a nontrivial finite type. - Prove the leaf-count lower bound via the degree-sum identity and a counting argument. --- | awaiting-author new-contributor t-combinatorics | 72/2 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 9 | ['IvanRenison', 'SnirBroshi', 'github-actions', 'vlad902'] | nobody | 3 months ago | 100 days ago | 1 day |
| 29953 | slashbade | feat: add reap for experiment | --- [](https://gitpod.io/from-referrer/) | new-contributor | 40/3 | Cache/IO.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,lake-manifest.json,lakefile.lean | 5 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 31377 | CoolRmal | feat: a series of smooth functions that converges (locally) uniformly is smooth | The main theorem is the proof that an infinite sum of $C^n$ functions on a one-dimensional domain which converges locally uniformly is $C^n$ and related results. This should be compared with [contDiff_tsum](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Calculus/SmoothSeries.html#contDiff_tsum) where the same result is proved for functions on an arbitrary domain but with a slightly stronger convergence assumption. The main motivation for this PR is the [#mathlib4 > Tychonov's Counterexample for the Heat Equation](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Tychonov's.20Counterexample.20for.20the.20Heat.20Equation/with/547367912). --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor awaiting-author merge-conflict | 110/18 | Mathlib/Analysis/Calculus/SmoothSeries.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/QExpansion.lean,Mathlib/Topology/Algebra/InfiniteSum/TsumUniformlyOn.lean,Mathlib/Topology/Algebra/InfiniteSum/UniformOn.lean | 5 | 20 | ['CoolRmal', 'github-actions', 'mathlib4-merge-conflict-bot', 'ocfnash', 'sgouezel'] | ocfnash | 3 months ago | 154 days ago | 8 days |
| 33031 | chiyunhsu | feat(Combinatorics/Enumerative/Partition): add combinatorial proof of Euler's partition theorem | The new file EulerComb.lean contains the combinatorial proof of Euler's partition theorem. The analytic proof of the theorem and its generalization of Glaisher's Theorem has already been formalized in [Glaisher.lean](https://github.com/leanprover-community/mathlib4/blob/master/Mathlib/Combinatorics/Enumerative/Partition/Glaisher.lean). The generalization of the combinatorial proof from this file to Glaisher's Theorem is within reach. --- Zulip discussion: [#mathlib4 > Glaisher’s Bijection on integer partitions](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Glaisher.E2.80.99s.20Bijection.20on.20integer.20partitions/with/570808111) [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-zulip | 531/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Partition/EulerComb.lean | 2 | 5 | ['chiyunhsu', 'github-actions', 'tb65536', 'vihdzp'] | b-mehta | 3 months ago | 92 days ago | 42 days |
| 34130 | FlAmmmmING | feat(Combinatorics/SimpleGraph/Acyclic): Add new theorem `isTree_iff_uniqueShortest_path` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 28/1 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 9 | ['IvanRenison', 'github-actions', 'metakunt', 'vlad902'] | nobody | 3 months ago | 100 days ago | 2 days |
| 32609 | PrParadoxy | feat(LinearAlgebra/PiTensorProduct): Relation between nested tensor products and tensor products indexed by dependent sums | Product tensors in `⨂ j : (Σ i, β i), s j.fst j.snd` can be mapped to product tensors in `⨂ i, ⨂ b : β i, s i b`. If the outer index type is finite, the two types are equivalent. This allows the definition of endomorphisms on PiTensorProducts by specifying them on disjoint subsets of the index set. Such constructions are common e.g. in quantum circuits, quantum cellular automata, and renormalization procedures. --- WIP. This PR contains two "requests for comments". Essentially: * Is a single complex-to-define linear equivalence preferable over several less complex ones, which might however be of limited interest by themselves? * Which trade-offs are appropriate to make things computable? - [ ] depends on: #32608 - [x] depends on: #32600 - [x] depends on: #32598 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR merge-conflict t-algebra | 683/0 | Mathlib.lean,Mathlib/Data/Sigma/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Nested.lean,Mathlib/LinearAlgebra/PiTensorProduct/Set.lean | 5 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 143 days ago | 33 minutes |
| 30260 | imbrem | feat(CategoryTheory/Monoidal): added CocartesianMonoidalCategory | As discussed in #21603 and #28718; this implements chosen finite coproducts on top of `AddMonoidalCategory` as defined in #30150 --- - [ ] depends on: #30150 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR large-import new-contributor t-category-theory | 839/125 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Cocartesian/Basic.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 5 | 4 | ['github-actions', 'imbrem', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 207 days ago | 20 minutes |
| 30258 | imbrem | feat(CategoryTheory/Monoidal): to_additive for proofs using `monoidal` | Building on #30150, this allows us to use `@[to_additive]` on proofs containing `monoidal`, by tagging the lemmas `monoidal` outputs with `@[to_additive]` as appropriate. Testing on my branch [`additive-monoidal-coherence`](https://github.com/imbrem/mathlib4/tree/additive-monoidal-coherence) shows that this works. It is still future work to have either the `monoidal` tactic or a new `add_monoidal` tactic work for `AddMonoidalCategory` instances directly. --- - [ ] depends on: #30150 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR large-import new-contributor t-category-theory | 524/140 | Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 207 days ago | 4 minutes |
| 32742 | LTolDe | feat(MeasureTheory/Constructions/Polish/Basic): add class SuslinSpace | add new class `SuslinSpace` for a topological space that is an analytic set in itself This will be useful to prove the **Effros Theorem**, see [zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/558712441). --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-zulip t-measure-probability | 4/0 | Mathlib/MeasureTheory/Constructions/Polish/Basic.lean | 1 | 9 | ['ADedecker', 'LTolDe', 'dupuisf', 'github-actions', 'jcommelin'] | PatrickMassot | 3 months ago | 115 days ago | 11 days |
| 30121 | idontgetoutmuch | feat(Mathlib/Geometry/Manifold): principal fiber bundle core | A structure capturing what it means to be a principal fibre bundle. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-differential-geometry new-contributor | 227/0 | Mathlib.lean,Mathlib/Geometry/Manifold/PrincipalFiberBundle/PrincipalGBundle.lean | 2 | 8 | ['github-actions', 'grunweg', 'idontgetoutmuch', 'mathlib4-merge-conflict-bot'] | hrmacbeth | 3 months ago | 186 days ago | 25 days |
| 31102 | JOSHCLUNE | feat: require LeanHammer | Experimenting with adding LeanHammer as a mathlib dependency --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor t-meta | 61/4 | Mathlib/Tactic/Common.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,MathlibTest/Hammer.lean,lake-manifest.json,lakefile.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 164 days ago | 2 minutes |
| 34291 | YellPika | feat(Data): a monad for partial computations | This is the code corresponding to [mathlib4 > A monad for partial computations](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/A.20monad.20for.20partial.20computations/with/569619800). Not currently intended to be merged. This PR depends on #33941. The only changes relevant to this discussion are in `OmegaPart.lean`, `OmegaProp.lean`, and `Quot.lean`. # Original Message Inspired by @**Aaron Liu**'s comments in #**mathlib4>deprecate Mathlib.Data.Nat.PartENat?@538009243** and #**Is there code for X?>Divergence monad@538020049** I made an attempt at constructing a monad for partial computations with a computable `OmegaCompletePartialOrder` instance (neither `Option` nor `Part` support this use case). My solution consists of three parts. **A computable version of `Quotient.choice`.** As mentioned in #**lean4>Quot.lift for dependent products@467436416** , the "obvious" computational interpretation of `Quotient.choice : (∀i:I, @Quotient (A i) …) → @Quotient (∀i:I, A i)` is not sound. However, we _can_ provide a sound computational interpretation when we restrict `I` to `ℕ`: ```lean unsafe def Quotient.countableChoice_impl {α : Nat → Type*} {S : ∀ i, Setoid (α i)} (f : ∀ i, Quotient (S i)) : @Quotient (∀ i, α i) (by infer_instance) := Quotient.lift₂ (fun z s ↦ ⟦fun | .zero => z | .succ n => s n⟧) (fun z₁ s₁ z₂ s₂ h₁ h₂ ↦ by apply sound rintro ⟨_|n⟩ · apply h₁ · apply h₂) (f 0) (countableChoice_impl (fun n ↦ f n.succ)) @[implemented_by Quotient.countableChoice_impl] def Quotient.countableChoice {α : Nat → Type*} {S : ∀ i, Setoid (α i)} (f : ∀ i, Quotient (S i)) : @Quotient (∀ i, α i) (by infer_instance) := Quotient.choice f ``` My justification for the soundness of this implementation comes from the fact that only uses existing (sound and computable) functions + general recursion. The implementation is found [here](https://github.com/YellPika/mathlib4/blob/99d38f164a97c7aa225283ef6016f0279419a994/Mathlib/Data/Quot.lean#L430) (it uses `unquot` instead of recursion for performance reasons, but should be equivalent). **A type of semi-computable propositions.** Next, I define a type of semi-computable propositions `ΩProp` as a quotient of the type of boolean sequences `(ℕ → Bool) / ≈`, where `p ≈ q ≝ (∃n, p n) ↔ (∃n, q n)`. A sequence is interpreted as "true" if at least one element in the sequence is `true`, and the quotient relation ensures that we cannot observe the difference between different "true" sequences. The `ΩProp` type has a (computable) `OmegaCompletePartialOrder`, and `Quotient.countableChoice` is used in the implementation of `ωSup`. The implementation of this type is [here](https://github.com/YellPika/mathlib4/blob/quot-choice-compute/Mathlib/Data/OmegaProp.lean). **A type of semi-computable computations.** Finally, I define the type `ΩPart A` of semi-computable computations returning a value of type `A`. The definition of `ΩPart` is the same as `Part` with `ΩProp` swapped for `Prop`. Again, `ΩPart A` has a (computable) `OmegaCompletePartialOrder` instance. The implementation can be found [here](https://github.com/YellPika/mathlib4/blob/quot-choice-compute/Mathlib/Data/OmegaPart.lean). This was mainly just a fun experiment and the code is not ready to be (or perhaps should not be) put in mathlib. I thought I should post it here to see if 1) there is any interest or 2) an implementation already exists that has escaped my notice. | new-contributor large-import merge-conflict | 1157/40 | Mathlib/Data/OmegaPart.lean,Mathlib/Data/OmegaProp.lean,Mathlib/Data/Quot.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/ScottContinuity.lean | 5 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | unknown | 0 seconds |
| 34053 | christian-oudard | feat: Add error function (erf) and complementary error function (erfc) | ## Summary I was doing some finance math and needed the Error Function, so I thought I'd contribute it. ### Main definitions * `Real.erf`: The error function, defined as `(2/√π) ∫₀ˣ e^(-t²) dt` * `Real.erfc`: The complementary error function, defined as `1 - erf x` ### Main results * `Real.erf_zero`: `erf 0 = 0` * `Real.erf_neg`: `erf` is an odd function: `erf (-x) = -erf x` * `Real.erf_tendsto_one`: `erf x → 1` as `x → ∞` * `Real.erf_tendsto_neg_one`: `erf x → -1` as `x → -∞` * `Real.erf_le_one`: `erf x ≤ 1` for all `x` * `Real.neg_one_le_erf`: `-1 ≤ erf x` for all `x` * `Real.deriv_erf`: `deriv erf x = (2/√π) * exp(-x²)` * `Real.differentiable_erf`: `erf` is differentiable * `Real.continuous_erf`: `erf` is continuous * `Real.strictMono_erf`: `erf` is strictly monotone Also adds `erf` to `docs/overview.yaml` under Special Functions. --- - [x] Builds successfully - [x] `lake exe runLinter` passes - [x] `lake exe mk_all --check` passes | t-analysis new-contributor awaiting-author | 333/0 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Erf.lean,docs/overview.yaml | 3 | 18 | ['SnirBroshi', 'christian-oudard', 'github-actions', 'j-loreaux', 'plp127'] | j-loreaux | 2 months ago | 87 days ago | 14 days |
| 33601 | nielstron | feat(Computability/ContextFreeGrammar): Concatenation of CFGs is CFG | --- - [ ] depends on: #33599 - [ ] depends on: #33592 [](https://gitpod.io/from-referrer/) | t-computability new-contributor blocked-by-other-PR | 941/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 2 months ago | 116 days ago | 6 minutes |
| 34726 | GrigorenkoPV | feat(Analysis/SpecialFunctions/Trigonometric/Basic): sin and cos of multiples of π / 3 | --- Merge of https://github.com/leanprover-community/mathlib4/pull/26349 [](https://gitpod.io/from-referrer/) | new-contributor | 159/0 | Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Data/Nat/Cast/Defs.lean,MathlibTest/trigonometry.lean | 4 | 1 | ['github-actions'] | nobody | 2 months ago | 88 days ago | 47 minutes |
| 34394 | Citronhat | feat(Algebra/Order/Ring): add constructors for linear ordered rings | Add constructors for ordered rings from `mul_nonneg` / `mul_pos` that derive `ZeroLEOneClass` from a linear order. | new-contributor t-algebra awaiting-author | 31/14 | Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/RingTheory/HahnSeries/Lex.lean | 2 | 6 | ['Citronhat', 'Vierkantor', 'github-actions', 'leanprover-radar'] | Vierkantor | 2 months ago | 84 days ago | 12 days |
| 33493 | michelsol | feat(RingTheory/Polynomial): An explicit formula for the Chebyshev polynomials of the first kind | Adds the following explicit formula on the Chebyshev polynomial of the first kind of order n. ${ T_{n}(x)\ =\ \sum \limits _{k=0}^{\lfloor {\frac {n}{2}}\rfloor } {\binom {n}{2k}} \left(\ X^{2}-1\ \right)^{k}\ X^{n-2k}}$ This explicit formula can be found [here](https://en.wikipedia.org/wiki/Chebyshev_polynomials#Explicit_expressions). There is a proof using complex numbers but it only works if the ring R = ℂ. The proof here is by induction and works in a commutative ring R. Mathlib seems to extend the definition of Chebyshev polynomials for $n \in \mathbb{Z}$ but this would make the formula more cumbersome with `n.natAbs` in place of `n`'s, so I expressed it on `n : ℕ` directly. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 51/1 | Mathlib/RingTheory/Polynomial/Chebyshev.lean | 1 | 8 | ['YuvalFilmus', 'erdOne', 'github-actions', 'metakunt', 'michelsol'] | chrisflav | 2 months ago | 82 days ago | 35 days |
| 26986 | WangYiran01 | feat(Partition): add bijection for partitions with max part ≤ r | This PR adds a new theorem `partition_max_equals_bound` to `Mathlib.Combinatorics.Enumerative.Partition`. It constructs a bijection between: - The set of partitions of `n` in which `r ∈ π.parts` and all parts are `≤ r`, and - The set of partitions of `n - r` whose largest part is at most `r`. This provides a constructive proof via removing/adding `r` from/to the partition multiset, in line with classical enumerative combinatorics. Contributed by Yiran Wang. | awaiting-author t-combinatorics new-contributor merge-conflict | 92/0 | Mathlib/Combinatorics/Enumerative/Partition/Basic.lean,Mathlib/Data/Multiset/Lattice.lean | 2 | 20 | ['WangYiran01', 'github-actions', 'jcommelin', 'kckennylau', 'kim-em', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | b-mehta | 2 months ago | 113 days ago | 120 days |
| 26168 | oliver-butterley | feat(MeasureTheory.VectorMeasure): variation defined as a supremum is equal to variation defined using the Hahn-Jordan decomposition | Add `signedMeasure_totalVariation_eq`: if `μ` is a `SignedMeasure` then variation defined as a supremum is equal to variation defined using the Hahn-Jordan decomposition. Co-authored-by: @yoh-tanimoto - [ ] depends on: #26165 --- [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-measure-probability merge-conflict | 916/0 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Integral.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Equiv.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Lemmas.lean | 5 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 300 days ago | 15 days |
| 33969 | goliath-klein | refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): Currently, injectiveSeminorm = projectiveSeminorm | **WIP / RFC!** Arguably, `injectiveSeminorm` should be re-defined in Mathlib. See #34137 and [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798261) for context. In this file, we collect some results about the current definition and a possible alternative. Contents: * A theorem `injectiveSeminorm_eq_projectiveSeminorm` formalizing the equality of the current definitions. However, I think it is unlikely that keeping the alternative characterization would be worth the effort. The interesting direction `(L2') ≤ (L1)` follows from `norm_eval_le_projectiveSeminorm` which is still present. The converse direction is [somewhat tautological](https://github.com/leanprover-community/mathlib4/pull/34137). A proof of `(L2) = (L1)` (probably requiring Hahn-Banach) might be more interesting. * A preliminary implementation of the injective seminorm as commonly understood. * Sufficient conditions for the multiplicativity property `‖⨂ m i‖_∧ = ∏ ‖m i‖` to hold. This implements a TBD item. --- Co-authored-by: Davood H. H. Tehrani [](https://gitpod.io/from-referrer/) | WIP t-analysis new-contributor large-import merge-conflict | 774/387 | Mathlib.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/LeastReasonable.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Analysis/Normed/Operator/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean | 8 | 3 | ['github-actions', 'goliath-klein', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 107 days ago | 23 seconds |
| 33233 | jazzits | feat(GroupTheory): add chosen group presentations and Tietze transformations (1) and (2) | Defines a notion of group presentation for G compatible with Mathlib.GroupTheory.PresentedGroup: generators `ι → G` whose range generates G, and relators `rels : Set (FreeGroup ι)` whose normal closure equals the kernel of `FreeGroup ι →* G`. Provides the canonical map `PresentedGroup P.rels →* G` and equivalences showing `PresentedGroup P.rels ≃* G` and invariance under changing presentations. Also formalizes Tietze moves (1)–(2) as equivalences of PresentedGroups: adding/removing a relator that lies in the normal closure of the others. TODO: moves (3)–(4) (add/remove generator with a defining relation). No existing definitions are modified | t-group-theory new-contributor awaiting-author | 328/0 | Mathlib.lean,Mathlib/GroupTheory/Presentation.lean | 2 | 15 | ['github-actions', 'homeowmorphism', 'jazzits', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536'] | tb65536 | 2 months ago | 123 days ago | 5 days |
| 34725 | GrigorenkoPV | feat(RingTheory/RootsOfUnity/LowDegree): quadratic, cubic, quartic, quintic roots of unity | Closes https://github.com/leanprover-community/mathlib4/pull/25907 --- Merge of https://github.com/leanprover-community/mathlib4/pull/25907 [](https://gitpod.io/from-referrer/) | new-contributor t-ring-theory awaiting-author | 247/0 | Mathlib.lean,Mathlib/Algebra/CharP/Invertible.lean,Mathlib/Algebra/QuadraticDiscriminant.lean,Mathlib/RingTheory/RootsOfUnity/LowDegree.lean | 4 | 22 | ['GrigorenkoPV', 'LLaurance', 'erdOne', 'github-actions', 'joneugster'] | nobody | 2 months ago | 82 days ago | 5 days |
| 34159 | wangying11123 | feat(Geometry/Euclidean/Similarity): Add Triangle similarity on oangle | Add theorems about triangles similarity on oangle | t-euclidean-geometry new-contributor awaiting-author | 154/1 | Mathlib/Geometry/Euclidean/Similarity.lean | 1 | 8 | ['LLaurance', 'github-actions', 'jsm28', 'wangying11123'] | jsm28 | 2 months ago | 77 days ago | 7 days |
| 33050 | mkaratarakis | feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem | Lemmas missing for the formalisation of the proof of the Gelfond–Schneider theorem --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor WIP | 238/0 | Mathlib.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/NumberTheory/Transcendental/AnalyticPart.lean,Mathlib/NumberTheory/Transcendental/AnalyticPart2.lean | 6 | 113 | ['SnirBroshi', 'github-actions', 'j-loreaux', 'mkaratarakis', 'riccardobrasca', 'vihdzp'] | riccardobrasca | 2 months ago | 86 days ago | 6 days |
| 23791 | SEU-Prime | Create AmiceTrans.lean | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-number-theory new-contributor | 2963/0 | Mathlib.lean,Mathlib/Analysis/Normed/Ring/Lemmas2.lean,Mathlib/NumberTheory/Padics/AmiceTrans.lean,Mathlib/NumberTheory/Padics/PSAC.lean,Mathlib/NumberTheory/Padics/PSAC2.lean,Mathlib/NumberTheory/Padics/PSAC3.lean,Mathlib/NumberTheory/Padics/PiGammainPS.lean,Mathlib/NumberTheory/Padics/PsiandVar.lean,Mathlib/RingTheory/AdicCompletion/Lemma.lean,Mathlib/RingTheory/PowerSeries/Comp.lean,Mathlib/Topology/ContinuousMap/ZeroAtBot.lean | 11 | 5 | ['SEU-Prime', 'github-actions', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 2 months ago | 389 days ago | 38 seconds |
| 33281 | michelsol | feat(Analysis/SpecialFunctions/Integrals): integral of 1/sqrt(1-x^2) and its integrability. | Add the integral of the derivative of arcsin and its integrability. --- - [ ] depends on: #33280 [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict t-analysis | 59/0 | Mathlib/Analysis/SpecialFunctions/Integrability/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 127 days ago | 47 minutes |
| 29777 | yuanyi-350 | feat(Functional Analysis): closed Range Theorem | - [ ] depends on: #29151 [Corollary of Hahn-Banach theorem] - [ ] depends on: #29776 [refactor ContinuousLinearMap.isOpenMap by separating it into sublemmas] --- [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR new-contributor awaiting-author t-analysis merge-conflict | 237/25 | Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/ClosedRange.lean,Mathlib/Analysis/RCLike/Lemmas.lean,Mathlib/Topology/Order/OrderClosed.lean | 5 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | faenuccio | 2 months ago | 225 days ago | 10 minutes |
| 29151 | yuanyi-350 | feat: Corollary of Hahn–Banach theorem | In this PR, I have proved [Rudin, *Functional Analysis* (Theorem 3.7)][rudin1991] which is a step in proving the Closed Range Theorem. Also, I have added tags for the corresponding theorems in Rudin to mathlib.
3.7 Theorem. Suppose B is a convex, balanced, closed set in a locally convex space $X, x_0 \in X$, but $x_0 \notin B$. Then there exists $\Lambda \in X^*$ such that $|\Lambda x| \leq 1$ for all $x \in B$, but $\Lambda x_0>1$
proof. Since $B$ is closed and convex, we can apply (b) of Theorem 3.4, with $A=\{ x_0 \}$ , to obtain $\Lambda_1 \in X^*$ such that $\Lambda_1 x_0=r e^{i \theta}$ lies outside the closure $K$ of $\Lambda_1(B)$. Since $B$ is balanced, so is $K$. Hence there exists $s, 0 |
awaiting-author new-contributor large-import t-analysis merge-conflict | 70/1 | Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/RCLike/Lemmas.lean,Mathlib/Topology/Order/OrderClosed.lean | 3 | 17 | ['faenuccio', 'fpvandoorn', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mcdoll', 'themathqueen', 'yuanyi-350'] | faenuccio | 2 months ago | 222 days ago | 20 days |
| 33712 | wangying11123 | feat(Geometry/Euclidean/Angle/Unoriented/Projection): Add sameray_orthogonalProjection_vsub_of_angle_lt | Add sameray_orthogonalProjection_vsub_of_angle_lt `sameray_orthogonalProjection_vsub_of_angle_lt` When an angle is acute, the vector to the orthogonal projection lies in the same ray as the given direction vector. | new-contributor t-euclidean-geometry awaiting-author | 20/0 | Mathlib/Geometry/Euclidean/Angle/Unoriented/Projection.lean | 1 | 4 | ['JovanGerb', 'github-actions', 'j-loreaux'] | JovanGerb | 2 months ago | 73 days ago | 39 days |
| 33786 | hdmkindom | feat(Analysis/Matrix): add Jacobian matrix for matrix-valued functions | This PR introduces the Jacobian matrix for matrix-valued functions `F : Matrix m n ℝ → Matrix p q ℝ`. The Jacobian matrix `jacobianMatrix F X` at point `X` is indexed by `(p × q) × (m × n)`, where each entry represents the partial derivative with respect to a basis element. To handle instance-mismatch issues with matrix norms, we use local Frobenius norm instances. mkdir Analysis/Matrix/Jacobian.lean ## Main definitions - `jacobianMatrix F X`: The Jacobian matrix at point `X`, defined by `jacobianMatrix F X (i, k) (j, l) = (fderiv ℝ F X (Matrix.single j l 1)) i k` ## Main theorems - `fderiv_eq_jacobian_mul`: Express the Fréchet derivative as a contraction with the Jacobian - `jacobianMatrix_comp`: Chain rule for Jacobian matrices - `jacobianMatrix_linear`, `jacobianMatrix_id`, `jacobianMatrix_const`: Basic properties - `jacobianMatrix_add`, `jacobianMatrix_smul`: Linearity properties | t-analysis new-contributor awaiting-author | 219/0 | Mathlib.lean,Mathlib/Analysis/Matrix/Jacobian.lean | 2 | 11 | ['erdOne', 'github-actions', 'jcommelin'] | sgouezel | 2 months ago | 73 days ago | 39 days |
| 30667 | FrederickPu | feat(Mathlib/Algebra/Group/Subgroup/Pointwise): subgroup mul | Title: feat: pointwise products for subgroups Description: showed the point-wise product of disjoint subgroups is equivalent to their Cartesian product. Based on https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/useful.20group.20theory.20lemmas/with/546738566. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 28/0 | Mathlib/Algebra/Group/Subgroup/Pointwise.lean | 1 | 23 | ['FrederickPu', 'eric-wieser', 'github-actions', 'plp127', 'tb65536'] | nobody | 2 months ago | 73 days ago | 1 day |
| 33793 | LTolDe | feat(MeasureTheory/Constructions/Polish/Basic): add lemma AnalyticSet.inter_nonempty_of_nowhereMeagre | add lemma AnalyticSet.inter_nonempty_of_nowhereMeagre, the main ingredient for the proof of the **Effros' Theorem**, see [#mathlib4 > Effros Theorem](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/566543328) introduce definition of a nowhere meagre set --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor awaiting-author | 37/0 | Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Topology/GDelta/Basic.lean | 3 | 8 | ['MichaelStollBayreuth', 'erdOne', 'github-actions', 'j-loreaux'] | kex-y | 2 months ago | 73 days ago | 39 days |
| 35313 | LexinonCraft | feat: IMO 2025 Q4 | This adds a solution for problem 4 from the International Math Olympiad 2025. --- | IMO new-contributor awaiting-author | 631/0 | Archive.lean,Archive/Imo/Imo2025Q4.lean | 2 | 4 | ['LexinonCraft', 'github-actions', 'jsm28'] | jsm28 | 2 months ago | 72 days ago | 3 days |
| 33276 | NicolaBernini | feat: Rename List.reverse_perm to List.reverse_perm_self and List.reverse_perm' to List.reverse_perm_iff | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author t-data merge-conflict | 17/15 | Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Data/Finset/Dedup.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Defs.lean,Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/List/Permutation.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/NumberTheory/Divisors.lean | 8 | 5 | ['Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | kim-em | 2 months ago | 123 days ago | 4 days |
| 34674 | Citronhat | feat(Algebra/Order/Ring): replace ENNReal lemmas with WithTop versions | * Add `WithTop` versions of basic multiplicative order lemmas. * Use the new `WithTop` lemmas to replace `ENNReal` proofs and address six TODOs. * Fix a typo in the `pos_of_ne_zero` alias name. | new-contributor t-algebra merge-conflict | 46/15 | Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Data/ENNReal/Operations.lean | 3 | 5 | ['Citronhat', 'Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | Ruben-VandeVelde | 2 months ago | 72 days ago | 17 days |
| 28246 | Sebi-Kumar | feat(AlgebraicTopology/FundamentalGroupoid): the n-sphere is simply connected for n > 1 | Prove that the `n`-dimensional sphere (i.e., the unit sphere centered at the origin in `(n + 1)`-dimensional real Euclidean space) is a simply connected space for `n > 1`. This proof follows Hatcher's "Algebraic Topology"; we first prove a general lemma about decomposing loops and then exploit the fact that non-surjective loops in the sphere are homotopically trivial. Note: To get this file to build, I edited `Mathlib/Tactic/Linter/DirectoryDependency.lean` to remove the restrictions on AlgebraicTopology files importing Geometry, NumberTheory, and FieldTheory files. Thank you to those who shared their expertise [here](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Warning.20that.20AlgebraicTopology.20can't.20import.20SetTheory/with/533833638). As I understand it, this is just a short-term solution, so I would appreciate feedback on what to do about this situation. Note: I am unsure where exactly the file `SimplyConnectedSphere.lean` should go or whether that is an appropriate name for the file, so feedback there would be appreciated. --- To provide additional context, this code was written as a part of the Fields Undergraduate Summer Research Program at the University of Western Ontario under the supervision of Chris Kapulkin and Daniel Carranza. - [x] depends on: #28208 - [x] depends on: #28198 - [x] depends on: #28185 [](https://gitpod.io/from-referrer/) | t-algebraic-topology new-contributor awaiting-author | 343/3 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnectedSphere.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 3 | 17 | ['dagurtomas', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | robin-carlier | 2 months ago | 70 days ago | 13 days |
| 33746 | ster-oc | feat(Algebra/Module/ZLattice): align `ZSpan.floor` to `Int.floor` API | This PR adds some of the existent lemmas about `Int.floor`, `Int.ceil` and `Int.fract` to the `ZSpan` namespace. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor merge-conflict | 353/145 | Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 3 | 8 | ['github-actions', 'joelriou', 'mathlib-merge-conflicts', 'ster-oc'] | joelriou | 2 months ago | 67 days ago | 30 days |
| 31766 | SuccessMoses | feat(Topology/EMetricSpace): continuity of arc length | fixes half of #31751 --- [](https://gitpod.io/from-referrer/) | new-contributor t-topology awaiting-author merge-conflict | 396/0 | Mathlib.lean,Mathlib/Topology/EMetricSpace/ArcLength.lean,Mathlib/Topology/EMetricSpace/BoundedVariation.lean | 3 | 40 | ['SnirBroshi', 'SuccessMoses', 'alreadydone', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 142 days ago | 2 days |
| 26479 | thefundamentaltheor3m | feat(Analysis/Complex/CauchyIntegral): Cauchy–Goursat for Unbounded Rectangles | In this PR, we prove versions of the Cauchy-Goursat theorem where the contours in question are rectangular and unbounded (ie, where the contours look like the $\bigsqcup$ symbol). I am not sure if I have formalised these in the best way, or if `Analysis.Complex.CauchyIntegral` is the best place for them (it might be prudent to reorganise the file into multiple files at some point), but I believe this is a useful result. Suggestions welcome. --- [](https://gitpod.io/from-referrer/) | new-contributor t-analysis sphere-packing awaiting-author | 205/0 | Mathlib/Analysis/Complex/CauchyIntegral.lean | 1 | 6 | ['github-actions', 'j-loreaux', 'loefflerd', 'mathlib4-merge-conflict-bot', 'thefundamentaltheor3m', 'wwylele'] | urkud | 2 months ago | 65 days ago | 34 days |
| 33247 | sun123zxy | feat(Mathlib/RingTheory/Ideal/Cotangent): dimension of cotangent spaces | It is shown that the span rank of the maximal ideal of a local ring equals the dimension of the cotangent space if the maximal ideal is finitely generated. To avoid unnecessary imports, the original `Mathlib/RingTheory/Nakayama` is now moved to `Mathlib/RingTheory/Nakayama/Basic`. --- - [ ] depends on: #33359 - [ ] depends on: #33361 - [ ] depends on: #35651 [](https://gitpod.io/from-referrer/) | file-removed new-contributor t-ring-theory WIP blocked-by-other-PR merge-conflict | 140/27 | Mathlib.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/LocalRing/Module.lean,Mathlib/RingTheory/LocalRing/Quotient.lean,Mathlib/RingTheory/Nakayama/Basic.lean,Mathlib/RingTheory/Nakayama/SpanRank.lean,Mathlib/RingTheory/Regular/RegularSequence.lean,Mathlib/RingTheory/Support.lean | 10 | 13 | ['erdOne', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sun123zxy'] | nobody | 2 months ago | 124 days ago | 3 days |
| 35735 | mkaratarakis | feat(NumberTheory): analytical properties and lower bounds for Gelfond-Schneider auxiliary function | This PR is the third component in the formalization of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem). It connects the algebraically constructed auxiliary function `R(x)` to its analytical properties, establishing the exact order of vanishing and the fundamental lower bound on the norm of its non-zero derivative evaluation. Following the argument in Loo-Keng Hua's *Introduction to Number Theory* (Chapter 17.9, equations (4) and (5)), we define the minimal non-vanishing derivative order $r$ and scale the evaluation to an algebraic integer to compute its norm. 1. (`iteratedkDeriv_R_eq_zero` & `order_geq_n`): We verify that the coefficient vector $\eta$ (chosen via Siegel's lemma in the previous PR) forces the first $n$ derivatives of the auxiliary function $R(x)$ to vanish at the points $x \in \{1, 2, \dots, m\}$. Consequently, the analytical order of $R(x)$ at these points is at least $n$. 2. We extract $r$, the exact minimal order of vanishing of $R(x)$ among all points $1 \le l \le m$, and prove that $n \le r$. 3. We define the non-zero algebraic number $\rho = (\log \alpha)^{-r} R^{(r)}(l_0)$. 4. We prove the crucial textbook step that scaling $\rho$ by $c_1^{r+2mq}$ (formalized here as `cρ`) results in an algebraic integer in $\mathcal{O}_K$. 5. Because $c_1^{r+2mq} \rho$ is a non-zero algebraic integer, the absolute value of its norm is at least $1$. We use this to formally prove the strict lower bound on the absolute norm of the unscaled $\rho$: $|N(\rho)| > c_1^{-h(r+2mq)} > c_5^{-r}$. --- - [ ] depends on: #35734 [optional extra text] [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor blocked-by-other-PR | 1141/0 | Mathlib.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlgSetup.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainOrder.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 months ago | 65 days ago | 7 minutes |
| 20238 | maemre | feat(Computability/DFA): Closure of regular languages under some set operations | This shows that regular languages are closed under complement and intersection by constructing DFAs for them. --- Closure under all other operations will be proved when someone adds the proof for DFA<->regular expression equivalence, so they are not part of this PR. [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 159/0 | Mathlib/Computability/DFA.lean,Mathlib/Computability/Language.lean | 2 | 60 | ['EtienneC30', 'YaelDillies', 'github-actions', 'maemre', 'mathlib4-merge-conflict-bot', 'meithecatte', 'urkud'] | nobody | 2 months ago | 410 days ago | 48 days |
| 22361 | rudynicolop | feat(Computability/NFA): nfa closure properties | Add the closure properties union, intersection and reversal for NFA. --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 218/2 | Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean | 2 | 91 | ['EtienneC30', 'b-mehta', 'ctchou', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 2 months ago | 361 days ago | 39 days |
| 35746 | ThomasMoulin-hub | feat (Algebra/Endomorphisms): add kernels lemma from the missing undergraduate mathematics in mathlib | Add helper theorem inside Mathlib.Algebra.Polynomial.Smeval.lean and created a new file Mathlib/RingTheory/Polynomial/KernelDecomposition.lean that implements the kernels lemma from the missing undergraduate mathematics in mathlib list. This file also contains intermediate results needed for the main lemma. | new-contributor | 75/0 | Mathlib/Algebra/Polynomial/Smeval.lean,Mathlib/RingTheory/Polynomial/Basic.lean | 2 | 2 | ['github-actions'] | nobody | 2 months ago | unknown | 0 seconds |
| 23929 | meithecatte | feat(Computability/NFA): improve bound on pumping lemma | --- - [x] depends on: #25321 [](https://gitpod.io/from-referrer/) | t-computability awaiting-zulip new-contributor awaiting-author | 101/10 | Mathlib/Computability/EpsilonNFA.lean,Mathlib/Computability/NFA.lean | 2 | 42 | ['YaelDillies', 'dagurtomas', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'meithecatte'] | nobody | 2 months ago | 327 days ago | 34 days |
| 35128 | DAE123456 | feat : Define anti_pascal | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 81/0 | Archive.lean,Archive/Imo/Imo2018Q3.lean | 2 | 5 | ['DAE123456', 'github-actions', 'grunweg', 'vihdzp'] | nobody | 2 months ago | 79 days ago | 8 minutes |
| 8102 | miguelmarco | feat(Tactic): add `unify_denoms` and `collect_signs` tactics | This PR adds four new tactics: - `unify_denoms` tries to put expressions with several divisions in a form with only one division. In the case of fields, it works similarly to `field_simp`, but if the hypothesis about denominators being nonzero are not present, it assumes them, and leaves them as new goals to prove. In that sense, it is an "unsafe" tactic (but can be useful nevertheless, for example when you can't find which exact hypothesis is missing). It also works with expressions of naturals and Euclidean domains, assuming the corresponding hypothesis about the denominators dividing the numerators. - `unify_denoms!` extends `unify_denoms` to work with (in)equalities, assuming also that the denominators, once in normal form, are positive. - `collect_signs` works similarly with expressions using sums and substractions: it tries to put them in a form of one sum minus other sum. In the case of working with naturals, it assumes that we never substract a bigger number from a smaller one. Both are implemented essentially as a macro that combines several rewriting rules. Some new lemmas with the corresponding rules are added. --- | please-adopt new-contributor merge-conflict modifies-tactic-syntax good first issue t-meta | 407/0 | Mathlib.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CollectSigns.lean,Mathlib/Tactic/UnifyDenoms.lean,MathlibTest/unify_denoms.lean,scripts/noshake.json | 7 | 55 | ['Paul-Lez', 'YaelDillies', 'github-actions', 'joneugster', 'kbuzzard', 'mathlib4-merge-conflict-bot', 'miguelmarco'] | nobody | 2 months ago | 352 days ago | 17 days |
| 35603 | 2500223210-max | feat(GroupTheory/Frattini): add more theorems | Add some contents about frattini subgroup into Mathlib GroupTheory Frattini.lean,including * (convenient lemma)A subgroup contained in all maximal subgroup is contained in the FRattini subgroup * A subgroup (say H) has a proper complement (meaning for some proper subgroup K, K and H generate the whole group)if and only if it is not contained in the Frattini subgroup. * A group is cyclic iff its Frattini factor(the quotient group wrt Frattini subgroup) is cyclic. * The Frattini factor of a finite p-group is elementary abelian(that is,an abelian group G with Gᵖ={1}) * A finite p-group has trivial Frattini subgroup iff the group is elementary abelian. * Burnside theorem of Frattini factor of finite p-group. --- | new-contributor t-group-theory large-import awaiting-author | 764/1 | Mathlib/GroupTheory/Frattini.lean | 1 | 3 | ['github-actions', 'tb65536'] | nobody | 2 months ago | 69 days ago | 1 minute |
| 33791 | PhoenixIra | feat: Generalization of FixedPointApproximants to CompletePartialOrder | --- This PR provides a generalization of FixedPointApproximants to CompletePartialOrder. Not every theorem can be generalized, as sometimes we require additional conditions (namely `x ≤ f x`) in order to guarantee that the set is directed and thus the supremum is well-defined. This is not necessary in a CompleteLattice. [](https://gitpod.io/from-referrer/) | new-contributor t-order merge-conflict | 223/100 | Mathlib/Order/CompletePartialOrder.lean,Mathlib/SetTheory/Ordinal/FixedPointApproximants.lean | 2 | 21 | ['PhoenixIra', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | PhoenixIra and vihdzp | 2 months ago | 62 days ago | 38 days |
| 35734 | mkaratarakis | feat(NumberTheory): matrix bounds and Siegel's lemma application for Gelfond-Schneider | This PR is the second component in the formalization of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem), establishing the transcendence of $\alpha^\beta$. Building on the algebraic setup from the previous PR #35733, this file establishes analytical bounds on the linear system matrix and applies Siegel's Lemma (Lemma 8.2) to extract a bounded, non-trivial integer solution vector. We establish the exact upper bounds required to construct the auxiliary integer function $R(x)$. `c₃` and Matrix Bounds (`house_matrixA_le`)**: We define the bounding constant $c_3$, which aggregates the base bounds $c_2$ and the maximal houses of the algebraic preimages $\alpha', \beta', \gamma'$. Through extensive algebraic manipulation, we formally prove that the house of the entries in our linear system matrix $A$ is strictly bounded by $c_3^n * n^{(n - 1) / 2}$. Using the bounds established above, we apply `house.exists_ne_zero_int_vec_house_le` (a formalization of Lemma 8.2, p. 490) to guarantee the existence of a non-trivial vector of algebraic integers $\eta$ in the kernel of $A$. We define the solution bounding constant $c_4$ and prove the textbook bound that the house of our resulting coefficient vector $\eta$ satisfies $\forall k, \|\eta_k\| \leq c_4^n * n^{(n + 1) / 2}$. - [ ] depends on: #35733 [](https://gitpod.io/from-referrer/) | new-contributor t-number-theory blocked-by-other-PR | 872/5 | Mathlib.lean,Mathlib/NumberTheory/NumberField/House.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlgSetup.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 months ago | 65 days ago | 5 minutes |
| 26013 | tsuki8 | feat(Data/Finset/Card,Data/Set/Finite/Basic): TODO needs a better title | add `card_bijOn` and `finset_subset_preimage_of_finite_image`
Add `card_bijOn`: proves that for a bijection between finsets, their cardinalities are equal
Add `finset_subset_preimage_of_finite_image`: constructs a finset subset preserving image cardinality
Co-authored-by: Junyu Guo |
awaiting-author t-data new-contributor | 15/0 | Mathlib/Data/Finset/Card.lean,Mathlib/Data/Set/Finite/Basic.lean | 2 | 6 | ['Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 304 days ago | 13 days |
| 35442 | dhyan-aranha | feat: Affine line with doubled origin counter example | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author t-algebraic-geometry | 305/0 | Counterexamples.lean,Counterexamples/AffineLineWithDoubledOrigin.lean,Mathlib/AlgebraicGeometry/Limits.lean,Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean | 4 | 21 | ['BryceT233', 'chrisflav', 'dhyan-aranha', 'github-actions'] | nobody | 1 month ago | 73 days ago | 1 hour |
| 28286 | bwangpj | feat(Geometry/Manifold/ContMDiff): basic lemmas for analytic (`C^ω`) functions | Add basic lemmas relating `ContMDiff` in the `C^ω` case to being `Analytic` on charts.
This is upstreamed from [https://github.com/girving/ray](https://github.com/girving/ray).
Co-authored-by: Geoffrey Irving |
awaiting-author t-differential-geometry new-contributor | 36/0 | Mathlib/Geometry/Manifold/ContMDiff/Defs.lean | 1 | 14 | ['bwangpj', 'girving', 'github-actions', 'grunweg', 'kbuzzard', 'mathlib-merge-conflicts', 'sgouezel'] | sgouezel | 1 month ago | 234 days ago | 27 days |
| 35332 | yisiox | feat(Computability): regular expressions match a regular language | This PR adds a proof that the language matched by a regular expression is a regular language. This is achieved by the following constructions and proofs of their correctness - A DFA `epsilon` which accepts the empty language - A DFA `char (a : α)` which accepts the language containing only a single symbol - An Epsilon-NFA `concat (M₁ : εNFA α σ₁) (M₂ : εNFA α σ₂)` which accepts the concatenation of the languages of two Epsilon-NFAs - An Epsilon-NFA `kstar (M : εNFA α σ)` which accepts the Kleene star of a language of an Epsilon-NFA The following theorems on closure are added - `IsRegular.zero` - `IsRegular.one` - `IsRegular.top` - `IsRegular.singleton` - `IsRegular.mul` - `IsRegular.kstar` which demonstrates - `IsRegular.matches` --- [](https://gitpod.io/from-referrer/) | t-computability new-contributor | 475/0 | Mathlib/Computability/DFA.lean,Mathlib/Computability/EpsilonNFA.lean | 2 | 2 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 14313 | grhkm21 | feat(RepresentationTheory/FdRep): FdRep is a full subcategory of Rep | ``` /-- Equivalence between `FDRep` and the full subcategory of finite dimensional `Rep`. -/ def equivFiniteDimensional : FDRep k G ≌ FullSubcategory (fun V : Rep k G ↦ FiniteDimensional k V) ``` | merge-conflict t-algebra t-category-theory new-contributor | 47/8 | Mathlib/RepresentationTheory/FDRep.lean | 1 | 21 | ['fpvandoorn', 'github-actions', 'grhkm21', 'joelriou', 'kim-em', 'mathlib-bors'] | nobody | 1 month ago | 648 days ago | 4 days |
| 33592 | nielstron | feat(Computability/ContextFreeGrammar): mapping between two types of nonterminal symbols | This PR picks up https://github.com/leanprover-community/mathlib4/pull/15895 and resolves the failing lemma by redefining Good symbols. --- I checked that https://github.com/leanprover-community/mathlib4/pull/13514 builds correctly when based on this build. PR for that is #33599 This is my first contribution please let me know of any changes I should outline. [](https://gitpod.io/from-referrer/) | awaiting-author t-computability new-contributor | 160/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 34 | ['YaelDillies', 'github-actions', 'madvorak', 'nielstron'] | nobody | 1 month ago | 105 days ago | 10 days |
| 35144 | daniel-carranza | feat(CategoryTheory/Enriched): tensor product of enriched categories | For a braided monoidal category `V`, defines the tensor product of `V`-categories `C` and `D`, and shows that the type of `V`-functors out of the tensor product `C \times D` is equivalent to the type of "enriched bifunctors" `EnrichedBifunctor V C D`. --- This work originates from infinity-cosmos project, where it is used to formalize the notion of cotensors in an enriched category. There are some additional coherence lemmas in a braided monoidal category which have been added. Currently, line 209 violates the style guideline that terminal simp calls should not be squeezed. When I tried to replace this with a single `simp`, I get an error message: `maximum recursion depth has been reached`. Any suggestions (either with this or anything else) are greatly appreciated - thank you! [](https://gitpod.io/from-referrer/) | new-contributor t-category-theory infinity-cosmos awaiting-author | 333/0 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/TensorProductCategory.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean | 3 | 12 | ['daniel-carranza', 'emilyriehl', 'github-actions', 'joelriou', 'robin-carlier'] | nobody | 1 month ago | 78 days ago | 23 minutes |
| 35436 | daniel-carranza | feat(CategoryTheory/Monoidal/Closed): Prove the isomorphism of internal hom objects C(x \otimes y, z) and C(y, C(x, z)) | Prove the currying-uncurrying isomorphism `C(x \otimes y, z) \iso C(y, C(x, z))` between internal hom objects of a closed monoidal category `C`. --- This result is connected to the infinity-cosmos project, and is used to prove that a closed monoidal category enriched in itself admits all cotensors. ~Line 81 currently contains a one-line proof in tactics mode `exact rfl`. When trying to use `rfl` outside of tactics mode, an error is thrown~ (Fixed, thank you @robin-carlier!). Any help with this (or any other aspect of the formalization) is greatly appreciated! [](https://gitpod.io/from-referrer/) | new-contributor t-category-theory infinity-cosmos delegated | 89/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Closed/InternalCurrying.lean | 2 | 15 | ['dagurtomas', 'daniel-carranza', 'github-actions', 'joelriou', 'mathlib-bors', 'riccardobrasca', 'robin-carlier'] | adamtopaz | 1 month ago | 63 days ago | 7 days |
| 27226 | xcloudyunx | feat(Combinatorics/SimpleGraph): Add Subgraph.inclusion_edge_apply_coe and inclusion_edgeSet_apply_coe | This PR continues the work from #25248. Original PR: https://github.com/leanprover-community/mathlib4/pull/25248 | awaiting-author t-combinatorics new-contributor merge-conflict | 14/0 | Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 1 | 4 | ['b-mehta', 'github-actions', 'mathlib-merge-conflicts', 'xcloudyunx'] | b-mehta | 1 month ago | 262 days ago | 25 days |
| 33688 | Citronhat | feat(PMF): add expectation lemmas for Poisson PMF | This PR adds some basic results about the Poisson distribution, its `PMF`, and its expectation. **New lemmas:** * `poissonPMF_apply` — an unfolding lemma for `poissonPMF`. * `poissonPMFReal_mul_eq_succ_mul` — the standard recursion identity for the Poisson mass function. * `poissonPMFReal_hasSum_nmul` — shows that `fun n ↦ poissonPMFReal r n * n` has sum `r`. * `poissonPMF_tsum_nmul` — the corresponding identity at the level of the `PMF`. * `poissonPMF_coe_tsum_nmul` — the same result after coercion to `ℝ`. Both `ℝ`-valued and `ℝ≥0∞`-valued formulations are included so that these results can be used conveniently in both Lebesgue and Bochner integration contexts. | new-contributor t-measure-probability awaiting-author merge-conflict | 21/0 | Mathlib/Probability/Distributions/Poisson.lean | 1 | 11 | ['Citronhat', 'DavidLedvinka', 'github-actions', 'mathlib-merge-conflicts', 'urkud'] | urkud | 1 month ago | 66 days ago | 47 days |
| 34005 | MSpill | feat: inverse function theorem for manifolds (concrete version) | Proves the inverse function theorem for manifolds: given manifolds $M, N$ and a $C^n$ map $f : M \to N$ whose differential is a linear isomorphism at $p \in M$, then $f$ is a local diffeomorphism at $p$, provided that both $p$ and its image are interior points. The proof proceeds in 4 main steps: 1. Define composition of partial diffeomorphisms 2. Show that the extended chart at an interior point can be restricted to an open set on which it is a partial diffeomorphism, viewing the model vector space as a manifold modelled on itself trivially 3. Use the inverse function theorem (applied to $f$ written in coordinates) to obtain a partial diffeomorphism between model vector spaces 4. Compose with chart diffeomorphisms to obtain a partial diffeomorphism between the manifolds. ------ [](https://gitpod.io/from-referrer/) | awaiting-author t-differential-geometry new-contributor merge-conflict | 232/3 | Mathlib/Geometry/Manifold/LocalDiffeomorph.lean | 1 | 12 | ['MSpill', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | grunweg | 1 month ago | 106 days ago | 18 minutes |
| 34830 | parabamoghv | feat(CategoryTheory/Monoidal): add definition of categorical groups | This PR defines of categorical groups, also known as coherent 2-groups, in mathlib. Motivation: Categorical groups are well-studied structures in monoidal category theory, but are not currently available in mathlib. The definitions in this PR follow the existing design patterns used for Category, MonoidalCategory, and BraidedCategory. This PR focuses on setting up the core structure and notation. Basic lemmas and further developments will be provided in a subsequent PR. --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor WIP merge-conflict | 163/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/CategoricalGroups/Basic.lean | 2 | 27 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'parabamoghv', 'robin-carlier'] | robin-carlier | 1 month ago | 70 days ago | 5 days |
| 35684 | spitters | feat(CategoryTheory/MarkovCategory): Kleisli PMF is a Markov category | Add `Mathlib/CategoryTheory/MarkovCategory/KleisliPMF.lean` showing that `KleisliCat PMF` is a `MarkovCategory`. Uses `Prod` as tensor and `PUnit` as unit; reuses Mathlib's existing `KleisliCat`, `LawfulMonad PMF`, and `MarkovCategory` infrastructure. Builds the full instance stack: MonoidalCategory → BraidedCategory → SymmetricCategory → CopyDiscardCategory → MarkovCategory --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author merge-conflict | 323/1 | Mathlib.lean,Mathlib/CategoryTheory/MarkovCategory/KleisliPMF.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 3 | 6 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'spitters'] | nobody | 1 month ago | 63 days ago | 2 days |
| 36503 | Mrigna01 | Add false theorem test file | --- [](https://gitpod.io/from-referrer/) | new-contributor | 135/0 | Mathlib/FalseBench/FalseTheorems.lean | 1 | 3 | ['github-actions'] | nobody | 1 month ago | 50 days ago | 6 minutes |
| 14603 | awueth | feat: degree is invariant under graph isomorphism | --- Mathlib has the definition `SimpleGraph.Iso.mapNeighborSet` which is an equivalence between neighbor sets induced by an isomorphism. Would it be beneficial to add the same equivalence for `neighborFinset`? [](https://gitpod.io/from-referrer/) | WIP t-combinatorics new-contributor | 24/0 | Mathlib/Combinatorics/SimpleGraph/Map/Finite.lean | 1 | 12 | ['SnirBroshi', 'awueth', 'github-actions', 'jcommelin', 'kim-em', 'urkud'] | nobody | 1 month ago | 627 days ago | 31 days |
| 33599 | nielstron | feat(Computability/ContextFreeGrammar): closure under union | --- This PR picks up https://github.com/leanprover-community/mathlib4/pull/13514 and resolves the outstanding errors. - [ ] depends on: #33592 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-computability new-contributor | 498/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 105 days ago | 10 days |
| 9605 | davikrehalt | feat(Data/Finset & List): Add Lemmas for Sorting and Filtering | This PR includes several useful lemmas to the Data/Finset and Data/List modules in Lean's mathlib: 1. `toFinset_filter` (List): Shows that filtering commutes with toFinset. 2. `toFinset_is_singleton_implies_replicate` (List): Shows a list with a singleton toFinset is a List.replicate. 3. `filter_sort_commute` (Finset): Sorting and filtering can be interchanged in Finsets. 4. `Sorted.filter` (List): A sorted list stays sorted after filtering. 5. `Sorted.append_largest` (List): Appending the largest element keeps a list sorted. 6. `sort_monotone_map` (Finset): Relates sorting of a Finset after mapping to sorting of a list. 7. `sort_insert_largest` (Finset): Sorting a Finset with an inserted largest element. 8. `sort_range` (Finset): Sorting a range in a Finset equals the corresponding range list. 9. ~~`filter_eval_true` (List): Filtering a list with a predicate always true keeps the list unchanged.~~ 10. ~~`filter_eval_false` (List): Filtering with an always-false predicate gives an empty list.~~ 11. ~~`pairwise_concat` (List): Iff condition for Pairwise relation in concatenated lists (similar to pairwise_join).~~ 12. `list_map_toFinset` (Finset): toFinset commutes with map under injection --- - [x] depends on: #15952 This is my first PR to mathlib, so I'm not too familiar with etiquette's and more specifically there are two proofs in the PR which uses aesop, and I am not sure if it's frowned upon. I kept the aesop in there for now as I couldn't construct very short proofs otherwise. The sort_range function proof was suggested in https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/Computing.20Finset.20sort.20of.20Finset.20range/near/410346731 by Ruben Van de Velde. Thanks for your time for improving this PR. | please-adopt t-data new-contributor merge-conflict awaiting-author | 71/0 | Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Sort.lean,Mathlib/Data/List/Sort.lean | 4 | 30 | ['YaelDillies', 'davikrehalt', 'eric-wieser', 'github-actions', 'jcommelin', 'urkud', 'vihdzp'] | nobody | 1 month ago | 830 days ago | 12 days |
| 36529 | idontgetoutmuch | Connection 1 form scribbles | Some thoughts on connection 1-forms - not meant to be ever merged but here for convenience of discussion | new-contributor t-differential-geometry | 496/52 | Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/Algebra/FundamentalVectorField.lean,Mathlib/Geometry/Manifold/IntegralCurve/Compact.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Order/Filter/Prod.lean | 5 | 2 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 15720 | znssong | feat(SimpleGraph): The Bondy-Chvátal theorem | The proof of the Bondy-Chvátal theorem, with Dirac's theorem and Ore's theorem as its corollary. - [x] depends on: #15536 - [ ] depends on: #15711 - [ ] depends on: #15578 | merge-conflict blocked-by-other-PR t-combinatorics new-contributor | 903/3 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/BondyChvatal.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Combinatorics/SimpleGraph/Walk.lean,Mathlib/Dynamics/FixedPoints/Basic.lean,Mathlib/Dynamics/FixedPoints/Increasing.lean | 8 | 3 | ['github-actions', 'grunweg'] | nobody | 1 month ago | 627 days ago | 29 minutes |
| 22314 | shetzl | feat: add leftmost derivations for context-free grammars | Leftmost derivations are often easier to reason about than arbitrary derivations. This PR adds leftmost variants of Rewrites, Produces and Derives to the existing definition of context-free grammars and proves that a string of terminals can be derived iff it can be leftmost derived.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 383/0 | Mathlib.lean,Mathlib/Computability/LeftmostDerivation.lean | 2 | 55 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 1 month ago | 357 days ago | 72 days |
| 31610 | rudynicolop | feat(Computability/NFA): Kleene star closure for Regular Languages via NFA | This PR constructs a Kleene star closure for non-epsilon NFAs, and proves that regular languages are closed under Kleene star. The NFA construction is `NFA.kstar`. The main theorems are: - `NFA.accepts_kstar`: demonstrates that `M.kstar` accepts the Kleene star closure of the language of `M`. - `IsRegular.kstar`: demonstrates that regular languages are closed under Kleene star. There is an onging zulip discussion about regular languages in Mathlib: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Regular.20languages.3A.20the.20review.20queue/with/553759136 This discussion is also tracked at #24205. Furthermore, the construction and proofs in this PR are heavily inspired by @TpmKranz from his #15651. #15651 supersedes this PR, so if it is accepted then this PR is not needed. --- - [x] depends on: #31038 [](https://gitpod.io/from-referrer/) | t-computability new-contributor awaiting-author awaiting-CI | 405/7 | Mathlib/Computability/NFA.lean | 1 | 16 | ['YaelDillies', 'ctchou', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 107 days ago | 43 days |
| 30872 | rudynicolop | feat(Computability/NFA): NFA closure under concatenation | This PR proves that regular languages are closed under concatenation via a direct construction on `NFA`s without `εNFA` nor ε-transitions. The main new definitions and results include: - `M1.concat M2`, the concatenation of `NFA`s `M1` and `M2`, a direct construction without ε-transitions. - Theorem `accepts_concat : (M1.concat M2).accepts = M1.accepts * M2.accepts`, showing the correctness of the construction. - Theorem `IsRegular.mul`, showing that regular languages are closed under concatenation. --- - [x] depends on: #31038 [](https://gitpod.io/from-referrer/) | t-computability new-contributor awaiting-author | 104/7 | Mathlib/Computability/NFA.lean | 1 | 67 | ['YaelDillies', 'ctchou', 'eric-wieser', 'github-actions', 'lambda-fairy', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'rudynicolop'] | nobody | 1 month ago | 91 days ago | 59 days |
| 36587 | yhx-12243 | feat(Algebra/GCDMonoid): Distributive lattice structure for Associates in GCDMonoid | Add a distributive lattice structure for `Associates α` in `GCDMonoid`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 61/3 | Mathlib.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/GCDMonoid/DistribLattice.lean | 3 | 2 | ['github-actions'] | nobody | 1 month ago | 46 days ago | 47 minutes |
| 36323 | SproutSeeds | feat(Inversion): discontinuity and center/global fderiv formulas | Part of #5939 Adds the discontinuity-at-center lemma for inversion and derives the center/global `fderiv` formulas from it. This draft currently builds on the preceding cobounded-tendsto lemma from #36313 while that earlier slice is under review. Scope is limited to `Mathlib/Geometry/Euclidean/Inversion/Calculus.lean`. Tools used: Codex 5.3 extra high --- Happy to adjust naming, placement, or proof style based on maintainer preference. | t-euclidean-geometry new-contributor LLM-generated | 65/0 | Mathlib/Geometry/Euclidean/Inversion/Basic.lean,Mathlib/Geometry/Euclidean/Inversion/Calculus.lean | 2 | 2 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 35651 | sun123zxy | feat(Mathlib/RingTheory/Ideal/Cotangent): `Submodule.map` definition of cotangent spaces | This PR adds an alternative definition of the cotangent space as an image under the R-module quotient map. --- Split from PR #33247 [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 32/18 | Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean | 2 | 20 | ['chrisflav', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'sun123zxy'] | chrisflav | 1 month ago | 46 days ago | 16 days |
| 36757 | alok | feat(Order/Filter): add Filter.IsFree and Filter.IsNonprincipal | ## Summary Adds two filter predicates and their basic API: - **`Filter.IsFree`**: no point belongs to every set (`f.ker = ∅`), equivalently `f ≤ cofinite` - **`Filter.IsNonprincipal`**: not equal to `𝓟 s` for any set `s` Every free `NeBot` filter is non-principal (`IsFree.isNonprincipal`), but the converse fails for general filters (e.g. `𝓝 x` in a non-discrete T₁ space is non-principal but not free). For ultrafilters the two notions coincide (`Ultrafilter.isNonprincipal_iff_isFree`). On finite types, no `NeBot` filter is free (`not_isFree_of_neBot`). ## Test plan - [x] `lake build Mathlib.Order.Filter.Cofinite` passes - [x] `lake build Mathlib.Order.Filter.Ultrafilter.Basic` passes 🤖 Generated with [Claude Code](https://claude.com/claude-code) | t-order new-contributor | 98/1 | Mathlib/Order/Filter/Cofinite.lean,Mathlib/Order/Filter/Ultrafilter/Basic.lean | 2 | 2 | ['github-actions'] | nobody | 1 month ago | 45 days ago | 1 hour |
| 35058 | GrigorenkoPV | chore: move tendsto_{floor,ceil}_at{Top,Bot} | Moves: - Topology.Algebra.Order.Floor.tendsto_floor_atTop -> Order.Filter.AtTopBot.Floor.tendsto_floor_atTop - Topology.Algebra.Order.Floor.tendsto_floor_atBot -> Order.Filter.AtTopBot.Floor.tendsto_floor_atBot - Topology.Algebra.Order.Floor.tendsto_ceil_atTop -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atTop - Topology.Algebra.Order.Floor.tendsto_ceil_atBot -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atBot --- Tracked in #7987 [](https://gitpod.io/from-referrer/) | new-contributor large-import awaiting-author | 22/25 | Mathlib/Order/Filter/AtTopBot/Floor.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 2 | 3 | ['GrigorenkoPV', 'github-actions', 'j-loreaux'] | nobody | 1 month ago | 51 days ago | 27 days |
| 34876 | GrigorenkoPV | feat(Tactic/AssumptionQuestion): add `assumption?` tactic | --- As requested in #10361 TODO: maybe add some tests? [](https://gitpod.io/from-referrer/) | t-meta new-contributor awaiting-author | 85/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/AssumptionQuestion.lean,Mathlib/Tactic/Common.lean,MathlibTest/AssumptionQuestion.lean,scripts/noshake.json | 6 | 5 | ['GrigorenkoPV', 'SnirBroshi', 'github-actions', 'joneugster'] | joneugster | 1 month ago | 84 days ago | 23 hours |
| 34814 | GrigorenkoPV | feat(Tactic/ClearUnneeded): add `clear_unneeded` tactic | --- The simplest version suggested in https://github.com/leanprover-community/mathlib4/issues/25319 [](https://gitpod.io/from-referrer/) | t-meta new-contributor please-merge-master awaiting-author | 94/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ClearUnneeded.lean,Mathlib/Tactic/Common.lean,MathlibTest/ClearUnneeded.lean,scripts/noshake.json | 6 | 12 | ['BoltonBailey', 'GrigorenkoPV', 'github-actions', 'joneugster'] | joneugster | 1 month ago | 84 days ago | 2 days |
| 35738 | GrigorenkoPV | perf: remove some `aesop`s and `grind`s | --- Needs benchmarking. After that I can split it into several smaller portions, if needed. [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author | 236/92 | Mathlib/Data/Finset/Card.lean,Mathlib/Data/Rel.lean,Mathlib/Data/Set/Lattice/Image.lean,Mathlib/Data/Set/Prod.lean,Mathlib/Logic/Equiv/Prod.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/SupIndep.lean | 8 | 7 | ['github-actions', 'mathlib-merge-conflicts', 'themathqueen', 'vihdzp'] | nobody | 1 month ago | 65 days ago | 12 hours |
| 31092 | FlAmmmmING | feat(Algebra/Group/ForwardDiff.lean): Add theorem `sum_shift_eq_fwdDiff_iter`. | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor delegated | 17/1 | Mathlib/Algebra/Group/ForwardDiff.lean | 1 | 20 | ['BeibeiX0', 'FlAmmmmING', 'Ruben-VandeVelde', 'dagurtomas', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 99 days ago | 54 days |
| 32608 | PrParadoxy | feat(LinearAlgebra/PiTensorProduct): API for PiTensorProducts indexed by sets | This PR addresses a TODO item in LinearAlgebra/PiTensorProduct.lean: * API for the various ways ι can be split into subsets; connect this with the binary tensor product -- specifically by describing tensors of type ⨂ (i : S), M i, for S : Set ι. Our primary motivation is to formalise the notion of "restricted tensor products". This will be the content of a follow-up PR. Beyond that, the Set API is natural in contexts where the index type has an independent interpretation. An example is quantum physics, where ι ranges over distinguishable degrees of freedom, and where its is common practice to annotate objects by the set of indices they are defined on. --- Stub file with preliminary definition of the restricted tensor product as a direct limit of tensors indexed by finite subsets of an index type: https://github.com/PrParadoxy/mathlib4/blob/restricted-stub/Mathlib/LinearAlgebra/PiTensorProduct/Restricted.lean --- - [x] depends on: #32598 [](https://gitpod.io/from-referrer/) | new-contributor awaiting-zulip t-algebra | 300/2 | Mathlib.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Set.lean | 3 | 28 | ['PrParadoxy', 'dagurtomas', 'eric-wieser', 'github-actions', 'goliath-klein', 'leanprover-radar', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 130 days ago | 10 days |
| 32745 | LTolDe | feat(Topology/Algebra): add MulActionConst.lean | add Topology/Algebra/MulActionConst.lean introduce class `ContinuousSMulConst` for a scalar multiplication that is continuous in the first argument, in analogy to `ContinuousConstSMul` define `MulAction.ball x U` as the set `U • {x}` given `[SMul G X] (x : X) (U : Set G)` The lemmas shown here will be useful to prove the **Effros Theorem**, see [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/558712441). --- [](https://gitpod.io/from-referrer/) | awaiting-author new-contributor t-topology | 117/0 | Mathlib.lean,Mathlib/Topology/Algebra/MulActionConst.lean | 2 | 8 | ['LTolDe', 'github-actions', 'urkud'] | nobody | 1 month ago | 108 days ago | 16 days |
| 36119 | Ruizsolveall | feat(Topology/Covering): fundamental group of the circle is ℤ | - Proves that the fundamental group of the circle `π₁(S¹, 0)` is isomorphic to `ℤ`, via covering space theory. - Constructs the winding number map `nLoop : ℤ → Path 0 0` on `AddCircle 1`, and proves it is surjective (`nLoop_surjective`), injective (`nLoop_homotopic_iff`), and additive (`nLoop_add`). - Assembles these into the group isomorphism `windingNumberIso : Multiplicative ℤ ≃* FundamentalGroup (AddCircle 1) 0`. ## Approach Uses the covering map `ℝ → AddCircle 1` and unique path lifting to establish the bijection between homotopy classes of loops and integers (winding numbers). Homotopy invariance of lifted endpoints gives injectivity; surjectivity follows from lifting arbitrary loops. Additivity uses path concatenation of lifts in the simply connected total space `ℝ`. ## AI disclosure I used Claude (Anthropic) to write the PR description, code comments, and to help refine code style. The proof strategy and all Lean code are my own. I understand and can vouch for all the code in this PR. | t-topology new-contributor awaiting-author LLM-generated | 236/0 | Mathlib.lean,Mathlib/Topology/Covering/FundamentalGroupCircle.lean | 2 | 26 | ['Ruizsolveall', 'SnirBroshi', 'b-mehta', 'dagurtomas', 'github-actions', 'grunweg', 'vihdzp'] | nobody | 1 month ago | 49 days ago | 8 days |
| 36487 | samueloettl | feat(Dynamics): Ergodicity characterization | --- - [ ] depends on: #35402 - [x] depends on: #35451 This is a work in progress for a characterization of ergodicity via a Birkhoff Average. Coarse Feedback is very encouraged. [](https://gitpod.io/from-referrer/) | WIP new-contributor large-import blocked-by-other-PR | 421/1 | Mathlib/Dynamics/Ergodic/Function.lean,Mathlib/Dynamics/Ergodic/OnAverageIndependent.lean,Mathlib/Topology/MetricSpace/Pseudo/Basic.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 51 days ago | 2 minutes |
| 35951 | parabamoghv | feat(CategoryTheory/Monoidal): evaluation coevaluation isomorphisms | This PR adds four features to rigid categories: 1. `coevaluation_evaluation` and `evaluation_coevaluation` as isomorphism equalities: Using `IsIso` instances for the `evaluation` and `coevaluation` morphisms, we promote the morphism equalities to isomorphism equalities. 2. `ExactPairing Y X` from `ExactPairing X Y`: Using an exact pairing and `IsIso` instances for both `evaluation` and `coevaluation`, we swap the exact pairing by inverting the evaluation and coevaluation morphisms. Any suggestions for the definition name are welcome. Right now it is `ExactPairing.Symm`. The second choice was `ExactPairing.Swap`. 3. `HasLeftDual X` from `HasRightDual X`: Using a `HasRightDual X` instance and relevant `IsIso` instances, we construct a left dual. Similar construction for the other way. 4. `LeftDual` isomorphic to `RightDual`: Using relevant `IsIso` instances, we provide the isomorphism from the left dual of an object to the right dual. This can be achieved in two ways: either by using `leftDualIso` or using `rightDualIso`. We will prove in a subsequent PR that both these isomorphisms are equal. Motivation: This is part of an effort to formalize CategoricalGroups, which can be defined as right rigid groupoids. The approach is motivated by the discussion in [#34830](https://github.com/leanprover-community/mathlib4/pull/34830). Any comments or suggestions are welcome, especially about the naming. --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author | 64/2 | Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean | 1 | 18 | ['dagurtomas', 'github-actions', 'joelriou', 'parabamoghv', 'robin-carlier'] | robin-carlier | 1 month ago | 43 days ago | 7 days |
| 34028 | floor-licker | feat(SimpleGraph): add max-flow/min-cut weak duality | This PR introduces a basic s–t flow setup for undirected SimpleGraphs and proves the standard weak-duality inequality: for any feasible flow f and any s–t cut S, value f ≤ cutCapacity S. This is a small, self-contained lemma I extracted while working on larger graph-theoretic formalizations, in particular, results that will ultimately rely on a full max-flow/min-cut theorem. The full MFMC equality/existence statement is not included here. This is the weak-duality direction (∀ f S, value f ≤ cutCapacity S). | t-combinatorics new-contributor | 169/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/MaxFlowMinCut.lean | 2 | 14 | ['SnirBroshi', 'floor-licker', 'github-actions', 'mathlib-merge-conflicts'] | kmill | 1 month ago | 42 days ago | 60 days |
| 26413 | michaellee94 | feat: existence of maximal solutions for ODEs meeting Picard-Lindelöf conditions | Add existence proof for maximal solution of ODE using Picard-Lindelöf and a uniqueness theorem using Grönwall's lemma. --- - [x] depends on: #26382 - [ ] depends on: #29186 - [ ] depends on: #35043 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-analysis merge-conflict | 1300/431 | Mathlib.lean,Mathlib/Analysis/ODE/Basic.lean,Mathlib/Analysis/ODE/ExistUnique.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/MaximalSolution.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Analysis/ODE/Transform.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Geometry/Manifold/IntegralCurve/Transform.lean,Mathlib/Geometry/Manifold/IntegralCurve/UniformTime.lean,docs/1000.yaml,docs/undergrad.yaml | 13 | 95 | ['botbaki-review', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'michaellee94', 'winstonyin'] | nobody | 1 month ago | 305 days ago | 1 hour |
| 36825 | danlyng | feat(MeasureTheory/Integral/IntegralEqImproper): add Iic variants of nonneg/nonpos derivative integrability and FTC-2 | Add the `Iic` counterparts of the existing `Ioi` results for automatic integrability of derivatives on semi-infinite intervals and the corresponding corollaries computing the integral value. Additionally, apply minor fixes to existing docstrings. New declarations: - `integrableOn_Iic_deriv_of_nonneg` / `integrableOn_Iic_deriv_of_nonneg'` - `integrableOn_Iic_deriv_of_nonpos` / `integrableOn_Iic_deriv_of_nonpos'` - `integral_Iic_of_hasDerivAt_of_nonneg` / `integral_Iic_of_hasDerivAt_of_nonneg'` - `integral_Iic_of_hasDerivAt_of_nonpos` / `integral_Iic_of_hasDerivAt_of_nonpos'` These mirror `integrableOn_Ioi_deriv_of_nonneg`, `integrableOn_Ioi_deriv_of_nonpos`, `integral_Ioi_of_hasDerivAt_of_nonneg`, `integral_Ioi_of_hasDerivAt_of_nonpos` and their primed variants. | t-measure-probability new-contributor awaiting-author | 107/9 | Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | 1 | 7 | ['EtienneC30', 'github-actions'] | EtienneC30 | 1 month ago | 41 days ago | 2 days |
| 32918 | michelsol | feat: define `supEdist` and `supDist` | Create a new file Topology.MetricSpace.SupDistance and define the supremal distance in (extended) metric spaces. The defined `supEdist` and `supDist` will have similar theory to the already existing `infEdist` and `infDist`. The motivation is to be able to define the radius of a minimal bounding sphere as the infimum of the supDist later. [zulip discussion here](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Formalizing.20Jung's.20theorem.20and.20minimal.20bounding.20spheres) | t-topology new-contributor merge-conflict | 75/0 | Mathlib.lean,Mathlib/Topology/MetricSpace/SupDistance.lean | 2 | 5 | ['github-actions', 'mathlib4-merge-conflict-bot', 'michelsol', 'urkud'] | nobody | 1 month ago | 115 days ago | 21 days |
| 33668 | Citronhat | feat(PMF): add lintegral formulas for PMF | This PR introduces two lemmas describing the `lintegral` of a function with respect to the measure induced by a probability mass function: - `PMF.lintegral_eq_tsum` - `PMF.lintegral_eq_sum` These are the `ℝ≥0∞` analogues of the existing Bochner `integral` formulas `integral_eq_tsum` and `integral_eq_sum`. They could be useful for reasoning about expectations and integrability. In addition, the proof of `integral_eq_sum` is simplified by deriving it directly from `integral_eq_tsum` using `tsum_fintype`. | t-measure-probability new-contributor awaiting-author merge-conflict | 14/5 | Mathlib/Probability/ProbabilityMassFunction/Integrals.lean | 1 | 3 | ['DavidLedvinka', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 59 days ago | 55 days |
| 33355 | 0xTerencePrime | feat(Combinatorics/SimpleGraph/Connectivity): define vertex connectivity | This PR introduces the foundations of vertex connectivity for simple graphs, providing a counterpart to the edge connectivity theory in #32870. ### Main definitions - `SimpleGraph.IsVertexReachable`: vertices remain reachable after removing strictly fewer than `k` other vertices. - `SimpleGraph.IsVertexConnected`: a graph is `k`-vertex-connected if its order is strictly greater than `k` and any two distinct vertices are `k`-vertex-reachable. Includes basic characterizations for $k=0$ and $k=1$, along with monotonicity lemmas (`anti` and `mono`). | new-contributor t-combinatorics awaiting-author merge-conflict | 199/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean | 3 | 139 | ['0xTerencePrime', 'SnirBroshi', 'SproutSeeds', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | 50 days ago | 35 days |
| 14669 | Command-Master | feat(Data/Nat/PartENat): add lemmas for PartENat | Add some missing lemmas for `PartENat`, as well as the additive homomorphism from it to `WithTop Int`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data new-contributor merge-conflict | 90/0 | Mathlib/Data/Nat/PartENat.lean | 1 | 4 | ['erdOne', 'github-actions', 'mathlib-merge-conflicts', 'urkud'] | nobody | 1 month ago | 658 days ago | 1 hour |
| 36719 | NoneMore | feat(ModelTheory): add `PartialType` for first-order theories | This PR adds the definitions of partial types over theories and over parameter sets, and proves several equivalent characterizations. --- - [ ] depends on: #36667 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-logic new-contributor | 468/0 | Mathlib.lean,Mathlib/ModelTheory/PartialTypes.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 4 | 5 | ['NoneMore', 'github-actions', 'mathlib-dependent-issues', 'vihdzp'] | nobody | 1 month ago | 46 days ago | 5 minutes |
| 36347 | FrankieeW | feat(NumberTheory/QuadraticField): define quadratic number fields as QuadraticAlgebra ℚ d 0 | Define `Qsqrtd d` as `QuadraticAlgebra ℚ d 0`, representing the quadratic number field `ℚ(√d)`. Prove trace and norm results, show `Qsqrtd d` is a number field and a quadratic extension when `d` is not a perfect square, and prove that `ℚ(√0)` and `ℚ(√1)` are not fields. Include `IsQuadraticField` as a predicate for quadratic extensions of `ℚ`, and bridge lemmas connecting squarefree integer parameters to the non-square condition. This PR is part of a series upstreaming the [QuadraticNumberFields](https://github.com/FrankieeW/QuadraticNumberFields) project. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/quadratic.20number.20fields) --- ### PRs - #36347 (this PR) - #36387 --- | t-number-theory new-contributor large-import awaiting-author LLM-generated | 191/0 | Mathlib.lean,Mathlib/Algebra/QuadraticAlgebra/Defs.lean,Mathlib/Algebra/Squarefree/Basic.lean,Mathlib/NumberTheory/QuadraticField/Basic.lean | 4 | 25 | ['FrankieeW', 'eric-wieser', 'github-actions', 'riccardobrasca', 'tb65536', 'wwylele'] | tb65536 | 1 month ago | 46 days ago | 7 days |
| 35805 | adrianmartir | feat(NumberTheory/Divisors): Add `infinite_setOf_divisors_iff` | This proves that the set of divisors `{ m | m | n }` of a natural number `n` is infinite if and only if `n` is zero. The first proof draft was by @Aristotle-Harmonic. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor awaiting-author | 10/0 | Mathlib/NumberTheory/Divisors.lean | 1 | 6 | ['adrianmartir', 'alexjbest', 'github-actions', 'tb65536'] | tb65536 | 1 month ago | 37 days ago | 27 days |
| 31590 | SuccessMoses | chore: tag `commutatorElement_def` with `simp` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor merge-conflict | 1/0 | Mathlib/Algebra/Group/Commutator.lean | 1 | 3 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 169 days ago | 29 minutes |
| 34722 | GrigorenkoPV | feat(Data/Finset/RangeDistance): bound distance between elements of `Finset.range` | --- Rebase of https://github.com/leanprover-community/mathlib4/pull/26347 [](https://gitpod.io/from-referrer/) | new-contributor t-data awaiting-author | 34/0 | Mathlib.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Data/Finset/RangeDistance.lean | 3 | 7 | ['GrigorenkoPV', 'Vierkantor', 'github-actions', 'joneugster', 'mathlib-splicebot', 'plp127'] | pechersky | 1 month ago | 36 days ago | 52 days |
| 36216 | michaellee94 | feat(CategoryTheory): characterize pullback squares via the `Over` category | --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor maintainer-merge awaiting-author | 47/0 | Mathlib/CategoryTheory/Limits/Shapes/Pullback/IsPullback/Basic.lean | 1 | 18 | ['dagurtomas', 'github-actions', 'joelriou', 'michaellee94'] | robin-carlier | 1 month ago | 35 days ago | 2 days |
| 34236 | homeowmorphism | feat(GroupTheory/FinitelyPresentedGroup): add finitely presented groups | Formulation of finitely presented groups feat(GroupTheory/FinitelyPresentedGroup): add finitely presented groups We define the notion of `IsFinitelyPresented` with equivalent datatype notions, what it means for a subgroup to be finitely generated in the normal closure, and some instances of finitely presented groups. This started as an ItaLean2025 project. The related Zulip thread is here: https://leanprover.zulipchat.com/#narrow/channel/541885-ItaLean-2025/topic/Projects.3A.20Finitely.20Presented.20Groups/with/567565752. Use of AI: * Aristotle was used for giving a preliminary proof of some statements as this is my first contribution and I wanted to understand how to prove things; they have since been changed. * GPT-5.2 was used to generate some of the proof sub-statements for efficiency once the mathematical blueprints of the proofs have been worked out. * GPT-5.3 was used to rapidly refactor the code. Human review by PR author in-progress, but got to a point where it would be good to get external input. * GPT-5.4 was used to refactor the variables. Human PR author then rewrote the whole thing. --- - [x] depends on: #34580 - [x] depends on: #34624 - [x] depends on: #35033 - [x] depends on: #35029 [](https://gitpod.io/from-referrer/) | t-group-theory new-contributor merge-conflict | 305/0 | Mathlib.lean,Mathlib/GroupTheory/FinitelyPresentedGroup.lean | 2 | 72 | ['copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'grunweg', 'homeowmorphism', 'kbuzzard', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tb65536'] | nobody | 1 month ago | 42 days ago | 1 hour |
| 35857 | AlexeyMilovanov | feat(Logic.Equiv.BijectiveBase2): add bijective base-2 numeration | This PR introduces a formalization of the bijective base-2 numeration system. Unlike standard binary representation, bijective base-2 avoids the "leading zeros" problem, providing a strict mathematical bijection between natural numbers (`ℕ`) and lists of booleans (`List Bool`). **Main additions:** * `Equiv.BijectiveBase2.toBits`: Encodes `ℕ` to `List Bool`. * `Equiv.BijectiveBase2.ofBits`: Decodes `List Bool` to `ℕ`. * `equivBijectiveBase2`: The formal `ℕ ≃ List Bool` equivalence. --- Zulip: [#PR reviews > PR #35857: Bijective Base-2 Numeration](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PR.20.2335857.3A.20Bijective.20Base-2.20Numeration/with/576336540) Zulip: [#batteries > Upstreaming Nat.Bits](https://leanprover.zulipchat.com/#narrow/channel/348111-batteries/topic/Upstreaming.20Nat.2EBits/with/580736051) *(Note: This replaces my previously closed PR to avoid the terminology clash between "Dyadic" and dyadic rationals. The namespace and definitions have been updated accordingly).* *(Note: Used AI to assist with standardizing proof structures).* | t-logic new-contributor LLM-generated blocked-by-batt-PR | 95/0 | Mathlib.lean,Mathlib/Logic/Equiv/ListNatBijective.lean | 2 | 6 | ['AlexeyMilovanov', 'SnirBroshi', 'github-actions', 'joneugster'] | nobody | 1 month ago | 35 days ago | 27 days |
| 36463 | AlexeyMilovanov | feat(Data.Nat.Bits): add Nat.ofBits and prove bits_injective | This PR introduces `Nat.ofBitsList` for `List Bool` and provides the missing proofs that the standard binary representation `Nat.bits` is injective (`Nat.bits_injective`) and possesses a right inverse for normalized lists (`Nat.bits_ofBitsList`). `ofBitsList` is implemented as an `abbrev` using `foldr` (keeping it transparent to tactics like `simp`). It serves as the exact left inverse to `bits`. Furthermore, `bits_ofBitsList` establishes that `bits` and `ofBitsList` form a bijection between `ℕ` and the set of lists with no trailing `false` values. This avoids the name collision with `Nat.ofBits` from `Batteries` and aligns with previous Zulip discussions (see [here](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PR.20.2335857.3A.20Bijective.20Base-2.20Numeration)) regarding the utility of having a complete list-based API for `Nat.bits` in the library. CC: @linesthatinterlace - Adds `Nat.ofBitsList` (as an `abbrev`) - Adds `Nat.ofBitsList_bits` (left inverse property) - Adds `Nat.bits_injective` - Adds `Nat.ofBitsList_eq_zero_iff` (helper lemma for lists without trailing zeros) - Adds `Nat.bits_ofBitsList` (right inverse property) --- Zulip: [#PR reviews > PR #35857: Bijective Base-2 Numeration](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PR.20.2335857.3A.20Bijective.20Base-2.20Numeration/with/576336540) Zulip: [#batteries > Upstreaming Nat.Bits](https://leanprover.zulipchat.com/#narrow/channel/348111-batteries/topic/Upstreaming.20Nat.2EBits/with/580736051) | t-data new-contributor awaiting-author blocked-by-batt-PR | 68/1 | Mathlib/Data/Nat/Bits.lean | 1 | 5 | ['github-actions', 'joneugster', 'linesthatinterlace'] | nobody | 1 month ago | 42 days ago | 9 days |
| 36274 | JTylM | feat(Combinatorics/SimpleGraph/Matching): implemented the matchingNumber of a graph | --- - [ ] depends on: #36406 - [ ] depends on: #32555 I implemented the matchingNumber as described in the issue and proved some statements including showing that there exists a matching achieving the matchingNumber. matchingNumber is increasing under injective maps matchingNumber is equal under isomorphisms matchingNumber of a matching is the cardinality of the matching This is my first PR and i had some trouble with some of the proofs, especially with the proof for matchingNumber.isAttained. So any suggestions on how to make the proofs shorter would be welcome. Also i was not sure about the naming of some of the theorems so i would apprechiate feedback here as well. | new-contributor t-combinatorics blocked-by-other-PR | 292/2 | Mathlib/Combinatorics/SimpleGraph/Matching.lean | 1 | 39 | ['JTylM', 'SnirBroshi', 'SproutSeeds', 'github-actions', 'mathlib-dependent-issues', 'vlad902'] | nobody | 1 month ago | 43 days ago | 8 days |
| 33817 | FlAmmmmING | fix(Combinatorics/Enumerative/Schroder): fix the definition of `smallSchroder` | In the previous definition, the small Schröder numbers were defined as ```LaTeX s_0 = 1, s_1 = 1, s_2 = 1, s_3 = 3... ``` , which does not match the sequence listed in OEIS A006318. Moreover, this definition makes it difficult to correctly write the generating function for the small Schröder numbers. This PR fixes this issue. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics large-import awaiting-author | 61/39 | Mathlib/Combinatorics/Enumerative/Schroder.lean | 1 | 20 | ['FlAmmmmING', 'YaelDillies', 'github-actions', 'vihdzp'] | YaelDillies | 1 month ago | 36 days ago | 74 days |
| 34703 | martinwintermath | Generalizing orthogonalBilin | --- [](https://gitpod.io/from-referrer/) | new-contributor | 51/25 | Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean | 3 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 34419 | ster-oc | feat(RCLike): add `Continuous.re` and similar | This PR adds dot notation for `re`, `im`, `conj` and `ofReal` for `Continuous`, `LipschitzWith` and `Memℓp`. Given `hf : Continuous f` it allows to use `hf.re` to express `Continuous (fun x ↦ (f x).re)`, similarly to the usual `hf.add hg`. I also can add the same features for `Summable` but I am not sure where to place them, suggestions are appreciated! --- [](https://gitpod.io/from-referrer/) | t-analysis new-contributor awaiting-author merge-conflict | 186/41 | Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Analysis/RCLike/Basic.lean | 3 | 15 | ['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'ster-oc'] | j-loreaux | 1 month ago | 66 days ago | 8 days |
| 35376 | michaellee94 | feat(Geometry/Manifold): orientable manifolds | --- - [x] depends on: #33189 [](https://gitpod.io/from-referrer/) | new-contributor WIP t-differential-geometry merge-conflict awaiting-author | 2116/11 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/MoebiusBand.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean,Mathlib/Geometry/Manifold/Orientation.lean,Mathlib/Topology/Closure.lean | 7 | 8 | ['Rida-Hamadani', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 75 days ago | 2 minutes |
| 30142 | shalliso | feat(Topology/Baire): define IsNonMeagre | non-meagre sets (also known as "of the second category") are worthy of their own definition and API. This was useful to me for formalizing a result of "automatic continuity", that is, a Baire-measurable homomorphism between Polish groups must be continuous. Simply working with the negation of IsMeagre quickly became cumbersome, and non-meagre sets have an important role in the study of Polish (e.g. locally compact) groups. From https://github.com/shalliso/automatic_continuity --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor merge-conflict awaiting-author | 83/1 | Mathlib/Topology/Baire/NonMeagre.lean,Mathlib/Topology/GDelta/Basic.lean | 2 | 6 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 210 days ago | 17 minutes |
| 35317 | mkaratarakis | feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 5/5) | If a function `R : ℂ → ℂ` factors as `R z = (z - z₀) ^ r * R₁ z`, where `R₁` is analytic everywhere, then for any `k ≤ r`, there exists an everywhere analytic function `R₂ : ℂ → ℂ` such that the `k`-th iterated derivative of `R` is given by `deriv^[k] R z = (z - z₀) ^ (r - k) * (r! / (r - k)! * R₁ z + (z - z₀) * R₂ z)`. This lemma is necessary for the proof of the Gelfond-Schneider theorem in subsequent PRs. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor t-analysis awaiting-author | 57/0 | Mathlib/Analysis/Complex/CauchyIntegral.lean | 1 | 25 | ['MichaelStollBayreuth', 'github-actions', 'loefflerd', 'mkaratarakis'] | loefflerd | 1 month ago | 30 days ago | 26 days |
| 37101 | fsefzig | feat: definition of kummer polynomials and prove that AdjoinRoot (KummerPolynomial n s) is etale | This defines the Kummer polynomial ` KummerPolynomial n s := X^n - s` over a ring R and constructs the following instances for `AdjoinRoot (KummerPolynomial n s)`: · Faithfullyflat · SmoothOfRelativeDimension 0 · Etale | t-ring-theory new-contributor awaiting-author | 345/0 | Mathlib.lean,Mathlib/RingTheory/AdjoinRootKummer.lean | 2 | 24 | ['acmepjz', 'chrisflav', 'fsefzig', 'github-actions', 'vihdzp'] | nobody | 1 month ago | unknown | 0 seconds |
| 32583 | MJ141592 | refactor(SimpleGraph): change bridges not to require the edge to be present | Remove the requirement for edges to exist in definition of isBridge, and then change the related lemmas to adjust for this, by renaming, fixing the statements and fixing the proofs, including in Acyclic. Closes #31690. --- - [x] depends on: #36802 - [x] depends on: #36804 | t-combinatorics new-contributor | 84/84 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean | 4 | 20 | ['MJ141592', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 29 days ago | 29 days ago | 29 days |
| 34487 | martinwintermath | feat(LinearAlgebra/SesquilinearForm): add instances for SeparatingLeft, SeparatingRight and Nondegenerate | Add typeclass instances for `Fact B.SeparatingLeft`, `Fact B.SeparatingRight`, `Fact B.Nondegenerate`: * inferring `Fact B.flip.SeparatingLeft` from `Fact B.SeparatingRight` and vice versa * inferring `Fact B.SeparatingLeft` and `Fact B.SeparatingRight` from `Fact B.Nondegenerate` * inferring `Fact B.SeparatingLeft` and `Fact B.Nondegenerate` for `.id` and `Dual.eval` * inferring `Fact B.Nondegenerate` from `B.IsPerfPair` I also updated `PointedCone.dual_univ` to demonstrate the usefulness of these additions. Note that I needed to add an import to `Cone/Dual.lean` which somehow imports cardinals. So I needed to remove cardinals from `assert_not_exists`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor large-import | 84/16 | Mathlib/Geometry/Convex/Cone/Dual.lean,Mathlib/LinearAlgebra/Dual/Lemmas.lean,Mathlib/LinearAlgebra/PerfectPairing/Basic.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean | 4 | 4 | ['github-actions', 'martinwintermath', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | joelriou | 29 days ago | 32 days ago | 13 days |
| 36832 | KryptosAI | chore(Data/Finset/Card): rename `pred_card_le_card_erase` to `sub_one_card_le_card_erase` | ## Summary The name `pred_card_le_card_erase` suggests `Nat.pred` but the statement uses `- 1` (i.e., `Nat.sub 1`). Rename to `sub_one_card_le_card_erase` to match the actual statement. A deprecated alias is added for backwards compatibility. ### Files changed - `Mathlib/Data/Finset/Card.lean` — definition renamed + deprecated alias - `Mathlib/Data/Finset/Powerset.lean` — reference updated - `Mathlib/Combinatorics/Additive/SubsetSum.lean` — reference updated - `Mathlib/Algebra/Polynomial/EraseLead.lean` — reference updated Addresses the `Finset.pred_card_le_card_erase` item in #21584. ## AI disclosure I used Claude Code to explore the codebase (finding all references to rename) and to draft the PR description. I reviewed and understand all changes — these are straightforward renames with a deprecated alias. | new-contributor | 22/15 | Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Combinatorics/Additive/SubsetSum.lean,Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean,Mathlib/Combinatorics/SetFamily/Shadow.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Set/Card.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/RingTheory/Ideal/Operations.lean | 9 | 5 | ['KryptosAI', 'Multramate', 'github-actions', 'ooovi'] | nobody | 28 days ago | 28 days ago | 42 days |
| 37585 | cascone26 | feat: formal statements of Robin's and Lagarias' inequalities equivalent to RH | ## Summary This PR adds `Mathlib/NumberTheory/LSeries/RobinInequality.lean`, which contains formal Lean 4 statements of two classical equivalences of the Riemann Hypothesis: **Robin's theorem (1984):** RH ↔ σ₁(n) < e^γ · n · ln(ln(n)) for all n > 5040 **Lagarias' theorem (2002):** RH ↔ σ₁(n) ≤ H_n + exp(H_n) · ln(H_n) for all n ≥ 1 ### New declarations - `robinBound (n : ℕ) : ℝ` — the Robin bound e^γ · n · ln(ln(n)) - `lagariasBound (n : ℕ) : ℝ` — the Lagarias bound H_n + exp(H_n) · ln(H_n) - `robin_iff_RH : RiemannHypothesis ↔ ∀ n > 5040, σ₁(n) < robinBound n` - `lagarias_iff_RH : RiemannHypothesis ↔ ∀ n ≥ 1, σ₁(n) ≤ lagariasBound n` ### Status The **statements** are complete and use existing Mathlib primitives: - `ArithmeticFunction.sigma` for σ₁ - `Real.eulerMascheroniConstant` for γ - `harmonic` for H_n (with ℚ → ℝ coercion) - `RiemannHypothesis` from `Mathlib.NumberTheory.LSeries.RiemannZeta` The **proofs** are currently `sorry`. The Robin direction (RH → inequality) requires analytic number theory following Robin's original 1984 paper. The converse uses Gronwall's theorem on superior highly composite numbers. Both are substantial Mathlib projects in their own right. This PR establishes the formal statements as a foundation for future proof work. These equivalences are not currently formalized anywhere in Mathlib. ### References - G. Robin, *Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann*, J. Math. Pures Appl. **63** (1984), 187–213. - J. Lagarias, *An elementary problem equivalent to the Riemann hypothesis*, Amer. Math. Monthly **109** (2002), 534–543. ### Note on `sorry` I'm aware Mathlib does not merge `sorry`-laden PRs in general. I'm submitting this as a draft to: 1. Get feedback on whether the statement formulation is idiomatic 2. Establish that these statements don't already exist in Mathlib under a different name 3. Invite collaboration on completing the proofs | t-number-theory new-contributor | 98/0 | Mathlib/NumberTheory/LSeries/RobinInequality.lean | 1 | 2 | ['github-actions'] | nobody | 28 days ago | unknown | 0 seconds |
| 36937 | Yaohua-Leo | feat(Algebra/Jordan): add first linearization lemmas for IsCommJordan | [](https://gitpod.io/from-referrer/) AI assistance disclosure: I used AI assistance for CI/debugging and module-structure fixes in this PR. The mathematical content and main lemmas were written by me, with help from @pelicanhere. This PR adds a new file `Mathlib/Algebra/Jordan/Linearization.lean` containing linearization lemmas for the commutative Jordan identity. Main declarations: * `IsCommJordan.four_nsmul_associator_mul_add` * `IsCommJordan.associator_mul_add` These lemmas formalize a first linearization of the commutative Jordan identity using `associator`, following McCrimmon, Proposition 1.8.5. --- I put these lemmas in a separate file because I expect follow-up linearization lemmas to belong naturally in the same place. I am also happy to rename declarations or move the file if reviewers would prefer. | t-algebra new-contributor awaiting-author | 60/0 | Mathlib.lean,Mathlib/Algebra/Jordan/Linearization.lean | 2 | 6 | ['Yaohua-Leo', 'github-actions', 'grunweg', 'ocfnash'] | ocfnash | 28 days ago | 28 days ago | 13 days |
| 36813 | AlexeyMilovanov | feat(Computability.Encoding): add self-delimiting unary and pair encodings | Adds `unaryPrefix` (a self-delimiting $1^n 0$ code) and `prefixPair` to `Mathlib.Computability.Encoding`. **Key changes:** * **`unaryPrefix`**: A prefix-free unary encoding for $\mathbb{N}$, distinct from the existing `unaryEncodeNat`. * **`unaryPrefix_append_inj`**: A basic cancellation lemma that allows unique extraction of a unary prefix from a concatenated list. * **`prefixPair`**: A self-delimiting pairing function for boolean lists, defined as $\text{unaryPrefix } |x| \frown x \frown y$. * **`prefixPair_inj`**: A concise proof of pair injectivity leveraging the new prefix lemmas. | t-computability new-contributor awaiting-author | 56/1 | Mathlib/Computability/Encoding.lean | 1 | 2 | ['Komyyy', 'github-actions'] | Komyyy | 27 days ago | 27 days ago | 16 days |
| 37644 | matthunz | feat(Order/Causal): add `Causal` ordering for stream functions | Adds `Causal` ordering for stream functions and related theorems: ```lean def Causal (f : Stream' α → Stream' β) : Prop := ∀ (x y : Stream' α) (t : ℕ), (∀ s, s ≤ t → x s = y s) → f x t = f y t ``` A stream function is causal if the output at time `t` depends only on inputs up to time `t`. Causal stream functions are commonly used in signal processing, reactive systems, and semantics of stateful computations, where outputs cannot depend on future inputs. ## Future work - Mealy machines: define Mealy machines as causal stream functions with state, and relate them to standard automata-theoretic constructions. - Feedback and delay operators: formalize feedback loops and delayed composition, enabling modeling of stateful and recursive stream definitions. --- [](https://gitpod.io/from-referrer/) | new-contributor t-order | 79/0 | Mathlib.lean,Mathlib/Order/Causal/Basic.lean,Mathlib/Order/Causal/Defs.lean | 3 | 2 | ['github-actions'] | nobody | 26 days ago | unknown | 0 seconds |
| 37666 | TJHeeringa | feat(Analysis/InnerProductSpace/Reproducing): Lipschitz wrt the kernel pseudometric | --- RKHSs $H$ have bounded point evaluations. This induces a pseudometric on the underlying space `X`. The function $f\in H$ are Lipschitz continuous with Lipschitz constant $\||f\||$. This PR puts the pseudometric instance inline. The instance cannot just be put outside the theorem, because that gives problems with resolving type classes / instance synthesis. An alternative to inlining the instance is a type class synonym. One copy would be the RKHS with whatever metric X came equipped with and one copy would be the RKHS with the induced metric. Since there are likely more theorems depending on this pseudometric, I suspect that it is actually a better solution. AI: I had the instance outside the theorem. Lean gave problems with resolving type classes / instance synthesis. I asked Claude and ChatGPT to interpret the error and fix it. The latter just spit gibberish and the former suggested inlining but in a way that didn't work. Then, I asked on Zulip and got the same suggestion but working. The type synonym alternative was also suggested there. [](https://gitpod.io/from-referrer/) | t-analysis new-contributor help-wanted | 20/3 | Mathlib/Analysis/InnerProductSpace/Reproducing.lean | 1 | 3 | ['TJHeeringa', 'github-actions'] | nobody | 25 days ago | unknown | 0 seconds |
| 37707 | MavenRain | feat(Combinatorics/SimpleGraph): add IsMaximalClique/IsMaximalIndepSet, refactor IsMaximum* to MaximalFor | Addresses #34962 | new-contributor t-combinatorics | 92/31 | Mathlib/Combinatorics/SimpleGraph/Clique.lean,MathlibTest/ClearUnneeded.lean | 2 | 2 | ['github-actions'] | nobody | 24 days ago | 24 days ago | 16 minutes |
| 37695 | Morten-Ness | refactor(GroupTheory/Complement): simplify complement proofs | Simplifies the proofs of: - `Subgroup.IsComplement'.symm` - `Subgroup.isComplement_singleton_left` - `Subgroup.isComplement_singleton_right` No API changes. AI assistance: I used Codex/LLM suggestions as a starting point, then manually checked the proofs, and verified the final version locally. --- [](https://gitpod.io/from-referrer/) | t-group-theory new-contributor awaiting-author | 15/17 | Mathlib/GroupTheory/Complement.lean | 1 | 4 | ['github-actions', 'tb65536'] | tb65536 | 24 days ago | 24 days ago | 19 hours |
| 37489 | michael-novak-math | feat: add the fundamental theorem of plane curves | We add to the PlaneCurves file created in PR #36731 a classical result in the subject of differential geometry of plane curves: the fundamental theorem of plane curves. --------- - [ ] depends on: #36731 | new-contributor t-differential-geometry t-analysis blocked-by-other-PR | 651/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean,Mathlib/Geometry/PlaneCurves.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,docs/references.bib | 5 | 5 | ['github-actions', 'mathlib-dependent-issues', 'michael-novak-math'] | nobody | 24 days ago | 30 days ago | 3 hours |
| 37716 | slavanaprienko | feat(LinearAlgebra/Matrix/Determinant): Desnanot-Jacobi identity | This PR adds the Desnanot-Jacobi identity (also known as the Lewis Carroll identity or Dodgson condensation): for any (n+2)×(n+2) matrix M over a commutative ring, $$\det(M) \cdot \det(M_{1,n}^{1,n}) = \det(M_1^1) \cdot \det(M_n^n) - \det(M_1^n) \cdot \det(M_n^1)$$ The proof follows Bressoud's *Proofs and Confirmations* (Cambridge University Press, 1999): multiply M by an auxiliary matrix built from columns of the adjugate, then compare determinants. This yields the identity premultiplied by det(M). To cancel, we pass to a universal polynomial ring (an integral domain with nonzero determinant), then specialize back to arbitrary commutative rings. It seems there's some interest in adding this: https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Determinantal.20identity.20and.20the.20Cauchy.20matrix.20determinant/with/582946873 --- | t-algebra new-contributor awaiting-author | 252/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Determinant/DesnanotJacobi.lean | 2 | 7 | ['github-actions', 'grunweg', 'slavanaprienko'] | nobody | 24 days ago | 24 days ago | 9 hours |
| 36698 | ghseeli | feat(Combinatorics/Enumerative): Latin squares | This PR defines Latin rectangles and Latin squares and proves an extension theorem using Hall's Marriage Theorem. ## Main results - `group_to_cayley_table`: every finite group `G` yields a `LatinSquare G G`. - `latin_rectangle_extends_one_row`: a (non-square) `LatinRectangle` extends to a `LatinRectangle` with one more row. This is an application of **Hall's Marriage Theorem**, `hallMatchingsOn.nonempty`. - `latin_rectangle_extends_to_latin_square`: a `LatinRectangle` extends to a `LatinSquare`. This is included in a new file `Combinatorics/Enumerative/LatinSquare.lean`. --- - [ ] depends on: #37190 - [ ] depends on: #37720 [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics blocked-by-other-PR | 642/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/DoubleCounting.lean,Mathlib/Combinatorics/Enumerative/LatinSquare.lean,Mathlib/Combinatorics/Pigeonhole.lean,Mathlib/Data/Fintype/Card.lean,docs/references.bib | 6 | 78 | ['SnirBroshi', 'cjrl', 'eric-wieser', 'ghseeli', 'github-actions', 'mathlib-dependent-issues', 'vlad902'] | nobody | 23 days ago | 28 days ago | 16 days |
| 37281 | AltSoKoly | Update EdgeConnectivity.lean | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author | 123/0 | Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Data/Int/GCD.lean | 2 | 5 | ['github-actions', 'grunweg', 'themathqueen'] | nobody | 23 days ago | 35 days ago | 7 minutes |
| 26165 | oliver-butterley | feat(MeasureTheory.VectorMeasure): add lemma which shows that variation of a `ℝ≥0∞` VectorMeasure is equal to itself | Add a lemma for the variation of a VectorMeasure which tells that if `μ` is `VectorMeasure X ℝ≥0∞` then `variation μ = μ`. Co-authored-by: @yoh-tanimoto - [ ] depends on: #26160 --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor t-measure-probability awaiting-author | 467/0 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Lemmas.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 22 days ago | 300 days ago | 15 days |
| 37456 | Robertboy18 | feat(LinearAlgebra/AffineSpace): add Desargues's theorem | This PR adds an affine (parallel) version of Desargues's theorem! **Main changes** - New file `Mathlib/LinearAlgebra/AffineSpace/Desargues.lean` with `parallel_third_side_of_perspective`: if two triangles are in perspective from a point `S` and two pairs of corresponding sides are parallel, then the third pair of sides is parallel. - Add the corresponding `public import` to `Mathlib.lean`. - Update `docs/100.yaml` (entry #87) to point to the new declaration. **High level Proof idea is from the rocq repository!** Compare side vectors via `exists_eq_smul_of_parallel` for the two given pairs of parallel sides; the shared comparison along `SA` forces the same scalar, yielding parallelism of the third sides. Tests: `lake build Mathlib.LinearAlgebra.AffineSpace.Desargues`! | t-algebra new-contributor awaiting-author | 159/0 | Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/Desargues.lean,docs/100.yaml | 3 | 8 | ['Robertboy18', 'SnirBroshi', 'copilot-pull-request-reviewer', 'github-actions', 'wwylele'] | eric-wieser | 22 days ago | 22 days ago | 8 days |
| 35812 | khwilson | feat(MeasureTheory/Group/GeometryOfNumbers): successive minima and existence of a directional basis | Define the successive minima of a discrete subgroup of a real vector space with respect to a convex set. These invariants show up throughout the geometry of numbers and are the focus of Minkowski's Second Theorem (whose statement is left here with a `proof_wanted`).
Note: The key lemma is that the "gauge set" of the convex set is closed. I took the approach of showing that it is sequentially closed. There's an alternative approach via showing it's the union of a finite number of closed sets. I personally thought this approach was more intuitive, but the union approach may result in a slightly shorter proof.
Co-authored-by: Yaël Dillies |
new-contributor t-measure-probability awaiting-author merge-conflict | 544/77 | Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Polynomial/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/LinearAlgebra/Basis/Fin.lean,Mathlib/LinearAlgebra/Basis/Submodule.lean,Mathlib/LinearAlgebra/FiniteDimensional/Lemmas.lean,Mathlib/LinearAlgebra/LinearIndependent/Basic.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean,Mathlib/RingTheory/Polynomial/Bernstein.lean,Mathlib/Topology/Instances/Int.lean,Mathlib/Topology/Instances/Real/Lemmas.lean,Mathlib/Topology/Order/Bornology.lean | 16 | 32 | ['Vierkantor', 'YaelDillies', 'github-actions', 'joneugster', 'khwilson', 'mathlib-merge-conflicts'] | YaelDillies | 21 days ago | 24 days ago | 36 days |
| 36785 | hommmmm | feat(RingTheory/Localization): Nagata's criterion for primality in localization away | ## Summary - Add `dvd_of_mem_span_singleton_localization`: if `p` is prime and `p ∤ x`, then membership in the span of the image of `x` in `R[1/p]` implies divisibility by `x`. - Add `prime_of_prime_in_localization` (Nagata's criterion): if `p` is prime, `x` is irreducible, and the image of `x` in `R[1/p]` is prime, then `x` is prime. ## References - [Stacks Project, Tag 0AFU](https://stacks.math.columbia.edu/tag/0afu) ## AI Disclosure This code is written without AI, then uses Claude Code with cameronfreer's [Lean4-skills](https://github.com/cameronfreer/lean4-skills) (specifically, the `review`, `refactor`, and `golf` workflow) for style changes, refactoring and golfing. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 50/0 | Mathlib/RingTheory/Localization/Away/Basic.lean | 1 | 6 | ['chrisflav', 'github-actions', 'hommmmm'] | chrisflav | 21 days ago | 21 days ago | 22 days |
| 37111 | tannerduve | feat(Computability): add Nat.PrimrecIn and PrimrecIn | - Add `Nat.PrimrecIn`: primitive recursive functions relative to a set of oracles - Add `PrimrecIn`: lifts `Nat.PrimrecIn` to `Primcodable` types A `PrimrecIn` version of `RecursiveIn.iff_nat` (i.e., `PrimrecIn O (f : ℕ → ℕ) ↔ Nat.PrimrecIn O f`) is left as future work as it requires proving `Nat.PrimrecIn O Nat.pred`, which needs additional API for `Nat.PrimrecIn`. --- Split out from #34937 as requested in review. - [x] depends on: #37061 | t-computability new-contributor awaiting-author | 24/0 | Mathlib/Computability/RecursiveIn.lean | 1 | 14 | ['Komyyy', 'bryangingechen', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tannerduve'] | nobody | 20 days ago | 22 days ago | 1 day |
| 36763 | alok | refactor(Order/Filter/Germ): partial sections for Filter.Product | ## Summary - Refactor `Filter.Product` from total functions to partial sections (`Product.Section`) with filter-large domains - Adapt the model-theoretic `Prestructure` and Łoś's theorem proofs to partial sections - Add `Germ ↔ Product` bridge equivalence for constant families ## Motivation The current `Filter.Product` is a quotient of total functions `(a : α) → ε a` by eventual equality. This requires all fibers to be inhabited, which is not the mathematically correct construction. The ultraproduct should only require a section defined on a filter-large set. The new `Product.Section` structure carries: - A domain `dom : Set α` with `dom ∈ l` - A dependent section `val : (a : dom) → ε a` Two sections are equivalent if they agree on some filter-large common domain. This matches the standard mathematical construction and enables proper ultraproducts where some fibers may be empty. ## Changes ### `Mathlib/Order/Filter/Germ/Basic.lean` - New `Product.Section` structure (partial section with filter-large domain) - `productSetoid` redefined over `Product.Section` - `Product.ofTotal` embeds total sections; `eq_iff_ofTotal` characterizes equality ### `Mathlib/ModelTheory/Ultraproducts.lean` - `sectionStructure`: first-order structure on partial sections (funMap restricts to domain intersection, RelMap checks on common domain) - `setoidPrestructure` adapted with full proofs of `fun_equiv` and `rel_equiv` - `funMap_cast`, `boundedFormula_realize_cast` (rel case), `all` quantifier case all reproved for partial sections - Łoś's theorem statement unchanged; `sentence_realize` still has the same API ### `Mathlib/Order/Filter/Germ/Product.lean` (new) - `Germ.toProduct` / `Product.toGerm`: round-trip between germs and constant-family products - `Germ.prodEquiv`: equivalence for inhabited constant families (backward compat) ## Test plan - [x] `lake build` passes (7607/7607 modules) - [x] All linter warnings resolved - [x] `Mathlib.ModelTheory.Satisfiability` (uses `Filter.Product` + `sentence_realize`) still compiles - [x] `Mathlib.Analysis.Real.Hyperreal` still compiles --- Context: [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Nonstandard.20Analysis/near/513178715) — Violeta Hernández asked for fixing the ultraproduct definition as the first step after #33650 deprecated the old hyperreal machinery. 🤖 Generated with [Claude Code](https://claude.com/claude-code) | new-contributor merge-conflict | 278/49 | Mathlib.lean,Mathlib/ModelTheory/Ultraproducts.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/Order/Filter/Germ/Product.lean | 4 | 5 | ['alok', 'github-actions', 'mathlib-merge-conflicts', 'plp127'] | nobody | 20 days ago | unknown | 0 seconds |
| 37871 | JJYYY-JJY | feat: support intros and simple rintro in introMerge | * Extend the `introMerge` linter to handle `intros` and a safe subset of `rintro` tactics, allowing it to suggest merging a wider variety of adjacent introduction tactics. * Introduce helper functions to normalize supported `rcases` and `rintro` patterns into equivalent `intro` arguments for consistent analysis. * Add tests to verify the correct merging of mixed introduction tactics and ensure intervening tactics prevent merging. --- [](https://gitpod.io/from-referrer/) | t-meta new-contributor | 101/9 | Mathlib/Dynamics/OmegaLimit.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,MathlibTest/TacticAnalysis.lean | 3 | 3 | ['copilot-pull-request-reviewer', 'github-actions'] | dwrensha | 20 days ago | 21 days ago | 21 days |
| 37928 | AlexeyMilovanov | refactor(Computability.Encoding): unbundle Γ and remove FinEncoding | This PR unbundles the alphabet `Γ` from the `Encoding` structure and completely removes `FinEncoding`. `Encoding`: The alphabet `Γ` is now an explicit parameter: `structure Encoding (α : Type u) (Γ : Type v)`. `FinEncoding`: Removed. Finiteness is now handled via standard typeclasses (e.g., `[Fintype Γ] (e : Encoding α Γ)`). Combinators: Functions like `finEncodingPair` are simplified to `encodingPair`, dropping the `fin` prefix and `[Fintype]` requirements where no longer needed. Downstream: Mechanically updated `Mathlib.Computability` and `Mathlib.ModelTheory` to pass the explicit `Γ` and use `[Fintype Γ]` where `FinEncoding` was previously required. | new-contributor | 30/67 | Mathlib/Computability/Encoding.lean,Mathlib/ModelTheory/Encoding.lean | 2 | 5 | ['github-actions', 'vihdzp'] | nobody | 19 days ago | 20 days ago | 20 days |
| 37954 | jdhart81 | feat(Data/ENNReal/Inv): add ENNReal.div_mul_div_cancel | Proves a / b * (b / c) = a / c for b ≠ 0, b ≠ ∞ in ENNReal. Proof via mul_div_assoc and existing div_mul_cancel. AI Disclosure: This PR was developed with assistance from an LLM (Claude, Anthropic) for proof exploration and text drafting. The proof was compiled and verified locally by the contributor, who understands the mathematical content. This lemma is extracted from a larger formalization of information-theoretic bounds (Zenodo DOI: 10.5281/zenodo.19317983). --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 5/0 | Mathlib/Data/ENNReal/Inv.lean | 1 | 2 | ['github-actions'] | nobody | 19 days ago | 19 days ago | 1 minute |
| 37720 | cjrl | feat(Data/Fintype/Card): existsUnique_notMem_image_of_injective_of_card_succ | This pull requests adds a small theorem `existsUnique_notMem_image_of_injective_of_card_succ` to `Mathlib/Data/Fintype/Card` that says given an injective map f : α → β such that β has cardinality one more than α, there exists a unique element of β not in the image of f. This can be viewed as going in the opposite direction of `card_lt_of_injective_of_notMem`. This little fact is needed for our Latin Square PR #36698. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor t-set-theory | 15/0 | Mathlib/Data/Fintype/Card.lean | 1 | 6 | ['IvanRenison', 'cjrl', 'github-actions'] | nobody | 18 days ago | 18 days ago | 24 days |
| 37190 | cjrl | feat(Combinatorics): Set-Valued Pigeonhole Principle | This PR contributes two theorems to combinatorics: - `exists_lt_card_cover_of_card_biUnion_lt_card` is a set-valued version of the pigeonhole principle. - `sum_card_eq_sum_card_cover_biUnion` is a set theoretic corollary of a double counting result proved for bipartite graphs (`Finset.sum_card_bipartiteAbove_eq_sum_card_bipartiteBelow`). This was needed to prove the above pigeonhole principle. The motivation for these results is our Latin Square PR #36698. These results were proved in less general terms in that PR, but are independent of Latin Square considerations and so we have generalized and moved them into more relevant files. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics | 38/0 | Mathlib/Combinatorics/Enumerative/DoubleCounting.lean,Mathlib/Combinatorics/Pigeonhole.lean | 2 | 16 | ['IvanRenison', 'cjrl', 'ghseeli', 'github-actions', 'j-loreaux', 'vlad902'] | nobody | 18 days ago | 18 days ago | 34 days |
| 34007 | martinwintermath | feat(Algebra/Module/Submodule/Dual): dual operator for submodules | Add new file `Dual.lean` that defines the dual operator for submodules. The main definition is * `Submodule.dual`: given a bilinear pairing `p` between two modules `M₁` and `M₂` and a submodule `S` in `M₁`, `Submodule.dual p S` is the submodule in `M₂` consisting of all points `y` such that `0 = p x y` for all `x ∈ S`. For reasons of generality, `p` is actually a general sesqui-bilinear map, that is, of the form `p : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M`. This implementation of the `dual` operator for submodules is written to parallel the implementation of `PointedCone.dual`. Include some additional results: * theorems that represent the dual as the kernel of a linear map * theorems for the relation between dual and the `dualAnnihilator` and `dualCoannihilator` of a submodule. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 239/0 | Mathlib.lean,Mathlib/Algebra/Module/Submodule/Dual.lean | 2 | 7 | ['github-actions', 'joelriou', 'martinwintermath', 'mathlib-bors'] | joelriou | 18 days ago | 90 days ago | 14 days |
| 35834 | homeowmorphism | feat(Mathlib/GroupTheory/PresentedGroup): every group has a presentation | We show that every group has a presentation defined by taking the free group with all of the group elements as the generators, and defining the relations as the kernel of the induced subjective homomorphism from that free group to the group itself. Use of AI: This has been vibe-coded with GPT-Codex-5.3, was updated through review, and was double-checked by the author. --- [](https://gitpod.io/from-referrer/) | new-contributor t-group-theory large-import awaiting-author LLM-generated | 29/1 | Mathlib/GroupTheory/PresentedGroup.lean | 1 | 15 | ['copilot-pull-request-reviewer', 'euprunin', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'plp127', 'tb65536'] | tb65536 | 18 days ago | 56 days ago | 4 days |
| 35662 | FrankieeW | feat(NumberTheory/Zsqrtd): add Archimedean instance via le_arch | This PR follows a suggestion made in #35606 , #35481 - add `Zsqrtd.le_arch_smul` in `Mathlib/NumberTheory/Zsqrtd/Basic.lean` - use it to provide `instance : Archimedean (ℤ√d)` in the `Nonsquare` section - refactor the proof using symmetry to reduce duplication while keeping checks clean --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor awaiting-author merge-conflict LLM-generated | 46/4 | Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean | 2 | 13 | ['FrankieeW', 'MichaelStollBayreuth', 'euprunin', 'github-actions', 'mathlib-merge-conflicts', 'tb65536'] | MichaelStollBayreuth | 18 days ago | 52 days ago | 15 days |
| 33032 | ksenono | feat(Combinatorics/SimpleGraph): Konig’s theorem on bipartite graphs | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor blocked-by-other-PR merge-conflict | 832/251 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Konig/Auxillary.lean,Mathlib/Combinatorics/SimpleGraph/Konig/Konig.lean,Mathlib/Combinatorics/SimpleGraph/Konig/KonigFin.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/VertexCover.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean | 12 | 9 | ['SnirBroshi', 'github-actions', 'ksenono', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'vlad902'] | nobody | 17 days ago | 134 days ago | 2 minutes |
| 37718 | SabrinaJewson | feat(Order): add conversions from `Std` order typeclasses to Mathlib ones | `{Preorder, PartialOrder, LinearOrder}.ofStd` exist to facilitate convenient translation from `Std` order typeclasses to Mathlib ones. --- [](https://gitpod.io/from-referrer/) | t-order new-contributor | 366/0 | Mathlib.lean,Mathlib/Order/Std.lean,MathlibTest/OrderOfStd.lean | 3 | 2 | ['github-actions'] | bryangingechen | 16 days ago | 24 days ago | 24 days |
| 36770 | Xmask19 | feat: invariance of domain via Brouwer's fixed point theorem | Continuous and injective maps from Rn to Rn are open mappings. This is shown given Brouwer's fixed point theorem. The specific version of Brouwer's theorem assumed is that a continuous map from the closed unit ball to itself has a fixed point. It is used to show a lemma in this proof. Then assuming that invariance of domain isn't true gives a contradiction with this lemma. --- My supervisor has code for studying topological manifolds which relies on invariance of domain that can be found here: https://github.com/stevensivek/TopologicalManifolds and is planned to be submitted to Mathlib. [](https://gitpod.io/from-referrer/) | t-topology new-contributor | 617/5 | Mathlib.lean,Mathlib/AlgebraicTopology/InvarianceOfDomain.lean,Mathlib/Analysis/Convex/GaugeRescale.lean,Mathlib/Topology/Closure.lean,Mathlib/Topology/Order.lean | 5 | 2 | ['github-actions'] | nobody | 16 days ago | 16 days ago | 1 hour |
| 38050 | WilliamCoram | feat: Define Newton polygons | In this file we construct a method to define newton polygons using a Stream' of `Step`'s which correspond to what you would obtain via the 'algorithm' of rotating half-planes as described in Gouvea's p-adic numbers. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor | 620/0 | Mathlib.lean,Mathlib/NumberTheory/NewtonPolygon.lean | 2 | 3 | ['github-actions', 'jcommelin'] | nobody | 15 days ago | unknown | 0 seconds |
| 37938 | SamuelSchlesinger | feat(Probability/Posterior): Posterior PMFs and Various Lemmas | Upstreaming the probability lemmas needed in https://github.com/leanprover/cslib/pull/464. | t-measure-probability new-contributor awaiting-author | 130/0 | Mathlib.lean,Mathlib/Probability/ProbabilityMassFunction/Posterior.lean | 2 | 5 | ['EtienneC30', 'SamuelSchlesinger', 'github-actions'] | RemyDegenne | 15 days ago | 15 days ago | 21 hours |
| 38113 | robo7179 | feat(SimpleGraph/PerfectGraph): add lemma graph is perfect iff all su… | Perfect graph theorem , discussion on zulip thread: [#graph theory > Second Order Monadic Logic](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Second.20Order.20Monadic.20Logic.20for.20Graph/with/583013775) - [ ] depends on: #37680 - [ ] depends on: #37598 | t-combinatorics new-contributor blocked-by-other-PR | 54/0 | Mathlib/Combinatorics/SimpleGraph/PerfectGraph.lean | 1 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 15 days ago | 15 days ago | 1 minute |
| 33330 | michael-novak-math | feat: add arc-length reparametrization of parametrized curves | add new definitions of arc-length reparametrization and its corresponding parameter transformation and a theorem establishing the desired properties. | t-analysis new-contributor awaiting-author | 308/0 | Mathlib.lean,Mathlib/Analysis/Calculus/ArcLengthReparametrization.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,docs/references.bib | 4 | 57 | ['SnirBroshi', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'michael-novak-math'] | j-loreaux | 15 days ago | 38 days ago | 6 days |
| 32692 | WilliamCoram | feat: define multivariate restricted power series | We define multivariate restricted power series over a normed ring R, and show the properties that they form a ring when R has the ultrametric property. This work generalises my previous work in #26089 which will need to be refactored. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-number-theory new-contributor | 137/0 | Mathlib.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/RingTheory/MvPowerSeries/Restricted.lean | 3 | 43 | ['WilliamCoram', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts'] | alreadydone | 15 days ago | 15 days ago | 33 days |
| 33217 | Blackfeather007 | feat(Algebra): define associated graded structure for abelian group | In this PR we define the associated graded structure for abelian group when given a filtration and only give some basic lemmas about it. --- migrated from https://github.com/leanprover-community/mathlib4/pull/26857 | new-contributor t-ring-theory awaiting-author | 144/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 13 | ['Blackfeather007', 'chrisflav', 'erdOne', 'eric-wieser', 'github-actions', 'urkud'] | erdOne | 15 days ago | 124 days ago | 4 days |
| 34875 | banrovegrie | feat(LinearAlgebra/Matrix): add Sherman-Morrison formula | Mathlib has the matrix determinant lemma (`det_add_replicateCol_mul_replicateRow` in SchurComplement.lean) but lacked the corresponding inverse formula. This PR fills that gap. - Add `Matrix.inv_add_vecMulVec`: Sherman-Morrison formula for `(A + uv^T)^{-1}` - Add `Matrix.inv_sub_vecMulVec`: subtraction variant - Add `Matrix.isUnit_det_add_vecMulVec`: invertibility under the formula's hypotheses ## Test plan - [x] `lake build` passes - [x] Lines within 100 char limit - [x] All declarations have docstrings **Any specific AI usage?**: Used Copilot for review purposes. | t-algebra new-contributor awaiting-author | 135/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/ShermanMorrison.lean | 2 | 13 | ['Xxxjdjdid', 'banrovegrie', 'chrisflav', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] | chrisflav | 14 days ago | 16 days ago | 69 days |
| 38056 | Deicyde | feat: topological vector bundle homomorphisms | This PR implements topological vector bundle morphisms. --- - [ ] depends on: #38023 - [ ] depends on: #37946 [](https://gitpod.io/from-referrer/) | new-contributor t-topology merge-conflict | 805/0 | Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Topology/FiberBundle/Basic.lean,Mathlib/Topology/FiberBundle/Trivialization.lean,Mathlib/Topology/VectorBundle/Basic.lean,Mathlib/Topology/VectorBundle/Morphism.lean | 5 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | unknown | 0 seconds |
| 35569 | goliath-klein | refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): deprecate `injectiveSeminorm` | This PR: * Deprecates `PiTensorProduct.injectiveSeminorm` and supporting lemmas. * Moves the theory of `liftEquiv` from InjectiveSeminorm.lean to ProjectiveSeminorm.lean. No changes are introduced beyond adding deprecation notices, adapting docstrings, and moving material between files. The PR leaves InjectiveSeminorm.lean almost empty. A new implementation of `injectiveSeminorm`, one which reflects the common mathematical definition, is to be done. This is the third in a series of three PRs with the goal to [deprecate `PiTensorProuduct.injectiveSeminorm`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798633). --- - [ ] depends on: #35567 - [ ] depends on: #35568 Deprecations: - injectiveSeminorm - dualSeminorms_bounded - injectiveSeminorm_apply - norm_eval_le_injectiveSeminorm - injectiveSeminorm_le_projectiveSeminorm - injectiveSeminorm_tprod_le Preliminary work toward a reimplementation is at #33969. I've added Davood and myself to the "Authors" field, as we have now significantly refactored this module. Co-authored-by: Davood H. T. Tehrani [](https://gitpod.io/from-referrer/) | new-contributor | 222/233 | Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean | 2 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 14 days ago | 31 days |
| 38139 | sidbedi | chore(Algebra/MvPolynomial/Variables): golf MvPolynomial.vars_0 to rfl | --- The classical qualifier and explicit rewrite chain are unnecessary — the result holds definitionally. [](https://gitpod.io/from-referrer/) | new-contributor t-algebra awaiting-author | 1/2 | Mathlib/Algebra/MvPolynomial/Variables.lean | 1 | 3 | ['github-actions', 'grunweg'] | nobody | 14 days ago | 14 days ago | 9 hours |
| 38140 | sidbedi | chore(Data/Analysis/Filter): golf CFilter.ofEquiv_val to rfl | --- cases F is unnecessary, the result holds definitionally. [](https://gitpod.io/from-referrer/) | t-data new-contributor awaiting-author | 1/2 | Mathlib/Data/Analysis/Filter.lean | 1 | 3 | ['github-actions', 'grunweg'] | nobody | 14 days ago | 14 days ago | 9 hours |
| 36731 | michael-novak-math | feat: Frénet moving frame and Frénet equation for plane curves | We define the curvature function, normal vector function and the Frénet moving frame for plane curve. We also prove the Frénet equations for plane curves. A separate PR (#37489) will prove the fundamental theorem of plane curves. | new-contributor t-differential-geometry t-analysis awaiting-author | 321/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean,Mathlib/Geometry/PlaneCurves.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,docs/references.bib | 5 | 114 | ['Ruben-VandeVelde', 'github-actions', 'grunweg', 'michael-novak-math', 'scholzhannah'] | nobody | 14 days ago | 27 days ago | 12 days |
| 37683 | SabrinaJewson | feat(Order/OrdContinuous): every map between complete lattices that preserves sSup is a left adjoint of some Galois connection | It is already proven that the left side of a Galois connection is left-continuous; this provides the converse. --- - [ ] depends on: #37682 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR merge-conflict t-order | 90/136 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/OrdContinuous.lean,Mathlib/Order/SemiconjSup.lean,Mathlib/Tactic/Translate/ToDual.lean,Mathlib/Topology/Order/Basic.lean | 6 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 25 days ago | 24 minutes |
| 37684 | SabrinaJewson | feat(Topology/Order): provide lemmas linking topological continuity to order continuity | All the hard work is already done, but this just fills in a couple convenient missing pieces. --- - [ ] depends on: #37682 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR merge-conflict t-topology | 106/136 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/OrdContinuous.lean,Mathlib/Order/SemiconjSup.lean,Mathlib/Tactic/Translate/ToDual.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/IsLUB.lean,Mathlib/Topology/Order/Monotone.lean | 8 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 25 days ago | 21 minutes |
| 37376 | NoneMore | feat(Topology/CantorBendixson): add iterated derived sets and perfect kernel | Define the transfinite iteration of the relative derived-set operator via `gfpApprox` and introduce the perfect kernel of a set. --- AI disclosure: Most declarations, comments, and documentation in this PR were generated with Codex. Some proofs were structurally simplified using the `/golf` command from Lean 4 Skills. I reviewed the resulting code and documentation and can vouch for all submitted content. - [ ] depends on: #37374 - [x] depends on: #37375 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR t-topology | 249/0 | Mathlib.lean,Mathlib/SetTheory/Ordinal/FixedPointApproximants.lean,Mathlib/Topology/CantorBendixson.lean,Mathlib/Topology/DerivedSet.lean | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 32 days ago | 13 minutes |
| 35017 | robo7179 | feat(Combinatorics/SimpleGraph/Acyclic): every nontrivial tree has at least two leaves | Add two theorems to prove that every non trivial tree has at least two leaves (one in Finite the other in Acyclic). --- - [ ] depends on: #37399 - [ ] depends on: #37400 [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author blocked-by-other-PR | 24/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean | 2 | 44 | ['IvanRenison', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'robo7179'] | YaelDillies | 14 days ago | 45 days ago | 34 days |
| 38049 | WilliamCoram | feat: lemmas towards showing gaussNorm on MvPowerSeries is an absolute value | We prove lemmas: ``gaussNorm_mul_le`` and ``gaussNorm_le_mul`` which will allow us to show it is an absolute value on Mv restricted power series. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor | 144/1 | Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean | 1 | 4 | ['WilliamCoram', 'github-actions'] | nobody | 13 days ago | 17 days ago | 17 days |
| 37932 | idontgetoutmuch | feat: Exponential map of Lie group is smooth | We construct the exponential map `expLie : g → G` for a Lie group `G` and prove that it is smooth. The main reference is: * Eckhard Meinrenken, *Lie Groups and Lie Algebras*, Lecture Notes, University of Toronto. Available at https://www.math.toronto.edu/mein/teaching/LectureNotes/lie.pdf --- [](https://gitpod.io/from-referrer/) | new-contributor t-differential-geometry | 392/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Algebra/SmoothLieExp.lean | 2 | 4 | ['github-actions', 'wwylele'] | nobody | 13 days ago | 13 days ago | 16 minutes |
| 38154 | ybenmeur | add subsingleton case to ExpChar | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 113/49 | Mathlib/Algebra/CharP/Algebra.lean,Mathlib/Algebra/CharP/Basic.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/CharP/Lemmas.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/Polynomial/Expand.lean,Mathlib/FieldTheory/Perfect.lean,Mathlib/FieldTheory/PurelyInseparable/Exponent.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Expand.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/SeparableDegree.lean,Mathlib/RingTheory/Trace/Basic.lean | 15 | 2 | ['github-actions'] | nobody | 13 days ago | unknown | 0 seconds |
| 32555 | ksenono | feat(Combinatorics/SimpleGraph/Matching): maximum and maximal matchings for Konig's theorem | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 112/0 | Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean | 2 | 39 | ['SnirBroshi', 'SproutSeeds', 'github-actions', 'jcommelin', 'ksenono'] | b-mehta | 12 days ago | 14 days ago | 113 days |
| 37625 | slavanaprienko | feat(LinearAlgebra/Matrix/Charpoly): general coefficient formula as sum of principal minors | This PR adds a general formula for the coefficients of `det(1 + X • M)` as sums of principal minors, generalizing the existing `coeff_det_one_add_X_smul_one` (k=1, trace) and `det_eq_sign_charpoly_coeff` (k=n, determinant). It also derives the corresponding formula for the coefficients of the characteristic polynomial via `charpolyRev`. New results: - `det_piecewise_one_eq_submatrix_det`: relates piecewise-with-identity to principal submatrix determinants - `coeff_det_one_add_X_smul_eq_sum_minors`: the k-th coefficient of `det(1 + X • M)` equals the sum of k×k principal minors - `charpoly_coeff_eq_sum_minors`: coefficients of the characteristic polynomial as signed sums of principal minors --- | t-algebra new-contributor | 105/1 | Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean | 1 | 24 | ['eric-wieser', 'github-actions', 'slavanaprienko', 'wwylele'] | kim-em | 12 days ago | 26 days ago | 27 days |
| 37593 | IlPreteRosso | refactor(Data.Finset.*Antidiagonal): rename set-based defs to `set*Antidiagonal` | Renames set-based `Finset.mulAntidiagonal` → `setMulAntidiagonal` (and SMul/VAdd variants) to free the `mulAntidiagonal` name for the planned `HasMulAntidiagonal` typeclass. Deprecation aliases added. Supersedes #34551 | t-ring-theory new-contributor merge-conflict | 178/96 | Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Data/Finset/MulAntidiagonal.lean,Mathlib/Data/Finset/SMulAntidiagonal.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Summable.lean | 6 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 12 days ago | 15 days |
| 37527 | bryanboehnke | feat(LocalRing/Etale): Finite étale extensions of local rings are monogenic | Formalization of Lemma 3.2 from https://arxiv.org/abs/2503.07846: Given a finite extension of local rings R -> S, if the extension is étale, then there exists β ∈ S such that R[β] = S. Furthermore, if f(z) ∈ R[z] is the minimal polynomial of β, then f′(β) is a unit in S. This file also includes some relevant intermediate results used in the formalization of the proof of Lemma 3.1 from the same paper.
Co-authored-by: George Peykanu |
t-ring-theory new-contributor | 148/0 | Mathlib.lean,Mathlib/RingTheory/LocalRing/Etale.lean | 2 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 11 days ago | 11 days ago | 11 days |
| 38270 | Deicyde | feat(Geometry/Manifold): The Tangent Functor on `MfldCat` | A simple motivating example for PR #38223. We define the `tangentFunctor : MfldCat 𝕜 (n + 1) ⥤ MfldCat 𝕜 n` which takes any manifold to its tangent bundle and any smooth map to its pushforward. This is a standard construction in differential geometry. See: J. Lee, Smooth Manifolds, pg. 75 --- - [ ] depends on: #38223 [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR new-contributor | 320/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/Category/MfldCat/TangentFunctor.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 11 days ago | unknown | 0 seconds |
| 37071 | ericluap | feat: Dedekind completion of rationals is isomorphic to EReal | t-order new-contributor | 143/4 | Mathlib.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/DedekindCut.lean,Mathlib/Order/Completion.lean,Mathlib/Order/Concept.lean | 5 | 49 | ['ericluap', 'github-actions', 'vihdzp', 'wwylele'] | vihdzp | 11 days ago | 11 days ago | 17 days | |
| 38053 | ntapiam | feat(Analysis/Controls): add Control functions | Add Control functions ---- This PR adds Control functions in the sense of rough paths theory (see e.g. [Friz-Victoir, Section 1.2.1](https://page.math.tu-berlin.de/~friz/master4_May6th.pdf)). They are related to p-variation norms which are the goal of #38055. I've shown most results in the above reference though those relating to 1-variation are still a work in progress. I had to add a few statements about convex functions in order to work over NNReal instead or Real, but I am not sure this is the best way to do it. The reason is that I've defined controls as taking values in NNReal (as they should). In particular there is ```lean4 theorem nnreal_of_real {f : ℝ≥0 → ℝ≥0} (hf : ConvexOn ℝ (Set.Ici 0) fun x : ℝ => (f x.toNNReal : ℝ)) : ConvexOn ℝ≥0 ⊤ f ``` which I didn't know where to put. It probably holds in more generality but I didn't check. I have also included two versions of Controls, one global and one restricted to a set. I tried to follow Mathlib conventions as best as I could but perhaps that could be improved as well. [](https://gitpod.io/from-referrer/) | WIP t-analysis new-contributor | 571/1 | Mathlib.lean,Mathlib/Analysis/Controls/BoundedVariation.lean,Mathlib/Analysis/Controls/ControlOn.lean,Mathlib/Analysis/Controls/Defs.lean,Mathlib/Analysis/Convex/Function.lean,docs/references.bib | 6 | 4 | ['github-actions', 'ntapiam'] | nobody | 11 days ago | 16 days ago | 52 seconds |
| 38309 | ntapiam | feat(Algebra/NonAssoc): dendriform algebras | Define dendriform semirings and algebras --- This PR introduces dendriform structures such as dendriform semirings and algebras, and proves basic facts linking them to their pre-Lie counterparts. [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 270/0 | Mathlib.lean,Mathlib/Algebra/NonAssoc/Dendriform/Defs.lean,docs/references.bib | 3 | 3 | ['github-actions'] | nobody | 11 days ago | 11 days ago | 11 days |
| 38310 | ZRTMRH | feat(Combinatorics/Quiver/Schreier): word evaluation and reachability | Adds word evaluation and reachability results to the Schreier graph API. * `SchreierGraph.evalWord` : evaluates a word `List (S × Bool)` as an element of the ambient group, where `(s, true)` contributes `ι s` and `(s, false)` contributes `(ι s)⁻¹`. * `SchreierGraph.evalWord_eq_lift` : agreement with `FreeGroup.lift`. * `SchreierGraph.evalWord_mem_closure` : every word evaluates into the subgroup generated by `ι`. * `SchreierGraph.pathFromWord` : a Bool-tagged word yields a path in `Symmetrify (SchreierGraph V ι)` from `x` to `evalWord ι w • x`. * `SchreierGraph.reachable_iff` : two vertices are connected by a path in the symmetrification iff some element of the subgroup closure carries one to the other. Follow-up to #36320. This PR was written with AI assistance (Claude). The code has been reviewed by the author. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics large-import | 157/0 | Mathlib/Combinatorics/Quiver/Schreier.lean | 1 | 2 | ['github-actions'] | nobody | 10 days ago | 10 days ago | 10 days |
| 34138 | pfaffelh | feat(MeasureTheory): Introduce `DiscreteMeasure α` giving rise to a `Measure α` as a sum of `dirac`s | Define `DiscreteMeasure α` as a structure with `weight : α → ℝ≥0∞` Define `toMeasure (w : DiscreteMeasure α) : Measure α` as a sum of diracs Show properties of the resulting objects This PR intends to start a more userfriendly interaction with discrete probability (measure) theory, in contrast to probability mass functions (`PMF`). There are two main differences between `DiscreteMeasure` and `PMF`: * Every `PMF` hast the additional property `HasSum 1`, making the resulting measure a probability measure. (For `DiscreteMeasure`, I intend to use the typeclass `IsProbabilityMeasure`in a later PR instead.) * The `toMeasure` function of `MassFunction` defines the measure as a sum of diracs, which immediately makes computations possible. Discussion thread on [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/PMF.20Refactor.3A.20FunLike.20vs.20Definition.20Change) - depends on: #37060 --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor | 215/0 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Indicator.lean,Mathlib/Data/Set/Pairwise/Basic.lean,Mathlib/MeasureTheory/Measure/DiscreteMeasure.lean | 4 | 26 | ['DavidLedvinka', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'metakunt', 'ocfnash', 'pfaffelh'] | ocfnash | 10 days ago | 10 days ago | 82 days |
| 37010 | pion2024 | `Sl2`update: add theorem `finrank_weightSpace_eq_one_of_isIrreducible` | # Background: I am a 2nd year undergrad student in mathematics currently self-teaching Lie algebra and representation theory. Before starting the formalization, I searched for related keywords on Zulip and in the GitHub issues and commits. As far as I could tell, there were no existing results or ongoing attempts before I started. All feedback is welcome. Even a quick check on the statement design/an idea on the generalization (cf Limitations below) would be incredibly helpful. # Overview In this PR, I added the new section `IsAlgClosedIrreducible` which formalizes the well-known theorem `finrank_weightSpace_eq_one_of_isIrreducible` for the Lie algebra $\mathfrak{sl}_2$ step by step. It proves that for a finite-dimensional irreducible representation of $\mathfrak{sl}_2$ over an algebraically closed field $K$ of characteristic zero, every non-trivial weight space has a dimension of exactly 1. # Formalization Structure : Instead of relying on explicit finite sums (`Finset.sum`) and manipulating coefficients, I heavily leverage Mathlib's abstractions in Submodule Lattice Theory and Coordinate-free Linear Algebra. The formalization proceeds in the following logic: 1. Existence of a Primitive Vector (`exists_primitiveVector`): I construct a primitive (highest-weight) vector by showing that repeated applications of the raising operator $e$ must eventually yield zero due to the finite-dimensionality of $M$ and the linear independence of eigenvectors corresponding to distinct eigenvalues. 2. The span of $f$-Tower as a Lie Submodule equals to the whole space (`fTowerLieSubmodule_eq_top`): I define the $f$-tower submodule as the $K$-span of $\{f^k m \mid k \in \mathbb{N}\}$. By proving its closure under the action of $f, h$, and $e$, I establish it as a Lie submodule. Since $M$ is irreducible, this submodule must be the entire space ($\top$). 3. Submodule Lattice Operations (`exists_mem_fTower_of_weightSpace_ne_bot`): To prove that every weight in $M$ is of the form $\mu_0 - 2k$, I use lattice operations (iSup, inf, and Disjoint) to avoid element-wise tracking. Since the $f$-tower spans $M$, the supremum of its weight spaces is $\top$. By leveraging `Module.End.eigenspaces_iSupIndep`, I show that any arbitrary non-trivial weight space would have a trivial intersection with $\top$ if its weight didn't belong to the sequence, yielding a contradiction. 4. Dimension Calculation via Basis Equivalence (`finrank_weightSpace_eq_one_of_isIrreducible`): Finally, I construct a basis from the non-zero elements of the $f$-tower. To show the weight space is 1-dimensional, I use `Basis.equivFun` to compare coefficients algebraically. This avoids heavy manual indexing and index-shifting, proving that any vector in the weight space $\mu_0 - 2k$ is merely a scalar multiple of $f^k m$. # Use of AI: I used Gemini 3.1 Pro for tactics, theorems, improvement suggestions, and error explanations. I fully understand and can vouch for all the modifications I have made to the file. # Limitations: I only managed to formalize the finite-dimensional version, although the theorem also holds in the infinite-dimensional case. In the infinite case the existence of a primitive vector is not guaranteed. A quick search suggests that we might need heavy tools like Casimir operators and the universal enveloping algebra, which are totally beyond my current level. I am looking into it, but since there is a significant mathematical gap, I thought it would be best to get this finite-dimensional version merged first. | new-contributor t-algebra large-import awaiting-author merge-conflict | 336/0 | Mathlib/Algebra/Lie/Sl2.lean | 1 | 10 | ['github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'ocfnash', 'pion2024'] | ocfnash | 10 days ago | 30 days ago | 2 days |
| 33257 | NickAdfor | feat(Combinatorics/SimpleGraph/Bipartite): Odd Cycle Theorem (A Solution to TODO) | Prove bipartite iff all cycles are even
This PR formalizes the classical graph theory theorem: a graph is bipartite if and only if all its cycles have even length.
Co-authored-by: Nick Adfor |
t-combinatorics new-contributor awaiting-author LLM-generated merge-conflict | 145/12 | Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean | 2 | 80 | ['IvanRenison', 'NickAdfor', 'Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'euprunin', 'github-actions', 'kmill', 'mathlib-merge-conflicts', 'mitchell-horner', 'vihdzp', 'vlad902'] | YaelDillies | 9 days ago | 38 days ago | 52 days |
| 38343 | mortarsanjaya | chore(Data/Nat/Cast/Order/Ring): move two Nat lemmas to Data/Nat/Basic | These two lemmas have no correlation with `Nat.cast`, and the proof can be golfed to fit `Data/Nat/Basic`. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 22/27 | Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Cast/Order/Ring.lean | 2 | 2 | ['github-actions'] | nobody | 9 days ago | 10 days ago | 10 days |
| 37964 | mortarsanjaya | feat(Algebra/Order/Floor): weaken assumptions on theorems about `FloorRing` | This PR weakens as much assumptions as possible on theorems about `FloorSemiring` and `FloorRing`. Mainly, `IsOrderedRing` and `IsStrictOrderedRing` are weakened to just `IsOrderedAddMonoid` or removed completely from the assumptions on the theorems. Most theorems can be generalized as is or only requires a minor modification of replacing lemmas about casting naturals/integers preserving order (the likes of `Nat.cast_le`, `Int.cast_lt`, etc.) with the corresponding version for `FloorRing`. Some other lemmas require modification in the proofs, but these changes shorten the proofs. The new proof of the theorem `Int.mul_cast_floor_div_cancel_of_pos` requires an extra import. The assumption `IsOrderedAddMonoid` is required on lemmas that involve comparison + addition, and `IsOrderedRing` is required only on lemmas that involve comparison + multiplication of two non-integer elements. --- - [ ] depends on: #37714 [](https://gitpod.io/from-referrer/) | t-algebra new-contributor blocked-by-other-PR | 349/266 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/Computation/TerminatesIffRat.lean,Mathlib/Algebra/Order/Floor/Defs.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/Round.lean,Mathlib/Data/Int/Log.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 9 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 18 days ago | 1 hour |
| 37279 | imalinowskip | feat(Probability): multivariate CLT (and Cramèr-Wold) | --- - [x] depends on: #36208 [](https://gitpod.io/from-referrer/) | new-contributor t-measure-probability awaiting-author large-import | 500/1 | Mathlib.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/CramerWold.lean | 3 | 10 | ['EtienneC30', 'github-actions', 'imalinowskip', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | RemyDegenne | 8 days ago | 22 days ago | 5 days |
| 38316 | tannerduve | feat(Order/OmegaCompletePartialOrder): least fixed point and Scott induction | Add `lfp` for endomorphisms on an ωCPO with a least element and its basic API (`map_lfp`, `isFixedPt_lfp`, `lfp_le_fixed`, `isLeast_lfp`) and the Scott induction theorem `lfp_induction` Also add corresponding induction principles for `Part.fix`: `fix_scott_induction` (ω-Scott continuous functional, admissible predicate) and `fix_scott_induction_pointwise` | new-contributor | 110/0 | Mathlib/Control/LawfulFix.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,docs/references.bib | 3 | 2 | ['github-actions'] | nobody | 8 days ago | 10 days ago | 10 days |
| 37374 | NoneMore | feat(Topology/DerivedSet): add relative derived set lemmas | Add `relDerivedSet`, `relDerivedSet_subset`, and `IsClosed.relDerivedSet_eq`. --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor | 17/0 | Mathlib/Topology/DerivedSet.lean | 1 | 6 | ['NoneMore', 'github-actions', 'plp127', 'vihdzp'] | urkud | 8 days ago | 31 days ago | 31 days |
| 38399 | openendings | feat: OrderHom.instOrderSupSet for LawfulSup | Currently we have `instance [CompleteLattice β] : SupSet (α →o β)`. We replace this with a mere `LawfulSup` assumption such as #38328, . TODO: - [ ] construct an `OrderSupSet` instance instead of `SupSet` --- WIP - [ ] depends on: #38328 [or other `LawfulSup`] (based on master in case something else needs this) [](https://gitpod.io/from-referrer/) | WIP t-order new-contributor blocked-by-other-PR | 26/0 | Mathlib/Order/Hom/Order.lean | 1 | 5 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'openendings'] | nobody | 8 days ago | 8 days ago | 1 minute |
| 38373 | Nicola9Falciola | feat (Algebra/FreeAbelianGroup /Finsupp) : The support of non zero element in a freeabeliangroup is non empty | Add the lemma that for a nonzero a : FreeAbelianGroup X the support of it is non empty. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 3/0 | Mathlib/Algebra/FreeAbelianGroup/Finsupp.lean | 1 | 7 | ['Nicola9Falciola', 'SnirBroshi', 'github-actions'] | nobody | 8 days ago | 8 days ago | 9 days |
| 38388 | supermanG | feat(Combinatorics/SimpleGraph): add ballFinset with basic identities | Introduces `SimpleGraph.ballFinset`, the `Finset` companion to `SimpleGraph.ball` (#36443) on graphs with a `Fintype` vertex set, together with the basic identities `mem_ballFinset`, `ballFinset_zero`, and `ballFinset_one`. `SimpleGraph.ball` is the *open* metric ball `{u | edist u c < r}` and is indexed by `ℕ∞`; `ballFinset` is typed `ℕ → Finset V` for ergonomics at cardinality-facing call sites. The classical closed-ball cardinality at radius `r`, `|{u | edist u c ≤ r}|`, corresponds to `|ballFinset v (r + 1)|` in this setup. Opened as draft so CI can run before pinging maintainers. --- First-time Mathlib contribution — happy to adjust naming, file placement, or docstring style to match house conventions. Follow-up PRs will add cardinality envelopes (sphere cardinality, geometric-series bound, polynomial bound). | t-combinatorics new-contributor LLM-generated | 68/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/BallCardinality.lean | 2 | 3 | ['SnirBroshi', 'github-actions'] | nobody | 8 days ago | unknown | 0 seconds |
| 35753 | Vilin97 | feat(Topology/Algebra/Order): regular grid helpers and piecewise linear interpolation | Make API for piecewise linear interpolation on regular grids. I need these to for ODE time-stepping methods, like forward Euler, and later Runge–Kutta methods. Follow-up PR: #35755 (forward Euler method convergence). I don't know if these numerical analysis ODE-solving methods even belong in mathlib. If someone could advise me on it, I would appreciate it. --- The initial proof was produced by [Aristotle](https://aristotle.harmonic.fun). The code was iteratively refined (factoring out lemmas, golfing, simplifying proofs) using Claude Code. - [ ] depends on: #38091 | t-topology new-contributor LLM-generated awaiting-author | 180/0 | Mathlib.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean | 2 | 51 | ['Vilin97', 'YanYablonovskiy', 'adomani', 'botbaki-review', 'copilot-pull-request-reviewer', 'dagurtomas', 'eric-wieser', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-dependent-issues', 'wwylele'] | j-loreaux | 8 days ago | 8 days ago | 32 days |
| 38214 | emlis42 | feat(Algebra/ContinuedFractions): add Euler's continued fraction | This PR formalizes Euler’s continued fractions by providing `Euler` which construct one by giving head term and coefficients with some basic property. We also introduce a transformation `GenContFract.toEuler` that maps a generalized continued fraction `g : GenContFract K` to an equivalent Euler-form continued fraction. | new-contributor t-algebra | 262/0 | Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Euler.lean | 2 | 15 | ['github-actions', 'mathlib-bors', 'wwylele'] | nobody | 8 days ago | 8 days ago | 8 days |
| 38114 | javgomzar | feat(FinitelyPresentedGroup): add finite groups instance | Add IsFinitelyPresented instance for finite groups.
Co-authored-by: Hang Lu Su |
t-group-theory new-contributor large-import | 32/3 | Mathlib/GroupTheory/FinitelyPresentedGroup.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean | 2 | 32 | ['github-actions', 'javgomzar', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536', 'vihdzp'] | mattrobball | 7 days ago | 9 days ago | 12 days |
| 37062 | tannerduve | feat(Computability): Turing join and semilattice structure on Turing degrees | ## Summary - Add `Partrec.kronecker` (equality test) and `Partrec.join` (disjoint union by parity) in `Partrec.lean` - Prove `Nat.RecursiveIn` is closed under computable conditionals (`cond_const`, `cond`) - Show each component reduces to the join (`left_le_join`, `right_le_join`) and the join is the least upper bound (`join_le`) - Establish `SemilatticeSup` instance on `TuringDegree` | t-computability new-contributor large-import | 311/15 | Mathlib/Computability/Partrec.lean,Mathlib/Computability/RecursiveIn.lean,Mathlib/Computability/TuringDegree.lean | 3 | 7 | ['Komyyy', 'github-actions', 'mathlib-merge-conflicts', 'tannerduve'] | Komyyy | 7 days ago | 18 days ago | 18 days |
| 38334 | 8e7 | feat(Combinatorics/SimpleGraph/TreeDecomp): define tree decompositions | Add definition for tree decompositions on simple graphs. Define the tree width of a simple graph and prove basic statements and conversions. ```lean structure TreeDecomp (G : SimpleGraph V) where /-- The type of bags in the tree. -/ W : Type u /-- The set of vertices in each bag. -/ 𝓧 : W → Finset V /-- The graph adjacency relation of bags. -/ T : SimpleGraph W /-- T must be a tree. -/ isTree : IsTree T /-- All vertices in G must appear in some bag. -/ vertexCover : ∀ v : V, ∃ w : W, v ∈ 𝓧 w /-- For any edge (u, v) in G, there is a bag containing both u and v. -/ edgeCover ⦃u v : V⦄ : G.Adj u v → ∃ w : W, u ∈ 𝓧 w ∧ v ∈ 𝓧 w /-- For any vertex v in G, the set of bags that contain v is preconnected. -/ connectedBags : ∀ v : V, (T.induce ({w | v ∈ 𝓧 w})).Preconnected ``` AI Usage: Some proofs are written with the help of Claude Code, and everything has been manually reviewed. --- - [ ] depends on: #38027 [](https://gitpod.io/from-referrer/) | new-contributor help-wanted blocked-by-other-PR t-combinatorics LLM-generated WIP | 396/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Star.lean,Mathlib/Combinatorics/SimpleGraph/TreeDecomp.lean | 3 | 5 | ['8e7', 'github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 10 days ago | 5 minutes |
| 35976 | Phelixh | feat: add add Liu's uncertainty theory foundations (core/distribution/process modules) | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author LLM-generated | 2383/0 | Mathlib.lean,Mathlib/Uncertainty/Base.lean,Mathlib/Uncertainty/BaseCore.lean,Mathlib/Uncertainty/BaseDistribution.lean,Mathlib/Uncertainty/BaseProcess.lean,Mathlib/Uncertainty/Uncertainty.lean | 6 | 41 | ['Phelixh', 'copilot-pull-request-reviewer', 'github-actions', 'grunweg'] | nobody | 7 days ago | 13 days ago | 20 days |
| 36853 | matthunz | feat(CategoryTheory/Monoidal/Braded/Traced): add `TracedCategory` class | Adds a `TracedCategory` class following [A. Joyal and R. Street and D. R. Verity, *Traced monoidal categories*](https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/abs/traced-monoidal-categories/2BE85628D269D9FABAB41B6364E117C8#article): ```lean /-- A traced symmetric monoidal category. -/ class TracedCategory (C : Type u) [Category.{v} C] [MonoidalCategory.{v} C] [SymmetricCategory.{v} C] where /-- The trace operator. -/ trace : ∀ {A B : C} (W : C), (A ⊗ W ⟶ B ⊗ W) → (A ⟶ B) /-- Left tightening: sliding a morphism past the trace on the left. -/ trace_naturality_left : ∀ {A A' B : C} (W : C) (f : A' ⟶ A) (g : A ⊗ W ⟶ B ⊗ W), trace W (f ▷ W ≫ g) = f ≫ trace W g := by cat_disch /-- Right tightening: sliding a morphism past the trace on the right. -/ trace_naturality_right : ∀ {A B B' : C} (W : C) (f : A ⊗ W ⟶ B ⊗ W) (g : B ⟶ B'), trace W (f ≫ g ▷ W) = trace W f ≫ g := by cat_disch /-- Sliding: an endomorphism on the feedback wire slides past the trace. -/ trace_dinaturality : ∀ {A B W : C} (f : A ⊗ W ⟶ B ⊗ W) (h : W ⟶ W), trace W (f ≫ B ◁ h) = trace W (A ◁ h ≫ f) := by cat_disch /-- Superposing: trace commutes with left tensoring by a bystander object. -/ trace_superposing : ∀ {A B : C} (C' W : C) (f : A ⊗ W ⟶ B ⊗ W), C' ◁ trace W f = trace W ((α_ C' A W).hom ≫ C' ◁ f ≫ (α_ C' B W).inv) := by cat_disch /-- Vanishing I: trace over the tensor unit is the morphism itself (up to unitors). -/ trace_vanishing_one : ∀ {A B : C} (f : A ⊗ 𝟙_ C ⟶ B ⊗ 𝟙_ C), trace (𝟙_ C) f = (ρ_ A).inv ≫ f ≫ (ρ_ B).hom := by cat_disch /-- Vanishing II: trace over a tensor product equals iterated trace. -/ trace_vanishing_two : ∀ {A B X Y : C} (f : A ⊗ (X ⊗ Y) ⟶ B ⊗ (X ⊗ Y)), trace (X ⊗ Y) f = trace X (trace Y ((α_ A X Y).hom ≫ f ≫ (α_ B X Y).inv)) := by cat_disch /-- Yanking: the trace of the braiding is the identity. -/ trace_yanking : ∀ (W : C), trace W (β_ W W).hom = 𝟙 W := by cat_disch ``` ## Motivation `TracedCategory` can be used for denoting things like electric circuits, which require a traced symmetric monoidal category for the wire graph network. ## Future work - `instance [CompactClosedCategory C] : TracedCategory C` - possible notation such as `Tr_[W] f` --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author merge-conflict | 237/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Braided/Traced.lean,Mathlib/CategoryTheory/Monoidal/Rigid/Traced.lean,docs/references.bib | 4 | 5 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'matthunz'] | nobody | 7 days ago | 42 days ago | 7 hours |
| 37299 | XC0R | feat(NumberTheory): Chebyshev's lower bound on primorial | ## Summary Prove `primorial(n) ≥ 2^(n/2)` for all `n ≥ 2` (Chebyshev's 1852 lower bound). This is the lower bound complement to `primorial_le_four_pow`. Addresses the TODO at `Chebyshev.lean` line 50: "Prove Chebyshev's lower bound." ### New file: `Mathlib/NumberTheory/PrimorialLowerBound.lean` **Main theorems:** - `two_pow_le_primorial`: `2 ^ n ≤ primorial (2 * n)` for `n ≥ 29` - `two_pow_div_two_le_primorial`: `2 ^ (n / 2) ≤ primorial n` for `n ≥ 2` **Key intermediates:** - `centralBinom_le_pow_mul_primorial`: `C(2n,n) ≤ (2n)^{π(√(2n)+1)} * primorial(2n)` - `eight_mul_sq_add_le_two_pow`: `8u² + 16u + 8 ≤ 2^u` for `u ≥ 10` ### Proof technique Central binomial decomposition: from `four_pow_lt_mul_centralBinom` and `factorization_choose_le_log`, bound `C(2n,n)` above by `(2n)^{π(√(2n)+1)} * primorial(2n)`. Rearranging gives `primorial(2n) ≥ 2^n` for `n ≥ 29`. Base cases by `norm_num` + `decide`, large `n` analytically via `√n` factoring. ### AI disclosure Claude (Anthropic) was used as a coding assistant for Lean tactic exploration, file structuring, and CI debugging. All proof strategy, mathematical content, and final code have been reviewed and are understood by the author. | t-number-theory new-contributor awaiting-author | 230/5 | Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/Primorial.lean,Mathlib/NumberTheory/SmoothNumbers.lean | 3 | 52 | ['MichaelStollBayreuth', 'Parcly-Taxel', 'XC0R', 'github-actions', 'wwylele'] | MichaelStollBayreuth | 7 days ago | 21 days ago | 13 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 13158 | erdOne | refactor(RingTheory/OreLocalization/Module): remove `LocalizedModule.mk`. | --- - [x] depends on: #13151 - [ ] depends on: #13156 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 49/48 | Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/RingTheory/OreLocalization/Module.lean | 2 | 2 | ['leanprover-community-mathlib4-bot', 'urkud'] | nobody | 3 months ago | 694 days ago | 9 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Approval(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 12608 | eric-wieser | feat: allow `nsmul` / `zsmul` to be omitted again, with a warning | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-meta | 118/2 | Mathlib.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DefaultFieldLinter.lean,scripts/noshake.json,test/default_field_linter.lean | 6 | 12 | ['YaelDillies', 'eric-wieser', 'fpvandoorn', 'github-actions'] | nobody | 1 | 1 year ago | 712 days ago | 5 days |
| 8519 | eric-wieser | refactor(LinearAlgebra/TensorProduct): golf using `liftAddHom` | This new `TensorProduct.liftAddHom` doesn't require bilinearity, only that scalar multiplication can be moved between the arguments. While in theory we only need the `AddMonoidHom` version as it offers exactly the same generality, we first provide an unbundled `liftFun` as this seems to give a sizeable performance boost if used in downstream `lift` variants. --- - [x] depends on: #8571 - [x] depends on: #8584 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 53/50 | Mathlib/Algebra/Category/AlgebraCat/Monoidal.lean,Mathlib/LinearAlgebra/TensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean | 3 | 28 | ['bustercopley', 'eric-wieser', 'jcommelin', 'jjaassoonn', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib-bors'] | nobody | 1 | 1 year ago | 879 days ago | 5 days |
| 9146 | laughinggas | feat(Data/ZMod/Defs): Topological structure on `ZMod` | Added a discrete topology structure to `ZMod n` for all `n` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-topology | 55/3 | Mathlib.lean,Mathlib/Topology/Algebra/Constructions.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Instances/ZMod.lean,Mathlib/Topology/Maps.lean | 5 | 61 | ['YaelDillies', 'eric-wieser', 'github-actions', 'jcommelin', 'laughinggas', 'mo271', 'urkud'] | nobody | 1 | 1 year ago | 845 days ago | 7 days |
| 6403 | astrainfinita | chore: change instance priorities of `Ordered*` hierarchy | --- [](https://gitpod.io/from-referrer/) | t-algebra t-order merge-conflict slow-typeclass-synthesis awaiting-author | 253/79 | Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Star.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/RingTheory/HahnSeries.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 18 | 39 | ['Vierkantor', 'astrainfinita', 'digama0', 'eric-wieser', 'j-loreaux', 'leanprover-bot'] | nobody | 1 | 1 year ago | 883 days ago | 13 days |
| 12751 | Command-Master | feat: add lemmas for Nat/Bits, Nat/Bitwise and Nat/Size | Remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 66/7 | Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Size.lean | 4 | 26 | ['Command-Master', 'Rida-Hamadani', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | 1 | 1 year ago | 655 days ago | 56 days |
| 15448 | urkud | chore(*): deprecate `Option.elim'` | Use `Option.elim` instead. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt | 54/50 | Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/Calculus/LagrangeMultipliers.lean,Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/TMToPartrec.lean,Mathlib/Data/Option/Defs.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/Logic/Embedding/Set.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/Topology/Compactness/Paracompact.lean,Mathlib/Topology/LocallyFinite.lean | 17 | 12 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'grunweg', 'urkud'] | nobody | 1 | 1 year ago | 629 days ago | 7 days |
| 13514 | madvorak | feat(Computability/ContextFreeGrammar): closure under union | - [ ] depends on: #15895 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability blocked-by-other-PR | 448/4 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 50 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'leanprover-community-mathlib4-bot', 'madvorak'] | nobody | 1 | 1 year ago | 623 days ago | 72 days |
| 12133 | ADedecker | feat: generalize instIsLowerProd to arbitrary products | Also change a bit the proof of the product case to match my own taste, feel free to tell if you prefer the old one. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 34/14 | Mathlib/Topology/Constructions.lean,Mathlib/Topology/Order/LowerUpperTopology.lean | 2 | 13 | ['Ruben-VandeVelde', 'TwoFX', 'github-actions', 'jcommelin', 'mans0954', 'mathlib-bors', 'riccardobrasca'] | nobody | 2 | 1 year ago | 683 days ago | 63 days |
| 18461 | hannahfechtner | feat: left and right common multiples mixins | add mixins for left and right common multiples. These carry the data of what factors are used to create the common multiples --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 78/0 | Mathlib/Algebra/Group/Defs.lean | 1 | 13 | ['github-actions', 'hannahfechtner', 'jcommelin', 'kbuzzard', 'kim-em', 'trivial1711'] | nobody | 1 | 1 year ago | 466 days ago | 69 days |
| 2605 | eric-wieser | chore: better error message in linarith | On this mwe: ```lean import Mathlib.Tactic.Linarith example (s : Set ℕ) (h : s = s) : 0 ≤ 1 := by linarith ``` this now indicates where the internal error is coming from. Is there a better way of chaining errors than this? --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 12/1 | Mathlib/Tactic/Linarith/Preprocessing.lean | 1 | 3 | ['Vierkantor', 'harahu', 'kim-em', 'mo271'] | nobody | 1 | 1 year ago | 1103 days ago | 51 days |
| 19425 | hrmacbeth | perf: gcongr forward-reasoning adjustment | This PR changes the "forward-reasoning" component of `gcongr`, rendering it more efficient, particularly in problems with a large number of variables/hypotheses in the context.
Previously `gcongr` attempted to match *every* `LocalDecl` against *every* node in the parse tree using *each* of the five implemented `@[gcongr_forward]` mini-tactics: matching directly, matching after applying `symm`, matching after applying `le_of_lt`, etc etc.
The new algorithm filters out the non-Prop `LocalDecl`s, and also adjusts the `@[gcongr_forward]` extensions so that, rather than re-apply the relevant lemmas (`symm`, `le_of_lt`, etc) at every node in the parse tree, the lemmas are applied in advance to the `LocalDecl`s and the result (if successful) stored.
The performance effect on mathlib as a whole is miniscule, but it speeds up the profiler's count of "tactic execution of Mathlib.Tactic.GCongr" in the newly-added test from 257 ms to 47 ms, and has a similar effect on real-life examples in an analysis project of mine.
Co-authored-by: Mario Carneiro |
merge-conflict awaiting-author | 130/59 | Mathlib/Order/Lattice.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GCongr/ForwardAttr.lean,MathlibTest/GCongr/inequalities.lean | 4 | 17 | ['Vierkantor', 'github-actions', 'hrmacbeth', 'leanprover-bot', 'leanprover-community-bot-assistant'] | Vierkantor | 1 | 1 year ago | 519 days ago | 1 day |
| 19315 | quangvdao | feat(Data/Finsupp/Fin): Add `Finsupp` operations on `Fin` tuple | This PR adds more analogues of operations on `Fin` tuples to the `Finsupp` setting. Before, there were only `Finsupp.cons` and `Finsupp.tail`. Now there are also `Finsupp.snoc`, `Finsupp.insertNth`, `Finsupp.init`, and `Finsupp.removeNth`. These all come with supporting lemmas. I also removed the porting comment about `succAboveCases` in `Data/Fin/Basic`, and added a lemma about `succAbove` in `Data/Fin/Tuple/Basic`. --- - [x] depends on: #20361 - [x] depends on: #20771 - [x] depends on: #20770 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 193/16 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Data/Finsupp/Fin.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,scripts/nolints_prime_decls.txt | 6 | 44 | ['YaelDillies', 'github-actions', 'j-loreaux', 'kbuzzard', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 1 | 11 months ago | 437 days ago | 43 days |
| 21276 | GabinKolly | feat(ModelTheory/Substructures): define equivalences between equal substructures | Define first-order equivalences between equal substructures, and prove related properties. --- This is some preparatory work for #18876 [](https://gitpod.io/from-referrer/) | awaiting-author t-logic | 62/0 | Mathlib/ModelTheory/Substructures.lean | 1 | 19 | ['GabinKolly', 'YaelDillies', 'fpvandoorn', 'github-actions', 'grunweg'] | nobody | 1 | 11 months ago | 357 days ago | 46 days |
| 25401 | digama0 | feat(Util): SuppressSorry option | See also leanprover/lean4#8611 and [#lean4 > Silent sorry @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/Silent.20sorry/near/503537964). This is a stop-gap solution while leanprover/lean4#8611 is underway, but it works about as well as any other built in option. Hooking declaration elaborators turns out to be a very powerful technique. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 342/0 | Mathlib.lean,Mathlib/Util/CommandElabHook.lean,Mathlib/Util/SuppressSorry.lean,MathlibTest/suppressSorry.lean | 4 | 15 | ['digama0', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | alexjbest | 1 | 8 months ago | 260 days ago | 71 days |
| 26462 | PSchwahn | feat(LinearAlgebra/Projection): add results about inverse of `Submodule.prodEquivOfIsCompl` | Add two theorems `Submodule.prodEquivOfIsCompl_symm_apply` and `Submodule.prodEquivOfIsCompl_symm_add`, which are API for `Submodule.prodEquivOfIsCompl`. We believe these theorems are useful; for example, we have used their statements in a [classification formalization project](https://github.com/LieLean/LowDimSolvClassification). Co-authored by: - [Viviana del Barco](https://github.com/vdelbarc) - [Gustavo Infanti](https://github.com/GuQOliveira) - [Exequiel Rivas](https://github.com/erivas) --- I am not sure whether the `prodEquivOfIsCompl_symm_apply` theorem should be tagged with `@[simp]`; this might lead to confluence issues. Opinions are welcome! [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 10/0 | Mathlib/LinearAlgebra/Projection.lean | 1 | 7 | ['PSchwahn', 'github-actions', 'joelriou', 'kckennylau'] | joelriou | 1 | 7 months ago | 235 days ago | 73 days |
| 27937 | madvorak | feat(Logic/Basic): `congr_heq₂` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-logic | 6/0 | Mathlib/Logic/Basic.lean | 1 | 8 | ['YaelDillies', 'fpvandoorn', 'github-actions', 'madvorak', 'vihdzp'] | fpvandoorn | 1 | 7 months ago | 252 days ago | 17 days |
| 21950 | erdOne | feat(NumberTheory/Padics): the completion of `ℚ` at a finite place is `ℚ_[p]` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-number-theory | 253/1 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroMulInt.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 7 | 33 | ['Ruben-VandeVelde', 'erdOne', 'faenuccio', 'github-actions', 'leanprover-community-bot-assistant', 'pechersky', 'smmercuri', 'xroblot'] | nobody | 1 | 7 months ago | 298 days ago | 73 days |
| 26330 | Timeroot | feat: "Junk value" test file | This PR continues the work from #25173. Original PR: https://github.com/leanprover-community/mathlib4/pull/25173 | awaiting-author t-data | 360/0 | MathlibTest/Junk.lean | 1 | 17 | ['SnirBroshi', 'Timeroot', 'bryangingechen', 'github-actions', 'leanprover-community-bot-assistant', 'madvorak', 'pechersky', 'vihdzp'] | pechersky | 2 | 7 months ago | 213 days ago | 48 days |
| 27302 | tristan-f-r | feat(Fintype/Quotient): finLiftOn₂ | The combination of [`Quotient.finLiftOn`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Fintype/Quotient.html#Quotient.finLiftOn) and [`liftOn₂`](https://leanprover-community.github.io/mathlib4_docs/Init/Core.html#Quotient.liftOn%E2%82%82). --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data | 19/0 | Mathlib/Data/Fintype/Quotient.lean | 1 | 12 | ['github-actions', 'kckennylau', 'pechersky', 'tristan-f-r', 'vihdzp'] | pechersky | 2 | 6 months ago | 197 days ago | 6 days |
| 28925 | grunweg | chore: remove `linear_combination'` tactic | When `linear_combination` was refactored in #15899, the old code was kept as the `linear_combination'` tactic, for easier migration. The consensus of the zulip discussion ([#mathlib4 > Narrowing the scope of `linear_combination` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Narrowing.20the.20scope.20of.20.60linear_combination.60/near/470237816)) was to wait, and "revisit this once people have experienced the various tactics in practice". One year later, the old tactic has almost no uses: it is unused in mathlib; [searching on github](https://github.com/search?q=linear_combination%27%20path%3A*.lean&type=code) yields 37 hits --- all of which are in various forks of mathlib. Thus, removing this tactic seems appropriate. --- Do not merge before the zulip discussion has concluded! [](https://gitpod.io/from-referrer/) | merge-conflict file-removed awaiting-zulip | 0/564 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/LinearCombination'.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,MathlibTest/linear_combination'.lean | 5 | 4 | ['euprunin', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 1 | 6 months ago | 248 days ago | 1 second |
| 28737 | astrainfinita | refactor: deprecate `MulEquivClass` | This PR continues the work from #18806. Original PR: https://github.com/leanprover-community/mathlib4/pull/18806 | merge-conflict awaiting-author t-algebra | 67/77 | Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/Group/Equiv/Basic.lean,Mathlib/Algebra/Group/Equiv/Defs.lean,Mathlib/Algebra/Group/Irreducible/Lemmas.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Group/Units/Equiv.lean,Mathlib/Algebra/GroupWithZero/Equiv.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Prime/Lemmas.lean,Mathlib/Algebra/Ring/Divisibility/Basic.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Star/MonoidHom.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean,Mathlib/GroupTheory/GroupExtension/Defs.lean,Mathlib/GroupTheory/Submonoid/Center.lean,Mathlib/LinearAlgebra/FreeModule/Finite/CardQuotient.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/UniqueFactorizationDomain/NormalizedFactors.lean,Mathlib/Topology/Algebra/ContinuousMonoidHom.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | 26 | 20 | ['Vierkantor', 'alreadydone', 'astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | Vierkantor | 1 | 6 months ago | 248 days ago | 2 days |
| 27180 | ADedecker | feat: quotient of a monoid with zero by a multiplicative congruence | --- My motivation is getting a more conceptual construction of [ValuativeRel.ValueGroupWithZero](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Valuation/ValuativeRel.html#ValuativeRel.ValueGroupWithZero), but I think this is of independent interest. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra delegated | 141/26 | Mathlib.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/GroupWithZero.lean | 5 | 32 | ['ADedecker', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'ocfnash'] | ocfnash | 1 | 6 months ago | 261 days ago | 28 days |
| 9352 | chenyili0818 | feat: arithmetic lemmas for `gradient` | This file is based on Mathlib.Analysis.Calculus.Gradient.Basic, and describes the calculation properties Co-authored-by: Ziyu Wang [tropicalfish910@gmail.com](mailto:tropicalfish910@gmail.com) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 404/0 | Mathlib.lean,Mathlib/Analysis/Calculus/Gradient/Lemmas.lean | 2 | 31 | ['chenyili0818', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot', 'sgouezel', 'winstonyin'] | nobody | 1 | 5 months ago | 801 days ago | 52 days |
| 11890 | adomani | feat: the terminal refine linter | A linter that warns on usages of `refine` and `refine'` as a finishing tactic. See this [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Usage.20of.20refine'). ### Conclusion of the experiment Systematic replacements of terminal `refine` with `exact` leads to an overall slow-down. --- - [ ] depends on: #15616 (disable the linter in downstream projects) [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 77/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/TerminalRefineLinter.lean | 3 | 15 | ['adomani', 'github-actions', 'grunweg', 'joneugster', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 1 | 5 months ago | 625 days ago | 18 days |
| 20924 | tomaz1502 | feat(Computability/QueryComplexity): Oracle-based computation | This PR adds the types and lemmas for oracle-based computation. In this model, computations are run on a monad which also counts the number of oracle queries executed. With it, it becomes possible to reason about the upper bound of the query complexity of algorithms. In the future, we could extend this work to include the necessary bits from information theory and probability to also reason about lower bounds on query complexity, like the work in https://github.com/girving/debate.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2318629.20runtime.20complexity.20of.20sorting.20a.20list
Co-authored-by: Geoffrey Irving |
merge-conflict t-computability | 305/0 | Mathlib.lean,Mathlib/Computability/QueryComplexity/Basic.lean,Mathlib/Computability/QueryComplexity/Defs.lean | 3 | 60 | ['eric-wieser', 'girving', 'github-actions', 'mathlib4-merge-conflict-bot', 'quangvdao', 'tomaz1502'] | nobody | 1 | 5 months ago | 432 days ago | 27 days |
| 21624 | sinhp | feat(CategoryTheory): The (closed) monoidal structure on the product category of families of (closed) monoidal categories | Given a family of closed monoidal categories, we show that the product of these categories is a closed monoidal category with the pointwise monoidal structure. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 144/0 | Mathlib.lean,Mathlib/CategoryTheory/Pi/Basic.lean,Mathlib/CategoryTheory/Pi/Monoidal.lean,Mathlib/CategoryTheory/Pi/MonoidalClosed.lean | 4 | 20 | ['TwoFX', 'YaelDillies', 'b-mehta', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 1 | 5 months ago | 388 days ago | 50 days |
| 22159 | shetzl | feat: add definition of pushdown automata | Add the definition of pushdown automata and their two acceptance conditions: acceptance based on empty stack and acceptance based on final state.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 70/0 | Mathlib.lean,Mathlib/Computability/PDA.lean | 2 | 35 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 1 | 5 months ago | 410 days ago | 20 days |
| 22919 | plp127 | feat(Data/Fintype/Pi): Make `Fintype` instance for `RelHom`s computable | Makes the `Fintype` instance for rel homs computable. See this [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Classical.20vs.20constructive.20logic.20in.20computation/near/496220816) message. --- - [x] depends on: #24748 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 178/44 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Data/Fintype/CardEmbedding.lean,Mathlib/Data/Fintype/Pi.lean | 5 | 31 | ['IvanRenison', 'b-mehta', 'eric-wieser', 'fpvandoorn', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127'] | b-mehta | 1 | 5 months ago | 337 days ago | 71 days |
| 26914 | quangvdao | feat(Data/PFunctor/Univariate): more definitions for univariate `PFunctor` | This PR defines several basic definitions of `PFunctor`, including zero, one, constants, monomials, coproduct (sum), product, sigma, pi, tensor product, universe lifting, and equivalence. We also add: (1) simple lemmas connecting the basic definitions, (2) an automatically derived ext lemma for `PFunctor` via `@[ext]` attribute Some things I'm not clear on: - I define `HAdd` and `HMul` instances for coproduct and product of poly functors having different universe levels. Should I also define `Add` and `Mul` instances for poly functors having the same universe level? - Is it ok to define notation for tensor product, i.e. `@[inherit_doc] scoped infixr:80 " ⊗ " => tensor`? I'm worried it might clash with other notation. - Need a double-check on the priority of notation. Some future definitions to add: - Various equivalences arising from arithmetic identities, e.g., `P + 0 ≃ₚ P`. - Definitions of Lenses and Charts (each of them will be a file or even a folder) - Exponential objects (corresponding to both `prod` and `tensor`) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 144/5 | Mathlib/Data/PFunctor/Univariate/Basic.lean | 1 | 20 | ['alexkeizer', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'quangvdao'] | eric-wieser | 1 | 5 months ago | 163 days ago | 133 days |
| 27163 | pechersky | feat(Topology/ValuativeRel): of and to basis of compatible valuations | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #30262 | t-number-theory t-algebra merge-conflict awaiting-author t-topology | 229/62 | Mathlib/NumberTheory/LocalField/Basic.lean,Mathlib/Order/Filter/Bases/Basic.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 3 | 73 | ['erdOne', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky', 'smmercuri'] | alreadydone | 1 | 5 months ago | 164 days ago | 84 days |
| 28325 | pechersky | feat(WithZeroTopology): `locallyCompactSpace_iff_locallyFiniteOrder_units` | On the way to golf/generalize the proof that locally compact valued fields have locally finite valuation groups as embodied in `Valued.integer.locallyFiniteOrder_units_mrange_of_isCompact_integer` ] --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-order large-import | 81/2 | Mathlib/Topology/Algebra/GroupWithZero.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean,Mathlib/Topology/Compactness/Compact.lean | 3 | 13 | ['erdOne', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'ocfnash'] | PatrickMassot | 1 | 5 months ago | 168 days ago | 93 days |
| 28871 | JaafarTanoukhi | feat(Combinatorics/Digraph): Tournaments | Define orientations and tournaments. Related to #26771.
Co-authored-by: Rida Hamadani |
merge-conflict t-combinatorics new-contributor | 62/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/Digraph/Tournament.lean | 3 | 6 | ['JaafarTanoukhi', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'mathlib4-merge-conflict-bot'] | kmill | 1 | 5 months ago | 163 days ago | 71 days |
| 11800 | JADekker | feat: KappaLindelöf spaces | Define KappaLindelöf spaces by following the first one-third of the API for Lindelöf spaces. The remainder will be added in a future PR. --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-topology awaiting-zulip | 301/2 | Mathlib.lean,Mathlib/Topology/Compactness/KappaLindelof.lean,Mathlib/Topology/Compactness/Lindelof.lean | 3 | 38 | ['ADedecker', 'JADekker', 'PatrickMassot', 'StevenClontz', 'adomani', 'github-actions', 'grunweg', 'kim-em', 'urkud'] | nobody | 1 | 5 months ago | 638 days ago | 123 days |
| 26310 | kckennylau | feat: binary forms | This PR provides the basic definition of binary forms, which are homogeneous polynomials in two variables. --- - [ ] depends on: #26312 - [ ] depends on: #26313 - [ ] depends on: #26314 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 73/0 | Mathlib.lean,Mathlib/RingTheory/MvPolynomial/BinaryForm.lean | 2 | 14 | ['MichaelStollBayreuth', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'ocfnash'] | ocfnash | 1 | 5 months ago | 255 days ago | 7 days |
| 24514 | b-mehta | chore(Int/GCD): use fuel in xgcd | Modify the definition of xgcd to use fuel recursion, to allow it to be reduced in the kernel. As a consequence, this means the evaluation of field operations in ZMod p become provable by `rfl` and `decide`. Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/opaque.20recursion.20definitions.20break.20mergeSort.20decidability --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data merge-conflict | 44/22 | Mathlib/Data/Int/GCD.lean | 1 | 6 | ['astrainfinita', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'nomeata', 'urkud'] | nobody | 1 | 5 months ago | 306 days ago | 58 days |
| 28057 | plp127 | feat(SuccOrder): simp lemma to refold `Order.succ` and `Order.pred` | Adds `SuccOrder.succ_eq_succ` and `PredOrder.pred_eq_pred` to refold `SuccOrder.succ` and `PredOrder.pred` into `Order.succ` and `Order.pred`. These lemmas are marked `@[simp]`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-order merge-conflict | 8/2 | Mathlib/Order/SuccPred/Basic.lean | 1 | 4 | ['YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | bryangingechen | 1 | 4 months ago | 223 days ago | 44 days |
| 26912 | pechersky | chore(Algebra/Ring/Subring): simp tag `Subring.smul_def` | s-multiplying by a subtype is easiest to manipulate when both terms are in the ambient type. Many places that had to use the _def lemma for a rewrite, or to include it in a simp set, no longer have to. Ported from #25308 --- [](https://gitpod.io/from-referrer/) I found this being not-simp frustrating when talking about submodules over a valuation subring. | merge-conflict t-algebra | 67/66 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Group/Submonoid/MulAction.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/LocalizedModule/Exact.lean,Mathlib/Algebra/Module/LocalizedModule/IsLocalization.lean,Mathlib/Algebra/Module/LocalizedModule/Submodule.lean,Mathlib/Algebra/Ring/Periodic.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean,Mathlib/LinearAlgebra/RootSystem/Irreducible.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/RingTheory/Etale/Kaehler.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/LocalProperties/Projective.lean,Mathlib/RingTheory/Localization/InvSubmonoid.lean,Mathlib/RingTheory/OreLocalization/Basic.lean | 25 | 26 | ['artie2000', 'eric-wieser', 'github-actions', 'j-loreaux', 'kckennylau', 'leanprover-bot', 'leanprover-radar', 'linesthatinterlace', 'mathlib4-merge-conflict-bot', 'pechersky'] | joelriou | 1 | 4 months ago | 158 days ago | 60 days |
| 33381 | urkud | feat: add a version of the Schwarz lemma | Add a version of the Schwarz lemma that is midway between the original lemma and Pick's version. Use it to show that a function that is separately holomorphic on a polydisc and is bounded on this polydisc must be continuous on it. --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #33368 - [x] depends on: #33362 | t-analysis blocked-by-other-PR merge-conflict | 475/91 | Mathlib.lean,Mathlib/Analysis/Complex/Schwarz.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/Complex/UnitDisc/Schwarz.lean,Mathlib/Analysis/Complex/UnitDisc/Shift.lean | 5 | 22 | ['girving', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 1 | 4 months ago | 123 days ago | 15 minutes |
| 17176 | arulandu | feat: integrals and integrability with .re | Lemmas for swapping order of .re and integration/integrability. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability please-adopt | 49/0 | Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean | 4 | 32 | ['EtienneC30', 'arulandu', 'github-actions', 'loefflerd'] | nobody | 1 | 3 months ago | 563 days ago | 9 days |
| 25905 | mans0954 | feat(RingTheory/Polynomial/SmallDegreeVieta): polynomial versions of results in Algebra.QuadraticDiscriminant | This PR continues the work from #25605. Original PR: https://github.com/leanprover-community/mathlib4/pull/25605 | merge-conflict t-ring-theory please-adopt | 77/8 | Mathlib/Algebra/Polynomial/Coeff.lean,Mathlib/RingTheory/Polynomial/SmallDegreeVieta.lean | 2 | 47 | ['chrisflav', 'github-actions', 'kckennylau', 'mans0954', 'mathlib4-merge-conflict-bot', 'ocfnash'] | chrisflav | 1 | 3 months ago | 237 days ago | 82 days |
| 12934 | grunweg | chore: replace more uses of > or ≥ by < or ≤ | These were flagged by the linter in https://github.com/leanprover-community/mathlib4/pull/12879: it is easy to simple avoid > or ≥ in hypotheses or haves. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted | 41/42 | Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2019Q4.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib/Tactic/Linarith/Datatypes.lean,test/cancel_denoms.lean,test/congr.lean,test/interval_cases.lean,test/observe.lean | 15 | 12 | ['YaelDillies', 'adomani', 'github-actions', 'grunweg', 'jcommelin', 'urkud'] | nobody | 1 | 3 months ago | 714 days ago | 1 day |
| 32880 | 0xTerencePrime | feat(Analysis/Asymptotics): define subpolynomial growth | ## Main definitions * `Asymptotics.IsSubpolynomial l f g`: A function `f` has subpolynomial growth with respect to `g` along filter `l` if `f = O(1 + ‖g‖^k)` for some natural `k`. ## Main results * `IsSubpolynomial.const`: Constant functions have subpolynomial growth * `IsSubpolynomial.id`: Identity has subpolynomial growth * `IsSubpolynomial.add`: Closure under addition * `IsSubpolynomial.neg`: Closure under negation * `IsSubpolynomial.sub`: Closure under subtraction * `IsSubpolynomial.mul`: Closure under multiplication * `IsSubpolynomial.pow`: Closure under powers * `isSubpolynomial_iff_one_add`: Equivalence with `(1 + ‖g‖)^k` formulation * `IsSubpolynomial.uniform`: Uniform bounds for finite families ## Implementation notes The definition uses `1 + ‖g‖^k` rather than `(1 + ‖g‖)^k` as the primary form, with the equivalence established in `isSubpolynomial_iff_one_add`. Four private auxiliary lemmas handle the key inequalities needed for closure proofs. Closes #32658 | awaiting-author t-analysis new-contributor | 185/0 | Mathlib.lean,Mathlib/Analysis/Asymptotics/Subpolynomial.lean | 2 | 28 | ['0xTerencePrime', 'ADedecker', 'github-actions', 'j-loreaux'] | ADedecker | 1 | 3 months ago | 109 days ago | 22 days |
| 29610 | llllvvuu | feat(LinearAlgebra): define LinearMap.Eigenbasis | Some theorems are left TODO for follow-up work.
The definition is from @eric-wieser ([#Is there code for X? > diagonalizable linear maps @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/diagonalizable.20linear.20maps/near/539163222)).
Co-authored-by: Aristotle Harmonic |
merge-conflict t-algebra awaiting-author | 455/5 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/LinearAlgebra/Eigenbasis.lean,Mathlib/LinearAlgebra/FreeModule/PID.lean,Mathlib/Order/CompleteLattice/Basic.lean | 5 | 31 | ['github-actions', 'joelriou', 'kckennylau', 'llllvvuu', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | joelriou | 1 | 3 months ago | 163 days ago | 20 days |
| 32828 | Hagb | feat(Algebra/Order/Group/Defs): add `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid'` | It is similar to `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid`, while with different hypotheses. The conclusion `IsOrderedCancelMonoid α` on `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid` still holds when the hypothesis `CommGroup α` is weakened to `CancelCommMonoid α` while `PartialOrder α` is strengthened to `LinearOrder α`. --- [`IsOrderedAddMonoid.toIsOrderedCancelAddMonoid`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=IsOrderedAddMonoid.toIsOrderedCancelAddMonoid#doc) and `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid'`: https://github.com/leanprover-community/mathlib4/blob/97f78b1a4311fed1844b94f1c069219a48a098e1/Mathlib/Algebra/Order/Group/Defs.lean#L52-L62 [](https://gitpod.io/from-referrer/) | awaiting-zulip t-algebra | 4/0 | Mathlib/Algebra/Order/Group/Defs.lean | 1 | 8 | ['Garmelon', 'Vierkantor', 'artie2000', 'github-actions', 'leanprover-radar'] | eric-wieser | 2 | 3 months ago | 99 days ago | 40 days |
| 33493 | michelsol | feat(RingTheory/Polynomial): An explicit formula for the Chebyshev polynomials of the first kind | Adds the following explicit formula on the Chebyshev polynomial of the first kind of order n. ${ T_{n}(x)\ =\ \sum \limits _{k=0}^{\lfloor {\frac {n}{2}}\rfloor } {\binom {n}{2k}} \left(\ X^{2}-1\ \right)^{k}\ X^{n-2k}}$ This explicit formula can be found [here](https://en.wikipedia.org/wiki/Chebyshev_polynomials#Explicit_expressions). There is a proof using complex numbers but it only works if the ring R = ℂ. The proof here is by induction and works in a commutative ring R. Mathlib seems to extend the definition of Chebyshev polynomials for $n \in \mathbb{Z}$ but this would make the formula more cumbersome with `n.natAbs` in place of `n`'s, so I expressed it on `n : ℕ` directly. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 51/1 | Mathlib/RingTheory/Polynomial/Chebyshev.lean | 1 | 8 | ['YuvalFilmus', 'erdOne', 'github-actions', 'metakunt', 'michelsol'] | chrisflav | 1 | 2 months ago | 82 days ago | 35 days |
| 11500 | mcdoll | refactor(Topology/Algebra/Module/WeakDual): Clean up | - Move `Dual` and `dualPairing` lower in the import-hierachy - deduplicate `dualPairing` - Bundle continuity statements to `CLM`s. - Make `WeakDual` and `WeakSpace` reducible - Remove `refine'` in favor of `refine` --- Cleaning up `Analysis/NormedSpace/WeakDual` will be done in a second PR [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 227/179 | Mathlib.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/NormedSpace/Dual.lean,Mathlib/Analysis/NormedSpace/WeakDual.lean,Mathlib/Analysis/VonNeumannAlgebra/Basic.lean,Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/Algebra/Module/Dual.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean,docs/overview.yaml,docs/undergrad.yaml | 15 | 16 | ['ADedecker', 'grunweg', 'j-loreaux', 'kkytola', 'mathlib-bors', 'mcdoll', 'urkud'] | nobody | 2 | 2 months ago | 724 days ago | 46 days |
| 35134 | fpvandoorn | feat(translate): print constant names with hover info | Part of #34846. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-author merge-conflict | 46/28 | Mathlib/Tactic/Translate/Core.lean,MathlibTest/toAdditive.lean | 2 | 6 | ['JovanGerb', 'github-actions', 'mathlib-merge-conflicts'] | JovanGerb | 1 | 2 months ago | 77 days ago | 2 days |
| 24965 | erdOne | refactor: Make `IsLocalHom` take unbundled map | Under the current definition, `IsLocalHom f` and `IsLocalHom f.toMonoidHom` are not defeq, which causes quite some annoyances. We also have a consensus to not use `*HomClass` in definitions. As a result, we change `IsLocalHom` to take an unbundled function instead of a funlike. --- [](https://gitpod.io/from-referrer/) | t-algebra delegated merge-conflict | 18/9 | Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/Geometry/RingedSpace/LocallyRingedSpace.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean | 5 | 15 | ['adomani', 'alreadydone', 'erdOne', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp'] | mattrobball | 1 | 2 months ago | 164 days ago | 24 days |
| 31766 | SuccessMoses | feat(Topology/EMetricSpace): continuity of arc length | fixes half of #31751 --- [](https://gitpod.io/from-referrer/) | new-contributor t-topology awaiting-author merge-conflict | 396/0 | Mathlib.lean,Mathlib/Topology/EMetricSpace/ArcLength.lean,Mathlib/Topology/EMetricSpace/BoundedVariation.lean | 3 | 40 | ['SnirBroshi', 'SuccessMoses', 'alreadydone', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 1 | 2 months ago | 142 days ago | 2 days |
| 35494 | Timeroot | feat(Topology/Perfect): simp frontier_singleton | Add simp lemma ``` theorem frontier_singleton {X : Type*} [TopologicalSpace X] [T1Space X] [PerfectSpace X] (p : X) : frontier {p} = {p} ``` --- [](https://gitpod.io/from-referrer/) | t-topology awaiting-author | 4/0 | Mathlib/Topology/Perfect.lean | 1 | 4 | ['Timeroot', 'github-actions', 'urkud', 'vihdzp'] | urkud | 1 | 2 months ago | 66 days ago | 5 days |
| 34932 | erdOne | feat(AlgebraicGeometry): formally etale morphisms | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry merge-conflict delegated | 163/12 | Mathlib.lean,Mathlib/AlgebraicGeometry/Morphisms/Etale.lean,Mathlib/AlgebraicGeometry/Morphisms/FormallyEtale.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/RingTheory/RingHom/Etale.lean | 5 | 17 | ['chrisflav', 'erdOne', 'github-actions', 'joneugster', 'mathlib-bors', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 1 | 2 months ago | 65 days ago | 11 days |
| 34440 | grunweg | feat: linter for name components in uppercase | Per the naming convention, these are errors (unless they are an abbreviation). Mathlib has *many* violations at the moment: for this reason, we add this as an environment linter and automatically add all current exceptions. Once these have been fixed, converting to a syntax linter is desirable. Until then, track the number of such exceptions as technical debt. --- [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/naming.20convention.20linter/with/570617527) Note to self: wait for CI, then do a final nolints update. and try to implement the follow-up soon [](https://gitpod.io/from-referrer/) | t-linter large-import awaiting-author merge-conflict | 1018/9 | Mathlib/Tactic/Linter/Style.lean,MathlibTest/DoubleUnderscore.lean,MathlibTest/HashLint.lean,MathlibTest/Lint.lean,MathlibTest/LintStyle.lean,scripts/nolints.json,scripts/technical-debt-metrics.sh | 7 | 27 | ['Vierkantor', 'github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts'] | joneugster | 1 | 2 months ago | 72 days ago | 13 days |
| 30431 | kckennylau | feat(RingTheory): a homogeneous submodule is the span of its homogeneous elements | --- [](https://gitpod.io/from-referrer/) | t-ring-theory merge-conflict | 22/0 | Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean | 2 | 9 | ['alreadydone', 'github-actions', 'kckennylau', 'mariainesdff', 'mathlib-merge-conflicts'] | mariainesdff | 1 | 1 month ago | 178 days ago | 23 days |
| 17627 | hrmacbeth | feat: universal properties of vector bundle constructions | Characterizations for the smoothness of maps into the total spaces of (1) the direct sum of two vector bundles; (2) the pullback of a vector bundle. This gap in the library was exposed by #17358. --- - [x] depends on: #22804 [](https://gitpod.io/from-referrer/) | merge-conflict t-differential-geometry | 311/9 | Mathlib/Data/Bundle.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/Pullback.lean,Mathlib/Topology/FiberBundle/Constructions.lean | 4 | 26 | ['PatrickMassot', 'fpvandoorn', 'github-actions', 'grunweg', 'hrmacbeth', 'j-loreaux', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'sgouezel'] | grunweg | 1 | 1 month ago | 316 days ago | 91 days |
| 19275 | eric-wieser | fix: if nolint files change, do a full rebuild | Otherwise CI will succeed when removing entries from the file, but fail later when someone changes something unrelated. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 8/0 | lakefile.lean | 1 | 22 | ['YaelDillies', 'adomani', 'eric-wieser', 'fpvandoorn', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 1 | 1 month ago | 527 days ago | 3 minutes |
| 33592 | nielstron | feat(Computability/ContextFreeGrammar): mapping between two types of nonterminal symbols | This PR picks up https://github.com/leanprover-community/mathlib4/pull/15895 and resolves the failing lemma by redefining Good symbols. --- I checked that https://github.com/leanprover-community/mathlib4/pull/13514 builds correctly when based on this build. PR for that is #33599 This is my first contribution please let me know of any changes I should outline. [](https://gitpod.io/from-referrer/) | awaiting-author t-computability new-contributor | 160/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 34 | ['YaelDillies', 'github-actions', 'madvorak', 'nielstron'] | nobody | 1 | 1 month ago | 105 days ago | 10 days |
| 27534 | PierreQuinton | feat: a typeclass for `sSup`/`sInf` to be lawful | Adds lawful infima and suprema type classes. A preorder with lawful suprema: whenever a set has a least upper bound, `sSup` returns a least upper bound for that set. A preorder with lawful infima: whenever a set has a greatest lower bound, `sInf` returns a greastest lower bound for that set. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order | 121/8 | Mathlib.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/LawfulSupInf.lean | 3 | 26 | ['PierreQuinton', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | nobody | 1 | 1 month ago | 163 days ago | 114 days |
| 30872 | rudynicolop | feat(Computability/NFA): NFA closure under concatenation | This PR proves that regular languages are closed under concatenation via a direct construction on `NFA`s without `εNFA` nor ε-transitions. The main new definitions and results include: - `M1.concat M2`, the concatenation of `NFA`s `M1` and `M2`, a direct construction without ε-transitions. - Theorem `accepts_concat : (M1.concat M2).accepts = M1.accepts * M2.accepts`, showing the correctness of the construction. - Theorem `IsRegular.mul`, showing that regular languages are closed under concatenation. --- - [x] depends on: #31038 [](https://gitpod.io/from-referrer/) | t-computability new-contributor awaiting-author | 104/7 | Mathlib/Computability/NFA.lean | 1 | 67 | ['YaelDillies', 'ctchou', 'eric-wieser', 'github-actions', 'lambda-fairy', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'rudynicolop'] | nobody | 2 | 1 month ago | 91 days ago | 59 days |
| 35524 | grunweg | feat: text-based linter against \t followed by tactic mode | Wait for the zulip discussion to converge. **If** there is consensus in favour of this change, summarise the motivation here. [zulip discuss](https://leanprover.zulipchat.com/#narrow/channel/345428-mathlib-reviewers/topic/proposal.3A.20no.20more.20use.20of.20.60.E2.96.B8.60.20in.20Mathlib.3F/with/574680826) --- There are currently 80 remaining exceptions in mathlib: ideally, these would get fixed before merging this. Works best when combined with #35523. [](https://gitpod.io/from-referrer/) | t-linter awaiting-zulip merge-conflict | 23/2 | Mathlib/Tactic/Linter/TextBased.lean | 1 | 5 | ['github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 | 1 month ago | 71 days ago | 3 minutes |
| 26078 | kckennylau | feat(AlgebraicGeometry): add x, y, px, py for points on elliptic curves | --- Split from #25218. [](https://gitpod.io/from-referrer/) | awaiting-author t-algebraic-geometry | 44/0 | Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean | 1 | 12 | ['MichaelStollBayreuth', 'Multramate', 'acmepjz', 'dagurtomas', 'github-actions', 'kckennylau'] | nobody | 1 | 1 month ago | 253 days ago | 64 days |
| 35215 | kim-em | chore: use @[to_dual] in FixedPoints | This PR adds `@[to_dual]` annotations to 14 theorems about `lfp` in `Order/FixedPoints.lean`, auto-generating their `gfp` duals and deleting the hand-written versions. Also registers `OrderHom.lfp` as the dual of `OrderHom.gfp` via `attribute [to_dual existing]`. Auto-generated duals include: `le_gfp`, `gfp_le_fixed`, `gfp_le`, `gfp_le_map`, `map_gfp`, `isFixedPt_gfp`, `map_le_gfp`, `isGreatest_gfp_le`, `isGreatest_gfp`, `gfp_induction`, `map_gfp_comp`, `gfp_gfp`, `map_inf_fixedPoints_le`, `map_sInf_subset_fixedPoints_le`. [Diff relative to #35208](https://github.com/kim-em/mathlib4/compare/kim/to-dual-bounds-basic...kim/to-dual-fixed-points) - [x] depends on: #35208 🤖 Prepared with Claude Code | LLM-generated merge-conflict | 249/548 | Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/FixedPoints.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Topology/Order.lean | 8 | 11 | ['JovanGerb', 'github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | alexjbest | 1 | 1 month ago | 42 days ago | 24 days |
| 31141 | peabrainiac | feat(Analysis/Calculus): parametric integrals over smooth functions are smooth | Show that for any smooth function `f : H × ℝ → E`, the parametric integral `fun x ↦ ∫ t in a..b, f (x, t) ∂μ` is smooth too. The argument proceeds inductively, using the fact that derivatives of parametric integrals can themselves be computed as parametric integrals. The necessary lemmas on derivatives of parametric integrals already existed, but took some work to apply due to their generality; we state some convenient special cases. --- - [x] depends on: #31077 [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 470/12 | Mathlib/Analysis/Calculus/ParametricIntegral.lean,Mathlib/Analysis/Calculus/ParametricIntervalIntegral.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/Topology/NhdsWithin.lean,Mathlib/Topology/Separation/Regular.lean | 5 | 36 | ['fpvandoorn', 'github-actions', 'j-loreaux', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'peabrainiac', 'sgouezel'] | j-loreaux | 1 | 1 month ago | 79 days ago | 33 days |
| 33355 | 0xTerencePrime | feat(Combinatorics/SimpleGraph/Connectivity): define vertex connectivity | This PR introduces the foundations of vertex connectivity for simple graphs, providing a counterpart to the edge connectivity theory in #32870. ### Main definitions - `SimpleGraph.IsVertexReachable`: vertices remain reachable after removing strictly fewer than `k` other vertices. - `SimpleGraph.IsVertexConnected`: a graph is `k`-vertex-connected if its order is strictly greater than `k` and any two distinct vertices are `k`-vertex-reachable. Includes basic characterizations for $k=0$ and $k=1$, along with monotonicity lemmas (`anti` and `mono`). | new-contributor t-combinatorics awaiting-author merge-conflict | 199/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean | 3 | 139 | ['0xTerencePrime', 'SnirBroshi', 'SproutSeeds', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 | 1 month ago | 50 days ago | 35 days |
| 36165 | Parcly-Taxel | chore: deprecate `Nat.strongRec(On)'` | In favour of Batteries's `Nat.strongRec` for definitions and `Nat.strong_induction_on` for proofs. | t-data merge-conflict | 34/66 | Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Data/Int/GCD.lean,Mathlib/Data/Nat/Factorization/Induction.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean | 8 | 6 | ['JovanGerb', 'MichaelStollBayreuth', 'Parcly-Taxel', 'Vierkantor', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | Vierkantor | 1 | 1 month ago | 42 days ago | 15 days |
| 20719 | gio256 | feat(AlgebraicTopology): delaborators for truncated simplicial notations | We add delaborators for the following notations, introduced in #20688: - `⦋m⦌ₙ`, which denotes the `m`-dimensional simplex in the `n`-truncated simplex category. - `X _⦋m⦌ₙ`, which denotes the `m`-th term of an `n`-truncated simplicial object `X`. - `X ^⦋m⦌ₙ`, which denotes the `m`-th term of an `n`-truncated cosimplicial object `X`. If `pp.proofs` is set to `true`, we also pretty-print the proof `p : m ≤ n` for all three notations as `⦋m, p⦌ₙ`, `X _⦋m, p⦌ₙ`, and `X ^⦋m, p⦌ₙ`, respectively. Credit to @kmill for one piece of code and much metaprogramming inspiration. --- - [x] depends on: #20688 - [x] depends on: #23018 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-topology infinity-cosmos t-meta please-adopt will-close-soon | 525/33 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/SimplexCategory.lean,Mathlib/Util/Superscript.lean,MathlibTest/SimplexCategory.lean,MathlibTest/SimplicialObject.lean,MathlibTest/superscript.lean,scripts/noshake.json | 11 | 24 | ['eric-wieser', 'gio256', 'github-actions', 'joneugster', 'kim-em', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 | 1 month ago | 284 days ago | 88 days |
| 21476 | grunweg | feat(lint-style): enable running on downstream projects | Enable lint-style to run on downstream projects, by making the following modifications: - allow passing an explicit list of libraries to lint: if nothing is passed, it lints `Mathlib`, `Archive` and `Counterexamples` (as before); otherwise, it lints precisely the passed modules - only check init imports, undocumented scripts and the errors from `lint-style.py` when linting Mathlib - make the style exceptions file configurable and optional: using the `nolints-file` flag, the exceptions file can be configured. If the flag is omitted, we try to find a file at `scripts/nolints-style.txt` --- and otherwise proceed with no style exceptions. This means mathlib can continue unchanged, and downstream projects can either add an explicit exceptions file, or proceed without any exceptions. After this PR, one should be able to run lint-style on a downstream project by `lake exe lint-style ProjectName`. Prompted by [this zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/lint-style.20for.20downstream.20libraries). --- - [x] depends on: #24570 - [x] depends on: #24953 (I did not test the last part.) [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author please-adopt | 58/19 | Mathlib/Tactic/Linter/TextBased.lean,scripts/lint-style.lean | 2 | 21 | ['Vierkantor', 'adomani', 'github-actions', 'grunweg', 'joneugster', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 | 1 month ago | 350 days ago | 43 days |
| 36706 | kim-em | feat(Tactic/FastInstance): warn when a synthesized sub-instance has leaky binder types | This PR adds a warning to `fast_instance%` and `inferInstanceAs%` when they encounter a synthesized sub-instance that has leaky data-field binder types. When `fast_instance%` recursively normalizes a class instance, it uses `trySynthInstance` to find canonical sub-instances. If a found sub-instance is not canonical at instances transparency (i.e., its internal lambda binder types reference an unexpanded type alias instead of the target carrier), the tool now emits a warning: ``` fast_instance%: 'leakySub' (for SubClass MyNat) has leaky data-field binder types, which may cause `isDefEq` failures at instances transparency (e.g. in `grind`). Consider redefining it with `fast_instance%` or `inferInstanceAs%`. To suppress: `set_option Elab.fast_instance.warnLeakySubInstances false` ``` The leakiness check uses `withDisabledInstance` to temporarily evict the sub-instance from the discrimination tree (preventing trivial self-match via `trySynthInstance`), then compares against the canonical form at instances transparency. A `warnLeaky` parameter propagates through recursive calls to prevent nested warnings. The warning is suppressed via `set_option Elab.fast_instance.warnLeakySubInstances false`. - [ ] depends on: #36701 🤖 Prepared with Claude Code | t-meta blocked-by-other-PR large-import LLM-generated merge-conflict | 415/21 | Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/Init.lean,Mathlib/RingTheory/Congruence/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/Tactic/DefEqAbuse.lean,Mathlib/Tactic/FastInstance.lean,MathlibTest/CheckInstance.lean,MathlibTest/DefEqAbuse.lean,MathlibTest/InferInstanceAsPercent.lean | 11 | 7 | ['Vierkantor', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | Vierkantor | 1 | 1 month ago | 46 days ago | 16 minutes |
| 36832 | KryptosAI | chore(Data/Finset/Card): rename `pred_card_le_card_erase` to `sub_one_card_le_card_erase` | ## Summary The name `pred_card_le_card_erase` suggests `Nat.pred` but the statement uses `- 1` (i.e., `Nat.sub 1`). Rename to `sub_one_card_le_card_erase` to match the actual statement. A deprecated alias is added for backwards compatibility. ### Files changed - `Mathlib/Data/Finset/Card.lean` — definition renamed + deprecated alias - `Mathlib/Data/Finset/Powerset.lean` — reference updated - `Mathlib/Combinatorics/Additive/SubsetSum.lean` — reference updated - `Mathlib/Algebra/Polynomial/EraseLead.lean` — reference updated Addresses the `Finset.pred_card_le_card_erase` item in #21584. ## AI disclosure I used Claude Code to explore the codebase (finding all references to rename) and to draft the PR description. I reviewed and understand all changes — these are straightforward renames with a deprecated alias. | new-contributor | 22/15 | Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Combinatorics/Additive/SubsetSum.lean,Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean,Mathlib/Combinatorics/SetFamily/Shadow.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Set/Card.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/RingTheory/Ideal/Operations.lean | 9 | 5 | ['KryptosAI', 'Multramate', 'github-actions', 'ooovi'] | nobody | 1 | 28 days ago | 28 days ago | 42 days |
| 37248 | harahu | doc(Tactic): avoid lazy continuation lines | We resolve the ambiguity inherent in lazy (un-indented) list item continuation lines by either indenting them or separating them by inserting a newline in the cases where the item continuation was a mistake. --- [](https://gitpod.io/from-referrer/) | documentation | 131/116 | Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/ComputeDegree.lean,Mathlib/Tactic/DepRewrite.lean,Mathlib/Tactic/Finiteness.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/SimpIntro.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Widget/InteractiveUnfold.lean | 17 | 1 | ['Multramate', 'github-actions'] | nobody | 1 | 28 days ago | 35 days ago | 35 days |
| 31135 | kckennylau | feat(RingTheory): is localization iff is localization on saturation | In this PR we show that `A` is a localization of `R` on the submonoid `S` iff it is so on the saturation of `S`. Crucially, the saturation of `S` is precisely the elements that become a unit in `A`. --- - [x] depends on: #31132 [](https://gitpod.io/from-referrer/) | t-ring-theory delegated | 53/0 | Mathlib.lean,Mathlib/RingTheory/Localization/Saturation.lean | 2 | 15 | ['alreadydone', 'chrisflav', 'github-actions', 'kckennylau', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | chrisflav | 1 | 24 days ago | 24 days ago | 32 days |
| 37386 | gasparattila | chore: call `dsimp` in the default tactic of `ContinuousLinearMap` | --- This will also reduce the breakage in https://github.com/leanprover-community/mathlib4/pull/35548. [](https://gitpod.io/from-referrer/) | t-topology awaiting-author | 33/76 | Mathlib/Algebra/Category/ContinuousCohomology/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Distribution/DerivNotation.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Fourier/Notation.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/ConjSqrt.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/Probability/Distributions/Fernique.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Basic.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/LinearMapCompletion.lean,Mathlib/Topology/Algebra/Module/Alternating/Topology.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Topology.lean,Mathlib/Topology/Algebra/Module/Star.lean,Mathlib/Topology/Algebra/Star/LinearMap.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousMap/Algebra.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/Instances/TrivSqZeroExt.lean | 36 | 15 | ['gasparattila', 'github-actions', 'j-loreaux', 'leanprover-radar', 'mathlib-bors', 'themathqueen'] | j-loreaux | 1 | 22 days ago | 24 days ago | 6 days |
| 35295 | Rida-Hamadani | feat(SimpleGraph): `dropLast` of a cycle is a path | --- [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 14/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 2 | 14 | ['Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vlad902'] | YaelDillies | 1 | 22 days ago | 22 days ago | 34 days |
| 37697 | IvanRenison | feat(Combinatorics/SimpleGraph/Clique): add theorems about cliques and induced graphs | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 22/0 | Mathlib/Combinatorics/SimpleGraph/Clique.lean | 1 | 9 | ['Rida-Hamadani', 'SnirBroshi', 'github-actions'] | nobody | 1 | 21 days ago | 25 days ago | 25 days |
| 37111 | tannerduve | feat(Computability): add Nat.PrimrecIn and PrimrecIn | - Add `Nat.PrimrecIn`: primitive recursive functions relative to a set of oracles - Add `PrimrecIn`: lifts `Nat.PrimrecIn` to `Primcodable` types A `PrimrecIn` version of `RecursiveIn.iff_nat` (i.e., `PrimrecIn O (f : ℕ → ℕ) ↔ Nat.PrimrecIn O f`) is left as future work as it requires proving `Nat.PrimrecIn O Nat.pred`, which needs additional API for `Nat.PrimrecIn`. --- Split out from #34937 as requested in review. - [x] depends on: #37061 | t-computability new-contributor awaiting-author | 24/0 | Mathlib/Computability/RecursiveIn.lean | 1 | 14 | ['Komyyy', 'bryangingechen', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tannerduve'] | nobody | 1 | 20 days ago | 22 days ago | 1 day |
| 36693 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Equiv.Perm.ofSubtype_swap_eq`: unchanged 🎉 * `Filter.hasBasis_biInf_of_directed'`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 2/10 | Mathlib/GroupTheory/Perm/Support.lean | 1 | 4 | ['artie2000', 'chenson2018', 'euprunin', 'github-actions'] | nobody | 2 | 20 days ago | 46 days ago | 46 days | |
| 36385 | CoolRmal | feat: a sequential and countably compact space is sequentially compact | The main result proved in this PR is that a sequential and countably compact space is sequentially compact. We also prove some lemmas: 1. If `f` is an embedding, then `A` is sequentially compact iff `f '' A` is sequentially compact. This result is then used to show the equivalence of `IsSeqCompact A` and `SeqCompactSpace A`. 2. If `f` is inducing, then `A` is countably compact iff `f '' A` is countably compact. This result is then used to show the equivalence of `IsCountablyCompact A` and `CountablyCompactSpace A`. 3. If `f` converges and `g` is another function such that `g x ∈ closure {f x}` for all `x`, then `g` also converges. --- - [x] depends on: #36174 [](https://gitpod.io/from-referrer/) | t-topology | 146/13 | Mathlib/Topology/Compactness/CountablyCompact.lean,Mathlib/Topology/Inseparable.lean,docs/references.bib | 3 | 33 | ['ADedecker', 'CoolRmal', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'scholzhannah'] | PatrickMassot | 1 | 19 days ago | 19 days ago | 31 days |
| 36155 | grunweg | feat: custom elaborators for TangentSpace and tangentMap(Within) | And use these to golf the differential geometry files a bit further. --- [](https://gitpod.io/from-referrer/) | t-differential-geometry t-meta | 85/30 | Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/MFDeriv/Tangent.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/Topology/FiberBundle/Constructions.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean | 8 | 5 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'ocfnash'] | PatrickMassot | 1 | 18 days ago | 18 days ago | 56 days |
| 32889 | artie2000 | feat(Algebra): forgetful lemmas for `map` and `comap` on substructures | * Standardise the form of forgetful lemmas for `map` and `comap` (ie, `(co)map_toSubfoo`) * Add missing lemmas of this form * Mark all such lemmas as `simp` --- - [x] depends on: #21031 [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 72/17 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/Subalgebra.lean | 6 | 30 | ['YaelDillies', 'artie2000', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'vihdzp'] | nobody | 1 | 17 days ago | 134 days ago | 2 days |
| 37053 | artie2000 | refactor(Analysis/Convex/Cone): use `PointedCone` in Riesz extension theorem | Change the statement of the Riesz extension theorem to take a `PointedCone` rather than a `ConvexCone`. This PR is part of a series replacing `ConvexCone` with `PointedCone`. https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Replacing.20.60ConvexCone.60.20with.20.60PointedCone.60/near/581184307 --- [](https://gitpod.io/from-referrer/) | t-convex-geometry maintainer-merge | 15/12 | Mathlib/Analysis/Convex/Cone/Extension.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 8 | ['YaelDillies', 'artie2000', 'github-actions', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 1 | 17 days ago | 17 days ago | 36 days |
| 37247 | yuma-mizuno | feat(GroupTheory/MonoidLocalization): add prime transport lemmas | --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author | 75/7 | Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean | 3 | 6 | ['github-actions', 'riccardobrasca'] | riccardobrasca | 1 | 15 days ago | 15 days ago | 20 days |
| 37420 | artie2000 | refactor: change definitions to avoid `ConvexCone` | Change the definitions of `PointedCone.positive` and `PointedCone.closure` to avoid mentioning `ConvexCone`. This PR is part of a series deprecating `ConvexCone`: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Replacing.20.60ConvexCone.60.20with.20.60PointedCone.60/with/582738985 --- [](https://gitpod.io/from-referrer/) | t-convex-geometry maintainer-merge | 10/4 | Mathlib/Analysis/Convex/Cone/Closure.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 3 | ['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'ooovi', 'vihdzp'] | nobody | 3 | 15 days ago | 15 days ago | 30 days |
| 36774 | euprunin | chore: replace long terminal `rw […]`:s (≥4 lemmas) with bare `simp`:s | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Finset.lcm_union`: unchanged 🎉 * `Finset.gcd_union`: unchanged 🎉 * `Polynomial.derivative_eval₂_C`: unchanged 🎉 * `Polynomial.expand_pow`: unchanged 🎉 * `Cardinal.mk_real`: unchanged 🎉 * `Real.log_zpow`: unchanged 🎉 * `Matroid.eRank_le_encard_add_eRk_compl`: unchanged 🎉 * `DFinsupp.single_tsub`: unchanged 🎉 * `EReal.inv_neg`: unchanged 🎉 * `Finsupp.toMultiset_map`: unchanged 🎉 * `Finsupp.single_tsub`: unchanged 🎉 * `Multiset.countP_map`: unchanged 🎉 * `Nat.ascFactorial_eq_factorial_mul_choose'`: unchanged 🎉 * `Real.sign_intCast`: unchanged 🎉 * `Real.volume_eball`: unchanged 🎉 * `Real.volume_closedEBall`: unchanged 🎉 * `LFunction_ne_zero_of_not_quadratic_or_ne_one`: 295 ms before, 152 ms after 🎉 * `hasSum_one_div_nat_pow_mul_cos`: unchanged 🎉 * `inv_eq_of_aeval_divX_ne_zero`: unchanged 🎉 * `AlgebraicIndependent.aeval_comp_mvPolynomialOptionEquivPolynomialAdjoin`: unchanged 🎉 * `Ordinal.deriv_mul_eq_opow_omega0_mul`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 22/24 | Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Expand.lean,Mathlib/Analysis/Real/Cardinality.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Combinatorics/Matroid/Rank/ENat.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finsupp/Multiset.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Nat/Choose/Basic.lean,Mathlib/Data/Real/Sign.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/NumberTheory/LSeries/Nonvanishing.lean,Mathlib/NumberTheory/ZetaValues.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/AlgebraicIndependent/Basic.lean,Mathlib/SetTheory/Ordinal/FixedPoint.lean | 19 | 2 | ['artie2000', 'euprunin', 'github-actions'] | nobody | 1 | 14 days ago | 45 days ago | 45 days | |
| 6777 | adomani | chore(Co*variantClass): replace eta-expanded (· * ·), (· + ·), (· ≤ ·), (· < ·) | Replace `CovariantClass X X (· * ·) (· ≤ ·)` with -> `CovariantClass X X HMul.hMul LE.le` and similarly for `HAdd`, `LT`, `Contravariant`.
This PR is inspired by [Issue #6646](https://github.com/leanprover-community/mathlib4/issues/6646) and, more specifically, [this comment](https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1692792066).
Note that https://github.com/leanprover/lean4/pull/2267 would make this unnecessary
---
```bash
# First sed command:
# the first captured pattern is `Co*variantClass |
merge-conflict | 703/678 | Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/Bounds.lean,Mathlib/Algebra/CovariantAndContravariant.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/GroupPower/Order.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Archimedean.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/MinMax.lean,Mathlib/Algebra/Order/Group/OrderIso.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Interval.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/LatticeGroup.lean,Mathlib/Algebra/Order/Module.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Cancel/Defs.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/Lemmas.lean,Mathlib/Algebra/Order/Monoid/MinMax.lean,Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Algebra/Order/Monoid/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Prod.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithZero/Basic.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Lemmas.lean,Mathlib/Algebra/Order/Sub/Basic.lean,Mathlib/Algebra/Order/Sub/Canonical.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Algebra/Parity.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Normed/Order/Lattice.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/List/BigOperators/Basic.lean,Mathlib/Data/List/BigOperators/Lemmas.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Nat/Cast/Order.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Real/ENNReal.lean,Mathlib/Data/Real/NNReal.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/VectorMeasure.lean,Mathlib/Order/ConditionallyCompleteLattice/Group.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Martingale/Basic.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/PGame.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/NaturalOps.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/Positivity/Basic.lean,Mathlib/Topology/ContinuousFunction/Algebra.lean,lean-toolchain,test/Recall.lean,test/propose.lean | 81 | 37 | ['adomani', 'alreadydone', 'digama0', 'eric-wieser', 'ericrbg', 'jcommelin', 'leanprover-bot', 'sgouezel', 'vihdzp'] | nobody | 1 | 14 days ago | 914 days ago | 35 days |
| 34875 | banrovegrie | feat(LinearAlgebra/Matrix): add Sherman-Morrison formula | Mathlib has the matrix determinant lemma (`det_add_replicateCol_mul_replicateRow` in SchurComplement.lean) but lacked the corresponding inverse formula. This PR fills that gap. - Add `Matrix.inv_add_vecMulVec`: Sherman-Morrison formula for `(A + uv^T)^{-1}` - Add `Matrix.inv_sub_vecMulVec`: subtraction variant - Add `Matrix.isUnit_det_add_vecMulVec`: invertibility under the formula's hypotheses ## Test plan - [x] `lake build` passes - [x] Lines within 100 char limit - [x] All declarations have docstrings **Any specific AI usage?**: Used Copilot for review purposes. | t-algebra new-contributor awaiting-author | 135/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/ShermanMorrison.lean | 2 | 13 | ['Xxxjdjdid', 'banrovegrie', 'chrisflav', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] | chrisflav | 1 | 14 days ago | 16 days ago | 69 days |
| 37808 | JovanGerb | feat(Translate): locally modify name guessing dictionaries | This PR adds the feature to `to_dual` and `to_additive` that you can now locally modify the name translation dictionary. With this change, we run the risk of having the automated translations being harder to predict. For this reason, the changes to the dictionary do not persisted through imports. Instead, the change lasts until the end of the file (though it ignores sections). See https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Order.20dual.20tactic/near/580834166 --- [](https://gitpod.io/from-referrer/) | t-meta maintainer-merge | 111/39 | Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/GaloisConnection/Defs.lean,Mathlib/Order/Interval/Set/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/GuessName.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Tactic/Translate/ToDual.lean,MathlibTest/ToDual.lean | 9 | 4 | ['JovanGerb', 'bryangingechen', 'github-actions', 'joneugster'] | joneugster | 1 | 14 days ago | 19 days ago | 19 days |
| 37674 | gasparattila | feat(Topology/Sets): separation properties of `(Nonempty)Compacts` | --- [](https://gitpod.io/from-referrer/) | t-topology | 97/6 | Mathlib/Topology/Sets/VietorisTopology.lean | 1 | 13 | ['gasparattila', 'github-actions', 'mathlib-merge-conflicts', 'scholzhannah'] | PatrickMassot | 1 | 13 days ago | 16 days ago | 24 days |
| 32989 | kim-em | fix(Tactic/Simps): skip @[defeq] inference for non-exposed definitions | This PR makes `@[simps]` check whether the source definition's body is exposed before calling `inferDefEqAttr`. When the body is not exposed, we skip the `@[defeq]` inference to avoid validation errors. Without this fix, using `@[simps]` on a definition that is not `@[expose]`d produces an error like: ``` Theorem Foo_bar has a `rfl`-proof and was thus inferred to be `@[defeq]`, but validating that attribute failed: Not a definitional equality: the left-hand side ... is not definitionally equal to the right-hand side ... Note: This theorem is exported from the current module. This requires that all definitions that need to be unfolded to prove this theorem must be exposed. ``` The fix checks `(← getEnv).setExporting true |>.find? cfg.srcDeclName |>.any (·.hasValue)` to determine if the definition body is visible in the public scope, and only calls `inferDefEqAttr` if it is. 🤖 Prepared with Claude Code | t-meta awaiting-author LLM-generated please-adopt | 50/2 | Mathlib/CategoryTheory/Triangulated/TStructure/TruncLTGE.lean,Mathlib/Tactic/Simps/Basic.lean,MathlibTest/SimpsModule.lean | 3 | 17 | ['JovanGerb', 'Vierkantor', 'github-actions', 'joneugster', 'kim-em', 'mathlib-merge-conflicts'] | joneugster | 1 | 13 days ago | 73 days ago | 37 days |
| 34273 | gasparattila | feat(Topology/Sets): finite sets are dense in `(Nonempty)Compacts` | --- - [x] depends on: #34266 [](https://gitpod.io/from-referrer/) | t-topology | 35/0 | Mathlib/Topology/Sets/VietorisTopology.lean | 1 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'scholzhannah'] | PatrickMassot | 1 | 13 days ago | 38 days ago | 38 days |
| 35683 | gasparattila | fix(Tactic/FunProp): detect `Continuous.subtype_mk` as compositional | This PR changes `fun_prop` to detect some theorems involving dependent types, such as `Continous.subtype_mk` to be in compositional form. This lets `fun_prop` solve goals such as `Continuous fun x => (⟨x, trivial⟩ : {x : ℝ // True})`. --- These theorems become compositional: `Continuous.subtype_mk`, `Topology.IsEmbedding.inclusion`, `Topology.IsOpenEmbedding.inclusion`, `Topology.IsClosedEmbedding.inclusion`, `Measurable.subtype_mk`, `Measurable.imp`, `Path.symm_continuous_family`, `Continuous.upperHalfPlaneMk` These theorems become simple: `hasFDerivAt_prodMk_left`, `hasFDerivAt_prodMk_right`, `contDiff_prodMk_left`, `contDiff_prodMk_right` [](https://gitpod.io/from-referrer/) | t-meta | 57/33 | Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Topology/Homeomorph/Lemmas.lean,MathlibTest/fun_prop_dev.lean | 5 | 6 | ['gasparattila', 'github-actions', 'grunweg', 'lecopivo', 'mathlib-merge-conflicts'] | thorimur | 1 | 12 days ago | 34 days ago | 66 days |
| 36202 | vihdzp | feat: more theorems on the Cantor normal form | We also remove some redundant assumptions. Used in the CGT repo. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 68/17 | Mathlib/SetTheory/Ordinal/CantorNormalForm.lean | 1 | 16 | ['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | alreadydone | 1 | 12 days ago | 37 days ago | 56 days |
| 32282 | jsm28 | feat(Geometry/Euclidean/Angle/Incenter): unoriented angle bisection | Add lemmas giving unoriented angles involving the incenter and excenters of a triangle as expressions involving dividing angles of the triangle by 2, deduced from oriented bisection lemmas. --- - [ ] depends on: #30981 - [ ] depends on: #30982 - [ ] depends on: #31205 - [ ] depends on: #32019 - [ ] depends on: #32021 - [ ] depends on: #32259 - [ ] depends on: #32260 - [ ] depends on: #32270 - [ ] depends on: #32273 - [ ] depends on: #32278 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 98/0 | Mathlib/Geometry/Euclidean/Angle/Incenter.lean | 1 | 8 | ['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'wwylele'] | nobody | 1 | 11 days ago | 35 days ago | 35 days |
| 35820 | smmercuri | feat: unit lemmas and embedding for `FiniteAdeleRing` | --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 42/4 | Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean | 1 | 11 | ['Multramate', 'Ruben-VandeVelde', 'github-actions', 'smmercuri'] | mattrobball | 1 | 10 days ago | 10 days ago | 56 days |
| 37939 | AntoineChambert-Loir | feat(Order/Completion): embed a linear order into a dense and complete linear order | The aim of the PR is to prove the following theorem that will be used as an input to [Sion.DMCompletion.exists_isSaddlePointOn](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Sion.html#Sion.DMCompletion.exists_isSaddlePointOn) : *If `β` is any linear order, then there exists a complete and dense linear order `γ` together with a continuous embedding `ι : β ↪o γ` (for the order topologies on `β` and `γ`).* Meanwhile, the PR also records various instances about dense orders and lemmas regarding the Dedekind MacNeille completion and lexicographic orders. --- [](https://gitpod.io/from-referrer/) | t-order | 206/3 | Mathlib.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Order/Completion.lean,Mathlib/Topology/Order/Completion.lean,Mathlib/Topology/Sion.lean | 5 | 52 | ['ADedecker', 'AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | vihdzp | 1 | 8 days ago | 9 days ago | 12 days |
| 36451 | SnirBroshi | feat(Combinatorics/SimpleGraph/Matching): `edgeSet` is injective and strictly monotonic on matchings, and more API | --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 36/10 | Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 2 | 13 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 | 8 days ago | 8 days ago | 36 days |
| 35423 | Rob23oba | feat: add congruence lemmas for `Function.update` and `Pi.single` | Adds `simp` congruence lemmas to `Function.update` and `Pi.single` that are specialized for the non-dependent case. See also [#mathlib4 > Simp fails to apply with `Function.update`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Simp.20fails.20to.20apply.20with.20.60Function.2Eupdate.60/with/573889929). --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 29/6 | Mathlib/Algebra/Notation/Pi/Basic.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/RepresentationTheory/Tannaka.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | 5 | 11 | ['Rob23oba', 'eric-wieser', 'github-actions', 'joelriou', 'joneugster', 'loefflerd', 'mathlib-merge-conflicts'] | joelriou | 1 | 7 days ago | 37 days ago | 36 days |
| 38114 | javgomzar | feat(FinitelyPresentedGroup): add finite groups instance | Add IsFinitelyPresented instance for finite groups.
Co-authored-by: Hang Lu Su |
t-group-theory new-contributor large-import | 32/3 | Mathlib/GroupTheory/FinitelyPresentedGroup.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean | 2 | 32 | ['github-actions', 'javgomzar', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536', 'vihdzp'] | mattrobball | 1 | 7 days ago | 9 days ago | 12 days |
| 30185 | alreadydone | feat(MathlibTest): kernel reduction of nsmul on elliptic curve over ZMod | Co-authored-by: @SteffenReith --- - [x] depends on: #30144 - [x] depends on: #30181 [](https://gitpod.io/from-referrer/) | t-algebra t-number-theory t-algebraic-geometry maintainer-merge | 29/0 | MathlibTest/EllipticCurve.lean | 1 | 11 | ['alreadydone', 'github-actions', 'joneugster', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | joneugster | 1 | 7 days ago | 13 days ago | 14 days |
| 36401 | JovanGerb | feat(positivity): positivity extension for `a - b` | This PR adds support in `positivity` for proving things about subtraction. For example, if the goal is `0 < a - b`, and there is a local hypothesis of type `b < a`, then we close the goal. The motivation is that we want `positivity` to be a flexible tactic. So, when trying to prove `0 < a - b` using a local hypothesis, we should look for the simp normal form of this, which is `b < a`. --- [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Can.20I.20make.20positivity.20work.20for.20this.3F/near/578277240) [](https://gitpod.io/from-referrer/) | t-meta maintainer-merge | 63/26 | Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Complex/BorelCaratheodory.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Convex/BetweenList.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/Geometry/Manifold/Riemannian/PathELength.lean,Mathlib/Tactic/Positivity/Basic.lean,MathlibTest/positivity.lean | 10 | 13 | ['JovanGerb', 'Vierkantor', 'github-actions', 'hrmacbeth', 'j-loreaux', 'joneugster', 'leanprover-radar'] | joneugster | 3 | 7 days ago | 10 days ago | 39 days |
| 36605 | martinwintermath | feat(Geometry/Convex/Cone): Add lemmas about interaction of hull, span and negation | Prove lemmas about the interaction of hull, span and negation. Main additions: * `PointedCone.toSubmodule` that produces a submodule with the same support given that `-C = C`. Also the corresponding `CanLift` * `PointedCone.hull_neg_pair_eq_span_singleton` proving `hull R {-x, x} = R ∙ x` (simp lemma) * `PointedCone.span_eq_hull_neg_sup_hull` proving `span R s = hull R (-s) ⊔ hull R s` * `PointedCone.mem_span` proving `x ∈ span R C ↔ ∃ p, n ∈ C, x = p - n` Considerations: there are several ways to express that a convex cone is a submodule: * `-C = C` * `-C ≤ C` or `C ≤ -C` * `C = span R C` * `C = C.lineal` The consensus was that the the first option is the most direct way to express this property, which then allows to lift to a submodule. Co-authored by: Olivia Röhrig, Kilian Rueß, Artie Khovanov --- - [ ] depends on: #37464 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-convex-geometry | 88/12 | Mathlib/Geometry/Convex/Cone/Pointed.lean | 1 | 52 | ['artie2000', 'github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 | 7 days ago | 30 days ago | 17 days |
| 30526 | SnirBroshi | chore(Logic/Relation): use `≤` to spell subrelation | Replace every `∀ x y, r x y → r' x y` with `r ≤ r'` --- NOTE: this PR began as an effort to use `Subrelation` since `≤` wasn't available in this file, but it was agreed on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2330526.20use.20Subrelation.20in.20Mathlib.2ELogic.2ERelation/with/546572676) to instead make `≤` available there. [](https://gitpod.io/from-referrer/) | t-logic | 158/143 | Mathlib.lean,Mathlib/Algebra/Category/Grp/FilteredColimits.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/CategoryTheory/Action.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Filtered/Connected.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/Types/Coequalizers.lean,Mathlib/CategoryTheory/Limits/Types/Filtered.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Computability/TuringMachine/Config.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/Logic/Relation.lean,Mathlib/Order/Basic.lean,Mathlib/Order/Defs/Prop.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/Topology/Gluing.lean | 22 | 21 | ['SnirBroshi', 'Vierkantor', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'thorimur', 'vihdzp'] | Vierkantor | 1 | 6 days ago | 7 days ago | 69 days |
| 34507 | metakunt | feat(NumberTheory/AKSPrimality): Adds the AKS primality test | Adds the completed proof for the AKS primality test. Everything except the final theorem is marked private as it's only needed for the final proof. Also everything except the final theorem is namespaced with AKS. ---- Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Aks.20primality.20Theorem.206.2E1.20Claim.20.28i.29.20proven | t-number-theory | 645/0 | Mathlib.lean,Mathlib/NumberTheory/AKSPrimality.lean | 2 | 52 | ['MichaelStollBayreuth', 'github-actions', 'jcommelin', 'kim-em', 'metakunt', 'qawbecrdtey', 'tb65536', 'vihdzp'] | tb65536 | 1 | 6 days ago | 33 days ago | 63 days |
| 36686 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `List.prod_map_ite`: unchanged 🎉 * `Path.Homotopy.trans_assoc_reparam`: 2938 ms before, 717 ms after 🎉 * `SimplexCategory.δ_comp_δ`: 522 ms before, 316 ms after 🎉 * `Finsupp.ext_iff'`: unchanged 🎉 * `Computation.bind_assoc`: unchanged 🎉 * `Set.piecewise_insert`: unchanged 🎉 * `ZMod.valMinAbs_mem_Ioc`: unchanged 🎉 * `Matrix.det_eq_of_forall_row_eq_smul_add_pred_aux`: 2141 ms before, 2004 ms after 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 11/50 | Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/Set/Piecewise.lean,Mathlib/Data/ZMod/ValMinAbs.lean,Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean | 8 | 12 | ['artie2000', 'chenson2018', 'euprunin', 'github-actions', 'mathlib-merge-conflicts', 'ooovi'] | nobody | 2 | 5 days ago | 5 days ago | 45 days | |
| 38093 | mortarsanjaya | feat(Algebra/Order/Ring/Unbundled/Basic): add a generalization of `two_mul_le_add_of_sq_eq_mul` | The equality `r^2 = a * b` in the hypothesis can be weakened to `r^2 ≤ a * b`. The implementation requires adding an appropriate `ZeroLEOneClass` instance. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor maintainer-merge | 16/7 | Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean | 2 | 13 | ['github-actions', 'leanprover-radar', 'mortarsanjaya', 'themathqueen'] | themathqueen | 1 | 5 days ago | 10 days ago | 15 days |
| 33928 | jsm28 | feat(Combinatorics/Tiling/TileSet): indexed families of tiles | Define the type `TileSet` for indexed families of tiles (in a discrete context), and some associated definitions (including `symmetryGroup`) and API lemmas. `TileSet` can be used for tilings of the whole space; for tilings of part of the space; for patches of tiles (extracted from a tiling by considering tiles meeting some set of points, or considered on their own without extracting from a tiling); for multiple tilings (covering the space more than once). In particular, the fact that people study multiple tilings provides a clear justification for using indexed families rather than sets of tiles, and basic definitions and API lemmas generally work for all these different uses of `TileSet` (sometimes with weak constraints such as tiles being finite, nonempty and only having finitely many tiles meeting any point of the space). Definitions for saying e.g. "this `TileSet` is a tiling of the whole space" are to be included in subsequent files in subsequent PRs. From AperiodicMonotilesLean. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 460/0 | Mathlib.lean,Mathlib/Combinatorics/Tiling/TileSet.lean | 2 | 23 | ['Parcly-Taxel', 'b-mehta', 'eric-wieser', 'github-actions', 'jsm28', 'vihdzp'] | YaelDillies | 1 | 4 days ago | 107 days ago | 107 days |
| 34092 | staroperator | feat(SetTheory/ZFC): properties of `ZFSet.omega` | --- [](https://gitpod.io/from-referrer/) | t-set-theory awaiting-author | 77/10 | Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Ordinal.lean,Mathlib/SetTheory/ZFC/PSet.lean | 3 | 31 | ['Komyyy', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator', 'vihdzp'] | YaelDillies | 1 | 4 days ago | 4 days ago | 99 days |
| 36840 | SnirBroshi | feat(SetTheory/Ordinal/Arithmetic): a few ordinal division lemmas | --- [](https://gitpod.io/from-referrer/) | t-set-theory awaiting-author | 27/8 | Mathlib/SetTheory/Ordinal/Arithmetic.lean | 1 | 8 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'vihdzp'] | YaelDillies | 1 | 4 days ago | 4 days ago | 39 days |
| 36954 | FMLJohn | feat(Topology/ClosedBases): `TopologicalSpace.IsClosedBasis` and `TopologicalSpace.IsClosedSubbasis s` | In this pull request, I have defined closed bases and closed subbases of topologies, and proved some basic properties of them. ## Main definitions * `TopologicalSpace.IsClosedBasis s`: A closed basis of a topological space `α` is a collection of closed sets `s : Set (Set α)` such that every closed subset of `α` can be written as an intersection of elements of `s`. --- [](https://gitpod.io/from-referrer/) | t-topology | 117/0 | Mathlib.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/ClosedBases.lean | 3 | 19 | ['github-actions', 'scholzhannah'] | PatrickMassot | 1 | 4 days ago | 8 days ago | 37 days |
| 38345 | emlis42 | feat(NumberTheory): add Int.divisors | This PR adds `Int.divisors` in `Mathlib/NumberTheory/Divisors.lean`. Defines `Int.divisors` as the disjoint union of positive and negative `Nat.divisors`. Basic lemmas: * `mem_divisors` * `divisors_zero`, `divisors_eq_empty`, `divisors_one` * `one_mem_divisors`, `neg_one_mem_divisors` * `nonempty_divisors` * `mem_divisors_self` * `divisors_neg` Lemmas relating to `divisorsAntidiag`: * `image_fst_divisorsAntidiag` * `image_snd_divisorsAntidiag` | t-number-theory new-contributor maintainer-merge | 61/2 | Mathlib/NumberTheory/Divisors.lean | 1 | 21 | ['Multramate', 'SnirBroshi', 'emlis42', 'github-actions', 'tb65536'] | tb65536 | 2 | 4 days ago | 9 days ago | 9 days |
| 37441 | lecopivo | fix(FunProp): be less strict about the shape of morphism theorems | Don't be so restrictive about the shape of morphism theorems Right now, `fun_prop` has a problem with a bundled morphism `Foo α` that coerces to `α → α → α` . The coerced function has two arguments and there is an unnecessary restriction about this. This PR lifts that restriction. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60fun_prop.60.20in.20.60FunLike.60.20with.20multiple.20arguments/with/582731349) --- [](https://gitpod.io/from-referrer/) | t-meta delegated | 42/14 | Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,MathlibTest/fun_prop_dev.lean | 3 | 6 | ['Vierkantor', 'github-actions', 'joneugster', 'mathlib-bors'] | joneugster | 2 | 4 days ago | 4 days ago | 26 days |
| 28796 | grunweg | feat: immersions are smooth | The conventional textbook definition demands that an immersion be smooth. When asking for the immersion to have local slice charts (as we do), this implies smoothness automatically. --- - [x] depends on: #28701 - [x] depends on: #28793 - [x] depends on: #30356 - [x] depends on: #28853 (for simplicity) - [x] depends on: #36816 [](https://gitpod.io/from-referrer/) | t-differential-geometry awaiting-author merge-conflict | 96/12 | Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/Geometry/Manifold/LocalSourceTargetProperty.lean,Mathlib/Geometry/Manifold/SmoothEmbedding.lean | 4 | 57 | ['chrisflav', 'github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'sgouezel'] | PatrickMassot | 1 | 4 days ago | 106 days ago | 31 minutes |
| 38592 | SnirBroshi | feat(Logic/Embedding/Basic): `refl_trans`/`trans_refl`/`trans_assoc` | - `(.refl α).trans f = f` - `f.trans (.refl β) = f` - `(f.trans g).trans h = f.trans (g.trans h)` --- [](https://gitpod.io/from-referrer/) | t-logic | 12/0 | Mathlib/Logic/Embedding/Basic.lean | 1 | 1 | ['github-actions', 'vihdzp'] | nobody | 1 | 3 days ago | 3 days ago | 3 days |
| 34805 | DavidLedvinka | feat(Tactic): generalize ofScientific NormNum extension to `DivisionSemiring` | Co-authored-by: @hrmacbeth | t-meta | 68/20 | Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/NormNum/OfScientific.lean,MathlibTest/norm_num.lean | 3 | 26 | ['DavidLedvinka', 'JovanGerb', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'thorimur'] | dwrensha | 1 | 2 days ago | 40 days ago | 61 days |
| 37752 | JovanGerb | chore(Order/CompleteLattice/Lemmas): use `to_dual` | Use `to_dual` for lemmas about `CompleteLattice`. --- [](https://gitpod.io/from-referrer/) | t-order | 27/56 | Mathlib/Order/CompleteLattice/Lemmas.lean | 1 | 1 | ['github-actions', 'vihdzp'] | bryangingechen | 1 | 2 days ago | 24 days ago | 24 days |
| 37753 | JovanGerb | chore(Order/Filter/Basic): use `to_dual` for `≤ᶠ` | Use `to_dual` on lemmas about `EventuallyLE`. --- [](https://gitpod.io/from-referrer/) | t-order | 19/6 | Mathlib/Order/Filter/Basic.lean | 1 | 2 | ['github-actions', 'vihdzp'] | bryangingechen | 1 | 2 days ago | 24 days ago | 24 days |
| 35619 | SnirBroshi | feat(Combinatorics/SimpleGraph/Clique): intersection and union of cliques | Plus a couple of lemmas. --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 45/14 | Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Data/Set/Pairwise/Basic.lean | 3 | 13 | ['SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | 1 | 2 days ago | 8 days ago | 29 days |
| 37926 | e-271828 | feat(Analysis/Analytic): add AnalyticAt properties for iterated dslope | This PR adds three fundamental lemmas in the `AnalyticAt` namespace to establish the analyticity of the (iterated) `dslope` function: * `AnalyticAt.dslope_of_ne` * `AnalyticAt.iterate_dslope_of_ne` * `AnalyticAt.iterate_dslope` (at the singularity, using `has_fpower_series_iterate_dslope_fslope`) These properties are crucial for factoring out removable singularities iteratively while preserving analyticity. This PR was assisted by LLMs (Aristotle and Gemini). --- [](https://gitpod.io/from-referrer/) | t-analysis new-contributor | 18/0 | Mathlib/Analysis/Analytic/IsolatedZeros.lean | 1 | 10 | ['e-271828', 'github-actions', 'j-loreaux', 'wwylele'] | j-loreaux | 1 | 2 days ago | 2 days ago | 19 days |
| 37464 | martinwintermath | feat(Geometry/Convex/Cone): Minor additions to pointed cones | Minor additions to pointed cones: * `PointedCone.ofSubmodule_le_ofSubmodule` and `PointedCone.ofSubmodule_lt_ofSubmodule`. These are not made simp lemmas, instead the underlying `Submodule.restrictScalars_le` and `Submodule.restrictScalars_lt` have been changed into simp lemmas. * `PointedCone.hull_le_span` as a short form of `Submodule.span_le_restrictScalars R≥0 R s` In preparation for #36605. Co-authored by: Artie Khovanov --- [](https://gitpod.io/from-referrer/) | t-convex-geometry | 22/14 | Mathlib/Algebra/Module/Submodule/RestrictScalars.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 22 | ['artie2000', 'github-actions', 'justus-springer', 'martinwintermath', 'mathlib-merge-conflicts', 'ooovi', 'vihdzp'] | nobody | 3 | 2 days ago | 14 days ago | 29 days |
| 38670 | tb65536 | chore(GroupTheory/SpecificGroups/Alternating): deprecate old proof of simplicity of A_5 | Now that #36524 has been merged, we can deprecate the old proof of simplicity of A_5. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 37/106 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/GroupTheory/SpecificGroups/Alternating.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/Simple.lean | 4 | 2 | ['AntoineChambert-Loir', 'github-actions', 'tb65536'] | nobody | 1 | 2 days ago | 2 days ago | 2 days |
| 37400 | SnirBroshi | feat(Combinatorics/SimpleGraph/Acyclic): endpoints of a path have at most one neighbor in the path | --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 15/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 6 | ['Rida-Hamadani', 'Ruben-VandeVelde', 'SnirBroshi', 'bryangingechen', 'github-actions'] | nobody | 2 | 2 days ago | 31 days ago | 31 days |
| 37346 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `✅️ SimpleGraph.Walk.IsPath.getVert_injOn`: unchanged 🎉 * `✅️ SimpleGraph.Walk.length_bypass_le`: unchanged 🎉 * `✅️ Rat.floor_intCast_div_natCast`: unchanged 🎉 * `✅️ InnerProductGeometry.norm_eq_of_angle_sub_eq_angle_sub_rev_of_angle_ne_pi`: unchanged 🎉 * `✅️ padicNorm.zero_of_padicNorm_eq_zero`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | maintainer-merge awaiting-zulip | 7/45 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Geometry/Euclidean/Triangle.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean | 4 | 22 | ['FernandoChu', 'bryangingechen', 'chenson2018', 'euprunin', 'faenuccio', 'github-actions', 'grunweg'] | nobody | 1 | 2 days ago | 2 days ago | 30 days |
| 37389 | martinwintermath | chore(LinearAlgebra/SesquilinearForm): generalize `orthogonalBilin` in order to simplify definition of `orthogonal` | - generalize `Submodule.orthogonalBilin` to `CommSemiring` and `AddCommMonoid`, and to general sesquilinear forms with inputs from different modules. This enables subsequent changes. - redefine `BilinForm.orthogonal` in terms of `orthogonalBilin`. - reorder arguments of `Submodule.orthogonalBilin` to match other instances of duality across mathlib. For comparison Before ```lean4 Submodule.orthogonalBilin.{u_1, u_2, u_5, u_6} {R : Type u_1} {R₁ : Type u_2} {M : Type u_5} {M₁ : Type u_6} [CommRing R] [CommRing R₁] [AddCommGroup M₁] [Module R₁ M₁] [AddCommGroup M] [Module R M] {I₁ I₂ : R₁ →+* R} (N : Submodule R₁ M₁) (B : M₁ →ₛₗ[I₁] M₁ →ₛₗ[I₂] M) : Submodule R₁ M₁ ``` After ```lean4 Submodule.orthogonalBilin.{u_1, u_2, u_3, u_5, u_6, u_7} {R : Type u_1} {R₁ : Type u_2} {R₂ : Type u_3} {M : Type u_5} {M₁ : Type u_6} {M₂ : Type u_7} [CommSemiring R] [CommSemiring R₁] [CommSemiring R₂] [AddCommMonoid M] [Module R M] [AddCommMonoid M₁] [Module R₁ M₁] [AddCommMonoid M₂] [Module R₂ M₂] {I₁ : R₁ →+* R} {I₂ : R₂ →+* R} (B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M) (N : Submodule R₁ M₁) : Submodule R₂ M₂ ``` A few fixes in other files have been necessary as well. This is an extract from #37381. --- [](https://gitpod.io/from-referrer/) | t-algebra | 28/21 | Mathlib/Algebra/Lie/InvariantForm.lean,Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/RootSystem/Finite/Nondegenerate.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean | 5 | 8 | ['eric-wieser', 'github-actions', 'martinwintermath', 'themathqueen', 'vihdzp'] | ocfnash | 1 | 2 days ago | 2 days ago | 31 days |
| 38269 | b-mehta | feat(Combinatorics/Additive): link Freiman homs and Freiman isos tighter | --- Some work I had lying around in a forgotten branch, recently resurrected. [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 118/76 | Mathlib/Combinatorics/Additive/AP/Three/Behrend.lean,Mathlib/Combinatorics/Additive/AP/Three/Defs.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean | 3 | 15 | ['YaelDillies', 'b-mehta', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 | 2 days ago | 2 days ago | 3 days |
| 38377 | xroblot | feat(RingTheory/Localization, FieldTheory/Galois): refactor fraction field action API and add fixingSubgroup lemmas | Extracts the components of the proof of `IsGaloisGroup.to_isFractionRing`, adding API for working with "Galois extensions of domains". Also adds `fixingSubgroup_range_algebraMap` and its ring-domain analogue: if `G` is a Galois group for `L/K` and a subgroup `H` is a Galois group for `L/R`, then the elements of `G` fixing the range of `algebraMap R L` pointwise are exactly the elements of `H`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 139/41 | Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 4 | 3 | ['github-actions', 'leanprover-radar', 'riccardobrasca', 'tb65536'] | riccardobrasca | 1 | 2 days ago | 9 days ago | 9 days |
| 36794 | vihdzp | doc(SetTheory/Ordinal/Principal): improve documentation | The module docstring now contains a description of what an `op`-principal actually is. I've also added some additional names for discoverability. --- [](https://gitpod.io/from-referrer/) | t-set-theory documentation delegated | 24/18 | Mathlib/SetTheory/Ordinal/Principal.lean,Mathlib/SetTheory/Ordinal/Veblen.lean | 2 | 16 | ['SnirBroshi', 'Vierkantor', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 3 | 1 day ago | 1 day ago | 42 days |
| 36740 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `AlgebraicGeometry.Scheme.isBasis_affineOpens`: unchanged 🎉 * `SimpleGraph.Walk.takeUntil_eq_take`: 263 ms before, 180 ms after 🎉 * `SimpleGraph.Walk.dropUntil_eq_drop`: 382 ms before, 261 ms after 🎉 * `Int.image_Ico_emod`: unchanged 🎉 * `Equiv.Perm.ofSubtype_swap_eq`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 7/33 | Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Data/Int/Interval.lean,Mathlib/GroupTheory/Perm/Support.lean | 4 | 8 | ['artie2000', 'chenson2018', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 | 1 day ago | 1 day ago | 43 days |
| 38426 | SnirBroshi | feat(Data/Set/Card): `Fintype.card s = s.ncard` | We have `↑(Fintype.card s) = s.encard` but we don't yet have a theorem relating `Fintype.card` and `Set.ncard`. This adds `Fintype.card s = s.ncard` for `Fintype s`, and also `s.ncard = s.encard` for `Finite s`. --- ~~(tagging `simp` is problematic since the aforementioned theorem (`Set.coe_fintypeCard`) is `simp`, and I'm not sure we should untag it)~~ [](https://gitpod.io/from-referrer/) | t-data | 8/0 | Mathlib/Data/Set/Card.lean | 1 | 4 | ['SnirBroshi', 'Vierkantor', 'b-mehta', 'github-actions'] | Vierkantor | 1 | 1 day ago | 2 days ago | 6 days |
| 37562 | IvanRenison | feat(Combinatorics/SimpleGraph): add several lemmas about when `Walk.bypass` and `Walk.cycleBypass` do nothing |
Co-authored-by: Vlad Tsyrklevich |
blocked-by-other-PR t-combinatorics merge-conflict | 55/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 8 | ['IvanRenison', 'SnirBroshi', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vlad902'] | nobody | 1 | 1 day ago | 29 days ago | 8 minutes |
| 37603 | Parcly-Taxel | refactor: review of `SetSemiring` | * Rename `Set.up` and `SetSemiring.down` to `SetSemiring.ofSet` and `SetSemiring.toSet` respectively. Unprotect both and make them equivalences, following `FreeMonoid`. * Derive `CompleteAtomicBooleanAlgebra` for `SetSemiring` immediately. * Add `imageHom_id` and `imageHom_comp`. The three existing lemmas about `imageHom` are coalesced into `imageHom_apply`. Ultimately inspired by https://github.com/leanprover-community/mathlib4/pull/36934#issuecomment-4183475568. | maintainer-merge merge-conflict | 120/165 | Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Data/Set/Semiring.lean | 2 | 42 | ['Parcly-Taxel', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'sgouezel'] | nobody | 1 | 1 day ago | 1 day ago | 22 days |
| 38328 | astrainfinita | feat: `OrderSupSet` | This PR introduces `OrderSupSet` and `OrderInfSet`, which are typeclasses expressing that `sSup` (resp., `sInf`) returns the least upper bound (resp., the greatest lower bound) of a set whenever one exists. This allows us to prove properties about the `sSup` of specific sets (such as `∅`, singletons, finite sets, and `univ`) without any typeclasses asserting the existence of LUBs. For example, `sSup ∅ = ⊥` holds for any type equipped with `OrderBot` `OrderSupSet`, no longer requiring typeclasses like `ConditionallyCompleteLinearOrderBot`. For a general set `s`, this gives a uniform way to extend results about `IsLUB s a → motive a` to `motive (sSup s)`, `motive (⨆ i, f i)`, `motive (a ⊔ b)`, etc., which allows proof reuse for basic API such as [`csSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/ConditionallyCompleteLattice/Basic.html#csSup_insert), [`iSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/CompleteLattice/Basic.html#iSup_insert), and [`sSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/CompleteLattice/Basic.html#sSup_insert) and downstream code like [`csSup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.html#csSup_add), [`sSup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.html#sSup_add), and [`sup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Lattice.html#sup_add). Furthermore, this allows us to refactor incrementally, reducing the dependency of results about various completeness typeclasses on the specific implementation of `sSup`. --- [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F) [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 156/73 | Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Bounds/Defs.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/SetNotation.lean,Mathlib/Topology/UniformSpace/OfCompactT2.lean | 7 | 16 | ['JovanGerb', 'astrainfinita', 'b-mehta', 'github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'openendings', 'vihdzp'] | nobody | 1 | 1 day ago | 1 day ago | 5 days |
| 38428 | tb65536 | refactor(RepresentationTheory/Coinvariants): use `IntertwiningMap` in `Coinvariants.map` | Currently `Coinvariants.map` has the intertwining condition as as a separatel hypothesis. This PR switches over to the bundled `IntertwiningMap`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 16/20 | Mathlib/RepresentationTheory/Coinvariants.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/Basic.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/FiniteCyclic.lean,Mathlib/RepresentationTheory/Homological/Resolution.lean,Mathlib/RepresentationTheory/Induced.lean,Mathlib/RepresentationTheory/Rep/Basic.lean | 6 | 1 | ['Whysoserioushah', 'github-actions'] | riccardobrasca | 1 | 1 day ago | 7 days ago | 7 days |
| 38097 | NoahW314 | feat: add `IndiscreteTopology` instances | --- [](https://gitpod.io/from-referrer/) | t-topology | 24/0 | Mathlib/Topology/Homotopy/Contractible.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Separation/Connected.lean | 4 | 5 | ['NoahW314', 'github-actions', 'scholzhannah', 'vihdzp'] | PatrickMassot | 1 | 1 day ago | 15 days ago | 15 days |
| 37076 | ertwro | feat(Combinatorics/SimpleGraph/Hasse): Hasse diagram is triangle-free | Add `SimpleGraph.hasse_cliqueFree_three`: the Hasse diagram of a preorder is triangle-free (`CliqueFree 3`). This is the graph-theoretic formulation of `not_covBy_of_lt_of_lt`: if `a ⋖ b` and `b ⋖ c`, then `¬ a ⋖ c`, so no three elements can be pairwise adjacent in the Hasse diagram. The proof extracts three vertices from a hypothetical 3-clique, case-splits on the covering directions (8 cases), and closes each by `not_covBy_of_lt_of_lt` (6 transitive cases) or `lt_asymm` (2 cyclic cases). --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 11/0 | Mathlib/Combinatorics/SimpleGraph/Hasse.lean | 1 | 21 | ['Rida-Hamadani', 'SnirBroshi', 'ertwro', 'github-actions', 'vlad902'] | nobody | 1 | 1 day ago | 12 days ago | 20 days |
| 38731 | martinwintermath | feat(LinearAlgebra/AffineSpace/AffineSubspace): using `AffineSubspace.direction` to reinterpret `AffineSubspace` as `Submodule` | * add `AffineSubspace.vsub_self_of_zero_mem` that states `s -ᵥ s = s ` if `0 ∈ s` * add `AffineSubspace.direction_eq_self_of_zero_mem` that states that if `0 ∈ s`, then the directions coerce back to the affine subspace. * add corresponding `CanLift` instance. * modify doc-string of `AffineSubspace.direction` to state that this can be used for reinterpretation of an affine subspace as a submodule. * add `Coe` instance based on `Submodule.toAffineSubspace` and adds corresponding @[coe] attribute. The PR also performs a slight cleanup of the file: statements about `SetLike` or `Submodule.toAffineSubspace` have been moved closer to their respective definitions. --- [](https://gitpod.io/from-referrer/) | t-algebra | 56/26 | Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean | 1 | 3 | ['github-actions', 'wwylele'] | nobody | 1 | 1 day ago | 2 days ago | 2 days |
| 38062 | tb65536 | feat(RingTheory/RamificationInertia): alternate definitions of ramification index and inertia degree | This PR adds alternate definitions of ramification index and inertia degree, following the discussion here: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Improving.20the.20definition.20of.20ramification.20index.3F --- - [x] depends on: #38081 - [x] depends on: #38082 - [x] depends on: #38083 [](https://gitpod.io/from-referrer/) | t-algebra t-ring-theory t-number-theory | 215/0 | Mathlib.lean,Mathlib/RingTheory/RamificationInertia/Inertia.lean,Mathlib/RingTheory/RamificationInertia/Ramification.lean | 3 | 19 | ['github-actions', 'mathlib-dependent-issues', 'riccardobrasca', 'tb65536', 'xroblot'] | riccardobrasca | 1 | 1 day ago | 3 days ago | 3 days |
| 38556 | JovanGerb | feat(GCongr): `applyRflOrId` | This PR defines `MVarId.applyRflOrId`, which is a version of the `rfl` tactic (`MVarId.applyRfl`) that also closes goals of the form `p → p`. My original intent was to include this feature in `rfl` itself, but this proposal was rejected by core. As a result of this change, the operators `→`, `∧` and `∨` now only need to have a single `gcongr` lemma each. This is beneficial for the new `grw` implementation. I've also removed the `gcongr` attribute from `List.Sublist.append_left`, `List.Sublist.append_right`, `List.Perm.append_left` and `List.Perm.append_right` since they are similarly redundant. --- [](https://gitpod.io/from-referrer/) | t-meta | 76/18 | Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GCongr/CoreAttrs.lean,MathlibTest/GCongr/Core.lean,MathlibTest/GCongr/implications.lean | 4 | 7 | ['JovanGerb', 'Vierkantor', 'github-actions'] | Vierkantor | 1 | 1 day ago | 2 days ago | 4 days |
| 38736 | yuanyi-350 | chore(GroupTheory/PushoutI): remove an erw | - rewrites the `h₁` simplification in `eq_one_of_smul_normalized` into a single `simp only` chain, replacing the `rw` and `erw` steps around `equiv_one` and `mul_one` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-group-theory maintainer-merge | 2/3 | Mathlib/GroupTheory/PushoutI.lean | 1 | 3 | ['github-actions', 'tb65536'] | tb65536 | 1 | 1 day ago | 1 day ago | 1 day |
| 37840 | tb65536 | chore(RingTheory/Localization/AtPrime/Basic): use `under` instead of `comap (algebraMap R S)` | This PR switches over from `comap (algebraMap R S)` to `under`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra awaiting-zulip | 161/144 | Mathlib/AlgebraicGeometry/Noetherian.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Frobenius.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/GoingUp.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/IntegralClosure/GoingDown.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/KrullDimension/Polynomial.lean,Mathlib/RingTheory/LocalProperties/Injective.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/AtPrime/Extension.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/Spectrum/Prime/Topology.lean | 19 | 9 | ['chrisflav', 'github-actions', 'robin-carlier', 'tb65536'] | chrisflav and erdOne | 1 | 1 day ago | 1 day ago | 20 days |
| 36891 | vihdzp | feat(SetTheory/Ordinal/Exponential): characterization of `a ^ b = 1` | Used in the CGT repo. --- [](https://gitpod.io/from-referrer/) | t-set-theory delegated | 12/0 | Mathlib/SetTheory/Ordinal/Exponential.lean | 1 | 9 | ['SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'vihdzp'] | b-mehta | 2 | 1 day ago | 1 day ago | 41 days |
| 37505 | IvanRenison | feat(Combinatorics/SimpleGraph): add lemma `SimpleGraph.length_cycleBypass_le` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author merge-conflict | 3/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 7 | ['IvanRenison', 'Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts'] | YaelDillies | 1 | 1 day ago | 8 days ago | 21 days |
| 36743 | Jun2M | feat(Combinatorics/GraphLike): introduce `GraphLike` typeclass | Per discussion at ([#graph theory > HasAdj](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/HasAdj/with/575843445)), This PR introduces the `GraphLike` typeclass to capture the notions like `dart` and `walk` across various graph objects, such as `SimpleGraph`, `Graph`, and `Digraph`. The goal is that by abstracting these core components into a typeclass, we can prove these results once for all graph-like structures rather than duplicating them across different graph types. This PR generalises #35776 to also unify `Graph`. ### Main definitions * `GraphLike V D E Gr`: A typeclass parameterized by a vertex type `V`, dart type `D` and a graph type `Gr` (with `V`, `D` & `E` as an `outParam`). * `GraphLike.verts : Set V`: The set of vertices of the graph. * `GraphLike.darts : Set D`: The set of darts of the graph. * `GraphLike.edges : Set E`: The set of edges of the graph. * `GraphLike.Adj : V → V → Prop`: The adjacency relation, defined by default as `∃ d ∈ darts, fst d = u ∧ snd d = v`. * Instance of `GraphLike V (Digraph V)` with `darts G := { (u, v) | G.Adj u v }` * Instance of `GraphLike V (SimpleGraph V)` with `darts G := { (u, v) | G.Adj u v }` * Instance of `GraphLike V (Graph V E)` with `darts G := {d : Dart α β | G.IsLink (edge d) (src d) (tgt d)}` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 407/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/GraphLike.lean,Mathlib/Combinatorics/Graph/GraphLike.lean,Mathlib/Combinatorics/GraphLike/Basic.lean,Mathlib/Combinatorics/SimpleGraph/GraphLike.lean | 5 | 46 | ['IvanRenison', 'Jun2M', 'SnirBroshi', 'github-actions', 'lauramonk', 'mathlib-merge-conflicts'] | YaelDillies | 1 | 1 day ago | 3 days ago | 44 days |
| 38223 | Deicyde | feat(Geometry/Manifold): add `MfldCat`, the category of `C^n` manifolds | We define `MfldCat 𝕜 n`: the category of `C^n` manifolds over a field `𝕜`, following the pattern of `TopCat` in `Mathlib.Topology.Category.TopCat.Basic`. We also implement `HasForget₂ (MfldCat 𝕜 n) TopCat`—the forgetful functor into the category of topological spaces. For more discussion see the Zulip thread: [#PR reviews > #38223 The Category of C^n Manifolds](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2338223.20The.20Category.20of.20C.5En.20Manifolds/with/587038032) Also added: `ContMDiffMap.id_apply`, `.coe_id` and `.coe_comp` which are comparable to `ContinuousMap` API. ### Future work - ✅ Define a Monoidal structure via product manifolds, analogous to `Manifold.Topology.Category.TopCat.Monoidal` #38560 - ✅ Define the tangent functor: `M ↦ TM`, `F ↦ F.tangentMap` from `MfldCat (n+1) 𝕜` to `MfldCat n 𝕜` #38270 - Functor `FGModuleCat 𝕜 ⥤ MfldCat 𝕜 n` sending a finite-dimensional `𝕜`-vector space to the manifold modeled on itself. Left as `TODO`. - Define `FGModuleCat 𝕜` as an enriched category over `MfldCat n 𝕜`. Then _smooth functors_ can be realized as endofunctors on the enriched category. This is the main motivation for this construction. --- [](https://gitpod.io/from-referrer/) | t-differential-geometry new-contributor t-category-theory | 225/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean | 3 | 52 | ['Deicyde', 'chrisflav', 'dagurtomas', 'github-actions', 'idontgetoutmuch', 'peabrainiac'] | kim-em | 1 | 1 day ago | 6 days ago | 7 days |
| 37353 | SnirBroshi | feat(Order/WellFounded): characterize `WellFoundedLT` and `IsWellOrder` in terms of nonempty sets | --- Both of these use the existing characterization of `WellFounded`. [](https://gitpod.io/from-referrer/) | t-order delegated | 12/0 | Mathlib/Order/WellFounded.lean | 1 | 14 | ['Komyyy', 'SnirBroshi', 'b-mehta', 'github-actions', 'mathlib-bors'] | nobody | 1 | 23 hours ago | 23 hours ago | 15 days |
| 26975 | Whysoserioushah | feat: a norm_num extension for complex numbers | co-authored-by : @thefundamentaltheor3m, @hrmacbeth --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-author | 424/12 | Mathlib.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/NormNum/Eq.lean,Mathlib/Tactic/NormNum/NormNumI.lean,Mathlib/Tactic/NormNum/Result.lean,MathlibTest/norm_numI.lean | 7 | 58 | ['JovanGerb', 'Vierkantor', 'Whysoserioushah', 'dupuisf', 'eric-wieser', 'github-actions', 'grunweg', 'hrmacbeth', 'mathlib4-merge-conflict-bot'] | Vierkantor | 1 | 19 hours ago | 58 days ago | 112 days |
| 37623 | IvanRenison | feat(Order/RelIso): add theorems about `RelHom.comp` and `RelEmbedding.trans` | Co-authored-by: SnirBroshi <26556598+SnirBroshi@users.noreply.github.com> --- Missing of this theorems noticed by @SnirBroshi in #37598 [](https://gitpod.io/from-referrer/) | t-order | 18/0 | Mathlib/Order/RelIso/Basic.lean | 1 | 6 | ['IvanRenison', 'SnirBroshi', 'eric-wieser', 'github-actions'] | nobody | 1 | 18 hours ago | 26 days ago | 27 days |
| 34271 | gasparattila | feat(Topology/Sets): second-countability of `(Nonempty)Compacts` | --- - [x] depends on: #34266 - [x] depends on: #34268 [](https://gitpod.io/from-referrer/) | t-topology | 17/76 | Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sets/VietorisTopology.lean | 2 | 8 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'scholzhannah'] | urkud | 1 | 17 hours ago | 23 days ago | 30 days |
| 33506 | Rida-Hamadani | feat(SimpleGraph): construct a cycle of two distinct paths with same start and end | Co-authored-by: Vlad Tsyrklevich |
t-combinatorics | 119/1 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Nodup.lean | 5 | 42 | ['Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vlad902'] | nobody | 1 | 12 hours ago | 22 hours ago | 14 days |
| 38702 | jcommelin | chore(Data/Real): encapsulate real numbers | This PR: * hides the definition of the real numbers * preserves defeqs when casting `Nat`, `Int`, `Rat`, into the reals * preserves the defeq `x - y = x + (-y)` for `x y : Real` * removes a bunch of technical debt * adjusts imports in the library, where files relied on getting access to Cauchy sequences transitively via importing the reals. --- [](https://gitpod.io/from-referrer/) | delegated | 239/257 | Archive/Imo/Imo2013Q5.lean,Counterexamples/SeminormLatticeNotDistrib.lean,Mathlib.lean,Mathlib/Analysis/Complex/Norm.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/Real/Cardinality.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Counting.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/Real/Cauchy.lean,Mathlib/Data/Real/Sign.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/SelbergSieve.lean,Mathlib/Topology/Algebra/Ring/Real.lean,Mathlib/Topology/Instances/Real/Lemmas.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/UniformSpace/CompareReals.lean,Mathlib/Topology/UniformSpace/Real.lean,MathlibTest/Complex.lean,MathlibTest/Quaternion.lean,MathlibTest/Real.lean,MathlibTest/peel.lean | 26 | 17 | ['JovanGerb', 'YaelDillies', 'eric-wieser', 'fpvandoorn', 'github-actions', 'jcommelin', 'leanprover-radar', 'mathlib-bors', 'riccardobrasca', 'sgouezel'] | nobody | 1 | 12 hours ago | 2 days ago | 43 minutes |
| 38654 | MichaelStollBayreuth | feat(RingTheory.DedekindDomain.Factorization): add API for factorization | This PR adds * `simp` lemmas that convert ways of expressing the multiplicity of a prime ideal `p` in the factorization of an ideal `I` into `multiplicity p.asIdeal I` (see [#Is there code for X? > Results on elements of number fields and ideals @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Results.20on.20elements.20of.20number.20fields.20and.20ideals/near/574739650)), * API lemmas on multiplicities, expressed in terms of `multiplicity p.asIdeal I`. * We also refactor a proof in Mathlib.RingTheory.DedekindDomain.Ideal.Lemmas by extracting a couple of lemmas that we can reuse in one of the new lemmas. These will be useful in proving the Northcott property of heights on number fields. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 164/23 | Mathlib/RingTheory/DedekindDomain/Factorization.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/UniqueFactorizationDomain/NormalizedFactors.lean | 3 | 5 | ['MichaelStollBayreuth', 'github-actions', 'xroblot'] | nobody | 1 | 11 hours ago | 2 days ago | 3 days |
| 30666 | erdOne | feat(NumberTheory): every number field has a ramified prime | --- [](https://gitpod.io/from-referrer/) | t-number-theory t-algebra delegated | 260/10 | Mathlib.lean,Mathlib/Algebra/Ring/Int/Field.lean,Mathlib/LinearAlgebra/Dimension/FreeAndStrongRankCondition.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/NumberTheory/NumberField/Discriminant/Different.lean,Mathlib/NumberTheory/NumberField/ExistsRamified.lean,Mathlib/NumberTheory/RamificationInertia/Inertia.lean,Mathlib/RingTheory/DedekindDomain/Basic.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean,Mathlib/RingTheory/KrullDimension/Basic.lean | 12 | 49 | ['MichaelStollBayreuth', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'riccardobrasca', 'tb65536', 'xroblot'] | jcommelin | 2 | 10 hours ago | 10 hours ago | 14 days |
| 37675 | vihdzp | feat: `Order.cof Ordinal = univ` | --- [](https://gitpod.io/from-referrer/) | t-set-theory t-order maintainer-merge | 11/0 | Mathlib/SetTheory/Cardinal/Cofinality.lean | 1 | 4 | ['YaelDillies', 'github-actions', 'vihdzp'] | nobody | 1 | 10 hours ago | 25 days ago | 25 days |
| 37342 | vasnesterov | feat(Tactic/ComputeAsymptotics/Multiseries): non-primitive corecursion for Seq: more `FriendlyOperation` API | This is a continuation of #35072. This PR adds more API about friendly operations: * `FriendlyOperation.coind`: a coinductive principle for proving that operation is friendly * `FriendlyOperationClass.eq_of_bisim`: a generalisation of `Seq.eq_of_bisim'` for proving two sequences are equal. --- - [x] depends on: #35072 This is a part of the `compute_asymptotics` tactic (#28291). [](https://gitpod.io/from-referrer/) | t-data t-meta awaiting-author | 161/0 | Mathlib/Tactic/ComputeAsymptotics/Multiseries/Corecursion.lean | 1 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues'] | joneugster | 1 | 9 hours ago | 9 hours ago | 28 days |
| 37931 | Vierkantor | chore(Tactic): make the (deprecated) `replace` syntax a `@[tactic_alt]` | This PR replaces the tactic docstring for Mathlib's version of `replace` with a `@[tactic_alt]` attribute + `tactic_extension`. Also update the module docs which did not get updated when `replace` got upstreamed to core Lean. --- [](https://gitpod.io/from-referrer/) | documentation t-meta maintainer-merge | 7/31 | Mathlib/Tactic/Replace.lean | 1 | 2 | ['github-actions', 'joneugster'] | joneugster | 1 | 9 hours ago | 18 days ago | 18 days |
| 37592 | erdOne | feat: set up API for `ConvexSpace` | We introduce `sConvexCombo` and the indexed version `iConvexCombo` as the main API for `ConvexSpace` and prove lemmas around the new definitions. --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 467/157 | Mathlib/Analysis/Convex/MetricSpace.lean,Mathlib/LinearAlgebra/ConvexSpace.lean,Mathlib/LinearAlgebra/ConvexSpace/AffineSpace.lean | 3 | 80 | ['ADedecker', 'YaelDillies', 'b-mehta', 'bryangingechen', 'erdOne', 'faenuccio', 'github-actions', 'grunweg', 'kbuzzard', 'mathlib-bors', 'ocfnash'] | nobody | 1 | 7 hours ago | 1 day ago | 6 days |
| 37545 | vihdzp | feat(SetTheory): ℵ_ univ = univ | --- [](https://gitpod.io/from-referrer/) | t-set-theory maintainer-merge | 74/4 | Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Regular.lean | 2 | 15 | ['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'mattdiamond', 'plp127', 'vihdzp'] | nobody | 2 | 6 hours ago | 10 hours ago | 29 days |
| 37677 | vihdzp | feat: club sets | In set theory, a club set is a subset of an ordinal of uncountable cofinality, which is closed in the order topology, and unbounded within the ordinal. We generalize this notion to that of a club set in a well-order `α`: this is a set which is cofinal and closed under suprema. We recover the more standard notion by setting `α = Iio o`, whenever `ℵ₀ < o.cof`. We prove that club sets are closed under intersections of size less than the cofinality of `α`, and that the fixed points of a normal function are a club set. --- The idea is to eventually rework [`Ordinal.deriv`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/SetTheory/Ordinal/FixedPoint.html#Ordinal.deriv). This is simply the enumerator function for the fixed points of `f`, and enumerator functions for club sets are always normal. - [x] depends on: #37670 [](https://gitpod.io/from-referrer/) | t-set-theory t-order | 158/0 | Mathlib.lean,Mathlib/Order/IsNormal.lean,Mathlib/SetTheory/Cardinal/Club.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean | 4 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'staroperator', 'vihdzp'] | nobody | 1 | 5 hours ago | 5 hours ago | 9 days |
| 38758 | TBUGTB | feat(LinearAlgebra/ConvexSpace): StdSimplex bind operation | Define the monadic bind operation for StdSimplex and add basic API lemmas. This operation is needed for formalising the Komlós lemma used in the construction of Stochastic Integrals (cf. [this PR](https://github.com/RemyDegenne/brownian-motion/pull/399) in the brownian-motion project). | t-algebra new-contributor brownian ready-to-merge | 40/0 | Mathlib/LinearAlgebra/ConvexSpace.lean | 1 | 17 | ['EtienneC30', 'RemyDegenne', 'TBUGTB', 'YaelDillies', 'github-actions', 'mathlib-bors'] | nobody | 1 | 4 hours ago | 4 hours ago | 1 day |
| 34015 | erdOne | feat(AlgebraicGeometry): category of schemes affine over a base | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry maintainer-merge | 522/11 | Mathlib.lean,Mathlib/AlgebraicGeometry/AffineOver.lean,Mathlib/AlgebraicGeometry/Limits.lean,Mathlib/AlgebraicGeometry/Morphisms/Affine.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/AlgebraicGeometry/RelativeGluing.lean,Mathlib/AlgebraicGeometry/Sites/SmallAffineZariski.lean,Mathlib/CategoryTheory/Sites/Hypercover/Subcanonical.lean | 8 | 50 | ['chrisflav', 'dagurtomas', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | chrisflav | 1 | 4 hours ago | 1 day ago | 31 days |
| 36788 | hommmmm | feat(RingTheory): height of span of a prime element is one | ## Summary - Add `Ideal.height_span_singleton_eq_one_of_prime`: in a Noetherian integral domain, the ideal generated by a prime element has height one. ## Notes The new theorem follows directly from `height_le_one_of_isPrincipal_of_mem_minimalPrimes` (upper bound) and the fact that `span {p} ≠ ⊥` for `p` prime (lower bound). --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 20/0 | Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean | 2 | 12 | ['Multramate', 'chrisflav', 'github-actions', 'hommmmm', 'robin-carlier'] | chrisflav | 1 | 3 hours ago | 4 hours ago | 43 days |
| 38170 | maddycrim | feat(Algebra/Module/FinitePresentation): Finitely Presented Module Lemma | From FLT Project Main Definitions: `Module.FinitePresentation.exists_fin_exact` : A finitely presented module M admits an exact sequence F' -> F -> M -> 0 where F' and F are finite free modules. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 9/0 | Mathlib/Algebra/Module/FinitePresentation.lean | 1 | 16 | ['github-actions', 'maddycrim', 'themathqueen', 'vlad902'] | nobody | 1 | 2 hours ago | 10 days ago | 13 days |
| 37893 | abeldonate | feat: Module theory theorems | Added three theorems: - annihilator_sup - torsionOf_eq_annihilator_span_singleton - annihilator_eq_iInf_torsionOf | new-contributor t-algebra delegated | 15/0 | Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean | 2 | 12 | ['abeldonate', 'github-actions', 'mathlib-bors', 'ocfnash', 'scholzhannah', 'wwylele'] | nobody | 1 | 2 hours ago | 2 hours ago | 15 days |
| 38660 | sharky564 | feat(Topology/Homeomorph): add Equiv.IsHomeomorph_iff and LinearEquiv.IsHomeomorph_iff | This PR adds two characterisations of `IsHomeomorph` for bundled equivalences. For a plain `Equiv` between topological spaces, `Equiv.isHomeomorph_iff` states that the equivalence is a homeomorphism if and only if it is continuous in both directions. The corresponding statement for a `LinearEquiv` between topological modules is added as `LinearEquiv.isHomeomorph_iff`, derived from the `Equiv` version. --- The motivation comes from work on topological complements of submodules in PR #38547, where one wants to upgrade a `LinearEquiv` to a `ContinuousLinearEquiv` and the cleanest characterisation is in terms of continuity in both directions. The existing API offers `isHomeomorph_iff_exists_inverse`, but for equivalences this requires manually identifying the existential inverse with `e.symm`, which is unnecessarily indirect. | t-topology new-contributor maintainer-merge | 17/0 | Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Homeomorph/Lemmas.lean | 2 | 8 | ['ADedecker', 'github-actions', 'robin-carlier', 'scholzhannah', 'sharky564'] | mcdoll | 1 | 2 hours ago | 2 days ago | 3 days |
| 38322 | NoahW314 | feat(Algebra/MvPolynomial): add monomial prod lemma | --- [](https://gitpod.io/from-referrer/) | t-algebra | 4/0 | Mathlib/Algebra/MvPolynomial/Basic.lean | 1 | 2 | ['github-actions', 'robin-carlier', 'wwylele'] | nobody | 1 | 1 hour ago | 10 days ago | 10 days |
| 37084 | SnirBroshi | feat(Order/PropInstances): relations and `Subsingleton` | `r = ⊤ ↔ Refl r` and `r = ⊥ ↔ Irrefl r` given `Subsingleton` --- [](https://gitpod.io/from-referrer/) | t-order delegated | 10/1 | Mathlib/Order/PropInstances.lean | 1 | 6 | ['YaelDillies', 'github-actions', 'mathlib-bors', 'ocfnash', 'robin-carlier'] | nobody | 2 | 1 hour ago | 6 hours ago | 35 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 14720 | eric-wieser | refactor: change `CliffordAlgebra.lift` to use quadratic maps | This works towards addressing a footnote on [page 152](https://eric-wieser.github.io/thesis/eric-wieser-thesis.pdf#page=164) of my thesis. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 200/167 | Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Equivs.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Prod.lean,Mathlib/LinearAlgebra/QuadraticForm/Complex.lean,Mathlib/LinearAlgebra/QuadraticForm/Dual.lean,Mathlib/LinearAlgebra/QuadraticForm/Isometry.lean,Mathlib/LinearAlgebra/QuadraticForm/IsometryEquiv.lean,Mathlib/LinearAlgebra/QuadraticForm/Prod.lean,Mathlib/LinearAlgebra/QuadraticForm/QuadraticModuleCat.lean,Mathlib/LinearAlgebra/QuadraticForm/Real.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct/Isometries.lean | 11 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 14889 | yuma-mizuno | feat(CategoryTheory/Bicategory/Monad): define monad in bicategory | --- - [ ] depends on: #12107 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR t-category-theory | 1566/12 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Functor/Oplax.lean,Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean,Mathlib/CategoryTheory/Bicategory/Monad/Adjunction.lean,Mathlib/CategoryTheory/Bicategory/Monad/Basic.lean,Mathlib/CategoryTheory/Bicategory/Monad/Cat.lean,Mathlib/CategoryTheory/Monad/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Coherence.lean,Mathlib/Tactic/Widget/StringDiagram.lean,scripts/noshake.json,test/StringDiagram.lean,widget/src/penrose/monoidal.dsl,widget/src/penrose/monoidal.sty | 14 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 13847 | alreadydone | feat(EllipticCurve): the universal elliptic curve | + Define the universal Weierstrass curve (`Universal.curve`) over the polynomial ring `ℤ[A₁,A₂,A₃,A₄,A₆]`, and the universal pointed elliptic curve (`Universal.pointedCurve`) over the field of fractions (`Universal.Field`) of the universal ring `ℤ[A₁,A₂,A₃,A₄,A₆,X,Y]/⟨P⟩ = Universal.Poly/⟨P⟩` (`Universal.Ring`, where `P` is the Weierstrass polynomial) with distinguished point `(X,Y)`. + Given a Weierstrass curve `W` over a commutative ring `R`, we define the specialization homomorphism `W.specialize : ℤ[A₁,A₂,A₃,A₄,A₆] →+* R`. If `(x,y)` is a point on the affine plane, we define `W.polyEval x y : Universal.Poly →+* R`, which factors through `W.ringEval x y : Universal.Ring →+* R` if `(x,y)` is on `W`. + Introduce the cusp curve `Y² = X³`, on which lies the rational point `(1,1)`, with the nice property that `ψₙ(1,1) = n`, making it easy to prove nonvanishing of the universal `ψₙ` when `n ≠ 0` by specializing to the cusp curve, which shows that `(X,Y)` is a point of infinite order on the universal pointed elliptic curve. --- - [x] depends on: #13845 - [x] depends on: #12883 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-algebraic-geometry | 543/208 | Mathlib.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean | 6 | 4 | ['Multramate', 'alreadydone', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 14036 | adomani | Test/decl diff in lean | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 465/1040 | .github/workflows/Lean_decl_diff.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,.github/workflows/mk_build_yml.sh,scripts/decls_diff_hybrid.sh,scripts/list_decls.lean | 8 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 14167 | alreadydone | feat: Group scheme structure on Weierstrass curve | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-geometry workshop-AIM-AG-2024 | 727/41 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Scheme.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/LinearAlgebra/FreeModule/Basic.lean,Mathlib/RingTheory/AlgebraTower.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean | 12 | 3 | ['Multramate', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 674 days ago | 12 seconds |
| 12952 | adomani | test: length statistics | --- [](https://gitpod.io/from-referrer/) | WIP test-ci | 124/0 | .github/workflows/mathlib_stats.yml,.github/workflows/ml_stats_label.yaml,scripts/mathlib_stats.sh | 3 | 9 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 13297 | urkud | feat(Semicontinuous): add `comp` lemma | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 31/13 | Mathlib/Topology/Semicontinuous.lean | 1 | 3 | ['sgouezel', 'urkud'] | nobody | 1 year ago | 703 days ago | 5 hours |
| 13372 | adomani | dev: generic replacement | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 446/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/ReplaceRefine.lean,Mathlib/Tactic/Replacements.lean | 4 | 4 | ['adomani', 'github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 13512 | adomani | test: count all | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 85/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/Tally.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12416 | adomani | chore: remove some cdots | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 3830/3239 | Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo2006Q5.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2021Q1.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/Partition.lean,Counterexamples/Cyclotomic105.lean,Counterexamples/DirectSumIsInternal.lean,Mathlib.lean,Mathlib/Algebra/Algebra/Spectrum.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/List/Basic.lean,Mathlib/Algebra/Category/GroupCat/Colimits.lean,Mathlib/Algebra/Category/ModuleCat/Images.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/CharP/Quotient.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/DirectLimit.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/GeomSum.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/GroupPower/Order.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/Algebra/Homology/Exact.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean,Mathlib/Algebra/Homology/HomotopyCategory/Triangulated.lean,Mathlib/Algebra/Homology/LocalCohomology.lean,Mathlib/Algebra/Homology/TotalComplex.lean,Mathlib/Algebra/Lie/DirectSum.lean,Mathlib/Algebra/Lie/IdealOperations.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/Weights/Basic.lean,Mathlib/Algebra/Module/DedekindDomain.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Module/LocalizedModule.lean,Mathlib/Algebra/Module/PID.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/Module/Zlattice/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/MonoidAlgebra/Ideal.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Order/Archimedean.lean,Mathlib/Algebra/Order/BigOperators/Group/List.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Int.lean,Mathlib/Algebra/Order/Group/MinMax.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean,Mathlib/Algebra/Polynomial/PartialFractions.lean,Mathlib/Algebra/Polynomial/Reverse.lean,Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/Algebra/Polynomial/UnitTrinomial.lean,Mathlib/Algebra/Quandle.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/FunctionField.lean,Mathlib/AlgebraicGeometry/Gluing.lean,Mathlib/AlgebraicGeometry/Morphisms/Basic.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/AlgebraicGeometry/Properties.lean,Mathlib/AlgebraicGeometry/Pullbacks.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/AlgebraicTopology/SimplexCategory.lean,Mathlib/AlgebraicTopology/SplitSimplicialObject.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/BoundedVariation.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Extend.lean,Mathlib/Analysis/Calculus/InverseFunctionTheorem/ApproximatesLinearOn.lean,Mathlib/Analysis/Calculus/LocalExtr/Basic.lean,Mathlib/Analysis/Calculus/ParametricIntegral.lean,Mathlib/Analysis/Calculus/TangentCone.lean | 608 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12465 | rosborn | style: Change Subtype.val to (↑) | --- This is a test to see replacing `Subtype.val` with `(↑)` where appropriate. After performing the rewrite, some of the types subtly changed in a difficult to detect manner. Before the change, `openEmbedding' _` had type `OpenEmbedding Subtype.val` where `Subtype.val` expanded as `@Subtype.val α fun x ↦ x ∈ U : ↥U → α`. After the change, `Subtype.val` expands to `@Subtype.val α fun x ↦ x ∈ ↑U : { x // x ∈ ↑U } → α`. This caused some later proofs to fail due to the different definition. In a similar case, within the proof of `mfderiv_coe_sphere_injective` on line 553 `Subtype.val` expanded as `@Subtype.val E fun x ↦ x ∈ (Submodule.span ℝ {↑(-v)})ᗮ : ↥(Submodule.span ℝ {↑(-v)})ᗮ → E`. After changing to `(↑)`, it expanded to `@Subtype.val E fun x ↦ x ∈ ↑(Submodule.span ℝ {↑(-v)})ᗮ : { x // x ∈ ↑(Submodule.span ℝ {↑(-v)})ᗮ } → E`. One benefit to using `(↑)` was that it lead to a shorter proof as `ContinuousLinearEquiv.coe_coe` could be removed on line 559. In general, this subtle change in types is basically impossible to detect without a tool like leaff. [](https://gitpod.io/from-referrer/) | merge-conflict | 50/50 | Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/Normed/Group/Hom.lean,Mathlib/CategoryTheory/Generator.lean,Mathlib/CategoryTheory/Limits/Shapes/Types.lean,Mathlib/CategoryTheory/Subobject/Types.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Set/Function.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/Geometry/Manifold/ContMDiff/Basic.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/Geometry/Manifold/LocalInvariantProperties.lean,Mathlib/GroupTheory/Subsemigroup/Operations.lean,Mathlib/LinearAlgebra/LinearIndependent.lean,Mathlib/Order/Directed.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/Order/RelIso/Set.lean,Mathlib/RingTheory/Artinian.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/PGame.lean,Mathlib/SetTheory/Surreal/Basic.lean,Mathlib/Topology/Bornology/Constructions.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean,Mathlib/Topology/Germ.lean,Mathlib/Topology/UniformSpace/Basic.lean,Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean,Mathlib/Topology/UniformSpace/UniformEmbedding.lean | 28 | 1 | ['eric-wieser', 'rosborn'] | nobody | 1 year ago | unknown | 0 seconds |
| 12473 | adomani | first translations | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 424/265 | Mathlib.lean,Mathlib/Order/Lattice.lean,Mathlib/Order/WithBot.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MinMax.lean | 5 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12528 | adomani | test: autotranslations Bot --> Top | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 350/294 | Mathlib.lean,Mathlib/Order/WithBot.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MinMax.lean,test/MinMax.lean | 5 | 0 | [] | nobody | 1 year ago | 731 days ago | 4 seconds |
| 12588 | adomani | remove trailingDegree | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 1280/979 | Mathlib.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Degree/TrailingDegree.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/Mirror.lean,Mathlib/Order/WithBot.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MinMax.lean,Mathlib/Tactic/MinMaxTwo.lean,test/MinMax.lean | 11 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12608 | eric-wieser | feat: allow `nsmul` / `zsmul` to be omitted again, with a warning | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-meta | 118/2 | Mathlib.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DefaultFieldLinter.lean,scripts/noshake.json,test/default_field_linter.lean | 6 | 12 | ['YaelDillies', 'eric-wieser', 'fpvandoorn', 'github-actions'] | nobody | 1 year ago | 712 days ago | 5 days |
| 12637 | adomani | translation: MonoidAlgebra to AddMonoidAlgebra | [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/merge.20Add-MonoidAlgebra) * #12646 was found as a consequence of unification. * #12659 the typo `single 1 1` for `single 0 1`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-meta | 615/986 | Mathlib.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MinMaxTwo.lean,scripts/noshake.json | 7 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12679 | MichaelStollBayreuth | perf(NumberTheory/RamificationInertia): speed up slow file | A repetition of the earlier experiment at [#12412](https://github.com/leanprover-community/mathlib4/pull/12412) with Lean 4.8.0-rc1. This time, I tried not to introduce local instances if possible, but instead to tweak instance priorities. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 57/14 | Mathlib/NumberTheory/RamificationInertia.lean | 1 | 3 | ['MichaelStollBayreuth', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 12984 | adomani | Adomani/periodic reports dev custom action | --- [](https://gitpod.io/from-referrer/) | WIP test-ci | 366/0 | .github/workflows/mathlib_stats.yml,.github/workflows/ml_stats_label.yaml,scripts/count_decls.lean,scripts/mathlib_stats.sh | 4 | 69 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 13057 | alreadydone | feat(NumberTheory): characterize elliptic divisibility sequences | Main results: + Every `normEDS` is an elliptic divisibility sequence (EDS). The key proof is `rel₄_of_anti_oddRec_evenRec`, based on my original argument first published on [MathSE](https://math.stackexchange.com/a/4903422/12932) + Conversely, every EDS is equal to some `normEDS` (assuming that the first two terms are not zero divisors) --- - [ ] depends on: #13155 - [x] depends on: #13153 - [x] depends on: #10843 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-number-theory blocked-by-other-PR | 1032/55 | Mathlib/Algebra/Ring/NegOnePow.lean,Mathlib/Data/Int/Defs.lean,Mathlib/Data/Int/Parity.lean,Mathlib/GroupTheory/Perm/Sign.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 5 | 6 | ['Multramate', 'alreadydone', 'kbuzzard', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 707 days ago | 9 hours |
| 12192 | Ruben-VandeVelde | feat: generalize isLittleO_const_id_atTop/atBot | From PNT+. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 10/4 | Mathlib/Analysis/Asymptotics/Asymptotics.lean | 1 | 6 | ['Ruben-VandeVelde', 'llllvvuu', 'urkud'] | nobody | 1 year ago | 743 days ago | 1 day |
| 10024 | ADedecker | feat: rename `connectedComponentOfOne` to `identityComponent`, prove that it is normal and open | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology awaiting-CI | 58/24 | Mathlib/FieldTheory/AbsoluteGaloisGroup.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Algebra/Group/TopologicalAbelianization.lean,Mathlib/Topology/Algebra/OpenSubgroup.lean,Mathlib/Topology/Connected/Basic.lean | 5 | 0 | [] | nobody | 1 year ago | 826 days ago | 13 minutes |
| 10521 | eric-wieser | chore: generalize `IsBoundedLinearMap` to modules | Most of the lemmas don't actually need the normed on the scalars at all. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 58/42 | Mathlib/Analysis/NormedSpace/BoundedLinearMaps.lean | 1 | 3 | ['github-actions', 'j-loreaux', 'urkud'] | nobody | 1 year ago | 806 days ago | 1 day |
| 10594 | lecopivo | feat: `fun_trans` function transformation tactic e.g. for computing derivatives | feat: `fun_trans` function transformation tactic e.g. for computing derivatives Function transformation tactic/simproc. For example it can be used for computing derivatives. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 1819/56 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Elab.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/MorExt.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunTrans/Attr.lean,Mathlib/Tactic/FunTrans/Core.lean,Mathlib/Tactic/FunTrans/Decl.lean,Mathlib/Tactic/FunTrans/Elab.lean,Mathlib/Tactic/FunTrans/Theorems.lean,Mathlib/Tactic/FunTrans/Types.lean,test/fun_prop2.lean,test/fun_prop_dev.lean,test/fun_trans_dev.lean | 17 | 11 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 10721 | urkud | feat(Order/FunLike): define `PointwiseLE` | - introduce a mixin class `DFunLike.PointwiseLE`, use it to define `DFunLike.instPartialOrder`; - add a generic `DFunLike.orderEmbeddingCoe` - add `DFunLike.PointwiseLE` instances here and there. With this refactor and #13022, I'm going to generalize lemmas like `MeasureTheory.ae_mono` to `OuterMeasureClass`. --- - [x] depends on: #12983 [](https://gitpod.io/from-referrer/) | merge-conflict t-order t-logic | 123/50 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Ring.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/GroupTheory/Congruence.lean,Mathlib/Order/FunLike.lean,Mathlib/Order/Heyting/Hom.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Hom/Bounded.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Topology/Order/Hom/Basic.lean | 13 | 48 | ['YaelDillies', 'dupuisf', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 689 days ago | 64 days |
| 10845 | Shamrock-Frost | Refactor: Make MonoidalFunctor carry the data of an inverse | We change the definition of a strong monoidal functor from a lax monoidal functor for which the unitor and tensorator are `IsIso` to a lax monoidal functor with the data of inverses for the unitor and tensorator. This requires fixing a lot of knock on effects. --- This is a **draft PR**. I would like to talk with people on zulip before merging it, and plan ahead to when we have oplax/colax monoidal functors as well. I'm not sure the approach I took here where `MonoidalFunctor` inherits from `LaxMonoidalFunctor` is a good choice if we want to be lax/oplax symmetric. [](https://gitpod.io/from-referrer/) | merge-conflict WIP RFC t-category-theory | 3799/1589 | Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Homology/HomotopyCategory/DegreewiseSplit.lean,Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Adjunction/Mates.lean,Mathlib/CategoryTheory/Adjunction/Opposites.lean,Mathlib/CategoryTheory/Adjunction/Prod.lean,Mathlib/CategoryTheory/Adjunction/Whiskering.lean,Mathlib/CategoryTheory/Bicategory/End.lean,Mathlib/CategoryTheory/Bicategory/SingleObj.lean,Mathlib/CategoryTheory/CatCommSq.lean,Mathlib/CategoryTheory/CatSquares.lean,Mathlib/CategoryTheory/Enriched/Basic.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Monoidal/Adjunction.lean,Mathlib/CategoryTheory/Monoidal/Braided.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/CommMon_.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/CategoryTheory/Monoidal/End.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/Limits.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/NaturalTransformation.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Rigid/FunctorCategory.lean,Mathlib/CategoryTheory/Monoidal/Rigid/OfEquivalence.lean,Mathlib/CategoryTheory/Monoidal/Subcategory.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/CategoryTheory/Monoidal/Types/Basic.lean,Mathlib/CategoryTheory/Opposites.lean,Mathlib/CategoryTheory/Products/Associator.lean,Mathlib/CategoryTheory/Products/Basic.lean,Mathlib/CategoryTheory/Shift/Basic.lean,Mathlib/CategoryTheory/Shift/Pullback.lean,Mathlib/CategoryTheory/Whiskering.lean,Mathlib/RepresentationTheory/Action/Monoidal.lean,Mathlib/RepresentationTheory/GroupCohomology/Resolution.lean,Mathlib/RepresentationTheory/Rep.lean | 41 | 7 | ['Shamrock-Frost', 'joelriou'] | nobody | 1 year ago | unknown | 0 seconds |
| 11100 | eric-wieser | feat(CategoryTheory/Limits): add `Functor.mapBinaryBiconeInv` | --- - [ ] depends on: #11130 [](https://gitpod.io/from-referrer/) It's tempting to try to prove something like ```lean theorem Functor.mapBinaryBiconeInv_toCone [Limits.HasZeroMorphisms C] [Limits.HasZeroMorphisms D] (e : D ⥤ C) [IsEquivalence e] {X Y : D} (b : BinaryBicone (e.obj X) (e.obj Y)) : (e.mapBinaryBiconeInv b).toCone = (e.mapConeInv <| (Cones.postcompose (pairComp X Y e).symm.hom).obj b.toCone) := by simp sorry theorem Functor.mapBinaryBiconeInv_toCocone [Limits.HasZeroMorphisms C] [Limits.HasZeroMorphisms D] (e : D ⥤ C) [IsEquivalence e] {X Y : D} (b : BinaryBicone (e.obj X) (e.obj Y)) : (e.mapBinaryBiconeInv b).toCocone = (e.mapCoconeInv <| (Cocones.precompose (pairComp X Y e).hom).obj b.toCocone) := by sorry ``` but maybe equality is evil here | merge-conflict t-category-theory awaiting-CI | 52/0 | Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/Limits/Preserves/Shapes/Biproducts.lean | 3 | 6 | ['TwoFX', 'eric-wieser', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8503 | thorimur | feat: meta utils for `refine?` | This PR introduces some metaprogramming infrastructure and utilities that are necessary for `refine?` (#8364). * `elabTermWithHoles'` (and `withCollectingNewGoalsFrom'`): a more configurable version of `elabTermWithHoles`, which allows: preserving the initial mvar type; *not* tagging untagged goals; and postponing mvars. * Some `Syntax` and `TSyntax` functionality, including: * `TSyntax.map`(`M`), for acting on `TSyntax` with functions `f : Syntax -> (m) Syntax` * Range operations: `includes` and `isEqByRange` * `setTrailingInfoBy?` and `unsetOriginalTrailing`, which is like `unsetTrailing`, but behaves as expected. * `Term.withoutModifyingState`, which does not allow unknown mvarIds to escape via the infotree * `hasNewErrors`, which runs a monad computation and returns the value along with `true` or `false` depending on whether new error messages have been logged * the option `pp.anonymousMVarSuffixes`, which can be set to `false` to replace all numeric suffixes of anonymous mvars with `✝`, which is useful in tandem with `#guard_msgs` for tests (but is essentially a workaround—although it can make some tactic states more legible). --- I'm open to suggestions on the location and name of the option/delaborator used for trimming the numeric suffixes of anonymous mvar names (which is used in the tests)—including whether or not it should exist in the first place, as it's essentially just a workaround. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 312/5 | Mathlib.lean,Mathlib/Lean/CoreM.lean,Mathlib/Lean/Elab/Tactic/ElabTerm.lean,Mathlib/Lean/Elab/Term.lean,Mathlib/Util/Delaborators.lean,Mathlib/Util/Syntax.lean | 6 | 2 | ['kmill', 'thorimur'] | kmill | 1 year ago | 856 days ago | 38 days |
| 8519 | eric-wieser | refactor(LinearAlgebra/TensorProduct): golf using `liftAddHom` | This new `TensorProduct.liftAddHom` doesn't require bilinearity, only that scalar multiplication can be moved between the arguments. While in theory we only need the `AddMonoidHom` version as it offers exactly the same generality, we first provide an unbundled `liftFun` as this seems to give a sizeable performance boost if used in downstream `lift` variants. --- - [x] depends on: #8571 - [x] depends on: #8584 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 53/50 | Mathlib/Algebra/Category/AlgebraCat/Monoidal.lean,Mathlib/LinearAlgebra/TensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean | 3 | 28 | ['bustercopley', 'eric-wieser', 'jcommelin', 'jjaassoonn', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib-bors'] | nobody | 1 year ago | 879 days ago | 5 days |
| 8582 | eric-wieser | wip | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 3/7 | Mathlib/Algebra/Category/AlgebraCat/Monoidal.lean,Mathlib/LinearAlgebra/TensorProduct.lean | 2 | 4 | ['eric-wieser', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8616 | eric-wieser | feat(Algebra/FreeAlgebra): add right action and `IsCentralScalar` | --- - [ ] depends on: #8652 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI | 30/8 | Mathlib/Algebra/FreeAlgebra.lean | 1 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 886 days ago | 2 days |
| 8658 | eric-wieser | feat: support right actions for `Con` | This adds a new `Con.CompatibleSMul` typeclass that captures exactly the condition when `smul` descends to the quotient. I was not quite able to merge this with `MulAction.QuotientAction`: * The imports are such that the congruence relation `QuotientGroup.con` is not yet available in that file * `QuotientGroup.con` requires the subgroup to be normal, while `MulAction.QuotientAction` does not --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 80/18 | Mathlib/GroupTheory/Congruence.lean,Mathlib/RingTheory/Congruence.lean | 2 | 6 | ['YaelDillies', 'eric-wieser'] | nobody | 1 year ago | 856 days ago | 29 days |
| 8788 | FMLJohn | feat(Algebra/Module/GradeZeroModule): if `A` is a graded semiring and `M` is a graded `A`-module, then each grade of `M` is a module over the 0-th grade of `A`. | --- - [ ] depends on: #8187 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 237/4 | Mathlib.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean | 6 | 4 | ['FMLJohn', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 879 days ago | 1 day |
| 8906 | jjaassoonn | feat: add some missing lemmas about linear algebra | --- - [ ] depends on: #8905 [lifting injective modules to higher universe] [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 45/1 | Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Module/Injective.lean,Mathlib/LinearAlgebra/Basic.lean,Mathlib/LinearAlgebra/BilinearMap.lean | 4 | 21 | ['AntoineChambert-Loir', 'alreadydone', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 875 days ago | 5 minutes |
| 8961 | eric-wieser | refactor: use the coinduced topology on ULift | --- - [x] depends on: #8958 [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict awaiting-author awaiting-CI | 46/14 | Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Topology/Bornology/Constructions.lean,Mathlib/Topology/Constructions.lean | 3 | 6 | ['eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 872 days ago | 1 second |
| 9146 | laughinggas | feat(Data/ZMod/Defs): Topological structure on `ZMod` | Added a discrete topology structure to `ZMod n` for all `n` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-topology | 55/3 | Mathlib.lean,Mathlib/Topology/Algebra/Constructions.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Instances/ZMod.lean,Mathlib/Topology/Maps.lean | 5 | 61 | ['YaelDillies', 'eric-wieser', 'github-actions', 'jcommelin', 'laughinggas', 'mo271', 'urkud'] | nobody | 1 year ago | 845 days ago | 7 days |
| 9229 | eric-wieser | refactor(Algebra/GradedMonoid): Use `HMul` to define `GMul` | This make the notation much nicer, but I'm pretty sure this is a bad idea for performance / ambiguity reasons. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 114/125 | Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/DirectSum/Ring.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/GradedMulAction.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/MonoidAlgebra/ToDirectSum.lean,Mathlib/LinearAlgebra/TensorAlgebra/ToTensorPower.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean | 11 | 6 | ['eric-wieser', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9252 | astrainfinita | chore: remove redundant covariance instances, add priority | I noticed that the following code is surprisingly slow. ``` lean import Mathlib count_heartbeats in example {n : ℕ} : CovariantClass (Fin (n + 1)) (Fin (n + 1)) (· + ·) (· < ·) := by try infer_instance sorry ``` This PR removed some redundant instances. The heartbeats have dropped from 19118 to 11450 (still too slow). Lean4 still seems to make some redundant attempts. See also https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1691792488. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-order merge-conflict slow-typeclass-synthesis awaiting-author | 40/32 | Mathlib/Algebra/CovariantAndContravariant.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/CategoryTheory/Abelian/DiagramLemmas/Four.lean | 4 | 8 | ['astrainfinita', 'leanprover-bot', 'urkud'] | nobody | 1 year ago | unknown | 0 seconds |
| 9354 | chenyili0818 | feat: monotonicity of gradient on convex real-valued functions | This file is based on Mathlib.Analysis.Calculus.Gradient.Basic, and describes the calculation properties co-authored-by: Ziyu Wang [tropicalfish910@gmail.com](mailto:tropicalfish910@gmail.com) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 540/0 | Mathlib.lean,Mathlib/Analysis/Convex/ConvexFunction.lean | 2 | 15 | ['github-actions', 'winstonyin'] | nobody | 1 year ago | 829 days ago | 23 days |
| 9356 | alexjbest | feat: assumption? | A little helper for replacing `assumption`s with `exact` statements quickly --- If this is approved I will add tests This begs the question of whether it might simply be better to add some sort of code action for "replace with trythis output" [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 24/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/TryAssumption.lean | 4 | 5 | ['alexjbest', 'j-loreaux', 'jcommelin'] | nobody | 1 year ago | 833 days ago | 19 days |
| 9469 | dupuisf | feat: maximum modulus principle for functions vanishing at infinity | This PR adds versions of the maximum modulus principle for functions vanishing at infinity that parallel those we already had for functions over a bounded set. These will have applications in e.g. norm interpolation. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-analysis | 71/0 | Mathlib/Analysis/Complex/AbsMax.lean | 1 | 8 | ['dupuisf', 'j-loreaux'] | nobody | 1 year ago | 833 days ago | 12 days |
| 9482 | yuma-mizuno | refactor(CategoryTheory/Monoidal): add `LaxMonoidalStruct` | Add a `LaxMonoidalStruct` with only the unit morphism `ε` and the tensorator `μ`. This is used in #6307 to provide two different constructors for `LaxMonoidal` that have common `ε` and `μ` but use the tensor of morphisms or the whiskerings. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 21/8 | Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/CategoryTheory/Monoidal/Functorial.lean,Mathlib/CategoryTheory/Monoidal/Limits.lean | 3 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 9487 | eric-wieser | feat: the exponential of dual numbers over non-commutative rings | This is a work in progress, as I don't know my way around the measure theory library. --- - [x] depends on: #9489 - [x] depends on: #9486 - [x] depends on: #10427 - [ ] depends on: #10452 [](https://gitpod.io/from-referrer/) | WIP t-algebra t-measure-probability merge-conflict t-analysis | 97/0 | Mathlib/Analysis/NormedSpace/TrivSqZeroExt.lean | 1 | 7 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9504 | alreadydone | chore: remove some IsSeparable assumptions | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 41/14 | Mathlib/NumberTheory/NumberField/Norm.lean,Mathlib/RingTheory/Norm.lean | 2 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 9510 | eric-wieser | feat(Analysis/Calculus/DualNumber): Extending differentiable functions to dual numbers | This shows that this operation preserves multiplication and composition --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-analysis awaiting-CI | 119/0 | Mathlib/Analysis/Calculus/DualNumber.lean | 1 | 4 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 9570 | eric-wieser | feat(Algebra/Star): Non-commutative generalization of `StarModule` | [Zulip thread](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Star.20modules.20over.20non-commutative.20scalars/near/383664005). Until we address #7152, we have to have both `StarModule` and `StarModule'`. To prove this generalization is useful, this shows that with it as an assumption, `TrivSqZeroExt` is a `StarRing`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra awaiting-CI | 66/6 | Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/Pi.lean,Mathlib/Algebra/Star/Prod.lean,Mathlib/Algebra/TrivSqZeroExt.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 9642 | eric-wieser | refactor(Analysis/Normed/{Group/Field}/Basic): Let `extends` generate the repeated fields | New-style structure shenanigans mean that instance constructors randomly complain about a missing field that can be found with `__ : MetricSpace _ := infer_instance`. --- [](https://gitpod.io/from-referrer/) I will write a longer PR description for this once CI is happy | WIP merge-conflict awaiting-author help-wanted t-analysis | 122/202 | Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Matrix.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Completion.lean,Mathlib/Analysis/Normed/Order/Basic.lean,Mathlib/Analysis/NormedSpace/ProdLp.lean,Mathlib/Analysis/NormedSpace/Star/Matrix.lean,Mathlib/Analysis/NormedSpace/Unitization.lean,Mathlib/Analysis/Quaternion.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/InformationTheory/Hamming.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean | 17 | 11 | ['eric-wieser', 'leanprover-bot', 'urkud'] | nobody | 1 year ago | unknown | 0 seconds |
| 6580 | adomani | chore: `move_add`-driven replacements | This PR accompanies #6576 and uses `move_add/mul` to simplify/streamline a selection of proofs. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 12/13 | Counterexamples/Monic_nonRegular.lean,Mathlib/Algebra/Associated.lean,Mathlib/Data/Polynomial/RingDivision.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | 4 | 0 | [] | nobody | 1 year ago | 925 days ago | 62 days |
| 6630 | MohanadAhmed | feat: Reduced Spectral Theorem | For A hermitian matrix $A : n \times n$ with rank $A.rank \leq n$, we can eliminate the zero eigenvalues and their corresponding eigenvectors from the (alternate) spectral theorem. As such the matrix $A$ can be written as: $$A = V₁ D V₁ᴴ$$ where - $V₁$ : $n \times r$ is the matrix of eigenvector with non-zero associated eigenvalues. - $D$ is $r \times r$ is the diagonal matrix containing only non-zero eigenvalues on its main diagonal. with $r = A.rank$ being the rank of the matrix Towards that goal we make several equivalence definitions: - `{i // hA.eigenvalues i ≠ 0} ≃ Fin (A.rank)` the set of non-zero eigenvalues can be indexed by the numbers from 0 to (r - 1). - `{i // ¬ hA.eigenvalues i ≠ 0} ≃ Fin (n - A.rank)` the set of non-zero eigenvalues can be indexed by the numbers from 0 to (n - r - 1). - `{i // hA.eigenvalues i ≠ 0} ⊕ {i // ¬hA.eigenvalues i ≠ 0} ≃ n`: the index set of the matrix (together with the associated eigenvector matrix and eigenvalues matrix ) can be partitioned into two complement groups the ones corresponding to non-zero eigenvalues and the ones corresponding to zero eigenvalues. - We can then put the previous definitions together to obtain a: `Fin (A.rank) ⊕ Fin (Fintype.card n - A.rank) ≃ n` --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 31/0 | Mathlib/LinearAlgebra/Matrix/Spectrum.lean | 1 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6791 | eric-wieser | refactor: Use flat structures for morphisms | This restores the symmetry we had in Lean3, where we had `MonoidHom.mk f one mul` not `MonoidHom.mk (OneHom.mk f one) mul`, and `f.toFun` wasn't notation for `f.toMulHom.toFun`. The nesting provided by the previous inheritance is useless to us in the face of `MonoidHomClass.toMonoidHom`, which completely eta-expands the structure anyway. We call the class `FunLikeFlatHack._` because this means the field is called `to_` which uses up less space in the goal view than any alternative. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted awaiting-CI | 174/201 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Category/GroupCat/ZModuleEquivalence.lean,Mathlib/Algebra/Category/GroupWithZeroCat.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/MonCat/Basic.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/Hom/Equiv/Basic.lean,Mathlib/Algebra/Hom/Group/Defs.lean,Mathlib/Algebra/Hom/GroupAction.lean,Mathlib/Algebra/Hom/NonUnitalAlg.lean,Mathlib/Algebra/Hom/Ring/Defs.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Module/Equiv.lean,Mathlib/Algebra/Module/LinearMap.lean,Mathlib/Algebra/Order/Hom/Ring.lean,Mathlib/Algebra/Order/Interval.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Analysis/Normed/Group/SemiNormedGroupCat.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Data/Rat/Cast/CharZero.lean,Mathlib/Data/Real/EReal.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/LinearAlgebra/Quotient.lean,Mathlib/LinearAlgebra/TensorProduct.lean,Mathlib/RingTheory/RingInvo.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/MetricSpace/Dilation.lean | 32 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6930 | kmill | feat: `resynth_instances` tactic for resynthesizing instances in the goal or local context | This tactic can be useful for debugging non-canonical instances or for fixing up goals and hypotheses after using the `classical` tactic. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 327/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ResynthInstances.lean,test/ResynthInstances.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6931 | urkud | refactor(Analysis/Normed*): use `RingHomIsometric` for `*.norm_cast` | --- I don't understand why linter fails. [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted t-analysis | 78/68 | Mathlib/Analysis/LocallyConvex/ContinuousOfBounded.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/NormedSpace/Basic.lean,Mathlib/Analysis/NormedSpace/Exponential.lean,Mathlib/Analysis/NormedSpace/Spectrum.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/NumberTheory/NumberField/Embeddings.lean | 8 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 7225 | jjaassoonn | some random stuff | - Consider two commutative rings `R` and `S` and `X` and `(R, S)`-bimodule. Consider the tensor functor `(X ⊗[R] .)` from the category of `R`-modules to the category of `S`-modules and the hom functor `X →ₗ[S] .` from the category of `S`-modules to the category of `R`-modules, they form an adjunction. - direct limits of modules commute with tensor product - A proof of  Three definitions for flatness: 1. in terms of injectiveness ```lean def Flat.injective : Prop := ∀ ⦃N N' : ModuleCat.{u} R⦄ (L : N ⟶ N'), Function.Injective L → Function.Injective ((tensorRight (ModuleCat.of R M)).map L) ``` 2. in terms of ideals ```lean def Flat.ideal : Prop := ∀ (I : Ideal R), Function.Injective (TensorProduct.lift ((lsmul R M).comp I.subtype)) ``` 3. in terms of finitely generated ideal ```lean def Flat.fg_ideal : Prop := ∀ ⦃I : Ideal R⦄ (_ : I.FG), Function.Injective (TensorProduct.lift ((lsmul R M).comp I.subtype)) ``` and they are all equivalent: ```lean lemma tfae : List.TFAE [ Flat.injective R M, Flat.ideal R M, Flat.fg_ideal R M ] := by ``` The dependencies between these changed files are: ``` Algebra.Module.LinearMap--------------------------------- | | | | v v Algebra.Category.ModuleCat.TensorProduct -----> Algebra.Character | | | v Algebra.DirectLimitAndTensorProduct -------------> RingTheory.Flat ``` to prove equivalence of other definitions, e.g. exact functor, tor, etc should be easier with this because the proof is will be categorical --- ------------- Some other stuff not about flatness 1. If $S$ is a submonoid and $I$ is maximally disjoint from $S$ then $I$ is prime 2. if $\mathfrak p$ is a minimal prime, then $x \in \mathfrak p$ implies that $x$ is a zero divisor 3. Noetherian rings has only finitely many minimal ideals 4. One version of [the prime avoidance lemma](https://en.wikipedia.org/wiki/Prime_avoidance_lemma): if $E$ is an addsubgroup of a ring and is mutiplicatively closed, and $\mathfrak p_i$ is some prime ideals, then not being any subset of the individual prime ideal implies that not being a subset of their union ---------- [](https://gitpod.io/from-referrer/) | merge-conflict | 1828/16 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/TensorProduct.lean,Mathlib/Algebra/Character.lean,Mathlib/Algebra/DirectLimitAndTensorProduct.lean,Mathlib/Algebra/Module/LinearMap.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/Noetherian.lean,Mathlib/CategoryTheory/Functor/Fin.lean,Mathlib/CategoryTheory/ShortExactSequence.lean,Mathlib/RingTheory/Flat.lean,Mathlib/RingTheory/Ideal/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime.lean,Mathlib/RingTheory/Ideal/PrimeAvoidance.lean | 13 | 6 | ['eric-wieser', 'jjaassoonn'] | nobody | 1 year ago | unknown | 0 seconds |
| 7227 | kmill | feat: flexible binders and integration into notation3 | Introduces `flexibleBinders`, which is an extensible system for binder notations that allow destructuring, bounded domains, and other niceties. Integrates this into `notation3`, and makes `Finset.sum`/`Finset.prod` use it. --- - [ ] depends on: #6833 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 1215/131 | Mathlib.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/NatAntidiagonal.lean,Mathlib/Mathport/Notation.lean,Mathlib/Util/FlexibleBinders.lean,Mathlib/Util/FlexibleBindersFinset.lean,Mathlib/Util/SyntaxFun.lean,test/FlexibleBinders.lean,test/notation3.lean | 10 | 3 | ['eric-wieser', 'kmill', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 7351 | shuxuezhuyi | feat(Topology/Algebra/Order): extend function on `Ioo` to `Icc` | Extend a strictly monotone function defined on an open interval. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-order | 59/0 | Mathlib.lean,Mathlib/Data/Set/Function.lean,Mathlib/Topology/Algebra/Order/IccExtendFromIoo.lean | 3 | 7 | ['j-loreaux', 'shuxuezhuyi'] | nobody | 1 year ago | 918 days ago | 30 days |
| 7467 | ADedecker | feat: spectrum of X →ᵇ ℂ is StoneCech X | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 121/23 | Mathlib/Analysis/NormedSpace/Star/BoundedContinuousFunction.lean,Mathlib/Analysis/NormedSpace/Star/GelfandDuality.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/ContinuousFunction/Compact.lean | 4 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 7512 | Komyyy | perf: override the data structures of coinductive types | The data structures of the model of coinductive types (`Stream'`, `Computation`, `Stream'.Seq`) are inefficient, so we override their data structures. --- - [x] depends on: #7514 - [ ] depends on: leanprover/lean4#2292 - [x] depends on: leanprover/std4#371 - [x] depends on: #8460 [](https://gitpod.io/from-referrer/) | WIP blocked-by-core-PR blocked-by-other-PR merge-conflict t-meta | 6919/3700 | Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Basic.lean,Mathlib/Algebra/ContinuedFractions/Computation/ApproximationCorollaries.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/Computation/Basic.lean,Mathlib/Algebra/ContinuedFractions/Computation/CorrectnessTerminating.lean,Mathlib/Algebra/ContinuedFractions/Computation/TerminatesIffRat.lean,Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean,Mathlib/Algebra/ContinuedFractions/ContinuantRecurrence.lean,Mathlib/Algebra/ContinuedFractions/EvalEquiv.lean,Mathlib/Algebra/ContinuedFractions/Real.lean,Mathlib/Algebra/ContinuedFractions/TerminatedStable.lean,Mathlib/Algebra/ContinuedFractions/Translations.lean,Mathlib/Combinatorics/Hindman.lean,Mathlib/Control/Fix.lean,Mathlib/Control/LawfulFix.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/Seq/Parallel.lean,Mathlib/Data/Seq/Seq.lean,Mathlib/Data/Seq/WSeq.lean,Mathlib/Data/Stream.lean,lean-toolchain | 22 | 2 | ['digama0', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 7564 | shuxuezhuyi | feat(Topology/Algebra/Order): extend strictly monotone function on `Ioo` to homeomorphism on `Icc` | A strictly monotone function between open intervals can be extended to a homeomorphism between the closed intervals. --- - [ ] depends on: #7351 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR | 162/0 | Mathlib.lean,Mathlib/Topology/Algebra/Order/IccExtendFromIoo.lean | 2 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 937 days ago | 8 minutes |
| 7601 | digama0 | feat: ring hom support in `ring` | As [requested on Zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/aroots/near/395750055). Adds support for distributing ring morphisms in `ring`: ```lean example (p : ℤ[X]) (r : ℤ) : C (2 * r) * p = C r * p + C r * p := by ring ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-meta | 257/48 | Mathlib/Tactic/Ring/Basic.lean,test/linear_combination.lean,test/ring.lean | 3 | 1 | ['eric-wieser'] | nobody | 1 year ago | 872 days ago | 62 days |
| 7615 | eric-wieser | chore(LinearAlgebra/Basic): generalize compatibleMaps to semilinear maps | Spotted while reviewing #7611 --- - [x] depends on: #7611 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra easy awaiting-CI | 9/33 | Mathlib/LinearAlgebra/Basic.lean | 1 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 933 days ago | 1 second |
| 7713 | RemyDegenne | feat: add_left/right_inj for measures | `μ + ν₁ = μ + ν₂ ↔ ν₁ = ν₂`, and similarly on the right. This is not true in general for measures, but is true when `μ` is mutually singular with the two other measures or when `μ` is finite. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 53/1 | Mathlib/MeasureTheory/Measure/MutuallySingular.lean,lean-toolchain | 2 | 6 | ['RemyDegenne', 'digama0', 'eric-wieser', 'fpvandoorn'] | nobody | 1 year ago | 927 days ago | 17 hours |
| 7835 | shuxuezhuyi | feat(LinearAlgebra/Matrix): `lift` for projective special linear group | We provide converters to help with the use of "quotient.liftOn" on projective special linear groups. --- - [x] depends on: #7826 - [x] depends on: #7791 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 52/0 | Mathlib/LinearAlgebra/Matrix/ProjectiveSpecialLinearGroup.lean | 1 | 3 | ['jcommelin', 'leanprover-community-mathlib4-bot', 'shuxuezhuyi'] | jcommelin | 1 year ago | 785 days ago | 1 day |
| 7875 | astrainfinita | chore: make `SMulCommClass A A B` and `SMulCommClass A B B` higher priority | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 54/48 | Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/Ring/CentroidHom.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/NormedSpace/lpSpace.lean,Mathlib/Data/Matrix/Basic.lean,Mathlib/GroupTheory/GroupAction/Prod.lean,Mathlib/GroupTheory/GroupAction/Ring.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/GroupTheory/Submonoid/Center.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/Topology/ContinuousFunction/ContinuousMapZero.lean,Mathlib/Topology/ContinuousFunction/StoneWeierstrass.lean,Mathlib/Topology/ContinuousFunction/ZeroAtInfty.lean | 27 | 15 | ['Parcly-Taxel', 'astrainfinita', 'jcommelin', 'leanprover-bot'] | nobody | 1 year ago | 693 days ago | 1 day |
| 7932 | eric-wieser | refactor(Algebra/TrivSqZeroExt): replace with a structure | This is dogfooding my claim that "one-field structures are the lesser evil in Lean 4". This runs into the `simp [(stupid_parens)]` bug; or rather, a particular nasty instance of it where the offending simp call is inside `@[simps]`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI | 155/73 | Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/TrivSqZeroExt.lean,Mathlib/Logic/Equiv/TransferInstance.lean,Mathlib/Topology/Instances/TrivSqZeroExt.lean | 4 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 7962 | eric-wieser | feat: `DualNumber (Quaternion R)` as a `CliffordAlgebra` | This provides a clifford algebra isomorphic to the dual quaternions --- - [x] depends on: #7934 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 307/7 | Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/QuaternionBasis.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Equivs.lean | 3 | 16 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8364 | thorimur | feat: `refine?` | This PR adds `refine? e`, which suggests replacing unsynthesized `_`'s in `e` with `?_` in order to make `refine e'` work: ```lean example : Nat → Nat := by refine? fun (_ : _) => _ -- Try this: refine fun (_ : _) => ?_ ``` Note that this only suggests replacements for `_`'s present in the syntax; to create goals for implicit or instance arguments, the user is expected to use `refine'`. --- I'm especially open to suggestions on the filename (currently `RefineFix`). I'm also curious if this behaves as expected! Feel free to try it out "in real life" and comment here on edge cases. - [ ] depends on: #8503 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-meta | 684/5 | Mathlib.lean,Mathlib/Lean/CoreM.lean,Mathlib/Lean/Elab/Tactic/ElabTerm.lean,Mathlib/Lean/Elab/Term.lean,Mathlib/Tactic.lean,Mathlib/Tactic/RefineFix.lean,Mathlib/Util/Delaborators.lean,Mathlib/Util/Syntax.lean,test/RefineFix.lean | 9 | 5 | ['j-loreaux', 'leanprover-community-mathlib4-bot', 'thorimur'] | nobody | 1 year ago | 894 days ago | 6 days |
| 3575 | Kha | perf: selectively enable precompilation | --- This is an initial performance test on Linux. TODO: - [ ] test on macOS and Windows as well - [ ] adapt caching | merge-conflict WIP | 3/0 | lakefile.lean | 1 | 21 | ['Kha', 'kim-em', 'leanprover-bot', 'tydeu'] | nobody | 1 year ago | unknown | 0 seconds |
| 4771 | thorimur | feat: Backtrack minimize | Utilities for backtracking in order to attain a minimum according to some arbitrary notion of size when generating lists of parts and alternatives in alternating fashion. Motivated by minimizing the number of generated subgoals under apply-like actions on the goal. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 482/1 | Mathlib/Tactic/Backtracking.lean,test/Backtracking.lean | 2 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 4775 | thorimur | feat: `SubExpr` utilities | This file contains utilities for handling positions in expressions, including folding over subexpressions along with their positions. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 148/0 | Mathlib.lean,Mathlib/Lean/SubExpr.lean | 2 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 4785 | thorimur | feat: ExprWithLevels | This introduces `ExprWithLevels`, a means of emulating universe polymorphism for non-constants during metaprogramming. [Description pending] - [ ] depends on: #4786 --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-meta | 491/1 | Mathlib.lean,Mathlib/Lean/Meta/AppBuilder.lean,Mathlib/Lean/Meta/Basic.lean,Mathlib/Lean/Meta/ExprWithLevels.lean | 4 | 1 | ['kim-em'] | nobody | 1 year ago | unknown | 0 seconds |
| 4871 | j-loreaux | feat: define the additive submonoid of positive elements in a star ordered ring | This file defines the `AddSubmonoid` of nonegative elements `StarOrderedRing.positive R` in a star ordered ring `R` with carrier `{ x : R | 0 ≤ x }` (in fact, the definition only requires `OrderedAddCommMonoid R` to allow for other use cases, but it is primarily intended for `StarOrderedRing R`). Equivalently, this is the `AddSubmonoid` generated by the elements of the form `star s * s`. Even though this technically corresponds to the nonnegative elements, the "positive" terminology is standard throughout the literature (at least in C⋆-algebra theory and operator theory), so we choose to prefer that. The advantage of using this over other definitions of positivity is that it allows us to unify several different concepts under a single umbrella. For example, one might be tempted to consider the collection of bounded linear operators on an Hilbert space and define positivity as `∀ x, 0 ≤ ⟪T x, x⟫`, but this doesn't generalize nicely to C⋆-algebras. Alternatively, one could define positivity as those self-adjoint elements with nonnegative spectrum, but this requires the algebra to be unital. Our definition herein conveniently sidesteps these issues. --- Note: I declared the `AddMonoidWithOne` and `AddGroupWithOne` instances for `selfAdjoint R` separately because it made the proof of the latter easier. - [x] depends on: #6229 - [x] depends on: #10209 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI | 216/12 | Mathlib.lean,Mathlib/Algebra/Order/Ring/CharZero.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Star/Positive.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/GroupTheory/Submonoid/Operations.lean | 6 | 28 | ['eric-wieser', 'j-loreaux', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 1052 days ago | 5 days |
| 5133 | kmill | feat: IntermediateField adjoin syntax for sets of elements | Adds support for both `F⟮S⟯` and `F⟮α⟯`. The term `x` in `F⟮x⟯` is elaborated, and if it has type `Set _` the first interpretation is used, and otherwise the second is. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 110/55 | Mathlib/FieldTheory/Adjoin.lean | 1 | 0 | [] | nobody | 1 year ago | 1050 days ago | 20 seconds |
| 5912 | ADedecker | feat(Analysis.Distribution.ContDiffMapSupportedIn): space of smooth maps with support in a fixed compact | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 513/13 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Data/Set/Function.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean | 8 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6002 | slerpyyy | feat(Analysis.SpecialFunctions.Gaussian): add `integrable_fun_mul_exp_neg_mul_sq` | If `f : ℝ → ℝ` is bounded by a polynomial, `fun x : ℝ => f x * exp (-b * x ^ 2)` is integrable. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 26/0 | Mathlib/Analysis/SpecialFunctions/Gaussian.lean | 1 | 3 | ['ocfnash', 'slerpyyy', 'urkud'] | nobody | 1 year ago | 1007 days ago | 9 days |
| 6195 | eric-wieser | chore(RingTheory/TensorProduct): golf the `mul` definition | --- - [x] depends on: #6211 - [x] depends on: #6187 [](https://gitpod.io/from-referrer/) Strangely this causes a timeout downstream | merge-conflict t-algebra awaiting-CI | 4/29 | Mathlib/RingTheory/TensorProduct.lean | 1 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 6307 | yuma-mizuno | refactor(CategoryTheory/Monoidal): add whiskering operators | We introduce whiskering operators. This allows us to introduce a simp-normal form for morphisms in monoidal categories. Rewriting into simp-normal forms is especially useful when combined with the coherence tactic. --- - [x] depends on: #6420 - [x] depends on: #8191 - [x] depends on: #9988 - [x] depends on: #9991 - [x] depends on: #9995 - [x] depends on: #10061 - [x] depends on: #10078 - [x] depends on: #10898 - [x] depends on: #10912 - [x] depends on: #11223 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 325/280 | Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/CategoryTheory/Bicategory/End.lean,Mathlib/CategoryTheory/Closed/Ideal.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/FunctorCategory.lean,Mathlib/CategoryTheory/Monoidal/Limits.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/NaturalTransformation.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,test/CategoryTheory/Coherence.lean | 15 | 38 | ['eric-wieser', 'github-actions', 'grunweg', 'jcommelin', 'kim-em', 'leanprover-community-mathlib4-bot', 'yuma-mizuno'] | nobody | 1 year ago | 778 days ago | 60 days |
| 6328 | astrainfinita | chore: make some instance about `Sub...Class` lower priority | Many similar instances have been marked as lower priority. I'd like to see if this would make things faster. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra awaiting-CI | 14/14 | Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/RingTheory/Subsemiring/Basic.lean,lean-toolchain | 3 | 1 | ['digama0'] | nobody | 1 year ago | unknown | 0 seconds |
| 6330 | astrainfinita | chore: make some instance about `Sub...Class` higher priority than `Sub...` | The opposite direction to #6328. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra slow-typeclass-synthesis | 123/128 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/FieldTheory/IsAlgClosed/Basic.lean,Mathlib/FieldTheory/Subfield.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/Subring/Basic.lean,Mathlib/RingTheory/Subsemiring/Basic.lean,lean-toolchain | 11 | 13 | ['astrainfinita', 'digama0', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 6403 | astrainfinita | chore: change instance priorities of `Ordered*` hierarchy | --- [](https://gitpod.io/from-referrer/) | t-algebra t-order merge-conflict slow-typeclass-synthesis awaiting-author | 253/79 | Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Star.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/RingTheory/HahnSeries.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 18 | 39 | ['Vierkantor', 'astrainfinita', 'digama0', 'eric-wieser', 'j-loreaux', 'leanprover-bot'] | nobody | 1 year ago | 883 days ago | 13 days |
| 6491 | eric-wieser | chore(Mathlib/Algebra/Hom/GroupAction): add `SMulHomClass.comp_smul` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 24/10 | Mathlib/Algebra/Hom/GroupAction.lean | 1 | 0 | [] | nobody | 1 year ago | 911 days ago | 83 days |
| 7076 | grunweg | feat: define measure zero subsets of a manifold | A topological manifold has no canonical measure, but there is a canonical notion of measure zero subsets. We show that these are closed under subsets and countable unions (hence define a filter, the almost everywhere filter) and that a closed nowhere dense has empty interior. This is necessary for stating the general version of Sard's theorem (in finite dimensions), and a first step towards its proof. This code was written at LftCM 2023. Thanks for @fpvandoorn for mentoring me! :heart: --- Unresolved questions/looking for feedback - Is "measure zero" a good name or would "null set" be better? I tend towards the former, but welcome input from a measure theorist (which I'm not). - What is the correct definition? One could also define "measure zero" using any `IsOpenPosMeasure` on the charted space. I think all results in this file still hold then, but for applications (e.g., Sard's theorem), this might be too general. - define custom notation, similar to the a.e. filter on a measure space? (We could include $J$ instead of $\mu$.) - what's the right syntax for formulas in docstrings --- use LaTeX or backticks? I don't know how to preview the generated docs, the guidelines are a bit ambiguous for me. | merge-conflict WIP t-differential-geometry t-measure-probability | 165/0 | Mathlib.lean,Mathlib/Geometry/Manifold/MeasureZero.lean,docs/references.bib | 3 | 27 | ['ADedecker', 'github-actions', 'grunweg', 'mo271', 'sgouezel'] | ADedecker | 1 year ago | 794 days ago | 43 days |
| 3757 | thorimur | feat: config options for `fail_if_no_progress` | This PR creates config options for `fail_if_no_progress` that allow the user to tweak what exactly counts as "progress". This includes whether to use defeq or `BEq`, what transparency to use, and which parts of the goal and local context to check. It also splits off the comparison functionality into `Mathlib.Lean.Meta.Compare`, which provides fully configurable comparison functions for common complex metaprogramming types not specific to `fail_if_no_progress`. These types are `Expr`, `LocalDecl`, `LocalContext`, `MetavarDecl`, `MVarId`, and `List MVarId`. --- See [zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/progress.20on.20fail_if_no_progress) for a couple review questions. Status update: this PR is now basically done, save for some extra tests which should probably be included. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 603/54 | Mathlib.lean,Mathlib/Lean/Meta.lean,Mathlib/Lean/Meta/Compare.lean,Mathlib/Tactic/FailIfNoProgress.lean,test/fail_if_no_progress.lean | 5 | 38 | ['alexjbest', 'github-actions', 'joneugster', 'kim-em', 'thorimur'] | nobody | 1 year ago | 978 days ago | 45 days |
| 12353 | thorimur | feat: `conv%` | This PR introduces `conv% e => tac`, along with `simp%`, `norm_num%`, and `push_neg%`, which are defined in terms of `conv%`. It also introduces `conv%?` (and `simp%?`, `norm_num%?`, and `push_neg%?`) as shortcuts for `show_term ...`. This is a relatively straightforward refactor of code already present in the implementation of `#conv`, and otherwise relies entirely on simple macros. This PR also introduces some modifications to existing command syntax for `#conv`, `#simp`, and `#norm_num`: * The syntax for `#conv` was `#conv tac => e`; however, this is inconsistent with the tactic syntax, and so this has been flipped to `#conv e => tac`. Likewise, `conv%` uses the same (new) syntax `conv% e => tac`. * `#simp` and `#norm_num` separated their config and `only` syntax from the expression by an optional `=>` (for `#simp`) and an optional `:` (for `#norm_num`) (e.g. `#simp only [lem] => e`). These have both been replaced with an optional`on` (e.g. `#simp only [lem] on e`) which is also used for `simp%` and `norm_num%`. Although `#whnf` is implemented in terms of `#conv`, this PR doesn't introduce `whnf%` in the same way, as that's probably better off being implemented directly instead of through `conv`. --- WIP: needs tests. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 131/32 | Mathlib/Tactic/Conv.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/PushNeg.lean,docs/Conv/Guide.lean | 4 | 0 | [] | nobody | 1 year ago | 738 days ago | 17 seconds |
| 13852 | astrainfinita | perf: skip some typeclasses in TC search | --- - [ ] depends on: #7873 [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis blocked-by-other-PR | 45/33 | Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/RingTheory/Norm.lean | 3 | 21 | ['MichaelStollBayreuth', 'astrainfinita', 'github-actions', 'leanprover-bot', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 7903 | urkud | feat: define `UnboundedSpace` | --- The new instances generate some timeouts, and I don't understand why. [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted t-topology | 111/59 | Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Topology/Bornology/Basic.lean,Mathlib/Topology/Bornology/Constructions.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean | 6 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 15679 | adomani | test: refactor in CI | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 213/5 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,Mathlib.lean,Mathlib/Algebra/Homology/HomotopyCategory/SingleFunctors.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unique.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/CategoryTheory/Bicategory/Adjunction.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/Order/Filter/Cocardinal.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/TestRefactor.lean,Refactor/Main.lean,lakefile.lean,lean-toolchain | 21 | 1 | ['github-actions'] | nobody | 1 year ago | 629 days ago | 8 seconds |
| 7565 | shuxuezhuyi | feat(Topology/Algebra/Order): extend homeomorphism of `Ioo` to `Icc` | We extend the homeomorphisms between open intervals to homeomorphisms between the closed intervals. --- - [ ] depends on: #7018 - [ ] depends on: #7351 - [ ] depends on: #7564 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR t-order | 389/5 | Mathlib.lean,Mathlib/Data/Set/Intervals/Image.lean,Mathlib/Order/Directed.lean,Mathlib/Topology/Algebra/Order/IccExtendFromIoo.lean,Mathlib/Topology/Algebra/Order/IntermediateValue.lean | 5 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 937 days ago | 3 minutes |
| 10629 | madvorak | feat: List.cons_sublist_append_iff_right | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 11/0 | Mathlib/Data/List/Basic.lean | 1 | 1 | ['eric-wieser'] | nobody | 1 year ago | 751 days ago | 53 days |
| 9973 | Ruben-VandeVelde | feat: polynomials formed by lists | From https://github.com/leanprover-community/mathlib/pull/15476 --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-data | 311/0 | Mathlib.lean,Mathlib/Data/Polynomial/OfList.lean | 2 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12926 | joelriou | feat(CategoryTheory): the monoidal category structure induced by a monoidal functor | In this PR, given a monoidal functor `F : MonoidalFunctor C D`, we define a monoidal category structure on the category `InducedCategory D F.obj`, which has the "same" objects as `C`, but the morphisms between `X` and `Y` identify to `F.obj X ⟶ F.obj Y`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 105/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Induced.lean | 2 | 3 | ['eric-wieser', 'github-actions', 'joelriou'] | nobody | 1 year ago | 716 days ago | 10 seconds |
| 12869 | adomani | feat: linter and script for `theorem` vs `lemma` | This PR contains a linter for flagging doc-string-less `theorem`s, as well as a bash script that, once the linter ran on Mathlib, automatically replaces every linter-offending `theorem` by `lemma`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 106/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/ThmLemma.lean,scripts/thmLemma.sh | 4 | 13 | ['adomani', 'github-actions', 'grunweg', 'joneugster'] | nobody | 1 year ago | 679 days ago | 38 days |
| 14563 | awueth | feat: if-then-else of exclusive or statement | --- If `¬(P ∧ Q)` then `ite (P ∨ Q) a 1 = (ite P a 1) * (ite Q a 1)` [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 5/0 | Mathlib/Algebra/Group/Basic.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'kim-em'] | nobody | 1 year ago | 654 days ago | 6 days |
| 14308 | grhkm21 | feat(Algebra/Category): Direct construction of colimits in algebraic categories | (Below I only write about colimits since that's what I'm familiar with after working on it the last few days, but maybe it's the same for other categorical constructions) **Main feature:** Construct colimits in `AddCommGrp`/`ModuleCat`/`FGModuleCat`(/...) directly as coequalizer (i.e. cokernel i.e. quotient) of two maps, allowing one to say $\coprod_j M_j \cong *$ Currently, if you look at how colimits are constructed for [AddCommGrp](https://github.com/leanprover-community/mathlib4/blob/master/Mathlib/Algebra/Category/Grp/Colimits.lean#L69-L92), you see this massive block of code of all relations generating the quotient relation, but that's kind of bad, you can't say anything concretely about it. Also as noted in the TODOs of a few files: ``` TODO: In fact, in `ModuleCat R` there is a much nicer model of colimits as quotients of finitely supported functions, and we really should implement this as well. ``` I wrote it down [here](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Braided.20left.20rigid.20categories.20are.20right.20rigid/near/447490672), and **have formalised it** in a small file already [here](https://gist.github.com/grhkm21/5b2d938753c0ce0900d21c93a39e3b7d#file-addcommgrpcolimits-lean-L162-L163) (I also have a `ModuleCat` version, and proving existence of colimits in `FGModuleCat` from it). Usually I will try to merge the file into Mathlib directly (preferably in one sitting), but I have been trying for a while now and been struggling. One issue is I am struggling to understand universes, which I asked [here](https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/Universe.20constraints!/near/448049266) along with many other places. A more concrete issue is that - [ ] FGModuleCat (and `FullSubcategory` in general) requires morphism and objects to be on the same universe, whereas generally `Category.{v, u}` don't. So that seems to limit what I can express, and maybe I have to fix it first. Here are a few more TODOs just so I don't forget, probably done before the one above: - [ ] Generalise `cokernelIsoQuotient` to other categories. - [ ] Also prove `coproductIsoDirectSum` - [ ] Also prove coequalizer (f + h) (g + h) ~ coequalizer f g ~ cokernel (f - g) 0 - [ ] Fix typo `FGModuleCatCat` If anyone is familiar with universe stuff and can answer my many questions that'll be great too. I need help understanding just [these five lines](https://github.com/leanprover-community/mathlib4/blob/master/Mathlib/Algebra/Category/Grp/Colimits.lean#L267-L271) | merge-conflict WIP t-algebra | 10/3 | Mathlib/Algebra/DirectSum/Module.lean,Mathlib/LinearAlgebra/FreeModule/Basic.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 669 days ago | 23 seconds |
| 13010 | ADedecker | feat: relax universe constraint in stoneCechExtend | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 33/3 | Mathlib/Topology/StoneCech.lean | 1 | 2 | ['ADedecker', 'erdOne'] | nobody | 1 year ago | unknown | 0 seconds |
| 12411 | adomani | feat: more linting of cdots | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter | 953/617 | Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib.lean,Mathlib/Algebra/Category/GroupCat/Colimits.lean,Mathlib/Algebra/Homology/Exact.lean,Mathlib/Algebra/Homology/LocalCohomology.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Module/PID.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/Order/Archimedean.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/InverseFunctionTheorem/ApproximatesLinearOn.lean,Mathlib/Analysis/Calculus/LocalExtr/Basic.lean,Mathlib/Analysis/Calculus/TangentCone.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/MeanInequalitiesPow.lean,Mathlib/Analysis/Normed/Group/ControlledClosure.lean,Mathlib/Analysis/Normed/Group/Pointwise.lean,Mathlib/Analysis/NormedSpace/FiniteDimension.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Separation.lean,Mathlib/Analysis/NormedSpace/Multilinear/Basic.lean,Mathlib/Analysis/NormedSpace/Star/Basic.lean,Mathlib/Analysis/NormedSpace/Star/Multiplier.lean,Mathlib/Analysis/NormedSpace/lpSpace.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/Log/Monotone.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecificLimits/Normed.lean,Mathlib/CategoryTheory/Abelian/Basic.lean,Mathlib/CategoryTheory/Action.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation.lean,Mathlib/CategoryTheory/Category/Cat/Limit.lean,Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/CategoryTheory/Category/TwoP.lean,Mathlib/CategoryTheory/Closed/Cartesian.lean,Mathlib/CategoryTheory/Functor/Flat.lean,Mathlib/CategoryTheory/Galois/GaloisObjects.lean,Mathlib/CategoryTheory/Limits/Over.lean,Mathlib/CategoryTheory/Limits/VanKampen.lean,Mathlib/CategoryTheory/Localization/Predicate.lean,Mathlib/CategoryTheory/Monad/Coequalizer.lean,Mathlib/CategoryTheory/Monad/Monadicity.lean,Mathlib/CategoryTheory/Pi/Basic.lean,Mathlib/CategoryTheory/Sites/DenseSubsite.lean,Mathlib/CategoryTheory/Sites/InducedTopology.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean,Mathlib/Combinatorics/HalesJewett.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean,Mathlib/Computability/Reduce.lean,Mathlib/Data/Holor.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Pairing.lean,Mathlib/Data/Real/Cardinality.lean,Mathlib/Data/Real/Hyperreal.lean,Mathlib/Data/Real/Irrational.lean,Mathlib/Data/Set/Card.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/FieldTheory/Finite/Polynomial.lean,Mathlib/FieldTheory/Minpoly/IsIntegrallyClosed.lean,Mathlib/FieldTheory/PerfectClosure.lean,Mathlib/FieldTheory/RatFunc.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/Geometry/RingedSpace/PresheafedSpace/Gluing.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/Perm/Cycle/Factors.lean,Mathlib/GroupTheory/Perm/Finite.lean,Mathlib/GroupTheory/SpecificGroups/Quaternion.lean,Mathlib/GroupTheory/Sylow.lean,Mathlib/LinearAlgebra/Dimension/RankNullity.lean,Mathlib/LinearAlgebra/Dual.lean,Mathlib/LinearAlgebra/LinearIndependent.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean,Mathlib/LinearAlgebra/Prod.lean,Mathlib/LinearAlgebra/QuadraticForm/Complex.lean,Mathlib/LinearAlgebra/Reflection.lean,Mathlib/MeasureTheory/Constructions/Pi.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean,Mathlib/MeasureTheory/Measure/Haar/Basic.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean,Mathlib/MeasureTheory/OuterMeasure/Basic.lean,Mathlib/ModelTheory/Skolem.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/NumberTheory/LegendreSymbol/Basic.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/Padics/RingHoms.lean,Mathlib/NumberTheory/RamificationInertia.lean,Mathlib/RingTheory/AdjoinRoot.lean | 147 | 2 | ['adomani', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 12279 | casavaca | WIP: feat: Holder's inequality n-ary | --- - [x] depends on #12291 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 129/0 | Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean | 2 | 13 | ['github-actions'] | nobody | 1 year ago | 741 days ago | 13 hours |
| 12093 | ADedecker | feat: tweak the definition of semicontinuity to behave better in nonlinear orders | Summary of the changes: - change definitions to make [lowerSemicontinuous_iff_isClosed_preimage](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Semicontinuous.html#lowerSemicontinuous_iff_isClosed_preimage) true without assuming `LinearOrder`, so that semicontinuity corresponds to continuity for lower/upper order topology on the codomain. See discussion on [Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Semicontinuity.20definition.20for.20non-linear.20orders/near/432898278) - add new `iff` lemmas for unfolding the definition - add `iff` lemmas with the old definition in the linearly ordered case - some basic lemmas need to be changed in an easy way - minimize assumptions for continuity => semicontinuity - prove the semicontinuity criterion for indicators using "preimage of Ici/Iic" instead of a direct proof, because the proof is more natural (especially because we have no `filter_upwards` for `Frequently`) - in the rest of the file (which is about linear orders anyway), we don't touch the statements and just rewrite to the old definition. Some of these could be generalized, but we keep that for a later PR. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology | 274/130 | Mathlib/Analysis/BoundedVariation.lean,Mathlib/MeasureTheory/Integral/FundThmCalculus.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Topology/Semicontinuous.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 11520 | thorimur | feat: `linting_rules` and deprecated syntax | --- Experimental. WIP. Might not be performance-viable. - [ ] depends on: #11519 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-meta | 1016/0 | Mathlib.lean,Mathlib/Command/Linter.lean,Mathlib/Command/Linter/Deprecated.lean,Mathlib/Command/Linter/LintingRules.lean,Mathlib/Command/SyntaxRules.lean,Mathlib/Command/SyntaxRules/Attr.lean,Mathlib/Command/SyntaxRules/Elab.lean,Mathlib/Command/SyntaxRules/Header.lean,Mathlib/Command/SyntaxRules/Util.lean,Mathlib/Tactic/Common.lean,scripts/noshake.json | 11 | 11 | ['leanprover-bot', 'leanprover-community-mathlib4-bot', 'thorimur'] | nobody | 1 year ago | unknown | 0 seconds |
| 11519 | thorimur | feat: `syntax_rules` | --- Experimental. WIP. [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 485/0 | Mathlib.lean,Mathlib/Command/SyntaxRules.lean,Mathlib/Command/SyntaxRules/Attr.lean,Mathlib/Command/SyntaxRules/Elab.lean,Mathlib/Command/SyntaxRules/Header.lean,Mathlib/Command/SyntaxRules/Util.lean,scripts/noshake.json | 7 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 11393 | mcdoll | feat(Analysis/Distribution/SchwartzSpace): The Heine-Borel property | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 688/3 | Mathlib.lean,Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/UniformSpace/Ascoli.lean,Mathlib/Topology/UniformSpace/Pi.lean,Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean | 6 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 9444 | erdOne | feat: Various instances regarding `𝓞 K`. | --- [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted t-number-theory | 27/0 | Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/RingTheory/IntegralClosure.lean | 2 | 9 | ['erdOne', 'leanprover-bot', 'mattrobball', 'riccardobrasca', 'xroblot'] | nobody | 1 year ago | 846 days ago | 1 day |
| 8931 | hmonroe | feat(Computable): define P, NP, and NP-complete | Revised to focus on languages that are binary strings, given the issue of non-acceptable encodings of unspecified Types --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author | 381/5 | Mathlib.lean,Mathlib/Computability/Complexity copy.lean,Mathlib/Computability/Complexity.lean,Mathlib/Computability/Encoding.lean,Mathlib/Computability/TMComputable.lean,Mathlib/Computability/TuringMachine.lean,Mathlib/Computability/halting example.lean,docs/references.bib | 8 | 3 | ['fpvandoorn', 'github-actions', 'hmonroe'] | nobody | 1 year ago | 780 days ago | 93 days |
| 10641 | newell | feat(Topology/MetricSpace/WellSpaced): Define sets that are *well-spaced*. | Create a new file `Mathlib.Topology.MetricSpace.WellSpaced` that contains definitions of sets which are in some sense *well-spaced*. Some examples are Delone and Meyer sets, which find applications in Quasicrystals and Coding Theory, among others. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 1073/14 | Mathlib.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Topology/EMetricSpace/Basic.lean,Mathlib/Topology/GMetric/Basic.lean,Mathlib/Topology/GMetric/GInfSep.lean,Mathlib/Topology/GMetric/WellSpaced.lean,Mathlib/Topology/GPseudoMetric/Basic.lean,Mathlib/Topology/MetricSpace/WellSpaced.lean | 8 | 1 | ['edegeltje'] | nobody | 1 year ago | unknown | 0 seconds |
| 10387 | adomani | feat(Tactic/ComputeDegree): add `polynomial` tactic | Introducing the `polynomial` tactic, summing up `compute_degree, monicity` and adding support for `leadingCoeff`. This is more of a proof of concept: if there is interest in this tactic, I can polish it up. See [this Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/Compute.20roots.20of.20polynomials/near/420713624). --- [](https://gitpod.io/from-referrer/) | WIP RFC t-meta | 24/0 | Mathlib/Tactic/ComputeDegree.lean | 1 | 0 | [] | nobody | 1 year ago | 668 days ago | 143 days |
| 9154 | astrainfinita | feat: `npow` / `nsmul` / `Nat.cast`/ `zpow` / `zsmul` implemented using `Nat.binaryRec` | --- - [ ] depends on: https://github.com/leanprover/lean4/pull/3756 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra blocked-by-other-PR | 168/359 | Mathlib/Algebra/Group/Defs.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/Primrec.lean,Mathlib/Data/Bool/Basic.lean,Mathlib/Data/Int/Bitwise.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Digits.lean,Mathlib/Data/Nat/EvenOddRec.lean,Mathlib/Data/Nat/Fib/Basic.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Order/Basic.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Nat/Size.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Init/Data/Nat/Bitwise.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/Denumerable.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Logic/Equiv/Nat.lean,lake-manifest.json,lakefile.lean,test/zmod.lean | 25 | 7 | ['astrainfinita', 'eric-wieser', 'kim-em', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 6603 | tydeu | feat: automatically try `cache get` before build | --- A quick proof-of-concept. With this, `lake build` will always try `cache get` before building mathlib. [](https://gitpod.io/from-referrer/) | merge-conflict WIP CI | 29/0 | lakefile.lean | 1 | 3 | ['kim-em', 'tydeu'] | nobody | 1 year ago | 978 days ago | 11 days |
| 6058 | apurvnakade | feat: duality theory for cone programs | This PR tracks the development of duality theory for cone programs. [Reference](https://ti.inf.ethz.ch/ew/courses/ApproxSDP09/notes/conelp.pdf) --- [](https://gitpod.io/from-referrer/) - [x] depends on: #6059 - [ ] define direct sum of cones - [ ] weak duality - [ ] regular duality - [ ] slater condition - [ ] strong duality | merge-conflict WIP t-analysis | 159/0 | Mathlib.lean,Mathlib/Analysis/Convex/Cone/ConeLinearProgram.lean | 2 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 1013 days ago | 9 seconds |
| 6449 | ADedecker | feat: functions with finite fibers | --- This has been discussed before on [Zulip](https://leanprover.zulipchat.com/#narrow/stream/217875-Is-there-code-for-X.3F/topic/.E2.9C.94.20Cofinite.20maps.3F) and it came up again while working with @kkytola's student. As explained in the docstring, we could absolutely just use `Tendsto f cofinite cofinite` all the time, but (1) we lack some API for it (2) the API is nicer to setup if we have a separate def (e.g for dot notation) and (3) mentioning filters for such a simple concept is really not beginner-friendly. I'm not sure at all about the name. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 203/0 | Mathlib.lean,Mathlib/Logic/Function/HasFiniteFibers.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Cofinite.lean | 4 | 14 | ['ADedecker', 'YaelDillies', 'alexjbest', 'kkytola'] | nobody | 1 year ago | 990 days ago | 6 days |
| 8100 | digama0 | feat: add support for other types in norm_num | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 177/12 | Mathlib/Tactic/NormNum/Basic.lean,Mathlib/Tactic/NormNum/Eq.lean,Mathlib/Tactic/NormNum/Ineq.lean,Mathlib/Tactic/NormNum/Pow.lean,Mathlib/Tactic/NormNum/Result.lean,Mathlib/Tactic/NormNum/Structural.lean,test/norm_num.lean | 7 | 4 | ['dwrensha'] | nobody | 1 year ago | unknown | 0 seconds |
| 13163 | erdOne | feat(.vscode/module-docstring.code-snippet): Prevent auto-complete from firing on `do` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 5/0 | .vscode/module-docstring.code-snippets | 1 | 5 | ['erdOne', 'grunweg', 'robertylewis', 'trivial1711'] | nobody | 1 year ago | 656 days ago | 50 days |
| 15585 | astrainfinita | test make `HasQuotient.quotient'` reducible | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 8/1 | Mathlib/Algebra/Quotient.lean,Mathlib/GroupTheory/Coset.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 15586 | astrainfinita | test make `HasQuotient` out put a `setoid` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 22/36 | Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Lie/Weights/Basic.lean,Mathlib/Algebra/Quotient.lean,Mathlib/Analysis/Normed/Group/AddCircle.lean,Mathlib/GroupTheory/Commensurable.lean,Mathlib/GroupTheory/Coset.lean,Mathlib/GroupTheory/CosetCover.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/QuotientGroup.lean,Mathlib/LinearAlgebra/Quotient.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/Topology/Algebra/UniformRing.lean | 14 | 5 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 13791 | digama0 | refactor: Primrec and Partrec | General cleanup of the `Primrec` and `Partrec` files, to better adjust to lean 4 things. The main user-visible change is that `Primrec₂` is no longer a `def` but an `abbrev`, because it was causing inference issues in lean 4. I also removed all the nonterminal `simp`s in `PartrecCode.lean`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability tech debt | 585/778 | Mathlib/Computability/Ackermann.lean,Mathlib/Computability/Halting.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/Primrec.lean | 5 | 2 | ['github-actions', 'grunweg'] | nobody | 1 year ago | 684 days ago | 1 day |
| 12418 | rosborn | style: replace preimage_val with ↓∩ notation | --- This is a rough draft of what the new `↓∩` notation would look like within mathlib. I believe this is an improvement in clarity and would like to have `↓∩` as a standard notation (along with `''`, `⁻¹'`, `↑`, etc...). As `↓∩` is specialized for `Set`s, I have only changed `preimage_val` when the left-hand side of `↓∩` is a `Set`. The introduction of the `↓∩` notation to Data.Set.Image is temporary as it isn't possible to import Data.Set.Subset directly. If we want `↓∩` unscoped, where would be the best place to define it? An option is Data.Set.Defs, but the notation cannot be defined without additional imports as the file does not import `notation3`. [](https://gitpod.io/from-referrer/) | merge-conflict | 56/61 | Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Data/Set/Function.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Set/Subset.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Clopen.lean,Mathlib/Topology/Connected/Basic.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/LocalAtTarget.lean,Mathlib/Topology/LocallyConstant/Basic.lean,Mathlib/Topology/Separation.lean,Mathlib/Topology/Sober.lean | 18 | 3 | ['grunweg', 'rosborn'] | nobody | 1 year ago | 707 days ago | 29 days |
| 9978 | astrainfinita | chore(FieldTheory/KummerExtension): move some lemmas earlier | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 197/177 | Mathlib.lean,Mathlib/Data/Polynomial/FieldDivision.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Polynomial/Irreducible.lean | 5 | 5 | ['alreadydone', 'grunweg', 'riccardobrasca'] | nobody | 1 year ago | 818 days ago | 8 days |
| 12429 | adomani | feat: toND -- auto-generating natDegree | This is an experiment to automatically translate theorems about `degree` to theorems about `natDegree`. --- [](https://gitpod.io/from-referrer/) | t-algebra RFC merge-conflict awaiting-author t-meta | 167/132 | Mathlib.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Degree/Lemmas.lean,Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Algebra/Polynomial/Inductions.lean,Mathlib/Algebra/Polynomial/Mirror.lean,Mathlib/Algebra/Polynomial/Reverse.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ToNatDegree.lean,scripts/noshake.json | 11 | 2 | ['adomani', 'grunweg'] | nobody | 1 year ago | 732 days ago | 3 days |
| 15823 | eric-wieser | Quotients of rings in model theory | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-logic | 55/13 | Mathlib/ModelTheory/Algebra/Ring/FreeCommRing.lean,Mathlib/ModelTheory/Syntax.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 12178 | joneugster | feat(Data/Matrix/Basic): add notation for `m×n`-Matrices | Introduce the notation `Mat[m,n][R]` for `Matrix (Fin m) (Fin n) R`. [Zulip thread](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Why.20does.20.60Matrix.2Erow.60.20use.20.20.60Unit.60.20instead.20of.20.60Fin.201.60.3F/near/427949223) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 139/135 | Mathlib/Algebra/Lie/CartanMatrix.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Data/Matrix/Basic.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Rank.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/LinearAlgebra/Matrix/Adjugate.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean,Mathlib/LinearAlgebra/Matrix/Determinant.lean,Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean,Mathlib/LinearAlgebra/PID.lean,Mathlib/LinearAlgebra/Vandermonde.lean,Mathlib/NumberTheory/Modular.lean,Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean,Mathlib/NumberTheory/ModularForms/SlashActions.lean,Mathlib/NumberTheory/ModularForms/SlashInvariantForms.lean,Mathlib/NumberTheory/RamificationInertia.lean,Mathlib/RingTheory/SimpleModule.lean,test/matrix.lean | 22 | 9 | ['YaelDillies', 'eric-wieser', 'grunweg', 'joneugster'] | nobody | 1 year ago | 739 days ago | 5 days |
| 12751 | Command-Master | feat: add lemmas for Nat/Bits, Nat/Bitwise and Nat/Size | Remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 66/7 | Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Size.lean | 4 | 26 | ['Command-Master', 'Rida-Hamadani', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 655 days ago | 56 days |
| 15448 | urkud | chore(*): deprecate `Option.elim'` | Use `Option.elim` instead. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt | 54/50 | Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/Calculus/LagrangeMultipliers.lean,Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/TMToPartrec.lean,Mathlib/Data/Option/Defs.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/Logic/Embedding/Set.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/Topology/Compactness/Paracompact.lean,Mathlib/Topology/LocallyFinite.lean | 17 | 12 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'grunweg', 'urkud'] | nobody | 1 year ago | 629 days ago | 7 days |
| 10350 | Shamrock-Frost | feat(Data/Setoid): add the operations of taking the equivalence class of an element and of saturating a set wrt an equivalence relation | I'm open to suggestions about changing the name "saturate", someone on zulip rightly pointed out this is a very overloaded term in math. That said, I think it's unlikely to cause confusion and that there's only one reasonable interpretation in the context of setoids. --- - [x] depends on: #10347 - [x] depends on: #10348 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 169/3 | Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/Order/Closure.lean | 3 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 737 days ago | 19 days |
| 13573 | Shamrock-Frost | feat: add multivariate polynomial modules | Add a type synonym for multivariate polynomials with coefficients in a module. --- Multivariate polynomials with module coefficients are sort of silly, but they sometimes show up in commutative algebra (eg in the definition of a quasi regular sequence). Writing this code involved a lot of copy and pasting from `PolynomialModule` and `MvPolynomial`. The API is definitely lacking at this stage but it's a start. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 691/6 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/Module/Basic.lean,Mathlib/Algebra/MvPolynomial/Module/MvAEval.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean | 4 | 9 | ['Shamrock-Frost', 'erdOne', 'github-actions'] | nobody | 1 year ago | 654 days ago | 39 days |
| 6517 | MohanadAhmed | feat: discrete Fourier transform of a finite sequence | # Discrete Fourier Transform (DFT) Matrix and DFT of a (finite) sequence This file defines the `dft` opertaion on a sequence (also a vecotr) and the DFT operation matrix ## Main definitions - `dft v`: given a sequence (v : (Fin n) → ℂ) we can transform it into a sequence (V : (Fin n) →ℂ) such that $$V [p] = ∑_{k = 0}^{N - 1} e^{-j*2πkp/n} v [k]$$ - `idft V` : given a sequence (V : (Fin n) → ℂ) we can transform it into a sequence (v : (Fin n) → ℂ) such that $$v [k] = \frac{1}{N}∑_{p = 0}^{n - 1} e^{j*2πkp/N} v [p]$$ - `dftMatrix n` : the dft matrix of dimensions $n \times n$ with the `k, p` entry equal to $$Wₙ[k, p] = e^{-j2πkp/n}$$ - `(dftMatrix n)⁻¹` : the idft matrix of dimensions $n \times n$ with the `k, p` entry equal to $$Wₙ[k, p] = (1/N) e^{j2πkp/n}$$ ## Main results - `dft v = (dftMatrix n) v` : the dft operation on a sequence is the same as the dft matrix applied to the vector - `idft V = (dftMatrix n)⁻¹ V` : the idft operation on a sequence is the same as the idft matrix applied to the vector - `dft (idft v) = dft ( idft v) = v` the dft and idft operations are inverses - `Wₙ = vandermonde (w)` : the dft matrix is vandermonde with `w` being the first row of the dft matrix - `circulant t = (dftMatrix n)⁻¹ ⬝ diagonal (dft t) ⬝ (dftMatrix n)` : a circulant matrix is diagonalizable by the dft and idft matrix pair. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 294/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/DFT.lean | 2 | 26 | ['MohanadAhmed', 'ericrbg'] | nobody | 1 year ago | 927 days ago | 65 days |
| 13155 | alreadydone | feat(NumberTheory/EllipticDivisibilitySequence): show elliptic relations follow from even-odd recursion | This PR is centered around the (generalized) elliptic relations (`rel₄`) $E(a,b,c,d): W_{a+b}W_{a-b}W_{c+d}W_{c-d}=W_{a+c}W_{a-c}W_{b+d}W_{b-d}-W_{a+d}W_{a-d}W_{b+c}W_{b-c}$. For an integer-indexed sequence W valued in a commutative ring, the relation makes sense only when a,b,c,d are all integers or all half integers. For convenience of formalization, we instead consider integers a,b,c,d of the same parity and divide all subscripts by 2. We extract the subexpression $W_{(a+b)/2}W_{(a-b)/2}$ (which appear six times) as `addMulSub W a b`. The collection of all $E(a,b,c,d)$ is equivalent to Stange's axiom for elliptic nets (`net`), and the literature (e.g. Silverman) commonly consider only the three-index special case $E(m,n,r,0)$ (`Rel₃`). Important special cases of these relations are (i) $E(m+1,m,1,0): W_{2m+1}W_1^3=W_{m+2}W_m^3-W_{m+1}^3 W_{m-1}$ (`oddRec`) and (ii) $E(m+1,m-1,1,0): W_{2m}W_2 W_1^2=W_m(W_{m+2}W_{m-1}^2-W_{m-2}W_{m+1}^2)$ (`evenRec`), which suffice to uniquely specify $W$ on all positive integers recursively from four initial values $W_1, W_2, W_3, W_4$ (`IsEllSequence.ext`, if $W_1 W_2$ is not a zero divisor). In the usual setting where $W_1=1$ and $W_2\mid W_4$, there does exist a sequence (`normEDS`) satisfying (i) and (ii) given initial values $W_2, W_3$ and $W_4/W_2$. It turns out the same non-zerodivisor condition also guarantees that W is an odd function with $W_0=0$, which naturally extends W to all integers. The main result of this PR (`rel₄_of_oddRec_evenRec`, `IsEllSequence.of_oddRec_evenRec`) is a purely algebraic proof that the sequence W defined by the single-parameter elliptic relations (i) and (ii) implies all $E(a,b,c,d)$, based on my original argument first published on [Math.SE](https://math.stackexchange.com/a/4903422/12932). It's based on the observation that a nonzerodivisor-multiple of $E(a,b,c,d)$ can be expressed as a linear combination of various $E(a,b,c_\min,d_\min)$ with the two smallest indices fixed at their minimal possible values, which can be transformed (`transf`) to an elliptic relation with smaller `a` (which can be assumed to hold by induction), unless they are of the form (i) or (ii) which hold by assumption. For this argument it's necessary to assume `a > b > c > d ≥ 0` (see `StrictAnti₄` and `Rel₄OfValid`), but it's easy to extend to arbitrary a,b,c,d by symmetry properties of `rel₄` under negation and permutations of indices. In the subsequent PR #13057, we show all normalized EDSs (`normEDS`), defined using the even-odd recursion (i)-(ii), are elliptic (i.e. satisfy the elliptic relations) divisibility sequences. This PR doesn't directly apply because a normEDS doesn't always satisfy the nonzerodivisor condition, but they are specializations of the universal normEDS, which does satisfy the condition. The technique of reducing to the universal case will be applied many times, and relies on the naturality (`map`) lemmas. We also change the `ℕ` in the definition `IsDivSequence` to `ℤ` which is more natural given that W is a `ℤ`-indexed sequence. --- - [x] depends on: #13153 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-number-theory | 565/12 | Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 1 | 55 | ['Multramate', 'alreadydone', 'github-actions', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 661 days ago | 26 days |
| 15600 | adomani | feat: lint also `let` vs `have` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter | 77/26 | Mathlib/Tactic/Linter/HaveLetLinter.lean,test/HaveLetLinter.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 631 days ago | 8 seconds |
| 16253 | Shreyas4991 | feat: Basics of Discrete Fair Division in Mathlib | This PR adds the basics of discrete fair division in mathlib. We include the definitions of allocations, valuations, properties of valuations, and the following notions : Envy-Freeness (EF), Envy-Freeness upto 1 good (EF1), and envy freeness upto any good (EFX). We also include the various implications between these notions. --- [](https://gitpod.io/from-referrer/) | WIP awaiting-author | 144/0 | Mathlib/GameTheory/FairDivision/Discrete/Basic.lean | 1 | 9 | ['Shreyas4991', 'eric-wieser', 'github-actions'] | nobody | 1 year ago | 610 days ago | 5 hours |
| 13970 | adomani | feat: a linter to flag unnecessary uses of `nolint simpNF` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 230/0 | Mathlib.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/Quaternion.lean,Mathlib/CategoryTheory/Comma/Arrow.lean,Mathlib/CategoryTheory/Monoidal/End.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Even.lean,Mathlib/LinearAlgebra/CliffordAlgebra/EvenEquiv.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/UnnecessarySyntax.lean,test/UnnecessarySyntax.lean | 13 | 4 | ['adomani', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15162 | adomani | feat: checkAsSorry linter | A very preliminary version of the `checkAsSorry` linter. It flags declarations whose type is not equal to the 'asSorry'ed one. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Running.20Mathlib.20under.20.60set_option.20debug.2EbyAsSorry.60) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter | 119/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/CheckAsSorry.lean,test/CheckAsSorry.lean | 4 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 15121 | Eloitor | feat: iff theorems for IsSplitEpi and IsSplitMono in opposite category | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-category-theory new-contributor | 40/0 | Mathlib/CategoryTheory/EpiMono.lean | 1 | 3 | ['github-actions', 'joelriou', 'mattrobball'] | nobody | 1 year ago | 638 days ago | 7 days |
| 15895 | madvorak | feat(Computability/ContextFreeGrammar): mapping between two types of nonterminal symbols | --- [](https://gitpod.io/from-referrer/) | t-computability WIP | 172/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 43 | ['YaelDillies', 'github-actions', 'madvorak'] | nobody | 1 year ago | 610 days ago | 1 day |
| 14038 | adomani | test/decl diff in lean dev | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 231/2 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,.github/workflows/mk_build_yml.sh,Mathlib/Tactic/Eval.lean,scripts/decls_diff_hybrid.sh,scripts/list_decls.lean | 8 | 3 | ['github-actions'] | nobody | 1 year ago | 677 days ago | 8 seconds |
| 14046 | adomani | test: diff of declarations in lean | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 231/2 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,.github/workflows/mk_build_yml.sh,Mathlib/Tactic/Eval.lean,scripts/decls_diff_hybrid.sh,scripts/list_decls.lean | 8 | 2 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 12107 | yuma-mizuno | feat(Mathlib/Tactic/Widget/StringDiagram): support 2-morphisms in bicategories | --- - [x] depends on: #11080 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory t-meta | 1158/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Coherence.lean,Mathlib/Tactic/Widget/StringDiagram.lean,scripts/noshake.json,test/StringDiagram.lean,widget/src/penrose/monoidal.dsl,widget/src/penrose/monoidal.sty | 8 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15925 | yuma-mizuno | feat(CategoryTheory/Monoida): proof producing coherence tactic | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory t-meta | 5018/265 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Adjunction.lean,Mathlib/CategoryTheory/Bicategory/Kan/Adjunction.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/CoherenceLemmas.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean,Mathlib/CategoryTheory/Monoidal/Rigid/Braided.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/BicategoricalComp.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Normalize.lean,Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/Coherence.lean,Mathlib/Tactic/CategoryTheory/Coherence/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Coherence/Normalize.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/CoherenceNew.lean,Mathlib/Tactic/CategoryTheory/Monoidal.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Basic.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,Mathlib/Tactic/Widget/StringDiagram.lean,lake-manifest.json,scripts/noshake.json,test/CategoryTheory/Bicategory.lean,test/CategoryTheory/Coherence.lean,test/CategoryTheory/CoherenceNew.lean,test/CategoryTheory/Monoidal.lean,test/CategoryTheory/Monoidal/Basic.lean,test/CategoryTheory/Monoidal/Normalize.lean,test/CategoryTheory/MonoidalComp.lean,test/StringDiagram.lean | 35 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 7861 | shuxuezhuyi | feat(Geometry/Hyperbolic/UpperHalfPlane): instance IsometricSMul PSL(2, ℝ) ℍ | --- - [ ] depends on: #7835 - [ ] depends on: #7791 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-euclidean-geometry | 98/0 | Mathlib.lean,Mathlib/Geometry/Hyperbolic/UpperHalfPlane/Basic.lean,Mathlib/LinearAlgebra/Matrix/ProjectiveSpecialLinearGroup.lean | 3 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 659 days ago | 43 days |
| 16570 | yuma-mizuno | chore(Tactic/CategoryTheory): change `TermElabM` to `MetaM` | Separated from #15335. To use `Qq`, we need to modify `Qq` to support universe matching. See [Zulip](https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.2315335.20meta.20code.20for.20monoidal.20categories). --- - [ ] depends on: #15335 [](https://gitpod.io/from-referrer/) | WIP t-meta | 26/15 | Mathlib/Tactic/CategoryTheory/BicategoryCoherence.lean,Mathlib/Tactic/CategoryTheory/Coherence.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mergify'] | nobody | 1 year ago | unknown | 0 seconds |
| 6475 | joneugster | refactor(LinearAlgebra/Span): replace ∙ with • as notation for `span R {x}` | Change the notation for `Submodule.span R {x}` from `R ∙ x` to the bullet `R • x`, which is also used for scalar multiplication. --- (this was an experiment originating from a [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/.2E.C2.B7.E2.AC.9D.20.5Brant.5D), I don't have a clear opinion if this is actually a desired thing to do...) Generally this works and Lean seems to do fine figuring out the difference between `r • x` and `R • x` (The former is scalar multiplication in an `R`-module `M`, the latter is the `Submodule R M` generated by `x`). Encountered a few regressions that should be considered (the first two might be also bugs that could be looked at independently): 1. `(· • ·)`, and general simple function syntax, does not work as notation for `HSMul.hSMul` anymore. For this reason, I introduced the notation `scoped` to minimise the effect of this. Now it's only a problem if you `open Span`. Note that `fun x₁ x₂ ↦ x₁ • x₂` works flawlessly all the time. 4. `change` and `convert` have troubles to deal with the two competing notations. `have := _; convert this` works. 5. `R • x - y` is not valid anymore and needs parentheses: `R • (x - y)`. I do think this actually helps readability, so I don't mind. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra RFC | 323/240 | Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Lie/Engel.lean,Mathlib/Algebra/Lie/Normalizer.lean,Mathlib/Algebra/Module/PID.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/InnerProductSpace/TwoDim.lean,Mathlib/Analysis/NormedSpace/ContinuousLinearMap.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Extension.lean,Mathlib/Analysis/NormedSpace/OperatorNorm.lean,Mathlib/Data/ZMod/Quotient.lean,Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean,Mathlib/Geometry/Euclidean/Inversion/Calculus.lean,Mathlib/Geometry/Euclidean/MongePoint.lean,Mathlib/Geometry/Euclidean/PerpBisector.lean,Mathlib/Geometry/Euclidean/Sphere/SecondInter.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean,Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean,Mathlib/LinearAlgebra/BilinearForm.lean,Mathlib/LinearAlgebra/DFinsupp.lean,Mathlib/LinearAlgebra/Dimension.lean,Mathlib/LinearAlgebra/FiniteDimensional.lean,Mathlib/LinearAlgebra/LinearIndependent.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/ProjectiveSpace/Basic.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/Quotient.lean,Mathlib/LinearAlgebra/SesquilinearForm.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/MeasureTheory/Integral/Periodic.lean,Mathlib/RingTheory/Coprime/Ideal.lean,Mathlib/RingTheory/Finiteness.lean,Mathlib/RingTheory/Ideal/AssociatedPrime.lean,Mathlib/RingTheory/Ideal/IdempotentFG.lean,Mathlib/RingTheory/Noetherian.lean,Mathlib/Topology/Instances/AddCircle.lean | 42 | 3 | ['eric-wieser', 'joneugster', 'leanprover-bot'] | nobody | 1 year ago | 992 days ago | 2 days |
| 10591 | adri326 | feat(Topology/Algebra/ConstMulAction): properties of continuous actions in Hausdorff spaces | Defines some useful properties of `ContinuousConstSMul` group actions on Hausdorff spaces: - `MulAction.isClosed_fixedBy`, which proves that the `fixedBy α m` set is closed - `t2_separation_smul`, which constructs an open set `s` such that `s` and `g • s` are disjoint - `Set.InjOn.t2_separation_smul`, the extension of `t2_separation_smul` to a set of group elements whose action is injective --- This PR belongs my series of PR around the formalization of Rubin's theorem. `MulAction.isClosed_fixedBy` is used in several places along the proof, and the separation lemmas are primarily used in showing that `(fixedBy α g)ᶜ` and `(fixedBy α h)ᶜ` are disjoint under some intricate but fully group-theoretic condition. [](https://gitpod.io/from-referrer/) | t-topology awaiting-author t-algebra | 57/0 | Mathlib/Topology/Algebra/ConstMulAction.lean | 1 | 9 | ['ADedecker', 'adri326', 'j-loreaux', 'jcommelin'] | ADedecker | 1 year ago | 750 days ago | 55 days |
| 7545 | shuxuezhuyi | feat: APIs of `Function.extend f g e'` when `f` is injective | We characterizes `range g`, `Injective g`, `Surjective g` and `Bijective g` in terms of `extend f g e'`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 50/0 | Mathlib.lean,Mathlib/Logic/Function/ApiForExtend.lean | 2 | 1 | ['fpvandoorn'] | nobody | 1 year ago | 905 days ago | 32 days |
| 16658 | adomani | add tips file | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author test-ci | 51/508 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,scripts/Tips.lean | 5 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 14078 | Ruben-VandeVelde | feat(CI): continue after mk_all fails | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 43/0 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,Mathlib/Data/Nat/Test.lean | 5 | 2 | ['bryangingechen', 'github-actions'] | nobody | 1 year ago | 676 days ago | 3 hours |
| 11283 | hmonroe | feat(ModelTheory/Satisfiability): define theory with independent sentence | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-logic | 8/0 | Mathlib/ModelTheory/Satisfiability.lean | 1 | 2 | ['fpvandoorn', 'hmonroe'] | nobody | 1 year ago | 778 days ago | 3 days |
| 16914 | siddhartha-gadgil | Loogle syntax with non-reserved | This is PR mainly to test that loogle syntax does not break stuff downstream --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 4/4 | lake-manifest.json,lakefile.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 590 days ago | 4 hours |
| 13782 | alreadydone | feat(EllipticCurve): ZSMul formula in terms of division polynomials | The formula $[n]P = (\phi_n(x,y) : \omega_n(x,y) : \psi_n(x,y))$ in Jacobian coordinates for $P=(x,y)$ a nonsingular point on a Weierstrass/elliptic curve. --- - [x] depends on: #12883 - [x] depends on: #13399 - [ ] depends on: #13057 - [ ] depends on: #13155 - [x] depends on: #13845 - [x] depends on: #13846 - [ ] depends on: #13847 [](https://gitpod.io/from-referrer/) | t-algebra t-number-theory blocked-by-other-PR merge-conflict t-algebraic-geometry | 2462/232 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/PDeriv.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/ZSMul.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 10 | 8 | ['Multramate', 'alreadydone', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8118 | iwilare | feat(CategoryTheory): add dinatural transformations | A starting point to define [dinatural transformations](https://ncatlab.org/nlab/show/dinatural+transformation). This is my first PR so style comments and improvements are very welcome! --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 147/7 | Mathlib.lean,Mathlib/CategoryTheory/DinatTrans.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/CategoryTheory/Products/Bifunctor.lean | 4 | 49 | ['Shamrock-Frost', 'github-actions', 'iwilare', 'joelriou'] | Shamrock-Frost | 1 year ago | 688 days ago | 21 days |
| 14242 | js2357 | feat: Prove equivalence of `isDedekindDomain` and `isDedekindDomainDvr` | Prove that `isDedekindDomainDvr` is equivalent to both `isDedekindDomain` and `isDedekindDomainInv`. Specifically, prove `isDedekindDomainDvr A → isDedekindDomainInv A`, because `isDedekindDomain A → isDedekindDomainDvr A` and `IsDedekindDomain A ↔ IsDedekindDomainInv A` are already in Mathlib. - [x] depends on: #14099 - [x] depends on: #14216 - [ ] depends on: #14237 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR new-contributor | 269/1 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean,Mathlib/RingTheory/Localization/Basic.lean | 4 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 671 days ago | 4 minutes |
| 17171 | astrainfinita | test extends carrier and property | --- We need https://github.com/leanprover/lean4/issues/2666 ... [](https://gitpod.io/from-referrer/) | merge-conflict | 433/309 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/Field/Subfield.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/MulOpposite.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/MulOpposite.lean,Mathlib/Algebra/Group/Submonoid/Pointwise.lean,Mathlib/Algebra/Group/Submonoid/Units.lean,Mathlib/Algebra/Group/Subsemigroup/Basic.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/MulOpposite.lean,Mathlib/Algebra/Ring/Subsemiring/Order.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/Algebra/Star/Subsemiring.lean,Mathlib/Data/Complex/Module.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/Deprecated/Subfield.lean,Mathlib/Deprecated/Subgroup.lean,Mathlib/Deprecated/Submonoid.lean,Mathlib/Deprecated/Subring.lean,Mathlib/FieldTheory/IntermediateField/Basic.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/GroupTheory/DoubleCoset.lean,Mathlib/GroupTheory/Finiteness.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/SetTheory/Cardinal/Subfield.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/OpenSubgroup.lean | 42 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 7516 | ADedecker | perf: use `abbrev` to prevent unifying useless data | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 4/3 | Mathlib/Topology/ContinuousFunction/Bounded.lean | 1 | 3 | ['ADedecker', 'leanprover-bot', 'mattrobball'] | nobody | 1 year ago | 939 days ago | 16 seconds |
| 17127 | astrainfinita | chore: remove global `Quotient.mk` `⟦·⟧` notation | --- Merge this PR when we are ready to migrate to `QuotLike` API (#16421). [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 137/2 | Counterexamples/Pseudoelement.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Quandle.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Product.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnected.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/Limits/Shapes/SingleObj.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Skeletal.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Fintype/List.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean,Mathlib/Data/QPF/Univariate/Basic.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/Set/Finite.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/LinearAlgebra/Dual.lean,Mathlib/LinearAlgebra/Ray.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/Quotients.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/FundamentalCone.lean,Mathlib/NumberTheory/NumberField/Embeddings.lean,Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/RepresentationTheory/Action/Concrete.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Ordinal.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/Birthday.lean,Mathlib/SetTheory/Game/Impartial.lean,Mathlib/SetTheory/Game/Ordinal.lean,Mathlib/SetTheory/Game/State.lean,Mathlib/SetTheory/Lists.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Surreal/Basic.lean,Mathlib/SetTheory/Surreal/Dyadic.lean,Mathlib/SetTheory/Surreal/Multiplication.lean,Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Rank.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Homotopy/HomotopyGroup.lean,Mathlib/Topology/Homotopy/Path.lean,Mathlib/Topology/Homotopy/Product.lean,Mathlib/Topology/MetricSpace/GromovHausdorff.lean,Mathlib/Topology/UniformSpace/Separation.lean,test/interactiveUnfold.lean | 68 | 1 | ['github-actions'] | nobody | 1 year ago | 578 days ago | 4 days |
| 16887 | metinersin | feat(ModelTheory/Complexity): define conjunctive and disjunctive formulas | Defines `FirstOrder.Language.BoundedFormula.IsConjunctive` and `FirstOrder.Language.BoundedFormula.IsDisjunctive`. --- - [ ] depends on: #16885 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 300/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 21 minutes |
| 16888 | metinersin | feat(ModelTheory/Complexity): Define conjunctive and disjunctive normal forms | Define `FirstOrder.Language.BoundedFormula.IsDNF` and `FirstOrder.Language.BoundedFormula.IsCNF`. --- - [ ] depends on: #16887 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 415/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 17 minutes |
| 16889 | metinersin | feat(ModelTheory/Complexity): Normal forms | Defines `FirstOrder.Language.BoundedFormula.toDNF` and `FirstOrder.Language.BoundedFormula.toCNF` - given a quantifier-free formula, these construct a semantically equivalent formula in disjunctive normal form and conjunctive normal form, respectively. --- - [ ] depends on: #16888 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 525/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 10 minutes |
| 5995 | astrainfinita | feat: add APIs about `Quotient.choice` | Some docs in this PR refer to the definition in #5576. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author RFC t-data | 76/6 | Mathlib/Data/Quot.lean | 1 | 3 | ['YaelDillies', 'astrainfinita', 'gebner'] | eric-wieser | 1 year ago | 694 days ago | 285 days |
| 14619 | Command-Master | chore: Merge `Trunc` to `Squash` | Remove `Trunc` and use `Squash` instead --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP new-contributor | 197/211 | Mathlib/CategoryTheory/EpiMono.lean,Mathlib/CategoryTheory/Preadditive/Biproducts.lean,Mathlib/Data/DFinsupp/Basic.lean,Mathlib/Data/Fintype/Basic.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Data/Fintype/Option.lean,Mathlib/Data/Fintype/Perm.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Semiquot.lean,Mathlib/GroupTheory/Perm/Cycle/Factors.lean,Mathlib/GroupTheory/Perm/Sign.lean,Mathlib/Logic/Equiv/List.lean | 13 | 3 | ['Command-Master', 'github-actions', 'vihdzp'] | nobody | 1 year ago | unknown | 0 seconds |
| 13156 | erdOne | refactor(Algebra/Module/LocalizedModule): Redefine `LocalizedModule` in terms of `OreLocalization`. | --- - [x] depends on: #13151 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 519/628 | Mathlib.lean,Mathlib/Algebra/Module/LocalizedModule.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/RingTheory/OreLocalization/Module.lean,Mathlib/RingTheory/OreLocalization/Ring.lean | 8 | 4 | ['github-actions', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball'] | nobody | 1 year ago | 567 days ago | 49 days |
| 16348 | urkud | refactor(Topology): require `LinearOrder` with `OrderTopology` | While the definition formally makes sense for a preorder, this topology is usually not the right one for a non-linear order (e.g., `Real × Real`). See [Zulip thread](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Open.20Ioi) --- This PR doesn't cleanup any API, I'm going to do it in a later PR. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 33/46 | Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Topology/Algebra/Order/LiminfLimsup.lean,Mathlib/Topology/Instances/Sign.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/Filter.lean,Mathlib/Topology/Order/MonotoneContinuity.lean | 6 | 10 | ['YaelDillies', 'github-actions', 'jcommelin', 'urkud'] | nobody | 1 year ago | 604 days ago | 3 days |
| 13965 | pechersky | feat(Data/DigitExpansion): reals via digit expansion are complete | --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #13964 | merge-conflict blocked-by-other-PR t-data | 3876/0 | Mathlib.lean,Mathlib/Data/DigitExpansion/Add.lean,Mathlib/Data/DigitExpansion/Defs.lean,Mathlib/Data/DigitExpansion/Hensel.lean,Mathlib/Data/DigitExpansion/Integer/Basic.lean,Mathlib/Data/DigitExpansion/Integer/Mul.lean,Mathlib/Data/DigitExpansion/Real/Basic.lean,Mathlib/Data/DigitExpansion/Real/CompleteSpace.lean,Mathlib/Data/DigitExpansion/Real/ConditionallyComplete.lean,docs/references.bib | 10 | 4 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 681 days ago | 10 minutes |
| 16984 | hrmacbeth | feat: extend `module` tactic to handle multiple rings, not strictly ordered by inclusion | The `module` tactic currently in Mathlib handles scalars from multiple rings, but only if for any two rings `R` and `S` which appear, either `R` is an algebra over `S` or vice versa. This PR extends the tactic by providing a syntax `module T`, which will handle scalars from any ring `R` which `T` is an algebra over. For example, ```lean example : (2:ℤ) • x = (2:ℚ≥0) • x := by module ``` fails since `ℤ` is not a `ℚ≥0`-algebra and `ℚ≥0` is not a `ℤ`-algebra, but ```lean example : (2:ℤ) • x = (2:ℚ≥0) • x := by module ℚ ``` works since `ℚ` is both a `ℤ`-algebra and a `ℚ≥0`-algebra. This PR is a quick proof-of-concept implementation, just to record the desired approach and tactic syntax. It should not be merged as-is. It has with a lot of code duplication and should be rewritten more efficiently (for example, `parse` and `parseEnsuringType` should be merged to a single function, and the `some`/`none` cases in `matchScalarsAux` should be merged to a uniform treatment) before being considered for merging to Mathlib. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 158/35 | Mathlib/Tactic/Module.lean,test/module.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 12750 | Command-Master | feat: define Gray code | --- Define binary reflected gray code, both as a permutation of `Nat` and as a permutation of `BitVec n`, and prove some theorems about them. Additionally, remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. - [ ] depends on: #12751 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-data new-contributor merge-conflict awaiting-author | 226/0 | Mathlib.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/GrayCode.lean,Mathlib/Data/Nat/Size.lean | 5 | 5 | ['Rida-Hamadani', 'alreadydone', 'github-actions', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 707 days ago | 16 days |
| 12414 | adomani | test: lint and unlint `·` | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 64/14 | Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Tactic/Linter/Multigoal.lean,test/Multigoal.lean | 4 | 4 | ['adomani', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 16647 | eric-wieser | feat: partitions of lists | The length of this list is the bell numbers. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics t-data | 311/0 | Mathlib.lean,Mathlib/Data/List/Partition.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 13514 | madvorak | feat(Computability/ContextFreeGrammar): closure under union | - [ ] depends on: #15895 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability blocked-by-other-PR | 448/4 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 50 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'leanprover-community-mathlib4-bot', 'madvorak'] | nobody | 1 year ago | 623 days ago | 72 days |
| 5364 | thorimur | feat: `wlog ... replacing` | This allows hypotheses to be removed from the set of generalized hypotheses. E.g. `wlog h : P replacing h'` will remove `h'` from the hypotheses of the type of `this` and from the context of the goal that will suppose `h`. See [zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/wlog.20.2E.2E.2E.20replacing.20.2E.2E.2E.3F). --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 125/18 | Mathlib/Tactic/WLOG.lean,test/wlog.lean | 2 | 2 | ['thorimur', 'urkud'] | nobody | 1 year ago | unknown | 0 seconds |
| 9654 | urkud | feat: add `@[mk_eq]` version of `@[mk_iff]` | The new attribute generates theorems like ```lean List.chain_eq : @List.Chain = fun {α} R a a_1 => a_1 = [] ∨ ∃ b l, R a b ∧ List.Chain R b l ∧ a_1 = b :: l ``` and is useful to rewrite in a theorem that argues about the properties of an unapplied inductive predicate. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 63/9 | Mathlib/Lean/Meta.lean,Mathlib/Tactic/MkIffOfInductiveProp.lean,test/MkIffOfInductive.lean | 3 | 6 | ['Vierkantor', 'github-actions', 'urkud'] | nobody | 1 year ago | 815 days ago | 25 days |
| 16704 | AntoineChambert-Loir | feat(Mathlib.Data.Ordering.Dickson): Dickson orders | Dickson orders are a particular class of well founded orders characterized by the fact that every nonempty set has finitely many minimal elements. They appear in the classical theory of Groebner bases because it is easier to prove that some sets are well founded using this property. WiP. In the `tfae` function, property 2 is exactly `Set.PartiallyWellOrderedOn`, so the PR should be rewritten so as to use that property (and not define `IsDickson`). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 324/0 | Mathlib.lean,Mathlib/Data/Ordering/Dickson.lean,scripts/noshake.json | 3 | 9 | ['AntoineChambert-Loir', 'b-mehta', 'github-actions'] | nobody | 1 year ago | 594 days ago | 2 days |
| 16355 | Ruben-VandeVelde | feat: odd_{add,sub}_one | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-number-theory | 12/0 | Mathlib/Algebra/Ring/Int.lean,Mathlib/Algebra/Ring/Parity.lean | 2 | 4 | ['Ruben-VandeVelde', 'github-actions', 'urkud'] | nobody | 1 year ago | 607 days ago | 16 hours |
| 8638 | alreadydone | refactor: noncommutative tensor product | Co-authored-by: Eric Wieser |
merge-conflict WIP t-algebra | 793/676 | Mathlib/Algebra/Module/LinearMap.lean,Mathlib/GroupTheory/GroupAction/DomAct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct.lean | 3 | 6 | ['alreadydone', 'eric-wieser', 'grhkm21', 'jjaassoonn'] | nobody | 1 year ago | unknown | 0 seconds |
| 14598 | Command-Master | chore: add typeclasses to unify various `add_top`, `add_eq_top`, etc. | Add the four typeclasses `IsTopAbsorbing`, `IsBotAbsorbing`, `NoTopSum`, `NoBotSum`, as additive equivalents for `MulZeroClass` and `NoZeroDivisors`. Add instances of these for `ENNReal`, `WithTop α`, `WithBot α`, `PUnit`, `EReal`, `PartENat`, `Measure`, `Interval` and `Filter`. Also split `Algebra/Order/AddGroupWithTop` to `Algebra/Order/Group/WithTop` and `Algebra/Order/Monoid/WithTop` --- Previous usages of lemmas with quantified names like `WithTop.add_top` have to be changed to just `add_top`. `add_lt_top` is `@[simp]`, in accordance with `ENNReal.add_lt_top` being `@[simp]`. This affects `WithTop.add_lt_top` which previously hadn't been `@[simp]`. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-order new-contributor | 264/195 | Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib.lean,Mathlib/Algebra/Order/Group/WithTop.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/PUnitInstances/Order.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Analytic/Meromorphic.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/NormedSpace/ENorm.lean,Mathlib/Analysis/SpecialFunctions/JapaneseBracket.lean,Mathlib/Analysis/SpecialFunctions/Log/ENNRealLog.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Nat/WithBot.lean,Mathlib/Data/Real/EReal.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Decomposition/Lebesgue.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL1.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSpace.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/Bochner.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean,Mathlib/MeasureTheory/Integral/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Martingale/Convergence.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean,Mathlib/RingTheory/UniqueFactorizationDomain.lean,Mathlib/Topology/EMetricSpace/Defs.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,Mathlib/Topology/MetricSpace/Lipschitz.lean | 57 | 30 | ['Command-Master', 'YaelDillies', 'github-actions'] | nobody | 1 year ago | 541 days ago | 7 days |
| 18636 | adomani | Test/latest import report dev | This PR is a test accompanying #18631. --- [](https://gitpod.io/from-referrer/) | merge-conflict CI | 147/0 | .github/workflows/latest_import.yml,lakefile.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 16885 | metinersin | feat(ModelTheory/Complexity): define literals | Defines `FirstOrder.Language.BoundedFormula.IsLiteral` and `FirstOrder.Language.BoundedFormula.simpleNot` - an auxiliary operation that takes the negation of a formula and does some simplification. --- - [x] depends on: #16800 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-logic | 148/5 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 4 | 20 | ['YaelDillies', 'awainverse', 'github-actions', 'mathlib4-dependent-issues-bot', 'metinersin'] | nobody | 1 year ago | 574 days ago | 5 hours |
| 18716 | jjaassoonn | feat(Algebra/Module/GradedModule): quotient and subgrading | - [ ] depends on: #9820 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR awaiting-CI merge-conflict | 997/191 | Counterexamples/HomogeneousPrimeNotPrime.lean,Mathlib.lean,Mathlib/Algebra/Group/Subgroup/Defs.lean,Mathlib/Algebra/Module/GradedModule/Basic.lean,Mathlib/Algebra/Module/GradedModule/QuotientGrading.lean,Mathlib/Algebra/Module/GradedModule/Subgrading.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Quotient.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,scripts/no_lints_prime_decls.txt | 12 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9341 | winstonyin | feat: Naturality of integral curves | Let `v` and `v'` be sections of the tangent bundle of manifolds `M` and `M'`, respectively, and let `f : M → M'` be a differentiable map. Then `f` maps integral curves of `v` to integral curves of `v'` if and only if `v` and `v'` are `f`-related. - [x] depends on: #8483 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-differential-geometry | 45/0 | Mathlib/Geometry/Manifold/IntegralCurve.lean,Mathlib/Topology/Algebra/Module/Basic.lean | 2 | 9 | ['github-actions', 'grunweg', 'leanprover-community-mathlib4-bot', 'winstonyin'] | nobody | 1 year ago | 843 days ago | 7 hours |
| 13248 | hcWang942 | feat: basic concepts of auction theory | ## Description
Formalise some core concepts and results in auction theory: this includes definitions for first-price and second-price auctions, as well as several fundamental results and helping lemmas.
This is the very first PR of the project formalizing core concepts and results in auction theory.
Our group is working on more contributions on the formalization of game theory prefix.
Co-authored-by: Ma Jiajun |
merge-conflict awaiting-author new-contributor t-logic | 204/0 | Mathlib.lean,Mathlib/GameTheory/Auction/Basic.lean,docs/references.bib | 3 | 148 | ['Shreyas4991', 'YaelDillies', 'eric-wieser', 'faenuccio', 'github-actions', 'grunweg', 'hcWang942', 'tb65536', 'urkud', 'vihdzp'] | hcWang942 | 1 year ago | 548 days ago | 109 days |
| 17675 | astrainfinita | perf: do not search algebraic hierarchy when searching `FunLike` hierarchy | --- Unification is still very slow. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 144/4 | Mathlib.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/Rat.lean,Mathlib/Algebra/Group/Equiv/Basic.lean,Mathlib/Algebra/GroupWithZero/Hom.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Order/Hom/Basic.lean,Mathlib/Algebra/Ring/CentroidHom.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Ring/Hom/Defs.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Operator/LinearIsometry.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Equiv.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Util/SetSynthOrder.lean,MathlibTest/TCSynth.lean,scripts/noshake.json | 24 | 5 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9344 | erdOne | feat: Add `AddGroup.FG` -> `Module.Finite ℤ` as instances | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 4/0 | Mathlib/RingTheory/Finiteness.lean | 1 | 4 | ['alreadydone', 'erdOne', 'leanprover-bot'] | nobody | 1 year ago | 832 days ago | 21 days |
| 12133 | ADedecker | feat: generalize instIsLowerProd to arbitrary products | Also change a bit the proof of the product case to match my own taste, feel free to tell if you prefer the old one. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 34/14 | Mathlib/Topology/Constructions.lean,Mathlib/Topology/Order/LowerUpperTopology.lean | 2 | 13 | ['Ruben-VandeVelde', 'TwoFX', 'github-actions', 'jcommelin', 'mans0954', 'mathlib-bors', 'riccardobrasca'] | nobody | 1 year ago | 683 days ago | 63 days |
| 16637 | astrainfinita | perf: reorder `extends` of `(Add)Monoid` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 46/51 | Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Ring/SumsOfSquares.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean | 20 | 3 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 597 days ago | 1 day |
| 18765 | astrainfinita | chore: changing `outParam` of `MulActionSemiHomClass` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 60/34 | Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Category/ModuleCat/Limits.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/GroupTheory/GroupAction/Hom.lean | 4 | 4 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15822 | kmill | feat: greedy colorings of finite graphs | Proves that the greedy coloring only takes `G.maxDegree + 1` colors. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics | 159/0 | Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 8661 | joelriou | feat(CategoryTheory/Sites): descent of sheaves | In this PR, it is shown that the category of sheaves on a site `(C, J)` identifies as a full subcategory of a category of families of sheaves equipped with a descent data (for a family of objects which cover the final object). Under suitable conditions, it shall be shown that this is an equivalence of categories (TODO). --- This shall be split in small PRs later. - [x] depends on: #8622 - [x] depends on: #8632 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 1396/26 | Mathlib.lean,Mathlib/CategoryTheory/Over.lean,Mathlib/CategoryTheory/Sites/CoverPreserving.lean,Mathlib/CategoryTheory/Sites/Descent.lean,Mathlib/CategoryTheory/Sites/EqualizerSheafCondition.lean,Mathlib/CategoryTheory/Sites/InducedTopology.lean,Mathlib/CategoryTheory/Sites/ObjectsCoverTop.lean,Mathlib/CategoryTheory/Sites/Over.lean,Mathlib/CategoryTheory/Sites/SheafHom.lean,Mathlib/CategoryTheory/Sites/Sieves.lean | 10 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 19055 | JLimperg | Test precompilation (batteries + aesop) again | merge-conflict | 9/8 | lake-manifest.json,lakefile.lean | 2 | 5 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds | |
| 10476 | shuxuezhuyi | feat(Topology/UniformSpace): define uniform preordered space | We define the semi-uniform structure and the uniform preordered space. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 94/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/UniformOrder.lean,docs/references.bib | 3 | 2 | ['shuxuezhuyi'] | nobody | 1 year ago | 756 days ago | 52 days |
| 17593 | astrainfinita | chore(Algebra/Order/GroupWithZero/Unbundled): deprecate useless lemmas, use `ZeroLEOneClass` | There are still some useless lemmas that were simply ported from `Algebra.Order.Monoid.Lemmas`, such as just chain an existing lemma with an assumption and lemmas whose assumptions imply `1 ≤ 0`. This PR removes them. Also, some lemmas have both assumptions like `1 < a` `0 < a`. This PR uses `ZeroLEOneClass` to remove redundant assumptions. --- - [ ] depends on: #17623 Ported from https://github.com/leanprover-community/mathlib/pull/16525 and https://github.com/leanprover-community/mathlib/pull/18158 Adapted from #9250. This version is easier to review. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR t-order | 188/48 | Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Counting.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Order/Field.lean | 6 | 4 | ['astrainfinita', 'github-actions', 'mathlib4-dependent-issues-bot', 'vihdzp'] | nobody | 1 year ago | 568 days ago | 20 hours |
| 17623 | astrainfinita | feat(Algebra/Order/GroupWithZero/Unbundled): add some lemmas | Some lemmas in `Algebra.Order.GroupWithZero.Unbundled` have incorrect or unsatisfactory names, or assumptions that can be omitted using `ZeroLEOneClass`. The lemmas added in this PR are versions of existing lemmas that use the correct or better name or `ZeroLEOneClass` to omit an assumption. The original lemmas will be deprecated in #17593. | New name | Old name | |-------------------------|-------------------------| | `mul_le_one_left₀` | `Left.mul_le_one_of_le_of_le` | | `mul_lt_one_of_le_of_lt_left₀` (`0 ≤ ·` version) / `mul_lt_one_of_le_of_lt_of_pos_left` | `Left.mul_lt_of_le_of_lt_one_of_pos` | | `mul_lt_one_of_lt_of_le_left₀` | `Left.mul_lt_of_lt_of_le_one_of_nonneg` | | `mul_le_one_right₀` | `Right.mul_le_one_of_le_of_le` | | `mul_lt_one_of_lt_of_le_right₀` (`0 ≤ ·` version) / `mul_lt_one_of_lt_of_le_of_pos_right` | `Right.mul_lt_one_of_lt_of_le_of_pos` | | `mul_lt_one_of_le_of_lt_right₀` | `Right.mul_lt_one_of_le_of_lt_of_nonneg` | The following lemmas use `ZeroLEOneClass`. | New name | Old name | |-------------------------|-------------------------| | `(Left.)one_le_mul₀` | `Left.one_le_mul_of_le_of_le` | | `Left.one_lt_mul_of_le_of_lt₀` | `Left.one_lt_mul_of_le_of_lt_of_pos` | | `Left.one_lt_mul_of_lt_of_le₀` | `Left.lt_mul_of_lt_of_one_le_of_nonneg` / `one_lt_mul_of_lt_of_le` (still there) | | `(Left.)one_lt_mul₀` | | | `Right.one_le_mul₀` | `Right.one_le_mul_of_le_of_le` | | `Right.one_lt_mul_of_lt_of_le₀` | `Right.one_lt_mul_of_lt_of_le_of_pos` | | `Right.one_lt_mul_of_le_of_lt₀` | `Right.one_lt_mul_of_le_of_lt_of_nonneg` / `one_lt_mul_of_le_of_lt` (still there) / `one_lt_mul` (still there) | | `Right.one_lt_mul₀` | `Right.one_lt_mul_of_lt_of_lt` | --- Split from #17593. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-zulip t-order | 146/44 | Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean | 2 | 11 | ['YaelDillies', 'astrainfinita', 'github-actions', 'j-loreaux'] | nobody | 1 year ago | 534 days ago | 33 days |
| 18969 | alreadydone | chore: generalize Module to NonUnitalSemiring | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 94/75 | Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Action/End.lean,Mathlib/Algebra/Group/Action/Prod.lean,Mathlib/Algebra/Group/Action/TypeTags.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/Submodule/Defs.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/Limits.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/GroupTheory/CoprodI.lean,Mathlib/LinearAlgebra/FreeModule/IdealQuotient.lean,Mathlib/LinearAlgebra/LinearDisjoint.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/TensorProduct/Submodule.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Flat/FaithfullyFlat.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Defs.lean,Mathlib/RingTheory/Ideal/Lattice.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Prod.lean,Mathlib/RingTheory/Presentation.lean,Mathlib/RingTheory/Smooth/Kaehler.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean | 31 | 11 | ['alreadydone', 'eric-wieser', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 17624 | astrainfinita | feat(Algebra/Order/GroupWithZero/Unbundled): generalize lemmas | --- - [ ] depends on: #17623 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR t-order | 121/26 | Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 568 days ago | 7 minutes |
| 17513 | astrainfinita | perf: do not search algebraic hierarchies when using `map_*` lemmas | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra awaiting-bench | 5/3 | Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/GroupTheory/GroupAction/Hom.lean | 2 | 10 | ['astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | 566 days ago | 4 days |
| 17515 | astrainfinita | perf: do not need `simp low` now | --- - [ ] depends on: #17513 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 12/10 | Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Analysis/SpecialFunctions/Bernstein.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/NumberTheory/LucasLehmer.lean | 4 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 571 days ago | 6 minutes |
| 19212 | Julian | feat(LinearAlgebra): add a variable_alias for VectorSpace | Taken directly from the variable_alias docs. Zulip: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/why.20.5Bvariable_alias.5D.20attribute.20is.20not.20used.20in.20Mathlib.3F --- This is the first actual variable alias added to mathlib. I haven't reviewed variable_alias fully, but it seems like there's at least 3 ways they could be distributed in Mathlib: * alongside whatever subfolder they "belong to" (which is what I've tentatively done here) * In a file called `Aliases` somewhere near the thing they alias (which seems less discoverable to me) * In a single file, a la `Mathlib.TrainingWheels` (with some less playful name) which is meant to define a bunch of more "friendly" aliases all in one place. I kind of like the idea of the third thing as a future module but perhaps it can be synthesized if/when there are more aliases? For now as I say I've done the first one, but please let me know if someone prefers something else. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 25/0 | Mathlib.lean,Mathlib/LinearAlgebra/VectorSpace.lean,scripts/noshake.json | 3 | 10 | ['Julian', 'PieterCuijpers', 'github-actions', 'urkud'] | nobody | 1 year ago | 521 days ago | 7 days |
| 19337 | zeramorphic | feat(Data/Finsupp): generalise `Finsupp` to any "zero" value | Remove the explicit dependence of `Finsupp` on `[Zero M]`, instead defining `Finsupp'` (better name pending) to be functions that are equal to a fixed value `z : M` cofinitely often. This PR is intended to do the initial work of replacing the definition of `Finsupp` with an instantiation of the more general definition, without adding any appropriate API. If accepted, the API development will follow in later PRs. Issues to consider: - Naming of `Finsupp'.` - Where should `Finsupp'` lemmas go? Do they need their own file/folder under `Data/`? Relevant Zulip threads: - https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Finsupp.20generalisations - https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Finsupp-like.20partial.20function Comments are welcome. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 203/83 | Archive/Wiedijk100Theorems/Partition.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Data/Finsupp/BigOperators.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/RingTheory/PowerBasis.lean,scripts/nolints_prime_decls.txt | 13 | 5 | ['github-actions', 'vihdzp', 'zeramorphic'] | nobody | 1 year ago | 519 days ago | 3 days |
| 18756 | astrainfinita | refactor: deprecate `DistribMulActionSemiHomClass` `MulSemiringActionSemiHomClass` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 50/28 | Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/GroupTheory/GroupAction/Hom.lean | 3 | 4 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 507 days ago | 31 days |
| 19125 | yhtq | feat: add theorems to transfer `IsGalois` between pairs of fraction rings | feat: add theorems to transfer `IsGalois` between pairs of fraction rings. - [x] depends on: #18404 - [x] depends on: #19124 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra new-contributor | 121/0 | Mathlib.lean,Mathlib/FieldTheory/Galois/IsFractionRing.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'tb65536'] | nobody | 1 year ago | 531 days ago | 33 minutes |
| 18841 | hrmacbeth | chore: change some `linarith`s to `linear_combination`s | Change 100 `linarith`s to `linear_combination`s; this is generally a slight speedup. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #18714 (not strictly blocked by this, but the speed comparison will be more informative after it) | merge-conflict WIP | 106/107 | Archive/Imo/Imo1959Q2.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2013Q5.lean,Archive/Imo/Imo2021Q1.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean,Mathlib/Analysis/Convex/Uniform.lean,Mathlib/Analysis/Convex/Visible.lean,Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/SpecialFunctions/Gamma/BohrMollerup.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/Monotone.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/NumberTheory/Modular.lean,Mathlib/NumberTheory/Transcendental/Liouville/LiouvilleWith.lean,Mathlib/Probability/Distributions/Pareto.lean | 30 | 29 | ['github-actions', 'grunweg', 'hrmacbeth', 'jcommelin', 'leanprover-bot', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 525 days ago | 3 days |
| 11142 | hmonroe | feat(ProofTheory): Define logical symbols abstractly; opens new top-level section, drawing from lean4-logic | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 468/1 | Mathlib.lean,Mathlib/Data/Fin/VecNotation.lean,Mathlib/ProofTheory/LogicSymbol.lean | 3 | 19 | ['PatrickMassot', 'YaelDillies', 'avigad', 'fpvandoorn', 'github-actions'] | nobody | 1 year ago | 694 days ago | 94 days |
| 11210 | hmonroe | Test commit | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 1950/1 | Mathlib.lean,Mathlib/Data/Fin/VecNotation.lean,Mathlib/ProofTheory/Calculus.lean,Mathlib/ProofTheory/FirstOrder/Arith/Language.lean,Mathlib/ProofTheory/FirstOrder/Basic/Syntax/Term.lean,Mathlib/ProofTheory/LogicSymbol.lean,Mathlib/ProofTheory/Matrix.lean,Mathlib/ProofTheory/Semantics.lean,Mathlib/ProofTheory/System.lean,docs/references.bib | 10 | 100 | ['github-actions'] | nobody | 1 year ago | 783 days ago | 2 days |
| 19621 | Command-Master | feat: Multiplicity and prime-adic valuation of derivations | --- - [ ] depends on: #19596 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR large-import | 397/13 | Mathlib.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Order/WithBot.lean,Mathlib/RingTheory/Derivation/Multiplicity.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/PrimeMultiplicity.lean | 9 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 517 days ago | 6 minutes |
| 18262 | joelriou | feat(Algebra/Category/ModuleCat/Presheaf): exterior powers of presheaves of modules | --- - [x] depends on: #18261 - [ ] depends on: #18236 - [ ] depends on: #18197 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR t-category-theory merge-conflict | 874/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/ExteriorPower.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/FunctorOfNatTrans.lean,Mathlib/Algebra/Category/ModuleCat/Pseudofunctor.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 18294 | astrainfinita | perf: make `Mul.toSMul` higher priority | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-bench t-algebra | 2/5 | Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Order/Field/Pointwise.lean,Mathlib/Combinatorics/Additive/AP/Three/Defs.lean,Mathlib/Topology/Algebra/Module/WeakBilin.lean | 4 | 4 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15269 | kkytola | feat: Add ENNReal.floor | A right-continuous floor function on `ENNReal`. --- - [x] depends on: #13938 - [ ] depends on: #15773 (general type class for `ENat`-valued floor functions) - [x] depends on: #15380 (topology on `ENat` is needed to state right continuity of the floor function) [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR t-order merge-conflict awaiting-author | 445/0 | Mathlib.lean,Mathlib/Algebra/Order/EFloor.lean,Mathlib/Data/ENNReal/Floor.lean,Mathlib/Data/Nat/Lattice.lean | 4 | 18 | ['YaelDillies', 'github-actions', 'kkytola', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 632 days ago | 57 minutes |
| 15773 | kkytola | feat: Add type class for ENat-valued floor functions | This PR adds a type class for extended natural number -valued floor functions. This is split off from #15269, where the suggestions were to make the floor function on ENNReal ENat-valued and to have an API mimicling FloorSemirings. Besides ENNReal, at least ENNRat would naturally satisfy the general type class. --- Two things are worth noting: * To fully mimic `FloorSemiring` API, also ceiling functions need to be added. The plan is to do that in a later PR. * The PR introduces the class `CastNatENatClass` to ensure that `natCast` and a coercion from `ENat` behave in the natural and order-respecing manner. This feels a little ad hoc, but such assumptions are needed for general `ENat`-valued floor functions to behave well. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-order | 231/0 | Mathlib.lean,Mathlib/Algebra/Order/EFloor.lean,Mathlib/Data/ENat/Basic.lean | 3 | 5 | ['YaelDillies', 'github-actions', 'kkytola', 'urkud'] | nobody | 1 year ago | 559 days ago | 66 days |
| 3251 | kmill | feat: deriving `LinearOrder` for simple enough inductive types | Uses the same machinery underlying the `Fintype` derive handler to derive a lexicographical `LinearOrder` for non-recursive inductive types that have no indices. In principle more complicated types can have `LinearOrder`s, but that would require a more sophisticated implementation. --- - [x] depends on: #3198 [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-meta | 82/0 | Mathlib.lean,Mathlib/Tactic/DeriveLinearOrder.lean | 2 | 5 | ['ChrisHughes24', 'kim-em', 'kmill', 'vihdzp'] | nobody | 1 year ago | 1107 days ago | 1 day |
| 3610 | TimothyGu | feat: derive Infinite automatically for inductive types | Deals with recursive types, but not mutually recursive types or types with indices right now. See docstring for details. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 517/0 | Mathlib.lean,Mathlib/Tactic/DeriveInfinite.lean,test/DeriveInfinite.lean | 3 | 11 | ['TimothyGu', 'digama0', 'eric-wieser', 'grunweg', 'kim-em', 'kmill'] | kmill | 1 year ago | 1093 days ago | 9 days |
| 16120 | awainverse | feat(ModelTheory/Algebra/Ring/Basic): Ring homomorphisms are a `StrongHomClass` for the language of rings | Adds an `IsAlgebraic` instance to the language of rings Adds a `StrongHomClass` instance to the type of ring homomorphisms between rings with `CompatibleRing` structures --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra RFC t-logic | 34/13 | Mathlib/ModelTheory/Algebra/Ring/Basic.lean | 1 | 10 | ['ChrisHughes24', 'YaelDillies', 'awainverse', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 479 days ago | 135 days |
| 20459 | Ruben-VandeVelde | chore: fix names of roots_C_mul_X_{add,sub}_C_of_IsUnit | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 11/5 | Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/Roots.lean | 2 | 2 | ['eric-wieser', 'github-actions'] | nobody | 1 year ago | 478 days ago | 4 days |
| 20527 | trivial1711 | refactor(Topology/UniformSpace/Completion): more descriptive names for `α → Completion α` | - We rename the various maps `α → Completion α` in order to make their names more consistent. - Let `α` be a uniform space. We rename the uniformly continuous function `α → Completion α` from `UniformSpace.Completion.coe'` to `UniformSpace.Completion.coe`. - Let `α` be a uniform additive group. We rename the additive group homomorphism `α →+ Completion α` from `UniformSpace.Completion.toCompl` to `UniformSpace.Completion.coeAddHom`. - Let `α` be a uniform ring. The ring homomorphism `α →+* Completion α` is called `UniformSpace.Completion.coeRingHom`; its name is unchanged. - Let `α` be a normed space over a field `𝕜`. We rename the linear isometry `α →ₗᵢ[𝕜] Completion α` from `UniformSpace.Completion.toComplₗᵢ` to `UniformSpace.Completion.coeₗᵢ`. - Let `α` be a normed space over a field `𝕜`. We rename the continuous linear map `α →L[𝕜] Completion α` from `UniformSpace.Completion.toComplL` to `UniformSpace.Completion.coeL`. - Let `α` be a normed additive group. We rename the norm preserving homomorphism `NormedAddGroupHom α (Completion α)` from `NormedAddCommGroup.toCompl` to `UniformSpace.Completion.coeNormedAddGroupHom`. - We analogously rename some other theorems. - We add some trivial theorems (all of which are proved by `rfl`) that state that the functions considered above are equal. We give all of them the `simp` and `norm_cast` attributes. - We add a new theorem `UniformSpace.Completion.coeAddHom_eq_coe` that states that `UniformSpace.Completion.coeAddHom` and `UniformSpace.Completion.coe` are equal as functions. - We similarly add a new theorem `UniformSpace.Completion.coeRingHom_eq_coe`. - We rename the theorem `UniformSpace.Completion.coe_toComplₗᵢ` to `UniformSpace.Completion.coeₗᵢ_eq_coe`. - We rename the theorem `UniformSpace.Completion.coe_toComplL` to `UniformSpace.Completion.coeL_eq_coe`. - We similarly add a new theorem `UniformSpace.Completion.coeNormedAddGroupHom_eq_coe`. - We change all occurrences of the string `((↑) : α → Completion α)` to `(coe : α → Completion α)` or just `coe`. - We put the statements of some theorems into simp normal form by using the plain function `coe` rather than the homomorphisms that carry more structure. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 130/92 | Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Complex/AbsMax.lean,Mathlib/Analysis/Complex/Liouville.lean,Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean,Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/Nonarchimedean.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformRing.lean,Mathlib/Topology/Category/UniformSpace.lean,Mathlib/Topology/MetricSpace/Completion.lean,Mathlib/Topology/UniformSpace/Completion.lean | 17 | 4 | ['eric-wieser', 'github-actions', 'trivial1711'] | nobody | 1 year ago | 473 days ago | 6 days |
| 17739 | Aaron1011 | feat(Topology/Order/DenselyOrdered): prove Not (IsOpen) for intervals | Prove that Iic/Ici/Ioc/Ico/Icc intervals are not open in densely ordered topologies with no min/max element --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology new-contributor | 27/0 | Mathlib/Topology/Order/DenselyOrdered.lean | 1 | 8 | ['github-actions', 'vihdzp'] | nobody | 1 year ago | 563 days ago | 1 hour |
| 18474 | astrainfinita | perf: lower the priority of `*WithOne.to*` instances | --- From #7873. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra t-data | 9/2 | Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/Data/Nat/Cast/Defs.lean | 3 | 7 | ['astrainfinita', 'eric-wieser', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 471 days ago | 76 days |
| 20656 | Komyyy | feat(Mathlib/Geometry/Manifold/VectorBundle/Sphere): convert orthogonal smooth `M → 𝕊ⁿ` & `M → ℝⁿ⁺¹` to smooth `M → T𝕊ⁿ` | Current Mathlib has no easy way to define function from a manifold to tangent bundles of sphere: `T𝕊ⁿ`. This PR gives this: `sphereTangentMap`. This convert orthogonal smooth `M → 𝕊ⁿ` & `M → ℝⁿ⁺¹` to smooth `M → T𝕊ⁿ`. I also proved that if `f : M → 𝕊ⁿ` & `g : M → ℝⁿ⁺¹` are smooth then `sphereTangentMap` of `f` & `g` is smooth too. --- ⚠ **CAUTION** I formalized this in my spare time. I don't have the energy to maintain the PR, but I create this PR so this may helps everyone. The only one thing to do is proof cleanup. TODO: - [x] `contDiff_uncurry_stereoInvFunAux` & `coe_sphere_comp_stereoInvFun` may have to be moved to `Mathlib.Geometry.Manifold.Instances.Sphere`. - [ ] Proof cleanup. Current proof may be redundant and ugly. [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-differential-geometry | 246/6 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/Geometry/Manifold/VectorBundle/Sphere.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 15711 | znssong | feat(Combinatorics/SimpleGraph): Some lemmas about walk, cycle and Hamiltonian cycle | --- These lemmas are separated from the `meow-sister/BondyChvatal` branch and will be needed for the proof of the Bondy-Chvátal theorem. - [x] depends on: #15536 - [x] depends on: #16294 | merge-conflict awaiting-author t-combinatorics new-contributor | 407/3 | Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Combinatorics/SimpleGraph/Walk.lean | 4 | 22 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'mathlib4-dependent-issues-bot', 'znssong'] | nobody | 1 year ago | 591 days ago | 9 days |
| 18629 | tomaz1502 | feat(Computability.Timed): Formalization of runtime complexity of List.merge | This PR adds the formalization of the runtime complexity of the merge function, defined in `Data/List/Sort`. Requires: https://github.com/leanprover-community/mathlib4/pull/15450 References: - Previous PR on mathlib3: https://github.com/leanprover-community/mathlib3/pull/14494/ - First discussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/BSc.20Final.20Project/near/220647062 - Second disussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Formalization.20of.20Runtime.20Complexity.20of.20Sorting.20Algorithms/near/284184450 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author new-contributor | 186/0 | Mathlib.lean,Mathlib/Computability/Timed/InsertionSort.lean,Mathlib/Computability/Timed/Merge.lean | 3 | 2 | ['github-actions', 'trivial1711'] | nobody | 1 year ago | 509 days ago | 33 days |
| 14412 | jjaassoonn | feat: show stalk of presheaf of modules is a module over stalk of ring | --- - [x] depends on: #14413 - [ ] depends on: #14501 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry blocked-by-other-PR workshop-AIM-AG-2024 | 966/2 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/OverColimitsRing'.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/OverColimitsRing.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/Limits/ConcreteCategory.lean,Mathlib/Geometry/RingedSpace/Basic.lean,Mathlib/Geometry/RingedSpace/Module.lean,Mathlib/Topology/Sheaves/Stalks.lean | 8 | 5 | ['github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot', 'smorel394'] | nobody | 1 year ago | unknown | 0 seconds |
| 8362 | urkud | feat(Asymptotics): define `ReflectsGrowth` | --- - [x] depends on: #8349 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 268/0 | Mathlib.lean,Mathlib/Analysis/Asymptotics/ReflectsGrowth.lean | 2 | 14 | ['YaelDillies', 'fpvandoorn', 'github-actions', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 659 days ago | 240 days |
| 6692 | prakol16 | feat: disjoint indexed union of local homeomorphisms | Add disjoint indexed union of local equivs and local homeomorphisms --- This is leading up to PRing some things related to covering spaces that I wrote a long time ago in lean 3 but never submitted a PR for. Note that this was converted using mathport. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 126/0 | Mathlib/Logic/Equiv/PartialEquiv.lean,Mathlib/Topology/PartialHomeomorph.lean | 2 | 4 | ['alreadydone', 'github-actions', 'winstonyin'] | nobody | 1 year ago | 559 days ago | 118 days |
| 18461 | hannahfechtner | feat: left and right common multiples mixins | add mixins for left and right common multiples. These carry the data of what factors are used to create the common multiples --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 78/0 | Mathlib/Algebra/Group/Defs.lean | 1 | 13 | ['github-actions', 'hannahfechtner', 'jcommelin', 'kbuzzard', 'kim-em', 'trivial1711'] | nobody | 1 year ago | 466 days ago | 69 days |
| 19291 | PieterCuijpers | feat(Algebra/Order/Hom): add quantale homomorphism | Definition of quantale homomorphisms as functions that are both semigroup homomorphisms and complete lattice homomorphisms. --- - [x] depends on: #19810 - [x] depends on: #19811 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 209/0 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Quantale.lean,scripts/noshake.json | 3 | 29 | ['PieterCuijpers', 'YaelDillies', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 470 days ago | 27 days |
| 19352 | hrmacbeth | chore: change some `nlinarith`s to `linear_combination`s | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 13/13 | Archive/Imo/Imo2021Q1.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Mathlib/Analysis/Normed/Group/AddCircle.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Increment.lean,Mathlib/NumberTheory/Modular.lean | 8 | 4 | ['github-actions', 'hrmacbeth', 'leanprover-bot'] | nobody | 1 year ago | 525 days ago | 2 hours |
| 20372 | jvlmdr | feat(MeasureTheory/Function): Add ContinuousLinearMap.bilinearCompLp(L) | Introduce ContinuousLinearMap.bilinearCompLp and bilinearCompLpL. Generalize eLpNorm_le_eLpNorm_mul_eLpNorm theorems to include constant C in bound condition. --- Expect this may be useful for defining tempered distributions from functions in `L^p`. The definitions more or less follow `ContinuousLinearMap.compLp...`. Names are loosely analogous to `ContinuousLinearMap.bilinearComp` and `SchwartzMap.bilinLeftCLM`. Note: I preferred the spelling `hpqr : p⁻¹ + q⁻¹ = r⁻¹` with `f` in `L^p` and `g` in `L^q` to `hpqr : 1 / p = 1 / q + 1 / r`. It's easier to obtain from `ENNReal.IsConjExponent` too. A few questions: - [ ] I defined `bilinear{Left,Right}LpL` in addition to `bilinearCompLpL` because `LinearMap.mkContinuous₂` is marked as `noncomputable` and `LinearMap.mkContinuous` is not. Is this worth the extra definitions? (Note: This is not visible in the source due to `noncomputable section`.) - [ ] Should I use `C : ℝ` instead of `C : NNReal` for `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'`? - [ ] Is it going to be painful to have `[Fact (1 ≤ p)] [Fact (1 ≤ q)] [Fact (1 ≤ r)]`? I don't think there's a way to avoid it though. Maybe providing specialized versions for `p.IsConjExponent q` with `L^1`? Naming: - [ ] Is it satisfactory to add a `'` to the `eLpNorm_le_eLpNorm_mul_eLpNorm ` definitions in `CompareExp.lean` where `≤ ‖f x‖ * ‖g x‖` has been replaced with `≤ C * ‖f x‖ * ‖g x‖`? These could replace the existing theorems, although I don't want to break backwards compatibility. There are 5 instances: `eLpNorm_le_eLpNorm_top_mul_eLpNorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm_top'`, `eLpNorm'_le_eLpNorm'_mul_eLpNorm''`, `eLpNorm_le_eLpNorm_mul_eLpNorm_of_nnnorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'` (I'm not sure why the existing theorem `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm` has an internal `'`) - [ ] Is `bilinearLeftLpL` a suitable name? Other options: `bilinearCompLpLeftL`, `bilinearCompLeftLpL`, `bilinLeftLpL` (analogous to `SchwartzMap.bilinLeftCLM`) [](https://gitpod.io/from-referrer/) | merge-conflict t-measure-probability new-contributor | 203/40 | Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSpace.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 458 days ago | 27 days |
| 2605 | eric-wieser | chore: better error message in linarith | On this mwe: ```lean import Mathlib.Tactic.Linarith example (s : Set ℕ) (h : s = s) : 0 ≤ 1 := by linarith ``` this now indicates where the internal error is coming from. Is there a better way of chaining errors than this? --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 12/1 | Mathlib/Tactic/Linarith/Preprocessing.lean | 1 | 3 | ['Vierkantor', 'harahu', 'kim-em', 'mo271'] | nobody | 1 year ago | 1103 days ago | 51 days |
| 11837 | trivial1711 | feat: completion of a uniform multiplicative group | Multiplicativize `Topology.Algebra.GroupCompletion`. That is, rewrite it in the multiplicative setting and recover the original results using `@[to_additive]`. - Because `@[to_additive]` doesn't work with `noncomputable section` (https://github.com/leanprover/lean4/pull/2610), some instances with `@[to_additive]` need to be explicitly marked with `noncomputable instance`. - One might be tempted to multiplicativize this definition from `Topology.Algebra.GroupCompletion`: ```lean instance [UniformSpace α] [Add α] : Add (Completion α) := ⟨Completion.map₂ (· + ·)⟩ ``` to this: ```lean @[to_additive] instance [UniformSpace α] [Mul α] : Mul (Completion α) := ⟨Completion.map₂ (· * ·)⟩ ``` However, as Eric Wieser pointed out, doing so would create a bad diamond with the definition ```lean instance [UniformSpace α] [TopologicalRing α] [UniformAddGroup α] [Ring α] : Mul (Completion α) := ⟨curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))⟩ ``` in `Topology.Algebra.UniformRing`. How should this diamond be resolved? Well, the definition of multiplication that uses `curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))` is the "correct" one. For example, it yields the correct result if `α` is `ℚ`, unlike the definition that uses `Completion.map₂ (· * ·)`. (This is because `Completion.map₂` yields junk values if used on a function which is not uniformly continuous. Note, however, that if multiplication on `α` *is* uniformly continuous, then `Completion.map₂ (· * ·)` and `curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))` are propositionally equal.) So, following Eric's suggestion, we remove the definition that uses `Completion.map₂ (· * ·)`, and generalize the other definition to any uniform space with a multiplication operation: ```lean @[to_additive] noncomputable instance [UniformSpace α] [Mul α] : Mul (Completion α) := ⟨curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))⟩ ``` This requires slightly modifying some of the proofs in `Topology.Algebra.GroupCompletion`. For example, suppose that `α` is a uniform group. Since we can no longer use `Completion.continuous_map₂`, it becomes more efficient to prove that the multiplication, inversion, and division operations on `Completion α` are uniformly continuous *before* we prove that `Completion α` is a group. - Previously, `Topology.Algebra.GroupCompletion` had an instance: ```lean instance [UniformSpace α] [Sub α] : Sub (Completion α) := ... ``` Naively multiplicativizing this would yield ```lean @[to_additive] instance [UniformSpace α] [Inv α] : Inv (Completion α) := ... ``` Unfortunately, this would conflict with `Topology.Algebra.UniformField`, which already instantiates `Inv (Completion α)` when `α` is a uniform field. Instead, we use two different `instance` declarations. (If `α` is an additive group, then this instantiates `Neg (Completion α)` twice, and the instances are syntactically equal.) ```lean @[to_additive] noncomputable instance [UniformSpace α] [Group α] : Inv (Completion α) := ... instance [UniformSpace α] [Neg α] : Neg (Completion α) := ... ``` This avoids the bad diamond (because a uniform field can never be a `Group`) while remaining backward compatible. Note that the `@[to_additive]` is necessary here, because it maintains the link between the additive setting and multiplicative setting. We use a similar method to instantiate `Div (Completion α)`. - Some definitions in this file involve a module structure on `α`. We leave these as is and do not attempt to multiplicativize them at all. - The instance of `DistribMulAction` must be multiplicativized to an instance of `MulDistribMulAction` manually. Zulip thread: https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Completion.20of.20a.20uniform.20multiplicative.20group --- # (Small) Issue Recall the following trick that this pull request uses to define inversion and negation on uniform spaces. The idea is that we define negation on the completion of any uniform space that has a negation operation, but we define inversion on only the completion of a uniform space that has the structure of a multiplicative group. We do this to avoid creating a bad diamond with the inversion operation on a uniform field. ```lean @[to_additive] noncomputable instance {α : Type*} [UniformSpace α] [Group α] : Inv (Completion α) := ... instance {α : Type*} [UniformSpace α] [Neg α] : Neg (Completion α) := ... ``` Now, suppose that we want to prove `coe_inv_of_group` (resp. `coe_neg`), which states that the coercion `α → Completion α` commutes with inversion (resp. negation). In the current version of this pull request, `coe_inv_of_group` (resp. `coe_neg`) only applies to uniform multiplicative (resp. additive) groups. However, we do not use the fact that multiplication (resp. addition) on `α` is uniformly continuous to prove it. We only use the fact that inversion (resp. negation) is continuous. So, what we really want is to have more general statements that look like this: ```lean theorem coe_inv_of_group {α : Type*} [UniformSpace α] [Group α] [ContinuousInv α] : ... theorem coe_neg {α : Type*} [UniformSpace α] [Neg α] [ContinuousNeg α] : ... ``` Note that `coe_inv_of_group` needs the assumption `[Group α]`, because otherwise inversion is not defined on `Completion α` at all. However, `coe_neg` does not need the analogous assumption `[AdditiveGroup α]`. The question is: If `coe_inv_of_group` and `coe_neg` are written in this more general form, how can we link them using `@[to_additive]`? Here is one option, but it obviously leaves something to be desired. ```lean @[to_additive coe_neg_do_not_use_this_use_the_more_general_version] theorem coe_inv_of_group {α : Type*} [UniformSpace α] [Group α] [ContinuousInv α] : ... theorem coe_neg {α : Type*} [UniformSpace α] [Neg α] [ContinuousNeg α] : ... ``` Co-authored-by: Eric Wieser --- [](https://gitpod.io/from-referrer/) | WIP t-algebra merge-conflict help-wanted t-topology | 342/217 | Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformField.lean,Mathlib/Topology/Algebra/UniformMulAction.lean,Mathlib/Topology/Algebra/UniformRing.lean | 9 | 14 | ['eric-wieser', 'github-actions', 'trivial1711'] | nobody | 1 year ago | 485 days ago | 101 days |
| 12670 | trivial1711 | feat: completion of a nonarchimedean multiplicative group | We prove that the completion of a nonarchimedean multiplicative group is a nonarchimedean multiplicative group. --- - [x] depends on: #12669 - [ ] depends on: #11837 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-topology blocked-by-other-PR | 358/228 | Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformField.lean,Mathlib/Topology/Algebra/UniformMulAction.lean,Mathlib/Topology/Algebra/UniformRing.lean | 9 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 482 days ago | 50 days |
| 21384 | alreadydone | experiment: make submodule quotient reducibly defeq to additive group quotient | --- [](https://gitpod.io/from-referrer/) | t-algebra | 1/1 | Mathlib/LinearAlgebra/Quotient/Defs.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 9449 | hmonroe | feat: Add Turing machine with the quintet definition (TMQ) and a chainable step function for each TM type | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author | 458/1 | Mathlib/Computability/TuringMachine.lean,Mathlib/Logic/PartArith.lean | 2 | 8 | ['eric-wieser', 'github-actions', 'hmonroe'] | nobody | 1 year ago | 756 days ago | 91 days |
| 18719 | astrainfinita | perf: lower the priority of `SemilinearMapClass.toAddHomClass` | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra awaiting-bench | 14/7 | Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unique.lean,MathlibTest/TCSynth.lean | 3 | 4 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 19697 | quangvdao | feat(BigOperators/Fin): Sum/product over `Fin` intervals | This PR adds new theorems about the sum/product of some vector over `Fin` intervals. One example is: ``` @[to_additive] theorem prod_Iic_succ (i : Fin n) : ∏ j ∈ Iic i.succ, v j = (∏ j ∈ Iic i.castSucc, v j) * v i.succ ``` --- - [x] depends on: #20360 This is in preparation for reworking `finSigmaFinEquiv` and `finProdFinEquiv` in #19013. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 87/12 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Data/Fintype/Fin.lean,Mathlib/Order/Interval/Finset/Fin.lean | 3 | 20 | ['Ruben-VandeVelde', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 1 year ago | 482 days ago | 6 days |
| 19353 | hrmacbeth | chore: golf some term/rw proofs using `linear_combination` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 47/102 | Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/MeasureTheory/Integral/RieszMarkovKakutani.lean,Mathlib/NumberTheory/Modular.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean,Mathlib/Topology/ContinuousMap/ZeroAtInfty.lean | 7 | 5 | ['github-actions', 'grunweg', 'hrmacbeth', 'leanprover-bot'] | grunweg | 1 year ago | 525 days ago | 2 hours |
| 20248 | peabrainiac | feat(Topology/Compactness): first-countable locally path-connected spaces are delta-generated | Shows that all first-countable locally path-connected spaces are delta-generated (so in particular all normed spaces and convex subsets thereof are), and that delta-generated spaces are equivalently generated by the unit interval or standard simplices. --- - [ ] depends on: #21616 In principle, this should be close to all that's required to show that all simplicial complexes and CW-complexes are delta-generated; I just haven't done it yet because I'm not sure which file to best do it in. [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import new-contributor merge-conflict awaiting-author t-topology | 1189/813 | Mathlib.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean,Mathlib/Topology/Compactness/DeltaGeneratedSpace.lean,Mathlib/Topology/Connected/LocPathConnected.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/Homotopy/HSpaces.lean,Mathlib/Topology/Path.lean | 9 | 22 | ['YaelDillies', 'github-actions', 'kbuzzard', 'mathlib4-dependent-issues-bot', 'peabrainiac'] | nobody | 1 year ago | 452 days ago | 39 days |
| 21610 | JLimperg | Aesop forward benchmark: forward precomp | Not a real PR, just for benchmarking. | merge-conflict | 30/27 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 7 | 3 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 21611 | JLimperg | Aesop forward benchmark: master no-precomp | Not a real PR, just for benchmarking. | merge-conflict | 30/27 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 7 | 4 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 21612 | JLimperg | Aesop forward benchmark: master precomp | Not a real PR, just for benchmarking. | merge-conflict | 30/27 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 7 | 3 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 10678 | adri326 | feat(Topology/UniformSpace): prove that a uniform space is completely regular | Provides the pseudometric definition of a uniform space (for any open set `s` and `x ∈ s`, there exists a finite family of pseudometric spaces on `X` and an `ε > 0`, such that the intersection of the balls of these pseudometric spaces is a subset of `s`), and uses it to prove that `UniformSpace X` implies `CompletelyRegularSpace X`. --- This PR aims to close the gap of pi-base's theorem [T345](https://topology.pi-base.org/theorems/T000345), which says that topological groups are completely regular. We already have a proof that topological groups are uniform, but it turns out that we do not have any connection between `UniformSpace X` and `CompletelyRegularSpace X`. There is an equivalence between `UniformSpace X` and `CompletelyRegularSpace X`: the former implies the latter, and the latter implies *the existence of* the former. This PR provides the first half of this equivalence. The construction of the pseudometric definition is based on N. Bourbaki, Chapter 9, Theorem 4.1 The proof that a uniform space is completely regular is based on [the outline on mathexchange](https://math.stackexchange.com/questions/494718/how-to-prove-that-every-uniform-space-is-completely-regular). I tried to outline the major steps of the different proofs inside of comments; I can happily be more verbose to clear up any confusion. See [the corresponding Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Some.20missing.2C.20accessible.2C.20topology.20results) for more context. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 332/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/Basic.lean,Mathlib/Topology/UniformSpace/CompletelyRegular.lean | 3 | 6 | ['ADedecker', 'adri326'] | ADedecker | 1 year ago | 786 days ago | 17 days |
| 18785 | erdOne | feat(CategoryTheory): command that generates instances for `MorphismProperty` | Co-authored-by: Calle Sönne --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory t-meta | 369/0 | Mathlib.lean,Mathlib/CategoryTheory/MorphismProperty/Tactic.lean,MathlibTest/AddMorphismPropertyInstances.lean,scripts/noshake.json | 4 | 19 | ['alexjbest', 'chrisflav', 'erdOne', 'github-actions', 'grunweg', 'jcommelin', 'joelriou'] | nobody | 1 year ago | 464 days ago | 52 days |
| 16311 | madvorak | feat(Computability): regular languages are context-free | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-computability | 72/0 | Mathlib.lean,Mathlib/Computability/Chomsky.lean,Mathlib/Computability/ContextFreeGrammar.lean | 3 | 7 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'madvorak'] | nobody | 1 year ago | unknown | 0 seconds |
| 19943 | AlexLoitzl | feat(Computability): Add Chomsky Normal Form Grammar and translation | - Define Chomsky normal form grammars - Add language-preserving translation between context-free grammars and Chomsky normal form grammars Co-authored-by: Martin Dvorak martin.dvorak@matfyz.cz --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author new-contributor | 3151/0 | Mathlib.lean,Mathlib/Computability/ChomskyNormalForm/Basic.lean,Mathlib/Computability/ChomskyNormalForm/EmptyElimination.lean,Mathlib/Computability/ChomskyNormalForm/LengthRestriction.lean,Mathlib/Computability/ChomskyNormalForm/TerminalRestriction.lean,Mathlib/Computability/ChomskyNormalForm/Translation.lean,Mathlib/Computability/ChomskyNormalForm/UnitElimination.lean,Mathlib/Computability/ContextFreeGrammar.lean | 8 | 59 | ['AlexLoitzl', 'YaelDillies', 'github-actions', 'kim-em', 'madvorak'] | nobody | 1 year ago | 448 days ago | 37 days |
| 21501 | sksgurdldi | feat(List): add sum_zipWith_eq_finset_sum | ### **Description:** This PR adds the lemma `List.sum_zipWith_eq_finset_sum` to `Mathlib.Algebra.BigOperators.Group.Finset.Basic`. #### **Statement:** The sum of the `zipWith` operation on two lists equals the sum of applying the operation to corresponding elements of the two lists, indexed over the minimum of their lengths. #### **Formal Statement:** ```lean lemma sum_zipWith_eq_finset_sum [Inhabited α] [Inhabited β] [AddCommMonoid γ] {op : α → β → γ} (l : List α) (m : List β) : (List.zipWith op l m).sum = ∑ x ∈ (Finset.range (Nat.min l.length m.length)), op (l[x]!) (m[x]!) ``` #### **Remarks:** - This lemma provides a useful equivalence between `List.zipWith` and summation over a `Finset.range` indexed by `Nat.min l.length m.length`. - It can be helpful in algebraic manipulations involving list-based summations. #### **Dependencies:** No additional dependencies. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 43/0 | Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean | 1 | 1 | ['github-actions', 'j-loreaux'] | nobody | 1 year ago | 435 days ago | 13 days |
| 12054 | adomani | feat: auto-bugs | This PR introduces a linter for suggesting bugs in tactics. See * #12077 * #12083 * #12084 for some bugs exposed by the test suite. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 737/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/MetaTesting.lean,scripts/noshake.json,test/MetaTesting.lean | 5 | 20 | ['adomani', 'eric-wieser', 'github-actions', 'joneugster', 'kim-em'] | joneugster | 1 year ago | 648 days ago | 45 days |
| 5062 | adomani | feat(Tactic/Prune + test/Prune): add `prune` tactic, for removing unnecessary hypotheses | This tactic removes very conservatively all local declarations that 1. do not appear in the main goal, 2. do not appear in a declaration that appears in the main goal, 3. ... and so on recursively. The main motivation for this tactic is that all available variables in the current `namespace/section` appear in the goal state, not just the ones that are needed for the statement to type-check. Using `prune` mitigates this situation. The tactic also admits an optional natural number argument: `prune n` removes all variables that have not appeared at the `(n+1)`-st stage in the above list. Thus, `prune 0` only leaves the variables needed for the statement to type-check. Also, for sufficiently large `n`, `prune n` is a synonym for `prune`. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/substitute.20for.20.60include.2Fomit.60.3F) --- [](https://gitpod.io/from-referrer/) | merge-conflict modifies-tactic-syntax awaiting-author t-meta | 181/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Prune.lean,test/Prune.lean | 4 | 5 | ['adomani', 'j-loreaux', 'kmill'] | nobody | 1 year ago | 856 days ago | 195 days |
| 22169 | JLimperg | Aesop forward benchmark: forward no-precomp naive | Not a real PR, just for benchmarking. | merge-conflict | 31/27 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 7 | 6 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 21433 | grunweg | chore: change more lemmas to be about enorm instead of nnnorm | --- - [x] depends on: #21782 - [x] depends on: #21783 (and this PR modifies the file split, and file splits are painful to merge over) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author carleson t-measure-probability | 172/71 | Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousFunctions.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean | 9 | 18 | ['RemyDegenne', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 440 days ago | 2 days |
| 22171 | JLimperg | Aesop forward benchmark: forward no-precomp naive rpinf pr-release | Not a real PR, just for benchmarking. | merge-conflict | 31/27 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 7 | 5 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 20454 | urkud | chore(TangentCone): review names | Also add some `@[simp]` attrs. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 201/139 | Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/FDeriv/RestrictScalars.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/Calculus/MeanValue.lean,Mathlib/Analysis/Calculus/TangentCone.lean,Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Calculus/VectorField.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/InverseDeriv.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/UniqueDifferential.lean,Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean,Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | 25 | 3 | ['github-actions', 'sgouezel', 'urkud'] | nobody | 1 year ago | 437 days ago | 4 days |
| 21608 | JLimperg | Aesop forward benchmark: forward no-precomp rpinf pr-release | Not a real PR, just for benchmarking. | merge-conflict | 38/29 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Data/Nat/Prime/Defs.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 8 | 13 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 21609 | JLimperg | Aesop forward benchmark: forward no-precomp | Not a real PR, just for benchmarking. | merge-conflict | 38/29 | Mathlib/Data/List/InsertIdx.lean,Mathlib/Data/Nat/Prime/Defs.lean,Mathlib/Tactic/Recall.lean,Mathlib/Topology/List.lean,Test.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 8 | 13 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 16550 | awainverse | feat(ModelTheory): A typeclass for languages expanding other languages | Defines `L.Expands L'` to consist of a privileged injective inclusion, `L'.Inclusion L`, from `L'` to `L`, corresponding to one language being a subset of the other in set-theoretic foundations. Replaces `L.IsOrdered` with `L.Expands Language.order` and `L.OrderLHom` with `Language.order.Inclusion L` Redefines `leSymb` in terms of `Language.order.Inclusion L` Deletions: - `FirstOrder.Language.IsOrdered` - `FirstOrder.Language.OrderLHom` - `instance : IsOrdered Language.order` - `sum.instIsOrdered` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 97/43 | Mathlib/ModelTheory/LanguageMap.lean,Mathlib/ModelTheory/Order.lean | 2 | 9 | ['YaelDillies', 'awainverse', 'github-actions'] | nobody | 1 year ago | 601 days ago | 17 hours |
| 10823 | alexkeizer | feat: convert curried type functions into uncurried type functions | Adds a conversion `TypeFun.ofCurried : CurriedTypeFun.{u, v} n -> TypeFun.{u, v} n`, where `CurriedTypeFun.{u,v} n` is a (def-eq) abbreviation for `Type u -> ... -> Type u -> Type v`, i.e., the type of *curried* functions taking `n` arguments of type `Type u` to return an element of `Type v`, and `TypeFun.{u, v} n` is an abbreviation for `TypeVec.{u} n -> Type v`. It is generally more idiomatic to define type functions with multiple arguments in the curried style, but in the QPF development we use the uncurried equivalent `TypeVec n -> Type _`. Thus, having a canonical conversion from curried functions to uncurried gives us a canonical way to ask if a curried type function, say `Sum` is a QPF (namely, "is there an instance of `MvQPF (TypeFun.ofCurried Sum)`"). --- This is code ported from https://github.com/alexkeizer/QpfTypes, where this conversion is crucial in presenting a high-level interface, in terms of idiomatic, curried, type functions to users, while being built on QPFs (and thus, uncurried typefunctions) underneath. There is also a conversion in the other direction, from uncurried to curried, which I've decided to PR later, to keep this PR smaller and hopefully easier to review. - [x] depends on: #10818 (all changes to `Fin2.lean` are part of 10818, not the current PR) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 66/0 | Mathlib.lean,Mathlib/Data/TypeFun.lean | 2 | 9 | ['YaelDillies', 'alexkeizer', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 676 days ago | 15 days |
| 13648 | urkud | feat(Topology/Module): generalize `ContinuousLinearMap.compSL` | Generalize `ContinuousLinearMap.compSL` to topological vector spaces. --- - [ ] depends on: #15217 This PR is not polished yet, but the main statement is there. @ADedecker This answers a question I asked you on Zulip a few months ago. [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict awaiting-author t-topology t-analysis | 23/18 | Mathlib/Analysis/NormedSpace/OperatorNorm/Bilinear.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean | 2 | 5 | ['fpvandoorn', 'github-actions', 'mathlib4-dependent-issues-bot', 'urkud'] | nobody | 1 year ago | 662 days ago | 28 days |
| 19372 | Command-Master | find defeq abuse using diagnostics | --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #19177 | merge-conflict blocked-by-other-PR large-import | 169/1 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/FindDefEqAbuse.lean,MathlibTest/FindDefEqAbuse.lean,lakefile.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 22408 | JLimperg | Aesop forward bench: precomp only rpinf | --- Not a real PR (yet), just for benchmarking. [](https://gitpod.io/from-referrer/) | merge-conflict dependency-bump | 5/3 | lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 4 | 6 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 20636 | eric-wieser | feat: multiplication of intervals in rings | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 36/1 | Mathlib/Algebra/Order/Interval/Basic.lean | 1 | 16 | ['Timeroot', 'YaelDillies', 'eric-wieser', 'github-actions'] | nobody | 1 year ago | 459 days ago | 17 days |
| 22340 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Beck-Chevalley Conditions) | Building on top of the API of `ExponentiableMorphism` in #22321, we state and prove Beck-Chevalley conditions. This will be crucial for our development of polynomial functors along exponentiable morphisms.
Co-authored-by: Emily Riehl |
WIP blocked-by-other-PR t-category-theory large-import merge-conflict | 1144/24 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Comma/Over/Sections.lean,Mathlib/CategoryTheory/Galois/Examples.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/BeckChevalley.lean,docs/references.bib | 8 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 428 days ago | 17 seconds |
| 21959 | BGuillemet | feat(Topology/ContinuousMap): Stone-Weierstrass theorem for MvPolynomial | Add the subalgebra of multivariate polynomials and prove it separates points, on the same model as `ContinuousMap/Polynomial.lean`. Prove the Stone-Weierstrass theorem and some variations for multivariate polynomials. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology new-contributor | 285/1 | Mathlib.lean,Mathlib/Topology/ContinuousMap/MvPolynomial.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 422 days ago | 16 days |
| 19177 | adomani | test: the findDefEqAbuse linter | This is a prototype, as per [this Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Locating.20defeq.20abuse) --- [](https://gitpod.io/from-referrer/) | merge-conflict large-import | 126/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/FindDefEqAbuse.lean,MathlibTest/FindDefEqAbuse.lean | 5 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 22359 | adomani | feat(whitespace): do not allow indented doc-strings | In a doc-string, Do not allow the first character after the first line break to be a space. --- There are approximately 2.5k exceptions. I think that they should be unindented, judging from the sample that I looked at, but won't act on it, unless there is a clear plan to fix and merge this modification! --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter large-import | 222/70 | Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Mathlib.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean,Mathlib/Analysis/Asymptotics/ExpGrowth.lean,Mathlib/Data/Matroid/Circuit.lean,Mathlib/Init.lean,Mathlib/Lean/Meta/RefinedDiscrTree/Encode.lean,Mathlib/LinearAlgebra/Dimension/StrongRankCondition.lean,Mathlib/LinearAlgebra/LinearIndependent/Basic.lean,Mathlib/LinearAlgebra/LinearIndependent/Defs.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Topology/Path.lean,Mathlib/Topology/UnitInterval.lean,MathlibTest/LintDocstring.lean,lakefile.lean | 20 | 1 | ['github-actions'] | nobody | 1 year ago | 428 days ago | 42 minutes |
| 18470 | astrainfinita | perf: lower the priority of `Normed*.to*` instances | --- From #7873. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra t-analysis | 28/0 | Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean | 2 | 9 | ['astrainfinita', 'github-actions', 'jcommelin', 'leanprover-bot'] | nobody | 1 year ago | 417 days ago | 129 days |
| 17368 | Felix-Weilacher | feat(Topology/Baire/BaireMeasurable): add the Kuratowski-Ulam theorem | Add the Kuratowski-Ulam theorem, which one can think of as a "Fubini" for Baire category. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 187/1 | Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Topology/Baire/BaireMeasurable.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/GDelta/Basic.lean | 5 | 6 | ['Felix-Weilacher', 'github-actions', 'urkud'] | nobody | 1 year ago | 553 days ago | 22 days |
| 8767 | eric-wieser | refactor(Cache): tidy lake-manifest parsing in Cache | This now respects local copies of Mathlib dependencies (though in practice these invalidate the *online* cache because to point to local copies of Mathlib, the hash for `lakefile.lean` and `lake-manifest.json` is first invalidated). --- - [x] depends on: #11492 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 49/49 | Cache/Hashing.lean,Cache/IO.lean,lake-manifest.json | 3 | 8 | ['digama0', 'eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 596 days ago | 119 days |
| 22434 | qawbecrdtey | feat(Mathlib/Analysis/Normed/Lp/WithLp): Added more instances for `WithLp` | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 51/22 | Mathlib/Analysis/Normed/Lp/WithLp.lean | 1 | 11 | ['eric-wieser', 'github-actions', 'leanprover-bot', 'qawbecrdtey'] | nobody | 1 year ago | 420 days ago | 1 day |
| 15578 | znssong | feat(Function): Fixed points of function `f` with `f(x) >= x` | We added some lemmas of fixed points of function `f` with `f(x) >= x`, where `f : α → α` is a function on a finite type `α`. This will be needed in proof of Bondy-Chvátal theorem. --- See also branch `meow-sister/BondyChvatal`. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis new-contributor | 82/0 | Mathlib.lean,Mathlib/Dynamics/FixedPoints/Basic.lean,Mathlib/Dynamics/FixedPoints/Increasing.lean | 3 | 32 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'urkud', 'vihdzp', 'znssong'] | nobody | 1 year ago | 597 days ago | 29 days |
| 22660 | Ruben-VandeVelde | chore: follow naming convention around Group.IsNilpotent | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 133/67 | Mathlib/GroupTheory/Frattini.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/SpecificGroups/ZGroup.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 410 days ago | 10 days |
| 13999 | adomani | feat: a linter to flag potential confusing conventions | Currently, the linter flags all uses of * `a - b` where `a b : Nat`; * `a / b` where `a b : Nat` or `a b : Int`; * `a / 0` more or less whenever the type of `a` has a `0` and a division. This comes up often when starting to use Lean and hopefully the flag can help mitigate initial confusions. When the local context contains the relevant inequality/divisibility hypothesis, the linter is quiet. A recent [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/not.20understanding.20deliberate.20error.20with.20.60ring.60.20over.20.E2.84.95/near/445879310) --- To make sure that the linter does not produce errors, #14007 activates the linter on "all" of mathlib. The expectation is that no error is thrown, just warnings. [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 251/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/Papercut.lean,MathlibTest/Papercut.lean | 4 | 24 | ['Julian', 'YaelDillies', 'adomani', 'eric-wieser', 'github-actions'] | nobody | 1 year ago | 670 days ago | 7 days |
| 19013 | quangvdao | feat(Algebra/BigOperators/Fin): Add `finSigmaFinEquiv` | This PR adds `finSigmaFinEquiv` which is the equivalence `(i : Fin m) × Fin (n i) ≃ Fin (∑ i, n i)`. This is the dependent version of `finProdFinEquiv`. CI should be passing, but there are two things I'd like feedback on: 1. When defining the mappings, I have to consider `m = 0` separately. Is there a more uniform definition? 2. I'm proving this as a step toward defining `Fin.join`, which is the analogue of `List.join`. I can now technically define `Fin.join` as: ``` variable {a : Fin n → ℕ} {α : (i : Fin n) → (j : Fin (a i)) → Sort*} def join (v : (i : Fin n) → (j : Fin (a i)) → α i j) (k : Fin (∑ i, a i)) : α (finSigmaFinEquiv.invFun k).1 (finSigmaFinEquiv.invFun k).2 := v (finSigmaFinEquiv.invFun k).1 (finSigmaFinEquiv.invFun k).2 ``` but this looks horrible. This highly motivates refactoring `invFun` as two new definitions: ``` def func1 {n : ℕ} (a : Fin n → ℕ) (k : Fin (∑ i, a i)) : Fin n := sorry def func2 {n : ℕ} (a : Fin n → ℕ) (k : Fin (∑ i, a i)) : Fin (a (func1 a k)) := sorry ``` I'm not sure what to call these functions. The analogues in the non-dependent case are `divNat` and `modNat`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 92/16 | Mathlib/Algebra/BigOperators/Fin.lean | 1 | 14 | ['YaelDillies', 'eric-wieser', 'github-actions', 'quangvdao'] | nobody | 1 year ago | 529 days ago | 3 days |
| 20389 | eric-wieser | feat: generalize results to `WithLp 0` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 116/53 | Mathlib/Analysis/Normed/Lp/PiLp.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 19227 | adomani | fix(CI): unwrap `lake test` in problem matcher | ... and also add a `#guard_msgs` in `AssertImported` test, so that `lake test` properly fails. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/CI.3A.20noisy.20.22test.20mathlib.22/near/483126955) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 9/20 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,MathlibTest/AssertImported.lean | 5 | 2 | ['bryangingechen', 'github-actions'] | nobody | 1 year ago | 505 days ago | 21 days |
| 15774 | kkytola | feat: Topology on `ENat` | This PR may contain some results that are not in the PR that adds a toppology on `ENat`. --- The immediate motivation is to be able to make the right continuity statement of the extended floor function on `ENNReal`, when this floor function is made `ENat`valued as suggested in the PR review of #15269. The API here is modelled on the early parts of [the corresponding ENNReal file](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Instances/ENNReal.html#top), although much of this case is more trivial. - [x] depends on: #15380 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology t-order | 161/9 | Mathlib/Data/ENat/Basic.lean,Mathlib/Topology/Instances/ENat.lean | 2 | 4 | ['YaelDillies', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 626 days ago | 1 hour |
| 16009 | Command-Master | acyclic graph | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-combinatorics | 232/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 20222 | eric-wieser | feat: generalize lemmas about derivatives | Rather than creating a huge diff by shuffling things around, this generalizes everything in-place and swaps between `section`s for topological and normed vector spaces. The rationale for this approach is that: * we may further generalize the results of this file, and this avoids us jumbling up the order multiple times unnecessarily. * this greatly reduces the chance of merge conflicts --- - [ ] depends on: #21065 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis | 554/50 | Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,MathlibTest/Recall.lean | 3 | 8 | ['adomani', 'eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 458 days ago | 7 days |
| 21018 | markimunro | feat(Data/Matrix): add file with key definitions and theorems about elementary row operations | Prove that each elementary row operation is equivalent to a multiplication by an elementary matrix, has another row operation which inverts it, and that each elementary matrix has a left inverse.
This is a very large PR and I understand it will take time. This is my first one and will likely have issues but I will be ready to answer questions/fix them as soon as possible.
Co-authored-by: Christopher Lynch |
t-data enhancement new-contributor merge-conflict awaiting-author | 1230/0 | Mathlib.lean,Mathlib/Data/Matrix/ElementaryRowOperations.lean,Mathlib/Data/Matrix/GaussianElimination.lean,Mathlib/Data/Matrix/GaussianEliminationOld,Mathlib/Data/Matrix/oldnames,et --hard 18533caba32,lean-toolchain | 7 | 17 | ['chrisflav', 'eric-wieser', 'github-actions', 'j-loreaux', 'markimunro'] | nobody | 1 year ago | 420 days ago | 23 days |
| 23514 | eric-wieser | refactor: smooth over Lattice/LinearOrder inheritance | This fixes the forgetful inheritance in `CompleteLinearOrder` and `ConditionallyCompleteLinearOrder`, which previously did not carry `compare` fields. (edit: moved to #23515) The following is the inheritance diagram before, where the dotted lines are manual instances. Note that every lattice typeclass that extends `LinearOrder` has to implement another dotted line edge, and remember to copy all the necessary data fields. ```mermaid graph TD LinearOrder --> Min,Max; LinearOrder --> PartialOrder; Lattice --> PartialOrder; CompleteLinearOrder --> Lattice; ConditionallyCompleteLinearOrder --> Lattice; LinearOrder-.-> Lattice; CompleteLinearOrder -.-> LinearOrder; ConditionallyCompleteLinearOrder -.-> LinearOrder; ``` This change introduces two new auxiliary typeclasses, to encapsulate these troublesome edges. `LinearOrderedLattice` can be thought of as `LinearOrder`, but with `sup`/`inf` instead of `min`/`max`. This is crucial, because it ensures the duplicate fields are merged in `extends CompleteLattice X, LinearOrderedLattice X`, which would not be the case for `extends CompleteLattice X, LinearOrder X`. The result is: ```mermaid graph TD LinearOrder --> Min,Max; LinearOrder --> LinearOrderBase; LinearOrderBase --> PartialOrder; Lattice --> PartialOrder; LinearOrderedLattice -.-> LinearOrder; LinearOrderedLattice --> LinearOrderBase; LinearOrderedLattice --> Lattice; CompleteLinearOrder --> LinearOrderedLattice; ConditionallyCompleteLinearOrder --> LinearOrderedLattice; ``` --- - [ ] depends on: #23515 - [ ] [](https://gitpod.io/from-referrer/) | merge-conflict | 85/66 | Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Order/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Defs/LinearOrder.lean,Mathlib/Order/Lattice.lean | 7 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 395 days ago | 15 minutes |
| 20746 | JLimperg | Aesop forward branch test | --- This is not a real PR; I just want to benchmark this Aesop branch. [](https://gitpod.io/from-referrer/) | merge-conflict | 14/6 | .github/workflows/build.yml,Mathlib/Data/Nat/Prime/Defs.lean,lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 6 | 11 | ['JLimperg', 'Kha', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 22810 | pechersky | feat(Counterexamples): metric space not induced by norm | Because the distance is not homogeneous --- [](https://gitpod.io/from-referrer/) - [x] depends on: #22845 | merge-conflict WIP t-topology t-analysis | 202/1 | Counterexamples.lean,Counterexamples/NotBoundedSMulMetricSpace.lean,Mathlib.lean,Mathlib/Analysis/Normed/PiNat.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean,Mathlib/Topology/MetricSpace/Polish.lean | 6 | 21 | ['eric-wieser', 'github-actions', 'loefflerd', 'mathlib4-dependent-issues-bot', 'pechersky'] | nobody | 1 year ago | 409 days ago | 23 hours |
| 13124 | astrainfinita | chore: remove `CovariantClass` and `ContravariantClass` | Lean cannot handle `CovariantClass` and `ContravariantClass` correctly - TC slowness - [Zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/TC.20slowness) - https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1691792488 - It may also have made #6326 fail. - Needs a weird hack to find instance: #9252 --- - [x] depends on: #13154 [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 602/486 | Mathlib/Algebra/AddConstMap/Basic.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/Algebra/Group/Submonoid/Pointwise.lean,Mathlib/Algebra/Group/UniqueProds/Basic.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Group/Action.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/Units.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean,Mathlib/Algebra/Order/GroupWithZero/WithZero.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Ring/Subring/Pointwise.lean,Mathlib/Algebra/Ring/Subsemiring/Pointwise.lean,Mathlib/Analysis/SumOverResidueClass.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/Order/Filter/IsBounded.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | 37 | 6 | ['MichaelStollBayreuth', 'astrainfinita', 'github-actions', 'leanprover-bot', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15212 | victorliu5296 | feat: Add fundamental theorem of calculus-2 for Banach spaces | add the Mean Value Theorem for Banach spaces to the library and include reference for the theorem statement This theorem states that if `f : X → Y` is differentiable along the line segment from `a` to `b`, then the change in `f` equals the integral of its derivative along this path. This extends the mean value theorem to Banach spaces. This can be used for the eventual proof of the Newton-Kantorovich theorem with 1 constant contained inside the added reference. Here is the discussion on Zulipchat: https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Contributing.20FTC-2.20for.20Banach.20spaces | t-measure-probability new-contributor merge-conflict awaiting-author t-analysis | 60/1 | Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | 1 | 3 | ['github-actions', 'hrmacbeth', 'victorliu5296'] | nobody | 1 year ago | 584 days ago | 51 days |
| 22888 | plp127 | perf: replace `Lean.Expr.swapBVars` with a better? implementation | Replaces `Lean.Expr.swapBVars` with a version that traverses the expression. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 14/12 | Mathlib/Tactic/FunProp/ToBatteries.lean | 1 | 23 | ['eric-wieser', 'github-actions', 'joneugster', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'plp127'] | eric-wieser and joneugster | 1 year ago | 409 days ago | 4 days |
| 15943 | urkud | feat: add `ProdQuotientMapSpace` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 731/11 | Mathlib.lean,Mathlib/Topology/Basic.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Maps/ProdQuotient.lean | 4 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | unknown | 0 seconds |
| 22579 | kvanvels | doc(Topology/Defs/Induced): fix comments on three functions related to RestrictGenTopology | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology documentation awaiting-author | 10/9 | Mathlib/Topology/Defs/Induced.lean,Mathlib/Topology/RestrictGen.lean | 2 | 4 | ['github-actions', 'kvanvels', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 1 year ago | 410 days ago | 12 days |
| 19771 | robertylewis | perf: qqify two functions in linarith | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 17/24 | Mathlib/Tactic/Linarith/Frontend.lean,Mathlib/Tactic/Linarith/Verification.lean | 2 | 5 | ['github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-bot-assistant', 'robertylewis'] | nobody | 1 year ago | unknown | 0 seconds |
| 22308 | plp127 | feat (Analysis/Convex): Generalize `Convex` lemmas to `StarConvex` | This PR generalizes many lemmas assuming `Convex 𝕜 s` to assume `StarConvex 𝕜 0 s`. --- - [x] depends on: #22421 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis new-contributor | 30/18 | Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/GaugeRescale.lean,Mathlib/Analysis/Convex/Star.lean,Mathlib/Analysis/LocallyConvex/AbsConvexOpen.lean | 4 | 5 | ['Paul-Lez', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 21488 | imbrem | feat(CategoryTheory/Monoidal): premonoidal categories | Add support for premonoidal categories --- Still want to add support for: - Premonoidal braided/symmetric categories - The monoidal coherence theorem, which I've already ported in my `discretion` library - The `coherence` tactic, which should work fine for premonoidal categories too but wanted to get this in front of reviewers ASAP to make sure my general approach was alright [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory new-contributor | 900/361 | Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/End.lean,Mathlib/CategoryTheory/GradedObject/Monoidal.lean,Mathlib/CategoryTheory/Localization/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/CoherenceLemmas.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/CategoryTheory/Monoidal/End.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/FunctorCategory.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,MathlibTest/StringDiagram.lean | 21 | 9 | ['YaelDillies', 'github-actions', 'grunweg', 'imbrem', 'kim-em', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 387 days ago | 57 days |
| 21525 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Prelim) | This PR defines the basic preliminaries for defining locally cartesian closed categories (LCCCs). In particular, using the calculus of mates we define certain natural isomorphisms involving `Over.star` and `Over.pullback` which will be crucial in defining the right adjoint to the pullback functor in the development of LCCCs. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory large-import | 338/24 | Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Galois/Examples.lean | 3 | 13 | ['b-mehta', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'sinhp'] | nobody | 1 year ago | 387 days ago | 36 days |
| 22319 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Sections Right Adjoint) | we define the `Over.sections` functor in the file `CategoryTheory.Comma.Over.Sections` and prove that it is a right adjoint to the `Over.star`, thereby solving an existing TODO in `Over.pullback` file. The `sections` functor is used to define the right adjoint to the pullback functor `Over.pullback` in the development of LCCCs. Moreover, the rest of added lemmas and theorems to `CategoryTheory.Comma.Over.Pullback` are crucial for the development of LCCCs in the next PR. --- - [ ] depends on: #21525 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 547/24 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Comma/Over/Sections.lean,Mathlib/CategoryTheory/Galois/Examples.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 429 days ago | 34 minutes |
| 22321 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Definition) | This PR defines locally cartesian closed categories in terms of existence of the pushforward functors (right adjoint to the pullback functor) for all morphisms. We develop basic API and prove the following:
1. Existence of the pushforward functors is equivalent to cartesian closed slices.
2. Any locally cartesian closed category with a terminal object is cartesian closed.
3. The slices of a locally cartesian closed category are locally cartesian closed.
Some of the content is based on the project of formalization of polynomial functors at the Trimester "Prospect of Formal Mathematics" at the Hausdorff Institute (HIM) in Bonn. https://github.com/sinhp/Poly
I found this implementation of locally cartesian closed categories amenable to polynomial functors formalization.
Co-authored-by: Emily Riehl |
merge-conflict blocked-by-other-PR t-category-theory large-import | 812/24 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Comma/Over/Sections.lean,Mathlib/CategoryTheory/Galois/Examples.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean | 6 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 429 days ago | 5 minutes |
| 13653 | adomani | feat: the unusedSetOptionIn linter | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter large-import | 199/0 | Mathlib.lean,Mathlib/Algebra/Homology/HomotopyCategory/Triangulated.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/UnnecessarySetOptionIn.lean,MathlibTest/UnnecessarySetOptionIn.lean | 6 | 15 | ['adomani', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | unknown | 0 seconds |
| 19425 | hrmacbeth | perf: gcongr forward-reasoning adjustment | This PR changes the "forward-reasoning" component of `gcongr`, rendering it more efficient, particularly in problems with a large number of variables/hypotheses in the context.
Previously `gcongr` attempted to match *every* `LocalDecl` against *every* node in the parse tree using *each* of the five implemented `@[gcongr_forward]` mini-tactics: matching directly, matching after applying `symm`, matching after applying `le_of_lt`, etc etc.
The new algorithm filters out the non-Prop `LocalDecl`s, and also adjusts the `@[gcongr_forward]` extensions so that, rather than re-apply the relevant lemmas (`symm`, `le_of_lt`, etc) at every node in the parse tree, the lemmas are applied in advance to the `LocalDecl`s and the result (if successful) stored.
The performance effect on mathlib as a whole is miniscule, but it speeds up the profiler's count of "tactic execution of Mathlib.Tactic.GCongr" in the newly-added test from 257 ms to 47 ms, and has a similar effect on real-life examples in an analysis project of mine.
Co-authored-by: Mario Carneiro |
merge-conflict awaiting-author | 130/59 | Mathlib/Order/Lattice.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GCongr/ForwardAttr.lean,MathlibTest/GCongr/inequalities.lean | 4 | 17 | ['Vierkantor', 'github-actions', 'hrmacbeth', 'leanprover-bot', 'leanprover-community-bot-assistant'] | Vierkantor | 1 year ago | 519 days ago | 1 day |
| 20873 | vbeffara | feat(Topology/Covering): path lifting and homotopy lifting | This proves the existence and uniqueness of path and homotopy lifts through covering maps. --- I tried to separate as much of the proof as possible into separate PRs (which are already in Mathlib now), but the proof here relies on a monolithic construction of an explicit lift along a well-chosen subdivision, in `partial_lift`, with associated definitions. Only one standalone lean file added. An older WIP PR #10084 by Junyan Xu @alreadydone proves similar results using a very similar construction for path lifting, with a different argument to obtain continuity for homotopy lifting. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology new-contributor | 281/1 | Mathlib.lean,Mathlib/Topology/Covering/Basic.lean,Mathlib/Topology/Covering/Lift.lean | 3 | 9 | ['alreadydone', 'github-actions', 'grunweg', 'vbeffara'] | nobody | 1 year ago | 461 days ago | 5 days |
| 22817 | peabrainiac | feat(CategoryTheory/Sites): local sites | Defines local sites and shows that sheaves of types on them form a local topos, in that the global sections functor `Sheaf.Γ` has a right adjoint `Sheaf.codisc` that is fully faithful. --- - [x] depends on: #22816 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 263/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/FunctorCategory/Shapes/Products.lean,Mathlib/CategoryTheory/Limits/Types.lean,Mathlib/CategoryTheory/Sites/GlobalSections.lean,Mathlib/CategoryTheory/Sites/LocalSite.lean,Mathlib/CategoryTheory/Sites/Sheaf.lean | 6 | 4 | ['github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 416 days ago | 9 minutes |
| 24040 | astrainfinita | refactor: unbundle algebra from `(NonUnital){Seminormed, Normed}(Comm)Ring` | --- - [ ] depends on: #23966 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR merge-conflict slow-typeclass-synthesis t-analysis | 3775/3674 | Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/CPolynomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/Linear.lean,Mathlib/Analysis/Analytic/OfScalars.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Analytic/Polynomial.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Defs.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoundedVariation.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/BoxIntegral/Integrability.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Measure.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/Classes.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Integral.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Isometric.lean,Mathlib/Analysis/CStarAlgebra/ContinuousLinearMap.lean,Mathlib/Analysis/CStarAlgebra/ContinuousMap.lean,Mathlib/Analysis/CStarAlgebra/Exponential.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Defs.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/CStarAlgebra/lpSpace.lean,Mathlib/Analysis/Calculus/AddTorsor/AffineMap.lean,Mathlib/Analysis/Calculus/AddTorsor/Coord.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/BumpFunction/Convolution.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/BumpFunction/Normed.lean,Mathlib/Analysis/Calculus/Conformal/InnerProduct.lean,Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/CPolynomial.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Analysis/Calculus/ContDiff/WithLp.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Shift.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/Deriv/Star.lean,Mathlib/Analysis/Calculus/Deriv/Support.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Calculus/DiffContOnCl.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Bilinear.lean | 630 | 5 | ['astrainfinita', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 16314 | astrainfinita | chore(Data/Quot): deprecate `ind*'` APIs | --- - [x] depends on: #16264 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 247/287 | Counterexamples/CliffordAlgebraNotInjective.lean,Mathlib/Algebra/Colimit/Module.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Subobject/FactorThru.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Computability/Reduce.lean,Mathlib/Computability/Tape.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/GroupTheory/Complement.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Hom.lean,Mathlib/GroupTheory/Coset/Basic.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean,Mathlib/GroupTheory/PresentedGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SchurZassenhaus.lean,Mathlib/GroupTheory/Sylow.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/LinearAlgebra/Projectivization/Basic.lean,Mathlib/LinearAlgebra/Quotient/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/RepresentationTheory/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Congruence/Basic.lean,Mathlib/RingTheory/Flat/FaithfullyFlat/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Valuation/Quotient.lean,Mathlib/Topology/Algebra/Group/TopologicalAbelianization.lean,Mathlib/Topology/Algebra/InfiniteSum/Module.lean,Mathlib/Topology/Separation/Basic.lean | 65 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 381 days ago | 55 days |
| 23509 | eric-wieser | refactor: Make ENNReal an abbrev | The `Coe` instance becomes `CoeTC` to match what we do for `WithTop` (such that the priority kicks in) Probably we could have both copies and things would be ok. --- [](https://gitpod.io/from-referrer/) This includes part of #23750 | merge-conflict t-data | 22/66 | Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/BigOperators.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/MeasureTheory/Measure/Sub.lean,Mathlib/MeasureTheory/Measure/TightNormed.lean,Mathlib/Topology/MetricSpace/PartitionOfUnity.lean | 7 | 22 | ['eric-wieser', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'leanprover-community-mathlib4-bot', 'mattrobball', 'urkud'] | nobody | 1 year ago | 382 days ago | 5 days |
| 24060 | eric-wieser | chore(MeasureTheory): use `0` instead of `const _ 0` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-measure-probability | 30/20 | Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Function/SimpleFuncDense.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Countable.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/Probability/StrongLaw.lean | 7 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | unknown | 0 seconds |
| 24058 | astrainfinita | refactor: unbundle algebra from `*NormedField` | --- - [ ] depends on: #24040 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR merge-conflict slow-typeclass-synthesis t-analysis | 4602/4346 | Archive/Hairer.lean,Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/CPolynomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/Linear.lean,Mathlib/Analysis/Analytic/OfScalars.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Analytic/Polynomial.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Defs.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoundedVariation.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/BoxIntegral/Integrability.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Measure.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/Classes.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Integral.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Isometric.lean,Mathlib/Analysis/CStarAlgebra/ContinuousLinearMap.lean,Mathlib/Analysis/CStarAlgebra/ContinuousMap.lean,Mathlib/Analysis/CStarAlgebra/Exponential.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Defs.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/CStarAlgebra/lpSpace.lean,Mathlib/Analysis/Calculus/AddTorsor/AffineMap.lean,Mathlib/Analysis/Calculus/AddTorsor/Coord.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/BumpFunction/Convolution.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/BumpFunction/Normed.lean,Mathlib/Analysis/Calculus/Conformal/InnerProduct.lean,Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/CPolynomial.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Analysis/Calculus/ContDiff/WithLp.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Pi.lean,Mathlib/Analysis/Calculus/Deriv/Polynomial.lean,Mathlib/Analysis/Calculus/Deriv/Pow.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Shift.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/Deriv/Star.lean,Mathlib/Analysis/Calculus/Deriv/Support.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean | 665 | 7 | ['astrainfinita', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 11455 | adomani | fix: unsqueeze simp, re Yaël's comments on #11259 | This PR reverts/simplifies some of the "squeeze `simp`" changes in #11259. See #11259 for context. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 3/6 | Mathlib/Algebra/Group/Conj.lean,Mathlib/Data/Seq/WSeq.lean | 2 | 8 | ['Ruben-VandeVelde', 'YaelDillies', 'grunweg', 'loefflerd', 'robertylewis', 'urkud'] | nobody | 1 year ago | 679 days ago | 93 days |
| 7325 | eric-wieser | chore: use preimageIso instead of defeq abuse for InducedCategory | This makes a few things slightly more verbose, but the type casts are now explicit in those places. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory awaiting-CI | 22/21 | Mathlib/CategoryTheory/EssentialImage.lean,Mathlib/CategoryTheory/Monoidal/Braided.lean,Mathlib/CategoryTheory/Monoidal/Subcategory.lean | 3 | 1 | ['grunweg'] | nobody | 1 year ago | unknown | 0 seconds |
| 7874 | astrainfinita | chore: make `IsScalarTower A A B` and `IsScalarTower A B B` higher priority | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra awaiting-CI | 10/9 | Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Data/Rat/Cast/Defs.lean,Mathlib/GroupTheory/GroupAction/Ring.lean | 4 | 3 | ['astrainfinita', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 13038 | adomani | feat: Mathlib weekly reports | This PR introduces a weekly cron job that computes a "global" report on the evolution of Mathlib in the previous week. It consists of * a CI workflow with a cron job that runs at minight on Sunday (`.github/workflows/mathlib_stats.yaml`); * a Lean file extracting a categorized list of "all" the declarations in Mathlib (`scripts/count_decls.lean`); * a bash file computing Git-diff-related information and collating the data from the Lean file (`scripts/mathlib_stats.sh`); * a convenience CI workflow that is triggered on adding the `test-ci` label and results in posting on the PR and on Zulip the report (`.github/workflows/mathlib_stats_label.yaml`). The second CI workflow is intended to be removed just before/right after the PR is ready to merge. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113488-general) [Thread for the reports](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Mathlib.20weekly.20change.20report) --- [](https://gitpod.io/from-referrer/) | awaiting-author CI t-meta | 338/0 | .github/workflows/mathlib_stats.yaml,.github/workflows/mathlib_stats_label.yaml,scripts/count_decls.lean,scripts/mathlib_stats.sh | 4 | 10 | ['adomani', 'github-actions', 'grunweg', 'kim-em', 'kmill'] | nobody | 1 year ago | 655 days ago | 57 days |
| 5952 | eric-wieser | feat: add Qq wrappers for ToExpr | --- - [ ] depends on: #6699 (to appease the linter) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-CI t-meta | 247/150 | Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/VecNotation.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Tactic/DeriveToExpr.lean,Mathlib/Tactic/FBinop.lean,Mathlib/Tactic/ToExpr.lean,Mathlib/Util/Qq.lean,test/DeriveToExpr.lean,test/vec_notation.lean | 9 | 7 | ['eric-wieser', 'gebner', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 987 days ago | 29 days |
| 15483 | astrainfinita | chore(GroupTheory/Coset): reduce defeq abuse | --- - [x] depends on: #15482 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 114/60 | Mathlib/GroupTheory/Commensurable.lean,Mathlib/GroupTheory/Coset.lean,Mathlib/GroupTheory/QuotientGroup.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/MeasureTheory/Measure/Haar/Quotient.lean,Mathlib/Topology/Algebra/Group/Compact.lean | 6 | 14 | ['astrainfinita', 'eric-wieser', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball', 'mergify', 'urkud'] | nobody | 1 year ago | 629 days ago | 4 days |
| 16594 | astrainfinita | perf: reorder `extends` and remove some instances in algebra hierarchy | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 240/92 | Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Prod.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/Rat.lean,Mathlib/Algebra/Ring/SumsOfSquares.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/FieldTheory/SplittingField/Construction.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/Order/Interval/Finset/Box.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/Util/NoInstances.lean,scripts/noshake.json | 50 | 8 | ['astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | 585 days ago | 14 days |
| 24106 | astrainfinita | refactor: unbundle algebra from `*CStarAlgebra` | --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #24058 | t-algebra blocked-by-other-PR merge-conflict slow-typeclass-synthesis t-analysis | 4702/4459 | Archive/Hairer.lean,Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/CPolynomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/Linear.lean,Mathlib/Analysis/Analytic/OfScalars.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Analytic/Polynomial.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Defs.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoundedVariation.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/BoxIntegral/Integrability.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Measure.lean,Mathlib/Analysis/CStarAlgebra/ApproximateUnit.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/Classes.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Integral.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Isometric.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/CStarAlgebra/ContinuousLinearMap.lean,Mathlib/Analysis/CStarAlgebra/ContinuousMap.lean,Mathlib/Analysis/CStarAlgebra/Exponential.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/Analysis/CStarAlgebra/Hom.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Defs.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/PositiveLinearMap.lean,Mathlib/Analysis/CStarAlgebra/SpecialFunctions/PosPart.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/CStarAlgebra/lpSpace.lean,Mathlib/Analysis/Calculus/AddTorsor/AffineMap.lean,Mathlib/Analysis/Calculus/AddTorsor/Coord.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/BumpFunction/Convolution.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/BumpFunction/Normed.lean,Mathlib/Analysis/Calculus/Conformal/InnerProduct.lean,Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/CPolynomial.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Analysis/Calculus/ContDiff/WithLp.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Pi.lean,Mathlib/Analysis/Calculus/Deriv/Polynomial.lean,Mathlib/Analysis/Calculus/Deriv/Pow.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean | 670 | 5 | ['astrainfinita', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 13780 | adomani | deprecate injective | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 31/9 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,Mathlib/Init/Function.lean,lake-manifest.json,lakefile.lean | 7 | 2 | ['github-actions', 'grunweg'] | nobody | 1 year ago | unknown | 0 seconds |
| 19467 | quangvdao | feat(MvPolynomial/Equiv): Add `MvPolynomial.finSuccEquivNth` | This PR adds `MvPolynomial.finSuccEquivNth`, which is the algebra isomorphism between `MvPolynomial (Fin (n + 1)) R` and `Polynomial (MvPolynomial (Fin n) R)` by identifying the `p`-th variable as the indeterminate.
This generalizes `MvPolynomial.finSuccEquiv` which is only for the `0`-th variable. The supporting theorems for the `Nth` version are identical to the current version, with the `Nth` version deduced from the former.
These changes require new definitions in `Finsupp/Fin`, which is a separate PR.
Co-authored-by: Yaël Dillies |
merge-conflict t-algebra blocked-by-other-PR | 541/163 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/Tuple/Basic.lean,Mathlib/Data/Finsupp/Fin.lean,scripts/nolints_prime_decls.txt | 7 | 9 | ['acmepjz', 'github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 1 year ago | 522 days ago | 13 minutes |
| 20313 | thefundamentaltheor3m | feat(Data/Complex/Exponential): prove some useful results about the complex exponential. | This PR proves two basic results about the complex exponential: * `abs_exp_mul_I (x : ℂ) : abs (Complex.exp (I * x)) = Real.exp (-x.im)` * `one_sub_rexp_re_le_abs_one_sub_cexp (x : ℂ) : 1 - Real.exp x.re ≤ Complex.abs (1 - Complex.exp x)` Both results were proved as part of the sphere packing project. There's a chance they're too specific for mathlib, but I thought they were worth PRing anyway. Would it also be a good idea to tag `abs_exp_mul_I` with `simp`? Feedback/suggestions welcome. Note: `one_sub_rexp_re_le_abs_one_sub_cexp` was proved by Bhavik Mehta @b-mehta --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis new-contributor | 167/141 | Mathlib.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/ERealExp.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev.lean,Mathlib/Data/Complex/Exponential/Defs.lean,Mathlib/Data/Complex/Exponential/Lemmas.lean,Mathlib/Data/Complex/ExponentialBounds.lean,Mathlib/Tactic/FunProp.lean,MathlibTest/Recall.lean,MathlibTest/positivity.lean | 10 | 12 | ['b-mehta', 'github-actions', 'kim-em', 'thefundamentaltheor3m', 'trivial1711'] | nobody | 1 year ago | 462 days ago | 8 days |
| 22698 | Kiolt | feat: notation for whisker(Left/Right)Iso | From Toric --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory toric | 175/113 | Mathlib/Algebra/Homology/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Bicategory/Basic.lean,Mathlib/CategoryTheory/Bicategory/Coherence.lean,Mathlib/CategoryTheory/Bicategory/Extension.lean,Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Strong.lean,Mathlib/CategoryTheory/Bicategory/SingleObj.lean,Mathlib/CategoryTheory/Closed/Functor.lean,Mathlib/CategoryTheory/Closed/Ideal.lean,Mathlib/CategoryTheory/Enriched/FunctorCategory.lean,Mathlib/CategoryTheory/GradedObject/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Braided/Reflection.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Monoidal/Preadditive.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/Tactic/CategoryTheory/BicategoricalComp.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Normalize.lean,Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean | 27 | 21 | ['Kiolt', 'YaelDillies', 'b-mehta', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 415 days ago | 3 days |
| 19613 | madvorak | refactor(Combinatorics/Optimization/ValuedCSP): make only valid `FractionalOperation` possible | Originally `FractionalOperation` was any multiset (possible empty). Then `FractionalOperation.IsValid` said it was nonempty. Instead, I would like to make it nonempty by definition. As a result, empty/invalid fractional operation couldn't be declared at all. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 14/17 | Mathlib/Combinatorics/Optimization/ValuedCSP.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | 508 days ago | 9 days |
| 20730 | kuotsanhsu | feat(LinearAlgebra/Matrix/SchurTriangulation): prove Schur decomposition/triangulation | `Matrix.schur_triangulation` shows that a matrix over an algebraically closed field is unitarily similar to an upper triangular matrix --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 317/2 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Block.lean,Mathlib/LinearAlgebra/Matrix/SchurTriangulation.lean,Mathlib/Logic/Equiv/Basic.lean | 4 | 14 | ['eric-wieser', 'github-actions', 'kim-em', 'kuotsanhsu'] | nobody | 1 year ago | 458 days ago | 13 days |
| 19117 | eric-wieser | feat: derivatives of matrix operations | These are finally possible to state after #19108. However, a lot of bundled `ContinuousLinearMap`s are missing. --- - [x] depends on: #19108 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 336/22 | Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/Matrix.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Matrix.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 12605 | astrainfinita | chore: attribute [induction_eliminator] | Add attribute [induction_eliminator] to `AdjoinRoot.induction_on` `ENat.recTopCoe` `ENNReal.recTopCoe` `Finset.induction` `Magma.AssocQuotient.induction_on` `ManyOneDegree.ind_on` `Module.Ray.ind` (and add `Orientation.ind` for `Orientation`, an abbrev of it. I wish that we do not need to add it in the future.) `Multiset.induction` `MvPolynomial.induction_on` `OnePoint.rec` `Opposite.rec'` `Ordinal.limitRecOn` `PartENat.casesOn` `Polynomial.induction_on'` `QuotientAddGroup.induction_on'` (and add `AddCircle.induction_on` for `AddCircle`, an abbrev of it. I wish that we do not need to add it in the future.) `QuotientGroup.induction_on'` (doesn't actually work) `Real.Angle.induction_on` `SimplexCategory.rec` `Trunc.induction_on` --- - [x] depends on: #13476 - [x] depends on: #13264 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 354/342 | Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Group/Finset.lean,Mathlib/Algebra/BigOperators/Group/Multiset.lean,Mathlib/Algebra/BigOperators/Ring.lean,Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/GCDMonoid/Multiset.lean,Mathlib/Algebra/Group/Subgroup/Finite.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/Algebra/Lie/Weights/Basic.lean,Mathlib/Algebra/Module/BigOperators.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Derivation.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Algebra/Polynomial/Degree/Lemmas.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Eval.lean,Mathlib/Algebra/Polynomial/Induction.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean,Mathlib/Algebra/Polynomial/PartialFractions.lean,Mathlib/Algebra/Polynomial/Smeval.lean,Mathlib/Algebra/Tropical/BigOperators.lean,Mathlib/AlgebraicTopology/DoldKan/NCompGamma.lean,Mathlib/AlgebraicTopology/SimplexCategory.lean,Mathlib/AlgebraicTopology/SplitSimplicialObject.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Asymptotics/Asymptotics.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/Deriv/Polynomial.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Fourier/AddCircle.lean,Mathlib/Analysis/NormedSpace/Exponential.lean,Mathlib/Analysis/NormedSpace/Multilinear/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/PolynomialExp.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean,Mathlib/Combinatorics/SetFamily/Compression/Down.lean,Mathlib/Combinatorics/SetFamily/FourFunctions.lean,Mathlib/Combinatorics/SetFamily/HarrisKleitman.lean,Mathlib/Computability/Reduce.lean,Mathlib/Data/DFinsupp/Basic.lean,Mathlib/Data/DFinsupp/WellFounded.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finset/Lattice.lean,Mathlib/Data/Finset/NAry.lean,Mathlib/Data/Fintype/Sum.lean,Mathlib/Data/Multiset/Antidiagonal.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Multiset/Bind.lean,Mathlib/Data/Multiset/Fold.lean,Mathlib/Data/Multiset/Lattice.lean,Mathlib/Data/Multiset/Pi.lean,Mathlib/Data/Multiset/Powerset.lean,Mathlib/Data/Multiset/Sections.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Set/Pointwise/BigOperators.lean,Mathlib/FieldTheory/IntermediateField.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/Geometry/Manifold/Algebra/Monoid.lean,Mathlib/Geometry/RingedSpace/Basic.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/Geometry/RingedSpace/PresheafedSpace/Gluing.lean,Mathlib/GroupTheory/Coset.lean,Mathlib/GroupTheory/NoncommPiCoprod.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/LinearAlgebra/Determinant.lean,Mathlib/LinearAlgebra/Eigenspace/Basic.lean,Mathlib/LinearAlgebra/FiniteDimensional.lean,Mathlib/LinearAlgebra/LinearIndependent.lean,Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/LinearAlgebra/Projectivization/Basic.lean,Mathlib/LinearAlgebra/Ray.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Logic/Hydra.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean,Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Integral/Lebesgue.lean,Mathlib/MeasureTheory/Integral/Marginal.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean,Mathlib/MeasureTheory/Measure/AddContent.lean | 140 | 14 | ['YaelDillies', 'astrainfinita', 'eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 709 days ago | 4 days |
| 23859 | urkud | feat(Topology/../Order/Field): generalize to `Semifield` | .. from a linear ordered field to a linear ordered semifield--- - [ ] depends on: #23857 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 245/219 | Mathlib/Algebra/Order/Group/Pointwise/Interval.lean,Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean,Mathlib/Topology/Algebra/Order/Field.lean,Mathlib/Topology/Order/Basic.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 387 days ago | 4 minutes |
| 24219 | Paul-Lez | feat: linear independence of the tensor product of two linearly independent families | This is still WIP (the proofs are a little too long, and some lemmas need to be moved to other files!) From Toric --- [](https://gitpod.io/from-referrer/) | WIP t-algebra toric | 193/0 | Mathlib/LinearAlgebra/LinearIndependent/Tprod.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | 376 days ago | 3 minutes |
| 23810 | b-reinke | chore(Order/Interval): generalize succ/pred lemmas to partial orders | Many lemmas in `Mathlib/Order/Interval/Set/SuccPred.lean`and `Mathlib/Order/Interval/Finset/SuccPred.lean` also work for partial orders. They are generalized in this PR by introducing different sections for `PartialOrder` and `LinearOrder` assumptions in the respective files. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order | 231/89 | Mathlib/Order/Interval/Finset/SuccPred.lean,Mathlib/Order/Interval/Set/SuccPred.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 372 days ago | 16 days |
| 24285 | madvorak | chore(Algebra/*-{Category,Homology}): remove unnecessary universe variables | Discussions: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Call.20for.20help.3A.20technical.2F.20organisational.20debt/with/513620128 https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Algebra.20and.20.60Type*.60/with/513558902 https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Task.2026.3A.20Replace.20Type.20u.20by.20Type*.20wherever.20possible/with/513592993 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 542/916 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Field.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Central/Basic.lean,Mathlib/Algebra/Central/Defs.lean,Mathlib/Algebra/Central/TensorProduct.lean,Mathlib/Algebra/CharP/Pi.lean,Mathlib/Algebra/CharP/Quotient.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Finsupp.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/Field/IsField.lean,Mathlib/Algebra/Field/MinimalAxioms.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Field/Subfield/Defs.lean,Mathlib/Algebra/FreeNonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Equiv/Finite.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Hom/End.lean,Mathlib/Algebra/Group/Hom/Instances.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Invertible/Defs.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/TypeTags/Finite.lean,Mathlib/Algebra/Group/TypeTags/Hom.lean,Mathlib/Algebra/Group/Units/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/Algebra/Group/WithOne/Basic.lean,Mathlib/Algebra/Group/WithOne/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Pi.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/NeZero.lean,Mathlib/Algebra/Lie/Abelian.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Lie/CartanMatrix.lean,Mathlib/Algebra/Lie/CartanSubalgebra.lean,Mathlib/Algebra/Lie/Character.lean,Mathlib/Algebra/Lie/Classical.lean,Mathlib/Algebra/Lie/DirectSum.lean,Mathlib/Algebra/Lie/Free.lean,Mathlib/Algebra/Lie/Ideal.lean,Mathlib/Algebra/Lie/IdealOperations.lean,Mathlib/Algebra/Lie/Matrix.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Lie/OfAssociative.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Lie/SkewAdjoint.lean,Mathlib/Algebra/Lie/Solvable.lean,Mathlib/Algebra/Lie/Subalgebra.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/Algebra/Lie/TensorProduct.lean,Mathlib/Algebra/Lie/UniversalEnveloping.lean,Mathlib/Algebra/Module/Basic.lean,Mathlib/Algebra/Module/CharacterModule.lean,Mathlib/Algebra/Module/DedekindDomain.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/Equiv/Opposite.lean,Mathlib/Algebra/Module/Lattice.lean,Mathlib/Algebra/Module/LinearMap/Basic.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/MinimalAxioms.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/Module/Opposite.lean,Mathlib/Algebra/Module/Pi.lean,Mathlib/Algebra/Module/Presentation/Differentials.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Algebra/Module/Rat.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Support.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean | 182 | 22 | ['erdOne', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'madvorak', 'mattrobball'] | nobody | 1 year ago | 371 days ago | 2 days |
| 14931 | eric-wieser | feat: volume of a simplex | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-euclidean-geometry | 207/0 | Mathlib/Geometry/Euclidean/Basic.lean,Mathlib/Geometry/Euclidean/Circumcenter.lean,Mathlib/Geometry/Euclidean/Volume.lean | 3 | 3 | ['eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | unknown | 0 seconds |
| 22583 | imathwy | feat: affinespace homeomorphism | There exists a homeomorphism (a continuous bijection with a continuous inverse) between an affine subspace s of a vector space V over a field 𝕜 and its direction s.direction , given a chosen point z ∈ s . --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 64/2 | Mathlib/Analysis/Normed/Group/AddTorsor.lean,Mathlib/LinearAlgebra/AffineSpace/ContinuousAffineEquiv.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/MulAction.lean | 4 | 6 | ['JovanGerb', 'eric-wieser', 'github-actions', 'grunweg'] | nobody | 1 year ago | 422 days ago | 5 hours |
| 24243 | Timeroot | feat(Analysis/Calculus/FDeriv): Fderiv on torsors | Experiment to see how this goes for now, see [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Upgrade.20.60fderiv.60.20to.20.60AddTorsor.60) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 539/447 | Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Bilinear.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Calculus/FDeriv/Linear.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/Gradient/Basic.lean,Mathlib/Analysis/Calculus/LineDeriv/Basic.lean,Mathlib/Analysis/Calculus/LocalExtr/Basic.lean,Mathlib/Analysis/Calculus/ParametricIntegral.lean,Mathlib/Analysis/Calculus/Rademacher.lean,Mathlib/Analysis/Calculus/TangentCone.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Complex/Periodic.lean,Mathlib/Analysis/Complex/RealDeriv.lean,Mathlib/Analysis/MellinTransform.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/EulerSineProd.lean,Mathlib/Geometry/Manifold/IntegralCurve/Transform.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/NumberTheory/EulerProduct/ExpLog.lean,Mathlib/NumberTheory/Harmonic/GammaDeriv.lean,Mathlib/NumberTheory/LSeries/Nonvanishing.lean,MathlibTest/Recall.lean | 37 | 3 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | unknown | 0 seconds |
| 23593 | erdOne | feat(AlgebraicGeometry): the tilde construction is functorial | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 95/38 | Mathlib/AlgebraicGeometry/Modules/Sheaf.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean | 2 | 4 | ['chrisflav', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 393 days ago | 19 hours |
| 21065 | eric-wieser | feat: generalize `tangentConeAt.lim_zero` to TVS | ... and then adjust the `variable`s down the rest of the file to make use of the generality. There are two key lemmas that this does not generalize, which would probably unlock the rest of the file: * `subset_tangentCone_prod_left` (and `_right`) * `zero_mem_tangentCone` --- - [ ] depends on: #20859 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 55/28 | Mathlib/Analysis/Calculus/TangentCone.lean | 1 | 16 | ['ADedecker', 'eric-wieser', 'github-actions', 'j-loreaux', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'urkud'] | nobody | 1 year ago | 435 days ago | 23 days |
| 22721 | grunweg | chore(MeasureTheory/Function/LpSeminorm/Basic): generalise more results to enorm classes | Done for the Carleson project. --- - depends on #22708 [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson t-measure-probability | 134/10 | Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 418 days ago | 6 seconds |
| 14731 | adomani | feat: the repeated typeclass assumption linter | [#mathlib4 > recyclable variables @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/recyclable.20variables/near/451167963) also [#mathlib4 > Normed modules @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Normed.20modules/near/512242167) --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter large-import | 178/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DependentTypeclass.lean,MathlibTest/DependentTypeclass.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 1 year ago | 656 days ago | 1 minute |
| 24549 | grunweg | feat: define embedded submanifolds, attempt 1 | Not meant to be merged (I think a different design is better); opening this so I can find this more easily. --- - [ ] depends on: #23040 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 1445/2 | Mathlib.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Splits.lean,Mathlib/Geometry/Manifold/Diffeomorph.lean,Mathlib/Geometry/Manifold/EmbeddedSubmanifold.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean,Mathlib/Geometry/Manifold/MSplits.lean,Mathlib/LinearAlgebra/Prod.lean | 8 | 2 | ['leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 11 months ago | 364 days ago | 1 second |
| 23921 | alreadydone | Jyxu/projective trace | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 157/123 | Mathlib/FieldTheory/CardinalEmb.lean,Mathlib/FieldTheory/Relrank.lean,Mathlib/LinearAlgebra/Contraction.lean,Mathlib/LinearAlgebra/Dual.lean,Mathlib/RingTheory/LocalProperties/Projective.lean | 5 | 1 | ['leanprover-community-bot-assistant'] | nobody | 11 months ago | unknown | 0 seconds |
| 22809 | b-reinke | feat: Category algebras and path algebras | This PR defines the category algebra of a linear category and path algebras of quivers. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory new-contributor | 218/0 | Mathlib/Algebra/Ring/Assoc.lean,Mathlib/CategoryTheory/Linear/CategoryAlgebra.lean,Mathlib/Combinatorics/Quiver/PathAlgebra.lean,Mathlib/Data/DFinsupp/BigOperators.lean | 4 | 2 | ['b-reinke', 'github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 21252 | ADedecker | feat: redefine uniformly convex normed spaces with filters instead of epsilons | And conceptualize some proofs. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 301/87 | Mathlib/Analysis/Convex/Uniform.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Order/Basic.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Topology/Algebra/UniformGroup/Defs.lean,Mathlib/Topology/Algebra/UniformMulAction.lean | 6 | 1 | ['github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 19821 | eric-wieser | feat: add a Qq version of AtomM that groups by type | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP large-import t-meta | 332/30 | Mathlib/Data/Ineq.lean,Mathlib/Tactic/Linarith/Datatypes.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Preprocessing.lean,Mathlib/Util/AtomM.lean,Mathlib/Util/Qq.lean | 6 | 1 | ['github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 19120 | hrmacbeth | feat: stop `ring`/`abel` from seeing algebraic operations inside `let`s | This draft PR illustrates a feature I would like to see in core: a variant of `whnf` which allows particular kinds of reduction, such as zeta-delta reduction, to be turned off. Here it is used to make ring-normalization and abelian-group-normalization a bit more responsive to what (I think) users expect: these normalizations would no longer look inside user-defined lets to see algebraic operations in those expressions. Note: In Lean/Mathlib 3, `ring` matched for algebraic operations on an algebraic expression `e` itself, not on `← whnfR e`. So mathlib3 `ring` didn't see algebraic operations inside `let`s -- but it also didn't see algebraic operations requiring beta-reduction (like `(fun t ↦ t + 1) x`) or see inside abbreviations. [Zulip](https://leanprover.zulipchat.com/#narrow/channel/239415-metaprogramming-.2F-tactics/topic/whnf.20variant.20which.20preserves.20let-bindings) Update: fortuitously, it looks like the new core PR https://github.com/leanprover/lean4/pull/6053 will provide this feature! --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-core-PR t-meta | 137/15 | Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/SpecialFunctions/Gamma/BohrMollerup.lean,Mathlib/Analysis/SpecialFunctions/Integrals.lean,Mathlib/Analysis/SpecialFunctions/Stirling.lean,Mathlib/Data/Real/Pi/Irrational.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaOdd.lean,Mathlib/NumberTheory/SumPrimeReciprocals.lean,Mathlib/RingTheory/WittVector/DiscreteValuationRing.lean,Mathlib/Tactic/Abel.lean,Mathlib/Tactic/Polyrith.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Tactic/Ring/RingNF.lean,Mathlib/Topology/MetricSpace/GromovHausdorff.lean,Mathlib/Util/WHNF.lean,MathlibTest/abel.lean,MathlibTest/ring.lean | 21 | 5 | ['JovanGerb', 'github-actions', 'grunweg', 'hrmacbeth'] | nobody | 11 months ago | unknown | 0 seconds |
| 17069 | yuma-mizuno | chore(CategoryTheory/Functor/Basic): put `simp` at `Functor.id_comp` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 41/30 | Mathlib/CategoryTheory/Adjunction/Mates.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/CategoryTheory/GuitartExact/VerticalComposition.lean,Mathlib/CategoryTheory/Limits/HasLimits.lean,Mathlib/CategoryTheory/Shift/CommShift.lean | 5 | 3 | ['github-actions', 'leanprover-bot', 'yuma-mizuno'] | nobody | 11 months ago | unknown | 0 seconds |
| 14803 | StevenClontz | chore: use `Disjoint` nhd filters for all separation axioms | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 157/122 | Mathlib/Topology/Separation.lean | 1 | 1 | ['github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 14675 | adomani | dev: the repeated variable linter | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter | 71/0 | Mathlib/Tactic/Linter/Lint.lean | 1 | 1 | ['github-actions'] | nobody | 11 months ago | 658 days ago | 8 seconds |
| 14330 | Ruben-VandeVelde | chore: split Mathlib.Algebra.Star.Basic | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 446/331 | Mathlib.lean,Mathlib/Algebra/Module/LinearMap/Star.lean,Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/BigOperators.lean,Mathlib/Algebra/Star/Defs.lean,Mathlib/Algebra/Star/Lemmas.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Star/Pi.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/Rat.lean,Mathlib/Algebra/Star/Regular.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/Analysis/NormedSpace/LinearIsometry.lean,Mathlib/Data/Complex/Basic.lean,scripts/noshake.json | 15 | 3 | ['github-actions', 'grunweg', 'j-loreaux'] | nobody | 11 months ago | 668 days ago | 12 hours |
| 14007 | adomani | test: papercut linter working on all mathlib | This PR is a testing ground for potential issues with the papercut linter #13999. It is not intended to be merged. The linter is active on all of mathlib, to make sure that the linter does not throw errors, but only emits warnings! --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter | 249/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/Papercut.lean,test/Papercut.lean | 5 | 1 | ['github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 20354 | eric-wieser | feat: generalize `ContinuousLinearMap.curry` to TVS | Follow on from #10777 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 57/25 | Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 11 months ago | unknown | 0 seconds |
| 8511 | eric-wieser | refactor(MeasureTheory/Measure/Haar/Basic): partially generalize to the affine case | Without a `Mul` version of `AddTorsor`, this generalization can only go so far. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 52/46 | Mathlib/MeasureTheory/Measure/Haar/Basic.lean | 1 | 0 | [] | nobody | 11 months ago | 894 days ago | 7 seconds |
| 7994 | ericrbg | chore: generalize `LieSubalgebra.mem_map_submodule` | --- Not sure if we should rename to something like `mem_map_iff_mem_map_submodule` or not. [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-algebra | 16/4 | Mathlib/Algebra/Lie/SkewAdjoint.lean,Mathlib/Algebra/Lie/Subalgebra.lean | 2 | 3 | ['eric-wieser', 'ericrbg'] | nobody | 11 months ago | 916 days ago | 1 second |
| 6317 | eric-wieser | refactor(Data/Finsupp/Defs): make Finsupp.single defeq to Pi.single | By adding a `DecidableEq ι` argument to `Finsupp.single`, we remove the reference to `Classical.decEq ι` in the definition, which in turn means that when coerced to a function it is now defeq to `Pi.single`. This also brings it in line with `DFinsupp.single`. This does not go as far as making `Finsupp.single` computable. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-data | 269/226 | Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Data/Finsupp/AList.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/Fintype.lean,Mathlib/Data/Finsupp/Indicator.lean,Mathlib/Data/Finsupp/Multiset.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Finsupp/ToDFinsupp.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/LinearAlgebra/Finsupp.lean | 12 | 0 | [] | nobody | 11 months ago | unknown | 0 seconds |
| 6277 | jjaassoonn | Dimension theory | Some results are - The ring Krull dimension and the topological dimension of the prime spectrum of a ring are the same - A field is zero-dimensional and a PID that is not a field is one dimensional - An Artinian ring is zero-dimensional - The Krull dimension of ring $R$ is equal to the supremum of heights of maximal ideals [00KG](https://stacks.math.columbia.edu/tag/00KG) - two definitions of module length agree - A module is finite length iff both artinian and noetherian - length of module $M$ is equal to the sum of length of $N$ and length of $M / N$ where $N$ is a submodule of $M$. - Noetherian ring has only finitely many minimal primes #9088 - In a zero dimensional ring, prime ideals are maximal - Artinian rings has finitely many maximal ideals #9087 - zero-dimensional rings with finitely many prime ideals are products of its localizations: $R \cong \prod_{\mathfrak{p}}R_{\mathfrak{p}}$ - Let $M_0 \le ... \le M_n$, then $l(M_n/ M_0) = l(M_1/M_0) + l(M_2/M_1) + ... + l(M_n/M_{n-1})$ where $l$ denotes module length. - If $f : R \to S$ is a ring homomorphism and $M$ an $S$-module, then $l_R(M) \le l_S(M)$, when $f$ is surjective then they are equal. (Note that this is expressed using `[Algebra R S]` and `RestrictScalars R S M`, instead of a literal ring hom) - Artinian rings are noetherian ring of dimension 0. - For 0-dimensional local ring, its maximal ideal is locally nilpotent - In notherian ring, $I \le \sqrt{J}$ implies $I ^ n \le J$ for some $n$ --- - [x] depends on: #6309 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 3289/459 | Mathlib.lean,Mathlib/Algebra/Module/Length.lean,Mathlib/Algebra/Module/Submodule/JordanHolder.lean,Mathlib/Algebra/PUnitInstances.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/ArtinianAndNoetherian.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Dedup.lean,Mathlib/Data/List/Nodup.lean,Mathlib/LinearAlgebra/Quotient.lean,Mathlib/Order/Cover.lean,Mathlib/Order/JordanHolder.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/ListOnPartialOrderTypes.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Order/RelSeries.lean,Mathlib/RingTheory/Artinian.lean,Mathlib/RingTheory/Finiteness.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Pi.lean,Mathlib/RingTheory/KrullDimension.lean,Mathlib/RingTheory/Noetherian.lean,Mathlib/RingTheory/SimpleModule.lean,Mathlib/Topology/KrullDimension.lean,Mathlib/Topology/Sheaves/SheafCondition/EqualizerProducts.lean | 24 | 11 | ['alreadydone', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 11 months ago | unknown | 0 seconds |
| 8536 | jjaassoonn | characteristic predicate of tensor product | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 399/7 | Mathlib/Algebra/Category/AlgebraCat/Monoidal.lean,Mathlib/LinearAlgebra/IsTensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean | 4 | 12 | ['alreadydone', 'eric-wieser', 'jjaassoonn'] | nobody | 11 months ago | unknown | 0 seconds |
| 11524 | mcdoll | refactor: Introduce type-class for SchwartzMap | --- There are a lot of other refactors to do (`seminormAux` should have a nicer name and gobble up more theorems from `seminorm`), then one can prove `integrable` and friends with only `SchwartzMapClass`. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 139/137 | Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/Fourier/PoissonSummation.lean,Mathlib/Topology/ContinuousFunction/ZeroAtInfty.lean | 3 | 0 | [] | nobody | 11 months ago | unknown | 0 seconds |
| 11003 | thorimur | chore: migrate to `tfae` block tactic | Migrates to the `tfae` block tactic syntax, eliminating uses of `tfae_have` and `tfae_finish`. --- - [ ] depends on: #11000 - [ ] depends on: #10991 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR t-meta | 1267/1081 | Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Homology/ShortComplex/ExactFunctor.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NormedSpace.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecificLimits/Normed.lean,Mathlib/CategoryTheory/Abelian/Exact.lean,Mathlib/CategoryTheory/Bicategory/Kan/Adjunction.lean,Mathlib/FieldTheory/Galois.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/LinearAlgebra/Eigenspace/Zero.lean,Mathlib/MeasureTheory/Group/Action.lean,Mathlib/NumberTheory/FLT/Basic.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/Height.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/RingTheory/Bezout.lean,Mathlib/RingTheory/DiscreteValuationRing/TFAE.lean,Mathlib/RingTheory/Flat/EquationalCriterion.lean,Mathlib/RingTheory/Henselian.lean,Mathlib/RingTheory/LocalRing/RingHom/Basic.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/SetTheory/Ordinal/Topology.lean,Mathlib/Tactic/TFAE.lean,Mathlib/Topology/Algebra/Group/SubmonoidClosure.lean,Mathlib/Topology/Category/CompHaus/EffectiveEpi.lean,Mathlib/Topology/Category/Profinite/EffectiveEpi.lean,Mathlib/Topology/Category/Stonean/EffectiveEpi.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/LocallyClosed.lean,Mathlib/Topology/LocallyConstant/Basic.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Order/LeftRightNhds.lean,Mathlib/Topology/Separation.lean,Mathlib/Topology/UniformSpace/UniformConvergence.lean,scripts/noshake.json,test/tfae.lean | 42 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 11 months ago | 592 days ago | 3 days |
| 9819 | jjaassoonn | fg graded ring | 1. if $A$ is a noetherian graded ring, then $A_0$ is a noetherian subring of $A$ and $A$ is a finitely generated algebra over $A_0$, if $M$ is a finitely generated graded module over $A$, then each $M_n$ is a finitely generated module over $A_0$. 2. Definition of additive functions over any abelian category: if $C$ is an abelian category, a function $f : C \to \mathbb Z$ is said to be additive, if $f(y) = f(x) + f(z)$ whenever $0\to x \to y \to z \to 0$ is exact. proved some basic properties such as $f(0) = 0$ and $f(x) = f(y)$ whenever $x \cong y$ and interaction of $f$ with longer exact sequences 3. The category of finitely generated module over noetherian ring is abelian 4. A proof of Hilbert-Serre theorem: the Poincare series is actually of the form $\frac{p}{\prod(1- X^i)}$ where $p$ is polynomial The code works, but poorly written. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 6745/217 | Mathlib.lean,Mathlib/Algebra/Category/FGModuleCat/Abelian.lean,Mathlib/Algebra/Category/FGModuleCat/Basic.lean,Mathlib/Algebra/Category/FGModuleCat/EpiMono.lean,Mathlib/Algebra/Category/FGModuleCat/Kernels.lean,Mathlib/Algebra/Category/FGModuleCat/Limits.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/HilbertSerre/AdditiveFunction.lean,Mathlib/Algebra/HilbertSerre/FiniteInstances.lean,Mathlib/Algebra/HilbertSerre/HilbertPolynomial.lean,Mathlib/Algebra/HilbertSerre/Theorem.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,Mathlib/RingTheory/GradedAlgebra/Subgrading.lean,Mathlib/RingTheory/Polynomial/Hilbert.lean,Mathlib/RingTheory/PowerSeries/Basic.lean,Mathlib/RingTheory/PowerSeries/WellKnown.lean | 25 | 2 | ['FMLJohn', 'github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 14348 | eric-wieser | perf: disable the `unusedVariables` linter for speed | I doubt we want to merge this, but it shaves two minutes of the lint time. --- [](https://gitpod.io/from-referrer/) | performance-hack | 1/0 | lakefile.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'leanprover-bot'] | nobody | 11 months ago | unknown | 0 seconds |
| 13543 | adomani | test: automatically undeprecate | A test for `update_deprecations`. There are two files with deprecated declarations, but CI automatically fixes them, so that they pass the noisy tests (as well as passing fail-on-warning `lake build`). --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter | 345/4 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/UpdateDeprecations.lean,Mathlib/test_depr.lean,Mathlib/test_depr_no_change.lean,lakefile.lean,scripts/update_deprecations.lean,test/UpdateDeprecations.lean | 12 | 0 | [] | nobody | 11 months ago | unknown | 0 seconds |
| 14932 | eric-wieser | chore: add nndist versions of lemmas | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 108/1 | Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Geometry/Euclidean/Basic.lean | 2 | 1 | ['github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 18202 | ADedecker | chore: refactor algebraic filter bases | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 1086/1315 | Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Analysis/LocallyConvex/Barrelled.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Normed/Operator/WeakOperatorTopology.lean,Mathlib/FieldTheory/KrullTopology.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/Module/UniformConvergence.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/UniformFilterBasis.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean | 14 | 1 | ['github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 22488 | smmercuri | fix: lower priority for `UniformSpace.Completion.instSMul` | Following the introduction of the `WithVal` type synonym in #22055 the following instance takes a long time to synthesise in FLT, and times out in the default heartbeats ```lean import Mathlib namespace IsDedekindDomain.HeightOneSpectrum variable (A K : Type*) [CommRing A] [Field K] [Algebra A K] [IsFractionRing A K] [IsDedekindDomain A] (v : HeightOneSpectrum A) #synth SMul (v.adicCompletionIntegers K) (v.adicCompletion K) ``` The issue is that `UniformSpace.Completion.instSMul (v.adicCompletionIntegers K) (v.adicCompletion K)` now fires during the start of instance search (because we now have `UniformSpace (WithVal (v.valuation K))` whereas previously this would be `UniformSpace K`, which was not automatic), and this takes a long time to fail (leading to ~1400 entries in the trace). The first few lines of the new trace is ```lean [Meta.synthInstance] [5.512418] ✅️ SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▼ [] [0.000118] new goal SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000537] ✅️ apply UniformSpace.Completion.instSMul to SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.004411] ✅️ apply @WithVal.instSMul to SMul (↥(adicCompletionIntegers K v)) (WithVal (valuation K v)) ▶ [] [0.000765] ❌️ apply @GradedMonoid.GradeZero.smul to SMul (↥(adicCompletionIntegers K v)) K ▶ [] [0.000378] ✅️ apply @Algebra.toSMul to SMul (↥(adicCompletionIntegers K v)) K ▶ ... [] 1339 more entries... ▶ ``` Lowering the priority of `UniformSpace.Completion.instSMul` fixes this particular issue, leading to a trace that matches that seen prior to the introduction of `WithVal`: ```lean [Meta.synthInstance] [0.016405] ✅️ SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▼ [] [0.000119] new goal SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000491] ❌️ apply @GradedMonoid.GradeZero.smul to SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000403] ✅️ apply @Algebra.toSMul to SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000134] ❌️ apply inst✝⁴ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000093] ❌️ apply inst✝⁵ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000077] ❌️ apply inst✝⁷ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000082] ❌️ apply inst✝⁹ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000075] ❌️ apply inst✝¹² to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000220] ❌️ apply Algebra.id to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.001015] ✅️ apply @ValuationSubring.instAlgebraSubtypeMem to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [resume] [0.000038] propagating Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) to subgoal Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) of SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [check] [0.013358] ✅️ Algebra.toSMul [] result Algebra.toSMul ``` --- [](https://gitpod.io/from-referrer/) | awaiting-author t-topology FLT | 1/1 | Mathlib/Topology/Algebra/UniformMulAction.lean | 1 | 10 | ['github-actions', 'leanprover-bot', 'smmercuri', 'urkud'] | nobody | 11 months ago | 368 days ago | 55 days |
| 15161 | adomani | feat(Linter): flag `intros x y` which can be replaced by `intro x y` | --- [](https://gitpod.io/from-referrer/) | WIP t-linter | 78/1 | Mathlib/Tactic/Linter/Lint.lean,test/Lint.lean | 2 | 4 | ['adomani', 'github-actions', 'grunweg'] | nobody | 11 months ago | unknown | 0 seconds |
| 15654 | TpmKranz | feat(Computability): language-preserving maps between NFA and RE | Map REs to NFAs via Thompson's construction and NFAs to REs using GNFAs Last chunk of #12648 --- - [ ] depends on: #15651 - [ ] depends on: #15649 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-computability merge-conflict awaiting-zulip | 985/2 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Data/FinEnum/Option.lean,docs/references.bib | 7 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot', 'meithecatte'] | nobody | 11 months ago | 630 days ago | 2 minutes |
| 19315 | quangvdao | feat(Data/Finsupp/Fin): Add `Finsupp` operations on `Fin` tuple | This PR adds more analogues of operations on `Fin` tuples to the `Finsupp` setting. Before, there were only `Finsupp.cons` and `Finsupp.tail`. Now there are also `Finsupp.snoc`, `Finsupp.insertNth`, `Finsupp.init`, and `Finsupp.removeNth`. These all come with supporting lemmas. I also removed the porting comment about `succAboveCases` in `Data/Fin/Basic`, and added a lemma about `succAbove` in `Data/Fin/Tuple/Basic`. --- - [x] depends on: #20361 - [x] depends on: #20771 - [x] depends on: #20770 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 193/16 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Data/Finsupp/Fin.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,scripts/nolints_prime_decls.txt | 6 | 44 | ['YaelDillies', 'github-actions', 'j-loreaux', 'kbuzzard', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 11 months ago | 437 days ago | 43 days |
| 19464 | adomani | test: removed merge-conflict | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP CI delegated | 22/1 | .github/workflows/PR_summary.yml,scripts/zulip_emoji_merge_delegate.py | 2 | 10 | ['adomani', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 11 months ago | unknown | 0 seconds |
| 24155 | eric-wieser | feat: add a "rw_proc" for fin vectors | This seems a little nicer than an elaborator, since it means I can use the default elaboration rules to handle my first few variables. Ideally there would be something like ```lean rw_procQ {A : Type u} {B : A -> Type v} (a : A) (b : B a) : b = ?rhs => do /-- Context: u v : Level A : Q(Type u) B : Q($A -> Type v) a : Q($A) b : Q($B $a) rhs : Q($B $a) -- metavariable to assign |- MetaM Q($b = ?rhs) -/ ``` or ```lean rw_proc {A : Type u} {B : A -> Type v} (a : A) (b : B a) : b = ?rhs => do /-- Context: u v : Level A B a b : Expr rhs : MVarId |- MetaM Expr -/ ``` which would generate the code I wrote here --- [](https://gitpod.io/from-referrer/) | awaiting-author RFC t-data t-meta | 27/2 | Mathlib/Data/Fin/Tuple/Reflection.lean | 1 | 2 | ['github-actions', 'urkud'] | nobody | 11 months ago | 357 days ago | 20 days |
| 21276 | GabinKolly | feat(ModelTheory/Substructures): define equivalences between equal substructures | Define first-order equivalences between equal substructures, and prove related properties. --- This is some preparatory work for #18876 [](https://gitpod.io/from-referrer/) | awaiting-author t-logic | 62/0 | Mathlib/ModelTheory/Substructures.lean | 1 | 19 | ['GabinKolly', 'YaelDillies', 'fpvandoorn', 'github-actions', 'grunweg'] | nobody | 11 months ago | 357 days ago | 46 days |
| 24008 | meithecatte | chore(EpsilonNFA): replace manual lemmas with @[simps] | --- [](https://gitpod.io/from-referrer/) | t-computability awaiting-author new-contributor | 2/24 | Mathlib/Computability/EpsilonNFA.lean | 1 | 2 | ['YaelDillies', 'github-actions', 'urkud'] | nobody | 11 months ago | 355 days ago | 27 days |
| 24642 | grunweg | WIP-feat: add layercake formula for ENNReal-valued functions | Not much to see here yet; some significant amount of work remains. --- - [ ] depends on: #24643 - [ ] depends on: #24640 (based on that PR for simplicity) [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson t-analysis | 189/24 | Mathlib/Analysis/SpecialFunctions/Pow/Integral.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Integral/Layercake.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 11 months ago | unknown | 0 seconds |
| 21712 | grunweg | chore: generalise more lemmas to `ContinuousENorm` | --- - [x] depends on: #21781 (minor drive-by clean-up) - [x] depends on: #21670 - [x] depends on: #22708 (extracted from this) - some parts depend on #21433 (or better: #22175); when the dependent PR has landed, I will re-assess whether to split these into a separate PR [](https://gitpod.io/from-referrer/) | merge-conflict carleson awaiting-CI t-measure-probability | 76/31 | Mathlib/Analysis/Normed/MulAction.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousFunctions.lean | 4 | 5 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 11 months ago | unknown | 0 seconds |
| 21375 | grunweg | WIP: generalise lemmas to ENorm | This work is part of (and a necessary pre-requisite for) the Carleson project. --- [](https://gitpod.io/from-referrer/) | WIP awaiting-CI t-measure-probability carleson merge-conflict | 471/221 | Mathlib/Analysis/NormedSpace/IndicatorFunction.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/ChebyshevMarkov.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Trim.lean,Mathlib/MeasureTheory/Function/LpSpace.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/Probability/Independence/Integrable.lean | 13 | 2 | ['fpvandoorn', 'grunweg'] | nobody | 11 months ago | unknown | 0 seconds |
| 24378 | urkud | feat(Algebra/Order/Field/Basic): generalize lemmas | ... from linear ordered semifields to (commutative) groups with zero. --- I'm going to do another round of generalizing today or tomorrow, so making it a draft PR for now. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 183/181 | Archive/OxfordInvariants/Summer2021/Week3P1.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/CStarAlgebra/ApproximateUnit.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean,Mathlib/Analysis/Convex/SpecificFunctions/Pow.lean,Mathlib/Analysis/Convex/StrictConvexSpace.lean,Mathlib/Analysis/Convex/Uniform.lean,Mathlib/Analysis/Convex/Visible.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean,Mathlib/Analysis/MeanInequalitiesPow.lean,Mathlib/Analysis/Normed/Field/Lemmas.lean,Mathlib/Analysis/Normed/Field/Ultra.lean,Mathlib/Analysis/Normed/Unbundled/SmoothingSeminorm.lean,Mathlib/Analysis/NormedSpace/HomeomorphBall.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NormedSpace.lean,Mathlib/Analysis/NormedSpace/Pointwise.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean,Mathlib/Analysis/SpecialFunctions/MulExpNegMulSqIntegral.lean,Mathlib/Analysis/SpecialFunctions/SmoothTransition.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Bounds.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/Analysis/SpecificLimits/Normed.lean,Mathlib/Combinatorics/Additive/AP/Three/Behrend.lean,Mathlib/Combinatorics/Schnirelmann.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean,Mathlib/Computability/AkraBazzi/AkraBazzi.lean,Mathlib/Computability/AkraBazzi/GrowsPolynomially.lean,Mathlib/Data/Nat/Cast/Order/Field.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Data/Real/Cardinality.lean,Mathlib/Data/Real/Pi/Wallis.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/RightAngle.lean,Mathlib/Geometry/Euclidean/Sphere/Tangent.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/CircleIntegral.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/PeakFunction.lean,Mathlib/MeasureTheory/Measure/SeparableMeasure.lean,Mathlib/NumberTheory/Bertrand.lean,Mathlib/NumberTheory/ClassNumber/AdmissibleAbs.lean,Mathlib/NumberTheory/DiophantineApproximation/Basic.lean,Mathlib/NumberTheory/LSeries/Injectivity.lean,Mathlib/NumberTheory/LSeries/ZMod.lean,Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/MahlerBasis.lean,Mathlib/NumberTheory/Pell.lean,Mathlib/NumberTheory/Transcendental/Liouville/LiouvilleNumber.lean,Mathlib/Order/Filter/AtTopBot/Floor.lean,Mathlib/Order/Interval/Set/IsoIoo.lean,Mathlib/Probability/StrongLaw.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/Topology/ContinuousMap/Polynomial.lean,Mathlib/Topology/Instances/AddCircle.lean,Mathlib/Topology/UrysohnsLemma.lean | 72 | 3 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 11 months ago | 370 days ago | 14 seconds |
| 24618 | b-mehta | feat(Analysis): add Schur inequality and variants | Add Schur inequality and some of its common variants. TODO: - [x] add reference to source: https://www.cip.ifi.lmu.de/~grinberg/VornicuS.pdf - [ ] add other generalisations - [ ] move some of the lemmas elsewhere --- [](https://gitpod.io/from-referrer/) | WIP t-analysis | 145/0 | Mathlib/Analysis/Convex/Schur.lean | 1 | 16 | ['b-mehta', 'eric-wieser', 'github-actions'] | nobody | 11 months ago | 361 days ago | 2 seconds |
| 15115 | kkytola | feat: Generalize assumptions in liminf and limsup results in ENNReals | In a [review comment](https://github.com/leanprover-community/mathlib4/pull/13938#discussion_r1649744441) it was pointed out that results about liminf and limsup in ENNReal hold under milder assumptions. This PR does the generalization. --- This PR is split off from #13938, where the review comment was made. The changes needed for the suggested generalization were of different kind than the simple PR's content, justifying a separate PR. - [x] depends on: #13938 [](https://gitpod.io/from-referrer/) | t-order merge-conflict help-wanted awaiting-author t-topology | 215/27 | Mathlib/MeasureTheory/Measure/Portmanteau.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Topology/Instances/ENNReal.lean | 3 | 8 | ['Ruben-VandeVelde', 'github-actions', 'grunweg', 'j-loreaux', 'kkytola', 'leanprover-community-mathlib4-bot'] | nobody | 11 months ago | 597 days ago | 21 days |
| 8495 | jjaassoonn | feat : Tensor-Hom adjunction in the category of modules | # Tensor-Hom adjunction Let $R$ be a commutative ring and $S$ any ring. Let $X$ be an $(S,R)$-bimoule. Then the tensor functor $(X \otimes_R \cdot)$ is a functor from left $R$-modules to left $S$-modules; and the hom-functor $Hom_S(X, \cdot)$ is a functor from left $S$-modules to left $R$-modules. For another left $S$-module $Y$, the left $R$-module structure of $Hom_S(X, Y)$ is given by $s \cdot f := x \mapsto f(s \cdot x)$. These two functors are adjoint.. In particular we have that ```math {\rm Hom}_{S}(X\otimes_R Y, Z) \cong {\rm Hom}_R (Y, {\rm Hom}_S (X, Z)) ``` ## Implementation notes 1. Why not use the `Mathlib/LinearAlgebra/TensorProduct/Tower.lean` In our setting `X` is an `(R, S)` bimodule and `Y` an `R`-module and `Z` an `S`-module so to use the `Tower` file, we need `S` to be an `R`-algebra which is a luxury we do not have. But note that in `Tower` file, `curry` and `uncurry` are both tri-linear maps. So `Tower` file allows interplay of 3 rings which is not allowed in this file. 2. We require `R` to be commutative but we never used anything commutative. This is because of tensor product requires commutativity, but thanks to @alreadydone, this assumption could be removed soon. I think this PR should wait for Junyan's attempt on removing commutativity, so it is marked as draft and wip for now --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-algebra | 214/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/TensorHomAdjunction.lean | 2 | 88 | ['alreadydone', 'bustercopley', 'eric-wieser', 'github-actions', 'jjaassoonn', 'kbuzzard', 'kim-em', 'leanprover-community-bot-assistant'] | eric-wieser | 11 months ago | 893 days ago | 1 day |
| 19284 | adomani | test: commit a change only to the "master" CI build action | This PR should fail CI, since the main CI build file is incompatible with the autogenerated ones. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 3/3 | .github/build.in.yml,.github/workflows/actionlint.yml | 2 | 12 | ['adomani', 'bryangingechen', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant'] | bryangingechen | 11 months ago | 466 days ago | 61 days |
| 15254 | yuma-mizuno | feat(CategoryTheory/Monoidal): replace `Mon_` lemmas with `Mon_Class` lemmas | We redefine algebras internal to monoidal categories, which were defined by full-bundled structures, in terms of semi-bundled type classes. The original full-bundled structure `X` is renamed to `X_Cat`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 3982/96 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Bimod_Class.lean,Mathlib/CategoryTheory/Monoidal/Bimon_.lean,Mathlib/CategoryTheory/Monoidal/Bimon_Class copy.lean,Mathlib/CategoryTheory/Monoidal/Bimon_Class.lean,Mathlib/CategoryTheory/Monoidal/Braided/Opposite.lean,Mathlib/CategoryTheory/Monoidal/CommMon_Class.lean,Mathlib/CategoryTheory/Monoidal/Comon_.lean,Mathlib/CategoryTheory/Monoidal/Comon_Class.lean,Mathlib/CategoryTheory/Monoidal/Internal/ModuleClass.lean,Mathlib/CategoryTheory/Monoidal/Mod_Class.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Mon_Class.lean,Mathlib/CategoryTheory/Monoidal/mwe.lean | 14 | 6 | ['YaelDillies', 'github-actions', 'leanprover-community-bot-assistant', 'yuma-mizuno'] | nobody | 11 months ago | unknown | 0 seconds |
| 23489 | plp127 | chore: fix recursors | Replace motive with `motive` and other improvements. Will probably split this PR after fixing is done. 4013 recursors left --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 4255/172 | Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Free.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Lie/BaseChange.lean,Mathlib/Algebra/Lie/IdealOperations.lean,Mathlib/Algebra/Lie/TraceForm.lean,Mathlib/Algebra/Order/Rearrangement.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean,Mathlib/CategoryTheory/Quotient.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/Tuple/Basic.lean,Mathlib/Data/Fin/Tuple/BubbleSortInduction.lean,Mathlib/Data/Fin/Tuple/NatAntidiagonal.lean,Mathlib/Data/FinEnum/Option.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/Fintype/CardEmbedding.lean,Mathlib/Data/Fintype/Option.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/Nat/BinaryRec.lean,Mathlib/Data/PFun.lean,Mathlib/Data/PFunctor/Multivariate/W.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Coprod/Basic.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/Coxeter/Basic.lean,Mathlib/LinearAlgebra/Span/Defs.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaEven.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaOdd.lean,Mathlib/Order/DirectedInverseSystem.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/SetTheory/Cardinal/Defs.lean,Mathlib/SetTheory/PGame/Algebra.lean,done.csv,print.lean,working.csv | 42 | 3 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 11 months ago | unknown | 0 seconds |
| 23349 | BGuillemet | feat: add LocallyLipschitzOn.lipschitzOnWith_of_isCompact and two small lemmas about Lipschitz functions | Main feat (in Mathlib/Topology/EMetricSpace/Basic.lean): if a function `f` from an extended pseudometric space to a pseudometric space is locally Lipschitz on a compact subset `s`, then `f` is Lipschitz on `s`. The theorem is true only when the codomain of `f` is a pseudometric space, so it needs imports from Mathlib/Topology/MetricSpace. Other small feat (in Mathlib/Analysis/Calculus/ContDiff/RCLike.lean): a function that is continuously differentiable on an open subset is locally Lipschitz on this subset. --- - [ ] depends on: #22890 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology large-import new-contributor | 59/4 | Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean | 2 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | PatrickMassot | 11 months ago | 339 days ago | 35 days |
| 12438 | jjaassoonn | feat: some APIs for flat modules | Need horseshoe lemma --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 1674/3 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Exact.lean,Mathlib/CategoryTheory/Abelian/Basic.lean,Mathlib/CategoryTheory/Abelian/DiagramLemmas/Horseshoe.lean,Mathlib/CategoryTheory/Abelian/LeftDerived.lean,Mathlib/RingTheory/Flat/Basic.lean | 8 | 21 | ['erdOne', 'github-actions', 'jjaassoonn', 'joelriou'] | nobody | 11 months ago | 735 days ago | 20 seconds |
| 17715 | adomani | feat: the unusedVariableCommand linter | This is still work-in-progress, but also help-wanted! The linter reliably flags unused variables: so far, only `example`s fool it (and that is simply because I did not implement a fix, as there are very few `variable`s that are only used in `example`s in mathlib). The work-in-progress part refers to the fact that the linter uses an `IO.Ref` to keep track of variables and this does not work well with editing the file. The linter works on a fresh parse of a file, but becomes out-of-sync with every edit. The help-wanted is to ask for help to make mathlib compliant with the linter, by checking out this branch and PR-ing a few variable removals! [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Unused.20variables) --- Known issues: * automatic namespacing and `nonrec` may cause difficulty when the newly introduced declaration is preferred in the term, rather than the original one (see examples here ```bash code -r -g ././././Mathlib/Analysis/SpecialFunctions/Arsinh.lean:183 code -r -g ././././Mathlib/Probability/Independence/Basic.lean:368 ``` where, for instance, `ContinuousOn.arsinh` is used internally instead of `Real.arsinh`). * `mutual` declarations confuse the linter ```bash code -r -g ././././Mathlib/SetTheory/Lists.lean:313 ``` * `code -r -g Mathlib/CategoryTheory/EffectiveEpi/Comp.lean:133:29` * universe annotations confuse the linter: ```bash code -r -g ././././Mathlib/Topology/Category/CompactlyGenerated.lean:53 code -r -g ././././Mathlib/AlgebraicTopology/CechNerve.lean:46 ``` * `inductive`s confusing the linter ```bash code -r -g ././././Mathlib/Deprecated/Subgroup.lean:389 code -r -g ././././Mathlib/FieldTheory/PerfectClosure.lean:55 ``` * `def`s confusing the linter ```bash code -r -g ././././Mathlib/Data/MLList/BestFirst.lean:104 ``` * special typeclass assumptions ```code code -r -g ././././Mathlib/RingTheory/WittVector/Truncated.lean:273 code -r -g ././././Mathlib/Topology/Category/Profinite/Product.lean:79 ``` * not sure what is going on here: ```bash code -r -g ././././Mathlib/RingTheory/WittVector/IsPoly.lean:95 code -r -g ././././Mathlib/Probability/Independence/Basic.lean:368 code -r -g ././././Mathlib/Analysis/Calculus/FDeriv/Star.lean:30 ``` [](https://gitpod.io/from-referrer/) | merge-conflict t-linter large-import | 695/22 | Mathlib.lean,Mathlib/Algebra/Group/Idempotent.lean,Mathlib/Algebra/GroupWithZero/Idempotent.lean,Mathlib/Data/Finite/Defs.lean,Mathlib/Data/Int/Cast/Field.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Init.lean,Mathlib/MeasureTheory/Function/LpSpace/DomAct/Continuous.lean,Mathlib/NumberTheory/LSeries/PrimesInAP.lean,Mathlib/Order/BoundedOrder/Basic.lean,Mathlib/Order/BoundedOrder/Lattice.lean,Mathlib/Order/BoundedOrder/Monotone.lean,Mathlib/Order/Monotone/Monovary.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/UnusedVariableCommand.lean,MathlibTest/UnusedVariableCommand.lean,lakefile.lean | 17 | 3 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 564 days ago | 1 minute |
| 25473 | adomani | feat(CI): check that Mathlib files have lean or md extension | Twice recently there have been files with an "intended" `.lean` extension in `Mathlib/`: * #24942, ending in `;lean`; * #25457, ending in `.Lean`. `mk_all` does not add these files to `Mathlib.lean`, since they do not end in `.lean` and this later causes problems. This CI step checks that all files in `Mathlib/` end with `.lean` or `.md`. See #25474 for a test where the new step [correctly fails](https://github.com/leanprover-community/mathlib4/actions/runs/15464097783/job/43532018379?pr=25474). --- [](https://gitpod.io/from-referrer/) | CI delegated | 10/0 | .github/workflows/lint_and_suggest_pr.yml | 1 | 10 | ['adomani', 'bryangingechen', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 10 months ago | 330 days ago | 2 hours |
| 16020 | adomani | feat: compare PR `olean`s size with `master` | Adds two CI steps: * `print the sizes of the oleans` that prints the sizes of all the folders containing `Mathlib` `.olean`s; * `compare oleans` that compares the sizes of the previous step with the corresponding sizes on `master`. In the test runs, the two steps have taken at most 3 seconds combined (the first is virtually instantaneous, the second one depends on `curl` to find a job id and on `gh` to retrieve the logs of a previous CI run -- everything else appears to be negligible). This hopefully helps finding out if some PR is bloating up the `.olean`s. See [this Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Error.3A.20No.20space.20left.20on.20device/near/463792355) for a PR of mine that prompted this check. --- [](https://gitpod.io/from-referrer/) | merge-conflict CI | 120/0 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,scripts/olean_comparison.sh | 5 | 50 | ['Vtec234', 'YaelDillies', 'adomani', 'bryangingechen', 'github-actions', 'grunweg', 'kim-em', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 10 months ago | 527 days ago | 87 days |
| 16062 | adomani | Test/ci olean size | Tests for oleans --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author CI | 114/0 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,scripts/olean_comparison.sh | 5 | 4 | ['Parcly-Taxel', 'adomani', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 617 days ago | 16 seconds |
| 12799 | jstoobysmith | feat(LinearAlgebra/UnitaryGroup): Add properties of Special Unitary Group | Add properties of the special unitary group, mirroring the properties of found in Algebra/Star/Unitary.lean. In particular, I add an instance of `specialUnitaryGroup` as a `Group`, `Star`, `InvolutiveStar`, and `StarMul`. --- [](https://gitpod.io/from-referrer/) | please-adopt t-algebra new-contributor merge-conflict awaiting-author | 78/0 | Mathlib/LinearAlgebra/UnitaryGroup.lean | 1 | 8 | ['chrisflav', 'jcommelin', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 712 days ago | 9 days |
| 23709 | plp127 | feat: `Nat.findFrom` | This PR adds `Nat.findFrom`, which is like `Nat.find`, but starting from an arbitrary `k` instead of `0`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 190/47 | Mathlib/Data/Nat/Find.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 390 days ago | 2 hours |
| 25340 | dupuisf | chore(Analysis/Convex): move files pertaining to convex/concave functions to their own folder | This PR creates a new folder under `Analysis/Convex` called `Analysis/Convex/Function`, which includes files that are mostly or entirely about convex/concave functions (as opposed to convex sets). --- [](https://gitpod.io/from-referrer/) | merge-conflict t-convex-geometry | 4264/4155 | Mathlib.lean,Mathlib/Analysis/Convex/Continuous.lean,Mathlib/Analysis/Convex/Deriv.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Convex/Extrema.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Convex/Function/Basic.lean,Mathlib/Analysis/Convex/Function/Continuous.lean,Mathlib/Analysis/Convex/Function/Deriv.lean,Mathlib/Analysis/Convex/Function/Extrema.lean,Mathlib/Analysis/Convex/Function/Integral.lean,Mathlib/Analysis/Convex/Function/Jensen.lean,Mathlib/Analysis/Convex/Function/Mul.lean,Mathlib/Analysis/Convex/Function/Piecewise.lean,Mathlib/Analysis/Convex/Function/Quasiconvex.lean,Mathlib/Analysis/Convex/Function/Slope.lean,Mathlib/Analysis/Convex/Function/Strong.lean,Mathlib/Analysis/Convex/Integral.lean,Mathlib/Analysis/Convex/Jensen.lean,Mathlib/Analysis/Convex/Mul.lean,Mathlib/Analysis/Convex/Piecewise.lean,Mathlib/Analysis/Convex/Quasiconvex.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convex/Strong.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/MeanInequalitiesPow.lean,Mathlib/Analysis/Normed/Module/Convex.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Analysis/SpecialFunctions/Log/NegMulLog.lean,Mathlib/Analysis/SpecialFunctions/Pochhammer.lean,Mathlib/MeasureTheory/Measure/Decomposition/IntegralRNDeriv.lean,Mathlib/NumberTheory/Harmonic/GammaDeriv.lean | 34 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 328 days ago | 6 days |
| 21734 | adomani | fix(PR summary): checkout GITHUB_SHA | This should make the version of the script that is used on PRs more stable. Suggested by Eric Wieser on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/messageFile.2Emd/near/498941855). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author CI | 2/1 | .github/workflows/PR_summary.yml | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 443 days ago | 1 hour |
| 8949 | sebzim4500 | Add `by_approx` tactic for proving real inequalities using rational approximation | feat: Add `by_approx` tactic for proving real inequalities by finding rational approximations --- ```lean example : |sqrt 2 - 1.414| < 0.001 := by by_approx ``` This is a work in progress, the code is messy and the tactic is often very slow. It also depends on some other PRs that haven't been merged yet. It currently supports basic operations (`+`, `-`, `*`, `/`, `abs`) and has approximation extensions for `sqrt` and `exp`. - [ ] depends on: #8167 - [x] depends on: #8832 [](https://gitpod.io/from-referrer/) | merge-conflict modifies-tactic-syntax t-meta | 1670/3 | Mathlib.lean,Mathlib/Data/Int/ModEq.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ByApprox.lean,Mathlib/Tactic/ByApprox/Basic.lean,Mathlib/Tactic/ByApprox/Core.lean,Mathlib/Tactic/ByApprox/Exp.lean,Mathlib/Tactic/ByApprox/Lemmas.lean,Mathlib/Tactic/ByApprox/Test.lean,Mathlib/Tactic/ByApprox/Util.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GRW.lean,Mathlib/Tactic/GRW/Core.lean,Mathlib/Tactic/GRW/Lemmas.lean,Mathlib/Tactic/NormNum/NatFactorial.lean,test/ByApprox.lean,test/GRW.lean,test/norm_num_ext.lean | 18 | 1 | ['mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 20334 | miguelmarco | feat: allow polyrith to use a local Singular/Sage install | Try to call a local install of Singular (either standalone or inside Sage) to find the witness for polyrith before trying to call the online sage cell server. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-meta | 171/48 | Mathlib/Tactic/Polyrith.lean,scripts/polyrith_sage.py | 2 | 16 | ['eric-wieser', 'github-actions', 'hanwenzhu', 'kim-em', 'miguelmarco', 'mkoeppe'] | nobody | 10 months ago | 460 days ago | 27 days |
| 25911 | BoltonBailey | make `a / b` simp normal form | This PR continues the work from #25631. Original PR: https://github.com/leanprover-community/mathlib4/pull/25631 | t-algebra | 11/1 | Mathlib/Algebra/Group/Defs.lean | 1 | 2 | ['BoltonBailey', 'github-actions'] | nobody | 10 months ago | unknown | 0 seconds |
| 25912 | BoltonBailey | feat: add simp lemmas for trig functions on `π * 2⁻¹` | This PR adds a number of simp lemmas to reduce trig functions evaluated on `π * 2⁻¹`. This allows `simp` to reduce expressions such as `sin (π * (1 / 2))` --- - [ ] depends on: #25911 [experiment with simp normal form] Original PR: #24213 | awaiting-author blocked-by-other-PR t-analysis | 45/0 | Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | 1 | 3 | ['BoltonBailey', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 320 days ago | 2 minutes |
| 25918 | BoltonBailey | feat: one time pad string diagram | This PR continues the work from #10655. Original PR: https://github.com/leanprover-community/mathlib4/pull/10655 | 159/0 | MathlibTest/StringDiagram.lean | 1 | 2 | ['BoltonBailey', 'github-actions'] | nobody | 10 months ago | unknown | 0 seconds | |
| 23953 | b-reinke | feat(Data/Matroid/Tutte): define the Tutte polynomial of a matroid | This PR defines the Tutte polynomial of a matroid and shows basic properties. - [x] depends on: #23926 - [ ] depends on #24336 - [ ] depends on: #23951 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-data | 111/0 | Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Data/Matroid/Tutte/Basic.lean,Mathlib/Data/Set/Image.lean | 3 | 7 | ['apnelson1', 'b-reinke', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 25921 | BoltonBailey | feat: scripts to analyze overlap between namespaces | This PR continues the work from #11385. Original PR: https://github.com/leanprover-community/mathlib4/pull/11385 | WIP migrated-from-branch t-meta | 86/0 | scripts/RecordNamespaces.lean,scripts/namespace-overlap.py | 2 | 1 | ['github-actions'] | nobody | 10 months ago | 318 days ago | 2 days |
| 18771 | joelriou | feat(LinearAlgebra/ExteriorPower): exterior powers of free modules are free | Co-authored-by: sophie.morel@ens-lyon.fr --- - [ ] depends on: #18662 - [x] depends on: #18534 - [x] depends on: #18651 - [x] depends on: #18590 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 1185/160 | Mathlib.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basis.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/ExteriorPower/Pairing.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorAlgebra/ToTensorPower.lean,Mathlib/LinearAlgebra/TensorPower/Basic.lean,Mathlib/LinearAlgebra/TensorPower/Pairing.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 19 | 3 | ['alreadydone', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 18441 | ADedecker | refactor(AdicTopology): use new API for algebraic filter bases, and factor some code | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 847/159 | Mathlib.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 3 | ['ADedecker', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 11 minutes |
| 18439 | ADedecker | refactor: use new algebraic filter bases API in `FiniteAdeleRing` | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 699/21 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 10 minutes |
| 18438 | ADedecker | refactor: adapt `KrullTopology` to the new algebraic filter bases API | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 771/168 | Mathlib.lean,Mathlib/FieldTheory/KrullTopology.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 5 | ['ADedecker', 'AntoineChambert-Loir', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 10 minutes |
| 26239 | BoltonBailey | feat: add sample pre-commit git hook file | This PR adds a sample pre-commit git hook file that runs `mk_all` and `lint-style`. The script provides instructions on how to activate these as git hooks. Installing these would be optional, but hopefully people who would install them would find it easier to avoid commits that immediately fail linters. Discussion of hooks on [Zulip here](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Automatic.20setup.20and.20distribution.20of.20git.20hooks/with/525103090). Some thoughts: - Perhaps it would be better, for speed, to attempt to avoid certain commands if the staged changes suggest they would be unnecessary. - i.e. only run linters on files that have been updated / only run `mk_all` if a file has been added or deleted. --- [](https://gitpod.io/from-referrer/) | WIP | 18/0 | git_hooks/pre-commit | 1 | 1 | ['github-actions'] | nobody | 10 months ago | 314 days ago | 22 minutes |
| 13964 | pechersky | feat(Data/DigitExpansion): begin defining variant of reals without rationals | Based on a de Bruijn 1976 paper. This file is just the basic definition of a digit expansion. Will be followed up with further constructions. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 518/0 | Mathlib.lean,Mathlib/Data/DigitExpansion/Defs.lean,docs/references.bib | 3 | 11 | ['eric-wieser', 'github-actions', 'kim-em', 'pechersky'] | dupuisf | 10 months ago | 551 days ago | 129 days |
| 21450 | eric-wieser | feat: improve trace nodes for `positivity` | --- [](https://gitpod.io/from-referrer/) | t-meta | 25/7 | Mathlib/Tactic/Positivity/Core.lean | 1 | 1 | ['github-actions'] | nobody | 10 months ago | unknown | 0 seconds |
| 26327 | eric-wieser | chore: split the tests for positivity | --- [](https://gitpod.io/from-referrer/) | 528/2 | MathlibTest/Positivity/basic.lean,MathlibTest/positivity.lean | 2 | 1 | ['github-actions'] | nobody | 10 months ago | unknown | 0 seconds | |
| 18662 | joelriou | feat(LinearAlgebra/ExteriorPower): generators of the exterior powers | --- - [x] depends on: #18534 - [x] depends on: #18590 - [ ] depends on: #26464 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 818/158 | Mathlib.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 15 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 18735 | joelriou | feat(Algebra/Module): presentation of the exterior power | Given a presentation of a `R`-module `M`, we obtain a presentation of `⋀[R]^n M`. --- (Still one sorry left.) - [ ] depends on: #18527 - [ ] depends on: #18432 - [ ] depends on: #26464 - [ ] depends on: #18534 - [ ] depends on: #18662 - [x] depends on: #18590 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 1856/157 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/Module/Presentation/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/PiTensor.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 20 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 26581 | nomeata | ignore this: Lean pr testing 9124 | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 1723/1362 | Archive/Arithcc.lean,Archive/Examples/Eisenstein.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo1975Q1.lean,Archive/Imo/Imo1987Q1.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2006Q5.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2024Q1.lean,Archive/Imo/Imo2024Q3.lean,Archive/Imo/Imo2024Q5.lean,Archive/MiuLanguage/DecisionNec.lean,Archive/MiuLanguage/DecisionSuf.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/AscendingDescendingSequences.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/Partition.lean,Archive/Wiedijk100Theorems/PerfectNumbers.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Archive/ZagierTwoSquares.lean,Cache/Lean.lean,Counterexamples/AharoniKorman.lean,Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Counterexamples/MapFloor.lean,Counterexamples/MonicNonRegular.lean,Counterexamples/Phillips.lean,Counterexamples/Pseudoelement.lean,Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/Algebra/ZMod.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/Category/ContinuousCohomology/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Homology.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/Algebra/Category/Ring/Epi.lean,Mathlib/Algebra/Category/Ring/FinitePresentation.lean,Mathlib/Algebra/Category/Ring/Topology.lean,Mathlib/Algebra/CharP/Basic.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/Colimit/Module.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Ring.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/Equiv/TransferInstance.lean,Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/Group/Action/Basic.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Finset/Scalar.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/Lie/LieTheorem.lean,Mathlib/Algebra/Lie/Weights/Chain.lean,Mathlib/Algebra/Lie/Weights/RootSystem.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/ToDirectSum.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/NoZeroSMulDivisors/Defs.lean,Mathlib/Algebra/Order/Antidiag/Pi.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Order/Field/Power.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/Algebra/Polynomial/Degree/CardPowDegree.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Regular/Pi.lean,Mathlib/Algebra/Ring/Basic.lean,Mathlib/Algebra/Ring/CentroidHom.lean,Mathlib/Algebra/Ring/GrindInstances.lean,Mathlib/Algebra/Ring/Int/Defs.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean | 567 | 0 | [] | nobody | 10 months ago | unknown | 0 seconds |
| 15213 | adomani | dev: add Mathlib.Tactic.Linter.ForallIntro | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter large-import | 608/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/ForallIntro.lean,MathlibTest/ForallIntro.lean | 5 | 5 | ['adomani', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 17458 | urkud | refactor(Algebra/Group): make `IsUnit` a typeclass | Also change some lemmas to assume `[IsUnit _]` instead of `[Invertible _]`. Motivated by potential non-defeq diamonds in #14986, see also [Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Invertible.20and.20data) I no longer plan to merge this PR, but I'm going to cherry-pick some changes to a new PR before closing this one. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-zulip | 82/72 | Mathlib/Algebra/CharP/Invertible.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Units.lean,Mathlib/Algebra/Polynomial/Splits.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/CategoryTheory/Linear/Basic.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Separable.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/GroupTheory/Submonoid/Inverses.lean,Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean,Mathlib/LinearAlgebra/AffineSpace/Combination.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Contraction.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Inversion.lean,Mathlib/LinearAlgebra/CliffordAlgebra/SpinGroup.lean,Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean,Mathlib/NumberTheory/MulChar/Basic.lean,Mathlib/RingTheory/Localization/NumDen.lean,Mathlib/RingTheory/Polynomial/Content.lean,Mathlib/RingTheory/Polynomial/GaussLemma.lean,Mathlib/RingTheory/Valuation/Basic.lean | 26 | 12 | ['MichaelStollBayreuth', 'acmepjz', 'eric-wieser', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 9 months ago | 572 days ago | 18 hours |
| 22928 | javra | feat(CategoryTheory): infrastructure for inclusion morphisms into products in categories with 0-morphisms | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 52/14 | Mathlib/CategoryTheory/Limits/Shapes/BinaryBiproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | 3 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 413 days ago | 21 minutes |
| 22952 | eric-wieser | refactor: reimplement `RingQuot` in terms of `RingCon.Quotient` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 157/184 | Mathlib/Algebra/RingQuot.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/RingTheory/Congruence/Basic.lean,Mathlib/RingTheory/Congruence/Defs.lean | 4 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 24710 | chrisflav | chore(Data/Set): `tsum` version of `Set.encard_iUnion_of_finite` for non-finite types | As requested here: https://github.com/leanprover-community/mathlib4/pull/23849#discussion_r2081070200 --- - [ ] depends on: #23849 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 163/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Data/Set/Card/Arithmetic.lean,Mathlib/Data/Set/Card/InfiniteArithmetic.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/Instances/ENat/Lemmas.lean | 7 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 300 days ago | 1 day |
| 24823 | eric-wieser | refactor: add `hom` lemmas for the `MonoidalCategory` structure on `ModuleCat` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 148/164 | Mathlib/Algebra/Category/FGModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Free.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Generator.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Internal/Module.lean,Mathlib/RepresentationTheory/Coinvariants.lean,Mathlib/RepresentationTheory/Rep.lean | 11 | 21 | ['101damnations', 'YaelDillies', 'eric-wieser', 'github-actions', 'joelriou', 'kbuzzard', 'leanprover-community-bot-assistant'] | 101damnations | 9 months ago | 300 days ago | 40 days |
| 25071 | erdOne | feat(EllipticCurve): basic API for singular cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry | 320/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 3 | 35 | ['Multramate', 'acmepjz', 'erdOne', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 300 days ago | 45 days |
| 25197 | eric-wieser | feat: Finset.sum induction for tensor products. | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 81/0 | Mathlib/LinearAlgebra/TensorProduct/Basic.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 25218 | kckennylau | feat(AlgebraicGeometry): Tate normal form of elliptic curves | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry awaiting-zulip new-contributor | 291/26 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/IsomOfJ.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Modular/TateNormalForm.lean,Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 5 | 31 | ['MichaelStollBayreuth', 'Multramate', 'acmepjz', 'github-actions', 'grunweg', 'kckennylau', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 333 days ago | 6 days |
| 25247 | alreadydone | Projective contraction | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 160/31 | Mathlib/Data/Finsupp/Defs.lean,Mathlib/LinearAlgebra/Contraction.lean,Mathlib/LinearAlgebra/Pi.lean,Mathlib/RingTheory/Finiteness/Finsupp.lean | 4 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 338 days ago | 30 seconds |
| 25561 | callesonne | feat(Category/Grpd): define the bicategory of groupoids | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 179/25 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean,Mathlib/CategoryTheory/Bicategory/Functor/Strict.lean,Mathlib/CategoryTheory/Category/Cat.lean,Mathlib/CategoryTheory/Category/Grpd.lean | 6 | 6 | ['callesonne', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'robin-carlier'] | nobody | 9 months ago | 317 days ago | 10 days |
| 25671 | eric-wieser | refactor: generalize `OreSet` to work for bimodules | --- [](https://gitpod.io/from-referrer/) | merge-conflict large-import | 243/256 | Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/GroupTheory/OreLocalization/OreSet.lean,Mathlib/RingTheory/OreLocalization/Ring.lean,Mathlib/RingTheory/TensorProduct/Nontrivial.lean | 6 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 25988 | Multramate | refactor(AlgebraicGeometry/EllipticCurve/*): replace Fin 3 with products | This PR continues the work from #24593. Original PR: https://github.com/leanprover-community/mathlib4/pull/24593 | merge-conflict t-algebraic-geometry | 1000/1022 | Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean | 6 | 3 | ['Multramate', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 300 days ago | 18 days |
| 26002 | robin-carlier | feat(CategoryTheory/Monoidal/Action): action of `Type` on categories with coproducts | We show that if a category admits coproducts of size `w`, then `Type w` acts on the left on that category. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 213/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Action/ChosenTypeCopowers.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 26090 | grunweg | chore: make `finiteness` a default tactic | Opening for discussion. This PR continues the work from #25119. | merge-conflict | 423/366 | Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Asymptotics/ExpGrowth.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Convex/Integral.lean,Mathlib/Analysis/Fourier/AddCircle.lean,Mathlib/Analysis/Fourier/AddCircleMulti.lean,Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Holder.lean,Mathlib/Data/ENNReal/Inv.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENNReal/Real.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/InformationTheory/KullbackLeibler/Basic.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean,Mathlib/MeasureTheory/Function/ContinuousMapDense.lean,Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean,Mathlib/MeasureTheory/Function/Egorov.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/L1Space/AEEqFun.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/ChebyshevMarkov.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Defs.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Complete.lean,Mathlib/MeasureTheory/Function/LpSpace/Indicator.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/Prod.lean,Mathlib/MeasureTheory/Integral/RieszMarkovKakutani/Real.lean,Mathlib/MeasureTheory/Measure/Decomposition/IntegralRNDeriv.lean,Mathlib/MeasureTheory/Measure/Decomposition/Lebesgue.lean,Mathlib/MeasureTheory/Measure/Haar/Basic.lean,Mathlib/MeasureTheory/Measure/Haar/DistribChar.lean,Mathlib/MeasureTheory/Measure/Haar/Quotient.lean,Mathlib/MeasureTheory/Measure/Haar/Unique.lean,Mathlib/MeasureTheory/Measure/Lebesgue/EqHaar.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/Real.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/MeasureTheory/Measure/Tilted.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean,Mathlib/Probability/BorelCantelli.lean,Mathlib/Probability/Independence/Conditional.lean,Mathlib/Probability/Integration.lean,Mathlib/Probability/Kernel/Composition/IntegralCompProd.lean,Mathlib/Probability/Kernel/Disintegration/CondCDF.lean,Mathlib/Probability/Kernel/Disintegration/Density.lean,Mathlib/Probability/Martingale/Convergence.lean,Mathlib/Probability/Martingale/OptionalStopping.lean,Mathlib/Probability/Moments/CovarianceBilin.lean,Mathlib/Probability/Moments/Tilted.lean,Mathlib/Probability/Moments/Variance.lean,Mathlib/Probability/UniformOn.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/Perfect.lean,scripts/noshake.json | 73 | 3 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 317 days ago | 18 minutes |
| 26465 | joelriou | feat(Algebra/Module): presentation of the `PiTensorProduct` | Given a presentation of a finite number of `R`-modules `M i`, we obtain a presentation of the module `⨂[R] i, M i`. --- - [ ] depends on: #26464 This PR continues the work from #18527. Original PR: https://github.com/leanprover-community/mathlib4/pull/18527 | merge-conflict file-removed t-algebra blocked-by-other-PR | 525/4 | Mathlib.lean,Mathlib/Algebra/Module/Presentation/PiTensor.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Set/ComplSingletonLift.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/TensorPower/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean,Mathlib/SetTheory/Cardinal/Finite.lean | 10 | 4 | ['github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 308 days ago | 33 minutes |
| 26467 | joelriou | feat(LinearAlgebra): the tensor product of a finite family of free modules is free | --- - [ ] depends on: #26464 - [ ] depends on: #26465 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR merge-conflict file-removed | 607/7 | Mathlib.lean,Mathlib/Algebra/Module/Presentation/Free.lean,Mathlib/Algebra/Module/Presentation/PiTensor.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Set/ComplSingletonLift.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basis.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/TensorPower/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean,Mathlib/SetTheory/Cardinal/Finite.lean | 12 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 308 days ago | 2 seconds |
| 20784 | eric-wieser | fix: prevent `exact?` recursing forever on `n = 55` | Test case thanks to @llllvvuu: ```lean import Mathlib.SetTheory.Ordinal.Basic theorem natCast_inj {m n : ℕ} : (m : Ordinal) = n ↔ m = n := sorry example (n : Nat) : n = 55 := by exact? ``` This is surely a workaround for some unreported lean bug. The bug still exists for `n = 71` or higher, so we can still track down the bug after merging this patch. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 22/3 | Mathlib/SetTheory/Ordinal/Basic.lean,MathlibTest/LibrarySearchRecDepth.lean | 2 | 15 | ['Command-Master', 'eric-wieser', 'github-actions', 'kbuzzard', 'kim-em', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 9 months ago | 300 days ago | 32 days |
| 26647 | b-mehta | feat(Data/Sym/Sym2): lift commutative operations to sym2 | While we have `Sym2.lift`, it's often useful to lift operations which are known to be commutative to the typeclass system. Indeed, the existing `Sym2.mul` witnesses this already. Thus, this PR can also be seen as generalising `Sym2.mul`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-data | 48/28 | Mathlib/Data/Sym/Sym2.lean,Mathlib/Data/Sym/Sym2/Finsupp.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/QuadraticForm/Basis.lean | 4 | 12 | ['b-mehta', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 298 days ago | 3 days |
| 26878 | adomani | feat: declaration diff script in Lean | Although, it is still text-based, the parsing of the output of `git diff` is now done in Lean. The new script already performed better than the old one in a couple of situations: * #26877 See [this comment](https://github.com/leanprover-community/mathlib4/pull/26847#issuecomment-3045308885) * #26849 See [this comment](https://github.com/leanprover-community/mathlib4/pull/26849#issuecomment-3045092965) --- This is still work in progress: the parsing should be more or less done, but I have not yet hooked this into the action workflow. [](https://gitpod.io/from-referrer/) | 497/0 | scripts/DeclarationDiff_text_based.lean | 1 | 4 | ['adomani', 'bryangingechen', 'github-actions'] | bryangingechen | 9 months ago | 298 days ago | 9 seconds | |
| 26067 | mapehe | feat(Topology/StoneCech): exists_continuous_surjection_from_StoneCech_to_dense_range | This lemma formalises the following version of the maximality property of the Stone–Čech compactification: If `f : α → β` is a continuous map from a topological space `α` to a Hausdorff space `β` with dense range, then there exists a continuous surjection from `StoneCech α` to `β` extending `f`. In particular, `StoneCech α` is the “largest” compact Hausdorff space into which `α` densely embeds, in the sense that any other such space is a continuous image of it. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 18/0 | Mathlib/Topology/StoneCech.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 297 days ago | 20 days |
| 25999 | bjoernkjoshanssen | feat(Topology/Compactification): projective line over ℝ is homeomorphic to the one-point compactification of ℝ | This PR continues the work from #18306. Original PR: https://github.com/leanprover-community/mathlib4/pull/18306 | merge-conflict t-topology | 920/0 | Mathlib.lean,Mathlib/Topology/Compactification/OnePointHomeomorph.lean,Mathlib/Topology/Compactification/OnePointRealLemmas.lean | 3 | 3 | ['bjoernkjoshanssen', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 297 days ago | 21 days |
| 26994 | Paul-Lez | feat(Topology/MetricSpace/Pseudo/Defs): add easy lemma about opens in topological spaces | Split from #26992 --- [](https://gitpod.io/from-referrer/) | awaiting-author t-topology easy | 9/0 | Mathlib/Topology/MetricSpace/Pseudo/Defs.lean | 1 | 4 | ['Paul-Lez', 'github-actions', 'grunweg'] | nobody | 9 months ago | 294 days ago | 3 hours |
| 21039 | eric-wieser | hack: override `instance` to insert `fast_instance%` | --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-meta | 40/4 | Mathlib/Algebra/Equiv/TransferInstance.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/Tactic/FastInstance.lean,Mathlib/Topology/FiberBundle/Basic.lean | 4 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 25611 | erdOne | chore(RingTheory): add `Algebra (FractionRing R) (FractionRing S)` | Co-authored-by: Yakov Pechersky --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 152/108 | Mathlib.lean,Mathlib/Algebra/Algebra/NonZeroDivisors.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/DedekindDomain/IntegralClosure.lean,Mathlib/RingTheory/Ideal/Norm/RelNorm.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Localization/FractionRing.lean,Mathlib/RingTheory/Localization/FractionRingAlgebra.lean,Mathlib/RingTheory/Localization/Integral.lean | 10 | 20 | ['alreadydone', 'erdOne', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'pechersky'] | nobody | 9 months ago | 323 days ago | 3 days |
| 18230 | digama0 | feat(Tactic/ScopedNS): extend `scoped[NS]` to more commands | refactor `ScopedNS` to remove error prone repetitiveness and extend it to other commands such as `syntax`, `macro`, `elab`, etc.
Co-authored-by: Jon Eugster |
awaiting-author t-meta | 201/26 | Mathlib/Tactic/ScopedNS.lean,MathlibTest/scopedNS.lean | 2 | 7 | ['adomani', 'digama0', 'eric-wieser', 'github-actions', 'joneugster', 'kbuzzard'] | nobody | 9 months ago | 431 days ago | 31 days |
| 27330 | BoltonBailey | feat(Tactic/Linter): add TacticMs for natural subtraction and division | This is a (pair of) short tactic scripts I wrote for Project Numina while vetting formal formal statements (thanks to [this guide](https://github.com/mirefek/lean-tactic-programming-guide) for the primer). The scripts check for the presence of natural subtraction and natural division, which can often lead to mistakes. Of course, Mathlib allows natural subtraction freely, so it's not obvious this could be made useful to Mathlib itself. Still, maybe it's of use to some other project, so I'll leave it here. --- [](https://gitpod.io/from-referrer/) | t-linter | 66/0 | Mathlib/Tactic/Linter/TruncatedNat.lean | 1 | 2 | ['BoltonBailey', 'eric-wieser', 'github-actions'] | nobody | 9 months ago | unknown | 0 seconds |
| 25284 | alreadydone | feat(LinearAlgebra/Contraction): bijectivity of `dualTensorHom` + generalize to CommSemiring | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 167/32 | Mathlib/Data/Finsupp/Defs.lean,Mathlib/LinearAlgebra/Contraction.lean,Mathlib/LinearAlgebra/Pi.lean,Mathlib/LinearAlgebra/Trace.lean,Mathlib/RingTheory/Finiteness/Finsupp.lean | 5 | 16 | ['alreadydone', 'eric-wieser', 'github-actions', 'kckennylau', 'leanprover-bot', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 289 days ago | 45 days |
| 22749 | joelriou | feat(CategoryTheory/Abelian): the Gabriel-Popescu theorem as a localization with respect to a Serre class | This PR introduces a structure `GabrielPopescuPackage C` which contains the information to say that the abelian category `C` is a localization of a category of modules with respect to a suitable Serre class. --- - [x] depends on: #26033 - [ ] depends on: #26663 - [x] depends on: #22733 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 202/6 | Mathlib.lean,Mathlib/CategoryTheory/Abelian/GrothendieckCategory/ModuleEmbedding/GabrielPopescu.lean,Mathlib/CategoryTheory/Abelian/SerreClass/Bousfield.lean,Mathlib/CategoryTheory/Abelian/SerreClass/MorphismProperty.lean,Mathlib/CategoryTheory/ObjectProperty/ContainsZero.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 302 days ago | 2 hours |
| 26784 | eric-wieser | chore: remove suppress_compilation | Still not exhaustive. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 0/37 | Mathlib/Algebra/Category/CoalgCat/ComonEquivalence.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/Colimit/DirectLimit.lean,Mathlib/Algebra/Colimit/Module.lean,Mathlib/Algebra/Colimit/Ring.lean,Mathlib/AlgebraicGeometry/Limits.lean,Mathlib/Analysis/Normed/Algebra/Unitization.lean,Mathlib/Analysis/NormedSpace/Multilinear/Basic.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Basic.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Bilinear.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Completeness.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Mul.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NNNorm.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NormedSpace.lean,Mathlib/CategoryTheory/Abelian/Projective/Resolution.lean,Mathlib/CategoryTheory/Monoidal/Internal/Module.lean | 18 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 26987 | joelriou | chore: deprecating module LinearAlgebra.PiTensorProduct | --- - [ ] depends on: #26464 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 1209/934 | Mathlib.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/SubtypeNeLift.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/TensorPower/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean,Mathlib/SetTheory/Cardinal/Finite.lean | 10 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 294 days ago | 2 seconds |
| 27435 | callesonne | feat(Normed/Algebra/Logarithm): add FormalMultilinearSeries of logarithm around `1` | This PR adds the `FormalMultilinearSeries` corresponding to `log` around `1` (or rather, corresponding to `log(1 + x)`. For now, this PR just adds the definition, and copies over as many (easy) results as possible from the corresponding exponential file. In a follow up PR, we will add a criterion for when the logarithm converges on the unit disk (based on the growth of the inverse norms of naturals in the given algebra), and show that this holds for any Q_p algebra. This work has been done as part of the workshop "Formalizing Class Field Theory" in Oxford. Since much of this is copy-pasting the Exponential file, I have kept Anatole Dedecker and Eric Wieser as coauthors. --- [](https://gitpod.io/from-referrer/) | WIP t-analysis | 311/0 | Mathlib/Analysis/Normed/Algebra/Logarithm.lean | 1 | 1 | ['github-actions'] | nobody | 9 months ago | 281 days ago | 29 seconds |
| 24668 | robertmaxton42 | feat(LinearAlgebra): add inductive principle for the free product of algebras | * Add `FreeProduct.inductionOn` and `.asPowers.inductionOn`. - [ ] depends on: #24532 --- * `simp↓` on `empty_rel'_bot`: the LHS is indeed not in simp-normal form, but `simp` can't solve the full lemma (if only because `Function.onFun` isn't marked `@[simp]`) and the actual simp-normal form of `rel'` isn't terribly useful for humans. Since I do expect users to type `rel' R A` by hand, I claim this use of `simp↓` is justified. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 205/9 | Mathlib/LinearAlgebra/FreeProduct/Basic.lean | 1 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 358 days ago | 5 minutes |
| 13973 | digama0 | feat: lake exe refactor, initial framework | This is the initial framework code for `lake exe refactor`. To use it, you add your refactoring to `Refactor/Main.lean` (note, you have to actually write some metaprogramming code here for the refactoring itself), and the harness will run it on specified files and apply the generated edits. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 139/0 | Refactor/Main.lean,lakefile.lean | 2 | 11 | ['adomani', 'digama0', 'eric-wieser', 'github-actions', 'joneugster', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 9 months ago | 625 days ago | 6 days |
| 12181 | adomani | lint also `let` vs `have` | This PR is symmetrical to #12157: here we lint for non-`Type`-valued `let`s. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter | 797/544 | Archive/Imo/Imo1962Q1.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Mathlib.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/DirectLimit.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/Homology/HomologicalComplexBiprod.lean,Mathlib/Algebra/Homology/HomologySequence.lean,Mathlib/Algebra/Homology/HomotopyCategory/Pretriangulated.lean,Mathlib/Algebra/Homology/Localization.lean,Mathlib/Algebra/Homology/ShortComplex/Abelian.lean,Mathlib/Algebra/Homology/ShortComplex/ConcreteCategory.lean,Mathlib/Algebra/Homology/ShortComplex/Exact.lean,Mathlib/Algebra/Homology/ShortComplex/ExactFunctor.lean,Mathlib/Algebra/Homology/ShortComplex/Homology.lean,Mathlib/Algebra/Homology/ShortComplex/LeftHomology.lean,Mathlib/Algebra/Homology/ShortComplex/Linear.lean,Mathlib/Algebra/Homology/ShortComplex/Preadditive.lean,Mathlib/Algebra/Homology/ShortComplex/PreservesHomology.lean,Mathlib/Algebra/Homology/ShortComplex/QuasiIso.lean,Mathlib/Algebra/Homology/ShortComplex/RightHomology.lean,Mathlib/Algebra/Lie/Engel.lean,Mathlib/Algebra/Lie/Killing.lean,Mathlib/Algebra/Module/PID.lean,Mathlib/Algebra/Module/Submodule/Localization.lean,Mathlib/Algebra/Module/Zlattice.lean,Mathlib/Algebra/MonoidAlgebra/Grading.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/AlgebraicGeometry/Pullbacks.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/AlgebraicTopology/DoldKan/Homotopies.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/Rademacher.lean,Mathlib/Analysis/Complex/Tietze.lean,Mathlib/Analysis/Convex/Between.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Rayleigh.lean,Mathlib/Analysis/NormedSpace/ContinuousAffineMap.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Completeness.lean,Mathlib/Analysis/NormedSpace/Spectrum.lean,Mathlib/Analysis/SpecialFunctions/Integrals.lean,Mathlib/CategoryTheory/Abelian/Basic.lean,Mathlib/CategoryTheory/Abelian/Exact.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/Abelian/Transfer.lean,Mathlib/CategoryTheory/Adhesive.lean,Mathlib/CategoryTheory/Closed/Cartesian.lean,Mathlib/CategoryTheory/Closed/Monoidal.lean,Mathlib/CategoryTheory/Comma/Arrow.lean,Mathlib/CategoryTheory/EffectiveEpi/Extensive.lean,Mathlib/CategoryTheory/Extensive.lean,Mathlib/CategoryTheory/Functor/EpiMono.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Galois/Basic.lean,Mathlib/CategoryTheory/Galois/Decomposition.lean,Mathlib/CategoryTheory/Galois/Examples.lean,Mathlib/CategoryTheory/GradedObject/Trifunctor.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/CategoryTheory/Limits/ConcreteCategory.lean,Mathlib/CategoryTheory/Limits/Constructions/EpiMono.lean,Mathlib/CategoryTheory/Limits/Constructions/WeaklyInitial.lean,Mathlib/CategoryTheory/Limits/FilteredColimitCommutesFiniteLimit.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/FintypeCat.lean,Mathlib/CategoryTheory/Limits/Fubini.lean,Mathlib/CategoryTheory/Limits/IsLimit.lean,Mathlib/CategoryTheory/Limits/Preserves/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/FiniteLimits.lean,Mathlib/CategoryTheory/Limits/VanKampen.lean,Mathlib/CategoryTheory/Localization/LocalizerMorphism.lean,Mathlib/CategoryTheory/Localization/Pi.lean,Mathlib/CategoryTheory/Localization/Resolution.lean,Mathlib/CategoryTheory/Monad/Monadicity.lean,Mathlib/CategoryTheory/PUnit.lean,Mathlib/CategoryTheory/Sites/Coherent/CoherentSheaves.lean,Mathlib/CategoryTheory/Sites/Coherent/RegularSheaves.lean,Mathlib/CategoryTheory/Sites/Coverage.lean,Mathlib/CategoryTheory/Sites/LeftExact.lean,Mathlib/CategoryTheory/Sites/Preserves.lean,Mathlib/CategoryTheory/Sites/Pullback.lean,Mathlib/CategoryTheory/Sites/Sheaf.lean,Mathlib/CategoryTheory/Triangulated/Pretriangulated.lean,Mathlib/Combinatorics/Colex.lean,Mathlib/Combinatorics/SetFamily/Kleitman.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity.lean | 271 | 0 | [] | nobody | 9 months ago | 745 days ago | 8 seconds |
| 10190 | jstoobysmith | feat(AlgebraicTopology): add Augmented Simplex Category | - Added the definition of the category FinLinOrd of finite linear ordered sets. - Added the definition of the augmented simplex category `AugmentedSimplexCategory`, and showed it is the Skeleton of FinLinOrd. - Showed that the category of augmented simplicial objects defined as a comma category is equivalent to the category of functors from `AugmentedSimplexCategory^\op` --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP t-category-theory new-contributor merge-conflict | 720/0 | Mathlib.lean,Mathlib/AlgebraicTopology/AugmentedSimplexCategory.lean,Mathlib/AlgebraicTopology/SimplicialObject.lean,Mathlib/Order/Category/FinLinOrd.lean | 4 | 5 | ['TwoFX', 'YaelDillies', 'joelriou', 'jstoobysmith'] | nobody | 9 months ago | 811 days ago | 7 days |
| 10084 | alreadydone | draft for Van Kampen | The part about the homotopy lifting property for covering maps has been extracted to #22649 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-topology | 91/24 | Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/VanKampen.lean | 2 | 1 | ['leanprover-community-bot-assistant'] | nobody | 9 months ago | unknown | 0 seconds |
| 25914 | eric-wieser | feat: add an ext lemma for the opposite category | This powers up `aesop_cat`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory awaiting-CI | 18/56 | Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/CategoryTheory/Abelian/Opposite.lean,Mathlib/CategoryTheory/Category/RelCat.lean,Mathlib/CategoryTheory/GuitartExact/Opposite.lean,Mathlib/CategoryTheory/Limits/Opposites.lean,Mathlib/CategoryTheory/Limits/Shapes/Products.lean,Mathlib/CategoryTheory/Opposites.lean,Mathlib/CategoryTheory/Triangulated/Opposite/Functor.lean,Mathlib/Combinatorics/Quiver/Basic.lean | 9 | 7 | ['eric-wieser', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'robin-carlier'] | nobody | 9 months ago | 320 days ago | 20 minutes |
| 20208 | js2357 | feat: Define the localization of a fractional ideal at a prime ideal | Define the localization of a fractional ideal at a prime ideal, and prove some basic properties. --- Alternate version of #14237 generalized to use `IsLocalization` and `IsFractionRing` rather than `Localization.AtPrime` and `FractionRing` [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 248/0 | Mathlib.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 493 days ago | 21 seconds |
| 24260 | plp127 | feat(Topology): add API for Hereditarily Lindelof spaces | Copies the stuff about Lindelof spaces to Hereditarily Lindelof spaces. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 222/42 | Mathlib/Topology/Compactness/Lindelof.lean | 1 | 15 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'urkud'] | urkud | 9 months ago | 345 days ago | 29 days |
| 27181 | ADedecker | chore: more conceptual definition of `ValuativeRel.ValueGroupWithZero` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 685/467 | Mathlib.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/GroupWithZero.lean,Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/RingTheory/OreLocalization/NonZeroDivisors.lean,Mathlib/RingTheory/OreLocalization/Ring.lean,Mathlib/RingTheory/Valuation/ValuativeRel.lean | 9 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 9 months ago | unknown | 0 seconds |
| 27813 | javra | feat: IMO 2025 Q1 | --- [](https://gitpod.io/from-referrer/) | IMO WIP | 882/0 | Archive/Imo/Imo2025Q1.lean | 1 | 1 | ['github-actions'] | nobody | 9 months ago | 273 days ago | 14 seconds |
| 27608 | RemyDegenne | feat(MeasureTheory): typeclasses for measures with finite moments | WIP because it seems useful for #26291 but I want to investigate more. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-measure-probability | 97/17 | Mathlib.lean,Mathlib/MeasureTheory/Measure/Typeclasses/FiniteMoments.lean,Mathlib/Probability/Moments/CovarianceBilin.lean | 3 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 9 months ago | 276 days ago | 1 second |
| 20008 | FLDutchmann | feat(NumberTheory): Selberg sieve | This PR is a working draft of the full proof of the fundamental theorem of the Selberg sieve. I will create dependent PRs as I clean up the code. This work was used in the first proof of the prime number theorem in PNT+. --- - [x] depends on: #20025 - [x] depends on: #20026 - [x] depends on: #20779 - [x] depends on: #21880 - [ ] depends on: #27702 - [ ] depends on: #27707 [](https://gitpod.io/from-referrer/) | t-number-theory blocked-by-other-PR merge-conflict awaiting-author t-analysis | 937/0 | Mathlib/NumberTheory/SelbergSieve/Basic.lean,Mathlib/NumberTheory/SelbergSieve/Selberg.lean,docs/references.bib | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | unknown | 0 seconds |
| 26383 | eric-wieser | feat: `Real.sin_eq_one_iff` and similar | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 155/101 | Mathlib/Algebra/ModEq.lean,Mathlib/Analysis/SpecialFunctions/Complex/Log.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Complex.lean | 5 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | unknown | 0 seconds |
| 25991 | Multramate | feat(AlgebraicGeometry/EllipticCurve): generalise nonsingular condition | This PR continues the work from #25219. Original PR: https://github.com/leanprover-community/mathlib4/pull/25219 | merge-conflict t-algebraic-geometry | 2127/1561 | Mathlib/Algebra/Group/Units/Basic.lean,Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/Algebra/Module/PID.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Span.lean | 15 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 300 days ago | 18 days |
| 25986 | Multramate | feat(AlgebraicGeometry/EllipticCurve/NumberField/Height): define heights on Weierstrass curves | This PR continues the work from #15786. Original PR: https://github.com/leanprover-community/mathlib4/pull/15786 | t-algebraic-geometry | 650/0 | Mathlib/AlgebraicGeometry/EllipticCurve/NumberField/Height.lean | 1 | 2 | ['Multramate', 'github-actions'] | nobody | 8 months ago | unknown | 0 seconds |
| 25985 | Multramate | feat(AlgebraicGeometry/EllipticCurve/Jacobian): add equivalences between points and explicit WithZero types | This PR continues the work from #14923. Original PR: https://github.com/leanprover-community/mathlib4/pull/14923 | merge-conflict t-algebraic-geometry | 262/66 | Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,scripts/style-exceptions.txt | 4 | 1 | ['Multramate'] | nobody | 8 months ago | 318 days ago | 48 seconds |
| 25982 | Multramate | feat(AlgebraicGeometry/EllipticCurve/Group): compute range of baseChange | This PR continues the work from #10142. Original PR: https://github.com/leanprover-community/mathlib4/pull/10142 | merge-conflict t-algebraic-geometry | 421/212 | Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/Subgroup/Basic.lean,Mathlib/GroupTheory/Submonoid/Operations.lean | 6 | 1 | ['Multramate'] | nobody | 8 months ago | 318 days ago | 51 seconds |
| 25427 | Paul-Lez | feat(Analysis/Calculus/PartialDerivatives): Propose notation for partial derivatives. | This PR introduces a notation for partial derivatives, taken with respect to a canonical basis. The idea here is that this might be useful for e.g. writing down PDEs. The notation allows use to write things like
```lean
-- The canonical basis for `ℝ × ℝ` is indexed by `Fin 0` so `∂₀[ℝ]` corresponds to taking
-- the first partial derivative
example : (∂₀[ℝ] fun (x : ℝ × ℝ) => x.1) 0 = 1 := by
simp [Pi.zero_def, lineDeriv]
```
This has already been discussed on Zulip [here](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Partial.20derivatives).
I've opened this PR as a draft in order to get preliminary feedback on the contents (e.g. is this appropriate for Mathlib?); the file contains some demos of the notation in action.
Co-authored-by: Eric Wieser |
merge-conflict blocked-by-other-PR t-analysis | 195/0 | Mathlib.lean,Mathlib/Analysis/Calculus/PartialDerivatives/Notation.lean,Mathlib/LinearAlgebra/Basis/HasCanonicalBasis.lean | 3 | 16 | ['Paul-Lez', 'github-actions', 'leanprover-community-bot-assistant', 'lecopivo', 'mathlib4-dependent-issues-bot', 'ocfnash'] | nobody | 8 months ago | unknown | 0 seconds |
| 25425 | Paul-Lez | feat(LinearAlgebra/Basis/HasCanonicalBasis): propose `HasCanonicalBasis` class | Context: in some cases, e.g. writing down PDEs, having a notion of partial derivatives can be useful. In an ideal world (as mentioned by @ocfnash in [this Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Partial.20derivatives/with/463936246)), one could write something along the lines of `open scoped PartialDerivatives` in order to access nice notation for this.
This PR introduces a notion of a canonical basis for a module in order to allow taking partial derivatives with respect to it.
A later PR (which I am about open) would then propose a notation for taking partial derivatives (defined using `lineDeriv` in order to avoid requiring Frechet-differentiability assumptions). The goal here is to have notation that works equally well on e.g. `𝕜 × 𝕜` and `EuclideanSpace 𝕜 (Fin 2)` and so on.
I've opened this PR as a draft in order to get some initial feedback on the content (and whether this is considered appropriate for Mathlib!); the file itself would need to be split (e.g. the instances defined should probably go in different files)
Co-authored-by: Eric Wieser |
merge-conflict t-algebra | 105/0 | Mathlib.lean,Mathlib/LinearAlgebra/Basis/HasCanonicalBasis.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | unknown | 0 seconds |
| 25362 | adomani | feat: a linter for duplicated `open` | This linter warns when a namespace is repeated. It makes an effort to report only the problematic namespaces, but is not especially robust. The linter has some awareness of the `namespace` command, so ```lean def X.Y := 0 open X namespace X open Y ``` will flag both `namespace X` and `open Y` as problematic, even though it was the `open `X` that became redundant with `namespace X`. However, I will not have much time to devote to polishing this and there are quite a few exception in Mathlib before a better version could be seriously considered for adoption. [#mathlib4 > linter requests @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/linter.20requests/near/520273644) --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-linter large-import | 191/94 | Mathlib.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/GroupWithZero/Pi.lean,Mathlib/Algebra/Order/Ring/InjSurj.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Basic.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Finite/Defs.lean,Mathlib/Data/Ineq.lean,Mathlib/Data/List/Lemmas.lean,Mathlib/Data/List/NatAntidiagonal.lean,Mathlib/Data/Nat/Choose/Basic.lean,Mathlib/Data/Nat/Prime/Basic.lean,Mathlib/Data/Nat/Prime/Defs.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Init.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/Embedding/Set.lean,Mathlib/Logic/Pairwise.lean,Mathlib/Order/BoundedOrder/Basic.lean,Mathlib/Order/WithBot.lean,Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ApplyFun.lean,Mathlib/Tactic/Bound.lean,Mathlib/Tactic/CongrM.lean,Mathlib/Tactic/Find.lean,Mathlib/Tactic/Lift.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DupOpen.lean,Mathlib/Tactic/NormNum/PowMod.lean,Mathlib/Tactic/Recover.lean,Mathlib/Tactic/ReduceModChar.lean,Mathlib/Tactic/Widget/Calc.lean,Mathlib/Tactic/Widget/SelectInsertParamsClass.lean,Mathlib/Tactic/Widget/StringDiagram.lean,Mathlib/Topology/CWComplex/Abstract/Basic.lean,Mathlib/Topology/ContinuousMap/Interval.lean,Mathlib/Topology/Germ.lean,Mathlib/Topology/Homotopy/HSpaces.lean,Mathlib/Topology/Order/LowerUpperTopology.lean,Mathlib/Topology/Order/PartialSups.lean,Mathlib/Topology/Separation/DisjointCover.lean,Mathlib/Topology/Sheaves/Sheafify.lean,Mathlib/Util/CountHeartbeats.lean,MathlibTest/DupOpen.lean | 47 | 14 | ['adomani', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 333 days ago | 23 seconds |
| 25238 | Hagb | feat(Tactic/ComputeDegree): add support for scalar multiplication with different types | It would be able to deal with `a • (X : R[X])` where `a : S` is in a different type `S` with `[SMulZeroClass S R]`. --- - [x] depends on: #25237 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta new-contributor | 17/5 | Mathlib/Tactic/ComputeDegree.lean,MathlibTest/ComputeDegree.lean | 2 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 300 days ago | 38 days |
| 17145 | Command-Master | feat(Archive/Ioi/Ioi2024Q2): a proof of the solution of question 2 from IOI 2024. | --- - [x] depends on: #17189 - [x] depends on: #17190 - [x] depends on: #17191 [](https://gitpod.io/from-referrer/) | merge-conflict WIP IMO large-import | 1013/1 | Archive.lean,Archive/Ioi/Ioi2024Q2.lean,Mathlib.lean,Mathlib/Combinatorics/Orbits.lean,Mathlib/Data/List/SplitLengths.lean,Mathlib/Data/List/Transpose.lean,Mathlib/Data/List/Zip.lean,Mathlib/Data/Vector/Basic.lean,Mathlib/Data/Vector/Defs.lean,Mathlib/Data/Vector/MapLemmas.lean,Mathlib/Data/Vector/Transpose.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/Logic/Function/Iterate.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Partition/Finpartition.lean | 15 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 27643 | ADedecker | Ad bdd unif conv | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 111/26 | Mathlib/Analysis/LocallyConvex/Bounded.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/Algebra/Module/UniformConvergence.lean,Mathlib/Topology/Bornology/Absorbs.lean | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 26385 | jjdishere | feat(RingTheory/Perfectoid): define integral perfectoid rings | This PR continues the work from #22331. Original PR: https://github.com/leanprover-community/mathlib4/pull/22331 | merge-conflict WIP t-ring-theory | 1081/15 | Mathlib.lean,Mathlib/Algebra/Ring/Aut.lean,Mathlib/FieldTheory/Perfect.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/PowTransition.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/RingTheory/Perfectoid/BDeRham.lean,Mathlib/RingTheory/Perfectoid/FontaineTheta.lean,Mathlib/RingTheory/Perfectoid/IntergalPerfectoid.lean,Mathlib/RingTheory/Perfectoid/Untilt.lean,Mathlib/RingTheory/WittVector/Basic.lean,Mathlib/RingTheory/WittVector/Complete.lean,Mathlib/RingTheory/WittVector/TeichmullerSeries.lean,docs/references.bib | 16 | 3 | ['github-actions', 'jjdishere', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 310 days ago | 1 minute |
| 22909 | AntoineChambert-Loir | feat(RingTheory/Pure): pure submodules | A submodule `N` of an `R`-module is *pure* if all maps `S ⊗[R] N → S ⊗[R] M` deduced by base change from the injection of `N` into `M` are injective, for all `R`-algebras `S`. This is expressed by the class `Submodule.IsPure`. For type theoretic reason, the definition of `Submodule.IsPure` only considers algebras `S` in the same universe as `R`, but `Submodule.IsPure.baseChange_injective` establishes the property for all universes. * `Submodule.IsComplemented.isPure` : a complemented submodule is pure. Co-authored with @mariainesdff --- - [ ] depends on: #22898 - [ ] depends on: #22908 - [x] depends on: #22911 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory blocked-by-other-PR | 592/3 | Mathlib.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/RingTheory/Adjoin/FG.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Finiteness/Cardinality.lean,Mathlib/RingTheory/Finiteness/Small.lean,Mathlib/RingTheory/Pure.lean,Mathlib/RingTheory/Spectrum/Prime/RingHom.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/FG.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/Small.lean | 11 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 413 days ago | 17 minutes |
| 22908 | AntoineChambert-Loir | feat(RingTheory/Finiteness/Small): tensor product of the system of small submodules | The directed limit of a tensor product for the directed system of small submodules. Co-authored with @mariainesdff --- - [ ] depends on: #22898 - [x] depends on: #22911 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory blocked-by-other-PR | 624/2 | Mathlib.lean,Mathlib/RingTheory/Adjoin/FG.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Finiteness/Cardinality.lean,Mathlib/RingTheory/Finiteness/Small.lean,Mathlib/RingTheory/Spectrum/Prime/RingHom.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/FG.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/Small.lean | 9 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 413 days ago | 59 minutes |
| 22898 | AntoineChambert-Loir | feat(RingTheory/TensorProduct/DirectLimit/FG): direct limit of finitely generated submodules and tensor product | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-ring-theory | 399/0 | Mathlib.lean,Mathlib/RingTheory/Adjoin/FG.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/FG.lean | 5 | 9 | ['AntoineChambert-Loir', 'alreadydone', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 403 days ago | 10 days |
| 20431 | erdOne | feat(RingTheory/AdicCompletion): monotonicity of adic-completeness | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 206/16 | Mathlib.lean,Mathlib/Algebra/Module/Submodule/Defs.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Mono.lean,Mathlib/RingTheory/Finiteness/Ideal.lean | 7 | 13 | ['chrisflav', 'erdOne', 'github-actions'] | nobody | 8 months ago | 445 days ago | 32 days |
| 19596 | Command-Master | feat(RingTheory/Valuation/PrimeMultiplicity): define `WithTop ℤ`-valued prime multiplicity on a fraction field | Moves: - `multiplicity_addValuation` -> `AddValuation.multiplicity` - `multiplicity_addValuation_apply` -> `AddValuation.multiplicity_apply` --- - [x] depends on: #19149 - [x] depends on: #18786 - [x] depends on: #19122 - [x] depends on: #18954 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory large-import | 101/37 | Mathlib/Data/ENat/Basic.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/Valuation/PrimeMultiplicity.lean | 3 | 11 | ['ChrisHughes24', 'Command-Master', 'Vierkantor', 'faenuccio', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 474 days ago | 8 days |
| 18646 | jxjwan | feat(RingTheory): isotypic components | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory new-contributor | 308/0 | Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/RingTheory/Isotypic.lean,Mathlib/RingTheory/SimpleModule.lean | 3 | 1 | ['github-actions'] | nobody | 8 months ago | 542 days ago | 26 minutes |
| 17246 | pechersky | feat(RingTheory/PrimaryDecomposition): PIR of Noetherian under jacobson condition | --- - [x] depends on: #17634 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 653/1 | Mathlib.lean,Mathlib/NumberTheory/KummerDedekind.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Jacobson/Ideal.lean,Mathlib/RingTheory/PrimaryDecomposition.lean,docs/references.bib | 8 | 8 | ['erdOne', 'github-actions', 'mathlib4-dependent-issues-bot'] | erdOne | 8 months ago | 530 days ago | 13 days |
| 21474 | erdOne | feat(RingTheory): replace `Ring.DimensionLEOne` with `Ring.KrullDimLE` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory large-import | 285/170 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/Basic.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/DedekindDomain/Ideal.lean,Mathlib/RingTheory/DiscreteValuationRing/TFAE.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/KrullDimension/Basic.lean,Mathlib/RingTheory/KrullDimension/Localization.lean,Mathlib/RingTheory/KrullDimension/Polynomial.lean,Mathlib/RingTheory/KrullDimension/Quotient.lean,Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean,Mathlib/RingTheory/Nilpotent/End.lean,Mathlib/RingTheory/Nilpotent/Lemmas.lean,Mathlib/RingTheory/PID/Quotient.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/Spectrum/Maximal/Localization.lean | 16 | 1 | ['github-actions'] | nobody | 8 months ago | 449 days ago | 5 hours |
| 8195 | newell | feat: add a group presentation of the `DihedralGroup n` | Add group presentation $\< a, b\ |\ a ^ 2 = 1, b ^ 2 = 1, (a * b) ^ n = 1 \>$ for `DihedralGroup n`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-group-theory | 206/2 | Mathlib/GroupTheory/PresentedGroup.lean,Mathlib/GroupTheory/SpecificGroups/Dihedral.lean | 2 | 6 | ['kbuzzard', 'newell'] | nobody | 8 months ago | unknown | 0 seconds |
| 11212 | shuxuezhuyi | feat(GroupTheory/GroupAction): instance `MulAction (β ⧸ H) α` | We instance this naturally from `MulAction β α` when `H` is a normal subgroup and acts trivially on `α`. We also instance `IsometricSMul (M ⧸ N) X` in this way. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-group-theory large-import | 53/1 | Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/Topology/MetricSpace/IsometricSMul.lean | 2 | 6 | ['YaelDillies', 'github-actions', 'grunweg', 'urkud'] | eric-wieser | 8 months ago | 482 days ago | 193 days |
| 27886 | alreadydone | feat(Algebra): (Mv)Polynomial.X is irreducible assuming NoZeroDivisors | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 178/66 | Archive/Examples/Eisenstein.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Domain.lean,Mathlib/Algebra/Polynomial/Degree/Units.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/Combinatorics/Nullstellensatz.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder/DegLex.lean,Mathlib/RingTheory/Polynomial/Content.lean,Mathlib/RingTheory/Polynomial/Eisenstein/Criterion.lean | 13 | 3 | ['alreadydone', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 270 days ago | 22 hours |
| 26200 | adomani | fix: add label when landrun fails | Adds the `permission-denied` label on PRs that get blocked by landrun. --- [](https://gitpod.io/from-referrer/) | merge-conflict CI | 68/8 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 268 days ago | 46 days |
| 17469 | joelriou | feat(Algebra/ModuleCat/Differentials/Presheaf): the presheaf of relative differentials | Given a functor `F : C ⥤ D`, presheaves of commutative rings `S`, `R` and a morphism `φ : S ⟶ F.op ⋙ R`, we show that derivations relative to `φ` are representable by a presheaf of `R`-modules. This is obtained by reducing to the case of absolute differentials. The construction shall allow to deduce the presheaf version of the cokernel sequence $$f^\star \Omega_{Y/S} ⟶ \Omega_{X/S} ⟶ \Omega_{X/Y} ⟶ 0$$ when `f : X ⟶ Y` and `g : Y ⟶ S` are morphisms of schemes. --- - [x] depends on: #17366 - [x] depends on: #19507 - [x] depends on: #17388 - [x] depends on: #16755 [](https://gitpod.io/from-referrer/) | WIP t-category-theory large-import merge-conflict t-algebraic-geometry | 391/10 | Mathlib/Algebra/Category/ModuleCat/Differentials/Presheaf.lean | 1 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 572 days ago | 8 minutes |
| 25288 | robertmaxton42 | feat(CategoryTheory): generalize `Discrete` to arbitrary morphism levels | Using an unused `let`, add an 'anchor' to the definition of `Discrete`, allowing it to carry a second universe level that is then used to permit discrete categories to live in any `Cat.{v, u}`. (This trick was borrowed from the code of `ULiftHom`.) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 38/32 | Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean,Mathlib/CategoryTheory/Discrete/Basic.lean,Mathlib/CategoryTheory/IsConnected.lean | 3 | 3 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 337 days ago | 7 minutes |
| 27709 | kckennylau | chore: fix links | --- See https://github.com/leanprover-community/mathlib4/pull/27545#discussion_r2238206933 [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 269/256 | Mathlib/Algebra/Algebra/Bilinear.lean,Mathlib/Algebra/GCDMonoid/Multiset.lean,Mathlib/Algebra/Group/Even.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Homology/DerivedCategory/Basic.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Module/Hom.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Algebra/Order/Field/Pi.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean,Mathlib/Algebra/Order/Hom/Basic.lean,Mathlib/Algebra/Order/Monovary.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Ring/Basic.lean,Mathlib/Algebra/Squarefree/Basic.lean,Mathlib/Algebra/Star/BigOperators.lean,Mathlib/Algebra/Star/Free.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Complex/Circle.lean,Mathlib/Analysis/Complex/OperatorNorm.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Convex/Jensen.lean,Mathlib/Analysis/Meromorphic/IsolatedZeros.lean,Mathlib/Analysis/Normed/Operator/BoundedLinearMaps.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Bounds.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/EulerSineProd.lean,Mathlib/CategoryTheory/Abelian/Opposite.lean,Mathlib/CategoryTheory/Adjunction/Opposites.lean,Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean,Mathlib/CategoryTheory/Closed/Monoidal.lean,Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean,Mathlib/CategoryTheory/Localization/Equivalence.lean,Mathlib/CategoryTheory/Localization/Trifunctor.lean,Mathlib/CategoryTheory/ObjectProperty/Basic.lean,Mathlib/CategoryTheory/Sites/Coherent/SheafComparison.lean,Mathlib/Combinatorics/Colex.lean,Mathlib/Combinatorics/Hall/Finite.lean,Mathlib/Combinatorics/Pigeonhole.lean,Mathlib/Combinatorics/Quiver/Covering.lean,Mathlib/Combinatorics/Quiver/Path.lean,Mathlib/Control/LawfulFix.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/Fin/Pigeonhole.lean,Mathlib/Data/FinEnum/Option.lean,Mathlib/Data/Finset/Filter.lean,Mathlib/Data/Finsupp/Fin.lean,Mathlib/Data/Fintype/BigOperators.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Int/Basic.lean,Mathlib/Data/Int/Cast/Basic.lean,Mathlib/Data/Int/Cast/Lemmas.lean,Mathlib/Data/Int/Lemmas.lean,Mathlib/Data/Int/Order/Lemmas.lean,Mathlib/Data/Int/Range.lean,Mathlib/Data/List/Chain.lean,Mathlib/Data/List/Dedup.lean,Mathlib/Data/List/Destutter.lean,Mathlib/Data/List/Forall2.lean,Mathlib/Data/List/Lattice.lean,Mathlib/Data/List/Lemmas.lean,Mathlib/Data/List/Nodup.lean,Mathlib/Data/List/Pairwise.lean,Mathlib/Data/List/Permutation.lean,Mathlib/Data/List/ProdSigma.lean,Mathlib/Data/List/Sections.lean,Mathlib/Data/List/Sublists.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matroid/Minor/Restrict.lean,Mathlib/Data/Multiset/FinsetOps.lean,Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Cast/WithTop.lean,Mathlib/Data/Nat/Choose/Basic.lean,Mathlib/Data/Nat/Factorization/Basic.lean,Mathlib/Data/Nat/Factorization/LCM.lean,Mathlib/Data/PSigma/Order.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Data/Rat/Encodable.lean,Mathlib/Data/Set/Card.lean,Mathlib/Data/Set/Defs.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/Data/Set/Functor.lean,Mathlib/Data/Set/Notation.lean,Mathlib/Data/Set/Pairwise/Basic.lean,Mathlib/Data/Set/Prod.lean,Mathlib/Data/Sigma/Lex.lean | 157 | 87 | ['github-actions', 'kbuzzard', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 274 days ago | 9 seconds |
| 10345 | newell | feat(Algebra.Module.Zlattice): Add Voronoi Domain | Adds the definition for a Voronoi Domain in regards to the $\mathbb{Z}$-lattice: $$C := \lbrace\mathbf{w} \in \mathbb{V}^n\ :\ |\mathbf{w}| \leq |\mathbf{w} - \mathbf{v}|\ \text{for all}\ \mathbf{v} \in \mathbf{L} \rbrace$$ where $\mathbf{L}\$ is the $\mathbb{Z}$-lattice. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 17/0 | Mathlib/Algebra/Module/Zlattice.lean | 1 | 3 | ['alreadydone', 'newell'] | nobody | 8 months ago | unknown | 0 seconds |
| 28168 | astrainfinita | feat: hensel's lemma for topological rings | --- [](https://gitpod.io/from-referrer/) | t-algebra WIP t-ring-theory t-topology | 616/0 | Mathlib/RingTheory/Polynomial/Hensel.lean | 1 | 1 | ['github-actions'] | nobody | 8 months ago | unknown | 0 seconds |
| 20671 | thefundamentaltheor3m | feat(Analysis/Asymptotics/SpecificAsymptotics): Proving that 𝛔ₖ(n) = O(nᵏ⁺¹) | This PR proves a result about the $\sigma_k(n)$ arithmetic function, namely, that it is $O\left(n^{k+1}\right)$. Main theorem: `theorem sigma_asymptotic (k : ℕ) : (fun n ↦ (σ k n : ℝ)) =O[atTop] (fun n ↦ (n ^ (k + 1) : ℝ))` This result was proved as part of the sphere packing project. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor large-import merge-conflict awaiting-author | 29/0 | Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean | 1 | 3 | ['b-mehta', 'github-actions', 'mathlib4-merge-conflict-bot'] | b-mehta | 8 months ago | 465 days ago | 9 days |
| 20267 | joelriou | feat(CategoryTheory): comma categories are accessible | --- (I shall probably not work on this PR in the near future.) - [ ] depends on: #19937 - [ ] depends on: #19945 - [ ] depends on: #19959 - [ ] depends on: #20005 - [ ] depends on: #19955 - [x] depends on: #20263 [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-category-theory | 1513/7 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Arrow.lean,Mathlib/CategoryTheory/Comma/CardinalArrow.lean,Mathlib/CategoryTheory/EssentiallySmall.lean,Mathlib/CategoryTheory/Limits/Comma.lean,Mathlib/CategoryTheory/Limits/TypesFiltered.lean,Mathlib/CategoryTheory/Presentable/Basic.lean,Mathlib/CategoryTheory/Presentable/CardinalFilteredPresentation.lean,Mathlib/CategoryTheory/Presentable/Comma.lean,Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean,Mathlib/CategoryTheory/Presentable/Limits.lean,Mathlib/CategoryTheory/Presentable/LocallyPresentable.lean,Mathlib/CategoryTheory/Presentable/ParallelMaps.lean,Mathlib/SetTheory/Cardinal/HasCardinalLT.lean,docs/references.bib | 15 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 27451 | kckennylau | feat(RingTheory/Valuation): define ball, closed ball, and sphere | *From the 2025 Local Class Field Theory Workshop.* --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 27/0 | Mathlib/RingTheory/Valuation/Basic.lean | 1 | 13 | ['JovanGerb', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'pechersky', 'wwylele'] | nobody | 8 months ago | 263 days ago | 17 days |
| 27987 | kckennylau | feat(RingTheory/Valuation): define ball, closed ball, and sphere | --- The pullback PR of #26827 and #27451. [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory large-import | 73/0 | Mathlib/RingTheory/Valuation/Basic.lean | 1 | 4 | ['JovanGerb', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 263 days ago | 6 days |
| 27444 | grunweg | feat: generalise more lemmas to enorms | The selection of lemmas may seem eclectic, but follows a clear path: I'm working on generalising the last section of `IntegrableOn.lean` to enorms. (This will be continued in a later PR.) --- Commits can be reviewed independently. - [x] depends on: #27419 (first commits) - [x] depends on: #27456 (last commits) [](https://gitpod.io/from-referrer/) | carleson WIP | 10/0 | Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean | 1 | 3 | ['github-actions', 'grunweg', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 263 days ago | 12 minutes |
| 24862 | grunweg | feat(LocallyIntegrable): generalise more to enorms | --- Note: github's diff is very confused; it includes changes which very clearly are already on the master branch. I'll see which of the remaining changes after the dependencies have landed is already polished enough. - [x] depends on: #24352 - [x] depends on: #27457 (this half is settled already) - [ ] open question: filter lemmas; IsBoundedUnder is not the right condition as-is; need to think (or just not generalise) [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson t-measure-probability | 171/88 | Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean | 3 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 352 days ago | 1 second |
| 25133 | erdOne | feat(Tactic/NormNum): support positive characteristic | Co-authored-by: Heather Macbeth --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP large-import t-meta | 250/39 | Mathlib/Tactic/NormNum/CharP.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/NormNum/Eq.lean,Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/NormNum/Test.lean | 5 | 5 | ['erdOne', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 27003 | eric-wieser | chore: use `Simp.ResultQ` more often | Also uses `~q` in place of manual `isDefEq` matching. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 18/22 | Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/NormNum/Result.lean,Mathlib/Tactic/ReduceModChar.lean | 3 | 7 | ['JovanGerb', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | JovanGerb | 8 months ago | 261 days ago | 32 days |
| 22925 | ggranberry | feat(Mathlib/PlaceHolder/ToeplitzHausdorff): Toeplitz-Hausdorff | --- [](https://gitpod.io/from-referrer/) | WIP new-contributor will-close-soon awaiting-author help-wanted t-analysis | 411/0 | Mathlib/PlaceHolder/ToeplitzHausdorff.lean,Mathlib/PlaceHolder/ToeplitzHausdorff_v2.lean | 2 | 11 | ['faenuccio', 'ggranberry', 'github-actions'] | faenuccio | 8 months ago | 409 days ago | 21 minutes |
| 16150 | urkud | feat(Dynamics): Hopf decomposition | Prove Hopf decomposition. - [ ] rewrite to work with the saturations right away, not with a wandering set. - [ ] generalize to an action of a countable group, use fundamental domains. --- - [ ] depends on: #16146 - [ ] depends on: #16126 [](https://gitpod.io/from-referrer/) | merge-conflict t-dynamics t-measure-probability | 212/0 | Mathlib.lean,Mathlib/Dynamics/Ergodic/Dissipative.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean | 3 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 8 months ago | unknown | 0 seconds |
| 25401 | digama0 | feat(Util): SuppressSorry option | See also leanprover/lean4#8611 and [#lean4 > Silent sorry @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/Silent.20sorry/near/503537964). This is a stop-gap solution while leanprover/lean4#8611 is underway, but it works about as well as any other built in option. Hooking declaration elaborators turns out to be a very powerful technique. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 342/0 | Mathlib.lean,Mathlib/Util/CommandElabHook.lean,Mathlib/Util/SuppressSorry.lean,MathlibTest/suppressSorry.lean | 4 | 15 | ['digama0', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | alexjbest | 8 months ago | 260 days ago | 71 days |
| 27759 | plp127 | chore(FreeAbelianGroup): deprecate multiplication | Deprecate multiplication on `FreeAbelianGroup` in favor of using `MonoidAlgebra`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 176/86 | Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/MonoidAlgebra/MapDomain.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/RingTheory/FreeCommRing.lean,Mathlib/RingTheory/FreeRing.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 273 days ago | 1 hour |
| 7873 | astrainfinita | perf: reorder `extends` and change instance priority in algebra hierarchy | There are no strict rules, but in general `Cancel` is dropped first, then `Comm`, then `Neg / Inv`, then `Assoc`. Not sure if there's a better way. --- - [ ] depends on: #14712 - [x] depends on: #16638 - [ ] depends on: #18464 - [ ] depends on: #18468 - [ ] depends on: #18470 - [ ] depends on: #18472 - [ ] depends on: #18474 [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra blocked-by-other-PR | 494/204 | Archive/Imo/Imo1998Q2.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Associated.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/EuclideanDomain/Field.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/Field/IsField.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/InjSurj.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/InjSurj.lean,Mathlib/Algebra/GroupWithZero/Prod.lean,Mathlib/Algebra/GroupWithZero/Semiconj.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Homology/HomotopyCategory/DegreewiseSplit.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShiftSequence.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Grading.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Ring/BooleanRing.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/Rat.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/NormedSpace/Star/Multiplier.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/CategoryTheory/Preadditive/SingleObj.lean,Mathlib/CategoryTheory/Triangulated/Functor.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/Data/Nat/Cast/Defs.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Data/Rat/Denumerable.lean,Mathlib/Data/Real/ENatENNReal.lean,Mathlib/Dynamics/Ergodic/AddCircle.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/GroupTheory/SpecificGroups/Alternating.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/Init/ZeroOne.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/External.lean,Mathlib/MeasureTheory/Decomposition/Jordan.lean,Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean,Mathlib/NumberTheory/ArithmeticFunction.lean,Mathlib/NumberTheory/LegendreSymbol/GaussEisensteinLemmas.lean,Mathlib/NumberTheory/RamificationInertia.lean,Mathlib/NumberTheory/WellApproximable.lean,Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean,Mathlib/Order/Filter/Germ.lean,Mathlib/Order/Interval/Finset/Box.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Henselian.lean,Mathlib/RingTheory/Ideal/IsPrincipal.lean,Mathlib/RingTheory/Ideal/LocalRing.lean,Mathlib/RingTheory/Ideal/Norm.lean,Mathlib/RingTheory/Localization/Integral.lean,Mathlib/RingTheory/MvPolynomial/Symmetric.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/RingTheory/UniqueFactorizationDomain.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/Tactic/Positivity/Core.lean | 104 | 84 | ['MichaelStollBayreuth', 'astrainfinita', 'github-actions', 'kim-em', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball'] | nobody | 8 months ago | 657 days ago | 7 days |
| 21776 | alreadydone | Invertible modules | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 571/26 | Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Module/Submodule/Equiv.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/RingTheory/FractionalIdeal/Operations.lean,Mathlib/RingTheory/PicardGroup.lean | 5 | 3 | ['alreadydone', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 443 days ago | 19 seconds |
| 20722 | ctchou | feat(Counterexamples): the Vitali set is non-measurable | --- [](https://gitpod.io/from-referrer/) | please-adopt t-measure-probability new-contributor merge-conflict awaiting-author | 258/3 | Counterexamples.lean,Counterexamples/VitaliSetNotMeasurable.lean,Mathlib/MeasureTheory/Measure/NullMeasurable.lean,docs/1000.yaml | 4 | 76 | ['ctchou', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'vihdzp'] | vihdzp | 8 months ago | 472 days ago | 13 hours |
| 27446 | grunweg | chore: more enorm lemmas | Nothing to see yet: this is a big mess! Start unrolling at `eLpNorm_le_eLpNorm_top_mul_eLpNorm_enorm`; that proof could be a good next target. Need a version of `eLpNorm'_const_smul' which applies to NNReal (or ENNReal, I guess): need to generalise a bunch of lemmas for that. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson | 107/9 | Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean | 3 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 280 days ago | 1 minute |
| 14583 | lecopivo | fix: make concrete cycle notation local | fix: make c[...] notation for concrete cycles local --- The notation for concrete cycles prevents you using `c[i]` notation for `c : Array _` This currently does not work ``` import Mathlib variable (c : Array Nat) (i : Fin c.size) #check c[i] -- breaks because of notation for concrete cycles ``` This PR just marks it as local to prevent this issue. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 1/1 | Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 660 days ago | 3 hours |
| 5897 | eric-wieser | feat: add a `MonadError` instance for `ContT` | We already have a `MonadExcept` instance; this promotes it to `MonadError`. Note the issue with the existing `MonadExcept` instance still applies. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 16/0 | Mathlib/Control/Monad/Cont.lean | 1 | 25 | ['Vierkantor', 'YaelDillies', 'eric-wieser', 'github-actions', 'kmill'] | nobody | 8 months ago | 682 days ago | 339 days |
| 28276 | eric-wieser | refactor: tidy `lift_unique` lemmas | --- - [ ] depends on: #28275 [](https://gitpod.io/from-referrer/) | t-algebra | 37/20 | Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/Lie/UniversalEnveloping.lean,Mathlib/LinearAlgebra/DFinsupp.lean,Mathlib/LinearAlgebra/ExteriorAlgebra/Basic.lean | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 28502 | gilesgshaw | feat(Logic/Basic): avoid unnecessary uses of choice | Certain proofs are modified to remove a dependence on the axoim of choice --- - [ ] depends on: #28623 | blocked-by-other-PR new-contributor merge-conflict awaiting-author t-logic | 83/74 | Mathlib/Logic/Basic.lean | 1 | 7 | ['Ruben-VandeVelde', 'eric-wieser', 'gilesgshaw', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 258 days ago | 9 hours |
| 28622 | alreadydone | chore(Mathlib): replace `=>` by `↦` | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 51792/51792 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Bilinear.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Hom/Rat.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Opposite.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/Algebra/Rat.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Spectrum/Pi.lean,Mathlib/Algebra/Algebra/Spectrum/Quasispectrum.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Algebra/Subalgebra/IsSimpleOrder.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Algebra/Subalgebra/Matrix.lean,Mathlib/Algebra/Algebra/Subalgebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Subalgebra/Prod.lean,Mathlib/Algebra/Algebra/Subalgebra/Unitization.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/Algebra/ZMod.lean,Mathlib/Algebra/AlgebraicCard.lean,Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/BigOperators/Finsupp/Fin.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean,Mathlib/Algebra/BigOperators/Group/Finset/Sigma.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean,Mathlib/Algebra/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/BigOperators/Ring/Multiset.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/AlgCat/Limits.lean,Mathlib/Algebra/Category/AlgCat/Monoidal.lean,Mathlib/Algebra/Category/BialgCat/Basic.lean,Mathlib/Algebra/Category/BoolRing.lean,Mathlib/Algebra/Category/CoalgCat/Basic.lean,Mathlib/Algebra/Category/CoalgCat/ComonEquivalence.lean,Mathlib/Algebra/Category/FGModuleCat/Limits.lean,Mathlib/Algebra/Category/Grp/AB.lean,Mathlib/Algebra/Category/Grp/Adjunctions.lean,Mathlib/Algebra/Category/Grp/Basic.lean,Mathlib/Algebra/Category/Grp/Biproducts.lean,Mathlib/Algebra/Category/Grp/CartesianMonoidal.lean,Mathlib/Algebra/Category/Grp/Colimits.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/Grp/FilteredColimits.lean,Mathlib/Algebra/Category/Grp/Images.lean,Mathlib/Algebra/Category/Grp/Kernels.lean,Mathlib/Algebra/Category/Grp/LargeColimits.lean,Mathlib/Algebra/Category/Grp/LeftExactFunctor.lean,Mathlib/Algebra/Category/Grp/Limits.lean,Mathlib/Algebra/Category/Grp/Preadditive.lean,Mathlib/Algebra/Category/Grp/ZModuleEquivalence.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/GrpWithZero.lean,Mathlib/Algebra/Category/HopfAlgCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Biproducts.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Colimits.lean,Mathlib/Algebra/Category/ModuleCat/EpiMono.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Category/ModuleCat/Images.lean,Mathlib/Algebra/Category/ModuleCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Kernels.lean,Mathlib/Algebra/Category/ModuleCat/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Abelian.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Colimits.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Pushforward.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Sheafify.lean,Mathlib/Algebra/Category/ModuleCat/Products.lean | 3838 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 254 days ago | 18 hours |
| 24793 | tristan-f-r | feat: trace of unitarily similar matrices | adds a theorem relating trace to unitarily similar matrices used in the easy direction of specht's theorem --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 7/0 | Mathlib/LinearAlgebra/UnitaryGroup.lean | 1 | 4 | ['github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'tristan-f-r'] | nobody | 8 months ago | 353 days ago | 1 day |
| 28626 | alreadydone | chore(Archive, Counterexamples): replace => by ↦ | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 288/288 | Archive/Arithcc.lean,Archive/Examples/IfNormalization/Result.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Archive/Examples/PropEncodable.lean,Archive/Imo/Imo1959Q1.lean,Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q4.lean,Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo1977Q6.lean,Archive/Imo/Imo1981Q3.lean,Archive/Imo/Imo1987Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2006Q5.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q3.lean,Archive/Imo/Imo2013Q1.lean,Archive/Imo/Imo2019Q1.lean,Archive/Imo/Imo2024Q5.lean,Archive/MiuLanguage/Basic.lean,Archive/MiuLanguage/DecisionSuf.lean,Archive/OxfordInvariants/Summer2021/Week3P1.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/AscendingDescendingSequences.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/Konigsberg.lean,Archive/Wiedijk100Theorems/Partition.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Archive/ZagierTwoSquares.lean,Counterexamples/AharoniKorman.lean,Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean,Counterexamples/CharPZeroNeCharZero.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/DirectSumIsInternal.lean,Counterexamples/GameMultiplication.lean,Counterexamples/Girard.lean,Counterexamples/HomogeneousPrimeNotPrime.lean,Counterexamples/MapFloor.lean,Counterexamples/MonicNonRegular.lean,Counterexamples/Phillips.lean,Counterexamples/Pseudoelement.lean,Counterexamples/QuadraticForm.lean,Counterexamples/SorgenfreyLine.lean,Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean | 54 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 253 days ago | 2 days |
| 19582 | yu-yama | feat(GroupExtension/Abelian): define `OfMulDistribMulAction.equivH2` | Mainly defines: - `structure GroupExtension.OfMulDistribMulAction N G [MulDistribMulAction G N]`: group extensions of `G` by `N` where the multiplicative action of `G` on `N` is the conjugation - `structure GroupExtension.OfMulDistribMulActionWithSection N G [MulDistribMulAction G N]`: group extensions with specific choices of sections - `def GroupExtension.OfMulDistribMulAction.equivH2`: a bijection between the equivalence classes of group extensions and $H^2 (G, N)$ --- - [x] depends on: #20802 (split PR: contains changes to the `Defs` file) - [x] depends on: #20998 (split PR: mainly adds the `Basic` file) - [ ] depends on: #26670 (split PR: adds the first part of the `Abelian` file) Here is a relevant TODO in Mathlib: https://github.com/leanprover-community/mathlib4/blob/4e9fa40d7c480937e09cd6e47a591bd6f3b8be42/Mathlib/RepresentationTheory/GroupCohomology/LowDegree.lean#L46-L48 I would appreciate your comments. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR new-contributor | 750/14 | Mathlib.lean,Mathlib/GroupTheory/GroupExtension/Abelian.lean,Mathlib/GroupTheory/GroupExtension/Defs.lean,docs/references.bib | 4 | 5 | ['YaelDillies', 'erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 475 days ago | 43 days |
| 7300 | ah1112 | feat: synthetic geometry | This is adding synthetic geometry using Avigad's axioms and formalizing Euclid Book I, through the Pythagorean theorem. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted t-euclidean-geometry | 2661/0 | Mathlib.lean,Mathlib/Geometry/Synthetic/Avigad/Axioms.lean,Mathlib/Geometry/Synthetic/Avigad/EuclidBookI.lean,Mathlib/Geometry/Synthetic/Avigad/Tactics.lean | 4 | 74 | ['ah1112', 'alreadydone', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'plp127', 'tb65536', 'urkud'] | nobody | 8 months ago | 953 days ago | 1 minute |
| 27403 | MoritzBeroRoos | fix: replace probably erroneous usage of ⬝ (with old \cdot) by · (with \centerdot) | Discussion at [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.5Ccdot.20!.3D.20.5Ccenterdot). Currently the abbreviations \cdot and \centerdot resolve to different, with the naked eye nearly undistinguishable symbols (despite the c in cdot surely standing for center..). This pr replaces instances of ⬝ where · was probably meant. All of the replacement is in comments, except for the file bench_summary.lean which is used for priting the github benchmark results. Since this file is about scientific notation of numbers, sure · was meant to be used, not a rectangle. [Related](https://github.com/leanprover-community/mathlib4/pull/27399) --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor | 195/195 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/DirectSum/Idempotents.lean,Mathlib/Algebra/Lie/Derivation/Basic.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/Basic.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/Normed/Unbundled/InvariantExtension.lean,Mathlib/Analysis/SpecialFunctions/Complex/CircleAddChar.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Matrix/Block.lean,Mathlib/Data/Matrix/ConjTranspose.lean,Mathlib/Data/Matrix/Hadamard.lean,Mathlib/Data/Matrix/Mul.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/Data/Matrix/RowCol.lean,Mathlib/Data/Matrix/Vec.lean,Mathlib/FieldTheory/PurelyInseparable/PerfectClosure.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/LinearAlgebra/CrossProduct.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/DotProduct.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/Orthogonal.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/PerfectPairing/Matrix.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/NumberTheory/NumberField/ProductFormula.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean,Mathlib/SetTheory/Ordinal/Veblen.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Homeomorph/Lemmas.lean,Mathlib/Topology/Instances/Matrix.lean,scripts/bench_summary.lean | 49 | 5 | ['eric-wieser', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 274 days ago | 7 days |
| 28042 | kckennylau | feat(Topology/ValuativeRel): a topological basis indexed by pairs of elements | --- The pullback PR of #27314 and #27163. [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 140/23 | Mathlib/RingTheory/Valuation/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 2 | 3 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 261 days ago | 7 days |
| 23966 | astrainfinita | refactor: unbundle algebra from `{Seminormed, Normed}(Add)(Comm)Group` | --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #23621 - [ ] depends on: #23961 | t-algebra blocked-by-other-PR merge-conflict slow-typeclass-synthesis t-analysis | 3233/2752 | Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/CPolynomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/Linear.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Analytic/Polynomial.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Defs.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoundedVariation.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/BoxIntegral/Integrability.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Measure.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousLinearMap.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Defs.lean,Mathlib/Analysis/Calculus/AddTorsor/AffineMap.lean,Mathlib/Analysis/Calculus/AddTorsor/Coord.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/BumpFunction/Convolution.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/BumpFunction/Normed.lean,Mathlib/Analysis/Calculus/Conformal/InnerProduct.lean,Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/CPolynomial.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Analysis/Calculus/ContDiff/WithLp.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Shift.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/Deriv/Star.lean,Mathlib/Analysis/Calculus/Deriv/Support.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Calculus/DiffContOnCl.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Bilinear.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Calculus/FDeriv/Extend.lean,Mathlib/Analysis/Calculus/FDeriv/Linear.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Norm.lean,Mathlib/Analysis/Calculus/FDeriv/Pi.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/Analysis/Calculus/FDeriv/RestrictScalars.lean,Mathlib/Analysis/Calculus/FDeriv/Star.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/FDeriv/WithLp.lean,Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean | 579 | 7 | ['astrainfinita', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 27399 | MoritzBeroRoos | chore: replace every usage of ⬝ᵥ (with old \cdot) by ·ᵥ (with \centerdot) | Discussion at [zulip](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.5Ccdot.20!.3D.20.5Ccenterdot). Currently the abbreviations `\cdot` and `\centerdot` resolve to different, with the naked eye nearly undistinguishable symbols (despite the c in cdot surely standing for `center`..): - `\cdot` gives ⬝ [U+2B1D](https://www.compart.com/en/unicode/U+2B1D) "Black Very Small Square" - `\centerdot` gives · [U+00B7](https://www.compart.com/en/unicode/U+00B7) "Middle Dot" Mathlib mostly uses the `\centerdot` variant, except for the dotProduct notation and some probably unsuspecting people wanting \centerdot but getting \cdot in their comments and 6 uses of a notation using the raw `\cdot` without any subscript at `Mathlib\Topology\Homotopy\Product.lean`. This PR replaces the dot product `⬝ᵥ` with its `\centerdot` counterpart `·ᵥ`. The related PR [here](https://github.com/leanprover/vscode-lean4/pull/639) can then overwrite the `\cdot` abbreviation, to produce the same symbol as the `centerdot` abbreviation does. --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor | 133/133 | Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Matrix/Block.lean,Mathlib/Data/Matrix/ConjTranspose.lean,Mathlib/Data/Matrix/Hadamard.lean,Mathlib/Data/Matrix/Mul.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Data/Matrix/Reflection.lean,Mathlib/Data/Matrix/RowCol.lean,Mathlib/Data/Matrix/Vec.lean,Mathlib/LinearAlgebra/CrossProduct.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/DotProduct.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/Orthogonal.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Trace.lean,Mathlib/LinearAlgebra/PerfectPairing/Matrix.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/Topology/Instances/Matrix.lean | 25 | 6 | ['MoritzBeroRoos', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 274 days ago | 7 days |
| 27479 | iu-isgood | feat: Abel's Binomial Theorem | We have formalized Abel's Binomial Theorem as part of an REU project. There are a few remaining sorrys, but we will finish them soon. I will edit this PR message later according to community rules. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data new-contributor | 326/0 | Mathlib/Data/Nat/Choose/AbelBinomial.lean | 1 | 28 | ['ElifUskuplu', 'FrankieNC', 'github-actions', 'iu-isgood'] | nobody | 8 months ago | 280 days ago | 3 minutes |
| 28787 | alreadydone | feat(Counterexamples): a domain whose ring of differences is not a domain | Example produced by Gemini 2.5 Pro: https://gemini.google.com/share/9558539e1309 --- - [ ] depends on: #28468 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR large-import | 1200/204 | Counterexamples.lean,Counterexamples/GrothendieckAddGroupIsDomain.lean,Mathlib.lean,Mathlib/Algebra/Group/Subsemigroup/Defs.lean,Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/LocalizedModule/IsLocalization.lean,Mathlib/Algebra/Order/Nonneg/Basic.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Ring/Invertible.lean,Mathlib/GroupTheory/MonoidLocalization/Archimedean.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/Lemmas.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Localization/Additive.lean,Mathlib/RingTheory/Localization/Away/Basic.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/Localization/StrongRankCondition.lean,Mathlib/RingTheory/Smooth/StandardSmooth.lean,Mathlib/RingTheory/Trace/Quotient.lean | 23 | 6 | ['alreadydone', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | nobody | 8 months ago | 250 days ago | 1 day |
| 24719 | madvorak | feat(LinearAlgebra/Matrix/NonsingularInverse): inverting `Matrix` inverts its `LinearEquiv` | --- Discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2324719.20cannot.20find.20home/with/517142655 | awaiting-author t-algebra | 10/0 | Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean | 1 | 16 | ['eric-wieser', 'github-actions', 'madvorak', 'ocfnash'] | nobody | 8 months ago | 270 days ago | 85 days |
| 27437 | kckennylau | feat(RingTheory/Valuation): some lemmas about comparing with 1 and 0 and with each other | *From the 2025 Local Class Field Theory Workshop.* --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-ring-theory | 109/22 | Mathlib/NumberTheory/Padics/ValuativeRel.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/Extension.lean,Mathlib/RingTheory/Valuation/ValuativeRel.lean | 4 | 20 | ['erdOne', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'matthewjasper', 'pechersky'] | nobody | 8 months ago | 266 days ago | 14 days |
| 28148 | kckennylau | feat(Matrix): Simproc and Rw-proc for Matrix Transpose | Co-authored by Aaron Liu. ```lean example : !![1, 2, 3; 4, 5, 6]ᵀ = !![1, 4; 2, 5; 3, 6] := by rw [transpose_of% 2 3] example : !![1, 2, 3; 4, 5, 6]ᵀ = !![1, 4; 2, 5; 3, 6] := by rw [transpose_of] example : !![1, 2, 3; 4, 5, 6]ᵀ = !![1, 4; 2, 5; 3, 6] := by simp only [matrix_transpose] ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 267/8 | Mathlib.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/LinearAlgebra/UnitaryGroup.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/Matrix.lean,MathlibTest/Simproc/Matrix.lean,MathlibTest/matrix.lean,scripts/noshake.json | 8 | 32 | ['eric-wieser', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'plp127'] | eric-wieser | 8 months ago | 246 days ago | 13 days |
| 28686 | mitchell-horner | feat(Combinatorics/SimpleGraph): prove the Erdős-Stone theorem | Proves the Erdős-Stone theorem: If `G` has at least `(1 - 1 / r + o(1)) * card V ^ 2 / 2` many edges, then `G` contains a copy of a `completeEquipartiteGraph (r + 1) t`. --- - [ ] depends on: #28685 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR t-combinatorics | 757/14 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/ErdosStoneSimonovits.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Nat/Cast/Order/Field.lean | 10 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 254 days ago | 10 seconds |
| 28687 | mitchell-horner | feat(Combinatorics/SimpleGraph): prove the Erdős-Stone-Simonovits theorem | Proves the Erdős-Stone-Simonovits theorem: If the chromatic number of `H` equals `r + 1 > 0`, then the `extremalNumber` of `H` is greater than `(1 - 1 / r - o(1)) * card V ^ 2 / 2` and at most `(1 - 1 / r + o(1)) * card V ^ 2 / 2`. --- - [ ] depends on: #28686 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR t-combinatorics | 879/14 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/ErdosStoneSimonovits.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Nat/Cast/Order/Field.lean | 10 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 254 days ago | 1 minute |
| 28689 | mitchell-horner | feat(Combinatorics/SimpleGraph): prove well-known corollaries of the Erdős-Stone-Simonovits theorem | Proves well-known corollaries of the Erdős-Stone-Simonovits theorem: E.g., if the chromatic number of `H` equals `r + 1 > 1`, then `extremalNumber n H` is asymptotically equivalent to `(1 - 1 / r) * n.choose 2` as `n → ∞` --- - [ ] depends on: #28687 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR t-combinatorics | 958/14 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/ErdosStoneSimonovits.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Nat/Cast/Order/Field.lean | 10 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 254 days ago | 45 seconds |
| 26952 | robin-carlier | feat(CategoryTheory/DayConvolution): monoid objects internal to day convolutions | In this file, given `F : C ⊛⥤ V`, we provide a bijective correspondence between lax monoidal structures on `F.functor` and `Mon_Class F` structures. We also prove that through this correspondance, monoidal natural transformations correspond to morphisms of internal monoid objects. --- - [ ] depends on: #26890 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory | 1574/19 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Mon_.lean | 5 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 295 days ago | 5 minutes |
| 27133 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): `C ⊛⥤ V` is monoidal closed when `V` is | When `V` is a monoidal closed category admitting enough limits, we show that the type alias `C ⊛⥤ V` for functors `C ⥤ V` with Day convolution monoidal structure is monoidal closed using the API for `LawfulDayConvolutionClosedMonoidalCategoryStruct` developped in #27119. We expose the required data to exhibit (realization as a functor of) the internal hom as a suitable, and we port the lemmas that characterize its functoriality in that regard, as well as the evaluation and coevaluation morphisms. --- - [ ] depends on: #27119 - [ ] depends on: #26890 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory | 1706/20 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Closed.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean | 5 | 6 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 291 days ago | 19 minutes |
| 27151 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): `C ⊛⥤ V` is braided/symmetric when `C` and `V` are braided/symmetric | We use the machinery from #27150 to show that Day functors (the type alias for functors endowed with the Day convolution monoidal structure) are braided/symmetric when the base categories are. --- - [ ] depends on: #27150 - [ ] depends on: #26890 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory | 1591/20 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean | 5 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 290 days ago | 17 minutes |
| 27175 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): `LawfulDayConvolutionMonoidalCategoryStruct.ι C V D` is monoidal when the target is `C ⊛⥤ V` | We prove a "soundness" result for our notion of `LawfulDayConvolutionMonoidalCategoryStruct`, i.e that when be interpret its field `ι` as valued in Day functors (the type alias for functors endowed with the Day convolution monoidal structure), the data from `LawfulDayConvolutionMonoidalCategoryStruct` turn `ι` in a monoidal functor, proving that the categories endowed with such a structure are precisely those that can be identified to monoidal (not necessarily full) subcategories of Day functors. Implicitly, the structure isomorphisms for this monoidal structure bundle isomorphisms asserting unicity up to isomorphisms of day convolutions. --- - [ ] depends on: #26890 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory | 1585/24 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean | 4 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 290 days ago | 11 minutes |
| 26097 | adomani | dev: the relative linter | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-linter | 316/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/Local.lean,Mathlib/Util/ParseGit.lean | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 25741 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/SimplicialObject): definitions of simplicial objects by generators and relation | We leverage the equivalence between `SimplexCategory` and `SimplexCategoryGenRel` to give new constructors for (co)simplicial objects, as well as constructors for natural transformations (resp. isomorphism) between those. Final PR in the series of PR formalising the equivalence between `SimplexCategory` and `SimplexCategoryGenRel`. --- - [ ] depends on: #25740 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #21748.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/21748* | t-algebraic-topology blocked-by-other-PR t-category-theory large-import merge-conflict | 1363/9 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/Equivalence.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean,Mathlib/AlgebraicTopology/SimplicialObject/GeneratorsRelations.lean | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 323 days ago | 13 minutes |
| 26931 | javra | feat(CategoryTheory/Enriched): `V`-enriched isomorphisms | Defines isomorphisms in `V`-enriched categories and relate them to ordinary isomorphisms in the case of ordinary enriched categories. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory infinity-cosmos | 211/14 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/Basic.lean,Mathlib/CategoryTheory/Enriched/Iso.lean,Mathlib/CategoryTheory/Enriched/Opposite.lean,Mathlib/CategoryTheory/Enriched/Ordinary/Basic.lean,Mathlib/CategoryTheory/Enriched/Ordinary/Iso.lean | 6 | 21 | ['emilyriehl', 'github-actions', 'javra', 'joelriou', 'mathlib4-merge-conflict-bot', 'mckoen'] | nobody | 8 months ago | 276 days ago | 19 days |
| 27707 | FLDutchmann | feat(NumberTheory/SelbergSieve): define Selberg's weights and prove basic results. | This PR continues the work from #23635. Original PR: https://github.com/leanprover-community/mathlib4/pull/23635 - [ ] depends on: #27702 | merge-conflict t-number-theory blocked-by-other-PR t-analysis | 407/83 | Mathlib/NumberTheory/Divisors.lean,Mathlib/NumberTheory/SelbergSieve.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 271 days ago | 1 day |
| 25208 | erdOne | feat(LinearAlgebra): `tensor_induction` macro | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 87/116 | Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Central/TensorProduct.lean,Mathlib/LinearAlgebra/DirectSum/Finsupp.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/RingTheory/Flat/Equalizer.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/Finite.lean,Mathlib/RingTheory/Unramified/Finite.lean | 8 | 8 | ['chrisflav', 'eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 340 days ago | 10 minutes |
| 28803 | astrainfinita | refactor: unbundle algebra from `ENormed*` | Further speed up the search in the algebraic typeclass hierarchy by avoiding searching for `TopologicalSpace`. This PR continues the work from #23961. - Change `ESeminormed(Add)Monoid` and `ENormed(Add)Monoid` so they no longer carry algebraic data. - Deprecate `ESeminormed(Add)CommMonoid` and `ENormed(Add)CommMonoid` in favor of `ESeminormed(Add)Monoid` and `ENormed(Add)Monoid` with a commutative algebraic typeclass. |Old|New| |---|---| | `[ESeminormed(Add)(Comm)Monoid E]` | `[(Add)(Comm)Monoid E] [ESeminormed(Add)Monoid E]` | | `[ENormed(Add)(Comm)Monoid]` | `[(Add)(Comm)Monoid E] [ENormed(Add)Monoid]` | See [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2328803.20refactor.3A.20unbundle.20algebra.20from.20.60ENormed*.60/with/536024350) ------------ - [x] depends on: #28813 | t-algebra merge-conflict slow-typeclass-synthesis awaiting-zulip t-analysis | 80/63 | Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/NormedSpace/IndicatorFunction.lean,Mathlib/MeasureTheory/Function/L1Space/AEEqFun.lean,Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean | 14 | 28 | ['astrainfinita', 'bryangingechen', 'github-actions', 'grunweg', 'kbuzzard', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | grunweg | 7 months ago | 249 days ago | 5 hours |
| 26935 | Paul-Lez | feat(Analysis/SpecialFunction/NthRoot): definition and basic API of Real.nthRoot | This PR continues the work from #25364.
Original PR: https://github.com/leanprover-community/mathlib4/pull/25364
Co-authored-by: Eric Wieser |
t-analysis | 311/0 | Mathlib/Analysis/SpecialFunctions/NthRoot.lean | 1 | 10 | ['Paul-Lez', 'eric-wieser', 'github-actions', 'mo271', 'smmercuri', 'yury-harmonic'] | nobody | 7 months ago | 295 days ago | 20 hours |
| 27995 | kckennylau | feat(RingTheory/Valuation): alternate constructors for Valuation | --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-CI | 82/0 | Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/FieldTheory/RatFunc/Degree.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/RingTheory/Valuation/Basic.lean | 4 | 22 | ['YaelDillies', 'github-actions', 'grunweg', 'kckennylau', 'pechersky'] | nobody | 7 months ago | 239 days ago | 17 days |
| 26159 | upobir | feat(Algebra/QuadraticDiscriminant): Adding inequalities on quadratic from inequalities on discriminant | This PR continues the work from #24517. Original PR: https://github.com/leanprover-community/mathlib4/pull/24517 --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 34/0 | Mathlib/Algebra/QuadraticDiscriminant.lean | 1 | 8 | ['chrisflav', 'github-actions', 'tb65536', 'upobir'] | chrisflav | 7 months ago | 261 days ago | 55 days |
| 26908 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): alternative ext principle for unitors | Currently, our infrastructure for left/right unitors for Day convolution of functors `C ⥤ V` do not have satisfactory extensionality principle: the current way to characterize morphisms out of `U ⊛ F` is the default extensionality principle for Day convolution, which characterizes first such functors via functors out of `U ⊠ F`. Left unitors are then obtained using the fact `U ⊠ F` is a left Kan extension of a functor from `PUnit × C` (which is equivalent to `C`) but we did not record on its own this principle. Using the transitivity of left Kan extensions proved in #26899, we directly exhibit `U ⊛ F` as a left Kan extension of `F ⋙ tensorLeft (𝟙_ V)` along `tensorLeft (𝟙_ C)`. The unit of this Kan extension is composed exactly of the morphisms that appear in the [characterization of left unitors](https://leanprover-community.github.io/mathlib4_docs/Mathlib/CategoryTheory/Monoidal/DayConvolution.html#CategoryTheory.MonoidalCategory.DayConvolutionUnit.leftUnitor_hom_unit_app). We also slightly generalize the instances that express that external products with unitors are left Kan extensions, so that they can be used when taking external products with more complicated functors than currently. This is again useful when chaining extensionality lemmas for morphisms out of terms of the form `(F ⊛ U) ⊛ G`. We prove a similar thing for right unitors With this, it should be possible to have a much more satisfactory way of working with Day convolutions: this allows to "elimiinate" units without ending up with terms in an external product. --- - [ ] depends on: #26899 - [ ] depends on: #26906 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 307/18 | Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean | 2 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 235 days ago | 30 minutes |
| 27150 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): constructors for braided and symmetric structure on day convolutions monoidal categories | Following the pattern in #27119, we give API to construct `BraidedCategory` and `SymmetricCategory` structures on a monoidal category equipped with a `LawfulDayConvolutionMonoidalCategoryStruct`. To achieve this, we introduce an other type class `LawfulDayConvolutionBraidedCategoryStruct` that bundles an associator isomorphism that behaves like the one constructed for functors in #27067. We provide a noncomputable constructor for this typeclass that takes as input fullness of the "realization" functor to a category of functors, and we show that the typeclasses are sufficient to define the desired structures. --- - [x] depends on: #27067 - [x] depends on: #26820 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 826/9 | Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean | 2 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 290 days ago | 16 minutes |
| 26462 | PSchwahn | feat(LinearAlgebra/Projection): add results about inverse of `Submodule.prodEquivOfIsCompl` | Add two theorems `Submodule.prodEquivOfIsCompl_symm_apply` and `Submodule.prodEquivOfIsCompl_symm_add`, which are API for `Submodule.prodEquivOfIsCompl`. We believe these theorems are useful; for example, we have used their statements in a [classification formalization project](https://github.com/LieLean/LowDimSolvClassification). Co-authored by: - [Viviana del Barco](https://github.com/vdelbarc) - [Gustavo Infanti](https://github.com/GuQOliveira) - [Exequiel Rivas](https://github.com/erivas) --- I am not sure whether the `prodEquivOfIsCompl_symm_apply` theorem should be tagged with `@[simp]`; this might lead to confluence issues. Opinions are welcome! [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 10/0 | Mathlib/LinearAlgebra/Projection.lean | 1 | 7 | ['PSchwahn', 'github-actions', 'joelriou', 'kckennylau'] | joelriou | 7 months ago | 235 days ago | 73 days |
| 27119 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): constructors for closed monoidal day convolution monoidal structures | Following the pattern introduced in #26798 and #26820 and using results of #26879, we introduce a typeclass `LawfulDayConvolutionClosedMonoidalCategoryStruct` that encodes the data needed on a `LawfulDayConvolutionMonoidalCategoryStruct` to define well-behaved internal homs. We give a constructor assuming existence of relevant ends, and prove that this data defines a `MonoidalClosed` instance on the monoidal category structures one can deduce from `LawfulDayConvolutionMonoidalCategoryStruct`. --- - [x] depends on: #27079 - [x] depends on: #27091 - [x] depends on: #26879 - [x] depends on: #26820 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 900/9 | Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Closed.lean | 2 | 6 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 291 days ago | 1 second |
| 28623 | gilesgshaw | feat(Logic/Basic): minor additions and simplification of proofs | Add new theorems and simplify proofs. Specifically, we add the family of related theorems `apply_dite_iff_exists`, `apply_dite_iff_forall`, `apply_ite_iff_and` and `apply_ite_iff_or`. For each other 'family' of theorems in the file that is analogous to the above, we do the following - Simplify proofs where possible, e.g. by appealing to the new theorems - Complete the family, if any of the corresponding four are missing - Rename to ensure consistency with the above pattern --- | merge-conflict t-logic new-contributor | 83/55 | Archive/Examples/IfNormalization/Result.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Notation/Indicator.lean,Mathlib/LinearAlgebra/Matrix/Rank.lean,Mathlib/Logic/Basic.lean,Mathlib/MeasureTheory/Measure/WithDensity.lean,Mathlib/SetTheory/Ordinal/Notation.lean | 9 | 12 | ['eric-wieser', 'gilesgshaw', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | awainverse | 7 months ago | 234 days ago | 10 days |
| 28804 | grunweg | feat: a few more tactic linters | All analysis passes in this list have been suggested [on zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Tactic.20analysis.20framework/with/535766713). --- Untested, so may not work yet. - [ ] depends on: #28802 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-meta | 204/26 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,Mathlib/Tactic/TacticAnalysis/FunProp.lean,Mathlib/Tactic/TacticAnalysis/Misc.lean,MathlibTest/TacticAnalysis2.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 251 days ago | 10 minutes |
| 13036 | joelriou | feat(CategoryTheory/Sites): under certain conditions, cover preserving functors preserve 1-hypercovers | Previously, in order to show that a functor between Grothendieck sites was continuous, it was necessary to show that it was "cover preserving" and "compatible preserving". There were two lemmas which could be used in order to show that a functor was "compatible preserving". Since #13012, the better condition of "1-hypercover preserving" functor was introduced and it implies that the functor is continuous. In this PR, under the same assumptions as in the two lemmas mentionned above, we show that cover preserving functors are 1-hypercover preserving functors. This gives slightly better criteria in order to show that a functor is continuous. --- - [x] depends on: #13004 - [x] depends on: #13011 - [x] depends on: #13012 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 94/7 | Mathlib/CategoryTheory/Sites/Continuous.lean,Mathlib/CategoryTheory/Sites/CoverPreserving.lean,Mathlib/CategoryTheory/Sites/Over.lean,Mathlib/CategoryTheory/Sites/Sieves.lean | 4 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 712 days ago | 1 second |
| 29527 | kim-em | feat: script for checking Github URLs | This adds scripts/check_github_urls.py, which checks for links for closed github issues/prs, and shows the context at the link. Of course, many links are to closed pull requests because the discussion there provides useful context. Not sure how to best filter results. | WIP CI | 475/0 | scripts/README.md,scripts/check_github_urls.py | 2 | 2 | ['github-actions', 'kim-em'] | nobody | 7 months ago | 232 days ago | 1 second |
| 27335 | eric-wieser | chore(Data/List): use simp-normal-form for boolean equalities | This replaces `¬(p x = true)` with `p x = false`. It also makes explicit some adjacent `h : p x` spellings for symmetry, but the `= true`s were already implied by the coercion. Zulip: [#lean4 > `h : ¬(b = true)` vs `h : b = false` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.60h.20.3A.20.C2.AC.28b.20.3D.20true.29.60.20vs.20.60h.20.3A.20b.20.3D.20false.60/near/529976237) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 38/32 | Mathlib/Data/List/DropRight.lean,Mathlib/Data/List/SplitOn.lean,Mathlib/Data/List/TakeWhile.lean | 3 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 236 days ago | 6 hours |
| 25778 | thefundamentaltheor3m | feat: Monotonicity of `setIntegral` for nonnegative functions | This PR makes it easier to prove monotonicity of the Bochner integral on sets for nonnegative functions by removing the stronger assumption required by the general monotonicity lemma that both of the functions being compared must be integrable. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-measure-probability new-contributor | 8/0 | Mathlib/MeasureTheory/Integral/Bochner/Set.lean | 1 | 6 | ['RemyDegenne', 'github-actions', 'sgouezel', 'thefundamentaltheor3m'] | nobody | 7 months ago | 323 days ago | 3 hours |
| 29484 | eric-wieser | refactor: switch to [] notation for Stream' | I'll continue fixing this only if people agree this is a good use of this notation. [#mathlib4 > Changing `Stream.Seq` to use `GetElem` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Changing.20.60Stream.2ESeq.60.20to.20use.20.60GetElem.60/near/538548680) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data large-import | 195/173 | Mathlib/Algebra/ContinuedFractions/Basic.lean,Mathlib/Algebra/ContinuedFractions/Computation/Basic.lean,Mathlib/Algebra/ContinuedFractions/Translations.lean,Mathlib/Combinatorics/Hindman.lean,Mathlib/Control/Fix.lean,Mathlib/Control/LawfulFix.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/Seq/Defs.lean,Mathlib/Data/Stream/Defs.lean,Mathlib/Data/Stream/Init.lean,Mathlib/Data/WSeq/Basic.lean,Mathlib/Data/WSeq/Productive.lean | 12 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | unknown | 0 seconds |
| 22517 | j-loreaux | feat: `ℕ+` powers in semigroups | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP large-import | 275/28 | Mathlib.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/PNatPowAssoc.lean,Mathlib/Algebra/Group/PPow.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/ULift.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/ZMod/Defs.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/Tactic/ToAdditive/Frontend.lean | 14 | 6 | ['eric-wieser', 'github-actions', 'j-loreaux', 'leanprover-bot', 'mattrobball'] | nobody | 7 months ago | 423 days ago | 27 seconds |
| 27933 | grunweg | chore(OrdNode): format code example in code blocks | Wrap them in code blocks (and unindent them; that indentation is not needed any more). This also avoids warnings from the linter in #27898. ------- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 459/212 | Mathlib/Data/Ordmap/Ordnode.lean | 1 | 4 | ['eric-wieser', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 230 days ago | 39 days |
| 25069 | erdOne | feat(EllipticCurve): rational points of singular nodal cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 251/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Node.lean | 3 | 14 | ['Multramate', 'acmepjz', 'chrisflav', 'erdOne', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | chrisflav | 7 months ago | 245 days ago | 100 days |
| 25070 | erdOne | feat(EllipticCurve): rational points on singular cuspidal cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 123/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Cusp.lean | 2 | 12 | ['Multramate', 'acmepjz', 'adamtopaz', 'erdOne', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | adamtopaz | 7 months ago | 255 days ago | 90 days |
| 26670 | yu-yama | feat(GroupExtension/Abelian): define `conjClassesEquivH1` | This PR continues the work from #21837. Original PR: https://github.com/leanprover-community/mathlib4/pull/21837 | merge-conflict awaiting-author t-algebra | 162/5 | Mathlib.lean,Mathlib/GroupTheory/GroupExtension/Abelian.lean,Mathlib/GroupTheory/GroupExtension/Basic.lean,Mathlib/GroupTheory/GroupExtension/Defs.lean,docs/references.bib | 5 | 3 | ['erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'yu-yama'] | erdOne | 7 months ago | 252 days ago | 49 days |
| 26154 | ADedecker | refactor: add refactored APIs for algebraic filter bases | This PR continues the work from #18437. Original PR: https://github.com/leanprover-community/mathlib4/pull/18437 | merge-conflict t-topology | 651/0 | Mathlib.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 5 | 3 | ['ADedecker', 'github-actions', 'mathlib4-merge-conflict-bot'] | PatrickMassot | 7 months ago | 228 days ago | 87 days |
| 27024 | grunweg | feat: Gram-Schmidt orthonormalisation for sections of a vector bundle | Add a parametrised version of Gram-Schmidt, for sections of a topological vector bundle with a bundle metric.
This will be used to define orthonormal local frames.
From the path towards geodesics and the Levi-Civita connection.
Co-authored-by: Patrick Massot |
merge-conflict awaiting-author t-differential-geometry | 279/11 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Topology/VectorBundle/GramSchmidtOrtho.lean,scripts/noshake.json | 4 | 71 | ['faenuccio', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 7 months ago | 260 days ago | 28 days |
| 28580 | kmill | refactor: simplify implementation of `filter_upwards` | This PR makes a few changes to `filter_upwards`: - it uses `focus`, which prevents multiGoalLinter from ever blaming the tactics used inside its implementation - it constructs the whole proof syntax and elaborates it at once using `evalTactic` and `refine`, rather than using the lower-level TermElab API, which can lose track of goals - it's written in a way that doesn't require goals to be in some particular order This was motivated by some multiGoalLinter issues I ran into when working on https://github.com/leanprover/lean4/pull/9942 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order t-meta | 14/16 | Mathlib/Order/Filter/Defs.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 256 days ago | 25 minutes |
| 29010 | grunweg | chore: more tests for field_simp features and edge cases | --- [](https://gitpod.io/from-referrer/) | 135/0 | MathlibTest/FieldSimp.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 226 days ago | 19 hours | |
| 27937 | madvorak | feat(Logic/Basic): `congr_heq₂` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-logic | 6/0 | Mathlib/Logic/Basic.lean | 1 | 8 | ['YaelDillies', 'fpvandoorn', 'github-actions', 'madvorak', 'vihdzp'] | fpvandoorn | 7 months ago | 252 days ago | 17 days |
| 29741 | JovanGerb | trying #28803 using lean#10178 | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 1111/718 | .github/actionlint.yml,.github/workflows/nightly-docgen.yml,.github/workflows/nightly_detect_failure.yml,.github/workflows/report-grind-regressions.yml,Cache/Requests.lean,Mathlib.lean,Mathlib/Algebra/Field/Rat.lean,Mathlib/Algebra/Homology/ExactSequence.lean,Mathlib/Algebra/Order/Ring/Rat.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/Algebra/Polynomial/Eval/Defs.lean,Mathlib/Algebra/Polynomial/Eval/SMul.lean,Mathlib/Algebra/Ring/Rat.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Log/Summable.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/Computability/TMToPartrec.lean,Mathlib/Data/DFinsupp/Notation.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Int/Bitwise.lean,Mathlib/Data/Int/GCD.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/Nat/GCD/Basic.lean,Mathlib/Data/Nat/GCD/BigOperators.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Nat/Prime/Defs.lean,Mathlib/Data/Rat/Cast/Defs.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Data/Rat/Lemmas.lean,Mathlib/Data/Seq/Basic.lean,Mathlib/Data/UInt.lean,Mathlib/Dynamics/PeriodicPts/Defs.lean,Mathlib/GroupTheory/Perm/Centralizer.lean,Mathlib/Init.lean,Mathlib/Lean/Expr/Rat.lean,Mathlib/Lean/Meta/CongrTheorems.lean,Mathlib/LinearAlgebra/PID.lean,Mathlib/LinearAlgebra/Quotient/Basic.lean,Mathlib/LinearAlgebra/Vandermonde.lean,Mathlib/Logic/Equiv/Prod.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/NumberTheory/Padics/PadicVal/Basic.lean,Mathlib/Order/Defs/LinearOrder.lean,Mathlib/Order/Defs/PartialOrder.lean,Mathlib/Order/Disjoint.lean,Mathlib/Order/Filter/Defs.lean,Mathlib/Probability/Distributions/Pareto.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Reassoc.lean,Mathlib/Tactic/CategoryTheory/Refs.lean,Mathlib/Tactic/DeriveFintype.lean,Mathlib/Tactic/FieldSimp.lean,Mathlib/Tactic/Hint.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/Datatypes.lean,Mathlib/Tactic/Linter/DeprecatedModule.lean,Mathlib/Tactic/Linter/Header.lean,Mathlib/Tactic/Linter/Lint.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/NormNum/GCD.lean,Mathlib/Tactic/StacksAttribute.lean,Mathlib/Tactic/SuppressCompilation.lean,Mathlib/Tactic/ToAdditive/Frontend.lean,Mathlib/Tactic/WLOG.lean,Mathlib/Testing/Plausible/Sampleable.lean,Mathlib/Util/Notation3.lean,Mathlib/Util/ParseCommand.lean,Mathlib/Util/Superscript.lean,MathlibTest/AssertExists.lean,MathlibTest/CalcQuestionMark.lean,MathlibTest/Change.lean,MathlibTest/DeprecateTo.lean,MathlibTest/FieldSimp.lean,MathlibTest/FindSyntax.lean,MathlibTest/LibrarySearch/basic.lean,MathlibTest/LibrarySearch/mathlib.lean,MathlibTest/LibrarySearch/observe.lean,MathlibTest/MinImports.lean,MathlibTest/RewriteSearch/Basic.lean,MathlibTest/RewriteSearch/Polynomial.lean,MathlibTest/StacksAttribute.lean,MathlibTest/Subsingleton.lean,MathlibTest/Use.lean,MathlibTest/Variable.lean,MathlibTest/hint.lean,MathlibTest/lift.lean,MathlibTest/linarith.lean,MathlibTest/notation3.lean,MathlibTest/propose.lean,MathlibTest/renameBvar.lean,MathlibTest/rewrites.lean,MathlibTest/ring.lean,MathlibTest/says.lean,MathlibTest/success_if_fail_with_msg.lean | 105 | 2 | ['JovanGerb', 'leanprover-bot'] | nobody | 7 months ago | 226 days ago | 15 seconds |
| 7125 | eric-wieser | feat: additive monoid structure via biproducts | I suspect I'm missing a trick with these transport lemmas. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory awaiting-CI | 237/0 | Mathlib/CategoryTheory/Limits/Skeleton.lean | 1 | 3 | ['alreadydone', 'eric-wieser', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | unknown | 0 seconds |
| 27950 | alreadydone | feat(MonoidAlgebra): criteria for `single` to be a unit, irreducible or prime | --- - [ ] depends on: #27936 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 714/192 | Mathlib.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/Divisibility/Basic.lean,Mathlib/Algebra/Divisibility/Finite.lean,Mathlib/Algebra/Divisibility/Hom.lean,Mathlib/Algebra/Divisibility/Prod.lean,Mathlib/Algebra/Divisibility/Units.lean,Mathlib/Algebra/Group/Action/Pointwise/Finset.lean,Mathlib/Algebra/Group/Irreducible/Lemmas.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Associated.lean,Mathlib/Algebra/MonoidAlgebra/Divisibility.lean,Mathlib/Algebra/MonoidAlgebra/NoZeroDivisors.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Algebra/Prime/Defs.lean,Mathlib/Algebra/Prime/Lemmas.lean,Mathlib/Algebra/Prime/Prod.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Dynamics/PeriodicPts/Defs.lean,Mathlib/GroupTheory/Coset/Card.lean,Mathlib/GroupTheory/Exponent.lean,Mathlib/GroupTheory/GroupAction/Blocks.lean,Mathlib/GroupTheory/GroupAction/Period.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/GroupTheory/Schreier.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/Tactic/ToAdditive/Frontend.lean | 33 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 269 days ago | 53 seconds |
| 28067 | grunweg | Docstring enumerations | Tracking PR; to be split. Audit all ocurrences of `^ \S`; exhaustive. --- - [x] depends on: #28068 - [x] depends on: #28069 - [ ] depends on: #28070 - [x] depends on: #28118 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR | 264/263 | Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/BrauerGroup/Defs.lean,Mathlib/Algebra/Module/LinearMap/Polynomial.lean,Mathlib/CategoryTheory/Abelian/NonPreadditive.lean,Mathlib/CategoryTheory/EqToHom.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/Pi.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Sites/Grothendieck.lean,Mathlib/CategoryTheory/Sites/Pretopology.lean,Mathlib/Condensed/Discrete/Characterization.lean,Mathlib/FieldTheory/ChevalleyWarning.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Basic.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/OuterMeasure/Basic.lean,Mathlib/MeasureTheory/OuterMeasure/Defs.lean,Mathlib/NumberTheory/FLT/Basic.lean,Mathlib/NumberTheory/LSeries/PrimesInAP.lean,Mathlib/RingTheory/Grassmannian.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean,Mathlib/RingTheory/WittVector/Teichmuller.lean,Mathlib/Tactic/Bound.lean,Mathlib/Tactic/Bound/Attribute.lean,Mathlib/Tactic/ENatToNat.lean,Mathlib/Tactic/FBinop.lean,Mathlib/Tactic/IntervalCases.lean,Mathlib/Tactic/TermCongr.lean,Mathlib/Util/Notation3.lean,Mathlib/Util/Superscript.lean,docs/Conv/Guide.lean | 38 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 267 days ago | 41 minutes |
| 28908 | joelriou | feat(CategoryTheory): Pullback functors on `Over` categories in `Type` have right adjoints | Given a map `f : E → B`, in order to show that `Over.pullback f : Over B ⥤ Over E` commutes with colimits, we show that it admits a right adjoint. In order to do that, we first construct a functor `overPullback f : Over B ⥤ Over E` whose definition involves explicit types rather than categorical pullbacks, and we define its right adjoint `overPushforward f : Over E ⥤ Over B`. (In a future PR, it will be shown that the `Over.pullback` also commutes with colimits in categories of presheaves, and hopefully this will be used in the construction of the Quillen model category structure on simplicial sets.) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 103/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Types/OverPullback.lean,Mathlib/CategoryTheory/Limits/Types/Shapes.lean | 3 | 10 | ['emilyriehl', 'github-actions', 'joelriou', 'mathlib4-merge-conflict-bot', 'robin-carlier', 'sinhp'] | nobody | 7 months ago | 235 days ago | 13 days |
| 29330 | plp127 | chore: define `Fin.cycleIcc` with conditions | Redefine `Fin.cycleIcc` using conditionals instead of composing existing `Fin` operations together. Its worst-case runtime drops from O(n) to O(1). As a bonus, the definition no longer needs explaining. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-group-theory | 61/68 | Mathlib/GroupTheory/Perm/Fin.lean | 1 | 10 | ['JovanGerb', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'tb65536'] | nobody | 7 months ago | 219 days ago | 19 days |
| 29588 | Periecle | feat(Analysis/Complex/Residue): Implement residue theory for complex functions at isolated singularities | # Add basic residue theory for complex functions This PR introduces the residue theory implementation in mathlib. ## Main additions - **`HasIsolatedSingularityAt f c`**: Predicate for functions with isolated singularities at point `c` - **`residue f c hf`**: The residue of `f` at isolated singularity `c`, defined via circle integrals - **Radius independence**: `residue_eq_two_pi_I_inv_smul_circleIntegral` - residue equals normalized circle integral for any valid radius - **Holomorphic residues**: `residue_of_holomorphic` - functions holomorphic in a neighborhood have zero residue - **Simple pole formula**: `residue_simple_pole` - for `f(z) = (z-c)⁻¹ * g(z)`, residue equals `g(c)` ## Implementation notes - Builds on existing circle integral infrastructure in `CauchyIntegral.lean` - Uses `Classical.choose` to extract witness radius from isolated singularity condition - Comprehensive documentation with mathematical context and examples - Establishes foundation for residue theorem, argument principle, and other applications ## Examples included - `residue(1/z, 0) = 1` (canonical simple pole) - Radius independence demonstration - Zero residues for holomorphic functions This provides the essential building blocks for complex analysis and first step to formalize residue theory. | awaiting-author t-analysis new-contributor | 383/0 | Mathlib/Analysis/Complex/Residue/Basic.lean | 1 | 17 | ['Periecle', 'github-actions', 'hrmacbeth', 'llllvvuu', 'loefflerd'] | nobody | 7 months ago | 231 days ago | 24 minutes |
| 29482 | mattrobball | refactor (Algebra.Group.Defs): add npow/zpow/nsmul/zsmul as fields of new parents classes | Adds ZPow G class and makes this a parent to DivInvMonoid and the corresponding additive versions. Updates zpow/zsmul operations to use the integrated power/scalar multiplication syntax. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 177/122 | Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/Algebra/Ring/ULift.lean,Mathlib/Data/BitVec.lean,Mathlib/Tactic/Abel.lean,Mathlib/Tactic/NormNum/Pow.lean | 21 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 233 days ago | 2 minutes |
| 29657 | jcreinhold | feat(CategoryTheory/MarkovCategory): add Markov categories | This PR adds Markov categories to the category theory library. A Markov category is a symmetric monoidal category where every object has canonical copy and delete morphisms that form commutative comonoids. ## What this gives mathlib In a Markov category, morphisms model probabilistic processes. The copy morphism `X → X ⊗ X` creates perfect correlation (both outputs always equal). The delete morphism `X → I` marginalizes (sums/integrates out variables). This structure captures probability theory categorically. The same theorem proves results for: - Finite probability (stochastic matrices) - Measure theory (Markov kernels) - Kleisli categories of probability monads Fritz (2020) used this to prove categorical versions of Fisher-Neyman, Basu's theorem, and other core statistics results. ## Implementation - `MarkovCategory`: Extends `SymmetricCategory` with canonical comonoid structure - `copyMor X : X ⟶ X ⊗ X` and `delMor X : X ⟶ I` for each object - Coherence axioms: commutativity, counitality, coassociativity - Compatibility with tensor products Key design point: The comonoid structure is canonical (fields of the typeclass), not chosen. This matches the probability interpretation where there's exactly one way to copy/marginalize. ## Examples included 1. Cartesian categories: Every cartesian monoidal category forms a Markov category where copy is the diagonal `x ↦ (x,x)` and delete is the terminal morphism. All morphisms are deterministic. 2. FinStoch: Objects are finite types. Morphisms are stochastic matrices (rows sum to 1). This models finite probability spaces with the usual matrix multiplication for composition. ## Scope and review notes This PR provides the basic structure only. Future PRs would add: - Conditional independence - Sufficient statistics - Connection to measure-theoretic probability - More examples (Kleisli categories, Gaussian categories) I'm neither an expert in this material nor in Lean; I've only read a few papers on Markov categories and have gone through tutorial material in Lean. Please review for mathematical correctness and idiomatic Lean. I kept this PR small to check if mathlib wants this addition and to ensure it meets repository standards. ## Why add this now Markov categories provide a useful abstraction level for probability in type theory. Adding it to mathlib enables future work on categorical probability and statistics. In particular, I'm working on a probabilistic programming library and would like to write some proofs using these constructs. ## References - Fritz, T. (2020). [A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics](https://arxiv.org/abs/1908.07021). *Advances in Mathematics*, 370, 107239. - Cho, K., & Jacobs, B. (2019). [Disintegration and Bayesian inversion via string diagrams](https://arxiv.org/abs/1709.00322). *Mathematical Structures in Computer Science*, 29(7), 938-971. --- All definitions include docstrings. The PR has tests for the core functionality. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 2414/7 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Monad/Basic.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Basic.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Deterministic.lean,Mathlib/CategoryTheory/MarkovCategory/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/Cartesian.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Braided.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/CopyDiscard.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Markov.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Bimon_.lean,Mathlib/CategoryTheory/Monoidal/CommComon_.lean,Mathlib/CategoryTheory/Monoidal/Comon_.lean,MathlibTest/CategoryTheory/MarkovCategory.lean,docs/references.bib | 16 | 28 | ['github-actions', 'jcreinhold', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 223 days ago | 2 hours |
| 27829 | dupuisf | feat: modify `cfc_tac` to use `grind` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 60/50 | Mathlib/Algebra/Order/Star/Basic.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Integral.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/PosPart/Basic.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean,Mathlib/Tactic/ContinuousFunctionalCalculus.lean | 9 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 273 days ago | 1 second |
| 21950 | erdOne | feat(NumberTheory/Padics): the completion of `ℚ` at a finite place is `ℚ_[p]` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-number-theory | 253/1 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroMulInt.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 7 | 33 | ['Ruben-VandeVelde', 'erdOne', 'faenuccio', 'github-actions', 'leanprover-community-bot-assistant', 'pechersky', 'smmercuri', 'xroblot'] | nobody | 7 months ago | 298 days ago | 73 days |
| 26178 | ppls-nd-prs | feat(CategoryTheory/Limits): Fubini for products | We show that the product of products is a product indexed by the sigma type. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 17/0 | Mathlib/CategoryTheory/Limits/Shapes/Products.lean | 1 | 6 | ['chrisflav', 'github-actions', 'leanprover-community-bot-assistant', 'ppls-nd-prs', 'robin-carlier'] | nobody | 7 months ago | 315 days ago | 13 hours |
| 27214 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): Categorical pullback squares | In this PR, we give the definition and first basic properties of categorical pullback squares. Using our previous work on `CategoricalPullback`, we define a typeclass `CatPullbackSquare T L R B` that asserts that a given `CatCommSq T L R B` is a "pullback square": this is the data of a chosen adjoint equivalence to the canonical functor from the top left corner of the square to the categorical pulback of its leg. Using this equivalence, be derive a universal property for functors from `X`with values in the top left corner of the square: they are equivalent to `CatCommSqOver R B X`, the category of categorical commutative squares over the cospan `R, B` with top left corner `X`. We prove some coherence result for this equivalence, most notably an isomorphism that, given `S : CatCommSqOver R B X`, bundles the two commutative triangles formed by the induced functor, and the coherence between the squares that these isomorphisms satisfy: this is conveniently bundled in the data of a single isomorphisms of `CatCommSqOver R B X`. Finally, we provide a `Prop`-class `IsCatPullbackSquare` that merely asserts the existence (via `Nonempty`) of the relevant data: we show that it is tautotogically equivalent to the propopsition that the canonical functor to the categorical pullback is an equivalence. --- - [ ] depends on: #26679 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 786/1 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 214 days ago | 1 hour |
| 27391 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): pseudofunctoriality structure of categorical pullback squares | Using pseudofunctoriality of the construction `CatCommSqOver`, we show that categorical pullback squares have pseudofunctorial-like structures: given a `CatCommSq T L R B` and a `CatPullbackSq T' L' R' B'`, and a `CatCospanTransform R B R' B'`, there is a functor `CatPullbackSq.functorOfTransform` between the top left corners of the two squares. We give `CatCommSq` instances that relates this functor with other constructions such as `CatCommSqOver.transform`. Similarly, we construct `CatPullbackSq.functorOfTransform₂`, that maps morphisms of `CatCospanTransforms` to natural transformations. Finally, we show that `functorOfTransform` respects identities and compositions. We do not yet prove that all of this data satisfies all the expected properties of pseudofunctors: this will be the content of a follow-up PR. --- - [ ] depends on: #27214 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory | 1090/1 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 282 days ago | 4 minutes |
| 27432 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): pseudofunctoriality of categorical pulback squares | In this PR, we show that the "unbundled pseudofunctor" data constructed in #27391 satisfy the axioms of an actual "unbundled pseudo-functor". This is intended to give all the required coherence for a formal bicategory-like proof of the fact that `CatCospanAdjunction`s from #26578 (resp. `CatCospanEquivalence`s from #26579) promote to adjunctions (resp. equivalences) between the top left corners of categorical pullback squares. --- - [ ] depends on: #27391 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory | 1244/1 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 281 days ago | 17 minutes |
| 27481 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): adjunctions and equivalences of categorical pullback squares | We show that a `CatCospanAdjunction` (resp `CatCospanEquivalence`) induces adjunctions (resp. equivalences) of the categories that sit at the top left corners of categorical pullback squares via the pseudofunctoriality proved in #27432. Thanks to the lemmas that proves that categorical pullback squares are fully pseudofunctorial, the proof is purely formal ("a pseudofunctor maps adjunctions (resp. equivalences) to adjunctions (resp. equivalences)"), rather than being a painful computation for the triangle equalities. In particular, the results here show that two categorical pullback squares with equivalent "underlying categorical cospan" are equivalent, which realizes the equivalence-invariance of the notion of categorical pullbacks. We do not yet show that a (not-necessarily pullback) `CatCommSq T L R B` equivalent to a `CatPullbackSquare T' L' R' B'` via a `CatCospanEquivalence R B R' B'` is also a `CatPullbackSquare`: this will be the content of a follow-up PR. --- - [ ] depends on: #27432 - [ ] depends on: #26579 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 1829/1 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 280 days ago | 49 seconds |
| 27686 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical/Square): more API for `CatPullbackSquare` | In this PR, we provide more API around the notion of categorical pullback squares. Having established the pseudofunctoriality of the notion in #27432, we characterize the behaviour of the equivalence `CatPullbackSquare.functorEquiv (π₁ R B) (π₂ R B) R B X : X ⥤ R ⊡ B ≌ CatCommSqOver R B X` via various (d)simp lemmas. This ports all the pseudofunctoriality and equivalence-invariance results of `CatPullbackSquare` to `CategoricalPullback`. We also show this equivalence is isomorphic to the one from `CategoricalPullback.functorEquiv`. Unfortunately, this small duplication is necessary, as `CatPullbackSquare.functorEquiv` is bulit using `CategoricalPullback.functorEquiv`. The equivalence `CategoricalPullback.functorEquiv` is now an implementation detail, the idiomatic way is to use `CatPullbackSquare.functorEquiv`; docstrings are updated accordingly. This deprecates some constructions and lemmas for `CategoricalPullback`: they are now special case of the API that is available for any categorical pullback square. --- - [ ] depends on: #27481 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 2245/74 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 4 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 275 days ago | 45 minutes |
| 27687 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): squares equivalent to a `CatPullbackSquare` | We provide the last remaining piece of the "equivalence-invariance" of categorical pullback squares: given a `CatCommSq (T : C₁ ⥤ _) L R B`, a `CatPullbackSquare (T' : D₁ ⥤ _) L' R' B'`, a `ψ : CatCospanEquivalence R B R' B'` and an equivalence `C₁ ≌ D₁` that identifies to the functor induced by `ψ`, the `CatCommSq T L R B` can be promoted to a `CatPullbackSquare T L R B'`. In other words: a `CatCommSq` that is equivalent to a `CatPullbackSquare` is a `CatPullbackSquare`. --- - [ ] depends on: #27686 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 2318/74 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 4 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 275 days ago | 15 minutes |
| 27688 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): coherence statement for `CatPullbackSquare.inverse` | This PR records a "coherence" statement for `CatPullbackSquares`: it bridges the gap between the user-provided `inverse` field of the `CatPullbackSquare` structure, and the other way one can deduce an equivalence between the top left corner of the square and a categorical pullback (via the pseudofunctoriality of categorical pullback squares induced by the identity `CatCospanTransform`). We show the two possible natural isomorphisms on the inverses of the equivalences are in fact the same (hence the term "coherence"). --- - [ ] depends on: #27686 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 2351/74 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 4 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 275 days ago | 4 minutes |
| 27689 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): horizontal pasting calculus for `CatPullbackSquare` | Given two categorical commutative squares that can be horizontally pasted, we prove that if the rightmost square is a `CatPullbackSquare`, then the leftmost square is a `CatPullbackSquare` if and only if the horizontal composition of the squares is a `CatPullbackSquare`. This generalizes to `CatPullbackSquare` the well-known "pasting calculus" for pullback squares in a category. The statement is made available both in terms of the `Type`-class `CatPullbackSquare`, and in terms of the `Prop`-class `IsCatPullbackSquare`. --- - [ ] depends on: #27686 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 2562/74 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Pasting.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 5 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 275 days ago | 11 minutes |
| 27690 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): vertical pasting calculus for `CatPullbackSquare` | We mirror the constructions from #27689 to construct the vertical pasting calculus of `CatPullbackSquares`: given two vertically composable `CatCommSq` such that the bottom one is a `CatPullbackSquare`, the top square is a `CatPullbackSquare` if and only if the vertical composition (the "outer" square) is a `CatPullbackSquare`. --- - [ ] depends on: #27689 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 2841/74 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Pasting.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 5 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 274 days ago | 1 hour |
| 27740 | robin-carlier | feat(CategoryTheory/Limits/Shapes/Pullback/Categorical): pasting calculus for `CategoricalPullback` | Specialize the pasting calculus for categorical pullback squares to `CategoricalPullback̀` by providing equivalences of categories `R ⊡ (B₁ ⋙ B₂) ≌ (π₂ R B₂) ⊡ B₁` and `(R₁ ⋙ R₂) ⊡ B ≌ R₁ ⊡ (π₁ R₂ B)`. The `@[simps!]` attribute works wonderfully on these equivalences so that their component all have the expected (d)simp lemmas. --- - [ ] depends on: #27690 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 2872/75 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Pasting.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Square.lean | 5 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 274 days ago | 8 minutes |
| 26330 | Timeroot | feat: "Junk value" test file | This PR continues the work from #25173. Original PR: https://github.com/leanprover-community/mathlib4/pull/25173 | awaiting-author t-data | 360/0 | MathlibTest/Junk.lean | 1 | 17 | ['SnirBroshi', 'Timeroot', 'bryangingechen', 'github-actions', 'leanprover-community-bot-assistant', 'madvorak', 'pechersky', 'vihdzp'] | pechersky | 7 months ago | 213 days ago | 48 days |
| 26466 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/Augmented): the canonical monoid object in the augmented simplex category | Show that in the augmented simplex category, `⦋0⦌` is an internal monoid object. Future work will show that this is in fact the universal monoid object: for any monoidal category `C`, evaluation at `⦋0⦌` induces an equivalence of categories between `Mon_ C` and the category of monoidal functors from `AugmentedSimplexCategory` to `C`. The resulting augmented cosimplicial object one gets from this construction is sometimes called the "monoidal bar construction" attached to a monoid. This PR was split from #25743. --- - [ ] depends on: #25743 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-topology t-category-theory | 571/111 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Mon_.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Monoidal.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean | 6 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 308 days ago | 28 minutes |
| 28074 | grunweg | Isbilinearmap | TODO see if it builds, move everything to the right place, add docs. update Pr description - written by Patrick, part of #26221 (and prereq for #28056) --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 64/0 | Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/LinearAlgebra/BilinearMap.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 267 days ago | 2 seconds |
| 26579 | robin-carlier | feat(CategoryTheory/Limits/Pullbacks/Categorical/CatCospanTransform): equivalences of categorical cospans | Building on the notion of adjunctions of categorical cospans, we define equivalences of categorical cospans as a structure extending that of an adjunction, with the extra data of a chosen inverse of the unit and counit morphisms. To mirror the design for usual equivalences of categories, we provide an alternative constructor that requires the forward and inverse direction of the equivalence, as well as unit and counits already as isomorphisms, and only a proof of the left triangle identity. Finally, we also provide a third constructor that builds such an equivalence out of the data of 3 component equivalences of categories, as well as chosen `CatCommSq` on the functors of the these equivalences. This notion of equivalence of categorical cospans is intended to encode the required data to show the full equivalence invariance of the categorical pullback defined in #26366. --- - [ ] depends on: #26578 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 438/0 | Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean | 1 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 304 days ago | 13 minutes |
| 26578 | robin-carlier | feat(CategoryTheory/Limits/Pullbacks/Categorical/CatCospanTransform): adjunctions of categorical cospans | We build upon the bicategory-like structure developed in #26447 and #26412 to define the notion of adjunctions of categorical cospans. This is a structure encoding the data of two `CatCospanTransform`s, along with the usual unit and counit morphisms as part of the data, satisfying the usual left and right triangle identities. We provide basic API for these, such as extracting adjunctions between individual components. We also provide a proof that the notion satisfies a "coherence": with our chosen constructor, the forward direction of the structure `CatCommSq` on the left adjoints correspond to the inverse of the square for the right adjoints through `mateEquiv`. These adjunctions will be used as a substrate for defining equivalences of categorical cospans in a future PR: such an equivalence will be a structure extending a `CatCospanAdjunction` with isomorphisms data on the unit and co-unit (we will however provide alternative constructors in sync with the constructor for equivalences of categories). --- - [x] depends on: #26447 - [x] depends on: #26547 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory large-import | 205/0 | Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/CatCospanTransform.lean | 1 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 304 days ago | 10 minutes |
| 26115 | grunweg | WIP/proof of concept,feat: the inverse function theorem for manifolds | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry | 348/0 | Mathlib.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Geometry/Manifold/InverseFunctionTheorem.lean,Mathlib/Topology/PartialHomeomorph.lean | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 28245 | robin-carlier | feat(CategoryTheory/Bicategory/NaturalTransformation/Icon): strict associativity and unitality of icon composition | We show that the vertical composition of icons defined in #28244 satisfies strict associativity and strict unitality. This morally shows that icons are fit as the 2-cells of a bicategory structure on bicategories and lax functors, though we do not record an instance of this sort. --- - [ ] depends on: #28244 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR t-category-theory awaiting-CI large-import merge-conflict | 975/33 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/EqToHom.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Icon.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Lax.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Oplax.lean,Mathlib/CategoryTheory/Bicategory/Strict.lean,Mathlib/CategoryTheory/EqToHom.lean,scripts/noshake.json | 8 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 263 days ago | 8 minutes |
| 30079 | dagurtomas | feat(CategoryTheory): IsSheafFor as a multiequalizer condition | --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory | 112/0 | Mathlib/CategoryTheory/Sites/Multifork.lean | 1 | 3 | ['chrisflav', 'github-actions', 'joelriou'] | nobody | 6 months ago | 213 days ago | 1 second |
| 29012 | grunweg | chore: reduce `Topology` imports in `Data` | Move Data.Real.Sqrt to Analysis. --- - [ ] depends on: #28966 [](https://gitpod.io/from-referrer/) | merge-conflict file-removed | 25/21 | Archive/Imo/Imo1959Q2.lean,Archive/Imo/Imo1960Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Archive/Sensitivity.lean,Mathlib.lean,Mathlib/Algebra/Star/CHSH.lean,Mathlib/Analysis/Complex/Norm.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Normed/Module/Ball/Homeomorph.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/Real/Sqrt.lean,Mathlib/Data/Rat/NatSqrt/Real.lean,Mathlib/Data/Real/CompleteField.lean,Mathlib/Data/Real/Irrational.lean,Mathlib/Data/Real/StarOrdered.lean,Mathlib/NumberTheory/Zsqrtd/ToReal.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/NormNum/RealSqrt.lean,MathlibTest/positivity.lean | 20 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 212 days ago | 3 hours |
| 26601 | yuma-mizuno | feat(CategoryTheory): make `Functor.comp` irreducible | [#mathlib4 > Functor identity `𝟭 _ ⋙ F = F` is definitional equality](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Functor.20identity.20.60.F0.9D.9F.AD.20_.20.E2.8B.99.20F.20.3D.20F.60.20is.20definitional.20equality/with/523978659) --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 514/261 | Mathlib/AlgebraicTopology/DoldKan/Compatibility.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/CatCommSq.lean,Mathlib/CategoryTheory/Category/Cat.lean,Mathlib/CategoryTheory/Category/RelCat.lean,Mathlib/CategoryTheory/Category/ULift.lean,Mathlib/CategoryTheory/Core.lean,Mathlib/CategoryTheory/Discrete/Basic.lean,Mathlib/CategoryTheory/EqToHom.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/CategoryTheory/Functor/Const.lean,Mathlib/CategoryTheory/Functor/Currying.lean,Mathlib/CategoryTheory/Functor/CurryingThree.lean,Mathlib/CategoryTheory/Functor/FullyFaithful.lean,Mathlib/CategoryTheory/Functor/Functorial.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Basic.lean,Mathlib/CategoryTheory/Functor/TwoSquare.lean,Mathlib/CategoryTheory/Groupoid/FreeGroupoid.lean,Mathlib/CategoryTheory/Join/Basic.lean,Mathlib/CategoryTheory/Limits/Cones.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/ObjectProperty/FullSubcategory.lean,Mathlib/CategoryTheory/Opposites.lean,Mathlib/CategoryTheory/PathCategory/Basic.lean,Mathlib/CategoryTheory/Pi/Basic.lean,Mathlib/CategoryTheory/Products/Associator.lean,Mathlib/CategoryTheory/Products/Basic.lean,Mathlib/CategoryTheory/Quotient.lean,Mathlib/CategoryTheory/Sigma/Basic.lean,Mathlib/CategoryTheory/Whiskering.lean,Mathlib/CategoryTheory/Yoneda.lean | 34 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 23621 | astrainfinita | chore: deprecate `LinearOrderedComm{Monoid, Group}WithZero` | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #20676 | merge-conflict t-algebra t-order | 261/205 | Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/NNRat/Lemmas.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean,Mathlib/NumberTheory/FunctionField.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/RingTheory/Valuation/Archimedean.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/ExtendToLocalization.lean,Mathlib/RingTheory/Valuation/Integers.lean,Mathlib/RingTheory/Valuation/Integral.lean,Mathlib/RingTheory/Valuation/Minpoly.lean,Mathlib/RingTheory/Valuation/Quotient.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValExtension.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean,Mathlib/Topology/UnitInterval.lean,MathlibTest/instance_diamonds.lean,scripts/noshake.json | 44 | 24 | ['YaelDillies', 'astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | kbuzzard | 6 months ago | 379 days ago | 5 days |
| 28630 | Antidite | feat(Archive/Imo): right isosceles configuration in the complex plane | feat(Archive/Imo): right isosceles configuration in the complex plane This adds `Archive/Imo/Imo1975Q3.lean`, formalizing a triangle configuration with points A=0, B=1, C=z and auxiliary points R, P, Q built via complex rotations and sine-based scale factors. Main results: * `angle_and_distance`: ∠QRP = π/2 and dist Q R = dist R P. * Key identity `QRP_rot90`: (Q z).z − R.z = e^{iπ/2} · ((P z).z − R.z). Design/Style: * Minimal imports; module docstring; semantic lemma names; all definitions and theorems live under the namespace `IMO.TriangleConfig`. Moves: - (none) Deletions: - (none) --- [](https://gitpod.io/from-referrer/) | IMO awaiting-author new-contributor | 196/0 | Archive.lean,Archive/Imo/Imo1975Q3.lean | 2 | 36 | ['Antidite', 'LLaurance', 'github-actions', 'jsm28'] | jsm28 | 6 months ago | 208 days ago | 46 days |
| 30192 | erdOne | feat(RingTheory): valuative topology = adic topology for discrete rank 1 valuations | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-ring-theory t-topology | 190/2 | Mathlib.lean,Mathlib/Order/Filter/Bases/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Integers.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 6 | 3 | ['erdOne', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 209 days ago | 5 minutes |
| 26886 | pechersky | feat(NumberTheory/Padics/ValuativeRel): ValuativeRel ℚ_[p] | as well as instances for IsRankLeOne, IsNontrivial, IsDiscrete --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #26827 | WIP t-number-theory blocked-by-other-PR t-algebra merge-conflict t-analysis | 310/25 | Mathlib.lean,Mathlib/Analysis/Normed/ValuativeRel.lean,Mathlib/NumberTheory/Padics/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 4 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 6 months ago | 297 days ago | 6 minutes |
| 27314 | pechersky | feat(TopologyValued): `Valued` based on a range topology | Switch from a topology based on `fun γ : Γ₀ˣ => (v.ltAddSubgroup γ : AddSubgroup R)` to ``` fun rs : {rs : R × R // v rs.1 ≠ 0 ∧ v rs.2 ≠ 0} ↦ (v.ltAddSubgroup (Units.mk0 (v rs.val.2 / v rs.val.1) (by simp [rs.prop])) : AddSubgroup R) ``` This is in preparation for using `IsValuativeTopology` instead. In fact, that basis is precisely what `ValuativeTopology` asserts. `Valued.mk'` is kept, we do not yet rely on `IsValuativeTopology` and `UniformSpace`. The new `Valued` behaves the same way as it did before for `MulArchimedean` valuation codomains, which are all of the current in-mathlib uses of `Valued`. This is, for rank-one valuations. For valuations which rank one, but do not pass to the whole codomain, there are helper lemmas to discuss open/closed/clopen sets. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #27264 - [x] depends on: #27265 - [ ] depends on: #27163 - [x] depends on: #27339 | merge-conflict t-topology blocked-by-other-PR | 733/259 | Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/NumberTheory/FunctionField.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Valuation/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean | 12 | 9 | ['github-actions', 'kckennylau', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 284 days ago | 12 minutes |
| 30135 | erdOne | feat(RingTheory): `ValuativeRel` on subrings | --- @pechersky do we want this? [](https://gitpod.io/from-referrer/) | awaiting-author t-ring-theory | 19/0 | Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean | 1 | 5 | ['erdOne', 'github-actions', 'pechersky'] | nobody | 6 months ago | 207 days ago | 3 days |
| 28328 | pechersky | chore(Topology/Valued): golf using local finite order of WithZeroTopology | have to juggle in a version of `mrangeRestrict` which works on valuations, and also juggle the scoped topology over the subtype topology --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #28325 | t-number-theory blocked-by-other-PR t-algebra large-import merge-conflict t-topology | 187/88 | Mathlib/Topology/Algebra/GroupWithZero.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean,Mathlib/Topology/Compactness/Compact.lean | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 261 days ago | 26 minutes |
| 29926 | jcreinhold | feat(CategoryTheory/MarkovCategory): add basic finite stochastic matrices definitions to Markov category | This PR introduces FinStoch, the category of finite stochastic matrices, as a concrete example of a Markov category. This PR builds on #29925, #29939, and #29919 and was split up from #29657. ## Main additions ### 1. Core definitions (`FinStoch/Basic.lean`) - `StochasticMatrix m n`: Matrices where rows sum to 1, representing conditional probabilities P(j|i) - `FinStoch`: The category with finite types as objects and stochastic matrices as morphisms - `DetMorphism`: Deterministic matrices (exactly one 1 per row) with their underlying functions - Composition: Matrix multiplication preserves row-stochasticity via the Chapman-Kolmogorov equation Key design choices: - Row-stochastic convention: entry (i,j) is P(output=j | input=i) - Deterministic morphisms tracked separately for structural isomorphisms ### 2. Monoidal structure (`FinStoch/Monoidal.lean`) Implements tensor products modeling independent parallel processes: - Tensor on objects: Cartesian product of finite types - Tensor on morphisms: Kronecker product P((j₁,j₂)|(i₁,i₂)) = P(j₁|i₁) × P(j₂|i₂) - Structural morphisms: Associator, unitors use deterministic permutations - Coherence**: Pentagon and triangle identities verified computationally ## Mathematical significance FinStoch provides the canonical example of a Markov category: - Morphisms: Stochastic matrices/Markov chains - Composition: Chapman-Kolmogorov equation for multi-step transitions - Tensor: Independent parallel processes This models finite probability spaces categorically, where: - Objects represent sample spaces - Morphisms represent probabilistic transitions - Tensor products model independence ## References Fritz (2020) - [ ] depends on: #29925 | merge-conflict t-category-theory new-contributor | 1437/0 | Mathlib.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Basic.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Deterministic.lean,Mathlib/CategoryTheory/MarkovCategory/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/Cartesian.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Basic.lean,Mathlib/CategoryTheory/MarkovCategory/FinStoch/Monoidal.lean,MathlibTest/CategoryTheory/MarkovCategory.lean,docs/references.bib | 9 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 16773 | arulandu | feat(Probability/Distributions): formalize Beta distribution | Formalize Beta distribution, using Gamma distribution as a reference. Added real-valued beta wrapper, in the manner of gamma. Thanks to @EtienneC30 for help with casting real <-> complex. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability | 286/1 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean,Mathlib/Probability/Distributions/Beta.lean | 3 | 50 | ['EtienneC30', 'arulandu', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] | arulandu | 6 months ago | 593 days ago | 1 day |
| 30359 | JLimperg | [Not a PR] Benchmark for Aesop RPINF precompilation | --- [](https://gitpod.io/from-referrer/) | merge-conflict file-removed | 5/3 | lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 4 | 5 | ['JLimperg', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30351 | JLimperg | [Not a PR] Benchmark Aesop's lazy forward state construction | Testing the performance impact of an Aesop change. --- [](https://gitpod.io/from-referrer/) | merge-conflict dependency-bump | 3/3 | lake-manifest.json,lakefile.lean | 2 | 11 | ['JLimperg', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30425 | JLimperg | [Not a PR] Benchmark Aesop with precompiled RPINF at instance transparency | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 5/3 | lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 4 | 3 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30438 | JLimperg | [Not a PR] Benchmark Aesop change that computes fewer RPINFs | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 5/3 | lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 4 | 5 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30440 | JLimperg | [Not a PR] Benchmark Aesop with no `hypTypes` in `ForwardState` and `instances` RPINF transparency | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 5/3 | lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 4 | 3 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30452 | JLimperg | [Not a PR] Benchmark Aesop with no `hypTypes` in `ForwardState`, RPINF at `instances` transparency and lazy forward state | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 5/3 | lake-manifest.json,lakefile.lean,scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 4 | 3 | ['JLimperg', 'github-actions', 'leanprover-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 26284 | plp127 | feat: faster implementation of `Nat.primeFactorsList` + `@[csimp]` lemma | Add a function `Nat.primeFactorsListFast` that `#eval`s faster, and a `@[csimp]` lemma `Nat.primeFactorsList_eq_primeFactorsListFast` that shows `Nat.primeFactorsList = Nat.primeFactorsListFast`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data | 95/0 | Mathlib/Data/Nat/Factors.lean | 1 | 11 | ['b-mehta', 'github-actions', 'grunweg', 'plp127'] | b-mehta | 6 months ago | 201 days ago | 111 days |
| 27990 | kckennylau | feat(Counterexamples): a nontrivial valuation with discrete topology | This file constructs a valuation on `K[X]` satisfying `IsValuativeTopology K[X] ∧ Nonempty (valuation K[X]).RankOne ∧ IsNontrivial K[X] ∧ DiscreteTopology K[X]`, and proves that `IsValuativeTopology F ∧ IsNontrivial F ∧ DiscreteTopology F` is not possible if `F` is a field. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 172/0 | Counterexamples.lean,Counterexamples/DiscreteTopologyWithNontrivialValuation.lean | 2 | 14 | ['github-actions', 'grunweg', 'kckennylau', 'mathlib4-merge-conflict-bot', 'pechersky'] | nobody | 6 months ago | 201 days ago | 67 days |
| 28243 | robin-carlier | chore(CategoryTheory/Bicategory): move some `eqToHom` lemmas | The file `CategoryTheory/Bicategory/EqToHom.lean` introduced in #28242 is a more suitable hom for the lemmas `CategoryTheory.Bicategory.whiskerLeft_eqToHom` and `CategoryTheory.Bicategory.eqToHom_whiskerRight` than the current `CategoryTheory/Bicategory/Strict.lean`. We move these lemmas to the new file, and make `CategoryTheory/Bicategory/Strict` import these lemmas. --- - [x] depends on: #28242 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 165/23 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/EqToHom.lean,Mathlib/CategoryTheory/Bicategory/Strict.lean,Mathlib/CategoryTheory/EqToHom.lean,scripts/noshake.json | 5 | 9 | ['github-actions', 'joelriou', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 6 months ago | 210 days ago | 2 hours |
| 26913 | Paul-Lez | feat(NumberTheory/{*}): add a few lemmas about number field and cyclotomic extensions | The motivation for this PR is that the main statement in [this PR](https://github.com/google-deepmind/formal-conjectures/pull/297) shouldn't need to assume `p` has type `PNat` for the instances to work. This is still WIP as I need to clean up (currently waiting on the build!) --- [](https://gitpod.io/from-referrer/) | WIP t-number-theory t-algebra awaiting-CI merge-conflict | 52/0 | Mathlib/NumberTheory/ClassNumber/Temporary.lean,Mathlib/NumberTheory/Cyclotomic/Basic.lean,Mathlib/NumberTheory/Cyclotomic/Embeddings.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 296 days ago | 28 seconds |
| 27302 | tristan-f-r | feat(Fintype/Quotient): finLiftOn₂ | The combination of [`Quotient.finLiftOn`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Fintype/Quotient.html#Quotient.finLiftOn) and [`liftOn₂`](https://leanprover-community.github.io/mathlib4_docs/Init/Core.html#Quotient.liftOn%E2%82%82). --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data | 19/0 | Mathlib/Data/Fintype/Quotient.lean | 1 | 12 | ['github-actions', 'kckennylau', 'pechersky', 'tristan-f-r', 'vihdzp'] | pechersky | 6 months ago | 197 days ago | 6 days |
| 28925 | grunweg | chore: remove `linear_combination'` tactic | When `linear_combination` was refactored in #15899, the old code was kept as the `linear_combination'` tactic, for easier migration. The consensus of the zulip discussion ([#mathlib4 > Narrowing the scope of `linear_combination` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Narrowing.20the.20scope.20of.20.60linear_combination.60/near/470237816)) was to wait, and "revisit this once people have experienced the various tactics in practice". One year later, the old tactic has almost no uses: it is unused in mathlib; [searching on github](https://github.com/search?q=linear_combination%27%20path%3A*.lean&type=code) yields 37 hits --- all of which are in various forks of mathlib. Thus, removing this tactic seems appropriate. --- Do not merge before the zulip discussion has concluded! [](https://gitpod.io/from-referrer/) | merge-conflict file-removed awaiting-zulip | 0/564 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/LinearCombination'.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,MathlibTest/linear_combination'.lean | 5 | 4 | ['euprunin', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 248 days ago | 1 second |
| 29432 | lecopivo | feat: `data_synth` tactic to prove `HasFDerivAt 𝕜 f ?f' x` and similar | New tactic `data_synth` that can prove proposition with holes e.g. figure out what `?f'` is and prove `HasFDerivAt 𝕜 f ?f' x` --- Tactic `data_synth` is designed to synthesize some data that satisfies some proposition. The canonical example is `HasFDerivAt 𝕜 f ?f' x`, this tactic will figure out `f'` and provide proof of `HasFDerivAt 𝕜 f f' x`. Another examples: `HasBoundinbBall s ?center ?radius` or `IsPolynomial f ?p` ``` def HasBoundingBall (s : Set α) (center : α) (radius : ℝ) : Prop := s ⊆ Metric.closedBall center radius def IsPolynomial (f : R → R) (p : Polynomial R) := f = p.eval ``` | WIP t-meta | 1932/0 | Mathlib/Tactic/DataSynth.lean,Mathlib/Tactic/DataSynth/Attr.lean,Mathlib/Tactic/DataSynth/Core.lean,Mathlib/Tactic/DataSynth/Decl.lean,Mathlib/Tactic/DataSynth/Elab.lean,Mathlib/Tactic/DataSynth/FDeriv.lean,Mathlib/Tactic/DataSynth/FDeriv/Basic.lean,Mathlib/Tactic/DataSynth/FDeriv/Dispatch.lean,Mathlib/Tactic/DataSynth/FDeriv/Init.lean,Mathlib/Tactic/DataSynth/FDeriv/Simproc.lean,Mathlib/Tactic/DataSynth/Tests/BoundingBall.lean,Mathlib/Tactic/DataSynth/Tests/Compilation.lean,Mathlib/Tactic/DataSynth/Tests/FDeriv.lean,Mathlib/Tactic/DataSynth/Tests/FDerivInit.lean,Mathlib/Tactic/DataSynth/Tests/FwdDeriv.lean,Mathlib/Tactic/DataSynth/Tests/Normalize.lean,Mathlib/Tactic/DataSynth/Tests/Polynomial.lean,Mathlib/Tactic/DataSynth/Theorems.lean,Mathlib/Tactic/DataSynth/ToBatteries.lean,Mathlib/Tactic/DataSynth/Types.lean | 20 | 3 | ['JovanGerb', 'github-actions', 'lecopivo'] | nobody | 6 months ago | 235 days ago | 30 minutes |
| 29855 | eric-wieser | chore(Data/Finset/Sort): lemmas about `0 : Fin _` and `Fin.last _` | We already had these for `⟨0, ⋯⟩` and `⟨k - 1, ⋯⟩`. Moves: - `Finset.orderEmbOfFin_zero` -> `Finset.orderEmbOfFin_mk_zero` - `Finset.orderEmbOfFin_last` -> `Finset.orderEmbOfFin_mk_last` --- [](https://gitpod.io/from-referrer/) | t-data t-order delegated easy | 17/7 | Mathlib/Combinatorics/Enumerative/Composition.lean,Mathlib/Data/Finset/Sort.lean | 2 | 4 | ['eric-wieser', 'github-actions', 'mathlib-bors', 'ocfnash'] | nobody | 6 months ago | 218 days ago | 3 days |
| 19616 | adamtopaz | fix: fix the definition of the absolute Galois group of a field | Previously it was defined as the Galois group of the algebraic closure, as opposed to the separable closure. Also, this adds some missing instances for this group. Still missing is compactness, but that seems like a bigger project. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-number-theory | 23/8 | Mathlib/FieldTheory/AbsoluteGaloisGroup.lean,Mathlib/FieldTheory/KrullTopology.lean | 2 | 4 | ['acmepjz', 'alreadydone', 'github-actions'] | nobody | 6 months ago | 514 days ago | 3 days |
| 28826 | alreadydone | feat(CategoryTheory): Additive and Linear when Hom types are only monoids | + introduce Presemiadditive categories, which generalizes Preadditive categories: the Hom sets are commutative monoids rather than groups, and `comp_zero` and `zero_comp` is no longer automatic. The new file Preadditive/Semi.lean is adapted from Preadditive/Basic.lean, though many contents can't be generalized. + generalize Functor.Additive and Functor.Linear to take Presemiadditive categories instead. The former needs a `map_zero` field since it's not automatic for Presemiadditive categories. + introduce SemimoduleCat, the category of semimodules (mathlib's Module) over a Semiring. The new file ModuleCat/Semi.lean is copied from ModuleCat/Basic.lean. TODOs: additive/linear equivalence between SemimoduleCat and ModuleCat and use it to transfer results; monoidal structure on SemimoduleCat; change `CommRing.Pic` to use SemimoduleCat. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory awaiting-CI | 978/123 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/Category/MonCat/Presemiadditive.lean,Mathlib/CategoryTheory/Linear/Basic.lean,Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean,Mathlib/CategoryTheory/Preadditive/Basic.lean,Mathlib/CategoryTheory/Preadditive/Biproducts.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/CategoryTheory/Preadditive/Semi.lean | 9 | 4 | ['alreadydone', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | nobody | 6 months ago | 250 days ago | 1 second |
| 16428 | astrainfinita | test use `QuotLike` APIs | --- - [ ] depends on: #16421 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 1501/564 | Mathlib.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Quandle.lean,Mathlib/CategoryTheory/IsomorphismClasses.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Skeletal.lean,Mathlib/Data/Finmap.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Multiset/Functor.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean,Mathlib/Data/QPF/Univariate/Basic.lean,Mathlib/Data/Quot.lean,Mathlib/Data/QuotLike.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Coset/Basic.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/ConjAct.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/Subgroup/Center.lean,Mathlib/LinearAlgebra/Quotient/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Logic/Relation.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Finite.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Lists.lean,Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/Topology/Inseparable.lean,test/QuotLike.lean | 43 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 16210 | astrainfinita | Clean up quotient APIs | ~~We may migrate to `Quot` and `IsEquiv` APIs in the future, but it might be a good start to clean up `Quotient` APIs anyway.~~ The diffs in this PR did not include `QuotLike` APIs, but eventually I decided to migrate to `QuotLike` before deprecating some old APIs. This is because some lemmas don't have alternatives that don't use `· ≈ ·`, and the alternatives that use `· ≈ ·` are in the core. See [Zulip](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/.60.28.C2.B7.20.E2.89.88.20.C2.B7.29.60.20in.20.60Quotient.60.20APIs/near/466970386). --- - [x] depends on: #16254 - [x] depends on: #16256 - [x] depends on: #16258 - [x] depends on: #16260 - [x] depends on: #16264 - [x] depends on: #16267 - [ ] depends on: #16314 - [x] depends on: #16410 - [x] depends on: #17588 - [x] depends on: #17594 - [x] depends on: #17940 - [ ] depends on: #17941 --- `QuotLike` - [ ] depends on: #16421 - [ ] depends on: #16428 --- [remaining diffs](https://github.com/leanprover-community/mathlib4/compare/FR_quot_now..FR_quot) [](https://gitpod.io/from-referrer/) | merge-conflict tech debt blocked-by-other-PR t-data | 1015/1114 | Counterexamples/CliffordAlgebraNotInjective.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset.lean,Mathlib/Algebra/CharZero/Quotient.lean,Mathlib/Algebra/DirectLimit.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Lie/Free.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/Module/Zlattice/Basic.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Periodic.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/StructureSheaf.lean,Mathlib/Analysis/Normed/Group/Quotient.lean,Mathlib/Analysis/Normed/Group/SemiNormedGrp/Kernels.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Limits/Shapes/SingleObj.lean,Mathlib/CategoryTheory/Limits/Types.lean,Mathlib/CategoryTheory/Skeletal.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Subobject/FactorThru.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Combinatorics/Quiver/ConnectedComponent.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Computability/Reduce.lean,Mathlib/Computability/TuringMachine.lean,Mathlib/Data/Countable/Defs.lean,Mathlib/Data/FinEnum.lean,Mathlib/Data/Finite/Basic.lean,Mathlib/Data/Fintype/Basic.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/FieldTheory/PerfectClosure.lean,Mathlib/FieldTheory/SplittingField/Construction.lean,Mathlib/GroupTheory/Abelianization.lean,Mathlib/GroupTheory/Commensurable.lean,Mathlib/GroupTheory/CommutingProbability.lean,Mathlib/GroupTheory/Complement.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/Coprod/Basic.lean,Mathlib/GroupTheory/Coset/Basic.lean,Mathlib/GroupTheory/DoubleCoset.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/ConjAct.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/SchurZassenhaus.lean,Mathlib/GroupTheory/Sylow.lean,Mathlib/GroupTheory/Transfer.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/LinearAlgebra/Dimension/Constructions.lean,Mathlib/LinearAlgebra/InvariantBasisNumber.lean,Mathlib/LinearAlgebra/Isomorphisms.lean,Mathlib/LinearAlgebra/Projectivization/Basic.lean,Mathlib/LinearAlgebra/Quotient.lean,Mathlib/LinearAlgebra/QuotientPi.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/MeasureTheory/Group/FundamentalDomain.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/Measure/Haar/Quotient.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/Ultraproducts.lean,Mathlib/NumberTheory/NumberField/Embeddings.lean,Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/RamificationInertia.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/Order/Partition/Finpartition.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/RepresentationTheory/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Congruence/Basic.lean,Mathlib/RingTheory/Flat/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean | 134 | 6 | ['astrainfinita', 'github-actions', 'leanprover-bot', 'leanprover-community-mathlib4-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30642 | thorimur | bench: lean4#10832 | merge-conflict large-import | 507/460 | .github/workflows/nightly-docgen.yml,Cache/IO.lean,Mathlib.lean,Mathlib/Algebra/Algebra/StrictPositivity.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Polynomial/RuleOfSigns.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean,Mathlib/Computability/DFA.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Control/Monad/Cont.lean,Mathlib/Data/Finset/Attach.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finset/Empty.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Fintype/EquivFin.lean,Mathlib/Data/Int/LeastGreatest.lean,Mathlib/Data/List/Chain.lean,Mathlib/Data/List/Flatten.lean,Mathlib/Data/List/SplitOn.lean,Mathlib/Data/List/Triplewise.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Data/String/Basic.lean,Mathlib/Data/String/Defs.lean,Mathlib/Data/String/Lemmas.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/LebesgueDifferentiationThm.lean,Mathlib/Order/CompleteLattice/MulticoequalizerDiagram.lean,Mathlib/SetTheory/PGame/Basic.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/DeclarationNames.lean,Mathlib/Tactic/Hint.lean,Mathlib/Tactic/Linter/CommandStart.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Tactic/Linter/Header.lean,Mathlib/Tactic/Linter/TextBased.lean,Mathlib/Tactic/Says.lean,Mathlib/Tactic/SuccessIfFailWithMsg.lean,Mathlib/Tactic/ToAdditive/Frontend.lean,Mathlib/Tactic/ToAdditive/GuessName.lean,Mathlib/Tactic/ToExpr.lean,Mathlib/Tactic/Widget/Calc.lean,Mathlib/Tactic/Widget/CongrM.lean,Mathlib/Tactic/Widget/Conv.lean,Mathlib/Tactic/Widget/GCongr.lean,Mathlib/Tactic/Widget/InteractiveUnfold.lean,Mathlib/Tactic/Widget/LibraryRewrite.lean,Mathlib/Tactic/Widget/SelectPanelUtils.lean,Mathlib/Util/CompileInductive.lean,Mathlib/Util/Superscript.lean,MathlibTest/CalcQuestionMark.lean,MathlibTest/Change.lean,MathlibTest/DeprecateTo.lean,MathlibTest/FieldSimp.lean,MathlibTest/FindSyntax.lean,MathlibTest/LibraryRewrite.lean,MathlibTest/LibrarySearch/basic.lean,MathlibTest/LibrarySearch/mathlib.lean,MathlibTest/LibrarySearch/observe.lean,MathlibTest/Simps.lean,MathlibTest/Subsingleton.lean,MathlibTest/Use.lean,MathlibTest/Util/PrintSorries.lean,MathlibTest/Variable.lean,MathlibTest/fast_instance.lean,MathlibTest/grind/pairwise_disjoint.lean,MathlibTest/hint.lean,MathlibTest/propose.lean,MathlibTest/rewrites.lean,MathlibTest/ring.lean,MathlibTest/says.lean,MathlibTest/says_whitespace.lean,MathlibTest/success_if_fail_with_msg.lean,MathlibTest/toAdditive.lean,lake-manifest.json,lakefile.lean,lean-toolchain,scripts/check-yaml.lean,scripts/noshake.json | 92 | 4 | ['github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot', 'thorimur'] | nobody | 6 months ago | unknown | 0 seconds | |
| 30643 | thorimur | bench: before lean4#10832 | merge-conflict large-import | 507/460 | .github/workflows/nightly-docgen.yml,Cache/IO.lean,Mathlib.lean,Mathlib/Algebra/Algebra/StrictPositivity.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Polynomial/RuleOfSigns.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean,Mathlib/Computability/DFA.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Control/Monad/Cont.lean,Mathlib/Data/Finset/Attach.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finset/Empty.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Fintype/EquivFin.lean,Mathlib/Data/Int/LeastGreatest.lean,Mathlib/Data/List/Chain.lean,Mathlib/Data/List/Flatten.lean,Mathlib/Data/List/SplitOn.lean,Mathlib/Data/List/Triplewise.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Data/String/Basic.lean,Mathlib/Data/String/Defs.lean,Mathlib/Data/String/Lemmas.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/LebesgueDifferentiationThm.lean,Mathlib/Order/CompleteLattice/MulticoequalizerDiagram.lean,Mathlib/SetTheory/PGame/Basic.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/DeclarationNames.lean,Mathlib/Tactic/Hint.lean,Mathlib/Tactic/Linter/CommandStart.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Tactic/Linter/Header.lean,Mathlib/Tactic/Linter/TextBased.lean,Mathlib/Tactic/Says.lean,Mathlib/Tactic/SuccessIfFailWithMsg.lean,Mathlib/Tactic/ToAdditive/Frontend.lean,Mathlib/Tactic/ToAdditive/GuessName.lean,Mathlib/Tactic/ToExpr.lean,Mathlib/Tactic/Widget/Calc.lean,Mathlib/Tactic/Widget/CongrM.lean,Mathlib/Tactic/Widget/Conv.lean,Mathlib/Tactic/Widget/GCongr.lean,Mathlib/Tactic/Widget/InteractiveUnfold.lean,Mathlib/Tactic/Widget/LibraryRewrite.lean,Mathlib/Tactic/Widget/SelectPanelUtils.lean,Mathlib/Util/CompileInductive.lean,Mathlib/Util/Superscript.lean,MathlibTest/CalcQuestionMark.lean,MathlibTest/Change.lean,MathlibTest/DeprecateTo.lean,MathlibTest/FieldSimp.lean,MathlibTest/FindSyntax.lean,MathlibTest/LibraryRewrite.lean,MathlibTest/LibrarySearch/basic.lean,MathlibTest/LibrarySearch/mathlib.lean,MathlibTest/LibrarySearch/observe.lean,MathlibTest/Simps.lean,MathlibTest/Subsingleton.lean,MathlibTest/Use.lean,MathlibTest/Util/PrintSorries.lean,MathlibTest/Variable.lean,MathlibTest/fast_instance.lean,MathlibTest/grind/pairwise_disjoint.lean,MathlibTest/hint.lean,MathlibTest/propose.lean,MathlibTest/rewrites.lean,MathlibTest/ring.lean,MathlibTest/says.lean,MathlibTest/says_whitespace.lean,MathlibTest/success_if_fail_with_msg.lean,MathlibTest/toAdditive.lean,lake-manifest.json,lakefile.lean,lean-toolchain,scripts/check-yaml.lean,scripts/noshake.json | 92 | 4 | ['github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot', 'thorimur'] | nobody | 6 months ago | unknown | 0 seconds | |
| 30460 | janithamalith | feat(Nat): add lemma nat_card_orbit_mul_card_stabilizer_eq_card_group | Added a lemma `nat_card_orbit_mul_card_stabilizer_eq_card_group` which is the Nat.card version of MulAction.card_orbit_mul_card_stabilizer_eq_card_group --- [](https://gitpod.io/from-referrer/) | awaiting-author t-group-theory new-contributor | 6/0 | Mathlib/GroupTheory/GroupAction/CardCommute.lean | 1 | 17 | ['github-actions', 'kckennylau', 'plp127', 'tb65536'] | tb65536 | 6 months ago | 193 days ago | 8 days |
| 30209 | Ruben-VandeVelde | feat: some TwoSidedIdeal.span lemmas | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-ring-theory FLT | 16/0 | Mathlib/RingTheory/TwoSidedIdeal/Operations.lean | 1 | 2 | ['erdOne', 'github-actions'] | erdOne | 6 months ago | 191 days ago | 17 days |
| 25225 | xcloudyunx | feat(Combinatorics/SimpleGraph): Eulerian walk in connected graph contains all vertices | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 16/0 | Mathlib/Combinatorics/SimpleGraph/Trails.lean | 1 | 6 | ['IvanRenison', 'github-actions', 'vlad902'] | kmill | 6 months ago | 191 days ago | 148 days |
| 27206 | grhkm21 | feat(CategoryTheory/Adjunction): partial adjoints are adjoints | Partial adjunctions `F.partial{Left,Right}Adjunction` are adjunctions when fully defined i.e. `F.{left,right}AdjointObjIsDefined = ⊤`. | awaiting-author t-category-theory | 48/2 | Mathlib/CategoryTheory/Adjunction/PartialAdjoint.lean | 1 | 1 | ['github-actions'] | nobody | 6 months ago | 289 days ago | 1 minute |
| 27196 | YaelDillies | refactor(Polynomial/Bivariate): swap `X` and `Y` for improved notation | This way, `X` keeps on being `X`. From Toric --- [](https://gitpod.io/from-referrer/) | WIP t-algebra toric | 3/3 | Mathlib/Algebra/Polynomial/Bivariate.lean | 1 | 7 | ['YaelDillies', 'alreadydone', 'github-actions', 'kckennylau'] | nobody | 6 months ago | 289 days ago | 1 minute |
| 24532 | robertmaxton42 | feat(LinearAlgebra/FreeProduct): fill out the `FreeProduct.asPowers` namespace | * Replicate the existing API for `LinearAlgebra.FreeProduct` under `FreeProduct.asPowers`, for convenience when working primarily with the power algebra representation * Adds convenience lemmas for using the corresponding quotient relation `rel'` (used in the above). --- - [x] depends on: #24531 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 122/5 | Mathlib/LinearAlgebra/FreeProduct/Basic.lean | 1 | 26 | ['YaelDillies', 'adomani', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robertmaxton42'] | nobody | 6 months ago | 355 days ago | 13 hours |
| 27683 | dupuisf | feat: grind tags for set operations | This PR adds `grind` tags for various set operations (union, intersection, complement, etc). --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 29/9 | Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Operations.lean | 2 | 5 | ['dupuisf', 'euprunin', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 273 days ago | 1 hour |
| 30828 | DeVilhena-Paulo | feat: implementation of `Finmap.merge` | The main contribution of this pull request is the implementation of a `merge` function for finite maps (`Finmap`). The construction relies on the definition of a `merge` function for association lists (`AList`). There is also a side (unrelated) contribution on `Mathlib/Data/List/Permutation.lean`: the addition of a theorem about the permutation of a list with a head element (that is, a list of the form `a :: l`). --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 449/3 | Mathlib/Data/Finmap.lean,Mathlib/Data/List/AList.lean,Mathlib/Data/List/Permutation.lean,Mathlib/Data/List/Sigma.lean | 4 | 1 | ['github-actions'] | nobody | 6 months ago | 190 days ago | 1 minute |
| 29355 | girving | feat(Trigonometric): Taylor series bounds for sin and cos | Zulip discussion here: https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Better.20.60Real.2Esin.60.20bounds/near/535035576 We also include the full set of intervals on which sin and cos are monotone/antitone. --- Questions to resolve as part of review: 1. I've left the `Finset.sum_range_even` in the new `SeriesBounds` file, but presumably it should go somewhere else (unless you want me to inline it, but that seems worse). 2. Is putting the new Taylor series bounds in a new `SeriesBounds` file right, or should it go in the current `Bounds.lean` file? When I started writing the PR I thought the new bounds would need more imports via more analysis, but it turns out the only new import needed would be `Mathlib.Algebra.BigOperators.Field` which seems lightweight. I am happy with whatever the preference is in terms of file structure. [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 158/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Bounds.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/SeriesBounds.lean | 4 | 28 | ['Parcly-Taxel', 'Ruben-VandeVelde', 'adomani', 'girving', 'github-actions', 'llllvvuu', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 6 months ago | 237 days ago | 21 hours |
| 28298 | thorimur | chore: dedent `to_additive` docstrings | This PR uses automation to dedent `to_additive` docstrings throughout Mathlib. It does not lint against indentation or in any way enforce indentation standards for future docstrings. The convention was chosen in accordance with the discussion and polls at [this Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Poll.3A.20Indentation.20style.20for.20.60to_additive.60.20docstrings/with/534285603). --- [](https://gitpod.io/from-referrer/) | merge-conflict documentation awaiting-author | 949/949 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/Category/Grp/Basic.lean,Mathlib/Algebra/Category/Grp/FilteredColimits.lean,Mathlib/Algebra/Category/Grp/Limits.lean,Mathlib/Algebra/Category/Grp/Ulift.lean,Mathlib/Algebra/Category/MonCat/Basic.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/Algebra/Category/MonCat/Limits.lean,Mathlib/Algebra/Category/Semigrp/Basic.lean,Mathlib/Algebra/Free.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Action/Pi.lean,Mathlib/Algebra/Group/Action/Pointwise/Finset.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Embedding.lean,Mathlib/Algebra/Group/Equiv/Basic.lean,Mathlib/Algebra/Group/Equiv/Defs.lean,Mathlib/Algebra/Group/Equiv/Opposite.lean,Mathlib/Algebra/Group/Even.lean,Mathlib/Algebra/Group/Hom/Basic.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Group/Hom/Instances.lean,Mathlib/Algebra/Group/Indicator.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/Group/Pi/Units.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Defs.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/BigOperators.lean,Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Submonoid/MulAction.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Group/Subsemigroup/Basic.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Algebra/Group/UniqueProds/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Group/Units/Equiv.lean,Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/Algebra/Group/Units/Opposite.lean,Mathlib/Algebra/Notation/Pi/Basic.lean,Mathlib/Algebra/Opposites.lean,Mathlib/Algebra/Order/BigOperators/Group/List.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Basic.lean,Mathlib/Algebra/Order/Group/Cone.lean,Mathlib/Algebra/Order/Group/OrderIso.lean,Mathlib/Algebra/Order/Group/Units.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Submonoid.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Monoid/Units.lean,Mathlib/Algebra/Order/Pi.lean,Mathlib/Algebra/Regular/Defs.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Fintype/BigOperators.lean,Mathlib/Data/Set/MulAntidiagonal.lean,Mathlib/Data/Set/SMulAntidiagonal.lean,Mathlib/Data/Vector/Basic.lean,Mathlib/Dynamics/Ergodic/Action/OfMinimal.lean,Mathlib/Dynamics/FixedPoints/Prufer.lean,Mathlib/Geometry/Manifold/Algebra/SmoothFunctions.lean,Mathlib/GroupTheory/Complement.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Coprod/Basic.lean,Mathlib/GroupTheory/Coset/Basic.lean,Mathlib/GroupTheory/Divisible.lean,Mathlib/GroupTheory/EckmannHilton.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/GroupTheory/FreeGroup/Reduce.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Blocks.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/FixedPoints.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/Primitive.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean | 141 | 11 | ['eric-wieser', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'thorimur'] | nobody | 6 months ago | 261 days ago | 12 hours |
| 28737 | astrainfinita | refactor: deprecate `MulEquivClass` | This PR continues the work from #18806. Original PR: https://github.com/leanprover-community/mathlib4/pull/18806 | merge-conflict awaiting-author t-algebra | 67/77 | Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/Group/Equiv/Basic.lean,Mathlib/Algebra/Group/Equiv/Defs.lean,Mathlib/Algebra/Group/Irreducible/Lemmas.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Group/Units/Equiv.lean,Mathlib/Algebra/GroupWithZero/Equiv.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Prime/Lemmas.lean,Mathlib/Algebra/Ring/Divisibility/Basic.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Star/MonoidHom.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean,Mathlib/GroupTheory/GroupExtension/Defs.lean,Mathlib/GroupTheory/Submonoid/Center.lean,Mathlib/LinearAlgebra/FreeModule/Finite/CardQuotient.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/UniqueFactorizationDomain/NormalizedFactors.lean,Mathlib/Topology/Algebra/ContinuousMonoidHom.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | 26 | 20 | ['Vierkantor', 'alreadydone', 'astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | Vierkantor | 6 months ago | 248 days ago | 2 days |
| 28676 | sun123zxy | feat(NumberTheory/ArithmeticFunction): wrap `Nat.totient` as an `ArithmeticFunction` | This wraps the Euler's totient function `Nat.totient` into a new `ArithmeticFunction` `ϕ`, with some basic identities such as `ϕ * ζ = id` and `μ * id = ϕ.` --- We use the notation `ϕ` to distinguish from `Nat.totient`'s notation `φ`, however this might be controversial. Suggestions are welcome! [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor large-import merge-conflict awaiting-author | 45/5 | Mathlib/NumberTheory/ArithmeticFunction.lean | 1 | 19 | ['MichaelStollBayreuth', 'SnirBroshi', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'riccardobrasca', 'sun123zxy'] | MichaelStollBayreuth | 6 months ago | 201 days ago | 47 days |
| 30299 | franv314 | feat(Topology/Instances): Cantor set | Prove that the Cantor set has empty interior and the cardinality of the continuum as discussed on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/A.20few.20results.20about.20the.20Cantor.20set/with/543560670) Moves: - Mathlib.Topology.Instances.CantorSet -> Mathlib.Topology.Instances.CantorSet.Basic --- [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict file-removed awaiting-author t-topology | 355/2 | Mathlib.lean,Mathlib/Topology/Instances/CantorSet/Basic.lean,Mathlib/Topology/Instances/CantorSet/Cardinality.lean,Mathlib/Topology/Instances/CantorSet/Lemmas.lean | 4 | 5 | ['github-actions', 'grunweg', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 206 days ago | 40 minutes |
| 30303 | franv314 | chore(Topology/Instances): add deprecated module | Add deprecated module to moved Cantor set file. --- - [ ] depends on: #30299 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor | 486/124 | Mathlib.lean,Mathlib/Topology/Instances/CantorSet.lean,Mathlib/Topology/Instances/CantorSet/Basic.lean,Mathlib/Topology/Instances/CantorSet/Cardinality.lean,Mathlib/Topology/Instances/CantorSet/Lemmas.lean | 5 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 206 days ago | 5 minutes |
| 30575 | urkud | feat: lemmas about `_ • _` on Filters | as well as `Set.Finite.f?derivWithin_eq`. I wrote these lemmas for #24019, but the final version of that PR doesn't need them. I moved them here so that I don't forget to prepare a non-draft PR with these lemmas. --- [](https://gitpod.io/from-referrer/) | t-topology | 51/0 | Mathlib/Topology/TODO.lean | 1 | 3 | ['github-actions', 'plp127', 'urkud'] | nobody | 6 months ago | unknown | 0 seconds |
| 27976 | smmercuri | feat: `ramificationIdx` for `NumberField.InfinitePlace` | This PR continues the work from #24884. Original PR: https://github.com/leanprover-community/mathlib4/pull/24884 | merge-conflict WIP t-number-theory | 22/0 | Mathlib/NumberTheory/NumberField/InfinitePlace/Ramification.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 269 days ago | 57 seconds |
| 26357 | javra | feat(CategoryTheory): linear categories as `ModuleCat R`-enriched categories | Continues #23826. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory large-import | 197/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/CategoryTheory/Enriched/Linear.lean,Mathlib/CategoryTheory/Linear/Basic.lean,Mathlib/CategoryTheory/Monoidal/Linear.lean | 5 | 10 | ['adamtopaz', 'github-actions', 'javra', 'mathlib4-merge-conflict-bot'] | adamtopaz | 6 months ago | 227 days ago | 78 days |
| 26085 | grunweg | feat: disjoint unions distribute with products of manifolds | This PR continues the work from #22611. Original PR: https://github.com/leanprover-community/mathlib4/pull/22611 | please-adopt WIP t-differential-geometry merge-conflict | 75/6 | Mathlib/Geometry/Manifold/Diffeomorph.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean | 2 | 3 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | 317 days ago | 1 minute |
| 27180 | ADedecker | feat: quotient of a monoid with zero by a multiplicative congruence | --- My motivation is getting a more conceptual construction of [ValuativeRel.ValueGroupWithZero](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Valuation/ValuativeRel.html#ValuativeRel.ValueGroupWithZero), but I think this is of independent interest. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra delegated | 141/26 | Mathlib.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/GroupWithZero.lean | 5 | 32 | ['ADedecker', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'ocfnash'] | ocfnash | 6 months ago | 261 days ago | 28 days |
| 29570 | eric-wieser | fix: substitute infotrees in linters | I don't know whether this is necessary in these particular cases, but I've seen places where it is. There are a handful more of these cases in Batteries. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 2/2 | Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/TacticAnalysis.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 6 months ago | unknown | 0 seconds |
| 30790 | urkud | chore: partially migrate from `ContinuousMap.continuous` | ... to `map_continuous` or `by fun_prop`. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 37/45 | Mathlib/AlgebraicGeometry/Morphisms/Constructors.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Restrict.lean,Mathlib/Analysis/Complex/Circle.lean,Mathlib/Analysis/Fourier/AddCircleMulti.lean,Mathlib/Condensed/Light/TopCatAdjunction.lean,Mathlib/Condensed/TopCatAdjunction.lean,Mathlib/Condensed/TopComparison.lean,Mathlib/Dynamics/Ergodic/Action/OfMinimal.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean,Mathlib/Topology/Category/CompHausLike/Limits.lean,Mathlib/Topology/Compactification/OnePoint/Basic.lean,Mathlib/Topology/Compactness/CompactlyGeneratedSpace.lean,Mathlib/Topology/ContinuousMap/CompactlySupported.lean,Mathlib/Topology/ContinuousMap/Units.lean,Mathlib/Topology/ContinuousMap/ZeroAtInfty.lean,Mathlib/Topology/LocallyConstant/Basic.lean,Mathlib/Topology/PartitionOfUnity.lean,Mathlib/Topology/Sets/Opens.lean,Mathlib/Topology/TietzeExtension.lean,Mathlib/Topology/UniformSpace/CompactConvergence.lean,Mathlib/Topology/UniformSpace/Dini.lean,Mathlib/Topology/UrysohnsLemma.lean | 24 | 6 | ['erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 6 months ago | 190 days ago | 1 hour |
| 30631 | ADedecker | refactor: evaluation of power series in semirings | --- [](https://gitpod.io/from-referrer/) | 665/71 | Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/RingTheory/MvPowerSeries/EvaluationSemi.lean,Mathlib/Topology/Algebra/LinearTopology.lean,Mathlib/Topology/Algebra/LinearUniformity.lean,Mathlib/Topology/Algebra/TopologicallyNilpotent.lean | 5 | 1 | ['github-actions'] | nobody | 6 months ago | unknown | 0 seconds | |
| 29871 | zach1502 | feat(Matrix/Transvection): Gauss pivot determinant identity and pivot preservation | This PR adds two lemmas formalizing standard Gaussian pivot identities: * `Matrix.Transvection.listTransvecCol_mul_mul_listTransvecRow_pivot`: After applying the canonical left/right transvection products that clear the last column and row, the pivot (bottom-right) entry of a matrix is unchanged. Marked `@[simp]`. * `Matrix.Transvection.det_eq_detTopLeft_mul_pivot`: If the pivot entry is nonzero, then the determinant of the matrix factors as the determinant of the top-left block times the pivot entry, after performing the canonical transvections. This is the usual Gauss–pivot determinant identity. * Added simple usage tests in `MathlibTest/matrix.lean` to check that the new lemmas are usable by `simp`/`simpa`. --- --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 94/0 | Mathlib/LinearAlgebra/Matrix/Transvection.lean,MathlibTest/matrix.lean | 2 | 3 | ['github-actions', 'riccardobrasca', 'zach1502'] | nobody | 5 months ago | 179 days ago | 41 days |
| 25692 | Whysoserioushah | feat(RingTheory/MatrixAlgebra): add a more general version of `matrixEquivTensor` | This adds `tensorMatrixLinearEquiv : A ⊗[R] Matrix n n B ≃ₐ[S] Matrix n n (A ⊗[R] B)`
which is a more general version of `matrixEquivTensor : Matrix n n A ≃ₐ[R] (A ⊗[R] Matrix n n R)`.
The latter is then implemented as a trivial consequence of the former.
Many internal implementation details are deleted without deprecation, although strictly these were not private.
Co-authored-by: @erdOne |
merge-conflict awaiting-author t-ring-theory | 129/110 | Mathlib/RingTheory/MatrixAlgebra.lean | 1 | 28 | ['Whysoserioushah', 'chrisflav', 'eric-wieser', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mattrobball'] | chrisflav | 5 months ago | 255 days ago | 47 days |
| 25012 | urkud | refactor(*): migrate from `Matrix.toLin'` to `Matrix.mulVecLin` | or `Matrix.mulVec` whenever we don't need the `LinearEquiv.symm` part. See [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Matrix.2EtoLin'.20vs.20Matrix.2EmulVecLin/with/515188548). It makes sense to have only one normal form, and `Matrix.toLin'` has an extra `DecidableEq` assumption. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 165/126 | Mathlib/Algebra/Lie/Matrix.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/Matrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/LinearAlgebra/Basis/Defs.lean,Mathlib/LinearAlgebra/Determinant.lean,Mathlib/LinearAlgebra/Finsupp/VectorSpace.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/Minpoly.lean,Mathlib/LinearAlgebra/Matrix/Diagonal.lean,Mathlib/LinearAlgebra/Matrix/Gershgorin.lean,Mathlib/LinearAlgebra/Matrix/Rank.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean,Mathlib/LinearAlgebra/Matrix/ToLin.lean,Mathlib/LinearAlgebra/Matrix/ToLinearEquiv.lean,Mathlib/LinearAlgebra/UnitaryGroup.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean | 19 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 225 days ago | 15 days |
| 29638 | yuma-mizuno | feat(CategoryTheory): define descent data by presieves | --- Addendum: I realized that there is prior work in #24434. Since this PR uses a slightly different definition, I plan to make this PR a follow-up to #24434. Until then, I’ll keep it marked as WIP. See the comment: https://github.com/leanprover-community/mathlib4/pull/29638#issuecomment-3290041719 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 408/2 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean,Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean,Mathlib/CategoryTheory/Category/Cat.lean,Mathlib/CategoryTheory/Stack/Basic.lean,Mathlib/CategoryTheory/Stack/Descent.lean | 6 | 7 | ['chrisflav', 'github-actions', 'joelriou', 'mathlib4-merge-conflict-bot', 'yuma-mizuno'] | nobody | 5 months ago | 229 days ago | 1 minute |
| 30158 | nicolaviolette | feat: combinatorics simplegraph basic | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 9/4 | Mathlib/Combinatorics/SimpleGraph/Basic.lean | 1 | 3 | ['b-mehta', 'github-actions'] | b-mehta | 5 months ago | 178 days ago | 31 days |
| 28132 | dupuisf | feat: preliminary `grind` tags for `IsUnit` | This PR adds preliminary `grind` tags for the `IsUnit` predicate. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 61/17 | Mathlib/Algebra/Group/Action/Units.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Ring/Units.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean | 6 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | kim-em | 5 months ago | 177 days ago | 80 days |
| 25903 | pfaffelh | feat(MeasureTheory): finite unions of sets in a semi-ring (in terms of measure theory) form a ring | merge-conflict blocked-by-other-PR large-import t-measure-probability | 648/131 | Mathlib.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Module/Bimodule.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Data/Set/Pairwise/Lattice.lean,Mathlib/Data/Set/Prod.lean,Mathlib/MeasureTheory/MeasurableSpace/Pi.lean,Mathlib/MeasureTheory/Measure/AddContent.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/MeasureTheory/SetAlgebra.lean,Mathlib/MeasureTheory/SetRing.lean,Mathlib/MeasureTheory/SetSemiring.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ExtractLets.lean,lake-manifest.json,lakefile.lean | 16 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 255 days ago | 3 hours | |
| 28863 | yury-harmonic | ignore: make CI build oleans | It looks like CI doesn't build oleans unless I open a PR. Or I can't see this workflow. --- [](https://gitpod.io/from-referrer/) | merge-conflict large-import | 624/100 | Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/MvPolynomial/Expand.lean,Mathlib/Algebra/Order/Floor/Semifield.lean,Mathlib/Algebra/Order/Positive/Field.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Data/Int/ModEq.lean,Mathlib/Data/NNRat/Floor.lean,Mathlib/Data/Nat/Factorial/Basic.lean,Mathlib/Data/Nat/ModEq.lean,Mathlib/Data/Nat/NthRoot/Defs.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Tactic/NormNum/Basic.lean,MathlibTest/norm_num_ext.lean | 13 | 4 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 29992 | vlad902 | feat(Order): finite (Max)Chains always contains a top/max element | --- - [ ] depends on: #29835 [optional extra text] - [ ] depends on: #29993 [optional extra text] [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order large-import | 35/0 | Mathlib/Order/Preorder/Chain.lean | 1 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 217 days ago | 56 seconds |
| 26901 | 5hv5hvnk | feat: a simproc version of `compute_degree` | Wrap `compute_degree` in a simproc for use by simp. Closes #22219. --- | awaiting-CI new-contributor merge-conflict awaiting-author t-meta | 198/0 | Mathlib.lean,Mathlib/Tactic/Simproc/PolynomialDegree.lean,MathlibTest/polynomial_degree_simproc.lean | 3 | 19 | ['5hv5hvnk', 'YaelDillies', 'adomani', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 297 days ago | 4 minutes |
| 26391 | grunweg | feat: immersed submanifolds | Still under construction --- - [ ] depends on: #26087 - [ ] depends on: #23040 Better version of #24549. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 1418/0 | Mathlib.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Splits.lean,Mathlib/Geometry/Manifold/EmbeddedSubmanifold.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/MSplits.lean | 5 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 31020 | grunweg | feat: mfderiv of Sum.inl and Sum.inr | Nothing to see yet: waiting on the cache, then I will state the sorries and Newell Jansen has expressed interest in trying to prove this. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 64/0 | Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean | 1 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 185 days ago | 1 second |
| 31340 | kim-em | feat: helper script to summarize CI errors | --- [](https://gitpod.io/from-referrer/) | CI | 235/0 | scripts/README.md,scripts/failing_ci.py | 2 | 1 | ['github-actions'] | nobody | 5 months ago | unknown | 0 seconds |
| 25775 | emilyriehl | feat(AlgebraicTopology/SimplicialSet/NerveAdjunction): to Strict Segal 2 | Under a suitable hypothesis, a map of 2-truncated simplicial sets can be generated from a refl prefunctor between the underlying reflexive quivers --- provided the codomain is `StrictSegal`. This abstracts a previously formalized result that requires the codomain to be the 2-truncated nerve of a category. Co-authored-by: Aaron Liu --- The current draft displays the old code for comparison with new versions labeled ALT. After initial review this will be cut. [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #23848.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/23848* | t-algebraic-topology t-category-theory merge-conflict awaiting-author infinity-cosmos | 421/206 | Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/SimplicialSet/HomotopyCat.lean,Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean,Mathlib/AlgebraicTopology/SimplicialSet/StrictSegal.lean,Mathlib/CategoryTheory/ComposableArrows.lean,Mathlib/CategoryTheory/EqToHom.lean | 7 | 38 | ['emilyriehl', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | robin-carlier | 5 months ago | 254 days ago | 17 days |
| 14752 | AntoineChambert-Loir | fix(Topology/Algebra/Valued): repair definition of Valued | Following a [discussion on Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Question.20about.20.60Valued.2Eis_topological_valuation.60), we modify the definition of the field `is_topological_valuation` of `Valued` insisting that the element $\gamma$ showing up there is in the subgroup generated by the image of the valuation map. Co-authored-by: @faenuccio - [x] depends on: #25496 | merge-conflict WIP t-topology t-algebra | 1166/301 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/NumberTheory/NumberField/FinitePlaces.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/UniformSpace/AbstractCompletion.lean,docs/references.bib | 12 | 28 | ['AntoineChambert-Loir', 'faenuccio', 'github-actions', 'jcommelin', 'kbuzzard', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'riccardobrasca'] | nobody | 5 months ago | 330 days ago | 1 day |
| 26827 | pechersky | feat(Analysis/Normed/ValuativeRel): helper instance for NormedField | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26713 - [x] depends on: #26826 | merge-conflict t-algebra t-number-theory t-analysis | 211/27 | Mathlib.lean,Mathlib/Analysis/Normed/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 3 | 34 | ['ADedecker', 'adamtopaz', 'erdOne', 'github-actions', 'kbuzzard', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | kbuzzard | 5 months ago | 170 days ago | 122 days |
| 30150 | imbrem | feat(CategoryTheory/Monoidal): to_additive for MonoidalCategory | Add `AddMonoidalCategory`, the additive version of `MonoidalCategory`. To get this to work, I needed to _remove_ the `to_additive` attributes in `Discrete.lean`, since existing code relies on the `AddMonoid M → MonoidalCategory M` instance. For now, we simply implement the additive variants by hand instead. --- As discussed in #28718; I added an `AddMonoidalCategory` struct and tagged `MonoidalCategory` with `to_additive`, along with the lemmas in `Category.lean`. I think this is the right approach, since under this framework the "correct" additive version of `Discrete.lean` would be mapping an `AddMonoid` to an `AddMonoidalCategory`. Next steps would be to: - Make `monoidal_coherence` and `coherence` support `AddMonoidalCategory` - Add `CocartesianMonoidalCategory` extending `AddMonoidalCategory` [](https://gitpod.io/from-referrer/) | t-category-theory large-import new-contributor merge-conflict awaiting-zulip t-meta | 444/125 | Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 3 | 22 | ['JovanGerb', 'YaelDillies', 'github-actions', 'imbrem', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 209 days ago | 1 day |
| 27135 | JovanGerb | feat: `gconvert` tactic | The `gconvert` tactic calls `gcongr` internally, and it can be used as replacement/generalization of `peel`. One drawback is that `peel` can unfold definitions until they are a binder, while `gconvert` cannot, but I think this is acceptable. TODO: replace all uses of `peel` with either `gconvert` or `congr!` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 320/17 | Mathlib/Tactic/GCongr/Core.lean,MathlibTest/GConvert.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 291 days ago | 5 seconds |
| 25765 | JovanGerb | feat(gcongr): lemma for rewriting inside divisibility | TODO: add test to show that we can rewrite using `a ≡ b [ZMOD n]` inside `n ∣ 2 * a + 1`. edit: it's not yet entirely clear if this is the right thing to do. edit: This lemma should be written using iff (or =), so that we can use it specifically when rewriting with a symmetric relation. Supporting equality in `gcongr` is still work in progress. --- [](https://gitpod.io/from-referrer/) | delegated t-data | 5/0 | Mathlib/Data/Int/ModEq.lean | 1 | 3 | ['fpvandoorn', 'github-actions', 'mathlib-bors'] | nobody | 5 months ago | 322 days ago | 1 day |
| 30978 | dagurtomas | Draft: adic spaces | --- This is work in progress, mostly ported from the perfectoid project [](https://gitpod.io/from-referrer/) | merge-conflict large-import | 1407/45 | Mathlib.lean,Mathlib/AdicSpace/AdicSpace.lean,Mathlib/AdicSpace/HuberPair.lean,Mathlib/AdicSpace/Spa/RationalOpenData.lean,Mathlib/AdicSpace/Spa/StalkValuation.lean,Mathlib/AdicSpace/Spa/StructurePresheaf.lean,Mathlib/AdicSpace/Spv.lean,Mathlib/Topology/Category/TopCommRingCat.lean | 8 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 186 days ago | 12 seconds |
| 30824 | grunweg | wip: another smoothness lemma for local frames | --- Can I prove in general that the coefficients of a smooth section w.r.t. a smooth local frame are smooth? This is certainly true for orthonormal frames... [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry | 57/9 | Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean | 1 | 3 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 190 days ago | 6 seconds |
| 30770 | robertmaxton42 | (WIP) Limits and Colimits in Quiv | WIP PR for the oleans --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 3652/31 | Mathlib.lean,Mathlib/CategoryTheory/Category/Quiv.lean,Mathlib/CategoryTheory/Category/Quiv/AsFunctor/Defs.lean,Mathlib/CategoryTheory/Category/Quiv/Colimits.lean,Mathlib/CategoryTheory/Category/Quiv/Limits.lean,Mathlib/CategoryTheory/Category/Quiv/Shapes.lean,Mathlib/CategoryTheory/Category/Quiv/WalkingQuiver.lean,Mathlib/CategoryTheory/EqToHom.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/Filtered/Level.lean,Mathlib/CategoryTheory/Limits/Constructions/LimitsOfProductsAndEqualizers.lean,Mathlib/CategoryTheory/Limits/FunctorCategory/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/FunctorToTypes.lean,Mathlib/CategoryTheory/Limits/Types/Colimits.lean,Mathlib/CategoryTheory/ObjectProperty/FullSubcategory.lean,Mathlib/CategoryTheory/Topos/Classifier.lean,Mathlib/CategoryTheory/Topos/Presheaf.lean,Mathlib/Combinatorics/Quiver/Shapes.lean,Mathlib/Combinatorics/Quiver/WalkingQuiver.lean,Mathlib/Data/ULift.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Logic/Equiv/Sum.lean,Mathlib/Logic/Small/Defs.lean | 23 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 31593 | Ruben-VandeVelde | feat: some lemmas about MonoidAlgebra | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 26/0 | Mathlib/Algebra/MonoidAlgebra/Basic.lean | 1 | 5 | ['github-actions', 'mathlib4-merge-conflict-bot', 'robin-carlier', 'themathqueen'] | nobody | 5 months ago | 168 days ago | 23 hours |
| 26885 | pechersky | feat(Topology/ValuativeRel): ValuativeTopology 𝒪[K] | and even when not a field, `ValuativeRel 𝒪[K]` This is an example of something achievable with the new declarations that wasn't possible with Valued Such that we can discuss the valuations on the subring without always using coercions But to achieve this, one needs some juggling of the value groups --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26834 - [ ] depends on : #30135 | t-algebra t-number-theory t-topology | 66/0 | Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 1 | 10 | ['erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | alreadydone | 5 months ago | 165 days ago | 131 days |
| 15651 | TpmKranz | feat(Computability/NFA): operations for Thompson's construction | Lays the groundwork for a proof of equivalence of RE and NFA, w.r.t. described language. Actual connection to REs comes later, after the groundwork for the opposite direction has been laid. Third chunk of #12648 --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 307/5 | Mathlib/Computability/NFA.lean | 1 | 27 | ['TpmKranz', 'YaelDillies', 'dupuisf', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 5 months ago | 584 days ago | 45 days |
| 12032 | mcdoll | feat: delta distribution as a limit | --- - [ ] depends on: #11496 [](https://gitpod.io/from-referrer/) | WIP t-analysis | 58/0 | Mathlib/Analysis/Distribution/DiracDelta.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 752 days ago | 1 second |
| 9693 | madvorak | feat: Linear programming in the standard form | --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) - [x] depends on: #9652 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 86/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/LinearProgramming.lean | 2 | 15 | ['apurvanakade', 'github-actions', 'leanprover-community-mathlib4-bot', 'madvorak', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 667 days ago | 168 days |
| 27392 | Paul-Lez | feat(Tactic/SimpUtils): add simproc finding commands | This PR adds some commands to allow users to find simprocs/dsimprocs/simp theorems that match on a given pattern. Thanks to Robin Arnez for telling me about `simprocDeclExt` :) --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict file-removed awaiting-author t-meta | 210277/112616 | .github/PULL_REQUEST_TEMPLATE.md,.github/actionlint.yml,.github/build.in.yml,.github/workflows/PR_summary.yml,.github/workflows/actionlint.yml,.github/workflows/add_label_from_diff.yaml,.github/workflows/auto_assign_reviewers.yaml,.github/workflows/bench_summary_comment.yml,.github/workflows/bors.yml,.github/workflows/bot_fix_style.yaml,.github/workflows/build.yml,.github/workflows/build_fork.yml,.github/workflows/daily.yml,.github/workflows/discover-lean-pr-testing.yml,.github/workflows/docker_build.yml,.github/workflows/label_new_contributor.yml,.github/workflows/latest_import.yml,.github/workflows/lint_and_suggest_pr.yml,.github/workflows/long_file_report.yml,.github/workflows/maintainer_bors.yml,.github/workflows/maintainer_bors_wf_run.yml,.github/workflows/maintainer_merge.yml,.github/workflows/maintainer_merge_wf_run.yml,.github/workflows/mk_build_yml.sh,.github/workflows/nightly-docgen.yml,.github/workflows/nightly-regression-report.yml,.github/workflows/nightly_bump_toolchain.yml,.github/workflows/nightly_detect_failure.yml,.github/workflows/nightly_merge_master.yml,.github/workflows/nolints.yml,.github/workflows/pre-commit.yml,.github/workflows/remove_deprecated_decls.yml,.github/workflows/stale.yml,.github/workflows/technical_debt_metrics.yml,.github/workflows/update_dependencies.yml,.github/workflows/update_dependencies_zulip.yml,.github/workflows/weekly-lints.yml,.github/workflows/zulip_emoji_closed_pr.yaml,.github/workflows/zulip_emoji_labelling.yaml,.github/workflows/zulip_emoji_merge_delegate.yaml,.pre-commit-config.yaml,Archive.lean,Archive/Arithcc.lean,Archive/Examples/Eisenstein.lean,Archive/Examples/IfNormalization/Result.lean,Archive/Examples/IfNormalization/Statement.lean,Archive/Examples/IfNormalization/WithoutAesop.lean,Archive/Examples/Kuratowski.lean,Archive/Examples/MersennePrimes.lean,Archive/Imo/Imo1959Q2.lean,Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1961Q3.lean,Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1962Q4.lean,Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo1975Q1.lean,Archive/Imo/Imo1981Q3.lean,Archive/Imo/Imo1982Q1.lean,Archive/Imo/Imo1982Q3.lean,Archive/Imo/Imo1987Q1.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1997Q3.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2001Q3.lean,Archive/Imo/Imo2001Q4.lean,Archive/Imo/Imo2001Q5.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2005Q4.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q3.lean,Archive/Imo/Imo2013Q1.lean,Archive/Imo/Imo2013Q5.lean,Archive/Imo/Imo2015Q6.lean,Archive/Imo/Imo2019Q2.lean,Archive/Imo/Imo2021Q1.lean,Archive/Imo/Imo2024Q1.lean,Archive/Imo/Imo2024Q3.lean,Archive/Imo/Imo2024Q5.lean,Archive/Imo/Imo2024Q6.lean,Archive/Imo/README.md,Archive/Kuratowski.lean,Archive/MiuLanguage/DecisionSuf.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/AscendingDescendingSequences.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/HeronsFormula.lean,Archive/Wiedijk100Theorems/InverseTriangleSum.lean,Archive/Wiedijk100Theorems/Partition.lean,Archive/Wiedijk100Theorems/PerfectNumbers.lean,Archive/Wiedijk100Theorems/SolutionOfCubicQuartic.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Cache/IO.lean,Cache/Main.lean | 5782 | 14 | ['Paul-Lez', 'Vierkantor', 'eric-wieser', 'github-actions', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 281 days ago | 1 hour |
| 15649 | TpmKranz | feat(Computability): introduce Generalised NFA as bridge to Regular Expression | Lays the groundwork for a proof of equivalence of NFA and RE, w.r.t. described language. Actual connection to NFA comes later, after the groundwork for the opposite direction has been laid. Second chunk of #12648 --- - [x] depends on: #15647 [Data.FinEnum.Option unchanged since then] [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 298/0 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/RegularExpressions.lean,docs/references.bib | 5 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'trivial1711'] | nobody | 5 months ago | 509 days ago | 23 days |
| 4786 | thorimur | feat: AppBuilder utils | This supplements `Lean.Meta.AppBuilder`, introducing variants of `mkAppN` and `mkAppM` which allow for more fine-grained management of existing and created metavariables. [Description pending] --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 205/0 | Mathlib.lean,Mathlib/Lean/Meta/AppBuilder.lean | 2 | 1 | ['mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 5745 | alexjbest | feat: a tactic to consume type annotations, and make constructor nicer | During the copenhagen masterclass I found some situations where applying the constructor tactic left the goal in a difficult to read state when autoParams were present. We add a simple tactic to clean these up, and a macro for `constructor` to behave more like the constructor notation and do this automatically (constructor is in core) It seems that these things should be cleaned up by simp, but a simp lemma to remove these annotations is not accepted by lean as the types are too similar. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 41/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Consume.lean,test/consume.lean | 4 | 5 | ['alexjbest', 'digama0', 'kim-em', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 978 days ago | 51 days |
| 5863 | eric-wieser | feat: add elaborators for concrete matrices | --- - [x] depends on: #5866 - [ ] depends on: #5897 [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted blocked-by-other-PR t-meta | 257/7 | Mathlib/Control/Monad/Cont.lean,Mathlib/Data/Matrix/Auto.lean,MathlibTest/matrix_auto.lean | 3 | 8 | ['eric-wieser', 'github-actions', 'kim-em', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 1023 days ago | 1 second |
| 5919 | MithicSpirit | feat: implement orthogonality for AffineSubspace | Define `AffineSubspace.orthogonal` and `AffineSubspace.IsOrtho`, as well as develop an API emulating that of `Submodule.orthogonal` and `Submodule.IsOrtho`, respectively. Additionally, provide some relevant lemmas exclusive to affine subspaces, which are mostly to do with the relationship between orthogonality and `AffineSubspace.Parallel`. Closes #5539 --- Still WIP as I need to add more docstrings as well as notations for the new definitions. [](https://gitpod.io/from-referrer/) | WIP new-contributor merge-conflict help-wanted t-analysis | 287/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/AffineSubspace.lean | 2 | 7 | ['MithicSpirit', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | MithicSpirit | 5 months ago | 846 days ago | 7 minutes |
| 7386 | madvorak | feat: Define linear programs | Linear programs over a general `Module` with constraints given in the form "aᵀx - b ≥ 0" and the objective function as an `AffineMap` to be minimized. --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 87/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearProgramming.lean | 2 | 64 | ['Shreyas4991', 'YaelDillies', 'eric-wieser', 'github-actions', 'kim-em', 'madvorak', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 667 days ago | 232 days |
| 7890 | grhkm21 | feat(Mathlib/Tactic/Setm): implement setm tactic | This is my first time doing metaprogramming in Lean 4, please provide feedback when you have them :)
The `setm` tactic, which stands for `set` + matching, matches a given expression with the goal and introduces new local hypotheses for the named holes specified. One of the best usage is for rearrangement proofs. As a simple example,
```lean
example : (1 + 1) + (4 * 3) - (1 + 1) = (3 * 4 : Rat) := by
setm ?A + ?B - ?A = (?C : Rat)
rw [show ∀ A B, A + B - A = B by intro A B ; ring_nf ]
apply Rat.mul_comm
```
One can imagine replacing the three term expression with a 7 term algebraic expression.
This was developed with tons of help from [Zulip](https://leanprover.zulipchat.com/#narrow/stream/239415-metaprogramming-.2F-tactics/topic/Help.20with.20writing.20tactic), especially from Thomas. Thanks!
TODO:
- [X] Support `setm ... at ...` syntax, see *example 1* below
- [X] Write docs
- [ ] Use `withNewMCtxDepth`
- [X] Rename the intermediate `MVar`s, see *example 2* below
- [ ] Use `elabTermWithHolesPostponing` in conjunction with `Term.synthesizeSyntheticMVarsNoPostPoning` after `isDefEq` to handle instances
Example 1:
```lean
/- Usage with `using` and `at` keywords -/
example (h1 : 1 + 1 = 3) (h2 : 1 + 3 = 5) (h3 : 2 + 2 = 5) : true := by
setm ?A + _ = (?B : Nat) using h2 at h1 h2 h3
guard_hyp A := 1
guard_hyp B := 5
guard_hyp h1 : A + A = 3
guard_hyp h2 : A + 3 = B
guard_hyp h3 : 2 + 2 = B
trivial
```
Example 2:
```lean
/- Test reusing named holes -/
example (h : b + a = c) : a + b = c := by
/- setm 1-/
setm ?A + ?B = (_ : Nat)
guard_hyp A := a
guard_hyp B := b
/- clean up -/
unfold_let A B
clear hA hB A B
/- setm 2 -/
rewrite [Nat.add_comm]
setm ?A + ?B = (_ : Nat) at h ⊢
guard_hyp A := b
guard_hyp B := a
exact h
```
Co-authored-by: Jireh Loreaux |
merge-conflict t-meta | 141/0 | Mathlib.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/Setm.lean,test/Setm.lean | 4 | 4 | ['mathlib4-merge-conflict-bot', 'thorimur'] | nobody | 5 months ago | 920 days ago | 1 minute |
| 9352 | chenyili0818 | feat: arithmetic lemmas for `gradient` | This file is based on Mathlib.Analysis.Calculus.Gradient.Basic, and describes the calculation properties Co-authored-by: Ziyu Wang [tropicalfish910@gmail.com](mailto:tropicalfish910@gmail.com) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 404/0 | Mathlib.lean,Mathlib/Analysis/Calculus/Gradient/Lemmas.lean | 2 | 31 | ['chenyili0818', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot', 'sgouezel', 'winstonyin'] | nobody | 5 months ago | 801 days ago | 52 days |
| 9795 | sinhp | feat: the type `Fib` of fibre of a function at a point | This is the most basic file of the theory of fibred categories developed here: https://github.com/sinhp/LeanFibredCategories/tree/master --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 74/0 | Mathlib.lean,Mathlib/Data/Fiber.lean | 2 | 18 | ['adri326', 'joelriou', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 5 months ago | 833 days ago | 2 days |
| 10660 | eric-wieser | feat(LinearAlgebra/CliffordAlgebra): construction from a basis | This is adapted from https://github.com/eric-wieser/lftcm2023-clifford_algebra, which only worked for the special case of `Q = 0`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-algebra | 573/0 | Mathlib.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Basis.lean | 2 | 16 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 10977 | grunweg | feat: germs of smooth functions | Define the space of germs of smooth functions (between manifolds). Endow it with a ring structure if the target manifold is a smooth ring (e.g., a Lie group or a field). From the sphere eversion project, rewritten by me. Co-authored-by: Patrick Massot ------- Particular questions for review - is the authorship/copyright information appropriate? (`PatrickMassot` created the file `SmoothGerm` which I adapted; I didn't trace this far back through sphere-eversion.) - is providing all the intermediate algebraic structures (such as, an additive subgroup) on the space of smooth germs useful in practice? (The sphere eversion project only needs a ring structure.) - any further particular API lemmas (e.g., around coercions) which would be good to add? --- [](https://gitpod.io/from-referrer/) | t-differential-geometry merge-conflict awaiting-author t-topology t-analysis | 150/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Algebra/SmoothGerm.lean | 2 | 34 | ['YaelDillies', 'github-actions', 'grunweg', 'jcommelin', 'kim-em', 'mathlib4-merge-conflict-bot', 'mcdoll'] | fpvandoorn | 5 months ago | 612 days ago | 144 days |
| 10998 | hmonroe | feat(Logic): Arithmetization of partial recursive functions (toward Gödel's first incompleteness theorem) | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 364/0 | Mathlib.lean,Mathlib/Logic/Godel/PartArith.lean | 2 | 4 | ['Ruben-VandeVelde', 'YaelDillies', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 694 days ago | 99 days |
| 11890 | adomani | feat: the terminal refine linter | A linter that warns on usages of `refine` and `refine'` as a finishing tactic. See this [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Usage.20of.20refine'). ### Conclusion of the experiment Systematic replacements of terminal `refine` with `exact` leads to an overall slow-down. --- - [ ] depends on: #15616 (disable the linter in downstream projects) [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 77/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/TerminalRefineLinter.lean | 3 | 15 | ['adomani', 'github-actions', 'grunweg', 'joneugster', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 5 months ago | 625 days ago | 18 days |
| 11991 | adomani | draft: syntax data linter | A linter that prints `SyntaxNodeKind`s and `Range`s for all the nodes of a command. See this [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/217875-Is-there-code-for-X.3F/topic/undocumented.20things). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 152/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/SyntaxDataLinter.lean | 3 | 1 | ['mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 12006 | adomani | feat: the `suffa` tactic | The `suffa` tactic. `suffa tac` runs the tactic sequence `tac` and returns a `Try this:` suggestion of the form `suffices [target_after_tac] by tac; assumption`. For example ```lean example {m n : Nat} (h : m = n) : 0 + m = n := by suffa rewrite [Nat.zero_add] assumption ``` suggests the replacement ```lean example {m n : Nat} (h : m = n) : 0 + m = n := by suffices m = n by rewrite [Nat.zero_add] assumption assumption ``` See [this thread](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Try.20this.3A.20suffices.20simpa) as well as [this message](https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.2311822.20flexible.20tactics.20linter/near/431895664). --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 161/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Suffa.lean,test/Suffa.lean | 4 | 4 | ['MoritzBeroRoos', 'YaelDillies', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 694 days ago | 59 days |
| 13442 | dignissimus | feat: mabel tactic for multiplicative abelian groups | Mabel tactic for multiplicative abelian groups (#10361) --- [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict modifies-tactic-syntax awaiting-author help-wanted t-meta | 439/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MAbel.lean,MathlibTest/mabel.lean | 4 | 11 | ['BoltonBailey', 'dignissimus', 'github-actions', 'joneugster', 'kbuzzard', 'mathlib4-merge-conflict-bot'] | joneugster | 5 months ago | 613 days ago | 16 seconds |
| 14237 | js2357 | feat: Define the localization of a fractional ideal at a prime ideal | Define the localization of a fractional ideal at a prime ideal, and prove some basic properties. --- This PR is part 3 out of 4 of a proof of `isDedekindDomain_iff_isDedekindDomainDvr`. Part 4 is available here: #14242 - [x] depends on: #14099 Part 1 - [x] depends on: #14216 Part 2 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 230/0 | Mathlib.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean,Mathlib/RingTheory/Localization/Basic.lean | 3 | 22 | ['Vierkantor', 'YaelDillies', 'github-actions', 'js2357', 'kbuzzard', 'leanprover-community-bot-assistant', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | Vierkantor | 5 months ago | 584 days ago | 26 days |
| 14345 | digama0 | feat: the Dialectica category is monoidal closed | - [x] depends on: #14274 The monoidal closed structure of the Dialectica category. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 252/0 | Mathlib.lean,Mathlib/CategoryTheory/Dialectica/Closed.lean | 2 | 4 | ['github-actions', 'kim-em', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 655 days ago | 12 days |
| 14727 | jjaassoonn | feat(RingTheory/Flat/CategoryTheory): a flat module has vanishing higher Tor groups | [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 37/1 | Mathlib/RingTheory/Flat/CategoryTheory.lean | 1 | 4 | ['github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 652 days ago | 3 days |
| 14733 | jjaassoonn | feat(RingTheory/Flat/CategoryTheory): a module is flat iff tensoring preserves finite limits | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 99/1 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/RightExact.lean,Mathlib/RingTheory/Flat/CategoryTheory.lean | 4 | 3 | ['github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 650 days ago | 6 days |
| 15055 | sinhp | feat: the category of pointed objects of a concrete category | This file defines the category of pointed objects of a concrete category. After this we will have the categories of pointed groups, pointed abelian groups, pointed groupoids, etc. To define `Pointed.functor`, we need to add the following "pullback" construction to the category of elements. ``` @[simps obj map] def pullback (F : D ⥤ Type w) (G : C ⥤ D) : (G ⋙ F).Elements ⥤ F.Elements where obj X := ⟨G.obj X.1, X.2⟩ map {X Y} f := ⟨G.map f.1, f.2⟩ ``` This is called pullback since the display map of `G ⋙ F` (i.e. `π (G ⋙ F)`) is a pullback of the display map of `F`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 185/0 | Mathlib.lean,Mathlib/CategoryTheory/ConcreteCategory/Pointed.lean,Mathlib/CategoryTheory/Elements.lean | 3 | 14 | ['dagurtomas', 'github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 639 days ago | 7 days |
| 15224 | AnthonyBordg | feat(CategoryTheory/Sites): covering families and their associated Grothendieck topology | Define covering families on a category and their associated Grothendieck topology by using the API for `Coverage`. Give an explicit characterization of the covering sieves of the said topology. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 112/0 | Mathlib.lean,Mathlib/CategoryTheory/Sites/CoveringFamilies.lean | 2 | 21 | ['AnthonyBordg', 'adamtopaz', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 639 days ago | 1 day |
| 15453 | tomaz1502 | Track formalization of runtime complexity | I finished porting https://github.com/leanprover-community/mathlib3/pull/14494/ to Lean 4 and made several small PRs, as suggested. This meta PR is used to track the progress of the smaller PRs. ## Pending PRs - [Formalization of List.insertionSort](https://github.com/leanprover-community/mathlib4/pull/15449) - [Lemmas about Split](https://github.com/leanprover-community/mathlib4/pull/15450) - [Formalization of List.merge](https://github.com/leanprover-community/mathlib4/pull/15451) - [Formalization of List.mergeSort](https://github.com/leanprover-community/mathlib4/pull/15452) --- [](https://gitpod.io/from-referrer/) | merge-conflict | 525/0 | Mathlib.lean,Mathlib/Computability/Timed/InsertionSort.lean,Mathlib/Computability/Timed/Merge.lean,Mathlib/Computability/Timed/MergeSort.lean,Mathlib/Computability/Timed/Split.lean | 5 | 5 | ['joneugster', 'mathlib4-merge-conflict-bot', 'mergify'] | nobody | 5 months ago | 625 days ago | 11 days |
| 16303 | grunweg | feat(CI): check for badly formatted titles or missing/contradictory labels | --- The zulip workflow is entirely cargo-culted from #16296; please review carefully. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 325/0 | .github/build.in.yml,Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/ValidatePRTitle.lean,MathlibTest/ValidatePRTitle.lean,lakefile.lean,scripts/README.md,scripts/check-title-labels.lean | 8 | 45 | ['Command-Master', 'adomani', 'bryangingechen', 'edegeltje', 'github-actions', 'grunweg', 'joneugster', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | bryangingechen | 5 months ago | 481 days ago | 78 days |
| 17587 | kmill | feat: Sym2-as-Finset theory | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 105/3 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/RingTheory/Polynomial/Vieta.lean | 4 | 11 | ['FordUniver', 'YaelDillies', 'github-actions', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 18236 | joelriou | feat(Algebra/Category/ModuleCat/Presheaf): the endofunctor of presheaves of modules induced by an oplax natural transformation | An endomorphism of ` ModuleCat.restrictScalarsPseudofunctor`, i.e. a "compatible" family of functors `ModuleCat A ⥤ ModuleCat A` for all (commutative) rings `A` induces a functor `PresheafOfModules R ⥤ PresheafOfModules R` for any presheaf of (commutative) rings `R`. In #18262, this is applied to the construction of exterior powers of a presheaves of modules. --- - [x] depends on: #18197 [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory awaiting-CI merge-conflict awaiting-author | 180/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/FunctorOfNatTrans.lean | 2 | 6 | ['github-actions', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 18630 | tomaz1502 | feat(Computability.Timed): Formalization of runtime complexity of List.mergeSort | This PR adds the formalization of the runtime complexity of the merge sort algorithm, defined in `Data/List/Sort`. Requires: https://github.com/leanprover-community/mathlib4/pull/15451 References: - Previous PR on mathlib3: https://github.com/leanprover-community/mathlib3/pull/14494/ - First discussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/BSc.20Final.20Project/near/220647062 - Second disussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Formalization.20of.20Runtime.20Complexity.20of.20Sorting.20Algorithms/near/284184450 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability new-contributor | 526/0 | Mathlib.lean,Mathlib/Computability/Timed/InsertionSort.lean,Mathlib/Computability/Timed/Merge.lean,Mathlib/Computability/Timed/MergeSort.lean,Mathlib/Computability/Timed/Split.lean | 5 | 9 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 542 days ago | 21 hours |
| 18749 | GabinKolly | feat(ModelTheory): preparatory work for the existence of Fraïsse limits | Define the map of a PartialEquiv through an embedding, and related properties. Define embeddings and equivalences between equal structures or equal substructures, and related properties. Add miscellaneous lemmas which will be used to prove the existence of fraisse limits. --- This is preparation for #18876 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 308/5 | Mathlib/ModelTheory/Bundled.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/FinitelyGenerated.lean,Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/ModelTheory/Substructures.lean | 5 | 10 | ['GabinKolly', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] | nobody | 5 months ago | 466 days ago | 73 days |
| 18876 | GabinKolly | feat(ModelTheory/Fraisse): add proof that Fraïssé limits exist | Fraïssé limits exist. --- All the preparatory work done in other files is contained in the pull request #18749, this pull request adds the work done in ModelTheory/Fraisse, the definition of the sequence of structures whose limit will be the Fraïssé limit, lemmas about this sequence, and then the proof that the limit is indeed a Fraïssé limit. - [ ] depends on: #18749 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-logic | 666/5 | Mathlib/ModelTheory/Bundled.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/FinitelyGenerated.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/ModelTheory/Substructures.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 536 days ago | 37 seconds |
| 19323 | madvorak | feat: Function to Sum decomposition | --- Discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Function.20to.20Sum.20decomposition | merge-conflict WIP t-data | 50/0 | Mathlib.lean,Mathlib/Data/Sum/Decompose.lean | 2 | 3 | ['github-actions', 'madvorak', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 483 days ago | 43 days |
| 19378 | adamtopaz | feat: Explanation widgets | This adds some simple widgets, wrapped in a tactic, term and command elaborator, for displaying markdown explanations in the infoview. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 101/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Widget/Explain.lean | 3 | 9 | ['adamtopaz', 'eric-wieser', 'github-actions', 'joneugster', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 475 days ago | 49 days |
| 19456 | AntoineChambert-Loir | feat(Data/Finsupp/MonomialOrder/DegRevLex): homogeneous reverse lexicographic order | Definition of the homogeneous reverse lexicographic order --- - [x] depends on: #19453 - [x] depends on: #19455 [](https://gitpod.io/from-referrer/) | WIP t-order t-data merge-conflict t-algebraic-geometry | 362/0 | Mathlib.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/Finsupp/MonomialOrder/DegRevLex.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 522 days ago | 27 seconds |
| 19797 | eric-wieser | refactor: use Qq in the nlinarith preprocessor | This also provides the machinery needed to Qq-ify linarith itself. This is still doing far more `synthInstanceQ`/`isDefEq`(`Q`) than should be needed, but at least drops the `mkAppM`s. Currently, this takes a different approach to the one used by `NormNum.Result`: * `NormNum.Result` deliberately avoids adding any `Expr` parameters to types, as this makes defeq problem at compile-time hard * This PR allows the Expr parameters, but adds casting helpers to easily transport along defeq(Q)s. A few `unsafeIntro`s are left, which correspond to either a Qq bug, or a flaw in the idea behind this approach. I don't know if this pattern is an improvement. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta large-import | 260/28 | Mathlib/Data/Ineq.lean,Mathlib/Tactic/Linarith/Datatypes.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Preprocessing.lean,Mathlib/Util/Qq.lean | 5 | 9 | ['eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 20051 | Timeroot | feat: `Clone` and some instances | Defines clones (`Clone`). And there is a file, `Instances.lean`, that gives several most important examples of Clones. In particular, it has all of the clones (in an appropriately general form) that occur in [Post's Lattice](https://en.wikipedia.org/wiki/Post%27s_lattice), and [later proving](https://github.com/leanprover-community/mathlib4/pull/24744) the completeness of Post's Lattice is why I'm making this PR. (Edit: Used to also say "Defined operads (`Operad`), symmetric operads (`SymmOperad`), and clones ... There is a proof that all clones have a natural operad structure.". This has been scrapped.) --- - [x] depends on: #20133 [basics and notations] - [x] depends on: #20134 [permutations] - [x] depends on: #20138 [operad] - [x] depends on: #20141 [clone] - [x] depends on: #23459 [defs] - [ ] depends on: #23460 [basic] [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra blocked-by-other-PR | 623/0 | Mathlib.lean,Mathlib/Algebra/Clone/Basic.lean,Mathlib/Algebra/Clone/Defs.lean,Mathlib/Algebra/Clone/Instances.lean,Mathlib/Data/Fin/Basic.lean | 5 | 33 | ['Timeroot', 'YaelDillies', 'eric-wieser', 'github-actions', 'jcommelin', 'kbuzzard', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'wmacmil'] | nobody | 5 months ago | 497 days ago | 5 minutes |
| 20466 | MohanadAhmed | feat: Sherman Morrison formula for rank 1 update of the matrix inverse | Provides the Sherman Morrison rank 1 update of the matrix inverse https://en.wikipedia.org/wiki/Sherman%E2%80%93Morrison_formula. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 37/0 | Mathlib/Data/Matrix/Invertible.lean | 1 | 5 | ['eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 459 days ago | 23 days |
| 20648 | anthonyde | feat: formalize regular expression -> εNFA | The file `Computability/RegularExpressionsToEpsilonNFA.lean` contains a formal definition of Thompson's method for constructing an `εNFA` from a `RegularExpression` and a proof of its correctness. --- - [x] depends on: #20644 - [x] depends on: #20645 [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-zulip new-contributor | 490/0 | Mathlib.lean,Mathlib/Computability/RegularExpressionsToEpsilonNFA.lean,docs/references.bib | 3 | 7 | ['anthonyde', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'qawbecrdtey'] | nobody | 5 months ago | 360 days ago | 75 days |
| 20649 | GabinKolly | feat(ModelTheory/Graph): prove characterization of the fraisse limit of finite simple graphs | Prove that a countable graph with the extension property must be the Fraisse limit of finite simple graphs. --- [](https://gitpod.io/from-referrer/) | WIP large-import merge-conflict t-combinatorics t-logic | 175/0 | Mathlib/ModelTheory/Graph.lean,Mathlib/ModelTheory/Substructures.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 20652 | jjaassoonn | feat: categorical description of center of a ring | We show the isomorphism between `Z(R)` and `End(1 Mod-R)` --- - [x] depends on:#20721 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-category-theory | 212/21 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/Ring/Center.lean,Mathlib/CategoryTheory/Conj.lean,Mathlib/CategoryTheory/Endomorphism.lean,Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean,Mathlib/CategoryTheory/Preadditive/Basic.lean | 7 | 42 | ['alreadydone', 'github-actions', 'jcommelin', 'jjaassoonn', 'kbuzzard', 'mathlib4-merge-conflict-bot', 'qawbecrdtey'] | nobody | 5 months ago | 451 days ago | 7 days |
| 20924 | tomaz1502 | feat(Computability/QueryComplexity): Oracle-based computation | This PR adds the types and lemmas for oracle-based computation. In this model, computations are run on a monad which also counts the number of oracle queries executed. With it, it becomes possible to reason about the upper bound of the query complexity of algorithms. In the future, we could extend this work to include the necessary bits from information theory and probability to also reason about lower bounds on query complexity, like the work in https://github.com/girving/debate.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2318629.20runtime.20complexity.20of.20sorting.20a.20list
Co-authored-by: Geoffrey Irving |
merge-conflict t-computability | 305/0 | Mathlib.lean,Mathlib/Computability/QueryComplexity/Basic.lean,Mathlib/Computability/QueryComplexity/Defs.lean | 3 | 60 | ['eric-wieser', 'girving', 'github-actions', 'mathlib4-merge-conflict-bot', 'quangvdao', 'tomaz1502'] | nobody | 5 months ago | 432 days ago | 27 days |
| 20956 | tomaz1502 | feat(Computability/QueryComplexity/Sort.lean): Formalization of upper bound of queries for merge sort | This PR builds on top of #20924 to prove that merge sort (as defined in Lean's library) never executes more than `3 * n * ceil_log2 n` comparisons, where `n` is the size of the input list and `ceil_log2` is the ceil of the logarithm in base 2, which is defined in this PR.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2318629.20runtime.20complexity.20of.20sorting.20a.20list
- [ ] depends on: #20924
Co-authored-by: Geoffrey Irving |
merge-conflict t-computability blocked-by-other-PR | 676/0 | Mathlib.lean,Mathlib/Computability/QueryComplexity/Basic.lean,Mathlib/Computability/QueryComplexity/Defs.lean,Mathlib/Computability/QueryComplexity/Sort.lean | 4 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 464 days ago | 41 seconds |
| 21270 | GabinKolly | feat(ModelTheory/Bundled): first-order embeddings and equivalences from equalities | Add first-order embeddings and equivalences from equalities between bundled structures. --- Add two definitions to get embeddings and equivalences from equalities between bundled structures, and simple properties. This is some preparatory work for #18876 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author large-import t-logic | 102/0 | Mathlib/ModelTheory/Bundled.lean | 1 | 27 | ['GabinKolly', 'Vierkantor', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 382 days ago | 50 days |
| 21277 | GabinKolly | feat(ModelTheory/PartialEquiv): Define the mapping of a self-partialEquiv through an embedding | Define the mapping of a self-partialEquiv through an embedding and the notion of fully extendable partialEquiv. --- This is some preparatory work for #18876 - [ ] depends on: #21276 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-logic | 215/5 | Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/ModelTheory/Substructures.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 455 days ago | 11 minutes |
| 21624 | sinhp | feat(CategoryTheory): The (closed) monoidal structure on the product category of families of (closed) monoidal categories | Given a family of closed monoidal categories, we show that the product of these categories is a closed monoidal category with the pointwise monoidal structure. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 144/0 | Mathlib.lean,Mathlib/CategoryTheory/Pi/Basic.lean,Mathlib/CategoryTheory/Pi/Monoidal.lean,Mathlib/CategoryTheory/Pi/MonoidalClosed.lean | 4 | 20 | ['TwoFX', 'YaelDillies', 'b-mehta', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 5 months ago | 388 days ago | 50 days |
| 21829 | Whysoserioushah | feat(LinearAlgebra/TensorProduct/HomTensor): Add TensorProduct of Hom-modules | Co-authored-by: Andrew Yang |
merge-conflict awaiting-author t-algebra | 174/0 | Mathlib.lean,Mathlib/LinearAlgebra/TensorProduct/HomTensor.lean | 2 | 27 | ['Whysoserioushah', 'YaelDillies', 'erdOne', 'github-actions', 'kbuzzard', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 395 days ago | 46 days |
| 21903 | yhtq | feat: add from/toList between `FreeSemigroup` and `List` with relative theorems | Add from/toList between `FreeSemigroup` and `List` with relative theorems, as well as an incidental definition of lexicographic order on `FreeSemigroup`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-CI large-import merge-conflict | 169/0 | Mathlib/Algebra/Free.lean | 1 | 12 | ['YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 390 days ago | 50 days |
| 22159 | shetzl | feat: add definition of pushdown automata | Add the definition of pushdown automata and their two acceptance conditions: acceptance based on empty stack and acceptance based on final state.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 70/0 | Mathlib.lean,Mathlib/Computability/PDA.lean | 2 | 35 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 5 months ago | 410 days ago | 20 days |
| 22194 | eric-wieser | feat: oracle computations (alternative) | This explores a simpler version of #20924 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability | 698/0 | Archive/Examples/SumOracle.lean,Mathlib.lean,Mathlib/Computability/QueryComplexity/Defs.lean,Mathlib/Computability/QueryComplexity/Sort.lean | 4 | 5 | ['eric-wieser', 'girving', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 22231 | pechersky | feat(Algebra/Valued): `AdicExpansion` initial defns | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-topology | 299/0 | Mathlib.lean,Mathlib/Topology/Algebra/Valued/AdicExpansion.lean | 2 | 8 | ['Thmoas-Guan', 'github-actions', 'grunweg', 'jcommelin', 'mathlib4-merge-conflict-bot'] | jcommelin | 5 months ago | 242 days ago | 158 days |
| 22232 | pechersky | feat(Algebra/Valued): `AdicExpansion.apprUpto` | --- - [ ] depends on: #22231 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR | 399/0 | Mathlib.lean,Mathlib/Topology/Algebra/Valued/AdicExpansion.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 431 days ago | 2 minutes |
| 22233 | pechersky | feat(Algebra/Valued): `AdicExpansion.evalAt` | --- - [ ] depends on: #22231 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR | 488/0 | Mathlib.lean,Mathlib/Topology/Algebra/Valued/AdicExpansion.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 431 days ago | 6 minutes |
| 22302 | 658060 | feat: add `CategoryTheory.Topos.Power` | This is a continuation of #21281 with the end goal of defining topoi in Mathlib. It introduces the notion of a power object in a category with a subobject classifier, which is a special case of an internal hom. The definition `HasPowerObjects C` contained in this PR is all that remains before `IsTopos C` can be defined. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 312/0 | Mathlib.lean,Mathlib/CategoryTheory/Topos/Power.lean | 2 | 3 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | b-mehta | 5 months ago | 429 days ago | 25 minutes |
| 22389 | adomani | feat: the variableVariable linter | The motivation comes from [this Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/style.20proposal.3A.20avoid.20.60variable.20.7BX.7D.20.2E.2E.2E.20variable.20.28X.29.60). Summarising, updating a variable binder for a single declaration can be confusing. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter large-import | 167/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/VariableVariable.lean,variableDeclarationVariable_replacements.py | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 22497 | adomani | test: decl diff in lean | Testing branch for #22464. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP CI test-ci | 161/0 | .github/workflows/PR_summary_lean.yml,Mathlib.lean,Mathlib/Test.lean,scripts/README.md,scripts/declarations_diff.lean,scripts/declarations_diff_lean_shell_glue.sh | 6 | 8 | ['github-actions', 'mathlib4-merge-conflict-bot', 'mergify'] | nobody | 5 months ago | unknown | 0 seconds |
| 22662 | plp127 | feat: Localization.Away.lift (computably) | This PR adds `Localization.Away.lift'` and `Localization.Away.lift`, computable alternatives to `Localization.awayLift`. --- - [x] depends on: #24791 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 74/0 | Mathlib/RingTheory/Localization/Away/Basic.lean | 1 | 18 | ['eric-wieser', 'github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | kim-em | 5 months ago | 163 days ago | 257 days |
| 22790 | mhk119 | feat: Extend `taylor_mean_remainder_lagrange` to `x < x_0` | The `taylor_mean_remainder_lagrange` theorem has the assumption that $x_0 < x$. In many applications, we need $x < x_0$ and one cannot use the current version to obtain this (see [zulip](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Taylor's.20theorem)). This PR introduces a set of theorems that push negations through Taylor expansions so that one can extend `taylor_mean_remainder_lagrange` to the case when $x < x_0$. These theorems should also be useful elsewhere since they are quite general. | merge-conflict awaiting-author t-analysis new-contributor | 111/1 | Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/Calculus/Taylor.lean | 3 | 13 | ['Paul-Lez', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'mhk119'] | nobody | 5 months ago | 391 days ago | 23 days |
| 22861 | eric-wieser | feat: add the trace of a bilinear form | Following the steps at [#Is there code for X? > Laplacian @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Laplacian/near/450834505). --- [](https://gitpod.io/from-referrer/) Some questions: * Does this generalize to multilinear maps? * Is there an `RCLike` generalization? * Does this generalize to `BilinMap` instead of just `BilinForm`? Perhaps the approach in [#mathlib4 > Stating Schrodinger's equation @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Stating.20Schrodinger's.20equation/near/500409890) of using `ContinuousLinearMap.adjoint'` is better. | merge-conflict awaiting-author t-algebra | 100/0 | Mathlib.lean,Mathlib/LinearAlgebra/BilinearForm/Trace.lean | 2 | 4 | ['github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 392 days ago | 23 days |
| 22919 | plp127 | feat(Data/Fintype/Pi): Make `Fintype` instance for `RelHom`s computable | Makes the `Fintype` instance for rel homs computable. See this [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Classical.20vs.20constructive.20logic.20in.20computation/near/496220816) message. --- - [x] depends on: #24748 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 178/44 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Data/Fintype/CardEmbedding.lean,Mathlib/Data/Fintype/Pi.lean | 5 | 31 | ['IvanRenison', 'b-mehta', 'eric-wieser', 'fpvandoorn', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127'] | b-mehta | 5 months ago | 337 days ago | 71 days |
| 22954 | eric-wieser | feat(RingTheory/Congruence/Hom): copy from GroupTheory | This was motivated in review of #22355, but I no longer recall why. It also helps with #29357. Either way, this captures a definition that was inlined in a later file. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 214/16 | Mathlib/Algebra/RingQuot.lean,Mathlib/GroupTheory/Congruence/Hom.lean,Mathlib/RingTheory/Congruence/Defs.lean,Mathlib/RingTheory/Congruence/Hom.lean,Mathlib/RingTheory/TwoSidedIdeal/Kernel.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 238 days ago | 1 hour |
| 23285 | AntoineChambert-Loir | refactor: directed systems in terms of functors | This is a WIP aiming to refactor the work on directed systems using the category theory library. But there are universes nightmares. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory large-import merge-conflict | 111/45 | Mathlib/Order/DirectedInverseSystem.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 402 days ago | 21 seconds |
| 23460 | Timeroot | feat: Definition of `Clone` | Basics about Clones. Part of #20051 --- - [ ] depends on: #26329 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 326/0 | Mathlib.lean,Mathlib/Algebra/Clone/Basic.lean,Mathlib/Algebra/Clone/Defs.lean,Mathlib/Data/Fin/Basic.lean | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 246 days ago | 65 days |
| 23503 | apnelson1 | feat(Topology/Instances/ENat): ENat and tsum | We give API for the interactions between `tsum` and `ENat`. The type is especially nice, because every function is summable, and there are simplifying lemmas like the statement that a sum is infinite iff either some term is infinite, or the support is infinite. This provides one of the missing pieces for working painlessly with discrete objects, 'propositional' finiteness and cardinality. For instance, one can sum a function `f : a -> ENat` over an arbitrary set with the term `∑' a : s, 1`, and it will be provable that `∑' a : s, 1 = s.encard` and `(support f).encard ≤ ∑' a, f a` without ever having to split into finite/infinite cases. As is pointed out in the module docstring for `Data.ENat`, there are strong analogies between `ENat` and `ENNReal`, and the API runs parallel to the API for `tsum`/`ENNReal`. One could call it 'duplication', but I have yet to find a common generalization of the two that saves work, or a third example of a natural type with these same properties. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology large-import | 205/2 | Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Set/Card.lean,Mathlib/Topology/Instances/ENat.lean | 3 | 3 | ['eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 381 days ago | 14 days |
| 23585 | plp127 | feat: `Filter.atMax` and `Filter.atMin` | Adds `atMax` and `atMin`, filters. Making an analogy, `atMax` : `atTop` :: `IsMax` : `IsTop`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 148/0 | Mathlib.lean,Mathlib/Order/Filter/AtMaxMin.lean | 2 | 5 | ['github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'urkud'] | nobody | 5 months ago | unknown | 0 seconds |
| 23758 | erdOne | feat(Topology/Algebra): linearly topologized iff non-archimedean | ...for topological modules over compact rings or `ℤ`-finite rings --- [](https://gitpod.io/from-referrer/) | t-algebra large-import merge-conflict awaiting-author t-topology | 138/3 | Mathlib/LinearAlgebra/Span/Basic.lean,Mathlib/Topology/Algebra/LinearTopology.lean | 2 | 22 | ['ADedecker', 'AntoineChambert-Loir', 'erdOne', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | ADedecker and AntoineChambert-Loir | 5 months ago | 264 days ago | 124 days |
| 24161 | urkud | feat(Analysis/Calculus/Schwarzian): new file | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 190/3 | Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Calculus/Schwarzian/Basic.lean | 3 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 24333 | xcloudyunx | feat(Combinatorics/SimpleGraph): cycle graph implementation for generic vertex types | The existing `cycleGraph` implementation under Combinatorics/SimpleGraph/Circulant.lean only operates over `Fin n`. This PR implements a cycle graph implementation over any generic vertex type. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics new-contributor | 187/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Cycle.lean | 2 | 42 | ['IvanRenison', 'github-actions', 'mathlib4-merge-conflict-bot', 'vlad902'] | kmill | 5 months ago | 249 days ago | 123 days |
| 24540 | robertmaxton42 | feat(Quiv): add the empty, vertex, point, interval, and walking quivers | Add: * The empty quiver * The vertex quiver (one vertex, and no edges) and the point quiver (one vertex, one self-edge) * The interval quiver (two vertices with an edge between them) * The walking quiver (vertices `0` and `1` with two edges both `0 -> 1`. Functors from the walking quiver to `Type` define quivers, by interpreting `F.obj 0` as the type of vertices, `F.obj 1` as the type of edges, using one of the two edges to label the source of every edge and using the other to label the target.) - [x] depends on: #24538 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 370/0 | Mathlib.lean,Mathlib/CategoryTheory/Category/Quiv/Shapes.lean,Mathlib/CategoryTheory/Category/Quiv/WalkingQuiver.lean,Mathlib/Logic/Small/Defs.lean | 4 | 14 | ['github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robertmaxton42', 'robin-carlier'] | nobody | 5 months ago | 329 days ago | 5 hours |
| 24744 | Timeroot | Post's lattice | Draft PR for now so I can get CI checks. Eventually want to prove Post's Lattice --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 758/0 | Mathlib.lean,Mathlib/Algebra/Clone/Basic.lean,Mathlib/Algebra/Clone/Defs.lean,Mathlib/Algebra/Clone/Instances.lean,Mathlib/Algebra/Clone/PostLattice.lean,Mathlib/Data/Fin/Basic.lean | 6 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 24850 | pechersky | feat(Topology/UniformSpace/Ultra): uniform spaces induced by pseudometrics are ultra if system is ultra | Any uniform space has a natural system of pseudometrics definable on it, comprised of those pseudometrics constructed from a descending chain of equivalence relation entourages. In a nonarchimedean uniformity, this pseudometric system induces the uniformity. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #23111 | merge-conflict t-topology | 509/1 | Mathlib.lean,Mathlib/Topology/MetricSpace/BundledFun.lean,Mathlib/Topology/UniformSpace/Ultra/Pseudometrizable.lean | 3 | 9 | ['ADedecker', 'fpvandoorn', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | urkud | 5 months ago | 163 days ago | 177 days |
| 25324 | eric-wieser | feat: more functorial results about DFinsupp | We have these already for Finsupp. The `DFinsupp` statements need some extra casts in some places. --- - [ ] depends on: #27182 [](https://gitpod.io/from-referrer/) [#mathlib4 > Equiv.cast for structures @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Equiv.2Ecast.20for.20structures/near/521390935) | merge-conflict awaiting-author t-algebra t-data | 137/16 | Mathlib/Data/DFinsupp/Defs.lean,Mathlib/LinearAlgebra/DFinsupp.lean | 2 | 13 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | pechersky | 5 months ago | 213 days ago | 19 days |
| 25585 | Paul-Lez | feat(Tactic/Linters/DeprecatedSimpLemma): lint for deprecated simp lemmas | The deprecated simp lemma linter flags declarations that have both the `deprecated` and `simp` attributes. See Zulip discussion: [#mathlib4 > Help with Mathlib.Order.Interval.Finset.Defs @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Help.20with.20Mathlib.2EOrder.2EInterval.2EFinset.2EDefs/near/505994843) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 105/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/DeprecatedSimpLemma.lean,MathlibTest/DeprecatedSimpLemmaTest.lean | 4 | 8 | ['adomani', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 327 days ago | 13 minutes |
| 25683 | eric-wieser | feat: Enumeration of NonemptyInterval | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data large-import | 52/4 | Mathlib/Data/Sym/Sym2/Fin.lean,Mathlib/Data/Sym/Sym2/Order.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 25739 | literandltx | feat(NumberTheory/LegendreSymbol): Add sqrt‐of‐residue theorems for p=4k+3 and p=8k+5 | Add a new file `QuadraticResidueRoots.lean` under `Mathlib/NumberTheory/LegendreSymbol/` that proves two explicit “square-root of quadratic residue” theorems for primes of the specific form. - **`exists_sqrt_of_residue_mod4_eq3`** for primes `p = 4*k + 3` - **`exists_sqrt_of_residue_mod8_eq5`** for primes `p = 8*k + 5` It also introduces the helper lemmas `euler_criterion_traditional` and `legendreSym.at_two_mod8_eq_5`. Import lines in `Mathlib.lean` and `Mathlib/NumberTheory/LegendreSymbol/Basic.lean` have been updated accordingly. | merge-conflict awaiting-author t-number-theory new-contributor | 217/0 | Mathlib.lean,Mathlib/NumberTheory/LegendreSymbol/Basic.lean,Mathlib/NumberTheory/LegendreSymbol/QuadraticReciprocity.lean,Mathlib/NumberTheory/LegendreSymbol/QuadraticResidueRoots.lean | 4 | 3 | ['github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | literandltx | 5 months ago | 305 days ago | 17 days |
| 25746 | robin-carlier | feat(Tactic/CategoryTheory): `Cancelable` boilerplate for the `rotate_isos` WIP tactic | This PR adds some boilerplate that will be used in a forthcoming PR implementing a `rotate_isos` tactic that aims to provide easy ways of moving one or more morphisms that can be inferred to be isomorphisms (not necessarily through the `IsIso typeclass, but also directly by recognizing them as e.g components of natural isomorphisms, or functor application to such morphisms). The boilerplate in this PR abstracts the notion of a cancelable expression for a morphism in a composition of (iso)morphisms in a category, and records a global reference to a list of "cancelable factories", _i.e_ functions that try to recognize term in an expression as a "cancelable" morphism, and provides helper to register such functions. --- First part of a series of 3 PRs contributing the `rotate_isos` tactic to mathlib. Second part will actually implement the tactic, and provide a test suite. Please read the description of the second PR (#24454) to get more details. [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24452.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24452* | merge-conflict awaiting-author t-category-theory t-meta | 162/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Cancelable.lean,scripts/noshake.json | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 2 seconds |
| 25747 | robin-carlier | feat(Tactic/CategoryTheory): the `rotate_isos` tactic | We define a `rotate_isos` tactic for category theory in mathlib. At its core, the tactic transform terms of type `α(1) ≫ ⋯ ≫ α(k) = β(1) ≫ ⋯ ≫ β(l)` where `α` and `β` are families of morphisms in whith the first `i` morphisms of the left-hand side and the last `j` morphisms of the right-hand side are isomorhisms, into terms of type `α(k-i) ≫ ⋯ ≫ α(k) ≫ inv β(l) ≫ ⋯ ≫ β(l-j+1) = inv α(j) ≫ ⋯ ≫ inv α(1) ≫⋯ ≫ β(l-j)`. The construction of the inverses of expression are caried at the `Expr` levels are built out of the expressions of the morphisms, for instance, for this tactic, the inverse of `F.map (G.map (H.map f.hom)))` will directly be `F.map (G.map (H.map f.inv)))` (which would have to be re-simplified), rather than an `inv` term form an `IsIso` instance. The tactic can be applied at a local hypothesis or at the main goal, or can be used through a `rotate_isos%` term elaborator if e.g one wants to add such a "rotated" form to a `simp` or `rw` call. We also support removing morphisms "from the right" of the lhs, rather than from the right. --- The motivations behind this tactic are the following : - This tactic can "autogenerate" lemmas and terms generalizing lemmas such as [CategoryTheory.Iso.hom_inv_id_app_app_app](https://leanprover-community.github.io/mathlib4_docs/Mathlib/CategoryTheory/NatIso.html#CategoryTheory.Iso.hom_inv_id_app_app_app). This can also generate lemmas `F.map (G.map f.hom) ≫F.map (G.map f.inv) = 𝟙 _`, and can be used to unlock a `simp` call that blocks at an expression of the form `F.map (G.map f.hom) ≫F.map (G.map f.inv) `. - Currently, cancelling morphisms "from the right" in an expression in category theory is a bit of a pain. You have to first reassociate the expression, perform multiple calls to `Iso.inv_comp_eq`, reassociate, etc. This at least automates this process in a fairly straightforward way. - There are expressions in category theory that have no "right forms", e.g the pentagon axiom for monoidal categories, which has many variations in the way one can read the diagram of isomorphisms that represents it. Elaborators such as `rotate_iso%` easily generates all possible forms of such identities from one single form, and avoids having to state multiple forms of the same equality as individual lemmas. - I have been playing with medium-sized diagrams of isomorphisms recently (think for example vertical/horizontal compositions of `CatCommSq`, whiskering a corner of such diagrams, etc.), and it made me wish a lot of time that such easy way to transforms equalities to equivalent forms were available. - [ ] depends on: #25746 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24454.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24454* | WIP blocked-by-other-PR t-category-theory merge-conflict awaiting-author t-meta | 871/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Cancelable.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Core.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Lemmas.lean,MathlibTest/CategoryTheory/RotateIsos.lean,scripts/noshake.json | 7 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 2 seconds |
| 25748 | robin-carlier | feat(Tactic/CategoryTheory): Initial lemmas for the `rotate_iso` tactic | This PR records an initial set of lemmas to be used by the WIP `rotate_isos` tactic. --- - [ ] depends on: #25746 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24506.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24506* | merge-conflict blocked-by-other-PR t-meta | 496/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Cancelable.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Lemmas.lean,scripts/noshake.json | 5 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 9 minutes |
| 25750 | robin-carlier | feat(Tactic/CategoryTheory): bicategory extension for `rotate_isos` | This PR registers some lemmas to the `rotate_isos` tactic so that it applies in bicategorical contexts. For instance, if `α : g ⟶ h` is an invertible 2-cells, the term `f ◁ α ` is also recognized as invertible, with inverse `f ◁ α' `, where `α'` is the expression for the inverse constructed by the tactic. Without this extension, the tactic would only construct the generic `inv (f ◁ α)` as inverse for this term. --- - [ ] depends on: #25747 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24633.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24633* | merge-conflict blocked-by-other-PR t-category-theory t-meta | 1206/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Bicategory.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Cancelable.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Core.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Lemmas.lean,MathlibTest/CategoryTheory/RotateIsos.lean,scripts/noshake.json | 8 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 1 second |
| 25751 | robin-carlier | feat(Tactic/CategoryTheory): monoidal extension of `rotate_isos` | This PR registers some lemmas to the `rotate_isos` tactic so that it applies in monoidal contexts. For instance, if α : y ⟶ z is an invertible morphism, the term x ◁ α is also recognized as invertible, with inverse x ◁ α' , where α' is the expression for the inverse constructed by the tactic. Without this extension, the tactic would only construct the generic inv (x ◁ α) as inverse for this term. We also take care of terms of the form `f ⊗ g` --- - [ ] depends on: #25747 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24634.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24634* | merge-conflict blocked-by-other-PR t-category-theory t-meta | 1362/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Cancelable.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Core.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Lemmas.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Monoidal.lean,MathlibTest/CategoryTheory/RotateIsos.lean,scripts/noshake.json | 8 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 2 seconds |
| 25752 | robin-carlier | feat(Tactic/CategoryTheory): whiskering lemmas for `rotate_isos` | This PR extends the base set of terms recognized by the `rotate_isos` tactic to include terms of the form `whiskerLeft F f`, `isoWhiskerLeft F e`, and `NatTrans.hcomp`/ `NatIso.hcomp`. --- - [ ] depends on: #25747 Technically, it could depend solely on #24506, but there’s not much point getting this merged if the base tactic is not there. [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24650.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24650* | merge-conflict blocked-by-other-PR t-meta | 1365/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Cancelable.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Core.lean,Mathlib/Tactic/CategoryTheory/RotateIsos/Lemmas.lean,MathlibTest/CategoryTheory/RotateIsos.lean,scripts/noshake.json | 7 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 50 seconds |
| 25838 | Bergschaf | feat(Order/Atoms): Finsets are Atomistic | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order large-import | 31/0 | Mathlib/Order/Atoms.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 322 days ago | 6 minutes |
| 25987 | Multramate | refactor(AlgebraicGeometry/EllipticCurve/Affine/*): some minor changes | This PR continues the work from #24571. Original PR: https://github.com/leanprover-community/mathlib4/pull/24571 | merge-conflict t-algebraic-geometry | 0/12 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean | 2 | 4 | ['Multramate', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 318 days ago | 9 minutes |
| 25990 | Multramate | chore(NumberTheory/EllipticDivisibilitySequence): rename definitions | This PR continues the work from #25132. Original PR: https://github.com/leanprover-community/mathlib4/pull/25132 | merge-conflict t-number-theory | 265/45 | Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 1 | 3 | ['Multramate', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 318 days ago | 7 minutes |
| 26298 | adomani | test: the commandStart linter only acts on modified files. | Test for #26299: should flag issues in the new file and also in the modified file `Mathlib/Data/Array/Extract.lean`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-linter | 63/1 | Mathlib.lean,Mathlib/Data/Array/Extract.lean,Mathlib/New.lean,Mathlib/Tactic/Linter/CommandStart.lean | 4 | 21 | ['adomani', 'bryangingechen', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 312 days ago | 2 minutes |
| 26329 | Timeroot | feat: Definition of `Clone` notations and typeclasses | Definitions and notation typeclasses for #20051 --- This PR continues the work from #23459. Original PR: https://github.com/leanprover-community/mathlib4/pull/23459 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra awaiting-CI | 100/0 | Mathlib.lean,Mathlib/Algebra/Clone/Defs.lean | 2 | 4 | ['Timeroot', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 311 days ago | 6 hours |
| 26398 | ChrisHughes24 | feat(ModelTheory): definable functions | --- Possibly this should be generalized to partial functions. I migrated the PR by hand instead of using the script. - [x] depends on: #20166 - [x] depends on: #20161 - [x] depends on: #20115 - [x] depends on: #20174 - [x] depends on: #20175 - [x] depends on: #21948 [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-logic | 618/0 | Mathlib.lean,Mathlib/ModelTheory/FunctionalFormula.lean | 2 | 13 | ['ChrisHughes24', 'github-actions', 'jcommelin', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'staroperator'] | nobody | 5 months ago | 185 days ago | 87 days |
| 26399 | ChrisHughes24 | refactor(ModelTheory): tidy up proof of Ax-Grothendieck with definable functions | I migrated this PR by hand instead of using the script. --- - [x] depends on: #20166 - [x] depends on: #20161 - [x] depends on: #20115 - [x] depends on: #20174 - [x] depends on: #20175 - [x] depends on: #20180 - [x] depends on: #21948 - [ ] depends on: #26398 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-logic | 639/60 | Mathlib.lean,Mathlib/FieldTheory/AxGrothendieck.lean,Mathlib/ModelTheory/FunctionalFormula.lean | 3 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 310 days ago | 17 minutes |
| 26432 | AntoineChambert-Loir | feat(Data.Nat.LogFueled): fueled version of `clog` | This PR continues the work from #25557. Original PR: https://github.com/leanprover-community/mathlib4/pull/25557 | merge-conflict t-data | 201/0 | Mathlib.lean,Mathlib/Data/Nat/LogFueled.lean | 2 | 3 | ['AntoineChambert-Loir', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 309 days ago | 7 minutes |
| 26594 | metakunt | feat(Algebra/Polynomial/ZMod): Add Polynomial.equiv_of_nat_of_polynomial_zmod | This adds an explicit bijection between the naturals and $$\mathbb{Z}/n\mathbb{Z}[X]$$ in a canonical way. --- I feel that some API is missing to make the theorem shorter, I have no idea what lemmas to extract though. Also I don't know when to use spaces and when not, so I did it best effort. | merge-conflict awaiting-author t-algebra new-contributor | 465/0 | Mathlib.lean,Mathlib/Algebra/Polynomial/ZMod.lean | 2 | 3 | ['Ruben-VandeVelde', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 278 days ago | 25 days |
| 26644 | kckennylau | feat(SetTheory/ZFC): Define the language of sets and state the ZFC axioms | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-set-theory | 381/0 | Mathlib.lean,Mathlib/SetTheory/ZFC/Axioms.lean,docs/references.bib | 3 | 50 | ['b-mehta', 'digama0', 'github-actions', 'kckennylau', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot', 'staroperator', 'vihdzp'] | b-mehta | 5 months ago | 250 days ago | 40 days |
| 26648 | eric-wieser | chore(TensorProduct): remove more `suppress_compilation`s | --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-core-PR t-algebra | 3/7 | Mathlib/LinearAlgebra/CliffordAlgebra/Prod.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/External.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean | 3 | 5 | ['eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 299 days ago | 3 days |
| 26757 | fweth | feat(CategoryTheory/Topos): define elementary topos | This commit begins the formalization of the notion of an *elementary topos*, following the definition in \[Mac Lane & Moerdijk, *Sheaves in Geometry and Logic* (1992), Ch. IV, Section 1]. It introduces the file `Mathlib/CategoryTheory/Topos/Basic.lean`, which currently includes: * The definition of an elementary topos. * Proof that the power object map is a functor * Theorem about pullbacks of characterstic maps Subobject classifiers, which are used in the definition, have already been defined in `CategoryTheory/Topos/Classifier.lean` Work in progress: further formalization of the section is planned. Questions: * Should the definition of power objects be separated into its own file/module, perhaps under `CategoryTheory/Topos/PowerObject.lean`? * Is the notation `P` / `P_morph` / `P_functor` for the power object functor on objects / morphisms / total acceptable? * Should the comments and docstrings rather use the notation from the book, where `g ∘ f` denotes arrow composition from righ to left, or the Lean variant `f ≫ g`? Klaus Gy klausgy@gmail.com --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 401/66 | Mathlib.lean,Mathlib/CategoryTheory/Closed/PowerObjects.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/CommSq.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Equalizer.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Topos/Classifier.lean | 9 | 17 | ['fweth', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | joelriou | 5 months ago | 192 days ago | 62 days |
| 26914 | quangvdao | feat(Data/PFunctor/Univariate): more definitions for univariate `PFunctor` | This PR defines several basic definitions of `PFunctor`, including zero, one, constants, monomials, coproduct (sum), product, sigma, pi, tensor product, universe lifting, and equivalence. We also add: (1) simple lemmas connecting the basic definitions, (2) an automatically derived ext lemma for `PFunctor` via `@[ext]` attribute Some things I'm not clear on: - I define `HAdd` and `HMul` instances for coproduct and product of poly functors having different universe levels. Should I also define `Add` and `Mul` instances for poly functors having the same universe level? - Is it ok to define notation for tensor product, i.e. `@[inherit_doc] scoped infixr:80 " ⊗ " => tensor`? I'm worried it might clash with other notation. - Need a double-check on the priority of notation. Some future definitions to add: - Various equivalences arising from arithmetic identities, e.g., `P + 0 ≃ₚ P`. - Definitions of Lenses and Charts (each of them will be a file or even a folder) - Exponential objects (corresponding to both `prod` and `tensor`) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 144/5 | Mathlib/Data/PFunctor/Univariate/Basic.lean | 1 | 20 | ['alexkeizer', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'quangvdao'] | eric-wieser | 5 months ago | 163 days ago | 133 days |
| 26920 | yuma-mizuno | feat(Tactic.CategoryTheory): add associator inserting tactic | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory t-meta | 714/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Associators.lean,MathlibTest/CategoryTheory/Associators.lean | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 296 days ago | 16 seconds |
| 26990 | joelriou | feat(CategoryTheory/Abelian): Noetherian objects form a Serre class | This PR continues the work from #22367. Original PR: https://github.com/leanprover-community/mathlib4/pull/22367 | merge-conflict WIP t-category-theory | 311/14 | Mathlib.lean,Mathlib/CategoryTheory/Abelian/SerreClass/NoetherianObject.lean,Mathlib/CategoryTheory/Abelian/Subobject.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Subobject/MonoOver.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 294 days ago | 45 seconds |
| 27098 | Paul-Lez | feat(Algebra/Category/ModuleCat/Sheaf/VectorBundle): define vector bundles | This PR defines vector bundles (upstreamed from [formal-conjectures](https://github.com/google-deepmind/formal-conjectures/pull/28/files)). I plan on adding some more API about the definition in this PR, but figured it would be nice to get some initial feedback about the definition before doing so! --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 53/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/VectorBundle.lean | 2 | 5 | ['Kiolt', 'Raph-DG', 'chrisflav', 'github-actions', 'mathlib4-merge-conflict-bot'] | chrisflav | 5 months ago | 274 days ago | 16 days |
| 27155 | Pjotr5 | feat: Shearer's bound on the independence number of triangle free graphs | I added the file IndependenceNumber.lean to the Mathlib.Combinatorics.SimpleGraph.Triangle folder. It contains a proof of a theorem by Shearer on the independence number of triangle-free graphs . I was told this might be useful to add to Mathlib a Zullip thread linked [here](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Convexity.20of.20a.20specific.20function/with/510469526). I tried to comply as much as I could with the Mathlib style guide, but I realise that there is probably still a significant amount of editing to be done. For one thing: there are probably some lemmas and theorems in there that might be better suited in other files, but since this is my first PR I though I would all put it in one file before starting to edit a bunch of files. I was also advised to split up the file into multiple smaller PRs, but since everything is basically serving this one proof I could not really find a natural way to do that. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics new-contributor | 1266/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/IndependenceNumber.lean | 2 | 10 | ['Pjotr5', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 290 days ago | 4 minutes |
| 27163 | pechersky | feat(Topology/ValuativeRel): of and to basis of compatible valuations | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #30262 | t-number-theory t-algebra merge-conflict awaiting-author t-topology | 229/62 | Mathlib/NumberTheory/LocalField/Basic.lean,Mathlib/Order/Filter/Bases/Basic.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean | 3 | 73 | ['erdOne', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky', 'smmercuri'] | alreadydone | 5 months ago | 164 days ago | 84 days |
| 27215 | kckennylau | feat(AlgebraicGeometry): Define the Zariski site on `CommRingCatᵒᵖ` | We define the Zariski site on `CommRingCatᵒᵖ` by inducing the topology from `Scheme`, and then we show that this topology is equal to the one generated by the pretopology of finite, surjective, and standard open morphisms. --- - [x] depends on: #28614 - [x] depends on: #28615 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 312/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/AlgebraicGeometry/Sites/BigAffineZariski.lean | 3 | 33 | ['chrisflav', 'github-actions', 'joelriou', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | chrisflav | 5 months ago | 220 days ago | 3 days |
| 27309 | kckennylau | feat(CategoryTheory): a presheaf on `CostructuredArrow F d` can be extended to a presheaf on `C` | --- Depends on: * [ ] #27321 Zulip: [#Is there code for X? > over category via a functor](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/over.20category.20via.20a.20functor/with/529574191) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 218/0 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Presheaf/LeftExtension.lean | 2 | 4 | ['erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | erdOne | 5 months ago | 269 days ago | 15 days |
| 27321 | kckennylau | feat(CategoryTheory): Colimit can be computed fiberwise | We consider category `J` equipped with a functor `F : J ⥤ D` to a discrete category `D`. Then the colimit of any diagram `diagram : J ⥤ C` can be computed using the following algorithm: 1. For each `d : D`, compute the colimit of the restricted diagram `F.fiberIncl d ⋙ diagram`. 2. Take the coproduct of these colimits over all `d : D`. We call this "computing the colimit fiberwise". --- Zulip: [#Is there code for X? > over category via a functor](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/over.20category.20via.20a.20functor/with/529574191) [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory awaiting-CI | 136/0 | Mathlib.lean,Mathlib/CategoryTheory/FiberedCategory/Fiber.lean,Mathlib/CategoryTheory/Limits/Shapes/Fiberwise.lean | 3 | 25 | ['github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 5 months ago | 239 days ago | 18 days |
| 27753 | YunkaiZhang233 | feat(CategoryTheory): implemented proofs for factorisation categories being equivalent to iterated comma categories in two ways | --- Completed one of the tasks in TODOs, shown and implemented the details for (X/C)/f ≌ Factorisation f ≌ f/(C/Y). This is migrated from my previous PR #22390 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 70/1 | Mathlib/CategoryTheory/Category/Factorisation.lean | 1 | 13 | ['YunkaiZhang233', 'b-mehta', 'github-actions', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 5 months ago | 274 days ago | 57 minutes |
| 27824 | ChrisHughes24 | feat(Calculus): exists_gt_of_deriv_pos and variants | --- I created a new file for this as I anticipate there will be many lemmas relating derivatives and monotonicity in future. Some lemmas relating deriviatives to monotonicity are already in mathlib and should maybe moved to the file (e.g. docs#HasDerivWithinAt.nonneg_of_monotoneOn). I stated them in as much generality as I could, copying the generality of `HasDerivWithinAt.nonneg_of_monotoneOn`. - [x] depends on: #28039 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 103/0 | Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/Order.lean | 2 | 37 | ['ChrisHughes24', 'EtienneC30', 'b-mehta', 'github-actions', 'j-loreaux', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | hrmacbeth | 5 months ago | 178 days ago | 81 days |
| 27850 | fyqing | feat: 0-dimensional manifolds are discrete and countable | This is the converse direction of the classification of 0-dimensional manifolds. The other direction was shown in #22105. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-differential-geometry new-contributor | 80/0 | Mathlib.lean,Mathlib/Geometry/Manifold/ZeroDim.lean | 2 | 14 | ['fyqing', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'tb65536'] | grunweg | 5 months ago | 272 days ago | 1 hour |
| 27973 | smmercuri | feat: the ring of integers of a `ℤₘ₀`-valued field is compact whenever it is a DVR and the residue field is finite | This PR continues the work from #21844. Original PR: https://github.com/leanprover-community/mathlib4/pull/21844 | merge-conflict awaiting-author t-algebra large-import | 54/2 | Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean | 2 | 9 | ['github-actions', 'mathlib4-merge-conflict-bot', 'pechersky', 'smmercuri'] | nobody | 5 months ago | 217 days ago | 37 days |
| 28124 | kckennylau | feat(Tactic): Call an arbitrary Simproc | In the current framework, `Simproc`s are declared by name, and can only be referred to by name. For example, [Nat.divisors_ofNat](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Tactic/Simproc/Divisors.html#Nat.divisors_ofNat) is declared as: ```lean dsimproc_decl Nat.divisors_ofNat (Nat.divisors _) := fun e => do ``` This declaration syntax does not allow for a `Simproc` to depend on any arguments, and even if one constructed a `Simproc` that depends on e.g. a natural number, such as `foo : ℕ → Simproc`, one still cannot call it using the syntax `by simp [foo 37]`. Therefore, this new function aims to solve this problem, by allowing an arbitrary `Simproc` to be executed, using the newly defined function `Lean.Meta.Simp.Simproc.apply (s : Simproc) : TacticM Unit`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 79/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/Apply.lean,MathlibTest/Simproc/Apply.lean | 4 | 28 | ['JovanGerb', 'b-mehta', 'eric-wieser', 'github-actions', 'hrmacbeth', 'kckennylau', 'mathlib4-merge-conflict-bot'] | JovanGerb | 5 months ago | 233 days ago | 23 days |
| 28125 | nonisomorphiclinearmap | feat(Combinatorics): basic definition of simplicial complexes | This PR introduces the basic definition of a finite (abstract) simplicial complex, located in Mathlib/Combinatorics/SimplicialComplex/Basic.lean. --- This is our first contribution to mathlib. This work was done as part of the Fields Institute Summer Undergraduate Program on formalization in topological combinatorics. Eventually, we aim to formalize Lovasz's proof of the Kneser Conjecture and this is a small stepping stone in that direction. Some other commits will shortly depend on this one. We would like to acknowledge the Fields Institute for Research in Mathematical Sciences for their sponsorship. We would also like to thank our supervisors, Professor Chris Kapulkin and Mr. Daniel Carranza, for their guidance and support throughout this project. We would also like to thank our group members Tom Lindquist and Quang Minh Nguyen for our fruitful discussions. | merge-conflict t-combinatorics new-contributor | 374/0 | Mathlib.lean,Mathlib/Combinatorics/SimplicialComplex/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Category.lean,Mathlib/Combinatorics/SimplicialComplex/FacePoset.lean,Mathlib/Combinatorics/SimplicialComplex/Hom.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 5 months ago | 163 days ago | 99 days |
| 28316 | eric-wieser | feat(Tactic/NormNum): better trace nodes | Comparing the infoview on the first example in the test file
| Before | After |
|---|---|
| |
merge-conflict t-meta | 136/5 | Mathlib.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Util/Trace.lean,MathlibTest/norm_num_trace.lean | 4 | 20 | ['JovanGerb', 'eric-wieser', 'github-actions', 'kmill', 'leanprover-bot', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'plp127'] | JovanGerb | 5 months ago | 242 days ago | 18 days |
| 28325 | pechersky | feat(WithZeroTopology): `locallyCompactSpace_iff_locallyFiniteOrder_units` | On the way to golf/generalize the proof that locally compact valued fields have locally finite valuation groups as embodied in `Valued.integer.locallyFiniteOrder_units_mrange_of_isCompact_integer` ] --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-order large-import | 81/2 | Mathlib/Topology/Algebra/GroupWithZero.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean,Mathlib/Topology/Compactness/Compact.lean | 3 | 13 | ['erdOne', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'ocfnash'] | PatrickMassot | 5 months ago | 168 days ago | 93 days |
| 28349 | kckennylau | feat(Meta): add notation for naming stacked polynomials | This PR changes the notation for naming formal variables associated to recursive polynomial-like objects. Registration is done only once per each polynomial-like functor. Usage: ```lean register_poly_vars "[" "]" Polynomial Polynomial.C Polynomial.X register_poly_vars (mv := true) "[" "]" MvPolynomial MvPolynomial.C MvPolynomial.X name_poly_vars R[a,b][C] name_poly_vars _[x,y,z] ``` `_[[x,y,z]]` allows for the hole to be substituted by any base ring, so `(x : R[[x,y,z]])` will be valid syntax. There has been some discussion about its implementation: * It has been suggested that `R[x,y][z]` should mean that `R[x,y]` is a subring, i.e. `x` should live in `R[x,y]`, but in my implementation `x` lives in the big ring `R[x,y][z]`. There are two ways to get the other behaviour: * One can do `R[x,y]` and then `(R[x,y])[z]`. * One can do `R[a,b]` and `R[x,y][z]`. I personally prefer this one because we should make it clearer that they are different rings. * There has been some discussion over what `R` means. In my implementation, if you ever refer to a `variable` called `R`, then `R` is fixed to that variable, meaning that if you later define a variable with the same name, `R` will still refer to the old variable. Also, this does not respect namespace, meaning that if you refer to `Foo.bar[x,y]`, and later open `Foo`, you will not be able to access the declared ring with `bar[x,y]`. --- I have not mass deployed the new syntax at every possible location, I plan to do that in a future PR following this. Zulip: [#mathlib4 > Notation for polynomial variables](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Notation.20for.20polynomial.20variables) This is a refactor of the currently existing [Mathlib.Tactic.namePolyVarsOver](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Tactic/Ring/NamePolyVars.html#Mathlib.Tactic.namePolyVarsOver). More explicitly, the current invocation `name_poly_vars x,y over R` is now `poly_variable R[x,y]`. The behaviours inherited from `name_poly_vars` are: * We do not synthesize the necessary instances (such as `[CommRing R]`) at the point of declaration, but only when the new notations are used. * We refer to an explicit term (`R` in the examples) which is "fixed", in the sense that: * it is only valid for `R` explicitly, and not any other `variable` such as `S`. * it has built-in hygiene, so if you shadow the variable by declaring a new `variable (R : Type*)`, it will still refer to the old one. And the new behaviours are: * Currently only `x` and `y` are new notations, but in the new tactic the whole ring `R[x,y]` is also available as notation. * Currently only the forward direction (i.e. elaboration, going from `x` to `MvPolynomial.X 0`) is implemented, but in the new tactic we also implement the backward direction, printing `MvPolynomial.X 0` back as `x` (and `MvPolynomial (Fin 2) R` is printed as `R[x,y]`). * Support beyond just `MvPolynomial`. * Support for nested polynomial-like rings, such as `R[x,y][t][[z]]` for `PowerSeries (Polynomial (MvPolynomial (Fin 2) R))`. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 778/87 | Counterexamples/CliffordAlgebraNotInjective.lean,Mathlib.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/PolyVariable.lean,Mathlib/Tactic/Ring/NamePolyVars.lean,MathlibTest/PolyVariable.lean,scripts/noshake.json | 10 | 110 | ['JovanGerb', 'adamtopaz', 'chrisflav', 'eric-wieser', 'github-actions', 'j-loreaux', 'kckennylau', 'kim-em', 'mathlib4-merge-conflict-bot', 'plp127', 'robertmaxton42', 'sgouezel'] | adamtopaz | 5 months ago | 170 days ago | 58 days |
| 28530 | nonisomorphiclinearmap | feat(Combinatorics/SimplicialComplex/Topology): add standard simplices and geometric realisation (colimit + functoriality) | Introduce the standard simplex on a finite vertex set and build the geometric realisation |X| of a simplicial complex. Prove that |X| is the colimit of the face diagram δ_X : X.faces ⥤ TopCat, and define the induced map on realisations |φ| : |X| ⟶ |Y| for a simplicial map φ. Show that the abstract map from colimit functoriality agrees with the concrete push-forward of barycentric coordinates. Package these into a functor SimplicialComplexCat ⥤ TopCat. --- This is our first contribution to mathlib. This work was done as part of the Fields Institute Summer Undergraduate Program on formalization in topological combinatorics. Eventually, we aim to formalize Lovasz's proof of the Kneser Conjecture and this lays the groundwork to do this. We would like to acknowledge the Fields Institute for Research in Mathematical Sciences for their sponsorship. We would also like to thank our supervisors, Professor Chris Kapulkin and Mr. Daniel Carranza, for their guidance and support throughout this project. I would also like to thank our group members Sebastian Kumar, Tom Lindquist and Quang Minh Nguyen for our fruitful discussions. - [ ] depends on: #28125 | merge-conflict blocked-by-other-PR t-combinatorics new-contributor | 1826/0 | Mathlib.lean,Mathlib/Combinatorics/SimplicialComplex/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Category.lean,Mathlib/Combinatorics/SimplicialComplex/FacePoset.lean,Mathlib/Combinatorics/SimplicialComplex/Hom.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Basic.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Colimit.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Diagram.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Functor.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/GeomReal/Map.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/Simplex.lean,Mathlib/Combinatorics/SimplicialComplex/Topology/SimplexMap.lean | 12 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 257 days ago | 9 minutes |
| 28868 | yury-harmonic | feat(Positive): add `OfNat` instance | Also fix defeq for `Div` in the `Group` instance. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 41/13 | Mathlib/Algebra/Order/Positive/Field.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Data/PNat/Defs.lean | 3 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot', 'yury-harmonic'] | nobody | 5 months ago | 186 days ago | 2 hours |
| 28871 | JaafarTanoukhi | feat(Combinatorics/Digraph): Tournaments | Define orientations and tournaments. Related to #26771.
Co-authored-by: Rida Hamadani |
merge-conflict t-combinatorics new-contributor | 62/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/Digraph/Tournament.lean | 3 | 6 | ['JaafarTanoukhi', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'mathlib4-merge-conflict-bot'] | kmill | 5 months ago | 163 days ago | 71 days |
| 29108 | JonBannon | feat(MeasureTheory): add `LInfty.lean` with `Mul` and `const` related results. | Continuing to develop pieces needed for a `CStarAlgebra` instance for `Lp R ∞ μ`, we introduce a file `MeasureTheory.Function.LInfty.lean` that takes `MeasureTheory.Function.LpSpace.Basic` and `MeasureTheory.Function.Holder` as imports, and introduces the `Mul` instance on Linfty, and const-related results. In a future PR we will handle `One`, as this will require dealing with `AEEqFun` as well as `Lp` level objects and it's probably best to handle these together in a single PR. We opted to add this file to keep imports light, since adding the `Mul` results to `Basic` would require importing `Holder`, and including these results in `Holder` seemed too specific and would make `Holder` heavier. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 91/0 | Mathlib.lean,Mathlib/MeasureTheory/Function/LInfty.lean | 2 | 6 | ['JonBannon', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 241 days ago | 4 days |
| 29481 | llllvvuu | feat(LinearAlgebra/Eigenspace): roots of matrix minpoly give spectrum | This is derived from the corresponding result on linear maps. --- - [x] depends on: #29478 for some simp lemmas [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 13/0 | Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean | 1 | 5 | ['github-actions', 'llllvvuu', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 233 days ago | 3 hours |
| 29526 | llllvvuu | feat: `Multiset.map f` identifies `f` up to permutation | Motivation: Reason about `Fintype`-indexed families via `Multiset` equality.
Example use case 1:
```lean
theorem Matrix.IsHermitian.cfc_eigenvalues {d : Type*} [Fintype d] [DecidableEq d]
{M : Matrix d d 𝕜} (hM : M.IsHermitian) (f : ℝ → ℝ)
(hcfc : Matrix.IsHermitian (cfc f M) := cfc_predicate f M) :
∃ (e : d ≃ d), hcfc.eigenvalues = f ∘ hM.eigenvalues ∘ e := by
have := hcfc.roots_charpoly_eq_eigenvalues.symm
rw [hM.charpoly_cfc_eq f, Polynomial.roots_prod] at this; swap
· simp [Finset.prod_ne_zero_iff, Polynomial.X_sub_C_ne_zero]
simp_rw [Polynomial.roots_X_sub_C, Multiset.bind_singleton] at this
have he := (Multiset.compTriple_equivOfMapUnivEq this).comp_eq
simp_rw [← Function.comp_def RCLike.ofReal, ← Function.comp_def f, Function.comp_assoc] at he
exact ⟨_, RCLike.ofReal_injective.comp_left he.symm⟩
```
Example use case 2 (on top of https://github.com/leanprover-community/mathlib4/pull/29610):
```lean
theorem LinearMap.Eigenbasis.μ_equiv {ι ι' R G : Type*} [Fintype ι] [Fintype ι']
[CommRing R] [IsDomain R] [AddCommGroup G] [Module R G] [Module.Free R G] [Module.Finite R G]
{f : Module.End R G} (B₁ : f.Eigenbasis ι) (B₂ : f.Eigenbasis ι') :
∃ e : ι ≃ ι', B₁.μ = B₂.μ ∘ e := by
classical
have := congr(Polynomial.roots $(B₁.charpoly_eq.symm.trans B₂.charpoly_eq))
rw [Polynomial.roots_prod, Polynomial.roots_prod] at this; rotate_left
· simp [Finset.prod_ne_zero_iff, Polynomial.X_sub_C_ne_zero]
· simp [Finset.prod_ne_zero_iff, Polynomial.X_sub_C_ne_zero]
simp_rw [Polynomial.roots_X_sub_C, Multiset.bind_singleton] at this
exact ⟨Multiset.equivOfMapUnivEq this, (Multiset.compTriple_equivOfMapUnivEq this).comp_eq.symm⟩
```
Co-authored-by: Aristotle Harmonic |
merge-conflict t-data | 35/0 | Mathlib/Data/Multiset/Fintype.lean | 1 | 9 | ['Ruben-VandeVelde', 'github-actions', 'llllvvuu', 'mathlib4-merge-conflict-bot', 'vihdzp', 'wwylele'] | pechersky | 5 months ago | 163 days ago | 69 days |
| 29675 | yury-harmonic | feat(Wolstenholme): new file | Co-authored-by: @Aristotle-Harmonic --- I still need to cleanup the proof and write the docs. For now, it's just what the AI generated, forward-ported to the latest Mathlib. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted t-data | 198/0 | Mathlib.lean,Mathlib/Data/Nat/Choose/Wolstenholme.lean | 2 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot', 'yury-harmonic'] | nobody | 5 months ago | 228 days ago | 1 minute |
| 29720 | javra | feat(CategoryTheory): `TransportEnrichment` and `ForgetEnrichment` as 2-functors | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 63/1 | Mathlib/CategoryTheory/Enriched/Basic.lean,Mathlib/CategoryTheory/Enriched/EnrichedCat.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 227 days ago | 24 seconds |
| 29827 | js2357 | feat: define two (trivial) ContinuousMulEquivs | Define two trivial `ContinuousMulEquiv`s: `ContinuousMulEquiv.piUnique` is the topological version of `MulEquiv.piUnique`. `ContinuousMulEquiv.piEquivPiSubtypeProd` is the multiplicative version of `Homeomorph.piEquivPiSubtypeProd`. Done for the FLT project. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology FLT large-import | 25/0 | Mathlib/Topology/Algebra/ContinuousMonoidHom.lean | 1 | 3 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 220 days ago | 2 hours |
| 29947 | JaafarTanoukhi | feat(Combinatorics/Digraph): Maps | Ported `SimpleGraph/Maps.lean` to `Digraph/Maps.lean` for future PRs related to issue #[26771](https://github.com/leanprover-community/mathlib4/issues/26771) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics new-contributor | 476/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Maps.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 5 months ago | 163 days ago | 54 days |
| 30004 | luigi-massacci | feat(MeasureTheory/Integral/TestAgainst): integrating BCFs against a finite measure or an L1Loc map as CLMs | This PR merges #29511 and #29748. Create a new file `TestAgainst.lean` with definitions wrapping integration against a finite measure or a locally integrable map as continuous linear maps on bounded continuous functions. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis t-measure-probability | 112/1 | Mathlib.lean,Mathlib/MeasureTheory/Integral/BoundedContinuousFunction.lean,Mathlib/MeasureTheory/Integral/TestAgainst.lean | 3 | 48 | ['EtienneC30', 'github-actions', 'j-loreaux', 'luigi-massacci', 'mathlib4-merge-conflict-bot'] | EtienneC30 | 5 months ago | 184 days ago | 31 days |
| 30022 | ADedecker | feat: theory of `IsRightUniformGroup` and `IsLeftUniformGroup` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 799/150 | Mathlib/Topology/Algebra/IsUniformGroup/Basic.lean,Mathlib/Topology/Algebra/IsUniformGroup/Defs.lean | 2 | 7 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 30042 | JovanGerb | feat(push): `@[push]` attributes for `∈` in `Set`, `Finset` and `Multiset` | This PR adds `@[push]` annotations for the membership relations, for `Set`, `Finset` and `Multiset`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 171/105 | Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/ListOfFn.lean,Mathlib/Algebra/Order/Group/Multiset.lean,Mathlib/Data/DFinsupp/Interval.lean,Mathlib/Data/Finmap.lean,Mathlib/Data/Finset/BooleanAlgebra.lean,Mathlib/Data/Finset/Dedup.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finset/Disjoint.lean,Mathlib/Data/Finset/Filter.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Insert.lean,Mathlib/Data/Finset/Lattice/Basic.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/Finset/Pi.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Finset/Range.lean,Mathlib/Data/Finset/SDiff.lean,Mathlib/Data/Finset/Sigma.lean,Mathlib/Data/Finset/Sort.lean,Mathlib/Data/Finset/Sum.lean,Mathlib/Data/Finset/Sups.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Multiset/AddSub.lean,Mathlib/Data/Multiset/Antidiagonal.lean,Mathlib/Data/Multiset/Bind.lean,Mathlib/Data/Multiset/Dedup.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Multiset/FinsetOps.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Multiset/Pi.lean,Mathlib/Data/Multiset/Range.lean,Mathlib/Data/Multiset/Replicate.lean,Mathlib/Data/Multiset/Sort.lean,Mathlib/Data/Multiset/Sum.lean,Mathlib/Data/Multiset/UnionInter.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Order/Interval/Finset/Defs.lean,Mathlib/Order/Interval/Multiset.lean,Mathlib/Order/Interval/Set/Defs.lean,Mathlib/Order/SetNotation.lean,MathlibTest/push.lean | 49 | 14 | ['JovanGerb', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | grunweg | 5 months ago | 171 days ago | 23 days |
| 30230 | CoolRmal | feat(MeasureTheory): Basic properties of the integral against a vector measure with a bilinear form. | Create a folder named Integral in the folder about vector measures. Define the integral of a function against a vector measure with a bilinear form, and prove that integral is a linear operator on functions, bilinear forms, and vector measures, respectively. Several useful lemmas are added into the file about variations of a vector measure (e.g. triangle inequality). --- - [ ] depends on: #28499 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-measure-probability | 1353/0 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Integral/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Integral/L1.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Lemmas.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 30330 | Bergschaf | feat(Algebra/Group/Action/Equidecomp): Mathlib's definition of Equidecomposability is equivalent to the standart one using partitions | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 329/1 | Mathlib/Algebra/Group/Action/Equidecomp.lean | 1 | 6 | ['Bergschaf', 'Felix-Weilacher', 'github-actions', 'mathlib4-merge-conflict-bot'] | Vierkantor | 5 months ago | 186 days ago | 15 days |
| 30392 | urkud | feat: define pullback quotient maps | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 287/0 | Mathlib.lean,Mathlib/Topology/ClusterPt.lean,Mathlib/Topology/Maps/PullbackQuotient.lean | 3 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 30933 | joelriou | feat(CategoryTheory): the linearization of a category | Let `C` be a category and `R` be a commutative ring. We construct a `R`-linear category `Linearization C R` and a functor `toLinearization C R : C ⥤ Linearization C R`. The morphisms in `Linearization C R` are the free `R`-modules on the types of morphisms in `C`. (In the context of singular homology with coefficients `R`, chains of a fixed degree shall identify to morphisms in `Linearization TopCat R`, and doing certain computations for arbitrary coefficients should reduce to computations with `R := ℤ`.) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 134/0 | Mathlib.lean,Mathlib/CategoryTheory/Linear/Linearization.lean | 2 | 4 | ['github-actions', 'joelriou', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 184 days ago | 2 days |
| 31314 | hrmacbeth | feat: linters for recommended `field_simp` style | --- - [x] depends on: #31472 - [x] depends on: #31483 [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-CI | 93/1 | Mathlib.lean,Mathlib/Lean/Meta/WarningAsError.lean,Mathlib/Tactic/Field.lean | 3 | 5 | ['github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 31351 | grunweg | feat: manifolds with smooth boundary | Needs polish, and closing the remaining sorries (or deciding they can be postponed later). From my bordism theory project. --- - [x] depends on: #22070 - [x] depends on: #22128 - [x] depends on: #22131 - [x] depends on: #22082 - [x] depends on: #22113 - [x] depends on: #22105 - [x] depends on: #26099 - [x] depends on: #30049 (preliminary code clean-up) - [x] depends on: #29589 - [x] ~~depends on: https://github.com/grunweg/mathlib4/tree/mfderiv-prodmap for actually proving the mfderiv sorry about products I need~~ done now - [ ] depends on: #31200 (and its companion result, about Sum.map) - [ ] depends on #23040 for the mathlib-level definition of smooth immersions and embeddings This PR continues the work from #22059. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry | 591/0 | Mathlib.lean,Mathlib/Geometry/Manifold/HasSmoothBoundary.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 175 days ago | 13 seconds |
| 14704 | Command-Master | feat(FieldTheory): define typeclass for simple extensions, and prove some properties | Define `SimpleExtension F K`, which says that `K` is a simple field extension of `F`, and show that together with transcendentality it implies `IsFractionRing F[X] K`. --- - [x] depends on: #14710 [](https://gitpod.io/from-referrer/) | WIP t-algebra new-contributor merge-conflict awaiting-author | 120/0 | Mathlib.lean,Mathlib/FieldTheory/SimpleExtension.lean | 2 | 19 | ['Command-Master', 'acmepjz', 'github-actions', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot', 'tb65536'] | nobody | 5 months ago | 607 days ago | 48 days |
| 31356 | adomani | feat: add inspect-like functions | Produces a tree-like formatting for `Syntax`, `Expr` and `InfoTree`. Especially for the `InfoTree`s, there are *many* parts of it that do not get printed. For instance, this is how the `InfoTree`s of `set_option linter.missingDocs true` get printed: ```lean inspectIT set_option linter.missingDocs true /- commandCtx |-Info.ofCommandInfo: Lean.Elab.Command.elabSetOption, 'set_option…gDocs true' | |-Info.ofCompletionInfo.CompletionInfo.option 'set_option…issingDocs' | |-Info.ofOptionInfo: linter.missingDocs, Linter.linter.missingDocs -/ ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 720/0 | Mathlib.lean,Mathlib/Util/Inspect.lean,MathlibTest/Inspect.lean | 3 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | kim-em | 5 months ago | 163 days ago | 11 days |
| 31604 | maksym-radziwill | feat: analyticity of dslope | This adds a few simple functions to show that ``dslope f a`` is analytic when ``f`` is. This is needed for Borel-Caratheodory, see https://github.com/leanprover-community/mathlib4/pull/30424 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 51/0 | Mathlib.lean,Mathlib/Analysis/Analytic/Dslope.lean | 2 | 26 | ['github-actions', 'grunweg', 'maksym-radziwill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 168 days ago | 1 hour |
| 31738 | robertmaxton42 | feat: quivers can be represented as functors from the walking quiver | Add definitions and associated lemmas for representing quivers as functors from the category `1 ⇉ 0`, i.e. `WalkingParallelPairᵒᵖ`. New definitions: * `asFunctor` itself, which is defined as a bare function with an associated `Functorial` instance so that it can be used with generalized projection notation * `src` and `tgt`, abbreviations for `F.map left.op` and `F.map right.op` for a functor `F : WalkingParallelPairᵒᵖ ⥤ Type w` * `Vertex`, `Edges`, and `Edge`, abbreviations for `F.obj 0` (interpreted as the type of vertices), `F.obj 1` (interpreted as the total type of all edges), and `{e : F.obj 1 // src e = s ∧ tgt e = t}` for some pair of vertices `s` and `t` (interpreted as the hom-type `s ⟶ t`) * `edgeOfEq`, the equivalent of `Quiver.homOfEq` for edges in quivers in functor form. --- This PR begins the first of a series proving that the category `Quiv.{v, u}` is equivalent to the subcategory of $$\mathbf{PSh}(\mathbf{WQuiv}^\mathrm{op})$$ which are appropriately '`u`-small' and 'locally `v`-small'. The original PR (prior to the move to forks) created a custom type `WalkingQuiver` for this purpose; ultimately I found that `WalkingParallelPairᵒᵖ` served my purposes well enough. Following this PR will be one constructing the adjoint `ofFunctor`, plus several showing that `asFunctor` and `ofFunctor` can be assembled into an equivalence and proving various properties of quivers in functor form necessary for the construction of colimits. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 397/0 | Mathlib.lean,Mathlib/CategoryTheory/Category/Quiv/AsOfFunctor.lean | 2 | 13 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot', 'robertmaxton42'] | nobody | 5 months ago | 165 days ago | 8 minutes |
| 31587 | JovanGerb | Lean pr testing 11156 | Testing the performance improvement given by not deleting cache so often when modifying the environment. cf. https://github.com/leanprover/lean4/pull/11156 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 760/625 | Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1997Q3.lean,Archive/Imo/Imo2024Q5.lean,Archive/MiuLanguage/Basic.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Cache/Requests.lean,Counterexamples/PolynomialIsDomain.lean,Mathlib.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/ConvergentsEquiv.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Int/Even.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Algebra/Homology/Augment.lean,Mathlib/Algebra/Homology/Embedding/Connect.lean,Mathlib/Algebra/Lie/LieTheorem.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/Weights/Chain.lean,Mathlib/Algebra/Lie/Weights/RootSystem.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/Field/Power.lean,Mathlib/Algebra/Order/Group/Unbundled/Int.lean,Mathlib/Algebra/Order/Module/HahnEmbedding.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Polynomial/CoeffList.lean,Mathlib/Algebra/Polynomial/Degree/CardPowDegree.lean,Mathlib/Algebra/Polynomial/Degree/IsMonicOfDegree.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/Factors.lean,Mathlib/Algebra/Polynomial/Homogenize.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/Algebra/Polynomial/SumIteratedDerivative.lean,Mathlib/Algebra/Ring/Action/Invariant.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/Periodic.lean,Mathlib/Algebra/Ring/Subsemiring/Defs.lean,Mathlib/Algebra/Star/Module.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/SpreadingOut.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/AlgebraicTopology/DoldKan/Degeneracies.lean,Mathlib/AlgebraicTopology/DoldKan/Faces.lean,Mathlib/AlgebraicTopology/Quasicategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplicialSet/Horn.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/Convex/Between.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convex/StdSimplex.lean,Mathlib/Analysis/Distribution/TemperateGrowth.lean,Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean,Mathlib/Analysis/Matrix/Spectrum.lean,Mathlib/Analysis/Meromorphic/Basic.lean,Mathlib/Analysis/Normed/Affine/Simplex.lean,Mathlib/Analysis/Normed/Field/UnitBall.lean,Mathlib/Analysis/Normed/Group/SemiNormedGrp/Kernels.lean,Mathlib/Analysis/Normed/Module/Ball/RadialEquiv.lean,Mathlib/Analysis/Normed/Ring/Ultra.lean,Mathlib/Analysis/NormedSpace/MStructure.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/CategoryTheory/ConcreteCategory/UnbundledHom.lean,Mathlib/CategoryTheory/Groupoid/Subgroupoid.lean,Mathlib/Combinatorics/Additive/AP/Three/Defs.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean,Mathlib/Combinatorics/Quiver/Arborescence.lean,Mathlib/Combinatorics/Schnirelmann.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean,Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean,Mathlib/Computability/Primrec.lean,Mathlib/Control/Random.lean,Mathlib/Data/Char.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Inv.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/SuccPred.lean | 297 | 5 | ['JovanGerb', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 169 days ago | 1 minute |
| 25802 | dagurtomas | feat(AlgebraicTopology): anodyne morphisms of simplicial sets | --- [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #20201.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/20201* | WIP t-topology | 145/0 | Mathlib/AlgebraicTopology/Anodyne.lean,Mathlib/AlgebraicTopology/KanFibration.lean,Mathlib/CategoryTheory/MorphismProperty/WeakSaturation.lean | 3 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 323 days ago | 2 seconds |
| 6268 | eric-wieser | fix: fixups to #3838 | This is an attempt to make #3838 universe polymorphic --- [](https://gitpod.io/from-referrer/) * Depends on #6271 * Depends on #8876 | merge-conflict WIP | 186/107 | Mathlib/Control/Random.lean,Mathlib/Tactic/SlimCheck.lean,Mathlib/Testing/SlimCheck/Functions.lean,Mathlib/Testing/SlimCheck/Gen.lean,Mathlib/Testing/SlimCheck/Sampleable.lean,Mathlib/Testing/SlimCheck/Testable.lean,test/slim_check.lean | 7 | 10 | ['github-actions', 'kim-em'] | nobody | 5 months ago | unknown | 0 seconds |
| 6859 | MohanadAhmed | feat: TryLean4Bundle: Windows Bundle Creator | # `TryLean4Bundle`: Windows Bundle Creator A Windows batch script and a CI yml file that create an self extracting archive. The user should 1. just download the archive, 2. double click the archive to expand 3. double click the `RunLean.bat` script in the expanded archive. The script currently downloads 7 dependencies into CI then unpacks them in the appropriate locations and finally packs them back. To try a bundle created using these scripts but from a different repo see (https://github.com/MohanadAhmed/TryLean4Bundle/releases) --- [](https://gitpod.io/from-referrer/) | WIP help-wanted CI | 114/0 | .github/workflows/mk_windows_bundle.yml,scripts/windowsBundle.bat | 2 | 0 | [] | nobody | 5 months ago | 975 days ago | 7 minutes |
| 6993 | jjaassoonn | feat: lemmas about `AddMonoidAlgebra.{divOf, modOf}` | --- - [x] depends on: #7582 - [x] depends on: #8975 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 147/3 | Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/MvPolynomial/Basic.lean,Mathlib/Data/MvPolynomial/CommRing.lean,Mathlib/Data/MvPolynomial/Division.lean | 5 | 42 | ['YaelDillies', 'alreadydone', 'digama0', 'eric-wieser', 'github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 833 days ago | 103 days |
| 7427 | MohanadAhmed | feat: eigenvalues sorted in ascending/descending order | In the file `Analysis.InnerProductSpace.Spectrum` todo notes were left saying: > TODO Postcompose with a permutation so that these eigenvectors are listed in increasing order of eigenvalue. > TODO Postcompose with a permutation so that these eigenvalues are listed in increasing order. - This is a start in that direction --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 162/4 | Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/NormedSpace/PiLp.lean,Mathlib/LinearAlgebra/Matrix/Spectrum.lean | 3 | 0 | [] | nobody | 5 months ago | unknown | 0 seconds |
| 9339 | FMLJohn | feat(RingTheory/GradedAlgebra/HomogeneousIdeal): given a finitely generated homogeneous ideal of a graded semiring, construct a finite spanning set for the ideal which only contains homogeneous elements | --- - [ ] depends on: #8187 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 402/4 | Mathlib.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/RingTheory/Finiteness.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean | 8 | 11 | ['FMLJohn', 'github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 847 days ago | 6 days |
| 9564 | AntoineChambert-Loir | chore: weaken commutativity assumptions for AdjoinRoot.lift and AdjoinRoot.liftHom | I weaken a commutativity assumption for docs#AdjoinRoot.liftHom that the target algebra be commutative. It is only assumed to be a Semiring. For that, I need to generalize docs#AdjoinRoot.lift which takes `i : R ->+* S`, `a : S` with `f.eval₂ i a = 0` and defines `AdjoinRoot f ->+* S` that extends `i ` and sends `AdjoinRoot.root f` to `a`. --- The initial version of the PR was to define `AdjoinRoot.lift'` where `S` is only a Semiring, with the additional assumption `hcomm : ∀ r, Commute (i r) a` that the element `a` commutes with the image of `i`. @jcommelin suggested to provide this argument as an `autoParam`, filled in by an ad hoc `commutativity` tactic. However, such an argument cannot be made implicit and a first version required to have this argument given each time, most of the time by `_`, even for all subsequent lemmas, `AdjoinRoot.lift_mk`, etc. To avoid this, I tried to make this assumption a `⦃hcomm : ∀ r, Commute (i r) a⦄`. This appears to have some side effects that proofs using an `exact` tactic or in term mode do not work well, but one can resort on `by simp […]`. Maybe @eric-wieser or @Vierkantor will have opinions on that. In some cases one can still give the argument as `(hcomm := by commutativity)`. (There are 3 options : - separate lemmas for the fully commutative case and for the case where a proof is needed - using the `commutativity` tactic, but with an argument `_` sometimes - using the optional argument.) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 146/30 | Mathlib.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Commutativity.lean,Mathlib/Tactic/Commutativity/Init.lean | 8 | 14 | ['AntoineChambert-Loir', 'Vierkantor', 'eric-wieser', 'jcommelin'] | nobody | 5 months ago | 760 days ago | 16 days |
| 10026 | madvorak | feat: linear programming according to Antoine Chambert-Loir's book | --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 86/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearProgramming.lean | 2 | 10 | ['eric-wieser', 'madvorak', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | nobody | 5 months ago | 667 days ago | 154 days |
| 10159 | madvorak | feat: linear programming according to Antoine Chambert-Loir's book — affine version | --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 83/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearProgramming.lean | 2 | 8 | ['eric-wieser', 'madvorak', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | nobody | 5 months ago | 667 days ago | 152 days |
| 10349 | Shamrock-Frost | refactor(CategoryTheory/MorphismProperty): some clean-ups | We make explicit some of the galois connections/closure operators in the existing MorphismProperty file, rewrite some proofs to take advantage of these structures, and change map/inverseImage by (1) swapping their argument order, for consistency with Set.range and Set.preimage and (2) making "map" perform the strict, evil map while "essMap" (previously called map) forms the closure of the image under isomorphisms. Finally we add `IsMultiplicative` instances for isos/epis/monos, with an eye towards constructing the wide subcategory on these classes of maps. --- - [x] depends on: #10347 - [x] depends on: #10348 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 474/318 | Mathlib/CategoryTheory/Localization/Composition.lean,Mathlib/CategoryTheory/Localization/LocalizerMorphism.lean,Mathlib/CategoryTheory/MorphismProperty.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Order/Closure.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Order/RelIso/Basic.lean | 8 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 813 days ago | 6 minutes |
| 11021 | jstoobysmith | feat(AlgebraicTopology): add join of augmented SSets | This pull-request adds the definition of the join of augmented SSets defined as contravariant functors from `WithInitial SimplexCategory` to `Type u`. In addition it shows that the join of two standard augmented SSets is again an augmented SSets. From this the definition of the join of simplicial sets should follow easily. To aid the above theory, an api for `WithInitial SimplexCategory` has been created, with the notion of the `join` and `split` (forming a sort of inverse to join) of objects in this category are defined. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-topology new-contributor | 2137/1 | .gitignore,Mathlib.lean,Mathlib/AlgebraicTopology/Join.lean,Mathlib/AlgebraicTopology/SimplexCategory.lean,Mathlib/AlgebraicTopology/SimplexCategoryWithInitial.lean,Mathlib/AlgebraicTopology/SimplicialSet.lean | 6 | 47 | ['github-actions', 'jcommelin'] | nobody | 5 months ago | 792 days ago | 1 day |
| 11800 | JADekker | feat: KappaLindelöf spaces | Define KappaLindelöf spaces by following the first one-third of the API for Lindelöf spaces. The remainder will be added in a future PR. --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-topology awaiting-zulip | 301/2 | Mathlib.lean,Mathlib/Topology/Compactness/KappaLindelof.lean,Mathlib/Topology/Compactness/Lindelof.lean | 3 | 38 | ['ADedecker', 'JADekker', 'PatrickMassot', 'StevenClontz', 'adomani', 'github-actions', 'grunweg', 'kim-em', 'urkud'] | nobody | 5 months ago | 638 days ago | 123 days |
| 12087 | JADekker | feat: complete API for K-Lindelöf spaces | --- - [ ] depends on: #11800 (which is now awaiting a design decision) [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-topology blocked-by-other-PR | 789/17 | Mathlib.lean,Mathlib/Order/Filter/CardinalInter.lean,Mathlib/Topology/Compactness/KLindelof.lean,Mathlib/Topology/Compactness/Lindelof.lean | 4 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 638 days ago | 99 days |
| 12251 | ScottCarnahan | refactor(RingTheory/HahnSeries): several generalizations | This PR is a container for several smaller PRs that refactor and generalize the existing Hahn series theory. It is (I think) all we need from Hahn series to get a palatable theory of vertex algebras off the ground (other prerequisites from Lie algebras will eventually come in a different PR). Major changes include: - equivalence between iterated Hahn series and Hahn series on Lex products. - introduce `orderTop` and `leadingCoeff` functions. Here, `orderTop` is a `WithTop Γ`-valued version of `order` that does not need `[Zero Γ]` and `leadingCoeff` returns the coefficient of the minimal element of support (or zero if empty). - introduce ordered and cancellative vector addition classes together with some basic theory e.g., finiteness of antidiagonals for partially well-ordered sets. - `HahnSeries Γ R`-module structure on `HahnModule Γ' R V`, when `Γ` is an `OrderedCancelAddCommMonoid`, `Γ'` is a `PartialOrder` with `OrderedCancelVAdd Γ Γ'`, `R` is a semiring, and `V` is an `R`-module. - Move `AddVal` to a separate file - the underlying function is just `orderTop`, but the description of the valuation needs an additional import and an `IsDomain` hypothesis. Results that depended on `AddVal` are changed to use `orderTop` and generalized. --- - [x] depends on: #10781 [HahnSeries on Lex product] - [x] depends on: #10846 [HahnModule] - [x] depends on: #11965 [orderTop] - [x] depends on: #11979 [OrderedVAdd] - [x] depends on: #12996 [leadingTerm] - [x] depends on: #16649 - [x] depends on: #16701 - [x] depends on: #17004 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra t-order | 1059/97 | Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/HahnSeries/Basic.lean,Mathlib/RingTheory/HahnSeries/HEval.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Summable.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 648 days ago | 42 days |
| 12394 | JADekker | feat: define pre-tight and tight measures | Define tight measures (by first defining separable and pre-tight measures). Define some api for all three concepts Prove Ulam's tightness theorem and a strengthened version of this. --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict awaiting-author t-measure-probability | 503/0 | Mathlib.lean,Mathlib/MeasureTheory/Measure/Tight.lean | 2 | 34 | ['EtienneC30', 'JADekker', 'github-actions', 'sgouezel'] | nobody | 5 months ago | 725 days ago | 2 days |
| 12452 | JADekker | feat(Cocardinal): add some more api | Just a small PR to add a bit more API for cocardinal filters. Not everything seems to generalise nicely from cofinite, so I didn't include such results. Currently the file has one `sorry`, I'm not sure how to complete this proof. --- [](https://gitpod.io/from-referrer/) | t-topology awaiting-CI | 75/0 | Mathlib/Order/Filter/Cocardinal.lean | 1 | 0 | [] | nobody | 5 months ago | 735 days ago | 34 minutes |
| 14426 | adomani | feat: `#min_imps` command (development branch) | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 142/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MinImports.lean,test/MinImports.lean | 4 | 2 | ['adomani', 'github-actions'] | nobody | 5 months ago | 665 days ago | 31 seconds |
| 14686 | smorel394 | feat(AlgebraicGeometry/Grassmannian): define the Grassmannian scheme | # The Grassmannian scheme Define the Grassmannian scheme by gluing affine charts. We fix a commutative ring `K`, a free `K`-module of finite type `V` and two natural numbers `r` and `c`. The scheme we define should parametrize surjective `K`-linear maps `V →ₗ[K] (Fin r → K)`, assuming that `V` is of rank `r + c`. We actually define the scheme without assuming the condition on the rank of `V`, but it is empty unless the rank of `V` is `r + c`. Main definitions: * `Grassmannian.glueData K V r c`: the `AlgebraicGeometry.Scheme.GlueData` defining the Grassmannian scheme. * `Grassmannian K V r c`: the Grassmannian scheme, defined as `(Grassmannian.glueData K V r c).glued`. * `Grassmannian.structMorphism K V r c`: the structural morphism from `Grassmannian K V r c` to `Spec K`. # Implementation We use as index type for the charts the type `Basis (Fin (r + c)) K V` (so this is empty unless `V` is free of rank `r + c`). All the charts are the same and equal to the affine space with coordinates indexed by `Fin c × Fin r`, that is, to `Spec (MvPolynomial (Fin c × Fin r) K)`. The idea is that, for `i` in `Basis (Fin (r + c)) K V`, the corresponding chart will parametrize all surjective `K`-linear maps `φ : V →ₗ[K] (Fin r → K)` that become isomorphisms when restricted to the `K`-submodule generated by the first `r` vectors of the basis `i`. To get the point of the chart corresponding to `φ`, we take the matrix of `φ` in the basis `i` of `V` and the canonical basis of `Fin r → K`, we divide it on the right by its top `r × r` square submatrix (which is invertible by assumption), and we taken the botton `c × r` submatrix. This is almost the usual description of the Grassmannian by charts, with three differences: * We consider the Grassmannian parametrizing `r`-dimensional quotients of `V` instead of `r`-dimensional subspaces of `V`, because this is more natural when working over a general ring (or scheme). * In the usual description, we fix a basis of `V` and index the chart by its subsets `I` of cardinality `r`. Here, to avoid making a choice, we instead index charts by the set of bases of `V` and always choose the subset `I` to consist of the first `r` vectors. * Instead of working with `FiniteDimensional.finrank K V - r`, which would cause technical trouble because of the way subtraction works on `ℕ`, we introduce the codimension `c` as an auxiliary variable, and our constructions are only interesting when `r + c` is equal to `FiniteDimensional.finrank K V`. # Why is this a WIP * There a bunch of lemmas in the file `AlgebraicGeometry/Grassmannian/Lemmas.lean` that either should not be necessary or should be put in another PR for some other part of mathlib. * The proofs in `AlgebraicGeometry/Grassmannian/Basic.lean` are probably too complicated, and the names suck. # Notes. This contribution was created as part of the AIM workshop "Formalizing algebraic geometry" in June 2024. --- - [x] depends on: #14711 [](https://gitpod.io/from-referrer/) | please-adopt WIP workshop-AIM-AG-2024 merge-conflict t-algebraic-geometry | 1002/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/Grassmannian/Basic.lean,Mathlib/AlgebraicGeometry/Grassmannian/Lemmas.lean | 3 | 15 | ['erdOne', 'github-actions', 'joelriou', 'leanprover-community-mathlib4-bot', 'smorel394'] | nobody | 5 months ago | 657 days ago | 3 minutes |
| 17071 | ScottCarnahan | feat(LinearAlgebra/RootSystem): separation, base, cartanMatrix | This PR defines an abstract separation structure for roots, together with the associated base and Cartan Matrix. In general, the good properties will follow from additional order hypotheses on the base ring (implemented in a future PR). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 111/0 | Mathlib.lean,Mathlib/LinearAlgebra/RootSystem/Separation.lean | 2 | 1 | ['github-actions'] | nobody | 5 months ago | 564 days ago | 20 days |
| 17471 | joelriou | feat(Algebra/ModuleCat/Differentials/Sheaf): the sheaf of relative differentials | --- - [ ] depends on: #17366 - [x] depends on: #17388 - [x] depends on: #16755 - [ ] depends on: #17469 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR t-category-theory large-import merge-conflict t-algebraic-geometry | 740/10 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Differentials/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Differentials/Sheaf.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Pullback.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/Ring/Hom/Defs.lean,Mathlib/AlgebraicGeometry/Modules/Differentials.lean,Mathlib/Geometry/RingedSpace/SheafedSpace.lean | 9 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 18626 | hannahfechtner | feat: define Artin braid groups | Define the Artin braid group on infinitely many strands. Includes a toGroup function which defines a function out of the braid group to any other group (given a function which satisfies the braid relations) (more to come in this file; next up: Artin braid groups on finitely many strands) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 91/0 | Mathlib.lean,Mathlib/GroupTheory/SpecificGroups/BraidGroup/Basic.lean | 2 | 22 | ['github-actions', 'hannahfechtner', 'jcommelin', 'joelriou'] | nobody | 5 months ago | 526 days ago | 15 days |
| 18784 | erdOne | feat(AlgebraicGeometry): use `addMorphismPropertyInstances` | --- - [ ] depends on: #18785 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry blocked-by-other-PR | 435/91 | Mathlib.lean,Mathlib/AlgebraicGeometry/Cover/Open.lean,Mathlib/AlgebraicGeometry/Morphisms/Affine.lean,Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean,Mathlib/AlgebraicGeometry/Morphisms/FinitePresentation.lean,Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean,Mathlib/AlgebraicGeometry/Morphisms/OpenImmersion.lean,Mathlib/AlgebraicGeometry/Morphisms/Proper.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean,Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean,Mathlib/AlgebraicGeometry/Restrict.lean,Mathlib/CategoryTheory/MorphismProperty/Composition.lean,Mathlib/CategoryTheory/MorphismProperty/Limits.lean,Mathlib/CategoryTheory/MorphismProperty/Tactic.lean,MathlibTest/AddMorphismPropertyInstances.lean | 18 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 538 days ago | 12 minutes |
| 19062 | hannahfechtner | feat(Algebra/PresentedMonoid/Basic): facts about rel | Add in a number of useful theorems (reflexivity, closure under multiplication) and lemmas about when the PresentedMonoid.rel holds as an API for users --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 38/0 | Mathlib/GroupTheory/Congruence/Defs.lean | 1 | 8 | ['github-actions', 'hannahfechtner', 'kbuzzard', 'riccardobrasca'] | nobody | 5 months ago | 430 days ago | 87 days |
| 19607 | madvorak | feat: block matrices are totally unimodular | --- Discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/TU.20block.20matrix.20.2319607 - [ ] depends on: #19323 - [ ] depends on: #20428 - [ ] depends on: #20433 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR | 156/0 | Mathlib.lean,Mathlib/Data/Sum/Decompose.lean,Mathlib/LinearAlgebra/Matrix/Determinant/TotallyUnimodular.lean | 3 | 11 | ['github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'madvorak', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 20029 | FrederickPu | feat(Tactic/simps): allow for Config attributes to be set directly | Allow for Config attributes to be set directly when using initialize_simp_projection as per issue #19895 Basically modified initialize_simp_projection so that the user has the option of specifying a tuple of config option values. Ex: ``` initialize_simp_projection MulEquiv (toFun → apply, invFun → symm_apply) (fullyApplied := false) ``` These config options are then converted into projections. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP new-contributor t-meta | 34/4 | Mathlib/Tactic/Simps/Basic.lean | 1 | 11 | ['FrederickPu', 'YaelDillies', 'fpvandoorn', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 5 months ago | 499 days ago | 9 hours |
| 21269 | 658060 | feat(CategoryTheory/Topos): basic definitions and results in topos theory | This code contains basic definitions and results in topos theory, including the definition of a subobject classifier, power objects, and topoi. It is proved that every topos has exponential objects, i.e. "internal homs". The mathematical content follows chapter IV sections 1-2 of Mac Lane and Moerdijk's text "Sheaves in Geometry and Logic". --- - [x] depends on: #21281 [](https://gitpod.io/from-referrer/) | WIP t-category-theory new-contributor merge-conflict awaiting-author | 1269/0 | Mathlib.lean,Mathlib/CategoryTheory/Topos/Basic.lean,Mathlib/CategoryTheory/Topos/Classifier.lean,Mathlib/CategoryTheory/Topos/Exponentials.lean,Mathlib/CategoryTheory/Topos/Power.lean | 5 | 10 | ['658060', 'gio256', 'github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 455 days ago | 3 hours |
| 22805 | ScottCarnahan | feat(FieldTheory/Finite): fixed points of Frobenius automorphism | This PR identifies the prime field with the fixed points of frobenius. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 325/7 | Mathlib/Algebra/Algebra/ZMod.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Finite/GaloisField.lean | 4 | 1 | ['github-actions'] | nobody | 5 months ago | unknown | 0 seconds |
| 23772 | SEU-Prime | feat: Amice equivalence | i built amice equiv [](https://gitpod.io/from-referrer/) | WIP t-number-theory | 283/0 | Mathlib/NumberTheory/Padics/Amice.lean | 1 | 2 | ['grunweg'] | nobody | 5 months ago | 389 days ago | 1 hour |
| 23990 | robertmaxton42 | feat(Types.Colimits): Quot is functorial and colimitEquivQuot is natural | Add `Functor.quotFunctor` to parallel `Functor.sectionsFunctor`, witnessing that `Quot` is functorial; add `colimNatIsoQuotFunctor` to parallel `limNatIsoSectionsFunctor`, witnessing that `colimitEquivQuot` is natural in the diagram $F$. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 33/0 | Mathlib/CategoryTheory/Limits/Types/Colimits.lean | 1 | 5 | ['github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'robertmaxton42'] | nobody | 5 months ago | 375 days ago | 8 days |
| 24533 | robertmaxton42 | feat(ULift): conjugation by ULift.up/down, misc cast/heq lemmas | * Adds the convenience def `ULift.conj x := `down (f (up x))`, and corresponding basic lemmas * Adds lemmas showing that `ULift.up` and `.down` commute with casts and preserve `HEq`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data | 31/0 | Mathlib/Data/ULift.lean | 1 | 23 | ['eric-wieser', 'github-actions', 'grunweg', 'robertmaxton42'] | nobody | 5 months ago | 246 days ago | 117 days |
| 24692 | ScottCarnahan | feat(RingTheory/HahnSeries/Basic): isomorphism of Hahn series induced by order isomorphism | This PR introduces an isomorphism of Hahn series induced by an order isomorphism on the exponent posets. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 35/0 | Mathlib/RingTheory/HahnSeries/Basic.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 326 days ago | 31 days |
| 25034 | ScottCarnahan | feat(Algebra/Module/Equiv/Basic): Restriction of scalars from a semilinear equivalence to a linear equivalence | If `M` and `M₂` are both `R`-modules and modules for `S` and `S₂`, respectively, then for any ring isomorphism `e` between `S` and `S₂` and any `e`-semilinear equivalence between `M` and `M₂` that respects the `R`-action, we obtain an `R`-linear equivalence between `M` and `M₂`. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra | 28/0 | Mathlib/Algebra/Module/Equiv/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 5 months ago | 326 days ago | 20 days |
| 25831 | ScottCarnahan | feat(RingTheory/HahnSeries): Powers of a binomial | This PR introduces powers of a binomial `single g 1 - single g' 1` in a Hahn series, where the powers take values in a binomial ring. These series behave as one would expect with respect to addition of powers, and comparison with natural number powers. They are often used in the theory of vertex algebras. --- - [x] depends on: #25830 - [x] depends on: #27497 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24102.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24102* | merge-conflict WIP t-ring-theory | 132/0 | Mathlib.lean,Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/HahnSeries/Binomial.lean,Mathlib/RingTheory/HahnSeries/HEval.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean | 5 | 14 | ['ScottCarnahan', 'github-actions', 'kbuzzard', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | kbuzzard | 5 months ago | 179 days ago | 80 days |
| 26455 | ScottCarnahan | feat(LinearAlgebra/RootSystem): API for CartanMatrix | Some attempts at working out good ways to eliminate bad Cartan matrices. Very much WIP --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 815/26 | Mathlib/Algebra/Group/Action/Faithful.lean,Mathlib/LinearAlgebra/LinearIndependent/Basic.lean,Mathlib/LinearAlgebra/RootSystem/Base.lean,Mathlib/LinearAlgebra/RootSystem/CartanMatrix.lean,Mathlib/LinearAlgebra/RootSystem/Finite/CanonicalBilinear.lean,Mathlib/LinearAlgebra/RootSystem/Finite/Lemmas.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Relations.lean,Mathlib/LinearAlgebra/RootSystem/IsValuedIn.lean,Mathlib/LinearAlgebra/RootSystem/RootPositive.lean | 9 | 8 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 308 days ago | 4 hours |
| 26804 | kckennylau | feat(SetTheory): ZFSet is a model of ZFC | --- Depends on: * [ ] #26644 `Mathlib/SetTheory/ZFC/Model.lean` is the main file, and it starts at Line 346. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-set-theory | 1245/0 | Mathlib.lean,Mathlib/SetTheory/ZFC/Axioms.lean,Mathlib/SetTheory/ZFC/Model.lean,docs/references.bib | 4 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 5 months ago | 299 days ago | 2 minutes |
| 26890 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): more API for `DayFunctor` | We provide some lemmas that helps characterizing the monoidal structure on `DayFunctor`, they are special cases of the lemmas for `LawfulDayConvolutionMonoidalCategoryStruct`. --- - [x] depends on: #26824 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 1372/19 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean | 4 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 297 days ago | 8 minutes |
| 26310 | kckennylau | feat: binary forms | This PR provides the basic definition of binary forms, which are homogeneous polynomials in two variables. --- - [ ] depends on: #26312 - [ ] depends on: #26313 - [ ] depends on: #26314 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 73/0 | Mathlib.lean,Mathlib/RingTheory/MvPolynomial/BinaryForm.lean | 2 | 14 | ['MichaelStollBayreuth', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'ocfnash'] | ocfnash | 5 months ago | 255 days ago | 7 days |
| 26283 | kckennylau | feat: resultant of polynomials | --- This is a WIP PR for resultant for me to get cache. PRs produced: * [x] #25139 (migrated to #26091) * [x] #25270 * [x] #25279 * [x] #25293 * [x] #25294 * [x] #25305 * [x] #26285 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 1190/0 | Mathlib.lean,Mathlib/Algebra/Polynomial/Resultant/Basic.lean,Mathlib/Algebra/Polynomial/Resultant/MvPolynomial.lean,Mathlib/RingTheory/Polynomial/Discriminant.lean | 4 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 312 days ago | 19 seconds |
| 27991 | sinianluoye | feat(Rat): add Rat.den_eq_of_add_den_eq_one and its dependent lemmas | ```lean4 example {q r : ℚ} (h : (q + r).den = 1) : q.den = r.den := by ``` It is so simple, but I couldn't find it in current mathlib repo. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data new-contributor | 22/0 | Mathlib/Data/Rat/Lemmas.lean | 1 | 33 | ['github-actions', 'kim-em', 'mathlib-bors', 'pechersky', 'sinianluoye', 'themathqueen'] | pechersky | 5 months ago | 192 days ago | 74 days |
| 28215 | 5hv5hvnk | feat: strong and Weak connectivity for Digraphs | strong and weak connectivity in Digraphs --- Should resolve a part of issue #26771 Main additions in the PR: 1. Walks in Digraphs (Walk.lean) - Basic walk structure with start and end vertices - Support for walk operations: append, reverse, length - Support functions: getVert, copy, support 2. Walk Decompositions (WalkDecomp.lean) - takeUntil and dropUntil functions to split walks - rotate operation for loop walks - Theorems relating to walk decomposition properties 3. Subgraphs (subgraph.lean) - Subgraph structure for digraphs - Induced and spanning subgraph predicates - Lattice structure (sup, inf, top, bot) - Coercion to standalone digraphs 4. Paths (Paths.lean) - Trail, Path, Circuit, Cycle definitions - Path structure with no repeating vertices - Theorems relating different path types - Basic connectivity definitions (reachable, weakly/strongly connected) 5. Connectivity (Connected.lean) - Reachability relations and properties - Strong and weak connectivity definitions - Connected component types: - StronglyConnectedComponent - WeaklyConnectedComponent - ConnectedComponent - Component properties and equivalence relations --> [](https://gitpod.io/from-referrer/) | WIP new-contributor merge-conflict awaiting-author t-combinatorics | 1266/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Connected.lean,Mathlib/Combinatorics/Digraph/Paths.lean,Mathlib/Combinatorics/Digraph/Subgraph.lean,Mathlib/Combinatorics/Digraph/Walk.lean,Mathlib/Combinatorics/Digraph/WalkDecomp.lean | 6 | 4 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 263 days ago | 7 minutes |
| 28970 | Whysoserioushah | feat(Algebra/Algebra/ReducedNorm): defines reduced norm and trace | TODO : 1. add the theorem proving reduced charpoly is independent from the choice of AlgEquiv (blocked by this [discussion](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Algebra.2ETensorProduct.2Eassoc/with/536349758)) 2. prove reduced charpoly is "actually" in the polynomial ring of base field (blocked by this [discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.E2.9C.94.20Refactor.20Subfield)) therefore content about this topic is basically the best I could do for now :-( --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 66/0 | Mathlib.lean,Mathlib/Algebra/Algebra/ReducedNorm.lean | 2 | 19 | ['Whysoserioushah', 'chrisflav', 'erdOne', 'eric-wieser', 'github-actions', 'kbuzzard', 'mathlib4-merge-conflict-bot'] | chrisflav | 5 months ago | 207 days ago | 40 days |
| 29212 | Whysoserioushah | feat(Algebra/CrossProductAlgebra/Defs): define Cross Product Algebra | PS: All to-dos listed in the file has been fully sorry-freed and will be (slowly) upstreamed by either me or Yaël
Co-authored-by: Yaël Dillies |
merge-conflict awaiting-author t-algebra | 270/0 | Mathlib.lean,Mathlib/RepresentationTheory/CrossProductAlgebra/Defs.lean,docs/references.bib | 3 | 9 | ['Whysoserioushah', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 236 days ago | 5 days |
| 29514 | grunweg | feat(CI): use more strict mode | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP CI | 192/33 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/ValidatePRTitle.lean,lakefile.lean,scripts/README.md,scripts/check_title_labels.lean | 10 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 233 days ago | 1 second |
| 29574 | JarodAlper | feat: regular local rings are domains | We have added three new files in Mathlib/RingTheory/LocalRing * EmbeddingDimension.lean * LocalRingDimension.lean * RegularLocalRings.lean We have added two lemmas and an instance in Mathlib/RingTheory/LocalRing/RingHom/Basic.lean This work was done by Jarod Alper and Brian Nugent. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory new-contributor | 910/3 | Mathlib.lean,Mathlib/RingTheory/LocalRing/EmbeddingDimension.lean,Mathlib/RingTheory/LocalRing/LocalRingDimension.lean,Mathlib/RingTheory/LocalRing/RegularLocalRings.lean,Mathlib/RingTheory/LocalRing/RingHom/Basic.lean,lake-manifest.json | 6 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 230 days ago | 17 minutes |
| 28718 | imbrem | feat: class for chosen finite coproducts | Added basic `ChosenFiniteCoproducts` class, and started porting some of the lemmas about `ChosenFiniteProducts` suitably translated --- This, combined with #20182 modified to use chosen finite coproducts and premonoidal categories (#21488), should be enough for me to formalize strong Elgot categories, and hence a lot of categorical iteration theory for my PhD thesis. Re-done from #21603 to deal with changes in #24399 and #24390 Eventually, if we really want to harmonize approaches, we could introduce an `AddMonoidalCategory` struct and do the analogous to #24399 and #24390 for additive monoidal structure, but that seems like a massive overcomplication for now. It would allow formalizing fun things like rig categories, though. - [ ] depends on: #30150 | blocked-by-other-PR t-category-theory new-contributor merge-conflict awaiting-author | 290/0 | Mathlib.lean,Mathlib/CategoryTheory/ChosenFiniteCoproducts.lean | 2 | 9 | ['YaelDillies', 'github-actions', 'imbrem', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 5 months ago | 253 days ago | 9 minutes |
| 30366 | sinhp | feat(CategoryTheory): The Preliminaries for Locally Cartesian Closed Categories | See https://github.com/leanprover-community/mathlib4/pull/21525 This PR defines the basic preliminaries for defining locally cartesian closed categories (LCCCs). First, we develop a computable implementation of pullbacks, by introducing a new type-class `ChosenPullback`. The non-computable `HasPullbacksAlong` and `HasPullbacks` predicates yield instances of `ChosenPullback` using global choice, but interestingly in the category of types every morphism has chosen pullbacks. Also, cartesian monoidal categories, morphisms to the terminal object and the product projections have chosen pullbacks. We prove that `ChosenPullback` has good closure properties, e.g., isos have chosen pullbacks, and composition of morphisms with chosen pullbacks have chosen pullbacks. Separately, we prove that pull-push along a morphism with chosen pullbacks gives the (cartesian) binary product of that morphism, seen as an object of a slice category, and any other object of the same slice category. In fact, we also prove the stronger statement, namely that the pull-push composition `(Over.ChosenPullback.pullback Z.hom) ⋙ (Over.map Z.hom)` is naturally isomorphic to the right tensor product functor `_ × Y` in `Over X`. _This is going to be crucial in our mate-based approach to LCCCs_. Also, using the calculus of mates we define certain natural isomorphisms involving `Over.star` and `Over.pullback` which will be used in defining the right adjoint to the pullback functor in the development of LCCCs. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 4865/526 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,Mathlib.lean,Mathlib/Algebra/Algebra/Spectrum/Quasispectrum.lean,Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/BrauerGroup/Defs.lean,Mathlib/Algebra/Category/Grp/Subobject.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/CharP/Frobenius.lean,Mathlib/Algebra/Colimit/Ring.lean,Mathlib/Algebra/Field/MinimalAxioms.lean,Mathlib/Algebra/GroupWithZero/Hom.lean,Mathlib/Algebra/Homology/ComplexShapeSigns.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/Basic.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/Linear.lean,Mathlib/Algebra/Homology/DerivedCategory/Linear.lean,Mathlib/Algebra/Homology/HomologySequenceLemmas.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomologicalFunctor.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShiftSequence.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/AlgebraicGeometry/Modules/Presheaf.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/IsUniquelyCodimOneFace.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Pairing.lean,Mathlib/AlgebraicTopology/SimplicialSet/Monoidal.lean,Mathlib/AlgebraicTopology/SimplicialSet/Nerve.lean,Mathlib/AlgebraicTopology/SimplicialSet/NerveAdjunction.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplicesSubcomplex.lean,Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/Analysis/Calculus/IteratedDeriv/ConvergenceOnBall.lean,Mathlib/Analysis/Complex/OperatorNorm.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/Distribution/TemperateGrowth.lean,Mathlib/Analysis/Meromorphic/TrailingCoefficient.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean,Mathlib/CategoryTheory/Abelian/GrothendieckAxioms/Basic.lean,Mathlib/CategoryTheory/Abelian/GrothendieckAxioms/Sheaf.lean,Mathlib/CategoryTheory/Adjunction/AdjointFunctorTheorems.lean,Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Adjunction/CompositionIso.lean,Mathlib/CategoryTheory/Adjunction/Mates.lean,Mathlib/CategoryTheory/Bicategory/Strict/Pseudofunctor.lean,Mathlib/CategoryTheory/Category/ULift.lean,Mathlib/CategoryTheory/Closed/Cartesian.lean,Mathlib/CategoryTheory/Comma/StructuredArrow/Small.lean,Mathlib/CategoryTheory/ComposableArrows.lean,Mathlib/CategoryTheory/Discrete/StructuredArrow.lean,Mathlib/CategoryTheory/EssentiallySmall.lean,Mathlib/CategoryTheory/Filtered/Final.lean,Mathlib/CategoryTheory/Functor/KanExtension/Pointwise.lean,Mathlib/CategoryTheory/Generator/Abelian.lean,Mathlib/CategoryTheory/Generator/Basic.lean,Mathlib/CategoryTheory/Generator/StrongGenerator.lean,Mathlib/CategoryTheory/GuitartExact/KanExtension.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/CategoryTheory/Limits/Filtered.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/Final/Connected.lean,Mathlib/CategoryTheory/Limits/Final/Type.lean,Mathlib/CategoryTheory/Limits/HasLimits.lean,Mathlib/CategoryTheory/Limits/Preserves/Basic.lean,Mathlib/CategoryTheory/Limits/Preserves/Filtered.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean,Mathlib/CategoryTheory/Limits/Types/ColimitType.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Prelim.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean,Mathlib/CategoryTheory/ObjectProperty/ClosedUnderIsomorphisms.lean,Mathlib/CategoryTheory/ObjectProperty/CompleteLattice.lean,Mathlib/CategoryTheory/ObjectProperty/LimitsClosure.lean,Mathlib/CategoryTheory/ObjectProperty/LimitsOfShape.lean,Mathlib/CategoryTheory/ObjectProperty/Small.lean,Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean,Mathlib/CategoryTheory/Shift/ShiftedHom.lean,Mathlib/CategoryTheory/Sites/Descent/IsPrestack.lean,Mathlib/CategoryTheory/Sites/Equivalence.lean,Mathlib/CategoryTheory/Sites/LeftExact.lean,Mathlib/CategoryTheory/Sites/PreservesSheafification.lean,Mathlib/CategoryTheory/Sites/Whiskering.lean,Mathlib/Combinatorics/Enumerative/Bell.lean,Mathlib/Condensed/Discrete/Basic.lean,Mathlib/Condensed/Light/AB.lean,Mathlib/Condensed/Light/CartesianClosed.lean,Mathlib/Condensed/Light/Instances.lean,Mathlib/Condensed/Light/Module.lean,Mathlib/Data/Rel/Separated.lean,Mathlib/FieldTheory/PerfectClosure.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean | 131 | 40 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 5 months ago | 184 days ago | 3 days |
| 26765 | KiringYJ | feat(MeasureTheory/PiSystem): add π-λ theorem and SetLike instance | Add two small features to `MeasureTheory/PiSystem`: 1. SetLike instance `instance : SetLike (DynkinSystem α) (Set α)` This lets us write `s ⊆ d` and `t ∈ d` for a DynkinSystem `d`, matching usual mathlib style. 2. `DynkinSystem.pi_lambda` lemma Classical π‑λ theorem: if a π‑system `s` is contained in a Dynkin system `d`, every set measurable for `σ(s)` is also in `d`. Currently, mathlib exposes this result only indirectly (e.g. via `generateFrom_eq`). Although logically equivalent, it is not obvious at first glance that those lemmas are the π‑λ theorem. The new lemma states the result in its familiar textbook form, so users can recognise and cite it immediately. Both pieces are under 10 lines, term‑mode only, and do not modify existing APIs. No breaking changes. No dependencies. | awaiting-author t-measure-probability new-contributor | 13/0 | Mathlib/MeasureTheory/PiSystem.lean | 1 | 14 | ['EtienneC30', 'KiringYJ', 'dagurtomas', 'github-actions', 'ocfnash'] | RemyDegenne | 5 months ago | 162 days ago | 138 days |
| 29409 | Julian | feat(Mathlib/Analysis): deriv_eq_self and deriv_exp_iff | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-analysis | 29/0 | Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean | 1 | 9 | ['Julian', 'Paul-Lez', 'eric-wieser', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot'] | j-loreaux | 5 months ago | 220 days ago | 15 days |
| 27694 | grunweg | feat: Gram-Schmidt orthonormalisation preserves continuity of sections | provided the bundle metric used in the process is continuous. From the path towards geodesics and the Levi-Civita connection. Co-authored-by: Patrick Massot [patrickmassot@free.fr](mailto:patrickmassot@free.fr) --- - [ ] depends on: #27024 - [x] depends on: #27021 Baby version of #27025. [](https://gitpod.io/from-referrer/) | merge-conflict t-differential-geometry blocked-by-other-PR | 390/11 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Geometry/Manifold/VectorBundle/GramSchmidtOrtho.lean,scripts/noshake.json | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 275 days ago | 3 minutes |
| 27025 | grunweg | feat: Gram-Schmidt procedure on smooth vector bundles yields smooth sections | For the Gram-Schmidt process on a vector bundle, deduce that smoothness of the bundle metric implies smoothness of the resulting sections.
From the path towards geodesics and the Levi-Civita connection.
Co-authored-by: Patrick Massot |
merge-conflict t-differential-geometry blocked-by-other-PR | 927/11 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Geometry/Manifold/Elaborators.lean,Mathlib/Geometry/Manifold/Traces.lean,Mathlib/Geometry/Manifold/VectorBundle/GramSchmidtOrtho.lean,scripts/noshake.json | 6 | 6 | ['faenuccio', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 293 days ago | 3 minutes |
| 30637 | strihanje01 | feat(Combinatorics/SetFamily/Lindstrom): Lindstrom's theorem for subfamilies with equal unions | add Lindstrom's theorem and its strengthening for equal intersections --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 209/0 | Mathlib/Combinatorics/SetFamily/Lindstrom.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | b-mehta | 5 months ago | 160 days ago | 31 days |
| 31949 | ADedecker | chore: prefer `Pi.single i 1 j` over `fun j => if i = j then 1 else 0` | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 23/21 | Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Analysis/Convex/StdSimplex.lean,Mathlib/LinearAlgebra/Matrix/Adjugate.lean,Mathlib/LinearAlgebra/Pi.lean,Mathlib/Topology/Algebra/Module/Basic.lean | 5 | 5 | ['eric-wieser', 'github-actions', 'themathqueen'] | nobody | 5 months ago | 159 days ago | 6 hours |
| 25902 | pfaffelh | feat: The finite product of semi-rings (in terms of measure theory) is a semi-ring. | ~~Move results for rings (in terms of measure theory) to a separate file; was in Semiring.lean before.~~ For `∀ i ∈ s, IsSetSemiring (C i))`, the product `s.pi '' s.pi C` is a semiring. Prove two auxiliary lemmas in `Data.Set.Prod` needed on the way. --- *This PR continues the work from #22714.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/22714* | t-measure-probability brownian large-import merge-conflict awaiting-author | 260/14 | Mathlib/Data/Set/Pairwise/Lattice.lean,Mathlib/Data/Set/Prod.lean,Mathlib/MeasureTheory/MeasurableSpace/Pi.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/MeasureTheory/SetSemiring.lean | 5 | 7 | ['github-actions', 'mathlib4-merge-conflict-bot', 'sgouezel'] | kex-y | 5 months ago | 224 days ago | 29 days |
| 31571 | erdOne | feat(RingTheory): existence of local algebra with given residue field | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-ring-theory | 225/0 | Mathlib.lean,Mathlib/RingTheory/LocalRing/SeparableResidueField.lean | 2 | 7 | ['chrisflav', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot'] | chrisflav | 5 months ago | 158 days ago | 9 days |
| 29517 | pechersky | feat(RingTheory/Torsion): torsion = union of roots of unity | with additional API for Associates and rootsOfUnity sups --- [](https://gitpod.io/from-referrer/) - [x] depends on: #29988 - [x] depends on: #29989 - [x] depends on: #29990 - [x] depends on: #29991 | merge-conflict awaiting-author t-algebra | 149/8 | Mathlib.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/RingTheory/RootsOfUnity/Basic.lean,Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean,Mathlib/RingTheory/Torsion.lean | 5 | 35 | ['chrisflav', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | chrisflav | 5 months ago | 171 days ago | 37 days |
| 24627 | pechersky | feat(Topology/Algebra/Valued): `IsLinearTopology 𝒪[K] K` and `𝒪[K] 𝒪[K]` | as well as `IsLinearTopology ℤ_[p] ℤ_[p]` --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26829 | merge-conflict awaiting-author t-topology | 219/26 | Mathlib.lean,Mathlib/NumberTheory/Padics/LinearTopology.lean,Mathlib/Topology/Algebra/Valued/LinearTopology.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean | 5 | 55 | ['ADedecker', 'erdOne', 'faenuccio', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'loefflerd', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | jcommelin | 5 months ago | 163 days ago | 36 days |
| 27756 | grunweg | feat: `Weak(Pseudo)EMetricSpace`, generalises `(Pseudo)EMetricSpace` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology carleson | 142/36 | Mathlib/Topology/EMetricSpace/Defs.lean,Mathlib/Topology/Instances/ENNReal/Lemmas.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 274 days ago | 2 seconds |
| 31948 | ADedecker | feat: move `ContinuousSMul` to a finite extension with the module topology | My motivation is the following: to define the topology on test functions (see #31806), we take the inductive limit in the category of *real* locally convex topological vector spaces (we don't want the result to depend on the base field!). But then, we need a way to get that complex-valued test functions are also a *complex* topological vector space, which we will obtain by combining this PR with [isModuleTopologyOfFiniteDimensional](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Algebra/Module/FiniteDimension.html#isModuleTopologyOfFiniteDimensional). --- [](https://gitpod.io/from-referrer/) | merge-conflict | 109/57 | Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Module/LinearMap/Basic.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Pi.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/Algebra/Module/ModuleTopology.lean | 8 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 24016 | plp127 | feat: fine uniformity | Adds the fine uniformity, and proves some properties. --- - [ ] depends on: #24096 for showing the induced topology is equal on completely regular spaces [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 283/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/FineUniformity.lean,Mathlib/Topology/UniformSpace/Uniformizable.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 379 days ago | 2 days |
| 30995 | kckennylau | feat(RingTheory): replace ofLinearEquiv with limit | For an `I`-adically complete `M` we define `limit : AdicCompletion I M ≃ₗ[R] M`. This replaces the existing `ofLinearEquiv : M ≃ₗ[R] AdicCompletion I M` which goes in the opposite direction, and should make #30989 and subsequent PR's smoother. It is intended to be used together with [AdicCompletion.mk](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/AdicCompletion/Basic.html#AdicCompletion.mk) : `AdicCompletion.AdicCauchySequence I M →ₗ[R] AdicCompletion I M`. We also introduce `adicExpansion (ϖ : R) (hϖ : ϖ ∈ I) : (ℕ → M) →ₗ[R] AdicCauchySequence I M`, which sends a sequence `a : ℕ → M` to the Cauchy sequence `∑ ϖ ^ i • a i`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author | 77/49 | Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/RingHom.lean | 3 | 8 | ['erdOne', 'github-actions', 'jjdishere', 'kckennylau', 'mathlib4-merge-conflict-bot'] | erdOne | 5 months ago | 159 days ago | 13 days |
| 32094 | grunweg | feat(runLinter): allow only running certain linters | This adds a script `run_linter`, which is a fork of batteries' `runLinter` with extra features: - rewrite as a CLI app, so --help messages etc. come for free - add a `--list` option, which prints the list of linters it was about to run, and exists - add `--select`, `--ignore` and `--only` options which ensure certain linters are always run, never resp. that only a certain list of linters are run. (`add` takes priority over `exclude` or `only`.) - add an `update_only_remove` flag which only runs linters mentioned in the `nolints` file: this only removes entries (by design), but is often much faster. - renamed to `run_linter`: actually, per the [zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Naming.20convention/near/450896930), this should be `run-linter` --- and one could as well use the opportunity to rename this to e.g. `env-linter`. Asked [here](https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Configuring.2Fmodernizing.20runLinter). Intended use cases 1. Run `update_only_remove` when updating the nolints file. In fact, it is so fast that it could even run during regular CI, after the normal `lint` step... 2. Run the mathlib linters locally. The simpNF linters are slow enough (for a reason, but still) that doing so is currently annoying. On my notebook, they can easily take half an hour, during which my notebook is otherwise hardly usable. 3. You're developing a new linter and only want to run *that* one (as there was no change about the other ones). Probably, the nicest result would be this PR landing in batteries (perhaps in pieces) instead of here. --- I'm not happy about one detail: - many options take an `Array String`: how can I pass this to the executable? This is not obvious to me... - TODO: address the comment at https://github.com/leanprover-community/mathlib4/pull/14654#discussion_r1685824917 Continuation of #14654. Proof-of-concept; the real implementation should be in batteries/a separate repository. --- [](https://gitpod.io/from-referrer/) | t-linter CI | 154/0 | lakefile.lean,scripts/run_linter.lean | 2 | 1 | ['github-actions'] | nobody | 5 months ago | 157 days ago | 1 minute |
| 32095 | grunweg | chore: fix some explicitVarOfIff linter errors | Needs a merge, and removing the linter changes... should be re-done and split out! --- [](https://gitpod.io/from-referrer/) | please-adopt WIP merge-conflict | 320/146 | Mathlib/Analysis/LocallyConvex/Bounded.lean,Mathlib/Analysis/Oscillation.lean,Mathlib/Geometry/Manifold/LocalInvariantProperties.lean,Mathlib/MeasureTheory/Measure/EverywherePos.lean,Mathlib/SetTheory/Ordinal/Topology.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/Algebra/Monoid.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Basic.lean,Mathlib/Topology/Category/TopCat/Basic.lean,Mathlib/Topology/Clopen.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/Compactness/LocallyCompact.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/DenseEmbedding.lean,Mathlib/Topology/Gluing.lean,Mathlib/Topology/Homeomorph.lean,Mathlib/Topology/IndicatorConstPointwise.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/Irreducible.lean,Mathlib/Topology/IsLocalHomeomorph.lean,Mathlib/Topology/LocalAtTarget.lean,Mathlib/Topology/Maps/Basic.lean,Mathlib/Topology/MetricSpace/Isometry.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/LowerUpperTopology.lean,Mathlib/Topology/Partial.lean,Mathlib/Topology/PartialHomeomorph.lean,Mathlib/Topology/PartitionOfUnity.lean,Mathlib/Topology/QuasiSeparated.lean,Mathlib/Topology/Separation.lean,Mathlib/Topology/TietzeExtension.lean,Mathlib/Topology/UniformSpace/Ascoli.lean,Mathlib/Topology/UniformSpace/Basic.lean,Mathlib/Topology/UniformSpace/Cauchy.lean,Mathlib/Topology/UniformSpace/CompactConvergence.lean,Mathlib/Topology/UniformSpace/Completion.lean,Mathlib/Topology/UniformSpace/Equicontinuity.lean,Mathlib/Topology/UniformSpace/Matrix.lean,Mathlib/Topology/UniformSpace/Pi.lean,Mathlib/Topology/UnitInterval.lean,Mathlib/Topology/UrysohnsBounded.lean,Mathlib/Topology/UrysohnsLemma.lean,Mathlib/Topology/VectorBundle/Basic.lean,lakefile.lean,scripts/run_linter.lean | 49 | 0 | [] | nobody | 5 months ago | 157 days ago | 8 seconds |
| 31796 | dobronx1325 | feat(Data/Real/EReal): add mul_lt_mul_of_pos_left theorem | This PR adds the theorem `EReal.mul_lt_mul_of_pos_left`, which states that for a positive real number `a` and extended reals `b < c`, left multiplication by `a` preserves the strict order: `(a : EReal) * b < (a : EReal) * c`. The theorem complements existing order-preserving properties for addition in `EReal` and extends the algebraic structure for multiplication. The proof uses basic properties of extended reals and order relations. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 23/0 | Mathlib/Data/EReal/Operations.lean | 1 | 4 | ['JovanGerb', 'LLaurance', 'dobronx1325', 'github-actions'] | nobody | 5 months ago | 157 days ago | 6 days |
| 29899 | eric-wieser | chore: add `=Q` arguments to ring casting operations | This also detects an `isDefeq` which is unifying across universes and types, which I remember rumors about being sometimes a bad idea. I'm a little worried that the `=Q` design here runs into DTT hell, but it works in the one place that is "Qq-clean" right now, so I'd be inclined to apply it to help us learn more about the pattern in future. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 36/23 | Mathlib/Tactic/Ring/Basic.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 31920 | thorimur | test: `env_linter` for unused decidable instances | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 128/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/UnusedAssumptionInType.lean | 5 | 19 | ['github-actions', 'leanprover-bot', 'leanprover-radar', 'mathlib4-merge-conflict-bot', 'thorimur'] | nobody | 5 months ago | unknown | 0 seconds |
| 27258 | JovanGerb | feat: Imo2020 q6 | Original PR: #23431 This PR adds a solution to IMO 2020 Q6. It follows the solution that I found when I was participating in the IMO. I used the statement formalization that was given by @jsm28. --- - [x] depends on: #27257 [](https://gitpod.io/from-referrer/) | IMO awaiting-author | 335/0 | Archive.lean,Archive/Imo/Imo2020Q6.lean | 2 | 14 | ['JovanGerb', 'dwrensha', 'github-actions', 'jsm28', 'mathlib4-dependent-issues-bot'] | dwrensha | 5 months ago | 156 days ago | 64 days |
| 26138 | xroblot | Development branch (2) | --- | WIP merge-conflict | 331/70 | Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/FieldTheory/Finite/GaloisField.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean,Mathlib/NumberTheory/NumberField/CMField.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Embeddings.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Ramification.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/TotallyRealComplex.lean,Mathlib/Sandbox.lean | 11 | 16 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 316 days ago | 12 seconds |
| 29357 | eric-wieser | refactor: generalize IsSimpleRing to semirings | --- - [ ] depends on: #26277 - [ ] depends on: #22954 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 26/9 | Mathlib/Data/Setoid/Basic.lean,Mathlib/RingTheory/SimpleRing/Basic.lean,Mathlib/RingTheory/SimpleRing/Defs.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 31729 | thorimur | chore: log on theorem type signature in unused instances in type linters | Logs on the type signature in the unused instances in types linter, and tests this using `#guard_msgs (positions := true)`. --- - [ ] depends on: #31730 - [x] depends on: #31142 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR large-import | 636/3 | Mathlib.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/Lean/Environment.lean,Mathlib/Lean/Expr.lean,Mathlib/Lean/Expr/Basic.lean,Mathlib/Lean/Syntax.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/UnusedInstancesInType.lean,Mathlib/Util/DeclarationManipulation.lean,MathlibTest/UnusedInstancesInType.lean | 12 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 165 days ago | 11 minutes |
| 32157 | peabrainiac | feat(Analysis/Calculus): Hadamard's lemma | Add [Hadamard's lemma](https://en.wikipedia.org/wiki/Hadamard%27s_lemma) for functions from finite-dimensional normed spaces to Banach spaces. --- - [ ] depends on: #31141 [](https://gitpod.io/from-referrer/) | t-analysis blocked-by-other-PR | 314/5 | Mathlib.lean,Mathlib/Analysis/Calculus/Hadamard.lean,Mathlib/Analysis/Calculus/ParametricIntegral.lean,Mathlib/Analysis/Calculus/ParametricIntervalIntegral.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean | 5 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 155 days ago | 23 minutes |
| 26436 | AntoineChambert-Loir | feat(Mathlib/Data/Nat/Prime/Defs): fuel Nat.minFac | This is a fueled version of docs#Nat.minFacAux that can now be checked by `decide`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data awaiting-author | 53/48 | Mathlib/Data/Nat/Prime/Defs.lean | 1 | 3 | ['digama0', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 5 months ago | 309 days ago | 3 minutes |
| 24514 | b-mehta | chore(Int/GCD): use fuel in xgcd | Modify the definition of xgcd to use fuel recursion, to allow it to be reduced in the kernel. As a consequence, this means the evaluation of field operations in ZMod p become provable by `rfl` and `decide`. Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/opaque.20recursion.20definitions.20break.20mergeSort.20decidability --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data merge-conflict | 44/22 | Mathlib/Data/Int/GCD.lean | 1 | 6 | ['astrainfinita', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'nomeata', 'urkud'] | nobody | 5 months ago | 306 days ago | 58 days |
| 32169 | saodimao20 | feat: add convolution_comp_add_right | This PR adds a lemma `convolution_comp_translation_right` showing that convolution commutes with translation on the right operand. Specifically, it proves that for an additive commutative group $G$, the convolution of a function $f$ with a translated function $x \mapsto g(a + x)$ is equal to the convolution of $f$ and $g$ evaluated at $x + a$. --- [](https://gitpod.io/from-referrer/) | t-analysis new-contributor awaiting-author | 14/0 | Mathlib/Analysis/Convolution.lean | 1 | 3 | ['github-actions', 'urkud'] | nobody | 5 months ago | 154 days ago | 22 hours |
| 28244 | robin-carlier | feat(CategoryTheory/Bicategory/NaturalTransformation): Icons | We define icons (short for Identity Component Oplax Natural transformations) between lax functors in bicategories. Such transformations bundle an oplax natural transformation, along with the assertion that the source and target functor agree on objects, and the fact that the app-component of the underlying natural transformation is the `eqToHom` morphism along that equality. We define vertical composition of such natural transformations. Strict associativity and strict unitality of the composition of icons will be the content of a follow-up PR. In future work, icons will constitute the 2-cells of a strict bicategory structure on bicategories, with 1-cells (strictly unitary) pseudofunctors. This bicategory structure will define a category structure on strictly unitary pseudofunctors from `LocallyDiscrete (Fin n)` to a bicategory `C` (i.e "pseudo-composable arrows" in `C`), which will be part of the definition of the 2-nerve of `C`, which is a simplicial category that encodes higher compositions within a bicategory `C`. --- - [ ] depends on: #25825 - [ ] depends on: #28243 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR t-category-theory awaiting-CI large-import merge-conflict | 816/33 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/EqToHom.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Icon.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Lax.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Oplax.lean,Mathlib/CategoryTheory/Bicategory/Strict.lean,Mathlib/CategoryTheory/EqToHom.lean,scripts/noshake.json | 8 | 4 | ['github-actions', 'joelriou', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 263 days ago | 19 minutes |
| 29933 | smmercuri | chore: fix `def` naming isses in `Normed/Field/WithAbs.lean` | --- - [x] depends on: #29932 [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 33/23 | Mathlib/Analysis/Normed/Field/WithAbs.lean,Mathlib/NumberTheory/NumberField/AdeleRing.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Completion.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 218 days ago | 1 day |
| 31350 | grunweg | feat: (unoriented) bordism groups | We define the unoriented bordism group of a topological space and prove that it is an abelian group: we don't prove transitivity of bordisms yet, as that requires the collar neighbourhood theorem and gluing of smooth manifolds, which are both not in mathlib and a sizable piece of work. --- This PR is not ready for review yet; I'm merely opening this to track this branch' state better. In particular, this PR depends on several preliminary PRs: - [ ] depends on: #15906 for defining singular manifolds - [ ] depends on: #23040: define immersions and smooth embeddings: in finite dimensions, these are easy to describe; for mathlib, we will want a correct definition for e.g. Banach manifolds also. - [ ] depends on: #28793 is the first step for this - [ ] depends on: #31351 defines manifolds with smooth boundary: the main dependence are smooth embeddings (and some basic results about these), then the definition needs redoing. - depends on: #22874 for some constructions - defining unoriented bordisms, and proving some basic constructions about them: will be another PR This PR continues the work from #23138. | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 1084/2 | Mathlib.lean,Mathlib/Geometry/Manifold/Bordisms.lean,Mathlib/Geometry/Manifold/Diffeomorph.lean,Mathlib/Geometry/Manifold/HasSmoothBoundary.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 175 days ago | 1 minute |
| 32126 | nielsvoss | feat(Analysis/Normed/Operator): definition of singular values for linear maps | This PR defines a generalization of singular values, the approximation numbers, for continuous linear maps between normed vector spaces. It proves basic lemmas about the approximation numbers and shows that for finite-dimensional vector spaces, the approximation numbers coincide with the standard definition of singular values.
See the discussion on Zulip: https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Singular.20Value.20Decomposition/with/558914024
Co-authored-by: Arnav Mehta |
WIP t-analysis new-contributor | 331/0 | Mathlib/Analysis/Normed/Operator/SingularValues.lean | 1 | 2 | ['github-actions', 'nielsvoss'] | nobody | 5 months ago | unknown | 0 seconds |
| 26389 | jjdishere | feat(RingTheory): Perfectoid Field | This PR continues the work from #19972. Original PR: https://github.com/leanprover-community/mathlib4/pull/19972 | t-algebra WIP t-topology t-analysis | 150/0 | Mathlib/RingTheory/Perfectoid.lean | 1 | 2 | ['github-actions', 'jjdishere'] | nobody | 5 months ago | 310 days ago | 1 minute |
| 28895 | yury-harmonic | feat(NumberTheory): prove Zsigmondy's theorem | --- - [x] depends on: #28879 - [x] depends on: #28825 - [x] depends on: #28833 - [x] depends on: #28888 - [x] depends on: #28830 - [x] depends on: #28765 - [x] depends on: #28886 - [x] depends on: #28934 [](https://gitpod.io/from-referrer/) | 1307/0 | Mathlib.lean,Mathlib/NumberTheory/Zsigmondy.lean | 2 | 8 | ['dupuisf', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'yury-harmonic'] | nobody | 4 months ago | unknown | 0 seconds | |
| 31950 | callesonne | feat(CategoryTheory/Product/Basic): make `Hom` into a 1-field structure | This should help unification. --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory merge-conflict | 80/68 | Mathlib/CategoryTheory/Comma/Basic.lean,Mathlib/CategoryTheory/Discrete/SumsProducts.lean,Mathlib/CategoryTheory/Functor/Currying.lean,Mathlib/CategoryTheory/Functor/CurryingThree.lean,Mathlib/CategoryTheory/Functor/Hom.lean,Mathlib/CategoryTheory/Groupoid.lean,Mathlib/CategoryTheory/Limits/FormalCoproducts.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/MorphismProperty/Basic.lean,Mathlib/CategoryTheory/Products/Associator.lean,Mathlib/CategoryTheory/Products/Basic.lean,Mathlib/CategoryTheory/Products/Unitor.lean,Mathlib/CategoryTheory/Sums/Products.lean,Mathlib/CategoryTheory/Yoneda.lean | 14 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 160 days ago | 6 seconds |
| 8224 | Kha | chore: add `lean4checker` benchmark | WIP merge-conflict | 16/0 | scripts/bench/temci-config.run.yml | 1 | 4 | ['Kha', 'grunweg', 'kim-em', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 907 days ago | 2 hours | |
| 22416 | JLimperg | chore: fix benchmark script for precompilation | The benchmarking script used to fail when precompilation was enabled anywhere in the dependency graph. --- Fix courtesy of @Kha. [](https://gitpod.io/from-referrer/) | merge-conflict | 2/0 | scripts/bench/fake-root/lib/lean/libleanshared.so,scripts/bench/run | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 27579 | RemyDegenne | feat: risk of an estimator, DeGroot statistical information, total variation distance | This is an overview PR and will be cut into several pieces. It contains definitions and properties of: - the risk and Bayes risk of an estimator, in general and then specialized to binary hypothesis testing - the DeGroot statistical information between two measures, as well as a generalization for a kernel on more than two outcomes - the total variation distance between measures, defined as a special case of the DeGroot statistical information Co-authored-by: Lorenzo Luccioli @LorenzoLuccioli From the TestingLowerBounds project --- - [x] depends on: #27583 - [x] depends on: #27584 - [x] depends on: #27585 - [x] depends on: #27586 - [x] depends on: #27587 - [x] depends on: #27591 - [x] depends on: #28081 - [x] depends on: #28082 - [x] depends on: #28117 - [x] depends on: #28341 - [x] depends on: #29137 - [x] depends on: #29143 [](https://gitpod.io/from-referrer/) | WIP large-import t-measure-probability | 1713/1 | Mathlib.lean,Mathlib/InformationTheory/TotalVariation/Basic.lean,Mathlib/Probability/Decision/AuxLemmas.lean,Mathlib/Probability/Decision/BayesEstimator.lean,Mathlib/Probability/Decision/Binary.lean,Mathlib/Probability/Decision/BoolMeasure.lean,Mathlib/Probability/Decision/DeGrootInfo.lean,Mathlib/Probability/Decision/Risk/Basic.lean,Mathlib/Probability/Decision/Risk/Countable.lean,Mathlib/Probability/Decision/RiskIncrease.lean,Mathlib/Probability/Decision/ZeroOneLoss.lean | 11 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 277 days ago | 1 second |
| 30966 | gasparattila | refactor: disable `simp` in `measurability` | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 5/3 | Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/MeasureTheory/MeasurableSpace/Defs.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/Typeclasses/SFinite.lean,Mathlib/Tactic/Measurability.lean | 5 | 8 | ['github-actions', 'grunweg', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 29315 | kbuzzard | chore: raise priority of `IsTopologicalSemiring.toIsModuleTopology` | Instances of the form `SMul A B -> SMul (F A) (F B)` can be problematic for several reasons, one of them being that if `A = B` is a ring and if `F A` is also ring then this can cause a diamond with `Algebra.id`. In mathlib we attempt to coerce typeclass inference away from such problems by raising the priority of `Algebra.id` to 1100; this hack (implemented in #13032) seems to work well, indeed it seems sensible to try this instance early because it should be quick to fail and is always the right idea when it doesn't (the change also made mathlib faster and made a proof better). By the same logic it seems safe to raise the priority of `IsTopologicalSemiring.toIsModuleTopology` by the same amount; in FLT there is a mathematically natural but mathlib-problematic instance `Algebra K L -> Algebra (𝔸 K) (𝔸 L)` and then another instance `Algebra K L -> IsModuleTopology (𝔸 K) (𝔸 L)` where `𝔸 K` is the adele ring of the number field `K`, and the change in this PR solves timeouts when `K = L`. Zulip: [#mathlib4 > product of modules over product of rings @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/product.20of.20modules.20over.20product.20of.20rings/near/532799613) --- [](https://gitpod.io/from-referrer/) There are other solutions to this problem -- I am certainly not claiming that the FLT project needs this PR to be merged! We can tinker with priorities locally in FLT for example. However when I noticed that `Algebra.id` had a raised priority in mathlib I realised that mathlib might be amenable to this further ~~hack~~change. | awaiting-author t-topology | 6/1 | Mathlib/Topology/Algebra/Module/ModuleTopology.lean | 1 | 9 | ['github-actions', 'j-loreaux', 'kbuzzard', 'leanprover-bot', 'ocfnash'] | ocfnash | 4 months ago | 215 days ago | 25 days |
| 31730 | thorimur | feat(Meta): declaration manipulation meta API: allow logging on type signature of theorems | This PR introduces some initial definitions in the space of a declaration manipulation meta API. In the course of #31142, it became apparent that we could benefit from having tools for handling the syntax and elaboration info of user-written declarations. This PR makes a small beginning towards that end in the Mathlib.Util.DeclarationManipulation module, and provides API for - getting the info and syntax ref of a declaration given its `Name` - getting the ref of a theorem's type signature from within some command source syntax given the declaration's ref given above - running a monadic action with the ambient ref set to that of the type signature of a theorem, with sensible fallbacks This is used to improve logging locations for the unused-instances-in-types linters, and may be useful for other linters that want to inpsect a theorem's type at the expression level (instead of the syntax level). (It also introduces the small helper definitions `Syntax.findSome?` and `Syntax.rangeEq`, which behave as expected.) For context: in the future, it would be nice to - provide support for all sorts of declarations, not just theorems--but this requires a lot more syntax matching - provide "exploded views" of declaration syntax like `mkDefView`, but finer grained, and geared for use during linting rather than elaboration - make it easy to compose complex suggestions to transform different parts of a declaration at once --- - [x] depends on: #31725 [](https://gitpod.io/from-referrer/) | t-meta | 131/0 | Mathlib.lean,Mathlib/Lean/Syntax.lean,Mathlib/Util/DeclarationManipulation.lean | 3 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 147 days ago | 2 days |
| 32474 | mattrobball | perf(Module.LinearMap.Defs): deprioritize projections to parents for SemilinearMapClass | Trying to figure out if a given type has a SemilinearMapClass instance when all we want is an AddHomClass or a MulActionSemiHomClass can be quite expensive since there are multiple ways to crawl the algebraic hierarchy to generate LinearMapClass instances. If these fail, then they fail slowly. We deprioritize the projections from SemilinearMapClass to AddHomClass and MulActionSemiHomClass to make this one of the last choices. --- This PR continues #23214 which was delegated by @j-loreaux but I let it slip. Will re-bench and see the effect. [](https://gitpod.io/from-referrer/) | t-algebra | 6/0 | Mathlib/Algebra/Module/LinearMap/Defs.lean | 1 | 1 | ['github-actions'] | nobody | 4 months ago | 147 days ago | 35 minutes |
| 31898 | ntapiam | feat(LinearAlgebra/TensorAlgebra): implement HopfAlgebra for TensorAlgebra | implementation of the natural Hopf algebra structure on the TensorAlgebra | new-contributor t-ring-theory awaiting-author | 253/0 | Mathlib.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean,Mathlib/RingTheory/Bialgebra/FreeAlgebra.lean,Mathlib/RingTheory/Bialgebra/TensorAlgebra.lean,Mathlib/RingTheory/HopfAlgebra/TensorAlgebra.lean | 6 | 64 | ['YaelDillies', 'github-actions', 'kckennylau', 'ntapiam'] | nobody | 4 months ago | 159 days ago | 9 hours |
| 30525 | 515801431 | feat(Mathlib/Combinatorics/Enumerative/Polya): Add Polya Counting | This PR introduces basic definitions and results about colorings under permutation group actions. A coloring is defined as a function X → Y, and the permutation group Equiv.Perm X acts on colorings by precomposition: (g • c) x = c (g⁻¹ • x) This formalizes the natural action of relabeling the elements of X. Main definitions MulAction (Equiv.Perm X) (X → Y): The action of the permutation group on colorings via precomposition. coloringEquiv (c₁ c₂ : X → Y) : Prop: Two colorings are equivalent if they lie in the same orbit under this action, i.e. ∃ f : Equiv.Perm X, f • c₁ = c₂. Main results smul_eq_iff_mem_stabilizer: Characterizes when two group actions on the same coloring are equal, showing that g • c = f • c ↔ f⁻¹ * g ∈ stabilizer c. coloringEquiv_equivalence: Proves that coloringEquiv defines an equivalence relation on X → Y. orbit_size_eq_index: Reformulates the orbit–stabilizer theorem in the context of colorings: |orbit c| = |Perm X| / |stabilizer c| Motivation These results provide foundational infrastructure for studying Burnside’s lemma and Pólya’s enumeration theorem in Mathlib, where the enumeration of distinct colorings up to symmetry plays a central role. | t-combinatorics new-contributor awaiting-author merge-conflict | 113/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Polya.lean | 2 | 8 | ['IvanRenison', 'alreadydone', 'github-actions', 'mathlib4-merge-conflict-bot'] | awainverse | 4 months ago | 155 days ago | 39 days |
| 31113 | 515801431 | feat(Mathlib/Combinatorics/Enumerative/Polya.lean): Add additional theorem in `Polya.lean` | --- - [ ] depends on: #30525 --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor blocked-by-other-PR merge-conflict | 302/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Polya.lean | 2 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | b-mehta | 4 months ago | 156 days ago | 16 days |
| 24441 | MrSumato | feat(Data/List): add Lyndon-Schutzenberger theorem on list commutativity | Add Lyndon-Schutzenberger theorem on list commutativity. Included definition for List.repeatSelf that returns list repeated n times. --- This is my first mathlib PR, so any comments are highly appreciated. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data new-contributor | 129/1 | Mathlib.lean,Mathlib/Data/List/Commutativity.lean,Mathlib/Data/List/Defs.lean,Mathlib/Data/List/Lemmas.lean | 4 | 38 | ['MrSumato', 'github-actions', 'grunweg', 'madvorak', 'mathlib4-merge-conflict-bot', 'plp127'] | grunweg | 4 months ago | 329 days ago | 29 days |
| 28057 | plp127 | feat(SuccOrder): simp lemma to refold `Order.succ` and `Order.pred` | Adds `SuccOrder.succ_eq_succ` and `PredOrder.pred_eq_pred` to refold `SuccOrder.succ` and `PredOrder.pred` into `Order.succ` and `Order.pred`. These lemmas are marked `@[simp]`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-order merge-conflict | 8/2 | Mathlib/Order/SuccPred/Basic.lean | 1 | 4 | ['YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | bryangingechen | 4 months ago | 223 days ago | 44 days |
| 27525 | Hagb | (WIP) feat(Tactic/Linter/Indentation): add a linter for general indentation | --- todo: - [x] check whether some (direct or indirect) children of some kinds of parents are intended _strictly_ deeper than this parent. For example: ```lean example : Nat := Nat.add 1 -- should be strictly deeper than `Nat.add`? 2 ``` - [ ] check whether some (direct or indirect) children of some kinds of parents are intended exactly N spaces deeper than this parent. For example: ```lean example : True := trivial -- should be exact 2 spaces deeper than 0 space of `example` ``` - [ ] some special cases, such as `calc`. https://github.com/leanprover-community/mathlib4/blob/5ebccb65951c70539ba1c36e53e079ac28b3fd23/Mathlib/Geometry/Manifold/Riemannian/Basic.lean#L452-L454 - [ ] add test cases [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter large-import | 1364/1 | Mathlib/Init.lean,Mathlib/Tactic/Linter/Indentation.lean,Mathlib/Tactic/Linter/Indentation/Basic.lean,Mathlib/Tactic/Linter/Indentation/Defs.lean,Mathlib/Tactic/Linter/Indentation/Linters.lean,MathlibTest/IndentationLinter.lean,lakefile.lean | 7 | 15 | ['Hagb', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 18551 | joelriou | feat(AlgebraicGeometry): the algebraic De Rham complex | If `B` is an `A`-algebra, we construct the algebraic De Rham complex of `B` over `A`: it is a cochain complex of `A`-modules. --- - [ ] depends on: #18735 - [ ] depends on: #18662 - [ ] depends on: #26464 - [x] depends on: #18534 - [x] depends on: #18527 - [x] depends on: #18440 - [ ] depends on: #18432 - [x] depends on: #18408 - [x] depends on: #18389 - [x] depends on: #18374 - [x] depends on: #18359 - [x] depends on: #18332 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR merge-conflict t-algebraic-geometry | 2836/156 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/Module/Presentation/Cokernel.lean,Mathlib/Algebra/Module/Presentation/Differentials.lean,Mathlib/Algebra/Module/Presentation/DirectSum.lean,Mathlib/Algebra/Module/Presentation/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/PiTensor.lean,Mathlib/Algebra/Module/Presentation/RestrictScalars.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/DeRham/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 26 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 31147 | daefigueroa | feat(Dynamics): point transitive monoid actions and transitive points | We define point transitivity for a monoid action on a topological space and define the set of transitive points. We add some basic lemmas and implications between topological transitivity and point transitivity. --- - [x] depends on: #28001 [](https://gitpod.io/from-referrer/) | t-dynamics new-contributor awaiting-author | 114/6 | Mathlib/Dynamics/Transitive.lean | 1 | 6 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 4 months ago | 144 days ago | 18 days |
| 30711 | kim-em | experiment: which `omega` can not be replaced with `grind`? | 1/0 | lakefile.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds | ||
| 30718 | kim-em | experiment: merge rewrites | t-meta | 1/0 | lakefile.lean | 1 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds | |
| 30720 | kim-em | experiment: merge with subsequent grind | 1/0 | lakefile.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds | ||
| 25871 | eric-wieser | refactor: generalize rank lemmas to semirings | --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 18/8 | Mathlib/LinearAlgebra/Dimension/Finite.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 32328 | ADedecker | feat: template for distributions and their API | --- [](https://gitpod.io/from-referrer/) | large-import t-analysis merge-conflict | 888/5 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/Distribution.lean,Mathlib/Analysis/Distribution/TestFunction.lean | 4 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 23040 | grunweg | feat: define immersions and smooth embeddings in infinite dimensions | Sadly, we cannot prove most nice things about them yet, as we don't have the inverse function theorem yet. TODO: prove the few things we can already say --- - [ ] depends on: #28796 - [x] depends on: #28853 - [x] depends on: #23175 (preliminaries) - [x] depends on: #23186 - [ ] depends on: another PR, about `MSplitAt` (to be filed) - and perhaps some prerequisites about products of complemented modules etc. - [x] depends on: #23219 (preliminaries about local diffeomorphisms) - [x] depends on: #8738 - in fact, #9273 is not a strict pre-requisite for this. It suffices to know "extended charts have invertible differentials", which [isInvertible_mfderiv_extChartAt](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Geometry/Manifold/MFDeriv/Atlas.html#isInvertible_mfderiv_extChartAt) mostly proves. (There's nothing wrong with completing that PR, for all interior points.) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 967/0 | Mathlib.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Splits.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean,Mathlib/Geometry/Manifold/MSplits.lean | 5 | 4 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 30668 | astrainfinita | feat: `QuotType` | This typeclass is primarily for use by type synonyms of `Quot` and `Quotient`. Using `QuotType` API for type synonyms of `Quot` and `Quotient` will avoid defeq abuse caused by directly using `Quot` and `Quotient` APIs. This PR also adds some typeclasses to support different ways to find the quotient map that should be used. See the documentation comments of these typeclasses for examples of usage. --- It's not a typical design to use these auxiliary typeclasses and term elaborators, but I haven't found a better way to support these notations. Some of the naming may need to be discussed. For example: - `⟦·⟧` is currently called `mkQ` in names. This distinguishes it from other `.mk`s and makes it possible to write the quotient map as `mkQ` `mkQ'` ~~`mkQ_ h`~~. But this will also require changing the old lemma names. - It would be helpful if the names of new type classes explained their functionality better. [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/migrate.20to.20.60QuotLike.60.20API) This PR continues the work from #16421. Original PR: https://github.com/leanprover-community/mathlib4/pull/16421 | RFC t-data awaiting-zulip | 629/0 | Mathlib.lean,Mathlib/Data/QuotType.lean,MathlibTest/QuotType.lean | 3 | 20 | ['YaelDillies', 'astrainfinita', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | nobody | 4 months ago | 194 days ago | 1 minute |
| 32706 | CoolRmal | feat: a set is Gdelta iff it is completely metrizable | This PR proves that 1. A Gdelta subset of a completely metrizable space is completely metrizable. 2. We prove that under certain conditions we can always extends a continuous function on a set A to a Gdelta set. We then use this lemma to prove that if `A` is a completely metrizable subset in a metric space `M`, then `A` is Gdelta. --- [](https://gitpod.io/from-referrer/) | t-topology | 29/0 | Mathlib/Topology/Metrizable/CompletelyMetrizable.lean | 1 | 1 | ['github-actions'] | nobody | 4 months ago | unknown | 0 seconds |
| 30847 | joelriou | feat(CategoryTheory/Presentable): the representation theorem | If `C` is an essentially `w`-small category, then the category of `κ`-continuous functors `Cᵒᵖ ⥤ Type w` is locally `κ`-presentable, and any locally `κ`-presentable category is equivalent to such a category. In particular, we show that a locally `κ`-presentable category has limits. This is a draft... --- - [ ] depends on: #32423 - [ ] depends on: #32424 - [ ] depends on: #32034 - [ ] depends on: #31137 - [ ] depends on: #30817 - [x] depends on: #30795 - [ ] depends on: #30755 - [ ] depends on: #30731 - [ ] depends on: #30554 - [ ] depends on: #30533 - [ ] depends on: #30513 - [x] depends on: #30509 - [x] depends on: #30507 - [x] depends on: #30492 - [x] depends on: #30464 - [x] depends on: #30459 - [x] depends on: #30269 - [ ] depends on: #30247 - [ ] depends on: #30241 - [x] depends on: #30168 - [x] depends on: #30160 - [x] depends on: #29881 - [x] depends on: #29854 - [x] depends on: #29565 - [x] depends on: #29543 - [x] depends on: #29519 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR t-category-theory merge-conflict | 2137/27 | Mathlib.lean,Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/EssentiallySmall.lean,Mathlib/CategoryTheory/Functor/KanExtension/Dense.lean,Mathlib/CategoryTheory/Generator/Basic.lean,Mathlib/CategoryTheory/Generator/Type.lean,Mathlib/CategoryTheory/Limits/HasLimits.lean,Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean,Mathlib/CategoryTheory/Limits/Types/Limits.lean,Mathlib/CategoryTheory/MorphismProperty/Basic.lean,Mathlib/CategoryTheory/MorphismProperty/IsSmall.lean,Mathlib/CategoryTheory/ObjectProperty/Basic.lean,Mathlib/CategoryTheory/ObjectProperty/ClosedUnderIsomorphisms.lean,Mathlib/CategoryTheory/ObjectProperty/ColimitsCardinalClosure.lean,Mathlib/CategoryTheory/ObjectProperty/ColimitsOfShape.lean,Mathlib/CategoryTheory/ObjectProperty/CompleteLattice.lean,Mathlib/CategoryTheory/ObjectProperty/Equivalence.lean,Mathlib/CategoryTheory/ObjectProperty/FunctorCategory/Limits.lean,Mathlib/CategoryTheory/ObjectProperty/FunctorCategory/Presheaf.lean,Mathlib/CategoryTheory/ObjectProperty/LimitsOfShape.lean,Mathlib/CategoryTheory/ObjectProperty/Local.lean,Mathlib/CategoryTheory/ObjectProperty/Small.lean,Mathlib/CategoryTheory/Presentable/Adjunction.lean,Mathlib/CategoryTheory/Presentable/Basic.lean,Mathlib/CategoryTheory/Presentable/Continuous.lean,Mathlib/CategoryTheory/Presentable/Dense.lean,Mathlib/CategoryTheory/Presentable/EssentiallyLarge.lean,Mathlib/CategoryTheory/Presentable/Limits.lean,Mathlib/CategoryTheory/Presentable/LocallyPresentable.lean,Mathlib/CategoryTheory/Presentable/OrthogonalReflection.lean,Mathlib/CategoryTheory/Presentable/Presheaf.lean,Mathlib/CategoryTheory/Presentable/Representation.lean,Mathlib/CategoryTheory/Presentable/StrongGenerator.lean,Mathlib/CategoryTheory/Presentable/Type.lean,Mathlib/CategoryTheory/Yoneda.lean | 35 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 189 days ago | 1 second |
| 6633 | adomani | feat(..Polynomial..): `MvPolynomial`s have no zero divisors | This PR continues #6627, placing the `NoZeroDivisors` instance on `MvPolynomial`s and removing auxiliary intermediate results that are no longer needed. Affected files: ``` Data/MvPolynomial/Basic.lean Data/Polynomial/RingDivision.lean RingTheory/Polynomial/Basic.lean ``` --- - [x] depends on: #6227 for the `NoZeroDivisors` instance on `AddMonoidAlgebra`s [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 143/57 | Mathlib/Algebra/MonoidAlgebra/NoZeroDivisors.lean,Mathlib/Data/MvPolynomial/Basic.lean,Mathlib/Data/Polynomial/RingDivision.lean,Mathlib/RingTheory/Polynomial/Basic.lean | 4 | 6 | ['SnirBroshi', 'YaelDillies', 'adomani', 'eric-wieser', 'leanprover-community-mathlib4-bot'] | nobody | 4 months ago | 987 days ago | 5 hours |
| 28865 | grunweg | feat: a map is smooth iff its post-composition with an immersion is | The continuous case is mostly solved --- except for one detail where I'm not even sure if this is true. Maybe!, I need to require continuity, at least in general. (Perhaps not for interior points... we'll see!) A future PR will use this to golf the results in `Icc/Instances.lean`. --- - [x] depends on: #28793 - [ ] depends on: #28796 - [x] depends on: #28853 (for simplicity) - [ ] depends on: #28905 history bifurcates here: merge that PR first, then rebase this one [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 1026/7 | Mathlib.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/ContMDiff/Defs.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Topology/PartialHomeomorph.lean,docs/references.bib,temp_.sh | 12 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'peabrainiac'] | nobody | 4 months ago | 250 days ago | 11 seconds |
| 26950 | alreadydone | Primitives of holomorphic functions and path integral | --- - [ ] depends on: #31925 - [x] depends on: #24983 - [x] depends on: #22771 [](https://gitpod.io/from-referrer/) | WIP merge-conflict t-topology t-analysis blocked-by-other-PR | 1288/361 | Mathlib.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/StructureSheaf.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnected.lean,Mathlib/Analysis/Complex/Primitive.lean,Mathlib/CategoryTheory/Groupoid.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Geometry/Manifold/Sheaf/Smooth.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Topology/Covering.lean,Mathlib/Topology/EtaleSpace.lean,Mathlib/Topology/FiberBundle/Trivialization.lean,Mathlib/Topology/Homotopy/HomotopyGroup.lean,Mathlib/Topology/Homotopy/Lifting.lean,Mathlib/Topology/Homotopy/Product.lean,Mathlib/Topology/IsLocalHomeomorph.lean,Mathlib/Topology/Sheaves/LocalPredicate.lean,Mathlib/Topology/Sheaves/Sheafify.lean,Mathlib/Topology/Sheaves/Stalks.lean | 21 | 3 | ['alreadydone', 'grunweg', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 31987 | saodimao20 | feat: add monotonicity and relation lemmas for mgf and cgf | Add two lemmas about moment-generating and cumulant-generating functions: - `mgf_mono_in_t_of_nonneg`: For nonnegative random variables, the mgf is monotone in the parameter `t` - `cgf_zero_of_mgf_one`: The cgf equals zero iff the mgf equals one These lemmas are useful for studying properties of mgf and cgf in probability theory. Contributed by sequential-intelligence-lab(SIL), University of Virginia --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor awaiting-author | 21/0 | Mathlib/Probability/Moments/Basic.lean | 1 | 5 | ['DavidLedvinka', 'github-actions'] | RemyDegenne | 4 months ago | 138 days ago | 21 days |
| 32211 | ADedecker | feat: inclusion from `ContDiffMapSupportedIn` to `TestFunction` is a topological embedding | --- - [ ] depends on: #32210 - [x] depends on: #31806 [](https://gitpod.io/from-referrer/) | t-analysis blocked-by-other-PR merge-conflict | 136/2 | Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Topology/UniformSpace/UniformEmbedding.lean | 2 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 154 days ago | 5 minutes |
| 32602 | adamtopaz | feat: Refactor graph | Work in progress --- [](https://gitpod.io/from-referrer/) | WIP | 1312/0 | RefactorGraph/DAG.lean,RefactorGraph/Main.lean,RefactorGraph/Test.lean,lakefile.lean | 4 | 1 | ['github-actions'] | nobody | 4 months ago | 143 days ago | 1 second |
| 26912 | pechersky | chore(Algebra/Ring/Subring): simp tag `Subring.smul_def` | s-multiplying by a subtype is easiest to manipulate when both terms are in the ambient type. Many places that had to use the _def lemma for a rewrite, or to include it in a simp set, no longer have to. Ported from #25308 --- [](https://gitpod.io/from-referrer/) I found this being not-simp frustrating when talking about submodules over a valuation subring. | merge-conflict t-algebra | 67/66 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Group/Submonoid/MulAction.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/LocalizedModule/Exact.lean,Mathlib/Algebra/Module/LocalizedModule/IsLocalization.lean,Mathlib/Algebra/Module/LocalizedModule/Submodule.lean,Mathlib/Algebra/Ring/Periodic.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean,Mathlib/LinearAlgebra/RootSystem/Irreducible.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/RingTheory/Etale/Kaehler.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/LocalProperties/Projective.lean,Mathlib/RingTheory/Localization/InvSubmonoid.lean,Mathlib/RingTheory/OreLocalization/Basic.lean | 25 | 26 | ['artie2000', 'eric-wieser', 'github-actions', 'j-loreaux', 'kckennylau', 'leanprover-bot', 'leanprover-radar', 'linesthatinterlace', 'mathlib4-merge-conflict-bot', 'pechersky'] | joelriou | 4 months ago | 158 days ago | 60 days |
| 32737 | j-loreaux | refactor: rename `MulAction` to `MonoidAction` | Given that we now have [SemigroupAction](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Group/Action/Defs.html#SemigroupAction) we are in the unfortunate scenario that the name which seems to have less structure actually has *more* structure. This PR: 1. renames `MulAction` to `MonoidAction` to reflect this additional structure, as well as declarations referencing `MulAction` in their names. `Prop`-valued mixins in the `MulAction` namespace are also renamed (e.g., `MulAction.{IsMinimal,IsTopologicallyTransitive}` → `MonoidAction.{IsMinimal,IsTopologicallyTransitive`). 2. The additive version are also renamed (`AddAction` → `AddMonoidAction`) and the corresponding `Prop`-valued mixins. 3. does *not* rename modules with `MulAction` in the name 4. does *not* rename `DistribMulAction`, `SubMulAction`, `MulActionWithZero`, etc. If these need to happen, that can occur at a later time. 5. does *not* rename `SemigroupAction` to `MulAction`. Even if this rename is desired, because of the prevalence of `MulAction` in Mathlib, I think we should not conduct a move of this magnitude all at once. If we want to rename this to `MulAction`, we should wait for the 6 month embargo period during which time that name is deprecated, to give everyone downstream the opportunity to switch instead of silently breaking their builds. Of course, another potential name is `MulOneAction`, but I don't think that's too helpful. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 3623/1862 | Mathlib/Algebra/AddConstMap/Basic.lean,Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Pi.lean,Mathlib/Algebra/BigOperators/Group/Finset/Preimage.lean,Mathlib/Algebra/BigOperators/GroupWithZero/Action.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Colimit/DirectLimit.lean,Mathlib/Algebra/Field/Action/ConjAct.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/GradedMulAction.lean,Mathlib/Algebra/Group/Action/Basic.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Action/End.lean,Mathlib/Algebra/Group/Action/Equidecomp.lean,Mathlib/Algebra/Group/Action/Faithful.lean,Mathlib/Algebra/Group/Action/Hom.lean,Mathlib/Algebra/Group/Action/Opposite.lean,Mathlib/Algebra/Group/Action/Option.lean,Mathlib/Algebra/Group/Action/Pi.lean,Mathlib/Algebra/Group/Action/Pointwise/Finset.lean,Mathlib/Algebra/Group/Action/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Action/Pointwise/Set/Finite.lean,Mathlib/Algebra/Group/Action/Pretransitive.lean,Mathlib/Algebra/Group/Action/Prod.lean,Mathlib/Algebra/Group/Action/Sigma.lean,Mathlib/Algebra/Group/Action/Sum.lean,Mathlib/Algebra/Group/Action/TransferInstance.lean,Mathlib/Algebra/Group/Action/TypeTags.lean,Mathlib/Algebra/Group/Action/Units.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Equiv/Finite.lean,Mathlib/Algebra/Group/Nat/Range.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Finset/Density.lean,Mathlib/Algebra/Group/Pointwise/Finset/Scalar.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Card.lean,Mathlib/Algebra/Group/Pointwise/Set/Finite.lean,Mathlib/Algebra/Group/Pointwise/Set/Lattice.lean,Mathlib/Algebra/Group/Pointwise/Set/Scalar.lean,Mathlib/Algebra/Group/Shrink.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Submonoid/MulAction.lean,Mathlib/Algebra/Group/Submonoid/Pointwise.lean,Mathlib/Algebra/Group/TransferInstance.lean,Mathlib/Algebra/Group/TypeTags/Finite.lean,Mathlib/Algebra/GroupWithZero/Action/Basic.lean,Mathlib/Algebra/GroupWithZero/Action/ConjAct.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/End.lean,Mathlib/Algebra/GroupWithZero/Action/Faithful.lean,Mathlib/Algebra/GroupWithZero/Action/Opposite.lean,Mathlib/Algebra/GroupWithZero/Action/Pi.lean,Mathlib/Algebra/GroupWithZero/Action/Pointwise/Finset.lean,Mathlib/Algebra/GroupWithZero/Action/Pointwise/Set.lean,Mathlib/Algebra/GroupWithZero/Action/Prod.lean,Mathlib/Algebra/GroupWithZero/Action/TransferInstance.lean,Mathlib/Algebra/GroupWithZero/Action/Units.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/GroupWithZero/Pointwise/Finset.lean,Mathlib/Algebra/GroupWithZero/Pointwise/Set/Basic.lean,Mathlib/Algebra/GroupWithZero/Pointwise/Set/Card.lean,Mathlib/Algebra/GroupWithZero/Subgroup.lean,Mathlib/Algebra/GroupWithZero/Submonoid/Pointwise.lean,Mathlib/Algebra/GroupWithZero/TransferInstance.lean,Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean,Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Module/PUnit.lean,Mathlib/Algebra/Module/PointwisePi.lean,Mathlib/Algebra/Module/Rat.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Submodule/Defs.lean,Mathlib/Algebra/Module/Submodule/Invariant.lean,Mathlib/Algebra/Module/Submodule/LinearMap.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/Module/ULift.lean,Mathlib/Algebra/Order/Group/Action.lean,Mathlib/Algebra/Order/Group/Action/End.lean | 349 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 137 days ago | 2 days |
| 32717 | adomani | perf: small speed up of the flexible linter | This just rearranges an array accumulation. --- [](https://gitpod.io/from-referrer/) | t-linter merge-conflict | 7/8 | Mathlib/Tactic/Linter/FlexibleLinter.lean | 1 | 4 | ['adomani', 'github-actions', 'leanprover-radar', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 25141 | eric-wieser | feat: basis for multilinear maps | This attempts to tease an intermediate result out of #11155, which lets us show that multilinear maps are free even if their codomain is not finite. I guess this continues from https://github.com/leanprover-community/mathlib3/pull/10504 and https://github.com/leanprover-community/mathlib3/pull/14199. --- - [ ] depends on: #11155 - [ ] depends on: #25142 - [ ] depends on: #25169 - [ ] depends on: #25166 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 507/45 | Mathlib.lean,Mathlib/LinearAlgebra/DFinsupp.lean,Mathlib/LinearAlgebra/DFinsupp/PiTensorProduct.lean,Mathlib/LinearAlgebra/DirectSum/Finsupp.lean,Mathlib/LinearAlgebra/DirectSum/PiTensorProduct.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basis.lean,Mathlib/LinearAlgebra/Multilinear/DFinsupp.lean,Mathlib/LinearAlgebra/Multilinear/DirectSum.lean,Mathlib/LinearAlgebra/Multilinear/FiniteDimensional.lean,Mathlib/LinearAlgebra/Multilinear/Pi.lean | 11 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 29274 | Jlh18 | feat(CategoryTheory): HasLimits instance on Grpd | Use the free-forgetful adjunction to show that `Grpd` has all limits in `CategoryTheory.Category.Grpd.Limit`, as a reflective subcategory of `Cat`. - [ ] depends on: #29250[Renamings in Grpd file] - [ ] depends on: #29278[Quotient of a groupoid is a groupoid] - [ ] depends on: #29279[Free forgetful adjunction] - [ ] depends on: #29283 --- [](https://gitpod.io/from-referrer/) | file-removed blocked-by-other-PR t-category-theory merge-conflict | 243/65 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/CategoryTheory/Core.lean,Mathlib/CategoryTheory/Groupoid/FreeGroupoidOfCategory.lean,Mathlib/CategoryTheory/Groupoid/Grpd.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Core.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Free.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Limit.lean,Mathlib/CategoryTheory/Quotient.lean | 9 | 6 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 167 days ago | 2 hours |
| 29283 | Jlh18 | feat(CategoryTheory): define forgetful-core adjunction between Cat and Grpd | * Define `CategoryTheory.Core.functor`: the functor `Cat ⥤ Grpd` that on objects takes the core of a category * Define `CategoryTheory.Core.adjunction`: the adjunction with the forgetful functor `Grpd.forgetToCat` on the left, and the core functor `Core.functor` on the right. * Hence provide an instance that `Grpd.forgetToCat` is coreflective. --- - [x] depends on: #29284 [Extra lemmas in CategoryTheory.Core] --- [](https://gitpod.io/from-referrer/) | file-removed t-category-theory awaiting-author merge-conflict | 209/64 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/CategoryTheory/Core.lean,Mathlib/CategoryTheory/Groupoid/FreeGroupoidOfCategory.lean,Mathlib/CategoryTheory/Groupoid/Grpd.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Core.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Free.lean | 7 | 25 | ['Jlh18', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 141 days ago | 4 hours |
| 33015 | thorimur | share: stress test plugins via pluginizing Mathlib.Init | This PR is only created for conveniently sharing this branch via `gh` for the purpose of experimenting with plugins. There's no plan to make Mathlib.Init a plugin any time soon. :) --- [](https://gitpod.io/from-referrer/) | merge-conflict | 999/1080 | Mathlib.lean,Mathlib/Algebra/Expr.lean,Mathlib/Algebra/HierarchyDesign.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Note.lean,Mathlib/CategoryTheory/Category/Init.lean,Mathlib/CategoryTheory/ConcreteCategory/Bundled.lean,Mathlib/Combinatorics/Matroid/Init.lean,Mathlib/Combinatorics/SimpleGraph/Init.lean,Mathlib/Control/Combinators.lean,Mathlib/Control/ULift.lean,Mathlib/Data/Array/Defs.lean,Mathlib/Data/Array/Extract.lean,Mathlib/Data/Finset/Attr.lean,Mathlib/Data/Int/DivMod.lean,Mathlib/Data/Int/Notation.lean,Mathlib/Data/List/Monad.lean,Mathlib/Data/Nat/BinaryRec.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Data/Nat/Notation.lean,Mathlib/Data/Nat/NthRoot/Defs.lean,Mathlib/Data/Set/Defs.lean,Mathlib/Data/String/Defs.lean,Mathlib/Data/Sym/Sym2/Init.lean,Mathlib/Data/UInt.lean,Mathlib/Deprecated/Aliases.lean,Mathlib/Deprecated/Sort.lean,Mathlib/Lean/ContextInfo.lean,Mathlib/Lean/CoreM.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/Lean/Elab/Tactic/Meta.lean,Mathlib/Lean/Elab/Term.lean,Mathlib/Lean/EnvExtension.lean,Mathlib/Lean/Environment.lean,Mathlib/Lean/Exception.lean,Mathlib/Lean/Expr/Basic.lean,Mathlib/Lean/Expr/Rat.lean,Mathlib/Lean/GoalsLocation.lean,Mathlib/Lean/Json.lean,Mathlib/Lean/LinterCopies.lean,Mathlib/Lean/LinterCopiesTest.lean,Mathlib/Lean/LocalContext.lean,Mathlib/Lean/Meta.lean,Mathlib/Lean/Meta/Basic.lean,Mathlib/Lean/Meta/DiscrTree.lean,Mathlib/Lean/Meta/KAbstractPositions.lean,Mathlib/Lean/Meta/RefinedDiscrTree/Basic.lean,Mathlib/Lean/Meta/Simp.lean,Mathlib/Lean/Meta/Tactic/Rewrite.lean,Mathlib/Lean/Name.lean,Mathlib/Lean/PrettyPrinter/Delaborator.lean,Mathlib/Lean/Thunk.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/OpClass.lean,Mathlib/Tactic.lean,Mathlib/Tactic/AdaptationNote.lean,Mathlib/Tactic/ApplyCongr.lean,Mathlib/Tactic/ApplyWith.lean,Mathlib/Tactic/ArithMult/Init.lean,Mathlib/Tactic/Attr/Register.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/Bound/Init.lean,Mathlib/Tactic/CC/Lemmas.lean,Mathlib/Tactic/Cases.lean,Mathlib/Tactic/CasesM.lean,Mathlib/Tactic/CategoryTheory/CategoryStar.lean,Mathlib/Tactic/CategoryTheory/Coherence/Datatypes.lean,Mathlib/Tactic/Change.lean,Mathlib/Tactic/Check.lean,Mathlib/Tactic/Clean.lean,Mathlib/Tactic/ClearExcept.lean,Mathlib/Tactic/ClearExclamation.lean,Mathlib/Tactic/Clear_.lean,Mathlib/Tactic/Coe.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/Constructor.lean,Mathlib/Tactic/Continuity/Init.lean,Mathlib/Tactic/Conv.lean,Mathlib/Tactic/Core.lean,Mathlib/Tactic/DepRewrite.lean,Mathlib/Tactic/Eqns.lean,Mathlib/Tactic/ErwQuestion.lean,Mathlib/Tactic/Eval.lean,Mathlib/Tactic/ExistsI.lean,Mathlib/Tactic/Explode/Datatypes.lean,Mathlib/Tactic/ExtendDoc.lean,Mathlib/Tactic/FailIfNoProgress.lean,Mathlib/Tactic/FastInstance.lean,Mathlib/Tactic/FieldSimp/Attr.lean,Mathlib/Tactic/Find.lean,Mathlib/Tactic/FindSyntax.lean,Mathlib/Tactic/Finiteness/Attr.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Mor.lean,Mathlib/Tactic/FunProp/ToBatteries.lean,Mathlib/Tactic/GCongr/ForwardAttr.lean,Mathlib/Tactic/Generalize.lean,Mathlib/Tactic/GuardGoalNums.lean,Mathlib/Tactic/GuardHypNums.lean,Mathlib/Tactic/Have.lean,Mathlib/Tactic/HaveI.lean | 211 | 0 | [] | nobody | 4 months ago | unknown | 0 seconds |
| 21447 | erdOne | feat(AlgebraicGeometry): the split algebraic torus | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 419/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/Torus.lean | 2 | 6 | ['erdOne', 'github-actions', 'jcommelin', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 447 days ago | 2 days |
| 32938 | 0xTerencePrime | feat(Order/LocallyFinite): prove DenselyOrdered and LocallyFiniteOrder are incompatible | ## Summary This PR proves that a nontrivial densely ordered linear order cannot be locally finite. ## Main results * `not_locallyFiniteOrder`: A densely ordered locally finite linear order must be subsingleton. * `not_locallyFiniteOrder_of_nontrivial`: The main theorem - incompatibility of the two properties. Note: This implementation imports `Mathlib.Order.Interval.Set.Infinite` to reuse the existing `Set.Icc_infinite` theorem, ensuring standard library consistency. ## Mathematical content The key insight is that in a densely ordered type, we can always find a new element between any two distinct elements. This means any nontrivial interval contains infinitely many elements. However, `LocallyFiniteOrder` requires intervals to be finite. This contradiction implies that such a type cannot exist (unless it is trivial). ## Motivation This resolves a TODO mentioned in #7987 (Data/Finset/LocallyFinite entry). ## Verification - [x] `lake build Mathlib.Order.LocallyFinite.Basic` passes - [x] `lake exe runLinter Mathlib.Order.LocallyFinite.Basic` passes | t-order new-contributor awaiting-author | 28/0 | Mathlib/Order/Interval/Finset/Basic.lean | 1 | 10 | ['0xTerencePrime', 'CoolRmal', 'github-actions', 'jcommelin', 'plp127'] | nobody | 4 months ago | 133 days ago | 3 days |
| 33077 | YaelDillies | feat(Data/Rel): balls | Define `SetRel.ball` and use it in place of `UniformSpace.ball`. --- [](https://gitpod.io/from-referrer/) | WIP t-data | 38/3 | Mathlib/Data/Rel.lean,Mathlib/Topology/UniformSpace/Defs.lean | 2 | 1 | ['github-actions'] | nobody | 4 months ago | 133 days ago | 9 seconds |
| 31226 | erdOne | chore(RingTheory): add `@[ext]` to `Ideal.Quotient.algHom_ext` | See [`Ideal.Quotient.ringHom_ext`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=Ideal.Quotient.ringHom_ext#doc) which also has @[ext 1100]. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-ring-theory easy merge-conflict | 3/2 | Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean | 2 | 7 | ['erdOne', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 176 days ago | 2 days |
| 32698 | farruhx | feat(List): add aesop / simp annotations to selected lemmas for improved automation | This PR adds `@[aesop safe]` and `@[simp]` annotations to a set of List lemmas whose proofs are routine and benefit from standardized automation. No statements or definitions are changed; only proof annotations are added. The lemmas updated in this PR are: * `or_exists_of_exists_mem_cons` * `append_subset_of_subset_of_subset` * `map_subset_iff` * `append_eq_has_append` * `append_right_injective` * `append_left_injective` * `reverse_surjective` * `reverse_bijective` * `mem_getLast?_append_of_mem_getLast?` * `mem_dropLast_of_mem_of_ne_getLast` * `idxOf_eq_length_iff` * `idxOf_append_of_mem` * `length_eraseP_add_one` The goal is to make these commonly used lemmas easier for `aesop`-based automation to resolve, while avoiding any interference with simp-normal-form lemmas or canonical rewrite rules. There are no API changes and no new theorems—only improved automation behavior. | t-data new-contributor awaiting-author | 18/1 | Mathlib/Data/List/Basic.lean | 1 | 8 | ['artie2000', 'euprunin', 'farruhx', 'github-actions'] | pechersky | 4 months ago | 132 days ago | 7 days |
| 27817 | zhuyizheng | feat: add IMO2025P1 | Add a solution to IMO2025P1, the original problem statement from https://github.com/jsm28/IMOLean --- [](https://gitpod.io/from-referrer/) | IMO awaiting-author new-contributor merge-conflict | 1310/0 | Archive.lean,Archive/Imo/Imo2025Q1.lean | 2 | 9 | ['github-actions', 'kim-em', 'mathlib4-merge-conflict-bot', 'zhuyizheng'] | dwrensha | 4 months ago | 191 days ago | 54 days |
| 26923 | oliver-butterley | feat(Dynamics/BirkhoffSum): add the pointwise ergodic theorem (Birkhoff's) | The Pointwise Ergodic Theorem, also known as Birkhoff's Ergodic Theorem.
Co-authored-by: Lua Viana Reis |
t-dynamics new-contributor awaiting-author | 398/0 | Mathlib.lean,Mathlib/Dynamics/BirkhoffSum/Pointwise.lean | 2 | 31 | ['D-Thomine', 'github-actions', 'leanprover-community-bot-assistant', 'lua-vr', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel', 'urkud'] | sgouezel | 4 months ago | 135 days ago | 98 days |
| 32497 | themathqueen | chore: make `FiniteDimensional.complete 𝕜` an instance when `𝕜` is `RCLike` | --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-bench | 3/26 | Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Positive.lean | 2 | 3 | ['github-actions', 'leanprover-radar', 'themathqueen'] | nobody | 4 months ago | unknown | 0 seconds |
| 33218 | Blackfeather007 | feat(Algebra): Define the associated graded ring to filtered ring | Define the associated graded ring to a filtered ring. --- - [ ] depends on: #33217 migrated from https://github.com/leanprover-community/mathlib4/pull/26858 | t-ring-theory new-contributor blocked-by-other-PR | 450/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 2 minutes |
| 33219 | Blackfeather007 | feat(Algebra): Define associated graded algebra | Define the associated graded algebra of a filtered algebra, constructed from a special case of associated graded ring. --- - [ ] depends on: #33218 migrated from #26859 | t-ring-theory new-contributor blocked-by-other-PR | 563/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 2 minutes |
| 33220 | Blackfeather007 | feat(Algebra): Define associated graded module | Define the associated graded module to a filtered module. --- - [ ] depends on: #33218 migrated from #26860 | t-ring-theory new-contributor blocked-by-other-PR | 669/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 2 minutes |
| 33227 | Blackfeather007 | feat(Algebra): exact of associated graded exact | We proved that a chain complex is exact if its associated graded complex is exact. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33226 migrated from #26869 | t-ring-theory new-contributor blocked-by-other-PR | 728/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/Exactness.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 4 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 20 minutes |
| 33226 | Blackfeather007 | feat(Algebra): associated graded exact of exact and strict | In this file, we define the concept of exhaustive filtrations. We also prove a AssociatedGradedRingHom sequence is exact iff each GradedPieceHom is exact. And when a sequence is strict exact, the corresponding AssociatedGradedRingHom sequence is also exact. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33222 migrated from #26868 | t-ring-theory new-contributor blocked-by-other-PR | 529/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/Exactness.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 4 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 23 minutes |
| 33225 | Blackfeather007 | feat(Algebra): filtered module hom | In this PR we defined the filtered semi-linear map for filtered module and the associated graded module hom. --- - [ ] depends on: #33220 - [ ] depends on: #33223 migrated from #26867 | t-ring-theory new-contributor blocked-by-other-PR | 1205/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 30 minutes |
| 33224 | Blackfeather007 | feat(Algebra): define filtered alghom | In this PR, we define the filtered algebra homomorphisms on algebras and prove some basic properties of them. --- - [ ] depends on: #33219 - [ ] depends on: #33223 migrated from #26863 | t-ring-theory new-contributor blocked-by-other-PR | 1055/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 34 minutes |
| 33223 | Blackfeather007 | feat(Algebra): define filtered ring homomorphism | In this PR, we define the filtered ring morphisms on rings and prove some basic properties of them. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33218 - [ ] depends on: #33222 migrated from #26862 | t-ring-theory new-contributor blocked-by-other-PR | 824/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 37 minutes |
| 33222 | Blackfeather007 | feat(Algebra): define filtered add group hom | In this file we define filtered hom and the corresponding associated graded hom for abelian groups. Co-authored-by: Huanyu Zheng @Yu-Misaka [suzuka@misaka-yu.com](mailto:suzuka@misaka-yu.com) Co-authored-by: Yi Yuan @yuanyi-350 [kysyy1@126.com](mailto:kysyy1@126.com) Co-authored-by: Weichen Jiao @AlbertJ-314 [albertjiao314@gmail.com](mailto:albertjiao314@gmail.com) --- - [ ] depends on: #33217 migrated from #26861 | new-contributor t-ring-theory blocked-by-other-PR | 368/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean,Mathlib/RingTheory/FilteredAlgebra/FilteredHom.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | 129 days ago | 39 minutes |
| 33178 | gw90 | feat(Analysis/CStarAlgebra/Spectrum): Adding lemmas that the CStarAlgebra norm equals the square root of the spectral radius of star a * a | Adds lemmas that the ||a||^2_A=sqrt(spectralRadius C (star a * a)). I think it would be helpful to have these lemmas available in Mathlib. It'll help with some of the other things I'm working on. Feel free to move them to a different file or rename them as you see fit. | new-contributor t-analysis awaiting-author | 24/0 | Mathlib/Analysis/CStarAlgebra/Spectrum.lean | 1 | 15 | ['github-actions', 'gw90', 'themathqueen', 'vihdzp'] | nobody | 4 months ago | 130 days ago | 4 hours |
| 33269 | urkud | feat(MeasureTheory/Covering): generalize some lemmas to outer measures | --- [](https://gitpod.io/from-referrer/) | t-measure-probability | 29/19 | Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean | 2 | 1 | ['github-actions'] | nobody | 4 months ago | 127 days ago | 30 seconds |
| 33138 | gasparattila | chore(MeasureTheory/Measure/Stieltjes): remove `backward.privateInPublic` | In #32482, some definitions in this file were rewritten using private declarations. However, this made `StieltjesFunction.length` unusable, since its API uses private declarations even in statements. This PR fixes this by problem by specializing `length_eq` to `NoMinOrder` and adding a new lemma for the `OrderBot` case. The other lemmas involving the private declarations are made private, except for `length_subadditive_Icc_Ioo`, which is reverted to the previous statement. --- [](https://gitpod.io/from-referrer/) | t-measure-probability tech debt awaiting-author | 35/30 | Mathlib/MeasureTheory/Measure/Stieltjes.lean | 1 | 6 | ['github-actions', 'grunweg', 'sgouezel', 'vihdzp'] | sgouezel | 4 months ago | 126 days ago | 5 days |
| 33307 | grunweg | Orientable manifolds updated | --- [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry | 377/4 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/Orientable.lean | 3 | 2 | ['github-actions'] | nobody | 4 months ago | unknown | 0 seconds |
| 5934 | eric-wieser | feat: port Data.Rat.MetaDefs | --- [](https://gitpod.io/from-referrer/) This needs some eyes from people familiar with Qq | merge-conflict help-wanted mathlib-port t-meta | 183/0 | Mathlib.lean,Mathlib/Data/Rat/MetaDefs.lean,test/rat.lean | 3 | 5 | ['eric-wieser', 'gebner', 'vihdzp'] | nobody | 4 months ago | unknown | 0 seconds |
| 4960 | eric-wieser | chore: use `open scoped` | Earlier versions of mathport did not know about this. This was done by searching for all `open` commands referencing: * `Classical` * `BigOperators` * `Topology` * `Pointwise` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-CI | 1026/981 | Mathlib/Algebra/AddTorsor.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/NatAntidiagonal.lean,Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/BigOperators/Order.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/BigOperators/Ring.lean,Mathlib/Algebra/BigOperators/RingEquiv.lean,Mathlib/Algebra/Bounds.lean,Mathlib/Algebra/Category/GroupCat/Biproducts.lean,Mathlib/Algebra/Category/GroupCat/FilteredColimits.lean,Mathlib/Algebra/Category/GroupCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Biproducts.lean,Mathlib/Algebra/Category/Mon/FilteredColimits.lean,Mathlib/Algebra/Category/Ring/Adjunctions.lean,Mathlib/Algebra/Category/Ring/FilteredColimits.lean,Mathlib/Algebra/CharP/Basic.lean,Mathlib/Algebra/CharP/Two.lean,Mathlib/Algebra/DirectLimit.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/DirectSum/Ring.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/GCDMonoid/Div.lean,Mathlib/Algebra/GeomSum.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/GroupWithZero/Commute.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Homology/Additive.lean,Mathlib/Algebra/Homology/ComplexShape.lean,Mathlib/Algebra/Homology/Homology.lean,Mathlib/Algebra/Homology/Homotopy.lean,Mathlib/Algebra/Homology/HomotopyCategory.lean,Mathlib/Algebra/Homology/ImageToKernel.lean,Mathlib/Algebra/IndicatorFunction.lean,Mathlib/Algebra/LinearRecurrence.lean,Mathlib/Algebra/Module/BigOperators.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/LinearMap.lean,Mathlib/Algebra/Module/PointwisePi.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Chebyshev.lean,Mathlib/Algebra/Order/Module.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Rearrangement.lean,Mathlib/Algebra/Order/SMul.lean,Mathlib/Algebra/Order/UpperLower.lean,Mathlib/Algebra/Periodic.lean,Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Algebra/Polynomial/GroupRingAction.lean,Mathlib/Algebra/Star/BigOperators.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/Algebra/Support.lean,Mathlib/Algebra/TrivSqZeroExt.lean,Mathlib/Algebra/Tropical/BigOperators.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/Maximal.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/AlgebraicTopology/AlternatingFaceMapComplex.lean,Mathlib/AlgebraicTopology/ExtraDegeneracy.lean,Mathlib/AlgebraicTopology/TopologicalSimplex.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Asymptotics.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Filter.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean,Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean,Mathlib/Analysis/Calculus/ContDiffDef.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean | 788 | 1 | ['vihdzp'] | nobody | 4 months ago | 1055 days ago | 12 minutes |
| 4127 | kmill | refactor: create HasAdj class, define Digraph, and generalize some SimpleGraph API | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics | 1403/551 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/Graph/Classes.lean,Mathlib/Combinatorics/Graph/Dart.lean,Mathlib/Combinatorics/Graph/Hom.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Density.lean,Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean,Mathlib/Combinatorics/SimpleGraph/Finsubgraph.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 18 | 2 | ['SnirBroshi', 'vihdzp'] | nobody | 4 months ago | 1069 days ago | 8 days |
| 32264 | jjtowery | feat(Bicategory): add lax slice bicategory | --- In this PR, I define the lax slice bicategory for a lax functor over an object. I also give the change of slice strict pseudofunctor. These are from Section 7.1 of Johnson & Yau and are essential for their Whitehead theorem for bicategories (lax functor biequivalence iff essentially surjective, essentially full, and fully faithful), which I'd like to prove at some point. [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author | 527/0 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/LaxSlice.lean | 2 | 12 | ['dagurtomas', 'github-actions', 'jjtowery', 'robin-carlier'] | dagurtomas | 4 months ago | 148 days ago | 3 days |
| 27752 | plp127 | feat(Order): `NoBotOrder α` implies `NoMinOrder α` under `IsDirected α (· ≥ ·)` | This PR continues the work from #24266. Original PR: https://github.com/leanprover-community/mathlib4/pull/24266 | awaiting-author t-order merge-conflict | 14/0 | Mathlib/Order/Directed.lean | 1 | 5 | ['github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'plp127'] | nobody | 4 months ago | 274 days ago | 47 minutes |
| 32921 | faenuccio | refactor Submodule.map | Following [#mathlib4 > on the definition of Submodule.map](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/on.20the.20definition.20of.20Submodule.2Emap/with/563900347) this PR refactors the definition of `Submodule.map` removing the requirement that the underlying ring homomorphism be surjective. --- [](https://gitpod.io/from-referrer/) | WIP awaiting-author t-algebra merge-conflict | 32/20 | Mathlib/Algebra/Module/Submodule/Map.lean | 1 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 137 days ago | 1 second |
| 32960 | dleijnse | feat(FieldTheory): adjoin pth roots | For a field `k` of exponential characteristic `p` and a subset `S` of `k`, we define the extension of `k` obtained by adjoining all `p`-th roots of elements of `S`. We prove that this is a purely inseparable extension, and provide some basic API. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 131/0 | Mathlib.lean,Mathlib/FieldTheory/PurelyInseparable/AdjoinPthRoots.lean | 2 | 13 | ['artie2000', 'chrisflav', 'dleijnse', 'erdOne', 'github-actions', 'leanprover-radar'] | erdOne | 4 months ago | 125 days ago | 10 days |
| 33163 | Aaron1011 | feat: prove subgroup of (M -> Z) is finitely generated | --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 5/0 | Mathlib/RingTheory/DedekindDomain/Dvr.lean | 1 | 2 | ['erdOne', 'github-actions'] | alreadydone | 4 months ago | 124 days ago | 5 days |
| 25481 | kbuzzard | chore: refactor Algebra.TensorProduct.rightAlgebra | The declaration `Algebra.TensorProduct.rightAlgebra` makes `A ⊗[R] B` into a `B`-algebra (here `R` is a `CommSemiring`, `A` is a `Semiring` and an `R`-algebra, and `B` is a `CommSemiring` and an `R`-algebra). It is not an instance because if A = B it causes a diamond. However in the many cases where A isn't B, it can occasionally be useful. However one could imagine that in the many cases where an R-module `M` also isn't `B`, it might occasionally be useful to make `M ⊗[R] B` into a `B`-module (and indeed I am finding this in FLT). With the current definition of `Algebra.TensorProduct.rightAlgebra` this is difficult to do without causing diamonds in the case when `M` happens to be an `R`-algebra (by which I mean "I failed to do this in finite time"). One fix for this is just to redefine `Algebra.TensorProduct.rightAlgebra` so that the `smul` field is ``` smul b ab := TensorProduct.comm _ _ _ (b • (TensorProduct.comm _ _ _ ab)) ``` i.e. literally "swap the product around, use mathlib's instance making `B ⊗[R] A` into a `B`-algebra, and then swap back". Then the same definition can be used to make `M ⊗[R] B` into a `B`-module and on the odd occasion where this point of view is useful, there is no diamond. This is what we do in this PR. After adding one simp lemma there is no breakage at all in mathlib. Furthermore, for those who have observed that we want to build on this algebra instance sometimes and, for example, add instances of the form "if M is finite over R then M ⊗[R] B is finite over B" -- these instances are really easy to add now with this new definition, because you simply pull back the analogous finite left module instance along the isomorphism M ⊗[R] B = B ⊗[R] M. Examples (from FLT, where the right action is put in a scope): ``` scoped instance [Module.Finite R M] : Module.Finite A (M ⊗[R] A) := Module.Finite.equiv (Module.TensorProduct.comm R A M) scoped instance [Module.Free R M] : Module.Free A (M ⊗[R] A) := Module.Free.of_equiv (Module.TensorProduct.comm R A M) ``` --- [](https://gitpod.io/from-referrer/) | t-algebra | 29/6 | Mathlib/RingTheory/TensorProduct/Basic.lean | 1 | 8 | ['adomani', 'github-actions', 'kbuzzard', 'leanprover-bot', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | adomani | 4 months ago | 273 days ago | 56 days |
| 14444 | digama0 | fix(GeneralizeProofs): unreachable! bug | As [reported on Zulip](https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Unreachable.20code.20reached.20in.20Lean.204.2E8.2E0/near/449286780). --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 1/1 | Mathlib/Tactic/GeneralizeProofs.lean | 1 | 6 | ['github-actions', 'jcommelin', 'kmill', 'mathlib4-merge-conflict-bot', 'plby'] | nobody | 4 months ago | 654 days ago | 10 days |
| 25138 | chrisflav | chore(RingTheory/Ideal): make `RingHom.ker` take a `RingHom` instead of `RingHomClass` | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 317/309 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Hom/Rat.lean,Mathlib/Algebra/Algebra/Opposite.lean,Mathlib/Algebra/Algebra/Subalgebra/Operations.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Category/CommAlgCat/FiniteType.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Module/AEval.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean,Mathlib/AlgebraicGeometry/Pullbacks.lean,Mathlib/Combinatorics/Nullstellensatz.lean,Mathlib/FieldTheory/Minpoly/Field.lean,Mathlib/FieldTheory/PurelyInseparable/Tower.lean,Mathlib/LinearAlgebra/Semisimple.lean,Mathlib/LinearAlgebra/TensorProduct/RightExactness.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/Adjoin/Tower.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/Congruence/Hom.lean,Mathlib/RingTheory/Etale/Kaehler.lean,Mathlib/RingTheory/Extension/Cotangent/Basis.lean,Mathlib/RingTheory/Extension/Cotangent/LocalizationAway.lean,Mathlib/RingTheory/Extension/Generators.lean,Mathlib/RingTheory/Extension/Presentation/Basic.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/RingTheory/FinitePresentation.lean,Mathlib/RingTheory/FiniteStability.lean,Mathlib/RingTheory/Finiteness/NilpotentKer.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IsAdjoinRoot.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/Kaehler/Basic.lean,Mathlib/RingTheory/Kaehler/JacobiZariski.lean,Mathlib/RingTheory/LocalRing/ResidueField/Fiber.lean,Mathlib/RingTheory/LocalRing/ResidueField/Ideal.lean,Mathlib/RingTheory/Localization/Algebra.lean,Mathlib/RingTheory/MvPowerSeries/Evaluation.lean,Mathlib/RingTheory/Nilpotent/Lemmas.lean,Mathlib/RingTheory/NoetherNormalization.lean,Mathlib/RingTheory/Nullstellensatz.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/UniqueFactorization.lean,Mathlib/RingTheory/Polynomial/UniversalFactorizationRing.lean,Mathlib/RingTheory/Smooth/AdicCompletion.lean,Mathlib/RingTheory/Smooth/Basic.lean,Mathlib/RingTheory/Smooth/Flat.lean,Mathlib/RingTheory/Smooth/Kaehler.lean,Mathlib/RingTheory/Smooth/NoetherianDescent.lean,Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean,Mathlib/RingTheory/Unramified/Finite.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 68 | 8 | ['chrisflav', 'erdOne', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 229 days ago | 1 hour |
| 31018 | joelriou | feat(CategoryTheory): the κ-accessible category of κ-directed posets | WIP --- - [x] depends on: #30727 - [x] depends on: #31767 - [x] depends on: #29519 - [x] depends on: #29543 - [x] depends on: #29565 - [x] depends on: #29854 - [x] depends on: #30459 - [x] depends on: #30605 - [x] depends on: #31426 - [x] depends on: #31421 - [x] depends on: #30633 - [x] depends on: #30634 - [x] depends on: #30693 - [x] depends on: #30696 - [x] depends on: #30781 [](https://gitpod.io/from-referrer/) | WIP t-category-theory | 446/4 | Mathlib.lean,Mathlib/CategoryTheory/Presentable/Basic.lean,Mathlib/CategoryTheory/Presentable/CardinalDirectedPoset.lean,Mathlib/CategoryTheory/Presentable/SharplyLT.lean,Mathlib/Order/Category/PartOrdEmb.lean | 5 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 185 days ago | 1 second |
| 33386 | joelriou | feat(AlgebraicTopology/SimplicialSet): decidable instances | --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP RFC | 76/0 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplicialSet/Decidable.lean | 2 | 1 | ['github-actions'] | nobody | 4 months ago | unknown | 0 seconds |
| 33381 | urkud | feat: add a version of the Schwarz lemma | Add a version of the Schwarz lemma that is midway between the original lemma and Pick's version. Use it to show that a function that is separately holomorphic on a polydisc and is bounded on this polydisc must be continuous on it. --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #33368 - [x] depends on: #33362 | t-analysis blocked-by-other-PR merge-conflict | 475/91 | Mathlib.lean,Mathlib/Analysis/Complex/Schwarz.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/Complex/UnitDisc/Schwarz.lean,Mathlib/Analysis/Complex/UnitDisc/Shift.lean | 5 | 22 | ['girving', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 4 months ago | 123 days ago | 15 minutes |
| 18805 | astrainfinita | refactor: deprecate `SemilinearMapClass` | --- I'm not sure if we want to do this, but let's see if we can get a speed up from it first. - [ ] depends on: #18755 - [ ] depends on: #18756 - [ ] depends on: #18806 [](https://gitpod.io/from-referrer/) | WIP awaiting-bench t-algebra blocked-by-other-PR merge-conflict | 546/318 | Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/Rat.lean,Mathlib/Algebra/BigOperators/Balance.lean,Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Group/Equiv/Basic.lean,Mathlib/Algebra/Group/Units/Equiv.lean,Mathlib/Algebra/GroupWithZero/Hom.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/LinearMap/Rat.lean,Mathlib/Algebra/Module/LocalizedModule/Int.lean,Mathlib/Algebra/Module/Submodule/EqLocus.lean,Mathlib/Algebra/Module/Submodule/Equiv.lean,Mathlib/Algebra/Module/Submodule/Ker.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Module/Submodule/Range.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Prime/Lemmas.lean,Mathlib/Algebra/Ring/Divisibility/Basic.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/LocallyConvex/WeakOperatorTopology.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Operator/LinearIsometry.lean,Mathlib/CategoryTheory/Limits/ConcreteCategory/WithAlgebraicStructures.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean,Mathlib/Data/Complex/BigOperators.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/FieldTheory/SplittingField/Construction.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/LinearAlgebra/Ray.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Flat/Basic.lean,Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/Ideal/Norm.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/Polynomial/Opposites.lean,Mathlib/RingTheory/RootsOfUnity/Basic.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean,Mathlib/Topology/Algebra/MulAction.lean,Mathlib/Topology/Homeomorph.lean,Mathlib/Topology/MetricSpace/Isometry.lean,scripts/no_lints_prime_decls.txt | 55 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 33462 | eric-wieser | feat: teach `fun_prop` about `ContinousMultilinearMap.compContinuousLinearMap` | For now I've omitted the curried version --- [](https://gitpod.io/from-referrer/) | t-analysis | 46/0 | Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean | 1 | 3 | ['github-actions', 'sgouezel'] | nobody | 3 months ago | 120 days ago | 2 minutes |
| 32840 | joelriou | chore(CategoryTheory): remove the old Ext API | As it is now possible to compute `Ext`-groups (defined using the derived category) using an injective resolution #32105 or a projective resolution #32816, the old `Ext` API (based on left derived functors) is removed. WIP (more API for the new `Ext` is necessary...) --- - [ ] depends on: #32816 - [ ] depends on: #32105 - [ ] depends on: #32814 [](https://gitpod.io/from-referrer/) | file-removed t-category-theory large-import merge-conflict WIP | 546/116 | Mathlib.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/Linear.lean,Mathlib/Algebra/Homology/DerivedCategory/KInjective.lean,Mathlib/Algebra/Homology/DerivedCategory/KProjective.lean,Mathlib/Algebra/Homology/Embedding/IsSupported.lean,Mathlib/Algebra/Homology/LocalCohomology.lean,Mathlib/CategoryTheory/Abelian/Ext.lean,Mathlib/CategoryTheory/Abelian/Injective/Ext.lean,Mathlib/CategoryTheory/Abelian/Injective/Extend.lean,Mathlib/CategoryTheory/Abelian/Projective/Ext.lean,Mathlib/CategoryTheory/Abelian/Projective/Extend.lean,Mathlib/RepresentationTheory/Homological/Resolution.lean | 12 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 139 days ago | 2 minutes |
| 33133 | 0xTerencePrime | feat(Algebra/Group/Center): add Decidable (IsMulCentral a) instance | This PR adds a `Decidable` instance for `IsMulCentral a`. ### Summary The structure `IsMulCentral` was missing a `Decidable` instance. This PR provides the instance by leveraging `isMulCentral_iff`, enabling decidability for both multiplicative and additive (via `to_additive`) structures. ### Verification - `lake build Mathlib.Algebra.Group.Center` passed. - `lake exe runLinter Mathlib.Algebra.Group.Center` passed. | t-algebra new-contributor awaiting-author | 7/0 | Mathlib/Algebra/Group/Center.lean | 1 | 3 | ['github-actions', 'robin-carlier'] | ocfnash | 3 months ago | 119 days ago | 12 days |
| 33191 | sinhp | feat(CategoryTheory): Locally cartesian closed structure on presheaf categories | The category of presheaves on a small category `C` is locally cartesian closed. --- - [ ] depends on: #30375 [](https://gitpod.io/from-referrer/) | WIP t-category-theory blocked-by-other-PR merge-conflict | 703/0 | Mathlib.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ChosenPullbacksAlong.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ExponentiableMorphism.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Sections.lean | 5 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 130 days ago | 31 seconds |
| 28153 | kckennylau | feat(Simproc): Simproc for explicit diagonal matrices | ```lean example : (diagonal ![37, -1] : Matrix (Fin 2) (Fin 2) ℤ) = !![37, 0; 0, -1] := by simp ``` --- Shares code with #28148. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 114/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/Matrix.lean,scripts/noshake.json | 4 | 6 | ['Vierkantor', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 206 days ago | 58 days |
| 25500 | eric-wieser | feat: delaborators for metadata | Being able to see these is very important when debugging tactic failures. Probably these could be upstreamed, but I don't think that's a reason not to merge them here first. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict awaiting-author delegated t-meta | 75/3 | Mathlib/Util/Delaborators.lean,Mathlib/Util/PPOptions.lean,MathlibTest/delaborators.lean | 3 | 19 | ['JovanGerb', 'Rob23oba', 'eric-wieser', 'github-actions', 'kmill', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'plp127'] | nobody | 3 months ago | 246 days ago | 43 days |
| 28191 | kckennylau | feat(Logic): tag Injective, Surjective, and Bijective with fun_prop | --- Zulip: * [#Is there code for X? > surjective is not funprop!](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/surjective.20is.20not.20funprop!) * [#mathlib4 > `fun_prop` for Injective/Surjective/Bijective?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60fun_prop.60.20for.20Injective.2FSurjective.2FBijective.3F) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 16/0 | Mathlib/Tactic/FunProp.lean | 1 | 6 | ['Vierkantor', 'github-actions', 'grunweg', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 206 days ago | 57 days |
| 30432 | kckennylau | feat(AlgebraicGeometry): define the non-vanishing locus of a set in Proj | Given a subset `s : Set A`, the non-vanishing locus of `s` is the set of points whose corresponding prime ideal does not fully contain `s`. In other words, where not all elements of `s` vanish. I could not find a name for this in the literature. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebraic-geometry | 66/0 | Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean | 1 | 4 | ['github-actions', 'jcommelin'] | nobody | 3 months ago | 158 days ago | 44 days |
| 27262 | Timeroot | feat(Tactic/Bound): bound? for proof scripts | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 22/7 | Mathlib/Tactic/Bound.lean | 1 | 13 | ['JovanGerb', 'Timeroot', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 210 days ago | 9 days |
| 32389 | LLaurance | feat(Analysis): Trigonometric identities | `sin` and `cos` of real and complex integer multiples of π/12 --- Resolves https://github.com/leanprover-community/mathlib4/pull/28630#discussion_r2307957255 [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 120/0 | Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | 1 | 11 | ['LLaurance', 'artie2000', 'github-actions', 'j-loreaux'] | nobody | 3 months ago | 133 days ago | 15 days |
| 33502 | MrQubo | fix(Tactic/ProxyType): Pass params explicitly in proxy_equiv% implementation | Fix [#mathlib4 > `deriving Fintype` with Prop](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60deriving.20Fintype.60.20with.20Prop/with/566118621) --- [](https://gitpod.io/from-referrer/) | new-contributor t-meta WIP | 12/2 | Mathlib/Tactic/ProxyType.lean,MathlibTest/DeriveFintype.lean | 2 | 7 | ['MrQubo', 'github-actions', 'kmill'] | kmill | 3 months ago | 117 days ago | 16 hours |
| 21344 | kbuzzard | chore: attempt to avoid diamond in OreLocalization | --- [](https://gitpod.io/from-referrer/) | please-adopt t-algebra | 16/5 | Mathlib/RingTheory/OreLocalization/Basic.lean | 1 | 6 | ['erdOne', 'github-actions', 'kbuzzard'] | nobody | 3 months ago | 451 days ago | 38 minutes |
| 33112 | alreadydone | feat(GroupAction): `(M →[M] M) ≃* Mᵐᵒᵖ` | This comes up in #33108 in the form that permutations of a group commuting with the left multiplications are the right multiplications. The Semiring versions are already in mathlib. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory awaiting-author | 41/3 | Mathlib/GroupTheory/GroupAction/Hom.lean | 1 | 2 | ['github-actions', 'robin-carlier'] | mattrobball | 3 months ago | 119 days ago | 13 days |
| 30375 | sinhp | feat(CategoryTheory): Basics of Locally Cartesian Closed Categories | Supersedes https://github.com/leanprover-community/mathlib4/pull/22321 This PR defines locally cartesian closed categories in terms of existence of the pushforward functors (right adjoint to the pullback functor) for all morphisms. We develop basic API and prove the following: 1. Existence of the pushforward functors is equivalent to cartesian closed slices. 2. Any locally cartesian closed category with a terminal object is cartesian closed. 3. The slices of a locally cartesian closed category are locally cartesian closed. --- - [ ] depends on: #31033 - [ ] depends on: #30373 - [ ] depends on: #31332 [](https://gitpod.io/from-referrer/) | t-category-theory merge-conflict | 703/0 | Mathlib.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ChosenPullbacksAlong.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ExponentiableMorphism.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Sections.lean | 5 | 9 | ['Jlh18', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 3 months ago | 204 days ago | 34 minutes |
| 27972 | smmercuri | refactor: make `Valuation.Completion` a `def` and refactor more of `AdicValuation.lean` | This PR continues the work from #24590. Original PR: https://github.com/leanprover-community/mathlib4/pull/24590 | WIP t-number-theory t-algebra merge-conflict | 188/87 | Mathlib/NumberTheory/NumberField/FinitePlaces.lean,Mathlib/NumberTheory/Padics/WithVal.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 6 | 8 | ['github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot', 'smmercuri'] | nobody | 3 months ago | 226 days ago | 3 days |
| 17176 | arulandu | feat: integrals and integrability with .re | Lemmas for swapping order of .re and integration/integrability. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability please-adopt | 49/0 | Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean | 4 | 32 | ['EtienneC30', 'arulandu', 'github-actions', 'loefflerd'] | nobody | 3 months ago | 563 days ago | 9 days |
| 24129 | urkud | feat: symmetry of Gateaux derivatives | --- [](https://gitpod.io/from-referrer/) | t-analysis | 189/1 | Mathlib/Analysis/Calculus/LineDeriv/Basic.lean,Mathlib/Analysis/Calculus/LineDeriv/Symmetric.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 33640 | JovanGerb | feat: tool for finding duplicate declarations | This PR defines a tool for finding duplicate declarations automatically. This can be used to help fix this technical debt. --- [](https://gitpod.io/from-referrer/) | t-meta | 176/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DuplicateDecls.lean | 3 | 1 | ['github-actions'] | nobody | 3 months ago | 115 days ago | 1 minute |
| 33454 | astrainfinita | feat: lemmas about `IsometryClass` | --- [](https://gitpod.io/from-referrer/) | t-topology t-analysis awaiting-author | 60/37 | Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Operator/LinearIsometry.lean,Mathlib/Topology/MetricSpace/DilationEquiv.lean,Mathlib/Topology/MetricSpace/Isometry.lean | 5 | 8 | ['github-actions', 'j-loreaux'] | urkud | 3 months ago | 114 days ago | 4 days |
| 33368 | urkud | feat: define `Complex.UnitDisc.shift` | Also review the existing API UPD: I'm going to define a `PSL(2, Real)` action instead. --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-zulip merge-conflict | 273/39 | Mathlib.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/Complex/UnitDisc/Shift.lean | 3 | 7 | ['github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'sgouezel', 'urkud'] | j-loreaux | 3 months ago | 115 days ago | 7 days |
| 33450 | astrainfinita | refactor: deprecate `LinearIsometryClass` | --- - [ ] depends on: #33448 - [ ] depends on: #33454 This PR continues the work from #18755. Original PR: https://github.com/leanprover-community/mathlib4/pull/18755 | t-algebra t-analysis blocked-by-other-PR t-topology merge-conflict | 128/125 | Mathlib/Analysis/CStarAlgebra/PositiveLinearMap.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/LocallyConvex/WeakOperatorTopology.lean,Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Operator/LinearIsometry.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean,Mathlib/Topology/MetricSpace/DilationEquiv.lean,Mathlib/Topology/MetricSpace/Isometry.lean | 15 | 5 | ['astrainfinita', 'github-actions', 'leanprover-radar', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 120 days ago | 21 minutes |
| 33554 | themathqueen | chore(Analysis/Normed/Module/Normalize): allow for `RCLike` instead of just the reals | Only the last lemma `normalize_smul` needs `ℝ`, which we rename to `normalize_real_smul`. This also makes `𝕜` explicit in half of the results. --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author merge-conflict | 67/60 | Mathlib/Analysis/CStarAlgebra/Unitary/Span.lean,Mathlib/Analysis/Normed/Module/Normalize.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/TriangleInequality.lean,Mathlib/Geometry/Euclidean/SignedDist.lean | 5 | 4 | ['github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'themathqueen'] | nobody | 3 months ago | 114 days ago | 1 day |
| 27507 | grunweg | wip(commandStart): check the indentation of declaration keywords also | Check that e.g. a `lemma` keyword always starts on column 1 (unless preceded by an attribute). --- TODO: - make this work for other declarations also - the position reported for the lemma column is not helpful (it might be the absolute column in the file, but that's missing line information) [](https://gitpod.io/from-referrer/) | WIP t-linter merge-conflict | 84/1 | Mathlib/Tactic/Linter/CommandStart.lean,MathlibTest/CommandStart.lean | 2 | 3 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 279 days ago | 2 seconds |
| 26088 | grunweg | chore(Linter/DirectoryDependency): move forbidden directories into a JSON file | This PR continues the work from #25406. Original PR: https://github.com/leanprover-community/mathlib4/pull/25406 | please-adopt t-linter merge-conflict | 387/19 | Mathlib/Tactic/Linter/DirectoryDependency.lean,scripts/README.md,scripts/forbiddenDirs.json | 3 | 5 | ['Vierkantor', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 247 days ago | 42 minutes |
| 24010 | grunweg | feat(Counterexamples): a non-negative function, not a.e. zero, with vanishing lowe… | …r Lebesgue integral. Came up in #23707, let's document this while we're at it. --- - [ ] depends on: #20722 [](https://gitpod.io/from-referrer/) | merge-conflict please-adopt WIP blocked-by-other-PR t-measure-probability | 110/0 | Counterexamples.lean,Counterexamples/LIntegralZero.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 382 days ago | 22 seconds |
| 33756 | dleijnse | feat(FieldTheory): root of polynomial with p power coefficients | This PR proves the results in https://stacks.math.columbia.edu/tag/031V, which gives a criterion for a root of a polynomial over a field `k` of characteristic `p` to be a `p`-th power. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 88/0 | Mathlib.lean,Mathlib/FieldTheory/PthPowerCoeffPoly.lean | 2 | 1 | ['github-actions'] | nobody | 3 months ago | unknown | 0 seconds |
| 30608 | grunweg | feat: another lemma about derivatives of parametric integrals | On the path towards proving that integrating smooth functions is smooth. From the sphere-eversion project; I am just upstreaming this. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 125/0 | Mathlib/Analysis/Calculus/ParametricIntegral.lean | 1 | 8 | ['Ruben-VandeVelde', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot'] | j-loreaux | 3 months ago | 178 days ago | 18 days |
| 30610 | grunweg | feat: yet another lemma about differentiability of parametric integrals | From sphere-eversion. --- TODO: explicitly make Floris a co-author again - [ ] depends on: #30608 - [ ] depends on: #30612 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis | 193/0 | Mathlib/Analysis/Calculus/ParametricIntegral.lean | 1 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 197 days ago | 5 minutes |
| 33299 | kingiler | feat: Add decidable membership for Interval | Implemented membership and corresponding decidable instance for `Interval`. Related [#mathlib4 > Proposal: Add decidable membership for Interval](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Proposal.3A.20Add.20decidable.20membership.20for.20Interval/with/565438009). --- [](https://gitpod.io/from-referrer/) | awaiting-author new-contributor t-order | 16/1 | Mathlib/Order/Interval/Basic.lean | 1 | 5 | ['Vierkantor', 'eric-wieser', 'github-actions', 'kingiler'] | Vierkantor | 3 months ago | 113 days ago | 13 days |
| 30953 | kim-em | experiment: add `canonical` to Mathlib | Depends on (these must be merged first before CI will succeed here) - [x] #30952 - [x] #30844 | merge-conflict | 63/3 | Mathlib/Tactic/Common.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,MathlibTest/canonical.lean,lake-manifest.json,lakefile.lean | 5 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 180 days ago | 21 minutes |
| 32470 | ADedecker | feat: the space of test functions is barrelled | --- [](https://gitpod.io/from-referrer/) | t-analysis merge-conflict | 22/0 | Mathlib/Analysis/Distribution/TestFunction.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 33102 | adomani | perf: add a syntactic check for flexible linter | This is very preliminary. --- [](https://gitpod.io/from-referrer/) | t-linter merge-conflict | 205/2 | Mathlib/Tactic/Linter/FlexibleLinter.lean,MathlibTest/FlexibleLinter.lean | 2 | 10 | ['adomani', 'github-actions', 'leanprover-radar', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 30562 | dwrensha | fix(Data/Fintype/Perm): make the main logic of Equiv.instFintype irreducible | Adds a new `irreducible_def` for the main branch of `Equiv.instFintype` to avoid errors about deep recursion. This is an update of #15045 and #30560 according to the discussion in those PRs and in [this zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/kernel.20deep.20recursion.20detected/near/454301820). --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data | 44/10 | Mathlib/Combinatorics/Derangements/Finite.lean,Mathlib/Data/Fintype/Perm.lean,Mathlib/Data/Matrix/Cartan.lean,Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean,MathlibTest/MatrixDetOne.lean | 5 | 18 | ['dwrensha', 'github-actions', 'leanprover-bot', 'plp127', 'robin-carlier'] | robin-carlier | 3 months ago | 186 days ago | 12 days |
| 33669 | eric-wieser | chore(Data/Nat/Digits): refactor to use List.rightpad | --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 32/12 | Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Data/List/Lemmas.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Nat/Digits/Lemmas.lean | 5 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot', 'xroblot'] | nobody | 3 months ago | 115 days ago | 56 minutes |
| 25905 | mans0954 | feat(RingTheory/Polynomial/SmallDegreeVieta): polynomial versions of results in Algebra.QuadraticDiscriminant | This PR continues the work from #25605. Original PR: https://github.com/leanprover-community/mathlib4/pull/25605 | merge-conflict t-ring-theory please-adopt | 77/8 | Mathlib/Algebra/Polynomial/Coeff.lean,Mathlib/RingTheory/Polynomial/SmallDegreeVieta.lean | 2 | 47 | ['chrisflav', 'github-actions', 'kckennylau', 'mans0954', 'mathlib4-merge-conflict-bot', 'ocfnash'] | chrisflav | 3 months ago | 237 days ago | 82 days |
| 25907 | mans0954 | feat: low order roots of unity | This PR continues the work from #25470. Original PR: https://github.com/leanprover-community/mathlib4/pull/25470 | t-algebra please-adopt | 182/0 | Mathlib/Algebra/CharP/Invertible.lean,Mathlib/RingTheory/RootsOfUnity/Complex.lean | 2 | 3 | ['github-actions', 'mans0954', 'urkud'] | jcommelin | 3 months ago | 162 days ago | 157 days |
| 26339 | mans0954 | feat(Analysis/Normed/Module/WeakDual): Banach Dieudonné Lemma | This PR continues the work from #16316. Original PR: https://github.com/leanprover-community/mathlib4/pull/16316 | merge-conflict WIP t-analysis large-import please-adopt | 377/3 | Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Topology/UniformSpace/Cauchy.lean | 4 | 5 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 311 days ago | 18 minutes |
| 26340 | mans0954 | feat(Algebra/Module/NestAlgebra): Nest algebras | This PR continues the work from #18705. Original PR: https://github.com/leanprover-community/mathlib4/pull/18705 | merge-conflict t-algebra please-adopt | 184/0 | Mathlib.lean,Mathlib/Algebra/Module/NestAlgebra.lean,Mathlib/Order/Nest.lean,Mathlib/Order/Preorder/Chain.lean,docs/references.bib | 5 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 302 days ago | 1 hour |
| 26342 | mans0954 | WiP: Expansion of the tensor product of quadratic maps over a linear combination | This PR continues the work from #19806. Original PR: https://github.com/leanprover-community/mathlib4/pull/19806 | WIP t-algebra please-adopt | 483/0 | Mathlib/Data/Sym/Sym2/Prod.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/QuadraticForm/Basis.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct.lean | 4 | 2 | ['github-actions', 'mans0954'] | nobody | 3 months ago | unknown | 0 seconds |
| 26341 | mans0954 | feat(LinearAlgebra/QuadraticForm/Basis): Free Tensor product of Quadratic Maps | This PR continues the work from #19432. Original PR: https://github.com/leanprover-community/mathlib4/pull/19432 | merge-conflict WIP t-algebra large-import please-adopt | 888/0 | Mathlib.lean,Mathlib/Data/Sym/Sym2/Prod.lean,Mathlib/LinearAlgebra/QuadraticForm/Basis.lean | 3 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 311 days ago | 4 minutes |
| 26343 | mans0954 | feat(Analysis/Normed/Module/Complemented): The idempotent associated with a complemented subspace | Given a complemented subspace `p` of a Banach space `E`, with complement `q`, there exists an idempotent `P` in the ring `E →L[𝕜] E` such that `P` has range `p` and kernel `q`. Similarly `1-P` has range `q` and kernel `p`. See Rudin, Functional Analysis, Theorem 5.16. --- This PR continues the work from #20330. Original PR: https://github.com/leanprover-community/mathlib4/pull/20330 [](https://gitpod.io/from-referrer/) | WIP awaiting-CI large-import merge-conflict t-analysis please-adopt | 185/3 | Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/Hom.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Analysis/Normed/Module/Complemented.lean,Mathlib/RingTheory/Idempotents.lean | 5 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 26344 | mans0954 | feat(Analysis/NormedSpace/MStructure): The component projections on WithLp 1 (α × β) are L-projections | This PR continues the work from #20380. Original PR: https://github.com/leanprover-community/mathlib4/pull/20380 | merge-conflict WIP t-analysis file-removed please-adopt | 20/1 | Mathlib.lean,Mathlib/Analysis/Normed/Lp/MStructure.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean | 3 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 311 days ago | 9 minutes |
| 26346 | mans0954 | feat(LinearAlgebra/QuadraticForm/TensorProduct): Extend `baseChange_ext` to work over a free module | This PR continues the work from #21814. Original PR: https://github.com/leanprover-community/mathlib4/pull/21814 | merge-conflict WIP t-algebra please-adopt | 105/5 | Mathlib/LinearAlgebra/Basis/Bilinear.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct.lean | 2 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 26347 | mans0954 | feat(Data/Finset/RangeDistance): abs_sub_lt_of_mem_finset_range | This PR continues the work from #23161. Original PR: https://github.com/leanprover-community/mathlib4/pull/23161 | merge-conflict t-data please-adopt | 30/0 | Mathlib.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Data/Finset/RangeDistance.lean | 3 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | alreadydone | 3 months ago | 163 days ago | 142 days |
| 26349 | mans0954 | feat(Analysis/SpecialFunctions/Trigonometric/Basic): sin and cos of multiples of π / 3 | This PR continues the work from #25009. Original PR: https://github.com/leanprover-community/mathlib4/pull/25009 | help-wanted t-analysis please-adopt | 159/0 | Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Data/Nat/Cast/Defs.lean,MathlibTest/trigonometry.lean | 4 | 3 | ['github-actions', 'mans0954', 'themathqueen'] | nobody | 3 months ago | 305 days ago | 5 days |
| 26348 | mans0954 | feat(Analysis/LocallyConvex/Prime): the prime map | This PR continues the work from #24385. Original PR: https://github.com/leanprover-community/mathlib4/pull/24385 | merge-conflict WIP t-analysis please-adopt | 125/0 | Mathlib.lean,Mathlib/Analysis/LocallyConvex/Prime.lean | 2 | 3 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 311 days ago | 1 minute |
| 26983 | mans0954 | feat(Order/LatticeElements): distributive, standard and neutral elements of a lattice | Defines distributive, standard and neutral elements of a lattice and gives equivalent conditions. --- - [x] depends on: #26836 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order please-adopt | 238/0 | Mathlib.lean,Mathlib/Order/Hom/Lattice.lean,Mathlib/Order/LatticeElements.lean | 3 | 5 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 208 days ago | 6 hours |
| 29980 | mans0954 | refactor(RingTheory/Polynomial/Resultant/Quadratic): Re-implement QuadraticDiscriminant for R[X] | Re-implement `Algebra/QuadraticDiscriminant` for polynomials. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/discriminants.20of.20low.20degree.20polynomials/with/538010519) --- - [ ] depends on: #29981 [](https://gitpod.io/from-referrer/) | merge-conflict please-adopt | 208/0 | Mathlib.lean,Mathlib/RingTheory/Polynomial/Resultant/Quadratic.lean | 2 | 4 | ['JovanGerb', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | JovanGerb | 3 months ago | 163 days ago | 41 days |
| 29387 | mans0954 | feat(Analysis/LocallyConvex/WeakSpace): toWeakSpace_closedAbsConvexHull_eq | The closed absolutely convex hull taken in the weak topology coincides with the closed absolutely convex hull taken in the original topology. --- - [ ] depends on: #29378 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis please-adopt | 133/68 | Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Analysis/LocallyConvex/AbsConvexOpen.lean,Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean,Mathlib/Analysis/LocallyConvex/Basic.lean,Mathlib/Analysis/Normed/Module/Dual.lean | 6 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 237 days ago | 10 minutes |
| 30393 | mans0954 | WIP: Bipolar theorem absconvex refactor | Experiment to see what happens when #26345 and #29342 are merged. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP large-import please-adopt | 383/138 | Mathlib.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Analysis/LocallyConvex/AbsConvexOpen.lean,Mathlib/Analysis/LocallyConvex/Basic.lean,Mathlib/Analysis/LocallyConvex/Bipolar.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Topology/Algebra/Module/LinearSpan.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/Algebra/Module/WeakBilin.lean | 12 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 29378 | mans0954 | feat(Analysis/LocallyConvex/AbsConvex): Balanced and AbsConvex sets under linear maps | Provide `Balanced` and `AbsConvex` versions of `Convex.linear_image`, `Convex.linear_preimage` and the `is_linear` equivalents. --- - [ ] depends on: #29342 [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis please-adopt | 133/68 | Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Analysis/LocallyConvex/AbsConvexOpen.lean,Mathlib/Analysis/LocallyConvex/BalancedCoreHull.lean,Mathlib/Analysis/LocallyConvex/Basic.lean,Mathlib/Analysis/Normed/Module/Dual.lean | 6 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 198 days ago | 4 hours |
| 26337 | mans0954 | feat(Analysis/NormedSpace/MStructure): M-ideals | This PR continues the work from #14369. Original PR: https://github.com/leanprover-community/mathlib4/pull/14369 | merge-conflict WIP t-analysis large-import please-adopt | 857/40 | Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/Hom.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Analysis/Normed/Module/Complemented.lean,Mathlib/Analysis/NormedSpace/MStructure.lean | 5 | 4 | ['github-actions', 'mans0954', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 13158 | erdOne | refactor(RingTheory/OreLocalization/Module): remove `LocalizedModule.mk`. | --- - [x] depends on: #13151 - [ ] depends on: #13156 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 49/48 | Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/RingTheory/OreLocalization/Module.lean | 2 | 2 | ['leanprover-community-mathlib4-bot', 'urkud'] | nobody | 3 months ago | 694 days ago | 9 days |
| 12934 | grunweg | chore: replace more uses of > or ≥ by < or ≤ | These were flagged by the linter in https://github.com/leanprover-community/mathlib4/pull/12879: it is easy to simple avoid > or ≥ in hypotheses or haves. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted | 41/42 | Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2019Q4.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib/Tactic/Linarith/Datatypes.lean,test/cancel_denoms.lean,test/congr.lean,test/interval_cases.lean,test/observe.lean | 15 | 12 | ['YaelDillies', 'adomani', 'github-actions', 'grunweg', 'jcommelin', 'urkud'] | nobody | 3 months ago | 714 days ago | 1 day |
| 28070 | grunweg | style: improve indentation of multi-linear enumerations in doc-strings | Per zulip discussion: [#mathlib4 > Style :bicycle: : indenting second lines in doc-strings @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Style.20.3Abicycle.3A.20.3A.20indenting.20second.20lines.20in.20doc-strings/near/533105734). --- [](https://gitpod.io/from-referrer/) | merge-conflict | 111/108 | Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/BrauerGroup/Defs.lean,Mathlib/Algebra/Module/LinearMap/Polynomial.lean,Mathlib/CategoryTheory/Abelian/NonPreadditive.lean,Mathlib/CategoryTheory/EqToHom.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/Pi.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Sites/Grothendieck.lean,Mathlib/CategoryTheory/Sites/Pretopology.lean,Mathlib/Condensed/Discrete/Characterization.lean,Mathlib/FieldTheory/ChevalleyWarning.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,docs/Conv/Guide.lean | 16 | 8 | ['github-actions', 'grunweg', 'kbuzzard', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 3 months ago | 248 days ago | 18 days |
| 29077 | grunweg | feat(Manifold/Instances/Icc): golf smoothness proof using immersions | Prove that the inclusion of an interval into the real numbers is a smooth immersion, and use this to golf the proof that this inclusion is smooth. TODO: right now, the computation doesn't check out; I need to tweak the charts I have. But that is surely doable. A future PR will prove it is a smooth embedding. --- - [ ] depends on: #28865 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-differential-geometry | 1122/56 | Mathlib.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/ContMDiff/Defs.lean,Mathlib/Geometry/Manifold/Instances/Icc.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Topology/PartialHomeomorph.lean,docs/references.bib,temp_.sh | 13 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 246 days ago | 5 minutes |
| 32880 | 0xTerencePrime | feat(Analysis/Asymptotics): define subpolynomial growth | ## Main definitions * `Asymptotics.IsSubpolynomial l f g`: A function `f` has subpolynomial growth with respect to `g` along filter `l` if `f = O(1 + ‖g‖^k)` for some natural `k`. ## Main results * `IsSubpolynomial.const`: Constant functions have subpolynomial growth * `IsSubpolynomial.id`: Identity has subpolynomial growth * `IsSubpolynomial.add`: Closure under addition * `IsSubpolynomial.neg`: Closure under negation * `IsSubpolynomial.sub`: Closure under subtraction * `IsSubpolynomial.mul`: Closure under multiplication * `IsSubpolynomial.pow`: Closure under powers * `isSubpolynomial_iff_one_add`: Equivalence with `(1 + ‖g‖)^k` formulation * `IsSubpolynomial.uniform`: Uniform bounds for finite families ## Implementation notes The definition uses `1 + ‖g‖^k` rather than `(1 + ‖g‖)^k` as the primary form, with the equivalence established in `isSubpolynomial_iff_one_add`. Four private auxiliary lemmas handle the key inequalities needed for closure proofs. Closes #32658 | awaiting-author t-analysis new-contributor | 185/0 | Mathlib.lean,Mathlib/Analysis/Asymptotics/Subpolynomial.lean | 2 | 28 | ['0xTerencePrime', 'ADedecker', 'github-actions', 'j-loreaux'] | ADedecker | 3 months ago | 109 days ago | 22 days |
| 33814 | seewoo5 | feat(Manifold/MFDeriv): add `MDifferentiable.pow` with FunProp | --- - [ ] depends on: #33808 Tag `MDifferentiable.pow` with `fun_prop`. [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR merge-conflict | 22/0 | Mathlib/Geometry/Manifold/MFDeriv/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/Defs.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 111 days ago | 2 hours |
| 33948 | anivegesana | feat(Analysis/Normed/Algebra): matrix exponential of nilpotent matrix | Where the matrix exponential and nilpotent elements are defined, both the matrix exponential and the nilpotent element exponential. I had to add a different theorem for normed space exponential and the matrix exponential since the right instances wouldn't be synthesized. Help with golfing would be appreciated. --- [](https://gitpod.io/from-referrer/) | new-contributor t-analysis | 34/0 | Mathlib/Analysis/Normed/Algebra/Exponential.lean,Mathlib/Analysis/Normed/Algebra/MatrixExponential.lean | 2 | 1 | ['github-actions'] | nobody | 3 months ago | 107 days ago | 57 minutes |
| 26291 | RemyDegenne | feat(Probability): Cameron-Martin theorem | - Definition of the Cameron-Martin space of a Gaussian measure - The Cameron-Martin theorem: shifting a Gaussian measure by an element of the Cameron-Martin space gives an equivalent measure, and shifting by an element which is not in the Cameron-Martin space gives a mutually singular measure. --- - [x] depends on: #24975 - [x] depends on: #24969 - [x] depends on: #24930 - [x] depends on: #24925 - [x] depends on: #24900 - [x] depends on: #25532 - [x] depends on: #27022 - [x] depends on: #27027 - [x] depends on: #27029 - [x] depends on: #27123 - [x] depends on: #27610 - [x] depends on: #28342 - [x] depends on: #28343 - [x] depends on: #30167 - [x] depends on: #30346 - [x] depends on: #30348 - [ ] depends on: #30582 - [x] depends on: #31551 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #24430.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/24430* | WIP blocked-by-other-PR t-measure-probability merge-conflict | 1340/5 | Mathlib.lean,Mathlib/Probability/Distributions/Gaussian/CameronMartin.lean,Mathlib/Probability/Distributions/Gaussian/CameronMartinThm.lean,Mathlib/Probability/Distributions/Gaussian/CompletionResultsToBeMoved.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/Moments/CovarianceBilinDual.lean,Mathlib/Probability/Moments/Variance.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/Algebra/Module/ClosedSubmodule.lean,Mathlib/Topology/UniformSpace/AbstractCompletion.lean,docs/1000.yaml | 11 | 13 | ['github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 312 days ago | 2 seconds |
| 30030 | JonBannon | feat(MeasureTheory): add `MemLp.Const` class and instances to unify `p = ∞` and `μ.IsFiniteMeasure` cases | Although it is possible to ensure that, for example, the `One` instances for `p=∞` and `μ.IsFiniteMeasure` are defeq, introducing an `MemLp.Const` typeclass removes the need to unfold extensively to check this definitional equality, improving performance. cf. https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Lp.20constant.20function.20issue/with/537563137 This PR introduces the requisite class and associated instances. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-measure-probability merge-conflict | 224/136 | Mathlib/MeasureTheory/Function/ConditionalExpectation/AEMeasurable.lean,Mathlib/MeasureTheory/Function/ContinuousMapDense.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousCompMeasurePreserving.lean,Mathlib/MeasureTheory/Function/LpSpace/DomAct/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Indicator.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/MeasureTheory/Measure/SeparableMeasure.lean | 13 | 25 | ['JonBannon', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot'] | urkud | 3 months ago | 196 days ago | 12 days |
| 33807 | adamtopaz | feat: TypeCat refactor | --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory merge-conflict | 114/0 | ConstGraph/Main.lean,Mathlib/CategoryTheory/Types/Basic.lean,lakefile.lean | 3 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 111 days ago | 1 second |
| 29610 | llllvvuu | feat(LinearAlgebra): define LinearMap.Eigenbasis | Some theorems are left TODO for follow-up work.
The definition is from @eric-wieser ([#Is there code for X? > diagonalizable linear maps @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/diagonalizable.20linear.20maps/near/539163222)).
Co-authored-by: Aristotle Harmonic |
merge-conflict t-algebra awaiting-author | 455/5 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/LinearAlgebra/Eigenbasis.lean,Mathlib/LinearAlgebra/FreeModule/PID.lean,Mathlib/Order/CompleteLattice/Basic.lean | 5 | 31 | ['github-actions', 'joelriou', 'kckennylau', 'llllvvuu', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | joelriou | 3 months ago | 163 days ago | 20 days |
| 33992 | tb65536 | feat(NumberTheory/NumberField/ExistsRamified): Galois group is generated by inertia subgroups | This PR proves that `Gal(K/ℚ)` is generated by its inertia subgroups (because otherwise the fixed field would be an unramified extension of `ℚ`). --- - [ ] depends on: #30666 [](https://gitpod.io/from-referrer/) | t-number-theory t-algebra blocked-by-other-PR | 101/0 | Mathlib/NumberTheory/NumberField/ExistsRamified.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 3 months ago | 106 days ago | 47 seconds |
| 30582 | RemyDegenne | feat: extension of a function to the closure of a submodule | - define the closure of a set in a complete space as an `AbstractCompletion` - add instances about submodules - add a coercion from a submodule to its topological closure - add induction lemmas on topological closures of submodules - define the extension of a function on a submodule to the closure of a submodule --- [](https://gitpod.io/from-referrer/) | t-topology WIP merge-conflict | 138/1 | Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/UniformSpace/AbstractCompletion.lean | 2 | 8 | ['ADedecker', 'RemyDegenne', 'github-actions', 'mathlib4-merge-conflict-bot', 'mcdoll'] | PatrickMassot and mcdoll | 3 months ago | 149 days ago | 35 days |
| 32436 | thorimur | feat: `unusedFactInType` linter | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter | 55/3 | Mathlib/Init.lean,Mathlib/Tactic/Linter/UnusedInstancesInType.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 28631 | faenuccio | feat(Data\Nat\ModEq.lean): add grind attribute to ModEq | --- [](https://gitpod.io/from-referrer/) | WIP t-data merge-conflict | 7/0 | Mathlib/Data/Nat/ModEq.lean | 1 | 5 | ['faenuccio', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 255 days ago | 22 seconds |
| 30391 | rudynicolop | feat(Data/List): list splitting definitions and lemmas | This PR continues the work from #24395. Original PR: https://github.com/leanprover-community/mathlib4/pull/24395 | t-data new-contributor awaiting-author | 108/2 | Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/List/TakeDrop.lean | 2 | 50 | ['BoltonBailey', 'IlPreteRosso', 'TwoFX', 'Vierkantor', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'rudynicolop'] | TwoFX | 3 months ago | 105 days ago | 93 days |
| 33126 | CoolRmal | feat: function composition preserves boundedness | This PR adds the following theorem: if the range of a function `g` is bounded above, then `g ∘ f` is bounded above for all functions `f`. --- [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 12/0 | Mathlib/Order/Bounds/Basic.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | bryangingechen | 3 months ago | 105 days ago | 27 days |
| 31348 | PatrickMassot | chore: fix a docstring typo | --- [](https://gitpod.io/from-referrer/) | documentation awaiting-author t-analysis | 1/1 | Mathlib/Analysis/Calculus/Darboux.lean | 1 | 3 | ['ADedecker', 'dopamine333', 'github-actions'] | nobody | 3 months ago | 175 days ago | 6 hours |
| 10991 | thorimur | feat: `tfae` block tactic | This PR introduces `tfae` block tactic syntax: ```lean tfae 1 → 2 := /- proof of `P₁ → P₂` -/ 2 → 3 := /- proof of `P₂ → P₃` -/ 3 → 1 := /- proof of `P₃ → P₁` -/ ``` Like the recent change to `tfae_have`, this syntax also supports all sorts of matching that `have` itself supports: ```lean tfae 2 → 3 | h₂ => /- proof of `P₃` -/ 3 → 1 -- given `P₁ := ∀(a : A), (b : B), (c : C), X`: | h₃, a, b, c => /- proof of `X` -/ ⟨h_mp, h_mpr⟩ : 1 ↔ 2 := /- proof of `P₁ ↔ P₂`; puts `h_mp : P₁ → P₂`, `h_mpr : P₂ → P₁` in the lctx -/ ``` This initial implementation is currently very simple, and relies on `tfae_have` and `tfae_finish`. Although we intend to migrate away from that syntax, this PR does not remove support for it or deprecate `tfae_have`/`tfae_finish` in any way; migration (but not deprecation) is done in #11003. --- - [x] depends on: #10653 - [x] depends on: #10994 [](https://gitpod.io/from-referrer/) | merge-conflict WIP modifies-tactic-syntax t-meta | 392/124 | Mathlib/Tactic/TFAE.lean,scripts/noshake.json,test/tfae.lean | 3 | 5 | ['github-actions', 'joneugster', 'mathlib4-dependent-issues-bot', 'thorimur'] | joneugster | 3 months ago | 588 days ago | 7 days |
| 29282 | Jlh18 | feat(CategoryTheory): HasColimits instance on Grpd | Show that the category of groupoids has all small colimits, as a coreflective subcategory of `Cat`, which has all small colimits. The right adjoint of the forgetful functor is the core functor `CategoryTheory.Core.functor`. - [ ] depends on: #29283 [Core of a category as a functor] --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-category-theory | 140/4 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/CategoryTheory/Category/Grpd.lean,Mathlib/CategoryTheory/Core.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Colimit.lean,Mathlib/CategoryTheory/Groupoid/Grpd/Core.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 240 days ago | 6 minutes |
| 29587 | uniwuni | feat(GroupTheory/Finiteness): define finitely generated semigroups | We define finitely generated semigroups and basics similarly to monoids and groups and prove that semigroups and monoids remain finitely generated when a congruence is quotiented out. This will be important when further developing semigroup theory. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-group-theory | 259/14 | Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/GroupTheory/Finiteness.lean | 2 | 4 | ['github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'uniwuni'] | dupuisf | 3 months ago | 205 days ago | 25 days |
| 28905 | grunweg | feat: immersions are locally embeddings | Hopefully, this can be used for the topological portion of #28865. (That part is not certain yet, the rest works.) --- Needs some clean-up in both the immersions file, and need to move the helper results about embeddings to the correct location. - [x] depends on: #28793 - [ ] depends on: #28796 - [x] depends on: #28853 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict t-differential-geometry | 331/15 | Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/LocalSourceTargetProperty.lean,Mathlib/Geometry/Manifold/SmoothEmbedding.lean | 7 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 249 days ago | 6 minutes |
| 30504 | grunweg | feat: add custom elaborators for immersions | And golf the fail using it, a bit. Other usage sites expose bugs or unexpected error messages... TODO: add basic tests for basic usage TODO: fix those errors (then try to golf further! --- - [x] depends on: #30307 - [x] depends on: #30356 - [ ] depends on: #28796 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-meta t-differential-geometry merge-conflict | 286/87 | Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/LocalSourceTargetProperty.lean,Mathlib/Geometry/Manifold/SmoothEmbedding.lean | 6 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 200 days ago | 13 seconds |
| 34132 | Paul-Lez | feat(Analysis/PDE/Quasilinear/Defs): Add definitions about quasilinear first order PDEs | This PR continues the work from #25429. Original PR: https://github.com/leanprover-community/mathlib4/pull/25429 | t-analysis | 147/0 | Mathlib.lean,Mathlib/Analysis/PDE/Quasilinear/Defs.lean | 2 | 1 | ['github-actions'] | nobody | 3 months ago | unknown | 0 seconds |
| 34134 | Paul-Lez | feat(Mathlib/Analysis/PDE/Quasilinear/Characteristics): the method of characteristics for first order quasilinear PDEs | This PR continues the work from #25710. Original PR: https://github.com/leanprover-community/mathlib4/pull/25710 | WIP t-analysis | 620/0 | Mathlib.lean,Mathlib/Analysis/PDE/Quasilinear/Characteristics.lean,Mathlib/Analysis/PDE/Quasilinear/Defs.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean | 4 | 3 | ['Paul-Lez', 'github-actions', 'mcdoll'] | nobody | 3 months ago | 102 days ago | 5 minutes |
| 30853 | JovanGerb | feat(LinearAlgebra/AffineSpace/Simplex): `CoeFun` instance for `Simplex` | This PR introduces the notation `s i` to refer to the `i`th vertex of simplex `s`, which replaces the current `s.points i`. It does this by adding a `CoeFun` instance. I first tried using `FunLike`, but this came with some different problems related to discrimination tree indexing in `simp`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-euclidean-geometry merge-conflict | 381/371 | Archive/Imo/Imo2019Q2.lean,Mathlib/Analysis/Convex/Between.lean,Mathlib/Analysis/Normed/Affine/Simplex.lean,Mathlib/Geometry/Euclidean/Altitude.lean,Mathlib/Geometry/Euclidean/Angle/Sphere.lean,Mathlib/Geometry/Euclidean/Circumcenter.lean,Mathlib/Geometry/Euclidean/Incenter.lean,Mathlib/Geometry/Euclidean/MongePoint.lean,Mathlib/Geometry/Euclidean/Projection.lean,Mathlib/Geometry/Euclidean/SignedDist.lean,Mathlib/Geometry/Euclidean/Simplex.lean,Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Centroid.lean,scripts/nolints.json | 15 | 14 | ['JovanGerb', 'eric-wieser', 'github-actions', 'jsm28', 'mathlib4-merge-conflict-bot'] | jsm28 | 3 months ago | 147 days ago | 41 days |
| 34238 | Ruben-VandeVelde | feat: some lemmas about AlgHom 1 and * | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 22/0 | Mathlib/Algebra/Algebra/Hom.lean | 1 | 5 | ['Ruben-VandeVelde', 'Vierkantor', 'eric-wieser', 'github-actions'] | nobody | 3 months ago | 99 days ago | 12 hours |
| 32828 | Hagb | feat(Algebra/Order/Group/Defs): add `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid'` | It is similar to `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid`, while with different hypotheses. The conclusion `IsOrderedCancelMonoid α` on `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid` still holds when the hypothesis `CommGroup α` is weakened to `CancelCommMonoid α` while `PartialOrder α` is strengthened to `LinearOrder α`. --- [`IsOrderedAddMonoid.toIsOrderedCancelAddMonoid`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=IsOrderedAddMonoid.toIsOrderedCancelAddMonoid#doc) and `IsOrderedAddMonoid.toIsOrderedCancelAddMonoid'`: https://github.com/leanprover-community/mathlib4/blob/97f78b1a4311fed1844b94f1c069219a48a098e1/Mathlib/Algebra/Order/Group/Defs.lean#L52-L62 [](https://gitpod.io/from-referrer/) | awaiting-zulip t-algebra | 4/0 | Mathlib/Algebra/Order/Group/Defs.lean | 1 | 8 | ['Garmelon', 'Vierkantor', 'artie2000', 'github-actions', 'leanprover-radar'] | eric-wieser | 3 months ago | 99 days ago | 40 days |
| 34141 | gululu996-ui | feat(Combinatorics/SimpleGraph/Acyclic): finite trees have at least two degree-one vertices | Add a lemma showing that a finite tree with at least two vertices has at least two vertices of degree 1. - Introduce a helper lemma `SimpleGraph.Connected.one_le_degree` for connected graphs on a nontrivial finite type. - Prove the leaf-count lower bound via the degree-sum identity and a counting argument. --- | awaiting-author new-contributor t-combinatorics | 72/2 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 9 | ['IvanRenison', 'SnirBroshi', 'github-actions', 'vlad902'] | nobody | 3 months ago | 100 days ago | 1 day |
| 29014 | ShreckYe | feat(Data/List/Scan): some theorems that relate `scanl` with `foldl` | I am not sure which is the best form of `getElem_scanl_eq_foldl_take` here, so I added several alternative forms. Feel free to remove any of them if necessary. | merge-conflict t-data | 35/0 | Mathlib/Data/List/Scan.lean | 1 | 15 | ['ShreckYe', 'github-actions', 'mathlib4-merge-conflict-bot', 'themathqueen', 'vlad902'] | pechersky | 3 months ago | 172 days ago | 74 days |
| 33689 | BoltonBailey | feat(Probability): PMF point mass function | This PR defines a pointMass function, which returns the value of a PMF at a point as a `NNReal`. --- Perhaps `unitInterval` would be better? Note: A number of Zulip discussions lists below have discussed what the return type of `PMF` should be and if the definition should be refactored. This PR avoids this by simply creating a new function, but depends on a PR from these discussions to not cause a collision. Zulip: - [#new members > Why is the codomain of PMF in mathlib ENNReal and not NNReal @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Why.20is.20the.20codomain.20of.20PMF.20in.20mathlib.20ENNReal.20and.20not.20NNReal/near/526572449) - [#new members > Performing arithmetic with ENNReals @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Performing.20arithmetic.20with.20ENNReals/near/525936290) - [#Is there code for X? > Statistical distance for `PMF`s? @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Statistical.20distance.20for.20.60PMF.60s.3F/near/525234190) - [#mathlib4 > PMF Refactor: FunLike vs Definition Change](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/PMF.20Refactor.3A.20FunLike.20vs.20Definition.20Change/with/567771586) - [ ] depends on: #34138 [](https://gitpod.io/from-referrer/) | t-measure-probability WIP blocked-by-other-PR | 93/0 | Mathlib/Probability/ProbabilityMassFunction/PointMass.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 34086 | adomani | perf: test the effect of localizing the whitespace linter | This PR checks whether the modification contained in #26299 have a positive effect on this one. The other PR has a few minor regressions, but hopefully this PR has very substantial speed ups. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 2076/462 | Archive/Imo/Imo2010Q5.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/HeawoodUnitDistance.lean,Counterexamples/MonicNonRegular.lean,Mathlib/Algebra/AffineMonoid/Basic.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Module/TransferInstance.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Polynomial/RuleOfSigns.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Formula.lean,Mathlib/AlgebraicTopology/SimplicialSet/CompStructTruncated.lean,Mathlib/AlgebraicTopology/SimplicialSet/Path.lean,Mathlib/AlgebraicTopology/SimplicialSet/StrictSegal.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/CategoryTheory/Comma/Over/OverClass.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean,Mathlib/CategoryTheory/Monoidal/Action/Basic.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/CommGrp_.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/OfHasFiniteProducts.lean,Mathlib/Combinatorics/SetFamily/LYM.lean,Mathlib/Computability/AkraBazzi/AkraBazzi.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Data/DFinsupp/Notation.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/Fin/Fin2.lean,Mathlib/Data/Finset/Slice.lean,Mathlib/Data/Finset/Sort.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Matrix/Cartan.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Num/Bitwise.lean,Mathlib/Data/PNat/Xgcd.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/Data/Vector/MapLemmas.lean,Mathlib/FieldTheory/CardinalEmb.lean,Mathlib/FieldTheory/Finite/Extension.lean,Mathlib/FieldTheory/Laurent.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/GroupTheory/FreeGroup/Reduce.lean,Mathlib/LinearAlgebra/TensorPower/Symmetric.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/PullOut.lean,Mathlib/MeasureTheory/Integral/TorusIntegral.lean,Mathlib/ModelTheory/Syntax.lean,Mathlib/NumberTheory/Niven.lean,Mathlib/Probability/CondVar.lean,Mathlib/Probability/Independence/Conditional.lean,Mathlib/RingTheory/Nilpotent/Exp.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/Whitespace.lean,Mathlib/Tactic/Ring/NamePolyVars.lean,Mathlib/Topology/Algebra/IsUniformGroup/Defs.lean,Mathlib/Topology/Category/TopCat/Limits/Basic.lean,Mathlib/Topology/Instances/Rat.lean,Mathlib/Util/Superscript.lean,MathlibTest/WhitespaceLinter.lean | 67 | 5 | ['adomani', 'github-actions', 'leanprover-radar', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 34371 | grunweg | feat: module instance on ContMDiffMap | From fpvandoorn and my LeanCourse25. --- [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry | 117/0 | Mathlib/Geometry/Manifold/Algebra/LieGroup.lean | 1 | 2 | ['github-actions'] | nobody | 3 months ago | 97 days ago | 7 seconds |
| 34219 | or4nge19 | feat(MeasureTheory/BorelSpace): measurability of annuli on (pseudo)(e)metric space | it assumes `OpensMeasurableSpace` original [file](https://github.com/fpvandoorn/carleson/blob/master/Carleson/ToMathlib/Annulus.lean) From the Carleson project. Co-authored-by: James Sundstrom [james.sundstrom@gmail.com](mailto:james.sundstrom@gmail.com) --- - [x] depends on: #34200 - [ ] depends on: #34202 [](https://gitpod.io/from-referrer/) | carleson blocked-by-other-PR t-measure-probability | 534/0 | Mathlib.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Annulus.lean,Mathlib/Topology/MetricSpace/Annulus.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 100 days ago | 4 minutes |
| 33132 | BoltonBailey | feat(Computability): Single-tape TM complexity | Currently, time complexity in mathlib is defined in terms of (a kind of) multi-tape Turing machine [Turing.FinTM2](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Computability/TMComputable.html#Turing.FinTM2). This (currently Draft) PR develops time complexity in terms of Single-Tape Turing Machines. There are a few reasons to do this: * Having definitions of time complexity for both single-tape and multi-tape TMs is a prerequisite to prove theorems relating these definitions of complexity (in particular, the theorem that the definition of polynomial time computability is equivalent between these notions). * The Multi-tape "TM2" definition seems to be based on "Wang B-Machines" ([wiki](https://en.wikipedia.org/wiki/Wang_B-machine)) which involves both a program of function labels, as well as a set of states. * I think it's a bit more common to see a simpler presentation of single-tape ([and multitape](https://en.wikipedia.org/wiki/Multitape_Turing_machine)) Turing machines which only provides a set of states. * It seems to me that the B-Machine-like definition makes it a bit complicated to make progress. For example, if I want to compose Turing Machines, then I have to be able to construct a new program and state set, which involves mapping the [Turing.TM2.Stmt](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Computability/TuringMachine.html#Turing.TM2.Stmt) type to the sum type of the tapes. I have to do something similar for single-tape TMs, but the Stmt type is less complicated, so this is less involved. * If we want to continue on and define space complexity, it seems convenient to have only a single tape, so that we don't have to do lots of reasoning over summations. --- [](https://gitpod.io/from-referrer/) | t-computability WIP | 1480/0 | Mathlib/Computability/BinEncoding.lean,Mathlib/Computability/EncodingTo.lean,Mathlib/Computability/SingleTapeBinTMComputable.lean,Mathlib/Computability/SingleTapeTMComputable.lean | 4 | 1 | ['github-actions'] | nobody | 3 months ago | unknown | 0 seconds |
| 31134 | thorimur | chore: use `whenLinterActivated` in linters | Replaces boilerplate in linters with `whenLinterActivated` or `whenLinterOption` where possible. --- - [ ] depends on: #31133 [](https://gitpod.io/from-referrer/) | delegated | 79/102 | Mathlib/Tactic/Linter/CommandRanges.lean,Mathlib/Tactic/Linter/DocPrime.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/Linter/GlobalAttributeIn.lean,Mathlib/Tactic/Linter/HashCommandLinter.lean,Mathlib/Tactic/Linter/Header.lean,Mathlib/Tactic/Linter/Lint.lean,Mathlib/Tactic/Linter/MinImports.lean,Mathlib/Tactic/Linter/Multigoal.lean,Mathlib/Tactic/Linter/OldObtain.lean,Mathlib/Tactic/Linter/PPRoundtrip.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,Mathlib/Tactic/Linter/UpstreamableDecl.lean,Mathlib/Tactic/Linter/Whitespace.lean,Mathlib/Util/CountHeartbeats.lean,scripts/lint-style.lean | 17 | 8 | ['github-actions', 'grunweg', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | grunweg | 3 months ago | unknown | 0 seconds |
| 31836 | hanwenzhu | chore(MeasureTheory/IntervalIntegral): generalize fundamental theorem of calculus to `HasDerivWithinAt` instead of `HasDerivAt` | This PR generalizes `HasDerivAt` to `HasDerivWithinAt`, and `DifferentiableAt` to `DifferentiableOn`, for the fundamental theorem of calculus for interval integrals. I found this during trying to state a skeleton of a proof of a higher-dimensional Taylor's theorem. There, the correct assumption is something like `ContDiffOn n f [[a, b]]`, rather than `∀ x ∈ [[a, b]], ContDiffAt 𝕜 n f [[a, b]] x`, which traces back to this issue. --- [](https://gitpod.io/from-referrer/) | t-analysis t-measure-probability awaiting-author merge-conflict | 143/51 | Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Order.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/IntegrationByParts.lean,Mathlib/NumberTheory/AbelSummation.lean,Mathlib/NumberTheory/LSeries/SumCoeff.lean | 7 | 10 | ['github-actions', 'hanwenzhu', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 3 months ago | 155 days ago | 6 days |
| 12879 | grunweg | feat: port ge_or_gt linter from mathlib3 | Code works and is essentially green: next step is to split up into separate PRs. Feedback welcome on whether: - all the test changes are good, or I should simply allow it in more cases - if calc blocks need to be explicitly exempt --- - [ ] depends on: #12933 - [ ] depends on: #12934 - [ ] depends on: #12931 [](https://gitpod.io/from-referrer/) | merge-conflict t-linter tech debt blocked-by-other-PR | 736/319 | Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2019Q4.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Star/CHSH.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/Normed/Group/ControlledClosure.lean,Mathlib/Analysis/NormedSpace/MStructure.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Computability/AkraBazzi/AkraBazzi.lean,Mathlib/Computability/AkraBazzi/GrowsPolynomially.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Int/Lemmas.lean,Mathlib/Data/Nat/Dist.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Nat/Upto.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/UInt.lean,Mathlib/GroupTheory/Coxeter/Length.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean,Mathlib/MeasureTheory/Integral/Layercake.lean,Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Rayleigh.lean,Mathlib/Order/Filter/AtTopBot.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/Adjoin/Basic.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CancelDenoms/Core.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/IntervalCases.lean,Mathlib/Tactic/Linarith/Datatypes.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter/GeOrGt.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/NormNum/GCD.lean,Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Topology/Category/Profinite/Nobeling.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/MetricSpace/Cauchy.lean,Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sequences.lean,scripts/lint-style.py,test/Explode.lean,test/GCongr/inequalities.lean,test/GeOrGt.lean,test/LibrarySearch/IsCompact.lean,test/LibrarySearch/basic.lean,test/Recall.lean,test/Rify.lean,test/Use.lean,test/cancel_denoms.lean,test/congr.lean,test/delabLinearIndependent.lean,test/delaborators.lean,test/interval_cases.lean,test/linarith.lean | 109 | 4 | ['github-actions', 'grunweg', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 3 months ago | 715 days ago | 4 hours |
| 29953 | slashbade | feat: add reap for experiment | --- [](https://gitpod.io/from-referrer/) | new-contributor | 40/3 | Cache/IO.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,lake-manifest.json,lakefile.lean | 5 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 33110 | dagurtomas | feat(CategoryTheory): adjoint functor theorems for presentable categories | --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory | 214/5 | Mathlib/CategoryTheory/Adjunction/AdjointFunctorTheorems.lean,Mathlib/CategoryTheory/Presentable/AdjointFunctorTheorems.lean | 2 | 2 | ['github-actions', 'joelriou'] | nobody | 3 months ago | 132 days ago | 5 seconds |
| 34361 | grunweg | chore: rename comp' to fun_comp a few more times; use to_fun to autog… | …enerate -------- - [ ] depends on: #34257 (then this PR can be done the proper way) --- [](https://gitpod.io/from-referrer/) | t-analysis blocked-by-other-PR | 24/40 | Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Calculus/DifferentialForm/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/VectorField.lean,Mathlib/Analysis/Meromorphic/Basic.lean | 5 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 3 months ago | 93 days ago | 3 days |
| 8608 | eric-wieser | feat: multiplicativize `AddTorsor` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra please-adopt | 268/199 | Mathlib/Algebra/AddTorsor.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Data/Set/Pointwise/SMul.lean,Mathlib/Tactic/ToAdditive.lean | 4 | 2 | ['alreadydone'] | nobody | 3 months ago | unknown | 0 seconds |
| 28017 | eric-wieser | feat: generalize some opnorm lemmas to seminormed spaces | --- - [ ] depends on: #28014 - [ ] depends on: #28101 - [ ] depends on: #29120 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 60/24 | Mathlib/Analysis/NormedSpace/OperatorNorm/NNNorm.lean,Mathlib/Analysis/NormedSpace/Real.lean | 2 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 268 days ago | 1 second |
| 31377 | CoolRmal | feat: a series of smooth functions that converges (locally) uniformly is smooth | The main theorem is the proof that an infinite sum of $C^n$ functions on a one-dimensional domain which converges locally uniformly is $C^n$ and related results. This should be compared with [contDiff_tsum](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Calculus/SmoothSeries.html#contDiff_tsum) where the same result is proved for functions on an arbitrary domain but with a slightly stronger convergence assumption. The main motivation for this PR is the [#mathlib4 > Tychonov's Counterexample for the Heat Equation](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Tychonov's.20Counterexample.20for.20the.20Heat.20Equation/with/547367912). --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor awaiting-author merge-conflict | 110/18 | Mathlib/Analysis/Calculus/SmoothSeries.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/QExpansion.lean,Mathlib/Topology/Algebra/InfiniteSum/TsumUniformlyOn.lean,Mathlib/Topology/Algebra/InfiniteSum/UniformOn.lean | 5 | 20 | ['CoolRmal', 'github-actions', 'mathlib4-merge-conflict-bot', 'ocfnash', 'sgouezel'] | ocfnash | 3 months ago | 154 days ago | 8 days |
| 32865 | robertmaxton42 | (WIP) Separation axioms | --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 4439/13 | Mathlib.lean,Mathlib/CategoryTheory/LiftingProperties/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/ConcreteCategory.lean,Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Disjoint.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Order/BooleanAlgebra/Set.lean,Mathlib/Topology/AlexandrovDiscrete.lean,Mathlib/Topology/Category/Lifting/Defs.lean,Mathlib/Topology/Category/Lifting/Separation.lean,Mathlib/Topology/Category/TopCat/Basic.lean,Mathlib/Topology/Category/TopCat/Limits/Basic.lean,Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean,Mathlib/Topology/Category/UProp.lean,Mathlib/Topology/Coherent.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousMap/Basic.lean,Mathlib/Topology/ContinuousMap/Constructions.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/Maps/Basic.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/UpperLowerSetTopology.lean,Mathlib/Topology/SeparatedMap.lean,Mathlib/Topology/Separation/GDelta.lean,Mathlib/Topology/Separation/Regular.lean,Mathlib/Topology/UnitInterval.lean,Mathlib/Topology/UrysohnsLemma.lean,docs/references.bib | 30 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 33031 | chiyunhsu | feat(Combinatorics/Enumerative/Partition): add combinatorial proof of Euler's partition theorem | The new file EulerComb.lean contains the combinatorial proof of Euler's partition theorem. The analytic proof of the theorem and its generalization of Glaisher's Theorem has already been formalized in [Glaisher.lean](https://github.com/leanprover-community/mathlib4/blob/master/Mathlib/Combinatorics/Enumerative/Partition/Glaisher.lean). The generalization of the combinatorial proof from this file to Glaisher's Theorem is within reach. --- Zulip discussion: [#mathlib4 > Glaisher’s Bijection on integer partitions](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Glaisher.E2.80.99s.20Bijection.20on.20integer.20partitions/with/570808111) [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-zulip | 531/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Partition/EulerComb.lean | 2 | 5 | ['chiyunhsu', 'github-actions', 'tb65536', 'vihdzp'] | b-mehta | 3 months ago | 92 days ago | 42 days |
| 27835 | edegeltje | feat(Tactic): ring modulo a given characteristic | This PR extends the `ring` tactic with a new config argument `char` which will try to reduce all constant terms modulo the given characteristic. This allows `ring` to prove e.g. `(x + y)^3 = x^3 + y^3` in characteristic 3. This is a simpler and faster way to do so than what we had before: `repeat { ring; reduce_mod_char }` becomes `ring (config := { char := 3 })`. The first step is to split off the required `CharP` definitions, since `Mathlib.Algebra.CharP.Basic` already requires the `ring` tactic. To perform the reduction modulo the given characteristic, I implemented `reduceCast` which reduces a raw integer, and wrapped it in `reduceResult` that takes a `NormNum.Result` for easy use. We need to pass through quite a few parameters into `reduceResult` so maybe it's worth defining a structure, or reusing `Cache` for this. Then it's basically a case of replacing every place where `ring` constructs a numeral with a call to `reduceResult`. Limitations: * `ring` doesn't attempt to detect the characteristic by itself, you need to pass it in explicitly. Trying to infer a `CharP` instance at each point sounds quite expensive. * Since the support for `%` in `NormNum` only exists for integers, I implemented the reduction only when a `Ring` instance is available. It is still sound in the semiring case, just not complete. * We could optimize exponentiation in the specific case where the characteristic `p` is a prime that divides the exponent `n`: `(x + y)^n = x^n + y^n`. I'll leave that to future work. --- This used to be #10765 by Anne Baanen before the great forkening. [](https://gitpod.io/from-referrer/) | merge-conflict large-import migrated-from-branch t-meta awaiting-author WIP | 312/133 | Mathlib/LinearAlgebra/Eigenspace/Basic.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean,Mathlib/Tactic/LinearCombination.lean,Mathlib/Tactic/Module.lean,Mathlib/Tactic/Polyrith.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Tactic/Ring/Compare.lean,Mathlib/Tactic/Ring/RingNF.lean,MathlibTest/ring_compare.lean,MathlibTest/ring_mod_char.lean | 10 | 14 | ['edegeltje', 'github-actions', 'joneugster', 'mathlib4-merge-conflict-bot'] | joneugster | 3 months ago | 260 days ago | 11 days |
| 33954 | or4nge19 | feat(CategoryTheory/Abelian): add Filtration API | Filtered objects in an abelian category (Deligne, *Théorie de Hodge II*, §1.1).
inspired by a [message](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Proposal.3A.20Complexifications.20with.20a.20view.20towards.20Hodge.20theory/near/565511365) by Joel Riou
Co-authored-by: Jonathan Washburn |
t-category-theory awaiting-author | 356/0 | Mathlib.lean,Mathlib/CategoryTheory/Filtration/Basic.lean,docs/references.bib | 3 | 12 | ['dagurtomas', 'github-actions', 'joelriou', 'or4nge19'] | nobody | 3 months ago | 92 days ago | 3 days |
| 34575 | urkud | feat(Integral/Pi): add more convenience API | --- It's some old code I want to revive&merge. I'll change it from draft when it's ready for review. [](https://gitpod.io/from-referrer/) | t-measure-probability | 406/1 | Mathlib/MeasureTheory/Integral/Pi.lean | 1 | 1 | ['github-actions'] | nobody | 3 months ago | 92 days ago | 22 seconds |
| 34279 | grunweg | chore: use `to_fun` more | We use the new functionality of `to_fun` from #34257 to remove a few more duplicate lemmas. --- - [ ] depends on: #34257 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 89/217 | Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Pow.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Pow.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean,Mathlib/Probability/Distributions/Gaussian/Fernique.lean,Mathlib/Tactic/ToFun.lean | 9 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 98 days ago | 7 minutes |
| 34130 | FlAmmmmING | feat(Combinatorics/SimpleGraph/Acyclic): Add new theorem `isTree_iff_uniqueShortest_path` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 28/1 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 9 | ['IvanRenison', 'github-actions', 'metakunt', 'vlad902'] | nobody | 3 months ago | 100 days ago | 2 days |
| 32872 | JovanGerb | feat(Data/Real/Basic): don't expose the definition of `Real` | This PR refactors the definition of `Real` using the module system, so that `Real` cannot be seen as a structure anymore. --- [](https://gitpod.io/from-referrer/) | t-data merge-conflict | 141/250 | Archive/Imo/Imo2013Q5.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Counterexamples/SeminormLatticeNotDistrib.lean,Counterexamples/TopologistsSineCurve.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean,Mathlib/Data/Real/Basic.lean,MathlibTest/Complex.lean,MathlibTest/Continuity.lean,MathlibTest/Quaternion.lean,MathlibTest/Real.lean | 10 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 132 days ago | 2 hours |
| 33505 | urkud | feat(Analysis/Complex): prove Riemann mapping theorem | I'll list dependencies later. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 1579/120 | Mathlib.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Calculus/FDeriv/OfCompLeft.lean,Mathlib/Analysis/Calculus/InverseFunctionTheorem/FDeriv.lean,Mathlib/Analysis/Complex/RiemannMapping.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/Complex/UnitDisc/Shift.lean,Mathlib/Analysis/Normed/Field/Lemmas.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Topology/Algebra/Group/CompactOpen.lean,Mathlib/Topology/Algebra/IsUniformGroup/Basic.lean,Mathlib/Topology/MetricSpace/Algebra.lean,Mathlib/Topology/UniformSpace/LocallyUniformConvergence.lean | 16 | 8 | ['SnirBroshi', 'github-actions', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 3 months ago | unknown | 0 seconds |
| 34096 | urkud | chore(EMetric/*): rename theorems | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 789/737 | Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Binomial.lean,Mathlib/Analysis/Analytic/CPolynomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/ConvergenceRadius.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/IteratedDeriv/ConvergenceOnBall.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/TaylorSeries.lean,Mathlib/Analysis/Convex/EGauge.lean,Mathlib/Analysis/InnerProductSpace/Projection/Minimal.lean,Mathlib/Analysis/Normed/Algebra/Exponential.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Bounded.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/Normed/Group/SeparationQuotient.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Module/Connected.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Operator/Completeness.lean,Mathlib/Analysis/Oscillation.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecificLimits/Normed.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean,Mathlib/Geometry/Manifold/Riemannian/Basic.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Metric.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Function/ContinuousMapDense.lean,Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean,Mathlib/MeasureTheory/Function/Egorov.lean,Mathlib/MeasureTheory/Function/LpSpace/Complete.lean,Mathlib/MeasureTheory/Function/SimpleFuncDense.lean,Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/OpenPos.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Topology/Algebra/MetricSpace/Lipschitz.lean,Mathlib/Topology/Baire/CompleteMetrizable.lean,Mathlib/Topology/ContinuousMap/Bounded/Basic.lean,Mathlib/Topology/EMetricSpace/Basic.lean,Mathlib/Topology/EMetricSpace/Defs.lean,Mathlib/Topology/EMetricSpace/Diam.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean,Mathlib/Topology/Instances/ENNReal/Lemmas.lean,Mathlib/Topology/MetricSpace/Basic.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/CantorScheme.lean,Mathlib/Topology/MetricSpace/Cauchy.lean,Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/MetricSpace/Contracting.lean,Mathlib/Topology/MetricSpace/Cover.lean,Mathlib/Topology/MetricSpace/Dilation.lean,Mathlib/Topology/MetricSpace/Gluing.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,Mathlib/Topology/MetricSpace/Holder.lean,Mathlib/Topology/MetricSpace/IsometricSMul.lean,Mathlib/Topology/MetricSpace/Isometry.lean,Mathlib/Topology/MetricSpace/PartitionOfUnity.lean,Mathlib/Topology/MetricSpace/Perfect.lean,Mathlib/Topology/MetricSpace/Polish.lean,Mathlib/Topology/MetricSpace/Pseudo/Basic.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean,Mathlib/Topology/MetricSpace/Snowflaking.lean,Mathlib/Topology/Metrizable/CompletelyMetrizable.lean,Mathlib/Topology/UniformSpace/Cauchy.lean,Mathlib/Topology/UniformSpace/Real.lean | 80 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | unknown | 0 seconds |
| 26087 | grunweg | feat: a `SliceModel` typeclass for models with corners for embedded submanifolds | We define a new typeclass to denote a model with corners which "embeds" into another one: there are an embedding of the underlying topological spaces and a continuous linear inclusion between the normed spaces, which are compatible with the maps given by the models with corners. This condition is used for defining smooth (immersed and embedded) submanifolds: for `M` to be a submanifold of `N`, to boot their models with corners should be slice models. This will be defined in a future PR. To prove this definition is workable, we construct many basic instances of slice models - each model with corners is one over itself - slice models are transitive - each model with corners I embeds into two products `I.prod J` and `J.prod I` - Euclidean n-half-space embeds into Euclidean n-space - a Euclidean n-quadrant embeds into Euclidean half-space (hence into Euclidean n-space) - if n\leq m, Euclidean n-space embeds into Euclidean m-space [zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Infinite-dimensional.20manifolds/near/413117885) ----------- - [x] depends on: #26083 - [x] depends on: #26082 - [x] depends on: #26086 - [x] depends on: #25705 This PR continues the work from #25505. | t-differential-geometry | 234/0 | Mathlib.lean,Mathlib/Geometry/Manifold/SliceModel.lean | 2 | 4 | ['github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 90 days ago | 3 hours |
| 16074 | Rida-Hamadani | feat: combinatorial maps and planar graphs | We define combinatorial maps, then we define planar graph using combinatorial maps. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics | 243/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Planar.lean,Mathlib/Data/CombinatorialMap.lean | 3 | 29 | ['MrBrain295', 'Parcly-Taxel', 'Rida-Hamadani', 'github-actions', 'lambda-fairy', 'leanprover-community-bot-assistant'] | kmill | 3 months ago | 300 days ago | 72 days |
| 31582 | ADedecker | chore: more flavours of derivatives within the empty set | --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-CI merge-conflict | 33/11 | Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/ConvergenceRadius.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Const.lean | 6 | 5 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | grunweg | 3 months ago | unknown | 0 seconds |
| 34257 | grunweg | feat(Tactic/ToFun): allow configuring the name of the generated declaration | This allows removing a few more duplicate lemmas. A few of these lemmas were misnamed (i.e., not using the `fun_` naming convention): we correct this. --- I'm also happy to split the follow-up golfs into a separate PR, if preferred. [](https://gitpod.io/from-referrer/) | t-meta awaiting-author merge-conflict | 31/53 | Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Pow.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Pow.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean,Mathlib/Probability/Distributions/Gaussian/Fernique.lean,Mathlib/Tactic/ToFun.lean | 8 | 12 | ['JovanGerb', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | JovanGerb | 3 months ago | 98 days ago | 14 hours |
| 32609 | PrParadoxy | feat(LinearAlgebra/PiTensorProduct): Relation between nested tensor products and tensor products indexed by dependent sums | Product tensors in `⨂ j : (Σ i, β i), s j.fst j.snd` can be mapped to product tensors in `⨂ i, ⨂ b : β i, s i b`. If the outer index type is finite, the two types are equivalent. This allows the definition of endomorphisms on PiTensorProducts by specifying them on disjoint subsets of the index set. Such constructions are common e.g. in quantum circuits, quantum cellular automata, and renormalization procedures. --- WIP. This PR contains two "requests for comments". Essentially: * Is a single complex-to-define linear equivalence preferable over several less complex ones, which might however be of limited interest by themselves? * Which trade-offs are appropriate to make things computable? - [ ] depends on: #32608 - [x] depends on: #32600 - [x] depends on: #32598 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR merge-conflict t-algebra | 683/0 | Mathlib.lean,Mathlib/Data/Sigma/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Nested.lean,Mathlib/LinearAlgebra/PiTensorProduct/Set.lean | 5 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 143 days ago | 33 minutes |
| 29000 | JovanGerb | feat(Tactic/Push): add basic tags and tests | This PR adds basic `@[push]` tags, and expands the `push` test file. --- - [ ] depends on: #21965 - [ ] depends on: #30038 - [ ] depends on: #30039 - [ ] depends on: #30042 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-meta | 290/196 | Archive/Imo/Imo1988Q6.lean,Archive/ZagierTwoSquares.lean,Counterexamples/Phillips.lean,Mathlib/Algebra/Group/Action/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/ListOfFn.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Notation/Pi/Defs.lean,Mathlib/Algebra/Order/Module/HahnEmbedding.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Oscillation.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean,Mathlib/CategoryTheory/Galois/Basic.lean,Mathlib/Combinatorics/Colex.lean,Mathlib/Combinatorics/Enumerative/InclusionExclusion.lean,Mathlib/Combinatorics/Hall/Finite.lean,Mathlib/Combinatorics/Matroid/Dual.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Data/Analysis/Filter.lean,Mathlib/Data/Finset/BooleanAlgebra.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finset/Empty.lean,Mathlib/Data/Finset/Filter.lean,Mathlib/Data/Finset/Insert.lean,Mathlib/Data/Finset/Lattice/Basic.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Finset/SDiff.lean,Mathlib/Data/Finset/Sups.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Nat/Cast/Basic.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/PrimeFin.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Data/Set/Prod.lean,Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/RootSystem/Base.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Order.lean,Mathlib/MeasureTheory/Constructions/Cylinders.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/MeasureTheory/SetAlgebra.lean,Mathlib/NumberTheory/AbelSummation.lean,Mathlib/NumberTheory/Divisors.lean,Mathlib/NumberTheory/ModularForms/DedekindEta.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/Interval/Finset/Defs.lean,Mathlib/Order/Interval/Set/Defs.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Order/PartialSups.lean,Mathlib/Order/SetNotation.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/Probability/Moments/ComplexMGF.lean,Mathlib/Probability/ProductMeasure.lean,Mathlib/RingTheory/HahnSeries/Summable.lean,Mathlib/RingTheory/Nilpotent/Defs.lean,Mathlib/Topology/Algebra/ProperAction/ProperlyDiscontinuous.lean,Mathlib/Topology/Bornology/BoundedOperation.lean,Mathlib/Topology/Bornology/Constructions.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Compactness/Lindelof.lean,Mathlib/Topology/Connected/Clopen.lean,Mathlib/Topology/ContinuousMap/BoundedCompactlySupported.lean,Mathlib/Topology/EMetricSpace/BoundedVariation.lean,Mathlib/Topology/GDelta/MetrizableSpace.lean,Mathlib/Topology/JacobsonSpace.lean,Mathlib/Topology/Order/Compact.lean,Mathlib/Topology/Order/HullKernel.lean,Mathlib/Topology/Perfect.lean,Mathlib/Topology/Sets/CompactOpenCovered.lean,MathlibTest/push.lean | 87 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 215 days ago | 6 hours |
| 29792 | robertmaxton42 | feat(RelCWComplex): a (relative, concrete) CW complex is the colimit of its skeleta | Adds: * `RelCWComplex.Subcomplex.isCoherentWith_cover`: a (relative) CW complex is coherent with any collection of subcomplexes that cover. * `RelCWComplex.descBySkeletonLT` and `descBySkeleton`: construct a continuous map from a complex by providing a family of compatible maps from each skeleton and the base. `CWComplex.descBySkeleton` skips the base. - [ ] depends on: #29788 - [ ] depends on: #29790 --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR large-import t-topology | 672/31 | Mathlib/Data/Set/Subset.lean,Mathlib/Data/Set/UnionLift.lean,Mathlib/Topology/CWComplex/Classical/Basic.lean,Mathlib/Topology/CWComplex/Classical/Finite.lean,Mathlib/Topology/CWComplex/Classical/Subcomplex.lean,Mathlib/Topology/Category/TopCat/Limits/Products.lean,Mathlib/Topology/Coherent.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/Constructions/SumProd.lean,Mathlib/Topology/ContinuousMap/Basic.lean | 10 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'scholzhannah'] | nobody | 3 months ago | 224 days ago | 22 minutes |
| 24100 | eric-wieser | feat: restore some explicit binders from Lean 3 | Part of #24099 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt t-topology t-algebra | 39/42 | Mathlib/Data/FinEnum.lean,Mathlib/FieldTheory/Galois/Profinite.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Compactness/CompactlyGeneratedSpace.lean,Mathlib/Topology/MetricSpace/IsometricSMul.lean,Mathlib/Topology/Metrizable/CompletelyMetrizable.lean,Mathlib/Topology/Metrizable/Uniformity.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/LowerUpperTopology.lean,Mathlib/Topology/UniformSpace/UniformEmbedding.lean | 10 | 3 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 3 months ago | 380 days ago | 16 minutes |
| 29411 | llllvvuu | feat(LinearAlgebra/Matrix/Rank): rank factorization | The rank factorization derived from `Module.finBasis`.
Co-authored-by: Aristotle Harmonic |
merge-conflict awaiting-author t-algebra | 20/0 | Mathlib/LinearAlgebra/Matrix/Rank.lean,Mathlib/LinearAlgebra/Matrix/ToLin.lean | 2 | 3 | ['github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot'] | jcommelin | 3 months ago | 189 days ago | 46 days |
| 30260 | imbrem | feat(CategoryTheory/Monoidal): added CocartesianMonoidalCategory | As discussed in #21603 and #28718; this implements chosen finite coproducts on top of `AddMonoidalCategory` as defined in #30150 --- - [ ] depends on: #30150 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR large-import new-contributor t-category-theory | 839/125 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Cocartesian/Basic.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 5 | 4 | ['github-actions', 'imbrem', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 207 days ago | 20 minutes |
| 30258 | imbrem | feat(CategoryTheory/Monoidal): to_additive for proofs using `monoidal` | Building on #30150, this allows us to use `@[to_additive]` on proofs containing `monoidal`, by tagging the lemmas `monoidal` outputs with `@[to_additive]` as appropriate. Testing on my branch [`additive-monoidal-coherence`](https://github.com/imbrem/mathlib4/tree/additive-monoidal-coherence) shows that this works. It is still future work to have either the `monoidal` tactic or a new `add_monoidal` tactic work for `AddMonoidalCategory` instances directly. --- - [ ] depends on: #30150 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR large-import new-contributor t-category-theory | 524/140 | Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,Mathlib/Tactic/ToAdditive/GuessName.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 207 days ago | 4 minutes |
| 29790 | robertmaxton42 | feat(IsCoherentWith) : families of maps from a coherent collection of subspaces lift uniquely to maps from the total space | * Adds `IsCoherentWith.liftCover`, which lifts a compatible family of continuous maps from each member of a coherent set of subspaces to a single continuous map on the whole space. * Adds `IsCoherentWith.liftCover'`, which does the same but for a set of coherent subspaces given as the range of a function into `Set X` rather than as an explicit `Set (Set X).` - [ ] depends on: #29788 --- [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import t-topology | 350/3 | Mathlib/Data/Set/Subset.lean,Mathlib/Data/Set/UnionLift.lean,Mathlib/Topology/Category/TopCat/Limits/Products.lean,Mathlib/Topology/Coherent.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/Constructions/SumProd.lean,Mathlib/Topology/ContinuousMap/Basic.lean | 7 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 224 days ago | 47 minutes |
| 32829 | Hagb | feat(Data/Finsupp/MonomialOrder): weaken `IsOrderedCancelAddMonoid` to `IsOrderedAddMonoid` | `IsOrderedCancelAddMonoid syn` (`.iocam`) can be obtained from `IsOrderedAddMonoid syn` and other fields. --- - [ ] depends on: #32828 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-order | 11/2 | Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Data/Finsupp/MonomialOrder.lean | 2 | 8 | ['Hagb', 'Vierkantor', 'github-actions', 'mathlib4-dependent-issues-bot', 'vihdzp'] | nobody | 3 months ago | 139 days ago | 2 minutes |
| 32742 | LTolDe | feat(MeasureTheory/Constructions/Polish/Basic): add class SuslinSpace | add new class `SuslinSpace` for a topological space that is an analytic set in itself This will be useful to prove the **Effros Theorem**, see [zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/558712441). --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-zulip t-measure-probability | 4/0 | Mathlib/MeasureTheory/Constructions/Polish/Basic.lean | 1 | 9 | ['ADedecker', 'LTolDe', 'dupuisf', 'github-actions', 'jcommelin'] | PatrickMassot | 3 months ago | 115 days ago | 11 days |
| 30920 | callesonne | feat(Category/Grpd): define the bicategory of groupoids | This is a migration of #25561 to a fork. --- - [x] depends on: #30132 [](https://gitpod.io/from-referrer/) | t-category-theory large-import merge-conflict | 133/46 | Mathlib/CategoryTheory/Bicategory/InducedBicategory.lean,Mathlib/CategoryTheory/Category/Grpd.lean,Mathlib/CategoryTheory/ConcreteCategory/Bundled.lean | 3 | 6 | ['Jlh18', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 150 days ago | 26 minutes |
| 30121 | idontgetoutmuch | feat(Mathlib/Geometry/Manifold): principal fiber bundle core | A structure capturing what it means to be a principal fibre bundle. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-differential-geometry new-contributor | 227/0 | Mathlib.lean,Mathlib/Geometry/Manifold/PrincipalFiberBundle/PrincipalGBundle.lean | 2 | 8 | ['github-actions', 'grunweg', 'idontgetoutmuch', 'mathlib4-merge-conflict-bot'] | hrmacbeth | 3 months ago | 186 days ago | 25 days |
| 27918 | kim-em | chore: refactor WithBot/WithTop as structures | For now we are still relying on `WithBot` and `WithTop` being defeq, but there is no impossible obstacle to converting them *both* to the same structure. This PR begins this effort; the modified files are all compiling, but there are more files that still have problems. Help on this (either ask to push to my branch, PR to my branch, or just adopt the whole thing!) very much appreciated. | file-removed merge-conflict WIP | 971/361 | Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Monoid/ToMulBot.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Degree/Operations.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean,Mathlib/Analysis/Meromorphic/Order.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Data/Countable/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Defs.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/Finset/WithBot.lean,Mathlib/Data/Fintype/WithTopBot.lean,Mathlib/Data/List/MinMax.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Ordmap/Invariants.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/Sum/Order.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/Logic/Embedding/WithBot.lean,Mathlib/Logic/Equiv/WithBot.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean,Mathlib/MeasureTheory/Group/Measure.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/Order/Category/BddLat.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Hom/WithTopBot.lean,Mathlib/Order/Interval/Basic.lean,Mathlib/Order/Interval/Finset/Defs.lean,Mathlib/Order/Interval/Set/WithBotTop.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/Set.lean,Mathlib/Order/SuccPred/Basic.lean,Mathlib/Order/TypeTags.lean,Mathlib/Order/WithBot/Basic.lean,Mathlib/Order/WithBot/BooleanAlgebra.lean,Mathlib/Order/WithBot/NAry.lean,Mathlib/RingTheory/OrderOfVanishing.lean,Mathlib/RingTheory/UniqueFactorizationDomain/FactorSet.lean,Mathlib/SetTheory/Cardinal/ENat.lean,Mathlib/Topology/Algebra/Ring/Real.lean,Mathlib/Topology/Category/LightProfinite/Sequence.lean,Mathlib/Topology/Compactification/OnePoint/Basic.lean,Mathlib/Topology/Instances/ENat.lean,MathlibTest/lift.lean | 56 | 18 | ['eric-wieser', 'github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 143 days ago | 7 hours |
| 29605 | alreadydone | experiment(Algebra): unbundle npow/zpow from Monoid/InvDivMonoid | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI WIP | 1527/1020 | Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/BigOperators/Ring/Multiset.lean,Mathlib/Algebra/Category/MonCat/ForgetCorepresentable.lean,Mathlib/Algebra/Divisibility/Basic.lean,Mathlib/Algebra/Divisibility/Units.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/Power.lean,Mathlib/Algebra/Field/Rat.lean,Mathlib/Algebra/Group/Action/Basic.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Group/Commute/Basic.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/Commute/Units.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Even.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Finsupp.lean,Mathlib/Algebra/Group/Hom/Basic.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Group/Hom/End.lean,Mathlib/Algebra/Group/Hom/Instances.lean,Mathlib/Algebra/Group/Idempotent.lean,Mathlib/Algebra/Group/InjSurj.lean,Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Irreducible/Lemmas.lean,Mathlib/Algebra/Group/Nat/Defs.lean,Mathlib/Algebra/Group/Nat/Hom.lean,Mathlib/Algebra/Group/NatPowAssoc.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/PUnit.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/Semiconj/Basic.lean,Mathlib/Algebra/Group/Semiconj/Defs.lean,Mathlib/Algebra/Group/Semiconj/Units.lean,Mathlib/Algebra/Group/Subgroup/Defs.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Group/Subgroup/ZPowers/Basic.lean,Mathlib/Algebra/Group/Submonoid/BigOperators.lean,Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Support.lean,Mathlib/Algebra/Group/Torsion.lean,Mathlib/Algebra/Group/TransferInstance.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/ULift.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/GroupWithZero/Commute.lean,Mathlib/Algebra/GroupWithZero/Conj.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Divisibility.lean,Mathlib/Algebra/GroupWithZero/Hom.lean,Mathlib/Algebra/GroupWithZero/Indicator.lean,Mathlib/Algebra/GroupWithZero/InjSurj.lean,Mathlib/Algebra/GroupWithZero/Semiconj.lean,Mathlib/Algebra/GroupWithZero/ULift.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/GroupWithZero/Units/Lemmas.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/NoZeroSMulDivisors/Defs.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/BigOperators/Group/List.lean,Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/List.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Multiset.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Action.lean,Mathlib/Algebra/Order/Group/Basic.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/Finset.lean,Mathlib/Algebra/Order/Group/Lattice.lean,Mathlib/Algebra/Order/Group/Multiset.lean,Mathlib/Algebra/Order/Group/PosPart.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean | 162 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 230 days ago | 2 seconds |
| 25474 | adomani | test for .lean/.md check | A test PR for #25473. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter file-removed WIP | 10/1 | .github/workflows/lint_and_suggest_pr.yml,Mathlib.lean,Mathlib/NumberTheory/NumberField/CMField.Lean | 3 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 3 months ago | 300 days ago | 29 days |
| 33991 | grunweg | test: pretty-printing of class abbrev | Lake build fails with an error in batteries: what am I doing wrong? --- [](https://gitpod.io/from-referrer/) | merge-conflict file-removed large-import WIP | 118/303 | .github/workflows/daily.yml,Mathlib.lean,Mathlib/Algebra/Group/Action/TransferInstance.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Algebra/Notation/Lemmas.lean,Mathlib/Algebra/Notation/Pi/Defs.lean,Mathlib/Algebra/Notation/Prod.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Group/Unbundled/Basic.lean,Mathlib/CategoryTheory/Limits/Yoneda.lean,Mathlib/Data/Finite/Defs.lean,Mathlib/Data/Int/Cast/Pi.lean,Mathlib/Data/Int/Init.lean,Mathlib/Data/List/Flatten.lean,Mathlib/Data/List/GetD.lean,Mathlib/Data/List/Indexes.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Init.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean,Mathlib/Lean/Meta/Simp.lean,Mathlib/Order/BoundedOrder/Basic.lean,Mathlib/Order/GaloisConnection/Defs.lean,Mathlib/Order/Monotone/Defs.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/SetTheory/Cardinal/Defs.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Tactic/Push/Attr.lean,Mathlib/Tactic/Widget/LibraryRewrite.lean,Mathlib/Topology/Defs/Basic.lean,Mathlib/Util/AssertExists.lean,MathlibTest/AssertExists.lean,MathlibTest/CalcQuestionMark.lean,MathlibTest/DeprecatedSyntaxLinter.lean,MathlibTest/DirectoryDependencyLinter/Test.lean,MathlibTest/EmptyLine.lean,MathlibTest/ExtractGoal.lean,MathlibTest/HaveLetLinter.lean,MathlibTest/LibrarySearch/IsCompact.lean,MathlibTest/LintStyle.lean,MathlibTest/TacticAnalysis.lean,MathlibTest/UnusedInstancesInType.lean,MathlibTest/Util/PrintSorries.lean,MathlibTest/WhitespaceLinter.lean,MathlibTest/aesop_cat.lean,MathlibTest/eqns.lean,MathlibTest/fast_instance.lean,MathlibTest/globalAttributeIn.lean,MathlibTest/hintAll.lean,MathlibTest/jacobiSym.lean,MathlibTest/slim_check.lean,MathlibTest/toAdditive.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 61 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 106 days ago | 1 minute |
| 31110 | bryangingechen | ci: don't delete merged branches | This will only affect PRs that are not from forks (e.g. this one). The motivation is that #30913 was closed automatically due to its target branch deleted after #30912 was merged. See also [#PR reviews > #30913 feat(Computability/Language):add subtraction notation @ 💬](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2330913.20feat.28Computability.2FLanguage.29.3Aadd.20subtraction.20notation/near/548052556). Looking at the history, it looks like this option hasn't been changed since we added bors to mathlib3: https://github.com/leanprover-community/mathlib3/pull/2322 --- [](https://gitpod.io/from-referrer/) | awaiting-author CI merge-conflict | 1/1 | bors.toml | 1 | 5 | ['bryangingechen', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 3 months ago | 182 days ago | 17 hours |
| 31102 | JOSHCLUNE | feat: require LeanHammer | Experimenting with adding LeanHammer as a mathlib dependency --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor t-meta | 61/4 | Mathlib/Tactic/Common.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,MathlibTest/Hammer.lean,lake-manifest.json,lakefile.lean | 5 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 164 days ago | 2 minutes |
| 34473 | JovanGerb | feat: remove `Membership` instance for `SetLike` | This PR is an attempt to change the underlying expression of `x ∈ s` when `s` is not a `Set α`, but a `SetLike`, such as `Finset α` or `Subgroup α`. Instead of having a `Membership` instance, we use the membership instance on `Set α`, combined with the coercion to `Set α`. This has various benefits - There is now only one form instead of two to say the same thing. This saves us a lot of rewrites that will now become syntactic equalities. - It is not needed anymore to create a `mem_` lemma for every single `coe_` lemma in order to maintain simp confluence Unfortunately, doing this refactor is going to be a very big task, simply because so many proofs break as a result of `simp` now trying to simplify away the coercion where there was no coercion before. --- [](https://gitpod.io/from-referrer/) | t-set-theory merge-conflict | 136/96 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Group/Pointwise/Set/BigOperators.lean,Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Group/Subsemigroup/Defs.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/Order/BigOperators/Group/Finset.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finset/Erase.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Insert.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/Finset/NAry.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Finset/Preimage.lean,Mathlib/Data/Finset/Prod.lean,Mathlib/Data/Finset/Sigma.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Fintype/EquivFin.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/LinearAlgebra/Span/Basic.lean,Mathlib/LinearAlgebra/Span/Defs.lean,Mathlib/Logic/Embedding/Basic.lean,Mathlib/Order/Closure.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Finset.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/Interval/Finset/Defs.lean,MathlibTest/set_like.lean | 40 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 94 days ago | 13 minutes |
| 30620 | plp127 | feat: copy LE and LT on preorder and partial order | Adds `Preorder.copy` and `PartialOrder.copy` for replacing the le and lt with provably equal ones. --- [](https://gitpod.io/from-referrer/) | t-order awaiting-author | 22/0 | Mathlib/Order/Defs/PartialOrder.lean | 1 | 7 | ['Vierkantor', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127'] | Vierkantor | 2 months ago | 157 days ago | 19 days |
| 34000 | grunweg | chore: golf using fun_prop [foo] syntax | --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 14/8 | Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/SpecialFunctions/BinaryEntropy.lean,Mathlib/Analysis/SpecialFunctions/Exp.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/InformationTheory/KullbackLeibler/KLFun.lean,MathlibTest/fun_prop_dev.lean | 6 | 6 | ['Vierkantor', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 106 days ago | 1 second |
| 34291 | YellPika | feat(Data): a monad for partial computations | This is the code corresponding to [mathlib4 > A monad for partial computations](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/A.20monad.20for.20partial.20computations/with/569619800). Not currently intended to be merged. This PR depends on #33941. The only changes relevant to this discussion are in `OmegaPart.lean`, `OmegaProp.lean`, and `Quot.lean`. # Original Message Inspired by @**Aaron Liu**'s comments in #**mathlib4>deprecate Mathlib.Data.Nat.PartENat?@538009243** and #**Is there code for X?>Divergence monad@538020049** I made an attempt at constructing a monad for partial computations with a computable `OmegaCompletePartialOrder` instance (neither `Option` nor `Part` support this use case). My solution consists of three parts. **A computable version of `Quotient.choice`.** As mentioned in #**lean4>Quot.lift for dependent products@467436416** , the "obvious" computational interpretation of `Quotient.choice : (∀i:I, @Quotient (A i) …) → @Quotient (∀i:I, A i)` is not sound. However, we _can_ provide a sound computational interpretation when we restrict `I` to `ℕ`: ```lean unsafe def Quotient.countableChoice_impl {α : Nat → Type*} {S : ∀ i, Setoid (α i)} (f : ∀ i, Quotient (S i)) : @Quotient (∀ i, α i) (by infer_instance) := Quotient.lift₂ (fun z s ↦ ⟦fun | .zero => z | .succ n => s n⟧) (fun z₁ s₁ z₂ s₂ h₁ h₂ ↦ by apply sound rintro ⟨_|n⟩ · apply h₁ · apply h₂) (f 0) (countableChoice_impl (fun n ↦ f n.succ)) @[implemented_by Quotient.countableChoice_impl] def Quotient.countableChoice {α : Nat → Type*} {S : ∀ i, Setoid (α i)} (f : ∀ i, Quotient (S i)) : @Quotient (∀ i, α i) (by infer_instance) := Quotient.choice f ``` My justification for the soundness of this implementation comes from the fact that only uses existing (sound and computable) functions + general recursion. The implementation is found [here](https://github.com/YellPika/mathlib4/blob/99d38f164a97c7aa225283ef6016f0279419a994/Mathlib/Data/Quot.lean#L430) (it uses `unquot` instead of recursion for performance reasons, but should be equivalent). **A type of semi-computable propositions.** Next, I define a type of semi-computable propositions `ΩProp` as a quotient of the type of boolean sequences `(ℕ → Bool) / ≈`, where `p ≈ q ≝ (∃n, p n) ↔ (∃n, q n)`. A sequence is interpreted as "true" if at least one element in the sequence is `true`, and the quotient relation ensures that we cannot observe the difference between different "true" sequences. The `ΩProp` type has a (computable) `OmegaCompletePartialOrder`, and `Quotient.countableChoice` is used in the implementation of `ωSup`. The implementation of this type is [here](https://github.com/YellPika/mathlib4/blob/quot-choice-compute/Mathlib/Data/OmegaProp.lean). **A type of semi-computable computations.** Finally, I define the type `ΩPart A` of semi-computable computations returning a value of type `A`. The definition of `ΩPart` is the same as `Part` with `ΩProp` swapped for `Prop`. Again, `ΩPart A` has a (computable) `OmegaCompletePartialOrder` instance. The implementation can be found [here](https://github.com/YellPika/mathlib4/blob/quot-choice-compute/Mathlib/Data/OmegaPart.lean). This was mainly just a fun experiment and the code is not ready to be (or perhaps should not be) put in mathlib. I thought I should post it here to see if 1) there is any interest or 2) an implementation already exists that has escaped my notice. | new-contributor large-import merge-conflict | 1157/40 | Mathlib/Data/OmegaPart.lean,Mathlib/Data/OmegaProp.lean,Mathlib/Data/Quot.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/ScottContinuity.lean | 5 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | unknown | 0 seconds |
| 34202 | or4nge19 | feat(Topology/MetricSpace): annuli in (pseudo)(e)metric spaces | From the Carleson project.
Co-authored-by: James Sundstrom |
carleson t-topology awaiting-author | 288/0 | Mathlib.lean,Mathlib/Topology/MetricSpace/Annulus.lean | 2 | 23 | ['MichaelStollBayreuth', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'or4nge19'] | nobody | 2 months ago | 86 days ago | 10 days |
| 34053 | christian-oudard | feat: Add error function (erf) and complementary error function (erfc) | ## Summary I was doing some finance math and needed the Error Function, so I thought I'd contribute it. ### Main definitions * `Real.erf`: The error function, defined as `(2/√π) ∫₀ˣ e^(-t²) dt` * `Real.erfc`: The complementary error function, defined as `1 - erf x` ### Main results * `Real.erf_zero`: `erf 0 = 0` * `Real.erf_neg`: `erf` is an odd function: `erf (-x) = -erf x` * `Real.erf_tendsto_one`: `erf x → 1` as `x → ∞` * `Real.erf_tendsto_neg_one`: `erf x → -1` as `x → -∞` * `Real.erf_le_one`: `erf x ≤ 1` for all `x` * `Real.neg_one_le_erf`: `-1 ≤ erf x` for all `x` * `Real.deriv_erf`: `deriv erf x = (2/√π) * exp(-x²)` * `Real.differentiable_erf`: `erf` is differentiable * `Real.continuous_erf`: `erf` is continuous * `Real.strictMono_erf`: `erf` is strictly monotone Also adds `erf` to `docs/overview.yaml` under Special Functions. --- - [x] Builds successfully - [x] `lake exe runLinter` passes - [x] `lake exe mk_all --check` passes | t-analysis new-contributor awaiting-author | 333/0 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Erf.lean,docs/overview.yaml | 3 | 18 | ['SnirBroshi', 'christian-oudard', 'github-actions', 'j-loreaux', 'plp127'] | j-loreaux | 2 months ago | 87 days ago | 14 days |
| 33601 | nielstron | feat(Computability/ContextFreeGrammar): Concatenation of CFGs is CFG | --- - [ ] depends on: #33599 - [ ] depends on: #33592 [](https://gitpod.io/from-referrer/) | t-computability new-contributor blocked-by-other-PR | 941/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 2 months ago | 116 days ago | 6 minutes |
| 33080 | sinhp | feat(Category Theory): Cartesian Natural Transformation | This PR defines cartesian natural transformations between functors and proves they are closed under horizontal and vertical composition. Also we prove the following results:
- `NatTrans.isCartesian_of_discrete` shows that any natural transformation between functors from a
discrete category is cartesian.
- `NatTrans.isCartesian_of_isIso` shows that any natural isomorphism is cartesian.
- `NatTrans.isIso_of_isCartesian_of_isIso_app_terminal` shows that a cartesian natural
transformation is an isomorphism if its component at a terminal object is an isomorphism.
- `NatTrans.isCartesian_of_isPullback_isTerminal_from` shows that a natural transformation is
cartesian if all its naturality squares to the terminal object are pullback squares.
This material is adapted from the polynomial functors project developed during the
Trimester "Prospects of Formal Mathematics" at the Hausdorff Institute (HIM) in Bonn:
https://github.com/sinhp/Poly
Co-authored-by: Wojciech Nawrocki |
t-category-theory awaiting-author | 145/0 | Mathlib.lean,Mathlib/CategoryTheory/NatTransCartesian.lean | 2 | 8 | ['dagurtomas', 'github-actions', 'joelriou', 'robin-carlier', 'sinhp'] | nobody | 2 months ago | 121 days ago | 3 days |
| 34397 | Parcly-Taxel | feat: integral representation of the AGM | --- - [x] depends on: #32892 | t-analysis awaiting-author | 294/0 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Integrals/ArithmeticGeometricMean.lean | 2 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot', 'sgouezel'] | sgouezel | 2 months ago | 85 days ago | 7 days |
| 34018 | CoolRmal | feat: series representation of cosecant | This PR adds 1. Some trignometric identities. 2. `tprod_pnat_odd_mul_even`, which is an invariant of [tprod_even_mul_odd](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Algebra/InfiniteSum/NatInt.html#tprod_even_mul_odd) 3. a series representation of `fun z => π / sin (π * z)`. An outline of the proof can be found in the PNT project: https://alexkontorovich.github.io/PrimeNumberTheoremAnd/blueprint/zeta-chapter.html#lem:abadeuleulmit1 --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 140/0 | Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Complex.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean,Mathlib/Topology/Algebra/InfiniteSum/NatInt.lean | 4 | 12 | ['CBirkbeck', 'CoolRmal', 'erdOne', 'github-actions', 'loefflerd'] | kex-y | 2 months ago | 85 days ago | 20 days |
| 34726 | GrigorenkoPV | feat(Analysis/SpecialFunctions/Trigonometric/Basic): sin and cos of multiples of π / 3 | --- Merge of https://github.com/leanprover-community/mathlib4/pull/26349 [](https://gitpod.io/from-referrer/) | new-contributor | 159/0 | Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Data/Nat/Cast/Defs.lean,MathlibTest/trigonometry.lean | 4 | 1 | ['github-actions'] | nobody | 2 months ago | 88 days ago | 47 minutes |
| 29788 | robertmaxton42 | feat(Topology): adds bundled continuous maps for sum, sigma, subtype, mapsto, inclusion | Adds a collection of bundled continuous maps and homeomorphisms, and helper lemmas for working with their compositions. Bundling of existing continuity lemmas: * `ContinuousMap.subtypeVal` * `ContinuousMap.inl` and `.inr`; `ContinuousMap.sum` bundles `Continuous.sumElim`; `ContinuousMap.sumMap`, which is a quotient map when both components are quotient maps * `ContinuousMap.sigmaMap`, which is a quotient map when given a family of quotient maps * `ContinuousMap.mapsTo` bundles `ContinuousOn.restrict_mapsTo` New functions: * `ContinuousMap.preimageValIncl : C(s ↓∩ t, t)` and `.inclPreimageVal C(s, t ↓∩ s)`, and their unbundled functions in `Set` * `Homeomorph.Set.preimageVal` witnesses that the two are opposite directions of a homeomorphism * Descending from a coherent set of subspaces is a quotient map The primary use for these bundled maps is easy composition and the ability to introduce them by rewriting right-to-left: it is much more convenient to write `subtypeVal.comp _` than to use either the anonymous constructor (which doesn't work in any position without an expected type) or `ContinuousMap.mk` (which will disappear as soon as it is coerced to a function, making it difficult to use in mixed-categorical contexts where many maps can only be reduced by introducing a composition with some other map.) This PR is part of a family of PRs that ultimately construct transformations in both directions between the concrete `Topology.RelCWComplex` and abstract `TopCat.RelativeCWComplex`. `.mapsTo` in particular bundles together a couple of potentially nontrivial proofs in a way that makes them easy to refer to later; I use it and `.subtypeVal` particularly heavily later in a dependent PR to build the cell inclusion maps on both sides of the equivalence. --- [](https://gitpod.io/from-referrer/) | large-import t-topology awaiting-author | 227/2 | Mathlib/Data/Set/Subset.lean,Mathlib/Topology/Category/TopCat/Limits/Products.lean,Mathlib/Topology/Coherent.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/Constructions/SumProd.lean,Mathlib/Topology/ContinuousMap/Basic.lean,scripts/noshake.json | 7 | 17 | ['adamtopaz', 'dagurtomas', 'github-actions', 'mathlib4-merge-conflict-bot', 'robertmaxton42'] | adamtopaz | 2 months ago | 85 days ago | 85 days |
| 34908 | CoolRmal | feat(GroupTheory): a characteristic subgroup of a characteristic subgroup is characteristic | The main theorem proved in this PR is `characteristic_of_characteristic_of_characteristic`. If says that if `K` is a characteristic subgroup of a characteristic subgroup `H` of `G`, then `K` is a characteristic subgroup of `G`. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-group-theory | 23/0 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Map.lean | 2 | 3 | ['CoolRmal', 'github-actions'] | nobody | 2 months ago | 84 days ago | 36 seconds |
| 34394 | Citronhat | feat(Algebra/Order/Ring): add constructors for linear ordered rings | Add constructors for ordered rings from `mul_nonneg` / `mul_pos` that derive `ZeroLEOneClass` from a linear order. | new-contributor t-algebra awaiting-author | 31/14 | Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/RingTheory/HahnSeries/Lex.lean | 2 | 6 | ['Citronhat', 'Vierkantor', 'github-actions', 'leanprover-radar'] | Vierkantor | 2 months ago | 84 days ago | 12 days |
| 26884 | alreadydone | Universal cover | TODO: construct locally constant predicate from a functor from the fundamental groupoid of a loc path connected, semilocally simply connected space to Type, and the associated covering space (as an etale space) --- - [x] depends on: #24983 - [x] depends on: #22771 - [ ] depends on: #31925 [](https://gitpod.io/from-referrer/) | WIP t-topology blocked-by-other-PR merge-conflict | 900/165 | Mathlib.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/StructureSheaf.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Geometry/Manifold/Sheaf/Smooth.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Topology/EtaleSpace.lean,Mathlib/Topology/IsLocalHomeomorph.lean,Mathlib/Topology/Sheaves/LocalPredicate.lean,Mathlib/Topology/Sheaves/Sheafify.lean,Mathlib/Topology/Sheaves/Stalks.lean | 11 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 2 months ago | unknown | 0 seconds |
| 31925 | alreadydone | feat(Topology): étalé space associated to a predicate on sections | Zulip: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2322782.20Etale.20space/near/527381645 --- - [ ] depends on: #33795 migrated from #22782 [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR merge-conflict | 900/165 | Mathlib.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/StructureSheaf.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Geometry/Manifold/Sheaf/Smooth.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Topology/EtaleSpace.lean,Mathlib/Topology/IsLocalHomeomorph.lean,Mathlib/Topology/Sheaves/LocalPredicate.lean,Mathlib/Topology/Sheaves/Sheafify.lean,Mathlib/Topology/Sheaves/Stalks.lean | 11 | 16 | ['adamtopaz', 'alreadydone', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | adamtopaz | 2 months ago | 112 days ago | 26 days |
| 34088 | kbuzzard | perf(RingTheory/Kaehler/Polynomial): change universe name for speed-up | Changing the choice of `R`'s universe to `v` from `u` in this file means that alphabetically it's after `u_1` which is a workaround for the issue described here https://github.com/leanprover/lean4/issues/12102 . The bottom line is that Lean's defeq algorithm is now able to typecheck the `left_inv` and `right_inv` proofs in `KaehlerDifferential.mvPolynomialEquiv` over 200 times more quickly (for example `right_inv` goes from 54494621 heartbeats to 222096, i.e. from about 5 seconds to about 0.02 seconds on a typical machine). --- [](https://gitpod.io/from-referrer/) Before this PR, Lean was spending far too long in the proof fields of `KaehlerDifferential.mvPolynomialEquiv`, checking defeq on the following kinds of terms (with `pp.all` on): ``` [isDefEq] [815425.000000] ✅️ @Module.{max u u_1, max u_1 u} (@MvPolynomial.{u_1, u} σ R (@CommRing.toCommSemiring.{u} R inst✝)) (@KaehlerDifferential.{u, max u_1 u} R [20 lines omitted] =?= @Module.{max u u_1, max u u_1} (@MvPolynomial.{u_1, u} σ R (@CommRing.toCommSemiring.{u} R inst✝)) (@KaehlerDifferential.{u, max u u_1} R [pretty much the same 20 lines omitted except with max u_1 u replaced by max u u_1 sometimes] ``` with the crucial difference that the second universes in the terms are `max u_1 u` for the first and `max u u_1` for the second. The proofs were taking a few seconds to compile, and then after compilation the kernel was also taking a few seconds to typecheck them. The alphabetical hack in this PR stops this happening and Lean's defeq algorithm now terminates essentially instantly on these terms. Zulip thread: [#mathlib4 > KaehlerDifferential.mvPolynomialEquiv typechecking @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/KaehlerDifferential.2EmvPolynomialEquiv.20typechecking/near/568614162) | t-ring-theory WIP | 5/1 | Mathlib/RingTheory/Kaehler/Polynomial.lean | 1 | 41 | ['Vierkantor', 'erdOne', 'github-actions', 'j-loreaux', 'kbuzzard', 'leanprover-radar', 'mattrobball'] | chrisflav | 2 months ago | 83 days ago | 8 days |
| 33493 | michelsol | feat(RingTheory/Polynomial): An explicit formula for the Chebyshev polynomials of the first kind | Adds the following explicit formula on the Chebyshev polynomial of the first kind of order n. ${ T_{n}(x)\ =\ \sum \limits _{k=0}^{\lfloor {\frac {n}{2}}\rfloor } {\binom {n}{2k}} \left(\ X^{2}-1\ \right)^{k}\ X^{n-2k}}$ This explicit formula can be found [here](https://en.wikipedia.org/wiki/Chebyshev_polynomials#Explicit_expressions). There is a proof using complex numbers but it only works if the ring R = ℂ. The proof here is by induction and works in a commutative ring R. Mathlib seems to extend the definition of Chebyshev polynomials for $n \in \mathbb{Z}$ but this would make the formula more cumbersome with `n.natAbs` in place of `n`'s, so I expressed it on `n : ℕ` directly. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 51/1 | Mathlib/RingTheory/Polynomial/Chebyshev.lean | 1 | 8 | ['YuvalFilmus', 'erdOne', 'github-actions', 'metakunt', 'michelsol'] | chrisflav | 2 months ago | 82 days ago | 35 days |
| 28468 | alreadydone | feat(Algebra): ring API for `AddLocalization` | Extract `Submonoid.IsLocalizationMap` from `LocalizationMap` and use it in `IsLocalization`. Develop basic API for AddLocalization at a two-sided ideal; in the case of the top AddSubmonoid, show the localization has a Ring structure (Grothendieck ring). Show that a nontrivial commutative semiring with cancellative addition satisfies the strong rank condition. (This will eventually be replaced by Yi-Jia Tan's result which shows cancellative addition is unnecessary, so it's also reasonable to leave this part out of this PR.) --- - [x] depends on: #27842 - [x] depends on: #27862 - [x] depends on: #29596 - [x] depends on: #29597 [](https://gitpod.io/from-referrer/) | t-algebra large-import t-ring-theory awaiting-author | 676/6 | Mathlib.lean,Mathlib/GroupTheory/MonoidLocalization/Archimedean.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/Lemmas.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Localization/Additive.lean,Mathlib/RingTheory/Localization/Defs.lean,Mathlib/RingTheory/Localization/StrongRankCondition.lean | 8 | 12 | ['alreadydone', 'chrisflav', 'erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | chrisflav | 2 months ago | 82 days ago | 23 days |
| 9820 | jjaassoonn | feat(RingTheory/GradedAlgebra/HomogeneousIdeal): generalize to homogeneous submodule | The definitions, constructions and theorems in `HomogeneousIdeal.lean` are generalized to a homogeneous submodules. So say $R$ is a ring and $M \cong \bigoplus_{i} M_i$ is an $R$-module. Then a homogeneous $R$-submodule of $M$ is an $R$-submodule $N$ such that for all $i$ and $n \in N$, $n_i \in N$. Note that this notion doesn't actually require $R$ to be graded and $M$ is a graded module. But for more interesting lemmas, we do need that $M$ is graded $R$-module. We bake the fact $R$ is graded into the definition of homogeneous submodule, otherwise, `CompleteLattice HomogeneousSubmodule` cannot find the order of synthesis (the proof depends on that $R$ is graded) All definitions/constructions/theorems have a copy for ideals as well, this is to make sure dot notation still works. The motivation of this generalization is graded quotient module --- - [x] depends on:#18728 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 516/185 | Mathlib/Algebra/Module/GradedModule.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,scripts/nolints_prime_decls.txt | 7 | 3 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 2 months ago | 300 days ago | 52 days |
| 27664 | pechersky | feat(Topology,Analysis): discrete topology metric space and normed groups | Explicit construction of the discrete topology metric space and normed groups where `dist x y = 1` for all `x != y` Provide PseudoMetricSpace, MetricSpace, Seminormed(Add)Group, and Normed(Add)Group constructions --- [](https://gitpod.io/from-referrer/) | awaiting-author t-topology merge-conflict | 124/0 | Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Topology/MetricSpace/Basic.lean,Mathlib/Topology/MetricSpace/Pseudo/Constructions.lean | 3 | 14 | ['github-actions', 'kckennylau', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'pechersky', 'plp127'] | urkud | 2 months ago | 161 days ago | 113 days |
| 34720 | Paul-Lez | feat(RingTheory/PowerSeries/Composition): define composition of power series | This PR defines the composition of two power series, and adds various pieces of API lemmas (this is mostly fixing up and upstreaming code from [this repo](https://github.com/rmhi/formal_deriv)).
This is the first of a series of PRs upstreaming work that was done at the CFT workshop in Oxford last summer, working towards proving some results about the `exp` and `log` power series (and their composition!), and constructing the isomorphism $(\mathfrak{m}_K ^ n, +) \cong (1 + \mathfrak{m}_K ^ n, \times)$ for sufficiently large $n$, where $K$ is a characteristic zero local field.
Co-authored-by: Richard Hill |
t-ring-theory awaiting-zulip | 844/0 | Mathlib.lean,Mathlib/RingTheory/PowerSeries/Composition.lean | 2 | 3 | ['Paul-Lez', 'github-actions', 'vihdzp'] | nobody | 2 months ago | 88 days ago | 10 seconds |
| 14501 | jjaassoonn | feat: module structure of filtered colimit of abelian groups over filtered colimit of rings | This helps defining the module structure of stalks This contribution was inspired by the AIM workshop "Formalizing algebraic geometry" in June 2024. --- - [x] depends on: #15315 [I am going to move the result in the new file] [](https://gitpod.io/from-referrer/) | t-algebra workshop-AIM-AG-2024 t-category-theory merge-conflict awaiting-author | 439/2 | Mathlib/CategoryTheory/Limits/ConcreteCategory/Basic.lean,Mathlib/CategoryTheory/Limits/ConcreteCategory/WithAlgebraicStructures.lean | 2 | 49 | ['YaelDillies', 'adamtopaz', 'alreadydone', 'erdOne', 'github-actions', 'jjaassoonn', 'joelriou', 'kbuzzard'] | joelriou | 2 months ago | 521 days ago | 64 days |
| 26986 | WangYiran01 | feat(Partition): add bijection for partitions with max part ≤ r | This PR adds a new theorem `partition_max_equals_bound` to `Mathlib.Combinatorics.Enumerative.Partition`. It constructs a bijection between: - The set of partitions of `n` in which `r ∈ π.parts` and all parts are `≤ r`, and - The set of partitions of `n - r` whose largest part is at most `r`. This provides a constructive proof via removing/adding `r` from/to the partition multiset, in line with classical enumerative combinatorics. Contributed by Yiran Wang. | awaiting-author t-combinatorics new-contributor merge-conflict | 92/0 | Mathlib/Combinatorics/Enumerative/Partition/Basic.lean,Mathlib/Data/Multiset/Lattice.lean | 2 | 20 | ['WangYiran01', 'github-actions', 'jcommelin', 'kckennylau', 'kim-em', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | b-mehta | 2 months ago | 113 days ago | 120 days |
| 25035 | ScottCarnahan | feat(Algebra/Module/Equiv/Defs): linear equivalence between linear hom and semilinear hom | Given a ring homomorphism `σ₂ : R →+* R₂`, an `R`-module `M`, and a module `M₂` for both `R` and `R₂` satisfying `SMulCommClass R R₂ M₂` and `(σ₂ r) • x = r • x`, we produce an `R₂`-linear equivalence between `M →ₗ[R] M₂` and `M →ₛₗ[σ₂] M₂`. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra merge-conflict | 21/0 | Mathlib/Algebra/Module/Equiv/Defs.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 326 days ago | 20 days |
| 26168 | oliver-butterley | feat(MeasureTheory.VectorMeasure): variation defined as a supremum is equal to variation defined using the Hahn-Jordan decomposition | Add `signedMeasure_totalVariation_eq`: if `μ` is a `SignedMeasure` then variation defined as a supremum is equal to variation defined using the Hahn-Jordan decomposition. Co-authored-by: @yoh-tanimoto - [ ] depends on: #26165 --- [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-measure-probability merge-conflict | 916/0 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Integral.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Equiv.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Lemmas.lean | 5 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 300 days ago | 15 days |
| 35114 | CoolRmal | feat: Kirszbraun’s theorem | --- [](https://gitpod.io/from-referrer/) | t-analysis | 144/0 | Mathlib/Analysis/Kirszbraun.lean | 1 | 1 | ['github-actions'] | nobody | 2 months ago | unknown | 0 seconds |
| 27702 | FLDutchmann | feat(NumberTheory/SelbergSieve): define Lambda-squared sieves and prove important properties | This PR continues the work from #22052. Original PR: https://github.com/leanprover-community/mathlib4/pull/22052 - [x] depends on: #27820 | t-number-theory delegated merge-conflict | 186/7 | Mathlib/NumberTheory/SelbergSieve.lean | 1 | 44 | ['FLDutchmann', 'MichaelStollBayreuth', 'bryangingechen', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | MichaelStollBayreuth | 2 months ago | 141 days ago | 15 days |
| 28693 | faenuccio | feat(Analysis.Normed.Module.Milman-Pettis): add Milman-Pettis theorem | We add the Milman-Pettis theorem stating that an uniformly convex Banach space is reflexive. --- [](https://gitpod.io/from-referrer/) | WIP t-analysis merge-conflict | 279/0 | Mathlib/Analysis/Convex/Uniform.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/Normed/Module/Milman-Pettis.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean | 4 | 9 | ['ADedecker', 'faenuccio', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'yhx-12243'] | nobody | 2 months ago | 254 days ago | 1 second |
| 29499 | chrisflav | feat(CategoryTheory/Sites): sheafification via hypercovers | This is very much WIP, but I need a fresh cache. --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory merge-conflict | 1944/4 | Mathlib.lean,Mathlib/CategoryTheory/Sites/HomotopyOneHypercover.lean,Mathlib/CategoryTheory/Sites/Hypercover/Homotopy.lean,Mathlib/CategoryTheory/Sites/Hypercover/One.lean,Mathlib/CategoryTheory/Sites/Hypercover/Refinement.lean,Mathlib/CategoryTheory/Sites/Hypercover/Sheafification.lean,Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean | 7 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | unknown | 0 seconds |
| 33969 | goliath-klein | refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): Currently, injectiveSeminorm = projectiveSeminorm | **WIP / RFC!** Arguably, `injectiveSeminorm` should be re-defined in Mathlib. See #34137 and [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798261) for context. In this file, we collect some results about the current definition and a possible alternative. Contents: * A theorem `injectiveSeminorm_eq_projectiveSeminorm` formalizing the equality of the current definitions. However, I think it is unlikely that keeping the alternative characterization would be worth the effort. The interesting direction `(L2') ≤ (L1)` follows from `norm_eval_le_projectiveSeminorm` which is still present. The converse direction is [somewhat tautological](https://github.com/leanprover-community/mathlib4/pull/34137). A proof of `(L2) = (L1)` (probably requiring Hahn-Banach) might be more interesting. * A preliminary implementation of the injective seminorm as commonly understood. * Sufficient conditions for the multiplicativity property `‖⨂ m i‖_∧ = ∏ ‖m i‖` to hold. This implements a TBD item. --- Co-authored-by: Davood H. H. Tehrani [](https://gitpod.io/from-referrer/) | WIP t-analysis new-contributor large-import merge-conflict | 774/387 | Mathlib.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/LeastReasonable.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Analysis/Normed/Operator/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean | 8 | 3 | ['github-actions', 'goliath-klein', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 107 days ago | 23 seconds |
| 34248 | erdOne | chore: get rid of `LocalizedModule.mk` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra merge-conflict | 64/65 | Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/LocalizedModule/Exact.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/GroupTheory/DivisibleHull.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Module.lean | 6 | 3 | ['Vierkantor', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 2 months ago | 99 days ago | 4 hours |
| 34939 | erdOne | chore(AlgebraicGeometry): use relative gluing in `IdealSheaf` | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry merge-conflict | 174/381 | Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean,Mathlib/AlgebraicGeometry/Sites/SmallAffineZariski.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 83 days ago | 9 minutes |
| 33821 | JohnnyTeutonic | feat(LinearAlgebra/Matrix/Hermitian): add IsSkewHermitian predicate | Adds `IsSkewHermitian` predicate for matrices satisfying Aᴴ = -A. --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 70/0 | Mathlib/LinearAlgebra/Matrix/Hermitian.lean | 1 | 20 | ['JohnnyTeutonic', 'github-actions', 'j-loreaux', 'themathqueen'] | kim-em | 2 months ago | 78 days ago | 27 days |
| 33233 | jazzits | feat(GroupTheory): add chosen group presentations and Tietze transformations (1) and (2) | Defines a notion of group presentation for G compatible with Mathlib.GroupTheory.PresentedGroup: generators `ι → G` whose range generates G, and relators `rels : Set (FreeGroup ι)` whose normal closure equals the kernel of `FreeGroup ι →* G`. Provides the canonical map `PresentedGroup P.rels →* G` and equivalences showing `PresentedGroup P.rels ≃* G` and invariance under changing presentations. Also formalizes Tietze moves (1)–(2) as equivalences of PresentedGroups: adding/removing a relator that lies in the normal closure of the others. TODO: moves (3)–(4) (add/remove generator with a defining relation). No existing definitions are modified | t-group-theory new-contributor awaiting-author | 328/0 | Mathlib.lean,Mathlib/GroupTheory/Presentation.lean | 2 | 15 | ['github-actions', 'homeowmorphism', 'jazzits', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536'] | tb65536 | 2 months ago | 123 days ago | 5 days |
| 34931 | eric-wieser | perf: make TensorProduct.lift irreducible with a unification hint | --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 6/2 | Mathlib/LinearAlgebra/TensorProduct/Basic.lean | 1 | 7 | ['eric-wieser', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | erdOne | 2 months ago | 78 days ago | 5 days |
| 34725 | GrigorenkoPV | feat(RingTheory/RootsOfUnity/LowDegree): quadratic, cubic, quartic, quintic roots of unity | Closes https://github.com/leanprover-community/mathlib4/pull/25907 --- Merge of https://github.com/leanprover-community/mathlib4/pull/25907 [](https://gitpod.io/from-referrer/) | new-contributor t-ring-theory awaiting-author | 247/0 | Mathlib.lean,Mathlib/Algebra/CharP/Invertible.lean,Mathlib/Algebra/QuadraticDiscriminant.lean,Mathlib/RingTheory/RootsOfUnity/LowDegree.lean | 4 | 22 | ['GrigorenkoPV', 'LLaurance', 'erdOne', 'github-actions', 'joneugster'] | nobody | 2 months ago | 82 days ago | 5 days |
| 35241 | ooovi | chore(LinearAlgebra/AffineSpace): Redefine AffineSpace | Definition of `AffineSpace` following that of `ConvexSpace`. --- [](https://gitpod.io/from-referrer/) | t-algebra | 106/0 | Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/Basic.lean | 2 | 1 | ['github-actions'] | nobody | 2 months ago | unknown | 0 seconds |
| 27198 | robin-carlier | feat(CategoryTheory/Monoidal/DayConvolution): the Yoneda embedding is monoidal (for Day convolution) | We show that the Yoneda embedding is monoidal when we interpret its target category as Day presheaves (i.e presheaves with the Day convolution monoidal structure). The actual way we prove it is by registering a `LawfulDayConvolutionMonoidalCategoryStruct Cᵒᵖ (Type v₁) C`, for which the "interpretation" functor `C ⥤ Cᵒᵖ ⥤ Type v₁` is the Yoneda embedding. This allows to state a result independently of any size constraint on `C`. Then, we specialize to the case of a small category `C`, in this case, using the fact that the relevant colimit of preseaves exist, we use the fact that the interpretation functor induces a monoidal functor to put a `Monoidal` instance on the functor `dayYoneda : C ⥤ (Cᵒᵖ ⊛⥤ Type v₁) := yoneda ⋙ (equiv Cᵒᵖ _).inverse`. --- I was unsure about which form of simp lemmas we want for characterization of the monoidal structure on `dayYoneda`. I opted for making the "fully applied" lemmas simp, but still leaves the "unapplied" ones as non-simp just in case. - [ ] depends on: #27175 - [x] depends on: #25732 [](https://gitpod.io/from-referrer/) | merge-conflict file-removed blocked-by-other-PR t-category-theory | 1847/26 | Mathlib.lean,Mathlib/CategoryTheory/Functor/KanExtension/Basic.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/DayFunctor.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Types.lean,Mathlib/CategoryTheory/Monoidal/Internal/Limits.lean,Mathlib/CategoryTheory/Monoidal/Limits/Basic.lean,Mathlib/CategoryTheory/Monoidal/Limits/Preserves.lean | 8 | 8 | ['alreadydone', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 2 months ago | 289 days ago | 21 seconds |
| 34159 | wangying11123 | feat(Geometry/Euclidean/Similarity): Add Triangle similarity on oangle | Add theorems about triangles similarity on oangle | t-euclidean-geometry new-contributor awaiting-author | 154/1 | Mathlib/Geometry/Euclidean/Similarity.lean | 1 | 8 | ['LLaurance', 'github-actions', 'jsm28', 'wangying11123'] | jsm28 | 2 months ago | 77 days ago | 7 days |
| 33050 | mkaratarakis | feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem | Lemmas missing for the formalisation of the proof of the Gelfond–Schneider theorem --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor WIP | 238/0 | Mathlib.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/NumberTheory/Transcendental/AnalyticPart.lean,Mathlib/NumberTheory/Transcendental/AnalyticPart2.lean | 6 | 113 | ['SnirBroshi', 'github-actions', 'j-loreaux', 'mkaratarakis', 'riccardobrasca', 'vihdzp'] | riccardobrasca | 2 months ago | 86 days ago | 6 days |
| 33020 | FormulaRabbit81 | chore(Topology): Deprecate file | --- - [x] depends on: #30851 deprecation [](https://gitpod.io/from-referrer/) | t-topology large-import merge-conflict | 82/49 | Mathlib/Topology/Compactness/HilbertCubeEmbedding.lean,Mathlib/Topology/MetricSpace/HausdorffAlexandroff.lean,Mathlib/Topology/MetricSpace/PiNat.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 134 days ago | 4 hours |
| 23791 | SEU-Prime | Create AmiceTrans.lean | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-number-theory new-contributor | 2963/0 | Mathlib.lean,Mathlib/Analysis/Normed/Ring/Lemmas2.lean,Mathlib/NumberTheory/Padics/AmiceTrans.lean,Mathlib/NumberTheory/Padics/PSAC.lean,Mathlib/NumberTheory/Padics/PSAC2.lean,Mathlib/NumberTheory/Padics/PSAC3.lean,Mathlib/NumberTheory/Padics/PiGammainPS.lean,Mathlib/NumberTheory/Padics/PsiandVar.lean,Mathlib/RingTheory/AdicCompletion/Lemma.lean,Mathlib/RingTheory/PowerSeries/Comp.lean,Mathlib/Topology/ContinuousMap/ZeroAtBot.lean | 11 | 5 | ['SEU-Prime', 'github-actions', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 2 months ago | 389 days ago | 38 seconds |
| 20967 | joneugster | tracking(CategoryTheory/Enriched/Limits): add conical limits | Tracking PR for adding conical limits
Co-authored-by: Emily Riehl |
merge-conflict WIP t-category-theory infinity-cosmos please-adopt | 619/1 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean,Mathlib/CategoryTheory/Enriched/Limits/HasConicalProducts.lean,Mathlib/CategoryTheory/Enriched/Limits/HasConicalPullbacks.lean,Mathlib/CategoryTheory/Enriched/Limits/HasConicalTerminal.lean,Mathlib/CategoryTheory/Enriched/Limits/IsConicalLimit.lean,Mathlib/CategoryTheory/Enriched/Limits/IsConicalTerminal.lean,Mathlib/CategoryTheory/Enriched/Ordinary/Basic.lean | 8 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 2 months ago | unknown | 0 seconds |
| 23042 | joneugster | feat(CategoryTheory/Enriched/Limits): add HasConicalLimitsOfSize.shrink | --- Note: I've marked this "WIP" because I'm not yet sure when this will be needed and I'd probably put the PR on the queue once I've created some follow-up needing it. [](https://gitpod.io/from-referrer/) | WIP t-category-theory infinity-cosmos please-adopt | 22/1 | Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean | 1 | 1 | ['github-actions'] | nobody | 2 months ago | 409 days ago | 1 second |
| 23142 | joneugster | feat(CategoryTheory/Enriched/Limits): add API for HasConicalLimit | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-category-theory infinity-cosmos please-adopt | 52/9 | Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean | 1 | 2 | ['github-actions', 'joelriou'] | nobody | 2 months ago | 406 days ago | 18 hours |
| 23145 | joneugster | feat(CategoryTheory/Enriched/Limits): add IsConicalLimits | --- - [ ] depends on: #23142 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory infinity-cosmos please-adopt | 221/9 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean,Mathlib/CategoryTheory/Enriched/Limits/IsConicalLimit.lean | 3 | 3 | ['github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 2 months ago | 407 days ago | 13 minutes |
| 20401 | RemyDegenne | feat: add sigmaFinite_iUnion | ```lean lemma sigmaFinite_iUnion (μ : Measure α) {s : ℕ → Set α} (h_meas : MeasurableSet (⋃ n, s n)) [∀ n, SigmaFinite (μ.restrict (s n))] : SigmaFinite (μ.restrict (⋃ n, s n)) ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 37/28 | Mathlib/MeasureTheory/Decomposition/Exhaustion.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean | 2 | 6 | ['RemyDegenne', 'github-actions', 'sgouezel', 'urkud'] | nobody | 2 months ago | 483 days ago | 20 hours |
| 33281 | michelsol | feat(Analysis/SpecialFunctions/Integrals): integral of 1/sqrt(1-x^2) and its integrability. | Add the integral of the derivative of arcsin and its integrability. --- - [ ] depends on: #33280 [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict t-analysis | 59/0 | Mathlib/Analysis/SpecialFunctions/Integrability/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 127 days ago | 47 minutes |
| 35339 | grunweg | feat: "confusing variables" linter | Continuation of #15400. This linter flags variable commands which both update an existing binder annotation and declare new variables: these can yield confusing or misleading error messages (see https://github.com/leanprover/lean4/issues/2789). Instead, these should be split in several variable statements. ------------ Help fixing these errors is welcome! Currently, the linter only catches some cases, when the updated binder is from a previous scope. To make it catch all cases, the linter could insert a section before the variable command and use that scope instead. See [zulip](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Get.20scope.20*before*.20some.20syntax.20is.20evaluated) [discussions](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Determining.20variable.20binders.20from.20syntax). --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict awaiting-CI t-linter | 220/9 | Cache/Requests.lean,Mathlib/FieldTheory/AbelRuffini.lean,Mathlib/FieldTheory/IntermediateField/Basic.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Basic.lean,Mathlib/Tactic/Linter/Lint.lean,Mathlib/Tactic/Linter/Style.lean,MathlibTest/LintStyle.lean | 8 | 0 | [] | nobody | 2 months ago | 75 days ago | 12 seconds |
| 35342 | grunweg | feat: add Diffeomorph.sumSumSumComm | This matches `{Equiv,Homeomorph.sumSumSumComm}`, and is needed to prove that addition in the cobordism group is commutative. From my bordism theory project. ---------- Migrated and rebased version of #22784. The current proof is not complete yet, and feels very painful. Medium-term, the best way forward might be to make fun_prop support manifolds. [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry | 50/0 | Mathlib/Geometry/Manifold/Diffeomorph.lean | 1 | 1 | ['github-actions'] | nobody | 2 months ago | 75 days ago | 1 second |
| 27897 | grunweg | feat: check indentation of doc-strings | Likely will require further adaptations to mathlib. May land piece-wise. But at first, let's see how big the overall fallout actually is. (So far: 100 lines of implementation and tests, and 170 lines of fix-ups; which are probably mostly complete, but not entirely.) --- - [ ] depends on: #27898 [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-CI | 339/20 | Mathlib/Algebra/Order/Hom/Basic.lean,Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Algebra/Polynomial/Inductions.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Oplax.lean,Mathlib/CategoryTheory/ConcreteCategory/Basic.lean,Mathlib/CategoryTheory/Enriched/Opposite.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/Limits.lean,Mathlib/CategoryTheory/NatIso.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/List/EditDistance/Defs.lean,Mathlib/Data/PNat/Xgcd.lean,Mathlib/Data/Part.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean,Mathlib/GroupTheory/GroupAction/MultiplePrimitivity.lean,Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/Order/Filter/Partial.lean,Mathlib/Order/Interval/Finset/Defs.lean,Mathlib/RingTheory/DividedPowers/Basic.lean,Mathlib/Tactic/ComputeDegree.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/RewriteSearch.lean,Mathlib/Tactic/ToAdditive/Frontend.lean,MathlibTest/DocString.lean,MathlibTest/slow_simp.lean | 37 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 271 days ago | 1 second |
| 11500 | mcdoll | refactor(Topology/Algebra/Module/WeakDual): Clean up | - Move `Dual` and `dualPairing` lower in the import-hierachy - deduplicate `dualPairing` - Bundle continuity statements to `CLM`s. - Make `WeakDual` and `WeakSpace` reducible - Remove `refine'` in favor of `refine` --- Cleaning up `Analysis/NormedSpace/WeakDual` will be done in a second PR [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 227/179 | Mathlib.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/NormedSpace/Dual.lean,Mathlib/Analysis/NormedSpace/WeakDual.lean,Mathlib/Analysis/VonNeumannAlgebra/Basic.lean,Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/Algebra/Module/Dual.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean,docs/overview.yaml,docs/undergrad.yaml | 15 | 16 | ['ADedecker', 'grunweg', 'j-loreaux', 'kkytola', 'mathlib-bors', 'mcdoll', 'urkud'] | nobody | 2 months ago | 724 days ago | 46 days |
| 20428 | madvorak | feat(Data/Sign): lemmas about `∈ Set.range SignType.cast` | --- Perhaps `in_set_range_singType_cast_iff_abs` needs to be moved somewhere downstream. | merge-conflict WIP t-data | 40/0 | Mathlib/Data/Sign.lean | 1 | 13 | ['eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'madvorak', 'urkud'] | nobody | 2 months ago | unknown | 0 seconds |
| 27936 | alreadydone | feat(Algebra): additivize Dvd and Prime | `Prime` can't be directly additivized, so we introduce `Prime₀`, which drops the `≠ 0` condition, and additivize it to `AddPrime`. To show that `Prime₀` is a reasonable definition, we show its connection to `Irreducible` under `IsPrimal` and `IsRegular` conditions. We also show that an element in a product monoid is `Prime₀` iff one component is a unit and the other is `Prime₀`, and the same with `Prime₀` replaced by `Irreducible`. Also additivize `IsPrimal`, `IsRelPrime` and `DecompositionMonoid`. The motivation is that the primality of `single g 1` in `AddMonoidAlgebra k G` is connected to the primality of `g` in `G`. --- I've checked [all 29 files](https://github.com/search?q=repo%3Aleanprover-community%2Fmathlib4%20%E2%88%A3%20to_additive&type=code) containing the `∣` symbol and the `to_additive` attribute and fixed the wrongly translated (`dvd` to `addDvd`) names. TODO: connect (Add)Dvd to [ExistsMul/AddOfLE](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Monoid/Unbundled/ExistsOfLE.html#ExistsMulOfLE) [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 398/185 | Mathlib.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/Divisibility/Basic.lean,Mathlib/Algebra/Divisibility/Finite.lean,Mathlib/Algebra/Divisibility/Hom.lean,Mathlib/Algebra/Divisibility/Prod.lean,Mathlib/Algebra/Divisibility/Units.lean,Mathlib/Algebra/Group/Action/Pointwise/Finset.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Associated.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Algebra/Prime/Defs.lean,Mathlib/Algebra/Prime/Lemmas.lean,Mathlib/Algebra/Prime/Prod.lean,Mathlib/Data/Nat/Prime/Defs.lean,Mathlib/Dynamics/PeriodicPts/Defs.lean,Mathlib/GroupTheory/Coset/Card.lean,Mathlib/GroupTheory/Exponent.lean,Mathlib/GroupTheory/GroupAction/Blocks.lean,Mathlib/GroupTheory/GroupAction/Period.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/GroupTheory/Schreier.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/Tactic/Translate/ToAdditive.lean | 30 | 38 | ['JovanGerb', 'YaelDillies', 'adomani', 'alreadydone', 'bryangingechen', 'github-actions', 'jcommelin', 'kbuzzard', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | bryangingechen | 2 months ago | 99 days ago | 107 days |
| 34156 | zcyemi | feat(Analysis/Convex/Between): add lemmas on convex combination of mem simplex interior | --- I add three lemmas of convex combinations preserving membership in the interior of a simplex. And also open a zulip thread [#mathlib4 > Best place for convex combination and simplex interior](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Best.20place.20for.20convex.20combination.20and.20simplex.20interior/with/568558406) deps: - [ ] depends on: #33852 | t-analysis merge-conflict | 170/0 | Mathlib/Analysis/Convex/Between.lean,Mathlib/LinearAlgebra/AffineSpace/Independent.lean | 2 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 75 days ago | 48 minutes |
| 34503 | alreadydone | chore(RingTheory/Localization): generalize FractionRing to semirings | + Introduce `Submonoid.regulars`, the submonoid of regular elements in a monoid. + Replace `nonZeroDivisors` by `regulars` in the definition of (Is)FractionRing, generalizing from CommRing to CommSemiring. Finishes most of the remaining parts of issue #22997. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra awaiting-CI WIP merge-conflict | 330/188 | Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Group/Hom/Basic.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Ring/NonZeroDivisors.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/RingTheory/LocalRing/Basic.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 13 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | unknown | 0 seconds |
| 35134 | fpvandoorn | feat(translate): print constant names with hover info | Part of #34846. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-author merge-conflict | 46/28 | Mathlib/Tactic/Translate/Core.lean,MathlibTest/toAdditive.lean | 2 | 6 | ['JovanGerb', 'github-actions', 'mathlib-merge-conflicts'] | JovanGerb | 2 months ago | 77 days ago | 2 days |
| 29777 | yuanyi-350 | feat(Functional Analysis): closed Range Theorem | - [ ] depends on: #29151 [Corollary of Hahn-Banach theorem] - [ ] depends on: #29776 [refactor ContinuousLinearMap.isOpenMap by separating it into sublemmas] --- [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR new-contributor awaiting-author t-analysis merge-conflict | 237/25 | Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/ClosedRange.lean,Mathlib/Analysis/RCLike/Lemmas.lean,Mathlib/Topology/Order/OrderClosed.lean | 5 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | faenuccio | 2 months ago | 225 days ago | 10 minutes |
| 29151 | yuanyi-350 | feat: Corollary of Hahn–Banach theorem | In this PR, I have proved [Rudin, *Functional Analysis* (Theorem 3.7)][rudin1991] which is a step in proving the Closed Range Theorem. Also, I have added tags for the corresponding theorems in Rudin to mathlib.
3.7 Theorem. Suppose B is a convex, balanced, closed set in a locally convex space $X, x_0 \in X$, but $x_0 \notin B$. Then there exists $\Lambda \in X^*$ such that $|\Lambda x| \leq 1$ for all $x \in B$, but $\Lambda x_0>1$
proof. Since $B$ is closed and convex, we can apply (b) of Theorem 3.4, with $A=\{ x_0 \}$ , to obtain $\Lambda_1 \in X^*$ such that $\Lambda_1 x_0=r e^{i \theta}$ lies outside the closure $K$ of $\Lambda_1(B)$. Since $B$ is balanced, so is $K$. Hence there exists $s, 0 |
awaiting-author new-contributor large-import t-analysis merge-conflict | 70/1 | Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/RCLike/Lemmas.lean,Mathlib/Topology/Order/OrderClosed.lean | 3 | 17 | ['faenuccio', 'fpvandoorn', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mcdoll', 'themathqueen', 'yuanyi-350'] | faenuccio | 2 months ago | 222 days ago | 20 days |
| 35344 | grunweg | feat: lint upon uses of the mono tactic | suggesting to use `gcongr` instead. In general, `mono` is unmaintained, was only partially ported --- and gcongr at this point is more featureful, actively developed and has a nicer user interface. The topic was also discussed [on zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Porting.20note.3A.20Fixing.20up.20.60mono.60/with/445125798). --- TODO: update the linter wording, fix its implementation and wait until tests pass Rebased and migrated version of #25700. --- [](https://gitpod.io/from-referrer/) | please-adopt t-linter RFC | 4/0 | MathlibTest/DeprecatedSyntaxLinter.lean,MathlibTest/Monotonicity.lean | 2 | 2 | ['github-actions', 'grunweg'] | nobody | 2 months ago | 75 days ago | 13 seconds |
| 29965 | RemyDegenne | feat(probability): define subtraction of kernels | This PR defines subtraction of kernels and uses it to prove `MeasurableSet {a | κ a = η a}` for two finite kernels `κ, η`. From the LeanBandits project. --- - [x] depends on: #35018 [](https://gitpod.io/from-referrer/) | WIP t-measure-probability large-import | 165/2 | Mathlib.lean,Mathlib/MeasureTheory/Measure/SubFinite.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Kernel/RadonNikodym.lean,Mathlib/Probability/Kernel/Sub.lean | 5 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 218 days ago | 1 second |
| 32534 | erdOne | feat(AlgebraicGeometry): Zariski's main theorem | --- - [x] depends on: #34274 - [x] depends on: #34017 - [ ] depends on: #34222 - [ ] depends on: #34269 - [ ] depends on: #33903 - [ ] depends on: #33803 - [ ] depends on: #33555 - [x] depends on: #33805 - [x] depends on: #33722 - [x] depends on: #33718 - [x] depends on: #32811 - [x] depends on: #32803 - [x] depends on: #33469 - [x] depends on: #33553 - [x] depends on: #32530 - [x] depends on: #32528 - [x] depends on: #32429 - [x] depends on: #32375 - [x] depends on: #30885 - [x] depends on: #32536 - [x] depends on: #32537 - [x] depends on: #32595 - [x] depends on: #32596 - [x] depends on: #32813 - [x] depends on: #32809 - [x] depends on: #32802 - [x] depends on: #33468 - [x] depends on: #32665 - [x] depends on: #32823 - [x] depends on: #32806 - [x] depends on: #32837 - [x] depends on: #33537 - [x] depends on: #33476 - [x] depends on: #33556 - [x] depends on: #33536 - [x] depends on: #33472 [](https://gitpod.io/from-referrer/) | WIP t-ring-theory | 4808/0 | Mathlib.lean,Mathlib/CFT/ActualStuff.lean,Mathlib/CFT/Etale.lean,Mathlib/CFT/EtaleLocalization.lean,Mathlib/CFT/Flat.lean,Mathlib/CFT/IntegralClosure.lean,Mathlib/CFT/IsStandardEtale.lean,Mathlib/CFT/Junk.lean,Mathlib/CFT/NewNo.lean,Mathlib/CFT/No.lean,Mathlib/CFT/Nonsense.lean,Mathlib/CFT/Normalization.lean,Mathlib/CFT/Prestuff.lean,Mathlib/CFT/SeparableResidueStruct.lean,Mathlib/CFT/Smooth.lean,Mathlib/CFT/SmoothFibers.lean,Mathlib/CFT/Stuff.lean,Mathlib/CFT/Stuff2.lean,Mathlib/CFT/ZariskiMain.lean,Mathlib/RingTheory/ZariskiMain.lean | 20 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 145 days ago | 1 minute |
| 29145 | JovanGerb | chore: use `to_additive` in more places | This PR addresses some comments about `to_additive` not working, by making it work more. --- [](https://gitpod.io/from-referrer/) | awaiting-CI t-meta merge-conflict | 61/177 | Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Order/BigOperators/Group/LocallyFinite.lean,Mathlib/Combinatorics/Additive/DoublingConst.lean,Mathlib/Data/ZMod/Aut.lean,Mathlib/Topology/Algebra/InfiniteSum/Module.lean | 5 | 4 | ['JovanGerb', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 243 days ago | 42 minutes |
| 34024 | adomani | feat: the global syntax linter | The `globalSyntax` linter emits a warning on pairs of consecutive commands with no overall effect. For instance, the linter would flag ```lean4 namespace X end X ``` and similarly for consecutive pairs of `open` or `section` and `end`. --- - [ ] depends on: #34019, with just the linter implementation - [x] depends on: #34021, with linter-driven corrections - [x] depends on: #34051, with linter-driven corrections [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-linter merge-conflict | 219/15 | Archive/Imo/Imo2024Q3.lean,Mathlib.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Init.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/GlobalSyntax.lean,MathlibTest/FindSyntax.lean,MathlibTest/Tauto.lean,MathlibTest/sqrt.lean | 9 | 13 | ['Ruben-VandeVelde', 'adomani', 'github-actions', 'grunweg', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 105 days ago | 29 minutes |
| 34926 | mattrobball | test | Testing --- [](https://gitpod.io/from-referrer/) | merge-conflict | 1/1 | lean-toolchain | 1 | 9 | ['github-actions', 'kbuzzard', 'leanprover-radar', 'mathlib-merge-conflicts', 'mattrobball'] | nobody | 2 months ago | unknown | 0 seconds |
| 16553 | grunweg | WIP: tinkering with orientable manifolds | - wait for #33307 to get merged - PR the "normed space" part separately - WIP: a linear isomorphism on a connected set is either orientation-preserving or orientation-preserving: some form of this was merged into mathlib recently; TODO update this PR accordingly! - [ ] depends on: #33307 - [x] depends on: #8738 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 287/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/Geometry/Manifold/Orientable.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | unknown | 0 seconds |
| 33712 | wangying11123 | feat(Geometry/Euclidean/Angle/Unoriented/Projection): Add sameray_orthogonalProjection_vsub_of_angle_lt | Add sameray_orthogonalProjection_vsub_of_angle_lt `sameray_orthogonalProjection_vsub_of_angle_lt` When an angle is acute, the vector to the orthogonal projection lies in the same ray as the given direction vector. | new-contributor t-euclidean-geometry awaiting-author | 20/0 | Mathlib/Geometry/Euclidean/Angle/Unoriented/Projection.lean | 1 | 4 | ['JovanGerb', 'github-actions', 'j-loreaux'] | JovanGerb | 2 months ago | 73 days ago | 39 days |
| 33786 | hdmkindom | feat(Analysis/Matrix): add Jacobian matrix for matrix-valued functions | This PR introduces the Jacobian matrix for matrix-valued functions `F : Matrix m n ℝ → Matrix p q ℝ`. The Jacobian matrix `jacobianMatrix F X` at point `X` is indexed by `(p × q) × (m × n)`, where each entry represents the partial derivative with respect to a basis element. To handle instance-mismatch issues with matrix norms, we use local Frobenius norm instances. mkdir Analysis/Matrix/Jacobian.lean ## Main definitions - `jacobianMatrix F X`: The Jacobian matrix at point `X`, defined by `jacobianMatrix F X (i, k) (j, l) = (fderiv ℝ F X (Matrix.single j l 1)) i k` ## Main theorems - `fderiv_eq_jacobian_mul`: Express the Fréchet derivative as a contraction with the Jacobian - `jacobianMatrix_comp`: Chain rule for Jacobian matrices - `jacobianMatrix_linear`, `jacobianMatrix_id`, `jacobianMatrix_const`: Basic properties - `jacobianMatrix_add`, `jacobianMatrix_smul`: Linearity properties | t-analysis new-contributor awaiting-author | 219/0 | Mathlib.lean,Mathlib/Analysis/Matrix/Jacobian.lean | 2 | 11 | ['erdOne', 'github-actions', 'jcommelin'] | sgouezel | 2 months ago | 73 days ago | 39 days |
| 30667 | FrederickPu | feat(Mathlib/Algebra/Group/Subgroup/Pointwise): subgroup mul | Title: feat: pointwise products for subgroups Description: showed the point-wise product of disjoint subgroups is equivalent to their Cartesian product. Based on https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/useful.20group.20theory.20lemmas/with/546738566. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 28/0 | Mathlib/Algebra/Group/Subgroup/Pointwise.lean | 1 | 23 | ['FrederickPu', 'eric-wieser', 'github-actions', 'plp127', 'tb65536'] | nobody | 2 months ago | 73 days ago | 1 day |
| 33793 | LTolDe | feat(MeasureTheory/Constructions/Polish/Basic): add lemma AnalyticSet.inter_nonempty_of_nowhereMeagre | add lemma AnalyticSet.inter_nonempty_of_nowhereMeagre, the main ingredient for the proof of the **Effros' Theorem**, see [#mathlib4 > Effros Theorem](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/566543328) introduce definition of a nowhere meagre set --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor awaiting-author | 37/0 | Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Topology/GDelta/Basic.lean | 3 | 8 | ['MichaelStollBayreuth', 'erdOne', 'github-actions', 'j-loreaux'] | kex-y | 2 months ago | 73 days ago | 39 days |
| 24965 | erdOne | refactor: Make `IsLocalHom` take unbundled map | Under the current definition, `IsLocalHom f` and `IsLocalHom f.toMonoidHom` are not defeq, which causes quite some annoyances. We also have a consensus to not use `*HomClass` in definitions. As a result, we change `IsLocalHom` to take an unbundled function instead of a funlike. --- [](https://gitpod.io/from-referrer/) | t-algebra delegated merge-conflict | 18/9 | Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/Geometry/RingedSpace/LocallyRingedSpace.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean | 5 | 15 | ['adomani', 'alreadydone', 'erdOne', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp'] | mattrobball | 2 months ago | 164 days ago | 24 days |
| 25622 | eric-wieser | refactor: overhaul instances on LocalizedModule | This: * Generalizes the `SMul`, `Module`, and `Algebra` instances via appropriate compatibility conditions * Generalizes the `Mul` instance to the non-unital setting * Fixes instances diamonds for the `Nat`- and `Int`-actions --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 214/100 | Mathlib/Algebra/Module/LocalizedModule/Basic.lean | 1 | 6 | ['erdOne', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 107 days ago | 9 minutes |
| 25980 | Multramate | refactor(Algebra/Group/Submonoid/Operations): rename restrict to domRestrict and add restrict | And update the documentation for consistency | t-group-theory merge-conflict | 145/123 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/GroupTheory/FiniteAbelian/Duality.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/Maps.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/Transfer.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/NumberTheory/NumberField/CMField.lean,Mathlib/NumberTheory/NumberField/Ideal/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean | 14 | 10 | ['Multramate', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 72 days ago | 5 days |
| 25981 | Multramate | feat(GroupTheory/GroupAction/Basic): define homomorphisms of fixed subgroups induced by homomorphisms of groups | This PR continues the work from #10126. Original PR: https://github.com/leanprover-community/mathlib4/pull/10126 | t-group-theory large-import merge-conflict | 218/144 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Ring/Action/Submonoid.lean,Mathlib/GroupTheory/FiniteAbelian/Duality.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/Maps.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/Transfer.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/NumberTheory/NumberField/CMField.lean,Mathlib/NumberTheory/NumberField/Ideal/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean | 16 | 8 | ['copilot-pull-request-reviewer', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 72 days ago | 4 days |
| 35313 | LexinonCraft | feat: IMO 2025 Q4 | This adds a solution for problem 4 from the International Math Olympiad 2025. --- | IMO new-contributor awaiting-author | 631/0 | Archive.lean,Archive/Imo/Imo2025Q4.lean | 2 | 4 | ['LexinonCraft', 'github-actions', 'jsm28'] | jsm28 | 2 months ago | 72 days ago | 3 days |
| 31603 | alreadydone | chore(Algebra): make `RatFunc` an abbrev | I think there's no instance on `FractionRing K[X]` that shouldn't be shared by `RatFunc K`, so it's better to make the latter an abbrev. In the ongoing [Lüroth project](https://github.com/hdlean/mathlib4/pull/1/files#diff-02a084b8d8540eab8a346db8be4ba1a2b39b086bc1407125536d96adf6544544) I've been using `FractionRing K[X]` and it would be nice if we could gain direct access to `RatFunc` API (though not much is relevant, there was already one case where it's helpful), and if our results could be directly applied to RatFunc rather than going through some isomorphism boilerplate. Of course, some `IsRatFunc` predicate could also be an option (IsField + generated by one transcendental element over base field). --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra RFC merge-conflict | 113/423 | Mathlib/FieldTheory/Laurent.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/FieldTheory/RatFunc/Defs.lean,scripts/nolints_prime_decls.txt | 5 | 24 | ['Vierkantor', 'alreadydone', 'erdOne', 'github-actions', 'leanprover-bot', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'mattrobball'] | erdOne | 2 months ago | 159 days ago | 9 days |
| 33276 | NicolaBernini | feat: Rename List.reverse_perm to List.reverse_perm_self and List.reverse_perm' to List.reverse_perm_iff | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author t-data merge-conflict | 17/15 | Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Data/Finset/Dedup.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Defs.lean,Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/List/Permutation.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/NumberTheory/Divisors.lean | 8 | 5 | ['Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | kim-em | 2 months ago | 123 days ago | 4 days |
| 33303 | sinhp | feat(CategoryTheory): The monads and comonads of locally cartesian closed categories | --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory merge-conflict | 405/8 | Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ChosenPullbacksAlong.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Monad.lean | 3 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 126 days ago | 20 seconds |
| 33795 | alreadydone | feat(Topology/Sheaves): LocalPredicate prerequisite for étalé spaces | --- [](https://gitpod.io/from-referrer/) | t-topology merge-conflict | 418/143 | Mathlib/AlgebraicGeometry/ProjectiveSpectrum/StructureSheaf.lean,Mathlib/Geometry/Manifold/Sheaf/Smooth.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Topology/Sheaves/LocalPredicate.lean,Mathlib/Topology/Sheaves/Sheafify.lean,Mathlib/Topology/Sheaves/Stalks.lean | 6 | 12 | ['adamtopaz', 'alreadydone', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts'] | adamtopaz | 2 months ago | 72 days ago | 34 days |
| 34179 | alreadydone | refactor(Algebra): weaken NormalizationMonoid | This PR replaces the two fields ``` normUnit_mul : ∀ {a b}, a ≠ 0 → b ≠ 0 → normUnit (a * b) = normUnit a * normUnit b normUnit_coe_units : ∀ u : αˣ, normUnit u = u⁻¹ ``` in the definition of NormalizationMonoid by ``` normUnit_one : normUnit 1 = 1 normUnit_mul_units {a : α} (u : αˣ) : a ≠ 0 → normUnit (a * u) = u⁻¹ * normUnit a ``` and rename the old version to StrongNormalizationMonoid. The vast majority of API continue to hold under this weakened notion of NormalizationMonoid; only a handful requires the original notion. Every cancellative monoid with zero admits a weakened NormalizationMonoid structure, and every GCDMonoid admits a weakened NormalizedGCDMonoid structure. This allows us to generalize [Polynomial.normalizedGcdMonoid](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Polynomial/Content.html#Polynomial.normalizedGcdMonoid) to all GCDMonoids. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra awaiting-author merge-conflict | 505/330 | Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/GCDMonoid/IntegrallyClosed.lean,Mathlib/Algebra/GCDMonoid/Multiset.lean,Mathlib/Algebra/GCDMonoid/Nat.lean,Mathlib/Algebra/GCDMonoid/PUnit.lean,Mathlib/Algebra/GroupWithZero/Associated.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/NumberTheory/FLT/Basic.lean,Mathlib/RingTheory/ChainOfDivisors.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Basic.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/Polynomial/Content.lean,Mathlib/RingTheory/Polynomial/GaussLemma.lean,Mathlib/RingTheory/PowerSeries/Inverse.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Finite.lean,Mathlib/RingTheory/UniqueFactorizationDomain/GCDMonoid.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Multiplicative.lean,Mathlib/RingTheory/UniqueFactorizationDomain/NormalizedFactors.lean | 20 | 28 | ['alreadydone', 'erdOne', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | erdOne | 2 months ago | 89 days ago | 9 days |
| 34955 | thorimur | chore: test overlapping instances linter | This draft PR is intended to test-run the syntax version of the overlapping instances linter in [this PR](https://github.com/JovanGerb/mathlib4/pull/1). The two purposes are 1. benching 2. figuring out which violations we should exempt/fix This PR is not intended to be merged. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 515/14 | Mathlib.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/CategoryTheory/Monoidal/Closed/Cartesian.lean,Mathlib/CategoryTheory/Shift/Pullback.lean,Mathlib/Init.lean,Mathlib/Lean/ContextInfo.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/Lean/LocalContext.lean,Mathlib/Lean/Message.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/OverlappingInstances.lean,MathlibTest/OverlappingInstances.lean | 14 | 8 | ['github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'thorimur'] | nobody | 2 months ago | unknown | 0 seconds |
| 35345 | grunweg | feat(Linter.openClassical): also lint for Classical declarations as | …a local or scoped instance. Rebased and migrated version of #23763. --- [](https://gitpod.io/from-referrer/) | t-linter | 131/31 | Mathlib/RingTheory/Perfection.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean,MathlibTest/LintStyle.lean | 4 | 1 | ['github-actions'] | nobody | 2 months ago | 72 days ago | 2 hours |
| 34674 | Citronhat | feat(Algebra/Order/Ring): replace ENNReal lemmas with WithTop versions | * Add `WithTop` versions of basic multiplicative order lemmas. * Use the new `WithTop` lemmas to replace `ENNReal` proofs and address six TODOs. * Fix a typo in the `pos_of_ne_zero` alias name. | new-contributor t-algebra merge-conflict | 46/15 | Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Data/ENNReal/Operations.lean | 3 | 5 | ['Citronhat', 'Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | Ruben-VandeVelde | 2 months ago | 72 days ago | 17 days |
| 33477 | mcdoll | refactor(Algebra): add type-classes for algebraic properties of `FunLike` | --- Zulip discussion: [#mathlib4 > Refactoring algebraic properties of bundled maps](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Refactoring.20algebraic.20properties.20of.20bundled.20maps/with/566142461) [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 1782/897 | Counterexamples/CliffordAlgebraNotInjective.lean,Mathlib.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Azumaya/Matrix.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/Category/Grp/Colimits.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Differentials/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Basic.lean,Mathlib/Algebra/Central/End.lean,Mathlib/Algebra/DirectSum/Ring.lean,Mathlib/Algebra/Group/Finsupp.lean,Mathlib/Algebra/Group/Hom/Basic.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Group/Hom/End.lean,Mathlib/Algebra/Group/Hom/Instances.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Hom.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/ExactSequences.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplexCohomology.lean,Mathlib/Algebra/Homology/ShortComplex/Ab.lean,Mathlib/Algebra/Lie/Abelian.lean,Mathlib/Algebra/Lie/BaseChange.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/Lie/Cochain.lean,Mathlib/Algebra/Lie/Derivation/AdjointAction.lean,Mathlib/Algebra/Lie/Derivation/Basic.lean,Mathlib/Algebra/Lie/EngelSubalgebra.lean,Mathlib/Algebra/Lie/Extension.lean,Mathlib/Algebra/Lie/InvariantForm.lean,Mathlib/Algebra/Lie/LieTheorem.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/TensorProduct.lean,Mathlib/Algebra/Lie/TraceForm.lean,Mathlib/Algebra/Lie/Weights/Basic.lean,Mathlib/Algebra/Lie/Weights/Cartan.lean,Mathlib/Algebra/Lie/Weights/IsSimple.lean,Mathlib/Algebra/Lie/Weights/Killing.lean,Mathlib/Algebra/Module/CharacterModule.lean,Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/Hom.lean,Mathlib/Algebra/Module/LinearMap/Basic.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Algebra/Module/Submodule/LinearMap.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Module/Submodule/Range.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Algebra/MonoidAlgebra/MapDomain.lean,Mathlib/Algebra/MonoidAlgebra/Module.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Division.lean,Mathlib/Algebra/MvPolynomial/NoZeroDivisors.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Order/Floor/Div.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Coeff.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean,Mathlib/Analysis/Analytic/Binomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/OfScalars.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/CompMul.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean,Mathlib/Analysis/Calculus/Implicit.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/Calculus/LagrangeMultipliers.lean,Mathlib/Analysis/Calculus/VectorField.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/Conformal.lean | 266 | 7 | ['github-actions', 'leanprover-radar', 'mathlib4-merge-conflict-bot', 'mcdoll', 'plp127'] | nobody | 2 months ago | unknown | 0 seconds |
| 35324 | harahu | chore: add H1 headers | This PR introduces a script that identifies lean files that don't have an H1 header. I've added a placeholder header to the identified files and will use this branch to develop smaller PRs. --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 1749/0 | Archive/Wiedijk100Theorems/CubingACube.lean,Cache/Hashing.lean,Cache/IO.lean,Cache/Init.lean,Cache/Main.lean,Cache/Requests.lean,Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean,Counterexamples/IrrationalPowerOfIrrational.lean,Mathlib/Algebra/Algebra/Subalgebra/IsSimpleOrder.lean,Mathlib/Algebra/AlgebraicCard.lean,Mathlib/Algebra/ArithmeticGeometric.lean,Mathlib/Algebra/Category/Grp/FiniteGrp.lean,Mathlib/Algebra/Category/Grp/ZModuleEquivalence.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/CharP/Frobenius.lean,Mathlib/Algebra/GroupWithZero/Int.lean,Mathlib/Algebra/Homology/ComplexShapeSigns.lean,Mathlib/Algebra/Homology/HomologicalComplexBiprod.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplexShift.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomologicalFunctor.lean,Mathlib/Algebra/Homology/HomotopyCategory/Pretriangulated.lean,Mathlib/Algebra/Homology/HomotopyCategory/Triangulated.lean,Mathlib/Algebra/Homology/HomotopyCofiber.lean,Mathlib/Algebra/Homology/Localization.lean,Mathlib/Algebra/Homology/TotalComplexSymmetry.lean,Mathlib/Algebra/Lie/CartanMatrix.lean,Mathlib/Algebra/ModEq.lean,Mathlib/Algebra/Module/Submodule/Equiv.lean,Mathlib/Algebra/MvPolynomial/Counit.lean,Mathlib/Algebra/MvPolynomial/Expand.lean,Mathlib/Algebra/NoZeroSMulDivisors/Prod.lean,Mathlib/Algebra/Order/Archimedean/Hom.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Interval/Set/Group.lean,Mathlib/Algebra/Order/Module/Algebra.lean,Mathlib/Algebra/Order/Monoid/ToMulBot.lean,Mathlib/Algebra/Order/PartialSups.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Factors.lean,Mathlib/Algebra/QuadraticAlgebra.lean,Mathlib/AlgebraicGeometry/Morphisms/UnderlyingMap.lean,Mathlib/AlgebraicTopology/DoldKan/Compatibility.lean,Mathlib/AlgebraicTopology/DoldKan/EquivalenceAdditive.lean,Mathlib/AlgebraicTopology/DoldKan/GammaCompN.lean,Mathlib/AlgebraicTopology/DoldKan/NCompGamma.lean,Mathlib/AlgebraicTopology/MooreComplex.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Calculus/ContDiff/RestrictScalars.lean,Mathlib/Analysis/Calculus/Deriv/Shift.lean,Mathlib/Analysis/Calculus/TangentCone.lean,Mathlib/Analysis/Distribution/FourierSchwartz.lean,Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/InnerProductSpace/Harmonic/Analytic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/Matrix.lean,Mathlib/Analysis/Normed/Field/Ultra.lean,Mathlib/Analysis/Normed/Module/ENormedSpace.lean,Mathlib/Analysis/NormedSpace/Alternating/Basic.lean,Mathlib/Analysis/NormedSpace/Alternating/Curry.lean,Mathlib/Analysis/NormedSpace/Alternating/Uncurry/Fin.lean,Mathlib/Analysis/NormedSpace/BallAction.lean,Mathlib/Analysis/NormedSpace/ConformalLinearMap.lean,Mathlib/Analysis/NormedSpace/Connected.lean,Mathlib/Analysis/NormedSpace/DualNumber.lean,Mathlib/Analysis/NormedSpace/ENormedSpace.lean,Mathlib/Analysis/NormedSpace/Extend.lean,Mathlib/Analysis/NormedSpace/Extr.lean,Mathlib/Analysis/NormedSpace/FunctionSeries.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Extension.lean,Mathlib/Analysis/NormedSpace/HahnBanach/SeparatingDual.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Separation.lean,Mathlib/Analysis/NormedSpace/HomeomorphBall.lean,Mathlib/Analysis/NormedSpace/IndicatorFunction.lean,Mathlib/Analysis/NormedSpace/Int.lean,Mathlib/Analysis/NormedSpace/MStructure.lean,Mathlib/Analysis/NormedSpace/Multilinear/Basic.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/MultipliableUniformlyOn.lean,Mathlib/Analysis/NormedSpace/Normalize.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Asymptotics.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Basic.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Bilinear.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Completeness.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Mul.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NNNorm.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NormedSpace.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/Prod.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Analysis/NormedSpace/Pointwise.lean,Mathlib/Analysis/NormedSpace/RCLike.lean,Mathlib/Analysis/NormedSpace/Real.lean,Mathlib/Analysis/NormedSpace/RieszLemma.lean,Mathlib/Analysis/NormedSpace/SphereNormEquiv.lean,Mathlib/Analysis/Real/Pi/Leibniz.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev.lean,Mathlib/CategoryTheory/Adhesive.lean | 348 | 3 | ['github-actions', 'harahu', 'mathlib-merge-conflicts'] | nobody | 2 months ago | unknown | 0 seconds |
| 35352 | themathqueen | feat(Analysis/CStarAlgebra): the norm of a positive linear functional `f` on a unital C*-algebra is `f 1` | --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 24/0 | Mathlib/Analysis/CStarAlgebra/GelfandNaimarkSegal.lean,Mathlib/Analysis/CStarAlgebra/PositiveLinearMap.lean | 2 | 7 | ['github-actions', 'j-loreaux', 'themathqueen'] | j-loreaux | 2 months ago | 70 days ago | 4 days |
| 25989 | Multramate | feat(NumberTheory/EllipticDivisibilitySequence): add elliptic nets | This PR continues the work from #25030. Original PR: https://github.com/leanprover-community/mathlib4/pull/25030 | t-number-theory large-import awaiting-author | 254/39 | Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 1 | 27 | ['MichaelStollBayreuth', 'Multramate', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib4-merge-conflict-bot', 'tb65536'] | tb65536 | 2 months ago | 70 days ago | 55 days |
| 35411 | daniel-carranza | feat(CategoryTheory/Enriched/Limits): define cotensors in an enriched category | Defines the notion of cotensors in a `V`-category `C`, where `V` is a braided monoidal category. Proves that `V` itself has all cotensors when viewed as a category enriched in `V`. Also proves that if `C` has all cotensors and `V` is additionally symmetric then the cotensors form a `V`-functor from the enriched tensor product`V\op \times C` to `C`. --- This work originates from the infinity-cosmos project, where the dual theory of tensors was formalized by @arnoudvanderleer . The current version of this code introduces an `abbrev` definition `Ehom V C x y` for the hom-object C(x, y) in V. The intention is to make the code easier to both to write and read; the existing notation `x \hom[V] y` throws an error when instantiated at `C` = `V` (`ambiguous term;` `Possible interpretations:` `(ihom x).obj y : V` `x ⟶[V] y : V`). A possibly related issue is there are a few calls to `erw` that stem from a failure to identify `(ihom x).obj : V` with `Ehom V V x y`. Any help with these issues, or any other assistance, is greatly appreciated! - [ ] depends on: #35144 [required to prove `V`-functoriality of cotensors] - [ ] depends on: #35436 [required to prove that `V` admits all cotensors by itself] [](https://gitpod.io/from-referrer/) | WIP t-category-theory infinity-cosmos blocked-by-other-PR | 822/0 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/Limits/Cotensors.lean,Mathlib/CategoryTheory/Enriched/TensorProductCategory.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Closed/InternalCurrying.lean | 5 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 months ago | 74 days ago | 8 seconds |
| 28246 | Sebi-Kumar | feat(AlgebraicTopology/FundamentalGroupoid): the n-sphere is simply connected for n > 1 | Prove that the `n`-dimensional sphere (i.e., the unit sphere centered at the origin in `(n + 1)`-dimensional real Euclidean space) is a simply connected space for `n > 1`. This proof follows Hatcher's "Algebraic Topology"; we first prove a general lemma about decomposing loops and then exploit the fact that non-surjective loops in the sphere are homotopically trivial. Note: To get this file to build, I edited `Mathlib/Tactic/Linter/DirectoryDependency.lean` to remove the restrictions on AlgebraicTopology files importing Geometry, NumberTheory, and FieldTheory files. Thank you to those who shared their expertise [here](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Warning.20that.20AlgebraicTopology.20can't.20import.20SetTheory/with/533833638). As I understand it, this is just a short-term solution, so I would appreciate feedback on what to do about this situation. Note: I am unsure where exactly the file `SimplyConnectedSphere.lean` should go or whether that is an appropriate name for the file, so feedback there would be appreciated. --- To provide additional context, this code was written as a part of the Fields Undergraduate Summer Research Program at the University of Western Ontario under the supervision of Chris Kapulkin and Daniel Carranza. - [x] depends on: #28208 - [x] depends on: #28198 - [x] depends on: #28185 [](https://gitpod.io/from-referrer/) | t-algebraic-topology new-contributor awaiting-author | 343/3 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnectedSphere.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 3 | 17 | ['dagurtomas', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | robin-carlier | 2 months ago | 70 days ago | 13 days |
| 31611 | thorimur | feat(Meta): `withPlural` wrapper for more readable messages in source | This small PR introduces a thin wrapper `withPlural` for Lean's textual datatypes so that we can write ``` "foo".withPlural "foos" count ``` instead of ``` if count = 1 then "foo" else "foos" ``` The dot notation here is chosen so that the singular version of the word appears at the start of the syntax, as opposed to buried in an `if/then`. This makes dynamically pluralizing a word in `MessageData` (which is a relatively common occurrence) a bit easier to read in source, especially when multiple pluralizations are needed close to one another. --- Am I handling the copyright header correctly? My reasoning is that the file was devoid of content, and so this is ultimately a new file. But I'm not sure this is technically what should happen here. [](https://gitpod.io/from-referrer/) | t-meta awaiting-author merge-conflict | 63/5 | Mathlib/Lean/Message.lean | 1 | 21 | ['adomani', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'thorimur'] | nobody | 2 months ago | 147 days ago | 21 days |
| 29203 | Hagb | feat(RingTheory/MvPolynomial/Groebner): add Gröbner basis | This PR adds some definitions and theorems of Gröbner basis theory. Definitions: - `MonomialOrder.IsRemainder` - `MonomialOrder.IsGroebnerBasis` Main theorems: * `MonomialOrder.remainder_eq_zero_iff_mem_ideal_of_isGroebnerBasis`: Given a remainder of a polynomial on division by a Gröbner basis of an ideal, the remainder is 0 if and only if the polynomial is in the ideal. * `MonomialOrder.isGroebnerBasis_iff_subset_ideal_and_isRemainder_zero`: A finite set of polynomials is a Gröbner basis of an ideal if and only if it is a subset of this ideal and 0 is a remainder of each member of this ideal on division by this finite set. * `MonomialOrder.existsUnique_isRemainder_of_isGroebnerBasis`: Remainder of any polynomial on division by a Gröbner basis exists and is unique. * `MonomialOrder.ideal_eq_span_of_isGroebnerBasis`: Gröbner basis of any ideal spans the ideal. * `MonomialOrder.isGroebnerBasis_iff_isRemainder_sPolynomial_zero` (Buchberger Criterion): a basis of an ideal is a Gröbner basis of it if and only if 0 is a remainder of echo sPolynomial between two polynomials on the basis. The previous `Mathlib/RingTheory/MvPolynomial/Groebner.lean` is moved to `Mathlib/RingTheory/MvPolynomial/Groebner/Division.lean`, and used by `Mathlib/RingTheory/MvPolynomial/Groebner/Remainder.lean` for the proof of remainder's existence. The PR is upstreamized from https://github.com/WuProver/groebner_proj. Co-authored-by: Hao Shen [3118181069@qq.com](mailto:3118181069@qq.com) --- CC @tsuki8 TODO / WIP: - [x] clean up some proofs - [x] split lemmas - [x] squeeze Non-terminal `simp`s - [x] add comments to explain the proof of Buchberger Criterion. - [x] refactor something with `WithBot (σ →₀ ℕ)` variant of `MonomialOrder.degree` (`MonomialOrder.withBotDegree`, #34759). - [x] refactor to use namespaces `MonomialOrder.{IsGroebnerBasis,IsRemainder}` instead of `*_of_{isGroebnerBasis,isRemainder}` in theorem names. - [ ] reduced Groebner Basis (done, not yet submitted) - [x] refactor to avoid too many `IsUnit` or `nonZeroDivisors` - [x] split `IsRemainder` and `IsGroebnerBasis` - [ ] embedding of monomial order (done, not yet submitted), and properties about it and Groebner basis. - [ ] some theorems can be generalized to avoid requiring `IsUnit` Dependencies: - [x] depends on: #26039 - [ ] depends on: #34759 S-polynomial and other lemmas in other files are split from this PR, leaving only changes of `Mathlib/RingTheory/MvPolynomial/Groebner{.lean,/*.lean}` in this PR. The following are PRs split from this PR. - [x] depends on: #32336 - [x] depends on: #32344 - [x] depends on: #32780 - [x] depends on: #32787 - [x] depends on: #32788 - [x] depends on: #32801 - [x] depends on: #32876 - [x] depends on: #32877 - [ ] depends on: #34873 [](https://gitpod.io/from-referrer/) | t-ring-theory large-import blocked-by-other-PR WIP merge-conflict | 2126/263 | Mathlib.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Combinatorics/Matroid/Closure.lean,Mathlib/Combinatorics/Nullstellensatz.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/Logic/Basic.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean,Mathlib/RingTheory/MvPolynomial/Groebner/Division.lean,Mathlib/RingTheory/MvPolynomial/Groebner/Groebner.lean,Mathlib/RingTheory/MvPolynomial/Groebner/Remainder.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean,docs/references.bib | 13 | 21 | ['Hagb', 'SnirBroshi', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | alreadydone and erdOne | 2 months ago | 132 days ago | 3 days |
| 34873 | Hagb | feat(RingTheory/MvPolynomial/Groebner/Remainder): polynomial remainder used with Gröbner basis | Definition and properties of remainder on division of a multivariate polynomial by a set of multivariate polynomials. Some lemmas are for formalization of properties of Gröbner basis. The previous `Mathlib/RingTheory/MvPolynomial/Groebner.lean` is moved to `Mathlib/RingTheory/MvPolynomial/Groebner/Division.lean`, and used by `Mathlib/RingTheory/MvPolynomial/Groebner/Remainder.lean` for the proof of remainder's existence. The PR is upstreamized from https://github.com/WuProver/groebner_proj. Co-authored-by: Hao Shen [3118181069@qq.com](mailto:3118181069@qq.com) --- CC @tsuki8 - [ ] depends on: #34759 - [ ] depends on: #34872 todo: - [ ] some theorems can be generalized to avoid requiring `IsUnit` [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-ring-theory WIP merge-conflict | 1324/262 | Mathlib.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Combinatorics/Matroid/Closure.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/Logic/Basic.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean,Mathlib/RingTheory/MvPolynomial/Groebner/Division.lean,Mathlib/RingTheory/MvPolynomial/Groebner/Remainder.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean,docs/references.bib | 11 | 4 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 85 days ago | 7 minutes |
| 12933 | grunweg | chore: replace some use of > or ≥ by < or ≤ | These were flagged by the linter in #12879: it is easy to simple avoid > or ≥ in hypotheses or `have`s. --- - [x] depends on: #35346 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 123/123 | Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2019Q4.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Star/CHSH.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/Normed/Group/ControlledClosure.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Nat/Dist.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/UInt.lean,Mathlib/GroupTheory/Coxeter/Length.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean,Mathlib/MeasureTheory/Integral/Layercake.lean,Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Rayleigh.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/Tactic/CancelDenoms/Core.lean,Mathlib/Tactic/IntervalCases.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/NormNum/GCD.lean,Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Topology/Category/Profinite/Nobeling.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/Sequences.lean,test/LibrarySearch/basic.lean,test/Use.lean,test/cancel_denoms.lean,test/linarith.lean,test/norm_cast.lean | 64 | 7 | ['YaelDillies', 'github-actions', 'grunweg', 'mathlib-dependent-issues'] | nobody | 2 months ago | 715 days ago | 15 hours |
| 33746 | ster-oc | feat(Algebra/Module/ZLattice): align `ZSpan.floor` to `Int.floor` API | This PR adds some of the existent lemmas about `Int.floor`, `Int.ceil` and `Int.fract` to the `ZSpan` namespace. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor merge-conflict | 353/145 | Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 3 | 8 | ['github-actions', 'joelriou', 'mathlib-merge-conflicts', 'ster-oc'] | joelriou | 2 months ago | 67 days ago | 30 days |
| 31580 | grunweg | feat: towards `ContMDiff` support in fun_prop | Create a `find_model` tactic for solving `ModelWithCorners k E H` goals, and a #find_model command to simplify testing it. (Both implementations are a bit hacky right now.) next step: extend the tactic, test that it works well then try to hook it up to fun_prop --- - [ ] depends on: #30463 [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry merge-conflict t-meta | 1254/64 | Mathlib/Geometry/Manifold/Instances/UnitsOfNormedAlgebra.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/Geometry/Manifold/TestFunPropM.lean,MathlibTest/DifferentialGeometry/Notation.lean,MathlibTest/DifferentialGeometry/NotationAdvanced.lean,mathlib-immersions | 6 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 169 days ago | 1 second |
| 35671 | CoolRmal | feat: APIs for semifinite measures | This PR introduces the definition of a semifinite measure. The main theorems shown in this file are: - Sigma finite measures are semifinite. - `measure_eq_zero_of_measure_inter_finite_eq_zero`: Let `s` be a measurable set such that its intersection with any set of finite measure is null. Then `s` is null. Consequently, in order to check whether a proposition holds almost everywhere, it suffices to check it holds almost everywhere in every set with finite measure. - A measure is semifinite iff it equals to its semifinite part. --- [](https://gitpod.io/from-referrer/) | WIP t-measure-probability | 107/0 | Mathlib/MeasureTheory/Measure/Typeclasses/Semifinite.lean | 1 | 4 | ['CoolRmal', 'RemyDegenne', 'github-actions'] | nobody | 2 months ago | 67 days ago | 14 seconds |
| 31766 | SuccessMoses | feat(Topology/EMetricSpace): continuity of arc length | fixes half of #31751 --- [](https://gitpod.io/from-referrer/) | new-contributor t-topology awaiting-author merge-conflict | 396/0 | Mathlib.lean,Mathlib/Topology/EMetricSpace/ArcLength.lean,Mathlib/Topology/EMetricSpace/BoundedVariation.lean | 3 | 40 | ['SnirBroshi', 'SuccessMoses', 'alreadydone', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 142 days ago | 2 days |
| 29776 | yuanyi-350 | chore: refactor `ContinuousLinearMap.isOpenMap` by separating it into sublemmas | The open mapping theorem in mathlib proves A ⇒ C by first proving A ⇒ B and then B ⇒ C in one theorem. In my PR, I separated it into two theorems: A ⇒ B and B ⇒ C. And now B ⇒ C is more general, with weaker assumptions than A ⇒ C. The [open mapping theorem](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Normed/Operator/Banach.html#ContinuousLinearMap.isOpenMap) in mathlib need `f` to be surjective. However, this can be weakened to the condition `h : ∃ (n : ℕ) (x : _), x ∈ interior (closure (f '' ball 0 n))` . I need this stronger formulation to prove the closed range theorem c.f. *Rudin Functional Analysis Thm 4.13* [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/refactor.20.60ContinuousLinearMap.2EisOpenMap.60) --- [](https://gitpod.io/from-referrer/) | WIP t-analysis | 53/33 | Mathlib/Analysis/Normed/Operator/Banach.lean | 1 | 17 | ['faenuccio', 'github-actions', 'kckennylau', 'leanprover-bot', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'themathqueen', 'yuanyi-350'] | faenuccio | 2 months ago | 222 days ago | 2 days |
| 35494 | Timeroot | feat(Topology/Perfect): simp frontier_singleton | Add simp lemma ``` theorem frontier_singleton {X : Type*} [TopologicalSpace X] [T1Space X] [PerfectSpace X] (p : X) : frontier {p} = {p} ``` --- [](https://gitpod.io/from-referrer/) | t-topology awaiting-author | 4/0 | Mathlib/Topology/Perfect.lean | 1 | 4 | ['Timeroot', 'github-actions', 'urkud', 'vihdzp'] | urkud | 2 months ago | 66 days ago | 5 days |
| 26479 | thefundamentaltheor3m | feat(Analysis/Complex/CauchyIntegral): Cauchy–Goursat for Unbounded Rectangles | In this PR, we prove versions of the Cauchy-Goursat theorem where the contours in question are rectangular and unbounded (ie, where the contours look like the $\bigsqcup$ symbol). I am not sure if I have formalised these in the best way, or if `Analysis.Complex.CauchyIntegral` is the best place for them (it might be prudent to reorganise the file into multiple files at some point), but I believe this is a useful result. Suggestions welcome. --- [](https://gitpod.io/from-referrer/) | new-contributor t-analysis sphere-packing awaiting-author | 205/0 | Mathlib/Analysis/Complex/CauchyIntegral.lean | 1 | 6 | ['github-actions', 'j-loreaux', 'loefflerd', 'mathlib4-merge-conflict-bot', 'thefundamentaltheor3m', 'wwylele'] | urkud | 2 months ago | 65 days ago | 34 days |
| 33247 | sun123zxy | feat(Mathlib/RingTheory/Ideal/Cotangent): dimension of cotangent spaces | It is shown that the span rank of the maximal ideal of a local ring equals the dimension of the cotangent space if the maximal ideal is finitely generated. To avoid unnecessary imports, the original `Mathlib/RingTheory/Nakayama` is now moved to `Mathlib/RingTheory/Nakayama/Basic`. --- - [ ] depends on: #33359 - [ ] depends on: #33361 - [ ] depends on: #35651 [](https://gitpod.io/from-referrer/) | file-removed new-contributor t-ring-theory WIP blocked-by-other-PR merge-conflict | 140/27 | Mathlib.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/LocalRing/Module.lean,Mathlib/RingTheory/LocalRing/Quotient.lean,Mathlib/RingTheory/Nakayama/Basic.lean,Mathlib/RingTheory/Nakayama/SpanRank.lean,Mathlib/RingTheory/Regular/RegularSequence.lean,Mathlib/RingTheory/Support.lean | 10 | 13 | ['erdOne', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sun123zxy'] | nobody | 2 months ago | 124 days ago | 3 days |
| 35735 | mkaratarakis | feat(NumberTheory): analytical properties and lower bounds for Gelfond-Schneider auxiliary function | This PR is the third component in the formalization of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem). It connects the algebraically constructed auxiliary function `R(x)` to its analytical properties, establishing the exact order of vanishing and the fundamental lower bound on the norm of its non-zero derivative evaluation. Following the argument in Loo-Keng Hua's *Introduction to Number Theory* (Chapter 17.9, equations (4) and (5)), we define the minimal non-vanishing derivative order $r$ and scale the evaluation to an algebraic integer to compute its norm. 1. (`iteratedkDeriv_R_eq_zero` & `order_geq_n`): We verify that the coefficient vector $\eta$ (chosen via Siegel's lemma in the previous PR) forces the first $n$ derivatives of the auxiliary function $R(x)$ to vanish at the points $x \in \{1, 2, \dots, m\}$. Consequently, the analytical order of $R(x)$ at these points is at least $n$. 2. We extract $r$, the exact minimal order of vanishing of $R(x)$ among all points $1 \le l \le m$, and prove that $n \le r$. 3. We define the non-zero algebraic number $\rho = (\log \alpha)^{-r} R^{(r)}(l_0)$. 4. We prove the crucial textbook step that scaling $\rho$ by $c_1^{r+2mq}$ (formalized here as `cρ`) results in an algebraic integer in $\mathcal{O}_K$. 5. Because $c_1^{r+2mq} \rho$ is a non-zero algebraic integer, the absolute value of its norm is at least $1$. We use this to formally prove the strict lower bound on the absolute norm of the unscaled $\rho$: $|N(\rho)| > c_1^{-h(r+2mq)} > c_5^{-r}$. --- - [ ] depends on: #35734 [optional extra text] [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor blocked-by-other-PR | 1141/0 | Mathlib.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlgSetup.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainOrder.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 months ago | 65 days ago | 7 minutes |
| 35743 | mkaratarakis | feat(NumberTheory): non-vanishing derivative and norm lower bounds for Gelfond-Schneider | This PR continues the formalization of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem). It establishes the critical algebraic foundation for the lower bound of the auxiliary function's evaluation by isolating its first non-vanishing derivative and proving its scaled norm is strictly bounded below. Following the contradiction argument in Loo-Keng Hua's *Introduction to Number Theory* (Chapter 17.9), we verify that the evaluation at the minimal non-vanishing order $r$ yields a strictly non-zero algebraic integer when appropriately scaled. 1) Confirms that the $r$-th derivative of the auxiliary function $R(x)$ at $l_0 + 1$ is strictly non-zero, and formally translates this into the non-zero algebraic element $\rho$. 2) Formalizes the crucial algebraic step that scaling the evaluated system coefficients by $c_1^{r+2mq}$ (formalized as `cρ`) clears all denominators, resulting in a strictly non-zero algebraic integer within $\mathcal{O}_K$. 3) Concludes that because the scaled $\rho$ is a non-zero algebraic integer, its absolute norm is strictly bounded below by 1. This formalizes the core Diophantine principle that non-zero integers cannot be arbitrarily small, establishing the algebraic foundation required to oppose the complex analytic upper bound in the final contradiction step. --- - [ ] depends on: #35735 [](https://gitpod.io/from-referrer/) | t-number-theory blocked-by-other-PR | 1650/0 | Mathlib.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlgSetup.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAnalytic.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainOrder.lean | 5 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 months ago | 65 days ago | 2 minutes |
| 25834 | Rida-Hamadani | feat(SimpleGraph): girth-diameter inequality | This is a useful inequality that comes up in proofs related to Moore graphs, cages, SRGs, and so on. --- - [x] depends on: #26380 - [x] depends on: #25650 - [x] depends on: #26614 - [x] depends on: #33249 - [ ] depends on: #33506 - [ ] depends on: #35296 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 31/6 | Mathlib/Combinatorics/SimpleGraph/Girth.lean | 1 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | 322 days ago | 28 seconds |
| 33543 | JovanGerb | feat: use `to_dual` for `HeytingAlgebra` | This PR adds `to_dual` for `HeytingAlgebra`, `BiheytingAlgebra`, `GeneralizedHeytingAlgebra`. I am a bit worried about the fact that the complement operation is self-dual in a `BooleanAlgebra`, because that means that, depending on the context, `compl` needs to be translated to `hnot` or `compl`. So if we want to dualize lemmas about `BooleanAlgebra` and `compl`, we will not be able to. But I hope that the number of such lemmas is small and that they aren't often used in places that can get a `to_dual` tag (e.g. when specialized to sets, they don't need a `to_dual` tag). Aligning the `Heyting` and `Coheyting` API is kind of awkward, because they are unfortunately quite different. One reason is that the arguments of `sup`/`inf` are often swapped in the dual version, which is not compatible with `to_dual`. I've worked around this with extensive use of `to_dual none`. There are quite some lemmas that in my eyes seem unnecessary, such as `le_sup_sdiff_sup_sdiff`, but I haven't removed any in this PR. --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 195/371 | Mathlib/Combinatorics/SetFamily/Kleitman.lean,Mathlib/Order/Basic.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/Disjoint.lean,Mathlib/Order/Heyting/Basic.lean,Mathlib/Order/Notation.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/Tactic/Translate/ToDual.lean | 8 | 13 | ['JovanGerb', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp'] | bryangingechen and mattrobball | 2 months ago | 69 days ago | 17 days |
| 35686 | harahu | chore: run docstrings through mdformat | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 10872/6465 | Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Spectrum/Quasispectrum.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Azumaya/Basic.lean,Mathlib/Algebra/Azumaya/Defs.lean,Mathlib/Algebra/Azumaya/Matrix.lean,Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Gaps.lean,Mathlib/Algebra/BigOperators/Group/Finset/Indicator.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/BrauerGroup/Defs.lean,Mathlib/Algebra/Category/ContinuousCohomology/Basic.lean,Mathlib/Algebra/Category/FGModuleCat/Limits.lean,Mathlib/Algebra/Category/Grp/AB.lean,Mathlib/Algebra/Category/Grp/Basic.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/Grp/EquivalenceGroupAddGroup.lean,Mathlib/Algebra/Category/Grp/Limits.lean,Mathlib/Algebra/Category/Grp/Ulift.lean,Mathlib/Algebra/Category/ModuleCat/AB.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Free.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Projective.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Stalk.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Basic.lean,Mathlib/Algebra/Category/MonCat/Basic.lean,Mathlib/Algebra/Category/MonCat/Colimits.lean,Mathlib/Algebra/Category/Ring/Adjunctions.lean,Mathlib/Algebra/Category/Ring/Basic.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/Category/Ring/Epi.lean,Mathlib/Algebra/Category/Ring/Topology.lean,Mathlib/Algebra/Category/Semigrp/Basic.lean,Mathlib/Algebra/Central/Basic.lean,Mathlib/Algebra/Central/Defs.lean,Mathlib/Algebra/Central/TensorProduct.lean,Mathlib/Algebra/CharP/Algebra.lean,Mathlib/Algebra/CharP/Basic.lean,Mathlib/Algebra/CharP/CharAndCard.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/CharP/LinearMaps.lean,Mathlib/Algebra/CharP/MixedCharZero.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/CharZero/Defs.lean,Mathlib/Algebra/ContinuedFractions/Basic.lean,Mathlib/Algebra/ContinuedFractions/Computation/Basic.lean,Mathlib/Algebra/ContinuedFractions/Computation/CorrectnessTerminating.lean,Mathlib/Algebra/ContinuedFractions/Computation/TerminatesIffRat.lean,Mathlib/Algebra/ContinuedFractions/Computation/Translations.lean,Mathlib/Algebra/ContinuedFractions/ContinuantsRecurrence.lean,Mathlib/Algebra/ContinuedFractions/ConvergentsEquiv.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/DirectSum/Finsupp.lean,Mathlib/Algebra/DirectSum/Idempotents.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/Divisibility/Basic.lean,Mathlib/Algebra/Divisibility/Units.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/EuclideanDomain/Field.lean,Mathlib/Algebra/EuclideanDomain/Int.lean,Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Field/Periodic.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Field/Subfield/Defs.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/FreeNonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/GCDMonoid/Nat.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Action/End.lean,Mathlib/Algebra/Group/Action/Pretransitive.lean,Mathlib/Algebra/Group/Action/Prod.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Group/Center.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Equiv/Basic.lean,Mathlib/Algebra/Group/Equiv/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Finsupp.lean,Mathlib/Algebra/Group/ForwardDiff.lean,Mathlib/Algebra/Group/Hom/CompTypeclasses.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Group/Hom/Instances.lean | 2727 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | unknown | 0 seconds |
| 20238 | maemre | feat(Computability/DFA): Closure of regular languages under some set operations | This shows that regular languages are closed under complement and intersection by constructing DFAs for them. --- Closure under all other operations will be proved when someone adds the proof for DFA<->regular expression equivalence, so they are not part of this PR. [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 159/0 | Mathlib/Computability/DFA.lean,Mathlib/Computability/Language.lean | 2 | 60 | ['EtienneC30', 'YaelDillies', 'github-actions', 'maemre', 'mathlib4-merge-conflict-bot', 'meithecatte', 'urkud'] | nobody | 2 months ago | 410 days ago | 48 days |
| 22361 | rudynicolop | feat(Computability/NFA): nfa closure properties | Add the closure properties union, intersection and reversal for NFA. --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 218/2 | Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean | 2 | 91 | ['EtienneC30', 'b-mehta', 'ctchou', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 2 months ago | 361 days ago | 39 days |
| 32825 | erdOne | perf(RingTheory): `attribute [irreducible] KaehlerDifferential` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-ring-theory | 5/1 | Mathlib/Algebra/Category/ModuleCat/Differentials/Basic.lean,Mathlib/AlgebraicGeometry/Morphisms/FormallyUnramified.lean,Mathlib/RingTheory/Kaehler/Basic.lean | 3 | 7 | ['erdOne', 'github-actions', 'jcommelin', 'leanprover-radar', 'robin-carlier'] | nobody | 2 months ago | 105 days ago | 1 day |
| 35746 | ThomasMoulin-hub | feat (Algebra/Endomorphisms): add kernels lemma from the missing undergraduate mathematics in mathlib | Add helper theorem inside Mathlib.Algebra.Polynomial.Smeval.lean and created a new file Mathlib/RingTheory/Polynomial/KernelDecomposition.lean that implements the kernels lemma from the missing undergraduate mathematics in mathlib list. This file also contains intermediate results needed for the main lemma. | new-contributor | 75/0 | Mathlib/Algebra/Polynomial/Smeval.lean,Mathlib/RingTheory/Polynomial/Basic.lean | 2 | 2 | ['github-actions'] | nobody | 2 months ago | unknown | 0 seconds |
| 35825 | mattrobball | chore: unbundle `ENormed*` from algebra | This is a test PR. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 3609/2536 | .claude/worktrees/snazzy-waddling-crescent,Archive/Hairer.lean,Archive/Imo/Imo2001Q5.lean,Archive/Imo/Imo2019Q2.lean,Archive/Wiedijk100Theorems/HeronsFormula.lean,CLAUDE.md,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Module/ZLattice/Summable.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/CPolynomial.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/ConvergenceRadius.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Analytic/Linear.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Analytic/Polynomial.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Analytic/WithLp.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Completion.lean,Mathlib/Analysis/Asymptotics/Defs.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoundedVariation.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/BoxIntegral/Integrability.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Measure.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousLinearMap.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Defs.lean,Mathlib/Analysis/Calculus/AddTorsor/AffineMap.lean,Mathlib/Analysis/Calculus/AddTorsor/Coord.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/BumpFunction/Convolution.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/BumpFunction/Normed.lean,Mathlib/Analysis/Calculus/BumpFunction/SmoothApprox.lean,Mathlib/Analysis/Calculus/Conformal/InnerProduct.lean,Mathlib/Analysis/Calculus/Conformal/NormedSpace.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/CPolynomial.lean,Mathlib/Analysis/Calculus/ContDiff/Comp.lean,Mathlib/Analysis/Calculus/ContDiff/Convolution.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/Deriv.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Analysis/Calculus/ContDiff/RestrictScalars.lean,Mathlib/Analysis/Calculus/ContDiff/WithLp.lean,Mathlib/Analysis/Calculus/ContDiffHolder/Pointwise.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/CompMul.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Inverse.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/MeanValue.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Shift.lean,Mathlib/Analysis/Calculus/Deriv/Slope.lean,Mathlib/Analysis/Calculus/Deriv/Star.lean,Mathlib/Analysis/Calculus/Deriv/Support.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Calculus/DiffContOnCl.lean,Mathlib/Analysis/Calculus/DifferentialForm/Basic.lean,Mathlib/Analysis/Calculus/DifferentialForm/VectorField.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Affine.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Bilinear.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/CompCLM.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousMultilinearMap.lean | 687 | 5 | ['leanprover-radar', 'mathlib-bors', 'mattrobball'] | nobody | 2 months ago | 63 days ago | 11 seconds |
| 34932 | erdOne | feat(AlgebraicGeometry): formally etale morphisms | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry merge-conflict delegated | 163/12 | Mathlib.lean,Mathlib/AlgebraicGeometry/Morphisms/Etale.lean,Mathlib/AlgebraicGeometry/Morphisms/FormallyEtale.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/RingTheory/RingHom/Etale.lean | 5 | 17 | ['chrisflav', 'erdOne', 'github-actions', 'joneugster', 'mathlib-bors', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 2 months ago | 65 days ago | 11 days |
| 23929 | meithecatte | feat(Computability/NFA): improve bound on pumping lemma | --- - [x] depends on: #25321 [](https://gitpod.io/from-referrer/) | t-computability awaiting-zulip new-contributor awaiting-author | 101/10 | Mathlib/Computability/EpsilonNFA.lean,Mathlib/Computability/NFA.lean | 2 | 42 | ['YaelDillies', 'dagurtomas', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'meithecatte'] | nobody | 2 months ago | 327 days ago | 34 days |
| 35128 | DAE123456 | feat : Define anti_pascal | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 81/0 | Archive.lean,Archive/Imo/Imo2018Q3.lean | 2 | 5 | ['DAE123456', 'github-actions', 'grunweg', 'vihdzp'] | nobody | 2 months ago | 79 days ago | 8 minutes |
| 35863 | CBirkbeck | Nagell lutz | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 2005/234 | Mathlib.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/ZSMul.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 7 | 0 | [] | nobody | 2 months ago | unknown | 0 seconds |
| 8102 | miguelmarco | feat(Tactic): add `unify_denoms` and `collect_signs` tactics | This PR adds four new tactics: - `unify_denoms` tries to put expressions with several divisions in a form with only one division. In the case of fields, it works similarly to `field_simp`, but if the hypothesis about denominators being nonzero are not present, it assumes them, and leaves them as new goals to prove. In that sense, it is an "unsafe" tactic (but can be useful nevertheless, for example when you can't find which exact hypothesis is missing). It also works with expressions of naturals and Euclidean domains, assuming the corresponding hypothesis about the denominators dividing the numerators. - `unify_denoms!` extends `unify_denoms` to work with (in)equalities, assuming also that the denominators, once in normal form, are positive. - `collect_signs` works similarly with expressions using sums and substractions: it tries to put them in a form of one sum minus other sum. In the case of working with naturals, it assumes that we never substract a bigger number from a smaller one. Both are implemented essentially as a macro that combines several rewriting rules. Some new lemmas with the corresponding rules are added. --- | please-adopt new-contributor merge-conflict modifies-tactic-syntax good first issue t-meta | 407/0 | Mathlib.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CollectSigns.lean,Mathlib/Tactic/UnifyDenoms.lean,MathlibTest/unify_denoms.lean,scripts/noshake.json | 7 | 55 | ['Paul-Lez', 'YaelDillies', 'github-actions', 'joneugster', 'kbuzzard', 'mathlib4-merge-conflict-bot', 'miguelmarco'] | nobody | 2 months ago | 352 days ago | 17 days |
| 35603 | 2500223210-max | feat(GroupTheory/Frattini): add more theorems | Add some contents about frattini subgroup into Mathlib GroupTheory Frattini.lean,including * (convenient lemma)A subgroup contained in all maximal subgroup is contained in the FRattini subgroup * A subgroup (say H) has a proper complement (meaning for some proper subgroup K, K and H generate the whole group)if and only if it is not contained in the Frattini subgroup. * A group is cyclic iff its Frattini factor(the quotient group wrt Frattini subgroup) is cyclic. * The Frattini factor of a finite p-group is elementary abelian(that is,an abelian group G with Gᵖ={1}) * A finite p-group has trivial Frattini subgroup iff the group is elementary abelian. * Burnside theorem of Frattini factor of finite p-group. --- | new-contributor t-group-theory large-import awaiting-author | 764/1 | Mathlib/GroupTheory/Frattini.lean | 1 | 3 | ['github-actions', 'tb65536'] | nobody | 2 months ago | 69 days ago | 1 minute |
| 35078 | grunweg | feat: immersed points | Define immersed points of a (differentiable) map between manifolds, and prove that immersed points compose. Future PRs show that `x` is an immersed point of `f` if and only if `f` is an immersion at `x`: thus, proving the composition of immersed points (which follows immediately from the chain rule) implies the composition of immersions (which is not obvious from their definition. From the path towards immersions, embeddings and submanifolds. --- - [x] depends on: #35057 - [x] depends on: #35284 [](https://gitpod.io/from-referrer/) | t-differential-geometry awaiting-author | 171/1 | Mathlib.lean,Mathlib/Analysis/Normed/Module/ContinuousInverse.lean,Mathlib/Geometry/Manifold/ImmersedPoint.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 80 days ago | 6 seconds |
| 33791 | PhoenixIra | feat: Generalization of FixedPointApproximants to CompletePartialOrder | --- This PR provides a generalization of FixedPointApproximants to CompletePartialOrder. Not every theorem can be generalized, as sometimes we require additional conditions (namely `x ≤ f x`) in order to guarantee that the set is directed and thus the supremum is well-defined. This is not necessary in a CompleteLattice. [](https://gitpod.io/from-referrer/) | new-contributor t-order merge-conflict | 223/100 | Mathlib/Order/CompletePartialOrder.lean,Mathlib/SetTheory/Ordinal/FixedPointApproximants.lean | 2 | 21 | ['PhoenixIra', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | PhoenixIra and vihdzp | 2 months ago | 62 days ago | 38 days |
| 35605 | j-loreaux | feat: transfer instances of `ContinuousFunctionalCalculus` to type synonyms with weaker topologies | --- - [ ] depends on: #35551 [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 730/209 | Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Isometric.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Range.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Restrict.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Transfer.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Matrix/HermitianFunctionalCalculus.lean,Mathlib/Analysis/Normed/Algebra/Unitization.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog/Basic.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/ContinuousMap/ContinuousMapZero.lean | 13 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 69 days ago | 6 minutes |
| 25170 | eric-wieser | refactor: make basis computable | I claim that in the long run, `Basis.repr` should be a `DFinsupp` not `Finsupp`, so that it is computable. To make this change incrementally, we can store a `DFinsupp` internally today, and keep `repr` and `ofRepr` working with finsupp. This at least would allow building a large basis object, and then using `repr'` to compute with it. The cost of this intermediate state is a loss of many defeqs. --- - [x] depends on: #25166 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra large-import | 66/21 | Mathlib/LinearAlgebra/Basis/Basic.lean,Mathlib/LinearAlgebra/Basis/Defs.lean,Mathlib/LinearAlgebra/FreeModule/Basic.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | unknown | 0 seconds |
| 34440 | grunweg | feat: linter for name components in uppercase | Per the naming convention, these are errors (unless they are an abbreviation). Mathlib has *many* violations at the moment: for this reason, we add this as an environment linter and automatically add all current exceptions. Once these have been fixed, converting to a syntax linter is desirable. Until then, track the number of such exceptions as technical debt. --- [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/naming.20convention.20linter/with/570617527) Note to self: wait for CI, then do a final nolints update. and try to implement the follow-up soon [](https://gitpod.io/from-referrer/) | t-linter large-import awaiting-author merge-conflict | 1018/9 | Mathlib/Tactic/Linter/Style.lean,MathlibTest/DoubleUnderscore.lean,MathlibTest/HashLint.lean,MathlibTest/Lint.lean,MathlibTest/LintStyle.lean,scripts/nolints.json,scripts/technical-debt-metrics.sh | 7 | 27 | ['Vierkantor', 'github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts'] | joneugster | 2 months ago | 72 days ago | 13 days |
| 34519 | grunweg | feat: environment linter for definitions containing an underscore | This is almost certainly a violation of the naming convention. In the medium-term, this should become a syntax linter: at the moment, there are too many exceptions in mathlib. Making this an environment linter allows auto-generating a list of existing exceptions. We track the number of violations as a technical debt metric. --- TODO: wait for CI to rebuild mathlib, then update nolints locally [Zulip topic](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/naming.20convention.20linter/with/570617527) [](https://gitpod.io/from-referrer/) | t-linter CI large-import awaiting-author merge-conflict | 650/4 | Mathlib/Tactic/Linter/Style.lean,MathlibTest/HashLint.lean,scripts/nolints.json,scripts/technical-debt-metrics.sh | 4 | 28 | ['adomani', 'b-mehta', 'github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts', 'plp127', 'vlad902'] | b-mehta and joneugster | 2 months ago | 93 days ago | 5 hours |
| 33406 | dupuisf | feat: add basics of majorization | This PR defines [majorization](https://en.wikipedia.org/wiki/Majorization). This is needed to develop the theory of unitarily invariant norms on `ℂ^n`, in particular Schatten norms. --- - [ ] depends on: #33394 [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author WIP | 752/13 | Mathlib.lean,Mathlib/Analysis/Convex/Majorization/Basic.lean,Mathlib/Analysis/Convex/Majorization/Defs.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Order/Interval/Finset/Fin.lean,docs/references.bib | 9 | 10 | ['dupuisf', 'github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | j-loreaux | 2 months ago | 65 days ago | 8 days |
| 35734 | mkaratarakis | feat(NumberTheory): matrix bounds and Siegel's lemma application for Gelfond-Schneider | This PR is the second component in the formalization of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem), establishing the transcendence of $\alpha^\beta$. Building on the algebraic setup from the previous PR #35733, this file establishes analytical bounds on the linear system matrix and applies Siegel's Lemma (Lemma 8.2) to extract a bounded, non-trivial integer solution vector. We establish the exact upper bounds required to construct the auxiliary integer function $R(x)$. `c₃` and Matrix Bounds (`house_matrixA_le`)**: We define the bounding constant $c_3$, which aggregates the base bounds $c_2$ and the maximal houses of the algebraic preimages $\alpha', \beta', \gamma'$. Through extensive algebraic manipulation, we formally prove that the house of the entries in our linear system matrix $A$ is strictly bounded by $c_3^n * n^{(n - 1) / 2}$. Using the bounds established above, we apply `house.exists_ne_zero_int_vec_house_le` (a formalization of Lemma 8.2, p. 490) to guarantee the existence of a non-trivial vector of algebraic integers $\eta$ in the kernel of $A$. We define the solution bounding constant $c_4$ and prove the textbook bound that the house of our resulting coefficient vector $\eta$ satisfies $\forall k, \|\eta_k\| \leq c_4^n * n^{(n + 1) / 2}$. - [ ] depends on: #35733 [](https://gitpod.io/from-referrer/) | new-contributor t-number-theory blocked-by-other-PR | 872/5 | Mathlib.lean,Mathlib/NumberTheory/NumberField/House.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlgSetup.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 months ago | 65 days ago | 5 minutes |
| 26013 | tsuki8 | feat(Data/Finset/Card,Data/Set/Finite/Basic): TODO needs a better title | add `card_bijOn` and `finset_subset_preimage_of_finite_image`
Add `card_bijOn`: proves that for a bijection between finsets, their cardinalities are equal
Add `finset_subset_preimage_of_finite_image`: constructs a finset subset preserving image cardinality
Co-authored-by: Junyu Guo |
awaiting-author t-data new-contributor | 15/0 | Mathlib/Data/Finset/Card.lean,Mathlib/Data/Set/Finite/Basic.lean | 2 | 6 | ['Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 304 days ago | 13 days |
| 29624 | mcdoll | feat(LinearAlgebra/LinearPMap): add definition of resolvent and first resolvent identity | --- [](https://gitpod.io/from-referrer/) | t-algebra t-analysis awaiting-author | 189/9 | Mathlib/LinearAlgebra/LinearPMap.lean | 1 | 11 | ['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'mcdoll'] | kim-em | 1 month ago | 156 days ago | 64 days |
| 35964 | b-reinke | feat(CategoryTheory/Linear): define category algebra | WIP definition of the category algebra of a linear category. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory | 171/0 | Mathlib.lean,Mathlib/CategoryTheory/Linear/CategoryAlgebra.lean,Mathlib/Data/DFinsupp/BigOperators.lean | 3 | 2 | ['github-actions'] | nobody | 1 month ago | 60 days ago | 15 seconds |
| 35442 | dhyan-aranha | feat: Affine line with doubled origin counter example | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author t-algebraic-geometry | 305/0 | Counterexamples.lean,Counterexamples/AffineLineWithDoubledOrigin.lean,Mathlib/AlgebraicGeometry/Limits.lean,Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean | 4 | 21 | ['BryceT233', 'chrisflav', 'dhyan-aranha', 'github-actions'] | nobody | 1 month ago | 73 days ago | 1 hour |
| 26942 | pechersky | feat(RingTheory/Valuation/ValueGroupIso): isomorphism of value groups when compatible | and also to the ValuativeRel's value group by request from comment in https://github.com/leanprover-community/mathlib4/pull/26754#issuecomment-3051770901 - [ ] depends on: #26588 --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26939 - [x] depends on: #26940 - [x] depends on: #26941 | merge-conflict t-ring-theory t-order | 299/3 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Algebra/Order/GroupWithZero/Range.lean,Mathlib/Algebra/Order/GroupWithZero/WithZero.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/RingTheory/Valuation/ValueGroupIso.lean | 6 | 10 | ['faenuccio', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'pechersky'] | faenuccio | 1 month ago | 260 days ago | 10 days |
| 25737 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms): Normal forms for `P_δ`s | We prove that admissible lists indeed provide a normal form for morphisms of satisfying `P_δ`. 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 first simplicial identity, composition on the left corresponds to simplicial insertion in the list. This gives existence of a normal form for every morphism satisfying `P_δ`. 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. Part of a series of PR formalising that `SimplexCategoryGenRel` is equivalent to `SimplexCategory`. --- - [x] depends on: #25736 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #21746.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/21746* | t-algebraic-topology delegated t-category-theory | 181/2 | Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean | 1 | 6 | ['github-actions', 'joelriou', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 193 days ago | 6 hours |
| 25740 | robin-carlier | feat(AlgebraicTopology/SimplexCategory/GeneratorsRelations): `SimplexCategoryGenRel.toSimplexCategory` is an equivalence | We use the normal forms for morphisms in `SimplexCategoryGenRel` to prove that `SimplexCategoryGenRel.toSimplexCategory` is an equivalence. We prove in order that there exists unique lifts in `SimplexCategoryGenRel` of mono (resp. epis) in `SimplexCategory`, and use this to deduce fully faithfulness of `SimplexCategoryGenRel.toSimplexCategory` thanks to the existing epi-mono factorisation in `SimplexCategory`. Part of a series of PR formalising that `SimplexCategoryGenRel` is equivalent to `SimplexCategory`. --- - [ ] depends on: #25737 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #21747.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/21747* | t-algebraic-topology blocked-by-other-PR | 555/2 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/Equivalence.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 323 days ago | 2 seconds |
| 15355 | adomani | feat: MiM PR report | --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 193/0 | .github/workflows/monthly_pr_report.yaml,scripts/README.md,scripts/find_labels.sh | 3 | 18 | ['YaelDillies', 'adomani', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | unknown | 0 seconds |
| 22464 | adomani | feat(CI): declarations diff in Lean | Rewrites the `declaration_diff` script in Lean. You can see the effect of the new script in the testing branch #22497. The new CI step runs in approximately 5mins, but is separate from the `build` step. --- [](https://gitpod.io/from-referrer/) | awaiting-author CI merge-conflict | 151/0 | .github/workflows/PR_summary_lean.yml,scripts/README.md,scripts/declarations_diff.lean,scripts/declarations_diff_lean_shell_glue.sh | 4 | 8 | ['bryangingechen', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 276 days ago | 146 days |
| 22648 | adomani | test: lean implementation decl diff quandle | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 210/1 | .github/workflows/PR_summary_lean.yml,Mathlib/Algebra/Quandle.lean,scripts/README.md,scripts/declarations_diff.lean,scripts/declarations_diff_lean_shell_glue.sh | 5 | 5 | ['adomani', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 35096 | dagurtomas | chore(CategoryTheory): reduce API duplication for concrete categories | --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 186/1376 | Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/Algebra/Category/CommBialgCat.lean,Mathlib/Algebra/Category/Grp/Adjunctions.lean,Mathlib/Algebra/Category/Grp/Basic.lean,Mathlib/Algebra/Category/Grp/Colimits.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/Grp/Kernels.lean,Mathlib/Algebra/Category/Grp/LeftExactFunctor.lean,Mathlib/Algebra/Category/Grp/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/EpiMono.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Category/ModuleCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Kernels.lean,Mathlib/Algebra/Category/ModuleCat/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Products.lean,Mathlib/Algebra/Category/ModuleCat/Projective.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/Category/MonCat/Adjunctions.lean,Mathlib/Algebra/Category/MonCat/Basic.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/Algebra/Category/MonCat/Limits.lean,Mathlib/Algebra/Category/Ring/Adjunctions.lean,Mathlib/Algebra/Category/Ring/Basic.lean,Mathlib/Algebra/Category/Ring/Colimits.lean,Mathlib/Algebra/Category/Ring/FilteredColimits.lean,Mathlib/Algebra/Category/Ring/FinitePresentation.lean,Mathlib/Algebra/Category/Ring/Instances.lean,Mathlib/Algebra/Category/Ring/Limits.lean,Mathlib/Algebra/Category/Semigrp/Basic.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/Basic.lean,Mathlib/CategoryTheory/ConcreteCategory/Basic.lean,Mathlib/CategoryTheory/Extensive.lean,Mathlib/CategoryTheory/Limits/ConcreteCategory/WithAlgebraicStructures.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Grp_.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Internal/Module.lean,Mathlib/CategoryTheory/Preadditive/Yoneda/Basic.lean,Mathlib/CategoryTheory/SingleObj.lean,Mathlib/Geometry/RingedSpace/PresheafedSpace/HasColimits.lean,Mathlib/Order/Category/BddDistLat.lean,Mathlib/Order/Category/BddLat.lean,Mathlib/Order/Category/BddOrd.lean,Mathlib/Order/Category/BoolAlg.lean,Mathlib/Order/Category/DistLat.lean,Mathlib/Order/Category/FinBddDistLat.lean,Mathlib/Order/Category/Frm.lean,Mathlib/Order/Category/HeytAlg.lean,Mathlib/Order/Category/Lat.lean,Mathlib/Order/Category/LinOrd.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/Category/PartOrdEmb.lean,Mathlib/Order/Category/Preord.lean,Mathlib/Topology/Algebra/Category/ProfiniteGrp/Completion.lean,Mathlib/Topology/Category/Profinite/Basic.lean,Mathlib/Topology/Category/TopCat/Basic.lean,Mathlib/Topology/Category/TopCat/EffectiveEpi.lean,Mathlib/Topology/Category/TopCat/GrothendieckTopology.lean,Mathlib/Topology/Category/TopCat/Limits/Cofiltered.lean,Mathlib/Topology/Category/TopCat/Limits/Konig.lean,Mathlib/Topology/Category/TopCat/Limits/Products.lean,Mathlib/Topology/Category/TopCat/Limits/Pullbacks.lean,Mathlib/Topology/Gluing.lean | 68 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 35766 | DavidLedvinka | feat(Probability): add Monotonicity of setBernoulli on IsUpperSet | merge-conflict | 254/47 | Mathlib.lean,Mathlib/MeasureTheory/Measure/AEMeasurable.lean,Mathlib/MeasureTheory/Measure/AbsolutelyContinuous.lean,Mathlib/MeasureTheory/Measure/Dirac.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Probability.lean,Mathlib/Order/UpperLower/Relative.lean,Mathlib/Probability/Combinatorics/BinomialRandomGraph/Defs.lean,Mathlib/Probability/Distributions/Bernoulli.lean,Mathlib/Probability/Distributions/SetBernoulli.lean,Mathlib/Probability/ProductMeasure.lean,Mathlib/Topology/UnitInterval.lean | 11 | 16 | ['DavidLedvinka', 'b-mehta', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds | |
| 26464 | joelriou | feat(LinearAlgebra): generators of pi tensor products | In this PR, we show that the `R`-module `⨂[R] i, M i` is finitely generated if the index type is finite and all `M i` are finitely generated. This follows from a more precise result about generators of `⨂[R] i, M i`. --- This PR continues the work from #18725. Original PR: https://github.com/leanprover-community/mathlib4/pull/18725 | file-removed awaiting-author t-algebra merge-conflict | 278/7 | Mathlib.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/SubtypeNeLift.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/DFinsupp.lean,Mathlib/LinearAlgebra/PiTensorProduct/DirectSum.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/TensorPower/Basic.lean,Mathlib/LinearAlgebra/TensorPower/Symmetric.lean,Mathlib/RingTheory/PiTensorProduct.lean,Mathlib/SetTheory/Cardinal/Finite.lean | 12 | 33 | ['eric-wieser', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | mattrobball | 1 month ago | 192 days ago | 97 days |
| 26395 | winstonyin | feat: $C^1$ vector fields on compact manifolds define global flows | This PR continues the work from #22254. Original PR: https://github.com/leanprover-community/mathlib4/pull/22254 Any $C^1$ vector field on a compact boundaryless manifold `M` defines a unique global flow `ℝ → M → M`. - [ ] depends on: #26394 --- [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry blocked-by-other-PR | 212/52 | Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/IntegralCurve/Compact.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Order/Filter/Prod.lean | 4 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'winstonyin'] | nobody | 1 month ago | 310 days ago | 23 seconds |
| 28286 | bwangpj | feat(Geometry/Manifold/ContMDiff): basic lemmas for analytic (`C^ω`) functions | Add basic lemmas relating `ContMDiff` in the `C^ω` case to being `Analytic` on charts.
This is upstreamed from [https://github.com/girving/ray](https://github.com/girving/ray).
Co-authored-by: Geoffrey Irving |
awaiting-author t-differential-geometry new-contributor | 36/0 | Mathlib/Geometry/Manifold/ContMDiff/Defs.lean | 1 | 14 | ['bwangpj', 'girving', 'github-actions', 'grunweg', 'kbuzzard', 'mathlib-merge-conflicts', 'sgouezel'] | sgouezel | 1 month ago | 234 days ago | 27 days |
| 36099 | SnirBroshi | feat(Combinatorics/SimpleGraph/Sum): `edgeSet` equivalence | --- - [ ] depends on: #34909 [](https://gitpod.io/from-referrer/) | t-combinatorics blocked-by-other-PR | 30/0 | Mathlib/Combinatorics/SimpleGraph/Sum.lean,Mathlib/Data/Sym/Sym2.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 58 days ago | 31 minutes |
| 29425 | pechersky | feat(NumberTheory/Padics/Torsion): `HasEnoughRootsOfUnity ℤ_[p] (p - 1)` | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #29403 - [x] depends on: #29404 - [x] depends on: #29405 - [x] depends on: #29408 - [x] depends on: #29424 - [ ] depends on: #30989 | merge-conflict awaiting-author t-ring-theory | 179/0 | Mathlib.lean,Mathlib/NumberTheory/Padics/Torsion.lean,Mathlib/RingTheory/ZMod/Torsion.lean | 3 | 6 | ['erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'pechersky'] | erdOne | 1 month ago | 167 days ago | 44 days |
| 27980 | smmercuri | feat: dimensions of completions at infinite place extensions | This PR continues the work from #24853. Original PR: https://github.com/leanprover-community/mathlib4/pull/24853 --- - [x] depends on: #27977 - [ ] depends on: #27978 - [x] depends on: #27974 - [x] depends on: #27975 - [ ] depends on: #27976 - [ ] depends on: #29942 - [ ] depends on: #29946 | t-number-theory blocked-by-other-PR large-import merge-conflict FLT | 619/2 | Mathlib.lean,Mathlib/Analysis/Normed/Field/WithAbs.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/NumberTheory/NumberField/Completion.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Dimension.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Ramification.lean | 7 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 269 days ago | 7 minutes |
| 36156 | vihdzp | chore: use `to_additive` for `MulAut` and `AddAut` | We want to use a multiplicative structure on both, so we tag them as `to_additive_dont_translate`. --- [](https://gitpod.io/from-referrer/) | t-group-theory | 45/119 | Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Equiv/Defs.lean | 2 | 1 | ['github-actions'] | nobody | 1 month ago | 57 days ago | 31 minutes |
| 35073 | joelriou | feat(CategoryTheory/Sites): more on Cech cohomology | WIP branch --- - [x] depends on: #35035 - [x] depends on: #35026 - [x] depends on: #35038 - [x] depends on: #35140 [](https://gitpod.io/from-referrer/) | WIP t-category-theory | 646/25 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Limits.lean,Mathlib/AlgebraicTopology/AlternatingFaceMapComplex.lean,Mathlib/AlgebraicTopology/ExtraDegeneracy.lean,Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/CategoryTheory/Comma/Arrow.lean,Mathlib/CategoryTheory/Limits/FormalCoproducts/Basic.lean,Mathlib/CategoryTheory/Limits/FormalCoproducts/Cech.lean,Mathlib/CategoryTheory/Limits/FormalCoproducts/EvalOpAddCommGrpCat.lean,Mathlib/CategoryTheory/Limits/FormalCoproducts/Misc.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/CechAddCommGrpCat.lean,Mathlib/CategoryTheory/Subfunctor/Sieves.lean,Mathlib/Topology/Sheaves/Cech/AddCommGrpCat.lean | 13 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 80 days ago | 2 seconds |
| 36203 | mattrobball | chore(Order.WithBotTop): make `coe` an `abbrev` | Currently `WithBotTop.coe` is a `def` when the whole type is an `abbrev`. This blocks reduction unnecessarily so we make `coe` an `abbrev`. --- [](https://gitpod.io/from-referrer/) | t-order | 1/1 | Mathlib/Order/WithBotTop.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 57 days ago | 7 minutes |
| 35332 | yisiox | feat(Computability): regular expressions match a regular language | This PR adds a proof that the language matched by a regular expression is a regular language. This is achieved by the following constructions and proofs of their correctness - A DFA `epsilon` which accepts the empty language - A DFA `char (a : α)` which accepts the language containing only a single symbol - An Epsilon-NFA `concat (M₁ : εNFA α σ₁) (M₂ : εNFA α σ₂)` which accepts the concatenation of the languages of two Epsilon-NFAs - An Epsilon-NFA `kstar (M : εNFA α σ)` which accepts the Kleene star of a language of an Epsilon-NFA The following theorems on closure are added - `IsRegular.zero` - `IsRegular.one` - `IsRegular.top` - `IsRegular.singleton` - `IsRegular.mul` - `IsRegular.kstar` which demonstrates - `IsRegular.matches` --- [](https://gitpod.io/from-referrer/) | t-computability new-contributor | 475/0 | Mathlib/Computability/DFA.lean,Mathlib/Computability/EpsilonNFA.lean | 2 | 2 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 29354 | themathqueen | refactor(Algebra/Algebra/Equiv): allow for non-unital `AlgEquiv` | This refactors `AlgEquiv` to allow for non-unital algebras. More specifically, we weaken the type class assumptions from:
```lean
structure AlgEquiv (R A B : Type*) [CommSemiring R] [Semiring A] [Semiring B]
[Algebra R A] [Algebra R B]
```
to
```lean
structure AlgEquiv (R A B : Type*) [Add A] [Add B] [Mul A] [Mul B] [SMul R A] [SMul R B]
```
Instead of a `commutes'` field, we now have a `map_smul'` field. We also include a definition `AlgEquiv.ofCommutes` which takes in a `RingEquiv` and a `commutes'` field to match before and for convenience.
`StarAlgEquiv` now extends `AlgEquiv`. We also generalize a few files to allow for non-unital.
I suspect there are a few more things to generalize, but will leave this for later.
Co-authored-by: Jireh Loreaux |
t-algebra awaiting-author merge-conflict | 703/595 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Opposite.lean,Mathlib/Algebra/Algebra/Pi.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/MulOpposite.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/Algebra/Category/CommAlgCat/FiniteType.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/DualQuaternion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/ToDirectSum.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Taylor.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/SkewMonoidAlgebra/Lift.lean,Mathlib/Algebra/Star/Free.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/UnitaryStarAlgAut.lean,Mathlib/AlgebraicGeometry/Normalization.lean,Mathlib/AlgebraicGeometry/Stalk.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/Normed/Algebra/GelfandFormula.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Algebra/UnitizationL1.lean,Mathlib/Analysis/Normed/Lp/LpEquiv.lean,Mathlib/Analysis/Normed/Lp/Matrix.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Data/Matrix/Basic.lean,Mathlib/Data/Matrix/Composition.lean,Mathlib/Data/Matrix/DualNumber.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/Notation.lean,Mathlib/FieldTheory/Galois/Profinite.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Algebra.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean,Mathlib/FieldTheory/IntermediateField/Basic.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/FieldTheory/Normal/Basic.lean,Mathlib/FieldTheory/PrimitiveElement.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/FieldTheory/Separable.lean,Mathlib/LinearAlgebra/CliffordAlgebra/BaseChange.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Conjugation.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/LinearAlgebra/FreeAlgebra.lean,Mathlib/LinearAlgebra/Matrix/Basis.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/LinearMap.lean,Mathlib/LinearAlgebra/Matrix/Reindex.lean,Mathlib/LinearAlgebra/Matrix/ToLin.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean,Mathlib/LinearAlgebra/Matrix/Unique.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean,Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean,Mathlib/LinearAlgebra/Trace.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Ideal.lean,Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean,Mathlib/NumberTheory/NumberField/Ideal/KummerDedekind.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Algebraic/MvPolynomial.lean,Mathlib/RingTheory/Artinian/Module.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Congruence/Hom.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/Etale/Field.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Etale/StandardEtale.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Finiteness/Descent.lean,Mathlib/RingTheory/Flat/Equalizer.lean,Mathlib/RingTheory/FractionalIdeal/Operations.lean,Mathlib/RingTheory/Frobenius.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IntegralClosure/IntegrallyClosed.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Invariant/Profinite.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/Kaehler/Basic.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Localization/Away/AdjoinRoot.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 130 | 69 | ['fpvandoorn', 'github-actions', 'jcommelin', 'leanprover-bot', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'themathqueen'] | joelriou | 1 month ago | 156 days ago | 66 days |
| 30408 | kckennylau | feat(RingTheory): more algebra instances for HomogeneousLocalization and linear constructors | This PR introduces the instance `Algebra R₀ (HomogeneousLocalization 𝒜 x)` as well as two linear constructors `mkₗ` and `Away.mkₗ` that fix the denominator. Zulip discussion: [#mathlib4 > Some algebra instance for graded algebra and homog loc](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Some.20algebra.20instance.20for.20graded.20algebra.20and.20homog.20loc/with/544178649) --- Split from #26061. [](https://gitpod.io/from-referrer/) | t-ring-theory merge-conflict | 65/20 | Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean | 1 | 6 | ['github-actions', 'mariainesdff', 'mathlib-merge-conflicts'] | mariainesdff | 1 month ago | 181 days ago | 17 days |
| 30431 | kckennylau | feat(RingTheory): a homogeneous submodule is the span of its homogeneous elements | --- [](https://gitpod.io/from-referrer/) | t-ring-theory merge-conflict | 22/0 | Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean | 2 | 9 | ['alreadydone', 'github-actions', 'kckennylau', 'mariainesdff', 'mathlib-merge-conflicts'] | mariainesdff | 1 month ago | 178 days ago | 23 days |
| 33808 | seewoo5 | feat(Manifold/MFDeriv): add fun_prop to `MDifferentiable` | --- Add FunProp to `MDifferentiable`. For example, the following works (when `F'` is normed `𝕜`-algebra) ```lean example (hp : MDifferentiable I 𝓘(𝕜, F') p) (hq : MDifferentiable I 𝓘(𝕜, F') q) : MDifferentiable I 𝓘(𝕜, F') ((p * q + p - q) * q * p) := by fun_prop ``` Motivated from [sphere packing project](https://github.com/thefundamentaltheor3m/Sphere-Packing-Lean). [](https://gitpod.io/from-referrer/) | awaiting-author t-differential-geometry merge-conflict | 15/0 | Mathlib/Geometry/Manifold/MFDeriv/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/Defs.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean | 3 | 9 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'seewoo5'] | nobody | 1 month ago | 111 days ago | 12 hours |
| 34484 | grunweg | test: debugging mfderiv_smul erws | Not meant for landing. --- - [ ] depends on: #34262 [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR WIP merge-conflict | 43/0 | Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean | 1 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 94 days ago | 4 minutes |
| 35547 | Ruben-VandeVelde | chore: tidy various files | --- As usual, `simp`s didn't seem slow. [](https://gitpod.io/from-referrer/) | awaiting-author merge-conflict | 83/117 | Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/LinearRecurrence.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean,Mathlib/AlgebraicGeometry/Properties.lean,Mathlib/AlgebraicGeometry/ZariskisMainTheorem.lean,Mathlib/Analysis/Complex/CoveringMap.lean,Mathlib/Analysis/Complex/MeanValue.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/Data/NNReal/Basic.lean,Mathlib/Data/Set/Dissipate.lean,Mathlib/Data/Set/PowersetCard.lean,Mathlib/Geometry/Euclidean/Angle/Bisector.lean,Mathlib/LinearAlgebra/DirectSum/Finsupp.lean,Mathlib/LinearAlgebra/JordanChevalley.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/Measure/SubFinite.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Indexed.lean,Mathlib/Probability/Distributions/Cauchy.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Polynomial/Subring.lean,Mathlib/RingTheory/Smooth/IntegralClosure.lean,Mathlib/RingTheory/UniqueFactorizationDomain/ClassGroup.lean,Mathlib/RingTheory/Unramified/LocalStructure.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Corecursion.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Majorized.lean,Mathlib/Topology/Algebra/IsUniformGroup/Defs.lean,Mathlib/Topology/Algebra/MulAction.lean | 32 | 14 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | 70 days ago | 18 hours |
| 35808 | xroblot | feat(RamificationInertia): splitting in the inertia field | --- - [ ] depends on: #35802 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import t-algebra merge-conflict | 501/12 | Mathlib.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Data/ZMod/QuotientRing.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/HasFiniteQuotients.lean | 8 | 4 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 64 days ago | 41 minutes |
| 35985 | urkud | feat: vector bundle of `ContinuousAlternatingMap`s | --- - [ ] depends on: #35984 - [ ] depends on: #34491 - [ ] depends on: #34513 [](https://gitpod.io/from-referrer/) | merge-conflict | 872/192 | Mathlib/Analysis/Normed/Module/Alternating/Basic.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Normed/Operator/BoundedLinearMaps.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Algebra/Module/Alternating/Topology.lean,Mathlib/Topology/Algebra/Module/Multilinear/Topology.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/VectorBundle/Basic.lean,Mathlib/Topology/VectorBundle/ContinuousAlternatingMap.lean,Mathlib/Topology/VectorBundle/Hom.lean | 10 | 4 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 60 days ago | 1 minute |
| 8479 | alexjbest | feat: use leaff in CI | [Leaff](https://github.com/alexjbest/leaff) is an experimental lean-diff tool, this PR is to experiment with adding it as a CI step. --- I'm not sure yet if it is best to have this always run or only run on request (like bench). If it is always run should it post a comment or simply leave its output it the actions log (maybe as a summary object) the current iteration runs and updates a sticky comment with the latest result [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author | 340/0 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml | 4 | 13 | ['alexjbest', 'fpvandoorn', 'github-actions', 'grunweg', 'kim-em', 'mathlib-bors', 'urkud'] | nobody | 1 month ago | 896 days ago | 26 seconds |
| 13483 | adomani | feat: automatically replace deprecations | This PR introduces `lake exe update_deprecations` that uses the cache to automatically replace deprecated declarations with the corresponding un-deprecated one. The script handles namespacing, replacing a possibly non-fully-qualified, deprecated name with the fully-qualified non-deprecated name. It is also possible to use ```bash lake exe update_deprecations --mods One.Two.Three,Dd.Ee.Ff ``` to limit the scope of the replacements to the modules `One.Two.Three` and `Dd.Ee.Ff`. This is intended to be a first step in automating updates: combining this with a linter that emits appropriate warnings, the functionality of `lake exe update_deprecations` can be extended to perform more complicated updates. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 306/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/UpdateDeprecations.lean,MathlibTest/UpdateDeprecations.lean,lakefile.lean,scripts/README.md,scripts/update_deprecations.lean | 7 | 18 | ['YaelDillies', 'adomani', 'fpvandoorn', 'github-actions', 'j-loreaux', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib-bors', 'sgouezel'] | joneugster | 1 month ago | 536 days ago | 34 days |
| 14313 | grhkm21 | feat(RepresentationTheory/FdRep): FdRep is a full subcategory of Rep | ``` /-- Equivalence between `FDRep` and the full subcategory of finite dimensional `Rep`. -/ def equivFiniteDimensional : FDRep k G ≌ FullSubcategory (fun V : Rep k G ↦ FiniteDimensional k V) ``` | merge-conflict t-algebra t-category-theory new-contributor | 47/8 | Mathlib/RepresentationTheory/FDRep.lean | 1 | 21 | ['fpvandoorn', 'github-actions', 'grhkm21', 'joelriou', 'kim-em', 'mathlib-bors'] | nobody | 1 month ago | 648 days ago | 4 days |
| 14712 | astrainfinita | perf: change instance priority and order about `OfNat` | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 49/20 | Mathlib/Algebra/Group/Nat.lean,Mathlib/Algebra/Group/ZeroOne.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Data/BitVec.lean,Mathlib/Data/Nat/Cast/Defs.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/UInt.lean,Mathlib/NumberTheory/ArithmeticFunction.lean | 9 | 26 | ['MichaelStollBayreuth', 'astrainfinita', 'eric-wieser', 'fpvandoorn', 'github-actions', 'j-loreaux', 'leanprover-bot', 'mathlib-bors'] | nobody | 1 month ago | 631 days ago | 20 days |
| 17627 | hrmacbeth | feat: universal properties of vector bundle constructions | Characterizations for the smoothness of maps into the total spaces of (1) the direct sum of two vector bundles; (2) the pullback of a vector bundle. This gap in the library was exposed by #17358. --- - [x] depends on: #22804 [](https://gitpod.io/from-referrer/) | merge-conflict t-differential-geometry | 311/9 | Mathlib/Data/Bundle.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/Pullback.lean,Mathlib/Topology/FiberBundle/Constructions.lean | 4 | 26 | ['PatrickMassot', 'fpvandoorn', 'github-actions', 'grunweg', 'hrmacbeth', 'j-loreaux', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'sgouezel'] | grunweg | 1 month ago | 316 days ago | 91 days |
| 19275 | eric-wieser | fix: if nolint files change, do a full rebuild | Otherwise CI will succeed when removing entries from the file, but fail later when someone changes something unrelated. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 8/0 | lakefile.lean | 1 | 22 | ['YaelDillies', 'adomani', 'eric-wieser', 'fpvandoorn', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 1 month ago | 527 days ago | 3 minutes |
| 28072 | kckennylau | feat(RingTheory/Valuation): make tactic rw_val_equiv | Co-authored by Aaron Liu and Bhavik Mehta. A tactic to rewrite relations such as `max (v₁ x) (v₁ y) * v₁ z < 1` into `max (v₂ x) (v₂ y) * v₂ z < 1` , given `h : v₁.IsEquiv v₂`. Allowed relations are `≤`, `<`, `=`, `≠`. Allowed operations are: `0`, `1`, `v₁ r`, `⁻¹`, `^` (both `ℕ` and `ℤ`), `*`, `/`, `min`, `max`. Examples: ```lean example {R Γ₁ Γ₂ : Type} [Ring R] [LinearOrderedCommMonoidWithZero Γ₁] [LinearOrderedCommMonoidWithZero Γ₂] {v₁ : Valuation R Γ₁} {v₂ : Valuation R Γ₂} (h : v₁.IsEquiv v₂) {y z : R} : {x | v₁ x ^ 2 * min (v₁ y) (v₁ z) ≤ 1} = {x | v₂ x ^ 2 * min (v₂ y) (v₂ z) ≤ 1} := by rw_val_equiv h ``` It is also possible to use `←` to rewrite in the opposite direction, and to use `at h1 h3 ⊢` to specify which hypotheses (and/or goal) to rewrite, similar to the syntax of `rw`. There is also `rwa_val_equiv` to work like `rwa`. --- Zulip: [#Is there code for X? > Tactics for comparing equivalent valuations](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Tactics.20for.20comparing.20equivalent.20valuations) [](https://gitpod.io/from-referrer/) | awaiting-author t-ring-theory merge-conflict | 525/34 | Mathlib/RingTheory/Valuation/Basic.lean,MathlibTest/Simproc/ValEquiv.lean | 2 | 52 | ['b-mehta', 'erdOne', 'eric-wieser', 'github-actions', 'kckennylau', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'pechersky', 'plp127'] | erdOne | 1 month ago | 167 days ago | 99 days |
| 33592 | nielstron | feat(Computability/ContextFreeGrammar): mapping between two types of nonterminal symbols | This PR picks up https://github.com/leanprover-community/mathlib4/pull/15895 and resolves the failing lemma by redefining Good symbols. --- I checked that https://github.com/leanprover-community/mathlib4/pull/13514 builds correctly when based on this build. PR for that is #33599 This is my first contribution please let me know of any changes I should outline. [](https://gitpod.io/from-referrer/) | awaiting-author t-computability new-contributor | 160/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 34 | ['YaelDillies', 'github-actions', 'madvorak', 'nielstron'] | nobody | 1 month ago | 105 days ago | 10 days |
| 35144 | daniel-carranza | feat(CategoryTheory/Enriched): tensor product of enriched categories | For a braided monoidal category `V`, defines the tensor product of `V`-categories `C` and `D`, and shows that the type of `V`-functors out of the tensor product `C \times D` is equivalent to the type of "enriched bifunctors" `EnrichedBifunctor V C D`. --- This work originates from infinity-cosmos project, where it is used to formalize the notion of cotensors in an enriched category. There are some additional coherence lemmas in a braided monoidal category which have been added. Currently, line 209 violates the style guideline that terminal simp calls should not be squeezed. When I tried to replace this with a single `simp`, I get an error message: `maximum recursion depth has been reached`. Any suggestions (either with this or anything else) are greatly appreciated - thank you! [](https://gitpod.io/from-referrer/) | new-contributor t-category-theory infinity-cosmos awaiting-author | 333/0 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/TensorProductCategory.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean | 3 | 12 | ['daniel-carranza', 'emilyriehl', 'github-actions', 'joelriou', 'robin-carlier'] | nobody | 1 month ago | 78 days ago | 23 minutes |
| 26061 | kckennylau | (WIP) feat(AlgebraicGeometry): define Projective Space | This defines the projective space over a scheme, indexed by an arbitrary type. --- Zulip discussion: [#maths > Projective Space](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Projective.20Space/with/524057860) I am currently using this PR as a hub for future PR's that will be split from this PR, so it is currently WIP. - [x] depends on: #30355 - [x] depends on: #30173 - [x] depends on: #30302 - [x] depends on: #30312 - [x] depends on: #30322 - [x] depends on: #30334 - [x] depends on: #30336 - [x] depends on: #30365 - [x] depends on: #30367 - [x] depends on: #30399 - [ ] depends on: #30379 - [ ] depends on: #36226 - [ ] depends on: #30352 - [ ] depends on: #30408 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-geometry blocked-by-other-PR | 2009/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/ProjectiveSpace.lean | 2 | 16 | ['callesonne', 'erdOne', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | erdOne | 1 month ago | 206 days ago | 110 days |
| 24434 | joelriou | feat(CategoryTheory): effectiveness of descent | (This is very much a draft, it will be split in multiple PRs later.) Co-authored-by: Christian Merten [christian@merten.dev](mailto:christian@merten.dev) --- - [ ] depends on: #35452 - [ ] depends on: #35393 - [ ] depends on: #35396 - [ ] depends on: #35401 - [x] depends on: #24411 - [x] depends on: #24382 - [x] depends on: #25971 - [x] depends on: #13539 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 4052/66 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Adj.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/BaseChange.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Mate.lean,Mathlib/CategoryTheory/Bicategory/Functor/Cat.lean,Mathlib/CategoryTheory/Bicategory/Functor/LocallyDiscrete.lean,Mathlib/CategoryTheory/Bicategory/Functor/Strict.lean,Mathlib/CategoryTheory/Bicategory/Opposite.lean,Mathlib/CategoryTheory/CommSq.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/CommSq.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataAsCoalgebra.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataDoublePrime.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataPrime.lean,Mathlib/CategoryTheory/Sites/Descent/IsPrestack.lean,Mathlib/CategoryTheory/Sites/Descent/IsStack.lean,Mathlib/CategoryTheory/Sites/Descent/ModuleCat.lean,Mathlib/CategoryTheory/Sites/Descent/PullbackStruct.lean | 19 | 23 | ['alreadydone', 'callesonne', 'chrisflav', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib-dependent-issues', 'yuma-mizuno'] | nobody | 1 month ago | unknown | 0 seconds |
| 35151 | alreadydone | WIP: group scheme structure on Weierstrass curve | --- [](https://gitpod.io/from-referrer/) | WIP t-algebraic-geometry | 620/0 | Mathlib/AlgebraicGeometry/EllipticCurve/Projective/GroupScheme.lean | 1 | 3 | ['github-actions', 'joelriou'] | nobody | 1 month ago | unknown | 0 seconds |
| 35436 | daniel-carranza | feat(CategoryTheory/Monoidal/Closed): Prove the isomorphism of internal hom objects C(x \otimes y, z) and C(y, C(x, z)) | Prove the currying-uncurrying isomorphism `C(x \otimes y, z) \iso C(y, C(x, z))` between internal hom objects of a closed monoidal category `C`. --- This result is connected to the infinity-cosmos project, and is used to prove that a closed monoidal category enriched in itself admits all cotensors. ~Line 81 currently contains a one-line proof in tactics mode `exact rfl`. When trying to use `rfl` outside of tactics mode, an error is thrown~ (Fixed, thank you @robin-carlier!). Any help with this (or any other aspect of the formalization) is greatly appreciated! [](https://gitpod.io/from-referrer/) | new-contributor t-category-theory infinity-cosmos delegated | 89/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Closed/InternalCurrying.lean | 2 | 15 | ['dagurtomas', 'daniel-carranza', 'github-actions', 'joelriou', 'mathlib-bors', 'riccardobrasca', 'robin-carlier'] | adamtopaz | 1 month ago | 63 days ago | 7 days |
| 27226 | xcloudyunx | feat(Combinatorics/SimpleGraph): Add Subgraph.inclusion_edge_apply_coe and inclusion_edgeSet_apply_coe | This PR continues the work from #25248. Original PR: https://github.com/leanprover-community/mathlib4/pull/25248 | awaiting-author t-combinatorics new-contributor merge-conflict | 14/0 | Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 1 | 4 | ['b-mehta', 'github-actions', 'mathlib-merge-conflicts', 'xcloudyunx'] | b-mehta | 1 month ago | 262 days ago | 25 days |
| 29934 | smmercuri | feat(Field/WithAbs): the lift of a ring homomorphism from `WithAbs v` to `WithAbs w` to their completions | If `σ` is a compatible ring homomomorphism between `WithAbs v` and `WithAbs w` then this extends to a natural ring homomorphism between completions `v.Completion` and `w.Completion`. Also fix some defeq abuse in `Field/WithAbs`. --- - [x] depends on: #29969 [](https://gitpod.io/from-referrer/) | WIP FLT large-import merge-conflict | 41/3 | Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Field/WithAbs.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/Topology/MetricSpace/Completion.lean | 5 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 219 days ago | 37 minutes |
| 33688 | Citronhat | feat(PMF): add expectation lemmas for Poisson PMF | This PR adds some basic results about the Poisson distribution, its `PMF`, and its expectation. **New lemmas:** * `poissonPMF_apply` — an unfolding lemma for `poissonPMF`. * `poissonPMFReal_mul_eq_succ_mul` — the standard recursion identity for the Poisson mass function. * `poissonPMFReal_hasSum_nmul` — shows that `fun n ↦ poissonPMFReal r n * n` has sum `r`. * `poissonPMF_tsum_nmul` — the corresponding identity at the level of the `PMF`. * `poissonPMF_coe_tsum_nmul` — the same result after coercion to `ℝ`. Both `ℝ`-valued and `ℝ≥0∞`-valued formulations are included so that these results can be used conveniently in both Lebesgue and Bochner integration contexts. | new-contributor t-measure-probability awaiting-author merge-conflict | 21/0 | Mathlib/Probability/Distributions/Poisson.lean | 1 | 11 | ['Citronhat', 'DavidLedvinka', 'github-actions', 'mathlib-merge-conflicts', 'urkud'] | urkud | 1 month ago | 66 days ago | 47 days |
| 34005 | MSpill | feat: inverse function theorem for manifolds (concrete version) | Proves the inverse function theorem for manifolds: given manifolds $M, N$ and a $C^n$ map $f : M \to N$ whose differential is a linear isomorphism at $p \in M$, then $f$ is a local diffeomorphism at $p$, provided that both $p$ and its image are interior points. The proof proceeds in 4 main steps: 1. Define composition of partial diffeomorphisms 2. Show that the extended chart at an interior point can be restricted to an open set on which it is a partial diffeomorphism, viewing the model vector space as a manifold modelled on itself trivially 3. Use the inverse function theorem (applied to $f$ written in coordinates) to obtain a partial diffeomorphism between model vector spaces 4. Compose with chart diffeomorphisms to obtain a partial diffeomorphism between the manifolds. ------ [](https://gitpod.io/from-referrer/) | awaiting-author t-differential-geometry new-contributor merge-conflict | 232/3 | Mathlib/Geometry/Manifold/LocalDiffeomorph.lean | 1 | 12 | ['MSpill', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | grunweg | 1 month ago | 106 days ago | 18 minutes |
| 34830 | parabamoghv | feat(CategoryTheory/Monoidal): add definition of categorical groups | This PR defines of categorical groups, also known as coherent 2-groups, in mathlib. Motivation: Categorical groups are well-studied structures in monoidal category theory, but are not currently available in mathlib. The definitions in this PR follow the existing design patterns used for Category, MonoidalCategory, and BraidedCategory. This PR focuses on setting up the core structure and notation. Basic lemmas and further developments will be provided in a subsequent PR. --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor WIP merge-conflict | 163/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/CategoricalGroups/Basic.lean | 2 | 27 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'parabamoghv', 'robin-carlier'] | robin-carlier | 1 month ago | 70 days ago | 5 days |
| 35521 | grunweg | feat: the unusedSetOptionIn linter (rebased) | Rebased version of #13653, adapted to current mathlib master. --- [](https://gitpod.io/from-referrer/) | WIP t-linter large-import | 201/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/UnnecessarySetOptionIn.lean,MathlibTest/UnnecessarySetOptionIn.lean | 6 | 2 | ['github-actions'] | nobody | 1 month ago | 71 days ago | 23 seconds |
| 34262 | grunweg | feat: add mfderiv_const_smul | This generalises an existing mathlib lemma (as the differentiability hypothesis is in fact not necessary). Co-authored-by: Patrick Massot [patrickmassot@free.fr](mailto:patrickmassot@free.fr) --- Note: this PR is now lower-priority (after some reorgs it is no longer on the path to the Levi-Civita connection); it should be rewritten following the approach in #34263. [](https://gitpod.io/from-referrer/) | awaiting-author t-differential-geometry WIP | 16/0 | Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean | 1 | 9 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'ocfnash'] | ocfnash | 1 month ago | 99 days ago | 18 minutes |
| 36333 | thorimur | test: checkTypeEvenMore | --- [](https://gitpod.io/from-referrer/) | t-linter large-import | 35/0 | Mathlib/Tactic/Linter/Lint.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 34040 | Ruben-VandeVelde | feat: generalize HasCompl.compl image/preimage lemmas to Involutive | --- [](https://gitpod.io/from-referrer/) | t-data awaiting-author merge-conflict | 23/14 | Mathlib/Data/Set/Image.lean | 1 | 6 | ['eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | eric-wieser | 1 month ago | 91 days ago | 14 days |
| 35249 | themathqueen | feat(Analysis/Matrix): linear functional on matrices is positive iff its weight is positive semi-definite | No comments yet, I'm still thinking of the best thing to do here. --- [](https://gitpod.io/from-referrer/) | WIP t-analysis merge-conflict | 167/60 | Mathlib.lean,Mathlib/Analysis/Matrix/GNS.lean,Mathlib/Analysis/Matrix/Order.lean | 3 | 6 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 36128 | grunweg | Levicivita minimal | --- [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry merge-conflict | 4220/30 | Mathlib.lean,Mathlib/Geometry/Manifold/MFDeriv/Atlas.lean,Mathlib/Geometry/Manifold/MFDeriv/NormedSpace.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/LeviCivita.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Prelim.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Torsion.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/plan.mde,Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean,Mathlib/Geometry/Manifold/VectorBundle/Misc.lean,Mathlib/Geometry/Manifold/VectorBundle/Tensoriality.lean,Mathlib/Geometry/Manifold/VectorField/LieBracket.lean,Mathlib/Geometry/Manifold/VectorField/Pullback.lean | 13 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 58 days ago | 3 seconds |
| 35744 | mkaratarakis | feat(NumberTheory): non-vanishing derivative and algebraic lower bound for Gelfond-Schneider | This PR continues the formalization of the **Gelfond-Schneider Theorem** (Hilbert's Seventh Problem). It establishes the critical algebraic lower bound for the auxiliary function's evaluation by isolating its first non-vanishing derivative and scaling it to a non-zero algebraic integer. Following the contradiction argument in Loo-Keng Hua's *Introduction to Number Theory* (Chapter 17.9, Equation 5), we extract the minimal non-vanishing derivative order $r$ and prove the integrality of its scaled evaluation to establish a strict analytical lower bound. 1) Confirms that by our previous choice of coefficients $\eta$, the first $n$ derivatives of the auxiliary function $R(x)$ vanish at the evaluation points $1, \dots, m$. 2) Extracts the exact minimal order of vanishing $r$ among all points $l_0 + 1$, explicitly proving the textbook assertion that $n \le r$. 3) Defines the non-zero algebraic number $\rho = (\log \alpha)^{-r} R^{(r)}(l_0)$. 4) Formalizes the crucial algebraic step that scaling the evaluated system coefficients by $c_1^{r+2mq}$ (formalized here as `cρ`) clears all denominators, resulting in an algebraic integer strictly within $\mathcal{O}_K$. 5) Concludes that because the scaled $\rho$ is a non-zero algebraic integer, its absolute norm is strictly bounded below by $1$. This establishes the algebraic foundation for the absolute lower bound $|N(\rho)| > c_5^{-r}$, which will directly oppose the complex analytic upper bound via Cauchy's integral formula in the final contradiction step. --- - [ ] depends on: #35316 - [ ] depends on: #35743 - [ ] depends on: #35315 [](https://gitpod.io/from-referrer/) | t-number-theory blocked-by-other-PR | 2028/0 | Mathlib.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlgSetup.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAnalytic.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainOrder.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainPostAnalytic.lean | 6 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 65 days ago | 2 minutes |
| 26394 | winstonyin | feat: existence of local flows on manifolds | This PR continues the work from #21777. Original PR: https://github.com/leanprover-community/mathlib4/pull/21777 Transfer the existence theorem of local flows on vector spaces to manifolds. The precise statement is: > If a vector field `v` on a manifold `M` is continuously differentiable at an interior point `x₀`, then for a given `t₀` there exists a neighbourhood `u` of `x₀`, a positive `ε`, and `γ : M → ℝ → M` such that `γ x` is an integral curve of `v` on `(t₀ - ε, t₀ + ε)` for all `x ∈ u`. This is powerful because all curves `γ x` (each with initial condition `x ∈ u`) share the same existence time interval `(t₀ - ε, t₀ + ε)`, rather than each curve having its own `ε`. This will allow us to show that $C^1$ vector fields on compact manifolds always have global integral curves / global flows. Any suggestions to shorten the proof or split out useful lemmas are welcome! - [x] depends on: #26392 --- [](https://gitpod.io/from-referrer/) | t-differential-geometry awaiting-author | 135/52 | Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Order/Filter/Prod.lean | 3 | 6 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'ocfnash', 'winstonyin'] | ocfnash | 1 month ago | 52 days ago | 7 days |
| 34164 | Scarlett-le | feat(Geometry/Euclidean/Sphere): define arcs on spheres | This PR defines arcs on spheres and proves basic properties. ## Main definitions * `EuclideanGeometry.Sphere.Arc`: An arc on a sphere, defined by a left endpoint and a midpoint on the sphere. The right endpoint is computed as the reflection of left across the line through the center and mid. * `Arc.opposite`: The opposite arc (same endpoints, antipodal mid). * `Arc.oppositeEquiv`: The involution given by `opposite`. * `Arc.minor` / `Arc.major`: The minor/major arc between two non-diametrically-opposite points. * `Arc.through`: The arc from `A` to `C` passing through `B`. * `Arc.avoiding`: The arc from `A` to `C` not passing through `B`. ## Main results * `through_right` / `avoiding_right`: The right endpoint equals `C`. * `mem_interior_through` / `mem_through`: `B` lies in the `through` arc. * `not_mem_avoiding`: `B` does not lie in the `avoiding` arc (when `A ≠ C`). ## Dependencies * #36241 * #35956 * #35957 | awaiting-author t-euclidean-geometry merge-conflict | 767/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection/FiniteDimensional.lean,Mathlib/Geometry/Euclidean/Sphere/Arc.lean,Mathlib/Geometry/Euclidean/Sphere/Basic.lean,Mathlib/Geometry/Euclidean/Sphere/OrthRadius.lean | 6 | 11 | ['Scarlett-le', 'github-actions', 'jsm28', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 100 days ago | 13 hours |
| 30329 | luigi-massacci | feat(Analysis/Distribution/TestFunction): integrating against a measure as a continuous linear map on test functions | --- - [ ] depends on: #30004 - [ ] depends on: #32228 - [ ] depends on: #30327 - [x] depends on: #31806 - [x] depends on: #31533 - [x] depends on: #31470 - [ ] depends on: #30255 - [ ] depends on: #30253 - [ ] depends on: #30240 - [ ] depends on: #30239 - [x] depends on: #30236 - [x] depends on: #30202 - [x] depends on: #30201 - [x] depends on: #30199 - [x] depends on: #30198 - [x] depends on: #30197 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis | 999/6 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Set/Function.lean,Mathlib/MeasureTheory/Integral/BoundedContinuousFunction.lean,Mathlib/MeasureTheory/Integral/TestAgainst.lean | 7 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 205 days ago | 12 minutes |
| 30327 | luigi-massacci | feat(Analysis/Distribution/TestFunction): add characterizations of continuity for linear maps on test functions | --- - [ ] depends on: #31806 - [x] depends on: #30309 - [x] depends on: #31470 - [ ] depends on: #30255 - [ ] depends on: #30253 - [ ] depends on: #30240 - [ ] depends on: #30239 - [x] depends on: #30236 - [x] depends on: #30202 - [x] depends on: #30201 - [x] depends on: #30199 - [x] depends on: #30198 - [x] depends on: #30197 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis | 774/5 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Set/Function.lean | 5 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 205 days ago | 1 minute |
| 30255 | luigi-massacci | feat(Analysis/Distribution/ContDiffMapSupportedIn): specialize singleton seminorm family for D_K^n when n finite | Co-authored by: @ADedecker --- - [ ] depends on: #30253 - [ ] depends on: #30240 - [ ] depends on: #30239 - [ ] depends on: #30236 - [ ] depends on: #30202 - [ ] depends on: #30201 - [ ] depends on: #30199 - [ ] depends on: #30198 - [ ] depends on: #30197 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis | 476/3 | Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Set/Function.lean | 3 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 207 days ago | 2 minutes |
| 30253 | luigi-massacci | feat(Analysis/Distribution/ContDiffMapSupportedIn): Add a wrapper for iteratedFDeriv on the type of bundled smooth compactly supported maps | Add a wrapper for `iteratedFDeriv` and `fderiv` and on `D_K`, specializing the definitions for `D_K^n` for the case `n = \top` . Co-authored by: @ADedecker --- - [x] depends on: #30240 - [x] depends on: #30239 - [x] depends on: #30236 - [x] depends on: #30202 - [x] depends on: #30201 - [x] depends on: #30199 - [x] depends on: #30198 - [x] depends on: #30197 [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 463/18 | Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean | 1 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 207 days ago | 9 minutes |
| 32210 | ADedecker | feat: iteratedFDeriv as a linear map on test functions | Add `TestFunction.iteratedFDeriv[WithOrder]LM`, analogous to [ContDiffMapSupportedIn.iteratedFDerivWithOrderLM](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.html#ContDiffMapSupportedIn.iteratedFDerivWithOrderLM) and [ContDiffMapSupportedIn.iteratedFDerivLM](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.html#ContDiffMapSupportedIn.iteratedFDerivLM) --- Co-authored-by: @luigi-massacci [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author merge-conflict | 157/88 | Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/TestFunction.lean | 2 | 7 | ['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | grunweg, j-loreaux, sgouezel, urkud | 1 month ago | 135 days ago | 9 days |
| 35684 | spitters | feat(CategoryTheory/MarkovCategory): Kleisli PMF is a Markov category | Add `Mathlib/CategoryTheory/MarkovCategory/KleisliPMF.lean` showing that `KleisliCat PMF` is a `MarkovCategory`. Uses `Prod` as tensor and `PUnit` as unit; reuses Mathlib's existing `KleisliCat`, `LawfulMonad PMF`, and `MarkovCategory` infrastructure. Builds the full instance stack: MonoidalCategory → BraidedCategory → SymmetricCategory → CopyDiscardCategory → MarkovCategory --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author merge-conflict | 323/1 | Mathlib.lean,Mathlib/CategoryTheory/MarkovCategory/KleisliPMF.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 3 | 6 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'spitters'] | nobody | 1 month ago | 63 days ago | 2 days |
| 36486 | eric-wieser | refactor: change Encodable to uniquely specify `decode` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-logic | 73/47 | Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Function/Basic.lean | 2 | 0 | [] | nobody | 1 month ago | unknown | 0 seconds |
| 35522 | grunweg | feat: lint for unused `backward` options | --- Based on the `unnecessarySetOptionIn` linter (#35521 and #13653). [](https://gitpod.io/from-referrer/) | t-linter tech debt large-import | 211/4 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/UnnecessarySetOptionIn.lean,MathlibTest/UnnecessarySetOptionIn.lean,lakefile.lean | 7 | 3 | ['github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 71 days ago | 19 seconds |
| 36412 | Timeroot | refactor(Topology/Perfect): Change PerfectSpace to be a synonym for NeBot | Refactor PerfectSpace to be, equivalently, just `forall (x : α) : Filter.NeBot (𝓝[≠] x)`.
See [#mathlib4 > Changing PerfectSpace](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Changing.20PerfectSpace/with/575568102) for discussion
This is unmodified output from @Aristotle-Harmonic !
[](https://gitpod.io/from-referrer/)
Co-authored-by: Aristotle (Harmonic) |
54/50 | Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Module/RCLike/Real.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/Algebra/Module/PerfectSpace.lean,Mathlib/Topology/Compactification/OnePoint/Basic.lean,Mathlib/Topology/Perfect.lean,Mathlib/Topology/Separation/Connected.lean | 7 | 2 | ['github-actions'] | nobody | 1 month ago | 50 days ago | 18 minutes | |
| 36079 | DavidLedvinka | refactor(Probability): Refactors Conditional Independence to allow spaces that are not Standard Borel | merge-conflict | 1827/1120 | Mathlib.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalLExpectation.lean,Mathlib/MeasureTheory/Measure/NullMeasurable.lean,Mathlib/Order/Filter/CountableInter.lean,Mathlib/Probability/Independence/Basic.lean,Mathlib/Probability/Independence/CondIndep.lean,Mathlib/Probability/Independence/Conditional.lean,Mathlib/Probability/Independence/Conditional/CondIndep.lean,Mathlib/Probability/Independence/Conditional/CondIndepFun.lean,Mathlib/Probability/Independence/ZeroOne.lean,Mathlib/Probability/Kernel/Condexp.lean | 12 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds | |
| 36503 | Mrigna01 | Add false theorem test file | --- [](https://gitpod.io/from-referrer/) | new-contributor | 135/0 | Mathlib/FalseBench/FalseTheorems.lean | 1 | 3 | ['github-actions'] | nobody | 1 month ago | 50 days ago | 6 minutes |
| 26803 | bjoernkjoshanssen | feat: second partial derivatives test | We prove that if `f` is a real-valued function on `n`-dimensional Euclidean space with vanishing gradient at `x₀`, having a power series on a ball of positive radius around `x₀`, whose second Frechét derivative is positive definite at `x₀`, then `f` has local minimum at `x₀`. This project was started at the Lean for Mathematicians workshop hosted by the Simons Foundation in June 2025 in a group consisting of Bjørn Kjos-Hanssen, Erin Griffin, Asaf Kapota, and Janani Lakshmanan, see repo at https://github.com/bjoernkjoshanssen/secondpartial --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 572/0 | Mathlib.lean,Mathlib/Analysis/Calculus/PartialDerivativeTest.lean,Mathlib/Analysis/Normed/Operator/NormedSpace.lean,Mathlib/Topology/Constructions.lean | 4 | 32 | ['bjoernkjoshanssen', 'github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'themathqueen'] | j-loreaux | 1 month ago | 72 days ago | 9 days |
| 14603 | awueth | feat: degree is invariant under graph isomorphism | --- Mathlib has the definition `SimpleGraph.Iso.mapNeighborSet` which is an equivalence between neighbor sets induced by an isomorphism. Would it be beneficial to add the same equivalence for `neighborFinset`? [](https://gitpod.io/from-referrer/) | WIP t-combinatorics new-contributor | 24/0 | Mathlib/Combinatorics/SimpleGraph/Map/Finite.lean | 1 | 12 | ['SnirBroshi', 'awueth', 'github-actions', 'jcommelin', 'kim-em', 'urkud'] | nobody | 1 month ago | 627 days ago | 31 days |
| 33599 | nielstron | feat(Computability/ContextFreeGrammar): closure under union | --- This PR picks up https://github.com/leanprover-community/mathlib4/pull/13514 and resolves the outstanding errors. - [ ] depends on: #33592 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-computability new-contributor | 498/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 105 days ago | 10 days |
| 9605 | davikrehalt | feat(Data/Finset & List): Add Lemmas for Sorting and Filtering | This PR includes several useful lemmas to the Data/Finset and Data/List modules in Lean's mathlib: 1. `toFinset_filter` (List): Shows that filtering commutes with toFinset. 2. `toFinset_is_singleton_implies_replicate` (List): Shows a list with a singleton toFinset is a List.replicate. 3. `filter_sort_commute` (Finset): Sorting and filtering can be interchanged in Finsets. 4. `Sorted.filter` (List): A sorted list stays sorted after filtering. 5. `Sorted.append_largest` (List): Appending the largest element keeps a list sorted. 6. `sort_monotone_map` (Finset): Relates sorting of a Finset after mapping to sorting of a list. 7. `sort_insert_largest` (Finset): Sorting a Finset with an inserted largest element. 8. `sort_range` (Finset): Sorting a range in a Finset equals the corresponding range list. 9. ~~`filter_eval_true` (List): Filtering a list with a predicate always true keeps the list unchanged.~~ 10. ~~`filter_eval_false` (List): Filtering with an always-false predicate gives an empty list.~~ 11. ~~`pairwise_concat` (List): Iff condition for Pairwise relation in concatenated lists (similar to pairwise_join).~~ 12. `list_map_toFinset` (Finset): toFinset commutes with map under injection --- - [x] depends on: #15952 This is my first PR to mathlib, so I'm not too familiar with etiquette's and more specifically there are two proofs in the PR which uses aesop, and I am not sure if it's frowned upon. I kept the aesop in there for now as I couldn't construct very short proofs otherwise. The sort_range function proof was suggested in https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/Computing.20Finset.20sort.20of.20Finset.20range/near/410346731 by Ruben Van de Velde. Thanks for your time for improving this PR. | please-adopt t-data new-contributor merge-conflict awaiting-author | 71/0 | Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Sort.lean,Mathlib/Data/List/Sort.lean | 4 | 30 | ['YaelDillies', 'davikrehalt', 'eric-wieser', 'github-actions', 'jcommelin', 'urkud', 'vihdzp'] | nobody | 1 month ago | 830 days ago | 12 days |
| 10332 | adri326 | feat(Topology/Sets): define regular open sets and their boolean algebra | Introduces a new module, `Mathlib.Topology.Sets.RegularOpens`, which defines the `IsRegularOpen s` predicate (`interior (closure s) = s`) and `TopologicalSpace.RegularOpens`, the type of bundled regular open sets (defined as `Heyting.Regular (Opens X)`). A few properties of regular open sets (bundled and unbundled) and `interior (closure s)` are proven, and a pointwise instance of `MulAction` is provided for regular open sets. --- This PR belongs to my series of PRs around my formalization of Rubin's theorem. There are two possible ways to implement `RegularOpens`: - either construct them by hand and show that they form a boolean algebra (better def-eq but more boilerplate code required) - or use `Heyting.Regular` on the heyting algebra of `Opens` inherited from the `Frame` instance on them I first chose to use the former approach, but using the latter cuts the length of the construction of the boolean algebra of regular open sets by 100 lines of code, and allows us to inherit all of the helper lemmas defined for `Heyting.Regular`. The big downside, though, is that an element of `RegularOpens` isn't defined as a bundled regular open set anymore, but rather as an `Opens` set `s` for which `Opens.interior ↑(Opens.interior ↑sᶜ)ᶜ = s`, so I added an alternative constructor `RegularOpens.of` that instead accepts any set `s` for which `IsRegularOpen s` holds. Another minor downside is that coercion to a set takes two coercions instead of one. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology | 434/0 | Mathlib.lean,Mathlib/Data/Set/Pointwise/SMul.lean,Mathlib/Topology/Sets/Opens.lean,Mathlib/Topology/Sets/RegularOpens.lean,docs/references.bib | 5 | 1 | ['adri326'] | nobody | 1 month ago | 814 days ago | 18 minutes |
| 36533 | Bergschaf | feat(Order/Sublocales): Closed sublocales | This PR introduces closed sublocales and their property being the complement of Open sublocales in the Coframe of sublocales. The embedding from closed sublocales into sublocales is a coframeHom, which is also added in this PR. If this PR is to large, I can also factor this part out (although it should be quite uncontroversial since i basically copied everything from frameHom). - [ ] depends on: #25978 --- [](https://gitpod.io/from-referrer/) | t-order blocked-by-other-PR | 439/37 | Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Order/Nucleus.lean,Mathlib/Order/Sublocale.lean | 3 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 50 days ago | 20 minutes |
| 36540 | faenuccio | perf: personal grind test | Private test | WIP t-algebra | 5/0 | Mathlib/Algebra/Ring/Nat.lean | 1 | 4 | ['faenuccio', 'github-actions', 'leanprover-radar'] | faenuccio | 1 month ago | 50 days ago | 16 seconds |
| 36559 | faenuccio | feat(Analysis/Convex/Uniform): uniformly convex spaces using filters | This PR adds an equivalent formulation for a space being uniformly convex using filters.
Co-authored-by: Aristotle (Harmonic) |
WIP t-analysis | 183/2 | Mathlib/Analysis/Convex/Uniform.lean | 1 | 1 | ['github-actions'] | faenuccio | 1 month ago | 49 days ago | 20 seconds |
| 32410 | callesonne | feat(Bicategory/FunctorCategory/Pseudo): Add evaluation pseudofunctor | Adding pseudofunctors `eval` and `evaluation`. WIP PR to access CI. --- - [x] depends on: #30926 - [x] depends on: #32468 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 49/10 | Mathlib/CategoryTheory/Bicategory/Functor/StrictlyUnitary.lean,Mathlib/CategoryTheory/Bicategory/FunctorBicategory/Pseudo.lean,Mathlib/CategoryTheory/Bicategory/Modification/Pseudo.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Pseudo.lean,Mathlib/CategoryTheory/Products/Basic.lean | 5 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 148 days ago | 9 seconds |
| 31901 | callesonne | feat(Bicategory/Subbicategory): add full subbicategories using `ObjectProperty` | Analogously to the 1-categorical setting we construct a full subbicategory from an object property. One could also construct locally full subbicategories using a pair of an object property and a morphism property. However then there is no way to obtain the bicategory structure by specializing from the `InducedBicategory` case. It is not clear to me if we want a full subbicategory to be specialized from this other construction, or from `InducedBicategory`. --- - [x] depends on: #30925 [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author merge-conflict | 135/2 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Basic.lean,Mathlib/CategoryTheory/Bicategory/InducedBicategory.lean,Mathlib/CategoryTheory/Bicategory/Subbicategory.lean | 4 | 8 | ['callesonne', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] | nobody | 1 month ago | 147 days ago | 2 days |
| 29856 | mans0954 | feat(Analysis/Normed/Ring/Basic): Add NonUnitalNonAssocSeminormedRing and NonUnitalNonAssocNormedRing | Adds the classes `NonUnitalNonAssocSeminormedRing` and `NonUnitalNonAssocNormedRing` and relaxes the `NonUnitalSeminormedRing` section to `NonUnitalNonAssocSeminormedRing`. Examples of non-unital non-associative normed rings include non-untial JB-algebras and non-unital JB*-algebras. --- [](https://gitpod.io/from-referrer/) | t-analysis please-adopt | 110/11 | Mathlib/Analysis/Normed/Ring/Basic.lean,MathlibTest/TCSynth.lean | 2 | 15 | ['github-actions', 'j-loreaux', 'leanprover-bot'] | ADedecker and j-loreaux | 1 month ago | 163 days ago | 57 days |
| 34846 | fpvandoorn | fix: module system and translate interaction | * Fix some issues when the value of an imported declaration is not available. This could cause `to_additive` to panic or turn the declaration into an axiom. * Don't print private names in messages * Don't panic when the declaration already exists modulo privateness. * Add some helper functions to `Lean.Environment` and `Lean.Meta`. --- Please double check the `PublicOrPrivate` declarations: - Do they already exist in core? - Does `addDeclSafe` catch all cases where `addDecl` would panic? I think these are useful (maybe after renaming) since some of the Core versions are a huge footgun, which can lead to panics in multiple ways. - [ ] depends on: #35134 [](https://gitpod.io/from-referrer/) | t-meta awaiting-author blocked-by-other-PR merge-conflict | 233/50 | Mathlib/Lean/Environment.lean,Mathlib/Lean/Meta.lean,Mathlib/Tactic/Translate/Core.lean,MathlibTest/ToAdditiveModule.lean,MathlibTest/ToDual.lean,MathlibTest/toAdditive.lean | 6 | 37 | ['JovanGerb', 'fpvandoorn', 'github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 80 days ago | 4 hours |
| 35740 | LLaurance | chore(SimpleGraph/Basic): clean up and shorten | Clean up and shorten some proofs --- [](https://gitpod.io/from-referrer/) | t-combinatorics WIP merge-conflict | 43/50 | Mathlib/Combinatorics/SimpleGraph/Basic.lean | 1 | 3 | ['LLaurance', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 51 days ago | 13 days |
| 35291 | mcdoll | feat(Fourier): improved version of Riemann-Lebesgue | --- The Riemann-Lebesgue lemma is merely a side note of the fact that we need to relate the extension of the Schwartz Fourier transform to L1 to the original one. RL on Schwartz is trivial by embedding into the correct space. - [ ] depends on: #35953 - [ ] depends on: #35954 [](https://gitpod.io/from-referrer/) | WIP large-import | 96/29 | Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Fourier/L1Space.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Topology/ContinuousMap/ZeroAtInfty.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 76 days ago | 1 second |
| 36529 | idontgetoutmuch | Connection 1 form scribbles | Some thoughts on connection 1-forms - not meant to be ever merged but here for convenience of discussion | new-contributor t-differential-geometry | 496/52 | Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/Algebra/FundamentalVectorField.lean,Mathlib/Geometry/Manifold/IntegralCurve/Compact.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Order/Filter/Prod.lean | 5 | 2 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 35157 | Multramate | feat(RingTheory/AdjoinRoot): add IsFractionRing for AdjoinRoot | Co-authored-by: Sriram Chinthalagiri Venkata @sriram3301 This contribution was created as part of the Heidelberg Lean workshop "Formalising algebraic geometry" in November 2025. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra awaiting-author | 40/1 | Mathlib/RingTheory/AdjoinRoot.lean | 1 | 8 | ['copilot-pull-request-reviewer', 'erdOne', 'github-actions', 'robin-carlier'] | mattrobball | 1 month ago | 49 days ago | 25 days |
| 36485 | Paul-Lez | feat(Data/Finset/Finite): `Finset.sigma` commutes with `Finset.filter` | Not so sure about the `simp` tag - reviewer feedback welcome on that:) --- [](https://gitpod.io/from-referrer/) | t-data easy awaiting-author | 7/0 | Mathlib/Data/Finset/Sigma.lean | 1 | 6 | ['Paul-Lez', 'eric-wieser', 'github-actions'] | nobody | 1 month ago | 50 days ago | 13 hours |
| 36619 | ldct | feat: add `NonUnitalRingHom.ker` | --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 18/4 | Mathlib/RingTheory/Ideal/Maps.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 15720 | znssong | feat(SimpleGraph): The Bondy-Chvátal theorem | The proof of the Bondy-Chvátal theorem, with Dirac's theorem and Ore's theorem as its corollary. - [x] depends on: #15536 - [ ] depends on: #15711 - [ ] depends on: #15578 | merge-conflict blocked-by-other-PR t-combinatorics new-contributor | 903/3 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/BondyChvatal.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Combinatorics/SimpleGraph/Walk.lean,Mathlib/Dynamics/FixedPoints/Basic.lean,Mathlib/Dynamics/FixedPoints/Increasing.lean | 8 | 3 | ['github-actions', 'grunweg'] | nobody | 1 month ago | 627 days ago | 29 minutes |
| 16801 | awainverse | feat(ModelTheory/Equivalence): The quotient type of formulas modulo a theory | Defines `FirstOrder.Language.Theory.Formula`: `T.Formula α` is the quotient of `L.Formula α` by equivalence modulo a theory `T`. Puts a boolean algebra instance on `T.Formula α`, with `≤` corresponding to implication. --- - [x] depends on: #16799 - [x] depends on: #16800 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 174/60 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Types.lean | 3 | 30 | ['YaelDillies', 'awainverse', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'metinersin'] | nobody | 1 month ago | 546 days ago | 29 days |
| 21616 | peabrainiac | feat(Topology): concatenating countably many paths | Adds `Path.countableConcat`, the concatenation of a sequence of paths leading up to some point `x`. --- - [x] depends on: #21591 - [x] depends on: #21607 This work is a prerequisite to #20248, where it is used to show that the topology of first-countable locally path-connected spaces is coinduced by all the paths in that space. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 229/0 | Mathlib.lean,Mathlib/Topology/Path/CountableConcat.lean | 2 | 31 | ['YaelDillies', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'peabrainiac'] | nobody | 1 month ago | 376 days ago | 56 days |
| 22314 | shetzl | feat: add leftmost derivations for context-free grammars | Leftmost derivations are often easier to reason about than arbitrary derivations. This PR adds leftmost variants of Rewrites, Produces and Derives to the existing definition of context-free grammars and proves that a string of terminals can be derived iff it can be leftmost derived.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 383/0 | Mathlib.lean,Mathlib/Computability/LeftmostDerivation.lean | 2 | 55 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 1 month ago | 357 days ago | 72 days |
| 24690 | ScottCarnahan | feat(Data.Prod): reverse lexicographic order | This PR implements the type synonym RevLex as a one-field structure, defines an order on products, and proves an order isomorphism with the Lex product with factors switched. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 141/0 | Mathlib.lean,Mathlib/Data/Prod/RevLex.lean | 2 | 5 | ['ScottCarnahan', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 338 days ago | 19 days |
| 26368 | Whysoserioushah | feat(RingTheory/TwoSidedIdeal/SpanAsSum): span of set as finsum | Co-authored-by: Jujian Zhang --- Reopened after everything moved to fork (#23320). [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 81/0 | Mathlib.lean,Mathlib/RingTheory/TwoSidedIdeal/SpanAsSum.lean | 2 | 7 | ['github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 273 days ago | 36 days |
| 27417 | PierreQuinton | feat: add `SigmaCompleteLattice` | A $\sigma$-complete lattice is a lattice in which every countable subset `s` has a least upper bound and a greatest lower bound, denoted below by `sSup s` and `sInf s`. This PR adds the classes `SigmaCompleteLattice` as well as some theorems (mainly adapted from `CompleteLattice` and `ConditionallyCompleteLattice`). This is an adaptation of #26318 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-order | 394/0 | Mathlib.lean,Mathlib/Order/SigmaCompleteLattice.lean | 2 | 9 | ['PierreQuinton', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] | nobody | 1 month ago | 269 days ago | 12 days |
| 27534 | PierreQuinton | feat: a typeclass for `sSup`/`sInf` to be lawful | Adds lawful infima and suprema type classes. A preorder with lawful suprema: whenever a set has a least upper bound, `sSup` returns a least upper bound for that set. A preorder with lawful infima: whenever a set has a greatest lower bound, `sInf` returns a greastest lower bound for that set. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order | 121/8 | Mathlib.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/LawfulSupInf.lean | 3 | 26 | ['PierreQuinton', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | nobody | 1 month ago | 163 days ago | 114 days |
| 28151 | iehality | feat(Computability): r.e. sets are closed under inter/union/projection/composition | Prove that r.e. sets are closed under intersections, unions, projection and composition. --- This PR continues the work from #16705. Original PR: https://github.com/leanprover-community/mathlib4/pull/16705 | merge-conflict t-computability awaiting-author | 120/0 | Mathlib/Computability/Halting.lean | 1 | 13 | ['YaelDillies', 'github-actions', 'iehality', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 255 days ago | 8 days |
| 30119 | Ruben-VandeVelde | feat: WithTop/Bot.mapD | To replace Option.elim; working towards #27918 --- [](https://gitpod.io/from-referrer/) | awaiting-author t-order merge-conflict | 32/4 | Mathlib/Order/Hom/WithTopBot.lean,Mathlib/Order/WithBot.lean | 2 | 5 | ['JovanGerb', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 199 days ago | 12 days |
| 31610 | rudynicolop | feat(Computability/NFA): Kleene star closure for Regular Languages via NFA | This PR constructs a Kleene star closure for non-epsilon NFAs, and proves that regular languages are closed under Kleene star. The NFA construction is `NFA.kstar`. The main theorems are: - `NFA.accepts_kstar`: demonstrates that `M.kstar` accepts the Kleene star closure of the language of `M`. - `IsRegular.kstar`: demonstrates that regular languages are closed under Kleene star. There is an onging zulip discussion about regular languages in Mathlib: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Regular.20languages.3A.20the.20review.20queue/with/553759136 This discussion is also tracked at #24205. Furthermore, the construction and proofs in this PR are heavily inspired by @TpmKranz from his #15651. #15651 supersedes this PR, so if it is accepted then this PR is not needed. --- - [x] depends on: #31038 [](https://gitpod.io/from-referrer/) | t-computability new-contributor awaiting-author awaiting-CI | 405/7 | Mathlib/Computability/NFA.lean | 1 | 16 | ['YaelDillies', 'ctchou', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 107 days ago | 43 days |
| 30872 | rudynicolop | feat(Computability/NFA): NFA closure under concatenation | This PR proves that regular languages are closed under concatenation via a direct construction on `NFA`s without `εNFA` nor ε-transitions. The main new definitions and results include: - `M1.concat M2`, the concatenation of `NFA`s `M1` and `M2`, a direct construction without ε-transitions. - Theorem `accepts_concat : (M1.concat M2).accepts = M1.accepts * M2.accepts`, showing the correctness of the construction. - Theorem `IsRegular.mul`, showing that regular languages are closed under concatenation. --- - [x] depends on: #31038 [](https://gitpod.io/from-referrer/) | t-computability new-contributor awaiting-author | 104/7 | Mathlib/Computability/NFA.lean | 1 | 67 | ['YaelDillies', 'ctchou', 'eric-wieser', 'github-actions', 'lambda-fairy', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'rudynicolop'] | nobody | 1 month ago | 91 days ago | 59 days |
| 30379 | kckennylau | feat(RingTheory): isomorphism of graded rings | We define `GradedRingEquiv 𝒜 ℬ` to mean isomorphisms of graded rings, with notation `𝒜 ≃+*ᵍ ℬ`. When possible, instead of parametrizing results over `(e : 𝒜 ≃+*ᵍ ℬ)`, you should parametrize over `[GradedEquivLike E 𝒜 ℬ] [RingEquivClass E A B] (e : E)`. Zulip discussion: [How to define graded ring isomorphisms?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/How.20to.20define.20graded.20ring.20isomorphisms.3F/with/543962394) --- Split from #26061. - [x] depends on: #30355 - [x] depends on: #30312 - [x] depends on: #30367 [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author | 447/1 | Mathlib.lean,Mathlib/RingTheory/GradedAlgebra/RingEquiv.lean,Mathlib/RingTheory/GradedAlgebra/RingHom.lean | 3 | 7 | ['erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | erdOne | 1 month ago | 47 days ago | 9 days |
| 35822 | SnirBroshi | feat(Order/ConditionallyCompleteLattice): `sSup (f '' s) ≤ f (sSup s)` | --- #35260 will add `iSup` versions. (edit: it was merged, and it's only for `[Finite ι]`) Future work (though I'm not sure if it's possible): `Antitone`, `MonotoneOn`, `AntitoneOn` [](https://gitpod.io/from-referrer/) | t-order awaiting-author | 38/1 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean | 2 | 8 | ['Komyyy', 'SnirBroshi', 'github-actions', 'vihdzp'] | Komyyy | 1 month ago | 48 days ago | 15 days |
| 33466 | Shreyas4991 | refactor(Combinatorics/Digraph): add vertex sets | --- [](https://gitpod.io/from-referrer/) | t-combinatorics merge-conflict please-adopt | 382/55 | Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/Digraph/Orientation.lean | 2 | 83 | ['IvanRenison', 'Shreyas4991', 'SnirBroshi', 'YaelDillies', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp', 'vlad902'] | awainverse | 1 month ago | 49 days ago | 27 days |
| 21342 | YaelDillies | refactor(Normed/Group/Quotient): generalise to non-abelian groups | The goal is to apply this to free groups, whose multiplication in either argument is an isometry, but isn't commutative. --- - [x] depends on: #21341 - [ ] depends on: #35037 [](https://gitpod.io/from-referrer/) | t-analysis | 97/70 | Mathlib/Analysis/Normed/Group/Quotient.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/Group/Quotient.lean,Mathlib/Topology/Bornology/BoundedOperation.lean | 6 | 12 | ['YaelDillies', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 1 month ago | 47 days ago | 11 days |
| 19475 | YaelDillies | feat: group markings | From LeanCamCombi --- - [ ] depends on: #21342 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR | 270/70 | Mathlib.lean,Mathlib/Analysis/Normed/Group/Quotient.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Geometry/Group/Marking.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/Group/Quotient.lean,Mathlib/Topology/Bornology/BoundedOperation.lean | 8 | 16 | ['YaelDillies', 'b-mehta', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 455 days ago | 22 days |
| 35591 | JovanGerb | draft: `gsimp` tactic | This is a draft PR for exploring a potential `gsimp` tactic. It would be able to do some things that the current `grw` tactic cannot do. --- [](https://gitpod.io/from-referrer/) | t-meta | 1656/0 | Mathlib/Tactic/GSimp/Core.lean,Mathlib/Tactic/GSimp/Elab.lean,Mathlib/Tactic/GSimp/GSimpTheorems.lean,Mathlib/Tactic/GSimp/Rewrite.lean,Mathlib/Tactic/GSimp/Types.lean,MathlibTest/GSimp.lean | 6 | 3 | ['github-actions', 'mathlib-bors'] | nobody | 1 month ago | 69 days ago | 6 seconds |
| 27306 | xyzw12345 | feat: `lie_ring` tactic and `LieReduce` command | This PR continues the work from #22196. Original PR: https://github.com/leanprover-community/mathlib4/pull/22196 | t-meta merge-conflict | 789/2 | Mathlib.lean,Mathlib/Algebra/Lie/Derivation/AdjointAction.lean,Mathlib/Tactic.lean,Mathlib/Tactic/LieAlgebra/Basic.lean,Mathlib/Tactic/LieAlgebra/LieRingNF.lean,Mathlib/Util/AtomM.lean,MathlibTest/lie_ring.lean,scripts/noshake.json | 8 | 34 | ['FLDutchmann', 'JovanGerb', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'xyzw12345'] | JovanGerb | 1 month ago | 161 days ago | 70 days |
| 35042 | JovanGerb | chore: remove `meta` form `import Mathlib.Tactic...` | This PR cleans up some imports of the form `import Mathlib.Tactic...`, by either removing them entirely, or removing the `meta` keyword. It should never be necessary to `meta import` a file from `Mathlib.Tactic`, because the relevant definitions should already have been marked as `meta`. The motivation is to reduce the amount of files that are `meta` imported when writing e.g. `import Mathlib`, hence reducing the amount of stuff that needs to be loaded. There are more other `meta import`s that need to be removed, but this PR is a good start. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 61/142 | Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/Group/Action/Hom.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/Data/List/ChainOfFn.lean,Mathlib/Dynamics/OmegaLimit.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/DomAct/Basic.lean,Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/ApplyFun.lean,Mathlib/Tactic/ArithMult.lean,Mathlib/Tactic/Bound.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Normalize.lean,Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/CheckCompositions.lean,Mathlib/Tactic/CategoryTheory/Coherence/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/Normalize.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/Elementwise.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/ToApp.lean,Mathlib/Tactic/Choose.lean,Mathlib/Tactic/DeclarationNames.lean,Mathlib/Tactic/DefEqTransformations.lean,Mathlib/Tactic/DeriveCountable.lean,Mathlib/Tactic/DeriveFintype.lean,Mathlib/Tactic/DeriveTraversable.lean,Mathlib/Tactic/ENatToNat.lean,Mathlib/Tactic/Explode.lean,Mathlib/Tactic/Explode/Pretty.lean,Mathlib/Tactic/FinCases.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GRewrite/Elab.lean,Mathlib/Tactic/Group.lean,Mathlib/Tactic/IrreducibleDef.lean,Mathlib/Tactic/Lift.lean,Mathlib/Tactic/Linarith.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/Gauss.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Preprocessing.lean,Mathlib/Tactic/Linarith/Verification.lean,Mathlib/Tactic/LinearCombination/Lemmas.lean,Mathlib/Tactic/Linter/DeprecatedSyntaxLinter.lean,Mathlib/Tactic/Linter/DocPrime.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Tactic/Linter/EmptyLine.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/Linter/GlobalAttributeIn.lean,Mathlib/Tactic/Linter/HashCommandLinter.lean,Mathlib/Tactic/Linter/Multigoal.lean,Mathlib/Tactic/Linter/OldObtain.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/Linter/TextBased.lean,Mathlib/Tactic/Linter/TextBased/UnicodeLinter.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,Mathlib/Tactic/Linter/UnusedTacticExtension.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Nontriviality/Core.lean,Mathlib/Tactic/NormNum/DivMod.lean,Mathlib/Tactic/NormNum/Ineq.lean,Mathlib/Tactic/NormNum/Prime.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/Order/CollectFacts.lean,Mathlib/Tactic/Order/Graph/Tarjan.lean,Mathlib/Tactic/PNatToNat.lean,Mathlib/Tactic/Peel.lean,Mathlib/Tactic/ProdAssoc.lean,Mathlib/Tactic/ProxyType.lean,Mathlib/Tactic/Push.lean,Mathlib/Tactic/Qify.lean,Mathlib/Tactic/RSuffices.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Tactic/Ring/Common.lean,Mathlib/Tactic/Ring/Compare.lean,Mathlib/Tactic/Ring/PNat.lean,Mathlib/Tactic/Simproc/Divisors.lean,Mathlib/Tactic/Simproc/FinsetInterval.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Subsingleton.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,Mathlib/Tactic/TautoSet.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/TagUnfoldBoundary.lean,Mathlib/Tactic/Widget/Calc.lean,Mathlib/Tactic/Widget/CommDiag.lean,Mathlib/Tactic/Widget/CongrM.lean | 107 | 9 | ['JovanGerb', 'dupuisf', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | robin-carlier | 1 month ago | 46 days ago | 26 days |
| 36716 | mcdoll | chore(Analysis/SchwartzSpace): golf a proof | --- - [ ] depends on: #36711 [](https://gitpod.io/from-referrer/) | WIP t-analysis blocked-by-other-PR | 45/17 | Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Seminorm.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | unknown | 0 seconds |
| 36595 | mcdoll | feat(Analysis/TemperedDistribution): polynomially bounded locally integrable functions define tempered distributions | --- - [ ] depends on: #36711 [](https://gitpod.io/from-referrer/) | WIP t-analysis blocked-by-other-PR | 127/0 | Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 49 days ago | 1 second |
| 35263 | astrainfinita | refactor: use `OrderSupInfSet` | --- - [ ] depends on: #35297 - [ ] depends on: #35328 - [ ] depends on: #35774 - [ ] depends on: #35674 [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F/with/573799342) [](https://gitpod.io/from-referrer/) | t-order large-import blocked-by-other-PR merge-conflict | 952/701 | Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/Algebra/Order/Nonneg/Lattice.lean,Mathlib/Algebra/Tropical/Lattice.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/CategoryTheory/Category/Pairwise.lean,Mathlib/CategoryTheory/Limits/Lattice.lean,Mathlib/CategoryTheory/Sites/Sieves.lean,Mathlib/CategoryTheory/Subfunctor/Basic.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Data/Fintype/Order.lean,Mathlib/Data/Int/ConditionallyCompleteOrder.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Data/Set/BooleanAlgebra.lean,Mathlib/Geometry/Convex/Cone/Basic.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/Order/Atoms.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Bounds/Defs.lean,Mathlib/Order/Bounds/Image.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/CompleteBooleanAlgebra.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/CompleteLattice/Lemmas.lean,Mathlib/Order/CompleteLattice/PiLex.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/Concept.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/Copy.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/FixedPoints.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Hom/Order.lean,Mathlib/Order/Interval/Basic.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Order/Nucleus.lean,Mathlib/Order/ScottContinuity/Prod.lean,Mathlib/Order/SupClosed.lean,Mathlib/Probability/Process/Filtration.lean,Mathlib/RingTheory/TwoSidedIdeal/Lattice.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/Topology/Algebra/Group/GroupTopology.lean,Mathlib/Topology/Algebra/Module/ClosedSubmodule.lean,Mathlib/Topology/Algebra/Ring/Basic.lean,Mathlib/Topology/Order/HullKernel.lean,Mathlib/Topology/UniformSpace/Basic.lean | 58 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 36587 | yhx-12243 | feat(Algebra/GCDMonoid): Distributive lattice structure for Associates in GCDMonoid | Add a distributive lattice structure for `Associates α` in `GCDMonoid`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 61/3 | Mathlib.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/GCDMonoid/DistribLattice.lean | 3 | 2 | ['github-actions'] | nobody | 1 month ago | 46 days ago | 47 minutes |
| 36323 | SproutSeeds | feat(Inversion): discontinuity and center/global fderiv formulas | Part of #5939 Adds the discontinuity-at-center lemma for inversion and derives the center/global `fderiv` formulas from it. This draft currently builds on the preceding cobounded-tendsto lemma from #36313 while that earlier slice is under review. Scope is limited to `Mathlib/Geometry/Euclidean/Inversion/Calculus.lean`. Tools used: Codex 5.3 extra high --- Happy to adjust naming, placement, or proof style based on maintainer preference. | t-euclidean-geometry new-contributor LLM-generated | 65/0 | Mathlib/Geometry/Euclidean/Inversion/Basic.lean,Mathlib/Geometry/Euclidean/Inversion/Calculus.lean | 2 | 2 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 33691 | kim-em | feat(scripts): add find-ci-errors.sh to diagnose widespread CI failures | This PR adds a script that searches through recent failed CI workflow runs to find open PRs whose current CI contains a specific error string. Useful for diagnosing widespread CI issues affecting multiple PRs (e.g., infrastructure problems, toolchain bugs). **Usage:** ```bash # Find all PRs currently failing with a specific error ./scripts/find-ci-errors.sh "Error parsing args: cannot parse arguments" # Find PRs and automatically add please-merge-master label to trigger rebuilds ./scripts/find-ci-errors.sh --please-merge-master "cannot parse arguments" ``` The `--please-merge-master` flag skips PRs with merge conflicts, and the label is automatically removed by CI once the build completes. 🤖 Prepared with Claude Code | CI delegated merge-conflict LLM-generated | 196/0 | scripts/README.md,scripts/find-ci-errors.sh | 2 | 6 | ['bryangingechen', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 114 days ago | 1 hour |
| 35125 | kim-em | chore: make OrderDual a structure | This PR changes `OrderDual` from a type alias (`def OrderDual (α : Type*) := α`) to a one-field structure: ```lean structure OrderDual (α : Type*) where toDual :: ofDual : α ``` This prevents defeq abuse between `α` and `αᵒᵈ`, requiring explicit `toDual`/`ofDual` wrapping at type boundaries. 🤖 Prepared with Claude Code | WIP large-import merge-conflict LLM-generated | 10540/4872 | Mathlib/Algebra/AddConstMap/Basic.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Group/Finsupp.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/Algebra/Module/Submodule/Range.lean,Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/MvPolynomial/NoZeroDivisors.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/BigOperators/Group/Finset.lean,Mathlib/Algebra/Order/BigOperators/Group/List.lean,Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean,Mathlib/Algebra/Order/Chebyshev.lean,Mathlib/Algebra/Order/Group/Action/Synonym.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/Indicator.lean,Mathlib/Algebra/Order/Group/Lattice.lean,Mathlib/Algebra/Order/Group/MinMax.lean,Mathlib/Algebra/Order/Group/OrderIso.lean,Mathlib/Algebra/Order/Group/Pointwise/Bounds.lean,Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Module/Field.lean,Mathlib/Algebra/Order/Module/Pointwise.lean,Mathlib/Algebra/Order/Module/Synonym.lean,Mathlib/Algebra/Order/Monoid/Unbundled/OrderDual.lean,Mathlib/Algebra/Order/Rearrangement.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Algebra/Order/Ring/Synonym.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Order/UpperLower.lean,Mathlib/AlgebraicGeometry/AffineSpace.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Rank.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Convex/Jensen.lean,Mathlib/Analysis/Convex/Quasiconvex.lean,Mathlib/Analysis/Convex/Star.lean,Mathlib/Analysis/Convex/Topology.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/InnerProductSpace/Projection/Submodule.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/Normed/Group/Constructions.lean,Mathlib/Analysis/Normed/Order/Lattice.lean,Mathlib/CategoryTheory/Abelian/Subobject.lean,Mathlib/CategoryTheory/Localization/Bousfield.lean,Mathlib/CategoryTheory/MorphismProperty/LiftingProperty.lean,Mathlib/CategoryTheory/Subobject/ArtinianObject.lean,Mathlib/CategoryTheory/Subobject/Limits.lean,Mathlib/Combinatorics/Enumerative/IncidenceAlgebra.lean,Mathlib/Combinatorics/Pigeonhole.lean,Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/DFinsupp/WellFounded.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Inv.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/Fin/Tuple/Basic.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/Finset/Lattice/Pi.lean,Mathlib/Data/Finset/Lattice/Prod.lean,Mathlib/Data/Finset/Lattice/Union.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/Finset/NAry.lean,Mathlib/Data/Finset/PiInduction.lean,Mathlib/Data/Finset/Sigma.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/WellFounded.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Fintype/Lattice.lean,Mathlib/Data/List/MinMax.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Pairing.lean,Mathlib/Data/Ordmap/Invariants.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/Real/Pointwise.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/Data/Set/Finite/Lemmas.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Data/Set/Monotone.lean,Mathlib/Data/Set/Piecewise.lean,Mathlib/Data/Set/Sigma.lean,Mathlib/Data/Sum/Order.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/GroupTheory/GroupAction/FixingSubgroup.lean,Mathlib/LinearAlgebra/AffineSpace/Ordered.lean | 324 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 35214 | kim-em | chore: use @[to_dual] in GaloisConnection and Interval.Set.Disjoint | This PR adds `@[to_dual]` annotations to 9 theorems in `GaloisConnection/Basic.lean` and 1 in `Interval/Set/Disjoint.lean`, deleting the hand-written dual theorems that are now auto-generated. In `GaloisConnection/Basic.lean`, the entire `section SemilatticeInf` block (containing `u_inf`) is deleted since `l_sup` now generates it via `@[to_dual]`. Similarly for `u_iInf`, `u_iInf₂`, `u_sInf`, and several bounds/image lemmas. [Diff relative to #35213](https://github.com/kim-em/mathlib4/compare/kim/to-dual-ccl-extended...kim/to-dual-galois-connection) - [ ] depends on: #35213 🤖 Prepared with Claude Code | blocked-by-other-PR merge-conflict LLM-generated | 204/526 | Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Topology/Order.lean | 8 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 77 days ago | 11 minutes |
| 34892 | kim-em | experiment: by claude | LLM-generated | 88/0 | claude.md | 1 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds | |
| 33707 | jcommelin | ci: add commit verification for transient and automated commits | This PR adds a CI workflow that verifies PRs correctly use transient and automated commits, and provides reviewers with a clear summary of which commits need human review.
Commit types:
- **Substantive commits**: Regular commits requiring human review
- **Automated commits** (`x: |
CI merge-conflict LLM-generated | 685/0 | .github/workflows/commit_verification.yml,scripts/verify_commits.sh,scripts/verify_commits_summary.sh | 3 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 114 days ago | 1 minute |
| 33680 | BoltonBailey | feat(Probability/ProbabilityMassFunction): add Total Variation distance | Adds the statistical distance/total variation distance. See Zulip discussion: - [#Is there code for X? > total variation distance between two PMFs](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/total.20variation.20distance.20between.20two.20PMFs/with/566810511) This PR was authored with the support of Claude Opus 4.5 --- - [ ] depends on: #33689 [provide an API for NNReal-returning function] [](https://gitpod.io/from-referrer/) | t-measure-probability blocked-by-other-PR LLM-generated | 47/0 | Mathlib/Probability/ProbabilityMassFunction/Distance.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 98 days ago | 13 minutes |
| 32374 | adamtopaz | feat(Tactic/WildcardUniverse): Foo.{*, _, v*, max u v} | This PR creates an elaborator for syntax of the form `Foo.{*, _, v*, max u v}`. A `*` indicates that a new universe parameter should be created, `_` and `max u v` elaborate using the existing level elaboration (so `_` elaborates to a level mvar). The syntax `v*` creates a level parameter of the form `v_n` for some value of `n`.
The newly created level parameters are ordered in a particular way to match the order in which they appear in the syntax. For example, in `Foo.{*, _, v*, max u v}`, the level parameter associated with `*` will come before the other universes, including the parameter created by `v*`, and the parameters `u` and `v`. Similarly the parameter associated with `v*` will come *after* the one for `*`, and before both `u` and `v`.
Note: Unlike `Category* C`, where we understand exactly how the universes involved in `C` (both in the term and its type) relate to the level parameter of the morphisms, we can't expect such precise control in general. For example, when `C.{u} : Type 0`, `Category* C` places the morphism level `v_1` before `u`, but `Category.{*} C` places it after `u`. In other words, `Foo.{...}` only reorders the level parameters based on the parameters that appear in the (elaborated) `...`, without any regard to the universes that appear in the *arguments* to `Foo.{...}`.
Co-authored-by: Claude |
t-meta awaiting-author WIP LLM-generated | 720/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/WildcardLevel.lean,MathlibTest/WildcardLevel.lean | 4 | 52 | ['JovanGerb', 'adamtopaz', 'fpvandoorn', 'github-actions', 'leanprover-radar'] | JovanGerb and dwrensha | 1 month ago | 80 days ago | 63 days |
| 35651 | sun123zxy | feat(Mathlib/RingTheory/Ideal/Cotangent): `Submodule.map` definition of cotangent spaces | This PR adds an alternative definition of the cotangent space as an image under the R-module quotient map. --- Split from PR #33247 [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 32/18 | Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean | 2 | 20 | ['chrisflav', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'sun123zxy'] | chrisflav | 1 month ago | 46 days ago | 16 days |
| 36563 | EtienneC30 | feat: brownian processes | --- [](https://gitpod.io/from-referrer/) | brownian t-measure-probability merge-conflict | 1517/1 | Mathlib.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/Probability/BrownianMotion/GaussianProjectiveFamily.lean,Mathlib/Probability/BrownianMotion/IsBrownian.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Multivariate.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/HasLaw.lean,Mathlib/Probability/Moments/Basic.lean,Mathlib/Probability/Moments/Covariance.lean,Mathlib/Probability/Process/Filtration.lean | 12 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 36757 | alok | feat(Order/Filter): add Filter.IsFree and Filter.IsNonprincipal | ## Summary Adds two filter predicates and their basic API: - **`Filter.IsFree`**: no point belongs to every set (`f.ker = ∅`), equivalently `f ≤ cofinite` - **`Filter.IsNonprincipal`**: not equal to `𝓟 s` for any set `s` Every free `NeBot` filter is non-principal (`IsFree.isNonprincipal`), but the converse fails for general filters (e.g. `𝓝 x` in a non-discrete T₁ space is non-principal but not free). For ultrafilters the two notions coincide (`Ultrafilter.isNonprincipal_iff_isFree`). On finite types, no `NeBot` filter is free (`not_isFree_of_neBot`). ## Test plan - [x] `lake build Mathlib.Order.Filter.Cofinite` passes - [x] `lake build Mathlib.Order.Filter.Ultrafilter.Basic` passes 🤖 Generated with [Claude Code](https://claude.com/claude-code) | t-order new-contributor | 98/1 | Mathlib/Order/Filter/Cofinite.lean,Mathlib/Order/Filter/Ultrafilter/Basic.lean | 2 | 2 | ['github-actions'] | nobody | 1 month ago | 45 days ago | 1 hour |
| 33832 | alreadydone | feat(Algebra): localization preserves unique factorization | --- - [x] depends on: #33851 [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 143/12 | Mathlib.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/GroupWithZero/Associated.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/UniqueFactorization.lean,Mathlib/RingTheory/Localization/Defs.lean | 6 | 11 | ['Vierkantor', 'dagurtomas', 'github-actions', 'mathlib4-dependent-issues-bot'] | Vierkantor | 1 month ago | 85 days ago | 15 days |
| 35058 | GrigorenkoPV | chore: move tendsto_{floor,ceil}_at{Top,Bot} | Moves: - Topology.Algebra.Order.Floor.tendsto_floor_atTop -> Order.Filter.AtTopBot.Floor.tendsto_floor_atTop - Topology.Algebra.Order.Floor.tendsto_floor_atBot -> Order.Filter.AtTopBot.Floor.tendsto_floor_atBot - Topology.Algebra.Order.Floor.tendsto_ceil_atTop -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atTop - Topology.Algebra.Order.Floor.tendsto_ceil_atBot -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atBot --- Tracked in #7987 [](https://gitpod.io/from-referrer/) | new-contributor large-import awaiting-author | 22/25 | Mathlib/Order/Filter/AtTopBot/Floor.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 2 | 3 | ['GrigorenkoPV', 'github-actions', 'j-loreaux'] | nobody | 1 month ago | 51 days ago | 27 days |
| 34876 | GrigorenkoPV | feat(Tactic/AssumptionQuestion): add `assumption?` tactic | --- As requested in #10361 TODO: maybe add some tests? [](https://gitpod.io/from-referrer/) | t-meta new-contributor awaiting-author | 85/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/AssumptionQuestion.lean,Mathlib/Tactic/Common.lean,MathlibTest/AssumptionQuestion.lean,scripts/noshake.json | 6 | 5 | ['GrigorenkoPV', 'SnirBroshi', 'github-actions', 'joneugster'] | joneugster | 1 month ago | 84 days ago | 23 hours |
| 34814 | GrigorenkoPV | feat(Tactic/ClearUnneeded): add `clear_unneeded` tactic | --- The simplest version suggested in https://github.com/leanprover-community/mathlib4/issues/25319 [](https://gitpod.io/from-referrer/) | t-meta new-contributor please-merge-master awaiting-author | 94/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ClearUnneeded.lean,Mathlib/Tactic/Common.lean,MathlibTest/ClearUnneeded.lean,scripts/noshake.json | 6 | 12 | ['BoltonBailey', 'GrigorenkoPV', 'github-actions', 'joneugster'] | joneugster | 1 month ago | 84 days ago | 2 days |
| 36146 | Multramate | feat(AlgebraicGeometry/GammaSpecAdjunction): add equivalences for Spec morphisms that commute with algebra maps | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry t-algebra awaiting-author | 46/2 | Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean,Mathlib/AlgebraicGeometry/Scheme.lean | 3 | 18 | ['CBirkbeck', 'Multramate', 'chrisflav', 'erdOne', 'github-actions'] | dagurtomas | 1 month ago | 45 days ago | 12 days |
| 35738 | GrigorenkoPV | perf: remove some `aesop`s and `grind`s | --- Needs benchmarking. After that I can split it into several smaller portions, if needed. [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author | 236/92 | Mathlib/Data/Finset/Card.lean,Mathlib/Data/Rel.lean,Mathlib/Data/Set/Lattice/Image.lean,Mathlib/Data/Set/Prod.lean,Mathlib/Logic/Equiv/Prod.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/SupIndep.lean | 8 | 7 | ['github-actions', 'mathlib-merge-conflicts', 'themathqueen', 'vihdzp'] | nobody | 1 month ago | 65 days ago | 12 hours |
| 36015 | mcdoll | chore(Analysis/SchwartzMap): unify style for `mkCLM` uses | Avoid using `refine` for definitions in favour of `where finally` and unify the indentation. --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 238/208 | Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Deriv.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean | 3 | 9 | ['github-actions', 'j-loreaux', 'mcdoll'] | j-loreaux | 1 month ago | 44 days ago | 9 days |
| 35296 | Rida-Hamadani | feat(SimpleGraph): taking or droping from a cycle results in a path | --- - [x] depends on: #33249 - [ ] depends on: #35295 - [ ] depends on: #35292 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics merge-conflict | 80/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean,Mathlib/Data/List/Infix.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 76 days ago | 20 minutes |
| 35524 | grunweg | feat: text-based linter against \t followed by tactic mode | Wait for the zulip discussion to converge. **If** there is consensus in favour of this change, summarise the motivation here. [zulip discuss](https://leanprover.zulipchat.com/#narrow/channel/345428-mathlib-reviewers/topic/proposal.3A.20no.20more.20use.20of.20.60.E2.96.B8.60.20in.20Mathlib.3F/with/574680826) --- There are currently 80 remaining exceptions in mathlib: ideally, these would get fixed before merging this. Works best when combined with #35523. [](https://gitpod.io/from-referrer/) | t-linter awaiting-zulip merge-conflict | 23/2 | Mathlib/Tactic/Linter/TextBased.lean | 1 | 5 | ['github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | 71 days ago | 3 minutes |
| 34626 | grunweg | feat: analytification of schemes (affine case) | This branch is for tracking purposes; the code in this branch will take a while to get merged into mathlib. The affine case depends on the regular value theorem (which is a master's thesis I am supervising now), the general case will also require gluing manifolds (another thesis). Merging both before the end of this year is an optimistic estimate. That said, pieces and pre-requisites (such as, submersions, their composition properties and the definition of submanifolds) can and hopefully get merged much sooner! --- - [ ] depends on: #28796 - [ ] depends on: #26087 - [x] depends on: #34991 - [x] depends on: #35057 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR please-merge-master | 3322/50 | Mathlib.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Normed/Module/ContinuousLeftInverse.lean,Mathlib/Analysis/Normed/Module/ContinuousRightInverse.lean,Mathlib/Analysis/Normed/Module/Splits.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean,Mathlib/Geometry/Manifold/LocalSourceTargetProperty.lean,Mathlib/Geometry/Manifold/MSplits.lean,Mathlib/Geometry/Manifold/RegularPoint.lean,Mathlib/Geometry/Manifold/RegularValueTheorem.lean,Mathlib/Geometry/Manifold/Scheme.lean,Mathlib/Geometry/Manifold/SliceModel.lean,Mathlib/Geometry/Manifold/SmoothEmbedding.lean,Mathlib/Geometry/Manifold/Submanifold.lean,Mathlib/Geometry/Manifold/Submersion.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 20 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 90 days ago | 1 second |
| 26078 | kckennylau | feat(AlgebraicGeometry): add x, y, px, py for points on elliptic curves | --- Split from #25218. [](https://gitpod.io/from-referrer/) | awaiting-author t-algebraic-geometry | 44/0 | Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean | 1 | 12 | ['MichaelStollBayreuth', 'Multramate', 'acmepjz', 'dagurtomas', 'github-actions', 'kckennylau'] | nobody | 1 month ago | 253 days ago | 64 days |
| 28972 | themathqueen | feat(LinearAlgebra/Matrix): star-algebra automorphisms on matrices are unitarily inner | Characterization of star-algebra automorphisms on matrices: for any star-algebra automorphism `f` on matrices, there exists a unitary matrix `U` such that `f x = U * x * star U`. More generally, this shows that given star-homomorphisms `f` and `g` from `B` to a star-algebra `A` and that the centralizer of `range g` is trivial, then `f x = U * g x * U⁻¹` for some invertible element `U` if and only if `f x = U * g x * star U` for some unitary `U`. Then a corollary to this and [AlgEquiv.eq_linearEquivConjAlgEquiv](https://leanprover-community.github.io/mathlib4_docs/Mathlib/LinearAlgebra/GeneralLinearGroup/AlgEquiv.html#AlgEquiv.eq_linearEquivConjAlgEquiv) is that star-algebra automorphisms on matrices are unitarily inner. Another quick corollary to this and [ContinuousAlgEquiv.eq_continuousLinearEquivConjContinuousAlgEquiv](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.html#ContinuousAlgEquiv.eq_continuousLinearEquivConjContinuousAlgEquiv) is that star-algebra automorphisms on endomorphisms in `ℂ`-Hilbert spaces are unitarily inner. (See #33066 for the more general version of this.) --- - [x] depends on: #28100 - [x] depends on: #28182 - [x] depends on: #28881 [](https://gitpod.io/from-referrer/) | t-algebra t-analysis awaiting-author | 138/0 | Mathlib.lean,Mathlib/Analysis/Matrix/StarAlgEquiv.lean | 2 | 5 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'themathqueen'] | nobody | 1 month ago | 123 days ago | 1 day |
| 31092 | FlAmmmmING | feat(Algebra/Group/ForwardDiff.lean): Add theorem `sum_shift_eq_fwdDiff_iter`. | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor delegated | 17/1 | Mathlib/Algebra/Group/ForwardDiff.lean | 1 | 20 | ['BeibeiX0', 'FlAmmmmING', 'Ruben-VandeVelde', 'dagurtomas', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 99 days ago | 54 days |
| 32608 | PrParadoxy | feat(LinearAlgebra/PiTensorProduct): API for PiTensorProducts indexed by sets | This PR addresses a TODO item in LinearAlgebra/PiTensorProduct.lean: * API for the various ways ι can be split into subsets; connect this with the binary tensor product -- specifically by describing tensors of type ⨂ (i : S), M i, for S : Set ι. Our primary motivation is to formalise the notion of "restricted tensor products". This will be the content of a follow-up PR. Beyond that, the Set API is natural in contexts where the index type has an independent interpretation. An example is quantum physics, where ι ranges over distinguishable degrees of freedom, and where its is common practice to annotate objects by the set of indices they are defined on. --- Stub file with preliminary definition of the restricted tensor product as a direct limit of tensors indexed by finite subsets of an index type: https://github.com/PrParadoxy/mathlib4/blob/restricted-stub/Mathlib/LinearAlgebra/PiTensorProduct/Restricted.lean --- - [x] depends on: #32598 [](https://gitpod.io/from-referrer/) | new-contributor awaiting-zulip t-algebra | 300/2 | Mathlib.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Set.lean | 3 | 28 | ['PrParadoxy', 'dagurtomas', 'eric-wieser', 'github-actions', 'goliath-klein', 'leanprover-radar', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 130 days ago | 10 days |
| 32745 | LTolDe | feat(Topology/Algebra): add MulActionConst.lean | add Topology/Algebra/MulActionConst.lean introduce class `ContinuousSMulConst` for a scalar multiplication that is continuous in the first argument, in analogy to `ContinuousConstSMul` define `MulAction.ball x U` as the set `U • {x}` given `[SMul G X] (x : X) (U : Set G)` The lemmas shown here will be useful to prove the **Effros Theorem**, see [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Effros.20Theorem/with/558712441). --- [](https://gitpod.io/from-referrer/) | awaiting-author new-contributor t-topology | 117/0 | Mathlib.lean,Mathlib/Topology/Algebra/MulActionConst.lean | 2 | 8 | ['LTolDe', 'github-actions', 'urkud'] | nobody | 1 month ago | 108 days ago | 16 days |
| 36119 | Ruizsolveall | feat(Topology/Covering): fundamental group of the circle is ℤ | - Proves that the fundamental group of the circle `π₁(S¹, 0)` is isomorphic to `ℤ`, via covering space theory. - Constructs the winding number map `nLoop : ℤ → Path 0 0` on `AddCircle 1`, and proves it is surjective (`nLoop_surjective`), injective (`nLoop_homotopic_iff`), and additive (`nLoop_add`). - Assembles these into the group isomorphism `windingNumberIso : Multiplicative ℤ ≃* FundamentalGroup (AddCircle 1) 0`. ## Approach Uses the covering map `ℝ → AddCircle 1` and unique path lifting to establish the bijection between homotopy classes of loops and integers (winding numbers). Homotopy invariance of lifted endpoints gives injectivity; surjectivity follows from lifting arbitrary loops. Additivity uses path concatenation of lifts in the simply connected total space `ℝ`. ## AI disclosure I used Claude (Anthropic) to write the PR description, code comments, and to help refine code style. The proof strategy and all Lean code are my own. I understand and can vouch for all the code in this PR. | t-topology new-contributor awaiting-author LLM-generated | 236/0 | Mathlib.lean,Mathlib/Topology/Covering/FundamentalGroupCircle.lean | 2 | 26 | ['Ruizsolveall', 'SnirBroshi', 'b-mehta', 'dagurtomas', 'github-actions', 'grunweg', 'vihdzp'] | nobody | 1 month ago | 49 days ago | 8 days |
| 34195 | eric-wieser | feat: continuous bundled actions | These are `Continuous` versions of existing definitions. --- [](https://gitpod.io/from-referrer/) | t-topology t-algebra large-import | 64/0 | Mathlib/Topology/Algebra/ContinuousMonoidHom.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 43 days ago | 59 minutes |
| 35588 | eric-wieser | chore(Util/Qq): remove `meta` | These are wrappers of existing functions on `Expr`s which are also not marked `meta`. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-CI delegated | 7/7 | Mathlib/Data/Multiset/Sort.lean,Mathlib/Tactic/FieldSimp/Lemmas.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/Order/ToInt.lean,Mathlib/Tactic/Simproc/Divisors.lean,Mathlib/Tactic/Simproc/FinsetInterval.lean,Mathlib/Util/Qq.lean | 7 | 3 | ['Vierkantor', 'github-actions', 'mathlib-bors'] | nobody | 1 month ago | 69 days ago | 1 minute |
| 36487 | samueloettl | feat(Dynamics): Ergodicity characterization | --- - [ ] depends on: #35402 - [x] depends on: #35451 This is a work in progress for a characterization of ergodicity via a Birkhoff Average. Coarse Feedback is very encouraged. [](https://gitpod.io/from-referrer/) | WIP new-contributor large-import blocked-by-other-PR | 421/1 | Mathlib/Dynamics/Ergodic/Function.lean,Mathlib/Dynamics/Ergodic/OnAverageIndependent.lean,Mathlib/Topology/MetricSpace/Pseudo/Basic.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 51 days ago | 2 minutes |
| 35951 | parabamoghv | feat(CategoryTheory/Monoidal): evaluation coevaluation isomorphisms | This PR adds four features to rigid categories: 1. `coevaluation_evaluation` and `evaluation_coevaluation` as isomorphism equalities: Using `IsIso` instances for the `evaluation` and `coevaluation` morphisms, we promote the morphism equalities to isomorphism equalities. 2. `ExactPairing Y X` from `ExactPairing X Y`: Using an exact pairing and `IsIso` instances for both `evaluation` and `coevaluation`, we swap the exact pairing by inverting the evaluation and coevaluation morphisms. Any suggestions for the definition name are welcome. Right now it is `ExactPairing.Symm`. The second choice was `ExactPairing.Swap`. 3. `HasLeftDual X` from `HasRightDual X`: Using a `HasRightDual X` instance and relevant `IsIso` instances, we construct a left dual. Similar construction for the other way. 4. `LeftDual` isomorphic to `RightDual`: Using relevant `IsIso` instances, we provide the isomorphism from the left dual of an object to the right dual. This can be achieved in two ways: either by using `leftDualIso` or using `rightDualIso`. We will prove in a subsequent PR that both these isomorphisms are equal. Motivation: This is part of an effort to formalize CategoricalGroups, which can be defined as right rigid groupoids. The approach is motivated by the discussion in [#34830](https://github.com/leanprover-community/mathlib4/pull/34830). Any comments or suggestions are welcome, especially about the naming. --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author | 64/2 | Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean | 1 | 18 | ['dagurtomas', 'github-actions', 'joelriou', 'parabamoghv', 'robin-carlier'] | robin-carlier | 1 month ago | 43 days ago | 7 days |
| 35956 | Scarlett-le | feat: add orthogonality lemmas for inner product spacesonal | ## Summary Adds two lemmas about orthogonality in inner product spaces. ## New declarations - `real_inner_sub_smul_div_inner_self_eq_zero` (`Mathlib.Analysis.InnerProductSpace.Basic`): the inner product of `u - (⟪u, d⟫_ℝ / ⟪d, d⟫_ℝ) • d` with `d` is zero; subtracting the orthogonal projection of `u` onto `d` yields a vector orthogonal to `d`. Holds unconditionally including when `d = 0`. - `mem_span_singleton_of_inner_eq_zero_of_inner_eq_zero` (`Mathlib.Analysis.InnerProductSpace.Projection.FiniteDimensional`): in a two-dimensional inner product space, if nonzero vectors `w` and `u` are both orthogonal to the same nonzero vector `v`, then `u` lies in the span of `w`. | t-analysis awaiting-author | 26/0 | Mathlib/Analysis/InnerProductSpace/Projection/FiniteDimensional.lean | 1 | 9 | ['Scarlett-le', 'github-actions', 'j-loreaux'] | sgouezel | 1 month ago | 44 days ago | 10 days |
| 35095 | thorimur | feat: overlapping instances linter | This PR contributes a syntax linter that fires on declarations with local instances which overlap on data-carrying projections, developed as an interactive version of @JovanGerb 's environment linter for the same purpose (#33677).
It is currently prohibitively expensive to run this linter in CI (see [bench results](https://radar.lean-lang.org/repos/mathlib4/commits/5a9f0ed1fe60b3a5c94880df4130b1bc1be764ed?reference=789108e1c80a056f4ccbfbc7cc1f9d40594087d3)). This linter therefore only runs interactively, in the language server.
We may want a faster, compiled version to run in CI as an environment linter for a hybrid strategy.
Co-authored-by: Jovan Gerbscheid |
large-import merge-conflict | 619/9 | Mathlib.lean,Mathlib/Algebra/Module/Lattice.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Init.lean,Mathlib/Lean/ContextInfo.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/Lean/Message.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/OverlappingInstances.lean,MathlibTest/OverlappingInstances.lean | 11 | 27 | ['JovanGerb', 'Vierkantor', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'thorimur'] | nobody | 1 month ago | unknown | 0 seconds |
| 36878 | plp127 | chore: override `npow` in compositional monoids | If `FooHom` is the type of foo homomorphisms, then `FooHom A A` naturally gets the structure of a monoid by setting one to be the identity homomorphism and setting multiplication to be composition. This PR overrides the `npow` field of this `Monoid` to have `f ^ n` be definitionally equal to `f^[n]`. `FooEquiv A A` also naturally gets a group structure in the same way, this PR overrides the `npow` field to have `f ^ n` be definitionally equal to `f^[n]` and to have `f ^ (n + 1)` be definitionally equal to `f ^ n * f`. This does break one pre-existing definitional equality: when `e : Equiv.Perm α`, `e⁻¹ ^ n = (e ^ n)⁻¹` will no longer be definitional. This PR also sets the `zpow` field of `Group (FooEquiv A A)` instances to `zpowRec (npow := fun n f => f ^ n)`. In the future we may want to change this so that `(f ^ n).toEquiv` is definitionally equal to `f.toEquiv ^ n`. The monoid and group instances to modify are found by searching loogle for `"one_apply"`. The motivation is to make natural number powers commute definitionally with the coercion from `AlgEquiv` to `LinearMap`. --- [](https://gitpod.io/from-referrer/) | 211/66 | Mathlib/Algebra/AddConstMap/Equiv.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Order/Group/End.lean,Mathlib/Algebra/Ring/Aut.lean,Mathlib/Algebra/Ring/Hom/Defs.lean,Mathlib/Algebra/Star/MonoidHom.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 17 | 3 | ['eric-wieser', 'github-actions', 'plp127'] | nobody | 1 month ago | 42 days ago | 41 minutes | |
| 35213 | kim-em | chore: use @[to_dual] in ConditionallyCompleteLattice | This PR adds `@[to_dual]` annotations across all `ConditionallyCompleteLattice` files: `Defs`, `Basic`, `Indexed`, `Finset`, and `Group`. Auto-generates dual theorems and deletes hand-written versions. (Absorbs the former PR #35212.) [Diff relative to #35209](https://github.com/kim-em/mathlib4/compare/kim/to-dual-complete-lattice...kim/to-dual-ccl-extended) - [ ] depends on: #35209 - [ ] depends on: #35211 🤖 Prepared with Claude Code | merge-conflict LLM-generated | 189/485 | Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 77 days ago | 16 minutes |
| 34165 | zcyemi | feat(Archive/Imo/Imo2012Q5): IMO 2012 Q5 | --- Add IMO 2012 Q5 - [ ] depends on: #34157 - [ ] depends on: #34156 - [ ] depends on: #34155 - [ ] depends on: #33852 - [ ] depends on: #33479 - [ ] depends on: #31500 | blocked-by-other-PR large-import IMO merge-conflict | 965/12 | Archive.lean,Archive/Imo/Imo2012Q5.lean,Mathlib/Analysis/Convex/Between.lean,Mathlib/Geometry/Euclidean/Altitude.lean,Mathlib/Geometry/Euclidean/Sphere/Basic.lean,Mathlib/Geometry/Euclidean/Sphere/Power.lean,Mathlib/Geometry/Euclidean/Triangle.lean,Mathlib/LinearAlgebra/AffineSpace/Independent.lean | 8 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 101 days ago | 25 minutes |
| 35215 | kim-em | chore: use @[to_dual] in FixedPoints | This PR adds `@[to_dual]` annotations to 14 theorems about `lfp` in `Order/FixedPoints.lean`, auto-generating their `gfp` duals and deleting the hand-written versions. Also registers `OrderHom.lfp` as the dual of `OrderHom.gfp` via `attribute [to_dual existing]`. Auto-generated duals include: `le_gfp`, `gfp_le_fixed`, `gfp_le`, `gfp_le_map`, `map_gfp`, `isFixedPt_gfp`, `map_le_gfp`, `isGreatest_gfp_le`, `isGreatest_gfp`, `gfp_induction`, `map_gfp_comp`, `gfp_gfp`, `map_inf_fixedPoints_le`, `map_sInf_subset_fixedPoints_le`. [Diff relative to #35208](https://github.com/kim-em/mathlib4/compare/kim/to-dual-bounds-basic...kim/to-dual-fixed-points) - [x] depends on: #35208 🤖 Prepared with Claude Code | LLM-generated merge-conflict | 249/548 | Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/FixedPoints.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Topology/Order.lean | 8 | 11 | ['JovanGerb', 'github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | alexjbest | 1 month ago | 42 days ago | 24 days |
| 34028 | floor-licker | feat(SimpleGraph): add max-flow/min-cut weak duality | This PR introduces a basic s–t flow setup for undirected SimpleGraphs and proves the standard weak-duality inequality: for any feasible flow f and any s–t cut S, value f ≤ cutCapacity S. This is a small, self-contained lemma I extracted while working on larger graph-theoretic formalizations, in particular, results that will ultimately rely on a full max-flow/min-cut theorem. The full MFMC equality/existence statement is not included here. This is the weak-duality direction (∀ f S, value f ≤ cutCapacity S). | t-combinatorics new-contributor | 169/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/MaxFlowMinCut.lean | 2 | 14 | ['SnirBroshi', 'floor-licker', 'github-actions', 'mathlib-merge-conflicts'] | kmill | 1 month ago | 42 days ago | 60 days |
| 27053 | tb65536 | feat: Galois group of `x^n - x - 1` | --- [](https://gitpod.io/from-referrer/) | WIP t-algebra large-import merge-conflict | 270/155 | Archive/Wiedijk100Theorems/AbelRuffini.lean,Mathlib/RingTheory/Polynomial/Morse.lean,Mathlib/RingTheory/Polynomial/Selmer.lean | 3 | 8 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 292 days ago | 1 second |
| 27225 | eric-wieser | refactor(Tactic/Lift): deprecate the third with argument | We already have a number of tactics where the clearing happens all the time, and you have to opt out with `id h`. This also fixes a bug where `lift z to Nat with n hn this_is_unused` would silently ignore `this_is_unused`. --- - [ ] depends on: #27223 [](https://gitpod.io/from-referrer/) | awaiting-author t-meta merge-conflict | 21/9 | Mathlib/Tactic/Lift.lean,MathlibTest/lift.lean | 2 | 9 | ['JovanGerb', 'adomani', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'vihdzp'] | JovanGerb | 1 month ago | 272 days ago | 15 days |
| 28075 | tristan-f-r | chore(Finsupp/Indicator): make non-classical | This was surprising to see on a data-carrying definition. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data easy merge-conflict | 11/9 | Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Data/Finsupp/Indicator.lean | 2 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'ocfnash', 'tristan-f-r'] | nobody | 1 month ago | 266 days ago | 9 hours |
| 33611 | urkud | feat(ImplicitFunction): add a parametric version | --- I'm not sure if the supporting linear algebra lemmas are in the form we want to see them in Mathlib. - [x] depends on: #33585 [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author merge-conflict | 191/0 | Mathlib.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/Analysis/Calculus/ImplicitFunction/Parametric.lean,Mathlib/LinearAlgebra/Prod.lean | 4 | 13 | ['PatrickMassot', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | ADedecker | 1 month ago | 80 days ago | 36 days |
| 34911 | smmercuri | feat: idelic product formula | --- - [x] depends on: #34915 - [x] depends on: #34918 - [x] depends on: #36184 - [x] depends on: #36204 - [ ] depends on: #36275 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 245/10 | Mathlib.lean,Mathlib/Algebra/Group/Submonoid/Units.lean,Mathlib/NumberTheory/NumberField/AdeleRing.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/FiniteAdeleRing.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean | 7 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 84 days ago | 10 seconds |
| 26413 | michaellee94 | feat: existence of maximal solutions for ODEs meeting Picard-Lindelöf conditions | Add existence proof for maximal solution of ODE using Picard-Lindelöf and a uniqueness theorem using Grönwall's lemma. --- - [x] depends on: #26382 - [ ] depends on: #29186 - [ ] depends on: #35043 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-analysis merge-conflict | 1300/431 | Mathlib.lean,Mathlib/Analysis/ODE/Basic.lean,Mathlib/Analysis/ODE/ExistUnique.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/MaximalSolution.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Analysis/ODE/Transform.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Geometry/Manifold/IntegralCurve/Transform.lean,Mathlib/Geometry/Manifold/IntegralCurve/UniformTime.lean,docs/1000.yaml,docs/undergrad.yaml | 13 | 95 | ['botbaki-review', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'michaellee94', 'winstonyin'] | nobody | 1 month ago | 305 days ago | 1 hour |
| 34910 | SnirBroshi | feat(Combinatorics/SimpleGraph/Acyclic): a graph is a tree iff it's acyclic and has exactly `n - 1` edges | --- This was my white whale for quite some time. Hooray! - [x] depends on: #34907 - [ ] depends on: #34909 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 98/1 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/Order/RelIso/Basic.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 84 days ago | 13 minutes |
| 31601 | BoltonBailey | feat(Data/Nat/Choose): A new strictly positive binomial coefficient | This is an experimental PR relating to replacing `Nat.choose` with a strictly positive function equivalently to `Nat.choose a (a + b)`. Currently this introduces a new function `Nat.binom`, but we could also modify `Nat.multinomial`. --- [](https://gitpod.io/from-referrer/) | t-data merge-conflict | 226/1 | Mathlib/Data/Nat/Choose/Binomial.lean,Mathlib/Data/Nat/Choose/Multinomial.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | unknown | 0 seconds |
| 31141 | peabrainiac | feat(Analysis/Calculus): parametric integrals over smooth functions are smooth | Show that for any smooth function `f : H × ℝ → E`, the parametric integral `fun x ↦ ∫ t in a..b, f (x, t) ∂μ` is smooth too. The argument proceeds inductively, using the fact that derivatives of parametric integrals can themselves be computed as parametric integrals. The necessary lemmas on derivatives of parametric integrals already existed, but took some work to apply due to their generality; we state some convenient special cases. --- - [x] depends on: #31077 [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 470/12 | Mathlib/Analysis/Calculus/ParametricIntegral.lean,Mathlib/Analysis/Calculus/ParametricIntervalIntegral.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/Topology/NhdsWithin.lean,Mathlib/Topology/Separation/Regular.lean | 5 | 36 | ['fpvandoorn', 'github-actions', 'j-loreaux', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'peabrainiac', 'sgouezel'] | j-loreaux | 1 month ago | 79 days ago | 33 days |
| 30579 | smmercuri | feat : `v.adicCompletionIntegers K` is compact when `K` is a number field | --- - [x] depends on: #30576 - [x] depends on: #33484 - [x] depends on: #33594 - [ ] depends on: #34045 - [x] depends on: #36067 - [x] depends on: #36137 - [x] depends on: #36184 - [x] depends on: #36492 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 353/15 | Mathlib.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/LiesOverInstances.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/RingTheory/Valuation/Extension.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 8 | 10 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 198 days ago | 13 seconds |
| 36148 | robin-carlier | test: make Category.assoc a pre-simp lemma | --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory merge-conflict | 83/62 | Mathlib/Algebra/Category/ModuleCat/Sheaf/Free.lean,Mathlib/Algebra/Homology/BifunctorHomotopy.lean,Mathlib/Analysis/Normed/Group/SemiNormedGrp/Kernels.lean,Mathlib/CategoryTheory/Category/Basic.lean,Mathlib/CategoryTheory/Dialectica/Basic.lean,Mathlib/CategoryTheory/EffectiveEpi/Comp.lean,Mathlib/CategoryTheory/Endomorphism.lean,Mathlib/CategoryTheory/Galois/GaloisObjects.lean,Mathlib/CategoryTheory/Generator/Basic.lean,Mathlib/CategoryTheory/GuitartExact/Over.lean,Mathlib/CategoryTheory/GuitartExact/VerticalComposition.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/Fubini.lean,Mathlib/CategoryTheory/Limits/Preserves/Shapes/AbelianImages.lean,Mathlib/CategoryTheory/Limits/Shapes/Diagonal.lean,Mathlib/CategoryTheory/Limits/Shapes/Images.lean,Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Connected.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Pasting.lean,Mathlib/CategoryTheory/Limits/Shapes/WidePullbacks.lean,Mathlib/CategoryTheory/Limits/VanKampen.lean,Mathlib/CategoryTheory/Localization/Monoidal/Braided.lean,Mathlib/CategoryTheory/Monoidal/Braided/Transport.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Closed/FunctorToTypes.lean,Mathlib/CategoryTheory/MorphismProperty/Descent.lean,Mathlib/CategoryTheory/Preadditive/Biproducts.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/Precoverage.lean,Mathlib/CategoryTheory/Sites/Hypercover/One.lean | 31 | 4 | ['github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'robin-carlier'] | nobody | 1 month ago | 58 days ago | 2 seconds |
| 36275 | smmercuri | feat: norm for the finite adele ring of a number field | --- - [ ] depends on: #35820 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 184/8 | Mathlib.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/FiniteAdeleRing.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean | 5 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 56 days ago | 8 seconds |
| 36404 | smmercuri | feat: the adele ring of a number field is locally compact | --- - [ ] depends on: #30579 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import merge-conflict | 539/113 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/NumberTheory/NumberField/AdeleRing.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/LiesOverInstances.lean,Mathlib/NumberTheory/NumberField/ProductFormula.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Valuation/Extension.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 10 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 53 days ago | 4 minutes |
| 26221 | grunweg | Mr. Covariant Derivatives | This PR is a work in progress, and will land in individual pieces. Some contributions include - additional API for differentiability of vector bundle sections - finite sums, differences and scalar products of smooth sections are smooth - the same result for mdifferentiable - add missing mdifferentiable congruence lemmas - define smooth local frames of a vector bundle - a general tensoriality criterion - define covariant derivatives, proving their tensoriality and that convex combinations of these are covariant derivatives - the classification of covariant derivatives over a trivial bundle - additional API for the Lie bracket of vector fields: the product rule (one sorry left!), Lie bracket at zero vanishes - torsion of a connection, torsion-free connections - Gram-Schmidt procedure for sections of a Riemannian vector bundle - orthonormal frames on a Riemannian vector bundle - connections compatible with a metric; definition of the Levi-Civita connection - uniqueness of the Levi-Civita connection - Christoffel symbols - in progress: existence of the Levi-Civita connection (connection done; torsion-freeness and compatibility in progress) - custom elaborators for sections in a vector bundle (converting dependent to non-dependent functions) - custom elaborators for inferring a model with corners, in differentiability/smoothness definitions - a `#check'` command and tactic which only shows explicit arguments More to come soon! Joint work with @PatrickMassot; supported by the FMJH. --- - [x] depends on: #26360 - [x] depends on: #26672 - [x] depends on: #26673 - [x] depends on: #26674 - [x] depends on: #26864 (more of a by-product) - [x] depends on: #26865 - [x] depends on: #26866 - [x] depends on: #26870 - [x] depends on: #26871 - [x] depends on: #26671 - [x] depends on: #26676 - [x] depends on: #26677 - [x] depends on: #26678 - [x] depends on: #26686 - [x] depends on: #26687 - [x] depends on: #26688 - [x] depends on: #26702 - [x] depends on: #26709 - [x] depends on: #26734 - [ ] depends on: #26743 - [x] depends on: #26894 - [x] depends on: #26921 - [x] depends on: #26922 - [x] depends on: #27020 - [x] depends on: #27021 - [x] depends on: #30307 - [x] depends on: #27023 - [ ] depends on: #27024 - [ ] depends on: #27025 - [x] depends on: #30338 - [ ] depends on: #30083 - [ ] depends on: #30339 - [ ] depends on: #31194 - [ ] depends on: #34262 - [ ] depends on: #34263 [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR merge-conflict | 5847/155 | Mathlib.lean,Mathlib/Geometry/Manifold/CheatSheet.md,Mathlib/Geometry/Manifold/Riemannian/ExistsRiemannianMetric.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/LeviCivita.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Lift.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Prelim.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Torsion.lean,Mathlib/Geometry/Manifold/VectorBundle/GramSchmidtOrtho.lean,Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean,Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean,Mathlib/Geometry/Manifold/VectorBundle/Misc.lean,Mathlib/Geometry/Manifold/VectorBundle/OrthonormalFrame.lean,Mathlib/Geometry/Manifold/VectorBundle/SmoothSection.lean,Mathlib/Geometry/Manifold/VectorBundle/Tensoriality.lean,Mathlib/Geometry/Manifold/VectorField/LieBracket.lean,Mathlib/Geometry/Manifold/VectorField/Pullback.lean | 18 | 15 | ['github-actions', 'grunweg', 'idontgetoutmuch', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | unknown | 0 seconds |
| 29615 | eric-wieser | chore: add a computable shortcut for `AddCommMonoid ℂ` | --- [](https://gitpod.io/from-referrer/) | t-analysis easy | 9/1 | Mathlib/Analysis/Complex/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 230 days ago | 1 minute |
| 28808 | alreadydone | experiment: Ideal with Mul only (no Semiring) | --- - [ ] depends on: #28807 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR awaiting-CI merge-conflict | 172/120 | Mathlib/Algebra/Module/Submodule/Defs.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/LinearAlgebra/Matrix/Ideal.lean,Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean,Mathlib/RingTheory/Ideal/Defs.lean,Mathlib/RingTheory/Ideal/Lattice.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/Spectrum/Prime/RingHom.lean | 10 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | unknown | 0 seconds |
| 25507 | eric-wieser | chore(RingTheory/Valuation): golf using `Con` | This has no particular motivation besides seeing if `Con` is a performant substitute. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 20/35 | Mathlib/RingTheory/Valuation/ValuationRing.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 month ago | unknown | 0 seconds |
| 21495 | alreadydone | experiment: reducible HasQuotient.quotient' | --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 2/0 | Mathlib/Algebra/Quotient.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 449 days ago | 3 minutes |
| 36825 | danlyng | feat(MeasureTheory/Integral/IntegralEqImproper): add Iic variants of nonneg/nonpos derivative integrability and FTC-2 | Add the `Iic` counterparts of the existing `Ioi` results for automatic integrability of derivatives on semi-infinite intervals and the corresponding corollaries computing the integral value. Additionally, apply minor fixes to existing docstrings. New declarations: - `integrableOn_Iic_deriv_of_nonneg` / `integrableOn_Iic_deriv_of_nonneg'` - `integrableOn_Iic_deriv_of_nonpos` / `integrableOn_Iic_deriv_of_nonpos'` - `integral_Iic_of_hasDerivAt_of_nonneg` / `integral_Iic_of_hasDerivAt_of_nonneg'` - `integral_Iic_of_hasDerivAt_of_nonpos` / `integral_Iic_of_hasDerivAt_of_nonpos'` These mirror `integrableOn_Ioi_deriv_of_nonneg`, `integrableOn_Ioi_deriv_of_nonpos`, `integral_Ioi_of_hasDerivAt_of_nonneg`, `integral_Ioi_of_hasDerivAt_of_nonpos` and their primed variants. | t-measure-probability new-contributor awaiting-author | 107/9 | Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean | 1 | 7 | ['EtienneC30', 'github-actions'] | EtienneC30 | 1 month ago | 41 days ago | 2 days |
| 32918 | michelsol | feat: define `supEdist` and `supDist` | Create a new file Topology.MetricSpace.SupDistance and define the supremal distance in (extended) metric spaces. The defined `supEdist` and `supDist` will have similar theory to the already existing `infEdist` and `infDist`. The motivation is to be able to define the radius of a minimal bounding sphere as the infimum of the supDist later. [zulip discussion here](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Formalizing.20Jung's.20theorem.20and.20minimal.20bounding.20spheres) | t-topology new-contributor merge-conflict | 75/0 | Mathlib.lean,Mathlib/Topology/MetricSpace/SupDistance.lean | 2 | 5 | ['github-actions', 'mathlib4-merge-conflict-bot', 'michelsol', 'urkud'] | nobody | 1 month ago | 115 days ago | 21 days |
| 33668 | Citronhat | feat(PMF): add lintegral formulas for PMF | This PR introduces two lemmas describing the `lintegral` of a function with respect to the measure induced by a probability mass function: - `PMF.lintegral_eq_tsum` - `PMF.lintegral_eq_sum` These are the `ℝ≥0∞` analogues of the existing Bochner `integral` formulas `integral_eq_tsum` and `integral_eq_sum`. They could be useful for reasoning about expectations and integrability. In addition, the proof of `integral_eq_sum` is simplified by deriving it directly from `integral_eq_tsum` using `tsum_fintype`. | t-measure-probability new-contributor awaiting-author merge-conflict | 14/5 | Mathlib/Probability/ProbabilityMassFunction/Integrals.lean | 1 | 3 | ['DavidLedvinka', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 59 days ago | 55 days |
| 33355 | 0xTerencePrime | feat(Combinatorics/SimpleGraph/Connectivity): define vertex connectivity | This PR introduces the foundations of vertex connectivity for simple graphs, providing a counterpart to the edge connectivity theory in #32870. ### Main definitions - `SimpleGraph.IsVertexReachable`: vertices remain reachable after removing strictly fewer than `k` other vertices. - `SimpleGraph.IsVertexConnected`: a graph is `k`-vertex-connected if its order is strictly greater than `k` and any two distinct vertices are `k`-vertex-reachable. Includes basic characterizations for $k=0$ and $k=1$, along with monotonicity lemmas (`anti` and `mono`). | new-contributor t-combinatorics awaiting-author merge-conflict | 199/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean | 3 | 139 | ['0xTerencePrime', 'SnirBroshi', 'SproutSeeds', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | 50 days ago | 35 days |
| 36973 | JovanGerb | chore(Order/Filter/AtTopBot/Map): use `to_dual` | This PR uses `to_dual` on 4 declarations. `comap_atTop` is problematic, because the heuristic fails, and mistakenly thinks that it should translate `Surjective.iInf_comp`. --- [](https://gitpod.io/from-referrer/) | t-order | 5/20 | Mathlib/Order/Filter/AtTopBot/Map.lean | 1 | 2 | ['github-actions', 'mathlib-bors'] | nobody | 1 month ago | 40 days ago | 7 seconds |
| 27274 | peabrainiac | feat(Geometry/Diffeology): continuous diffeologies & D-topology-lemmas | Introduces the continuous diffeology on topological spaces and the Galois connection between it and the D-topology, and then uses it to prove a few more lemmas about the D-topology. --- Aside from being useful for defining a right adjoint of the D-topology functor later, this is a prerequisite for correctly defining coinduced diffeologies (namely in such a way that the D-topology is defeq to the coinduced topology) and thus also for most constructions of diffeological spaces. - [x] depends on: #26973 [](https://gitpod.io/from-referrer/) | t-differential-geometry awaiting-author | 153/0 | Mathlib.lean,Mathlib/Geometry/Diffeology/Continuous.lean | 2 | 7 | ['github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'ocfnash'] | nobody | 1 month ago | 59 days ago | 3 days |
| 25579 | JovanGerb | feat(Order/Notation): only allow ⊔/⊓ for non-linear orders | ⊔/⊓ is the same as max/min. The difference is that it is meant to be used if and only if there is no linear order. This PR implements a check for one of the two directions. --- [](https://gitpod.io/from-referrer/) | t-order | 33/7 | Mathlib/Order/Notation.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 327 days ago | 8 seconds |
| 36890 | vihdzp | chore(SetTheory): `le_mul_left` → `le_mul_of_pos_left` | The new theorem names/statements match [`Nat.le_mul_of_pos_left`](https://leanprover-community.github.io/mathlib4_docs/Init/Data/Nat/Lemmas.html#Nat.le_mul_of_pos_left). The cardinal one has also been moved to an earlier file. --- [](https://gitpod.io/from-referrer/) | t-set-theory awaiting-zulip merge-conflict | 28/23 | Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Free.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Exponential.lean,Mathlib/SetTheory/Ordinal/Notation.lean | 6 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 42 days ago | 3 hours |
| 37023 | xroblot | feat(NumberTheory/NumberField): linear disjointness from coprime discriminants | The key new result is `dvd_discr_iff_dvd_discr_normalClosure`: a prime `p` divides `discr K` if and only if it divides the discriminant of the normal closure of `K` over `ℚ`. Thanks to this result, we generalize `linearDisjoint_of_isGalois_isCoprime_discr` by removing the Galois hypothesis: if K₁ and K₂ are number fields with coprime discriminants, then they are linearly disjoint over ℚ. --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #36843 - [ ] depends on: #30666 | merge-conflict blocked-by-other-PR | 1575/57 | Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/GroupWithZero/Action/TransferInstance.lean,Mathlib/Algebra/Ring/Int/Field.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/FieldTheory/IntermediateField/ExtendTop.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/NumberTheory/NumberField/Discriminant/Different.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/RingTheory/AlgebraTower.lean,Mathlib/RingTheory/Ideal/Galois.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 24 | 1 | ['mathlib-dependent-issues'] | nobody | 1 month ago | 39 days ago | 1 minute |
| 14669 | Command-Master | feat(Data/Nat/PartENat): add lemmas for PartENat | Add some missing lemmas for `PartENat`, as well as the additive homomorphism from it to `WithTop Int`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data new-contributor merge-conflict | 90/0 | Mathlib/Data/Nat/PartENat.lean | 1 | 4 | ['erdOne', 'github-actions', 'mathlib-merge-conflicts', 'urkud'] | nobody | 1 month ago | 658 days ago | 1 hour |
| 22366 | kim-em | feat: `check_equalities` tactic for diagnosing defeq problems | The `check_equalities` tactic, which checks the typing of equalities in the goal, reporting discrepancies between the implicit type argument of the equality, and the inferred types of the left and right hand sides, at "instances and reducible" transparency. Reports from this tactic do not necessarily indicate a problem, although typically `simp` should reduce rather than increase the reported discrepancies. `check_equalities` may be useful in diagnosing uses of `erw`. | t-meta please-adopt WIP | 123/4 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/CategoryTheory/CheckCompositions.lean,Mathlib/Tactic/CheckEqualities.lean,Mathlib/Tactic/Common.lean,MathlibTest/check_equalities.lean | 7 | 21 | ['adomani', 'b-mehta', 'eric-wieser', 'fpvandoorn', 'github-actions', 'grunweg', 'kim-em', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | adamtopaz | 1 month ago | 39 days ago | 32 days |
| 33134 | faenuccio | feat(Normed/Module/WeakDual): add Goldstine lemma | We add Goldstine lemma stating that the weak*-closure of the image in the double dual of the unit ball coincides with the unit ball. As a corollary we derive that the image of `inclusionInDoubleDual` is weak*-dense. --- [](https://gitpod.io/from-referrer/) | WIP t-analysis merge-conflict | 148/3 | Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean,docs/references.bib | 3 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 132 days ago | 16 seconds |
| 34186 | faenuccio | feat(GroupTheory/SpecificGroups/Cyclic): a quotient of a cyclic group is cyclic | Add the Normal instance for a subgroup of a cyclic group; and derive that every quotient of a cyclic group is cyclic, as an instance. | t-group-theory awaiting-author merge-conflict | 8/0 | Mathlib/GroupTheory/SpecificGroups/Cyclic.lean | 1 | 9 | ['erdOne', 'faenuccio', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'tb65536'] | tb65536 | 1 month ago | 95 days ago | 4 days |
| 30122 | xroblot | Development branch (1) | --- | WIP large-import merge-conflict | 4479/14 | Mathlib.GaloisTower.lean,Mathlib/AddCharTrace.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Cyclotomic.lean,Mathlib/Data/Nat/Digits/Lemmas.lean,Mathlib/Duality.lean,Mathlib/FieldTheory/Finite/Extension.lean,Mathlib/FieldTheory/PrimeField.lean,Mathlib/GalCyclotomic.lean,Mathlib/GaussSum.lean,Mathlib/GroupTheory/FiniteAbelian/Duality.lean,Mathlib/KroneckerWeber_Blueprint.lean,Mathlib/Logic/Equiv/Set.lean,Mathlib/MWE.lean,Mathlib/Misc.lean,Mathlib/NumberTheory/MulChar/Basic.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Galois.lean,Mathlib/NumberTheory/NumberField/Ideal/Basic.lean,Mathlib/NumberTheory/NumberField/Ideal/KummerDedekind.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Ideal/Int.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/Sandbox.lean,Mathlib/StickElt.lean,Mathlib/Teichmuller.lean | 31 | 13 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 211 days ago | 12 seconds |
| 26911 | JovanGerb | chore: fix naming of `mono` and `monotone` | The naming convention says: "We use `_mono` for `a ≤ b → f a ≤ f b` and `_anti` for `a ≤ b → f b ≤ f a`, so we also use `_monotone` for `Monotone f`, `_antitone` for `Antitone f`, `_strictMono` for `StrictMono f`, `_strictAnti` for `StrictAnti f`, etc..." This PR swaps `mono`/`anti` and `monotone`/`antitone` where required so that `monotone` refers to `Monotone`, while `mono` refers to a lemma that might be tagged with `@[gcongr]` This PR does not address - `monotone_right`/`mono_right` vs `right_monotone`/`right_mono` - `monotone_arcsin` vs `arcsin_monotone` edit: TODO: `ideal_mono` and friends --- [](https://gitpod.io/from-referrer/) | delegated merge-conflict | 235/169 | Archive/Imo/Imo1962Q1.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Group/Basic.lean,Mathlib/Algebra/Order/Group/Finset.lean,Mathlib/Algebra/Order/Group/PosPart.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Polynomial/Degree/CardPowDegree.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Convex/Deriv.lean,Mathlib/Analysis/Normed/Order/UpperLower.lean,Mathlib/Analysis/Normed/Unbundled/SeminormFromConst.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/Combinatorics/SetFamily/Kleitman.lean,Mathlib/Combinatorics/SimpleGraph/Girth.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Lemma.lean,Mathlib/Data/ENNReal/Inv.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Pow.lean,Mathlib/Data/Nat/Choose/Factorization.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/MeasurableSpace/MeasurablyGenerated.lean,Mathlib/MeasureTheory/OuterMeasure/Operations.lean,Mathlib/NumberTheory/Bertrand.lean,Mathlib/NumberTheory/FermatPsp.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/ModularForms/Bounds.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/WithVal.lean,Mathlib/Order/Concept.lean,Mathlib/Order/Filter/AtTopBot/Archimedean.lean,Mathlib/Order/Filter/AtTopBot/Defs.lean,Mathlib/Order/Fin/Basic.lean,Mathlib/Order/Heyting/Basic.lean,Mathlib/Order/Heyting/Boundary.lean,Mathlib/Order/Heyting/Regular.lean,Mathlib/Order/Hom/Set.lean,Mathlib/Order/Interval/Set/Fin.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/UpperLower/Closure.lean,Mathlib/Probability/StrongLaw.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Basic.lean,Mathlib/RingTheory/FractionalIdeal/Basic.lean,Mathlib/RingTheory/WittVector/Basic.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean,Mathlib/Topology/MetricSpace/Antilipschitz.lean | 63 | 11 | ['JovanGerb', 'bryangingechen', 'github-actions', 'leanprover-community-bot-assistant', 'linesthatinterlace', 'mathlib-bors', 'mathlib-merge-conflicts'] | bryangingechen | 1 month ago | 294 days ago | 2 days |
| 30451 | kckennylau | feat(HomogeneousIdeal): generalize to homogeneous submodule | Continuation of #30437 with permission from @jjaassoonn, which is a continuation of #9820 . The definitions, constructions and theorems in `HomogeneousIdeal.lean` are generalized to homogeneous submodules. Let `R` be a graded ring and `M` be a graded `R`-module. Say an `R`-submodule `N` of `M` is homogeneous if for every `x` in `N`, each projection of `x` to `M_i` is in `N`. None of this file's results depends on the grading on `R`, but we include the grading on `R` for technical reasons. We define the "homogeneous core" of a not necessarily homogeneous submodule N to be the biggest homogeneous submodule contained within N, and the "homogeneous hull" to be the smallest homogeneous submodule that contains N. All definitions/constructions/theorems are then copied for ideals/homogeneous ideals. The motivation of this generalization is graded quotient module. (#18716) --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author merge-conflict | 581/185 | Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/DirectSum/Finsupp.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean | 10 | 23 | ['github-actions', 'mariainesdff', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | mariainesdff | 1 month ago | 51 days ago | 22 days |
| 33448 | astrainfinita | refactor: deprecate `ContinuousLinearMapClass` | This PR continues the work from #18748. Original PR: https://github.com/leanprover-community/mathlib4/pull/18748 | t-topology t-algebra awaiting-author merge-conflict | 55/41 | Mathlib/Analysis/CStarAlgebra/PositiveLinearMap.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/LocallyConvex/WeakOperatorTopology.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Operator/LinearIsometry.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean | 11 | 11 | ['Ruben-VandeVelde', 'astrainfinita', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 120 days ago | 4 hours |
| 36719 | NoneMore | feat(ModelTheory): add `PartialType` for first-order theories | This PR adds the definitions of partial types over theories and over parameter sets, and proves several equivalent characterizations. --- - [ ] depends on: #36667 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-logic new-contributor | 468/0 | Mathlib.lean,Mathlib/ModelTheory/PartialTypes.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 4 | 5 | ['NoneMore', 'github-actions', 'mathlib-dependent-issues', 'vihdzp'] | nobody | 1 month ago | 46 days ago | 5 minutes |
| 36635 | Vierkantor | chore(*): turn comments before declarations into docstrings | This PR goes through the whole of Mathlib and replaces `/- comments -/` with `/-- docstrings -/` or `/-! module docs -/` whenever they appear before a declaration. A lot of these appear to be simple typos, where a docstring was actually intended. Where a comment was originally intended, I would argue it is still a good idea include the comments in the generated documentation, or at least it does not hurt anyone. These instances were found by a linter, in an upcoming PR: #36636. --- [](https://gitpod.io/from-referrer/) | tech debt merge-conflict | 253/260 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Abelian.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Subgroup/MulOppositeLemmas.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Basic.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Algebra/Order/Group/Unbundled/Basic.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Ring/Star.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Polynomial/CoeffList.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/Morphisms/WeaklyEtale.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Synonym.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Analysis/Fourier/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/InnerProductSpace/TensorProduct.lean,Mathlib/Analysis/LConvolution.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/Analysis/Meromorphic/Basic.lean,Mathlib/Analysis/Normed/Algebra/GelfandMazur.lean,Mathlib/Analysis/Normed/Algebra/Unitization.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/MStructure.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean,Mathlib/CategoryTheory/Action/Concrete.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/FintypeCat.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/Cones.lean,Mathlib/CategoryTheory/Limits/FintypeCat.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryBiproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean,Mathlib/CategoryTheory/Monoidal/Closed/Ideal.lean,Mathlib/CategoryTheory/Products/Basic.lean,Mathlib/Combinatorics/Hindman.lean,Mathlib/Combinatorics/SimpleGraph/Hall.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Counting.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/ENNReal/Holder.lean,Mathlib/Data/Finset/Sym.lean,Mathlib/Data/Fintype/Sets.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Set/Pointwise/Support.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign/Defs.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/FreeGroup/IsFreeGroup.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/MaximalSubgroups.lean,Mathlib/LinearAlgebra/CliffordAlgebra/SpinGroup.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/LinearAlgebra/DFinsupp.lean,Mathlib/LinearAlgebra/Isomorphisms.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/UnivLE.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalLExpectation.lean,Mathlib/MeasureTheory/Function/JacobianOneDim.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Group/Measure.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/MeasureTheory/Measure/Haar/NormedSpace.lean,Mathlib/MeasureTheory/Measure/Haar/OfBasis.lean,Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean,Mathlib/ModelTheory/Algebra/Field/CharP.lean,Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/BourbakiWitt.lean,Mathlib/Order/CompleteLattice/Basic.lean | 139 | 10 | ['JovanGerb', 'Vierkantor', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 38 days ago | 2 days |
| 36347 | FrankieeW | feat(NumberTheory/QuadraticField): define quadratic number fields as QuadraticAlgebra ℚ d 0 | Define `Qsqrtd d` as `QuadraticAlgebra ℚ d 0`, representing the quadratic number field `ℚ(√d)`. Prove trace and norm results, show `Qsqrtd d` is a number field and a quadratic extension when `d` is not a perfect square, and prove that `ℚ(√0)` and `ℚ(√1)` are not fields. Include `IsQuadraticField` as a predicate for quadratic extensions of `ℚ`, and bridge lemmas connecting squarefree integer parameters to the non-square condition. This PR is part of a series upstreaming the [QuadraticNumberFields](https://github.com/FrankieeW/QuadraticNumberFields) project. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/quadratic.20number.20fields) --- ### PRs - #36347 (this PR) - #36387 --- | t-number-theory new-contributor large-import awaiting-author LLM-generated | 191/0 | Mathlib.lean,Mathlib/Algebra/QuadraticAlgebra/Defs.lean,Mathlib/Algebra/Squarefree/Basic.lean,Mathlib/NumberTheory/QuadraticField/Basic.lean | 4 | 25 | ['FrankieeW', 'eric-wieser', 'github-actions', 'riccardobrasca', 'tb65536', 'wwylele'] | tb65536 | 1 month ago | 46 days ago | 7 days |
| 29281 | plp127 | doc: `Fin.natAdd_castLEEmb` | Change the docstring of `Fin.natAdd_castLEEmb` which confused me when I read it so I rewrote it. PS. this doesn't really follow the naming convention since data should be in `camelCase` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data awaiting-author | 2/3 | Mathlib/Data/Fin/Embedding.lean | 1 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 1 month ago | 222 days ago | 18 days |
| 34171 | SnirBroshi | feat(Combinatorics/SimpleGraph/Hasse): Define the Eulerian path of a path graph | --- Such statements are left for a future PR, since they add imports so we probably want to split them into a separate file: ```lean theorem IsEulerian.ofPathGraph : ofPathGraph n |>.IsEulerian := by sorry theorem IsHamiltonian.ofPathGraph : ofPathGraph n |>.IsHamiltonian := by sorry ``` [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 42/1 | Mathlib/Combinatorics/SimpleGraph/Hasse.lean | 1 | 13 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'vihdzp', 'vlad902'] | YaelDillies | 1 month ago | 37 days ago | 63 days |
| 35805 | adrianmartir | feat(NumberTheory/Divisors): Add `infinite_setOf_divisors_iff` | This proves that the set of divisors `{ m | m | n }` of a natural number `n` is infinite if and only if `n` is zero. The first proof draft was by @Aristotle-Harmonic. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor awaiting-author | 10/0 | Mathlib/NumberTheory/Divisors.lean | 1 | 6 | ['adrianmartir', 'alexjbest', 'github-actions', 'tb65536'] | tb65536 | 1 month ago | 37 days ago | 27 days |
| 35991 | xroblot | feat(RamificationInertia): decomposition field and inertia field of compositum | --- - [ ] depends on: #35808 - [x] depends on: #35493 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 534/15 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean | 6 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 60 days ago | 5 minutes |
| 31590 | SuccessMoses | chore: tag `commutatorElement_def` with `simp` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor merge-conflict | 1/0 | Mathlib/Algebra/Group/Commutator.lean | 1 | 3 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 169 days ago | 29 minutes |
| 36158 | vihdzp | chore: use `to_additive` for `IsConj` | I don't really need this specific definition, but I do want additive versions of other declarations that depend on this. Some proofs were changed, since `MulAut.conj` can't be dualized (the analogous def `AddAut.conj` has to insert a `Multiplicative` in there). --- - [ ] depends on: #36156 [](https://gitpod.io/from-referrer/) | t-group-theory blocked-by-other-PR merge-conflict | 95/137 | Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Equiv/Defs.lean,Mathlib/Tactic/Translate/ToAdditive.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 57 days ago | 20 minutes |
| 35163 | CoolRmal | feat(Topology): comparison of two Hausdorff topologies | The main theorem proved in this PR is `CompactSpace.eq_of_le_compact_t2`, which says that if we have two Hausdorff topologies `s, t` on `X`, and if `t` is finer than `s` and `X` is compact under `t`, then `s = t`. I also proved some variant of this lemma. The motivations I have in mind are some applications to the theory of topological vector spaces, where we often have to compare two Hausdorff topologies. --- [](https://gitpod.io/from-referrer/) | t-topology awaiting-author | 24/0 | Mathlib/Topology/Homeomorph/Lemmas.lean | 1 | 7 | ['CoolRmal', 'dagurtomas', 'github-actions', 'j-loreaux', 'plp127'] | nobody | 1 month ago | 63 days ago | 14 days |
| 35877 | yoh-tanimoto | feat(Algebra/Module): add twisted product module | add a module structure on the product `E × F` with the `SMul` given by `s • ⟨x, y⟩ := ⟨s • x, σ s • y⟩` with `σ : R →+* S`. motivation: needed to define the graph of antilinear operator, see [discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60SemilinearPMap.60/with/576208198), which will be needed in the Tomita-Takesaki theory cf. #29251 | t-algebra | 1329/0 | Mathlib.lean,Mathlib/Algebra/Module/SemilinearModuleProd.lean | 2 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 36165 | Parcly-Taxel | chore: deprecate `Nat.strongRec(On)'` | In favour of Batteries's `Nat.strongRec` for definitions and `Nat.strong_induction_on` for proofs. | t-data merge-conflict | 34/66 | Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Data/Int/GCD.lean,Mathlib/Data/Nat/Factorization/Induction.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean | 8 | 6 | ['JovanGerb', 'MichaelStollBayreuth', 'Parcly-Taxel', 'Vierkantor', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | Vierkantor | 1 month ago | 42 days ago | 15 days |
| 34722 | GrigorenkoPV | feat(Data/Finset/RangeDistance): bound distance between elements of `Finset.range` | --- Rebase of https://github.com/leanprover-community/mathlib4/pull/26347 [](https://gitpod.io/from-referrer/) | new-contributor t-data awaiting-author | 34/0 | Mathlib.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Data/Finset/RangeDistance.lean | 3 | 7 | ['GrigorenkoPV', 'Vierkantor', 'github-actions', 'joneugster', 'mathlib-splicebot', 'plp127'] | pechersky | 1 month ago | 36 days ago | 52 days |
| 36711 | mcdoll | feat(Algebra): Bound `Finset.sum` in terms of `Finset.sup` | We add a version for `Finset` and for seminorms (with the additional `sum_apply` lemma). --- I am not sure where to put the `Finset` lemma, `#find_home` was useless and there seems to be no natural candidate. [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 34/0 | Mathlib/Algebra/Module/BigOperators.lean,Mathlib/Analysis/Seminorm.lean | 2 | 2 | ['dagurtomas', 'github-actions'] | dagurtomas | 1 month ago | 35 days ago | 10 days |
| 36216 | michaellee94 | feat(CategoryTheory): characterize pullback squares via the `Over` category | --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor maintainer-merge awaiting-author | 47/0 | Mathlib/CategoryTheory/Limits/Shapes/Pullback/IsPullback/Basic.lean | 1 | 18 | ['dagurtomas', 'github-actions', 'joelriou', 'michaellee94'] | robin-carlier | 1 month ago | 35 days ago | 2 days |
| 32473 | mattrobball | chore(Kaehler.JacobiZariski): remove egregious local instance hack | This code looks terrible and is no longer strictly necessary. Local timings give `lake build Mathlib/RingTheory/Kaehler/JacobiZariski.lean 39.77s user 1.07s system 263% cpu 15.482 total` after removal and `lake build Mathlib/RingTheory/Kaehler/JacobiZariski.lean 36.93s user 1.01s system 251% cpu 15.113 total` before the removal. So the preformance impact of removal is small. One could argue that keeping is a remainder that everything here needs to be seriously changed but the miminmal performance difference suggests that these local instances would be a red herring in that regard. --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author merge-conflict | 0/4 | Mathlib/RingTheory/Kaehler/JacobiZariski.lean | 1 | 14 | ['chrisflav', 'erdOne', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'mattrobball'] | nobody | 1 month ago | 146 days ago | 1 day |
| 37232 | mathlib-splicebot | chore(Algebra/Order): bound on `|n / m|ₘ` and `|n - m|` | This PR was automatically created from PR #34722 by @GrigorenkoPV via a [review comment](https://github.com/leanprover-community/mathlib4/pull/34722#discussion_r2996870566) by @Vierkantor. | t-algebra delegated | 5/0 | Mathlib/Algebra/Order/Group/Unbundled/Abs.lean | 1 | 6 | ['Vierkantor', 'bryangingechen', 'github-actions', 'mathlib-bors'] | nobody | 1 month ago | 36 days ago | 9 minutes |
| 33295 | AntoineChambert-Loir | feat(Algebra/Central/End): center of the group of automorphisms of a free module | Let `R` be a ring and let `V` be a free `R`-module. We describe the center of the group of linear automorphisms of `V`. The group of linear automorphisms can be summoned either as `V ≃ₗ[R] V`, or as `LinearMap.GeneralLinearGroup R V`, which is a shortcut for `(V →ₗ[R] V)ˣ`. We provide both descriptions. There are three possibilities: * If `V` is trivial, then `V ≃ₗ[R] V` is trivial, and so is its center. * If `V` has rank one, then any basis with a `Unique` type of index furnishes a ring equivalence from `V →ₗ[R] V` with `Rᵐᵒᵖ`, given by right-multiplication on coordinates in the given basis. (This equivalence depends on the choice of a basis.) Then `V ≃ₗ[R] V` is mul-equivalent with `(Rᵐᵒᵖ)ˣ`, hence its center is isomorphic with `Subgroup.center (Rᵐᵒᵖ)ˣ`, or, by commutativity, with `Subgroup.center Rˣ`. * Otherwise, the center of `V ≃ₗ[R] V` consists of homotheties with central ratio, furnishing a group isomorphism from `Subgroup.center (V ≃ₗ[R] V)` with `(Subgroup.center R)ˣ`. When `R` is commutative and `V` is nontrivial, the last two cases give the same answer and the center of `V ≃ₗ[R] V` is isomorphic with `Rˣ`. --- [](https://gitpod.io/from-referrer/) | t-algebra WIP merge-conflict | 364/0 | Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/GeneralLinearGroup/Center.lean | 3 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 126 days ago | 5 hours |
| 34236 | homeowmorphism | feat(GroupTheory/FinitelyPresentedGroup): add finitely presented groups | Formulation of finitely presented groups feat(GroupTheory/FinitelyPresentedGroup): add finitely presented groups We define the notion of `IsFinitelyPresented` with equivalent datatype notions, what it means for a subgroup to be finitely generated in the normal closure, and some instances of finitely presented groups. This started as an ItaLean2025 project. The related Zulip thread is here: https://leanprover.zulipchat.com/#narrow/channel/541885-ItaLean-2025/topic/Projects.3A.20Finitely.20Presented.20Groups/with/567565752. Use of AI: * Aristotle was used for giving a preliminary proof of some statements as this is my first contribution and I wanted to understand how to prove things; they have since been changed. * GPT-5.2 was used to generate some of the proof sub-statements for efficiency once the mathematical blueprints of the proofs have been worked out. * GPT-5.3 was used to rapidly refactor the code. Human review by PR author in-progress, but got to a point where it would be good to get external input. * GPT-5.4 was used to refactor the variables. Human PR author then rewrote the whole thing. --- - [x] depends on: #34580 - [x] depends on: #34624 - [x] depends on: #35033 - [x] depends on: #35029 [](https://gitpod.io/from-referrer/) | t-group-theory new-contributor merge-conflict | 305/0 | Mathlib.lean,Mathlib/GroupTheory/FinitelyPresentedGroup.lean | 2 | 72 | ['copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'grunweg', 'homeowmorphism', 'kbuzzard', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tb65536'] | nobody | 1 month ago | 42 days ago | 1 hour |
| 35578 | Shreyas4991 | fix: writer monad should use an additive logging type | The Writer monad's w type is supposed to be additive, not multiplicative. This is how it is conceptually used in Haskell (as a logging type). Haskell uses `Monoid` because it doesn't make a distinction between `AddMonoid` and `Monoid`. [#mathlib4 > Writer should use an additive monoid @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Writer.20should.20use.20an.20additive.20monoid/near/574990415) --- [](https://gitpod.io/from-referrer/) | t-data awaiting-zulip merge-conflict | 10/10 | Mathlib/Control/Monad/Cont.lean,Mathlib/Control/Monad/Writer.lean | 2 | 5 | ['Shreyas4991', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 69 days ago | 5 hours |
| 36769 | jjdishere | feat(Valued/ValuationTopology): creating instances of `IsValuativeTopology` | This is the third in a series of PRs, with the final goal of removing the class `Valued` from Mathlib. A `Valued` instance will be replaced by `[ValuativeRel R] [UniformSpace R] [IsValuativeTopology R] [IsUniformAddGroup R] (v : Valuation R A) [v.Compatible]`. The goal of this PR is to prepare APIs for creating `ValuativeRel`, `IsValuativeTopology`, ... instances whenever a `Valued` instance was created. Currently in Mathlib, there are three main ways of creating a `Valued` instance: 1. `Valued.mk'` (`ValuativeRel.ofValuation` already in mathlib, ValuativeRel.uniformSpace in #36532) 2. `Valued.valuedCompletion` 3. `NormedField.toValued` For the later two methods, we create corresponding APIs to equip `IsValuativeTopology` under the original input. Some uniform space structures induced by `ValuativeRel` in this PR cannot be made into instances immediately, since they would cause diamonds with `Valued`. However, they will become instances in the final PR removing `Valued`. ## More about the whole refactor plan: 1. Copy APIs that take `Valued` as input and make them accept input `[ValuativeRel R] [UniformSpace R] [IsValuativeTopology R] [IsUniformAddGroup R] (v : Valuation R A) [v.Compatible]`. - [x] #36532 2. For every API that introduces a `Valued` instance, copy that API and make it create `[ValuativeRel R] [UniformSpace R] [IsValuativeTopology R] [IsUniformAddGroup R]` instances. And for every instance that currently exists in Mathlib, create the above series of instances as much as possible without introducing diamonds. More specifically, currently in Mathlib, there are three main ways of creating a `Valued` instance: - `Valued.mk'` - `Valued.valuedCompletion` - `NormedField.toValued` For each of these we create APIs to create the above series of instances. - [ ] #36777 [Generalize the definition of `IsValuativeTopology` to non comm rings] - [ ] This PR. For each of these we create APIs to create the above series of instances. 3. A big PR deprecating the `Valued` class using 1 and 2. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #36532 - [ ] depends on : #36777 - [ ] depends on : #36911 | t-topology WIP t-algebra t-ring-theory merge-conflict | 752/492 | Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/Padics/Complex.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/WithVal.lean,Mathlib/NumberTheory/RatFunc/Ostrowski.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/RingTheory/Valuation/DiscreteValuativeRel.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Trivial.lean,Mathlib/Topology/Algebra/ValuativeRel/Completion.lean,Mathlib/Topology/Algebra/ValuativeRel/ValuativeTopology.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean | 25 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 45 days ago | 56 seconds |
| 36911 | jjdishere | fix(RingTheory/Valuation): change `ValueGroup` from taking HomClass to Hom | This PR refactors `MonoidWithZeroHom.valueMonoid`, `MonoidWithZeroHom.valueGroup`, `MonoidWithZeroHom.ValueGroup₀`, and `MonoidWithZeroHom.ValueGroup₀.embedding` to take a concrete `MonoidWithZeroHom` as input instead of a `MonoidWithZeroHomClass` instance, following rules described in [#mathlib4 > Mathlib's morphism hierarchy @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Mathlib.27s.20morphism.20hierarchy/near/554383157) As a result, we are able to remove several `erw` and many `set_option backward.isDefEq.respectTransparency false in`. The trade-off (foreseen by the same zulip thread) is that we now need to write an explicit coercion to `MonoidWithZeroHom` in `ValueGroup₀ (Valued.v (R := R) : R →*₀ Γ₀)`. Additionally, this PR fixes an instance on `NNReal`. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #36532 - [ ] depends on: #36777 | t-ring-theory tech debt blocked-by-other-PR merge-conflict | 559/483 | Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/Padics/Complex.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/WithVal.lean,Mathlib/NumberTheory/RatFunc/Ostrowski.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/RingTheory/Valuation/DiscreteValuativeRel.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Trivial.lean,Mathlib/Topology/Algebra/ValuativeRel/ValuativeTopology.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean | 24 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 42 days ago | 1 minute |
| 20719 | gio256 | feat(AlgebraicTopology): delaborators for truncated simplicial notations | We add delaborators for the following notations, introduced in #20688: - `⦋m⦌ₙ`, which denotes the `m`-dimensional simplex in the `n`-truncated simplex category. - `X _⦋m⦌ₙ`, which denotes the `m`-th term of an `n`-truncated simplicial object `X`. - `X ^⦋m⦌ₙ`, which denotes the `m`-th term of an `n`-truncated cosimplicial object `X`. If `pp.proofs` is set to `true`, we also pretty-print the proof `p : m ≤ n` for all three notations as `⦋m, p⦌ₙ`, `X _⦋m, p⦌ₙ`, and `X ^⦋m, p⦌ₙ`, respectively. Credit to @kmill for one piece of code and much metaprogramming inspiration. --- - [x] depends on: #20688 - [x] depends on: #23018 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-topology infinity-cosmos t-meta please-adopt will-close-soon | 525/33 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/SimplexCategory.lean,Mathlib/Util/Superscript.lean,MathlibTest/SimplexCategory.lean,MathlibTest/SimplicialObject.lean,MathlibTest/superscript.lean,scripts/noshake.json | 11 | 24 | ['eric-wieser', 'gio256', 'github-actions', 'joneugster', 'kim-em', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 284 days ago | 88 days |
| 21476 | grunweg | feat(lint-style): enable running on downstream projects | Enable lint-style to run on downstream projects, by making the following modifications: - allow passing an explicit list of libraries to lint: if nothing is passed, it lints `Mathlib`, `Archive` and `Counterexamples` (as before); otherwise, it lints precisely the passed modules - only check init imports, undocumented scripts and the errors from `lint-style.py` when linting Mathlib - make the style exceptions file configurable and optional: using the `nolints-file` flag, the exceptions file can be configured. If the flag is omitted, we try to find a file at `scripts/nolints-style.txt` --- and otherwise proceed with no style exceptions. This means mathlib can continue unchanged, and downstream projects can either add an explicit exceptions file, or proceed without any exceptions. After this PR, one should be able to run lint-style on a downstream project by `lake exe lint-style ProjectName`. Prompted by [this zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/lint-style.20for.20downstream.20libraries). --- - [x] depends on: #24570 - [x] depends on: #24953 (I did not test the last part.) [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author please-adopt | 58/19 | Mathlib/Tactic/Linter/TextBased.lean,scripts/lint-style.lean | 2 | 21 | ['Vierkantor', 'adomani', 'github-actions', 'grunweg', 'joneugster', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 350 days ago | 43 days |
| 33586 | CoolRmal | feat: Lower Limit Topology | --- [](https://gitpod.io/from-referrer/) | t-topology | 328/0 | Mathlib.lean,Mathlib/Topology/Order/LowerUpperLimitTopology.lean | 2 | 10 | ['CoolRmal', 'github-actions', 'plp127'] | nobody | 1 month ago | unknown | 0 seconds |
| 35857 | AlexeyMilovanov | feat(Logic.Equiv.BijectiveBase2): add bijective base-2 numeration | This PR introduces a formalization of the bijective base-2 numeration system. Unlike standard binary representation, bijective base-2 avoids the "leading zeros" problem, providing a strict mathematical bijection between natural numbers (`ℕ`) and lists of booleans (`List Bool`). **Main additions:** * `Equiv.BijectiveBase2.toBits`: Encodes `ℕ` to `List Bool`. * `Equiv.BijectiveBase2.ofBits`: Decodes `List Bool` to `ℕ`. * `equivBijectiveBase2`: The formal `ℕ ≃ List Bool` equivalence. --- Zulip: [#PR reviews > PR #35857: Bijective Base-2 Numeration](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PR.20.2335857.3A.20Bijective.20Base-2.20Numeration/with/576336540) Zulip: [#batteries > Upstreaming Nat.Bits](https://leanprover.zulipchat.com/#narrow/channel/348111-batteries/topic/Upstreaming.20Nat.2EBits/with/580736051) *(Note: This replaces my previously closed PR to avoid the terminology clash between "Dyadic" and dyadic rationals. The namespace and definitions have been updated accordingly).* *(Note: Used AI to assist with standardizing proof structures).* | t-logic new-contributor LLM-generated blocked-by-batt-PR | 95/0 | Mathlib.lean,Mathlib/Logic/Equiv/ListNatBijective.lean | 2 | 6 | ['AlexeyMilovanov', 'SnirBroshi', 'github-actions', 'joneugster'] | nobody | 1 month ago | 35 days ago | 27 days |
| 36463 | AlexeyMilovanov | feat(Data.Nat.Bits): add Nat.ofBits and prove bits_injective | This PR introduces `Nat.ofBitsList` for `List Bool` and provides the missing proofs that the standard binary representation `Nat.bits` is injective (`Nat.bits_injective`) and possesses a right inverse for normalized lists (`Nat.bits_ofBitsList`). `ofBitsList` is implemented as an `abbrev` using `foldr` (keeping it transparent to tactics like `simp`). It serves as the exact left inverse to `bits`. Furthermore, `bits_ofBitsList` establishes that `bits` and `ofBitsList` form a bijection between `ℕ` and the set of lists with no trailing `false` values. This avoids the name collision with `Nat.ofBits` from `Batteries` and aligns with previous Zulip discussions (see [here](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PR.20.2335857.3A.20Bijective.20Base-2.20Numeration)) regarding the utility of having a complete list-based API for `Nat.bits` in the library. CC: @linesthatinterlace - Adds `Nat.ofBitsList` (as an `abbrev`) - Adds `Nat.ofBitsList_bits` (left inverse property) - Adds `Nat.bits_injective` - Adds `Nat.ofBitsList_eq_zero_iff` (helper lemma for lists without trailing zeros) - Adds `Nat.bits_ofBitsList` (right inverse property) --- Zulip: [#PR reviews > PR #35857: Bijective Base-2 Numeration](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PR.20.2335857.3A.20Bijective.20Base-2.20Numeration/with/576336540) Zulip: [#batteries > Upstreaming Nat.Bits](https://leanprover.zulipchat.com/#narrow/channel/348111-batteries/topic/Upstreaming.20Nat.2EBits/with/580736051) | t-data new-contributor awaiting-author blocked-by-batt-PR | 68/1 | Mathlib/Data/Nat/Bits.lean | 1 | 5 | ['github-actions', 'joneugster', 'linesthatinterlace'] | nobody | 1 month ago | 42 days ago | 9 days |
| 27307 | xyzw12345 | feat(RingTheory/GradedAlgebra): homogeneous relation | In this PR, we defined the concept of a homogeneous relation and proved some properties about homogeneous relations. The main result of this PR is showing that taking `RingQuot` by a homogeneous relation can give a graded structure on the quotient ring. This result can be used to define graded structures on rings obtained using `RingQuot`, e.g. the Symmetric Algebra defined in #21539 can be verified to have such a structure.
Co-authored-by:
Zhixuan Dai @atstarrysky <22300180006@m.fudan.edu.cn>
Yiming Fu @pelicanhere |
awaiting-author t-ring-theory | 394/1 | Mathlib.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Colimit/Ring.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousRelation.lean | 10 | 46 | ['AntoineChambert-Loir', 'alreadydone', 'chrisflav', 'erdOne', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'ocfnash', 'xyzw12345'] | mattrobball | 1 month ago | 167 days ago | 72 days |
| 36274 | JTylM | feat(Combinatorics/SimpleGraph/Matching): implemented the matchingNumber of a graph | --- - [ ] depends on: #36406 - [ ] depends on: #32555 I implemented the matchingNumber as described in the issue and proved some statements including showing that there exists a matching achieving the matchingNumber. matchingNumber is increasing under injective maps matchingNumber is equal under isomorphisms matchingNumber of a matching is the cardinality of the matching This is my first PR and i had some trouble with some of the proofs, especially with the proof for matchingNumber.isAttained. So any suggestions on how to make the proofs shorter would be welcome. Also i was not sure about the naming of some of the theorems so i would apprechiate feedback here as well. | new-contributor t-combinatorics blocked-by-other-PR | 292/2 | Mathlib/Combinatorics/SimpleGraph/Matching.lean | 1 | 39 | ['JTylM', 'SnirBroshi', 'SproutSeeds', 'github-actions', 'mathlib-dependent-issues', 'vlad902'] | nobody | 1 month ago | 43 days ago | 8 days |
| 37184 | dagurtomas | feat(CategoryTheory): start using the map attribute | --- - [ ] depends on: #37183 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR | 259/41 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Localization/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/NaturalTransformation.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataPrime.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/Map.lean | 13 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 36 days ago | 1 second |
| 37275 | dagurtomas | chore(CategoryTheory): use the map attribute more | --- - [ ] depends on: #37184 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR | 283/77 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Free.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/PullbackFree.lean,Mathlib/Algebra/Homology/DerivedCategory/ShortExact.lean,Mathlib/Algebra/Homology/HomotopyCategory.lean,Mathlib/Algebra/Homology/HomotopyCategory/Pretriangulated.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShortExact.lean,Mathlib/Algebra/Homology/ShortComplex/Basic.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/CategoryTheory/Functor/Trifunctor.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Localization/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/NaturalTransformation.lean,Mathlib/CategoryTheory/NatTrans.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataPrime.lean,Mathlib/CategoryTheory/Triangulated/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/Map.lean | 24 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 35 days ago | 1 second |
| 32295 | jsm28 | feat(Archive/Imo/Imo2024Q4): IMO 2024 Q4 | Add a formalization of IMO 2024 problem 4, so completing the formalizations of all six IMO 2024 problems. --- - [ ] depends on: #30981 - [ ] depends on: #30982 - [ ] depends on: #31057 - [ ] depends on: #31205 - [ ] depends on: #31452 - [ ] depends on: #31495 - [ ] depends on: #31733 - [ ] depends on: #31891 - [ ] depends on: #31892 - [ ] depends on: #31893 - [ ] depends on: #31979 - [ ] depends on: #31981 - [ ] depends on: #32004 - [ ] depends on: #32019 - [ ] depends on: #32021 - [ ] depends on: #32023 - [ ] depends on: #32259 - [ ] depends on: #32260 - [ ] depends on: #32270 - [ ] depends on: #32273 - [ ] depends on: #32278 - [ ] depends on: #32282 - [ ] depends on: #32290 - [ ] depends on: #32294 - [ ] depends on: #32296 [](https://gitpod.io/from-referrer/) | IMO blocked-by-other-PR | 1195/2 | Archive.lean,Archive/Imo/Imo2024Q4.lean,Mathlib.lean,Mathlib/Geometry/Euclidean/Angle/Incenter.lean,Mathlib/Geometry/Euclidean/Incenter.lean,Mathlib/Geometry/Euclidean/Sphere/PolePolar.lean,Mathlib/Geometry/Euclidean/Sphere/Tangent.lean | 7 | 7 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 151 days ago | 48 minutes |
| 31981 | jsm28 | feat(Geometry/Euclidean/Incenter): `tangentSet` and `tangentsFrom` lemmas | Add lemmas relating the faces of a simplex to `tangentSet` and `tangentsFrom` for an exsphere, in particular for a triangle that any two side lines are the `tangentsFrom` their shared vertex to the insphere or any exsphere. --- - [ ] depends on: #31733 - [ ] depends on: #31891 - [ ] depends on: #31892 - [ ] depends on: #31893 - [x] depends on: #31978 - [ ] depends on: #31979 - [x] depends on: #31980 - [ ] depends on: #32296 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry blocked-by-other-PR | 318/2 | Mathlib.lean,Mathlib/Geometry/Euclidean/Incenter.lean,Mathlib/Geometry/Euclidean/Sphere/PolePolar.lean,Mathlib/Geometry/Euclidean/Sphere/Tangent.lean | 4 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 159 days ago | 28 minutes |
| 31893 | jsm28 | feat(Geometry/Euclidean/Sphere/Tangent): characterize `tangentsFrom` | Add lemmas relating tangency to polars, and thereby characterizing `tangentsFrom`: empty for a point inside the sphere, a singleton for a point on the sphere and, in two dimensions, of cardinality two for a point outside the circle. --- - [ ] depends on: #31891 - [ ] depends on: #31892 - [ ] depends on: #32296 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-euclidean-geometry | 218/2 | Mathlib.lean,Mathlib/Geometry/Euclidean/Sphere/PolePolar.lean,Mathlib/Geometry/Euclidean/Sphere/Tangent.lean | 3 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 161 days ago | 5 minutes |
| 36706 | kim-em | feat(Tactic/FastInstance): warn when a synthesized sub-instance has leaky binder types | This PR adds a warning to `fast_instance%` and `inferInstanceAs%` when they encounter a synthesized sub-instance that has leaky data-field binder types. When `fast_instance%` recursively normalizes a class instance, it uses `trySynthInstance` to find canonical sub-instances. If a found sub-instance is not canonical at instances transparency (i.e., its internal lambda binder types reference an unexpanded type alias instead of the target carrier), the tool now emits a warning: ``` fast_instance%: 'leakySub' (for SubClass MyNat) has leaky data-field binder types, which may cause `isDefEq` failures at instances transparency (e.g. in `grind`). Consider redefining it with `fast_instance%` or `inferInstanceAs%`. To suppress: `set_option Elab.fast_instance.warnLeakySubInstances false` ``` The leakiness check uses `withDisabledInstance` to temporarily evict the sub-instance from the discrimination tree (preventing trivial self-match via `trySynthInstance`), then compares against the canonical form at instances transparency. A `warnLeaky` parameter propagates through recursive calls to prevent nested warnings. The warning is suppressed via `set_option Elab.fast_instance.warnLeakySubInstances false`. - [ ] depends on: #36701 🤖 Prepared with Claude Code | t-meta blocked-by-other-PR large-import LLM-generated merge-conflict | 415/21 | Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/Init.lean,Mathlib/RingTheory/Congruence/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/Tactic/DefEqAbuse.lean,Mathlib/Tactic/FastInstance.lean,MathlibTest/CheckInstance.lean,MathlibTest/DefEqAbuse.lean,MathlibTest/InferInstanceAsPercent.lean | 11 | 7 | ['Vierkantor', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | Vierkantor | 1 month ago | 46 days ago | 16 minutes |
| 37249 | yuma-mizuno | feat(Algebra): add multivariate Laurent polynomials | --- ~~I used Codex to imitate the `MvPolynomial` API.~~ Now it has been rewritten by hand to focus on its `AddMonoidAlgebra` features. Proving `UniqueFactorizationMonoid` is my next plan. [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 268/0 | Mathlib.lean,Mathlib/Algebra/MvLaurentPolynomial/Basic.lean | 2 | 5 | ['YaelDillies', 'eric-wieser', 'github-actions', 'yuma-mizuno'] | nobody | 1 month ago | 35 days ago | 7 hours |
| 34288 | winstonyin | feat: Integral curve is smooth in initial condition | I prove the local smoothness theorem for integral curves of ODEs on Banach spaces with respect to the initial condition. Serge Lang's _Fundamentals of Differential Geometry_ gives two proofs (Theorem 1.11). The first one is based on Grönwall's inequality. The second one (p. 81 onwards) is based on the implicit function theorem, found by Pugh and Robbin 1968. I've chosen to formalise the second, even though it may be more involved. I wanted to do this as a challenge, and because the second proof also applies to $H^k$ vector fields (Ebin and Marsden 1970), which are not yet in Mathlib. I am open to splitting this up into several smaller PRs. ## Statement Let $f : E \to E$ be a vector field that is $C^n$ at $x_0 : E$ with $n \geq 1$. There exists a neighbourhood $U$ of $x_0$ and time interval $[t_{\mathrm{min}},t_{\mathrm{max}}]$ containing $t_0$ such that for every $x \in U$, there exists an integral curve $\alpha_x : C([t_{\mathrm{min}},t_{\mathrm{max}}], E)$ of $f$ with initial condition $\alpha_x(t_0) = x$, and that $x \mapsto \alpha_x$ is $C^n$. Note that this is not the full smoothness theorem for local flows, which states that the local flow $\alpha : [t_{\mathrm{min}},t_{\mathrm{max}}] \times U \to E$ is $C^n$ at $(t_0, x_0)$. We will prove this in a series of future PRs. ## Proof strategy * Define implicit equation $T_f : E \times C([t_{\mathrm{min}},t_{\mathrm{max}}],E) \to C([t_{\mathrm{min}},t_{\mathrm{max}}],E)$ so that $T(x,\alpha) = 0$ implies that $\alpha$ is an integral curve of $f$ with initial condition $x$. * Prove implicit equation is $C^n$ if $f$ is $C^n$. * Prove $\partial_\alpha T_f$ is invertible for some choice of $[t_{\mathrm{min}},t_{\mathrm{max}}]$. * Extract the local flow $(x : E) \mapsto (\alpha_x : C([t_{\mathrm{min}},t_{\mathrm{max}}],E))$ as the implicit function of $T_f$ around a known integral curve. * Conclude that $x \mapsto \alpha_x$ is $C^n$. ## For reviewers * Where should `Set.Icc.abs_sub_le` go? * Some proofs (marked with TODO) can be shortened after #34120, but I don't want it to be blocking. - [x] depends on: #34860 - [x] depends on: #34861 - [x] depends on: #34862 --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 854/0 | Mathlib.lean,Mathlib/Analysis/ODE/SmoothFlow.lean,Mathlib/Topology/MetricSpace/Pseudo/Lemmas.lean | 3 | 8 | ['github-actions', 'idontgetoutmuch', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | j-loreaux | 1 month ago | 52 days ago | 14 days |
| 36636 | Vierkantor | feat(Tactic/Linter): linter for comments that should become docstrings | This PR adds a linter that warns when there is a comment before a declaration which could become a docstring instead. A lot of the instances it spots appear to be simple typos, where a docstring was actually intended. Where a comment was originally intended, I would argue it is still a good idea include the comments in the generated documentation, or at least it does not hurt anyone. Closes: https://github.com/mathlib-initiative/TaskList/issues/41 --- - [ ] depends on: #36635 [](https://gitpod.io/from-referrer/) | t-linter blocked-by-other-PR merge-conflict | 312/260 | Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Abelian.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Subgroup/MulOppositeLemmas.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Basic.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/Algebra/Order/Group/Unbundled/Basic.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Ring/Star.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Polynomial/CoeffList.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/Morphisms/WeaklyEtale.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Module/Synonym.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Analysis/Fourier/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/InnerProductSpace/TensorProduct.lean,Mathlib/Analysis/LConvolution.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/Analysis/Meromorphic/Basic.lean,Mathlib/Analysis/Normed/Algebra/GelfandMazur.lean,Mathlib/Analysis/Normed/Algebra/Unitization.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/MStructure.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Cotangent.lean,Mathlib/CategoryTheory/Action/Concrete.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/FintypeCat.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/Cones.lean,Mathlib/CategoryTheory/Limits/FintypeCat.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryBiproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean,Mathlib/CategoryTheory/Monoidal/Closed/Ideal.lean,Mathlib/CategoryTheory/Products/Basic.lean,Mathlib/Combinatorics/Hindman.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/WalkCounting.lean,Mathlib/Combinatorics/SimpleGraph/Hall.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/ENNReal/Holder.lean,Mathlib/Data/Finset/Sym.lean,Mathlib/Data/Fintype/Sets.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Set/Pointwise/Support.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign/Defs.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/FreeGroup/IsFreeGroup.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/MaximalSubgroups.lean,Mathlib/Init.lean,Mathlib/LinearAlgebra/CliffordAlgebra/SpinGroup.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/LinearAlgebra/DFinsupp.lean,Mathlib/LinearAlgebra/Isomorphisms.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/UnivLE.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalLExpectation.lean,Mathlib/MeasureTheory/Function/JacobianOneDim.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Group/Measure.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/MeasureTheory/Measure/Haar/NormedSpace.lean,Mathlib/MeasureTheory/Measure/Haar/OfBasis.lean,Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean,Mathlib/ModelTheory/Algebra/Field/CharP.lean,Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/BourbakiWitt.lean | 142 | 5 | ['adomani', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 48 days ago | 45 seconds |
| 33817 | FlAmmmmING | fix(Combinatorics/Enumerative/Schroder): fix the definition of `smallSchroder` | In the previous definition, the small Schröder numbers were defined as ```LaTeX s_0 = 1, s_1 = 1, s_2 = 1, s_3 = 3... ``` , which does not match the sequence listed in OEIS A006318. Moreover, this definition makes it difficult to correctly write the generating function for the small Schröder numbers. This PR fixes this issue. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics large-import awaiting-author | 61/39 | Mathlib/Combinatorics/Enumerative/Schroder.lean | 1 | 20 | ['FlAmmmmING', 'YaelDillies', 'github-actions', 'vihdzp'] | YaelDillies | 1 month ago | 36 days ago | 74 days |
| 31595 | astrainfinita | chore: redefine `Ideal.IsPrime` | Redefine `Ideal.IsPrime` to make it correct for non-commutative cases --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 333/100 | Mathlib/Algebra/Order/Ring/Ordering/Defs.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Noetherian.lean,Mathlib/RingTheory/Ideal/Oka.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Ideal/Prime.lean,Mathlib/RingTheory/Ideal/Prod.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IsPrimary.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/Spectrum/Prime/Topology.lean,Mathlib/RingTheory/Valuation/Basic.lean | 22 | 33 | ['alreadydone', 'artie2000', 'astrainfinita', 'erdOne', 'github-actions', 'leanprover-bot', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | kim-em | 1 month ago | 33 days ago | 59 days |
| 36160 | pfaffelh | feat (Topology/Compactness/CompactSystem): closed and compact square cylinders form a compact system | feat (Topology/Compactness/CompactSystem): Closed and compact square cylinders form a compact system A square cylinder is a set of the form `s.pi t` in a product space. A closed compact square cylinder has `IsClosed (t i)` and `IsCompact (t i)` for all `i ∈ s`. This set system is a compact system (as introduced in PR #36013). Streamline the definition of square cylinders in MeasureTheory/Constructions/Cylinders on the way. Co-authors: Rémy Degenne remy.degenne@inria.fr --- - [ ] depends on: #36013 --- [](https://gitpod.io/from-referrer/) | brownian merge-conflict t-topology | 388/1 | Mathlib.lean,Mathlib/Data/Set/Accumulate.lean,Mathlib/Data/Set/Dissipate.lean,Mathlib/Data/Set/Prod.lean,Mathlib/MeasureTheory/Constructions/Cylinders.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/Topology/Compactness/CompactSystem.lean | 7 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 57 days ago | 30 minutes |
| 34703 | martinwintermath | Generalizing orthogonalBilin | --- [](https://gitpod.io/from-referrer/) | new-contributor | 51/25 | Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean | 3 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 36845 | grunweg | feat: the Levi-Civita connection on a manifold | --- - [ ] depends on: #36299 [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR | 1162/0 | Mathlib.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/LeviCivita.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Metric.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 43 days ago | 8 minutes |
| 35602 | JovanGerb | feat: replace `IsWellFounded` with `WellFounded` | This PR is an attempt to deprecate `IsWellFounded`. The reason it that it is entirely equivalent to `WellFounded`, with the only difference being that `IsWellFounded` is a class. This PR instead marks `WellFounded` as a class. What is annoying is that you sometimes want the API to use it as a class and sometimes as an explicit argument, and it's not entirely clear to me what the best compromise is: duplicating API, or just picking one form and using it. For example, `WellFounded.min`. --- [](https://gitpod.io/from-referrer/) | t-data awaiting-author merge-conflict | 452/493 | Archive/Imo/Imo1988Q6.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Group/UniqueProds/Basic.lean,Mathlib/Algebra/Lie/Engel.lean,Mathlib/Algebra/Lie/Subalgebra.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Pairing.lean,Mathlib/CategoryTheory/CofilteredSystem.lean,Mathlib/CategoryTheory/Subobject/ArtinianObject.lean,Mathlib/CategoryTheory/Subobject/NoetherianObject.lean,Mathlib/Computability/Partrec.lean,Mathlib/Data/DFinsupp/WellFounded.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Fin/Tuple/BubbleSortInduction.lean,Mathlib/Data/Finset/Dedup.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/Finsupp/WellFounded.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Data/List/Chain.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/Data/Nat/Cast/WithTop.lean,Mathlib/Data/Nat/WithBot.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Data/Rel.lean,Mathlib/Data/Set/Finite/Lemmas.lean,Mathlib/Data/Sum/Order.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/LinearAlgebra/ExteriorPower/Basis.lean,Mathlib/Logic/Hydra.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Cofinal.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Cover.lean,Mathlib/Order/Extension/Well.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/InitialSeg.lean,Mathlib/Order/Minimal.lean,Mathlib/Order/OrderIsoNat.lean,Mathlib/Order/PiLex.lean,Mathlib/Order/RelClasses.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/Order/RelIso/Set.lean,Mathlib/Order/RelSeries.lean,Mathlib/Order/Shrink.lean,Mathlib/Order/SuccPred/Archimedean.lean,Mathlib/Order/WellFounded.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/Order/WellQuasiOrder.lean,Mathlib/Order/WithBot.lean,Mathlib/RingTheory/Artinian/Module.lean,Mathlib/RingTheory/Bezout.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Basic.lean,Mathlib/RingTheory/FiniteLength.lean,Mathlib/RingTheory/Length.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean,Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean,Mathlib/RingTheory/Noetherian/Basic.lean,Mathlib/RingTheory/Noetherian/Defs.lean,Mathlib/RingTheory/Polynomial/UniqueFactorization.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/SimpleModule/Basic.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Basic.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Defs.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Ideal.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Nat.lean,Mathlib/RingTheory/Valuation/Archimedean.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/SetTheory/Ordinal/Rank.lean,Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Class.lean,Mathlib/SetTheory/ZFC/PSet.lean,Mathlib/SetTheory/ZFC/Rank.lean,Mathlib/Topology/Category/Profinite/Nobeling/Basic.lean,Mathlib/Topology/NoetherianSpace.lean | 80 | 43 | ['JovanGerb', 'SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | pechersky and vihdzp | 1 month ago | 34 days ago | 13 days |
| 34240 | mcdoll | feat(Analysis/Distribution): additional properties of the support | --- - [x] depends on: #34593 - [x] depends on: #34595 - [ ] depends on: #34637 - [x] depends on: #34638 [](https://gitpod.io/from-referrer/) | WIP t-analysis merge-conflict | 494/2 | Mathlib/Analysis/Calculus/FDeriv/Const.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Deriv.lean,Mathlib/Analysis/Distribution/Support.lean,Mathlib/Analysis/Distribution/TemperateGrowth.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean | 6 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 99 days ago | 34 seconds |
| 34419 | ster-oc | feat(RCLike): add `Continuous.re` and similar | This PR adds dot notation for `re`, `im`, `conj` and `ofReal` for `Continuous`, `LipschitzWith` and `Memℓp`. Given `hf : Continuous f` it allows to use `hf.re` to express `Continuous (fun x ↦ (f x).re)`, similarly to the usual `hf.add hg`. I also can add the same features for `Summable` but I am not sure where to place them, suggestions are appreciated! --- [](https://gitpod.io/from-referrer/) | t-analysis new-contributor awaiting-author merge-conflict | 186/41 | Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Analysis/RCLike/Basic.lean | 3 | 15 | ['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'ster-oc'] | j-loreaux | 1 month ago | 66 days ago | 8 days |
| 35558 | mcdoll | feat(Analysis/Distribution): algebraic properties of the support | --- - [ ] depends on: #34637 - [ ] depends on: #33477 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-analysis merge-conflict | 325/0 | Mathlib/Analysis/Distribution/Support.lean | 1 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 70 days ago | 6 minutes |
| 36572 | JovanGerb | feat(CategoryTheory/Limits/IsLimit): use `to_dual` on `IsLimit` | This PR makes a start at translating `IsLimit` using `to_dual`. --- - [ ] depends on: #35031 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 290/637 | Mathlib/CategoryTheory/Category/Basic.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/CategoryTheory/Functor/FullyFaithful.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Basic.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/Cones.lean,Mathlib/CategoryTheory/Limits/Constructions/Filtered.lean,Mathlib/CategoryTheory/Limits/IsLimit.lean,Mathlib/CategoryTheory/Limits/Shapes/NormalMono/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Reflexive.lean,Mathlib/CategoryTheory/NatIso.lean,Mathlib/CategoryTheory/NatTrans.lean,Mathlib/CategoryTheory/Opposites.lean,Mathlib/CategoryTheory/Whiskering.lean,Mathlib/Combinatorics/Quiver/Basic.lean,Mathlib/Tactic/Translate/Core.lean | 17 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 49 days ago | 2 minutes |
| 37405 | Paul-Lez | feat(Mathlib/Algebra/BigOperators/Fin): lemma about List.ofFn | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-CI | 6/0 | Mathlib/Algebra/BigOperators/Fin.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 31 days ago | 17 seconds |
| 37407 | Paul-Lez | feat(Data/List/Basic): lemma about sums of lists |
Co-authored-by: Xavier Genereux |
t-data | 4/0 | Mathlib/Data/List/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 31 days ago | 57 minutes |
| 37436 | RemyDegenne | feat: UniformIntegrable lemmas | --- [](https://gitpod.io/from-referrer/) | WIP brownian t-measure-probability | 109/0 | Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean | 3 | 1 | ['github-actions'] | nobody | 1 month ago | unknown | 0 seconds |
| 37429 | RemyDegenne | feat: API for stoppedValue and StoppedProcess | Co-authored-by: Thomas Zhu Co-authored-by: Alessio Rondelli --- [](https://gitpod.io/from-referrer/) | brownian t-measure-probability awaiting-author | 37/3 | Mathlib/Probability/Process/Stopping.lean | 1 | 3 | ['EtienneC30', 'github-actions'] | nobody | 1 month ago | 31 days ago | 1 hour |
| 32827 | erdOne | perf: `@[simp high]` on `*Hom.map_add` lemmas | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 10/0 | Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Ring/Hom/Defs.lean | 4 | 4 | ['WenrongZou', 'erdOne', 'github-actions', 'leanprover-radar'] | nobody | 1 month ago | unknown | 0 seconds |
| 35376 | michaellee94 | feat(Geometry/Manifold): orientable manifolds | --- - [x] depends on: #33189 [](https://gitpod.io/from-referrer/) | new-contributor WIP t-differential-geometry merge-conflict awaiting-author | 2116/11 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/MoebiusBand.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean,Mathlib/Geometry/Manifold/Orientation.lean,Mathlib/Topology/Closure.lean | 7 | 8 | ['Rida-Hamadani', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 75 days ago | 2 minutes |
| 30142 | shalliso | feat(Topology/Baire): define IsNonMeagre | non-meagre sets (also known as "of the second category") are worthy of their own definition and API. This was useful to me for formalizing a result of "automatic continuity", that is, a Baire-measurable homomorphism between Polish groups must be continuous. Simply working with the negation of IsMeagre quickly became cumbersome, and non-meagre sets have an important role in the study of Polish (e.g. locally compact) groups. From https://github.com/shalliso/automatic_continuity --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor merge-conflict awaiting-author | 83/1 | Mathlib/Topology/Baire/NonMeagre.lean,Mathlib/Topology/GDelta/Basic.lean | 2 | 6 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 210 days ago | 17 minutes |
| 27500 | Komyyy | feat: the Riemann zeta function is meromorphic | Also proves that the Hurwitz zeta function is meromorphic. This PR is split from #27499 to leave a good git diff history. --- The `large-import` change occurs only in the new module, so it poses no problem. - [x] depends on: #27499 - [x] depends on: #29817 This PR continues the work from #25597. Original PR: https://github.com/leanprover-community/mathlib4/pull/25597 | WIP t-analysis large-import merge-conflict | 112/3 | Mathlib/Analysis/Meromorphic/Basic.lean,Mathlib/Analysis/Meromorphic/Complex.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Deligne.lean,Mathlib/NumberTheory/LSeries/AbstractFuncEq.lean,Mathlib/NumberTheory/LSeries/HurwitzZeta.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaEven.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaOdd.lean,Mathlib/NumberTheory/LSeries/RiemannZeta.lean | 8 | 21 | ['Komyyy', 'github-actions', 'j-loreaux', 'loefflerd', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | j-loreaux | 1 month ago | 247 days ago | 30 days |
| 25983 | Multramate | feat(AlgebraicGeometry/EllipticCurve/Scheme): define the affine scheme associated to an elliptic curve | This contribution was created as part of the AIM workshop "Formalizing Algebraic Geometry" in June 2024. Co-authored-by: Michael Stoll [Michael.Stoll@uni-bayreuth.de](mailto:Michael.Stoll@uni-bayreuth.de) Co-authored-by: Junyan Xu [junyanxu.math@gmail.com](mailto:junyanxu.math@gmail.com) --- - [ ] depends on: #36086 - [ ] depends on: #36146 | t-algebraic-geometry blocked-by-other-PR | 165/13 | Mathlib.lean,Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Scheme.lean,Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/GroupTheory/GroupExtension/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean | 15 | 10 | ['MichaelStollBayreuth', 'Multramate', 'github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | 31 days ago | 25 days |
| 35317 | mkaratarakis | feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 5/5) | If a function `R : ℂ → ℂ` factors as `R z = (z - z₀) ^ r * R₁ z`, where `R₁` is analytic everywhere, then for any `k ≤ r`, there exists an everywhere analytic function `R₂ : ℂ → ℂ` such that the `k`-th iterated derivative of `R` is given by `deriv^[k] R z = (z - z₀) ^ (r - k) * (r! / (r - k)! * R₁ z + (z - z₀) * R₂ z)`. This lemma is necessary for the proof of the Gelfond-Schneider theorem in subsequent PRs. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor t-analysis awaiting-author | 57/0 | Mathlib/Analysis/Complex/CauchyIntegral.lean | 1 | 25 | ['MichaelStollBayreuth', 'github-actions', 'loefflerd', 'mkaratarakis'] | loefflerd | 1 month ago | 30 days ago | 26 days |
| 31613 | xyzw12345 | feat(RepresentationTheory/GroupCohomology): Non-abelian Group Cohomology | In this PR, we develop the theory of non-abelian group cohomology, following the section in GTM 67 - Local Fields by Jean-Pierre Serre. We defined H0 and H1, constructed the connection maps, proved the long exact sequence, and constructed natural isomorphisms between our H0, H1 and the existing `groupCohomology` API.
Co-authored by:
Jiedong Jiang @jjdishere |
t-algebra awaiting-author | 610/1 | Mathlib.lean,Mathlib/GroupTheory/Subgroup/Center.lean,Mathlib/RepresentationTheory/Homological/GroupCohomology/NonAbelian.lean | 3 | 10 | ['eric-wieser', 'github-actions', 'kbuzzard', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'tb65536', 'xyzw12345'] | eric-wieser | 1 month ago | 73 days ago | 35 days |
| 37179 | IvanRenison | feat(Combinatorics/SimpleGraph): add lemmas about left and right elements of `SimpleGraph.sum` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 18/0 | Mathlib/Combinatorics/SimpleGraph/Sum.lean | 1 | 3 | ['WilliamCoram', 'github-actions'] | nobody | 1 month ago | 36 days ago | 36 days |
| 37294 | eric-wieser | feat(MatrixExponential): remove some rat-algebra arguments | [#Is there code for X? > Algebra structures being induced @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Algebra.20structures.20being.20induced/near/582277644) --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #37292 | t-analysis | 89/8 | Mathlib/Analysis/Normed/Algebra/MatrixExponential.lean | 1 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 month ago | unknown | 0 seconds |
| 36728 | chenson2018 | feat: linter for terminal squeezes | See discussion at [#**mathlib4>linter requests@576559620** ](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/linter.20requests/near/576559620). This PR adds a linter that indicates when a flexible terminal tactic is squeezed and can be replaced by the unsqueezed equivalent. Like the other tactic analysis linters, this is off by default and intended for periodic reports. At the moment, this includes only `simp` and `simp_all`, just like the flexible linter, and does not take the further step of removing unused `simp` arguments. The style guide specifies that > a simp call is terminal if it closes the current goal or is only followed by flexible tactics and this linter complies with this by checking not only for "literal terminal" tactics that are syntactically the last to close a goal but also for "block terminal" tactics that are only followed by tactics permitted to follow a flexible tactic. (This terminology is not standard, but is a nice suggestion by @adomani) --- [](https://gitpod.io/from-referrer/) | large-import t-linter awaiting-author | 109/1 | Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,MathlibTest/TacticAnalysis.lean | 3 | 11 | ['SnirBroshi', 'chenson2018', 'github-actions', 'grunweg'] | thorimur | 1 month ago | 30 days ago | 12 days |
| 37507 | gasparattila | chore(Topology/Algebra/Module/Star): tag continuity lemmas with `fun_prop` | --- [](https://gitpod.io/from-referrer/) | t-topology easy delegated | 4/4 | Mathlib/Topology/Algebra/Module/Star.lean | 1 | 3 | ['gasparattila', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 1 month ago | 30 days ago | 35 minutes |
| 32285 | awainverse | chore(ModelTheory/Bundled): Replace CategoryTheory.Bundled | Replaces the use of CategoryTheory.Bundled L.Structure with a bespoke type for bundled L.Structures, L.StrucType. --- [](https://gitpod.io/from-referrer/) | t-logic awaiting-author merge-conflict | 95/55 | Mathlib/ModelTheory/Bundled.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/Order.lean,Mathlib/ModelTheory/Satisfiability.lean | 5 | 3 | ['github-actions', 'jcommelin', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 151 days ago | 17 hours |
| 37101 | fsefzig | feat: definition of kummer polynomials and prove that AdjoinRoot (KummerPolynomial n s) is etale | This defines the Kummer polynomial ` KummerPolynomial n s := X^n - s` over a ring R and constructs the following instances for `AdjoinRoot (KummerPolynomial n s)`: · Faithfullyflat · SmoothOfRelativeDimension 0 · Etale | t-ring-theory new-contributor awaiting-author | 345/0 | Mathlib.lean,Mathlib/RingTheory/AdjoinRootKummer.lean | 2 | 24 | ['acmepjz', 'chrisflav', 'fsefzig', 'github-actions', 'vihdzp'] | nobody | 1 month ago | unknown | 0 seconds |
| 37443 | SnirBroshi | feat(Combinatorics/SimpleGraph/Walks/Operations): permutations of support | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 15/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 29 days ago | 29 days ago | 30 days |
| 35327 | SnirBroshi | feat(SimpleGraph/Acyclic): the union of two trees that share exactly one vertex is a tree | --- A surprisingly painful proof for something that seems trivial when drawing on the board. To avoid any doubts: no AI was involved whatsoever. [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 95/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 2 | 10 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vbeffara', 'vlad902'] | YaelDillies | 29 days ago | 41 days ago | 33 days |
| 35548 | gasparattila | fix(fun_prop): do not unfold semireducible definitions in the presence of projections | --- [](https://gitpod.io/from-referrer/) | t-meta merge-conflict | 129/227 | Mathlib/Algebra/Category/ContinuousCohomology/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Distribution/DerivNotation.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Fourier/Notation.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Condensed/Light/TopCatAdjunction.lean,Mathlib/Condensed/TopCatAdjunction.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Defs.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/MeasurableSpace/Embedding.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/Probability/Distributions/Fernique.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Basic.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Mor.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Topology/Algebra/AffineSubspace.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/Constructions.lean,Mathlib/Topology/Algebra/Constructions/DomMulAct.lean,Mathlib/Topology/Algebra/ContinuousAffineEquiv.lean,Mathlib/Topology/Algebra/Field.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Algebra/Group/Matrix.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/LinearMapCompletion.lean,Mathlib/Topology/Algebra/Module/Alternating/Topology.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Topology.lean,Mathlib/Topology/Algebra/Module/Star.lean,Mathlib/Topology/Algebra/Module/WeakBilin.lean,Mathlib/Topology/Algebra/Star/LinearMap.lean,Mathlib/Topology/Category/TopCat/Limits/Basic.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/Constructions/SumProd.lean,Mathlib/Topology/ContinuousMap/Algebra.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/Homeomorph/Defs.lean,Mathlib/Topology/Homeomorph/Lemmas.lean,Mathlib/Topology/Instances/TrivSqZeroExt.lean,Mathlib/Topology/Path.lean,MathlibTest/fun_prop_dev.lean | 60 | 8 | ['DavidLedvinka', 'JovanGerb', 'github-actions', 'j-loreaux', 'lecopivo', 'mathlib-merge-conflicts'] | nobody | 29 days ago | unknown | 0 seconds |
| 32583 | MJ141592 | refactor(SimpleGraph): change bridges not to require the edge to be present | Remove the requirement for edges to exist in definition of isBridge, and then change the related lemmas to adjust for this, by renaming, fixing the statements and fixing the proofs, including in Acyclic. Closes #31690. --- - [x] depends on: #36802 - [x] depends on: #36804 | t-combinatorics new-contributor | 84/84 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean | 4 | 20 | ['MJ141592', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 29 days ago | 29 days ago | 29 days |
| 34487 | martinwintermath | feat(LinearAlgebra/SesquilinearForm): add instances for SeparatingLeft, SeparatingRight and Nondegenerate | Add typeclass instances for `Fact B.SeparatingLeft`, `Fact B.SeparatingRight`, `Fact B.Nondegenerate`: * inferring `Fact B.flip.SeparatingLeft` from `Fact B.SeparatingRight` and vice versa * inferring `Fact B.SeparatingLeft` and `Fact B.SeparatingRight` from `Fact B.Nondegenerate` * inferring `Fact B.SeparatingLeft` and `Fact B.Nondegenerate` for `.id` and `Dual.eval` * inferring `Fact B.Nondegenerate` from `B.IsPerfPair` I also updated `PointedCone.dual_univ` to demonstrate the usefulness of these additions. Note that I needed to add an import to `Cone/Dual.lean` which somehow imports cardinals. So I needed to remove cardinals from `assert_not_exists`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor large-import | 84/16 | Mathlib/Geometry/Convex/Cone/Dual.lean,Mathlib/LinearAlgebra/Dual/Lemmas.lean,Mathlib/LinearAlgebra/PerfectPairing/Basic.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean | 4 | 4 | ['github-actions', 'martinwintermath', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | joelriou | 29 days ago | 32 days ago | 13 days |
| 29982 | hrmacbeth | feat: new `isolate` tactic | This PR adds a new tactic, `isolate`, which "solves for x" in an equation or relation. For example: ```lean example (a b : ℝ) (f : ℝ → ℝ) : 5 * f a - 3 < b := by isolate f a -- new goal: `⊢ f a < (b + 3) / 5` ``` The `isolate` tactic may generate side goals, if these are necessary to justify the transformation. The tactic will attempt to justify such side goals using `positivity` (as in the above example), unification, or type class inference, but if unsuccessful will present them to the user. For example: ```lean example (a b c : ℝ) (f : ℝ → ℝ) : c * f a - 3 < b := by isolate f a -- new goal: `⊢ f a < (b + 3) / c` -- second (side) new goal: `⊢ 0 < c` ``` The `isolate` tactic is extensible. Coverage may be extended to new relations and new operations-to-be-undone by tagging appropriate lemmas with the new `@[isolate]` attribute. --- [](https://gitpod.io/from-referrer/) | large-import t-meta awaiting-author | 943/1 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Isolate.lean,Mathlib/Tactic/Isolate/Core.lean,Mathlib/Tactic/Isolate/Tagging.lean,Mathlib/Tactic/Relation/Symm.lean,MathlibTest/Isolate/Heavyweight.lean,MathlibTest/Isolate/Lightweight.lean,scripts/noshake.json | 12 | 82 | ['JovanGerb', 'PatrickMassot', 'Vierkantor', 'github-actions', 'hrmacbeth', 'kim-em', 'mathlib4-merge-conflict-bot'] | JovanGerb | 29 days ago | 29 days ago | 80 days |
| 36832 | KryptosAI | chore(Data/Finset/Card): rename `pred_card_le_card_erase` to `sub_one_card_le_card_erase` | ## Summary The name `pred_card_le_card_erase` suggests `Nat.pred` but the statement uses `- 1` (i.e., `Nat.sub 1`). Rename to `sub_one_card_le_card_erase` to match the actual statement. A deprecated alias is added for backwards compatibility. ### Files changed - `Mathlib/Data/Finset/Card.lean` — definition renamed + deprecated alias - `Mathlib/Data/Finset/Powerset.lean` — reference updated - `Mathlib/Combinatorics/Additive/SubsetSum.lean` — reference updated - `Mathlib/Algebra/Polynomial/EraseLead.lean` — reference updated Addresses the `Finset.pred_card_le_card_erase` item in #21584. ## AI disclosure I used Claude Code to explore the codebase (finding all references to rename) and to draft the PR description. I reviewed and understand all changes — these are straightforward renames with a deprecated alias. | new-contributor | 22/15 | Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Combinatorics/Additive/SubsetSum.lean,Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean,Mathlib/Combinatorics/SetFamily/Shadow.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Set/Card.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/RingTheory/Ideal/Operations.lean | 9 | 5 | ['KryptosAI', 'Multramate', 'github-actions', 'ooovi'] | nobody | 28 days ago | 28 days ago | 42 days |
| 37585 | cascone26 | feat: formal statements of Robin's and Lagarias' inequalities equivalent to RH | ## Summary This PR adds `Mathlib/NumberTheory/LSeries/RobinInequality.lean`, which contains formal Lean 4 statements of two classical equivalences of the Riemann Hypothesis: **Robin's theorem (1984):** RH ↔ σ₁(n) < e^γ · n · ln(ln(n)) for all n > 5040 **Lagarias' theorem (2002):** RH ↔ σ₁(n) ≤ H_n + exp(H_n) · ln(H_n) for all n ≥ 1 ### New declarations - `robinBound (n : ℕ) : ℝ` — the Robin bound e^γ · n · ln(ln(n)) - `lagariasBound (n : ℕ) : ℝ` — the Lagarias bound H_n + exp(H_n) · ln(H_n) - `robin_iff_RH : RiemannHypothesis ↔ ∀ n > 5040, σ₁(n) < robinBound n` - `lagarias_iff_RH : RiemannHypothesis ↔ ∀ n ≥ 1, σ₁(n) ≤ lagariasBound n` ### Status The **statements** are complete and use existing Mathlib primitives: - `ArithmeticFunction.sigma` for σ₁ - `Real.eulerMascheroniConstant` for γ - `harmonic` for H_n (with ℚ → ℝ coercion) - `RiemannHypothesis` from `Mathlib.NumberTheory.LSeries.RiemannZeta` The **proofs** are currently `sorry`. The Robin direction (RH → inequality) requires analytic number theory following Robin's original 1984 paper. The converse uses Gronwall's theorem on superior highly composite numbers. Both are substantial Mathlib projects in their own right. This PR establishes the formal statements as a foundation for future proof work. These equivalences are not currently formalized anywhere in Mathlib. ### References - G. Robin, *Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann*, J. Math. Pures Appl. **63** (1984), 187–213. - J. Lagarias, *An elementary problem equivalent to the Riemann hypothesis*, Amer. Math. Monthly **109** (2002), 534–543. ### Note on `sorry` I'm aware Mathlib does not merge `sorry`-laden PRs in general. I'm submitting this as a draft to: 1. Get feedback on whether the statement formulation is idiomatic 2. Establish that these statements don't already exist in Mathlib under a different name 3. Invite collaboration on completing the proofs | t-number-theory new-contributor | 98/0 | Mathlib/NumberTheory/LSeries/RobinInequality.lean | 1 | 2 | ['github-actions'] | nobody | 28 days ago | unknown | 0 seconds |
| 36346 | kckennylau | chore: add simp lemma to unfold Algebra.algHom | ```lean @[simp] lemma Algebra.coe_algHom : ⇑(Algebra.algHom R A B) = algebraMap A B := rfl ``` --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 6/2 | Mathlib/Algebra/Algebra/Hom.lean,Mathlib/RingTheory/Etale/StandardEtale.lean | 2 | 5 | ['acmepjz', 'artie2000', 'github-actions', 'ocfnash'] | ocfnash | 28 days ago | 28 days ago | 26 days |
| 11964 | adamtopaz | feat: The functor of points of a scheme | We construct the functor of points functor, and prove that it's full and faithful. --- - [x] depends on: #11947 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry t-category-theory | 210/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/FunctorOfPoints.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean | 3 | 4 | ['github-actions', 'grunweg'] | nobody | 28 days ago | 749 days ago | 20 minutes |
| 36937 | Yaohua-Leo | feat(Algebra/Jordan): add first linearization lemmas for IsCommJordan | [](https://gitpod.io/from-referrer/) AI assistance disclosure: I used AI assistance for CI/debugging and module-structure fixes in this PR. The mathematical content and main lemmas were written by me, with help from @pelicanhere. This PR adds a new file `Mathlib/Algebra/Jordan/Linearization.lean` containing linearization lemmas for the commutative Jordan identity. Main declarations: * `IsCommJordan.four_nsmul_associator_mul_add` * `IsCommJordan.associator_mul_add` These lemmas formalize a first linearization of the commutative Jordan identity using `associator`, following McCrimmon, Proposition 1.8.5. --- I put these lemmas in a separate file because I expect follow-up linearization lemmas to belong naturally in the same place. I am also happy to rename declarations or move the file if reviewers would prefer. | t-algebra new-contributor awaiting-author | 60/0 | Mathlib.lean,Mathlib/Algebra/Jordan/Linearization.lean | 2 | 6 | ['Yaohua-Leo', 'github-actions', 'grunweg', 'ocfnash'] | ocfnash | 28 days ago | 28 days ago | 13 days |
| 37446 | artie2000 | refactor(Algebra): uniform API for substructures | * Add class for `SetLike` instances whose map preserves meets - the intended interpretation is substructures whose closure properties are preserved under intersection * Abstract out the `CompleteLattice` instance and `closure` adjunction on such instances This change unifies a significant part of the API for algebraic substructures. --- - [x] depends on #32984 [](https://gitpod.io/from-referrer/) Original PR: https://github.com/leanprover-community/mathlib4/pull/25963 | t-data WIP | 721/184 | Mathlib.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Group/Submonoid/Basic.lean,Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/Algebra/Group/Subsemigroup/Basic.lean,Mathlib/Algebra/Group/Subsemigroup/Defs.lean,Mathlib/Algebra/Group/Subsemigroup/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/MulOpposite.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Data/SetLike/Lattice.lean,Mathlib/GroupTheory/Subsemigroup/Centralizer.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/Tactic/MkClosureLemmas.lean,Mathlib/Tactic/MkIffOfInductiveProp.lean | 16 | 7 | ['artie2000', 'github-actions', 'vihdzp'] | nobody | 28 days ago | 30 days ago | 53 minutes |
| 34956 | kbuzzard | test: add a file with universe tests | Just to keep track of some horrible universe issues in Kaehler.Polynomial. This shouldn't be a PR, I just wanted a way of keeping track of the mess that universe normalisation in core causes in alg geom. If core moves on universe normalization then this file hopefully provides a useful test. --- [](https://gitpod.io/from-referrer/) | t-ring-theory WIP | 266/0 | Mathlib/RingTheory/Kaehler/UniverseTest.lean | 1 | 1 | ['github-actions'] | nobody | 28 days ago | 82 days ago | 6 minutes |
| 37248 | harahu | doc(Tactic): avoid lazy continuation lines | We resolve the ambiguity inherent in lazy (un-indented) list item continuation lines by either indenting them or separating them by inserting a newline in the cases where the item continuation was a mistake. --- [](https://gitpod.io/from-referrer/) | documentation | 131/116 | Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/ComputeDegree.lean,Mathlib/Tactic/DepRewrite.lean,Mathlib/Tactic/Finiteness.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/SimpIntro.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Widget/InteractiveUnfold.lean | 17 | 1 | ['Multramate', 'github-actions'] | nobody | 28 days ago | 35 days ago | 35 days |
| 37495 | IvanRenison | feat(Combinatorics/SimpleGraph/Sum): add homomorphism, embedding and isomorphism of sums | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 58/2 | Mathlib/Combinatorics/SimpleGraph/Sum.lean | 1 | 15 | ['IvanRenison', 'YaelDillies', 'github-actions', 'mkaratarakis'] | nobody | 28 days ago | 28 days ago | 29 days |
| 37399 | SnirBroshi | feat(Combinatorics/SimpleGraph/Paths): `IsPath` and `Nil` lemmas | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 10/3 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean | 2 | 4 | ['Rida-Hamadani', 'SnirBroshi', 'github-actions'] | nobody | 28 days ago | 31 days ago | 31 days |
| 37056 | lecopivo | feat(Tactic/FunProp): proper support for metavariables in fun_prop goals | This PR add proper support for metavariables in `fun_prop` goals thus allows for properly solving goals like `HasFDerivAt k f ?f' x`. --- This extension to `fun_prop` will enable computation of derivatives by properly handling metavariables in `fun_prop` goal thus allowing us to solve `HasFDerivAt k f ?f' x` [](https://gitpod.io/from-referrer/) | t-meta large-import awaiting-author | 1219/220 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Elab.lean,Mathlib/Tactic/FunProp/Simproc.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/Measurability.lean,MathlibTest/fun_prop_dev.lean,MathlibTest/fun_prop_dev_out_param.lean | 12 | 12 | ['eric-wieser', 'github-actions', 'lecopivo', 'mathlib-merge-conflicts', 'thorimur'] | alexjbest and thorimur | 27 days ago | 28 days ago | 7 days |
| 37624 | IvanRenison | feat(Combinatorics/SimpleGraph/Maps): add theorems about composition | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 25/4 | Mathlib/Combinatorics/SimpleGraph/Maps.lean | 1 | 1 | ['github-actions'] | nobody | 27 days ago | 27 days ago | 27 days |
| 36813 | AlexeyMilovanov | feat(Computability.Encoding): add self-delimiting unary and pair encodings | Adds `unaryPrefix` (a self-delimiting $1^n 0$ code) and `prefixPair` to `Mathlib.Computability.Encoding`. **Key changes:** * **`unaryPrefix`**: A prefix-free unary encoding for $\mathbb{N}$, distinct from the existing `unaryEncodeNat`. * **`unaryPrefix_append_inj`**: A basic cancellation lemma that allows unique extraction of a unary prefix from a concatenated list. * **`prefixPair`**: A self-delimiting pairing function for boolean lists, defined as $\text{unaryPrefix } |x| \frown x \frown y$. * **`prefixPair_inj`**: A concise proof of pair injectivity leveraging the new prefix lemmas. | t-computability new-contributor awaiting-author | 56/1 | Mathlib/Computability/Encoding.lean | 1 | 2 | ['Komyyy', 'github-actions'] | Komyyy | 27 days ago | 27 days ago | 16 days |
| 35136 | joelriou | feat(AlgebraicGeometry): points of the small étale site | The main definition in this PR is `Scheme.pointSmallEtale`. Given a morphism `Spec (.of Ω) ⟶ S` where `Ω` is a separably closed field, we define the corresponding point of the small étale site of `S`. We show that these points form a conservative family. (This PR also removes the definition `Scheme.geometricFiber` which was not correct.) Co-authored-by: Christian Merten --- - [x] depends on: #35141 - [x] depends on: #35175 - [x] depends on: #35240 - [x] depends on: #34976 - [ ] depends on: #33958 [](https://gitpod.io/from-referrer/) | WIP t-algebraic-geometry blocked-by-other-PR large-import merge-conflict | 1632/73 | Mathlib.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/AlgebraicGeometry/Fiber.lean,Mathlib/AlgebraicGeometry/Morphisms/Etale.lean,Mathlib/AlgebraicGeometry/Sites/AffineEtale.lean,Mathlib/AlgebraicGeometry/Sites/Etale.lean,Mathlib/AlgebraicGeometry/Sites/EtalePoint.lean,Mathlib/CategoryTheory/Abelian/GrothendieckAxioms/Sheaf.lean,Mathlib/CategoryTheory/Elements.lean,Mathlib/CategoryTheory/EssentialImage.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Jointly.lean,Mathlib/CategoryTheory/Limits/Constructions/Over/Connected.lean,Mathlib/CategoryTheory/Limits/FinallySmall.lean,Mathlib/CategoryTheory/Limits/MorphismProperty.lean,Mathlib/CategoryTheory/MorphismProperty/Comma.lean,Mathlib/CategoryTheory/ObjectProperty/Small.lean,Mathlib/CategoryTheory/ShrinkYoneda.lean,Mathlib/CategoryTheory/Sites/DenseSubsite/OneHypercoverDense.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/Precoverage.lean,Mathlib/CategoryTheory/Sites/LocallySurjective.lean,Mathlib/CategoryTheory/Sites/Point/Basic.lean,Mathlib/CategoryTheory/Sites/Point/Conservative.lean,Mathlib/CategoryTheory/Sites/PrecoverageToGrothendieck.lean,Mathlib/CategoryTheory/Sites/SheafOfTypes.lean,Mathlib/CategoryTheory/Sites/Types.lean,Mathlib/CategoryTheory/Types/Epimorphisms.lean,Mathlib/Topology/Sheaves/Points.lean,Mathlib/Topology/Sheaves/Sheaf.lean | 29 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 27 days ago | 79 days ago | 1 second |
| 37644 | matthunz | feat(Order/Causal): add `Causal` ordering for stream functions | Adds `Causal` ordering for stream functions and related theorems: ```lean def Causal (f : Stream' α → Stream' β) : Prop := ∀ (x y : Stream' α) (t : ℕ), (∀ s, s ≤ t → x s = y s) → f x t = f y t ``` A stream function is causal if the output at time `t` depends only on inputs up to time `t`. Causal stream functions are commonly used in signal processing, reactive systems, and semantics of stateful computations, where outputs cannot depend on future inputs. ## Future work - Mealy machines: define Mealy machines as causal stream functions with state, and relate them to standard automata-theoretic constructions. - Feedback and delay operators: formalize feedback loops and delayed composition, enabling modeling of stateful and recursive stream definitions. --- [](https://gitpod.io/from-referrer/) | new-contributor t-order | 79/0 | Mathlib.lean,Mathlib/Order/Causal/Basic.lean,Mathlib/Order/Causal/Defs.lean | 3 | 2 | ['github-actions'] | nobody | 26 days ago | unknown | 0 seconds |
| 36086 | Multramate | feat(Algebra): add liftEquiv for groups, rings, algebras, and adjoin roots | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 105/22 | Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/FieldTheory/RatFunc/Luroth.lean,Mathlib/GroupTheory/GroupExtension/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean | 12 | 7 | ['CBirkbeck', 'Multramate', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts'] | dagurtomas | 26 days ago | 43 days ago | 15 days |
| 36893 | Komyyy | feat: make `Primrec` and `Computable` `fun_prop` preds | --- [](https://gitpod.io/from-referrer/) | t-computability | 248/92 | Mathlib/Computability/Primrec/Basic.lean,comment_out.sh,uncomment.sh | 3 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 26 days ago | unknown | 0 seconds |
| 34464 | Komyyy | refactor(Topology/Order/LowerUpperTopology): use `to_dual` | --- Many files should be also dualized for this file... - [x] depends on: #33964 - [x] depends on: #34465 - [x] depends on: #34640 - [x] depends on: #36969 [](https://gitpod.io/from-referrer/) | t-topology t-order | 41/62 | Mathlib/Topology/Order/LowerUpperTopology.lean | 1 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 26 days ago | unknown | 0 seconds |
| 24665 | Komyyy | feat(Mathlib/Topology/Metrizable/Uniformity): every uniform space is generated by a family of pseudometrics | --- [](https://gitpod.io/from-referrer/) | WIP t-topology | 55/0 | Mathlib/Topology/Metrizable/Uniformity.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 26 days ago | 358 days ago | 1 second |
| 37663 | khwilson | feat(NumberTheory/ArithmeticStatistics/Reducible): Counting reducible polynomials | A result of van der Waerden critical in arithmetic statistics which shows that the number of reducible monic polynomials of degree n is O(H^(n-1)). --- [](https://gitpod.io/from-referrer/) | 441/2 | Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Data/Set/Card.lean,Mathlib/NumberTheory/ArithmeticStatistics/Reducible.lean,Mathlib/NumberTheory/MahlerMeasure.lean | 4 | 1 | ['github-actions'] | nobody | 26 days ago | unknown | 0 seconds | |
| 36406 | SnirBroshi | feat(Combinatorics/SimpleGraph/Matching): `#verts = 2 * #edgeSet` | --- - [ ] depends on: #36442 [](https://gitpod.io/from-referrer/) | t-combinatorics blocked-by-other-PR | 122/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Data/Sym/Sym2/Card.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 26 days ago | 52 days ago | 22 hours |
| 34155 | zcyemi | feat(Geometry/Euclidean/Triangle): add altitudeFoot lies strictly between endpoints for an obtuse angle | --- add `sbtw_orthogonalProjection_of_angle_ge_pi_div_two` | t-euclidean-geometry awaiting-author | 93/0 | Mathlib/Geometry/Euclidean/Triangle.lean | 1 | 4 | ['github-actions', 'jsm28'] | nobody | 25 days ago | 95 days ago | 5 days |
| 37160 | vihdzp | feat: product of Coxeter matrices | The Coxeter matrix `A * B` is the block matrix `!![A, 2; 2, B]`. --- I've used multiplication to denote this under the logic that the product of Coxeter groups has a Coxeter matrix given by this construction. Perhaps this isn't desirable, considering it doesn't match matrix multiplication. I'm open to suggestions. [](https://gitpod.io/from-referrer/) | t-group-theory WIP | 13/3 | Mathlib/GroupTheory/Coxeter/Matrix.lean | 1 | 5 | ['github-actions', 'mathlib-bors', 'tb65536', 'vihdzp'] | tb65536 | 25 days ago | 25 days ago | 12 days |
| 37666 | TJHeeringa | feat(Analysis/InnerProductSpace/Reproducing): Lipschitz wrt the kernel pseudometric | --- RKHSs $H$ have bounded point evaluations. This induces a pseudometric on the underlying space `X`. The function $f\in H$ are Lipschitz continuous with Lipschitz constant $\||f\||$. This PR puts the pseudometric instance inline. The instance cannot just be put outside the theorem, because that gives problems with resolving type classes / instance synthesis. An alternative to inlining the instance is a type class synonym. One copy would be the RKHS with whatever metric X came equipped with and one copy would be the RKHS with the induced metric. Since there are likely more theorems depending on this pseudometric, I suspect that it is actually a better solution. AI: I had the instance outside the theorem. Lean gave problems with resolving type classes / instance synthesis. I asked Claude and ChatGPT to interpret the error and fix it. The latter just spit gibberish and the former suggested inlining but in a way that didn't work. Then, I asked on Zulip and got the same suggestion but working. The type synonym alternative was also suggested there. [](https://gitpod.io/from-referrer/) | t-analysis new-contributor help-wanted | 20/3 | Mathlib/Analysis/InnerProductSpace/Reproducing.lean | 1 | 3 | ['TJHeeringa', 'github-actions'] | nobody | 25 days ago | unknown | 0 seconds |
| 37701 | grunweg | debug: investigate error in #37688 | --- Goal: figure out the bad error messages in #37688. This PR focuses on one such proof: adding grind as default gcongr discharger just locally already produces an error. `grind` cannot solve the first side goal; that is fine --- the error caused is not; that should be improved. [](https://gitpod.io/from-referrer/) | WIP t-analysis | 11/2 | Mathlib/Analysis/Fourier/FourierTransformDeriv.lean | 1 | 2 | ['github-actions'] | nobody | 25 days ago | 25 days ago | 7 seconds |
| 37707 | MavenRain | feat(Combinatorics/SimpleGraph): add IsMaximalClique/IsMaximalIndepSet, refactor IsMaximum* to MaximalFor | Addresses #34962 | new-contributor t-combinatorics | 92/31 | Mathlib/Combinatorics/SimpleGraph/Clique.lean,MathlibTest/ClearUnneeded.lean | 2 | 2 | ['github-actions'] | nobody | 24 days ago | 24 days ago | 16 minutes |
| 37702 | grunweg | chore: golf using {norm,push}_cast | Not exhaustive --- [](https://gitpod.io/from-referrer/) | 23/22 | Archive/Imo/Imo2025Q3.lean,Mathlib/Algebra/Ring/GeomSum.lean,Mathlib/Analysis/Asymptotics/LinearGrowth.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Data/Int/Log.lean,Mathlib/GroupTheory/CommutingProbability.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/QExpansion.lean,Mathlib/NumberTheory/SumFourSquares.lean,Mathlib/RingTheory/DividedPowers/RatAlgebra.lean,Mathlib/RingTheory/LittleWedderburn.lean,Mathlib/RingTheory/WittVector/WittPolynomial.lean | 12 | 5 | ['github-actions', 'grunweg', 'j-loreaux'] | nobody | 24 days ago | 24 days ago | 25 days | |
| 37690 | yuanyi-350 | feat(Combinatorics/Enumerative/Bell): sum over partition shapes | ## Summary - add multiplicative lemmas relating `Multiset.bell` when inserting a part - prove `Nat.bell` as a sum of `Multiset.bell` over partition shapes - Kill TODO in `Mathlib/Combinatorics/Enumerative/Bell.lean` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 153/16 | Mathlib/Combinatorics/Enumerative/Bell.lean | 1 | 1 | ['github-actions'] | nobody | 24 days ago | 25 days ago | 25 days |
| 37730 | RemyDegenne | feat: define total variation distance | Define the total variation distance between two finite measures, using the variation of the difference seen as signed measures. --- [](https://gitpod.io/from-referrer/) | please-adopt WIP t-measure-probability | 56/0 | Mathlib.lean,Mathlib/InformationTheory/TotalVariation/Basic.lean | 2 | 1 | ['github-actions'] | nobody | 24 days ago | 24 days ago | 1 second |
| 37695 | Morten-Ness | refactor(GroupTheory/Complement): simplify complement proofs | Simplifies the proofs of: - `Subgroup.IsComplement'.symm` - `Subgroup.isComplement_singleton_left` - `Subgroup.isComplement_singleton_right` No API changes. AI assistance: I used Codex/LLM suggestions as a starting point, then manually checked the proofs, and verified the final version locally. --- [](https://gitpod.io/from-referrer/) | t-group-theory new-contributor awaiting-author | 15/17 | Mathlib/GroupTheory/Complement.lean | 1 | 4 | ['github-actions', 'tb65536'] | tb65536 | 24 days ago | 24 days ago | 19 hours |
| 37652 | yuanyi-350 | feat(ProbabilityTheory/MeasureTheorey): Add Coupling lemma | ## Summary This PR formalizes a standard coupling bound on countable measurable spaces. More precisely, for a probability measure `μ` and measurable maps `Y Z : Ω → S` with `S` countable, it proves the `L¹` bound `∑' k : S, |(μ.map Y).real ({k} : Set S) - (μ.map Z).real ({k} : Set S)| ≤ 2 * μ.real {ω | Y ω ≠ Z ω}`. ## Main changes - add `tsum_restrict_preimage_singleton_eq` and `tsum_restrict_preimage_singleton_eq'` in `MeasureTheory/Measure/Restrict.lean`; - add `tsum_measureReal_restrict_preimage_singleton_eq`, `coupling_term_bound`, and `coupling_lemma` in `MeasureTheory/Measure/Real.lean`; - include some local cleanup in `MeasureTheory/Measure/Real.lean`, mainly simplifying `toReal`-related arguments and notation. ## References - Wikipedia: https://en.wikipedia.org/wiki/Coupling_(probability) --- [](https://gitpod.io/from-referrer/) | t-measure-probability awaiting-author | 107/36 | Mathlib/MeasureTheory/Measure/Real.lean,Mathlib/MeasureTheory/Measure/Restrict.lean | 2 | 2 | ['RemyDegenne', 'github-actions'] | kex-y | 24 days ago | 24 days ago | 2 days |
| 31135 | kckennylau | feat(RingTheory): is localization iff is localization on saturation | In this PR we show that `A` is a localization of `R` on the submonoid `S` iff it is so on the saturation of `S`. Crucially, the saturation of `S` is precisely the elements that become a unit in `A`. --- - [x] depends on: #31132 [](https://gitpod.io/from-referrer/) | t-ring-theory delegated | 53/0 | Mathlib.lean,Mathlib/RingTheory/Localization/Saturation.lean | 2 | 15 | ['alreadydone', 'chrisflav', 'github-actions', 'kckennylau', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | chrisflav | 24 days ago | 24 days ago | 32 days |
| 37489 | michael-novak-math | feat: add the fundamental theorem of plane curves | We add to the PlaneCurves file created in PR #36731 a classical result in the subject of differential geometry of plane curves: the fundamental theorem of plane curves. --------- - [ ] depends on: #36731 | new-contributor t-differential-geometry t-analysis blocked-by-other-PR | 651/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean,Mathlib/Geometry/PlaneCurves.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,docs/references.bib | 5 | 5 | ['github-actions', 'mathlib-dependent-issues', 'michael-novak-math'] | nobody | 24 days ago | 30 days ago | 3 hours |
| 37746 | AntoineChambert-Loir | feat(RingTheory/AugmentationIdeal): tensor product and augmentation ideals | Co-authored with: @mariainesdff --- - [ ] depends on: #37745 - [ ] depends on: #37744 - [ ] [](https://gitpod.io/from-referrer/) | WIP t-algebra t-ring-theory blocked-by-other-PR | 602/0 | Mathlib.lean,Mathlib/RingTheory/IsAugmentation.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 24 days ago | 24 days ago | 12 seconds |
| 37745 | AntoineChambert-Loir | feat(RingTheory/AugmentationIdeal): base change for augmentation ideals | Base change for augmentation ideals Co-authored with: @mariainesdff --- - [ ] depends on: #37744 [](https://gitpod.io/from-referrer/) | WIP t-ring-theory t-algebra blocked-by-other-PR | 602/0 | Mathlib.lean,Mathlib/RingTheory/IsAugmentation.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 24 days ago | 24 days ago | 41 seconds |
| 37757 | JovanGerb | chore(Order/liminfLimsup): use `to_dual` | This PR uses `to_dual` on `limsup`. This PR still depends on many other PRs. --- [](https://gitpod.io/from-referrer/) | 86/251 | Mathlib/Order/LiminfLimsup.lean,Mathlib/Tactic/Translate/ToDual.lean | 2 | 2 | ['github-actions', 'mathlib-bors'] | nobody | 24 days ago | 24 days ago | 8 seconds | |
| 37762 | EtienneC30 | feat: scalar multiplication of an `NNReal` against `1 : ENNReal` | --- [](https://gitpod.io/from-referrer/) | t-data | 4/3 | Mathlib/Data/ENNReal/Action.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Probability.lean,Mathlib/Probability/Distributions/SetBernoulli.lean | 3 | 1 | ['github-actions'] | nobody | 24 days ago | 24 days ago | 24 days |
| 37716 | slavanaprienko | feat(LinearAlgebra/Matrix/Determinant): Desnanot-Jacobi identity | This PR adds the Desnanot-Jacobi identity (also known as the Lewis Carroll identity or Dodgson condensation): for any (n+2)×(n+2) matrix M over a commutative ring, $$\det(M) \cdot \det(M_{1,n}^{1,n}) = \det(M_1^1) \cdot \det(M_n^n) - \det(M_1^n) \cdot \det(M_n^1)$$ The proof follows Bressoud's *Proofs and Confirmations* (Cambridge University Press, 1999): multiply M by an auxiliary matrix built from columns of the adjugate, then compare determinants. This yields the identity premultiplied by det(M). To cancel, we pass to a universal polynomial ring (an integral domain with nonzero determinant), then specialize back to arbitrary commutative rings. It seems there's some interest in adding this: https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Determinantal.20identity.20and.20the.20Cauchy.20matrix.20determinant/with/582946873 --- | t-algebra new-contributor awaiting-author | 252/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Determinant/DesnanotJacobi.lean | 2 | 7 | ['github-actions', 'grunweg', 'slavanaprienko'] | nobody | 24 days ago | 24 days ago | 9 hours |
| 36036 | grunweg | [placeholder PR uniting ongoing work on connections and geodesics] | --- - [x] depends on: #34263 - [x] depends on: #36277 - [x] depends on: #36279 - [x] depends on: #36285 - [ ] depends on: #36299 - [x] depends on: #37537 [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry blocked-by-other-PR | 5115/32 | Mathlib.lean,Mathlib/Geometry/Manifold/CheatSheet.md,Mathlib/Geometry/Manifold/MFDeriv/NormedSpace.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/Riemannian/ExistsRiemannianMetric.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/ChristoffelSymbols.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Curvature.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Ehresmann.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Geodesics.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/IntegralCurvePrelim.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/LeviCivita.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Lift.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Metric.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Prelim.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Torsion2.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/TrivPrelim.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Trivial.lean,Mathlib/Geometry/Manifold/VectorBundle/GramSchmidtOrtho.lean,Mathlib/Geometry/Manifold/VectorBundle/Hom.lean,Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean,Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean,Mathlib/Geometry/Manifold/VectorBundle/OrthonormalFrame.lean,Mathlib/Geometry/Manifold/VectorBundle/SmoothSection.lean,Mathlib/Geometry/Manifold/VectorBundle/Tensoriality.lean,Mathlib/Geometry/Manifold/VectorBundle/Unused.lean | 27 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 24 days ago | 59 days ago | 7 seconds |
| 37761 | EtienneC30 | feat: define Bernoulli distribution | Define the Bernoulli distribution over an arbitrary measurable space as `Ber(x, y, p) := toNNReal p • dirac x + toNNReal (σ p) • dirac y`. Deprecate `PMF.binomial`. Co-authored-by: @DavidLedvinka --- - [ ] depends on: #37762 [](https://gitpod.io/from-referrer/) | t-measure-probability large-import blocked-by-other-PR | 206/7 | Mathlib.lean,Mathlib/Data/ENNReal/Action.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Probability.lean,Mathlib/Probability/Distributions/Bernoulli.lean,Mathlib/Probability/Distributions/SetBernoulli.lean,Mathlib/Probability/Moments/SubGaussian.lean,Mathlib/Probability/ProbabilityMassFunction/Binomial.lean,Mathlib/Probability/ProbabilityMassFunction/Constructions.lean,Mathlib/Probability/ProbabilityMassFunction/Integrals.lean | 9 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 24 days ago | 24 days ago | 14 minutes |
| 37642 | SnirBroshi | chore(Combinatorics/SimpleGraph): tidy various files | --- Concept inspired by @Ruben-VandeVelde :) [](https://gitpod.io/from-referrer/) | t-combinatorics | 89/72 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Copy.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/IncMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Subwalks.lean | 8 | 2 | ['SnirBroshi', 'github-actions'] | nobody | 24 days ago | 24 days ago | 26 days |
| 26158 | upobir | feat(NumberTheory/Divisors): add int divisors | This PR continues the work from #25209. Original PR: https://github.com/leanprover-community/mathlib4/pull/25209 | awaiting-author t-number-theory merge-conflict | 101/2 | Mathlib/NumberTheory/Divisors.lean | 1 | 38 | ['MichaelStollBayreuth', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'upobir'] | mariainesdff | 24 days ago | 270 days ago | 45 days |
| 36698 | ghseeli | feat(Combinatorics/Enumerative): Latin squares | This PR defines Latin rectangles and Latin squares and proves an extension theorem using Hall's Marriage Theorem. ## Main results - `group_to_cayley_table`: every finite group `G` yields a `LatinSquare G G`. - `latin_rectangle_extends_one_row`: a (non-square) `LatinRectangle` extends to a `LatinRectangle` with one more row. This is an application of **Hall's Marriage Theorem**, `hallMatchingsOn.nonempty`. - `latin_rectangle_extends_to_latin_square`: a `LatinRectangle` extends to a `LatinSquare`. This is included in a new file `Combinatorics/Enumerative/LatinSquare.lean`. --- - [ ] depends on: #37190 - [ ] depends on: #37720 [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics blocked-by-other-PR | 642/0 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/DoubleCounting.lean,Mathlib/Combinatorics/Enumerative/LatinSquare.lean,Mathlib/Combinatorics/Pigeonhole.lean,Mathlib/Data/Fintype/Card.lean,docs/references.bib | 6 | 78 | ['SnirBroshi', 'cjrl', 'eric-wieser', 'ghseeli', 'github-actions', 'mathlib-dependent-issues', 'vlad902'] | nobody | 23 days ago | 28 days ago | 16 days |
| 37784 | SnirBroshi | feat(Order/ConditionallyCompleteLattice/Basic): `ConditionallyCompleteLinearOrderBot (WithBot α)` | --- [](https://gitpod.io/from-referrer/) | t-order | 29/0 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 23 days ago | 23 days ago | 23 days |
| 35349 | RemyDegenne | feat: data processing inequality for the Kullback-Leibler divergence | --- - [x] depends on: #34841 - [x] depends on: #35089 - [x] depends on: #27953 [](https://gitpod.io/from-referrer/) | WIP t-measure-probability merge-conflict | 241/24 | Mathlib.lean,Mathlib/InformationTheory/KullbackLeibler/DataProcessing.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondJensen.lean,Mathlib/MeasureTheory/Measure/Decomposition/IntegralRNDeriv.lean | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 23 days ago | 75 days ago | 1 second |
| 36888 | CoolRmal | feat: generalize some lemmas by using conditional Jensen | This PR includes two possible ways of generalizing `integral_abs_condExp_le`: 1. Replace absolute values with norms. 2. Consider absolute values defined on a lattice with a solid norm. --- - [x] depends on: #36877 [](https://gitpod.io/from-referrer/) | t-measure-probability WIP merge-conflict | 209/169 | Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondJensen.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Real.lean,Mathlib/Probability/CondVar.lean,Mathlib/Probability/Martingale/BorelCantelli.lean,Mathlib/Probability/Martingale/Centering.lean | 6 | 5 | ['CoolRmal', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 23 days ago | 42 days ago | 5 minutes |
| 37057 | erdOne | feat(AlgebraicTopology): `SimplexCategory.toTop_map_δ_apply` | --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology maintainer-merge awaiting-author merge-conflict | 48/2 | Mathlib/AlgebraicTopology/CechNerve.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/TopologicalSimplex.lean,Mathlib/Data/Fin/SuccPred.lean | 5 | 17 | ['Raph-DG', 'dagurtomas', 'erdOne', 'github-actions', 'joelriou', 'mathlib-merge-conflicts', 'riccardobrasca'] | robin-carlier | 23 days ago | 25 days ago | 4 days |
| 36936 | Rida-Hamadani | feat(CategoryTheory): PBW Theorem | --- [](https://gitpod.io/from-referrer/) | t-category-theory | 141/0 | Mathlib/CategoryTheory/Monad/PBW.lean | 1 | 1 | ['github-actions'] | nobody | 23 days ago | unknown | 0 seconds |
| 36934 | Parcly-Taxel | refactor: `Language` as a one-field structure | I came across definitional equality problems when trying to prove the following as part of a challenge from my PhD advisor: ```lean import Mathlib.Computability.Language variable {α : Type*} /-- `IsSingleton y` states that `y` consists of only one word, and that word is not empty. -/ def IsSingleton (y : Language α) : Prop := (∀ z ≤ y, z = y ∨ z = 0) ∧ y ≠ 1 ∧ y ≠ 0 lemma isSingleton_iff {y : Language α} : IsSingleton y ↔ ∃ w ≠ [], y = {w} := by sorry ``` This refactor resolves said defeq problems by making `Language` into a one-field structure with `toSet` and `ofSet`. --- - [ ] depends on: #37603 | t-computability blocked-by-other-PR | 179/110 | Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Computability/DFA.lean,Mathlib/Computability/EpsilonNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/MyhillNerode.lean,Mathlib/Computability/NFA.lean,Mathlib/Computability/RegularExpressions.lean | 7 | 21 | ['Parcly-Taxel', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | YaelDillies | 23 days ago | 23 days ago | 11 days |
| 36282 | smmercuri | chore(Topology/Algebra/Valued/WithVal): remove `@` lemma | Prove `Valuation.IsEquiv.uniformContinuous_congr` directly and remove `Valuation.IsEquiv.uniformContinuous` which is not needed. --- - [x] depends on: #36310 [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 18/32 | Mathlib/Topology/Algebra/Valued/WithVal.lean | 1 | 5 | ['faenuccio', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smmercuri'] | faenuccio | 23 days ago | 32 days ago | 18 days |
| 37281 | AltSoKoly | Update EdgeConnectivity.lean | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author | 123/0 | Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Data/Int/GCD.lean | 2 | 5 | ['github-actions', 'grunweg', 'themathqueen'] | nobody | 23 days ago | 35 days ago | 7 minutes |
| 24957 | eric-wieser | feat: use ` binderNameHint` in sum_congr | Zulip thread: [#new members > Choosing dummy variable inside summation @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Choosing.20dummy.20variable.20inside.20summation/near/518492888)
Co-authored-by: Joachim Breitner |
t-algebra merge-conflict | 23/16 | Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/List/OfFn.lean,Mathlib/Data/Multiset/Count.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Option/Basic.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Sym/Basic.lean,Mathlib/Data/Sym/Sym2.lean | 13 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 22 days ago | 350 days ago | 14 minutes |
| 37185 | gasparattila | chore(Data/Finset/Lattice/Fold): rename `comp_sup_*` to `apply_sup_*` | These lemmas are of the form `g (s.sup f) = s.sup (g ∘ f)` with no composition on the LHS. --- - [x] depends on: #37047 [](https://gitpod.io/from-referrer/) | 44/26 | Mathlib/Algebra/Order/Ring/Finset.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/Normed/Group/Ultra.lean,Mathlib/Data/ENNReal/Lemmas.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/Finset/Max.lean,Mathlib/Data/NNReal/Basic.lean,Mathlib/Order/PartialSups.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/Topology/ContinuousMap/CompactlySupported.lean,Mathlib/Topology/ContinuousMap/Ordered.lean | 11 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 22 days ago | 22 days ago | 22 days | |
| 26165 | oliver-butterley | feat(MeasureTheory.VectorMeasure): add lemma which shows that variation of a `ℝ≥0∞` VectorMeasure is equal to itself | Add a lemma for the variation of a VectorMeasure which tells that if `μ` is `VectorMeasure X ℝ≥0∞` then `variation μ = μ`. Co-authored-by: @yoh-tanimoto - [ ] depends on: #26160 --- [](https://gitpod.io/from-referrer/) | merge-conflict new-contributor t-measure-probability awaiting-author | 467/0 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Lemmas.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 22 days ago | 300 days ago | 15 days |
| 37344 | vihdzp | feat: monotone function `Cardinal → α` is eventually constant | --- [](https://gitpod.io/from-referrer/) | t-set-theory t-order awaiting-author | 57/0 | Mathlib.lean,Mathlib/Logic/Small/Basic.lean,Mathlib/SetTheory/Cardinal/EventuallyConst.lean | 3 | 3 | ['YaelDillies', 'github-actions', 'vihdzp', 'wwylele'] | YaelDillies | 22 days ago | 22 days ago | 10 days |
| 37386 | gasparattila | chore: call `dsimp` in the default tactic of `ContinuousLinearMap` | --- This will also reduce the breakage in https://github.com/leanprover-community/mathlib4/pull/35548. [](https://gitpod.io/from-referrer/) | t-topology awaiting-author | 33/76 | Mathlib/Algebra/Category/ContinuousCohomology/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Distribution/DerivNotation.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Fourier/Notation.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/ConjSqrt.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/Probability/Distributions/Fernique.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Basic.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/LinearMapCompletion.lean,Mathlib/Topology/Algebra/Module/Alternating/Topology.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Topology.lean,Mathlib/Topology/Algebra/Module/Star.lean,Mathlib/Topology/Algebra/Star/LinearMap.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousMap/Algebra.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/Instances/TrivSqZeroExt.lean | 36 | 15 | ['gasparattila', 'github-actions', 'j-loreaux', 'leanprover-radar', 'mathlib-bors', 'themathqueen'] | j-loreaux | 22 days ago | 24 days ago | 6 days |
| 35295 | Rida-Hamadani | feat(SimpleGraph): `dropLast` of a cycle is a path | --- [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 14/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 2 | 14 | ['Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vlad902'] | YaelDillies | 22 days ago | 22 days ago | 34 days |
| 37456 | Robertboy18 | feat(LinearAlgebra/AffineSpace): add Desargues's theorem | This PR adds an affine (parallel) version of Desargues's theorem! **Main changes** - New file `Mathlib/LinearAlgebra/AffineSpace/Desargues.lean` with `parallel_third_side_of_perspective`: if two triangles are in perspective from a point `S` and two pairs of corresponding sides are parallel, then the third pair of sides is parallel. - Add the corresponding `public import` to `Mathlib.lean`. - Update `docs/100.yaml` (entry #87) to point to the new declaration. **High level Proof idea is from the rocq repository!** Compare side vectors via `exists_eq_smul_of_parallel` for the two given pairs of parallel sides; the shared comparison along `SA` forces the same scalar, yielding parallelism of the third sides. Tests: `lake build Mathlib.LinearAlgebra.AffineSpace.Desargues`! | t-algebra new-contributor awaiting-author | 159/0 | Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/Desargues.lean,docs/100.yaml | 3 | 8 | ['Robertboy18', 'SnirBroshi', 'copilot-pull-request-reviewer', 'github-actions', 'wwylele'] | eric-wieser | 22 days ago | 22 days ago | 8 days |
| 36534 | Vierkantor | experiment: define a simproc for simplifying `a = b` from `b = a` | Can we define a working simproc that tries to simplify expressions of the form `b = a` given simp lemmas talking about `a = b`? If this does not hurt build times too much, that would solve [task 40](https://github.com/mathlib-initiative/TaskList/issues/40). --- - [ ] depends on: #37850 [](https://gitpod.io/from-referrer/) | t-logic WIP blocked-by-other-PR | 146/56 | Archive/Examples/IfNormalization/WithoutAesop.lean,Archive/Imo/Imo2024Q5.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/MvPolynomial/Nilpotent.lean,Mathlib/Algebra/Order/Antidiag/Finsupp.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Pi.lean,Mathlib/Analysis/Complex/Arg.lean,Mathlib/CategoryTheory/Preadditive/Biproducts.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/Fin/Tuple/Sort.lean,Mathlib/Data/Matrix/Diagonal.lean,Mathlib/Data/Set/Pairwise/Lattice.lean,Mathlib/Data/Set/Prod.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Finite/Polynomial.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/Geometry/Euclidean/Angle/Bisector.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/LinearAlgebra/Matrix/Permutation.lean,Mathlib/LinearAlgebra/Matrix/Stochastic.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/NumberTheory/LegendreSymbol/GaussEisensteinLemmas.lean,Mathlib/NumberTheory/Padics/RingHoms.lean,Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/Tactic/NormNum/Irrational.lean | 33 | 15 | ['Vierkantor', 'github-actions', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 22 days ago | 50 days ago | 1 minute |
| 37852 | dagurtomas | feat(Tactic): specialize and dsimp | --- [](https://gitpod.io/from-referrer/) | WIP LLM-generated t-meta | 546/0 | Mathlib/Tactic.lean,Mathlib/Tactic/SpecializeAndDsimp.lean,MathlibTest/SpecializeAndDsimp.lean | 3 | 1 | ['github-actions'] | nobody | 22 days ago | unknown | 0 seconds |
| 33329 | mcdoll | feat(Analysis): Fourier-based Sobolev spaces | We define Sobolev spaces (or Bessel potential spaces). --- - [x] depends on: #33242 - [x] depends on: #32769 - [x] depends on: #33404 - [x] depends on: #33597 - [x] depends on: #33636 - [x] depends on: #33741 - [x] depends on: #33751 - [x] depends on: #33752 - [x] depends on: #33776 - [x] depends on: #33859 - [x] depends on: #34027 - [x] depends on: #34099 - [x] depends on: #34100 - [x] depends on: #34294 [](https://gitpod.io/from-referrer/) | WIP t-analysis merge-conflict | 506/0 | Mathlib/Analysis/Distribution/Sobolev.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean | 2 | 8 | ['CoolRmal', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 21 days ago | 125 days ago | 1 second |
| 33434 | astrainfinita | chore: redefine `Finsupp.indicator` using `Finsupp.onFinset` | --- [](https://gitpod.io/from-referrer/) | t-data merge-conflict | 6/17 | Mathlib/Data/Finsupp/Indicator.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 21 days ago | 21 days ago | 5 days |
| 37697 | IvanRenison | feat(Combinatorics/SimpleGraph/Clique): add theorems about cliques and induced graphs | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 22/0 | Mathlib/Combinatorics/SimpleGraph/Clique.lean | 1 | 9 | ['Rida-Hamadani', 'SnirBroshi', 'github-actions'] | nobody | 21 days ago | 25 days ago | 25 days |
| 34466 | Komyyy | chore: modulize tests (N/N) | --- Privately imports are intentional. I manually modulize each test so that the purpose of the tests is not lost by modulizing. - [x] Await the release of leanprover/lean4#12198 - [x] depends on: #34970 - [x] depends on: #35288 - [x] depends on: #36882 - [x] depends on: #36981 - [x] depends on: #37654 - [ ] Await the release of leanprover/lean4#13329 - [x] depends on: #37820 [](https://gitpod.io/from-referrer/) | CI | 299/61 | MathlibTest/AssertImported.lean,MathlibTest/BinaryRec.lean,MathlibTest/Bound/attribute.lean,MathlibTest/Bound/bound.lean,MathlibTest/CategoryTheory/Bicategory/Normalize.lean,MathlibTest/CategoryTheory/Elementwise.lean,MathlibTest/CategoryTheory/Monoidal/Normalize.lean,MathlibTest/Clean.lean,MathlibTest/DFinsuppMultiLinear.lean,MathlibTest/GRewrite.lean,MathlibTest/LibrarySuggestions/sineQuaNon.lean,MathlibTest/LongFile.lean,MathlibTest/Nat/log.lean,MathlibTest/Perm.lean,MathlibTest/Polynomial.lean,MathlibTest/Quaternion.lean,MathlibTest/RefinedDiscrTree.lean,MathlibTest/antidiagonal.lean,MathlibTest/dfinsupp_notation.lean,MathlibTest/fast_instance.lean,MathlibTest/grind/field.lean,MathlibTest/grind/grobner.lean,MathlibTest/grind/linarith.lean,MathlibTest/grind/lint.lean,MathlibTest/grind/pairwise_disjoint.lean,MathlibTest/grind/set.lean,MathlibTest/grind/trig.lean,MathlibTest/hintAll.lean,MathlibTest/slow_simp.lean,MathlibTest/solve_by_elim/basic.lean,MathlibTest/solve_by_elim/dummy_label_attr.lean,MathlibTest/solve_by_elim/instances.lean,MathlibTest/vec_notation.lean,check_modulized_tests.lean,not_modulized_modules.txt | 35 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 21 days ago | unknown | 0 seconds |
| 35881 | astrainfinita | chore: do not use `inf` `sup` in `LinearOrder` lemmas | `max` and `sup` have been unified into the same function. It is no longer necessary to create lemmas about `sup` for `LinearOrder`. This PR moves `max` lemmas to an earlier file to ensure that files importing deprecated `sup` lemmas can use them. --- - [ ] depends on: #35841 - [ ] depends on: #35880 [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 123/126 | Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/Group/PosPart.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Polynomial/Reverse.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/ConvergenceRadius.lean,Mathlib/Analysis/CStarAlgebra/Basic.lean,Mathlib/Analysis/Complex/OpenMapping.lean,Mathlib/Analysis/Normed/Group/Seminorm.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/List/Infix.lean,Mathlib/Data/Nat/Factorization/LCM.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/NumberTheory/AbelSummation.lean,Mathlib/NumberTheory/LSeries/PrimesInAP.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/Summable.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/Order/BoundedOrder/Lattice.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/Defs/LinearOrder.lean,Mathlib/Order/Filter/ENNReal.lean,Mathlib/Order/Heyting/Basic.lean,Mathlib/Order/Interval/Set/LinearOrder.lean,Mathlib/Order/Lattice.lean,Mathlib/Order/MinMax.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Probability/Moments/Basic.lean,Mathlib/Probability/Moments/IntegrableExpMul.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean,Mathlib/RingTheory/Polynomial/HilbertPoly.lean,Mathlib/RingTheory/PowerSeries/Restricted.lean,Mathlib/RingTheory/PowerSeries/WeierstrassPreparation.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/Tactic/Order/ToInt.lean,Mathlib/Topology/MetricSpace/Algebra.lean,Mathlib/Topology/MetricSpace/BundledFun.lean,Mathlib/Topology/MetricSpace/Infsep.lean,Mathlib/Topology/Semicontinuity/Basic.lean | 43 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 21 days ago | 62 days ago | 7 minutes |
| 36418 | j-loreaux | feat: add `IsMulCommutative` instances for topological closures of subobjects | --- - [ ] depends on: #36549 - [ ] depends on: #36552 - [ ] depends on: #36553 [](https://gitpod.io/from-referrer/) | t-topology t-algebra blocked-by-other-PR merge-conflict | 1047/162 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Subgroup/Defs.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Algebra/Group/Submonoid/Defs.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Defs.lean,Mathlib/Algebra/Group/Subsemigroup/Membership.lean,Mathlib/Algebra/HierarchyDesign.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/CategoryTheory/Center/Linear.lean,Mathlib/CategoryTheory/Center/NegOnePow.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Grp_.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Mon_.lean,Mathlib/Data/ZMod/QuotientGroup.lean,Mathlib/FieldTheory/Galois/Abelian.lean,Mathlib/GroupTheory/Focal.lean,Mathlib/GroupTheory/IsPerfect.lean,Mathlib/GroupTheory/Schreier.lean,Mathlib/GroupTheory/SchurZassenhaus.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/GroupTheory/SpecificGroups/ZGroup.lean,Mathlib/GroupTheory/Subgroup/Centralizer.lean,Mathlib/GroupTheory/Submonoid/Centralizer.lean,Mathlib/GroupTheory/Subsemigroup/Centralizer.lean,Mathlib/GroupTheory/Transfer.lean,Mathlib/NumberTheory/NumberField/CMField.lean,Mathlib/RepresentationTheory/AlgebraRepresentation/Basic.lean,Mathlib/RepresentationTheory/Irreducible.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubring/Defs.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Defs.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Algebra/Monoid.lean,Mathlib/Topology/Algebra/NonUnitalAlgebra.lean,Mathlib/Topology/Algebra/NonUnitalStarAlgebra.lean,Mathlib/Topology/Algebra/Ring/Basic.lean,Mathlib/Topology/Algebra/StarSubalgebra.lean | 50 | 8 | ['github-actions', 'j-loreaux', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 21 days ago | 49 days ago | 1 minute |
| 35812 | khwilson | feat(MeasureTheory/Group/GeometryOfNumbers): successive minima and existence of a directional basis | Define the successive minima of a discrete subgroup of a real vector space with respect to a convex set. These invariants show up throughout the geometry of numbers and are the focus of Minkowski's Second Theorem (whose statement is left here with a `proof_wanted`).
Note: The key lemma is that the "gauge set" of the convex set is closed. I took the approach of showing that it is sequentially closed. There's an alternative approach via showing it's the union of a finite number of closed sets. I personally thought this approach was more intuitive, but the union approach may result in a slightly shorter proof.
Co-authored-by: Yaël Dillies |
new-contributor t-measure-probability awaiting-author merge-conflict | 544/77 | Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Polynomial/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/LinearAlgebra/Basis/Fin.lean,Mathlib/LinearAlgebra/Basis/Submodule.lean,Mathlib/LinearAlgebra/FiniteDimensional/Lemmas.lean,Mathlib/LinearAlgebra/LinearIndependent/Basic.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean,Mathlib/RingTheory/Polynomial/Bernstein.lean,Mathlib/Topology/Instances/Int.lean,Mathlib/Topology/Instances/Real/Lemmas.lean,Mathlib/Topology/Order/Bornology.lean | 16 | 32 | ['Vierkantor', 'YaelDillies', 'github-actions', 'joneugster', 'khwilson', 'mathlib-merge-conflicts'] | YaelDillies | 21 days ago | 24 days ago | 36 days |
| 34078 | joneugster | feat(scripts/autolabel): add label dependencies for better automatic label assignment | --- This is a tracking-PR containing the complete list of proposed labels. As there might be room for discussion about these settings, there will be smaller PRs adding these dependencies in smaller batches. - [x] depends on: #34948 - [x] depends on: #34949 - [x] depends on: #34066 - [x] depends on: #34079 - [x] depends on: #34677 - [x] depends on: #34678 - [ ] depends on: #34952 - [x] depends on: #36242 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR CI merge-conflict | 88/34 | scripts/autolabel.lean | 1 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 21 days ago | unknown | 0 seconds |
| 37854 | JovanGerb | chore(FieldTheory/SplittingField/Construction): don't expose the construction | This PR removes `@[expose] public section` from the implementation of `SplittingField`, so that none of the constants with "aux" in the name are exported. Additionally, remove some defeq abuse. --- [](https://gitpod.io/from-referrer/) | t-algebra | 62/26 | Mathlib/FieldTheory/SplittingField/Construction.lean,MathlibTest/instance_diamonds/FieldTheory/SplittingField/Construction.lean | 2 | 2 | ['github-actions', 'mathlib-bors'] | nobody | 21 days ago | 21 days ago | 31 minutes |
| 35802 | xroblot | feat(RamificationInertia): splitting in the decomposition field | --- - [x] depends on: #35798 - [ ] depends on: #35405 - [x] depends on: #35371 [](https://gitpod.io/from-referrer/) | t-number-theory large-import merge-conflict | 279/4 | Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Basic.lean | 4 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 21 days ago | 64 days ago | 8 minutes |
| 37413 | Paul-Lez | feat(Combinatorics/Enumerative/Composition): add lemma about products of embeddings | Co-authored-by: Xavier Genereux [xaviergenereux@hotmail.com](mailto:xaviergenereux@hotmail.com) --- [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 4/0 | Mathlib/Combinatorics/Enumerative/Composition.lean | 1 | 3 | ['github-actions', 'robin-carlier'] | nobody | 21 days ago | 21 days ago | 10 days |
| 36785 | hommmmm | feat(RingTheory/Localization): Nagata's criterion for primality in localization away | ## Summary - Add `dvd_of_mem_span_singleton_localization`: if `p` is prime and `p ∤ x`, then membership in the span of the image of `x` in `R[1/p]` implies divisibility by `x`. - Add `prime_of_prime_in_localization` (Nagata's criterion): if `p` is prime, `x` is irreducible, and the image of `x` in `R[1/p]` is prime, then `x` is prime. ## References - [Stacks Project, Tag 0AFU](https://stacks.math.columbia.edu/tag/0afu) ## AI Disclosure This code is written without AI, then uses Claude Code with cameronfreer's [Lean4-skills](https://github.com/cameronfreer/lean4-skills) (specifically, the `review`, `refactor`, and `golf` workflow) for style changes, refactoring and golfing. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 50/0 | Mathlib/RingTheory/Localization/Away/Basic.lean | 1 | 6 | ['chrisflav', 'github-actions', 'hommmmm'] | chrisflav | 21 days ago | 21 days ago | 22 days |
| 37111 | tannerduve | feat(Computability): add Nat.PrimrecIn and PrimrecIn | - Add `Nat.PrimrecIn`: primitive recursive functions relative to a set of oracles - Add `PrimrecIn`: lifts `Nat.PrimrecIn` to `Primcodable` types A `PrimrecIn` version of `RecursiveIn.iff_nat` (i.e., `PrimrecIn O (f : ℕ → ℕ) ↔ Nat.PrimrecIn O f`) is left as future work as it requires proving `Nat.PrimrecIn O Nat.pred`, which needs additional API for `Nat.PrimrecIn`. --- Split out from #34937 as requested in review. - [x] depends on: #37061 | t-computability new-contributor awaiting-author | 24/0 | Mathlib/Computability/RecursiveIn.lean | 1 | 14 | ['Komyyy', 'bryangingechen', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tannerduve'] | nobody | 20 days ago | 22 days ago | 1 day |
| 36733 | xroblot | feat(RamificationInertia): decomposition field and inertia field of subfields | If `D` (resp. `E`) is the decomposition (resp. inertia) field of `P` in `L/K` and `F` is a subextension, then the decomposition (resp. inertia) field of the prime of `F` below `P` in `F/K` is` D ⊓ F` (resp. `E ⊓ F`). --- - [ ] depends on: #36544 - [ ] depends on: #35991 - [x] depends on: #36391. [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 818/31 | Mathlib.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/NumberTheory/RamificationInertia/Inertia.lean,Mathlib/NumberTheory/RamificationInertia/Ramification.lean,Mathlib/RingTheory/Ideal/Galois.lean | 13 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 20 days ago | 46 days ago | 48 seconds |
| 36763 | alok | refactor(Order/Filter/Germ): partial sections for Filter.Product | ## Summary - Refactor `Filter.Product` from total functions to partial sections (`Product.Section`) with filter-large domains - Adapt the model-theoretic `Prestructure` and Łoś's theorem proofs to partial sections - Add `Germ ↔ Product` bridge equivalence for constant families ## Motivation The current `Filter.Product` is a quotient of total functions `(a : α) → ε a` by eventual equality. This requires all fibers to be inhabited, which is not the mathematically correct construction. The ultraproduct should only require a section defined on a filter-large set. The new `Product.Section` structure carries: - A domain `dom : Set α` with `dom ∈ l` - A dependent section `val : (a : dom) → ε a` Two sections are equivalent if they agree on some filter-large common domain. This matches the standard mathematical construction and enables proper ultraproducts where some fibers may be empty. ## Changes ### `Mathlib/Order/Filter/Germ/Basic.lean` - New `Product.Section` structure (partial section with filter-large domain) - `productSetoid` redefined over `Product.Section` - `Product.ofTotal` embeds total sections; `eq_iff_ofTotal` characterizes equality ### `Mathlib/ModelTheory/Ultraproducts.lean` - `sectionStructure`: first-order structure on partial sections (funMap restricts to domain intersection, RelMap checks on common domain) - `setoidPrestructure` adapted with full proofs of `fun_equiv` and `rel_equiv` - `funMap_cast`, `boundedFormula_realize_cast` (rel case), `all` quantifier case all reproved for partial sections - Łoś's theorem statement unchanged; `sentence_realize` still has the same API ### `Mathlib/Order/Filter/Germ/Product.lean` (new) - `Germ.toProduct` / `Product.toGerm`: round-trip between germs and constant-family products - `Germ.prodEquiv`: equivalence for inhabited constant families (backward compat) ## Test plan - [x] `lake build` passes (7607/7607 modules) - [x] All linter warnings resolved - [x] `Mathlib.ModelTheory.Satisfiability` (uses `Filter.Product` + `sentence_realize`) still compiles - [x] `Mathlib.Analysis.Real.Hyperreal` still compiles --- Context: [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Nonstandard.20Analysis/near/513178715) — Violeta Hernández asked for fixing the ultraproduct definition as the first step after #33650 deprecated the old hyperreal machinery. 🤖 Generated with [Claude Code](https://claude.com/claude-code) | new-contributor merge-conflict | 278/49 | Mathlib.lean,Mathlib/ModelTheory/Ultraproducts.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/Order/Filter/Germ/Product.lean | 4 | 5 | ['alok', 'github-actions', 'mathlib-merge-conflicts', 'plp127'] | nobody | 20 days ago | unknown | 0 seconds |
| 37871 | JJYYY-JJY | feat: support intros and simple rintro in introMerge | * Extend the `introMerge` linter to handle `intros` and a safe subset of `rintro` tactics, allowing it to suggest merging a wider variety of adjacent introduction tactics. * Introduce helper functions to normalize supported `rcases` and `rintro` patterns into equivalent `intro` arguments for consistent analysis. * Add tests to verify the correct merging of mixed introduction tactics and ensure intervening tactics prevent merging. --- [](https://gitpod.io/from-referrer/) | t-meta new-contributor | 101/9 | Mathlib/Dynamics/OmegaLimit.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,MathlibTest/TacticAnalysis.lean | 3 | 3 | ['copilot-pull-request-reviewer', 'github-actions'] | dwrensha | 20 days ago | 21 days ago | 21 days |
| 36764 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `DirectSum.lequivCongrLeft_lof`: unchanged 🎉 * `AnalyticOnNhd.preimage_mem_codiscreteWithin`: unchanged 🎉 * `mem_permsOfList_of_mem`: unchanged 🎉 * `PNat.mod_le`: unchanged 🎉 * `Computation.map_parallel`: unchanged 🎉 * `Sigma.curry_update`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 11/41 | Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Data/Fintype/Perm.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Seq/Parallel.lean,Mathlib/Data/Sigma/Basic.lean | 6 | 13 | ['chenson2018', 'euprunin', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 20 days ago | 20 days ago | 45 days | |
| 37055 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `OreLocalization.smul'_char`: unchanged 🎉 * `Equiv.Perm.cycleOf_mem_cycleFactorsFinset_iff`: unchanged 🎉 * `StrictMono.ite'`: unchanged 🎉 * `Mathlib.Meta.NormNum.isInt_ediv`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 10/29 | Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Factors.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Tactic/NormNum/DivMod.lean | 4 | 11 | ['chenson2018', 'euprunin', 'github-actions'] | nobody | 20 days ago | 20 days ago | 38 days | |
| 36693 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Equiv.Perm.ofSubtype_swap_eq`: unchanged 🎉 * `Filter.hasBasis_biInf_of_directed'`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 2/10 | Mathlib/GroupTheory/Perm/Support.lean | 1 | 4 | ['artie2000', 'chenson2018', 'euprunin', 'github-actions'] | nobody | 20 days ago | 46 days ago | 46 days | |
| 36299 | grunweg | feat: metric connections | This file defines what it means for a connection on a Riemannian vector bundle `(V, g)` to be *compatible* with the metric `g`. Namely, the differentiated metric tensor `∇ g` (defined by `(X, σ, τ) ↦ X g(σ, τ) - g(∇_X σ, τ) - g(σ, ∇_X τ)`) should vanish on all differentiable vector fields `X` and differentiable sections `σ`, `τ`. From the path towards the the Levi-Civita connection and Riemannian geometry. Co-authored-by: Heather Macbeth [25316162+hrmacbeth@users.noreply.github.com](mailto:25316162+hrmacbeth@users.noreply.github.com) Co-authored-by: Patrick Massot [patrickmassot@free.fr](mailto:patrickmassot@free.fr) --- WIP: some API issues need to be decided, some slow proofs need to be diagnosed, some documentation needs to be improved, and may adjust variable names/ theorem names/notation. - [x] depends on: #36279 - [x] depends on: #34263 [](https://gitpod.io/from-referrer/) | WIP t-differential-geometry | 296/0 | Mathlib.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Metric.lean | 3 | 21 | ['github-actions', 'grunweg', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'or4nge19', 'sgouezel'] | nobody | 20 days ago | 55 days ago | 10 seconds |
| 34106 | ADedecker | feat: map a seminorm along a surjective linear map | --- - [x] depends on: #34105 - [x] depends on: #34104 [](https://gitpod.io/from-referrer/) | merge-conflict | 501/43 | Mathlib/Algebra/Order/Group/Pointwise/Bounds.lean,Mathlib/Analysis/Normed/Group/Quotient.lean,Mathlib/Analysis/Normed/Group/QuotientSeminorm.lean,Mathlib/Analysis/Normed/Group/Seminorm.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/GaloisConnection/Basic.lean | 6 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 20 days ago | unknown | 0 seconds |
| 36496 | erdOne | feat(Tactic/Linter): lint against `simpa ... using by tactic` | --- [](https://gitpod.io/from-referrer/) | t-linter large-import awaiting-author merge-conflict | 134/12 | Mathlib.lean,Mathlib/Analysis/LConvolution.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Condensed/Light/Epi.lean,Mathlib/Init.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Probability/Distributions/Poisson/Basic.lean,Mathlib/Probability/Kernel/Composition/Comp.lean,Mathlib/Probability/Kernel/Composition/ParallelComp.lean,Mathlib/Probability/Kernel/Condexp.lean,Mathlib/Probability/Moments/SubGaussian.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/SimpaUsingBy.lean,MathlibTest/simpaUsingBy.lean | 15 | 24 | ['erdOne', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | grunweg | 20 days ago | 50 days ago | 49 minutes |
| 26377 | Whysoserioushah | feat(RingTheory/SimpleRing/TensorProduct): tensor product of a simple algebra and a central simple algebra is simple | co-authored-by: @jjaassoonn --- | t-ring-theory large-import awaiting-author | 326/8 | Mathlib.lean,Mathlib/RingTheory/SimpleRing/TensorProduct.lean,Mathlib/RingTheory/TwoSidedIdeal/Kernel.lean,Mathlib/RingTheory/TwoSidedIdeal/Lattice.lean,Mathlib/RingTheory/TwoSidedIdeal/Operations.lean | 5 | 71 | ['Ruben-VandeVelde', 'Whysoserioushah', 'chrisflav', 'eric-wieser', 'github-actions', 'kbuzzard', 'kckennylau', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vlad902'] | chrisflav and kbuzzard | 20 days ago | 45 days ago | 43 days |
| 36989 | MichaelStollBayreuth | feat(NumberTheory/Height/EllipticCurve): new file | This PR defines the "addition-and-subtraction map" on x-coordinates of pairs of points on elliptic curves and proves an inequality for the logarithmic height of the image. In a later PR, we will show that the map thus defined indeed comes from addition and subtraction on an elliptic curve. --- [](https://gitpod.io/from-referrer/) | t-number-theory awaiting-author | 214/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/AddSubMap.lean,Mathlib/NumberTheory/Height/EllipticCurve.lean | 3 | 20 | ['MichaelStollBayreuth', 'Multramate', 'github-actions', 'riccardobrasca'] | Multramate and riccardobrasca | 20 days ago | 20 days ago | 18 days |
| 37700 | IvanRenison | feat(Combinatorics/SimpleGraph/Maps): add `Iso.induceIso` | Similar to `induceHom` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 29/0 | Mathlib/Combinatorics/SimpleGraph/Maps.lean | 1 | 3 | ['github-actions', 'vlad902'] | nobody | 19 days ago | 19 days ago | 25 days |
| 37928 | AlexeyMilovanov | refactor(Computability.Encoding): unbundle Γ and remove FinEncoding | This PR unbundles the alphabet `Γ` from the `Encoding` structure and completely removes `FinEncoding`. `Encoding`: The alphabet `Γ` is now an explicit parameter: `structure Encoding (α : Type u) (Γ : Type v)`. `FinEncoding`: Removed. Finiteness is now handled via standard typeclasses (e.g., `[Fintype Γ] (e : Encoding α Γ)`). Combinators: Functions like `finEncodingPair` are simplified to `encodingPair`, dropping the `fin` prefix and `[Fintype]` requirements where no longer needed. Downstream: Mechanically updated `Mathlib.Computability` and `Mathlib.ModelTheory` to pass the explicit `Γ` and use `[Fintype Γ]` where `FinEncoding` was previously required. | new-contributor | 30/67 | Mathlib/Computability/Encoding.lean,Mathlib/ModelTheory/Encoding.lean | 2 | 5 | ['github-actions', 'vihdzp'] | nobody | 19 days ago | 20 days ago | 20 days |
| 37522 | matthewjasper | chore: adjust Module.Finite instance priority | Make instances that are rarely going to be helpful lower priority. Increase the priority of `FiniteDimensional.complexToReal`, because it's more likely correct than the other priority 100 `Module.Finite` instances. --- [](https://gitpod.io/from-referrer/) | t-algebra | 6/4 | Mathlib/LinearAlgebra/Complex/FiniteDimensional.lean,Mathlib/LinearAlgebra/Dimension/Free.lean,Mathlib/LinearAlgebra/Dual/Lemmas.lean | 3 | 3 | ['github-actions', 'grunweg', 'leanprover-radar'] | eric-wieser | 19 days ago | 29 days ago | 29 days |
| 36385 | CoolRmal | feat: a sequential and countably compact space is sequentially compact | The main result proved in this PR is that a sequential and countably compact space is sequentially compact. We also prove some lemmas: 1. If `f` is an embedding, then `A` is sequentially compact iff `f '' A` is sequentially compact. This result is then used to show the equivalence of `IsSeqCompact A` and `SeqCompactSpace A`. 2. If `f` is inducing, then `A` is countably compact iff `f '' A` is countably compact. This result is then used to show the equivalence of `IsCountablyCompact A` and `CountablyCompactSpace A`. 3. If `f` converges and `g` is another function such that `g x ∈ closure {f x}` for all `x`, then `g` also converges. --- - [x] depends on: #36174 [](https://gitpod.io/from-referrer/) | t-topology | 146/13 | Mathlib/Topology/Compactness/CountablyCompact.lean,Mathlib/Topology/Inseparable.lean,docs/references.bib | 3 | 33 | ['ADedecker', 'CoolRmal', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'scholzhannah'] | PatrickMassot | 19 days ago | 19 days ago | 31 days |
| 35910 | LLaurance | chore(Probability): remove deprecated items, shorten proofs | Remove deprecated items, shorten proofs, use dot notation where possible, style --- [](https://gitpod.io/from-referrer/) | t-measure-probability WIP | 61/86 | Mathlib/Probability/Distributions/Exponential.lean,Mathlib/Probability/Distributions/Gamma.lean,Mathlib/Probability/Distributions/Pareto.lean,Mathlib/Probability/Distributions/Uniform.lean | 4 | 4 | ['LLaurance', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 19 days ago | 51 days ago | 9 days |
| 35178 | grunweg | chore: split `T%` elaborator into its own file and move to `Topology` | TODO: this currently breaks the tangentspace case, need to rewrite it to avoid match_expr! --- - [x] depends on: #35176 - [x] depends on: #30463 [](https://gitpod.io/from-referrer/) | WIP t-meta | 193/135 | Mathlib.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorField/LieBracket.lean,Mathlib/Geometry/Manifold/VectorField/Pullback.lean,Mathlib/Topology/FiberBundle/Notation.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean | 7 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 19 days ago | 78 days ago | 1 second |
| 36388 | SnirBroshi | feat(Combinatorics/SimpleGraph/AdjMatrix): submatrices and homomorphisms | --- [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 72/3 | Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean | 1 | 16 | ['SnirBroshi', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'themathqueen'] | YaelDillies | 19 days ago | 19 days ago | 29 days |
| 35828 | AntoineChambert-Loir | feat(RingTheory/GradedAlgebra/Homogeneous/Hom): homogeneous algebra maps and evaluation | Define the notion of homogeneous algebra morphism between algebra maps. Prove that the evaluation of a (weighted) homogeneous multivariate polynomial at adequate elements of a graded algebra define a homogeneous algebra morphism. co-authored with @mariainesdff --- [](https://gitpod.io/from-referrer/) | t-ring-theory WIP | 86/0 | Mathlib.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Hom.lean | 3 | 11 | ['AntoineChambert-Loir', 'github-actions', 'joneugster', 'riccardobrasca'] | riccardobrasca | 19 days ago | 20 days ago | 43 days |
| 37954 | jdhart81 | feat(Data/ENNReal/Inv): add ENNReal.div_mul_div_cancel | Proves a / b * (b / c) = a / c for b ≠ 0, b ≠ ∞ in ENNReal. Proof via mul_div_assoc and existing div_mul_cancel. AI Disclosure: This PR was developed with assistance from an LLM (Claude, Anthropic) for proof exploration and text drafting. The proof was compiled and verified locally by the contributor, who understands the mathematical content. This lemma is extracted from a larger formalization of information-theoretic bounds (Zenodo DOI: 10.5281/zenodo.19317983). --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 5/0 | Mathlib/Data/ENNReal/Inv.lean | 1 | 2 | ['github-actions'] | nobody | 19 days ago | 19 days ago | 1 minute |
| 36744 | farmanb | feat(CategoryTheory/Abelian/TorsionTheory): Introduce torsion theory for abelian categories | --- [](https://gitpod.io/from-referrer/) | t-category-theory WIP | 329/0 | Mathlib.lean,Mathlib/CategoryTheory/Abelian/TorsionTheory/Basic.lean | 2 | 11 | ['farmanb', 'github-actions', 'joelriou', 'plp127'] | nobody | 19 days ago | unknown | 0 seconds |
| 37720 | cjrl | feat(Data/Fintype/Card): existsUnique_notMem_image_of_injective_of_card_succ | This pull requests adds a small theorem `existsUnique_notMem_image_of_injective_of_card_succ` to `Mathlib/Data/Fintype/Card` that says given an injective map f : α → β such that β has cardinality one more than α, there exists a unique element of β not in the image of f. This can be viewed as going in the opposite direction of `card_lt_of_injective_of_notMem`. This little fact is needed for our Latin Square PR #36698. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor t-set-theory | 15/0 | Mathlib/Data/Fintype/Card.lean | 1 | 6 | ['IvanRenison', 'cjrl', 'github-actions'] | nobody | 18 days ago | 18 days ago | 24 days |
| 37190 | cjrl | feat(Combinatorics): Set-Valued Pigeonhole Principle | This PR contributes two theorems to combinatorics: - `exists_lt_card_cover_of_card_biUnion_lt_card` is a set-valued version of the pigeonhole principle. - `sum_card_eq_sum_card_cover_biUnion` is a set theoretic corollary of a double counting result proved for bipartite graphs (`Finset.sum_card_bipartiteAbove_eq_sum_card_bipartiteBelow`). This was needed to prove the above pigeonhole principle. The motivation for these results is our Latin Square PR #36698. These results were proved in less general terms in that PR, but are independent of Latin Square considerations and so we have generalized and moved them into more relevant files. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics | 38/0 | Mathlib/Combinatorics/Enumerative/DoubleCounting.lean,Mathlib/Combinatorics/Pigeonhole.lean | 2 | 16 | ['IvanRenison', 'cjrl', 'ghseeli', 'github-actions', 'j-loreaux', 'vlad902'] | nobody | 18 days ago | 18 days ago | 34 days |
| 34007 | martinwintermath | feat(Algebra/Module/Submodule/Dual): dual operator for submodules | Add new file `Dual.lean` that defines the dual operator for submodules. The main definition is * `Submodule.dual`: given a bilinear pairing `p` between two modules `M₁` and `M₂` and a submodule `S` in `M₁`, `Submodule.dual p S` is the submodule in `M₂` consisting of all points `y` such that `0 = p x y` for all `x ∈ S`. For reasons of generality, `p` is actually a general sesqui-bilinear map, that is, of the form `p : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M`. This implementation of the `dual` operator for submodules is written to parallel the implementation of `PointedCone.dual`. Include some additional results: * theorems that represent the dual as the kernel of a linear map * theorems for the relation between dual and the `dualAnnihilator` and `dualCoannihilator` of a submodule. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 239/0 | Mathlib.lean,Mathlib/Algebra/Module/Submodule/Dual.lean | 2 | 7 | ['github-actions', 'joelriou', 'martinwintermath', 'mathlib-bors'] | joelriou | 18 days ago | 90 days ago | 14 days |
| 37817 | artie2000 | refactor(RingTheory/Ideal): standardise `RingHom` and `AlgHom` lifting API | * Change `AlgHom.liftOfSurjective` to use the same set-up as `RingHom.liftOfSurjective` * Add lemmas until both operations have the same API * Make `RingHom.liftOfRightInverse_comp_apply` a `simp` lemma * Rename `AlgHom.liftOfSurjective_apply` to match `RingHom.liftOfSurjective_apply_comp` --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 125/32 | Mathlib/Algebra/Category/Ring/FinitePresentation.lean,Mathlib/Algebra/Category/Ring/Topology.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/LocalRing/ResidueField/Polynomial.lean | 5 | 1 | ['github-actions'] | nobody | 18 days ago | 18 days ago | 23 minutes |
| 36155 | grunweg | feat: custom elaborators for TangentSpace and tangentMap(Within) | And use these to golf the differential geometry files a bit further. --- [](https://gitpod.io/from-referrer/) | t-differential-geometry t-meta | 85/30 | Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/MFDeriv/Tangent.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/Topology/FiberBundle/Constructions.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean | 8 | 5 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'ocfnash'] | PatrickMassot | 18 days ago | 18 days ago | 56 days |
| 34675 | YaelDillies | feat: comultiplication as a bialgebra hom | From Toric --- - [x] depends on: #32245 [](https://gitpod.io/from-referrer/) | t-ring-theory toric | 71/12 | Mathlib/RingTheory/Bialgebra/TensorProduct.lean,Mathlib/RingTheory/Coalgebra/TensorProduct.lean | 2 | 6 | ['YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'riccardobrasca'] | nobody | 18 days ago | 19 days ago | 19 days |
| 35834 | homeowmorphism | feat(Mathlib/GroupTheory/PresentedGroup): every group has a presentation | We show that every group has a presentation defined by taking the free group with all of the group elements as the generators, and defining the relations as the kernel of the induced subjective homomorphism from that free group to the group itself. Use of AI: This has been vibe-coded with GPT-Codex-5.3, was updated through review, and was double-checked by the author. --- [](https://gitpod.io/from-referrer/) | new-contributor t-group-theory large-import awaiting-author LLM-generated | 29/1 | Mathlib/GroupTheory/PresentedGroup.lean | 1 | 15 | ['copilot-pull-request-reviewer', 'euprunin', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'plp127', 'tb65536'] | tb65536 | 18 days ago | 56 days ago | 4 days |
| 35662 | FrankieeW | feat(NumberTheory/Zsqrtd): add Archimedean instance via le_arch | This PR follows a suggestion made in #35606 , #35481 - add `Zsqrtd.le_arch_smul` in `Mathlib/NumberTheory/Zsqrtd/Basic.lean` - use it to provide `instance : Archimedean (ℤ√d)` in the `Nonsquare` section - refactor the proof using symmetry to reduce duplication while keeping checks clean --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor awaiting-author merge-conflict LLM-generated | 46/4 | Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean | 2 | 13 | ['FrankieeW', 'MichaelStollBayreuth', 'euprunin', 'github-actions', 'mathlib-merge-conflicts', 'tb65536'] | MichaelStollBayreuth | 18 days ago | 52 days ago | 15 days |
| 34120 | winstonyin | feat: `GroupWithZero` versions of `le` lemmas | [Zulip thread: #mathlib4 > prod_le_pow_card](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/prod_le_pow_card/with/568611481) ## Motivation Inequality lemmas such as `Multiset.prod_le_pow_card` that are true for the reals are only stated for non-negative reals. Instead of simply providing non-negativity as a proof obligation, the downstream user is forced to lift all non-negative terms to `NNReal` and then invoke the inequality lemma. This motivates duplicating lemmas that assume `[CommMonoid R] [MulLeftMono R]` to ones that assume `[CommMonoidWithZero R] [ZeroLEOneClass R] [PosMulMono R]` along with a non-negativity hypothesis. I've only included the obvious case for now. I'll carefully comb through these lemmas to ensure pairing and consistent naming. I've included here a downstream effect of this change, greatly simplifying a part of a proof. I'll record some of these here as well, but I'll move them to a separate PR at the end . ## Changes * Add `List.prod_le_pow_length₀` and `Multiset.prod_le_pow_card₀`. * Add subscript 0 to `prod_map_le_pow_card`, meaning it assumes `CommMonoidWithZero`, consistent with similar lemmas. * Remove the `FunLike` assumption in `prod_map_le_pow_length₀` and `prod_map_le_pow_card₀` * Update and shorten proof of `max_norm_root_eq_spectralValue`. ## TODO * Ensure pairing between lemmas that assume `CommMonoid` and `CommMonoidWithZero` across `List`, `Multiset`, `Finset`. * Find other such cases, e.g. `mul_lt_one`. * Ensure consistent naming using subscript 0. --- [](https://gitpod.io/from-referrer/) | WIP large-import merge-conflict | 602/259 | Archive/Imo/Imo2025Q3.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/Group/Submonoid/Pointwise.lean,Mathlib/Algebra/Order/Archimedean/Class.lean,Mathlib/Algebra/Order/BigOperators/Group/Finset.lean,Mathlib/Algebra/Order/BigOperators/Group/List.lean,Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/List.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Multiset.lean,Mathlib/Algebra/Order/BigOperators/Ring/Multiset.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Basic.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean,Mathlib/Algebra/Order/Monovary.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Analysis/Polynomial/MahlerMeasure.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pochhammer.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Bounds.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/MeasureTheory/Constructions/Pi.lean,Mathlib/MeasureTheory/Measure/HasOuterApproxClosedProd.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/NumberTheory/Bertrand.lean,Mathlib/NumberTheory/FermatPsp.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/Height/MvPolynomial.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/OneVariable.lean,Mathlib/NumberTheory/Multiplicity.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Primorial.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/NumberTheory/SmoothNumbers.lean,Mathlib/Order/Filter/AtTopBot/Monoid.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/Algebra/Valued/WithZeroMulInt.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,scripts/nolints_prime_decls.txt | 56 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 17 days ago | 102 days ago | 20 seconds |
| 34897 | kim-em | experiment: Claude defining reductive groups | This PR adds preliminary definitions for reductive algebraic groups, following Borel's definition over general fields. ## Status: Experimental Sketch This is scaffolding with known mathematical issues. See `Mathlib/Algebra/AlgebraicGroup/PLAN.md` for a detailed roadmap of what's needed for correct definitions. ### What's Here | Definition | Status | Notes | |------------|--------|-------| | `AffineAlgGroup k A` | OK | Smooth affine group scheme of finite type | | `AlgPoints k A` | Partial | Correct type, Group instance is `sorry` | | `NoNontrivialIdempotents` | OK | For connectedness | | `IsUnipotent` | Wrong | Vacuous in reduced rings (see below) | | `unipotentRadical` | Wrong | Should be Hopf ideal, not Subgroup | | `ReductiveGroup` | Placeholder | Uses `True` pending dependencies | ### Known Mathematical Issues 1. **`IsUnipotent` is vacuous**: Definition checks nilpotence in reduced ring A, so only g=1 satisfies it. Correct definition requires comodule theory. 2. **Need functor of points, not just k-points**: Should define `A →ₐ[k] R` for all k-algebras R, not just `A →ₐ[k] k`. 3. **`unipotentRadical` should be a Hopf ideal**: Closed subgroup schemes correspond to Hopf ideals, not subgroups of points. 4. **Geometric notions missing**: Unipotent/connected/reductive should be defined after base change to k̄. ### Roadmap (see PLAN.md) 1. **Functor of points**: Group structure on R-points via convolution 2. **Hopf ideals**: For closed subgroup schemes 3. **Geometric infrastructure**: Base change, geometric connectedness 4. **Comodule theory**: For correct `IsUnipotent` 5. **Unipotent radical**: As Hopf ideal (very hard - SGA3/Borel level) Alternative: Define "linearly reductive" via complete reducibility (simpler, equivalent in char 0). ## References - Brian Conrad, "Reductive Group Schemes" - Armand Borel, "Linear Algebraic Groups" - SGA3, Exposé XIX 🤖 Prepared with Claude Code | t-algebra LLM-generated merge-conflict | 753/0 | Mathlib.lean,Mathlib/Algebra/AlgebraicGroup/Defs.lean,Mathlib/Algebra/AlgebraicGroup/PLAN.md,Mathlib/Algebra/AlgebraicGroup/Reductive.lean,Mathlib/Algebra/AlgebraicGroup/Unipotent.lean | 5 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 17 days ago | unknown | 0 seconds |
| 36142 | erdOne | feat(Topology): sheaves of modules in `Over U` | --- [](https://gitpod.io/from-referrer/) | t-topology large-import awaiting-author merge-conflict | 117/7 | Mathlib.lean,Mathlib/CategoryTheory/Sites/Spaces.lean,Mathlib/Topology/Sheaves/Module.lean,Mathlib/Topology/Sheaves/Over.lean,Mathlib/Topology/Sheaves/SheafCondition/Sites.lean | 5 | 5 | ['github-actions', 'joelriou', 'mathlib-merge-conflicts'] | nobody | 17 days ago | 58 days ago | 55 minutes |
| 37751 | JovanGerb | chore(Order/Filter/IsBounded): use `to_dual` | use `to_dual` for `Filter.IsBounded` --- - [ ] depends on: #37747 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 120/378 | Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/Order/Filter/AtTopBot/Basic.lean,Mathlib/Order/Filter/IsBounded.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 17 days ago | 24 days ago | 25 minutes |
| 38021 | IvanRenison | feat(Data/Int/ModEq): add theorem `modEq_two_abs` | --- [](https://gitpod.io/from-referrer/) | t-data | 4/0 | Mathlib/Data/Int/ModEq.lean | 1 | 1 | ['github-actions'] | nobody | 17 days ago | 17 days ago | 17 days |
| 33032 | ksenono | feat(Combinatorics/SimpleGraph): Konig’s theorem on bipartite graphs | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor blocked-by-other-PR merge-conflict | 832/251 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Konig/Auxillary.lean,Mathlib/Combinatorics/SimpleGraph/Konig/Konig.lean,Mathlib/Combinatorics/SimpleGraph/Konig/KonigFin.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/VertexCover.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean | 12 | 9 | ['SnirBroshi', 'github-actions', 'ksenono', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'vlad902'] | nobody | 17 days ago | 134 days ago | 2 minutes |
| 37406 | vihdzp | feat(SetTheory/Cardinal): `IsStrongPrelimit` predicate | We introduce a predicate for cardinals `c` such that `x < c` implies `x < 2 ^ c`. This is to `IsStrongLimit` as `IsSuccPrelimit` is to `IsSuccLimit`. We then make use of it in a few places where we were writing down `∀ x < c, x < 2 ^ c` explicitly. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 56/25 | Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Cardinal/Regular.lean | 4 | 1 | ['github-actions'] | alreadydone | 17 days ago | 29 days ago | 31 days |
| 32889 | artie2000 | feat(Algebra): forgetful lemmas for `map` and `comap` on substructures | * Standardise the form of forgetful lemmas for `map` and `comap` (ie, `(co)map_toSubfoo`) * Add missing lemmas of this form * Mark all such lemmas as `simp` --- - [x] depends on: #21031 [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 72/17 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Group/Subgroup/Map.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/Subalgebra.lean | 6 | 30 | ['YaelDillies', 'artie2000', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'vihdzp'] | nobody | 17 days ago | 134 days ago | 2 days |
| 37712 | eric-wieser | feat: add a `LawfulXor` typeclass | I've put this in mathlib since it can use `Function.Involutive`; it can of course be upstreamed at a later date. Having this generalization encourages downstream code in cslib to be expressed in terms of involutive functions, rather than just `^^^` on bitvectors. --- [](https://gitpod.io/from-referrer/) | t-data | 130/0 | Mathlib.lean,Mathlib/Data/LawfulXor.lean | 2 | 6 | ['eric-wieser', 'github-actions', 'linesthatinterlace'] | nobody | 17 days ago | 18 days ago | 6 days |
| 30750 | SnirBroshi | feat(Data/Quot): `toSet` and `equivClassOf` | Define `toSet` which gets the set corresponding to an element of a quotient, and `equivClassOf` which gets the equivalence class of an element under a quotient. --- I found these definitions helpful when working with quotients, specifically `ConnectedComponents` of a `TopologicalSpace`. [](https://gitpod.io/from-referrer/) | t-data awaiting-author awaiting-zulip | 162/0 | Mathlib/Data/Quot.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/Data/Setoid/Basic.lean | 4 | 8 | ['SnirBroshi', 'TwoFX', 'eric-wieser', 'github-actions', 'linesthatinterlace', 'mathlib-merge-conflicts'] | TwoFX | 17 days ago | 155 days ago | 35 days |
| 38039 | themathqueen | chore(Topology): `UniformSpace.Completion` renames for morphisms | - [ ] `UniformSpace.Completion.mapRingHom` -> `UniformSpace.RingHom.completion` - [ ] --- Just starting this now so that I don't forget again. Will hopefully get to it soon. See Zulip thread: [#mathlib4 > naming convention: `UniformSpace.Completion` morphisms](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/naming.20convention.3A.20.60UniformSpace.2ECompletion.60.20morphisms) [](https://gitpod.io/from-referrer/) | WIP t-topology | 24/11 | Mathlib/Topology/Algebra/UniformRing.lean | 1 | 1 | ['github-actions'] | nobody | 17 days ago | unknown | 0 seconds |
| 37053 | artie2000 | refactor(Analysis/Convex/Cone): use `PointedCone` in Riesz extension theorem | Change the statement of the Riesz extension theorem to take a `PointedCone` rather than a `ConvexCone`. This PR is part of a series replacing `ConvexCone` with `PointedCone`. https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Replacing.20.60ConvexCone.60.20with.20.60PointedCone.60/near/581184307 --- [](https://gitpod.io/from-referrer/) | t-convex-geometry maintainer-merge | 15/12 | Mathlib/Analysis/Convex/Cone/Extension.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 8 | ['YaelDillies', 'artie2000', 'github-actions', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 17 days ago | 17 days ago | 36 days |
| 38040 | homeowmorphism | feat(FinitelyPresentedGroup): Add direct product instance | Adds that the direct product of two finitely presented groups are finitely presented. --- [](https://gitpod.io/from-referrer/) | t-group-theory | 7/0 | Mathlib/GroupTheory/FinitelyPresentedGroup.lean | 1 | 5 | ['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-bors'] | nobody | 17 days ago | 17 days ago | 7 seconds |
| 30658 | grunweg | feat: extend the `whitespace` linter to proof bodies | --- - [x] depends on: #30663 - [x] depends on: #30685 - [x] depends on: #30687 - [x] depends on: #30688 - [x] depends on: #30689 - [x] depends on: #30691 - [x] depends on: #30723 - [x] depends on: #30724 - [x] depends on: #30725 - [x] depends on: leanprover/lean4#11780 - [x] depends on: leanprover/lean4#12006 - [ ] depends on: leanprover/lean4#11686 - [x] depends on: #33705 - [x] depends on: #33706 - [x] depends on: #33716 - [x] depends on: #33234 - [x] depends on: #33342 - [x] depends on: #33708 - [x] depends on: #33758 - [x] depends on: #33759 - [x] depends on: #33789 - [x] depends on: #33815 - [x] depends on: #33816 - [x] depends on: #35909 - [x] depends on: #37993 [](https://gitpod.io/from-referrer/) | large-import t-linter merge-conflict | 2004/438 | Archive/Imo/Imo2010Q5.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/HeawoodUnitDistance.lean,Mathlib/Algebra/AffineMonoid/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/Ring/Basic.lean,Mathlib/Algebra/Module/TransferInstance.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Polynomial/RuleOfSigns.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Formula.lean,Mathlib/AlgebraicTopology/ExtraDegeneracy.lean,Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/AlgebraicTopology/SimplicialSet/CompStructTruncated.lean,Mathlib/AlgebraicTopology/SimplicialSet/Nonempty.lean,Mathlib/AlgebraicTopology/SimplicialSet/Path.lean,Mathlib/AlgebraicTopology/SimplicialSet/StrictSegal.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Normed/Algebra/Spectrum.lean,Mathlib/Analysis/Normed/Module/Bases.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/CategoryTheory/Limits/Cones.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean,Mathlib/CategoryTheory/Monoidal/Action/Basic.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/CommGrp_.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/OfHasFiniteProducts.lean,Mathlib/Combinatorics/SetFamily/LYM.lean,Mathlib/Computability/AkraBazzi/AkraBazzi.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Data/DFinsupp/Notation.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/Fin/Fin2.lean,Mathlib/Data/Finset/Slice.lean,Mathlib/Data/Finset/Sort.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Matrix/Cartan.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Num/Bitwise.lean,Mathlib/Data/PNat/Xgcd.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/Data/Vector/MapLemmas.lean,Mathlib/FieldTheory/CardinalEmb.lean,Mathlib/FieldTheory/Finite/Extension.lean,Mathlib/FieldTheory/Laurent.lean,Mathlib/Geometry/Manifold/Notation.lean,Mathlib/Geometry/Manifold/VectorBundle/Tensoriality.lean,Mathlib/LinearAlgebra/TensorPower/Symmetric.lean,Mathlib/LinearAlgebra/TensorProduct/Defs.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/PullOut.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/TrapezoidalRule.lean,Mathlib/MeasureTheory/Integral/TorusIntegral.lean,Mathlib/MeasureTheory/Measure/Haar/InnerProductSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/ModelTheory/Syntax.lean,Mathlib/NumberTheory/Niven.lean,Mathlib/NumberTheory/Primorial.lean,Mathlib/RepresentationTheory/Coinduced.lean,Mathlib/RingTheory/Artinian/Module.lean,Mathlib/RingTheory/FormalGroup/Basic.lean,Mathlib/RingTheory/Nilpotent/Exp.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/Whitespace.lean,Mathlib/Tactic/Ring/NamePolyVars.lean,Mathlib/Topology/Algebra/IsUniformGroup/Defs.lean,Mathlib/Topology/Category/TopCat/Limits/Basic.lean,Mathlib/Util/Superscript.lean,MathlibTest/WhitespaceLinter.lean | 76 | 68 | ['SnirBroshi', 'adomani', 'github-actions', 'grunweg', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 16 days ago | 17 days ago | 10 hours |
| 28802 | grunweg | feat: a tactic linter for continuity/measurability which can be `fun_prop` | --- Let's see if this finds further locations in mathlib :tada: This PR also runs the linter in mathlib by default. I strongly think this is a good idea --- but leaves all kinds of fun questions around "where do you import this linter best". Opinions on this welcome; this PR is a first start (but no more). [](https://gitpod.io/from-referrer/) | large-import awaiting-CI t-meta | 72/0 | Mathlib/Tactic/Continuity.lean,Mathlib/Tactic/Measurability.lean,MathlibTest/ContinuityToFunprop.lean | 3 | 13 | ['Vierkantor', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 16 days ago | 251 days ago | 4 minutes |
| 38018 | matthewjasper | feat(Algebra): expand Subalgebra.restrictScalars API | Add an instance for the original algebra structure, the implied scalar tower instances, and the algebra equivalence with the original subalgebra. Use this to remove some `set_option backward.isDefEq.respectTransparency`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 53/14 | Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/RingTheory/AlgebraicIndependent/TranscendenceBasis.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean | 4 | 2 | ['eric-wieser', 'github-actions'] | nobody | 16 days ago | 17 days ago | 17 days |
| 33535 | erdOne | feat(Algebra/Category): `Under.pushout` preserves finite limits for flat homomorphisms | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra merge-conflict | 157/5 | Mathlib.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/AlgCat/Limits.lean,Mathlib/Algebra/Category/CommAlgCat/BaseChange.lean,Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Limits.lean,Mathlib/Algebra/Category/Ring/Flat.lean | 8 | 5 | ['chrisflav', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'robin-carlier'] | eric-wieser | 16 days ago | 106 days ago | 11 days |
| 36345 | Brian-Nugent | feat(AlgebraicGeometry): Vanishing for Affine Schemes | Proves that quasi-coherent sheaves on affine schemes have vanishing higher cohomology. --- - [ ] depends on: #37187 - [ ] depends on: #35785 - [ ] depends on: #34742 - [ ] depends on: #36218 - [ ] depends on: #35790 [](https://gitpod.io/from-referrer/) | large-import t-algebraic-geometry t-category-theory blocked-by-other-PR merge-conflict | 1386/116 | Mathlib.lean,Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Quasicoherent.lean,Mathlib/Algebra/Homology/ShortComplex/Exact.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/AlgebraicGeometry/Modules/AffineVanishing.lean,Mathlib/AlgebraicGeometry/Modules/Quasicoherent.lean,Mathlib/AlgebraicGeometry/Modules/Sheaf.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/ExactSequences.lean,Mathlib/Topology/Sheaves/AddCommGrpCat.lean,Mathlib/Topology/Sheaves/Flasque.lean,Mathlib/Topology/Sheaves/Presheaf.lean,Mathlib/Topology/Sheaves/Restrict.lean,Mathlib/Topology/Sheaves/Sheaf.lean,Mathlib/Topology/Sheaves/SheafCondition/Sites.lean,Mathlib/Topology/Sheaves/SheafCondition/UniqueGluing.lean,Mathlib/Topology/Sheaves/ZeroOutside.lean | 20 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 16 days ago | unknown | 0 seconds |
| 31187 | loefflerd | feat(NumberTheory/LSeries): Define the L-series of a modular form | Define the L-function of a modular form (showing it is meromorphic on C and agrees with the naive Dirichlet series for `re s` large). --- - [x] depends on: #30089 | WIP t-number-theory | 237/28 | Mathlib.lean,Mathlib/NumberTheory/LSeries/AbstractFuncEq.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaOdd.lean,Mathlib/NumberTheory/ModularForms/LFunction.lean | 4 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 16 days ago | 180 days ago | 1 second |
| 37534 | EtienneC30 | feat: cardinality of subsets of a given cardinality | Given a finite set `s`, the number of subsets of `s` with cardinality `n` is `s.ncard.choose n`. This is analog to [Finset.card_powersetCard](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finset/Powerset.html#Finset.card_powersetCard) and [Set.powersetCard.card](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Set/PowersetCard.html#Set.powersetCard.card) but with a set of sets rather than involving finsets. --- [](https://gitpod.io/from-referrer/) | t-data | 18/0 | Mathlib/Data/Set/Card.lean | 1 | 1 | ['github-actions'] | TwoFX | 16 days ago | 29 days ago | 29 days |
| 37718 | SabrinaJewson | feat(Order): add conversions from `Std` order typeclasses to Mathlib ones | `{Preorder, PartialOrder, LinearOrder}.ofStd` exist to facilitate convenient translation from `Std` order typeclasses to Mathlib ones. --- [](https://gitpod.io/from-referrer/) | t-order new-contributor | 366/0 | Mathlib.lean,Mathlib/Order/Std.lean,MathlibTest/OrderOfStd.lean | 3 | 2 | ['github-actions'] | bryangingechen | 16 days ago | 24 days ago | 24 days |
| 38047 | mbkybky | feat(RingTheory/Finiteness/Ideal): `I` is finitely generated if `f(I)` and `I ∩ ker(f)` are finitely generated | Let `f : R →+* S` be a surjective ring homomorphism, and let `I` be an ideal of `R`. If `f(I)` and `I ∩ ker(f)` are finitely generated ideals, then `I` is also finitely generated. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 13/3 | Mathlib/RingTheory/Finiteness/Ideal.lean | 1 | 1 | ['github-actions'] | nobody | 16 days ago | 16 days ago | 16 days |
| 38017 | kbuzzard | perf(Algebra/Ring): faster Ring.toAddGroupWithOne instance | An attempt to manually make `Ring.toAddGroupWithOne` a fast instance. --- [](https://gitpod.io/from-referrer/) [#mathlib4 > instance unfolding phenomenon @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/instance.20unfolding.20phenomenon/near/585295822) | WIP t-algebra merge-conflict | 64/18 | Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Data/Int/Cast/Defs.lean | 7 | 7 | ['eric-wieser', 'github-actions', 'kbuzzard', 'leanprover-radar'] | nobody | 16 days ago | 17 days ago | 2 seconds |
| 37050 | artie2000 | DRAFT refactor: remove `ConvexCone` | This draft PR deletes all downstream references to `ConvexCone` --- - [ ] depends on: #37053 - [x] depends on: #37054 - [x] depends on: #37058 - [ ] depends on: #37420 - [ ] depends on: #37298 - [ ] depends on: #36605 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR large-import merge-conflict | 114/173 | Mathlib/Algebra/Group/Subgroup/Order.lean,Mathlib/Algebra/Group/Submonoid/Support.lean,Mathlib/Analysis/Convex/Cone/Basic.lean,Mathlib/Analysis/Convex/Cone/Closure.lean,Mathlib/Analysis/Convex/Cone/Extension.lean,Mathlib/Geometry/Convex/Cone/Dual.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 7 | 14 | ['YaelDillies', 'artie2000', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 16 days ago | 39 days ago | 24 minutes |
| 36219 | gasparattila | chore(Order/SupClosed): use `to_dual` | --- [](https://gitpod.io/from-referrer/) | t-order | 66/215 | Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/SupClosed.lean | 2 | 6 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 16 days ago | 16 days ago | 20 days |
| 34278 | gasparattila | feat(Topology/Sets): connectedness of `NonemptyCompacts` | --- - [x] depends on: #34268 - [ ] depends on: #34273 [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR | 143/0 | Mathlib/Topology/Sets/VietorisTopology.lean | 1 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 16 days ago | 98 days ago | 19 minutes |
| 34280 | gasparattila | feat(Topology/Sets): local connectedness of `(Nonempty)Compacts` | --- - [ ] depends on: #34278 [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR | 202/0 | Mathlib/Topology/Sets/VietorisTopology.lean | 1 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 16 days ago | 98 days ago | 3 minutes |
| 36770 | Xmask19 | feat: invariance of domain via Brouwer's fixed point theorem | Continuous and injective maps from Rn to Rn are open mappings. This is shown given Brouwer's fixed point theorem. The specific version of Brouwer's theorem assumed is that a continuous map from the closed unit ball to itself has a fixed point. It is used to show a lemma in this proof. Then assuming that invariance of domain isn't true gives a contradiction with this lemma. --- My supervisor has code for studying topological manifolds which relies on invariance of domain that can be found here: https://github.com/stevensivek/TopologicalManifolds and is planned to be submitted to Mathlib. [](https://gitpod.io/from-referrer/) | t-topology new-contributor | 617/5 | Mathlib.lean,Mathlib/AlgebraicTopology/InvarianceOfDomain.lean,Mathlib/Analysis/Convex/GaugeRescale.lean,Mathlib/Topology/Closure.lean,Mathlib/Topology/Order.lean | 5 | 2 | ['github-actions'] | nobody | 16 days ago | 16 days ago | 1 hour |
| 38087 | kbuzzard | perf: add some fast_instance% | --- [](https://gitpod.io/from-referrer/) `fast_instance%` experts should take a look at this and say which if any are spurious. I confess to throwing them around rather randomly. Zulip thread [#mathlib4 > random fast_instance% makes gains @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/random.20fast_instance.25.20makes.20gains/near/585737520) | t-algebra | 10/9 | Mathlib/Algebra/EuclideanDomain/Field.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 3 | 3 | ['github-actions', 'kbuzzard', 'leanprover-radar'] | nobody | 16 days ago | 16 days ago | 16 days |
| 37865 | Jun2M | feat(Combinatorics/Graph): Edge cut of `Graph` | This PR introduces - `edgeCut`: A function on set of vertices that returns the set of edges with exactly one end in the set. - `IsEdgeCut`: A predicate for set of edges that promises it is `edgeCut` of some set. - `IsBridge`: An edge `e` is a bridge iff it is a singleton edge cut. - `IsBond`: An edge Set `B` is bond iff it is minimal nonempty edge cut. --- - [x] depends on: #35879 [](https://gitpod.io/from-referrer/) | t-combinatorics | 194/0 | Mathlib/Combinatorics/Graph/Connected/EdgeCut.Lean,Mathlib/Combinatorics/Graph/Subgraph.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 15 days ago | 16 days ago | 16 days |
| 38050 | WilliamCoram | feat: Define Newton polygons | In this file we construct a method to define newton polygons using a Stream' of `Step`'s which correspond to what you would obtain via the 'algorithm' of rotating half-planes as described in Gouvea's p-adic numbers. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor | 620/0 | Mathlib.lean,Mathlib/NumberTheory/NewtonPolygon.lean | 2 | 3 | ['github-actions', 'jcommelin'] | nobody | 15 days ago | unknown | 0 seconds |
| 34702 | pfaffelh | feat(Data/FinsetPowerset): The set `{v : List.Vector Bool n | v.val.count = k}` has cardinality `n.choose k` | Show that `{v : List.Vector Bool n | v.val.count = k}` has cardinality `n.choose k`. The proof builds on `powersetCard k s` (the subsets of `s : Finset _` with cardinality `k`), and an equivalence to the above set. --- [](https://gitpod.io/from-referrer/) | large-import t-data | 52/1 | Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Fintype/Pi.lean,Mathlib/Logic/Equiv/Fintype.lean | 3 | 25 | ['DavidLedvinka', 'b-mehta', 'eric-wieser', 'github-actions', 'joneugster', 'pfaffelh'] | Vierkantor | 15 days ago | 84 days ago | 87 days |
| 37474 | Komyyy | perf: no expose `SplittingField` and `GaloisField` | --- [](https://gitpod.io/from-referrer/) | t-algebra WIP merge-conflict | 361/95 | Mathlib/FieldTheory/Finite/GaloisField.lean,Mathlib/FieldTheory/SplittingField/Construction.lean,Mathlib/NumberTheory/Cyclotomic/Basic.lean,MathlibTest/instance_diamonds/FieldTheory/SplittingField/Construction.lean | 4 | 7 | ['Komyyy', 'github-actions', 'leanprover-radar', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 15 days ago | 30 days ago | 4 minutes |
| 38098 | astrainfinita | chore: make `SMul.comp.smul` `implicit_reducible` | --- [](https://gitpod.io/from-referrer/) | t-algebra | 2/1 | Mathlib/Algebra/Group/Action/Defs.lean | 1 | 3 | ['astrainfinita', 'github-actions', 'leanprover-radar'] | nobody | 15 days ago | 15 days ago | 15 days |
| 37247 | yuma-mizuno | feat(GroupTheory/MonoidLocalization): add prime transport lemmas | --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author | 75/7 | Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Defs.lean | 3 | 6 | ['github-actions', 'riccardobrasca'] | riccardobrasca | 15 days ago | 15 days ago | 20 days |
| 37938 | SamuelSchlesinger | feat(Probability/Posterior): Posterior PMFs and Various Lemmas | Upstreaming the probability lemmas needed in https://github.com/leanprover/cslib/pull/464. | t-measure-probability new-contributor awaiting-author | 130/0 | Mathlib.lean,Mathlib/Probability/ProbabilityMassFunction/Posterior.lean | 2 | 5 | ['EtienneC30', 'SamuelSchlesinger', 'github-actions'] | RemyDegenne | 15 days ago | 15 days ago | 21 hours |
| 38113 | robo7179 | feat(SimpleGraph/PerfectGraph): add lemma graph is perfect iff all su… | Perfect graph theorem , discussion on zulip thread: [#graph theory > Second Order Monadic Logic](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Second.20Order.20Monadic.20Logic.20for.20Graph/with/583013775) - [ ] depends on: #37680 - [ ] depends on: #37598 | t-combinatorics new-contributor blocked-by-other-PR | 54/0 | Mathlib/Combinatorics/SimpleGraph/PerfectGraph.lean | 1 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 15 days ago | 15 days ago | 1 minute |
| 37420 | artie2000 | refactor: change definitions to avoid `ConvexCone` | Change the definitions of `PointedCone.positive` and `PointedCone.closure` to avoid mentioning `ConvexCone`. This PR is part of a series deprecating `ConvexCone`: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Replacing.20.60ConvexCone.60.20with.20.60PointedCone.60/with/582738985 --- [](https://gitpod.io/from-referrer/) | t-convex-geometry maintainer-merge | 10/4 | Mathlib/Analysis/Convex/Cone/Closure.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 3 | ['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'ooovi', 'vihdzp'] | nobody | 15 days ago | 15 days ago | 30 days |
| 33330 | michael-novak-math | feat: add arc-length reparametrization of parametrized curves | add new definitions of arc-length reparametrization and its corresponding parameter transformation and a theorem establishing the desired properties. | t-analysis new-contributor awaiting-author | 308/0 | Mathlib.lean,Mathlib/Analysis/Calculus/ArcLengthReparametrization.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,docs/references.bib | 4 | 57 | ['SnirBroshi', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'michael-novak-math'] | j-loreaux | 15 days ago | 38 days ago | 6 days |
| 32692 | WilliamCoram | feat: define multivariate restricted power series | We define multivariate restricted power series over a normed ring R, and show the properties that they form a ring when R has the ultrametric property. This work generalises my previous work in #26089 which will need to be refactored. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-number-theory new-contributor | 137/0 | Mathlib.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/RingTheory/MvPowerSeries/Restricted.lean | 3 | 43 | ['WilliamCoram', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts'] | alreadydone | 15 days ago | 15 days ago | 33 days |
| 38122 | grunweg | fix: properly tag structures with the stacks tag | Currently, tagging a structure or class with the stacks or kerodon attribute [has no effect](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Tagging.20a.20class.20with.20.40stacks.20attribute.20has.20no.20effect/with/585908804) To demonstrate the issue, we manually fix all stacks tags on structures. There are 37 further instances of @[stacks] on classes, and 6 misplaced Kerodon tags; these are left to a future PR. --- Arguably, the stacks attribute should be fixed instead. [](https://gitpod.io/from-referrer/) | WIP | 31/21 | Mathlib/Algebra/Field/Subfield/Defs.lean,Mathlib/AlgebraicGeometry/RelativeGluing.lean,Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/IsLimit.lean,Mathlib/CategoryTheory/Sites/Grothendieck.lean,Mathlib/CategoryTheory/Sites/Point/Conservative.lean,Mathlib/CategoryTheory/Triangulated/Basic.lean,Mathlib/CategoryTheory/Triangulated/Triangulated.lean,Mathlib/RingTheory/Ideal/Oka.lean,Mathlib/Topology/Spectral/Hom.lean | 12 | 1 | ['github-actions'] | nobody | 15 days ago | 15 days ago | 50 seconds |
| 33217 | Blackfeather007 | feat(Algebra): define associated graded structure for abelian group | In this PR we define the associated graded structure for abelian group when given a filtration and only give some basic lemmas about it. --- migrated from https://github.com/leanprover-community/mathlib4/pull/26857 | new-contributor t-ring-theory awaiting-author | 144/0 | Mathlib.lean,Mathlib/RingTheory/FilteredAlgebra/AssociatedGraded.lean | 2 | 13 | ['Blackfeather007', 'chrisflav', 'erdOne', 'eric-wieser', 'github-actions', 'urkud'] | erdOne | 15 days ago | 124 days ago | 4 days |
| 35790 | Brian-Nugent | feat(CategoryTheory/AlgebraicGeometry): Flasque Sheaves have vanishing cohomology | Proves cohomology vanishing for flasque sheaves. AI usage: The last 4 lines of `freeAbSheafHomEquiv_naturality` were generated by Claude Code. --- - [ ] depends on: #34742 - [x] depends on: #34267 - [x] depends on: #35785 - [ ] depends on: #36218 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR | 409/4 | Mathlib.lean,Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/Algebra/Homology/ShortComplex/Exact.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/ExactSequences.lean,Mathlib/Topology/Sheaves/AddCommGrpCat.lean,Mathlib/Topology/Sheaves/Flasque.lean,Mathlib/Topology/Sheaves/Sheaf.lean | 9 | 9 | ['Brian-Nugent', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smorel394'] | dagurtomas | 15 days ago | 64 days ago | 23 seconds |
| 37199 | mckoen | feat(CategoryTheory/Monoidal/Arrow): pushout-products of monomorphisms are monic | Proves conditions under which the pushout-product of two monomorphisms is again a monomorphism. - [x] depends on: #33935 --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory merge-conflict | 580/0 | Mathlib/CategoryTheory/Adhesive/Basic.lean,Mathlib/CategoryTheory/Monoidal/Arrow.lean,Mathlib/CategoryTheory/Monoidal/Limits/Shapes/Pullback.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 15 days ago | 36 days ago | 13 seconds |
| 36676 | euprunin | chore: replace long terminal `simp only […]`:s (≥3 lemmas) with bare `simp`:s | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Polynomial.map_comp`: unchanged 🎉 * `AlgebraicGeometry.IsClosedImmersion.Spec_iff`: 152 ms before, 107 ms after 🎉 * `nnnorm_pow_le`: unchanged 🎉 * `norm_pow_le`: unchanged 🎉 * `integral_sin`: unchanged 🎉 * `SimpleGraph.Subgraph.le_induce_union`: unchanged 🎉 * `ENNReal.iSup_add_iSup`: unchanged 🎉 * `ENat.iSup_add_iSup`: unchanged 🎉 * `ENat.mul_epow`: unchanged 🎉 * `EReal.abs_eq_zero_iff`: unchanged 🎉 * `Finset.disjoint_biUnion_left`: unchanged 🎉 * `List.splitOnP.go_acc`: unchanged 🎉 * `Multiset.count_map_eq_count`: unchanged 🎉 * `Nat.toDigitsCore_length`: unchanged 🎉 * `PartENat.pos_iff_one_le`: unchanged 🎉 * `Rat.intCast_div_self`: unchanged 🎉 * `Set.biUnion_empty_finset`: unchanged 🎉 * `Quot.subsingleton_iff`: unchanged 🎉 * `Equiv.Perm.support_closure_subset_union`: unchanged 🎉 * `Module.Basis.reindexRange_repr'`: unchanged 🎉 * `MeasureTheory.mul_le_addHaar_image_of_lt_det`: unchanged 🎉 * `MeasureTheory.memLp_finset_sum`: unchanged 🎉 * `MeasureTheory.exists_lt_lowerSemicontinuous_integral_lt`: 450 ms before, 404 ms after 🎉 * `BoundedContinuousFunction.toReal_lintegral_coe_eq_integral`: unchanged 🎉 * `nullMeasurableSet_region_between_oc`: unchanged 🎉 * `nullMeasurableSet_region_between_co`: unchanged 🎉 * `nullMeasurableSet_region_between_cc`: unchanged 🎉 * `MeasureTheory.integral_le_liminf_integral_of_forall_isOpen_measure_le_liminf_measure`: unchanged 🎉 * `padicValNat.pow_add_pow`: unchanged 🎉 * `Monotone.biUnion_Ico_Ioc_map_succ`: unchanged 🎉 * `ProbabilityTheory.condIndepSets_singleton_iff`: unchanged 🎉 * `ProbabilityTheory.sum_variance_truncation_le`: unchanged 🎉 * `IsLocalRing.CotangentSpace.span_image_eq_top_iff`: unchanged 🎉 * `galRestrict'_galLift`: 163 ms before, 48 ms after 🎉 * `Valuation.ne_zero_of_isUnit`: unchanged 🎉 * `hasProd_prod`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 35/35 | Mathlib/Algebra/Polynomial/Eval/Defs.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Lattice.lean,Mathlib/Data/ENat/Pow.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finset/Union.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Rat/Lemmas.lean,Mathlib/Data/Set/Constructions.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/Perm/Finite.lean,Mathlib/LinearAlgebra/Basis/Defs.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Integral/BoundedContinuousFunction.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/Portmanteau.lean,Mathlib/NumberTheory/Multiplicity.lean,Mathlib/Order/SuccPred/IntervalSucc.lean,Mathlib/Probability/Independence/Conditional.lean,Mathlib/Probability/StrongLaw.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | 30 | 4 | ['euprunin', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 26 days ago | 45 days | |
| 36774 | euprunin | chore: replace long terminal `rw […]`:s (≥4 lemmas) with bare `simp`:s | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `Finset.lcm_union`: unchanged 🎉 * `Finset.gcd_union`: unchanged 🎉 * `Polynomial.derivative_eval₂_C`: unchanged 🎉 * `Polynomial.expand_pow`: unchanged 🎉 * `Cardinal.mk_real`: unchanged 🎉 * `Real.log_zpow`: unchanged 🎉 * `Matroid.eRank_le_encard_add_eRk_compl`: unchanged 🎉 * `DFinsupp.single_tsub`: unchanged 🎉 * `EReal.inv_neg`: unchanged 🎉 * `Finsupp.toMultiset_map`: unchanged 🎉 * `Finsupp.single_tsub`: unchanged 🎉 * `Multiset.countP_map`: unchanged 🎉 * `Nat.ascFactorial_eq_factorial_mul_choose'`: unchanged 🎉 * `Real.sign_intCast`: unchanged 🎉 * `Real.volume_eball`: unchanged 🎉 * `Real.volume_closedEBall`: unchanged 🎉 * `LFunction_ne_zero_of_not_quadratic_or_ne_one`: 295 ms before, 152 ms after 🎉 * `hasSum_one_div_nat_pow_mul_cos`: unchanged 🎉 * `inv_eq_of_aeval_divX_ne_zero`: unchanged 🎉 * `AlgebraicIndependent.aeval_comp_mvPolynomialOptionEquivPolynomialAdjoin`: unchanged 🎉 * `Ordinal.deriv_mul_eq_opow_omega0_mul`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 22/24 | Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Expand.lean,Mathlib/Analysis/Real/Cardinality.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Combinatorics/Matroid/Rank/ENat.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finsupp/Multiset.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Nat/Choose/Basic.lean,Mathlib/Data/Real/Sign.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/NumberTheory/LSeries/Nonvanishing.lean,Mathlib/NumberTheory/ZetaValues.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/AlgebraicIndependent/Basic.lean,Mathlib/SetTheory/Ordinal/FixedPoint.lean | 19 | 2 | ['artie2000', 'euprunin', 'github-actions'] | nobody | 14 days ago | 45 days ago | 45 days | |
| 37598 | IvanRenison | feat(Combinatorics/SimpleGraph/Coloring): add lemmas about coloring and maps | --- Idea from this Zulip thread: [graph theory>Second Order Monadic Logic for Graph](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Second.20Order.20Monadic.20Logic.20for.20Graph/with/583013775) [](https://gitpod.io/from-referrer/) | t-combinatorics | 37/13 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean | 2 | 18 | ['IvanRenison', 'SnirBroshi', 'b-mehta', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | b-mehta | 14 days ago | 14 days ago | 26 days |
| 37844 | edegeltje | feat(CategoryTheory): The (strict bi-)category of partial maps in a category | This PR adds a type alias for the (strict bi-)category of partial maps in some category. Given some category `C`, the category of partial maps in `C` has the objects of `C`. 1-morphisms from `X : C` to `Y : C` are partial maps, and 2-morphisms from `f : X ⇀ Y` to `g : X ⇀ Y` are given by extending the support. It adds API for creating 1-morphisms and 2-morphisms in this bicategory, as well as defines various relevant functors and presheaves --- [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author | 843/3 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/LocallyDiscrete.lean,Mathlib/CategoryTheory/PartialMap/Defs.lean,Mathlib/CategoryTheory/PartialMap/PrePartialMap.lean | 4 | 5 | ['dagurtomas', 'edegeltje', 'github-actions'] | nobody | 14 days ago | 21 days ago | 3 hours |
| 38095 | astrainfinita | perf(Algebra/*/{InjSurj, TransferInstance}): reduce instance `Expr`s | --- We can not just use `fast_instance%`, because `fast_instance%` reduces instances into constructor applications, but their arguments may still not be reduced. This PR continues the work from #13795. Original PR: https://github.com/leanprover-community/mathlib4/pull/13795 [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/instance.20unfolding.20phenomenon/) | t-algebra | 401/219 | Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/TransferInstance.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Action/TransferInstance.lean,Mathlib/Algebra/Group/InjSurj.lean,Mathlib/Algebra/Group/TransferInstance.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/End.lean,Mathlib/Algebra/GroupWithZero/Action/TransferInstance.lean,Mathlib/Algebra/GroupWithZero/InjSurj.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/TransferInstance.lean,Mathlib/Util/TermReduce.lean,scripts/noshake.json | 16 | 7 | ['astrainfinita', 'github-actions', 'leanprover-radar'] | nobody | 14 days ago | 15 days ago | 15 days |
| 38141 | Jun2M | feat(Order/Partition): Partition induced by symmetric, transitive relation | We introduce a constructor for Partition from a symmetric, transitive relation, with `copy` function baked into the definition.
Co-authored-by: Peter Nelson |
t-order | 41/7 | Mathlib/Order/Partition/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 14 days ago | 14 days ago | 14 days |
| 31361 | alreadydone | feat(Algebra/Order): convex subgroups | --- - [x] depends on: #32886 [](https://gitpod.io/from-referrer/) | t-algebra t-order awaiting-author | 445/0 | Mathlib.lean,Mathlib/Algebra/Order/Archimedean/Class.lean,Mathlib/Algebra/Order/Group/Convex.lean,Mathlib/Algebra/Order/Group/Height.lean,Mathlib/Order/Birkhoff.lean,Mathlib/Order/Quotient.lean | 6 | 46 | ['Vierkantor', 'YaelDillies', 'alreadydone', 'github-actions', 'kckennylau', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'vihdzp', 'wwylele'] | YaelDillies | 14 days ago | 15 days ago | 28 days |
| 6777 | adomani | chore(Co*variantClass): replace eta-expanded (· * ·), (· + ·), (· ≤ ·), (· < ·) | Replace `CovariantClass X X (· * ·) (· ≤ ·)` with -> `CovariantClass X X HMul.hMul LE.le` and similarly for `HAdd`, `LT`, `Contravariant`.
This PR is inspired by [Issue #6646](https://github.com/leanprover-community/mathlib4/issues/6646) and, more specifically, [this comment](https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1692792066).
Note that https://github.com/leanprover/lean4/pull/2267 would make this unnecessary
---
```bash
# First sed command:
# the first captured pattern is `Co*variantClass |
merge-conflict | 703/678 | Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/Bounds.lean,Mathlib/Algebra/CovariantAndContravariant.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/GroupPower/Order.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Archimedean.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/MinMax.lean,Mathlib/Algebra/Order/Group/OrderIso.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Interval.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/LatticeGroup.lean,Mathlib/Algebra/Order/Module.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Cancel/Defs.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/Lemmas.lean,Mathlib/Algebra/Order/Monoid/MinMax.lean,Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Algebra/Order/Monoid/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Prod.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithZero/Basic.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Lemmas.lean,Mathlib/Algebra/Order/Sub/Basic.lean,Mathlib/Algebra/Order/Sub/Canonical.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Algebra/Parity.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Normed/Order/Lattice.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/List/BigOperators/Basic.lean,Mathlib/Data/List/BigOperators/Lemmas.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Nat/Cast/Order.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Real/ENNReal.lean,Mathlib/Data/Real/NNReal.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/VectorMeasure.lean,Mathlib/Order/ConditionallyCompleteLattice/Group.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Martingale/Basic.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/PGame.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/NaturalOps.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/Positivity/Basic.lean,Mathlib/Topology/ContinuousFunction/Algebra.lean,lean-toolchain,test/Recall.lean,test/propose.lean | 81 | 37 | ['adomani', 'alreadydone', 'digama0', 'eric-wieser', 'ericrbg', 'jcommelin', 'leanprover-bot', 'sgouezel', 'vihdzp'] | nobody | 14 days ago | 914 days ago | 35 days |
| 34501 | eric-wieser | chore(Data/Fintype/Induction): add a workaround for a bug in `induction` | This works around leanprover/lean4#4246, as Zulip threads frequently run up against this. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta please-adopt | 15/1 | Mathlib/Data/Fintype/Option.lean | 1 | 3 | ['github-actions', 'joneugster'] | joneugster | 14 days ago | 91 days ago | 2 days |
| 26299 | adomani | perf: the `whitespace` linter only acts on modified files | Introduces an `IO.Ref` to allow the `commandStart` linter to only run on files that git considers modified with respect to `master`. The linter is also active on files that have had some error, as these are likely being modified! The PR should also mitigate the speed-up that the linter introduced: [#mathlib4 > A whitespace linter @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/A.20whitespace.20linter/near/525091877) Assuming that this goes well, a similar mechanism could be applied to several linters that do not need to run on all code, just on the modified code. Implementation detail: the linter is currently either on or off in "whole" files. It may be also a future development to make this more granular and only run the linter on "modifed commands in modified files", but this is not currently the plan for this modification! --- [](https://gitpod.io/from-referrer/) | t-linter awaiting-zulip awaiting-author | 55/7 | Mathlib/Tactic/Linter/Whitespace.lean | 1 | 20 | ['adomani', 'eric-wieser', 'github-actions', 'grunweg', 'joneugster', 'kim-em', 'leanprover-bot', 'leanprover-radar', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | grunweg | 14 days ago | 245 days ago | 66 days |
| 34875 | banrovegrie | feat(LinearAlgebra/Matrix): add Sherman-Morrison formula | Mathlib has the matrix determinant lemma (`det_add_replicateCol_mul_replicateRow` in SchurComplement.lean) but lacked the corresponding inverse formula. This PR fills that gap. - Add `Matrix.inv_add_vecMulVec`: Sherman-Morrison formula for `(A + uv^T)^{-1}` - Add `Matrix.inv_sub_vecMulVec`: subtraction variant - Add `Matrix.isUnit_det_add_vecMulVec`: invertibility under the formula's hypotheses ## Test plan - [x] `lake build` passes - [x] Lines within 100 char limit - [x] All declarations have docstrings **Any specific AI usage?**: Used Copilot for review purposes. | t-algebra new-contributor awaiting-author | 135/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/ShermanMorrison.lean | 2 | 13 | ['Xxxjdjdid', 'banrovegrie', 'chrisflav', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] | chrisflav | 14 days ago | 16 days ago | 69 days |
| 37907 | grunweg | feat(by_contra,contrapose): warn if the push_neg step does nothing | --- - [x] depends on: #31597 - [x] depends on: #37899 - [x] depends on: #37937 - [x] depends on: #37999 - [x] depends on: #38008 [](https://gitpod.io/from-referrer/) | awaiting-CI t-meta | 42/6 | Mathlib/NumberTheory/ArithmeticFunction/LFunction.lean,Mathlib/Tactic/ByContra.lean,Mathlib/Tactic/Contrapose.lean,MathlibTest/Contrapose.lean,MathlibTest/byContra.lean | 5 | 4 | ['github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 20 days ago | 2 seconds |
| 38056 | Deicyde | feat: topological vector bundle homomorphisms | This PR implements topological vector bundle morphisms. --- - [ ] depends on: #38023 - [ ] depends on: #37946 [](https://gitpod.io/from-referrer/) | new-contributor t-topology merge-conflict | 805/0 | Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Topology/FiberBundle/Basic.lean,Mathlib/Topology/FiberBundle/Trivialization.lean,Mathlib/Topology/VectorBundle/Basic.lean,Mathlib/Topology/VectorBundle/Morphism.lean | 5 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | unknown | 0 seconds |
| 35569 | goliath-klein | refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): deprecate `injectiveSeminorm` | This PR: * Deprecates `PiTensorProduct.injectiveSeminorm` and supporting lemmas. * Moves the theory of `liftEquiv` from InjectiveSeminorm.lean to ProjectiveSeminorm.lean. No changes are introduced beyond adding deprecation notices, adapting docstrings, and moving material between files. The PR leaves InjectiveSeminorm.lean almost empty. A new implementation of `injectiveSeminorm`, one which reflects the common mathematical definition, is to be done. This is the third in a series of three PRs with the goal to [deprecate `PiTensorProuduct.injectiveSeminorm`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798633). --- - [ ] depends on: #35567 - [ ] depends on: #35568 Deprecations: - injectiveSeminorm - dualSeminorms_bounded - injectiveSeminorm_apply - norm_eval_le_injectiveSeminorm - injectiveSeminorm_le_projectiveSeminorm - injectiveSeminorm_tprod_le Preliminary work toward a reimplementation is at #33969. I've added Davood and myself to the "Authors" field, as we have now significantly refactored this module. Co-authored-by: Davood H. T. Tehrani [](https://gitpod.io/from-referrer/) | new-contributor | 222/233 | Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean | 2 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 14 days ago | 31 days |
| 34031 | lua-vr | feat(Dynamics/BirkhoffSum): add the maximal ergodic theorem | --- This file exports three constants: ```lean public def birkhoffAverageSupSet (f : α → α) (g : α → ℝ) (a : ℝ) : Set α := {x | ∃ n : ℕ, a < birkhoffAverage ℝ f g n x} public theorem meas_birkhoffAverageSupSet_smul_const_le_integral (a : ℝ) (ha : 0 < a) : μ.real (birkhoffAverageSupSet f g a) • a ≤ ∫ x in birkhoffAverageSupSet f g a, g x ∂μ public theorem meas_birkhoffAverageSupSet_smul_const_le_norm (a : ℝ) (ha : 0 < a) : μ.real (birkhoffAverageSupSet f (fun x ↦ ‖g x‖) a) • a ≤ ∫ x, ‖g x‖ ∂μ ``` In my interpretation, the other constants are auxiliary, so I did not make them public. If it's of independent interest, `birkhoffMax` could be exported or moved to a dedicated file, but I'm not sure of that at the moment. - [x] depends on: #34030 - [x] depends on: #34029 - [x] depends on: #34025 [](https://gitpod.io/from-referrer/) | t-dynamics | 291/0 | Mathlib.lean,Mathlib/Dynamics/BirkhoffSum/Maximal.lean | 2 | 5 | ['github-actions', 'lua-vr', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 14 days ago | 42 days |
| 28700 | Timeroot | feat(ModelTheory): Set.Definable is transitive | --- This PR continues the work from #19695. Original PR: https://github.com/leanprover-community/mathlib4/pull/19695 - [x] depends on: #26332 [](https://gitpod.io/from-referrer/) | t-logic merge-conflict | 367/6 | Mathlib/ModelTheory/Definability.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 9 | ['Timeroot', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'staroperator'] | nobody | 14 days ago | 30 days ago | 3 days |
| 38139 | sidbedi | chore(Algebra/MvPolynomial/Variables): golf MvPolynomial.vars_0 to rfl | --- The classical qualifier and explicit rewrite chain are unnecessary — the result holds definitionally. [](https://gitpod.io/from-referrer/) | new-contributor t-algebra awaiting-author | 1/2 | Mathlib/Algebra/MvPolynomial/Variables.lean | 1 | 3 | ['github-actions', 'grunweg'] | nobody | 14 days ago | 14 days ago | 9 hours |
| 38140 | sidbedi | chore(Data/Analysis/Filter): golf CFilter.ofEquiv_val to rfl | --- cases F is unnecessary, the result holds definitionally. [](https://gitpod.io/from-referrer/) | t-data new-contributor awaiting-author | 1/2 | Mathlib/Data/Analysis/Filter.lean | 1 | 3 | ['github-actions', 'grunweg'] | nobody | 14 days ago | 14 days ago | 9 hours |
| 36731 | michael-novak-math | feat: Frénet moving frame and Frénet equation for plane curves | We define the curvature function, normal vector function and the Frénet moving frame for plane curve. We also prove the Frénet equations for plane curves. A separate PR (#37489) will prove the fundamental theorem of plane curves. | new-contributor t-differential-geometry t-analysis awaiting-author | 321/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean,Mathlib/Geometry/PlaneCurves.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,docs/references.bib | 5 | 114 | ['Ruben-VandeVelde', 'github-actions', 'grunweg', 'michael-novak-math', 'scholzhannah'] | nobody | 14 days ago | 27 days ago | 12 days |
| 37929 | Vierkantor | chore(Tactic): rewrite `reduce_mod_char` tactic docstring | This PR rewrites the docstrings for the `reduce_mod_char` tactic, to consistently match the official style guide, to make sure they are complete while not getting too long. --- [](https://gitpod.io/from-referrer/) | documentation t-meta awaiting-author | 22/12 | Mathlib/Tactic/ReduceModChar.lean | 1 | 4 | ['JovanGerb', 'github-actions'] | JovanGerb | 14 days ago | 14 days ago | 3 days |
| 35413 | joneugster | fix(Util/CountHeartbeats): move elaboration in #count_heartbeats inside a namespace | This PR continues the work from #21182. Original PR: https://github.com/leanprover-community/mathlib4/pull/21182 | t-meta | 73/6 | Mathlib/Util/CountHeartbeats.lean,MathlibTest/CountHeartbeats.lean | 2 | 4 | ['github-actions', 'joneugster', 'mathlib-bors'] | adamtopaz | 14 days ago | 14 days ago | 59 days |
| 37588 | Vierkantor | feat(Linter/DocString): ignore Verso linter errors about links and LaTeX | I went through [the weekly linting log](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/near/582485221) and found most of the warnings come from three sources. All of these are sensical syntax in our current Markdown dialect, and should be fixed automatically by a script, instead of manually. I expect after these changes we'll be down to hundreds of linter errors rather than two thousand.
* References [between square brackets] without a following link URL. Verso has different implementations for references depending on what kind they are, and since there are a thousand references we should be using a script to fix these.
* Autolinks: bare URLs or URLs between |
t-linter large-import maintainer-merge | 113/5 | Mathlib/Tactic/Linter/DocString.lean,MathlibTest/DocString.lean | 2 | 18 | ['Vierkantor', 'github-actions', 'thorimur'] | thorimur | 14 days ago | 14 days ago | 17 days |
| 37808 | JovanGerb | feat(Translate): locally modify name guessing dictionaries | This PR adds the feature to `to_dual` and `to_additive` that you can now locally modify the name translation dictionary. With this change, we run the risk of having the automated translations being harder to predict. For this reason, the changes to the dictionary do not persisted through imports. Instead, the change lasts until the end of the file (though it ignores sections). See https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Order.20dual.20tactic/near/580834166 --- [](https://gitpod.io/from-referrer/) | t-meta maintainer-merge | 111/39 | Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/GaloisConnection/Defs.lean,Mathlib/Order/Interval/Set/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/GuessName.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Tactic/Translate/ToDual.lean,MathlibTest/ToDual.lean | 9 | 4 | ['JovanGerb', 'bryangingechen', 'github-actions', 'joneugster'] | joneugster | 14 days ago | 19 days ago | 19 days |
| 38158 | ADedecker | Illustration of a weird behaviour | --- [](https://gitpod.io/from-referrer/) | t-topology | 23/0 | Mathlib/Topology/Algebra/Module/Spaces/CompactConvergenceCLM.lean | 1 | 1 | ['github-actions'] | nobody | 14 days ago | unknown | 0 seconds |
| 36863 | artie2000 | refactor(Algebra/Order/Ring/Ordering): unbundle `RingPreordering` | The current design for [RingPreordering](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Ring/Ordering/Defs.html#RingPreordering) ran into issues at PR #32077. This PR unbundles [RingPreordering](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Ring/Ordering/Defs.html#RingPreordering) into a class predicate on [Subsemiring](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Ring/Subsemiring/Defs.html#Subsemiring), generalising the material on supports as far as possible. Zulip thread: https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Ring.20orderings.20-.20structure.20or.20predicate.3F/with/562594050 See #37298 for the analogous change to group and ring cones. --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 455/87 | Mathlib.lean,Mathlib/Algebra/Order/Ring/Ordering/Basic.lean,Mathlib/Algebra/Order/Ring/Ordering/Defs.lean,Mathlib/Algebra/Ring/Subsemiring/Support.lean | 4 | 13 | ['artie2000', 'chrisflav', 'github-actions'] | eric-wieser | 14 days ago | 14 days ago | 39 days |
| 38070 | grunweg | feat: add informal attribute | This allows tagging a definition or concept with an informal mathematics concept: the details are subject to discussion. The implementation largely parallels the stacks tags attribute. -------- This PR, if desired, should land in stages: pre-requisites to merge before include (in order): - fix comment typos in the stacks file - rename the file to DatabaseAttributes - add a module deprecation - then this PR, which should be relatively small Open question: can the parsers be shared better? [](https://gitpod.io/from-referrer/) | t-meta WIP file-removed | 121/39 | Mathlib.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/CategoryTheory/Category/Basic.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DatabaseAttributes.lean,Mathlib/Topology/Irreducible.lean,Mathlib/Topology/JacobsonSpace.lean,Mathlib/Topology/Separation/Basic.lean,Mathlib/Topology/Separation/Regular.lean,Mathlib/Topology/Spectral/Hom.lean,MathlibTest/DatabaseAttributes.lean,scripts/noshake.json | 13 | 10 | ['JovanGerb', 'Vierkantor', 'github-actions', 'grunweg', 'mattrobball'] | nobody | 14 days ago | 14 days ago | 12 hours |
| 38130 | edegeltje | feat(CategoryTheory): Add the category of partial map diagrams | This PR was split from #37844 --- [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author | 324/0 | Mathlib.lean,Mathlib/CategoryTheory/PartialMap/PrePartialMap.lean | 2 | 13 | ['chrisflav', 'dagurtomas', 'edegeltje', 'github-actions', 'joelriou', 'robin-carlier'] | nobody | 14 days ago | 14 days ago | 19 hours |
| 37480 | erdOne | feat(AlgebraicTopology): homology of contractible spaces | --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology awaiting-author merge-conflict | 62/4 | Mathlib/AlgebraicTopology/SingularHomology/HomotopyInvarianceTopCat.lean,Mathlib/Topology/Category/TopCat/Limits/Basic.lean | 2 | 25 | ['FernandoChu', 'dagurtomas', 'erdOne', 'github-actions', 'joelriou', 'mathlib-merge-conflicts', 'vlad902'] | dagurtomas | 14 days ago | 22 days ago | 7 days |
| 36428 | linesthatinterlace | feat(Logic/Equiv/Fin): Streamline equiv definitions using mkDivMod | This PR uses Fin.mkDivMod to streamline the related equivalence and introduces Nat.mkDivMod to a similar end. --- [](https://gitpod.io/from-referrer/) | t-logic | 56/61 | Mathlib/Analysis/SpecialFunctions/Complex/Arctan.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Series.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Logic/Equiv/Fin/Basic.lean,Mathlib/Order/Partition/Equipartition.lean | 5 | 4 | ['JovanGerb', 'github-actions', 'linesthatinterlace'] | nobody | 14 days ago | 43 days ago | 3 hours |
| 37683 | SabrinaJewson | feat(Order/OrdContinuous): every map between complete lattices that preserves sSup is a left adjoint of some Galois connection | It is already proven that the left side of a Galois connection is left-continuous; this provides the converse. --- - [ ] depends on: #37682 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR merge-conflict t-order | 90/136 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/OrdContinuous.lean,Mathlib/Order/SemiconjSup.lean,Mathlib/Tactic/Translate/ToDual.lean,Mathlib/Topology/Order/Basic.lean | 6 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 25 days ago | 24 minutes |
| 37684 | SabrinaJewson | feat(Topology/Order): provide lemmas linking topological continuity to order continuity | All the hard work is already done, but this just fills in a couple convenient missing pieces. --- - [ ] depends on: #37682 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR merge-conflict t-topology | 106/136 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/OrdContinuous.lean,Mathlib/Order/SemiconjSup.lean,Mathlib/Tactic/Translate/ToDual.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/IsLUB.lean,Mathlib/Topology/Order/Monotone.lean | 8 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 25 days ago | 21 minutes |
| 36843 | xroblot | feat(NumberTheory/RamificationInertia/HilbertTheory): compositum of unramified extensions is unramified | Add two theorems about the behaviour of ramification in composite extensions: - `Ideal.ramificationIdx_sup_eq_one`: if a prime `p` is unramified in both `F₁/K` and `F₂/K`, then it is unramified in `(F₁ ⊔ F₂)/K`. - `Ideal.ramificationIdx_inertiaDeg_sup_eq_one`: if `p` totally splits in both `F₁/K` and `F₂/K`, then it totally splits in `(F₁ ⊔ F₂)/K`. These are obtained by reducing to the Galois case (proved in the same file). --- - [ ] depends on: #36772 - [ ] depends on: #35991 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR merge-conflict t-number-theory t-algebra | 1327/32 | Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/FieldTheory/IntermediateField/ExtendTop.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/RingTheory/AlgebraTower.lean,Mathlib/RingTheory/Ideal/Galois.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 17 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 43 days ago | 21 minutes |
| 37376 | NoneMore | feat(Topology/CantorBendixson): add iterated derived sets and perfect kernel | Define the transfinite iteration of the relative derived-set operator via `gfpApprox` and introduce the perfect kernel of a set. --- AI disclosure: Most declarations, comments, and documentation in this PR were generated with Codex. Some proofs were structurally simplified using the `/golf` command from Lean 4 Skills. I reviewed the resulting code and documentation and can vouch for all submitted content. - [ ] depends on: #37374 - [x] depends on: #37375 [](https://gitpod.io/from-referrer/) | new-contributor blocked-by-other-PR t-topology | 249/0 | Mathlib.lean,Mathlib/SetTheory/Ordinal/FixedPointApproximants.lean,Mathlib/Topology/CantorBendixson.lean,Mathlib/Topology/DerivedSet.lean | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 32 days ago | 13 minutes |
| 37365 | lecopivo | feat(Tactic/FunProp): theorem priority | Add support for theorem priority for `fun_prop` --- Computing derivatives revealed that `fun_prop` really needs priority support for it theorems as `HasDerivAt.fun_pow'` should definitely have lower priority over `HasDerivAt.fun_pow`. - [ ] depends on: #37270 --> [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR merge-conflict t-meta | 1740/258 | Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Pi.lean,Mathlib/Analysis/Calculus/Deriv/Pow.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Star.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousMultilinearMap.lean,Mathlib/Analysis/Calculus/FDeriv/Defs.lean,Mathlib/Analysis/Calculus/FDeriv/Pow.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/Analysis/SpecialFunctions/Arcosh.lean,Mathlib/Analysis/SpecialFunctions/Arsinh.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogDeriv.lean,Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Sqrt.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/ArctanDeriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/ComplexDeriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/DerivHyp.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/InverseDeriv.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Elab.lean,Mathlib/Tactic/FunProp/Simproc.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/Measurability.lean,MathlibTest/fun_prop2.lean,MathlibTest/fun_prop_dev.lean,MathlibTest/fun_prop_dev_out_param.lean | 46 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 14 days ago | 32 days ago | 10 minutes |
| 35017 | robo7179 | feat(Combinatorics/SimpleGraph/Acyclic): every nontrivial tree has at least two leaves | Add two theorems to prove that every non trivial tree has at least two leaves (one in Finite the other in Acyclic). --- - [ ] depends on: #37399 - [ ] depends on: #37400 [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author blocked-by-other-PR | 24/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean | 2 | 44 | ['IvanRenison', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'robo7179'] | YaelDillies | 14 days ago | 45 days ago | 34 days |
| 37904 | maddycrim | feat(LinearAlgebra/PiTensorProduct/PiEquiv): Tensor Product and Direct Product Commute for Finitely Presented Modules | From FLT Project. Main definitions: * `tensorPi_equiv_piTensor'` : `M ⊗[R] (Π i, N i) ≃ₗ[R] Π i, (M ⊗[R] N i)` for finite free modules * `tensorPi_equiv_piTensor` : the same but for finitely-presented modules. Depends on #38170 --- [](https://gitpod.io/from-referrer/) | t-algebra | 244/0 | Mathlib.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/LinearAlgebra/PiTensorProduct/PiEquiv.lean | 4 | 5 | ['github-actions', 'maddycrim', 'themathqueen'] | nobody | 14 days ago | 14 days ago | 1 hour |
| 37982 | chrisflav | feat(RingTheory/Etale): descent along faithfully flat maps | From Pi1. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 123/1 | Mathlib.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Descent.lean | 3 | 5 | ['chrisflav', 'github-actions', 'robin-carlier'] | mattrobball | 14 days ago | 14 days ago | 18 days |
| 38176 | chrisflav | feat(RingTheory): local isomorphisms | We add the class of algebras that are locally (on the geometric source) standard open immersions. This will be used to define ind-Zariski algebras, which are an important tool to study ind-étale algebras. From Proetale. --- - [ ] depends on: #38177 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 335/47 | Mathlib.lean,Mathlib/RingTheory/LocalIso.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Finiteness.lean,Mathlib/RingTheory/RingHom/Locally.lean,Mathlib/RingTheory/RingHom/OpenImmersion.lean,Mathlib/RingTheory/RingHomProperties.lean | 8 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 14 days ago | 14 days ago | 20 minutes |
| 38049 | WilliamCoram | feat: lemmas towards showing gaussNorm on MvPowerSeries is an absolute value | We prove lemmas: ``gaussNorm_mul_le`` and ``gaussNorm_le_mul`` which will allow us to show it is an absolute value on Mv restricted power series. --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor | 144/1 | Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean | 1 | 4 | ['WilliamCoram', 'github-actions'] | nobody | 13 days ago | 17 days ago | 17 days |
| 37618 | WenrongZou | feat(PowerSeries): rename a power series as multivariate power series | --- In this PR, I define the `PowerSeries.toMvPowerSeries` which use `Polynomial.toMvPolynomial` as reference. Also there is some missing APIs in `MvPowerSeries/Equiv.lean` with respect to `MvPolynomial/Equiv.lean`. I will try to add them in next several PRs. - [ ] depends on: #37576 [](https://gitpod.io/from-referrer/) | t-ring-theory large-import blocked-by-other-PR | 114/7 | Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean,Mathlib/RingTheory/MvPowerSeries/Rename.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 13 days ago | 27 days ago | 28 minutes |
| 37674 | gasparattila | feat(Topology/Sets): separation properties of `(Nonempty)Compacts` | --- [](https://gitpod.io/from-referrer/) | t-topology | 97/6 | Mathlib/Topology/Sets/VietorisTopology.lean | 1 | 13 | ['gasparattila', 'github-actions', 'mathlib-merge-conflicts', 'scholzhannah'] | PatrickMassot | 13 days ago | 16 days ago | 24 days |
| 38185 | Jun2M | feat(Order/Partition): operations over Frame | This PR introduces:
* `Partition.induce`: The induce of a partition by a frame element.
* `Partition.disjUnion`: The disjoint union of two partitions.
* `Partition.bind`: The finer partition obtained by family of partitions for each part of the original partition.
Co-authored-by: Peter Nelson |
t-order | 89/11 | Mathlib/Order/Partition/Basic.lean,Mathlib/Order/SupIndep.lean | 2 | 1 | ['github-actions'] | nobody | 13 days ago | 13 days ago | 13 days |
| 38186 | tb65536 | feat(RingTheory/QuasiFinite/Basic): Localizations of the fiber are finite over the residue field | This PR adds an instance stating that localizations of the fiber are finite over the residue field. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 4/0 | Mathlib/RingTheory/QuasiFinite/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 13 days ago | 13 days ago | 13 days |
| 32989 | kim-em | fix(Tactic/Simps): skip @[defeq] inference for non-exposed definitions | This PR makes `@[simps]` check whether the source definition's body is exposed before calling `inferDefEqAttr`. When the body is not exposed, we skip the `@[defeq]` inference to avoid validation errors. Without this fix, using `@[simps]` on a definition that is not `@[expose]`d produces an error like: ``` Theorem Foo_bar has a `rfl`-proof and was thus inferred to be `@[defeq]`, but validating that attribute failed: Not a definitional equality: the left-hand side ... is not definitionally equal to the right-hand side ... Note: This theorem is exported from the current module. This requires that all definitions that need to be unfolded to prove this theorem must be exposed. ``` The fix checks `(← getEnv).setExporting true |>.find? cfg.srcDeclName |>.any (·.hasValue)` to determine if the definition body is visible in the public scope, and only calls `inferDefEqAttr` if it is. 🤖 Prepared with Claude Code | t-meta awaiting-author LLM-generated please-adopt | 50/2 | Mathlib/CategoryTheory/Triangulated/TStructure/TruncLTGE.lean,Mathlib/Tactic/Simps/Basic.lean,MathlibTest/SimpsModule.lean | 3 | 17 | ['JovanGerb', 'Vierkantor', 'github-actions', 'joneugster', 'kim-em', 'mathlib-merge-conflicts'] | joneugster | 13 days ago | 73 days ago | 37 days |
| 35216 | kim-em | doc(Tactic/Translate/ToDual): add deployment guide for @[to_dual] | This PR expands the documentation for `@[to_dual]` with practical advice for deploying it to existing code. **Module docstring** (`Mathlib/Tactic/Translate/ToDual.lean`): adds a "Deploying `@[to_dual]` to existing code" section covering name agreement, attribute propagation, docstring syntax ordering, declaration order dependencies, and known structural mismatches (conjunct reordering, type class gaps, interval argument swapping). **Attribute docstring**: adds a note that `@[simp]` is not auto-copied (must use `(attr := simp)`), and shows the correct ordering when combining `(attr := ...)` with docstrings. **Agent skill** (`.claude/skills/to_dual/SKILL.md`): detailed step-by-step instructions for an AI agent deploying `@[to_dual]`, including how to identify candidates, common patterns, and debugging. 🤖 Prepared with Claude Code | documentation enhancement LLM-generated | 31/3 | Mathlib/Tactic/Translate/ToDual.lean | 1 | 30 | ['JovanGerb', 'MichaelStollBayreuth', 'github-actions', 'kim-em', 'mathlib-merge-conflicts', 'vihdzp'] | JovanGerb | 13 days ago | 13 days ago | 20 days |
| 34273 | gasparattila | feat(Topology/Sets): finite sets are dense in `(Nonempty)Compacts` | --- - [x] depends on: #34266 [](https://gitpod.io/from-referrer/) | t-topology | 35/0 | Mathlib/Topology/Sets/VietorisTopology.lean | 1 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'scholzhannah'] | PatrickMassot | 13 days ago | 38 days ago | 38 days |
| 36643 | Thmoas-Guan | feat(Homology): interaction of projective and injective dimension and SES | In this PR, we directly implemented the relation of `projectiveDimension` and `injectiveDimension` in SES. --- - [ ] depends on: #36817 [](https://gitpod.io/from-referrer/) | t-category-theory | 159/0 | Mathlib/CategoryTheory/Abelian/Injective/Dimension.lean,Mathlib/CategoryTheory/Abelian/Projective/Dimension.lean | 2 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | adamtopaz | 13 days ago | 25 days ago | 31 days |
| 37298 | artie2000 | refactor(Algebra/Order): unbundle group and ring cone | * Unbundle `GroupCone` and `RingCone` using `Submonoid.IsMulPointed` The material in `Mathlib.Algebra.Group.Submonoid.Support` was created to treat uniformly * positive cones in groups and rings * pointed cones in vector spaces over an ordered field * orderings in rings This PR deprecates the [GroupCone](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Cone.html#GroupCone) and [RingCone](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Ring/Cone.html#RingCone) structures, making use of the predicates `Submonoid.IsMulPointed` and `AddSubmonoid.IsPointed` defined in that file instead. See also #36863 for the analogous change to ring orderings. --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 136/31 | Mathlib/Algebra/Order/Group/Cone.lean,Mathlib/Algebra/Order/Ring/Cone.lean | 2 | 2 | ['github-actions', 'joneugster'] | kim-em | 13 days ago | 33 days ago | 33 days |
| 38177 | chrisflav | chore(RingTheory/Localization): mirror tensor product compatibilities and golf | We add a mirrored version of `IsLocalization.tensorProduct_tensorProduct` and some related isomorphisms. We use this to golf the proof of `RingHom.locally_isStableUnderBaseChange`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 116/44 | Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/Finiteness.lean,Mathlib/RingTheory/RingHom/Locally.lean,Mathlib/RingTheory/RingHomProperties.lean | 5 | 1 | ['github-actions'] | riccardobrasca | 13 days ago | 14 days ago | 14 days |
| 36930 | vihdzp | chore: golf `Cardinal.isRegular_succ` | We rewrite the proof so as to avoid working with unbundled relations, and golf it somewhat in the process. --- - [x] depends on: #36926 - [ ] depends on: #37573 [](https://gitpod.io/from-referrer/) | t-set-theory t-order blocked-by-other-PR | 73/42 | Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/Ordinal.lean,Mathlib/SetTheory/Cardinal/Regular.lean,Mathlib/SetTheory/Ordinal/FundamentalSequence.lean | 5 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 13 days ago | 41 days ago | 13 minutes |
| 37573 | vihdzp | feat: supremum of `≤ c` ordinals of cardinal `≤ c` has cardinal `≤ c` | --- [](https://gitpod.io/from-referrer/) | t-set-theory | 48/13 | Mathlib/SetTheory/Cardinal/Ordinal.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | alreadydone | 13 days ago | 13 days ago | 28 days |
| 37932 | idontgetoutmuch | feat: Exponential map of Lie group is smooth | We construct the exponential map `expLie : g → G` for a Lie group `G` and prove that it is smooth. The main reference is: * Eckhard Meinrenken, *Lie Groups and Lie Algebras*, Lecture Notes, University of Toronto. Available at https://www.math.toronto.edu/mein/teaching/LectureNotes/lie.pdf --- [](https://gitpod.io/from-referrer/) | new-contributor t-differential-geometry | 392/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Algebra/SmoothLieExp.lean | 2 | 4 | ['github-actions', 'wwylele'] | nobody | 13 days ago | 13 days ago | 16 minutes |
| 38200 | Parcly-Taxel | feat: Turán numbers and their strict monotonicity | `strictMonoOn_turanNumber` and `sum_mul_le_twice_turanNumber` were initially proved by @Aristotle-Harmonic, then hand-polished.
Co-authored-by: Aristotle (Harmonic) |
t-combinatorics | 55/20 | Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean | 1 | 1 | ['github-actions'] | nobody | 13 days ago | 13 days ago | 13 days |
| 30817 | joelriou | feat(CategoryTheory): `κ`-continuous presheaves | Given categories `C`, `D` and a regular cardinal `κ : Cardinal.{w}`, we define `isCardinalContinuous C D κ : ObjectProperty (C ⥤ D)` as the property of functors which preserves limits indexed by categories `J` such that `HasCardinalLT (Arrow J) κ`. When `C : Type w` is a small category, we show that `κ`-continuous functors `Cᵒᵖ ⥤ Type w` are exactly the objects that are local with respect to a suitable `w`-small family of morphisms. DRAFT --- - [ ] depends on: #32725 - [x] depends on: #32423 - [x] depends on: #32424 - [x] depends on: #30168 - [x] depends on: #30160 - [x] depends on: #29881 - [x] depends on: #29854 [](https://gitpod.io/from-referrer/) | WIP t-category-theory blocked-by-other-PR merge-conflict | 292/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Types/Limits.lean,Mathlib/CategoryTheory/MorphismProperty/Basic.lean,Mathlib/CategoryTheory/MorphismProperty/IsSmall.lean,Mathlib/CategoryTheory/ObjectProperty/FunctorCategory/Presheaf.lean,Mathlib/CategoryTheory/ObjectProperty/Local.lean,Mathlib/CategoryTheory/Presentable/Continuous.lean | 7 | 10 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 13 days ago | 190 days ago | 1 second |
| 38173 | JovanGerb | chore(CategoryTheory/EpiMono): use `to_dual` | Generate declarations about `Mono`, `SplitMono` and `SplitMonoCategory` from the epic versions. --- [](https://gitpod.io/from-referrer/) | 40/120 | Mathlib/CategoryTheory/EpiMono.lean,Mathlib/Tactic/Translate/ToDual.lean | 2 | 1 | ['github-actions'] | nobody | 13 days ago | 13 days ago | 13 days | |
| 38154 | ybenmeur | add subsingleton case to ExpChar | --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 113/49 | Mathlib/Algebra/CharP/Algebra.lean,Mathlib/Algebra/CharP/Basic.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/CharP/Lemmas.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/Polynomial/Expand.lean,Mathlib/FieldTheory/Perfect.lean,Mathlib/FieldTheory/PurelyInseparable/Exponent.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Expand.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/SeparableDegree.lean,Mathlib/RingTheory/Trace/Basic.lean | 15 | 2 | ['github-actions'] | nobody | 13 days ago | unknown | 0 seconds |
| 36218 | Brian-Nugent | feat(CategoryTheory): Add exact sequences for Sheaf Cohomology | In this PR, I add the long exact sequence for sheaf cohomology as well as prove that it is functorial. Since sheaf cohomology is defined in terms of `Ext`, this is done using the covariant sequence for `Ext`. --- - [ ] depends on: #34742 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-category-theory | 313/3 | Mathlib.lean,Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/ExactSequences.lean | 5 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 57 days ago | 32 seconds |
| 37649 | IvanRenison | feat(Data): add theorem `Finset.image_eq_iff_eq_preimage` | --- [](https://gitpod.io/from-referrer/) | t-data | 19/0 | Mathlib/Data/Finset/Preimage.lean,Mathlib/Data/Set/Function.lean | 2 | 4 | ['Rida-Hamadani', 'github-actions', 'themathqueen'] | nobody | 12 days ago | 26 days ago | 26 days |
| 38199 | vihdzp | chore: add items to set theory overview | --- [](https://gitpod.io/from-referrer/) | documentation t-set-theory | 11/2 | docs/overview.yaml | 1 | 3 | ['SnirBroshi', 'github-actions', 'vihdzp'] | nobody | 12 days ago | 13 days ago | 13 days |
| 38224 | plp127 | fix(QuadraticAlgebra): `Rat` algebra diamond | Fix a diamond for `Algebra Rat (QuadraticAlgebra Rat a b)` at default transparency by overriding the default implementation of the `qsmul` and `ratCast` fields with one that does not create a diamond. The diamond is still present at reducible-and-instances transparency. --- [](https://gitpod.io/from-referrer/) | t-algebra | 59/7 | Mathlib/Algebra/QuadraticAlgebra/Basic.lean,Mathlib/Algebra/QuadraticAlgebra/Defs.lean,MathlibTest/Algebra/QuadraticAlgebra/RatAlgebraDiamond.lean | 3 | 1 | ['github-actions'] | nobody | 12 days ago | 12 days ago | 12 days |
| 31892 | jsm28 | feat(Geometry/Euclidean/Sphere/PolePolar): poles and polars | Define poles and polars for spheres in Euclidean affine spaces, and set up some basic API, including in particular La Hire's theorem (`p₁` lies on the polar of `p₂` if and only if `p₂` lies on the polar of `p₁`). Poles and polars are actually meaningful for any quadric in a projective space over any field, but I think it's reasonable to set up this theory for spheres in the Euclidean context and potentially link it in future to more general projective geometry. --- - [ ] depends on: #31891 - [ ] depends on: #32296 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 159/0 | Mathlib.lean,Mathlib/Geometry/Euclidean/Sphere/PolePolar.lean | 2 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 35 days ago | 35 days |
| 32294 | jsm28 | feat(Geometry/Euclidean/Angle/Incenter): distance from second intersection with circumcircle | Add the following lemma: given a triangle ABC, suppose an angle bisector from A through the incenter or excenter I meets the circumcircle again at X (including the case of an external bisector at A tangent to the circle, in which case X = A). Then XB = XI (= XC, by applying this lemma again). This is a standard configuration: https://en.wikipedia.org/wiki/Incenter%E2%80%93excenter_lemma --- - [ ] depends on: #30981 - [ ] depends on: #30982 - [ ] depends on: #32019 - [ ] depends on: #32021 - [ ] depends on: #32023 - [ ] depends on: #32270 - [ ] depends on: #32290 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 189/0 | Mathlib/Geometry/Euclidean/Angle/Incenter.lean | 1 | 5 | ['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'peakpoint'] | nobody | 12 days ago | 35 days ago | 35 days |
| 32555 | ksenono | feat(Combinatorics/SimpleGraph/Matching): maximum and maximal matchings for Konig's theorem | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 112/0 | Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean | 2 | 39 | ['SnirBroshi', 'SproutSeeds', 'github-actions', 'jcommelin', 'ksenono'] | b-mehta | 12 days ago | 14 days ago | 113 days |
| 35683 | gasparattila | fix(Tactic/FunProp): detect `Continuous.subtype_mk` as compositional | This PR changes `fun_prop` to detect some theorems involving dependent types, such as `Continous.subtype_mk` to be in compositional form. This lets `fun_prop` solve goals such as `Continuous fun x => (⟨x, trivial⟩ : {x : ℝ // True})`. --- These theorems become compositional: `Continuous.subtype_mk`, `Topology.IsEmbedding.inclusion`, `Topology.IsOpenEmbedding.inclusion`, `Topology.IsClosedEmbedding.inclusion`, `Measurable.subtype_mk`, `Measurable.imp`, `Path.symm_continuous_family`, `Continuous.upperHalfPlaneMk` These theorems become simple: `hasFDerivAt_prodMk_left`, `hasFDerivAt_prodMk_right`, `contDiff_prodMk_left`, `contDiff_prodMk_right` [](https://gitpod.io/from-referrer/) | t-meta | 57/33 | Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Topology/Homeomorph/Lemmas.lean,MathlibTest/fun_prop_dev.lean | 5 | 6 | ['gasparattila', 'github-actions', 'grunweg', 'lecopivo', 'mathlib-merge-conflicts'] | thorimur | 12 days ago | 34 days ago | 66 days |
| 36202 | vihdzp | feat: more theorems on the Cantor normal form | We also remove some redundant assumptions. Used in the CGT repo. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 68/17 | Mathlib/SetTheory/Ordinal/CantorNormalForm.lean | 1 | 16 | ['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | alreadydone | 12 days ago | 37 days ago | 56 days |
| 36922 | SnirBroshi | feat(Data/List/Chain): generalize `WellFounded.asymmetric₃` to chains | The existing `WellFounded.asymmetric` shows `r a b → ¬r b a`, and `WellFounded.asymmetric₃` shows `r a b → r b c → ¬r c a`. This adds `WellFounded.asymmetricₙ` which shows `l.IsChain r → ¬r l.getLast l.head`. --- Also adds a couple of `IsChain` lemmas which might be useful. [](https://gitpod.io/from-referrer/) | t-data | 29/8 | Mathlib/Data/List/Chain.lean | 1 | 4 | ['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | TwoFX | 12 days ago | 37 days ago | 41 days |
| 37625 | slavanaprienko | feat(LinearAlgebra/Matrix/Charpoly): general coefficient formula as sum of principal minors | This PR adds a general formula for the coefficients of `det(1 + X • M)` as sums of principal minors, generalizing the existing `coeff_det_one_add_X_smul_one` (k=1, trace) and `det_eq_sign_charpoly_coeff` (k=n, determinant). It also derives the corresponding formula for the coefficients of the characteristic polynomial via `charpolyRev`. New results: - `det_piecewise_one_eq_submatrix_det`: relates piecewise-with-identity to principal submatrix determinants - `coeff_det_one_add_X_smul_eq_sum_minors`: the k-th coefficient of `det(1 + X • M)` equals the sum of k×k principal minors - `charpoly_coeff_eq_sum_minors`: coefficients of the characteristic polynomial as signed sums of principal minors --- | t-algebra new-contributor | 105/1 | Mathlib/LinearAlgebra/Matrix/Charpoly/Coeff.lean | 1 | 24 | ['eric-wieser', 'github-actions', 'slavanaprienko', 'wwylele'] | kim-em | 12 days ago | 26 days ago | 27 days |
| 38208 | mbkybky | chore: rename two instances | Rename [Module.Free.Module.free_shrink](https://leanprover-community.github.io/mathlib4_docs/Mathlib/LinearAlgebra/FreeModule/Basic.html#Module.Free.Module.free_shrink) to `Module.Free.shrink` and rename [Module.Finite.Module.finite_shrink](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Finiteness/Basic.html#Module.Finite.Module.finite_shrink) to `Module.Finite.shrink`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-ring-theory | 6/2 | Mathlib/LinearAlgebra/FreeModule/Basic.lean,Mathlib/RingTheory/Finiteness/Basic.lean | 2 | 3 | ['github-actions', 'mbkybky', 'plp127'] | nobody | 12 days ago | 13 days ago | 13 days |
| 38231 | NoneMore | feat(ModelTheory/Definablity): add syntax-to-definability bridge lemmas | Add bridge lemmas from syntax to definability and refactor downstream proofs to use them. --- [](https://gitpod.io/from-referrer/) | t-logic | 88/56 | Mathlib/ModelTheory/Definability.lean,Mathlib/ModelTheory/ElementarySubstructures.lean | 2 | 1 | ['github-actions'] | nobody | 12 days ago | 12 days ago | 12 days |
| 30352 | kckennylau | feat(RingTheory): Homogeneous localization of tensor product | Let `𝒜` be a graded `R`-algebra, and `S` be an `R`-algebra. Then `S ⊗[R] 𝒜` is a graded `S`-algebra with the same grading. Let `W` be a homogeneous submonoid of `𝒜`. Then `(S⊗[R]𝒜)[(1⊗W)⁻¹]₀ ≅ S ⊗[R] (𝒜[W⁻¹]₀)`. --- Split from #26061. - [x] depends on: #30173 - [x] depends on: #30322 - [x] depends on: #30365 - [x] depends on: #36252 Optionally depends on #30379 (graded ring equiv) and #36346 (simp Algebra.algHom), which will save a few lines here, so they are not high priority for this PR. [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 471/22 | Mathlib.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean,Mathlib/RingTheory/GradedAlgebra/TensorLocalization.lean,Mathlib/RingTheory/Localization/TensorProduct.lean | 5 | 5 | ['dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | dagurtomas | 12 days ago | 43 days ago | 11 days |
| 37530 | mcdoll | fix(Topology/Algebra): fix bad simps and make arguments implicit for `PointwiseConvergenceCLM` | We delete all `simps` calls in the definitions of operators on `PointwiseConvergenceCLM` and replace them with `apply_apply` lemmas that do not abuse the defeq between `SLₚₜ` and `SL`. This made the linter discover some typeclass duplications, which we remove by restructuring the file. As a consequence of the new `simp` lemmas, we can remove all `set_option backward.isDefEq.respectTransparency false in` in `Analysis.Distribution.TemperedDistribution`. Moreover, we make several arguments implicit, which can be inferred in almost all practical situations. --- [](https://gitpod.io/from-referrer/) | not-ready-to-merge merge-conflict | 88/69 | Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Topology/Algebra/Module/Spaces/PointwiseConvergenceCLM.lean | 2 | 5 | ['github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'mcdoll'] | nobody | 12 days ago | 12 days ago | 14 days |
| 37593 | IlPreteRosso | refactor(Data.Finset.*Antidiagonal): rename set-based defs to `set*Antidiagonal` | Renames set-based `Finset.mulAntidiagonal` → `setMulAntidiagonal` (and SMul/VAdd variants) to free the `mulAntidiagonal` name for the planned `HasMulAntidiagonal` typeclass. Deprecation aliases added. Supersedes #34551 | t-ring-theory new-contributor merge-conflict | 178/96 | Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Data/Finset/MulAntidiagonal.lean,Mathlib/Data/Finset/SMulAntidiagonal.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Summable.lean | 6 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 12 days ago | 15 days |
| 37528 | kim-em | feat: @[simps] warns when generating defeq abusing lemmas | t-meta | 202/16 | Mathlib/Algebra/AddConstMap/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/MulOpposite.lean,Mathlib/Algebra/DirectSum/AddChar.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/Group/Action/Basic.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Equiv/TypeTags.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/Lie/Extension.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Lie/Weights/Linear.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/Module/Presentation/Cokernel.lean,Mathlib/Algebra/Module/Presentation/DirectSum.lean,Mathlib/Algebra/Module/Presentation/Tautological.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Algebra/Module/Submodule/Range.lean,Mathlib/Algebra/Module/Submodule/RestrictScalars.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Opposite.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Ring/Subring/MulOpposite.lean,Mathlib/Algebra/TrivSqZeroExt/Basic.lean,Mathlib/Algebra/Vertex/HVertexOperator.lean,Mathlib/Analysis/Analytic/ChangeOrigin.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Quaternion.lean,Mathlib/Combinatorics/Quiver/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Data/Bundle.lean,Mathlib/Data/Matrix/DualNumber.lean,Mathlib/Data/Multiset/Fintype.lean,Mathlib/Data/Real/ENatENNReal.lean,Mathlib/Data/Sym/Basic.lean,Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/Multilinear/DFinsupp.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Logic/Equiv/Fin/Basic.lean,Mathlib/Logic/Function/FromTypes.lean,Mathlib/ModelTheory/Bundled.lean,Mathlib/ModelTheory/Encoding.lean,Mathlib/ModelTheory/LanguageMap.lean,Mathlib/Order/CompleteSublattice.lean,Mathlib/Order/Hom/Bounded.lean,Mathlib/Order/Hom/BoundedLattice.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Order/Hom/Lattice.lean,Mathlib/Order/Sublattice.lean,Mathlib/RepresentationTheory/Basic.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/Extension/Basic.lean,Mathlib/RingTheory/Extension/Cotangent/Basic.lean,Mathlib/RingTheory/Extension/Generators.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IsAdjoinRoot.lean,Mathlib/RingTheory/PowerBasis.lean,Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Topology/Algebra/Module/Spaces/CompactConvergenceCLM.lean,Mathlib/Topology/Algebra/Module/Spaces/PointwiseConvergenceCLM.lean,Mathlib/Topology/Algebra/Module/Spaces/UniformConvergenceCLM.lean,Mathlib/Topology/FiberBundle/Constructions.lean,MathlibTest/Simps.lean | 75 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 12 days ago | unknown | 0 seconds | |
| 36225 | pfaffelh | feat(Topology/Compactness/CompactSystem): set system of countable intersections of sets in a compact system is again a compact system | A compact system is a set system with the following property: If all finite intersections of a sequence in the set system is non-empty, the countable intersection is not empty. Starting with a compact system, consider the countable intersections of sets in the copact system. Such sets again form a compact system. --- - [x] depends on: #36013 - [ ] depends on: #38245 [](https://gitpod.io/from-referrer/) | brownian WIP file-removed merge-conflict blocked-by-other-PR | 708/65 | Mathlib.lean,Mathlib/Algebra/Group/Irreducible/Indecomposable.lean,Mathlib/Algebra/Order/Group/Indicator.lean,Mathlib/AlgebraicTopology/DoldKan/Compatibility.lean,Mathlib/AlgebraicTopology/DoldKan/Equivalence.lean,Mathlib/AlgebraicTopology/DoldKan/EquivalencePseudoabelian.lean,Mathlib/Analysis/Normed/Group/Indicator.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Tutte.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/FieldTheory/RatFunc/Degree.lean,Mathlib/LinearAlgebra/RootSystem/Base.lean,Mathlib/LinearAlgebra/RootSystem/Finite/G2.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Lemmas.lean,Mathlib/MeasureTheory/Integral/Bochner/Set.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/NumberTheory/FunctionField.lean,Mathlib/NumberTheory/RatFunc/Ostrowski.lean,Mathlib/Order/Interval/Set/LinearOrder.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean,Mathlib/Probability/Independence/BoundedContinuousFunction.lean,Mathlib/Probability/Independence/Process/Basic.lean,Mathlib/Probability/Independence/Process/HasIndepIncrements.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Compactness/CompactSystem.lean,Mathlib/Topology/Sets/CompactOpenCovered.lean,Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean,docs/1000.yaml | 31 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 51 days ago | 1 day |
| 35685 | riccardobrasca | feat: reduce the use of Classical.choice | ## Let's avoid the axiom of choice! This PR is an experiment in developing a version of `mathlib` that minimizes uses of the axiom of choice, especially in basic declarations. For example, [Finset.image](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finset/Image.html#Finset.image) currently depends on the axiom of choice in `mathlib` but not on this branch. You can use this PR branch just like any other `mathlib` PR branch, in particular the cache system should work normally (you may get a warning to run `lake exe cache get` manually though, just do it). However, you may notice that it uses a custom `lean4` toolchain. The reason is that Lean core itself currently contains results that rely on choice (in particular, via uses of `grind`). Indeed, this branch uses a custom Lean toolchain built from our fork, currently [this version](https://github.com/riccardobrasca/lean4/releases/latest). You can inspect the diff vs `master` [here](https://github.com/leanprover/lean4/compare/master...riccardobrasca:lean4:less_choice) (this diff also contains some GitHub workflow changes, which can be ignored). For the same reason, we also use a custom version of `batteries`, found at the branch [`less_choice`](https://github.com/riccardobrasca/batteries/tree/less_choice). You can see the diff [here](https://github.com/leanprover-community/batteries/compare/main...riccardobrasca:batteries:less_choice). ### Does it work? If you want to count how many declarations depend on choice (on this branch or on `master`), you can use the following script, written by [Robin Arnez](https://github.com/Rob23oba) and Paul Lezeau (thanks!). ```lean import Mathlib open Lean structure State where visited : NameMap Bool := {} abbrev M := ReaderT Environment <| StateM (NameMap Bool) partial def collect (c : Name) : M Bool := do let collectExpr (e : Expr) : M Bool := e.getUsedConstants.anyM collect let s ← get if let some res := s.find? c then return res let env ← read modify fun s => s.insert c false let res ← match env.checked.get.find? c with | some (ConstantInfo.axiomInfo v) => collectExpr v.type | some (ConstantInfo.defnInfo v) => collectExpr v.type <||> collectExpr v.value | some (ConstantInfo.thmInfo v) => collectExpr v.type <||> collectExpr v.value | some (ConstantInfo.opaqueInfo v) => collectExpr v.type <||> collectExpr v.value | some (ConstantInfo.quotInfo _) => pure false | some (ConstantInfo.ctorInfo v) => collectExpr v.type | some (ConstantInfo.recInfo v) => collectExpr v.type | some (ConstantInfo.inductInfo v) => collectExpr v.type <||> v.ctors.anyM collect | none => pure false modify fun s => s.insert c res return res partial def collectAll : M (Nat × Nat) := do modify fun s => s.insert ``Classical.choice true let env ← read let mut count := 0 let mut total := 0 for (constName, _) in env.constants do total := total + 1 let hasChoice ← collect constName if hasChoice then count := count + 1 return (count, total) run_cmd do let env ← getEnv let (count, total) := collectAll.run env |>.run' {} let pctTimes10 := if total = 0 then 0 else (count * 1000 + total / 2) / total let pctWhole := pctTimes10 / 10 let pctDecimal := pctTimes10 % 10 Lean.logInfo m!"Found {count} constants depending on Classical.choice out of {total} total ({pctWhole}.{pctDecimal}%)" ``` Currently, we have 383493 declaration that depend on choice, over 722290 in total (53.1%). For comparison, `master` has 391709 use of choice (54.2%). More than eight thousands declarations have become choice free! ### Can I contribute? Yes! If you want to help just open a PR in the usual way (to the forks!). Note that I plan to update core not very often, probably only once a month, when `mathlib` does so. ### How to Remove the Dependency on Choice from a declaration? First of all, note that #print axioms does not work with the new module system. If you want to check whether `X` depends on choice, you should create a new file starting with `import Mathlib` and use `#print axioms foo`. If `X` depends on choice and you want to remove that dependency, there are several steps to consider (for simplicity, we focus on the case where `X` is a theorem): * The first question is mathematical: do you have a choice-free proof? Remember that this means a proof that does not use the law of excluded middle. An important remark is that if the answer is not “yes, this result is trivial”, then it is going to be *very hard* to do this in `mathlib`. At the moment, it is better to stick to mathematically trivial or very easy declarations. * `mathlib` is *very* intricate. It is very likely that the proof of `X` consists of just a couple of lines invoking `Y` and `Z`, which are often mathematically almost identical to `X`. In that case, removing choice from `X` amounts to removing choice from `Y` and `Z`. And the same situation may very well arise again for `Y` and `Z`. * In practice, you will quickly find yourself asking: “Where is choice *really* introduced?” To answer this question, you can use the following script: ```lean import Mathlib open Lean Meta Elab Command namespace ChoiceDeps abbrev DepSet := Std.HashSet Name abbrev ChoiceMemo := NameMap Bool def addExprDeps (deps : DepSet) (e : Expr) : DepSet := Id.run <| do let mut out := deps for c in e.getUsedConstants do out := out.insert c return out def directDeps (env : Environment) (decl : Name) : DepSet := let deps := match env.checked.get.find? decl with | some (.axiomInfo v) => addExprDeps {} v.type | some (.defnInfo v) => addExprDeps (addExprDeps {} v.type) v.value | some (.thmInfo v) => addExprDeps (addExprDeps {} v.type) v.value | some (.opaqueInfo v) => addExprDeps (addExprDeps {} v.type) v.value | some (.quotInfo _) => {} | some (.ctorInfo v) => addExprDeps {} v.type | some (.recInfo v) => addExprDeps {} v.type | some (.inductInfo v) => v.ctors.foldl (init := addExprDeps {} v.type) fun acc c => acc.insert c | none => {} deps.erase decl partial def transitiveDeps (env : Environment) (root : Name) : DepSet := let rec visit (decl : Name) (visited : DepSet) : DepSet := if visited.contains decl then visited else (directDeps env decl).toArray.foldl (init := visited.insert decl) fun acc dep => visit dep acc (visit root {}).erase root partial def dependsOnChoiceM (env : Environment) (decl : Name) : StateM ChoiceMemo Bool := do let memo ← get if let some b := memo.find? decl then return b modify fun s => s.insert decl false let deps := directDeps env decl if deps.contains ``Classical.choice then modify fun s => s.insert decl true return true let rec go (i : Nat) (arr : Array Name) : StateM ChoiceMemo Bool := do if h : i < arr.size then let d := arr[i] if ← dependsOnChoiceM env d then return true go (i + 1) arr else return false let res ← go 0 deps.toArray modify fun s => s.insert decl res return res def choiceDependencyGraph (env : Environment) (root : Name) : Array Name × NameMap (Array Name) := let work : StateM ChoiceMemo (Array Name × NameMap (Array Name)) := do let mut bfsOrder : Array Name := #[] let mut graph : NameMap (Array Name) := {} let mut queue : Array Name := #[root] let mut qHead := 0 let mut visited : DepSet := {} while qHead < queue.size do let current := queue[qHead]! qHead := qHead + 1 if visited.contains current then continue if !(← dependsOnChoiceM env current) then continue visited := visited.insert current bfsOrder := bfsOrder.push current let allDeps := directDeps env current let mut choiceDeps : Array Name := #[] if allDeps.contains ``Classical.choice then choiceDeps := choiceDeps.push ``Classical.choice for d in allDeps.toArray.qsort Name.quickLt do if d == ``Classical.choice then continue if ← dependsOnChoiceM env d then choiceDeps := choiceDeps.push d if !visited.contains d then queue := queue.push d graph := graph.insert current choiceDeps return (bfsOrder, graph) work.run' {} def formatGraph (bfsOrder : Array Name) (graph : NameMap (Array Name)) : MessageData := let lines := bfsOrder.toList.filterMap fun n => match graph.find? n with | none => none | some deps => let depsMsg := MessageData.joinSep (deps.toList.map fun d => m!"{.ofConstName d}") ", " some m!"{.ofConstName n} → {depsMsg}" MessageData.joinSep lines "\n" private def dotNode (n : Name) : String := "\"" ++ n.toString ++ "\"" /-- Produce a Graphviz DOT string for the choice-dependency graph. Paste it at https://dreampuf.github.io/GraphvizOnline -/ def formatDot (root : Name) (bfsOrder : Array Name) (graph : NameMap (Array Name)) : String := let edges : Array String := bfsOrder.foldl (init := #[]) fun acc n => match graph.find? n with | none => acc | some deps => deps.foldl (init := acc) fun acc2 d => acc2.push s!" {dotNode n} -> {dotNode d};" let allNodes : Array String := bfsOrder.foldl (init := #[dotNode ``Classical.choice ++ " [shape=diamond, style=filled, fillcolor=tomato]"]) fun acc n => if n == ``Classical.choice then acc else if n == root then acc.push s!"{dotNode n} [style=filled, fillcolor=lightblue]" else acc.push s!"{dotNode n} [style=filled, fillcolor=lightyellow]" let body := ((allNodes.map fun s => " " ++ s) ++ edges).toList "digraph choice_deps {\n rankdir=TB;\n node [fontname=\"Helvetica\", fontsize=10];\n" ++ "\n".intercalate body ++ "\n}" syntax (name := printChoiceDeps) "#print " &"choice_deps_on_choice" ppSpace ident : command syntax (name := printChoiceDepsDot) "#print " &"choice_deps_on_choice_dot" ppSpace ident : command elab_rules : command | `(#print choice_deps_on_choice $id:ident) => do let targets ← liftCoreM <| realizeGlobalConstWithInfos id let env ← getEnv for target in targets do let (bfsOrder, graph) := choiceDependencyGraph env target if graph.isEmpty then logInfo m!"{.ofConstName target}: no dependency on Classical.choice" else logInfo m!"{.ofConstName target}:\n{formatGraph bfsOrder graph}" elab_rules : command | `(#print choice_deps_on_choice_dot $id:ident) => do let targets ← liftCoreM <| realizeGlobalConstWithInfos id let env ← getEnv for target in targets do let (bfsOrder, graph) := choiceDependencyGraph env target if graph.isEmpty then logInfo m!"{.ofConstName target}: no dependency on Classical.choice" else let dot := formatDot target bfsOrder graph IO.FS.writeFile "graph.dot" dot logInfo m!"DOT graph written to graph.dot\n\n{dot}" end ChoiceDeps /- Example: #print choice_deps_on_choice Finset.univ_eq_empty #print choice_deps_on_choice_dot Finset.univ_eq_empty -- paste output into GraphvizOnline -/ ``` * `#print choice_deps_on_choice_dot X` produces a file (text) `graph.dot`: you can copy/paste the content in [https://dreampuf.github.io/GraphvizOnline/](https://dreampuf.github.io/GraphvizOnline/) the see the dependency graph of declaration used in the proof of `X` that depend on choice. Note that those are ordered from `X` to choice (so the first node is always `X` and the last is always choice). An arrow (to the bottom) from `Y` to `Z` means that `Z` is used in the proof of `Y` and the goal is to change some proof (i.e. modifying the arrows) to disconnect `X` from choice. In the low part of the graph you will usually identify an area of declarations really equivalent to choice (usually everything starting with `Classical.` and everything containing `grind` in the name, plus various other stuff) you should of course treat those as they are choice, it's useless to try to touch this area. It's sometimes not easy to guess where to "attack" the graph, but it's fun, enjoy! --- The github workflow files have been copied from Matthew Ballard's [repository](https://github.com/mattrobball/lean4/tree/eqvModLevels/.github/workflows). We thank Matthew for his work. | 318/88 | Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/Order/Group/Multiset.lean,Mathlib/Data/Fin/SuccPred.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/BooleanAlgebra.lean,Mathlib/Data/Finset/Insert.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Finset/SDiff.lean,Mathlib/Data/List/Dedup.lean,Mathlib/Data/List/Lattice.lean,Mathlib/Data/List/Nodup.lean,Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/Multiset/Bind.lean,Mathlib/Data/Multiset/Count.lean,Mathlib/Data/Multiset/UnionInter.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/Interval/Finset/Defs.lean,Mathlib/Order/Interval/Finset/Nat.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 24 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mattrobball', 'riccardobrasca'] | nobody | 12 days ago | unknown | 0 seconds | |
| 35632 | SnirBroshi | feat(Data/List/TakeDrop): `take`/`drop` + `tail`/`dropLast` almost commute | --- - [ ] depends on https://github.com/leanprover/lean4/issues/12910 [Zulip](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/List.2Etail.2FList.2EdropLast.20.2B.20List.2Etake/with/572294698) [](https://gitpod.io/from-referrer/) | t-data blocked-by-core-PR | 22/0 | Mathlib/Data/List/TakeDrop.lean | 1 | 8 | ['SnirBroshi', 'github-actions', 'joneugster', 'mathlib-merge-conflicts'] | nobody | 12 days ago | 44 days ago | 24 days |
| 35669 | SnirBroshi | feat(Mathlib/Data/Finset/Mex): `sInf sᶜ ≤ s.encard` | --- It's in a separate file because I couldn't find a sensible place with the required imports, not because "mex" is particularly interesting. - [x] depends on: #35821 - [ ] depends on: #35822 [](https://gitpod.io/from-referrer/) | t-order blocked-by-other-PR | 98/1 | Mathlib.lean,Mathlib/Data/Finset/Mex.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean | 4 | 13 | ['SnirBroshi', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 12 days ago | 64 days ago | 3 days |
| 38245 | RemyDegenne | feat: CountableSupClosed | Define the property for a set of being closed by countable supremum (resp. infimum). The new file is adapted from the `SupClosed` file, which describes sets closed by binary supremum. Also use `to_dual` on `SupClosed`. `CountableInfClosed` will be used in measure theory, for developments related to compact systems used for Kolmogorov's extension theorem and Choquet's capacitability theorem. --- [](https://gitpod.io/from-referrer/) | t-order brownian | 308/66 | Mathlib.lean,Mathlib/Order/CountableSupClosed.lean,Mathlib/Order/SupClosed.lean | 3 | 14 | ['RemyDegenne', 'b-mehta', 'github-actions', 'vihdzp'] | nobody | 12 days ago | 12 days ago | 12 days |
| 37889 | LLaurance | chore(Algebra): shorten proof by using tactic mode instead of calc mode | --- [](https://gitpod.io/from-referrer/) | t-algebra delegated | 4/13 | Mathlib/Algebra/Star/Center.lean | 1 | 16 | ['JovanGerb', 'LLaurance', 'faenuccio', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-bors', 'themathqueen'] | nobody | 12 days ago | 20 days ago | 1 day |
| 34952 | joneugster | feat(scripts/autolabel): use `Cli` and integrate `curl` call into `autolabel` | - use `Cli` for `lake exe autolabel`
- add arguments `--pr xxx --gh` and `--pr xxx --curl |
CI | 86/73 | .github/workflows/add_label_from_diff.yaml,scripts/autolabel.lean | 2 | 4 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 11 days ago | 33 days ago | 65 days |
| 32282 | jsm28 | feat(Geometry/Euclidean/Angle/Incenter): unoriented angle bisection | Add lemmas giving unoriented angles involving the incenter and excenters of a triangle as expressions involving dividing angles of the triangle by 2, deduced from oriented bisection lemmas. --- - [ ] depends on: #30981 - [ ] depends on: #30982 - [ ] depends on: #31205 - [ ] depends on: #32019 - [ ] depends on: #32021 - [ ] depends on: #32259 - [ ] depends on: #32260 - [ ] depends on: #32270 - [ ] depends on: #32273 - [ ] depends on: #32278 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry | 98/0 | Mathlib/Geometry/Euclidean/Angle/Incenter.lean | 1 | 8 | ['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'wwylele'] | nobody | 11 days ago | 35 days ago | 35 days |
| 34759 | Hagb | feat(RingTheory/MvPolynomial/MonomialOrder): add degree with `⊥` as degree of `0` | `withBotDegree` is to distinguish the degree of zero polynomial from the degree of non-zero constant polynomial. `MonomialOrder.degree` of both are 0, while `withBotDegree` is `⊥` for zero polynomial and 0 for non-zero constant polynomial. `MonomialOrder.withBotDegree` is to [`MonomialOrder.degree`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MonomialOrder.degree#doc) as [`Polynomial.degree`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=Polynomial.degree#doc) is to [`Polynomial.natDegree`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=Polynomial.natDegree#doc). It's upstreamized from https://github.com/WuProver/groebner_proj. --- It's upstream from [`Groebner/MonomialOrder.lean` in the repo `WuProver/groebner_proj`](https://github.com/WuProver/groebner_proj/blob/main/Groebner/MonomialOrder.lean). - [x] ~~depends on: #34755~~ - [x] depends on: #34756 - [x] depends on: #34758 [](https://gitpod.io/from-referrer/) | t-ring-theory | 245/2 | Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean | 2 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | mariainesdff | 11 days ago | 28 days ago | 28 days |
| 37523 | matthewjasper | feat: elements of Dedekind domain approximate elements of valuation ring | Algebra part of showing that `R` is dense in `O_v` which is used to show that `R / v` is isomorphic to the residue field of `O_v` and construct the base change isomorphism for finite adeles. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 87/11 | Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | mariainesdff | 11 days ago | 13 days ago | 28 days |
| 37527 | bryanboehnke | feat(LocalRing/Etale): Finite étale extensions of local rings are monogenic | Formalization of Lemma 3.2 from https://arxiv.org/abs/2503.07846: Given a finite extension of local rings R -> S, if the extension is étale, then there exists β ∈ S such that R[β] = S. Furthermore, if f(z) ∈ R[z] is the minimal polynomial of β, then f′(β) is a unit in S. This file also includes some relevant intermediate results used in the formalization of the proof of Lemma 3.1 from the same paper.
Co-authored-by: George Peykanu |
t-ring-theory new-contributor | 148/0 | Mathlib.lean,Mathlib/RingTheory/LocalRing/Etale.lean | 2 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 11 days ago | 11 days ago | 11 days |
| 38270 | Deicyde | feat(Geometry/Manifold): The Tangent Functor on `MfldCat` | A simple motivating example for PR #38223. We define the `tangentFunctor : MfldCat 𝕜 (n + 1) ⥤ MfldCat 𝕜 n` which takes any manifold to its tangent bundle and any smooth map to its pushforward. This is a standard construction in differential geometry. See: J. Lee, Smooth Manifolds, pg. 75 --- - [ ] depends on: #38223 [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR new-contributor | 320/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/Category/MfldCat/TangentFunctor.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 11 days ago | unknown | 0 seconds |
| 37071 | ericluap | feat: Dedekind completion of rationals is isomorphic to EReal | t-order new-contributor | 143/4 | Mathlib.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/DedekindCut.lean,Mathlib/Order/Completion.lean,Mathlib/Order/Concept.lean | 5 | 49 | ['ericluap', 'github-actions', 'vihdzp', 'wwylele'] | vihdzp | 11 days ago | 11 days ago | 17 days | |
| 25841 | mitchell-horner | feat(Combinatorics/SimpleGraph): prove the Kővári–Sós–Turán theorem | Prove the Kővári–Sós–Turán theorem (an upper bound on the Zarankiewicz function) --- - [x] depends on: #19865 - [x] depends on: #20738 - [x] depends on: #27602 - [ ] depends on: #34633 [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #20240.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/20240* | t-combinatorics blocked-by-other-PR | 414/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/KovariSosTuran.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Zarankiewicz.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,docs/1000.yaml | 5 | 12 | ['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mitchell-horner'] | kmill | 11 days ago | 90 days ago | 37 days |
| 38282 | JovanGerb | chore(Algebra/Lie/Submodule): remove duplicate instance | This PR removes the explicit `CoeSort` instance on `LieSubmodule`, because it is identical to the one inherited from its `SetLike` instance. This instance was added in #16509, and I'm not quite sure why it was needed then and not anymore. --- [](https://gitpod.io/from-referrer/) | t-algebra | 0/3 | Mathlib/Algebra/Lie/Submodule.lean | 1 | 1 | ['github-actions'] | nobody | 11 days ago | 11 days ago | 11 days |
| 38053 | ntapiam | feat(Analysis/Controls): add Control functions | Add Control functions ---- This PR adds Control functions in the sense of rough paths theory (see e.g. [Friz-Victoir, Section 1.2.1](https://page.math.tu-berlin.de/~friz/master4_May6th.pdf)). They are related to p-variation norms which are the goal of #38055. I've shown most results in the above reference though those relating to 1-variation are still a work in progress. I had to add a few statements about convex functions in order to work over NNReal instead or Real, but I am not sure this is the best way to do it. The reason is that I've defined controls as taking values in NNReal (as they should). In particular there is ```lean4 theorem nnreal_of_real {f : ℝ≥0 → ℝ≥0} (hf : ConvexOn ℝ (Set.Ici 0) fun x : ℝ => (f x.toNNReal : ℝ)) : ConvexOn ℝ≥0 ⊤ f ``` which I didn't know where to put. It probably holds in more generality but I didn't check. I have also included two versions of Controls, one global and one restricted to a set. I tried to follow Mathlib conventions as best as I could but perhaps that could be improved as well. [](https://gitpod.io/from-referrer/) | WIP t-analysis new-contributor | 571/1 | Mathlib.lean,Mathlib/Analysis/Controls/BoundedVariation.lean,Mathlib/Analysis/Controls/ControlOn.lean,Mathlib/Analysis/Controls/Defs.lean,Mathlib/Analysis/Convex/Function.lean,docs/references.bib | 6 | 4 | ['github-actions', 'ntapiam'] | nobody | 11 days ago | 16 days ago | 52 seconds |
| 38234 | vihdzp | chore: make `IsSuccLimit` a structure | This lets us name the fields. Note that the `mk_iff` lemma overwrites a recently deprecated theorem. --- [](https://gitpod.io/from-referrer/) | t-order | 35/28 | Mathlib/Order/SuccPred/InitialSeg.lean,Mathlib/Order/SuccPred/Limit.lean | 2 | 5 | ['github-actions', 'plp127'] | nobody | 11 days ago | 11 days ago | 11 days |
| 35773 | joelriou | feat(Algebra/Category/ModuleCat): another approach to the module structure on stalks | In this draft PR, we define the colimit of a presheaf of modules indexed by an initially small cofiltered category. We apply this to the definition of fiber functors on (pre)sheaves of modules. After showing that these fiber functors are monoidal, we may deduce that the category of sheaves of modules is monoidal when the site has enough points. In particular, if `X` is a scheme, the category `X.Modules` of $$\mathcal O_X$$-Modules is monoidal. After some sorries are removed, we may obtain that the fullsubcategory of `X.Modules` consisting of quasi-coherent sheaves is also monoidal. --- - [x] depends on: #37662 - [x] depends on: #37370 - [x] depends on: #37369 - [x] depends on: #36688 - [x] depends on: #36810 - [x] depends on: #36692 - [x] depends on: #36680 - [x] depends on: #36599 - [x] depends on: #36457 - [x] depends on: #36470 - [x] depends on: #35572 - [x] depends on: #35806 [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory large-import merge-conflict | 1127/3 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Adjunction.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/ColimitFunctorMonoidal.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Point.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/PushforwardLaxMonoidal.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/RestrictScalarsLaxMonoidal.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Colimits.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/FreeMonoidal.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Monoidal.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Point.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/PushforwardContinuous.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Quasicoherent.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/QuasicoherentMonoidal.lean,Mathlib/AlgebraicGeometry/Modules/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/Preadditive.lean,Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean,Mathlib/CategoryTheory/Sites/CoversTop.lean,Mathlib/CategoryTheory/Sites/IsSheafFor.lean | 20 | 9 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 11 days ago | 65 days ago | 1 second |
| 38136 | homeowmorphism | feat(FinitelyPresentedGroup): add definitional equivalence with generating set given by `S : Set G`. | A group `G` is finitely presented if and only if it admits a finite generating set given by `S : Set G` such that the canonical inclusion map is surjective and the kernel is finitely generated as a normal subgroup. --- [](https://gitpod.io/from-referrer/) | t-group-theory merge-conflict | 8/0 | Mathlib/GroupTheory/FinitelyPresentedGroup.lean | 1 | 6 | ['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 11 days ago | 14 days ago | 17 seconds |
| 34963 | Parcly-Taxel | feat(Archive): proof of the Robbins conjecture | Cf. [#mathlib4 > Alternative axiomatization of boolean algebras @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Alternative.20axiomatization.20of.20boolean.20algebras/near/558900960) and #31924. | t-algebra awaiting-zulip | 610/0 | Archive.lean,Archive/Robbins.lean | 2 | 2 | ['chrisflav', 'github-actions'] | chrisflav | 11 days ago | 11 days ago | 71 days |
| 38309 | ntapiam | feat(Algebra/NonAssoc): dendriform algebras | Define dendriform semirings and algebras --- This PR introduces dendriform structures such as dendriform semirings and algebras, and proves basic facts linking them to their pre-Lie counterparts. [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 270/0 | Mathlib.lean,Mathlib/Algebra/NonAssoc/Dendriform/Defs.lean,docs/references.bib | 3 | 3 | ['github-actions'] | nobody | 11 days ago | 11 days ago | 11 days |
| 38310 | ZRTMRH | feat(Combinatorics/Quiver/Schreier): word evaluation and reachability | Adds word evaluation and reachability results to the Schreier graph API. * `SchreierGraph.evalWord` : evaluates a word `List (S × Bool)` as an element of the ambient group, where `(s, true)` contributes `ι s` and `(s, false)` contributes `(ι s)⁻¹`. * `SchreierGraph.evalWord_eq_lift` : agreement with `FreeGroup.lift`. * `SchreierGraph.evalWord_mem_closure` : every word evaluates into the subgroup generated by `ι`. * `SchreierGraph.pathFromWord` : a Bool-tagged word yields a path in `Symmetrify (SchreierGraph V ι)` from `x` to `evalWord ι w • x`. * `SchreierGraph.reachable_iff` : two vertices are connected by a path in the symmetrification iff some element of the subgroup closure carries one to the other. Follow-up to #36320. This PR was written with AI assistance (Claude). The code has been reviewed by the author. --- [](https://gitpod.io/from-referrer/) | new-contributor t-combinatorics large-import | 157/0 | Mathlib/Combinatorics/Quiver/Schreier.lean | 1 | 2 | ['github-actions'] | nobody | 10 days ago | 10 days ago | 10 days |
| 33108 | alreadydone | feat(Topology): `π₁(E⧸G)⧸π₁(E) ≃* G` for `E` path connected | TODO: + finish last step (currently only `π₁(E⧸G) →* G` has been constructed) + characterization of the homomorphism + change of basepoint `e : E` leads to conjugation by `G` + if `G` is abelian then independent of choice of basepoint (and we can remove the ᵐᵒᵖ) + $\pi_1(S^1)\cong\mathbb{Z}$ + define winding number --- - [x] depends on: #7596 [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP t-topology merge-conflict | 232/36 | Mathlib/Algebra/Regular/SMul.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/Topology/Covering/Quotient.lean,Mathlib/Topology/Homotopy/Lifting.lean,Mathlib/Topology/Homotopy/Path.lean | 6 | 4 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 10 days ago | 132 days ago | 1 second |
| 38317 | WenrongZou | feat(Date/Choose): add some lemmas about choose of prime pow | In this PR, I add some lemma about choose of prime pow. 1) For primes `p` and positive integer `n`, assume that for all `i ∈ Icc 1 (n - 1)`, `choose n i` congruent to `0` module `p`, then `n = p ^ multiplicity p n`. 2) For a prime power `n`, the greatest common divisor of `choose n 1, ⋯, choose n (n - 1)` is actually the minimal prime factor of `n`. 3) For a natural number `n` greater than `1`, assume that `n` is not a prime power, then the greatest common divisor of `choose n 1, ⋯, choose n (n - 1)` is `1`. --- [](https://gitpod.io/from-referrer/) | t-data | 88/1 | Mathlib/Data/Nat/Choose/Lucas.lean | 1 | 1 | ['github-actions'] | nobody | 10 days ago | 10 days ago | 10 days |
| 34138 | pfaffelh | feat(MeasureTheory): Introduce `DiscreteMeasure α` giving rise to a `Measure α` as a sum of `dirac`s | Define `DiscreteMeasure α` as a structure with `weight : α → ℝ≥0∞` Define `toMeasure (w : DiscreteMeasure α) : Measure α` as a sum of diracs Show properties of the resulting objects This PR intends to start a more userfriendly interaction with discrete probability (measure) theory, in contrast to probability mass functions (`PMF`). There are two main differences between `DiscreteMeasure` and `PMF`: * Every `PMF` hast the additional property `HasSum 1`, making the resulting measure a probability measure. (For `DiscreteMeasure`, I intend to use the typeclass `IsProbabilityMeasure`in a later PR instead.) * The `toMeasure` function of `MassFunction` defines the measure as a sum of diracs, which immediately makes computations possible. Discussion thread on [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/PMF.20Refactor.3A.20FunLike.20vs.20Definition.20Change) - depends on: #37060 --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor | 215/0 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Indicator.lean,Mathlib/Data/Set/Pairwise/Basic.lean,Mathlib/MeasureTheory/Measure/DiscreteMeasure.lean | 4 | 26 | ['DavidLedvinka', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'metakunt', 'ocfnash', 'pfaffelh'] | ocfnash | 10 days ago | 10 days ago | 82 days |
| 37724 | xgenereux | feat(UniqueFactorizationDomain/Multiplicity): WfDvdMonoid.max_power_factor for finset | A version of `WfDvdMonoid.max_power_factor` for finsets/finsupp. That is, we take the highest power which divides everything in the finset. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 66/10 | Mathlib/RingTheory/UniqueFactorizationDomain/Multiplicity.lean | 1 | 1 | ['github-actions'] | chrisflav | 10 days ago | 24 days ago | 24 days |
| 38323 | NoahW314 | feat(RingTheory/MvPolynomial/MonomialOrder): remove unnecessary hypothesis | Some results had a nonzero hypothesis which can be eliminated since the result holds trivially when the polynomial is zero. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 13/5 | Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean | 1 | 1 | ['github-actions'] | nobody | 10 days ago | 10 days ago | 10 days |
| 37183 | dagurtomas | feat(Tactic/CategoryTheory): map attribute | Adding `@[map]` to a lemma named `H` of shape `∀ .., f = g`, where `f` and `g` are morphisms in some category `C`, creates a new lemma named `H_map` of the form `∀ .. {D} (func : C ⥤ D), F.map f = F.map g` and then applies `simp only [Functor.map_comp, Functor.map_id]`. --- [](https://gitpod.io/from-referrer/) | LLM-generated t-meta t-category-theory | 290/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapSimp.lean | 5 | 11 | ['adamtopaz', 'dagurtomas', 'github-actions', 'joelriou'] | adamtopaz | 10 days ago | 10 days ago | 36 days |
| 38192 | Jun2M | feat(Order/ConditionallyCompleteLattice): ConditionallyCompleteSemiLatticeInf | This PR introduces `ConditionallyCompleteSemilatticeSup/Inf`, Sup/Inf only versions of `ConditionallyCompleteLattice`. This is a preliminary PR for #37620, showing that `Graph` forms a `ConditionallyCompleteSemilatticeInf`. --- [](https://gitpod.io/from-referrer/) | t-order help-wanted | 109/33 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Copy.lean | 3 | 12 | ['Jun2M', 'github-actions', 'mathlib-bors', 'staroperator', 'vihdzp'] | nobody | 10 days ago | 13 days ago | 5 seconds |
| 37432 | mariainesdff | feat(Algebra/BigOperators/NatAntidiagonal): add ofAdd_antidiagonal | Co-authored by: @xgenereux. --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 27/0 | Mathlib/Algebra/BigOperators/NatAntidiagonal.lean | 1 | 2 | ['dagurtomas', 'github-actions'] | dagurtomas | 10 days ago | 21 days ago | 9 days |
| 35896 | harahu | chore(misc): fix typos | The typos were identified by `PyCharm`'s proofreading inspection. --- [](https://gitpod.io/from-referrer/) | 35/35 | Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/Group/Cyclic.lean,Mathlib/Algebra/Order/Hom/TypeTags.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Control/Traversable/Equiv.lean,Mathlib/Data/Analysis/Filter.lean,Mathlib/Data/Fintype/Order.lean,Mathlib/Data/List/Pairwise.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/Data/TypeVec.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/Topology/Compactness/Lindelof.lean,Mathlib/Topology/MetricSpace/PiNat.lean,Mathlib/Topology/Sheaves/CommRingCat.lean,docs/references.bib | 24 | 9 | ['euprunin', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 10 days ago | 50 days ago | 7 days | |
| 35820 | smmercuri | feat: unit lemmas and embedding for `FiniteAdeleRing` | --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 42/4 | Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean | 1 | 11 | ['Multramate', 'Ruben-VandeVelde', 'github-actions', 'smmercuri'] | mattrobball | 10 days ago | 10 days ago | 56 days |
| 33864 | Timeroot | feat(Computability/Primrec): Proving several Nat arithmetic functions are primrec | Prove that gcd, lcm, coprimality, divisiblity, primality, factorial, descending factorial, powers, and various logarithms are all primitive recursive. Co-authored-by: Aristotle Harmonic <[aristotle-harmonic@harmonic.fun](mailto:aristotle-harmonic@harmonic.fun)> | large-import t-computability merge-conflict | 195/4 | Mathlib.lean,Mathlib/Computability/Primrec.lean,Mathlib/Computability/Primrec/List.lean,Mathlib/Computability/Primrec/Nat.lean,Mathlib/Data/Nat/Log.lean | 5 | 7 | ['eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 10 days ago | 31 days ago | 47 days |
| 37010 | pion2024 | `Sl2`update: add theorem `finrank_weightSpace_eq_one_of_isIrreducible` | # Background: I am a 2nd year undergrad student in mathematics currently self-teaching Lie algebra and representation theory. Before starting the formalization, I searched for related keywords on Zulip and in the GitHub issues and commits. As far as I could tell, there were no existing results or ongoing attempts before I started. All feedback is welcome. Even a quick check on the statement design/an idea on the generalization (cf Limitations below) would be incredibly helpful. # Overview In this PR, I added the new section `IsAlgClosedIrreducible` which formalizes the well-known theorem `finrank_weightSpace_eq_one_of_isIrreducible` for the Lie algebra $\mathfrak{sl}_2$ step by step. It proves that for a finite-dimensional irreducible representation of $\mathfrak{sl}_2$ over an algebraically closed field $K$ of characteristic zero, every non-trivial weight space has a dimension of exactly 1. # Formalization Structure : Instead of relying on explicit finite sums (`Finset.sum`) and manipulating coefficients, I heavily leverage Mathlib's abstractions in Submodule Lattice Theory and Coordinate-free Linear Algebra. The formalization proceeds in the following logic: 1. Existence of a Primitive Vector (`exists_primitiveVector`): I construct a primitive (highest-weight) vector by showing that repeated applications of the raising operator $e$ must eventually yield zero due to the finite-dimensionality of $M$ and the linear independence of eigenvectors corresponding to distinct eigenvalues. 2. The span of $f$-Tower as a Lie Submodule equals to the whole space (`fTowerLieSubmodule_eq_top`): I define the $f$-tower submodule as the $K$-span of $\{f^k m \mid k \in \mathbb{N}\}$. By proving its closure under the action of $f, h$, and $e$, I establish it as a Lie submodule. Since $M$ is irreducible, this submodule must be the entire space ($\top$). 3. Submodule Lattice Operations (`exists_mem_fTower_of_weightSpace_ne_bot`): To prove that every weight in $M$ is of the form $\mu_0 - 2k$, I use lattice operations (iSup, inf, and Disjoint) to avoid element-wise tracking. Since the $f$-tower spans $M$, the supremum of its weight spaces is $\top$. By leveraging `Module.End.eigenspaces_iSupIndep`, I show that any arbitrary non-trivial weight space would have a trivial intersection with $\top$ if its weight didn't belong to the sequence, yielding a contradiction. 4. Dimension Calculation via Basis Equivalence (`finrank_weightSpace_eq_one_of_isIrreducible`): Finally, I construct a basis from the non-zero elements of the $f$-tower. To show the weight space is 1-dimensional, I use `Basis.equivFun` to compare coefficients algebraically. This avoids heavy manual indexing and index-shifting, proving that any vector in the weight space $\mu_0 - 2k$ is merely a scalar multiple of $f^k m$. # Use of AI: I used Gemini 3.1 Pro for tactics, theorems, improvement suggestions, and error explanations. I fully understand and can vouch for all the modifications I have made to the file. # Limitations: I only managed to formalize the finite-dimensional version, although the theorem also holds in the infinite-dimensional case. In the infinite case the existence of a primitive vector is not guaranteed. A quick search suggests that we might need heavy tools like Casimir operators and the universal enveloping algebra, which are totally beyond my current level. I am looking into it, but since there is a significant mathematical gap, I thought it would be best to get this finite-dimensional version merged first. | new-contributor t-algebra large-import awaiting-author merge-conflict | 336/0 | Mathlib/Algebra/Lie/Sl2.lean | 1 | 10 | ['github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'ocfnash', 'pion2024'] | ocfnash | 10 days ago | 30 days ago | 2 days |
| 37444 | vihdzp | feat: typeclass for zero-dimensional spaces | --- - [ ] depends on: #37317 [](https://gitpod.io/from-referrer/) | t-topology large-import merge-conflict | 151/110 | Mathlib/Topology/Algebra/ClopenNhdofOne.lean,Mathlib/Topology/Category/LightProfinite/Basic.lean,Mathlib/Topology/Category/Profinite/Basic.lean,Mathlib/Topology/Category/Profinite/CofilteredLimit.lean,Mathlib/Topology/Category/Stonean/Basic.lean,Mathlib/Topology/ClopenBox.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/WithTop.lean,Mathlib/Topology/Separation/CompletelyRegular.lean,Mathlib/Topology/Separation/DisjointCover.lean,Mathlib/Topology/Separation/Lemmas.lean,Mathlib/Topology/Separation/Profinite.lean,Mathlib/Topology/UniformSpace/Ultra/Basic.lean | 13 | 17 | ['ADedecker', 'FernandoChu', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 10 days ago | 10 days ago | 1 hour |
| 38036 | JovanGerb | feat: `NSMul`/`NPow` type class | This PR is adds `NSMul`, `NPow`, `ZSMul` and `ZPow` classes for the `nsmul`, `npow`, `zsmul`, `zpow` data fields. This has a few advantages: - If you first declare a `SMul` instance, then you don't need to manually write `nsmul := (· • ·)` and `zsmul := (· • ·)` . For `Pow`, the extra benefit is that inferring the instance is preferred over the default field `npowRecAuto`. So this helps avoid accidental diamonds. - If you first declare a `SMul` instance on a type synonym, then `inferInstanceAs` will infer the `nsmul` field from the `SMul` instance. This makes it easier to avoid diamonds on type synonyms like `Matrix` and `MonoidAlgebra`. - The not-yet-merged instance diamond linter will be able to detect cases where the `NSMul` and `SMul` classes do not agree. In the process of making this PR, I have identified two existing `NPow` diamonds: - In `Mathlib.Algebra.Order.Positive.Field`, there were two conflicting `NPow` instances. - For `Fin`, there are two conflicting `NPow` instances. I have overwritten the one in core lean with the one from mathlib that is more computationally efficient. TODO: the same for `QSMul` and `NNQSMul`. --- [](https://gitpod.io/from-referrer/) | 276/273 | Mathlib/Algebra/Colimit/DirectLimit.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/Group/Action/Opposite.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Opposite.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Positive/Field.lean,Mathlib/Algebra/Order/Ring/Archimedean.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Ring/MinimalAxioms.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/CategoryTheory/Triangulated/Basic.lean,Mathlib/Data/BitVec.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/ZMod/Defs.lean,Mathlib/Data/ZMod/IntUnitsPower.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/LinearAlgebra/Matrix/Defs.lean,Mathlib/LinearAlgebra/Matrix/ZPow.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Defs.lean,Mathlib/NumberTheory/ArithmeticFunction/Defs.lean,Mathlib/RingTheory/PolynomialLaw/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Tactic/Abel.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,MathlibTest/instance_diamonds.lean | 41 | 16 | ['JovanGerb', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-radar', 'vihdzp'] | nobody | 10 days ago | 10 days ago | 10 days | |
| 37479 | ADedecker | feat(Distribution): make parameters implicit in favor of type ascription | Expanding on a suggestion by @faenuccio in an earlier PR, I make the regularity parameters of [TestFunction.fderivCLM](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Distribution/TestFunction.html#TestFunction.fderivCLM) (and similar constructions) implicit. This is a bit controversial, because it is essentially forcing type ascription in a lot of contexts. The rationale is that "the differentiation operator from `𝓓^{n}` to `𝓓^{k}`" matches mathematical practice, and is easier to parse than "the differentiation operator with parameters `n` and `k`". To make this even more convenient, I introduce notations like `𝓓^{n}` to be used when the spaces can be inferred but the regularity cannot. --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 107/46 | Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/TestFunction.lean | 2 | 4 | ['faenuccio', 'github-actions', 'j-loreaux', 'mathlib-merge-conflicts'] | sgouezel | 10 days ago | 23 days ago | 6 days |
| 32983 | JovanGerb | feat: use `LE.le` for subset relation in `Set`, `Finset`, `PSet`, `ZFSet` | This PR allows the use of `⊆` notation while the underlying constant is `≤`. Similarly for `⊂`/`<`, `⊇`/`≥` and `⊃`/`>`. Some notes: - The idea is to later extend this feature to other set notation constants, such as union/intersection. - There are some types for which we cannot use `LE.le` as the underlying constant, because the API has already been developed in core using `HasSubset.Subset`. For example List. So, the elaborator for the `⊆` notation needs to make a decision for which underlying constant to elaborate to, depending on the type. Sometimes the type is not known yet, which makes things awkward. Most of these cases are solved by delaying the elaboration until later when the type is known. However, in some cases this doesn't work either, such as `simp_rw [and_comm (_ ⊆ _)]`, where it is impossible to tell the type when elaborating the term. So, some such cases need to be fixed by making it `simp_rw [and_comm (_ ≤ _)]`. - Dot notation on the `HasSubset.Subset` namespace now doesn't work anymore, and the names need to be put in the `LE.le` namespace instead. - Various `simp` and `gcongr` tags needed to be removed/updated as a result of this change. See also https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F/near/579333629 --- - [x] depends on: #36633 - [x] depends on: #36734 - [x] depends on: #36782 - [x] depends on: #37012 - [ ] depends on: #37347 [](https://gitpod.io/from-referrer/) | t-data t-meta blocked-by-other-PR merge-conflict | 542/428 | Mathlib.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Group/Pointwise/Finset/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Algebra/GroupWithZero/Action/Pointwise/Finset.lean,Mathlib/Algebra/GroupWithZero/Action/Pointwise/Set.lean,Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Algebra/MvPolynomial/Monad.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Pow.lean,Mathlib/Analysis/LocallyConvex/WeakSpace.lean,Mathlib/Analysis/Normed/Group/FunctionSeries.lean,Mathlib/Analysis/SpecialFunctions/Log/Summable.lean,Mathlib/CategoryTheory/CofilteredSystem.lean,Mathlib/CategoryTheory/Topos/Sheaf.lean,Mathlib/Combinatorics/Enumerative/Partition/GenFun.lean,Mathlib/Combinatorics/Hall/Basic.lean,Mathlib/Combinatorics/Matroid/Basic.lean,Mathlib/Combinatorics/Matroid/Constructions.lean,Mathlib/Combinatorics/Matroid/Dual.lean,Mathlib/Combinatorics/Matroid/Rank/Cardinal.lean,Mathlib/Combinatorics/SetFamily/AhlswedeZhang.lean,Mathlib/Combinatorics/SetFamily/KruskalKatona.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean,Mathlib/Data/Finset/BooleanAlgebra.lean,Mathlib/Data/Finset/Defs.lean,Mathlib/Data/Finset/Filter.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Lattice/Basic.lean,Mathlib/Data/Finset/Option.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Finset/SDiff.lean,Mathlib/Data/Finset/Sups.lean,Mathlib/Data/Fintype/Card.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Rat/Star.lean,Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Card.lean,Mathlib/Data/Set/Defs.lean,Mathlib/Data/Set/Disjoint.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/Set/FiniteExhaustion.lean,Mathlib/Data/Set/Notation.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Set/Sups.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/Dynamics/Ergodic/Ergodic.lean,Mathlib/Dynamics/FixedPoints/Prufer.lean,Mathlib/GroupTheory/CosetCover.lean,Mathlib/GroupTheory/GroupAction/Blocks.lean,Mathlib/Lean/Expr/ExtraRecognizers.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean,Mathlib/Logic/Equiv/PartialEquiv.lean,Mathlib/MeasureTheory/Covering/LiminfLimsup.lean,Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean,Mathlib/MeasureTheory/Measure/AEDisjoint.lean,Mathlib/MeasureTheory/Measure/Decomposition/RadonNikodym.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/Prokhorov.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/MeasureTheory/Measure/Typeclasses/SFinite.lean,Mathlib/MeasureTheory/SetSemiring.lean,Mathlib/NumberTheory/WellApproximable.lean,Mathlib/Order/Birkhoff.lean,Mathlib/Order/BooleanAlgebra/Set.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Filter/AtTopBot/Finset.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/CountableInter.lean,Mathlib/Order/Filter/Ker.lean,Mathlib/Order/Heyting/Basic.lean,Mathlib/Order/Interval/Finset/Defs.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Order/PrimeSeparator.lean,Mathlib/Order/RelClasses.lean,Mathlib/Probability/Process/HittingTime.lean,Mathlib/RingTheory/AlgebraicIndependent/TranscendenceBasis.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Eval.lean,Mathlib/RingTheory/Spectrum/Prime/Module.lean,Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Class.lean,Mathlib/SetTheory/ZFC/Ordinal.lean,Mathlib/SetTheory/ZFC/PSet.lean,Mathlib/Tactic.lean,Mathlib/Tactic/SetNotation.lean,Mathlib/Topology/Algebra/InfiniteSum/Constructions.lean,Mathlib/Topology/Algebra/InfiniteSum/SummationFilter.lean,Mathlib/Topology/Algebra/Nonarchimedean/TotallyDisconnected.lean,Mathlib/Topology/Category/TopCat/Limits/Konig.lean,Mathlib/Topology/Compactness/SigmaCompact.lean,Mathlib/Topology/ExtremallyDisconnected.lean,Mathlib/Topology/Instances/CantorSet.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,Mathlib/Topology/MetricSpace/Ultra/Basic.lean,Mathlib/Topology/Order/HullKernel.lean | 106 | 30 | ['JovanGerb', 'b-mehta', 'eric-wieser', 'github-actions', 'j-loreaux', 'joneugster', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'plp127', 'thorimur'] | nobody | 10 days ago | 27 days ago | 6 days |
| 37002 | fbarroero | WIP | WIP --- [](https://gitpod.io/from-referrer/) | t-ring-theory WIP | 109/0 | Mathlib/RingTheory/Localization/Integral.lean | 1 | 2 | ['github-actions'] | nobody | 10 days ago | 39 days ago | 14 minutes |
| 38339 | xroblot | feat(NumberTheory/DirichletCharacter): add conductor_changeLevel and subgroups of characters mapping to one | This PR main additions are: - `conductor_changeLevel`: the conductor is invariant under `changeLevel` (lifting to a multiple level does not change the conductor). - `primitiveCharacter_changeLevel_apply`: the primitive character of `changeLevel hm χ` equals that of `χ`. - `subgroupOfMapToOne`: the subgroup of characters of level `n` sending a fixed integer `a` (coprime to `n`) to `1`. - `subgroupOfPrimitiveMapToOne`: the subgroup of characters of level `n` whose primitive character sends a prime `p` to `1`. --- - [ ] depends on: #38340 [](https://gitpod.io/from-referrer/) | t-number-theory blocked-by-other-PR | 118/7 | Mathlib/Data/ZMod/Coprime.lean,Mathlib/Data/ZMod/Units.lean,Mathlib/NumberTheory/DirichletCharacter/Basic.lean,Mathlib/NumberTheory/MulChar/Basic.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 9 days ago | 9 days ago | 1 hour |
| 31386 | harahu | doc: demote repeated H1 headers to H2 | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 227/11 | Archive/Imo/Imo2002Q3.lean,Archive/Imo/Imo2010Q5.lean,Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/RingTheory/LocalProperties/Injective.lean,Mathlib/RingTheory/LocalProperties/ProjectiveDimension.lean,Mathlib/RingTheory/QuasiFinite/Weakly.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/Linter/EmptyLine.lean,MathlibTest/DirectoryDependencyLinter/Test.lean,MathlibTest/Header.lean,scripts/demote_docstring_headers.py,scripts/find_docstring_headers.py | 13 | 7 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 9 days ago | unknown | 0 seconds |
| 38189 | artie2000 | feat: simplify proof of `IsAdjoinRootMonic.mkOfAdjoinEqTop'` | * Simplify the proof of `IsAdjoinRootMonic.mkOfAdjoinEqTop'` by factoring out a lemma `OrzechProperty.bijective_of_surjective_of_finrank_le` and making use of the existing lemma `finrank_le_iff_exists_linearMap`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 22/21 | Mathlib/LinearAlgebra/Dimension/Free.lean,Mathlib/RingTheory/IsAdjoinRoot.lean | 2 | 6 | ['Vierkantor', 'artie2000', 'github-actions'] | nobody | 9 days ago | 13 days ago | 13 days |
| 33664 | ooovi | feat(Geometry/Convex/Cone/Pointed): face lattice of pointed cones | - Define `PointedCone.IsFaceOf`, for a pointed cone being a face of another pointed cone. - Prove some basic properties, that faces are extreme sets of their cone, and how they behave under intersection, map and product operations. - Define `Face` by bundling the `IsFaceOf` structure, and show the complete lattice structure on it. - Prove that taking the product of two faces is an order isomorphism. Co-authored-by: Martin Winter --- - [x] depends on: #33780 for the definition of the lineal space [](https://gitpod.io/from-referrer/) | t-convex-geometry awaiting-author | 488/0 | Mathlib.lean,Mathlib/Geometry/Convex/Cone/Face/Basic.lean,Mathlib/Geometry/Convex/Cone/Face/Lattice.lean | 3 | 198 | ['YaelDillies', 'eric-wieser', 'github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'ooovi', 'vihdzp'] | nobody | 9 days ago | 16 days ago | 5 days |
| 38337 | Jun2M | feat(Combinatorics/Graph): supremum | This PR introduces the union of `Graph`, as `sup`.
Due to compatibility issue, in general, `sup` is not very well-behaved: `SemilatticeSup` is not true. In the case of incompatible edge, unlike `inf` which simply removed such edge, we include it following its incidence in the left graph. This has the benefit of associativity being true in general at the cost of commutativity.
Assuming compatibility or existence of mutual supergraph, which are shown to be equivalent in this PR, everything behaves nicely.
Co-authored-by: Peter Nelson |
t-combinatorics | 86/1 | Mathlib/Combinatorics/Graph/Lattice.lean | 1 | 2 | ['github-actions', 'vihdzp'] | nobody | 9 days ago | 10 days ago | 10 days |
| 33257 | NickAdfor | feat(Combinatorics/SimpleGraph/Bipartite): Odd Cycle Theorem (A Solution to TODO) | Prove bipartite iff all cycles are even
This PR formalizes the classical graph theory theorem: a graph is bipartite if and only if all its cycles have even length.
Co-authored-by: Nick Adfor |
t-combinatorics new-contributor awaiting-author LLM-generated merge-conflict | 145/12 | Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean | 2 | 80 | ['IvanRenison', 'NickAdfor', 'Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'euprunin', 'github-actions', 'kmill', 'mathlib-merge-conflicts', 'mitchell-horner', 'vihdzp', 'vlad902'] | YaelDillies | 9 days ago | 38 days ago | 52 days |
| 34050 | Julian | feat(GraphTheory): Graham-Pollak theorem | --- [](https://gitpod.io/from-referrer/) | WIP awaiting-author t-combinatorics merge-conflict | 186/6 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/EdgeLabeling.lean,Mathlib/Combinatorics/SimpleGraph/GrahamPollak.lean | 4 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 105 days ago | 13 seconds |
| 34246 | staroperator | feat(SetTheory/Cardinal): Δ-system lemma | We prove the Δ-system lemma, which says for any regular cardinal `θ` and infinite cardinal `κ < θ`, if `∀ c < θ, c ^< κ < θ`, any `θ`-sized family of sets whose cardinalities are less than `κ` must contain a `θ`-sized Δ-system (this condition is called Δ-system property for `θ` and `κ`, noted as `Δ(θ, k)`). As a special case, `Δ(ℵ₁, ℵ₀)` ensures any uncountable family of finite sets must contain an uncountable Δ-system. --- - [ ] depends on: #37685 - [ ] depends on: #38266 [](https://gitpod.io/from-referrer/) | t-set-theory blocked-by-other-PR large-import merge-conflict | 883/8 | Mathlib.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Club.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/DirSupClosed.lean,Mathlib/Order/IsNormal.lean,Mathlib/Order/LatticeIntervals.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/DeltaSystem.lean,Mathlib/SetTheory/Cardinal/Pigeonhole.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,docs/references.bib | 15 | 11 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'staroperator', 'vihdzp'] | nobody | 9 days ago | 52 days ago | 15 days |
| 35341 | grunweg | feat: lint against the tactic.skipAssignedInstances option in mathlib | This means we can remove the corresponding technical debt entry. Re-created version of #20872. --- [This comment](https://github.com/leanprover-community/mathlib4/pull/20872#issuecomment-2602743770) might still be relevant: does this linter need adaptations to recursively parse the outer `set_option`s? Wasn't there code written semi-recently which did this? [](https://gitpod.io/from-referrer/) | please-adopt t-linter merge-conflict | 54/3 | Mathlib/Tactic/Linter/Style.lean,MathlibTest/LintStyle.lean | 2 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 75 days ago | 1 minute |
| 37659 | erdOne | feat(AlgebraicTopology): relative singular homology | --- [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author | 205/2 | Mathlib.lean,Mathlib/Algebra/Homology/ShortComplex/ShortExact.lean,Mathlib/AlgebraicTopology/SingularHomology/Basic.lean,Mathlib/AlgebraicTopology/SingularHomology/Relative.lean,Mathlib/CategoryTheory/MorphismProperty/Basic.lean | 5 | 9 | ['erdOne', 'github-actions', 'joelriou', 'mathlib-merge-conflicts', 'robin-carlier'] | nobody | 9 days ago | 21 days ago | 5 days |
| 38071 | JovanGerb | feat(Convert): less aggressive congruence | This PR tries to make `convert` behave more predictably, disabling some of the aggressive congruence steps that `congr!` does. --- [](https://gitpod.io/from-referrer/) | t-meta merge-conflict | 14/8 | Mathlib/Data/Fin/Tuple/Basic.lean,Mathlib/Data/List/Perm/Basic.lean,Mathlib/Tactic/Convert.lean | 3 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 15 days ago | 1 hour |
| 38239 | vihdzp | chore(Order/SuccPred/Limit): reorganize sections | In an effort to keep the file better organized, we move theorems which use `SuccOrder`/`PredOrder` as an assumption to a new section. No theorems have been changed. --- [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 95/110 | Mathlib/Order/SuccPred/Limit.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 9 days ago | 2 days |
| 38321 | ldct | Tag absolute value lemmas with @[push] | ## Summary - Tag `abs_mul`, `abs_pow`, `abs_mul_self`, `abs_inv`, `abs_div`, `abs_zpow`, and `abs_neg` with `@[push]` so that `push abs` can distribute absolute value through arithmetic expressions. - Add tests in `MathlibTest/push.lean` including a compound example: `|a ^ n * b⁻¹ / (-a)| = |a| ^ n * |b|⁻¹ / |a|` ## Test plan - [x] `lake env lean MathlibTest/push.lean` passes - [ ] CI 🤖 Generated with [Claude Code](https://claude.com/claude-code) | t-algebra merge-conflict | 44/7 | Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Field/Power.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Order/Ring/Abs.lean,MathlibTest/push.lean | 5 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | unknown | 0 seconds |
| 38343 | mortarsanjaya | chore(Data/Nat/Cast/Order/Ring): move two Nat lemmas to Data/Nat/Basic | These two lemmas have no correlation with `Nat.cast`, and the proof can be golfed to fit `Data/Nat/Basic`. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 22/27 | Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Cast/Order/Ring.lean | 2 | 2 | ['github-actions'] | nobody | 9 days ago | 10 days ago | 10 days |
| 37964 | mortarsanjaya | feat(Algebra/Order/Floor): weaken assumptions on theorems about `FloorRing` | This PR weakens as much assumptions as possible on theorems about `FloorSemiring` and `FloorRing`. Mainly, `IsOrderedRing` and `IsStrictOrderedRing` are weakened to just `IsOrderedAddMonoid` or removed completely from the assumptions on the theorems. Most theorems can be generalized as is or only requires a minor modification of replacing lemmas about casting naturals/integers preserving order (the likes of `Nat.cast_le`, `Int.cast_lt`, etc.) with the corresponding version for `FloorRing`. Some other lemmas require modification in the proofs, but these changes shorten the proofs. The new proof of the theorem `Int.mul_cast_floor_div_cancel_of_pos` requires an extra import. The assumption `IsOrderedAddMonoid` is required on lemmas that involve comparison + addition, and `IsOrderedRing` is required only on lemmas that involve comparison + multiplication of two non-integer elements. --- - [ ] depends on: #37714 [](https://gitpod.io/from-referrer/) | t-algebra new-contributor blocked-by-other-PR | 349/266 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/Computation/TerminatesIffRat.lean,Mathlib/Algebra/Order/Floor/Defs.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/Round.lean,Mathlib/Data/Int/Log.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Topology/Algebra/Order/Floor.lean | 9 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 18 days ago | 1 hour |
| 37680 | IvanRenison | feat(Combinatorics/SimpleGraph/Clique): add lemmas about isomorphisms and cliques | --- Idea from this Zulip thread: [#**graph theory>Second Order Monadic Logic for Graph** ](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Second.20Order.20Monadic.20Logic.20for.20Graph/with/583013775) - [ ] depends on: #37649 - [x] depends on: #37640 - [ ] depends on: #37676 - [ ] depends on: #37697 - [ ] depends on: #37700 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 191/0 | Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Data/Finset/Preimage.lean,Mathlib/Data/Set/Function.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 9 days ago | unknown | 0 seconds |
| 38002 | Raph-DG | feat(Topology): Relating irreducible components of a space to codimension one points in non dense subsets | In this PR we show that the coheight zero points of a sober space (in the specialization order) correspond to the irreducible components. Furthermore, we show that the coheight one points of any non dense subset p of X (in the specialization order on p) have coheight zero in the specialization order on X. --- [](https://gitpod.io/from-referrer/) | large-import t-topology | 104/0 | Mathlib/Order/Hom/Basic.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/Minimal.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/Sober.lean | 5 | 2 | ['ADedecker', 'github-actions'] | urkud | 9 days ago | 16 days ago | 16 days |
| 38356 | SnirBroshi | feat(Order/ConditionallyCompleteLattice/Finset): `sSup s ≠ ⊤` in a `CompleteLinearOrder` for a finite set without `⊤` | --- btw `to_dual` here is blocked on #35213 [](https://gitpod.io/from-referrer/) | t-order | 20/0 | Mathlib/Order/ConditionallyCompleteLattice/Finset.lean | 1 | 1 | ['github-actions'] | nobody | 9 days ago | 9 days ago | 9 days |
| 37685 | vihdzp | feat: Fodor's lemma | We define stationary sets and prove Fodor's lemma, following the proof at Wikipedia. --- - [ ] depends on: #37677 I'm surprised that this has a [Wikipedia article](https://en.wikipedia.org/wiki/Fodor%27s_lemma) but isn't listed in 1000.yaml. Is it just because the name has "lemma" instead of "theorem"? [](https://gitpod.io/from-referrer/) | t-set-theory t-order large-import blocked-by-other-PR | 260/0 | Mathlib.lean,Mathlib/Order/IsNormal.lean,Mathlib/SetTheory/Cardinal/Club.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'staroperator'] | nobody | 9 days ago | 25 days ago | 22 minutes |
| 35545 | joelriou | feat(Algebra/Category/ModuleCat): the internal hom for presheaves of modules | --- [](https://gitpod.io/from-referrer/) | t-algebra WIP please-adopt | 141/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/InternalHom.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Pushforward.lean | 3 | 1 | ['github-actions'] | nobody | 9 days ago | 70 days ago | 2 seconds |
| 38340 | xroblot | refactor(Data/ZMod): move `coe_int_isUnit_iff_isCoprime` to `ZMod.Units` | Move `ZMod.coe_int_isUnit_iff_isCoprime` from `Mathlib.Data.ZMod.Coprime` to `Mathlib.Data.ZMod.Units`, where it more naturally belongs as a statement about units in `ZMod`. The proof is rewritten to only use tools available in `Mathlib.Data.ZMod.Units`, avoiding the dependency on `Mathlib.Algebra.EuclideanDomain.Int`. This is motivated by the desire to use `coe_int_isUnit_iff_isCoprime` without the overhead of importing `Mathlib.Data.ZMod.Coprime` (see #38339 for a use case). 🤖 Co-Authored with [Claude Code](https://claude.com/claude-code) | t-data | 10/7 | Mathlib/Data/ZMod/Coprime.lean,Mathlib/Data/ZMod/Units.lean | 2 | 1 | ['github-actions'] | nobody | 9 days ago | 9 days ago | 9 days |
| 38195 | thorimur | test: insert `@[informal]` attributes from overview | --- [](https://gitpod.io/from-referrer/) | file-removed large-import merge-conflict | 1961/353 | Mathlib.lean,Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/Ring/Basic.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/CharP/Lemmas.lean,Mathlib/Algebra/CharZero/Defs.lean,Mathlib/Algebra/ContinuedFractions/Basic.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Group/Irreducible/Defs.lean,Mathlib/Algebra/Group/Subgroup/Defs.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Homology/HomologicalComplex.lean,Mathlib/Algebra/Homology/ShortComplex/HomologicalComplex.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/PID.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Hom/Defs.lean,Mathlib/Algebra/Ring/Subring/Defs.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/IsolatedZeros.lean,Mathlib/Analysis/Calculus/BumpFunction/Convolution.lean,Mathlib/Analysis/Calculus/ContDiff/Convolution.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/Deriv/MeanValue.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/Defs.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean,Mathlib/Analysis/Calculus/Implicit.lean,Mathlib/Analysis/Calculus/InverseFunctionTheorem/FDeriv.lean,Mathlib/Analysis/Calculus/LocalExtr/Basic.lean,Mathlib/Analysis/Calculus/LocalExtr/Rolle.lean,Mathlib/Analysis/Complex/AbsMax.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/Liouville.lean,Mathlib/Analysis/Complex/PhragmenLindelof.lean,Mathlib/Analysis/Complex/Polynomial/Basic.lean,Mathlib/Analysis/Complex/RemovableSingularity.lean,Mathlib/Analysis/Complex/Schwarz.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/Complex/ValueDistribution/FirstMainTheorem.lean,Mathlib/Analysis/Convex/Caratheodory.lean,Mathlib/Analysis/Convex/Deriv.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Convex/Integral.lean,Mathlib/Analysis/Convex/Jensen.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/Distribution/Distribution.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Fourier/AddCircle.lean,Mathlib/Analysis/Fourier/FourierTransform.lean,Mathlib/Analysis/Fourier/Inversion.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/Defs.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/InnerProductSpace/LaxMilgram.lean,Mathlib/Analysis/InnerProductSpace/LinearPMap.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection/Reflection.lean,Mathlib/Analysis/InnerProductSpace/Rayleigh.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/InnerProductSpace/l2Space.lean,Mathlib/Analysis/Normed/Group/AddTorsor.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Analysis/Normed/Module/DoubleDual.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/Analysis/Normed/MulAction.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/BanachSteinhaus.lean,Mathlib/Analysis/Normed/Operator/ContinuousLinearMap.lean,Mathlib/Analysis/Real/Hyperreal.lean,Mathlib/Analysis/SpecialFunctions/Arsinh.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean | 434 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 9 days ago | unknown | 0 seconds |
| 36089 | pfaffelh | feat(Topology/Compactness/CompactSystem): set system of finite unions of sets in a compact system is again a compact system | A compact system is a set system with the following property: If all finite intersections of a sequence in the set system is non-empty, the countable intersection is not empty. Starting with a compact system, consider the finite unions of sets in the copact system. Such sets again form a compact system (`IsCompactSystem.union.isCompactSystem`). This was previously #25900. --- - [ ] depends on: #36013 [](https://gitpod.io/from-referrer/) | brownian t-topology | 272/0 | Mathlib/Data/Set/Dissipate.lean,Mathlib/Topology/Compactness/CompactSystem.lean | 2 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 9 days ago | 9 days ago | 1 hour |
| 38190 | AntoineChambert-Loir | refactor(Topology/Sion): use a dense and continuous completion to generalize the statements | Use the existence of a dense and continuous completion to simplify the final part of the proof of Sion's theorem. As a matter of fact, only an early lemma needs to be modified and the rest holds in weaker assumptions, leading to a serious simplification. Since the PR proving Sion is very recent and unused, we didn't add deprecation lemmas. --- - [ ] depends on: #37939 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 249/119 | Mathlib.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Order/Completion.lean,Mathlib/Topology/Order/Completion.lean,Mathlib/Topology/Sion.lean | 5 | 8 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 9 days ago | 13 days ago | 39 seconds |
| 37279 | imalinowskip | feat(Probability): multivariate CLT (and Cramèr-Wold) | --- - [x] depends on: #36208 [](https://gitpod.io/from-referrer/) | new-contributor t-measure-probability awaiting-author large-import | 500/1 | Mathlib.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/CramerWold.lean | 3 | 10 | ['EtienneC30', 'github-actions', 'imalinowskip', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | RemyDegenne | 8 days ago | 22 days ago | 5 days |
| 38316 | tannerduve | feat(Order/OmegaCompletePartialOrder): least fixed point and Scott induction | Add `lfp` for endomorphisms on an ωCPO with a least element and its basic API (`map_lfp`, `isFixedPt_lfp`, `lfp_le_fixed`, `isLeast_lfp`) and the Scott induction theorem `lfp_induction` Also add corresponding induction principles for `Part.fix`: `fix_scott_induction` (ω-Scott continuous functional, admissible predicate) and `fix_scott_induction_pointwise` | new-contributor | 110/0 | Mathlib/Control/LawfulFix.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,docs/references.bib | 3 | 2 | ['github-actions'] | nobody | 8 days ago | 10 days ago | 10 days |
| 37939 | AntoineChambert-Loir | feat(Order/Completion): embed a linear order into a dense and complete linear order | The aim of the PR is to prove the following theorem that will be used as an input to [Sion.DMCompletion.exists_isSaddlePointOn](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Sion.html#Sion.DMCompletion.exists_isSaddlePointOn) : *If `β` is any linear order, then there exists a complete and dense linear order `γ` together with a continuous embedding `ι : β ↪o γ` (for the order topologies on `β` and `γ`).* Meanwhile, the PR also records various instances about dense orders and lemmas regarding the Dedekind MacNeille completion and lexicographic orders. --- [](https://gitpod.io/from-referrer/) | t-order | 206/3 | Mathlib.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Order/Completion.lean,Mathlib/Topology/Order/Completion.lean,Mathlib/Topology/Sion.lean | 5 | 52 | ['ADedecker', 'AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | vihdzp | 8 days ago | 9 days ago | 12 days |
| 38383 | dagurtomas | chore(CategoryTheory/Limits): dualize chosen coends API | --- The dualization from coends to ends is mostly LLM generated, the initial coend API is written by hand - [ ] depends on: #38382 [](https://gitpod.io/from-referrer/) | LLM-generated t-category-theory blocked-by-other-PR | 337/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Chosen/End.lean,Mathlib/CategoryTheory/Limits/Types/End.lean | 3 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 8 days ago | 8 days ago | 13 minutes |
| 38325 | Jun2M | feat(Combinatorics/Graph): EndPoint function | This PR introduces `endPoints`: `Set` of incident vertices, given an edge (in the case of non-edge, return empty). **Import change**: `Graph/Basic` now imports `Data/Set/Card` to allow reasoning about card of `endPoints`. [Relavent Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/New.20graph.20definitions/with/588616269) --- [](https://gitpod.io/from-referrer/) | t-combinatorics large-import | 83/3 | Mathlib/Combinatorics/Graph/Basic.lean | 1 | 9 | ['Jun2M', 'SnirBroshi', 'eric-wieser', 'github-actions', 'mathlib-bors'] | nobody | 8 days ago | 8 days ago | 10 days |
| 36239 | plp127 | feat(FieldTheory/KrullTopology): define uniform group structure on galois group | Endow the galois group of a field extension `Gal(L/K)` with the structure of a uniform group. Use this to prove some properties of the galois group earlier, for example, that the galois group is compact is immediate, and in more generality than the version proved in `FieldTheory/Galois/Profinite`. Deprecate some material which used to be used to define the krull topology, but is now unused since the krull topology comes out of the uniform structure. --- [](https://gitpod.io/from-referrer/) | t-algebra | 271/177 | Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/FieldTheory/Galois/Profinite.lean,Mathlib/FieldTheory/KrullTopology.lean,Mathlib/NumberTheory/Cyclotomic/CyclotomicCharacter.lean | 4 | 17 | ['github-actions', 'mathlib-merge-conflicts', 'plp127', 'vihdzp'] | mattrobball | 8 days ago | 33 days ago | 33 days |
| 36378 | EtienneC30 | refactor: define the geometric distribution via a sum of Dirac masses | Change the definition of `geometricMeasure p` to be `Measure.sum (fun n ↦ ENNReal.ofReal ((1 - p) ^ n * p)) • (.dirac n))` instead of using `PMF`. This allows to directly use API for measures instead of having to develop an API for `PMF`, which anyway is defined as a sum of Dirac masses. Also add some results about integrals against the geometricMeasure. --- - [x] depends on: #36355 [](https://gitpod.io/from-referrer/) | t-measure-probability large-import | 138/25 | Mathlib/Probability/Distributions/Geometric.lean | 1 | 41 | ['DavidLedvinka', 'EtienneC30', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'pfaffelh'] | kex-y | 8 days ago | 31 days ago | 53 days |
| 37374 | NoneMore | feat(Topology/DerivedSet): add relative derived set lemmas | Add `relDerivedSet`, `relDerivedSet_subset`, and `IsClosed.relDerivedSet_eq`. --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor | 17/0 | Mathlib/Topology/DerivedSet.lean | 1 | 6 | ['NoneMore', 'github-actions', 'plp127', 'vihdzp'] | urkud | 8 days ago | 31 days ago | 31 days |
| 38266 | staroperator | feat(Order/CompleteLatticeIntervals): `ConditionallyCompleteLinearOrderBot` for `Set.Iio` | `Set.Iio a` (when it's nonempty) inherits the `ConditionallyCompleteLinearOrderBot` structure from the base type. This is commonly used in set theory, where we consider the ordinals within `a`, and convert `Iio a` from/to `Ordinal`. There should also be a `ConditionallyCompleteLinearOrder` instance, but adding this seems difficult for now because the junk value may not be the same as bottom (which has been mentioned as "refactor that will allow different default values for `sSup` and `sInf`" in the module doc). Since my motivation is for the ordinals purely, this PR only adds a single `ConditionallyCompleteLinearOrderBot` instance. --- I'm not very familiar with the API design here, so any suggestion would be helpful. - [ ] depends on: #35674 [](https://gitpod.io/from-referrer/) | t-order blocked-by-other-PR | 76/0 | Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/LatticeIntervals.lean | 3 | 7 | ['github-actions', 'mathlib-dependent-issues', 'staroperator', 'vihdzp'] | nobody | 8 days ago | 8 days ago | 3 days |
| 38397 | staroperator | feat(ModelTheory): add `DefinablePred` for `fun_prop` automation | This PR adds `DefinablePred`. It is the same as `Definable`, except the latter applies on `Set (α → M)` and the former applies on `(α → M) → Prop`. There main reason to add this is that I want to automate the definability proof of predicates, and that `fun_prop` works on functions (that include predicates) but not on sets. For example, with appropriate `fun_prop` lemmas added, one can automate definability result like this: ```lean4 theorem IsLinearSet.definable [Finite α] (hs : IsLinearSet s) : A.Definable presburger s := by ... -- ⊢ A.DefinablePred presburger fun x ↦ -- ∃ y, (∃ a, ∀ (x : α), y x = ∑ x_1, a x_1 * ↑x_1 x) ∧ ∀ (x_1 : α), v x_1 + y x_1 = x x_1 fun_prop ``` This PR also removes certain `fun_prop` tags that would or should not be used in automation. --- Note: one may argue that we don't need a new definition if we use `aesop` instead of `fun_prop`. However, in that case, we still need to write lemmas for `{x | p x}` targets (e.g. for `{x | p x ∧ q x}`), which have almost no difference with lemmas on `p` or `fun x => p x ∧ q x` directly. - [ ] depends on: #38393 [](https://gitpod.io/from-referrer/) | t-logic blocked-by-other-PR | 500/261 | Mathlib/ModelTheory/Algebra/Classes.lean,Mathlib/ModelTheory/Algebra/Field/IsAlgClosed.lean,Mathlib/ModelTheory/Algebra/Ring/Basic.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Basic.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Definability.lean,Mathlib/ModelTheory/Definability.lean,Mathlib/ModelTheory/Order.lean | 7 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 8 days ago | 8 days ago | 6 minutes |
| 38393 | staroperator | refactor(ModelTheory): add typeclasses for algebraic symbols | `Language.ring` and `Language.presburger` share the same symbols `0`, `1` and `+` and have duplicated instances on `Term` and `realize` simp lemmas. This PR makes these symbols certain typeclasses (similar to [`Language.IsOrdered`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/ModelTheory/Order.html#FirstOrder.Language.IsOrdered)) and removes the duplication. It also adds certain definability lemmas that `fun_prop` can use. --- [](https://gitpod.io/from-referrer/) | t-logic | 332/201 | Mathlib.lean,Mathlib/ModelTheory/Algebra/Classes.lean,Mathlib/ModelTheory/Algebra/Field/IsAlgClosed.lean,Mathlib/ModelTheory/Algebra/Ring/Basic.lean,Mathlib/ModelTheory/Algebra/Ring/FreeCommRing.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Basic.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Definability.lean | 7 | 1 | ['github-actions'] | nobody | 8 days ago | 8 days ago | 8 days |
| 38399 | openendings | feat: OrderHom.instOrderSupSet for LawfulSup | Currently we have `instance [CompleteLattice β] : SupSet (α →o β)`. We replace this with a mere `LawfulSup` assumption such as #38328, . TODO: - [ ] construct an `OrderSupSet` instance instead of `SupSet` --- WIP - [ ] depends on: #38328 [or other `LawfulSup`] (based on master in case something else needs this) [](https://gitpod.io/from-referrer/) | WIP t-order new-contributor blocked-by-other-PR | 26/0 | Mathlib/Order/Hom/Order.lean | 1 | 5 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'openendings'] | nobody | 8 days ago | 8 days ago | 1 minute |
| 38375 | WenrongZou | feat(MvPowerSeries): some lemmas `truncTotal` of `subst` | This PR adds some lemmas about truncation of total degree of a substitution. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 124/7 | Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean | 2 | 3 | ['BryceT233', 'github-actions'] | nobody | 8 days ago | 9 days ago | 9 days |
| 38406 | plp127 | chore(ModelTheory/Skolem): remove unnecessary `[Nonempty M]` assumption | Removes a `[Nonempty M]` assumption by slightly modifying two proofs. --- [](https://gitpod.io/from-referrer/) | t-logic | 7/1 | Mathlib/ModelTheory/Skolem.lean | 1 | 1 | ['github-actions'] | nobody | 8 days ago | 8 days ago | 8 days |
| 37502 | felixpernegger | refactor(Topology): rename ```LocPathConnected``` | Rename ```LocPathConnected``` to ```LocallyPathConnected``` per discussion at https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Rename.20.60.60.60LocPathConnectedSpace.60.60.60.3F/with/582824006 Deprecations were partly added with Claude --- [](https://gitpod.io/from-referrer/) | t-topology merge-conflict awaiting-author | 369/304 | Mathlib.lean,Mathlib/Analysis/CStarAlgebra/Unitary/Connected.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean,Mathlib/Topology/Compactness/DeltaGeneratedSpace.lean,Mathlib/Topology/Connected/LocPathConnected.lean,Mathlib/Topology/Connected/LocallyPathConnected.lean,Mathlib/Topology/Connected/PathComponentOne.lean,Mathlib/Topology/Homotopy/Lifting.lean,Mathlib/Topology/Homotopy/LocallyContractible.lean | 12 | 9 | ['SnirBroshi', 'felixpernegger', 'github-actions', 'grunweg', 'mathlib-bors', 'mathlib-merge-conflicts'] | j-loreaux | 8 days ago | 29 days ago | 18 hours |
| 36544 | xroblot | feat(RingTheory/Ideal): restriction maps on decomposition and inertia groups in a Galois tower | Adds a new file `Mathlib/RingTheory/Ideal/Galois.lean` with results on the action of `Gal(L/K)` on ideals of a ring `B ⊆ L` for a Galois subextension `F/K` of `L/K`. The main results are the surjectivity and kernel descriptions of the natural maps from the decomposition (resp. inertia) group of `P` in `Gal(L/K)` to the decomposition (resp. inertia) group of `p` in `Gal(F/K)`, induced by restriction. --- - [ ] depends on: #38153 [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author WIP blocked-by-other-PR | 213/0 | Mathlib.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/RingTheory/Ideal/Galois.lean | 3 | 18 | ['copilot-pull-request-reviewer', 'github-actions', 'mathlib-dependent-issues', 'riccardobrasca', 'tb65536', 'xroblot'] | riccardobrasca | 8 days ago | 15 days ago | 34 days |
| 29764 | ScottCarnahan | feat(Algebra/Vertex): API up to residue products (WIP) | This PR contains definitions leading up to the residue product of vertex operators and some basic properties. Parts will be split off as smaller PRs when I have time. --- - [ ] depends on: #25831 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR large-import merge-conflict | 1625/17 | Mathlib.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/RestrictedValue.lean,Mathlib/Algebra/Vertex/HVertexOperator.lean,Mathlib/Algebra/Vertex/VertexOperator.lean,Mathlib/RingTheory/Binomial.lean,Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/HahnSeries/Binomial.lean,Mathlib/RingTheory/HahnSeries/HEval.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/Summable.lean,Mathlib/RingTheory/Polynomial/Pochhammer.lean | 14 | 6 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 days ago | 225 days ago | 3 hours |
| 38054 | chrisflav | feat(RingTheory): category of finite étale algebras over a separably closed field | We define the category of finite étale `R`-algebras for a ring `R` and show it is equivalent to `FintypeCat` if `R` is a separably closed field. From Pi1. --- - [ ] depends on: #38016 - [ ] depends on: #38409 [](https://gitpod.io/from-referrer/) | t-ring-theory large-import blocked-by-other-PR | 338/1 | Mathlib.lean,Mathlib/Algebra/Algebra/Pi.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean,Mathlib/FieldTheory/IsSepClosed.lean,Mathlib/RingTheory/Artinian/Module.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Field.lean,Mathlib/RingTheory/Etale/Finite.lean,Mathlib/RingTheory/TensorProduct/Maps.lean,Mathlib/RingTheory/TotallySplit.lean | 10 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 8 days ago | 8 days ago | 22 hours |
| 38373 | Nicola9Falciola | feat (Algebra/FreeAbelianGroup /Finsupp) : The support of non zero element in a freeabeliangroup is non empty | Add the lemma that for a nonzero a : FreeAbelianGroup X the support of it is non empty. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 3/0 | Mathlib/Algebra/FreeAbelianGroup/Finsupp.lean | 1 | 7 | ['Nicola9Falciola', 'SnirBroshi', 'github-actions'] | nobody | 8 days ago | 8 days ago | 9 days |
| 38409 | chrisflav | feat(RingTheory): totally split algebras over a field | We show that for a totally split algebra over a field, the `k`-rational points are in bijection with the prime spectrum. We also show that an étale algebra over a separably closed field is totally split. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 122/2 | Mathlib/Algebra/Algebra/Pi.lean,Mathlib/FieldTheory/IsSepClosed.lean,Mathlib/RingTheory/Artinian/Module.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Field.lean,Mathlib/RingTheory/TotallySplit.lean | 6 | 1 | ['github-actions'] | nobody | 8 days ago | 8 days ago | 8 days |
| 38388 | supermanG | feat(Combinatorics/SimpleGraph): add ballFinset with basic identities | Introduces `SimpleGraph.ballFinset`, the `Finset` companion to `SimpleGraph.ball` (#36443) on graphs with a `Fintype` vertex set, together with the basic identities `mem_ballFinset`, `ballFinset_zero`, and `ballFinset_one`. `SimpleGraph.ball` is the *open* metric ball `{u | edist u c < r}` and is indexed by `ℕ∞`; `ballFinset` is typed `ℕ → Finset V` for ergonomics at cardinality-facing call sites. The classical closed-ball cardinality at radius `r`, `|{u | edist u c ≤ r}|`, corresponds to `|ballFinset v (r + 1)|` in this setup. Opened as draft so CI can run before pinging maintainers. --- First-time Mathlib contribution — happy to adjust naming, file placement, or docstring style to match house conventions. Follow-up PRs will add cardinality envelopes (sphere cardinality, geometric-series bound, polynomial bound). | t-combinatorics new-contributor LLM-generated | 68/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/BallCardinality.lean | 2 | 3 | ['SnirBroshi', 'github-actions'] | nobody | 8 days ago | unknown | 0 seconds |
| 37045 | edegeltje | feat(CategoryTheory/Limits): Pullback squares in cartesian monoidal categories | This PR adds various lemmas about standard pullback squares in categories with chosen finite products. --- [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author | 351/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/IsPullback/CartesianMonoidal.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean | 3 | 44 | ['FernandoChu', 'dagurtomas', 'edegeltje', 'github-actions', 'joelriou', 'robin-carlier'] | joelriou | 8 days ago | 8 days ago | 21 days |
| 26345 | mans0954 | feat(Analysis/LocallyConvex/Polar): Bipolar theorem | The bipolar theorem states that the polar of the polar of a set `s` is equal to the closed absolutely convex hull of `s`. The argument here follows Conway, Chapter V. 1.8. This PR continues the work from #20843. Original PR: https://github.com/leanprover-community/mathlib4/pull/20843 - [x] depends on: #27316 | t-analysis awaiting-author | 171/6 | Mathlib.lean,Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Analysis/LocallyConvex/Bipolar.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Topology/Algebra/Module/Spaces/WeakBilin.lean | 6 | 136 | ['JonBannon', 'eric-wieser', 'faenuccio', 'github-actions', 'goliath-klein', 'j-loreaux', 'leanprover-community-bot-assistant', 'mans0954', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mcdoll', 'themathqueen', 'vihdzp'] | faenuccio and j-loreaux | 8 days ago | 12 days ago | 21 days |
| 36553 | j-loreaux | feat: add IsMulCommutative instances for directed families of commutative subobjects | --- - [ ] depends on: #36549 [](https://gitpod.io/from-referrer/) | t-algebra | 169/1 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Membership.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean | 11 | 5 | ['github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'themathqueen'] | kim-em | 8 days ago | 8 days ago | 30 days |
| 35197 | j-loreaux | feat: Hölder framework for `lp` spaces | --- - [ ] depends on: #35152 - [ ] depends on: #35198 [](https://gitpod.io/from-referrer/) | t-analysis | 311/9 | Mathlib.lean,Mathlib/Analysis/Normed/Lp/LpEquiv.lean,Mathlib/Analysis/Normed/Lp/lpHolder.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Analysis/Normed/Operator/Basic.lean,Mathlib/Tactic/Linter/TextBased.lean | 6 | 10 | ['github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mike1729'] | urkud | 8 days ago | 8 days ago | 27 days |
| 35753 | Vilin97 | feat(Topology/Algebra/Order): regular grid helpers and piecewise linear interpolation | Make API for piecewise linear interpolation on regular grids. I need these to for ODE time-stepping methods, like forward Euler, and later Runge–Kutta methods. Follow-up PR: #35755 (forward Euler method convergence). I don't know if these numerical analysis ODE-solving methods even belong in mathlib. If someone could advise me on it, I would appreciate it. --- The initial proof was produced by [Aristotle](https://aristotle.harmonic.fun). The code was iteratively refined (factoring out lemmas, golfing, simplifying proofs) using Claude Code. - [ ] depends on: #38091 | t-topology new-contributor LLM-generated awaiting-author | 180/0 | Mathlib.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean | 2 | 51 | ['Vilin97', 'YanYablonovskiy', 'adomani', 'botbaki-review', 'copilot-pull-request-reviewer', 'dagurtomas', 'eric-wieser', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-dependent-issues', 'wwylele'] | j-loreaux | 8 days ago | 8 days ago | 32 days |
| 38214 | emlis42 | feat(Algebra/ContinuedFractions): add Euler's continued fraction | This PR formalizes Euler’s continued fractions by providing `Euler` which construct one by giving head term and coefficients with some basic property. We also introduce a transformation `GenContFract.toEuler` that maps a generalized continued fraction `g : GenContFract K` to an equivalent Euler-form continued fraction. | new-contributor t-algebra | 262/0 | Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Euler.lean | 2 | 15 | ['github-actions', 'mathlib-bors', 'wwylele'] | nobody | 8 days ago | 8 days ago | 8 days |
| 37914 | j-loreaux | feat: transfer `star`-related instances across equivalences | This also adds `Function.Injective.{InvolutiveStar,...}` and related lemmas. In addition we rename the existing `Equiv.star` to `Equiv.Perm.star` (without a deprecation) so that the name can be used for the declaration which transfers a `Star` instance across an `Equiv`. --- [](https://gitpod.io/from-referrer/) | t-algebra | 95/2 | Mathlib.lean,Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/TransferInstance.lean | 4 | 5 | ['SnirBroshi', 'github-actions', 'themathqueen'] | nobody | 8 days ago | 8 days ago | 8 days |
| 38425 | eric-wieser | fix: respect set_option in the unused tactic linter | --- [](https://gitpod.io/from-referrer/) | t-linter | 35/31 | Mathlib/Tactic/Linter/UnusedTactic.lean | 1 | 1 | ['github-actions'] | nobody | 8 days ago | unknown | 0 seconds |
| 33810 | dupuisf | feat: add instances of `LawfulInv` | --- - [ ] depends on: #33441 [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 187/22 | Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean,Mathlib/LinearAlgebra/Matrix/PosDef.lean,Mathlib/RingTheory/DividedPowers/Padic.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/ContinuousMap/Bounded/Basic.lean | 9 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 8 days ago | 111 days ago | 1 second |
| 36451 | SnirBroshi | feat(Combinatorics/SimpleGraph/Matching): `edgeSet` is injective and strictly monotonic on matchings, and more API | --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 36/10 | Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 2 | 13 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 8 days ago | 8 days ago | 36 days |
| 31425 | robertmaxton42 | feat(Topology): implement delaborators for non-standard topology notation | Add delaborators for unary and binary notation related to non-standard topologies in the TopologicalSpace namespace. --- [](https://gitpod.io/from-referrer/) | t-topology delegated | 274/5 | Mathlib.lean,Mathlib/Topology/Defs/Basic.lean,Mathlib/Util/DelabNonCanonical.lean,MathlibTest/Delab/TopologicalSpace.lean | 4 | 73 | ['Vierkantor', 'eric-wieser', 'github-actions', 'j-loreaux', 'jcommelin', 'kckennylau', 'mathlib-bors', 'robertmaxton42'] | alreadydone | 7 days ago | 16 days ago | 125 days |
| 35423 | Rob23oba | feat: add congruence lemmas for `Function.update` and `Pi.single` | Adds `simp` congruence lemmas to `Function.update` and `Pi.single` that are specialized for the non-dependent case. See also [#mathlib4 > Simp fails to apply with `Function.update`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Simp.20fails.20to.20apply.20with.20.60Function.2Eupdate.60/with/573889929). --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 29/6 | Mathlib/Algebra/Notation/Pi/Basic.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/RepresentationTheory/Tannaka.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean | 5 | 11 | ['Rob23oba', 'eric-wieser', 'github-actions', 'joelriou', 'joneugster', 'loefflerd', 'mathlib-merge-conflicts'] | joelriou | 7 days ago | 37 days ago | 36 days |
| 36236 | kim-em | chore: add module keyword to Archive and Counterexamples files | This PR converts 105 Archive and Counterexamples files to module format, adding `module`, `public import`, and `@[expose] public section`. Eight files are left unconverted for now: - Seven files containing `private` declarations that need further work (`Imo1962Q1`, `MiuLanguage/Basic`, `MiuLanguage/DecisionSuf`, `AscendingDescendingSequences`, `BallotProblem`, `AharoniKorman`, `TopologistsSineCurve`) - `Counterexamples/InvertibleModuleNotIdeal` which needs an import path update For `Archive/Examples/PropEncodable`, the `private` declarations were removed as part of this conversion. 🤖 Prepared with Claude Code | IMO LLM-generated merge-conflict | 735/309 | Archive/Arithcc.lean,Archive/Examples/Eisenstein.lean,Archive/Examples/Kuratowski.lean,Archive/Examples/PropEncodable.lean,Archive/Hairer.lean,Archive/Imo/Imo1959Q1.lean,Archive/Imo/Imo1959Q2.lean,Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1960Q2.lean,Archive/Imo/Imo1961Q3.lean,Archive/Imo/Imo1962Q4.lean,Archive/Imo/Imo1963Q5.lean,Archive/Imo/Imo1964Q1.lean,Archive/Imo/Imo1969Q1.lean,Archive/Imo/Imo1972Q5.lean,Archive/Imo/Imo1975Q1.lean,Archive/Imo/Imo1977Q6.lean,Archive/Imo/Imo1981Q3.lean,Archive/Imo/Imo1982Q1.lean,Archive/Imo/Imo1985Q2.lean,Archive/Imo/Imo1986Q5.lean,Archive/Imo/Imo1987Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1997Q3.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2001Q3.lean,Archive/Imo/Imo2001Q4.lean,Archive/Imo/Imo2001Q5.lean,Archive/Imo/Imo2001Q6.lean,Archive/Imo/Imo2002Q3.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2005Q4.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2006Q5.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2010Q5.lean,Archive/Imo/Imo2011Q3.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2013Q1.lean,Archive/Imo/Imo2013Q5.lean,Archive/Imo/Imo2015Q6.lean,Archive/Imo/Imo2019Q1.lean,Archive/Imo/Imo2019Q2.lean,Archive/Imo/Imo2019Q4.lean,Archive/Imo/Imo2020Q2.lean,Archive/Imo/Imo2021Q1.lean,Archive/Imo/Imo2024Q2.lean,Archive/Imo/Imo2024Q3.lean,Archive/Imo/Imo2024Q6.lean,Archive/Imo/Imo2025Q3.lean,Archive/Kuratowski.lean,Archive/MinimalSheffer.lean,Archive/OxfordInvariants/Summer2021/Week3P1.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AbelRuffini.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/HeronsFormula.lean,Archive/Wiedijk100Theorems/InverseTriangleSum.lean,Archive/Wiedijk100Theorems/Konigsberg.lean,Archive/Wiedijk100Theorems/PerfectNumbers.lean,Archive/Wiedijk100Theorems/SolutionOfCubicQuartic.lean,Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Archive/ZagierTwoSquares.lean,Counterexamples/CanonicallyOrderedCommSemiringTwoMul.lean,Counterexamples/CharPZeroNeCharZero.lean,Counterexamples/CliffordAlgebraNotInjective.lean,Counterexamples/Cyclotomic105.lean,Counterexamples/DimensionPolynomial.lean,Counterexamples/DirectSumIsInternal.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Counterexamples/EulerSumOfPowers.lean,Counterexamples/Girard.lean,Counterexamples/HeawoodUnitDistance.lean,Counterexamples/HomogeneousPrimeNotPrime.lean,Counterexamples/IrrationalPowerOfIrrational.lean,Counterexamples/MapFloor.lean,Counterexamples/MonicNonRegular.lean,Counterexamples/Motzkin.lean,Counterexamples/NowhereDifferentiable.lean,Counterexamples/OrderedCancelAddCommMonoidWithBounds.lean,Counterexamples/PeanoCurve.lean,Counterexamples/Phillips.lean,Counterexamples/PolynomialIsDomain.lean,Counterexamples/Pseudoelement.lean,Counterexamples/QuadraticForm.lean,Counterexamples/SeminormLatticeNotDistrib.lean,Counterexamples/SeparableNotSecondCountable.lean,Counterexamples/SorgenfreyLine.lean,Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean | 97 | 9 | ['JovanGerb', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | dwrensha | 7 days ago | 7 days ago | 6 days |
| 37461 | grunweg | chore: golf using the field tactic | --- In the spirit of #31314. [](https://gitpod.io/from-referrer/) | merge-conflict | 32/43 | Counterexamples/NowhereDifferentiable.lean,Mathlib/Analysis/Calculus/Monotone.lean,Mathlib/Analysis/Complex/BorelCaratheodory.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/Normed/Field/Lemmas.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/InformationTheory/KullbackLeibler/Basic.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Integral/MeanValue.lean,Mathlib/NumberTheory/ModularForms/Discriminant.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/Defs.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/MDifferentiable.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/Distributions/Gaussian/CharFun.lean,Mathlib/RepresentationTheory/Homological/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/PowerSeries/Exp.lean,Mathlib/Topology/UnitInterval.lean | 20 | 5 | ['github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 7 days ago | 22 days |
| 38000 | grunweg | feat: linters for recommended field_simp style, rebased | --- The current state fixes all sensible linter errors. TODOs prior to merging: - noisiness: right now, each `field` produces a try this suggestion (which doesn't work). warnings are useful; informational messages are superfluous - false positives 1: when `field` is applied to several goals (e.g., inside `<;>` and e.g. `ring` works for *some*, but not *all* occurrences), right now the linter still fires. It should not. - false positives 2: with `field` as a tactic discharger --- might be obsolete after the previous point. - [ ] depends on: #37461 [](https://gitpod.io/from-referrer/) | t-linter blocked-by-other-PR awaiting-CI merge-conflict | 156/65 | Counterexamples/NowhereDifferentiable.lean,Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Complex/BorelCaratheodory.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/Convex/Join.lean,Mathlib/Analysis/Convex/Side.lean,Mathlib/Analysis/Distribution/Sobolev.lean,Mathlib/Analysis/Fourier/AddCircle.lean,Mathlib/Analysis/Hofer.lean,Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean,Mathlib/Analysis/InnerProductSpace/Rayleigh.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/Normed/Field/Lemmas.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Deligne.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/PosLogEqCircleAverage.lean,Mathlib/Analysis/SpecialFunctions/OrdinaryHypergeometric.lean,Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/RootsExtrema.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Affine.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean,Mathlib/InformationTheory/KullbackLeibler/Basic.lean,Mathlib/Lean/Meta/WarningAsError.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean,Mathlib/MeasureTheory/Function/ConvergenceInDistribution.lean,Mathlib/MeasureTheory/Integral/MeanValue.lean,Mathlib/MeasureTheory/Measure/IntegralCharFun.lean,Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/LSeries/AbstractFuncEq.lean,Mathlib/NumberTheory/ModularForms/Bounds.lean,Mathlib/NumberTheory/ModularForms/Discriminant.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/Defs.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/MDifferentiable.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/Distributions/Gaussian/CharFun.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/Distributions/Poisson/PoissonLimitThm.lean,Mathlib/RepresentationTheory/Homological/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/PowerSeries/Exp.lean,Mathlib/Tactic/Field.lean,Mathlib/Topology/MetricSpace/GromovHausdorff.lean | 47 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 18 days ago | 24 seconds |
| 38434 | SnirBroshi | feat(Combinatorics/SimpleGraph/Maps): `map` lemmas about support/top/bot | --- - [ ] depends on: #38432 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 38/0 | Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Logic/Relation.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 7 days ago | 14 minutes |
| 37956 | artie2000 | feat(Algebra/Polynomial): lemmas about polynomial degree | * Add various small lemmas about polynomial degree --- [](https://gitpod.io/from-referrer/) | t-algebra | 28/5 | Mathlib/Algebra/Polynomial/Degree/Defs.lean,Mathlib/Algebra/Polynomial/Degree/Operations.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/Monic.lean,MathlibTest/hintAll.lean | 5 | 7 | ['artie2000', 'github-actions', 'vihdzp'] | themathqueen | 7 days ago | 19 days ago | 19 days |
| 38055 | felixpernegger | feat(Topology/EMetricSpace): add r-variation | Redoing #37007 (I had accidently deleted my fork which nuked the PR). See https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/p-variation for discussion. --- [](https://gitpod.io/from-referrer/) | t-topology t-analysis | 408/0 | Mathlib.lean,Mathlib/Topology/EMetricSpace/RVariation.lean | 2 | 2 | ['felixpernegger', 'github-actions'] | j-loreaux | 7 days ago | 15 days ago | 15 days |
| 38090 | chrisflav | feat(AlgebraicGeometry): rank of finite flat morphism | From Pi1. --- - [x] depends on: #38084 [](https://gitpod.io/from-referrer/) | t-algebraic-geometry | 461/2 | Mathlib.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/AlgebraicGeometry/Morphisms/Affine.lean,Mathlib/AlgebraicGeometry/Morphisms/Finite.lean,Mathlib/AlgebraicGeometry/Morphisms/FinitePresentation.lean,Mathlib/AlgebraicGeometry/Morphisms/Flat.lean,Mathlib/AlgebraicGeometry/Morphisms/FlatRank.lean,Mathlib/RingTheory/Flat/Rank.lean,Mathlib/RingTheory/Localization/BaseChange.lean | 10 | 2 | ['github-actions', 'mathlib-dependent-issues'] | kim-em | 7 days ago | 9 days ago | 10 days |
| 38114 | javgomzar | feat(FinitelyPresentedGroup): add finite groups instance | Add IsFinitelyPresented instance for finite groups.
Co-authored-by: Hang Lu Su |
t-group-theory new-contributor large-import | 32/3 | Mathlib/GroupTheory/FinitelyPresentedGroup.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean | 2 | 32 | ['github-actions', 'javgomzar', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536', 'vihdzp'] | mattrobball | 7 days ago | 9 days ago | 12 days |
| 38422 | SnirBroshi | feat(Combinatorics/SimpleGraph/Maps): `G →g G.map f` | The existing `SimpleGraph.Embedding.map` takes an embedding and lifts it to a graph embedding `G ↪g G.map f`. #36130 generalized `SimpleGraph.map` from embeddings to functions, so now we can get a graph homomorphism `G →g G.map f` without requiring that `f` is injective, although we still have to require that it is injective on adjacent vertices (aka a valid coloring). This adds `Coloring.homMap`, and `Hom.map` which is identical but avoids coloring terminology/spelling. --- I'd love for suggestions to improve the docstring of `Coloring.homMap`, I'm not sure about it :) Are the two versions a good idea, or should we just have the coloring one? (we have `{Hom,Embedding,Iso}.comap` but only `{Embedding,Iso}.map`) [](https://gitpod.io/from-referrer/) | t-combinatorics | 16/0 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean | 2 | 4 | ['SnirBroshi', 'eric-wieser', 'github-actions'] | nobody | 7 days ago | 8 days ago | 8 days |
| 37062 | tannerduve | feat(Computability): Turing join and semilattice structure on Turing degrees | ## Summary - Add `Partrec.kronecker` (equality test) and `Partrec.join` (disjoint union by parity) in `Partrec.lean` - Prove `Nat.RecursiveIn` is closed under computable conditionals (`cond_const`, `cond`) - Show each component reduces to the join (`left_le_join`, `right_le_join`) and the join is the least upper bound (`join_le`) - Establish `SemilatticeSup` instance on `TuringDegree` | t-computability new-contributor large-import | 311/15 | Mathlib/Computability/Partrec.lean,Mathlib/Computability/RecursiveIn.lean,Mathlib/Computability/TuringDegree.lean | 3 | 7 | ['Komyyy', 'github-actions', 'mathlib-merge-conflicts', 'tannerduve'] | Komyyy | 7 days ago | 18 days ago | 18 days |
| 38334 | 8e7 | feat(Combinatorics/SimpleGraph/TreeDecomp): define tree decompositions | Add definition for tree decompositions on simple graphs. Define the tree width of a simple graph and prove basic statements and conversions. ```lean structure TreeDecomp (G : SimpleGraph V) where /-- The type of bags in the tree. -/ W : Type u /-- The set of vertices in each bag. -/ 𝓧 : W → Finset V /-- The graph adjacency relation of bags. -/ T : SimpleGraph W /-- T must be a tree. -/ isTree : IsTree T /-- All vertices in G must appear in some bag. -/ vertexCover : ∀ v : V, ∃ w : W, v ∈ 𝓧 w /-- For any edge (u, v) in G, there is a bag containing both u and v. -/ edgeCover ⦃u v : V⦄ : G.Adj u v → ∃ w : W, u ∈ 𝓧 w ∧ v ∈ 𝓧 w /-- For any vertex v in G, the set of bags that contain v is preconnected. -/ connectedBags : ∀ v : V, (T.induce ({w | v ∈ 𝓧 w})).Preconnected ``` AI Usage: Some proofs are written with the help of Claude Code, and everything has been manually reviewed. --- - [ ] depends on: #38027 [](https://gitpod.io/from-referrer/) | new-contributor help-wanted blocked-by-other-PR t-combinatorics LLM-generated WIP | 396/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Star.lean,Mathlib/Combinatorics/SimpleGraph/TreeDecomp.lean | 3 | 5 | ['8e7', 'github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 10 days ago | 5 minutes |
| 30185 | alreadydone | feat(MathlibTest): kernel reduction of nsmul on elliptic curve over ZMod | Co-authored-by: @SteffenReith --- - [x] depends on: #30144 - [x] depends on: #30181 [](https://gitpod.io/from-referrer/) | t-algebra t-number-theory t-algebraic-geometry maintainer-merge | 29/0 | MathlibTest/EllipticCurve.lean | 1 | 11 | ['alreadydone', 'github-actions', 'joneugster', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | joneugster | 7 days ago | 13 days ago | 14 days |
| 36401 | JovanGerb | feat(positivity): positivity extension for `a - b` | This PR adds support in `positivity` for proving things about subtraction. For example, if the goal is `0 < a - b`, and there is a local hypothesis of type `b < a`, then we close the goal. The motivation is that we want `positivity` to be a flexible tactic. So, when trying to prove `0 < a - b` using a local hypothesis, we should look for the simp normal form of this, which is `b < a`. --- [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Can.20I.20make.20positivity.20work.20for.20this.3F/near/578277240) [](https://gitpod.io/from-referrer/) | t-meta maintainer-merge | 63/26 | Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Complex/BorelCaratheodory.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Convex/BetweenList.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/Geometry/Manifold/Riemannian/PathELength.lean,Mathlib/Tactic/Positivity/Basic.lean,MathlibTest/positivity.lean | 10 | 13 | ['JovanGerb', 'Vierkantor', 'github-actions', 'hrmacbeth', 'j-loreaux', 'joneugster', 'leanprover-radar'] | joneugster | 7 days ago | 10 days ago | 39 days |
| 36167 | WenrongZou | feat(RingTheory/FormalGroup): construction of additive inverse of formal group | construction of additive inverse --- - [x] depends on: #35912 - [ ] depends on: #38052 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 516/15 | Mathlib.lean,Mathlib/RingTheory/FormalGroup/AddInv.lean,Mathlib/RingTheory/FormalGroup/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Basic.lean,Mathlib/RingTheory/PowerSeries/Evaluation.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Trunc.lean | 8 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 16 days ago | 4 days |
| 38213 | WenrongZou | feat(FormalGroup): APIs for formal group homomorphism | This PR introduces some APIs for homomorphism between formal group laws. --- - [ ] depends on: #38052 - [ ] depends on: #37618 [](https://gitpod.io/from-referrer/) | t-ring-theory large-import blocked-by-other-PR | 458/17 | Mathlib/RingTheory/FormalGroup/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean,Mathlib/RingTheory/MvPowerSeries/Rename.lean,Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Basic.lean,Mathlib/RingTheory/PowerSeries/Evaluation.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean | 8 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 13 days ago | 18 minutes |
| 37082 | astrainfinita | chore(Order/CompleteLatticeIntervals): use different default values for `sSup` and `sInf` | In a subsequent PR, some assumptions will be added to `ordConnectedSubsetConditionallyCompleteLinearOrderOfBotTop`. --- [](https://gitpod.io/from-referrer/) | t-order awaiting-author | 34/25 | Mathlib/Order/CompleteLatticeIntervals.lean | 1 | 5 | ['YaelDillies', 'astrainfinita', 'bryangingechen', 'github-actions'] | bryangingechen | 7 days ago | 7 days ago | 4 days |
| 35892 | vlad902 | feat(Data): lemmas for `List.bagInter` | Basic API lemmas for `List.bagInter` and correct a few misnamed lemmas.
Co-authored-by: Aristotle (Harmonic) |
t-data | 66/5 | Mathlib/Data/List/Lattice.lean,Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/Multiset/UnionInter.lean | 3 | 13 | ['Vierkantor', 'github-actions', 'vlad902'] | Vierkantor | 7 days ago | 7 days ago | 7 days |
| 35415 | joneugster | feat(Cache): enable partial cache in downstream projects | Migrated to fork from: #21238. Enable partial cache retrieval in downstream projects: `lake exe cache get MyProject.Basic` downloads only the relevant cache to build `MyProject/Basic.lean` --- ### Notes: - replaces: #21195 - should address: #8767 - should address: #20568 ### Completed: - [x] depends on: #21632 - [x] ~~depends on: #21663~~ - [x] depends on: #21666 - [x] depends on: #21701 - [x] depends on: #21703 - [x] depends on: #21704 - [x] depends on: #21705 - [x] depends on: #21707 - [x] depends on: #21711 - [x] depends on: #21750 - [x] depends on: #21815 - [x] depends on: #21816 - [x] depends on: #21817 - [x] depends on: #21818 - [x] depends on: #21822 - [x] depends on: #21830 - [x] depends on: #21848 - [x] depends on: #21834 [](https://gitpod.io/from-referrer/) | CI t-meta | 27/15 | Cache/Hashing.lean,Cache/IO.lean,Cache/Main.lean | 3 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 7 days ago | 41 days |
| 36868 | ADedecker | feat: Fréchet derivative of distributions, as a CLM | --- [](https://gitpod.io/from-referrer/) | WIP | 591/33 | Mathlib.lean,Mathlib/Analysis/Distribution/Distribution.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/Spaces/CompactConvergenceCLM.lean,Mathlib/Topology/Algebra/Module/Spaces/ContinuousLinearMap.lean,Mathlib/Topology/Algebra/Module/Spaces/FiniteDimensionCLM.lean,Mathlib/Topology/Algebra/Module/Spaces/UniformConvergenceCLM.lean | 8 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 7 days ago | unknown | 0 seconds |
| 30900 | vihdzp | feat: run-length encoding | --- - [x] depends on: #30898 Moved from #17105. [](https://gitpod.io/from-referrer/) | t-data awaiting-author | 168/0 | Mathlib.lean,Mathlib/Data/List/RunLength.lean,Mathlib/Data/List/SplitBy.lean | 3 | 10 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'plp127'] | joneugster | 7 days ago | 14 days ago | 57 days |
| 35417 | joneugster | refactor(Cache): use module name for file hash instead of non-resolved file path | This PR continues the work from #21842. Original PR: https://github.com/leanprover-community/mathlib4/pull/21842 - [ ] depends on: #35415 - [ ] depends on: #35414 --- | CI t-meta blocked-by-other-PR merge-conflict | 147/250 | Cache/Hashing.lean,Cache/IO.lean,Cache/Main.lean | 3 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 74 days ago | 9 minutes |
| 38436 | yuanyi-350 | refactor(Analysis): golf `Mathlib/Analysis/Convex/Between` | - rewrites `Wbtw.sameRay_vsub` via `sameRay_of_mem_segment` - rewrites `Wbtw.collinear` via `collinear_insert_of_mem_affineSpan_pair` - simplifies `wbtw_iff_sameRay_vsub` to a `simp` proof using segment lemmas Extracted from #37968 [](https://gitpod.io/from-referrer/) | t-analysis codex LLM-generated awaiting-author | 5/38 | Mathlib/Analysis/Convex/Between.lean | 1 | 3 | ['github-actions', 'grunweg', 'yuanyi-350'] | nobody | 7 days ago | 7 days ago | 9 hours |
| 38384 | Jun2M | chore(Combinatorics/Graph): per def "expose" tag | `Combinatorics/Graph/Basic.lean` has a file-wide `expose` tag. This PR moves it to defs that requires them. --- [](https://gitpod.io/from-referrer/) | large-import | 26/24 | Mathlib/Combinatorics/Graph/Basic.lean,Mathlib/Combinatorics/Graph/Subgraph.lean,Mathlib/Topology/CWComplex/Classical/Graph.lean | 3 | 4 | ['eric-wieser', 'github-actions', 'mathlib-bors'] | nobody | 7 days ago | 7 days ago | 1 day |
| 31008 | RemyDegenne | refactor: generalize the index of the process in the Doob decomposition | Generalize the index set for the Doob decomposition of an adapted process from Nat to a type with `LinearOrder`, `LocallyFiniteOrder`, `OrderBot`, `SuccOrder` (there is an order iso from that type to an interval of Nat). Motivation: to prove the Doob-Meyer decomposition we want to take a process indexed by [0,1] and consider sub-processes indexed by the dyadic points k*2^{-n} for a fixed n. We could use a process indexed by Nat, but we would have to invent values for k > 2^n while respecting the other properties of the process, and being able to index by the dyadics directly seems easier. --- [](https://gitpod.io/from-referrer/) | WIP t-measure-probability merge-conflict | 341/192 | Mathlib/Order/SuccPred/LinearLocallyFinite.lean,Mathlib/Probability/Martingale/Basic.lean,Mathlib/Probability/Martingale/BorelCantelli.lean,Mathlib/Probability/Martingale/Centering.lean,Mathlib/Probability/Martingale/OptionalStopping.lean,Mathlib/Probability/Martingale/Upcrossing.lean,Mathlib/Probability/Process/Adapted.lean | 7 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 7 days ago | 185 days ago | 2 seconds |
| 34075 | eric-wieser | feat: add a typeclass for the continuum hypothesis | This allows a proof from the Archive to be promoted to mathlib itself. The proof strategy of `iff_exists_sierpinski_pathological_pred` was written almost entirely with public Gemini 3 Thinking, and then manually corrected. --- [](https://gitpod.io/from-referrer/) | t-set-theory merge-conflict | 204/58 | Counterexamples/Phillips.lean,Mathlib.lean,Mathlib/SetTheory/Cardinal/ContinuumHypothesis.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 4 | 27 | ['b-mehta', 'eric-wieser', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'plp127', 'vihdzp'] | nobody | 7 days ago | 20 days ago | 12 hours |
| 37794 | EtienneC30 | feat: a sum of independent Bernoulli random variables is a binomial random variable | --- - [ ] depends on: #37736 - [ ] depends on: #37761 [](https://gitpod.io/from-referrer/) | t-measure-probability large-import blocked-by-other-PR merge-conflict | 743/40 | Mathlib.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Data/ENNReal/Action.lean,Mathlib/Data/Set/Card.lean,Mathlib/MeasureTheory/Measure/AEMeasurable.lean,Mathlib/MeasureTheory/Measure/Real.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Probability.lean,Mathlib/Probability/Distributions/Bernoulli.lean,Mathlib/Probability/Distributions/Binomial.lean,Mathlib/Probability/Distributions/Poisson/PoissonLimitThm.lean,Mathlib/Probability/Distributions/SetBernoulli.lean,Mathlib/Probability/HasLaw.lean,Mathlib/Probability/HasLawExists.lean,Mathlib/Probability/Independence/InfinitePi.lean,Mathlib/Probability/Moments/SubGaussian.lean,Mathlib/Probability/ProbabilityMassFunction/Binomial.lean,Mathlib/Probability/ProbabilityMassFunction/Constructions.lean,Mathlib/Probability/ProbabilityMassFunction/Integrals.lean | 18 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | unknown | 0 seconds |
| 36616 | EtienneC30 | feat: add predicates IsPreBrownian and IsBrownian | The predicate `IsPreBrownian X P` means that, under the probability measure `P`, the finite dimensional laws of the stochastic process `X` are those of the Brownian motion, given by `gaussianProjectiveFamily`. The predicate `IsBrownian X P` means that `X` is pre-Brownian and has almost-surely continuous paths. We prove that a centered Gaussian process with the right covariances is pre-Brownian, as well as basic invariance properties. We also prove that any pre-Brownian motion satisfies the weak Markov property. --- - [ ] depends on: #36472 - [x] depends on: #36615 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR brownian t-measure-probability large-import | 503/1 | Mathlib.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/Probability/BrownianMotion/Basic.lean,Mathlib/Probability/BrownianMotion/GaussianProjectiveFamily.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/HasLaw.lean,Mathlib/Probability/Moments/Basic.lean | 8 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 48 days ago | 1 second |
| 36803 | EtienneC30 | feat: pre-Brownian motion and independent increments | Prove that a pre-Brownian motion has independent increments, and that a process with independent increments and the right marginals is pre-Brownian. Use this to show that a (pre-)Brownian motion is stable by `neg`. --- - [x] depends on: #36745 - [ ] depends on: #36616 [](https://gitpod.io/from-referrer/) | brownian t-measure-probability blocked-by-other-PR large-import | 578/2 | Mathlib.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/Probability/BrownianMotion/Basic.lean,Mathlib/Probability/BrownianMotion/GaussianProjectiveFamily.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/HasLaw.lean,Mathlib/Probability/Moments/Basic.lean,Mathlib/Probability/Moments/Covariance.lean | 9 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 24 days ago | 50 minutes |
| 28291 | vasnesterov | feat(Tactic): tactic for computing asymptotics of real functions | It's an auxiliary PR that implements the entire `compute_asymptotics` tactic. I am spliting it into multiple small PRs. --- Tactic description: https://vasnesterov.github.io/compute_asymptotics Zulip announcement: [#announce > New tactic: `compute_asymptotics`](https://leanprover.zulipchat.com/#narrow/channel/113486-announce/topic/New.20tactic.3A.20.60compute_asymptotics.60/with/538639418) In this PR I implement the `compute_asymptotics` tactic. Its purpose is to compute asymptotics of functions from `ℝ` to `ℝ`. So far it is able to compute the limit of any function constructed using arithmetic operations (`+`, `-`, `*`, `/`, inversion), powers, logarithms, and exponents. ```lean import Mathlib.Tactic.ComputeAsymptotics open Real Filter Topology Asymptotics example : Tendsto (fun (x : ℝ) ↦ (1 + 6 * x⁻¹) ^ (7 * x)) atTop (𝓝 (exp 42)) := by compute_asymptotics example : (fun x ↦ x - 1 - log x) ~[𝓝[≠] 1] (fun x ↦ (x - 1) ^ 2 / 2) := by compute_asymptotics example (a b : ℝ) (h : a < b) : (fun x ↦ (x + x * log x) ^ a) =O[atTop] (fun x ↦ (x / log x) ^ b) := by compute_asymptotics example : (fun x ↦ log x) =o[𝓝[>] 0] (fun x ↦ Real.pi / (exp (Real.log 2 * x) - 1)) := by compute_asymptotics ``` For more examples see `compute_asymptotics.lean` in tests. ### TODO * Different domains in `compute_limit` as well. * Trigonometric functions and Gamma-function. ### References I am basically implementing [this article](https://www21.in.tum.de/~eberlm/pdfs/real_asymp.pdf) about computing asymptotics in Isabelle by Manuel Eberl. ### Small PRs Here's a few smaller PRs coming from this one, ordered by importance: - [ ] depends on: #37415 - [ ] depends on: #37342 - [x] depends on: #37418 - [x] depends on: #37411 - [x] depends on: #37414 - [x] depends on: #37419 - [x] depends on: #35072 - [x] depends on: #34922 - [x] depends on: #34356 - [x] depends on: #34422 - [x] depends on: #34403 - [x] depends on: #34311 [](https://gitpod.io/from-referrer/) | WIP t-analysis t-meta large-import blocked-by-other-PR | 11488/75 | Mathlib.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/SpecialFunctions/Complex/Analytic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ComputeAsymptotics.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/BasisM.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/CompareMS.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/CompareReal.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/ConstSimp.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/ConstSimpAttribute.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/ConvertDomain.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/Exp.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/LeadingMonomial.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/Log.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/MS.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/Misc.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/Normalization.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/Trimming.lean,Mathlib/Tactic/ComputeAsymptotics/Meta/ZeroOracle.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basic.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basis.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Corecursion.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Defs.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/LogBasis.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Monomial/Basic.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Monomial/LeadingMonomial.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Add.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Basic.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Exp.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Inv.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Log.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Mul.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Pow.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Operations/Powser.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Trimming.lean,MathlibTest/compute_asymptotics.lean | 38 | 23 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'ocfnash', 'vasnesterov'] | nobody | 7 days ago | 262 days ago | 54 seconds |
| 35976 | Phelixh | feat: add add Liu's uncertainty theory foundations (core/distribution/process modules) | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author LLM-generated | 2383/0 | Mathlib.lean,Mathlib/Uncertainty/Base.lean,Mathlib/Uncertainty/BaseCore.lean,Mathlib/Uncertainty/BaseDistribution.lean,Mathlib/Uncertainty/BaseProcess.lean,Mathlib/Uncertainty/Uncertainty.lean | 6 | 41 | ['Phelixh', 'copilot-pull-request-reviewer', 'github-actions', 'grunweg'] | nobody | 7 days ago | 13 days ago | 20 days |
| 38380 | linesthatinterlace | feat(Data/Set): add Set.diag API | Introduces `Set.diag (s : Set α) : Set (α × α) = {(a, a) | a ∈ s}` as the set-level companion to `Set.offDiag`, mirroring the existing `Finset.diag` / `Finset.offDiag` pairing. The type-level `Set.diagonal : Type* → Set (α × α)` is retained unchanged; `diag_univ : (univ : Set α).diag = diagonal α` (`@[simp]`) keeps it canonical when the underlying set is `univ`. Parallels to the existing `offDiag` API (`diag_mono`, `diag_nonempty`, `diag_eq_empty`, `diag_empty`, `diag_singleton`, `diag_subset_prod`, `diag_eq_sep_prod`, `diag_inter`, `diag_union`, `diag_insert`) plus bridges `diag_union_offDiag`, `disjoint_diag_offDiag`, `prod_sdiff_diag`, `prod_sdiff_offDiag`. Also `diag_eq_image`, `image_diag` (matching `Finset.image_diag`), `preimage_coe_coe_diag`, and `Finset.coe_diag`. Note `diag_union` and `diag_insert` are unconditional (no `Disjoint` / `a ∉ s` hypothesis). To free the `diag_` prefix for the set sense, the existing lemmas about the diagonal *map* `fun x => (x, x)` are renamed with deprecation aliases: `range_diag` → `range_diagMap`, `diag_preimage_prod` → `diagMap_preimage_prod`, `diag_preimage_prod_self` → `diagMap_preimage_prod_self`. `diag_image` and `preimage_coe_coe_diagonal` are marked `@[deprecated]`. | t-data | 124/15 | Mathlib/Data/Finset/Prod.lean,Mathlib/Data/Set/Operations.lean,Mathlib/Data/Set/Prod.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Compactness/Lindelof.lean,Mathlib/Topology/NhdsSet.lean | 7 | 2 | ['github-actions', 'linesthatinterlace'] | nobody | 7 days ago | 8 days ago | 8 days |
| 36605 | martinwintermath | feat(Geometry/Convex/Cone): Add lemmas about interaction of hull, span and negation | Prove lemmas about the interaction of hull, span and negation. Main additions: * `PointedCone.toSubmodule` that produces a submodule with the same support given that `-C = C`. Also the corresponding `CanLift` * `PointedCone.hull_neg_pair_eq_span_singleton` proving `hull R {-x, x} = R ∙ x` (simp lemma) * `PointedCone.span_eq_hull_neg_sup_hull` proving `span R s = hull R (-s) ⊔ hull R s` * `PointedCone.mem_span` proving `x ∈ span R C ↔ ∃ p, n ∈ C, x = p - n` Considerations: there are several ways to express that a convex cone is a submodule: * `-C = C` * `-C ≤ C` or `C ≤ -C` * `C = span R C` * `C = C.lineal` The consensus was that the the first option is the most direct way to express this property, which then allows to lift to a submodule. Co-authored by: Olivia Röhrig, Kilian Rueß, Artie Khovanov --- - [ ] depends on: #37464 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-convex-geometry | 88/12 | Mathlib/Geometry/Convex/Cone/Pointed.lean | 1 | 52 | ['artie2000', 'github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 30 days ago | 17 days |
| 38464 | xroblot | feat(FieldTheory/Galois/IsGaloisGroup): add mulEquivCongrOfDomain | If `G` and `H` are finite Galois groups for a domain extension `B/A`, then `G ≃* H`. This is the analogue of `IsGaloisGroup.mulEquivCongr` for field extensions, proved by passing to fraction fields via `IsGaloisGroup.toFractionRing`. The main additions are: - `IsGaloisGroup.mulEquivCongrOfDomain`: `G ≃* H` when both are finite Galois groups for `B/A` with `B` a domain. - `IsGaloisGroup.mulEquivCongrOfDomain_apply_smul` (`@[simp]`): the equivalence is compatible with the `G`-action on `B`. :robot: Prepared with Claude Code --- - [ ] depends on: #38377 | blocked-by-other-PR t-algebra | 168/41 | Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 7 days ago | 17 minutes |
| 37231 | lecopivo | feat(Tactic/FunProp): set up `fun_prop` for HasFDerivAt | Correctly set up `fun_prop` for `HasFDerivAt` and set up `deriv_simproc` for simplifying `fderiv ...`. - [ ] depends on: #37056 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import t-meta | 1329/228 | Mathlib.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousMultilinearMap.lean,Mathlib/Analysis/Calculus/FDeriv/Defs.lean,Mathlib/Analysis/Calculus/FDeriv/Pow.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/Analysis/SpecialFunctions/Arsinh.lean,Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean,Mathlib/Analysis/SpecialFunctions/Sqrt.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Elab.lean,Mathlib/Tactic/FunProp/Simproc.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/Measurability.lean,MathlibTest/fun_prop2.lean,MathlibTest/fun_prop_dev.lean,MathlibTest/fun_prop_dev_out_param.lean | 24 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 36 days ago | 7 minutes |
| 37901 | Raph-DG | feat(AlgebraicGeometry): Define algebraic cycles | In this PR we define the notion of algebraic cycles on a scheme, and define the pushforward of an algebraic cycle by a quasicompact morhphism. This was originally defined in #26304, but after some refactoring it was decided that it would be best to split this definition into a separate PR. - [ ] depends on: #26304 --- [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebraic-geometry | 250/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/AlgebraicCycle.lean,Mathlib/Topology/LocallyFinsupp/Pushforward.lean | 3 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 21 days ago | 6 minutes |
| 37031 | xroblot | feat(NumberField/CyclotomicField): inertia field of a cyclotomic field | Let `K = ℚ(ζₙ)` with `n = p ^ k * m` where `p` is prime and `¬ p ∣ m`. Then the subfield `F = ℚ(ζₘ)` is the inertia field of any prime `P` of `𝓞 K` lying over `p`. --- - [ ] depends on: #36733 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict t-number-theory | 581/21 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Galois.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/NumberTheory/RamificationInertia/Inertia.lean,Mathlib/NumberTheory/RamificationInertia/Ramification.lean | 9 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 39 days ago | 5 minutes |
| 38466 | Thmoas-Guan | feat(ModuleCat): some lemmas for `Ext` over `ModuleCat` | some lemmas for `Ext` over `ModuleCat` --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 67/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean | 4 | 1 | ['github-actions'] | nobody | 7 days ago | 7 days ago | 7 days |
| 38408 | b-mehta | chore(Mathlib): shake mathlib harder | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 141294/11434 | Mathlib/Algebra/AddConstMap/Basic.lean,Mathlib/Algebra/AddConstMap/Equiv.lean,Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/AffineMonoid/Basic.lean,Mathlib/Algebra/AffineMonoid/Embedding.lean,Mathlib/Algebra/AffineMonoid/Irreducible.lean,Mathlib/Algebra/AffineMonoid/UniqueSums.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Bilinear.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Epi.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Field.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Hom/Rat.lean,Mathlib/Algebra/Algebra/IsSimpleRing.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Opposite.lean,Mathlib/Algebra/Algebra/Pi.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/Algebra/Rat.lean,Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Algebra/Shrink.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Spectrum/Pi.lean,Mathlib/Algebra/Algebra/Spectrum/Quasispectrum.lean,Mathlib/Algebra/Algebra/StrictPositivity.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Algebra/Subalgebra/IsSimpleOrder.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Algebra/Subalgebra/Matrix.lean,Mathlib/Algebra/Algebra/Subalgebra/MulOpposite.lean,Mathlib/Algebra/Algebra/Subalgebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Order.lean,Mathlib/Algebra/Algebra/Subalgebra/Pi.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Subalgebra/Prod.lean,Mathlib/Algebra/Algebra/Subalgebra/Rank.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Algebra/Subalgebra/Unitization.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/Algebra/ZMod.lean,Mathlib/Algebra/AlgebraicCard.lean,Mathlib/Algebra/Azumaya/Basic.lean,Mathlib/Algebra/Azumaya/Defs.lean,Mathlib/Algebra/Azumaya/Matrix.lean,Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Balance.lean,Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/BigOperators/Field.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/BigOperators/Finsupp/Fin.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/BigOperators/Group/Finset/Gaps.lean,Mathlib/Algebra/BigOperators/Group/Finset/Indicator.lean,Mathlib/Algebra/BigOperators/Group/Finset/Interval.lean,Mathlib/Algebra/BigOperators/Group/Finset/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Finset/Pi.lean,Mathlib/Algebra/BigOperators/Group/Finset/Piecewise.lean,Mathlib/Algebra/BigOperators/Group/Finset/Powerset.lean,Mathlib/Algebra/BigOperators/Group/Finset/Preimage.lean,Mathlib/Algebra/BigOperators/Group/Finset/Sigma.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Defs.lean,Mathlib/Algebra/BigOperators/GroupWithZero/Action.lean,Mathlib/Algebra/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/ModEq.lean,Mathlib/Algebra/BigOperators/Module.lean,Mathlib/Algebra/BigOperators/NatAntidiagonal.lean,Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/BigOperators/Ring/Multiset.lean,Mathlib/Algebra/BigOperators/Ring/Nat.lean,Mathlib/Algebra/BigOperators/RingEquiv.lean,Mathlib/Algebra/BigOperators/Sym.lean,Mathlib/Algebra/BigOperators/WithTop.lean,Mathlib/Algebra/BrauerGroup/Defs.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/AlgCat/Limits.lean,Mathlib/Algebra/Category/AlgCat/Monoidal.lean,Mathlib/Algebra/Category/AlgCat/Symmetric.lean,Mathlib/Algebra/Category/BialgCat/Basic.lean,Mathlib/Algebra/Category/BialgCat/Monoidal.lean,Mathlib/Algebra/Category/BoolRing.lean | 7930 | 3 | ['Kha', 'b-mehta', 'bryangingechen'] | nobody | 7 days ago | unknown | 0 seconds |
| 30374 | FLDutchmann | feat(Tactic): `algebra` and `polynomial` tactic suite | Implement a suite of tactics for normalizing expressions in an algebra over a ring. Handles all of the normal `ring` operations as well as scalar multiplication over a fixed base ring. Using these, implement tactics to normalize `(Mv)Polynomial` expressions into a sum-of-monomials form. Specifically, * `algebra` proves equality of expressions in an algebra over a ring like `ring1` * `algebra_nf` puts expressions in an algebra into a normal form, like `ring_nf` * `match_scalars_alg` (name pending) closes an equality goal by calling `algebra_nf` and creating side goals equating matching coefficients in the base ring. Like `match_scalars`. * `polynomial` proves equality of (mv)polynomials * `polynomial_nf` expands polynomials into a sum-of-monomials form, combining coefficients in the base ring (e.g. `C a * X + C b * X` normalizes to `C(a+b) * X` * `match_coefficients` expands polynomials and produces side goals equating matching coefficients. - [x] depends on: #31506 - [x] depends on: #31508 - [ ] depends on: #31513 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author blocked-by-other-PR t-meta | 2371/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Algebra.lean,Mathlib/Tactic/Algebra/Lemmas.lean,Mathlib/Tactic/Polynomial.lean,Mathlib/Tactic/Polynomial/Core.lean,MathlibTest/Polynomial.lean,MathlibTest/algebra.lean,scripts/noshake.json | 9 | 7 | ['FLDutchmann', 'github-actions', 'hrmacbeth', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 days ago | unknown | 0 seconds |
| 38153 | xroblot | chore(IsGaloisGroup): refactor `IsGaloisGroup.quotient` | --- - [ ] depends on: #38377 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 351/94 | Mathlib/Algebra/Algebra/Basic.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 5 | 7 | ['github-actions', 'mathlib-dependent-issues', 'tb65536'] | riccardobrasca | 7 days ago | 9 days ago | 24 minutes |
| 37766 | chrisflav | feat(AlgebraicGeometry): restriction of quasi-coherent sheaf is quasi-coherent | --- - [ ] depends on: #37773 - [ ] depends on: #37775 - [ ] depends on: #38181 [](https://gitpod.io/from-referrer/) | WIP t-algebraic-geometry large-import | 342/0 | Mathlib/Algebra/Category/ModuleCat/Sheaf/Quasicoherent.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/CategoryTheory/Discrete/Basic.lean,Mathlib/CategoryTheory/Limits/Preorder.lean | 5 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 7 days ago | 24 days ago | 2 seconds |
| 36853 | matthunz | feat(CategoryTheory/Monoidal/Braded/Traced): add `TracedCategory` class | Adds a `TracedCategory` class following [A. Joyal and R. Street and D. R. Verity, *Traced monoidal categories*](https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/abs/traced-monoidal-categories/2BE85628D269D9FABAB41B6364E117C8#article): ```lean /-- A traced symmetric monoidal category. -/ class TracedCategory (C : Type u) [Category.{v} C] [MonoidalCategory.{v} C] [SymmetricCategory.{v} C] where /-- The trace operator. -/ trace : ∀ {A B : C} (W : C), (A ⊗ W ⟶ B ⊗ W) → (A ⟶ B) /-- Left tightening: sliding a morphism past the trace on the left. -/ trace_naturality_left : ∀ {A A' B : C} (W : C) (f : A' ⟶ A) (g : A ⊗ W ⟶ B ⊗ W), trace W (f ▷ W ≫ g) = f ≫ trace W g := by cat_disch /-- Right tightening: sliding a morphism past the trace on the right. -/ trace_naturality_right : ∀ {A B B' : C} (W : C) (f : A ⊗ W ⟶ B ⊗ W) (g : B ⟶ B'), trace W (f ≫ g ▷ W) = trace W f ≫ g := by cat_disch /-- Sliding: an endomorphism on the feedback wire slides past the trace. -/ trace_dinaturality : ∀ {A B W : C} (f : A ⊗ W ⟶ B ⊗ W) (h : W ⟶ W), trace W (f ≫ B ◁ h) = trace W (A ◁ h ≫ f) := by cat_disch /-- Superposing: trace commutes with left tensoring by a bystander object. -/ trace_superposing : ∀ {A B : C} (C' W : C) (f : A ⊗ W ⟶ B ⊗ W), C' ◁ trace W f = trace W ((α_ C' A W).hom ≫ C' ◁ f ≫ (α_ C' B W).inv) := by cat_disch /-- Vanishing I: trace over the tensor unit is the morphism itself (up to unitors). -/ trace_vanishing_one : ∀ {A B : C} (f : A ⊗ 𝟙_ C ⟶ B ⊗ 𝟙_ C), trace (𝟙_ C) f = (ρ_ A).inv ≫ f ≫ (ρ_ B).hom := by cat_disch /-- Vanishing II: trace over a tensor product equals iterated trace. -/ trace_vanishing_two : ∀ {A B X Y : C} (f : A ⊗ (X ⊗ Y) ⟶ B ⊗ (X ⊗ Y)), trace (X ⊗ Y) f = trace X (trace Y ((α_ A X Y).hom ≫ f ≫ (α_ B X Y).inv)) := by cat_disch /-- Yanking: the trace of the braiding is the identity. -/ trace_yanking : ∀ (W : C), trace W (β_ W W).hom = 𝟙 W := by cat_disch ``` ## Motivation `TracedCategory` can be used for denoting things like electric circuits, which require a traced symmetric monoidal category for the wire graph network. ## Future work - `instance [CompactClosedCategory C] : TracedCategory C` - possible notation such as `Tr_[W] f` --- [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor awaiting-author merge-conflict | 237/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Braided/Traced.lean,Mathlib/CategoryTheory/Monoidal/Rigid/Traced.lean,docs/references.bib | 4 | 5 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'matthunz'] | nobody | 7 days ago | 42 days ago | 7 hours |
| 37415 | vasnesterov | feat(Tactic/ComputeAsymptotics/Multiseries): compute limits of `Monomial`s | Prove * `UnitMonomial.logToFun_isEquivalent_of_nonzero_head`: `log m.toFun` is asymptotically equivalent to its first summand - `m[0] • log basis[0]` if `m[0] ≠ 0`. Using this theorem we can prove that the asymptotic behavior of a monomial is determined by its first non-zero exponent. * `toFun_tendsto_top_of_FirstNonzeroIsPos` and its variants: used to infer the limit of `t.toFun` from `FirstNonzeroIsPos`/`FirstNonzeroIsNeg`/`AllZero`. * `IsLittleO_of_lt_exps` and its variants: used to asymptotically compare two monomials. --- - [x] depends on: #37411 This is a part of the `compute_asymptotics` tactic (#28291). [](https://gitpod.io/from-referrer/) | t-meta | 380/1 | Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basis.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Monomial/Basic.lean | 2 | 3 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | joneugster | 7 days ago | 7 days ago | 7 days |
| 37851 | gaetanserre | feat(Category/Kernel): `Stoch` is a positive Markov category | Add several `Deterministic` instances for `SFinKer` and `Stoch` associators, unitors, braiding, counit, and comul morphisms. In particular, all isomorphisms in `Stoch` are `Deterministic`. To show that, I created `Kernel.IsDeterministicKernel` that encodes that a kernel is _deterministic_, in the sense of Markov category (see Definition 10.1 of _A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics_, Fritz 2020). I then followed the proof of Example 11.25 to show that `Stoch` is a positive Markov category (see `Kernel.parallelComp_id_comp_copy_comp`), inducing that all isomorphisms in `Stoch` are `Deterministic`. - [ ] depends on: #38211 - [ ] depends on: #38212 --- [](https://gitpod.io/from-referrer/) | t-measure-probability t-category-theory blocked-by-other-PR merge-conflict | 414/38 | Mathlib.lean,Mathlib/CategoryTheory/MarkovCategory/Positive.lean,Mathlib/CategoryTheory/Monoidal/Widesubcategory.lean,Mathlib/Probability/Kernel/Category/SFinKer.lean,Mathlib/Probability/Kernel/Category/Stoch.lean,Mathlib/Probability/Kernel/Composition/KernelLemmas.lean,Mathlib/Probability/Kernel/Deterministic.lean | 7 | 12 | ['RemyDegenne', 'dagurtomas', 'gaetanserre', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | RemyDegenne | 7 days ago | 15 days ago | 5 days |
| 37299 | XC0R | feat(NumberTheory): Chebyshev's lower bound on primorial | ## Summary Prove `primorial(n) ≥ 2^(n/2)` for all `n ≥ 2` (Chebyshev's 1852 lower bound). This is the lower bound complement to `primorial_le_four_pow`. Addresses the TODO at `Chebyshev.lean` line 50: "Prove Chebyshev's lower bound." ### New file: `Mathlib/NumberTheory/PrimorialLowerBound.lean` **Main theorems:** - `two_pow_le_primorial`: `2 ^ n ≤ primorial (2 * n)` for `n ≥ 29` - `two_pow_div_two_le_primorial`: `2 ^ (n / 2) ≤ primorial n` for `n ≥ 2` **Key intermediates:** - `centralBinom_le_pow_mul_primorial`: `C(2n,n) ≤ (2n)^{π(√(2n)+1)} * primorial(2n)` - `eight_mul_sq_add_le_two_pow`: `8u² + 16u + 8 ≤ 2^u` for `u ≥ 10` ### Proof technique Central binomial decomposition: from `four_pow_lt_mul_centralBinom` and `factorization_choose_le_log`, bound `C(2n,n)` above by `(2n)^{π(√(2n)+1)} * primorial(2n)`. Rearranging gives `primorial(2n) ≥ 2^n` for `n ≥ 29`. Base cases by `norm_num` + `decide`, large `n` analytically via `√n` factoring. ### AI disclosure Claude (Anthropic) was used as a coding assistant for Lean tactic exploration, file structuring, and CI debugging. All proof strategy, mathematical content, and final code have been reviewed and are understood by the author. | t-number-theory new-contributor awaiting-author | 230/5 | Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/Primorial.lean,Mathlib/NumberTheory/SmoothNumbers.lean | 3 | 52 | ['MichaelStollBayreuth', 'Parcly-Taxel', 'XC0R', 'github-actions', 'wwylele'] | MichaelStollBayreuth | 7 days ago | 21 days ago | 13 days |
| 34728 | j-loreaux | feat: continuous linear equivalence between continuous `ℝ`- and `𝕜`-linear functionals (in either the strong or weak-⋆ topologies) | This realizes the map `StrongDual.extendRCLikeₗ`, after pre- and post-composing so that it is an equivalence between the weak duals, as a *continuous* linear equivalence. In addition, when the space is a topological vector space, we realize `StrongDual.extendRCLikeₗ` as a *continuous* linear equivalence between the strong duals. --- - [x] depends on: #34543 The placement in `Analysis/Normed/Module/WeakDual` seems suboptimal because this has nothing to do with the norm. This is because `WeakDual.toStrongDual` is already in this file, which should probably be moved to `Topology/Algebra/Module/WeakDual`. However, even if that moves, the declarations added in this PR cannot easily go with it because they involve `RCLike`. Potentially, they could move to `Analysis/RCLike/Extend` if that file gained the `Topology/Algebra/Module/WeakDual` import. --- [](https://gitpod.io/from-referrer/) | t-analysis awaiting-author | 93/2 | Mathlib/Analysis/Normed/Module/RCLike/Extend.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean | 2 | 19 | ['ADedecker', 'github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'themathqueen'] | urkud | 7 days ago | 7 days ago | 43 days |
| 34019 | adomani | feat: global syntax linter | This linter is very unstable when editing interactively a file, since it inspects pairs of commands, rather than individual commands. For this reason, the linter should only run in CI. --- [](https://gitpod.io/from-referrer/) | t-linter | 169/0 | Mathlib.lean,Mathlib/Init.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/GlobalSyntax.lean | 4 | 7 | ['SnirBroshi', 'adomani', 'bryangingechen', 'github-actions', 'mathlib-splicebot'] | nobody | 7 days ago | unknown | 0 seconds |
| 38326 | Jun2M | feat(Combinatorics/Graph): Degree | This PR adds definition of `incFun`, a nat function counting how many times an edge is incident to a vertex (2 if it is loop), and `eDegree` & `degree`, enat and nat valued degree function as a tsum of `incFun`.
Co-authored-by: Peter Nelson |
blocked-by-other-PR t-combinatorics | 194/22 | Mathlib.lean,Mathlib/Combinatorics/Graph/Basic.lean,Mathlib/Combinatorics/Graph/Degree/Defs.lean,Mathlib/Combinatorics/Graph/Subgraph.lean,Mathlib/Topology/CWComplex/Classical/Graph.lean | 5 | 6 | ['SnirBroshi', 'b-mehta', 'github-actions', 'mathlib-dependent-issues'] | nobody | 7 days ago | 10 days ago | 22 minutes |
| 38478 | dagurtomas | feat(Tactic/CategoryTheory): op attribute | Adding `@[op]` to a lemma named `H` of shape `∀ .., f = g`, where `f` and `g` are morphisms in some category `C`, creates a new lemma named `H_op` by applying `Quiver.Hom.op` to both sides and then simplifying with `simp only [op_comp, op_id]`. This PR also adds `op_of%`, and adjusts `@[map]` so that `@[op (attr := map)]` works for equalities of morphisms in opposite categories. --- - [ ] depends on: #37183 [](https://gitpod.io/from-referrer/) | LLM-generated blocked-by-other-PR t-category-theory t-meta | 491/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,Mathlib/Tactic/CategoryTheory/Op.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapSimp.lean,MathlibTest/CategoryTheory/Op.lean | 7 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 6 days ago | 7 days ago | 5 minutes |
| 38142 | SnirBroshi | feat(Order/SuccPred/CompleteLinearOrder): generalize `csSup_mem_of_not_isSuccLimit` | Given `s.Nonempty` and `BddAbove s` we can conclude `sSup s ∈ s` using either: - `csSup_mem_of_not_isSuccPrelimit`, given `ConditionallyCompleteLinearOrder` and `¬IsSuccPrelimit (sSup s)` - `csSup_mem_of_not_isSuccLimit`, given `ConditionallyCompleteLinearOrderBot` and `¬IsSuccLimit (sSup s)` We generalize both to a theorem that requires `ConditionallyCompleteLinearOrder` and `¬IsSuccLimit (sSup s)`. This creates 8 theorems that require `¬IsSuccPrelimit` but are now easily proved with the `¬IsSuccLimit` theorems, we replace `csSup_mem_of_not_isSuccPrelimit`/`exists_eq_ciSup_of_not_isSuccPrelimit` with their primed `ConditionallyCompleteLinearOrderBot` theorems, and deprecates the other 6. Tags a couple of random `to_dual`s (in `ConditionallyCompleteLattice/Basic.lean`) to let us `to_dual`ize the new lemmas. --- ~~Should we also deprecate the 8 theorems that require `¬IsSuccPrelimit` and now use `mt`?~~ [](https://gitpod.io/from-referrer/) | t-order | 56/45 | Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/SetTheory/Cardinal/Order.lean | 3 | 8 | ['SnirBroshi', 'github-actions', 'vihdzp'] | nobody | 6 days ago | 6 days ago | 14 days |
| 38424 | SnirBroshi | feat(Combinatorics/SimpleGraph/Coloring/VertexColoring): `chromaticNumber ⊤` and other small lemmas | - Golf `isEmpty_of_colorable_zero` and rename to `Colorable.isEmpty` - `colorable_one_iff`: `G.Colorable 1 ↔ G = ⊥` - Combine `chromaticNumber_eq_zero_of_isEmpty`/`isEmpty_of_chromaticNumber_eq_zero` into `chromaticNumber_eq_zero_iff : G.chromaticNumber = 0 ↔ IsEmpty V` and deprecate the `→` side - `chromaticNumber_top_eq_enat_card`: `chromaticNumber ⊤ = ENat.card V` - Tag `chromaticNumber_top_eq_top_of_infinite`/`chromaticNumber_eq_zero_of_isEmpty` as `simp` - Golf `chromaticNumber_eq_one_iff` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 33/26 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean | 1 | 3 | ['SnirBroshi', 'github-actions', 'vlad902'] | nobody | 6 days ago | 8 days ago | 8 days |
| 37276 | dagurtomas | chore(CategoryTheory): use the extended map attribute | --- - [ ] depends on: #37197 - [ ] depends on: #37275 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR merge-conflict | 970/206 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Free.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/PullbackFree.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/PushforwardContinuous.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/Quasicoherent.lean,Mathlib/Algebra/Homology/DerivedCategory/ShortExact.lean,Mathlib/Algebra/Homology/HomotopyCategory.lean,Mathlib/Algebra/Homology/HomotopyCategory/Pretriangulated.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShortExact.lean,Mathlib/Algebra/Homology/ShortComplex/Basic.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean,Mathlib/AlgebraicGeometry/Restrict.lean,Mathlib/AlgebraicGeometry/Stalk.lean,Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Category/Preorder.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/CategoryTheory/Functor/Trifunctor.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/CategoryTheory/Limits/HasLimits.lean,Mathlib/CategoryTheory/Limits/Shapes/BinaryProducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Kernels.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/PullbackCone.lean,Mathlib/CategoryTheory/Localization/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution.lean,Mathlib/CategoryTheory/Monoidal/DayConvolution/Braided.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/NaturalTransformation.lean,Mathlib/CategoryTheory/NatIso.lean,Mathlib/CategoryTheory/NatTrans.lean,Mathlib/CategoryTheory/Sites/Continuous.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataPrime.lean,Mathlib/CategoryTheory/Sites/EqualizerSheafCondition.lean,Mathlib/CategoryTheory/Sites/Equivalence.lean,Mathlib/CategoryTheory/Triangulated/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,Mathlib/Tactic/CategoryTheory/MapOpposite.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapPreorder.lean,MathlibTest/CategoryTheory/MapSimp.lean,MathlibTest/CategoryTheory/MapSimpCheck.lean | 46 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 6 days ago | 35 days ago | 1 second |
| 36824 | j-loreaux | feat: generalize argument of `IsOrderedMonoid` from `CommMonoid` to `CommSemigroup` | --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 76/50 | Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Group/Opposite.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Prod.lean,Mathlib/Algebra/Order/Monoid/Submonoid.lean,Mathlib/Algebra/Order/Monoid/TypeTags.lean,Mathlib/Algebra/Order/Pi.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/Order/Filter/Germ/OrderedMonoid.lean,Mathlib/Topology/ContinuousMap/Lattice.lean | 14 | 4 | ['github-actions', 'j-loreaux', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 6 days ago | 44 days ago | 10 minutes |
| 38220 | wwylele | feat(LinearAlgebra/AffineSpace): shifting a subspace towards a point | Split off from #36018 and excluded the Simplex part. This is preparing to calculate the volume of a simplex by integrating the cross-section created by shifting the base plane. Part of https://github.com/leanprover-community/mathlib4/pull/34826. --- [](https://gitpod.io/from-referrer/) | t-algebra | 137/0 | Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean | 2 | 1 | ['github-actions'] | nobody | 6 days ago | 12 days ago | 12 days |
| 37826 | EtienneC30 | feat: lemmas about HasLaw | - If `X` has law `µ` then `P {ω | p (X ω)} = μ {x | p x}`. - If there is a random variable `X` with law `μ` such that `f(X)` has law `ν`, then for any random variable `Y` with law `μ`, `f(Y)` has law `ν`. - Composition of a random variable with a measure-preserving function. --- - [x] depends on: #37828 [](https://gitpod.io/from-referrer/) | t-measure-probability | 35/2 | Mathlib/Probability/HasLaw.lean | 1 | 3 | ['RemyDegenne', 'github-actions', 'mathlib-dependent-issues'] | kex-y | 6 days ago | 7 days ago | 7 days |
| 37848 | rwst | feat(RingTheory/PowerSeries/Log): log and exp as inverses | --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 87/0 | Mathlib/RingTheory/PowerSeries/Log.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean | 2 | 1 | ['github-actions'] | chrisflav | 6 days ago | 22 days ago | 22 days |
| 38456 | yuanyi-350 | refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Function/L2Space` | - rewrites `inner_indicatorConstLp_eq_setIntegral_inner` to pass through `integral_indicator` and a single `integral_congr_ae` argument - reuses `indicatorConstLp_coeFn` directly, replacing the separate `s` and `sᶜ` integral arguments with a shorter pointwise proof Extracted from #38104 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-measure-probability | 5/23 | Mathlib/MeasureTheory/Function/L2Space.lean | 1 | 4 | ['github-actions', 'leanprover-radar', 'yuanyi-350'] | kex-y | 6 days ago | 7 days ago | 7 days |
| 30526 | SnirBroshi | chore(Logic/Relation): use `≤` to spell subrelation | Replace every `∀ x y, r x y → r' x y` with `r ≤ r'` --- NOTE: this PR began as an effort to use `Subrelation` since `≤` wasn't available in this file, but it was agreed on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2330526.20use.20Subrelation.20in.20Mathlib.2ELogic.2ERelation/with/546572676) to instead make `≤` available there. [](https://gitpod.io/from-referrer/) | t-logic | 158/143 | Mathlib.lean,Mathlib/Algebra/Category/Grp/FilteredColimits.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/CategoryTheory/Action.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Filtered/Connected.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/Types/Coequalizers.lean,Mathlib/CategoryTheory/Limits/Types/Filtered.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Computability/TuringMachine/Config.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/Logic/Relation.lean,Mathlib/Order/Basic.lean,Mathlib/Order/Defs/Prop.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/Topology/Gluing.lean | 22 | 21 | ['SnirBroshi', 'Vierkantor', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'thorimur', 'vihdzp'] | Vierkantor | 6 days ago | 7 days ago | 69 days |
| 38442 | Parcly-Taxel | feat: arbitrary-order induction on `Nat` | This can be used as e.g. ```lean induction n using stepInduction 3 with | base n hn => ... | step n ih => ... ``` | t-data | 10/2 | Mathlib/Data/Nat/Init.lean | 1 | 3 | ['Parcly-Taxel', 'SnirBroshi', 'github-actions'] | nobody | 6 days ago | 7 days ago | 7 days |
| 38489 | Jun2M | feat(Topology/Algebra/InfiniteSum): Generalize ENNReal lemmas | This PR generalizes many theorems in Topology/Algebra/InfiniteSum/ENNReal.lean from `ENNREal` to any type that satisfies a list of order-related instances, mostly `[CommMonoid α] [CompleteLattice α] [CanonicallyOrderedMul α] [TopologicalSpace α] [SupConvergenceClass α]` Deprecation of the original `ENNReal` lemmas are done in the next PR: #38193. Related Zulip thread: [#Is there code for X? > Summing `ENat`s without topology](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/588756615) --- [](https://gitpod.io/from-referrer/) | 191/1 | Mathlib/Probability/ProbabilityMassFunction/Monad.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean | 2 | 2 | ['SnirBroshi', 'github-actions'] | nobody | 6 days ago | 6 days ago | 6 days | |
| 34507 | metakunt | feat(NumberTheory/AKSPrimality): Adds the AKS primality test | Adds the completed proof for the AKS primality test. Everything except the final theorem is marked private as it's only needed for the final proof. Also everything except the final theorem is namespaced with AKS. ---- Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Aks.20primality.20Theorem.206.2E1.20Claim.20.28i.29.20proven | t-number-theory | 645/0 | Mathlib.lean,Mathlib/NumberTheory/AKSPrimality.lean | 2 | 52 | ['MichaelStollBayreuth', 'github-actions', 'jcommelin', 'kim-em', 'metakunt', 'qawbecrdtey', 'tb65536', 'vihdzp'] | tb65536 | 6 days ago | 33 days ago | 63 days |
| 38498 | SnirBroshi | feat(Order/RelIso/Basic): lift a function to an order morphism into `Relation.Map` or from `Function.onFun` | For an `α`-relation `r` we have: ``` mapRelHom (f : α → β) : r →r Relation.Map r f f mapRelEmbedding (f : α ↪ β) : r ↪r Relation.Map r f f mapRelIso (f : α ≃ β) : r ≃r Relation.Map r f f ``` For a `β`-relation `r` we have: ``` onFunRelHom (f : α → β) : r.onFun f →r r onFunRelEmbedding (f : α ↪ β) : r.onFun f ↪r r onFunRelIso (f : α ≃ β) : r.onFun f ≃r r ``` --- These are pretty similar to `SimpleGraph.{Embedding/Iso}.map` and `SimpleGraph.{Hom/Embedding/Iso}.comap`, as [`comap`](https://github.com/leanprover-community/mathlib4/blob/9268b22206b0425419498769f780a91dee03bcf3/Mathlib/Combinatorics/SimpleGraph/Maps.lean#L117-L118) on graphs is a wrapper around `onFun`, and [`map`](https://github.com/leanprover-community/mathlib4/blob/9268b22206b0425419498769f780a91dee03bcf3/Mathlib/Combinatorics/SimpleGraph/Maps.lean#L57-L58) on graphs is *almost* a wrapper around `Relation.Map`. btw `@[simps]` is angry at me when I try to use it on the structures that use spread syntax. [](https://gitpod.io/from-referrer/) | t-order | 42/0 | Mathlib/Order/RelIso/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 6 days ago | 6 days ago | 6 days |
| 36313 | SproutSeeds | feat(Inversion): cobounded tendsto near center | Part of #5939 Add `tendsto_inversion_nhdsNE_center_cobounded` in `Mathlib/Geometry/Euclidean/Inversion/Basic.lean`, proving `Tendsto (inversion c R) (𝓝[≠] c) (Bornology.cobounded P)` for `R ≠ 0`. Tools used: Codex 5.3 extra high --- Happy to adjust naming, placement, or proof style based on maintainer preference. | t-euclidean-geometry new-contributor LLM-generated awaiting-author | 28/0 | Mathlib/Geometry/Euclidean/Inversion/Basic.lean | 1 | 11 | ['SproutSeeds', 'euprunin', 'github-actions', 'jsm28', 'kbuzzard', 'ocfnash'] | jsm28 | 6 days ago | 38 days ago | 6 days |
| 38488 | b-mehta | feat(Data/Finset/Card): iterating a function's image on a finite set stabilises | ...and does so in a bounded number of steps (which is why this is Finset-specific). In a later PR, I'll add this for endofunctions on a fintype, as well as add a Set.Finite version. --- [](https://gitpod.io/from-referrer/) | t-data | 40/0 | Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Image.lean | 2 | 16 | ['SnirBroshi', 'b-mehta', 'github-actions'] | nobody | 6 days ago | 6 days ago | 6 days |
| 37521 | jessealama | feat(Data/Part): add Part.bind_eq_some_iff | Add `Part.bind_eq_some_iff`, the `Part` analogue of `Option.bind_eq_some_iff`. Noticed this small gap while working on some equivalence proofs with partial functions. | t-data | 6/0 | Mathlib/Data/Part.lean | 1 | 3 | ['github-actions', 'jessealama', 'vihdzp'] | TwoFX | 6 days ago | 29 days ago | 29 days |
| 29713 | jessealama | feat(Algebra/Homology): add Euler–Poincaré formula | This PR builds on the generalized Euler characteristic framework from #31121 to prove the Euler-Poincaré formula for chain complexes. PR #31121 defines the Euler characteristic for general homological complexes. This PR specializes those definitions to ℤ-indexed chain complexes and proves the main Euler-Poincaré theorem. ### Main result (in `EulerPoincare.lean`) * `ChainComplex.eulerChar_eq_homologyEulerChar`: For ℤ-indexed bounded chain complexes of finite-dimensional modules over a division ring, the alternating sum of chain dimensions equals the alternating sum of homology dimensions. ### Supporting lemmas The file also provides dimension lemmas generalized to arbitrary `HomologicalComplex (ModuleCat k) c` (not just ℤ-indexed chain complexes): * `HomologicalComplex.dFrom_zero_range` / `dTo_zero_range`: zero range when the target/source object is zero * `HomologicalComplex.dFrom_range_finrank_eq_d` / `dTo_range_finrank_eq_d`: range of `dFrom`/`dTo` has the same dimension as the underlying differential * `HomologicalComplex.range_dTo_le_ker_dFrom`: range of `dTo` is contained in the kernel of `dFrom` --- - [ ] depends on: #38483 (`Antiperiodic.sum_Ico_shift` and bilinear cancellation lemma) Builds on: #31121 Related to: #29639, #29643, #29646 | awaiting-author t-algebra new-contributor blocked-by-other-PR | 319/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Periodic.lean,Mathlib/Algebra/Homology/EulerPoincare.lean | 3 | 26 | ['github-actions', 'jessealama', 'joelriou', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 6 days ago | 188 days ago | 35 days |
| 35504 | JoaBjo | feat(Probability/Distributions/Exponential): add MGF, moments, and memoryless property | feat(Probability/Distributions/Exponential): add MGF, moments, and memoryless property Add the main analytic results for the exponential distribution: - moment-generating function `mgf id (expMeasure r) t = r / (r - t)` for `t < r` - mean `∫ x, x ∂(expMeasure r) = r⁻¹` - variance `Var[id; expMeasure r] = r⁻¹ ^ 2` - `ℒp` membership for all `p` - tail probability `P(X > x) = exp (-(r * x))` - memoryless property `P(X > s + t | X > s) = P(X > t)` The MGF is computed by reducing to the known improper integral `∫ exp(c * x)` on `Ioi`, and integrability is deduced by contradiction from the positive closed-form value. The mean and variance are computed via the Gamma function integral `∫₀^∞ x^(n-1) exp(-r x) dx = Γ(n) / rⁿ`. The memoryless property follows from the exponential identity `exp(-(r(s+t))) = exp(-rt) * exp(-rs)`. --- [](https://gitpod.io/from-referrer/) | new-contributor t-measure-probability | 200/0 | Mathlib/Probability/Distributions/Exponential.lean | 1 | 6 | ['JoaBjo', 'Timeroot', 'github-actions'] | kex-y | 6 days ago | 6 days ago | 22 days |
| 38344 | robo7179 | feat(SimpleGraph/Coloring/VertexColoring): Matching is 2 colorable | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 51/0 | Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean | 1 | 5 | ['SnirBroshi', 'github-actions', 'vlad902'] | nobody | 6 days ago | 9 days ago | 9 days |
| 38512 | gasparattila | chore(MeasureTheory): replace remaining `@[measurability]` attributes by `@[fun_prop]` | Since #30511, the `@[measurability]` attribute is equivalent to `@[fun_prop]` when applied to lemmas about measurability of functions. This PR replaces these attributes by `@[fun_prop]` and adds a warning for this use of `@[measurability]`. Note that `@[measurability]` is still used for lemmas about measurability of sets. --- [](https://gitpod.io/from-referrer/) | 45/41 | Mathlib/Analysis/Complex/UpperHalfPlane/Measure.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/AEStronglyMeasurable.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Group/Arithmetic.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/Measure/AEMeasurable.lean,Mathlib/MeasureTheory/Order/Lattice.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Tactic/Measurability.lean | 9 | 1 | ['github-actions'] | nobody | 6 days ago | 6 days ago | 6 days | |
| 37006 | hakii6 | feat(LinearAlgebra/Matrix/Block, Analysis/Normed/Algebra/MatrixExponential): add BlockTriangular.pow and BlockTriangular.exp | # Summary Add BlockTriangular.pow and BlockTriangular.exp for proving "det (exp A) = exp (trace A)" # Which part using LLM The part I used LLM is for 1. Searching duplicated theorems and lemmas I may missed (I already search them myself first). 2. Help me handle the "variables and signatures", the "letI" part, some of lemmas and theorems trivial but hard to find the true one. 3. After I finished, let them helped me check the structure match the disciplines of mathlib. 4. Check the steps PR match the disciplines of mathlib Most things above are done by me first, then let them to make sure I'm not missing something. # More context More context can be found in a topic in "# new member" in Zulip [#new members > (Matrix and NormedSpace.exp) | det (exp A) = exp (trace A)](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/.28Matrix.20and.20NormedSpace.2Eexp.29.20.7C.20det.20.28exp.20A.29.20.3D.20exp.20.28trace.20A.29/with/580964688) | new-contributor LLM-generated t-algebra awaiting-author | 54/1 | Mathlib/Analysis/Normed/Algebra/MatrixExponential.lean,Mathlib/LinearAlgebra/Matrix/Block.lean,Mathlib/Topology/Instances/Matrix.lean | 3 | 64 | ['SnirBroshi', 'eric-wieser', 'github-actions', 'hakii6', 'themathqueen', 'wwylele'] | themathqueen | 6 days ago | 6 days ago | 33 days |
| 36739 | mbkybky | feat(RingTheory): UFD criteria via height `1` prime ideals and localization | We prove the following UFD criteria via height `1` prime ideals and localization: 1. Let `R` be a Noetherian domain. Then `R` is a UFD if and only if every height `1` prime ideal is principal. 2. Let `R` be a Noetherian domain, `x ∈ R` be a prime element. If `Rₓ` is a UFD, then `R` is also a UFD. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 205/11 | Mathlib.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/UFD.lean,Mathlib/RingTheory/Localization/Away/Basic.lean,Mathlib/RingTheory/Smooth/StandardSmoothOfFree.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Localization.lean,Mathlib/RingTheory/Unramified/LocalStructure.lean | 11 | 12 | ['chrisflav', 'github-actions', 'mbkybky', 'tb65536'] | chrisflav | 6 days ago | 6 days ago | 45 days |
| 31513 | FLDutchmann | feat(Tactic): `polynomial` tactic | Implement tactic for proving equality of polynomials. This tactic is part of a larger suite (see https://github.com/leanprover-community/mathlib4/pull/30374). - [x] depends on: #31508 --- [](https://gitpod.io/from-referrer/) | t-meta | 284/2 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Polynomial/Basic.lean,Mathlib/Tactic/Polynomial/Core.lean,MathlibTest/Polynomial.lean | 7 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | Vierkantor | 6 days ago | 6 days ago | 6 days |
| 38222 | IvanRenison | feat(Combinatorics/SimpleGraph/Girth): add lemmas about isomorphism and girth | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 19/1 | Mathlib/Combinatorics/SimpleGraph/Girth.lean | 1 | 6 | ['IvanRenison', 'SnirBroshi', 'github-actions', 'vlad902'] | nobody | 6 days ago | 12 days ago | 12 days |
| 38528 | SnirBroshi | feat(Combinatorics/SimpleGraph/Paths): some cycle lemmas are true for circuits | Add `IsCircuit.{not_of_nil,ne_bot,three_le_length}` by using their corresponding `IsCycle` proofs. Also golfs a bit. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 17/9 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 1 | ['github-actions'] | nobody | 6 days ago | 6 days ago | 6 days |
| 34815 | Deep0Thinking | feat(Analysis/SpecialFunctions/ImproperIntegrals): Frullani integral | - [x] depends on: #34966 --- Add a proof of **Frullani integral**. Main theorems: - `Frullani.integral_Ioi` - `IntegrableOn.tendsto_integral_Ioi` - `exists_integral_div_eq_mul_log` Supporting lemmas: - `Frullani.comp_mul_left_div` - `Frullani.intervalIntegrable_div` - `Frullani.exists_integral_div_eq_mul_log` - `Ioi_diff_Ioc` - `ContinuousOn.comp_mul_left_div`, `ContinuousOn.comp_mul_right_div` - `ContinuousOn.comp_mul_left`, `ContinuousOn.comp_mul_right` --- [](https://gitpod.io/from-referrer/) | new-contributor large-import t-analysis awaiting-author | 265/4 | Mathlib/Analysis/SpecialFunctions/ImproperIntegrals.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/MeanValue.lean,Mathlib/Topology/Algebra/GroupWithZero.lean,Mathlib/Topology/Algebra/Monoid.lean | 4 | 17 | ['CoolRmal', 'Deep0Thinking', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'sgouezel'] | urkud | 5 days ago | 5 days ago | 11 days |
| 35281 | harahu | chore: fix markdown list indentation | WIP --- [](https://gitpod.io/from-referrer/) | WIP | 815/439 | Mathlib/Algebra/Category/ModuleCat/Presheaf/ColimitFunctor.lean,Mathlib/Algebra/Homology/SpectralSequence/ComplexShape.lean,Mathlib/Algebra/Lie/Prod.lean,Mathlib/AlgebraicGeometry/EllipticCurve/LFunction.lean,Mathlib/AlgebraicGeometry/Gluing.lean,Mathlib/AlgebraicGeometry/Morphisms/Basic.lean,Mathlib/AlgebraicGeometry/Morphisms/Flat.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/Properties.lean,Mathlib/AlgebraicTopology/CechNerve.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/SimplicialSet/Subdivision.lean,Mathlib/AlgebraicTopology/SimplicialSet/TopAdj.lean,Mathlib/Analysis/CStarAlgebra/Module/Constructions.lean,Mathlib/Analysis/Convex/KreinMilman.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Normed/Field/Approximation.lean,Mathlib/Analysis/Normed/Field/Dense.lean,Mathlib/Analysis/Normed/Field/Krasner.lean,Mathlib/Analysis/Normed/Group/SemiNormedGrp/Completion.lean,Mathlib/Analysis/Normed/Module/Bases.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Extremal.lean,Mathlib/CategoryTheory/Abelian/Preradical/Colon.lean,Mathlib/CategoryTheory/Bicategory/Basic.lean,Mathlib/CategoryTheory/Category/ULift.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/GlueData.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/ChosenPullback.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/Limits/Basic.lean,Mathlib/CategoryTheory/NatIso.lean,Mathlib/CategoryTheory/Sites/Coverage.lean,Mathlib/CategoryTheory/Sites/Point/OfIsCofiltered.lean,Mathlib/CategoryTheory/Sites/PrecoverageToGrothendieck.lean,Mathlib/CategoryTheory/WithTerminal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Lemma.lean,Mathlib/Data/Bracket.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/FlagRange.lean,Mathlib/Data/Finset/Density.lean,Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/Multiset/DershowitzManna.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/PNat/Xgcd.lean,Mathlib/Data/Part.lean,Mathlib/Data/Stream/Defs.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/Lean/Meta/RefinedDiscrTree/Basic.lean,Mathlib/LinearAlgebra/InvariantBasisNumber.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/PerfectPairing/Basic.lean,Mathlib/LinearAlgebra/TensorAlgebra/Basic.lean,Mathlib/Logic/Equiv/Fin/Rotate.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Integral/Bochner/L1.lean,Mathlib/MeasureTheory/Order/UpperLower.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean,Mathlib/Order/Birkhoff.lean,Mathlib/Order/CompleteBooleanAlgebra.lean,Mathlib/Order/Zorn.lean,Mathlib/RingTheory/Smooth/Flat.lean,Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean,Mathlib/RingTheory/Spectrum/Prime/Jacobson.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean,Mathlib/Tactic/Algebra/Basic.lean,Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/CategoryTheory/CancelIso.lean,Mathlib/Tactic/CategoryTheory/Coherence/Normalize.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/ComputeDegree.lean,Mathlib/Tactic/DepRewrite.lean,Mathlib/Tactic/Finiteness.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/Linarith/Frontend.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/PositiveVector.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/SimpIntro.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Widget/InteractiveUnfold.lean,Mathlib/Topology/Category/Profinite/AsLimit.lean,Mathlib/Topology/Continuous.lean,Mathlib/Topology/DiscreteQuotient.lean,Mathlib/Topology/Gluing.lean,Mathlib/Topology/Maps/Proper/Basic.lean,Mathlib/Topology/MetricSpace/UniformConvergence.lean,Mathlib/Topology/Sheaves/Presheaf.lean | 104 | 14 | ['github-actions', 'harahu', 'mathlib-merge-conflicts'] | nobody | 5 days ago | unknown | 0 seconds |
| 36682 | harahu | chore(Data): avoid lazy continuation in md lists | We replace lazy continuation lines in lists with either: - indented lines, to signify that the line is indeed a continuation line; or - a newline, where the continuation line(s) were in fact intended to be disconnected from the list. We do this because lazy continuation is a markdown footgun that one does well to avoid. We also standardize indentation such that continuation lines now line up with the first line of the item they're continuing. This seems to be the solution enforced by markdown formatters, e.g. `mdformat`. --- [](https://gitpod.io/from-referrer/) | t-data | 18/7 | Mathlib/Data/Bracket.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/FlagRange.lean,Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/Multiset/DershowitzManna.lean,Mathlib/Data/PNat/Xgcd.lean,Mathlib/Data/Part.lean,Mathlib/Data/Stream/Defs.lean | 9 | 1 | ['github-actions'] | TwoFX | 5 days ago | 47 days ago | 47 days |
| 36686 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `List.prod_map_ite`: unchanged 🎉 * `Path.Homotopy.trans_assoc_reparam`: 2938 ms before, 717 ms after 🎉 * `SimplexCategory.δ_comp_δ`: 522 ms before, 316 ms after 🎉 * `Finsupp.ext_iff'`: unchanged 🎉 * `Computation.bind_assoc`: unchanged 🎉 * `Set.piecewise_insert`: unchanged 🎉 * `ZMod.valMinAbs_mem_Ioc`: unchanged 🎉 * `Matrix.det_eq_of_forall_row_eq_smul_add_pred_aux`: 2141 ms before, 2004 ms after 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | 11/50 | Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/Set/Piecewise.lean,Mathlib/Data/ZMod/ValMinAbs.lean,Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean | 8 | 12 | ['artie2000', 'chenson2018', 'euprunin', 'github-actions', 'mathlib-merge-conflicts', 'ooovi'] | nobody | 5 days ago | 5 days ago | 45 days | |
| 34855 | staroperator | feat(Order): use `to_dual` for `PFilter` | This PR redefines `PFilter` to get rid of `OrderDual` and uses `to_dual` to translate theorems. The whole file of `PFilter` is now deprecated. Some changes: - To align with `Filter`, the order on `PFilter` is changed to the reversed set inclusion. Ultrafilters, the dual notion of maximal ideals, become minimal in this order. - `to_dual` does not work on `sequenceOfCofinals`. I left `Order.Cofinal` and the Rasiowa–Sikorski lemma not `to_dual`-ized, and we should move them to a separate file later. - `IsLEChain` is added to tag `to_dual`. --- - [x] depends on: #34820 --- [](https://gitpod.io/from-referrer/) | t-order | 293/242 | Mathlib/Order/Atoms.lean,Mathlib/Order/BooleanAlgebra/Basic.lean,Mathlib/Order/BooleanAlgebra/Defs.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/Ideal.lean,Mathlib/Order/PFilter.lean,Mathlib/Order/Preorder/Chain.lean,Mathlib/Order/PrimeIdeal.lean,Mathlib/Order/PrimeSeparator.lean,Mathlib/Order/ZornAtoms.lean,Mathlib/RingTheory/IdealFilter/Basic.lean,Mathlib/RingTheory/IdealFilter/Topology.lean,Mathlib/Tactic/Translate/ToDual.lean | 13 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 6 days ago | 7 days |
| 37541 | EtienneC30 | feat: another version of the cardinality of the difference | In mathlib there is `Set.ncard_diff` which states that `(t \ s).ncard = t.ncard - s.ncard` when `s ⊆ t` and `s` is finite. But one way to prove that `s` is finite is by showing that `t` is finite and using the `s ⊆ t` hypothesis, so this PR adds `Set.ncard_diff'` which assumes that `t` is finite instead of `s`. --- [](https://gitpod.io/from-referrer/) | t-data | 5/0 | Mathlib/Data/Set/Card.lean | 1 | 1 | ['github-actions'] | TwoFX | 5 days ago | 29 days ago | 29 days |
| 38525 | AntoineChambert-Loir | feat(Tactic/Translate/ToAdditive.lean): add con/addCon to to_additive tactic | This PR adds the pair "con", "addCon" to the additive tactic. --- [](https://gitpod.io/from-referrer/) | t-meta | 13/11 | Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/Tactic/Translate/ToAdditive.lean | 4 | 1 | ['github-actions'] | dwrensha | 5 days ago | 6 days ago | 6 days |
| 36018 | wwylele | feat(LinearAlgebra/AffineSpace): shifting a subspace towards a point (part 2) | This is preparing to calculate the volume of a simplex by integrating the cross-section created by shifting the base plane. Part of #34826. --- - [ ] depends on: #38220 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 309/0 | Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean | 3 | 8 | ['copilot-pull-request-reviewer', 'github-actions', 'mathlib-bors', 'mathlib-dependent-issues'] | nobody | 5 days ago | 12 days ago | 37 days |
| 38483 | jessealama | feat(Algebra/BigOperators): add `Antiperiodic.sum_Ico_shift` | Two lemmas about `Finset` sums of antiperiodic functions over `Ico` intervals. * `Function.Antiperiodic.sum_Ico_shift`: For an antiperiodic function `f` with antiperiod `c`, the sum of `f` over the shifted interval `[a + c, b + c)` equals the negation of the sum over `[a, b)`. * `Function.Antiperiodic.sum_Ico_mul_add_sum_Ico_mul_shift_eq_zero`: A bilinear cancellation variant. Spun off from #29713 (Euler-Poincaré formula), where the bilinear form is used. | t-algebra | 54/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Periodic.lean | 2 | 1 | ['github-actions'] | nobody | 5 days ago | 6 days ago | 6 days |
| 38539 | plp127 | fix(Data/Bool/Basic): fix `Bool.not` problem | Fix three lemmas which have a subterm of the form `!a = b`, which elaborates to `(!(decide (a = b))) = true`, where `(!a) = b` was probably intended. These were introduced in #534. --- [](https://gitpod.io/from-referrer/) | t-data | 3/3 | Mathlib/Data/Bool/Basic.lean | 1 | 2 | ['github-actions', 'grunweg'] | nobody | 5 days ago | 5 days ago | 5 days |
| 38536 | CoolRmal | feat: a lemma about the symmetric difference of iUnions | --- [](https://gitpod.io/from-referrer/) | t-data easy | 6/1 | Mathlib/Data/Set/SymmDiff.lean | 1 | 2 | ['CoolRmal', 'github-actions'] | nobody | 5 days ago | 5 days ago | 19 minutes |
| 37959 | artie2000 | feat(LinearAlgebra/Dimension/Free): lemmas about finrank | * Division variant of tower law * Isomorphic to base ring iff rank is one --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 34/9 | Mathlib/LinearAlgebra/Dimension/Free.lean | 1 | 7 | ['artie2000', 'github-actions', 'themathqueen'] | themathqueen | 5 days ago | 5 days ago | 12 days |
| 38531 | SnirBroshi | feat(Combinatorics/SimpleGraph/Paths): `Walk.map` preserves more properties | Adds some missing theorems about how `Walk.map` behaves with `IsTrail`/`IsPath`/`IsCircuit`/`IsCycle`. Summary of what we have now, with the 8 new theorems and 2 renames marked: ``` IsTrail.of_map : (p.map f).IsTrail → p.IsTrail -- new map_isTrail_iff_of_injective : f.Injective → (p.map f).IsTrail ↔ p.IsTrail IsTrail.map : f.Injective → p.IsTrail → (p.map f).IsTrail -- renamed from map_isTrail_of_injective IsPath.of_map : (p.map f).IsPath → p.IsPath map_isPath_iff_of_injective : f.Injective → (p.map f).IsPath ↔ p.IsPath IsPath.map : f.Injective f → p.IsPath → (p.map f).IsPath -- renamed from map_isPath_of_injective IsCircuit.of_map : (p.map f).IsCircuit → p.IsCircuit -- new map_isCircuit_iff_of_injective : f.Injective → (p.map f).IsCircuit ↔ p.IsCircuit -- new IsCircuit.map : f.Injective → p.IsCircuit → (p.map f).IsCircuit -- new IsCycle.of_map : (p.map f).IsCycle → p.IsCycle -- new map_isCycle_iff_of_injective : f.Injective → (p.map f).IsCycle ↔ p.IsCycle IsCycle.map : f.Injective → p.IsCycle → (p.map f).IsCycle mapLe_isTrail : G ≤ G' → (p.mapLe h).IsTrail ↔ p.IsTrail IsTrail.of_mapLe : G ≤ G' → (p.mapLe h).IsTrail → p.IsTrail IsTrail.mapLe : G ≤ G' → p.IsTrail → (p.mapLe h).IsTrail mapLe_isPath : G ≤ G' → (p.mapLe h).IsPath ↔ p.IsPath IsPath.of_mapLe : G ≤ G' → (p.mapLe h).IsPath → p.IsPath IsPath.mapLe : G ≤ G' → p.IsPath → (p.mapLe h).IsPath mapLe_isCircuit : G ≤ G' → (p.mapLe h).IsCircuit ↔ p.IsCircuit -- new IsCircuit.of_mapLe : G ≤ G' → (p.mapLe h).IsCircuit → p.IsCircuit -- new IsCircuit.mapLe : G ≤ G' → p.IsCircuit → (p.mapLe h).IsCircuit -- new mapLe_isCycle : G ≤ G' → (p.mapLe h).IsCycle ↔ p.IsCycle IsCycle.of_mapLe : G ≤ G' → (p.mapLe h).IsCycle → p.IsCycle IsCycle.mapLe : G ≤ G' → p.IsCycle → (p.mapLe h).IsCycle ``` --- Also golfs `map_isPath_of_injective`/`IsPath.of_map`/`map_isTrail_iff_of_injective`, they don't need induction. [](https://gitpod.io/from-referrer/) | t-combinatorics | 47/31 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 1 | ['github-actions'] | nobody | 5 days ago | 5 days ago | 5 days |
| 38549 | SnirBroshi | feat(Combinatorics/SimpleGraph/Copy): `Is(Ind)Contained` `completeGraph` lemmas | - `G ⊑ completeGraph V` - `G ⊑ completeGraph W ↔ Nonempty (V ↪ W)` - `completeGraph V ⊴ completeGraph W ↔ Nonempty (V ↪ W)` - `G ⊴ completeGraph W → G = ⊤` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 12/0 | Mathlib/Combinatorics/SimpleGraph/Copy.lean | 1 | 1 | ['github-actions'] | nobody | 5 days ago | 5 days ago | 5 days |
| 38529 | SnirBroshi | feat(Combinatorics/SimpleGraph/Girth): `egirth ⊤ = 3` when there are at least 3 vertices | Since `Nontrivial` is not enough, we use the condition `3 ≤ ENat.card α`. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 17/0 | Mathlib/Combinatorics/SimpleGraph/Girth.lean | 1 | 5 | ['SnirBroshi', 'github-actions', 'vlad902'] | nobody | 5 days ago | 6 days ago | 6 days |
| 38548 | adomasbaliuka | feat(Algebra/Ring/BooleanRing): definitional lemmas for `Bool` ring operations | Mathlib defines a ring structure on `Bool` but is missing definitional lemmas for the arithmetic operations. --- Discussed on Zulip ([#Is there code for X? > `Bool.xor` same as `+` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/.60Bool.2Exor.60.20same.20as.20.60.2B.60/near/590927417)), in particular, it's not immediately intuitive to everyone what the operations do. Note that the parentheses around `^^` and `&&` are needed due to operator precedence w.r.t. `=`, see also https://github.com/leanprover-community/mathlib4/pull/38539. [](https://gitpod.io/from-referrer/) | t-algebra | 12/0 | Mathlib/Algebra/Ring/BooleanRing.lean | 1 | 1 | ['github-actions'] | nobody | 5 days ago | 5 days ago | 5 days |
| 37835 | YaelDillies | doc(Algebra/Order): update mentions of `OrderedSemiring` and friends | As of #20676, it was replaced by `IsOrderedRing`. Not all docs were straightforward to update. --- [](https://gitpod.io/from-referrer/) | t-algebra t-order | 123/280 | Counterexamples/HomogeneousPrimeNotPrime.lean,Counterexamples/OrderedCancelAddCommMonoidWithBounds.lean,Mathlib/Algebra/Group/Subgroup/Order.lean,Mathlib/Algebra/Group/ULift.lean,Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Floor/Defs.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/Group/Cone.lean,Mathlib/Algebra/Order/Group/Cyclic.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled/Defs.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Interval/Set/Monoid.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/ExistsOfLE.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Algebra/Order/Ring/Basic.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/Algebra/Order/Star/Basic.lean,Mathlib/Algebra/Order/Sub/WithTop.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Order/WithTop/Untop0.lean,Mathlib/Combinatorics/Pigeonhole.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Cast/Order/Basic.lean,Mathlib/Data/Nat/Cast/Order/Ring.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/Order/Filter/Germ/OrderedMonoid.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Valuation.lean,Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean,Mathlib/Tactic/NormNum/Ineq.lean | 37 | 9 | ['NoahW314', 'SnirBroshi', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 5 days ago | 20 days |
| 31607 | grunweg | chore: rename `continuous{,On,At,Within}_const` to `ContinuousFoo.const` | Zulip discussion: [#mathlib4 > Naming convention @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Naming.20convention/near/447491526) --- - [x] depends on: #34441 - [x] depends on: #34688 [](https://gitpod.io/from-referrer/) | delegated merge-conflict | 412/378 | Archive/Hairer.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/BoxIntegral/UnitPartition.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Continuity.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/BumpFunction/InnerProduct.lean,Mathlib/Analysis/Calculus/DSlope.lean,Mathlib/Analysis/Calculus/Deriv/MeanValue.lean,Mathlib/Analysis/Calculus/DiffContOnCl.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/MeanValue.lean,Mathlib/Analysis/Calculus/Rademacher.lean,Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Complex/AbsMax.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/HalfPlane.lean,Mathlib/Analysis/Complex/LocallyUniformLimit.lean,Mathlib/Analysis/Complex/PhragmenLindelof.lean,Mathlib/Analysis/Complex/RemovableSingularity.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Measure.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Metric.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean,Mathlib/Analysis/Convex/Cone/InnerDual.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/PartitionOfUnity.lean,Mathlib/Analysis/Convex/Side.lean,Mathlib/Analysis/Convex/StdSimplex.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Continuous.lean,Mathlib/Analysis/InnerProductSpace/Harmonic/HarmonicContOnCl.lean,Mathlib/Analysis/InnerProductSpace/LinearPMap.lean,Mathlib/Analysis/InnerProductSpace/MeanErgodic.lean,Mathlib/Analysis/InnerProductSpace/OfNorm.lean,Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Meromorphic/Order.lean,Mathlib/Analysis/Meromorphic/TrailingCoefficient.lean,Mathlib/Analysis/Normed/Affine/AddTorsor.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/Normed/Group/Lemmas.lean,Mathlib/Analysis/Normed/Module/Ball/Homeomorph.lean,Mathlib/Analysis/Normed/Module/Connected.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Normed/Operator/Completeness.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Isometric.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Deligne.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/PoissonSummation.lean,Mathlib/Analysis/SpecialFunctions/Integrability/Basic.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Analysis/SpecialFunctions/MulExpNegMulSq.lean,Mathlib/Analysis/SpecialFunctions/PolarCoord.lean,Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Inverse.lean,Mathlib/Computability/AkraBazzi/SumTransform.lean,Mathlib/Condensed/Light/TopCatAdjunction.lean,Mathlib/Condensed/TopCatAdjunction.lean,Mathlib/Dynamics/OmegaLimit.lean,Mathlib/Geometry/Euclidean/Angle/Oriented/Basic.lean,Mathlib/Geometry/Manifold/Bordism.lean,Mathlib/Geometry/Manifold/Complex.lean,Mathlib/Geometry/Manifold/Instances/Icc.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/SmoothApprox.lean,Mathlib/MeasureTheory/Function/SpecialFunctions/Basic.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Integral/CircleIntegral.lean,Mathlib/MeasureTheory/Integral/CircleTransform.lean,Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,Mathlib/MeasureTheory/Integral/RieszMarkovKakutani/Real.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/NumberTheory/Cyclotomic/CyclotomicCharacter.lean,Mathlib/NumberTheory/Harmonic/ZetaAsymp.lean,Mathlib/NumberTheory/LSeries/AbstractFuncEq.lean,Mathlib/NumberTheory/LSeries/Deriv.lean,Mathlib/NumberTheory/LSeries/Dirichlet.lean,Mathlib/NumberTheory/LSeries/DirichletContinuation.lean,Mathlib/NumberTheory/LSeries/HurwitzZetaOdd.lean,Mathlib/NumberTheory/LSeries/PrimesInAP.lean | 185 | 15 | ['github-actions', 'j-loreaux', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 days ago | 168 days ago | 1 second |
| 33470 | erdOne | feat: generalize `Polynomial.freeMonic` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra merge-conflict | 80/52 | Mathlib.lean,Mathlib/Algebra/Polynomial/FreeMonic.lean,Mathlib/RingTheory/Polynomial/UniversalFactorizationRing.lean | 3 | 3 | ['Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 98 days ago | 20 days |
| 38347 | artie2000 | doc(LinearAlgebra/FreeModule/StrongRankCondition): clarify context of `commRing_strongRankCondition` | * Replace mathematical documentation in `Mathlib.LinearAlgebra.FreeModule.StrongRankCondition`, with explanation that the file comprises a shortcut instance `commRing_strongRankCondition` * Signpost `commRing_strongRankCondition` at both its parent instances * Increase priority of shortcut instance `commRing_strongRankCondition` above that of its parent instances --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 28/41 | Mathlib/LinearAlgebra/FreeModule/StrongRankCondition.lean,Mathlib/LinearAlgebra/InvariantBasisNumber.lean,Mathlib/RingTheory/FiniteType.lean | 3 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 5 days ago | 9 days |
| 38093 | mortarsanjaya | feat(Algebra/Order/Ring/Unbundled/Basic): add a generalization of `two_mul_le_add_of_sq_eq_mul` | The equality `r^2 = a * b` in the hypothesis can be weakened to `r^2 ≤ a * b`. The implementation requires adding an appropriate `ZeroLEOneClass` instance. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor maintainer-merge | 16/7 | Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean | 2 | 13 | ['github-actions', 'leanprover-radar', 'mortarsanjaya', 'themathqueen'] | themathqueen | 5 days ago | 10 days ago | 15 days |
| 34650 | vihdzp | feat: redefine `Polynomial.toSubring` with better def-eqs | We redefine [`Polynomial.toSubring`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Polynomial/Basic.html#Polynomial.toSubring) in such a way that `(p.toSubring T _).coeff n = p.coeff n` definitionally. We then golf the API. --- - [x] depends on: #34661 [](https://gitpod.io/from-referrer/) | t-ring-theory merge-conflict | 63/73 | Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Ring/Subring/IntPolynomial.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/RingTheory/Algebraic/Integral.lean,Mathlib/RingTheory/Polynomial/Subring.lean | 6 | 15 | ['YaelDillies', 'erdOne', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 5 days ago | 56 days ago | 23 hours |
| 34867 | urkud | feat(FDeriv/Comp): migrate to TVS | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #34832 | t-analysis awaiting-author merge-conflict | 94/91 | Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean | 3 | 21 | ['eric-wieser', 'github-actions', 'j-loreaux', 'leanprover-radar', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'urkud'] | j-loreaux | 5 days ago | 66 days ago | 15 days |
| 34941 | urkud | feat(FDeriv/Prod): generalize to TVS | --- Doesn't work yet - [ ] depends on: #34867 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-analysis merge-conflict | 326/178 | Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/Calculus/FDeriv/Bilinear.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/CompCLM.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/Linear.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/MeasureTheory/Integral/DivergenceTheorem.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean | 10 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 83 days ago | 50 seconds |
| 35666 | urkud | chore(Calculus/FDeriv/Pi): migrate to TVS | --- - [ ] depends on: #35663 - [ ] depends on: #34941 - [ ] depends on: #34867 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 330/179 | Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/Calculus/FDeriv/Bilinear.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/CompCLM.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/Linear.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Pi.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/MeasureTheory/Integral/DivergenceTheorem.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean | 11 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 67 days ago | 13 minutes |
| 37270 | lecopivo | feat(Tactic/FunProp): set up fun_prop for HasDerivAt | Correctly set up fun_prop for `HasDerivAt` and set up deriv_simproc for simplifying `deriv ...`. - [ ] depends on: #37231 - [ ] depends on: #37056 --> [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import t-meta merge-conflict | 1711/252 | Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/AffineMap.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/Comp.lean,Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Linear.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/Deriv/Pi.lean,Mathlib/Analysis/Calculus/Deriv/Pow.lean,Mathlib/Analysis/Calculus/Deriv/Prod.lean,Mathlib/Analysis/Calculus/Deriv/Star.lean,Mathlib/Analysis/Calculus/Deriv/ZPow.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Comp.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousAlternatingMap.lean,Mathlib/Analysis/Calculus/FDeriv/ContinuousMultilinearMap.lean,Mathlib/Analysis/Calculus/FDeriv/Defs.lean,Mathlib/Analysis/Calculus/FDeriv/Pow.lean,Mathlib/Analysis/Calculus/FDeriv/Prod.lean,Mathlib/Analysis/SpecialFunctions/Arcosh.lean,Mathlib/Analysis/SpecialFunctions/Arsinh.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogDeriv.lean,Mathlib/Analysis/SpecialFunctions/ExpDeriv.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Sqrt.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/ArctanDeriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/ComplexDeriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/DerivHyp.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/InverseDeriv.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Elab.lean,Mathlib/Tactic/FunProp/Simproc.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/Measurability.lean,MathlibTest/fun_prop2.lean,MathlibTest/fun_prop_dev.lean,MathlibTest/fun_prop_dev_out_param.lean | 46 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 35 days ago | 5 minutes |
| 38032 | grunweg | perf: unbundle algebra from `ENormed*`, April 2026 version | Up-to-date version of #28803. Don't merge yet! --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 81/78 | Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Continuity.lean,Mathlib/Analysis/Normed/Group/Defs.lean,Mathlib/Analysis/Normed/Group/Indicator.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/Normed/Group/Real.lean,Mathlib/MeasureTheory/Function/L1Space/AEEqFun.lean,Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Indicator.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Monotonicity.lean,Mathlib/MeasureTheory/Function/LpSeminorm/SMul.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean | 20 | 6 | ['github-actions', 'grunweg', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 17 days ago | 9 seconds |
| 38193 | Jun2M | feat(Topology/Algebra/InfiniteSum): Deprecate generalized ENNReal lemmas | Following the PR #38489, this PR add deprecated tags to the original `ENNReal` lemmas and change the transitive children files to use the generalized lemmas rather than the deprecated lemmas. Related Zulip thread: [#Is there code for X? > Summing `ENat`s without topology](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/588756615) --- - [ ] depends on: #38489 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 483/329 | Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Function/AEMeasurableOrder.lean,Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean,Mathlib/MeasureTheory/Function/Egorov.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/LpSpace/Complete.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Countable.lean,Mathlib/MeasureTheory/Measure/AbsolutelyContinuous.lean,Mathlib/MeasureTheory/Measure/AddContent.lean,Mathlib/MeasureTheory/Measure/Content.lean,Mathlib/MeasureTheory/Measure/Count.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasuredSets.lean,Mathlib/MeasureTheory/Measure/MutuallySingular.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/RegularityCompacts.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/MeasureTheory/Measure/Tight.lean,Mathlib/MeasureTheory/Measure/Typeclasses/SFinite.lean,Mathlib/MeasureTheory/Measure/WithDensity.lean,Mathlib/MeasureTheory/OuterMeasure/Caratheodory.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/MeasureTheory/OuterMeasure/OfAddContent.lean,Mathlib/MeasureTheory/OuterMeasure/OfFunction.lean,Mathlib/MeasureTheory/OuterMeasure/Operations.lean,Mathlib/MeasureTheory/VectorMeasure/Basic.lean,Mathlib/NumberTheory/Transcendental/Liouville/Measure.lean,Mathlib/Probability/Distributions/Uniform.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Kernel/WithDensity.lean,Mathlib/Probability/ProbabilityMassFunction/Basic.lean,Mathlib/Probability/ProbabilityMassFunction/Constructions.lean,Mathlib/Probability/ProbabilityMassFunction/Monad.lean,Mathlib/Probability/Process/LocalProperty.lean,Mathlib/Topology/Algebra/InfiniteSum/ENNReal.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/MetricSpace/PiNat.lean,Mathlib/Topology/Semicontinuity/Basic.lean | 52 | 4 | ['SnirBroshi', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 6 days ago | 6 days |
| 38546 | yhx-12243 | fix: universe issue in injective module | Change the definition of ```lean class Module.Injective : Prop where out : ∀ ⦃X Y : Type v⦄ [AddCommGroup X] [AddCommGroup Y] [Module R X] [Module R Y] (f : X →ₗ[R] Y) (_ : Function.Injective f) (g : X →ₗ[R] Q), ∃ h : Y →ₗ[R] Q, ∀ x, h (f x) = g x ``` into ```lean class Module.Injective : Prop where out : ∀ ⦃X Y : Type u⦄ [AddCommGroup X] [AddCommGroup Y] [Module R X] [Module R Y] (f : X →ₗ[R] Y) (_ : Function.Injective f) (g : X →ₗ[R] Q), ∃ h : Y →ₗ[R] Q, ∀ x, h (f x) = g x ``` to make it agree with `Module.Baer` and real mathematical definition, **without universe issues**. Since the criterion `Module.Flat` also uses `Type u` on testing modules. See discussions in https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Universe.20issue.20about.20injective.20module . --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-zulip | 57/43 | Mathlib/Algebra/Category/ModuleCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Ulift.lean,Mathlib/Algebra/Module/Injective.lean,Mathlib/RepresentationTheory/FinGroupCharZero.lean,Mathlib/RingTheory/Flat/Tensor.lean,Mathlib/RingTheory/LocalProperties/Injective.lean | 6 | 5 | ['github-actions', 'grunweg', 'mathlib-bors', 'wwylele'] | nobody | 4 days ago | 4 days ago | 7 hours |
| 34713 | dennj | feat(Probability/Markov): stationary distributions for stochastic matrices | This PR proves that every row-stochastic matrix on a finite nonempty state space has a stationary distribution in the standard simplex. Main additions to `Mathlib/Probability/Markov/Stationary.lean`: - `IsStationary`: A distribution μ is stationary for matrix P if μ ᵥ* P = μ - `cesaroAverage`: Cesàro average of iterates of a vector under a matrix - `Matrix.rowStochastic.exists_stationary_distribution`: existence theorem The proof uses Cesàro averaging: start with uniform distribution, form averages, extract convergent subsequence by compactness, show limit is stationary via L¹ non-expansiveness. Also adds `vecMul_mem_stdSimplex` to `Stochastic.lean`: multiplying a probability vector by a row-stochastic matrix preserves simplex membership. This is human-made PR with AI help in golfing proof and documenting the code. | t-algebra new-contributor | 166/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Stochastic.lean,Mathlib/Probability/Markov/Stationary.lean | 3 | 16 | ['dennj', 'dupuisf', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts', 'riccardobrasca'] | nobody | 4 days ago | 4 days ago | 15 days |
| 38557 | SnirBroshi | feat(Order/Monotone/Defs): weaken `Preorder` to `LE`/`LT` | `Monotone`/`Antitone`/`MonotoneOn`/`AntitoneOn` can use any `LE`, and `StrictMono`/`StrictAnti`/`StrictMonoOn`/`StrictAntiOn` can use any `LT`. This makes it necessary to add some explicit type params (e.g. `(α := α)`) in some places that use monotone-related theorems (e.g. `Function.monotone_eval`). --- Currently `OrderEmbedding` and `OrderIso` can use `LE` but `OrderHom` requires `Preorder` because it's defined using `Monotone`. Generalizing `Monotone` and friends will let us fix this oddity. [](https://gitpod.io/from-referrer/) | t-order | 21/15 | Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Order/Interval/Lex.lean,Mathlib/Order/Monotone/Defs.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean,Mathlib/Topology/Order/MonotoneConvergence.lean | 7 | 1 | ['github-actions'] | nobody | 4 days ago | 4 days ago | 4 days |
| 33928 | jsm28 | feat(Combinatorics/Tiling/TileSet): indexed families of tiles | Define the type `TileSet` for indexed families of tiles (in a discrete context), and some associated definitions (including `symmetryGroup`) and API lemmas. `TileSet` can be used for tilings of the whole space; for tilings of part of the space; for patches of tiles (extracted from a tiling by considering tiles meeting some set of points, or considered on their own without extracting from a tiling); for multiple tilings (covering the space more than once). In particular, the fact that people study multiple tilings provides a clear justification for using indexed families rather than sets of tiles, and basic definitions and API lemmas generally work for all these different uses of `TileSet` (sometimes with weak constraints such as tiles being finite, nonempty and only having finitely many tiles meeting any point of the space). Definitions for saying e.g. "this `TileSet` is a tiling of the whole space" are to be included in subsequent files in subsequent PRs. From AperiodicMonotilesLean. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 460/0 | Mathlib.lean,Mathlib/Combinatorics/Tiling/TileSet.lean | 2 | 23 | ['Parcly-Taxel', 'b-mehta', 'eric-wieser', 'github-actions', 'jsm28', 'vihdzp'] | YaelDillies | 4 days ago | 107 days ago | 107 days |
| 36814 | YaelDillies | refactor(Combinatorics/SimpleGraph): no proof obligation in `rotate` | If the walk doesn't go through the new vertex, return `nil` instead. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 44/31 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 8 | 8 | ['SnirBroshi', 'YaelDillies', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | b-mehta | 4 days ago | 28 days ago | 42 days |
| 37722 | SabrinaJewson | feat(Order/Cover): intervals equal singletons iff | To complement `Set.Icc_eq_singleton_iff`, this introduces: - `Set.Ioc_eq_singleton_iff` - `Set.Ico_eq_singleton_iff` - `Set.Ioi_eq_singleton_iff` - `Set.Iio_eq_singleton_iff` - `Set.Ioo_eq_singleton_iff` Unforunately because of the order of the ands, the last cannot be made self-dual. --- [](https://gitpod.io/from-referrer/) | t-order new-contributor | 39/0 | Mathlib/Order/Cover.lean | 1 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | Komyyy and bryangingechen | 4 days ago | 22 days ago | 24 days |
| 38568 | SnirBroshi | feat(SimpleGraph/Connectivity/Subgraph): `w.toSubgraph.IsInduced ↔ w.IsChordless` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 6/0 | Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean | 1 | 1 | ['github-actions'] | nobody | 4 days ago | 4 days ago | 4 days |
| 35672 | dennj | feat(RingTheory/Polynomial/Cyclotomic): vanishing sums and fiber equidistribution at primitive roots | ## Summary Building on `sum_eq_zero_iff_forall_eq` from #34592, this PR adds: - cyclotomic_dvd_of_aeval_eq_zero, exists_int_smul_cyclotomic_of_natDegree_le_totient — integer polynomials vanishing at a primitive n-th root are divisible by cyclotomic n ℤ, and (for degree ≤ φ(n)) integer multiples of it. - sum_eq_zero_iff_forall_eq and its ℤ / ZMod p variants — vanishing iff all coefficients equal. - sum_fiber_eq_sum_fiber_of_sum_weighted_pow_eq_zero, card_fiber_eq_card_div_of_sum_pow_eq_zero — fiber equidistribution. - cyclotomic_prime_coeff — the formula (cyclotomic p R).coeff i = if i < p then 1 else 0, generalising existing coeff_zero/coeff_one lemmas. - References: [deLauneyFlannery2011, Lemma 2.8.5] (underlying ℚ/ℕ fact) and [armario2024, Lemma 7 and Theorem 3] (ℤ statement and the fiber-counting application). Theorems imported from: https://github.com/Latinum-Agentic-Commerce/AlgebraicDesignTheory Human made PR with LLM used for documentation and proof golfing | t-ring-theory new-contributor | 128/2 | Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean,docs/references.bib | 3 | 6 | ['dennj', 'github-actions', 'grunweg', 'ocfnash'] | ocfnash | 4 days ago | 4 days ago | 14 days |
| 37975 | Thmoas-Guan | feat(RingTheory): AdicCompletion of local ring is local | In this PR, we proved that AdicCompletion of local ring wrt the maximal ideal is local ring with maximal ideal equal to the map of the original maximal ideal. Also, removing some old junk produced by myself. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 173/5 | Mathlib/RingTheory/AdicCompletion/LocalRing.lean | 1 | 15 | ['BryceT233', 'Thmoas-Guan', 'github-actions'] | nobody | 4 days ago | 18 days ago | 18 days |
| 38331 | Thmoas-Guan | feat(RingTheory/AdicCompletion): AdicCompletion of Noetherian ring is Noetherian | For `I` an ideal of `R`, if `R/I` is Noetherian and `I` is finitely generated, the the completion of `R` wrt `I` is Noetherian. --- - [ ] depends on: #37975 [](https://gitpod.io/from-referrer/) | t-ring-theory large-import blocked-by-other-PR | 449/7 | Mathlib/RingTheory/AdicCompletion/LocalRing.lean,Mathlib/RingTheory/AdicCompletion/Noetherian.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 days ago | 10 days ago | 8 minutes |
| 37934 | Thmoas-Guan | feat(FieldTheory): definition of transcendental separable field extension | In this PR, we introduce the concept of separably generated field extension and transcendental separable field extension. Further properties will be in #37838 --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-zulip | 69/0 | Mathlib.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean | 2 | 3 | ['Thmoas-Guan', 'github-actions', 'robin-carlier'] | robin-carlier | 4 days ago | 10 days ago | 8 days |
| 37838 | Thmoas-Guan | feat(FieldTheory): basic theories about transcendental separable extension | The formalization of [Stacks 030W] via [Stacks 030U]. --- - [ ] depends on: #37934 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 556/15 | Mathlib.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean | 3 | 3 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues'] | nobody | 4 days ago | 20 days ago | 21 minutes |
| 37953 | Thmoas-Guan | feat(RingTheory/Smooth): transcendental separable extension is formally smooth | In this PR, we proved that transcendental separable extension is formally smooth via reduction to fg cases. --- - [ ] depends on: #37934 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 207/0 | Mathlib.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean,Mathlib/RingTheory/Smooth/Field.lean | 3 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 days ago | 19 days ago | 1 minute |
| 38507 | grunweg | fix(Linter/PrivateModule): only suggest @[expose] if the module has any definitions | --- Let's see how bad the implementation is! [](https://gitpod.io/from-referrer/) | awaiting-CI WIP | 50/9 | Mathlib/CategoryTheory/MarkovCategory/Positive.lean,Mathlib/Tactic/Linter/PrivateModule.lean,MathlibTest/PrivateModuleLinter/hasOnlyPrivateNoDefs.lean | 3 | 3 | ['github-actions', 'grunweg', 'leanprover-radar'] | nobody | 4 days ago | 6 days ago | 11 seconds |
| 37671 | grunweg | feat: also check for norm_num in the flexible linter | Most other flexible tactics are terminal; dsimp is missing from this list (but perhaps less important in practice. --- - [x] depends on: #37880 [](https://gitpod.io/from-referrer/) | t-linter awaiting-author | 31/1 | Archive/Wiedijk100Theorems/AbelRuffini.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semifield.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/CStarAlgebra/Unitary/Connected.lean,Mathlib/Analysis/InnerProductSpace/Convex.lean,Mathlib/Analysis/SpecialFunctions/ArithmeticGeometricMean.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean,Mathlib/Combinatorics/Additive/AP/Three/Behrend.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean,Mathlib/LinearAlgebra/RootSystem/Reduced.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Measure/IntegralCharFun.lean,Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/Harmonic/EulerMascheroni.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Topology/UrysohnsLemma.lean | 19 | 8 | ['SnirBroshi', 'github-actions', 'grunweg', 'joneugster', 'mathlib-dependent-issues'] | joneugster and thorimur | 4 days ago | 14 days ago | 4 days |
| 38527 | archiebrowne | feat(Geometry/Manifold): continuously differentiable actions | define the class `ContDiffSMul 𝕜 M X n` which asserts that the map `(c, x) ↦ c • x` is `n` times continuously differentiable on `M × X`. Many of the results are the C^n analogues of those in the module Mathlib.Topology.Algebra.MulAction. | t-differential-geometry new-contributor | 281/0 | Mathlib.lean,Mathlib/Analysis/ContDiffMulAction.lean | 2 | 11 | ['archiebrowne', 'github-actions', 'grunweg', 'peabrainiac'] | PatrickMassot and grunweg | 4 days ago | 4 days ago | 6 days |
| 34092 | staroperator | feat(SetTheory/ZFC): properties of `ZFSet.omega` | --- [](https://gitpod.io/from-referrer/) | t-set-theory awaiting-author | 77/10 | Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Ordinal.lean,Mathlib/SetTheory/ZFC/PSet.lean | 3 | 31 | ['Komyyy', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator', 'vihdzp'] | YaelDillies | 4 days ago | 4 days ago | 99 days |
| 36840 | SnirBroshi | feat(SetTheory/Ordinal/Arithmetic): a few ordinal division lemmas | --- [](https://gitpod.io/from-referrer/) | t-set-theory awaiting-author | 27/8 | Mathlib/SetTheory/Ordinal/Arithmetic.lean | 1 | 8 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'vihdzp'] | YaelDillies | 4 days ago | 4 days ago | 39 days |
| 36850 | whocares-abt | feat(Combinatorics/SimpleGraph/Acyclic): deleting leaves from a tree gives a tree | Added theorem stating Deleting a leaf from a tree produces a tree. | t-combinatorics new-contributor awaiting-author | 5/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 9 | ['YaelDillies', 'github-actions', 'vlad902'] | YaelDillies | 4 days ago | 4 days ago | 38 days |
| 35733 | mkaratarakis | feat: Algebraic setup and matrix coefficients for Gelfond-Schneider theorem | This PR introduces the foundational algebraic setup and coefficient bounds required for the proof of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem), which establishes that for algebraic numbers $\alpha \neq 0, 1$ and irrational algebraic $\beta$, the number $\alpha^\beta$ is transcendental. Following the contradiction argument presented in Loo-Keng Hua's "Introduction to Number Theory" (Chapter 17.9, 490 -493) Gelfond's Proof), this file constructs the common number field $K$ and sets up the scaled algebraic integers for the auxiliary linear system. This system will later be solved via Siegel's lemma (Lemma 8.2, 490, Hua). This PR is essentially the first half of page 490 in the book. The proof proceeds by assuming $\gamma = \alpha^\beta$ is algebraic, meaning $\alpha$, $\beta$, and $\gamma$ all lie in an algebraic field $K$ of degree $h$. 1. Bundles the common number field $K$, the complex embeddings, and the algebraic preimages $\alpha', \beta', \gamma'$, alongside the core hypotheses of the theorem. 2. Defines the field degree $h = [K : \mathbb{Q}]$, and bounds $m = 2h + 2$ and $n = q^2 / (2m)$ to control the dimensions of the linear system. 3. Defines $c_1$, a natural number chosen so that $c_1 \alpha$, $c_1 \beta$, and $c_1 \gamma$ are algebraic integers in $K$. We prove numerous bounding and integrality lemmas (`isIntegral_c₁α`, `isInt_β_bound`, etc.). 4. Formalizes the core algebraic coefficients $(a+b\beta)^k \alpha^{al} \gamma^{bl}$ which appear in the evaluation of the derivatives of the auxiliary function $R(x)$. 5. By scaling the system by $c_1^{n-1+2mq}$, we successfully restrict the entries of our linear system matrix `A` entirely to the ring of integers $\mathcal{O}_K$, preparing it for the application of Siegel's lemma. 6. House Bounds (`c₂`) : Establishes the foundational base integer $c_2$ to bound the absolute values of the conjugates (houses) of our coefficients. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor | 913/49 | Mathlib.lean,Mathlib/NumberTheory/NumberField/House.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean,Mathlib/RingTheory/IntegralClosure/Algebra/Basic.lean | 4 | 17 | ['MichaelStollBayreuth', 'github-actions', 'mkaratarakis', 'tb65536'] | tb65536 | 4 days ago | 27 days ago | 39 days |
| 38414 | chrisflav | chore(RingTheory): move `IsLocalizedModule.Away` to the `Basic` file and use it everywhere | --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 42/48 | Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/Algebra/Module/LocalizedModule/Away.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/RingTheory/LocalProperties/Exactness.lean,Mathlib/RingTheory/LocalProperties/Submodule.lean,Mathlib/RingTheory/Localization/Finiteness.lean,Mathlib/RingTheory/Localization/Free.lean,Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean,Mathlib/RingTheory/Spectrum/Prime/Module.lean,Mathlib/RingTheory/Support.lean | 12 | 6 | ['chrisflav', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 4 days ago | 7 days |
| 26300 | igorkhavkine | feat(Analysis/Calculus/FDeriv): continuous differentiability from continuous partial derivatives on an open domain in a product space | If a function `f : E × F → G` is continuously differentiable, then its partial derivatives along `E` and `F` are also continuous. The non-trivial converse implication holds when the partial derivatives are continuous on an open domain, and they can be added together to give the total derivative of `f`. See this [#mathlib4 > Partial derivatives @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Partial.20derivatives/near/520995477) and the containing thread for some discussion. The PR creates a new import (`Mathlib.Analysis.Calculus.FDeriv.Partial`), where other results about partial derivatives could go in the future. --- *this is the migration of #25304 to the PR-from-fork workflow* - [x] depends on: #25564 - [x] depends on: #26273 [](https://gitpod.io/from-referrer/) | WIP new-contributor awaiting-author t-analysis | 347/4 | Mathlib/Analysis/Calculus/FDeriv/Partial.lean | 1 | 23 | ['YaelDillies', 'agjftucker', 'github-actions', 'igorkhavkine', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 4 days ago | 260 days ago | 44 days |
| 36626 | SnirBroshi | feat(Order/UpperLower/Basic): an injective function constrained by the identity function using a well-order is the identity | --- (yes I know `IsLowerSet` is bundled but I need the theorems for unbundled relations 🙈) [](https://gitpod.io/from-referrer/) | t-order awaiting-author | 30/0 | Mathlib/Order/UpperLower/Basic.lean | 1 | 6 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'vihdzp'] | bryangingechen | 4 days ago | 4 days ago | 44 days |
| 38420 | eliasjudin | feat(Algebra/MvPolynomial): add coefficient lemma for uniqueAlgEquiv | Adds `MvPolynomial.coeff_uniqueAlgEquiv` and `MvPolynomial.coeff_uniqueAlgEquiv_symm`, identifying coefficients under `MvPolynomial.uniqueAlgEquiv` in both directions. | t-algebraic-geometry new-contributor | 19/0 | Mathlib/Algebra/MvPolynomial/Equiv.lean | 1 | 5 | ['eliasjudin', 'eric-wieser', 'github-actions'] | kim-em | 4 days ago | 7 days ago | 8 days |
| 36954 | FMLJohn | feat(Topology/ClosedBases): `TopologicalSpace.IsClosedBasis` and `TopologicalSpace.IsClosedSubbasis s` | In this pull request, I have defined closed bases and closed subbases of topologies, and proved some basic properties of them. ## Main definitions * `TopologicalSpace.IsClosedBasis s`: A closed basis of a topological space `α` is a collection of closed sets `s : Set (Set α)` such that every closed subset of `α` can be written as an intersection of elements of `s`. --- [](https://gitpod.io/from-referrer/) | t-topology | 117/0 | Mathlib.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/ClosedBases.lean | 3 | 19 | ['github-actions', 'scholzhannah'] | PatrickMassot | 4 days ago | 8 days ago | 37 days |
| 38345 | emlis42 | feat(NumberTheory): add Int.divisors | This PR adds `Int.divisors` in `Mathlib/NumberTheory/Divisors.lean`. Defines `Int.divisors` as the disjoint union of positive and negative `Nat.divisors`. Basic lemmas: * `mem_divisors` * `divisors_zero`, `divisors_eq_empty`, `divisors_one` * `one_mem_divisors`, `neg_one_mem_divisors` * `nonempty_divisors` * `mem_divisors_self` * `divisors_neg` Lemmas relating to `divisorsAntidiag`: * `image_fst_divisorsAntidiag` * `image_snd_divisorsAntidiag` | t-number-theory new-contributor maintainer-merge | 61/2 | Mathlib/NumberTheory/Divisors.lean | 1 | 21 | ['Multramate', 'SnirBroshi', 'emlis42', 'github-actions', 'tb65536'] | tb65536 | 4 days ago | 9 days ago | 9 days |
| 35316 | mkaratarakis | feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 4/5) | --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor awaiting-author | 85/0 | Mathlib.lean,Mathlib/NumberTheory/Transcendental/AnalyticPart.lean | 2 | 25 | ['MichaelStollBayreuth', 'SnirBroshi', 'github-actions', 'kebekus', 'mathlib-dependent-issues', 'mkaratarakis'] | MichaelStollBayreuth | 4 days ago | 12 days ago | 23 days |
| 35852 | Thmoas-Guan | feat(RingTheory): existence of coefficient ring | In this PR, we prove the existence of coefficient ring by the following two cases: 1: for residue field with char zero, there is a section of the residue field 2: for positive char, there exists a Cohen ring --- - [ ] depends on: #28683 - [ ] depends on: #38331 - [ ] depends on: #36102 - [ ] depends on: #37838 - [ ] depends on: #37953 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import | 2686/177 | Mathlib.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean,Mathlib/RingTheory/AdicCompletion/LocalRing.lean,Mathlib/RingTheory/AdicCompletion/Noetherian.lean,Mathlib/RingTheory/CohenStructureTheorem.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Flat/Extension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/Smooth/Field.lean | 18 | 8 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 63 days ago | 10 seconds |
| 35561 | Thmoas-Guan | feat(RingTheory): power series over regular local ring | In this PR, we proved that power series over regular local ring is again regular local ring. Same for finite multivariable power series. --- - [ ] depends on: #28682 [](https://gitpod.io/from-referrer/) | 63/0 | Mathlib.lean,Mathlib/RingTheory/RegularLocalRing/PowerSeries.lean | 2 | 5 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 70 days ago | 5 seconds | |
| 36330 | urkud | feat(UpperHalfPlane): define PGL action on the upper half-plane | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-analysis | 285/5 | Mathlib.lean,Mathlib/Analysis/Complex/UpperHalfPlane/FixedPoints.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/FinTwo.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Projective.lean | 5 | 24 | ['github-actions', 'loefflerd', 'urkud'] | nobody | 4 days ago | 52 days ago | 2 days |
| 35560 | Thmoas-Guan | feat(RingTheory): Cohen Structure Theorem | Formalization of Cohen structure theorem following https://stacks.math.columbia.edu/tag/0323 Co-authored-by: @BryceT233 --- - [ ] depends on: #28683 - [ ] depends on: #35561 - [ ] depends on: #35852 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import | 2923/177 | Mathlib.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean,Mathlib/RingTheory/AdicCompletion/LocalRing.lean,Mathlib/RingTheory/AdicCompletion/Noetherian.lean,Mathlib/RingTheory/CohenStructureTheorem.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Flat/Extension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/PowerSeries.lean,Mathlib/RingTheory/Smooth/Field.lean | 19 | 9 | ['BryceT233', 'github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 70 days ago | 8 seconds |
| 34913 | Thmoas-Guan | feat(RingTheory): Definition of complete intersection local ring | feat(RingTheory): Definition of Complete intersection ring In this PR we give the definition of complete intersection local ring by `epsilon_1(R)+ dim(R)` equal to span rank of its maximal ideal. We also proved for quotient of regular local ring, it is CI iff the ideal being quotient out is generated by regular sequence. --- - [ ] depends on: #26245 - [ ] depends on: #29533 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import merge-conflict | 6900/300 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/CategoryTheory/Abelian/Ext.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basis.lean,Mathlib/RingTheory/AdicCompletion/LocalRing.lean,Mathlib/RingTheory/AdicCompletion/Noetherian.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Catenary.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/CohenStructureTheorem.lean,Mathlib/RingTheory/CompleteIntersection/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Flat/Extension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/KoszulComplex/Cocomplex.lean,Mathlib/RingTheory/KoszulComplex/Complex.lean,Mathlib/RingTheory/KoszulComplex/Dual.lean,Mathlib/RingTheory/KoszulComplex/Homotopy.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Depth.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/PowerSeries.lean,Mathlib/RingTheory/Smooth/Field.lean,docs/references.bib | 40 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 84 days ago | 12 seconds |
| 38052 | WenrongZou | feat(FormalGroup): `F(X,0)=X` and `F(0,X)=X` | In this PR, I prove that given a formal group law `F`, then `F(X,0) = X` and `F(0,X) = X`. And modify the definition of `FormalGroup.Point` to be a subtype. And prove that this subtype is a `AddZeroClass`. Eventually we will prove that this is a `AddGroup`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 261/33 | Mathlib/RingTheory/FormalGroup/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Basic.lean,Mathlib/RingTheory/PowerSeries/Evaluation.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean | 5 | 17 | ['WenrongZou', 'eric-wieser', 'github-actions', 'mariainesdff'] | nobody | 4 days ago | 6 days ago | 16 days |
| 37441 | lecopivo | fix(FunProp): be less strict about the shape of morphism theorems | Don't be so restrictive about the shape of morphism theorems Right now, `fun_prop` has a problem with a bundled morphism `Foo α` that coerces to `α → α → α` . The coerced function has two arguments and there is an unnecessary restriction about this. This PR lifts that restriction. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.60fun_prop.60.20in.20.60FunLike.60.20with.20multiple.20arguments/with/582731349) --- [](https://gitpod.io/from-referrer/) | t-meta delegated | 42/14 | Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Theorems.lean,MathlibTest/fun_prop_dev.lean | 3 | 6 | ['Vierkantor', 'github-actions', 'joneugster', 'mathlib-bors'] | joneugster | 4 days ago | 4 days ago | 26 days |
| 34826 | wwylele | feat(Geometry/Euclidean): volume of a simplex and extra | WIP. sorry-free but still need cleaning up and breaking into smaller PRs --- - [x] depends on: #34697 - [x] depends on: #34858 - [x] depends on: #34859 - [x] depends on: #35039 - [x] depends on: #35358 - [ ] depends on: #35365 - [x] depends on: #35837 - [ ] depends on: #36018 - [x] depends on: #36462 - [x] depends on: #36466 - [x] depends on: #36952 [](https://gitpod.io/from-referrer/) | t-euclidean-geometry blocked-by-other-PR merge-conflict | 1211/6 | Mathlib.lean,Mathlib/Geometry/Euclidean/Volume/Basic.lean,Mathlib/Geometry/Euclidean/Volume/Def.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/Geometry/Euclidean/Volume/MeasureSimplex.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean,Mathlib/MeasureTheory/MeasurableSpace/Embedding.lean,Mathlib/MeasureTheory/Measure/Haar/InnerProductSpace.lean | 9 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | unknown | 0 seconds |
| 38482 | dagurtomas | feat(CategoryTheory/Tactic): specialize_map attribute | --- - [ ] depends on: #38478 [](https://gitpod.io/from-referrer/) | WIP LLM-generated t-category-theory t-meta blocked-by-other-PR | 861/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,Mathlib/Tactic/CategoryTheory/Op.lean,Mathlib/Tactic/CategoryTheory/SpecializeMap.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapSimp.lean,MathlibTest/CategoryTheory/Op.lean,MathlibTest/CategoryTheory/SpecializeMap.lean | 9 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 days ago | 6 days ago | 15 seconds |
| 38567 | dagurtomas | feat(CategoryTheory/Monoidal): autogenerate some lemmas instead of stating them explicitly | --- - [ ] depends on: #38482 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 928/166 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Limits/HasLimits.lean,Mathlib/CategoryTheory/Monoidal/Limits/Shapes/Pullback.lean,Mathlib/CategoryTheory/Monoidal/PushoutProduct.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,Mathlib/Tactic/CategoryTheory/Op.lean,Mathlib/Tactic/CategoryTheory/SpecializeMap.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapSimp.lean,MathlibTest/CategoryTheory/Op.lean,MathlibTest/CategoryTheory/SpecializeMap.lean | 12 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 days ago | 4 days ago | 8 minutes |
| 37884 | DanielJHorton | feat(LinearAlgebra/TensorProduct/Basic): add lift_zero theorem for TensorProduct | --- Added the following theorem to `TensorProduct` ``` @[simp] theorem lift_zero : lift (0 : M →ₛₗ[σ₁₂] N →ₛₗ[σ₁₂] P₂) = 0 := Eq.symm <| lift.unique fun _ _ => by simp only [LinearMap.zero_apply] ``` | new-contributor t-algebra easy awaiting-author | 4/0 | Mathlib/LinearAlgebra/TensorProduct/Basic.lean | 1 | 3 | ['github-actions', 'ocfnash'] | ocfnash | 4 days ago | 4 days ago | 17 days |
| 28796 | grunweg | feat: immersions are smooth | The conventional textbook definition demands that an immersion be smooth. When asking for the immersion to have local slice charts (as we do), this implies smoothness automatically. --- - [x] depends on: #28701 - [x] depends on: #28793 - [x] depends on: #30356 - [x] depends on: #28853 (for simplicity) - [x] depends on: #36816 [](https://gitpod.io/from-referrer/) | t-differential-geometry awaiting-author merge-conflict | 96/12 | Mathlib/Geometry/Manifold/ContMDiff/Atlas.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/Geometry/Manifold/LocalSourceTargetProperty.lean,Mathlib/Geometry/Manifold/SmoothEmbedding.lean | 4 | 57 | ['chrisflav', 'github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'sgouezel'] | PatrickMassot | 4 days ago | 106 days ago | 31 minutes |
| 27050 | BoltonBailey | doc(Control/Monad/Cont): add docstrings | Split of #25917. Adds docstrings to this file. Note: this documentation was written by asking Cursor (Claude 3.5 sonnet) to write the docstrings. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data LLM-generated | 184/1 | Mathlib/Control/Monad/Cont.lean | 1 | 9 | ['BoltonBailey', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 291 days ago | 23 hours |
| 37774 | weisbrja | fix: change variables in `bicompl` to `Sort*` and add missing theorem mentioned in `bicompl` docs | [#mathlib4 > Why does Mathlib use Type* instead of Sort* in some places?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Why.20does.20Mathlib.20use.20Type.2A.20instead.20of.20Sort.2A.20in.20some.20places.3F/with/583882342) --- [](https://gitpod.io/from-referrer/) | new-contributor t-logic merge-conflict | 6/1 | Mathlib/Logic/Function/Basic.lean | 1 | 8 | ['github-actions', 'kbuzzard', 'leanprover-radar', 'mathlib-merge-conflicts', 'weisbrja'] | nobody | 4 days ago | 4 days ago | 19 days |
| 37910 | wwylele | feat(Geometry/Euclidean): volume of a simplex | This defines the volume of a simplex in Euclidean geometry, and shows that it agrees with measure theory. It also adds the basic set of lemmas (base-and-height formula, reindex, positivity, map, and restrict). Further properties of the volume will be in future PRs. Three new file s are introduced and organized in the following dependency chain: Def.lean -> MeasureSimplex.Lean -> Basic.lean The Def.lean file has the definition only. MeasureSimplex.lean pulls in measure theory. Basic.lean publicly imports Def.lean, and privately imports MeasureSimplex.lean. When a downstream file imports Basic.lean, the measure theory part is not exposed and all properties of the volume is provided. --- - [ ] depends on: #36018 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 614/0 | Mathlib.lean,Mathlib/Geometry/Euclidean/Volume/Basic.lean,Mathlib/Geometry/Euclidean/Volume/Def.lean,Mathlib/Geometry/Euclidean/Volume/MeasureSimplex.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean | 6 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 20 days ago | 7 minutes |
| 38554 | YaelDillies | chore(Combinatorics/SimpleGraph): use the auto-param in `loopless` more | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 5/13 | Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean,Mathlib/Order/Cover.lean | 8 | 6 | ['SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | 3 days ago | 4 days ago | 4 days |
| 38427 | mckoen | feat(AlgebraicTopology/SimplicialSet): strong inner anodyne morphisms | Defines strong inner anodyne morphisms, WIP --- - [ ] depends on: #37869 [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP blocked-by-other-PR | 267/0 | Mathlib.lean,Mathlib/AlgebraicTopology/Quasicategory/Basic.lean,Mathlib/AlgebraicTopology/Quasicategory/InnerFibration.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Inner/Basic.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | 8 days ago | 14 seconds |
| 37976 | CoolRmal | feat(MeasureTheory): Lusin's theorem | We prove several versions of Lusin's theorem, all of which roughly says that measurable functions are continuous on nearly all its domain. --- - [ ] depends on: #38533 - [x] depends on: #38535 - [ ] depends on: #38536 - [ ] depends on: #38538 [](https://gitpod.io/from-referrer/) | t-measure-probability blocked-by-other-PR large-import | 792/14 | Mathlib.lean,Mathlib/MeasureTheory/Function/LusinContinuous.Lean,Mathlib/MeasureTheory/Measure/Tight.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/Maps/Basic.lean,Mathlib/Topology/Separation/GDelta.lean,Mathlib/Topology/Separation/Hausdorff.lean,docs/1000.yaml | 8 | 14 | ['CoolRmal', 'github-actions', 'grunweg', 'mathlib-dependent-issues', 'vihdzp'] | nobody | 3 days ago | 18 days ago | 17 seconds |
| 38588 | thorimur | perf: use declaration range internals in unused instances in type linters | --- [](https://gitpod.io/from-referrer/) | t-linter large-import | 57/41 | Mathlib/Order/Basic.lean,Mathlib/Tactic/Linter/UnusedInstancesInType.lean,MathlibTest/UnusedInstancesInType/Decidable.lean | 3 | 3 | ['github-actions', 'leanprover-radar', 'thorimur'] | nobody | 3 days ago | unknown | 0 seconds |
| 31670 | edwin1729 | feat(Topology/Order): Scott Topology is Sober over Algebraic DCPO | --- [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.3E.20Algebraic.20complete.20partial.20order.20and.20domain.20theory/with/536359313) here (2/2) PR to prove result in Stone Duality. Here we prove that Scott Topologies over Algebraic DCPOs are sober. - [ ] depends on: #31662 [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR new-contributor merge-conflict | 456/1 | Mathlib.lean,Mathlib/Topology/Order/ScottTopology.lean,Mathlib/Topology/Order/ScottTopologyDCPO.lean,docs/references.bib | 4 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 days ago | unknown | 0 seconds |
| 37445 | edwin1729 | feat(Topology/Order): set of compact elements, generating basic opens contained in a `Locale.PT`, is directed | This is (2/4) PRs culminating in a proof that "Scott Topologies over Algebraic DCPOs are Sober". In this PR we prove properties of a certain set of compact elements, w.r.t a `Locale.PT`. A `Locale.PT` can be thought of as a set of `Opens`. Precisely it is a Frame homomorphism from `Opens _` to `Prop` so we are essentially choosing certain `Opens` to form our set and this set has additional properties. Namely it is a completely prime filter: if the supremum of some Opens is contained than atleast one of the Opens must be contained. Take some `Locale.PT`, `x`. In this PR, we prove that the set of compact elements generating basic opens (compact elements generate topological basis see #31662) contained in `x` is directed. This set of compact elements defined above is important in subsequent parts of the proof since it fully determines `x`. - [ ] depends on: #31662 --- [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR new-contributor merge-conflict | 296/1 | Mathlib.lean,Mathlib/Topology/Order/ScottTopology.lean,Mathlib/Topology/Order/ScottTopologyDCPO.lean,docs/references.bib | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 31 days ago | 7 minutes |
| 37556 | edwin1729 | feat(Topology/Order): Locale.localePointOfSpacePoint if we have a Scott Topology from an Algebraic DCPO | (3/4) in a series of PRs proving that "Scott Topologies over Algebraic DCPOs are Sober" We prove here that the unit of the adjunction from `TopCat` to `Locale` defined in `Topology/Order/Category/FrameAdjunction.lean` is a surjective mapping, under the following condition: The underlying TopologicalSpace must be a Scott Topology generated with an underlying Algebraic DCPO structure. - [ ] depends on: #37445 --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor blocked-by-other-PR merge-conflict | 393/1 | Mathlib.lean,Mathlib/Topology/Order/ScottTopology.lean,Mathlib/Topology/Order/ScottTopologyDCPO.lean,docs/references.bib | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 29 days ago | 21 minutes |
| 38077 | b-mehta | feat(Combinatorics/Schnirelmann): prove Mann's theorem | Lots of this was done in 2024, and so it needs heavy cleaning. --- [](https://gitpod.io/from-referrer/) | WIP t-combinatorics large-import merge-conflict | 632/12 | Mathlib/Algebra/Group/Action/Pointwise/Finset.lean,Mathlib/Algebra/Group/Action/Pointwise/Set/Basic.lean,Mathlib/Algebra/Group/Action/Pointwise/Set/Finite.lean,Mathlib/Algebra/GroupWithZero/Action/Pointwise/Finset.lean,Mathlib/Combinatorics/Schnirelmann.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Fintype/Perm.lean,Mathlib/Data/Set/Finite/Lemmas.lean | 8 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 3 days ago | unknown | 0 seconds |
| 38594 | ScottCarnahan | feat(Algebra/Lie): grading on loop algebras | (WIP) put the canonical "energy" grading on a loop algebra. This will (eventually) give us the "energy" operator on smooth representations of a central extension. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra | 99/0 | Mathlib/Algebra/Lie/Loop.lean,Mathlib/LinearAlgebra/TensorProduct/Decomposition.lean | 2 | 1 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 21 seconds |
| 38500 | kebekus | feat: integral presentation of the proximity function of value distribution theory | If `f : ℂ → ℂ` is meromorphic, establish a presentation of the proximity function `proximity f ⊤` as iterated circle averages. This statement can be used to compare the proximity- and logarithmic counting functions, and is one of the key ingredients in the proof of Cartan's classic formula for the characteristic function. This is the first section of a multi-part PR, establishing Cartan's formula. --- [](https://gitpod.io/from-referrer/) | t-analysis | 211/0 | Mathlib.lean,Mathlib/Analysis/Complex/ValueDistribution/Proximity/IntegralPresentation.lean | 2 | 11 | ['github-actions', 'kebekus', 'wwylele'] | sgouezel | 3 days ago | 5 days ago | 6 days |
| 36756 | Jun2M | feat(Combinatorics/GraphLike/Walks): add general walks for `GraphLike` structures | Per discussion at ([#graph theory > HasAdj](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/HasAdj/with/575843445)), This PR introduces the basic theory of walks as a general framework that works across different graph-like structures including `SimpleGraph`, `Digraph`, and `Graph`. ## Main definitions * `Walk G u v`: The type of walks from vertex `u` to vertex `v` in a graph-like structure `G` * `Walk.length`: The number of edges in a walk * `Walk.support`: The list of vertices visited by a walk * `Walk.darts`: The list of `darts` (oriented edges) in a walk --- - [ ] depends on: #36743 - [ ] depends on: #36829 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 982/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/GraphLike.lean,Mathlib/Combinatorics/Graph/GraphLike.lean,Mathlib/Combinatorics/GraphLike/Basic.lean,Mathlib/Combinatorics/GraphLike/Symm.lean,Mathlib/Combinatorics/GraphLike/Walks/Basic.lean,Mathlib/Combinatorics/GraphLike/Walks/Simple.lean,Mathlib/Combinatorics/SimpleGraph/GraphLike.lean | 8 | 4 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 45 days ago | 9 minutes |
| 38359 | mcdoll | feat: custom `simp` sets for translating between `Equiv` and algebraic notation | --- The names for the simpsets are not great, I did ask on zulip, but no suggestions. [#mathlib4 > simpsets for moving between group and equiv](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/simpsets.20for.20moving.20between.20group.20and.20equiv/with/590381093) [](https://gitpod.io/from-referrer/) | t-algebra t-meta | 38/15 | Mathlib/Algebra/Group/End.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean,Mathlib/GroupTheory/Perm/Fin.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/Tactic/Attr/Register.lean | 5 | 4 | ['Vierkantor', 'github-actions', 'mcdoll'] | Vierkantor | 3 days ago | 3 days ago | 4 days |
| 38601 | khwilson | feat(Topology/Semicontinuity/Hemicontinuity): characterizations of hemicontintuous notions | In the previous PR we introduced two new notions attached to correspondences: having open lower sections and having an open graph. This commit introduces several useful characterizations of these notions and uses them to prove several constructions around hemicontinuous maps --- - [ ] depends on: #38600 [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR | 413/10 | Mathlib/Topology/Semicontinuity/Defs.lean,Mathlib/Topology/Semicontinuity/Hemicontinuity.lean | 2 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | 3 days ago | 16 minutes |
| 38027 | 8e7 | feat(Combinatorics/SimpleGraph/Star): define star graphs | Add a new definition `starGraph` and several key lemmas. Star graphs are a trivial class of tree, often used in constructive proofs regarding trees. An example use case is shown in #38334. --- All lemmas are hand written first, then golfed with the help of Claude Code. [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 85/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Star.lean | 2 | 39 | ['8e7', 'IvanRenison', 'JovanGerb', 'SnirBroshi', 'github-actions', 'vihdzp', 'vlad902'] | nobody | 3 days ago | 15 days ago | 17 days |
| 38604 | wwylele | chore(Algebra/Module): remove some `backward.privateInPublic` | --- [](https://gitpod.io/from-referrer/) | t-algebra tech debt | 14/30 | Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean | 2 | 1 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38580 | mcdoll | perf(Polynomial/HasseDeriv): explicit type annotations for `compHom` | --- [](https://gitpod.io/from-referrer/) | t-algebra | 4/4 | Mathlib/Algebra/Polynomial/HasseDeriv.lean | 1 | 4 | ['github-actions', 'leanprover-radar', 'mcdoll'] | nobody | 3 days ago | unknown | 0 seconds |
| 38596 | JJYYY-JJY | Add an API for row echelon forms of matrices | We write this PR to add `Mathlib.LinearAlgebra.Matrix.Echelon`, which is a theorem-oriented API for row-equivalence, echelon form, and reduced row echelon form of matrices.
The main additions are elementary row-scaling matrices, `Matrix.RowEquivalent`, echelon and reduced-echelon predicates, semantic representative predicates, existence and uniqueness of reduced echelon representatives over fields, and the noncomputable canonical representative `Matrix.rref`.
This is intentionally a semantic/theorem API rather than an executable row-reduction algorithm.
Co-authored-by: Joseph Qian |
t-algebra new-contributor | 1495/4 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Echelon.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean | 3 | 6 | ['JJYYY-JJY', 'copilot-pull-request-reviewer', 'github-actions', 'wwylele'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38589 | vlad902 | feat(SimpleGraph): add universal vertex predicate | Add the predicate `G.IsUniversal v` to indicate that `v` is a universal vertex, i.e. connected to all other vertices in `G`. This matches the recently added `G.IsIsolated v` predicate for isolated vertices.
Co-authored-by: Justin Lai |
t-combinatorics | 51/10 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Tutte.lean,Mathlib/Combinatorics/SimpleGraph/UniversalVerts.lean | 5 | 4 | ['8e7', 'github-actions', 'vlad902'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38560 | Deicyde | feat(Geometry/Manifold): `MfldCat` is a `CartesianMonoidalCategory` | We prove that the category `MfldCat` of C^n manifolds is a Cartesian monoidal category, and also derive the `BraidedCategory` instance. This PR introduces a new file `Geometry/Manifold/Category/MfldCat/CartesianMonoidal` closely mirroring the structure of `Algebra/Category/Grp/CartesianMonoidal.lean` --- - [ ] depends on: #38223 [](https://gitpod.io/from-referrer/) | t-differential-geometry blocked-by-other-PR new-contributor | 281/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/Category/MfldCat/CartesianMonoidal.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean | 4 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | unknown | 0 seconds |
| 37355 | Thmoas-Guan | feat(RingTheory): refactor `smulShortComplex` | Use `LinearMap.lsmul` for the `f` of `ModuleCat.smulShortComplex`, also providing new APIs for it. --- [](https://gitpod.io/from-referrer/) | t-ring-theory maintainer-merge | 18/21 | Mathlib/RingTheory/Regular/Category.lean | 1 | 21 | ['Thmoas-Guan', 'chrisflav', 'github-actions', 'robin-carlier'] | chrisflav | 3 days ago | 10 days ago | 31 days |
| 38555 | SnirBroshi | feat(Order/Hom/Basic): `OrderEmbedding.refl` and `OrderEmbedding.trans` | Define `OrderEmbedding.refl` and `OrderEmbedding.trans`, and add missing associativity lemmas for `OrderHom` and `OrderIso`. Also unsqueezes a couple of terminal simps in proofs about `OrderEmbedding.birkhoffFinset`/`Finset.orderEmbOfFin`/`Finset.orderEmbOfCardLe` which use `.trans` on an `OrderEmbedding` and now get `OrderEmbedding.trans` instead of `RelEmbedding.trans`. --- [](https://gitpod.io/from-referrer/) | t-order | 53/13 | Mathlib/Data/Finset/Sort.lean,Mathlib/Order/Birkhoff.lean,Mathlib/Order/Hom/Basic.lean | 3 | 5 | ['SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | 3 days ago | 4 days ago | 4 days |
| 38613 | Thmoas-Guan | feat(Algebra/Grp): add variant of is zero iff subsingleton | Add variant `IsZero (GrpCat.of G)` iff `Subsingleton G` --- [](https://gitpod.io/from-referrer/) | t-algebra | 10/0 | Mathlib/Algebra/Category/Grp/Zero.lean | 1 | 1 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38552 | joelriou | feat(AlgebraicTopology/SimplicialSet/Homology): computing homology using nondegenerate simplices | Given a simplicial set `X` and an object `R` in a preadditive category `C` (with coproducts), we introduce the chain complex `X.normalizedChainComplex R` which is a direct factor of `X.chainComplex R`, and is homotopy equivalent to it. The `n`-chains are coproducts indexed by nondegenerate `n`-simplices of `X` instead of all `n`-simplices. It follows that if `X` has dimension `< d`, then the homology of `X` vanishes in degrees `≥ d`. (This is an application of results previously obtained as part of the formalization of the Dold-Kan equivalence.) --- - [ ] depends on: #38544 - [ ] depends on: #38543 [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP blocked-by-other-PR | 486/20 | Mathlib.lean,Mathlib/Algebra/Homology/HomologicalComplex.lean,Mathlib/Algebra/Homology/ShortComplex/HomologicalComplex.lean,Mathlib/AlgebraicTopology/DoldKan/Degeneracies.lean,Mathlib/AlgebraicTopology/DoldKan/SplitSimplicialObject.lean,Mathlib/AlgebraicTopology/SimplicialObject/Split.lean,Mathlib/AlgebraicTopology/SimplicialSet/Homology/Nondegenerate.lean,Mathlib/AlgebraicTopology/SimplicialSet/Splitting.lean,Mathlib/CategoryTheory/Idempotents/Karoubi.lean | 9 | 12 | ['github-actions', 'jcommelin', 'joelriou', 'mathlib-dependent-issues', 'mathlib-splicebot', 'robin-carlier'] | nobody | 3 days ago | 5 days ago | 2 seconds |
| 26212 | Thmoas-Guan | feat(Algebra): the Rees theorem for depth | In this PR we proved the Rees theorem for depth.
Co-authored-by: Hu Yongle |
t-ring-theory blocked-by-other-PR | 312/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 9 | 60 | ['Thmoas-Guan', 'alreadydone', 'chrisflav', 'dagurtomas', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | chrisflav | 3 days ago | 32 days ago | 94 days |
| 38619 | mariainesdff | feat(Algebra/SkewPolynomial/Basic): add API | We add API for SkewPolynomial, including monomial, coeff, C and X. Co-authored by: @xgenereux. --- [](https://gitpod.io/from-referrer/) | t-algebra | 315/20 | Mathlib/Algebra/SkewPolynomial/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38370 | FordUniver | feat(Data.Finset.Powerset): add filter_powerset_subset and filter_powersetCard_subset | Add four lemmas characterising subsets of `powerset` and `powersetCard` that contain a fixed set `s`:
- `Finset.powerset_filter_sdiff`: `t.powerset.filter (s ⊆ ·) = (t \ s).powerset.image (· ∪ s)`
- `Finset.card_powerset_filter`: the count is `2 ^ (t.card - s.card)`
- `Finset.powersetCard_filter_sdiff`: `(t.powersetCard n).filter (s ⊆ ·) = ((t \ s).powersetCard (n - s.card)).image (· ∪ s)`
- `Finset.card_powersetCard_filter`: the count is `Nat.choose (t.card - s.card) (n - s.card)`
The bijection lemmas are stated as set equalities, which is strictly stronger than asserting a bijection: they imply cardinality equality, give a direct membership characterisation, and are usable as rewrites. The cardinality lemmas follow in three lines via `card_image_of_injOn`, using `LeftInvOn.injOn` to derive injectivity from the left inverse `· \ s`.
The hypothesis `s.card ≤ n` in the `powersetCard` variants is necessary: without it, natural subtraction silently gives the wrong count (`Nat.choose k 0 = 1 ≠ 0`).
Co-authored-by: Malte Jackisch |
t-data new-contributor | 52/0 | Mathlib/Data/Finset/Powerset.lean | 1 | 13 | ['FordUniver', 'github-actions', 'mathlib-bors', 'wwylele'] | nobody | 3 days ago | 9 days ago | 9 days |
| 38205 | jcommelin | chore: reduce technical debt in FreimanHom | This PR reduces technical debt related to the `CommRing` instance on `Fin (n + 1)`. --- [](https://gitpod.io/from-referrer/) | t-combinatorics large-import | 65/27 | Mathlib/Combinatorics/Additive/FreimanHom.lean | 1 | 9 | ['Vierkantor', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | 3 days ago | 4 days ago | 8 days |
| 38621 | mariainesdff | feat(Algebra/SkewPolynomial/Basic): add more API | We add API for SkewPolynomial, including the definitions erase and update and results about coefficients and supports. Co-authored by: @xgenereux. --- - [ ] depends on: #38619 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 629/24 | Mathlib/Algebra/SkewPolynomial/Basic.lean | 1 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | 3 days ago | 28 minutes |
| 38623 | mariainesdff | WIP | --- [](https://gitpod.io/from-referrer/) | WIP t-algebra | 44/2 | Mathlib/Algebra/Order/Antidiag/Prod.lean | 1 | 2 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 17 seconds |
| 36709 | kim-em | feat(DefEqAbuse): suggest minimal @[implicit_reducible] workaround | This PR extends `#defeq_abuse` to suggest a minimal set of `@[implicit_reducible]` annotations that would make the failing tactic or command succeed with `backward.isDefEq.respectTransparency true`. When `#defeq_abuse` detects a failure, it now runs a greedy minimisation over semireducible definitions reachable from the goal/command, finding a (possibly non-unique) minimal subset that, when temporarily marked `@[implicit_reducible]`, fixes the issue. The result is reported as an `info` message: ``` info: Workaround: the following @[implicit_reducible] annotations (a possibly non-unique minimal set) would paper over this problem, but the real issue is likely a leaky instance somewhere. set_option allowUnsafeReducibility true attribute [implicit_reducible] MyPred ``` This is a workaround, not a fix — the real cause is usually a leaky instance (which `#check_instance` from https://github.com/leanprover-community/mathlib4/pull/36706 can diagnose). But it can be useful for quick debugging. New helpers: `collectCandidates`, `markImplicitReducible`, `withTempImplicitReducible`, `withTempImplicitReducibleCmd`, `suggestAnnotationsTac`, `suggestAnnotationsCmd`, `formatAnnotations`, `logAnnotationSuggestions`. 🤖 Prepared with Claude Code | t-meta LLM-generated | 187/17 | Mathlib/Tactic/DefEqAbuse.lean,MathlibTest/DefEqAbuse.lean | 2 | 6 | ['github-actions', 'kim-em', 'mathlib-merge-conflicts', 'thorimur'] | dwrensha and thorimur | 3 days ago | 3 days ago | 20 days |
| 38628 | tautschnig | feat(Data/ZMod/Basic): unit characterization for ZMod (p ^ d) | Add two lemmas characterizing units in `ZMod (p ^ d)` for a prime `p`: * `ZMod.isUnit_natCast_of_not_dvd_pow`: a natural number not divisible by `p` is a unit in `ZMod (p ^ d)`. * `ZMod.prime_natCast_not_isUnit_pow`: the prime `p` is not a unit in `ZMod (p ^ d)` when `d ≥ 1`. These complement the existing `isUnit_prime_iff_not_dvd` (which characterizes when a *prime* is a unit in `ZMod n`) by characterizing when an *arbitrary* natural number is a unit in `ZMod (p ^ d)`. **Motivation.** Arithmetic verification over fixed-width bitvectors works in `ZMod (2 ^ d)`. A Gröbner basis solver over this ring needs to know which constants are invertible: odd constants are units (enabling algebraic simplification), while even constants are not (requiring fallback to SAT). These lemmas formalize that characterization for any prime, not just 2. Further work related to Gröbner basis will be published once #29203 (and, before that, #34873) have been merged. --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 12/0 | Mathlib/Data/ZMod/Basic.lean | 1 | 2 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 36364 | Bergschaf | feat(Order/Sublocale): Better API for NucleusIsoSublocale | I propose defining the conversion from Nuclei to Sublocales (and vice versa) directly in the `NucleusIsoSublocale` OrderIso. `Nucleus.toSublocale` and `Sublocale.toNucleus` will then just be abbrev's for the underlying OrderIso. This makes it a lot nicer to transition between the two Structures, especially when (infinite) infima and suprema are involved. --- [](https://gitpod.io/from-referrer/) | t-order awaiting-author | 51/35 | Mathlib/Order/Sublocale.lean | 1 | 4 | ['Bergschaf', 'Vierkantor', 'YaelDillies', 'github-actions'] | bryangingechen and pechersky | 3 days ago | 31 days ago | 22 days |
| 37850 | Vierkantor | feat(Logic): declare optional simprocs for commuting equality and iff | This PR introduces two simprocs `eqComm` and `iffComm` that can use `@[simp]` lemmas on symmetrical forms of an expression: if we have a simp lemma saying `f a = b ↔ a = g b` and the goal contains `b = f a`, then we would end up with `g b = a`. I developed these in #36534. Enabling them globally proved to be quite slow (+0,44% overall build time, which corresponds to +5% `simp`ing time), so this PR only declares them (and enables them locally, using e.g. `simp [eqComm]`, when we see that it pays off in the proof). --- [](https://gitpod.io/from-referrer/) | large-import t-meta | 145/59 | Archive/Imo/Imo2024Q5.lean,Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/MvPolynomial/Nilpotent.lean,Mathlib/Algebra/Order/Antidiag/Finsupp.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Pi.lean,Mathlib/Analysis/Complex/Arg.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Polynomial/MahlerMeasure.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/FourierTransform.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/CategoryTheory/Preadditive/Biproducts.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/Fin/Tuple/Sort.lean,Mathlib/Data/Matrix/Diagonal.lean,Mathlib/Data/Set/Prod.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Finite/Polynomial.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/Lean/Meta/Simp.lean,Mathlib/LinearAlgebra/Matrix/Permutation.lean,Mathlib/LinearAlgebra/Matrix/Stochastic.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/NumberTheory/LegendreSymbol/GaussEisensteinLemmas.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/Tactic/NormNum/Irrational.lean | 36 | 4 | ['JovanGerb', 'Vierkantor', 'github-actions'] | JovanGerb | 3 days ago | 11 days ago | 11 days |
| 38606 | dennj | feat: preparation for Vanishing Sum of Roots of Unity | Adds the Mathlib API extensions needed for an upcoming formalization of the Lam-style classification theorem for vanishing sums of roots of unity. * Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean + `exists_eq_const_of_sum_smul_eq_zero_of_sum_eq_zero_of_linearIndependent`: if `∑ vᵢ = 0` and the first `n-1` of `n` vectors are linearly independent, every linear relation has constant coefficients. * Mathlib/RingTheory/Radical/NatInt.lean + `Nat.totient_eq_div_radical_mul_totient_radical`: Euler's totient splits as `φ(n) = (n / rad n) * φ(rad n)`. * Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean + `IsPrimitiveRoot.sum_range_pow_mul_div_eq_zero_of_dvd`: the `d` evenly-spaced powers of a primitive `k`-th root sum to zero, for `d ∣ k` and `1 < d`. * Mathlib/NumberTheory/Cyclotomic/LinearDisjoint.lean (new) + `IsPrimitiveRoot.linearDisjoint_adjoin_pow_of_coprime`: cyclotomic subfields of coprime orders are linearly disjoint over `ℚ`. * Mathlib/NumberTheory/Cyclotomic/LinearRelations.lean (new) + `IsPrimitiveRoot.coeffs_eq_of_sum_pow_eq_zero_prime_coprime`: in the cyclotomic field of order `p * m` with `p` prime coprime to `m`, any `ℚ⟮ζ^p⟯`-linear relation among powers of `ζ^m` has all coefficients equal. --- I need these as preparation to start formalizing the theorem: Let k be a positive integer. If a finite family of complex k-th roots of unity sums to zero, then the size of the family is a non-negative integer combination of the prime divisors of k. --- Human-made PR with AI used for golfing and documentation | new-contributor | 219/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/NumberTheory/Cyclotomic/LinearDisjoint.lean,Mathlib/NumberTheory/Cyclotomic/LinearRelations.lean,Mathlib/RingTheory/Radical/Totient.lean,Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean | 6 | 2 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 37245 | DavidLedvinka | feat(MeasureTheory): add Resolvent (Stieltjes/Cauchy) Transform | This PR adds the definition of the `resolventTransform` of a measure and some API. This is a non-standard notion that generalizes both the Stieltjes Transform and Cauchy Transform of a (real-valued) measure so that (for example) the proof that these transforms define holomorphic functions off the support of the measure can be given for both at once. Perhaps these important special cases could be made into abbrevs? - [ ] depends on: #37172 | t-measure-probability awaiting-author | 189/0 | Mathlib.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/MeasureTheory/Measure/ResolventTransform.lean | 3 | 16 | ['EtienneC30', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | EtienneC30 | 3 days ago | 3 days ago | 25 days |
| 38640 | yuanyi-350 | refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Constructions/Polish/EmbeddingReal` | - simplifies the finite-case measurable-range proof to `Set.finite_range ((↑) : Fin n → ℝ)).measurableSet` - simplifies the countably infinite-case measurable-range proof to `Nat.isClosedEmbedding_coe_real.isClosed_range.measurableSet` Extracted from #38104 [](https://gitpod.io/from-referrer/) | codex LLM-generated | 2/7 | Mathlib/MeasureTheory/Constructions/Polish/EmbeddingReal.lean | 1 | 2 | ['github-actions', 'leanprover-radar'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38649 | chrisflav | chore(RingTheory): equality of linear map with values in finite module spreads out | We add some corollaries of `Module.Finite.exists_smul_of_comp_eq_of_isLocalizedModule`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 75/1 | Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Module.lean | 3 | 2 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 37259 | EtienneC30 | feat: blumenthal's zero-one law for Brownian motion | --- - [ ] depends on: #36616 [](https://gitpod.io/from-referrer/) | brownian t-measure-probability blocked-by-other-PR large-import | 775/6 | Mathlib.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Integral/Prod.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean,Mathlib/Probability/BrownianMotion/Basic.lean,Mathlib/Probability/BrownianMotion/GaussianProjectiveFamily.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/HasLaw.lean,Mathlib/Probability/Independence/Basic.lean,Mathlib/Probability/Independence/Integration.lean,Mathlib/Probability/Independence/Kernel/Indep.lean,Mathlib/Probability/Independence/ZeroOne.lean,Mathlib/Probability/Moments/Basic.lean,Mathlib/Probability/Process/Filtration.lean | 16 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | unknown | 0 seconds |
| 34742 | Brian-Nugent | feat(SheafCohomology): add API for Sheaf Cohomology | Defines the long exact sequence on cohomology associated to a short exact sequence of sheaves `H.longSequence`. Also defines `H.equiv₀`, the additive equivalence between `H F 0` and `((sheafSections J AddCommGrpCat).obj (op T)).obj F` when the category has a terminal object `T`. --- [](https://gitpod.io/from-referrer/) | large-import t-category-theory | 88/3 | Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean | 3 | 47 | ['Brian-Nugent', 'adamtopaz', 'dagurtomas', 'github-actions', 'joelriou', 'joneugster', 'mathlib-merge-conflicts', 'robin-carlier'] | robin-carlier | 3 days ago | 3 days ago | 78 days |
| 38586 | chrisflav | feat(RingTheory): algebra maps between finite étale algebras are locally finite split | From Pi1. --- - [ ] depends on: #38649 [](https://gitpod.io/from-referrer/) | WIP t-ring-theory large-import blocked-by-other-PR | 335/2 | Mathlib/Algebra/Algebra/Pi.lean,Mathlib/Algebra/Group/Idempotent.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/LocalRing/Basic.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Localization/Module.lean,Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean,Mathlib/RingTheory/TotallySplit.lean | 8 | 4 | ['chrisflav', 'github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | 4 days ago | 1 second |
| 38592 | SnirBroshi | feat(Logic/Embedding/Basic): `refl_trans`/`trans_refl`/`trans_assoc` | - `(.refl α).trans f = f` - `f.trans (.refl β) = f` - `(f.trans g).trans h = f.trans (g.trans h)` --- [](https://gitpod.io/from-referrer/) | t-logic | 12/0 | Mathlib/Logic/Embedding/Basic.lean | 1 | 1 | ['github-actions', 'vihdzp'] | nobody | 3 days ago | 3 days ago | 3 days |
| 36948 | Parcly-Taxel | feat: subtraction and ±1 lemmas for `IsCoprime, IsRelPrime` | From my Redhill PhD project. | t-ring-theory awaiting-author | 84/0 | Mathlib/RingTheory/Coprime/Basic.lean | 1 | 3 | ['github-actions', 'j-loreaux'] | riccardobrasca | 3 days ago | 3 days ago | 38 days |
| 36896 | PieterCuijpers | feat (Algebra/Order/Quantale): isMulIdempotent, isMulLeftsided, isMulRightsided, isMulTwosided and strict versions | * Adding definitions of quantale elements being idempotent, leftsided, rightsided, and twosided, and strict versions I'd value some discussion on whether especially the definition of isMulIdempotent would belong here, since it applies to semigroups in general. I only see definitions of IdempotentOp in the library so far, focussing on operators that are fully idempotent, while in the study of Quantales it seems that subquantales of elements that are idempotent in the original are also interesting. This argues the need for having definitions on separate elements. Also, should we include these definitions in the main Algebra/Order/Quantale.lean file, or start a separate file for them? And I have a few basic theorems I would like to include, but invite suggestions. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-author | 81/1 | Mathlib/Algebra/Order/Quantale.lean | 1 | 4 | ['NoahW314', 'chrisflav', 'github-actions'] | mariainesdff | 3 days ago | 3 days ago | 39 days |
| 36210 | vbeffara | feat(Combinatorics/SimpleGraph): definitions of graph contraction and graph minor | A contraction is the image of a graph through a surjective function with connected fibers, and a minor is a contraction of a subgraph. This PR shows that being a contraction is transitive, but does not show the same for minors because the proof is more involved, it will be in a subsequent PR. The definitions are in `Prop` and do not contain data, but I'm not sure if that was the right choice. --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author | 151/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Contraction.lean,Mathlib/Combinatorics/SimpleGraph/Minor.lean | 3 | 8 | ['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'robin-carlier', 'vbeffara'] | b-mehta | 3 days ago | 3 days ago | 53 days |
| 38656 | NoahW314 | feat(Data/Finsupp/Weight): add `Finsupp.degree_mapDomain` | Generalize a result by removing an unnecessary hypothesis. Also simplifies the proof. --- [](https://gitpod.io/from-referrer/) | t-data | 9/8 | Mathlib/Data/Finsupp/Weight.lean,Mathlib/Order/Filter/TendstoCofinite.lean | 2 | 2 | ['NoahW314', 'github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38374 | idontgetoutmuch | Fundamental Vector Fields are Vertical | --- [](https://gitpod.io/from-referrer/) | t-differential-geometry new-contributor | 1644/0 | Mathlib/Geometry/Manifold/Algebra/FakeForm.lean,Mathlib/Geometry/Manifold/Algebra/FakeFormII.lean,Mathlib/Geometry/Manifold/Algebra/PrincipalGBundle.lean,Mathlib/Geometry/Manifold/Algebra/SmoothLieExp.lean | 4 | 2 | ['github-actions'] | nobody | 3 days ago | unknown | 0 seconds |
| 38086 | dagurtomas | feat(CategoryTheory): composition of profunctors | --- - [x] depends on: #38085 - [ ] depends on: #38382 [](https://gitpod.io/from-referrer/) | t-category-theory blocked-by-other-PR | 697/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Chosen/End.lean,Mathlib/CategoryTheory/Limits/Types/End.lean,Mathlib/CategoryTheory/Profunctor/Bicategory.lean,Mathlib/CategoryTheory/Profunctor/Comp.lean,Mathlib/Logic/Relation.lean | 6 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | 16 days ago | 7 seconds |
| 38029 | Thmoas-Guan | feat(RingTheory): lemmas for minimal primes to lessen defeq abuse | Remove access by `.1.1` and `.1.2` to mem minimal primes. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 77/59 | Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean | 6 | 6 | ['Thmoas-Guan', 'chrisflav', 'github-actions', 'themathqueen'] | nobody | 3 days ago | 7 days ago | 16 days |
| 37500 | Thmoas-Guan | refactor(RingTheory/Ideal/Height): minimize usages of `Ideal.primeHeight` | deprecate and private most of `primeHeight` APIs, providing height variant. --- - [ ] depends on: #38029 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 179/155 | Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean | 6 | 8 | ['Thmoas-Guan', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | chrisflav | 3 days ago | 17 days ago | 12 days |
| 32058 | Thmoas-Guan | feat(Algebra): category version Baer criterion | In this PR, we added the cateory version of Baer criterion stating that `M` is injective iff `Ext^1(R/I, M)` vanish for all ideal `I`. --- - [x] depends on: #36980 [](https://gitpod.io/from-referrer/) | t-algebra t-category-theory | 137/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean | 3 | 48 | ['Thmoas-Guan', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | dagurtomas | 3 days ago | 7 days ago | 38 days |
| 29558 | Thmoas-Guan | feat(Algebra): definition of global dimension | In this PR, we define projective dimension and global dimension using `CategoryTheory.HasProjectiveDimensionLT` --- - [ ] depends on: #32058 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 257/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/RingTheory/GlobalDimension.lean | 4 | 17 | ['Thmoas-Guan', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | erdOne | 3 days ago | 123 days ago | 27 days |
| 31999 | Thmoas-Guan | feat(RingTheory): global dimension equals the supremum over localizations | Global dimension of ring is equal to supremum of global dimension over localizations at all prime/maximal ideal. --- - [x] depends on: #32000 - [x] depends on: #31998 - [ ] depends on: #29558 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 339/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/RingTheory/GlobalDimension.lean | 4 | 17 | ['Thmoas-Guan', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 days ago | 157 days ago | 1 day |
| 37627 | Thmoas-Guan | refactor(RingTheory/Ideal/Height): torwards private `Ideal.primeHeight` | --- - [ ] depends on: #37500 [](https://gitpod.io/from-referrer/) | WIP t-ring-theory blocked-by-other-PR | 241/179 | Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean | 6 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 27 days ago | 1 minute |
| 28683 | Thmoas-Guan | feat(RingTheory): regular local ring is domain | In this PR, we proved for a regular local ring `R`, 1 : for a finite set `S` in the maximal Ideal of `R`, it can be extended to a regular system of parameters iff they are linear independent in the cotangent space iff `R/span S` is regular local ring of dimesion `dim R - |S|` 2 : is domain 3 : regular system of parameter form regular sequence. --- - [x] depends on: #28682 - [ ] depends on: #37500 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 515/155 | Mathlib.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean | 11 | 57 | ['Raph-DG', 'Thmoas-Guan', 'WenrongZou', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'mbkybky'] | nobody | 3 days ago | 30 days ago | 1 day |
| 37189 | Brian-Nugent | feat(AlgebraicGeometry): The pushforward of a quasi-coherent sheaf between affines is quasi-coherent | To be more precise, we show that if `AlgebraicGeometry.Scheme.Modules.fromTildeΓ` is an isomorphism then the same holds for the pushforward. This will show that being quasicoherent is stable under pushforward for affine morphisms once it is shown that `AlgebraicGeometry.Scheme.Modules.fromTildeΓ` being an isomorphism is equivalent to being quasicoherent. --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry | 178/5 | Mathlib/Algebra/Category/ModuleCat/Localization.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/Topology/Sheaves/SheafCondition/Sites.lean | 4 | 23 | ['Brian-Nugent', 'chrisflav', 'github-actions', 'joelriou'] | adamtopaz | 3 days ago | 3 days ago | 26 days |
| 36777 | jjdishere | feat(Valuation/ValuativeRel): generalize `ValuativeRel` to non-commutative rings | This is the second in a series of PRs, with the final goal of removing the class `Valued` from Mathlib. A `Valued` instance will be replaced by `[ValuativeRel R] [UniformSpace R] [IsValuativeTopology R] [IsUniformAddGroup R] (v : Valuation R A) [v.Compatible]`. This PR generalize `ValuativeRel` from `CommRing` to `Ring` by adding a field `vle_mul_comm {x y} : vle (x * y) (y * x)`. Without this field, the value group associated to the valuative relation may be non-abelian. The APIs of `ValuativeRel.ofValuation` and `ValuativeRel.valuation` are also generalized, showing this new definition is indeed equivalent to the valuations on non commutative rings. This is a prerequisite of #36769 . --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author | 210/128 | Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Valuation/DiscreteValuativeRel.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Trivial.lean,Mathlib/Topology/Algebra/ValuativeRel/ValuativeTopology.lean,Mathlib/Topology/Algebra/Valued/ValuativeRel.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 8 | 46 | ['JovanGerb', 'faenuccio', 'github-actions', 'jjdishere', 'leanprover-radar', 'mathlib-bors', 'riccardobrasca', 'wwylele'] | faenuccio and riccardobrasca | 3 days ago | 32 days ago | 11 days |
| 29701 | Thmoas-Guan | feat(Algebra/RingTheory): polynomial over regular ring | In this PR, we proved that polynomial over regular ring is regular. --- - [x] depends on: #28684 [](https://gitpod.io/from-referrer/) | t-ring-theory | 128/0 | Mathlib.lean,Mathlib/RingTheory/RegularLocalRing/Polynomial.lean | 2 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 3 days ago | 8 days ago | 8 days |
| 25822 | ScottCarnahan | WIP: experiments with vertex algebras | This is a testbed for various attempts at things. Please don't bother reviewing. --- [](https://gitpod.io/from-referrer/) --- *This PR continues the work from #25821.* *Original PR: https://github.com/leanprover-community/mathlib4/pull/25821* | WIP large-import merge-conflict | 8688/329 | Mathlib.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Lie/ChevalleyEilenberg.lean,Mathlib/Algebra/Lie/Cochain.lean,Mathlib/Algebra/Lie/Cocycle.lean,Mathlib/Algebra/Lie/Extension.lean,Mathlib/Algebra/Lie/Extension/CentralExtension.lean,Mathlib/Algebra/Lie/Graded.lean,Mathlib/Algebra/Lie/Loop.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/MonoidAlgebra/PointwiseSMul.lean,Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Monoid/Prod.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Algebra/Polynomial/Nusmeval.lean,Mathlib/Algebra/Polynomial/Smeval.lean,Mathlib/Algebra/Ring/NegOnePow.lean,Mathlib/Algebra/Vertex/Affine.lean,Mathlib/Algebra/Vertex/Basic.lean,Mathlib/Algebra/Vertex/Defs.lean,Mathlib/Algebra/Vertex/HVertexOperator.lean,Mathlib/Algebra/Vertex/Lattice.lean,Mathlib/Algebra/Vertex/VertexOperator.lean,Mathlib/Data/Finset/SMulAntidiagonal.lean,Mathlib/Data/Finsupp/PointwiseSMul.lean,Mathlib/Data/FunLike/Equiv.lean,Mathlib/Data/Prod/RevLex.lean,Mathlib/Data/Set/SMulAntidiagonal.lean,Mathlib/GroupTheory/GroupAction/Equiv.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/RingTheory/Binomial.lean,Mathlib/RingTheory/DividedPowers/Cauchy.lean,Mathlib/RingTheory/FormalSeries.lean,Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/HahnSeries/Basic.lean,Mathlib/RingTheory/HahnSeries/Binomial.lean,Mathlib/RingTheory/HahnSeries/HEval.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Summable.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/PowerSeries/Binomial.lean | 45 | 32 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 3 days ago | 323 days ago | 2 seconds |
| 36775 | ADedecker | feat: flip arguments for continuous linear maps under finite dimension assumptions | --- - [x] depends on: #36776 - [x] depends on: #36870 - [ ] depends on: #37435 - [ ] depends on: #37439 - [x] depends on: #37614 - [ ] depends on: #38168 [](https://gitpod.io/from-referrer/) | t-topology blocked-by-other-PR | 540/32 | Mathlib.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/Spaces/CompactConvergenceCLM.lean,Mathlib/Topology/Algebra/Module/Spaces/ContinuousLinearMap.lean,Mathlib/Topology/Algebra/Module/Spaces/FiniteDimensionCLM.lean,Mathlib/Topology/Algebra/Module/Spaces/UniformConvergenceCLM.lean | 7 | 9 | ['ADedecker', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | j-loreaux | 3 days ago | 32 days ago | 9 days |
| 34799 | vlad902 | feat(SimpleGraph): the cycle graph and complete graph are Hamiltonian | --- - [ ] depends on: #34797 - [ ] depends on: #35255 - [ ] depends on: #37930 [](https://gitpod.io/from-referrer/) | t-combinatorics large-import blocked-by-other-PR merge-conflict | 29/0 | Mathlib/Combinatorics/SimpleGraph/Copy.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean | 2 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 86 days ago | 2 minutes |
| 38664 | joelriou | feat(AlgebraicTopology/SimplicialSet): more API for `SSet.op` | --- - [ ] depends on: #38662 [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP blocked-by-other-PR | 198/0 | Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/AlgebraicTopology/SimplicialSet/KanComplex/MulStruct.lean,Mathlib/AlgebraicTopology/SimplicialSet/Op.lean,Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 3 days ago | 3 days ago | 1 second |
| 32305 | faenuccio | feat: define Sobolev Spaces | Nothing to see yet. --- - [ ] depends on: #32250 - [ ] depends on: #31809 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis large-import | 2487/53 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/Distribution.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Distribution/WeakDeriv.lean,Mathlib/Analysis/FunctionalSpaces/Sobolev/Basic.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean | 7 | 7 | ['ADedecker', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 3 days ago | 151 days ago | 2 seconds |
| 38346 | joelriou | feat(AlgebraicTopology): augmented simplicial objects with an extra degeneracy are "contractible" | --- - [x] depends on: #38360 [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP | 270/0 | Mathlib.lean,Mathlib/AlgebraicTopology/ExtraDegeneracy.lean,Mathlib/AlgebraicTopology/ExtraDegeneracy2.lean,Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/AlgebraicTopology/SimplicialObject/DeltaZeroIter.lean | 5 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 9 days ago | 1 second |
| 37350 | aditya-ramabadran | feat(Analysis/Distribution): define canonical maps between Schwartz/test functions, distributions/tempered distributions | Defines these canonical maps: (1) continuous linear map from $\mathcal D$ to $\mathcal S$, and (2) induced (linear) restriction map from $\mathcal S'$ to $\mathcal D'$, as assigned by @ADedecker. --- Put in a separate file since Distribution.lean only imports TestFunction right now and I thought it was cleaner to do in a new bridge file with both the maps. Open to changing this though. * Made use of #36445 (proved first map locally on fixed support spaces first by local seminorm estimates, then used limitCLM) * Needed a real to complex bridge `TestFunction.ToComplexSchwartzMap` since distributions are defined on real-valued test functions but tempered distributions in mathlib are defined on complex-valued Schwartz functions * Induced map $\mathcal S'(E,F) \to \mathcal D'(Ω,F)$ is $\mathbb C$-linear The main important defs are `ContDiffMapSupportedIn.toSchwartzMapCLM` which is the local fixed-support part, then `TestFunction.toSchwartzMapCLM` (where the continuity uses limitCLM to glue the local continuous linear maps on each $\mathcal D_K$), and `TemperedDistribution.toDistributionLM` which is the linear map from tempered distributions to ordinary distributions. Tested with `lake env lean Mathlib/Analysis/Distribution/TestFunctionSchwartz.lean` [](https://gitpod.io/from-referrer/) | t-analysis new-contributor awaiting-author | 279/0 | Mathlib.lean,Mathlib/Analysis/Distribution/TestFunctionSchwartz.lean | 2 | 19 | ['aditya-ramabadran', 'github-actions', 'j-loreaux'] | j-loreaux | 2 days ago | 2 days ago | 27 days |
| 36439 | xgenereux | feat(Algebra/Adjoin): CoeDep instances for Algebra.adjoin on singletons | It is a common occurrence that I need to consider an element `x` or some polynomial evaluated in `x`, `p.eval x` as an element of `Algebra.adjoin R {x}`. This makes it so that we can write - `(x : adjoin R {x})` instead of `⟨x, self_mem_adjoin_singleton A x⟩` - `(p.eval x : adjoin R {x})` instead of `⟨p.aeval x, aeval_mem_adjoin_singleton A x⟩` This is particularly useful when we need to write the type anyways, so that we need not to write `(⟨p.aeval x, aeval_mem_adjoin_singleton A x⟩ : adjoin R {x})` anymore. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 33/3 | Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/RingTheory/Adjoin/Polynomial/Basic.lean | 2 | 17 | ['Vierkantor', 'chrisflav', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'xgenereux'] | jcommelin | 2 days ago | 3 days ago | 38 days |
| 37861 | Jun2M | feat(Combinatorics/Graph): connected graphs | This PR introduces - `IsConnectedComponentOf`, a graph is a connected component of another graph, and - `IsConnected`, a graph is a self component Under this definition, an empty graph is not connected. Co-authored-by: Peter Nelson [apn.uni@gmail.com](mailto:apn.uni@gmail.com) --- - [x] depends on: #37610 - [ ] depends on: #36756 [](https://gitpod.io/from-referrer/) | t-combinatorics blocked-by-other-PR | 92/0 | Mathlib.lean,Mathlib/Combinatorics/Graph/Connected/Component.lean | 2 | 6 | ['Jun2M', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 14 days ago | 3 days |
| 38216 | joelriou | feat(AlgebraicTopology/SimplicialSet/KanComplex): MulStruct.assoc | --- - [ ] depends on: #38665 - [ ] depends on: #38662 - [ ] depends on: #38664 - [x] depends on: #38172 - [x] depends on: #38367 - [x] depends on: #38063 [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP large-import blocked-by-other-PR | 444/3 | Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/AlgebraicTopology/SimplicialSet/CategoryWithFibrations.lean,Mathlib/AlgebraicTopology/SimplicialSet/KanComplex.lean,Mathlib/AlgebraicTopology/SimplicialSet/KanComplex/MulStruct.lean,Mathlib/AlgebraicTopology/SimplicialSet/Op.lean,Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean | 6 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 12 days ago | 1 second |
| 37951 | martinwintermath | chore(Geometry/Convex/Cone): rework `PointedCone.dual` to take a cone as input in place of a set | Rework `PointedCone.dual` to take as input a cone instead of a set. This is done to untangle the functionality of `PointedCone.dual` from `PointedCone.hull` and to align it with the signature of its submodule analogue `Submodule.orthogonalBilin` (partially, with proposed functionality from #34007). See also the discussion here: [#mathlib4 > Reorganizing bilinearity and orthogonality?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Reorganizing.20bilinearity.20and.20orthogonality.3F/with/583882414). Main changes: * change signature `dual (s : Set M)` to `dual (C : PointedCone R M)`. * deprecate `dual_hull` since now obsolete in this form, instead add `mem_dual_hull` in addition to `mem_dual`. * deprecate all of `dual_empty`, `dual_zero` and `dual_singleton_zero` in favor of only `dual_bot`. * deprecate `dual_univ` in favor of `dual_top`. * add notation `R ∙₊ x` in analogy to submodule version `R ∙ x`, for use in new lemma `dual_hull_singleton`. * deprecate `dual_insert` since now obsolete (use `Submodule.span_insert` instead). * deprecate `dual_union`, `dual_iUnion` and `dual_sUnion` in favor of `dual_sup`, `dual_sSup` and `dual_iSup`. * remove `dual_sup` since now obsolete and name has been reused (see above). * add `dual_sup_ker` and `dual_univ_eq_ker` to align with (proposed) submodule analogue for `Submodule.orthogonalBilin`. * deprecate `dual_image` in favor of `dual_map` * add `hull_eq` (cone version of `span_eq`) since used in `basis_coord_mem_dual`. * adjust doc-strings Numerous changes to other files have been necessary. The dual-variants for proper cones or inner product spaces have not yet been adapted to cone-inputs, though this should happen eventually. The definition of `DualFG` has been changed to "duals of `FG`-cones" instead of "duals of finite sets" (also getting rid of `Finset` as previously requested). --- - [x] depends on: #37950 - [x] depends on: #37542 [](https://gitpod.io/from-referrer/) | 226/129 | Mathlib/Analysis/Convex/Cone/Dual.lean,Mathlib/Analysis/Convex/Cone/InnerDual.lean,Mathlib/Analysis/Convex/Cone/TensorProduct.lean,Mathlib/Geometry/Convex/Cone/Dual.lean,Mathlib/Geometry/Convex/Cone/DualFinite.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean,Mathlib/Geometry/Convex/Cone/TensorProduct.lean | 7 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 2 days | |
| 36326 | Arnav-panjla | Feat/gaussian schwartz map | feat(Analysis/SpecialFunctions/Gaussian): define the Gaussian as a Schwartz function in 1D Define the Gaussian function `x ↦ exp (-x^2)` as a `SchwartzMap` in the one-dimensional case. The proof establishes the Schwartz decay conditions by showing that polynomially weighted expressions of the form `(1 + x^2)^m * exp (-x^2)` are bounded. This allows the Gaussian to be packaged using the `SchwartzMap` API. During the implementation a few adjustments were required to match the current Mathlib API. In particular: * replace the non-existent `IsBigO.mul_right` with `IsBigO.of_bound` applied to the full product `(1 + x^2)^m * exp (-x^2)` * fix `mem_cocompact` usage by replacing `(hh_tendsto.eventually ...).mem_cocompact` with `mem_cocompact.mp (hh_tendsto ...)` * adjust the `hb_bound` step using `gcongr` with exact bounds so that both goals close * remove the unused declaration `hf_nonpos` * register the required import in `Mathlib.lean` This implements the one-dimensional case mentioned in the issue. The generalization to Gaussians associated with arbitrary positive-definite bilinear forms can be added in a follow-up PR. Closes #33072 | t-analysis new-contributor | 235/0 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/SchwartzMap.lean | 2 | 4 | ['CoolRmal', 'github-actions'] | nobody | 2 days ago | 55 days ago | 1 minute |
| 35255 | vlad902 | feat(SimpleGraph): `cycleGraph.IsContained` in every graph with a cycle | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 35/0 | Mathlib/Combinatorics/SimpleGraph/Circulant.lean | 1 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 2 days |
| 37067 | kbuzzard | feat: add_group tactic | Written by Claude Code, additivising the `group` tactic, although there were some problems which needed human input. --- [](https://gitpod.io/from-referrer/) This is me burning Claude credits as a result of this comment [#mathlib4 > MulAut and to_additive @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/MulAut.20and.20to_additive/near/581059625) . Just to be clear, all comments below are human-written by me with 0 AI assistance. To my amusement, naively additivising the `group` tactic to make an `add_group` tactic does not work. The problem is that the algorithm run by `group` involves adding `← zpow_neg_one` to the simp set, which rewrites `x⁻¹` to `x ^ (-1)` for `x` in any group: the idea is that `x ^ (z : Int)` is preferred in the algorithm and `x⁻¹` is eliminated. Amusingly, when additivised, this becomes `-x -> -1 • x` which then immediately becomes `(-1 • 1) • x` which then becomes `((-1 • 1) • 1) • x` etc etc, as the integers are themselves an additive group. So we need to find another way of normalising terms of the form `-x`. Claude found the following trick: drop `← neg_one_zsmul` and `neg_one_zsmul_add`, and use `neg_add_rev` and `neg_zero` to reduce `-(a+b)` and `-0`, use `zsmul_neg` to reduce `n • (-a)` to `(-n) • a` and then use things like `add_neg_cancel_right` and `neg_add_cancel_right` to do `-b + b` and `b + -b` together with some new `zsmul_neg_trick` lemmas which normalise `(n • b) + -b` to `(n - 1) • b`. etc. The idea is to ensure that any consecutive chains of `b`'s and `-b`'s and `z • b`'s will now all get amalgamated into something of the form `z • b`, but we cannot change `-b` to `-1 • b` so have to try harder than in the multiplicative case. Here is a detailed (human-written!) explanation of the difference between `Tactic/AddGroup.lean` and the additivisation of `Tactic/Group.Lean`. 1) Note that the `zpow_trick` lemmas in `Tactic/Group.lean` are additivised, so we import `Group.lean` in `AddGroup.lean` to access these additivised lemmas. 2) `Mathlib.Algebra.Group.Commutator` has no additive version (and it's not clear that it should have one), so we don't use an additive version of `commutatorElement_def` (which expands `⁅g₁, g₂⁆` to `g₁ * g₂ * g₁⁻¹ * g₂⁻¹`). Note: that means that we cannot additivise a test. 3) Line 67 of the additive file uses `neg_add_rev, neg_zero, zsmul_neg, ← neg_zsmul,` as a workaround for the looping ` ← zpow_neg_one`. 4) `Int.mul_neg, Int.neg_mul` are dropped (they don't seem to be needed, all tests are passing, ring_nf is probably doing this.) 5) `sub_eq_add_neg` is added: people use subtraction in additive groups; division doesn't seem to be covered for multiplicative groups? So `add_group` can solve `a + b - b = a` but `group` cannot solve `a * b / b = a`. *** There is also one fewer test in the `add_group` tests, as I had to remove the commutator test. I don't know much at all about tactic-writing, the PR is all Claude code, but a lot of it is to_additive copypasta. The review of the code above is my own. | t-meta LLM-generated awaiting-author | 189/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/AddGroup.lean,MathlibTest/AddGroup.lean | 4 | 21 | ['JovanGerb', 'SnirBroshi', 'github-actions', 'kbuzzard', 'mathlib-merge-conflicts', 'thorimur'] | thorimur | 2 days ago | 6 days ago | 28 days |
| 38667 | SnirBroshi | feat(Order/Hom/Basic): equivalences of `Order{Hom/Embedding/Iso}` | - `OrderHom`s are equivalent to `RelHom`s of `LE` (unlike `OrderEmbedding`/`OrderIso` they aren't defined using it) - Congruence equivs for `OrderEmbedding`/`OrderIso` when the two sides are order-isomorphic. This already exists for `OrderHom`. --- [](https://gitpod.io/from-referrer/) | t-order | 55/1 | Mathlib/Order/Hom/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38364 | openendings | feat: create Order/DirectedCompletePartialOrder/Defs.lean | Define DirectedCompletePartialOrder and its interaction with iSup and sSup. --- A DirectedCompletePartialOrder is equivalently: - a partial order with LUBs of nonempty directed sets; - what happens when you remove ⊥ from a CompletePartialOrder; or - a ConditionallyCompletePartialOrder in which every directed set is BddAbove. Like CPOs, DCPOs are commonly studied in denotational semantics. Potential applications: - [#Is there code for X? > Summing `ENat`s without topology](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/590070848) -- defining infinite sums in an DCPO-enriched `AddCommMonoidWithTop` such as `ENat` or `ENNReal`. - [#Is there code for X? > Scott Induction](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Scott.20Induction/with/590112858) -- fixpoint theorems similar to `OmegaCompletePartialOrder`, generalised to arbitrary cardinalities. [](https://gitpod.io/from-referrer/) | t-order new-contributor | 123/0 | Mathlib.lean,Mathlib/Order/DirectedCompletePartialOrder/Defs.lean,docs/references.bib | 3 | 4 | ['SnirBroshi', 'github-actions', 'openendings'] | nobody | 2 days ago | 8 days ago | 9 days |
| 35610 | IvanRenison | feat(Data/Fin): add several lemmas about subtraction of `Fin.{castLT, castAdd, castSucc, castPred}` | --- [](https://gitpod.io/from-referrer/) | t-data awaiting-author | 74/0 | Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/SuccPred.lean | 2 | 13 | ['IvanRenison', 'chrisflav', 'github-actions', 'robin-carlier', 'wwylele'] | eric-wieser | 2 days ago | 3 days ago | 65 days |
| 36681 | SnirBroshi | feat(SetTheory/Ordinal/Commute): the smallest nonzero ordinal that add-commutes with a given ordinal | For any ordinal `o`, `(ω ^ log ω o) + o % (ω ^ log ω o)` is the smallest nonzero ordinal that add-commutes with `o`.
This value can also be calculated by considering the CNF of `o` with base `ω` and changing the first
coefficient to `1`.
---
The proofs involve annoying algebraic manipulations (to annihilate the tails as explained below), golfs welcome.
Details on the math involvedThink about the Cantor-normal form: #36664 shows `AddCommute o₁ o₂ ↔ ∃ (o : Ordinal) (n₁ n₂ : ℕ), o * n₁ = o₁ ∧ o * n₂ = o₂`. If you write a given ordinal `o` in CNF in base `ω` as `(ω ^ e₀) * c₀ + (ω ^ e₁) * c₁ + ...` then `o * n = (ω ^ e₀) * (c₀ * n) + (ω ^ e₁) * c₁ + ...`. Notice that only the leading term got multiplied by `n`, because the earlier copies of `o` annihilate all the tails except for the last one (e.g. `o * 2 = o + o = (ω ^ e₀) * c₀ + tail + (ω ^ e₀) * c₀ + tail = (ω ^ e₀) * c₀ + (ω ^ e₀) * c₀ + tail = (ω ^ e₀) * (c₀ * 2) + tail`). So given the characterization of `AddCommute`, if we keep the tail and remove the `* c₀` from the leading coefficient (effectively calculating `o / c₀`, we'll get the smallest ordinal that we can multiply by a natural number to get `o`. `o / (o / (ω ^ log ω o))` should also give the same smallest ordinal (and `o - (ω ^ log ω o) * (o / (ω ^ log ω o) - 1)`), but I chose the expression that fits the existing CNF definitions. Maybe a future PR can show they're all equal. |
t-set-theory awaiting-author | 71/1 | Mathlib/SetTheory/Ordinal/Commute.lean,Mathlib/SetTheory/Ordinal/Principal.lean | 2 | 25 | ['SnirBroshi', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | vihdzp | 2 days ago | 2 days ago | 6 days |
| 25974 | scholzhannah | feat(Topology/Compactness/CompactlyCoherentSpace): compact coherentification (k-ification) | This PR defines the notion of turning an arbitrary topological space into a compactly coherent space. Compactly coherent spaces are commonly referred to as "compactly generated spaces" or "k-spaces" in the literature while the operation of turning a space into such as space is called the "k-ification". There are however three different notions that are described with this name. To disambiguate we use the names "compactly coherent space" and "compactcoherentification" here. See [this wikipedia page](https://en.wikipedia.org/wiki/Compactly_generated_space) for an explanation of these notions.
This PR continues the work from #25318.
Original PR: https://github.com/leanprover-community/mathlib4/pull/25318
Co-authored-by: Floris van Doorn |
t-topology large-import | 162/5 | Mathlib/Topology/Compactness/CompactlyCoherentSpace.lean | 1 | 6 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot', 'scholzhannah'] | j-loreaux | 2 days ago | 14 days ago | 161 days |
| 29774 | Raph-DG | feat(AlgebraicGeometry): Order of vanishing of elements of the function field of locally noetherian, integral schemes | In this PR, we define the order of vanishing of elements of the function field of locally noetherian, integral schemes at points of codimension 1. This is essentially just a wrapper around the API for the order of vanishing for rings (i.e. Ring.ord and Ring.ordFrac), but I think it's good to have this too for usability. --- - [ ] depends on: #29550 - [ ] depends on: #26735 [](https://gitpod.io/from-referrer/) | t-algebraic-geometry | 101/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/FunctionField.lean,Mathlib/AlgebraicGeometry/OrderOfVanishing.lean | 3 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | joelriou | 2 days ago | 3 days ago | 3 days |
| 33714 | idontgetoutmuch | feat(Mathlib/Geometry/Manifold): Riemannian metrics exist II | Supersedes https://github.com/leanprover-community/mathlib4/pull/33519 --- [](https://gitpod.io/from-referrer/) | t-differential-geometry new-contributor | 723/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Geometry/Manifold/ExistsRiemannianMetric.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean | 4 | 200 | ['Rida-Hamadani', 'github-actions', 'grunweg', 'idontgetoutmuch'] | fpvandoorn | 2 days ago | 12 days ago | 57 days |
| 34805 | DavidLedvinka | feat(Tactic): generalize ofScientific NormNum extension to `DivisionSemiring` | Co-authored-by: @hrmacbeth | t-meta | 68/20 | Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/NormNum/OfScientific.lean,MathlibTest/norm_num.lean | 3 | 26 | ['DavidLedvinka', 'JovanGerb', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'thorimur'] | dwrensha | 2 days ago | 40 days ago | 61 days |
| 36806 | grunweg | fix(Tactic/Continuity): mark Continuous.comp' as unsafe | This issue was pre-existing: `Continuous.comp'` was never full safe, as a constant function could be written as the composition of any function and a constant function (and then applying the lemma could lead to something unprovable). The change in #31607 triggered such a case: make is an unsafe rule with very high probability instead. This change broke three proofs: one was easy to switch to fun_prop; the others seemed to depend on this being a safe rule. I have added a workaround for now. There was another test failure, exposing a pre-existing internal bug in aesop. With smaller imports, continuity succeeds [zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/aesop.20error.20during.20proof.20reconstruction.2C.20goal.20not.20normalised/with/580202602), so I have accepted this result as fine. --- [](https://gitpod.io/from-referrer/) | t-meta | 54/2 | Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Condensed/Light/TopCatAdjunction.lean,Mathlib/Condensed/TopCatAdjunction.lean,Mathlib/Topology/Continuous.lean,MathlibTest/Continuity.lean | 5 | 1 | ['github-actions'] | thorimur | 2 days ago | 44 days ago | 44 days |
| 37501 | xgenereux | feat(DedekindDomain/AdicValuation): `intValuation` on uniformizers is `exp (-1)` | This PR add the lemma `intValuation_val_uniformizer_eq` which is an application of #37497. Note that I've had to reorganize the files a little bit: 1. I wanted to import `Valuation.Discrete.Basic` in `AdicValuation` but this was not possible since there was a dependency in the other direction (`Valuation.Discrete.Basic` depended on `AdicValuation`). I don't think this makes sense - we want to have access to basic definitions on general valuation in an application file like `AdicValuation`. ~~The reorganization consist of moving the `IsDiscreteValuationRing` of `Valuation.Discrete.Basic` to `AdicValuation`.~~ The reorganization consist of moving the `IsDiscreteValuationRing` section to a new file. 2. I moved some lemmas out of `Mathlib.RingTheory.Valuation.Discrete.RankOne` to the parent file `Mathlib.RingTheory.Valuation.Discrete.Basic.`. These lemmas do not need the richer imports from `RankOne` and are needed in my application. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- - [ ] depends on: #37497 [](https://gitpod.io/from-referrer/) | t-ring-theory | 203/167 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/OrderOfVanishing/Noetherian.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/IsDiscreteValuationRing.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean | 8 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | mattrobball | 2 days ago | 13 days ago | 21 days |
| 37747 | JovanGerb | chore(Order/Filter/AtTopBot/Basic): use `to_dual` | This PR uses `to_dual` for `atTop`/`atBot`. A lot of theorems that have been tagged contain the expression `∀ a ≥ b, ...`, which means that their dual will be `∀ a, b ≥ a → ...`, which is obviourly undesirable. Hence, I would like to ask the reviewers to reconsider the possibility of merging #32985. --- [](https://gitpod.io/from-referrer/) | t-order | 56/164 | Mathlib/Order/Filter/AtTopBot/Basic.lean | 1 | 1 | ['github-actions'] | bryangingechen | 2 days ago | 24 days ago | 24 days |
| 37752 | JovanGerb | chore(Order/CompleteLattice/Lemmas): use `to_dual` | Use `to_dual` for lemmas about `CompleteLattice`. --- [](https://gitpod.io/from-referrer/) | t-order | 27/56 | Mathlib/Order/CompleteLattice/Lemmas.lean | 1 | 1 | ['github-actions', 'vihdzp'] | bryangingechen | 2 days ago | 24 days ago | 24 days |
| 37753 | JovanGerb | chore(Order/Filter/Basic): use `to_dual` for `≤ᶠ` | Use `to_dual` on lemmas about `EventuallyLE`. --- [](https://gitpod.io/from-referrer/) | t-order | 19/6 | Mathlib/Order/Filter/Basic.lean | 1 | 2 | ['github-actions', 'vihdzp'] | bryangingechen | 2 days ago | 24 days ago | 24 days |
| 38523 | joelriou | feat(Topology/Convenient): open/closed subsets that are also `X`-generated | Let `X : ι → Type*` be a family of topological spaces. If all the opens (resp. closed) subsets of the `X i` are `X`-generated, then any open (resp. closed) subset of an `X`-generated space is `X`-generated. --- [](https://gitpod.io/from-referrer/) | t-topology | 94/0 | Mathlib.lean,Mathlib/Topology/Convenient/OpenClosed.lean | 2 | 1 | ['github-actions'] | urkud | 2 days ago | 6 days ago | 6 days |
| 38533 | CoolRmal | feat(Topology): subspace of a perfectly normal space is perfectly normal | The mains theorems proved in this PR are - A topological space is perfectly normal iff every closed set is the zero set of a continuous function taking values in the unit interval. - Every subspace of a perfectly normal space is perfectly normal. --- [](https://gitpod.io/from-referrer/) | t-topology | 150/2 | Mathlib.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/Maps/Basic.lean,Mathlib/Topology/Separation/GDelta.lean,Mathlib/Topology/Separation/Hausdorff.lean,Mathlib/Topology/Separation/PerfectlyNormal.lean | 6 | 15 | ['CoolRmal', 'github-actions', 'leanprover-radar', 'scholzhannah'] | j-loreaux | 2 days ago | 4 days ago | 5 days |
| 38543 | joelriou | feat(AlgebraicTopology/DoldKan): morphisms which vanishes on degeneracies | --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology maintainer-merge | 58/3 | Mathlib/AlgebraicTopology/DoldKan/Degeneracies.lean | 1 | 4 | ['github-actions', 'joelriou', 'robin-carlier'] | robin-carlier | 2 days ago | 5 days ago | 5 days |
| 38581 | kebekus | feat: integrability of terms in Cartan's formula | If `f : ℂ → ℂ` is meromorphic, establish the circle integrability of the function `a ↦ log ‖meromorphicTrailingCoeffAt (f · - a) 0‖` and compute values of the circle integral. The circle integral in question is one of the main terms in Cartan's classic formula, describing the characteristic function `characteristic f ⊤ r` as a sum of circle averages. This is the second section of a four-part PR, establishing Cartan's formula and its most immediate corollaries. --- [](https://gitpod.io/from-referrer/) | t-topology t-analysis | 156/0 | Mathlib.lean,Mathlib/Analysis/Complex/ValueDistribution/Cartan.lean,Mathlib/Topology/DiscreteSubset.lean | 3 | 2 | ['github-actions', 'kebekus'] | j-loreaux | 2 days ago | 4 days ago | 4 days |
| 38584 | TJHeeringa | feat(Analysis/InnerProductSpace/Reproducing): Add outerKernel, mem_iff |
---
Adds the `outerKernel` definition and the theorem `mem_iff`. These are needed for proving statements involving embeddings of RKHS.
I can split `mem_of_posSemidef` and `mem_iff` off into a different pull request if that is preferred.
The theorems `mem_of_posSemidef` and `posSemidef_of_mem` are the two directions of `mem_iff`. `posSemidef_of_mem` is slightly stronger than the converse direction of `mem_iff` in the sense that it also specifies the constant `c` in the statement. The specified `c` is in fact the smallest possible `c` for which the statement holds.
The statement `mem_of_posSemidef` proves `∃ (g : H), (g : X → V) = f`. We could instead write `f ∈ (coeCLM 𝕜 (H:=H)).range`. Making this change would require the addition of the line `simp only [LinearMap.mem_range, coe_coe, coeCLM_apply]` in the beginning of the proof. The full beginning is then
```
lemma mem_of_posSemidef (f : X → V) {c : ℝ}
(hc : ((c : 𝕜) ^ 2 • kernel H - outerKernel 𝕜 f).PosSemidef) : f ∈ (coeCLM 𝕜 (H:=H)).range := by
simp only [LinearMap.mem_range, coe_coe, coeCLM_apply]
let Laux : ...
```
Making a `MemRKHS` like MemLp and MemSobolev and then writing `MemRKHS H f` is also an option. Happy to change it to whatever is preferred.
The proof of `mem_of_posSemidef` is based on the idea that any function f in the RKHS satisfies ` |
t-analysis new-contributor | 126/1 | Mathlib/Analysis/InnerProductSpace/Reproducing.lean | 1 | 2 | ['github-actions'] | ADedecker | 2 days ago | 4 days ago | 4 days |
| 38598 | khwilson | feat(Analysis/Convex/Basic): two useful lemmas on pointwise operations | In proofs about locally convex spaces, it's common to need that `(1/2) * s + (1/2) * s = s` for convex `s` and that `closure s <= s + s` when `s` is open and contains `0`. We add these lemmas, which will be used ultimately in a proof of Michael's selection theorem. --- [](https://gitpod.io/from-referrer/) | t-topology | 15/1 | Mathlib/Analysis/Convex/Basic.lean,Mathlib/Topology/Algebra/Group/Pointwise.lean | 2 | 1 | ['github-actions'] | mcdoll | 2 days ago | 3 days ago | 3 days |
| 38599 | khwilson | feat(Topology/Algebra/IsUniformGroup): characteriztaion of uniform cauchy sequences in topological groups | Topological groups had several lemmas about uniform convergence, but were missing a lemma about a sequence being a uniform cauchy sequence. This PR fills that gap. This is a simplifying lemma on the way to Michael's selection theorem. --- [](https://gitpod.io/from-referrer/) | t-topology | 8/0 | Mathlib/Topology/Algebra/IsUniformGroup/Basic.lean | 1 | 1 | ['github-actions'] | urkud | 2 days ago | 3 days ago | 3 days |
| 38600 | khwilson | feat(Topology/Semicontinuity): additional definitions for correspondences | On the way to proving Michael's selection theorem, several extra notions related to hemicontinuity are introduced. Specifically, the notion of a correspondence having lower sections and it having an open graph. The first construction is what is used in the proof of Michael's theorem to generate approximations to the target selection. The second is used in the iterative step to generate new lower hemicontinuous maps. --- [](https://gitpod.io/from-referrer/) | t-topology | 349/0 | Mathlib/Topology/Semicontinuity/Defs.lean | 1 | 1 | ['github-actions'] | j-loreaux | 2 days ago | 3 days ago | 3 days |
| 38691 | bryangingechen | chore: lake shake --add-public --keep-implied --keep-prefix --fix | 355 files changed: - +389 imports added - -297 imports removed --- [](https://gitpod.io/from-referrer/) | large-import | 390/297 | Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/Category/MonCat/Colimits.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/Algebra/Category/Ring/Topology.lean,Mathlib/Algebra/Free.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Int/Even.lean,Mathlib/Algebra/Group/Nat/Even.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Submonoid/Support.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/Map.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/MapBijective.lean,Mathlib/Algebra/Homology/HomologicalComplexAbelian.lean,Mathlib/Algebra/Homology/ModelCategory/Lifting.lean,Mathlib/Algebra/LinearRecurrence.lean,Mathlib/Algebra/Module/Injective.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/Algebra/Module/Submodule/Invariant.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MvPolynomial/Cardinal.lean,Mathlib/Algebra/MvPolynomial/Division.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Funext.lean,Mathlib/Algebra/MvPolynomial/Nilpotent.lean,Mathlib/Algebra/Order/Archimedean/Class.lean,Mathlib/Algebra/Order/Archimedean/Submonoid.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Group/Indicator.lean,Mathlib/Algebra/Order/Ring/Archimedean.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Algebra/Polynomial/Eval/Coeff.lean,Mathlib/Algebra/Regular/Defs.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/Morphisms/Finite.lean,Mathlib/AlgebraicGeometry/Morphisms/SchemeTheoreticallyDominant.lean,Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean,Mathlib/AlgebraicGeometry/Morphisms/WeaklyEtale.lean,Mathlib/AlgebraicGeometry/Noetherian.lean,Mathlib/AlgebraicTopology/SimplicialCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplicialComplex/Basic.lean,Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/AlgebraicTopology/SimplicialSet/Monoidal.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplices.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplicesSubcomplex.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/CStarAlgebra/Projection.lean,Mathlib/Analysis/Calculus/DerivativeTest.lean,Mathlib/Analysis/Calculus/FDeriv/Affine.lean,Mathlib/Analysis/Calculus/LogDeriv.lean,Mathlib/Analysis/Complex/CanonicalDecomposition.lean,Mathlib/Analysis/Complex/Harmonic/Liouville.lean,Mathlib/Analysis/Complex/Harmonic/Poisson.lean,Mathlib/Analysis/Complex/JensenFormula.lean,Mathlib/Analysis/Complex/Schwarz.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Manifold.lean,Mathlib/Analysis/Complex/UpperHalfPlane/ProperAction.lean,Mathlib/Analysis/ConstantSpeed.lean,Mathlib/Analysis/Convex/Approximation.lean,Mathlib/Analysis/Convex/FunctionTopology.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/Positive.lean,Mathlib/Analysis/Normed/Module/Bases.lean,Mathlib/Analysis/Normed/Module/DoubleDual.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/ODE/DiscreteGronwall.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/RingInverseOrder.lean,Mathlib/Analysis/SpecialFunctions/Stirling.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/ChebyshevGauss.lean,Mathlib/CategoryTheory/Abelian/Preradical/Colon.lean,Mathlib/CategoryTheory/Adhesive/Subobject.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Widesubcategory.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Jointly.lean,Mathlib/CategoryTheory/Limits/Constructions/WidePullbackOfTerminal.lean,Mathlib/CategoryTheory/Limits/FunctorCategory/Shapes/Terminal.lean,Mathlib/CategoryTheory/Limits/Preserves/SigmaConst.lean,Mathlib/CategoryTheory/Limits/Preserves/Yoneda.lean,Mathlib/CategoryTheory/Limits/Yoneda.lean,Mathlib/CategoryTheory/Monad/Types.lean,Mathlib/CategoryTheory/Monoidal/Internal/Limits.lean,Mathlib/CategoryTheory/Monoidal/Widesubcategory.lean,Mathlib/CategoryTheory/MorphismProperty/CommaSites.lean,Mathlib/CategoryTheory/MorphismProperty/OfObjectProperty.lean,Mathlib/CategoryTheory/Shift/Adjunction.lean,Mathlib/CategoryTheory/Sites/Continuous.lean,Mathlib/CategoryTheory/Sites/Descent/Precoverage.lean,Mathlib/CategoryTheory/Sites/Hypercover/One.lean,Mathlib/CategoryTheory/Sites/Hypercover/Saturate.lean,Mathlib/CategoryTheory/Sites/Over.lean,Mathlib/CategoryTheory/Sites/Point/OfIsCofiltered.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean | 356 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 37364 | kim-em | feat(Tactic/Linter): add `auxLemma` linter for auto-generated declaration references | This PR adds a syntax linter that flags explicit references to auto-generated auxiliary declarations such as `_proof_N`, `match_N`, `_match_N`, and `_sizeOf_N`. These names are internal to the Lean elaborator and are not stable across refactors (e.g. reordering fields in a structure can renumber `_proof_` indices). The linter matches precisely: it requires the suffix after the prefix to be all digits, so `_proof_helper` would not be flagged. It only inspects identifier syntax nodes, so references in comments and docstrings are ignored. Current hits in Mathlib (suppressed with `set_option linter.style.auxLemma false`): - `Mathlib/CategoryTheory/Functor/Category.lean` — `hcomp._proof_2` - `Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean` — `constFormalMultilinearSeries.match_1.eq_2` - `Mathlib/Data/List/Sigma.lean` — `_sizeOf_1` Companion PR to track these suppressions in the tech debt report: https://github.com/leanprover-community/mathlib-ci/pull/17 🤖 Prepared with Claude Code | t-linter | 87/1 | Mathlib.lean,Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/Data/List/Sigma.lean,Mathlib/Init.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/AuxLemma.lean,MathlibTest/CompileInductive.lean,MathlibTest/interactiveUnfold.lean,MathlibTest/toAdditive.lean | 10 | 35 | ['github-actions', 'kim-em', 'leanprover-radar', 'mathlib-merge-conflicts', 'thorimur'] | thorimur | 2 days ago | 2 days ago | 5 days |
| 38551 | TTony2019 | feat(Analysis/Convex/Intrinsic): add `affineSpan_prod_eq` and `intrinsicInterior_prod_eq` | ### Summary We prove that the affine span of a product set equals the product of the affine spans, and that the intrinsic interior of a product set equals the product of the intrinsic interiors. - `affineSpan_prod_eq`: for `s : Set P₁` and `t : Set P₂`, `affineSpan k (s ×ˢ t) = (affineSpan k s) ×ˢ (affineSpan k t)` as sets. - `intrinsicInterior_prod_eq`: for `s : Set P` and `t : Set Q`, `intrinsicInterior 𝕜 (s ×ˢ t) = intrinsicInterior 𝕜 s ×ˢ intrinsicInterior 𝕜 t`. These two theorems are added to `Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean` and `Mathlib/Analysis/Convex/Intrinsic.lean`. ### Collaboration Co-authored-by: @imathwy | new-contributor | 144/0 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Analysis/Convex/Intrinsic.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean,Mathlib/LinearAlgebra/Prod.lean | 5 | 21 | ['TTony2019', 'github-actions', 'wwylele'] | nobody | 2 days ago | 2 days ago | 5 days |
| 37073 | kim-em | feat: add wrap_instance% using core's wrapInstance | This PR adds a new `wrap_instance%` term elaborator that delegates to Lean core's `wrapInstance` (from https://github.com/leanprover/lean4/pull/12897), and replaces ~53 `fast_instance%` call sites where the replacement is safe. `wrap_instance%` is a thin wrapper (~15 lines) around `Lean.Meta.wrapInstance`. Like `fast_instance%`, it reduces instances to constructor applications and reuses canonical sub-instances. Unlike `fast_instance%`, it works at `instances` transparency and delegates all normalization logic to core. The replaced sites cover: - Equiv/type-alias transfers (WithAbs, WithConv, WithVal, WithLp, TransferInstance) - Surjective constructors (Con, RingCon quotients, module congruences) - DFunLike leaf instances (MultilinearMap, ContinuousMultilinearMap, AlternatingMap, Intertwining) - Quotient instances (LinearAlgebra/Quotient/Defs) - inferInstanceAs% sites (StandardPart, Presentation/Core) - Miscellaneous (InfiniteAdeleRing, ZMod) This PR *doesn't* attempt to replace all `fast_instance%`; it gets more complicated! 🤖 Prepared with Claude Code | 88/59 | Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/Algebra/WithConv.lean,Mathlib/Analysis/Normed/Lp/WithLp.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/LinearAlgebra/Alternating/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/Tactic/FastInstance.lean,Mathlib/Topology/Algebra/Module/Alternating/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 16 | 7 | ['JovanGerb', 'github-actions', 'kim-em', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 5 days | |
| 37295 | wwylele | feat(Analysis/InnerProductSpace): generalized determinant of a rectangle matrix / linear map | This is the volume factor of a linear map --- I have encountered the expression `sqrt(det(T' * T))` a few times in various places but it doesn't look like it has a standard name and entry in mathlib, so this adds it. Zulip thread [#Is there code for X? > (norm of) "determinant" of map between inner product spaces](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/.28norm.20of.29.20.22determinant.22.20of.20map.20between.20inner.20product.20spaces/with/581776873) One motivation to define this is to state volume formula under transformations. From *Measure theory and fine properties of functions*: - Lemma 3.1: for linear map $L : \mathbb{R}^n \to \mathbb{R}^m$, we have $\mathcal{H}^n(L(A)) = [ L ] \mathcal{L}^n(A)$. This is proved in this PR at `euclideanHausdorffMeasure_image_eq_normDet_mul_volume` - Theorem 3.8, for (not necessarily linear) $f : \mathbb{R}^n \to \mathbb{R}^m$ ($n \le m$) and $\mathcal{L}^n$-measurable set $A \subset \mathbb{R}^n$, we have $\int_A J f dx = \int_{\mathbb{R}^m} \mathcal{H}^0(A \cap f\^{-1}\{y\}) d\mathcal{H}^n(y)$, where $J f$ is the `normDet` of the rectangular Jacobian matrix AI usage disclosure: AI was used in the following parts - searching for related literature for an appropriate name - generate draft proofs for some lemma to verify their correctness, though the final code has been completely rewritten by me. - [ ] depends on: #37918 [](https://gitpod.io/from-referrer/) | t-analysis | 480/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/NormDet.lean,docs/references.bib | 3 | 15 | ['copilot-pull-request-reviewer', 'github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'wwylele'] | j-loreaux | 2 days ago | 2 days ago | 30 days |
| 36327 | themathqueen | feat(Analysis/CStarAlgebra/Extreme): a C⋆-algebra is unital iff there exists an extreme point in the closed unit ball | Co-authored-by: Jon Bannon <59937998+JonBannon@users.noreply.github.com>
Co-authored-by: Jireh Loreaux |
t-analysis awaiting-author | 280/5 | Mathlib/Analysis/CStarAlgebra/ApproximateUnit.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Isometric.lean,Mathlib/Analysis/CStarAlgebra/Extreme.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/Topology/ContinuousMap/Bounded/Normed.lean,Mathlib/Topology/ContinuousMap/Compact.lean | 6 | 6 | ['github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'themathqueen'] | nobody | 2 days ago | 2 days ago | 12 minutes |
| 38698 | Thmoas-Guan | feat(RingTheory/Regular): freeness of `QuotSMulTop` | For finitely generated module `M` over Noetherian local ring `(R, m)`, if `x ∈ m` is `M`-regular, `M/xM` is free over `R/(x)` iff `M` is free over `R`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 114/0 | Mathlib.lean,Mathlib/RingTheory/Regular/Free.lean | 2 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 28546 | Sfgangloff | feat(SymbolicDynamics): basic setup of Zd, full shift, cylinders, pat… | This PR adds a **group-generic** foundation for symbolic dynamics over an arbitrary group `G`, together with convenient specializations for `ℤ` and `ℤ^d`. Summary of additions: - **Full shift and shift action** - `abbrev FullShift (A G) := G → A` (inherits product topology from the Π-type). - Right shift `shift g x` with convention `(shift g x) h = x (h * g)`. - **Cylinders and topology** - `cylinder U x : Set (G → A)` for finite `U : Finset G`. - Cylinders are open under `[DiscreteTopology A]`; with a finite alphabet they are also closed. - Equality with dependent products: `cylinder U x = Set.pi (↑U) (fun i => ({x i} : Set A))`, enabling use of the `Set.pi` API. - **Patterns, occurrences, and subshifts** - `Pattern A G` with finite `support : Finset G` and `data : support → A`. - `Pattern.occursIn p x g` (occurrence at translate `g`) and the expected shift law. - `forbids F` and `Subshift A G` (closed, shift-invariant subsets). - `FixedSupport A G U` with an equivalence to `(U → A)` to obtain finiteness. - **Language on finite shapes and counting** - `languageOn X U`, `languageCardOn X U`, and `patternCountOn Y U`. - **Entropy along a shape sequence** - `limsupAtTop` (as an `sInf` of eventual upper bounds). - `entropyAlong X F hF := limsup (log (patternCountOn X (F n) + 1) / |F n|)` for any nonempty finite shapes `F : ℕ → Finset G` (the `+ 1` avoids `log 0`). - **Specializations** - `IntShapes`: segments `[-n,n]` on `Multiplicative ℤ`, with `entropy_Z`. - `ZdShapes`: boxes `[-n,n]^d` on `ℤ^d` (as functions `Fin d → ℤ`), with `entropy_Zd`. Mathematical remarks: - The API is **shape-parametric**: entropy is defined along user-provided finite shapes. - On **amenable** groups, using a **Følner** sequence yields a canonical value (Ornstein–Weiss). This PR does not assume amenability; the family of shapes is an explicit input. Motivation: Provide a clean, reusable base for symbolic dynamics on groups in mathlib. Future work: - Add a Følner predicate and prove shape-independence / limit existence on amenable groups. - Expand the `ℤ`/`ℤ^d` toolkit (alternative shapes, mixing, factors). - Develop 1D theory and, longer-term, multidimensional SFT results (e.g. along the lines of Hochman–Meyerovitch). | t-dynamics new-contributor | 631/0 | Mathlib.lean,Mathlib/Dynamics/SymbolicDynamics/Basic.lean,Mathlib/Tactic/Translate/ToAdditive.lean | 3 | 187 | ['Sfgangloff', 'botbaki-review', 'eric-wieser', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'sgouezel'] | urkud | 2 days ago | 2 days ago | 165 days |
| 37779 | mcdoll | feat(Data/FunLike): introduce typeclasses for algebraic properties of `FunLike` | These typeclasses remove the need for each function space that has, e.g., a linear structure to define `add_apply`, `smul_apply`, etc. Instead after defining the the `Add` instance one also defines a `FunLikeAdd` instance (with a proof usually being `rfl`). This removes some boilerplate as theorems like `sum_apply` are currently proved in various files, but here they can be proved in an abstract way. Moreover, we can remove all of the instances that provide further structure (such as `Semigroup`` in the concrete function spaces. This further removes boilerplate and also makes sure that all instances are available in every function space. The docstrings were generated with AI (and heavily edited afterwards), everything else is handwritten. --- The previous PR #33477 has gotten quite a few merge conflicts, so I opened a new PR with just the new features. I would like to get the approval of this design before going through the library and change everything. I am open to either do this in this PR or a second one (or multiple for different parts). - [x] depends on: #38401 - [x] depends on: #38398 [](https://gitpod.io/from-referrer/) | t-data | 590/0 | Mathlib.lean,Mathlib/Data/FunLike/Group.lean,Mathlib/Data/FunLike/IsApply.lean,Mathlib/Data/FunLike/Module.lean,Mathlib/Data/FunLike/Ring.lean | 5 | 10 | ['Vierkantor', 'github-actions', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mcdoll'] | Vierkantor | 2 days ago | 2 days ago | 3 days |
| 38357 | SnirBroshi | feat(Combinatorics/SimpleGraph/Coloring/Greedy): Greedy coloring | --- Dependencies are included as sorried theorems to make the diff saner, but exist in the dependent PRs in full. - [ ] depends on: #35619 - [x] depends on: #35622 - [x] depends on: #35628 - [ ] depends on: #36626 - [ ] depends on: #38422 [](https://gitpod.io/from-referrer/) | t-combinatorics large-import blocked-by-other-PR | 309/1 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Greedy.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 9 days ago | 50 minutes |
| 35218 | kim-em | feat(GroupTheory/Coxeter/Perm): type A Coxeter group maps to symmetric group | This PR constructs the canonical surjective homomorphism from the type A Coxeter group to the symmetric group, sending simple reflections to adjacent transpositions. - `swapFun`: maps generator `i` to `swap i.castSucc i.succ` - `swapFun_isLiftable`: adjacent transpositions satisfy the Coxeter relations - `CoxeterMatrix.typeAₙToPermHom`: the homomorphism from `(Aₙ n).Group` to `Perm (Fin (n + 1))` - `CoxeterMatrix.typeAₙToPermHom_surjective`: surjectivity - [ ] depends on: #35217 🤖 Prepared with Claude Code | blocked-by-other-PR t-group-theory LLM-generated | 214/2 | Mathlib.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/GroupTheory/Coxeter/Perm.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/GroupTheory/PresentedGroup.lean | 9 | 7 | ['eric-wieser', 'github-actions', 'joneugster', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 77 days ago | 11 minutes |
| 35219 | kim-em | feat(GroupTheory/Artin): define Artin groups and their universal property | This PR defines Artin groups (also called Artin-Tits groups) as presented groups associated to Coxeter matrices, and establishes their universal property. - `CoxeterMatrix.ArtinGroup`: the Artin group associated to a Coxeter matrix - `CoxeterMatrix.artinGenerator`: the generators of the Artin group - `CoxeterMatrix.IsArtinLiftable`: the braid relation condition for liftability - `CoxeterMatrix.artinLift`: the universal property of Artin groups - `CoxeterMatrix.artinToCoxeter`: the canonical surjection to the Coxeter group - `CoxeterMatrix.artinToCoxeter_surjective`: surjectivity - [ ] depends on: #35218 🤖 Prepared with Claude Code | blocked-by-other-PR t-group-theory LLM-generated | 429/2 | Mathlib.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Artin/Basic.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/GroupTheory/Coxeter/Perm.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/GroupTheory/PresentedGroup.lean | 10 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 77 days ago | 10 minutes |
| 26214 | Thmoas-Guan | feat(Algebra): definition of depth | In this PR, we defined the depth of two modules as the minimal order of nonvanishing `Ext` and the `I-depth` for ideal `I` and some basic properties. Including the equivalence of the two in the condition of rees theorem. --- - [ ] depends on: #26212 - [ ] depends on: #32966 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 721/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 10 | 9 | ['Thmoas-Guan', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 315 days ago | 2 minutes |
| 26215 | Thmoas-Guan | feat(Algebra): Auslander–Buchsbaum theorem | This PR mainly proved the Auslander-Buchsbaum theorem stating for a noetherian local ring `R` and a finitely generated `R` module `M` , `proj.dim(M) + depth(M) = depth(R)`.
Co-authored-by: Yongle Hu |
t-algebra blocked-by-other-PR | 1098/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 11 | 11 | ['Thmoas-Guan', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 315 days ago | 1 minute |
| 26216 | Thmoas-Guan | feat(Algebra): depth of QuotSMulTop | In this PR, we proved for a local ring `R` and a finitely generated `R` module `M N`, `IsSMulRegular M x` and `x ∈ Module.annihilator R N`, then `depth(N, M/xM) + 1 = depth(N, M)`, and its corollary for quotient regular seqence. --- - [ ] depends on: #26214 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 986/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 10 | 9 | ['Thmoas-Guan', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 315 days ago | 49 seconds |
| 26217 | Thmoas-Guan | feat(Algebra): Ischebeck theorem | This PR mainly proved the Ischbecke theorem, stating that `depth(N,M)` is greater or equal to `depth(M) - dim(N)` for finitely generated module `N, M` over local ring. --- - [ ] depends on: #26214 - [x] depends on: #32081 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 929/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 11 | 11 | ['Thmoas-Guan', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 315 days ago | 51 seconds |
| 26218 | Thmoas-Guan | feat(Algebra): definition of cohen macaulay | In this PR, we added the definition of CM module, CM local ring (extending local ring), and CM ring. We also proved Theorem 30, Chater 6, _Commutative Algebra_, Matsumura. --- - [x] depends on: #26219 - [ ] depends on: #26217 - [ ] depends on: #26216 - [ ] depends on: #28582 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 1753/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 12 | 18 | ['Thmoas-Guan', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 315 days ago | 52 seconds |
| 28599 | Thmoas-Guan | feat(RingTheory): polynomial over CM ring is CM | polynomial over Cohen Macaulay ring is Cohen Macaulay --- - [ ] depends on: #26218 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 1927/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Polynomial.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 13 | 16 | ['Thmoas-Guan', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | mariainesdff | 2 days ago | 71 days ago | 3 days |
| 26245 | Thmoas-Guan | feat(Algebra): cohen macaulay local ring is catenary | We prove Cohen Macaulay local ring is catenary. Following Theorem 31, Chater 6, _Commutative Algebra_, Matsumura --- - [ ] depends on: #26218 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 2143/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Catenary.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 13 | 18 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 314 days ago | 18 seconds |
| 26957 | Thmoas-Guan | feat(Algebra): unmixed thm of Cohen-Macaulay ring | In this PR we proved for a (comm)ring `R`, `R` is Cohen-Macaulay ring iff the unmixed theorem holds (for every ideal `I` of height `r` generated by `r` elements, all associated primes of `R/I` have height `r` ) --- - [ ] depends on: #26245 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 2319/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Catenary.lean,Mathlib/RingTheory/CohenMacaulay/Unmixed.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib | 14 | 16 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 295 days ago | 3 minutes |
| 32941 | kim-em | feat(GroupTheory/Artin): add braid groups as Artin groups of type A | This PR defines braid groups as Artin groups of type A. - `BraidGroup n`: the braid group B_n on n strands - `BraidGroup.σ`: the standard Artin generators - `BraidGroup.toPermHom`: the canonical surjection B_n → S_n - `BraidGroup.braidGroupTwoEquivInt`: B_2 ≃* ℤ - [ ] depends on: #35219 🤖 Prepared with Claude Code | t-group-theory blocked-by-other-PR LLM-generated | 590/2 | Mathlib.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Artin/Basic.lean,Mathlib/GroupTheory/Artin/Braid.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/GroupTheory/Coxeter/Perm.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/GroupTheory/PresentedGroup.lean | 11 | 26 | ['eric-wieser', 'github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'robin-carlier', 'tb65536', 'themathqueen'] | tb65536 | 2 days ago | 78 days ago | 13 days |
| 29557 | Thmoas-Guan | feat(Algebra): finite projective dimension of regular | In this PR, we proved every finitely generated module over regular local ring has finite projective dimension. With this and Auslander Buchsbaum theorem, we can obtain the global dimension of regular local ring is equal to its krull dimension. --- - [ ] depends on: #29533 - [ ] depends on: #26215 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 2952/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/GlobalDimension.lean,docs/references.bib | 26 | 15 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 232 days ago | 32 minutes |
| 29534 | Thmoas-Guan | feat(Algebra): global dimension of regular local ring | In this PR, we proved the global dimension of regular local ring is equal to its krull dimension via Auslander Buchsbaum theorem. --- - [ ] depends on: #29557 - [ ] depends on: #26215 - [ ] depends on: #29558 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 3240/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/GlobalDimension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/GlobalDimension.lean,docs/references.bib | 29 | 19 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 232 days ago | 34 minutes |
| 35217 | kim-em | feat: auxiliary lemmas for Artin and braid groups | This PR adds small lemmas to existing files, in preparation for the Artin groups and braid groups PRs. - `Commute.mul_pow_eq_one`: for commuting elements with `a ^ m = 1` and `b ^ m = 1` - `Equiv.Perm.swap_conjugate`: braid relation for adjacent transpositions - `Equiv.Perm.swap_mul_swap_comm_of_disjoint`: disjoint transpositions commute - `@[grind =]` attributes on `Perm.mul_apply`, `Perm.one_apply`; new `Perm.pow_add_one_apply` - `Subgroup.normalClosure_singleton_one` - `FreeGroup.ofList` and associated lemmas - `FreeGroup.freeGroupUnitMulEquivInt` - `PresentedGroup.instUniqueOfIsEmpty` - `CoxeterMatrix.Aₙ_adjacent`, `CoxeterMatrix.Aₙ_far` 🤖 Prepared with Claude Code | t-group-theory LLM-generated | 97/2 | Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/Algebra/Group/End.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/GroupTheory/PresentedGroup.lean | 7 | 15 | ['eric-wieser', 'github-actions', 'kim-em', 'mathlib-merge-conflicts', 'themathqueen'] | thorimur | 2 days ago | 2 days ago | 8 days |
| 37814 | sglasman | feat: Equivalence between HopfAlgCat R and Hopf (ModuleCat R) | This PR resolves a TODO by demonstrating an equivalence of categories between two models of the category of Hopf algebras over a commutative ring R, that of Hopf objects in the module category of R and that of types with a `HopfAlgebra R` instance. --- AI declaration: I consulted with Claude on proof strategies. The proofs were ultimately written by me. | new-contributor large-import t-category-theory WIP | 214/4 | Mathlib/CategoryTheory/Monoidal/Hopf_.lean,Mathlib/RingTheory/HopfAlgebra/Basic.lean | 2 | 5 | ['dagurtomas', 'github-actions', 'robin-carlier', 'sglasman'] | kim-em | 2 days ago | 8 days ago | 14 days |
| 29699 | Thmoas-Guan | feat(Algebra/RingTheory): global dimension of regular ring | In this PR, we proved that the global (homological dimension) of regular ring is equal to its krull dimension. --- - [ ] depends on: #28684 - [ ] depends on: #31999 - [ ] depends on: #29534 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 3351/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/GlobalDimension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/GlobalDimension.lean,docs/references.bib | 29 | 21 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 227 days ago | 10 minutes |
| 33461 | loefflerd | feat(NumberTheory/Modular): stabilizers for action on upper halfplane | --- [](https://gitpod.io/from-referrer/) | WIP | 351/1 | Mathlib.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/Analysis/Complex/UpperHalfPlane/ProjLine.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/Defs.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/FinTwo.lean,Mathlib/LinearAlgebra/Projectivization/Action.lean,Mathlib/Topology/Compactification/OnePoint/ProjectiveLine.lean | 7 | 8 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 120 days ago | 1 second |
| 29802 | Thmoas-Guan | feat(Algebra/RingTheory): Auslander–Buchsbaum–Serre criterion and its corollaries | In this PR, we proved that: 1: The full version of Auslander–Buchsbaum–Serre criterion 2: Localization of regular local ring is regular 3: Global dimension finite implies regular (doesn't need local) 4: Regular ring only need to be verified at maximal ideals. --- - [ ] depends on: #29534 - [ ] depends on: #29699 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 3883/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/GlobalDimension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/AuslanderBuchsbaumSerre.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/GlobalDimension.lean,Mathlib/RingTheory/RegularLocalRing/Localization.lean,docs/references.bib | 31 | 22 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 224 days ago | 7 minutes |
| 29703 | Thmoas-Guan | feat(Algebra/RingTheory): Hilbert's Syzygy theorem (projective version) | In this PR, we proved for field `k`, `MvPolynomial (Fin n) k` has global dimension `n`. --- - [ ] depends on: #29701 - [ ] depends on: #29699 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 3510/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/GlobalDimension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,Mathlib/RingTheory/RegularLocalRing/GlobalDimension.lean,Mathlib/RingTheory/RegularLocalRing/Polynomial.lean,Mathlib/RingTheory/RegularLocalRing/Syzygy.lean,docs/references.bib | 31 | 22 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 227 days ago | 41 minutes |
| 38583 | kim-em | feat(LinearAlgebra/Matrix/GeneralLinearGroup): polynomial functions on matrices over an infinite field are determined by their values on GL | This PR adds `MvPolynomial.eq_of_eval_eq_on_gl`: two polynomials in `MvPolynomial (m × m) k` over an infinite field `k` are equal whenever their evaluations agree at every invertible matrix. The proof multiplies by the generic determinant `det (Matrix.mvPolynomialX m m k)` so that `MvPolynomial.funext` applies (covering both invertible and non-invertible specializations of the variables), then divides by it (it is nonzero by `Matrix.det_mvPolynomialX_ne_zero`) using that the polynomial ring is an integral domain. The lemma is useful when reasoning about polynomial representations of `GL n k`, where natural identities are easiest to check on `GL n k` itself but the final statement lives at the level of polynomials. The lemma is placed in a new file `Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/MvPolynomial.lean` because the existing `Mathlib/LinearAlgebra/Matrix/MvPolynomial.lean` is upstream of `Adjugate`, which is itself upstream of `GeneralLinearGroup.Defs` — so we cannot import `GeneralLinearGroup.Defs` from `Matrix.MvPolynomial` without creating a cycle. 🤖 Prepared with Claude Code | t-algebra | 60/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/MvPolynomial.lean | 2 | 4 | ['SnirBroshi', 'github-actions', 'wwylele'] | nobody | 2 days ago | 2 days ago | 4 days |
| 37984 | loefflerd | feat: abstract theory of measures | General foundations of non-archimedean measure theory (intended for applications to Iwasawa algebras) --- - [ ] depends on: #38701 | WIP t-topology blocked-by-other-PR | 547/0 | Mathlib.lean,Mathlib/NumberTheory/Padics/Measure/Basic.lean,Mathlib/NumberTheory/Padics/Measure/Group.lean,Mathlib/NumberTheory/Padics/Measure/Topology.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/ContinuousMap/Algebra.lean,Mathlib/Topology/UniformSpace/ProdApproximation.lean | 7 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 18 days ago | 12 minutes |
| 35619 | SnirBroshi | feat(Combinatorics/SimpleGraph/Clique): intersection and union of cliques | Plus a couple of lemmas. --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 45/14 | Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Data/Set/Pairwise/Basic.lean | 3 | 13 | ['SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | 2 days ago | 8 days ago | 29 days |
| 38432 | SnirBroshi | feat(Logic/Relation): `Map r f g ≤ s ↔ r ≤ s.bicompl f g` | and the dual `s ≤ Relation.Map r f g ↔ s.bicompl f g ≤ r` which requires `f` and `g` to be bijective. Adds `Galois{Connection/Insertion/Coinsertion}` for the dual. The theorems are specialized to `onFun` instead of `bicompl` for when `f = g`. The `≤` theorems are spelled using `Subrelation` since `≤` is not yet available in this file, and `∀` for the `bicompl` theorems since `Subrelation` only supports homogeneous relations. A `GaloisConnection` for the iff in the title requires `f`/`g` to be bijective, but then we can get an `OrderIso` which is stronger (see #38499). --- [](https://gitpod.io/from-referrer/) | t-logic | 119/28 | Mathlib/Logic/Relation.lean,Mathlib/Order/GaloisConnection/Basic.lean | 2 | 3 | ['SnirBroshi', 'github-actions', 'plp127'] | nobody | 2 days ago | 6 days ago | 7 days |
| 38612 | SnirBroshi | feat(Order/SuccPred/CompleteLinearOrder): `sSup s < x` iff theorems when we know if `x` is a successor pre-limit or not | Adds the following theorems (along with their duals and indexed versions): ```lean sSup_lt_iff_of_not_isSuccPrelimit : ¬IsSuccPrelimit x → sSup s < x ↔ ∀ a ∈ s, a < x le_sSup_iff_of_not_isSuccPrelimit : ¬IsSuccPrelimit x → x ≤ sSup s ↔ ∃ a ∈ s, x ≤ a Order.IsSuccPrelimit.sSup_lt_iff : IsSuccPrelimit x → sSup s < x ↔ ∃ a < x, ∀ b ∈ s, b < a Order.IsSuccPrelimit.le_sSup_iff : IsSuccPrelimit x → x ≤ sSup s ↔ ∀ a < x, ∃ b ∈ s, a ≤ b ``` They are similar to these existing theorems, but not the same: ```lean sSup_lt_iff : sSup s < x ↔ ∃ a < x, ∀ b ∈ s, b ≤ a le_sSup_iff_forall_lt : x ≤ sSup s ↔ ∀ a < x, ∃ b ∈ s, a < b ``` --- [](https://gitpod.io/from-referrer/) | t-order | 43/0 | Mathlib/Order/SuccPred/CompleteLinearOrder.lean | 1 | 6 | ['SnirBroshi', 'github-actions', 'vihdzp'] | nobody | 2 days ago | 3 days ago | 3 days |
| 37477 | kebekus | feat: canonical decomposition of complex-meromorphic functions on disks | Establish the Finite Canonical Decomposition of meromorphic functions, where a complex-meromorphic function `f` on a disk is written as a product of an analytic function without zeros and poles, and canonical factors that take only values of norm one on the boundary of the disk. A future PR will extend this theorem to handle zeros/poles on the boundary of the disk. --- [](https://gitpod.io/from-referrer/) | t-analysis | 305/10 | Mathlib.lean,Mathlib/Analysis/Complex/CanonicalDecomposition.lean,Mathlib/Analysis/Meromorphic/Order.lean,Mathlib/Analysis/Meromorphic/RCLike.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean | 5 | 4 | ['github-actions', 'j-loreaux', 'kebekus'] | ADedecker | 2 days ago | 2 days ago | 30 days |
| 38499 | SnirBroshi | feat(Order/Hom/Basic): `Relation.Map`/`Function.onFun` form an order isomorphism between `α`-relations and `β`-relations | For an injective function `f : α → β`, `Relation.Map · f f` is an order embedding from `α`-relations into `β`-relations. For a surjective function `f : α → β`, `Function.onFun · f` is an order embedding from `β`-relations into `α`-relations. For a bijective function `f : α → β`, `Relation.Map · f f` and `Function.onFun · f` form an order isomorphism between `α`-relations and `β`-relations. --- - [ ] depends on: #38432 [](https://gitpod.io/from-referrer/) | t-order blocked-by-other-PR | 42/0 | Mathlib/Order/Hom/Basic.lean | 1 | 5 | ['github-actions', 'mathlib-dependent-issues', 'wwylele'] | nobody | 2 days ago | 2 days ago | 4 days |
| 30109 | scholzhannah | feat: the subcomplexes of a (relative classical) CW complex form a completely distributive lattice | In this PR we prove that the space of subcomplexes `Subcomplex C` of a (relative classical) CW complex `C` is a `CompletelyDistribLattice`. --- [](https://gitpod.io/from-referrer/) | t-topology | 304/1 | Mathlib/Topology/CWComplex/Classical/Subcomplex.lean | 1 | 26 | ['ADedecker', 'github-actions', 'j-loreaux', 'scholzhannah'] | ADedecker | 2 days ago | 7 days ago | 14 days |
| 38538 | CoolRmal | feat(Topology): some lemmas about topological bases | --- [](https://gitpod.io/from-referrer/) | t-topology | 27/4 | Mathlib/Topology/Bases.lean | 1 | 7 | ['CoolRmal', 'github-actions', 'plp127', 'scholzhannah', 'wwylele'] | j-loreaux | 2 days ago | 4 days ago | 5 days |
| 37926 | e-271828 | feat(Analysis/Analytic): add AnalyticAt properties for iterated dslope | This PR adds three fundamental lemmas in the `AnalyticAt` namespace to establish the analyticity of the (iterated) `dslope` function: * `AnalyticAt.dslope_of_ne` * `AnalyticAt.iterate_dslope_of_ne` * `AnalyticAt.iterate_dslope` (at the singularity, using `has_fpower_series_iterate_dslope_fslope`) These properties are crucial for factoring out removable singularities iteratively while preserving analyticity. This PR was assisted by LLMs (Aristotle and Gemini). --- [](https://gitpod.io/from-referrer/) | t-analysis new-contributor | 18/0 | Mathlib/Analysis/Analytic/IsolatedZeros.lean | 1 | 10 | ['e-271828', 'github-actions', 'j-loreaux', 'wwylele'] | j-loreaux | 2 days ago | 2 days ago | 19 days |
| 38227 | vihdzp | chore(Algebra/Order/Monoid/Unbundled/Basic): golfing + formatting | We make use of `variable`, fix some weird spacing, and golf many proofs. The only breaking change is that `mul_lt_iff_lt_one_left'`/`add_lt_iff_neg_left` now takes an explicit argument, matching the theorems surrounding it. --- Not too fond of the `calc` tactic. [](https://gitpod.io/from-referrer/) | t-algebra t-order | 230/502 | Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Data/Real/Archimedean.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 2 hours |
| 37464 | martinwintermath | feat(Geometry/Convex/Cone): Minor additions to pointed cones | Minor additions to pointed cones: * `PointedCone.ofSubmodule_le_ofSubmodule` and `PointedCone.ofSubmodule_lt_ofSubmodule`. These are not made simp lemmas, instead the underlying `Submodule.restrictScalars_le` and `Submodule.restrictScalars_lt` have been changed into simp lemmas. * `PointedCone.hull_le_span` as a short form of `Submodule.span_le_restrictScalars R≥0 R s` In preparation for #36605. Co-authored by: Artie Khovanov --- [](https://gitpod.io/from-referrer/) | t-convex-geometry | 22/14 | Mathlib/Algebra/Module/Submodule/RestrictScalars.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean | 2 | 22 | ['artie2000', 'github-actions', 'justus-springer', 'martinwintermath', 'mathlib-merge-conflicts', 'ooovi', 'vihdzp'] | nobody | 2 days ago | 14 days ago | 29 days |
| 38670 | tb65536 | chore(GroupTheory/SpecificGroups/Alternating): deprecate old proof of simplicity of A_5 | Now that #36524 has been merged, we can deprecate the old proof of simplicity of A_5. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 37/106 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/GroupTheory/SpecificGroups/Alternating.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/Simple.lean | 4 | 2 | ['AntoineChambert-Loir', 'github-actions', 'tb65536'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38275 | TTony2019 | feat: Add `AffineEquiv.image_intrinsicInterior` | ## Summary This PR generalizes the existing lemma `AffineIsometry.image_intrinsicInterior` to the setting of affine equivalences, yielding the corresponding result `AffineEquiv.image_intrinsicInterior`. Since affine equivalences are more general than affine isometries, the proof requires an additional finite-dimensionality assumption. The key extra input is that in finite-dimensional spaces, an affine equivalence induces a homeomorphism via `AffineEquiv.toHomeomorphOfFiniteDimensional`, so the assumptions are adjusted accordingly. Apart from these extra assumptions, the argument is essentially the same as for `AffineIsometry.image_intrinsicInterior`. ## Collaboration This PR was developed together with @imathwy. | t-analysis new-contributor awaiting-author | 201/30 | Mathlib/Analysis/Convex/Intrinsic.lean,Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/AffineSubspace.lean | 4 | 5 | ['github-actions', 'imathwy', 'j-loreaux', 'themathqueen'] | j-loreaux | 2 days ago | 3 days ago | 8 days |
| 37400 | SnirBroshi | feat(Combinatorics/SimpleGraph/Acyclic): endpoints of a path have at most one neighbor in the path | --- [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 15/0 | Mathlib/Combinatorics/SimpleGraph/Acyclic.lean | 1 | 6 | ['Rida-Hamadani', 'Ruben-VandeVelde', 'SnirBroshi', 'bryangingechen', 'github-actions'] | nobody | 2 days ago | 31 days ago | 31 days |
| 33369 | Thmoas-Guan | feat(Homology): `Ext` commute with flat base change | In this PR, using the linear map `Ext(M,N) => Ext(F(M), F(N))` when `F` is exact functor, we prove that `Ext` commute with flat base change if the ring is noetherian and two modules are finitely generated, stated using `IsBaseChange`. --- - [x] depends on: #31046 - [ ] depends on: #31222 - [x] depends on: #32316 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-topology | 603/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Ext/BaseChange.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/Flat/IsBaseChange.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeRightExact.lean | 6 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 123 days ago | 25 minutes |
| 29796 | Thmoas-Guan | feat(RingTheory): regular of finite global dimension | In this PR, we proved the other half of Auslander-Buchsbaum-Serre criterion, which states that a local ring is regular if it has finite global dimension, with results in #29557, we can obtain the full theorem. More APIs would be developed based on the two. --- - [ ] depends on: #26215 - [ ] depends on: #26217 - [ ] depends on: #29558 - [ ] depends on: #28683 - [ ] depends on: #38698 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 2633/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/Depth/AuslanderBuchsbaum.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/GlobalDimension.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/AuslanderBuchsbaumSerre.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,docs/references.bib | 27 | 17 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 224 days ago | 1 minute |
| 29533 | Thmoas-Guan | feat(Algebra): maximal Cohen Macaulay module | In this PR, we defined the concept of maximal Cohen Macaulay module, and proved that finitely generated maximal Cohen Macaulay module over regular local ring is free. --- - [ ] depends on: #28683 - [ ] depends on: #26218 - [ ] depends on: #38698 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 2512/203 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Maximal.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Basic.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Colon.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Free.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean,docs/references.bib | 24 | 14 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 232 days ago | 1 minute |
| 31768 | Thmoas-Guan | feat(Homology): `Ext` under restrict scalars by `RingEquiv` | In this PR, we proved that `Ext` commute with ulift functor in `ModuleCat`. Further more, we provided compatibility with (semi-)linear equiv of general universe. --- - [x] depends on: #31697 - [x] depends on: #31706 [](https://gitpod.io/from-referrer/) | t-algebra t-category-theory | 142/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean | 4 | 31 | ['Thmoas-Guan', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | kim-em | 2 days ago | 7 days ago | 14 days |
| 31851 | Thmoas-Guan | feat(Algebra/Homology): Injective dimension in linear equiv | In this PR, we proved that injective dimension is preserved under (semi-) linear equiv for general universe level. --- - [ ] depends on: #31768 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 350/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean | 7 | 8 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 162 days ago | 2 hours |
| 38014 | cduenasnavarro | feat(InformationTheory): linear codes over finite fields and minimum distance properties | Define linear codes over a finite field `F` as finite-dimensional subspaces of `Fin n → F`, together with their minimum Hamming distance. Main definitions: * `LinearCode` * `minDist` * `LinearCodeWithDist` * `hammingSphere` Main results: * `minDist_eq_sInf_pairwiseDist`: characterisation of the minimum distance via pairwise distances * `disjoint_spheres`: Hamming spheres of radius `t` around distinct codewords are disjoint if `2 * t < d` Pending: * Choosing an adequate book reference --- [](https://gitpod.io/from-referrer/) | t-measure-probability new-contributor | 143/0 | Mathlib.lean,Mathlib/InformationTheory/Coding/LinearCode.lean | 2 | 37 | ['cduenasnavarro', 'github-actions', 'linesthatinterlace', 'rkirov', 'vihdzp', 'wwylele'] | RemyDegenne | 2 days ago | 17 days ago | 17 days |
| 31884 | Thmoas-Guan | feat(RingTheory): definition of Gorenstein local ring | In this PR, we gave basic definition of Gorenstein local ring and Gorestein ring and prove that they are stable under ring equiv. --- - [ ] depends on: #31851 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 423/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/RingTheory/Gorenstein/Defs.lean | 8 | 10 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 161 days ago | 42 minutes |
| 32035 | Thmoas-Guan | feat(RingTheory): localization of Gorenstein local ring | In this PR, we proved that localization of Gorenstein local ring at prime is again Gorenstein. --- - [ ] depends on: #31884 - [ ] depends on: #32033 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 527/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/RingTheory/Gorenstein/Defs.lean,Mathlib/RingTheory/Gorenstein/Localization.lean | 9 | 12 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 158 days ago | 14 minutes |
| 32098 | Thmoas-Guan | feat(RingTheory): injective dimension of quotSMulTop | In this PR, we proved for finitely generated module `M` over noetherian ring `R`, if `x` in maximal ideal being both `R`-regular and `M`-regular, `injdim_R (M/xM) + 1 = injdim_{R/(x)} (M)`. --- - [ ] depends on: #31046 - [ ] depends on: #32058 - [ ] depends on: #36817 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-ring-theory | 621/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/RingTheory/Regular/InjectiveDimension.lean | 4 | 7 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 157 days ago | 31 minutes |
| 33377 | Thmoas-Guan | feat(RingTheory): polynomial over Gorenstein ring is Gorenstein | In this PR, we prove that polynomial over Gorenstein ring is Gorenstein. --- - [ ] depends on: #33369 - [ ] depends on: #31884 - [ ] depends on: #32098 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-ring-theory | 1710/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/BaseChange.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/Flat/IsBaseChange.lean,Mathlib/RingTheory/Gorenstein/Defs.lean,Mathlib/RingTheory/Gorenstein/Polynomial.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Regular/InjectiveDimension.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeRightExact.lean | 15 | 10 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 123 days ago | 1 minute |
| 33379 | Thmoas-Guan | feat(RingTheory): Gorenstein local ring is Cohen Macaulay | In this PR, we give the definition of Gorenstein local ring and proved it is Cohen--Macaulay. --- - [ ] depends on: #31884 - [ ] depends on: #26218 - [ ] depends on: #32098 - [ ] depends on: #31644 - [ ] depends on: #33369 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-ring-theory | 3964/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/BaseChange.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Flat/IsBaseChange.lean,Mathlib/RingTheory/Gorenstein/CohenMacaulay.lean,Mathlib/RingTheory/Gorenstein/Defs.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/InjectiveDimension.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeRightExact.lean,docs/references.bib | 26 | 11 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 123 days ago | 4 minutes |
| 36527 | Thmoas-Guan | feat(RingTheory): Gorenstein of exists a vanishing ext | A `n`-dimensional Noetherian local ring `R` is Gorenstein if there is an `i > n`, `Ext^i(k, R) = 0`. --- - [ ] depends on: #33379 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-ring-theory | 4146/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/BaseChange.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Flat/IsBaseChange.lean,Mathlib/RingTheory/Gorenstein/CohenMacaulay.lean,Mathlib/RingTheory/Gorenstein/Defs.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/InjectiveDimension.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeRightExact.lean,docs/references.bib | 26 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 50 days ago | 36 minutes |
| 33380 | Thmoas-Guan | feat(RingTheory): Gorenstein local ring is Cohen--Macaulay local ring of type one | In this PR, we formalized Theorem 18.1 of _Commutaive Ring Theory_ Matsumura. This gives a full characterization of `Ext(k, R)` for Gorenstein local ring and implies that it is equivalent to Cohen--Macaulay local ring of type 1. --- - [ ] depends on: #26245 - [ ] depends on: #33379 - [ ] depends on: #36527 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR t-ring-theory | 5083/48 | Mathlib.lean,Mathlib/Algebra/Category/Grp/Zero.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean,Mathlib/Algebra/Category/ModuleCat/Ext/BaseChange.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Ext/RingEquiv.lean,Mathlib/Algebra/Category/ModuleCat/InjectiveDimension.lean,Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/CohenMacaulay/Basic.lean,Mathlib/RingTheory/CohenMacaulay/Catenary.lean,Mathlib/RingTheory/Depth/Basic.lean,Mathlib/RingTheory/Depth/Ischebeck.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Flat/IsBaseChange.lean,Mathlib/RingTheory/Gorenstein/CohenMacaulay.lean,Mathlib/RingTheory/Gorenstein/Defs.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/InjectiveDimension.lean,Mathlib/RingTheory/Regular/LinearMap.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeRightExact.lean,docs/references.bib | 27 | 11 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 2 days ago | 123 days ago | 2 minutes |
| 37346 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `✅️ SimpleGraph.Walk.IsPath.getVert_injOn`: unchanged 🎉 * `✅️ SimpleGraph.Walk.length_bypass_le`: unchanged 🎉 * `✅️ Rat.floor_intCast_div_natCast`: unchanged 🎉 * `✅️ InnerProductGeometry.norm_eq_of_angle_sub_eq_angle_sub_rev_of_angle_ne_pi`: unchanged 🎉 * `✅️ padicNorm.zero_of_padicNorm_eq_zero`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | maintainer-merge awaiting-zulip | 7/45 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Data/Rat/Floor.lean,Mathlib/Geometry/Euclidean/Triangle.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean | 4 | 22 | ['FernandoChu', 'bryangingechen', 'chenson2018', 'euprunin', 'faenuccio', 'github-actions', 'grunweg'] | nobody | 2 days ago | 2 days ago | 30 days |
| 38707 | tb65536 | feat(Algebra/Polynomial/Lifts): add `natDegree` verison of `exists_natDegree_eq_of_mem_lifts` | This PR adds a `natDegree` version of `exists_degree_eq_of_mem_lifts`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 4/0 | Mathlib/Algebra/Polynomial/Lifts.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38009 | CBirkbeck | feat(RingTheory/Valuation): define the valuation spectrum and its topology | ## Summary Define the valuation spectrum `Spv A` of a commutative ring and equip it with the topology generated by basic open sets, following Wedhorn's *Adic Spaces*. Also define the pullback (`comap`) of a `ValuativeRel` along a ring homomorphism. This is preparation for later defining adic spaces. Note the code was generated by claude code, but I have cleaned up and pre-reviewed the work. | t-ring-theory LLM-generated | 362/0 | Mathlib.lean,Mathlib/RingTheory/Valuation/ValuationSpectrum.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Comap.lean | 3 | 40 | ['CBirkbeck', 'adamtopaz', 'chrisflav', 'dagurtomas', 'faenuccio', 'github-actions', 'jjdishere', 'riccardobrasca'] | riccardobrasca | 2 days ago | 17 days ago | 17 days |
| 34633 | mitchell-horner | feat(Combinatorics/SimpleGraph): define the Zarankiewicz function | Defines the Zarankiewicz function $z(m, n; s, t)$ in terms of bipartite graphs. --- - [x] depends on: #34632 This comes from splitting up #25841 into smaller PRs. [](https://gitpod.io/from-referrer/) | t-combinatorics | 186/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Zarankiewicz.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean | 3 | 17 | ['YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mitchell-horner'] | YaelDillies | 2 days ago | 2 days ago | 38 days |
| 38708 | tb65536 | feat(Algebra/Polynomial/Lifts): every polynomial lifts along a surjective ring homomorphism | This PR adds a lemma stating that every polynomial lifts along a surjective ring homomorphism (this could also be phrased as `lifts_eq_top`, but in practice it's membership in lifts that unlocks all of the API for `lifts`). --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 3/0 | Mathlib/Algebra/Polynomial/Lifts.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 37389 | martinwintermath | chore(LinearAlgebra/SesquilinearForm): generalize `orthogonalBilin` in order to simplify definition of `orthogonal` | - generalize `Submodule.orthogonalBilin` to `CommSemiring` and `AddCommMonoid`, and to general sesquilinear forms with inputs from different modules. This enables subsequent changes. - redefine `BilinForm.orthogonal` in terms of `orthogonalBilin`. - reorder arguments of `Submodule.orthogonalBilin` to match other instances of duality across mathlib. For comparison Before ```lean4 Submodule.orthogonalBilin.{u_1, u_2, u_5, u_6} {R : Type u_1} {R₁ : Type u_2} {M : Type u_5} {M₁ : Type u_6} [CommRing R] [CommRing R₁] [AddCommGroup M₁] [Module R₁ M₁] [AddCommGroup M] [Module R M] {I₁ I₂ : R₁ →+* R} (N : Submodule R₁ M₁) (B : M₁ →ₛₗ[I₁] M₁ →ₛₗ[I₂] M) : Submodule R₁ M₁ ``` After ```lean4 Submodule.orthogonalBilin.{u_1, u_2, u_3, u_5, u_6, u_7} {R : Type u_1} {R₁ : Type u_2} {R₂ : Type u_3} {M : Type u_5} {M₁ : Type u_6} {M₂ : Type u_7} [CommSemiring R] [CommSemiring R₁] [CommSemiring R₂] [AddCommMonoid M] [Module R M] [AddCommMonoid M₁] [Module R₁ M₁] [AddCommMonoid M₂] [Module R₂ M₂] {I₁ : R₁ →+* R} {I₂ : R₂ →+* R} (B : M₁ →ₛₗ[I₁] M₂ →ₛₗ[I₂] M) (N : Submodule R₁ M₁) : Submodule R₂ M₂ ``` A few fixes in other files have been necessary as well. This is an extract from #37381. --- [](https://gitpod.io/from-referrer/) | t-algebra | 28/21 | Mathlib/Algebra/Lie/InvariantForm.lean,Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/RootSystem/Finite/Nondegenerate.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean | 5 | 8 | ['eric-wieser', 'github-actions', 'martinwintermath', 'themathqueen', 'vihdzp'] | ocfnash | 2 days ago | 2 days ago | 31 days |
| 37963 | martinwintermath | feat(LinearAlgebra/SesquilinearForm): moving orthogonality to own file and adding lemmas | * Move `Submodule.orthogonalBilin` and all lemmas that use it from SesquilinearForm/Basic.lean to its own file SesquilinearForm/Orthogonal.lean. * Add the features proposed in #34007 to align with `PointedCone.dual`. --- - [ ] depends on: #37381 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 389/190 | Mathlib.lean,Mathlib/Algebra/Lie/InvariantForm.lean,Mathlib/Algebra/Lie/TraceForm.lean,Mathlib/Algebra/Lie/Weights/Killing.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/QuadraticForm/IsometryEquiv.lean,Mathlib/LinearAlgebra/QuadraticForm/Radical.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct/Isometries.lean,Mathlib/LinearAlgebra/RootSystem/Finite/Nondegenerate.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean,Mathlib/LinearAlgebra/SesquilinearForm/Orthogonal.lean,docs/undergrad.yaml | 15 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 18 days ago | 9 minutes |
| 38269 | b-mehta | feat(Combinatorics/Additive): link Freiman homs and Freiman isos tighter | --- Some work I had lying around in a forgotten branch, recently resurrected. [](https://gitpod.io/from-referrer/) | t-combinatorics maintainer-merge | 118/76 | Mathlib/Combinatorics/Additive/AP/Three/Behrend.lean,Mathlib/Combinatorics/Additive/AP/Three/Defs.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean | 3 | 15 | ['YaelDillies', 'b-mehta', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 3 days |
| 38709 | tb65536 | feat(Algebra/Polynomial/Roots): roots of `p(-X)` | This PR proves that the roots of `p(-X)` are just the negatives of the roots of `p`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 21/0 | Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/Algebra/Polynomial/Roots.lean | 2 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38168 | ADedecker | feat: if `E` is finite dimensional, `E →L[𝕜] F` has the product topology | --- - [x] depends on: #38164 [](https://gitpod.io/from-referrer/) | t-topology t-analysis awaiting-author | 235/29 | Mathlib.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/Spaces/FiniteDimensionCLM.lean | 3 | 7 | ['ADedecker', 'faenuccio', 'github-actions', 'j-loreaux', 'mathlib-dependent-issues'] | j-loreaux | 2 days ago | 3 days ago | 4 days |
| 38622 | mariainesdff | feat(RingTheory/PowerSeries/ExponentialModule): add exponential module | Let `R` be a commutative ring. The exponential module of `R` is the set of all power series `f : R⟦X⟧` that are of exponential type : `f (X + Y) = f X * f Y` where `X` and `Y` are two indeterminates. It is an abelian group under multiplication, and an `R`-module under rescaling. Co-authored by: @AntoineChambert-Loir --- - [ ] depends on: #38615 [](https://gitpod.io/from-referrer/) | t-ring-theory | 425/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Finsupp/Fin.lean,Mathlib/Data/Nat/Choose/Sum.lean,Mathlib/RingTheory/PowerSeries/ExponentialModule.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean | 5 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38579 | ADedecker | feat: generalize Submodule.ClosedComplemented.of_quotient_finiteDimensional | --- - [ ] depends on: #38547 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 462/104 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/Analysis/Normed/Module/Complemented.lean,Mathlib/Analysis/Normed/Module/ContinuousInverse.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/LinearAlgebra/Projection.lean,Mathlib/Topology/Algebra/Module/Complement.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 10 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 4 days ago | 3 minutes |
| 37381 | martinwintermath | chore(LinearAlgebra/SesquilinearForm): deprecate `IsOrtho` and associated lemmas | First steps in cleaning up bilinearity and orthogonality. - deprecate `IsOrtho` and accompanying trivial lemmas (this also allows to shorten the proofs in `orthogonalBilin`). - deprecate `ortho_smul_right` and `ortho_smul_left` since now provable from simp. - remove uses of deprecated definitions. - replace `IsOrtho` in undergrad.yaml by `iIsOrtho`. See discussion at [#mathlib4 > Reorganizing bilinearity and orthogonality?](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Reorganizing.20bilinearity.20and.20orthogonality.3F/with/582426197) Due to too agressive simplification I had to remove simp from - `QuadraticMap.associated_apply` - `QuadraticMap.isOrtho_polarBilin` --- - [ ] depends on: #37389 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 135/113 | Mathlib/Algebra/Lie/InvariantForm.lean,Mathlib/Algebra/Lie/TraceForm.lean,Mathlib/Algebra/Lie/Weights/Killing.lean,Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/QuadraticForm/IsometryEquiv.lean,Mathlib/LinearAlgebra/QuadraticForm/Radical.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct.lean,Mathlib/LinearAlgebra/QuadraticForm/TensorProduct/Isometries.lean,Mathlib/LinearAlgebra/RootSystem/Finite/Nondegenerate.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean,docs/undergrad.yaml | 12 | 10 | ['github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mcdoll', 'vihdzp'] | nobody | 2 days ago | 30 days ago | 15 hours |
| 38718 | tb65536 | feat(GroupTheory/Torsion): add `torsion_eq_top_iff` | The torsion subgroup is the whole group if and only if the group is torsion. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 4/0 | Mathlib/GroupTheory/Torsion.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38037 | linesthatinterlace | feat: extend `LawfulXor` lemmas and add `Equiv.xor` | This PR extends the work of #37712 by adding additional lemmas and adding `xor-as-a-permutation`. --- - depends on: #37712 [](https://gitpod.io/from-referrer/) | t-data | 270/0 | Mathlib.lean,Mathlib/Data/Fin/Init.lean,Mathlib/Data/LawfulXor/Basic.lean,Mathlib/Data/LawfulXor/Equiv.lean | 4 | 3 | ['github-actions', 'linesthatinterlace'] | eric-wieser and linesthatinterlace | 2 days ago | 17 days ago | 17 days |
| 31662 | edwin1729 | feat(Topology/Order): topological basis of scott topology on Complete… | …PartialOrder --- [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.3E.20Algebraic.20complete.20partial.20order.20and.20domain.20theory/with/536359313) for this PR. (2/5) PRs in domain theory, proving that scott topologies over Algebraic DCPOs (`CompletePartialOrder`) are sober. The main reference is [Renata, Duality in Domain Theory](https://alyata.github.io/documents/duality_domain_theory.pdf). But the statements can also be found in the canonical text [Abramsky and Jung](https://www.cs.ox.ac.uk/people/samson.abramsky/handbook.pdf) This first PR proves two prerequisites, namely: - the specialization order induced by the scott topology corresponds to the existing order of the DCPO. Prop 3.1.5 in [Duality in Domain Theory](https://alyata.github.io/documents/duality_domain_theory.pdf) and Prop 2.3.2(1) in [Abramsky and Jung](https://www.cs.ox.ac.uk/people/samson.abramsky/handbook.pdf) - the upward closures of compact elements of the DCPO form a topological basis for the Scott Topology. Prop 3.5.2 in [Duality in Domain Theory](https://alyata.github.io/documents/duality_domain_theory.pdf) and Prop 2.3.6(2) in [Abramsky and Jung](https://www.cs.ox.ac.uk/people/samson.abramsky/handbook.pdf) - [x] depends on: #33061 **The next PR is here:** #31670 [](https://gitpod.io/from-referrer/) | t-topology new-contributor large-import | 179/1 | Mathlib.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Topology/Order/ScottTopology.lean,Mathlib/Topology/Order/ScottTopologyDCPO.lean,docs/references.bib | 5 | 88 | ['b-mehta', 'edwin1729', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127'] | b-mehta | 2 days ago | 2 days ago | 60 days |
| 38720 | tb65536 | feat(GroupTheory/Rank): nontrivial groups have positive rank | This PR proves that nontrivial groups have positive rank. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 18/0 | Mathlib/GroupTheory/Rank.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38685 | yuanyi-350 | chore(LinearAlgebra/FreeModule/Int): remove an erw | - rewrites the Smith normal form coordinate calculation with `rw [LinearEquiv.submoduleMap_apply]` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-algebra | 1/1 | Mathlib/LinearAlgebra/FreeModule/Int.lean | 1 | 2 | ['github-actions', 'jcommelin', 'yuanyi-350'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38684 | yuanyi-350 | chore(LinearAlgebra/CliffordAlgebra/EvenEquiv): remove erws | - rewrites the `toEven` and `toEven_ι` proofs through `even_toSubmodule`, replacing the `erw` steps with `simp` and `rw` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-algebra | 5/8 | Mathlib/LinearAlgebra/CliffordAlgebra/EvenEquiv.lean | 1 | 2 | ['github-actions', 'jcommelin', 'yuanyi-350'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38377 | xroblot | feat(RingTheory/Localization, FieldTheory/Galois): refactor fraction field action API and add fixingSubgroup lemmas | Extracts the components of the proof of `IsGaloisGroup.to_isFractionRing`, adding API for working with "Galois extensions of domains". Also adds `fixingSubgroup_range_algebraMap` and its ring-domain analogue: if `G` is a Galois group for `L/K` and a subgroup `H` is a Galois group for `L/R`, then the elements of `G` fixing the range of `algebraMap R L` pointwise are exactly the elements of `H`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 139/41 | Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 4 | 3 | ['github-actions', 'leanprover-radar', 'riccardobrasca', 'tb65536'] | riccardobrasca | 2 days ago | 9 days ago | 9 days |
| 38721 | tb65536 | feat(GroupTheory/Torsion): the torsion subgroup is preserved by isomorphisms | This PR proves that the torsion subgroup is preserved by isomorphisms. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 10/1 | Mathlib/GroupTheory/Torsion.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38508 | yuanyi-350 | chore(Topology/Sheaves/SheafCondition/PairwiseIntersections): remove an erw | - rewrites `interUnionPullbackConeLift_left` and `interUnionPullbackConeLift_right` by unfolding `interUnionPullbackConeLift` directly in the `rw` chain - rewrites the two `isLimitPullbackCone` branches by adding `Functor.mapCone_π_app` to the `rw` chain instead of using `erw [← F.1.map_comp]` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-topology | 5/9 | Mathlib/Topology/Sheaves/SheafCondition/PairwiseIntersections.lean | 1 | 3 | ['github-actions', 'jcommelin', 'yuanyi-350'] | j-loreaux | 2 days ago | 2 days ago | 6 days |
| 38515 | yuanyi-350 | chore(Algebra/Lie/Classical): remove an erw | - unfolds `so'` before `skewAdjointMatricesLieSubalgebraEquiv_apply`, so the proof closes with a plain `rw` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebra LLM-generated | 1/1 | Mathlib/Algebra/Lie/Classical.lean | 1 | 3 | ['github-actions', 'jcommelin', 'yuanyi-350'] | nobody | 2 days ago | 6 days ago | 6 days |
| 34906 | seewoo5 | feat(NumberTheory/Bernoulli): von Staudt-Clausen theorem | --- Rado's proof ("A New Proof of a Theorem of v. Staudt", JLMS 1935) of [von Staudt-Clausen theorem](https://en.wikipedia.org/wiki/Von_Staudt%E2%80%93Clausen_theorem). Initially written by AxiomProver (see commit 97a308e) with further golfs with Claude and Codex. [](https://gitpod.io/from-referrer/) | t-number-theory large-import LLM-generated awaiting-author | 336/5 | Mathlib/Algebra/GCDMonoid/FinsetLemmas.lean,Mathlib/NumberTheory/Bernoulli.lean,docs/references.bib | 3 | 75 | ['MichaelStollBayreuth', 'github-actions', 'kckennylau', 'mathlib-bors', 'mathlib-merge-conflicts', 'seewoo5'] | MichaelStollBayreuth | 2 days ago | 7 days ago | 28 days |
| 38723 | xgenereux | feat(EuclideanDomain.Basic): RingEquiv.euclideanDomain | Add `RingEquiv.euclideanDomain` similar to other `RingEquiv` transport lemmas. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 28/1 | Mathlib/Algebra/EuclideanDomain/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 36704 | adam84-hub | chore(Function): add surjective_iff | Adds an explicit discoverable definitional lemma for `Function.Surjective`. - addresses #31745 - scope is intentionally tiny: one theorem in `Mathlib/Logic/Function/Defs.lean` AI was used for drafting; I reviewed the final code and understand it well enough to vouch for it. | t-logic new-contributor | 4/0 | Mathlib/Logic/Function/Defs.lean | 1 | 13 | ['SnirBroshi', 'adam84-hub', 'github-actions', 'plp127', 'vihdzp'] | nobody | 2 days ago | 2 days ago | 2 days |
| 33478 | anishrajeev | feat(ModelTheory): define a subset of the topology over complete types | Define a subset of the Stone Space over a language expanded with countably many constants. Define the proposition to indicate if a language is countable. The subset's density and openness is a future goal to prove (have a branch where it is almost finished), in pursuit of formalizing the proof of the Omitting Types Theorem via properties of Baire spaces. - [ ] depends on: #32215 - [ ] depends on: #32546 | t-logic merge-conflict new-contributor | 160/1 | Mathlib.lean,Mathlib/ModelTheory/Topology/Types.lean,Mathlib/ModelTheory/Types.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 4 | 8 | ['NoneMore', 'anishrajeev', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'tb65536'] | nobody | 2 days ago | 109 days ago | 10 days |
| 38719 | tb65536 | feat(GroupTheory/QuotientGroup/Basic): `(G × H) / (A.prod B) ≃ (G / A) × (H / B)` | This PR proves the isomorphism `(G × H) ⧸ (A.prod B) ≃* (G ⧸ A) × H ⧸ B` and uses it to golf `Subgroup.index_prod`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 20/3 | Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean | 2 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 38663 | vihdzp | feat: golf using `IsBotOneClass` and `IsBotZeroClass` | We create typeclasses expressing that `0` or `1` is a bottom element in a type. We use this to unify and generalize various theorems which are currently stated for canonically ordered monoids. See [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Typeclass.20for.20IsBot.200/near/586314552). --- - [x] depends on: #38148 [](https://gitpod.io/from-referrer/) | large-import t-order | 424/422 | Archive/Imo/Imo2024Q3.lean,Mathlib.lean,Mathlib/Algebra/Lie/Solvable.lean,Mathlib/Algebra/Lie/Weights/Chain.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Floor/Extended.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/GroupWithZero/Range.lean,Mathlib/Algebra/Order/IsBotOne.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Algebra/Polynomial/Degree/TrailingDegree.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean,Mathlib/AlgebraicTopology/AlternatingFaceMapComplex.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/Spectrum.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Distribution/TemperateGrowth.lean,Mathlib/Analysis/InnerProductSpace/Projection/FiniteDimensional.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/Normed/Operator/NNNorm.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Analysis/Real/Pi/Irrational.lean,Mathlib/Analysis/SpecialFunctions/ArithmeticGeometricMean.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/Combinatorics/Enumerative/Composition.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Combinatorics/Extremal/RuzsaSzemeredi.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Equitabilise.lean,Mathlib/Combinatorics/SimpleGraph/VertexCover.lean,Mathlib/Computability/Primrec/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/Finset/Density.lean,Mathlib/Data/Int/WithZero.lean,Mathlib/Data/List/Shortlex.lean,Mathlib/Data/Nat/Nth.lean,Mathlib/Data/Nat/Totient.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/FieldTheory/Finite/Valuation.lean,Mathlib/FieldTheory/RatFunc/Valuation.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/GroupTheory/Coxeter/Basic.lean,Mathlib/GroupTheory/GroupAction/Blocks.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/KleinFour.lean,Mathlib/LinearAlgebra/Dimension/Finite.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Real.lean,Mathlib/MeasureTheory/Function/SimpleFuncDense.lean,Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Countable.lean,Mathlib/MeasureTheory/Measure/AbsolutelyContinuous.lean,Mathlib/MeasureTheory/Measure/Decomposition/Lebesgue.lean,Mathlib/MeasureTheory/Measure/Map.lean,Mathlib/MeasureTheory/Measure/Prod.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/MeasureTheory/OuterMeasure/AE.lean,Mathlib/NumberTheory/ArithmeticFunction/Moebius.lean,Mathlib/NumberTheory/Divisors.lean,Mathlib/NumberTheory/FLT/Polynomial.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/Interval/Set/Basic.lean,Mathlib/Probability/Kernel/IonescuTulcea/Traj.lean,Mathlib/Probability/Martingale/Upcrossing.lean,Mathlib/RingTheory/ChainOfDivisors.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Discriminant.lean,Mathlib/RingTheory/DividedPowers/SubDPIdeal.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/RingTheory/Polynomial/Resultant/Basic.lean,Mathlib/RingTheory/Valuation/Archimedean.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/RingTheory/Valuation/Integers.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Topology/Algebra/InfiniteSum/ENNReal.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Polynomial.lean,Mathlib/Topology/Algebra/ValuativeRel/ValuativeTopology.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 105 | 3 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues'] | nobody | 2 days ago | 2 days ago | 12 minutes |
| 38729 | tb65536 | feat(GroupTheory/Torsion): torsion subgroup of a product | This PR proves that the torsion subgroup of a product is the product of the torsion subgroups. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 5/1 | Mathlib/GroupTheory/Torsion.lean | 1 | 1 | ['github-actions'] | nobody | 2 days ago | 2 days ago | 2 days |
| 33392 | AntoineChambert-Loir | feat(LinearAlgebra/Transvection/Generation): non-exceptional case in Dieudonné's theorem | We prove the theorem of [Dieudonné-1955][J. Dieudonné, “Sur les générateurs des groupes classiques”]. Let `K` be a division ring and `V` be a `K`-module. * `LinearEquiv.mem_transvections_pow_mul_dilatransvections_of_fixedReduce_eq_one`: If `e.fixedReduce = 1`, then `e` can be written as the product of `finrank K (V ⧸ e.fixedSubmodule) - 1` transvections and one dilatransvection. This is the first part of the non-exceptional case in Dieudonné's theorem. (This statement is not interesting when `e = 1`.) * `LinearEquiv.mem_transvections_pow_mul_dilatransvections_of_fixedReduce_ne_smul_id`: If `e.fixedReduce` is not a homothety, then `e` can be written as the product of `finrank K (V ⧸ e.fixedSubmodule) - 1` transvections and one dilatransvection. This is the second part of the non-exceptional case in Dieudonné's theorem. * `LinearEquiv.IsExceptional`: A linear equivalence `e : V ≃ₗ[K] V` is exceptional if `1 < finrank K (V ⧸ e.fixedSubmodule)` and if `e.fixedReduce` is a nontrivial homothety. * `LinearEquiv.mem_dilatransvections_pow_of_notIsExceptional`: This is the non-exceptional case in Dieudonné's theorem, as a combination of the two preceding statements. --- - [x] depends on: #33348 - [x] depends on: #33282 - [x] depends on: #33347 - [ ] depends on: #33387 [](https://gitpod.io/from-referrer/) | t-algebra | 555/0 | Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean | 5 | 12 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | joelriou | 1 day ago | 1 day ago | 32 days |
| 36829 | Jun2M | feat(Combinatorics/GraphLike): introduce SymmGraphLike typeclass | Per discussion at ([#graph theory > HasAdj](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/HasAdj/with/575843445)), This PR extends `GraphLike` typeclass defined in #36743 for graphs with symmetric darts (`SimpleGraph` and `Graph`, not `Digraph`). ### Main definitions * `SymmGraphLike V D E Gr`: A typeclass extending `GraphLike` with together with `symm`, an involution function on darts that swaps `fst` and `snd`. * Instance of `GraphLike V (Digraph V)` with `darts G := { (u, v) | G.Adj u v }` * Instance of `SymmGraphLike V (SimpleGraph V)` with `darts G := { (u, v) | G.Adj u v }` * Instance of `SymmGraphLike V (Graph V E)` with `darts G := {d : Dart α β | G.IsLink (edge d) (src d) (tgt d)}` --- - [ ] depends on: #36743 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 606/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/GraphLike.lean,Mathlib/Combinatorics/Graph/GraphLike.lean,Mathlib/Combinatorics/GraphLike/Basic.lean,Mathlib/Combinatorics/GraphLike/Symm.lean,Mathlib/Combinatorics/SimpleGraph/GraphLike.lean | 6 | 5 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 43 days ago | 2 minutes |
| 38724 | yuanyi-350 | chore(Algebra/Category/ModuleCat): remove `erw`s | - simplifies the `tmul` branches in `HomEquiv.fromExtendScalars` and `Counit.map` to `simp [mul_smul]` Extracted from #38415 [](https://gitpod.io/from-referrer/) | t-algebra | 2/12 | Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 2 days ago | 2 days |
| 38565 | peabrainiac | feat(Geometry/Manifold): add `ContMDiffSMul` typeclass | Introduce typeclasses `ContMDiffVAdd` and `ContMDiffSMul` for continuously differentiable actions on manifolds. As an application, we prove that the general linear group `(V →L[𝕜] V)ˣ` of any Banach space `V` acts smoothly on `V`. --- - [x] depends on: #38620 See also #38527 that adds an analogous `ContDiffSMul` for actions of normed vector spaces. [](https://gitpod.io/from-referrer/) | t-differential-geometry | 197/30 | Mathlib.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Manifold.lean,Mathlib/Geometry/Manifold/Algebra/SMul.lean,Mathlib/Geometry/Manifold/Algebra/SmoothFunctions.lean,Mathlib/Geometry/Manifold/BumpFunction.lean,Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean,Mathlib/Geometry/Manifold/Instances/UnitsOfNormedAlgebra.lean,Mathlib/Geometry/Manifold/MFDeriv/NormedSpace.lean,Mathlib/Geometry/Manifold/VectorBundle/SmoothSection.lean | 9 | 27 | ['github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-splicebot', 'peabrainiac'] | grunweg and sgouezel | 1 day ago | 1 day ago | 3 days |
| 28013 | astrainfinita | feat: Lindemann-Weierstrass Theorem | This PR continues the work from #6718. -------- - [x] depends on: #18693 - [x] depends on: #29121 - [x] depends on: #36762 - [x] depends on: #37797 - [x] depends on: #37811 | t-algebra t-analysis awaiting-author merge-conflict | 1081/64 | Mathlib.lean,Mathlib/Algebra/MonoidAlgebra/MapDomain.lean,Mathlib/Algebra/Polynomial/Splits.lean,Mathlib/Data/Finsupp/Quotient.lean,Mathlib/NumberTheory/Transcendental/Lindemann/AlgebraicPart.lean,Mathlib/NumberTheory/Transcendental/Lindemann/AnalyticalPart.lean,Mathlib/NumberTheory/Transcendental/Lindemann/Basic.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Eval.lean,docs/100.yaml,docs/1000.yaml | 10 | 28 | ['astrainfinita', 'github-actions', 'grunweg', 'j-loreaux', 'jcommelin', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib-splicebot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 165 days ago | 3 days |
| 36794 | vihdzp | doc(SetTheory/Ordinal/Principal): improve documentation | The module docstring now contains a description of what an `op`-principal actually is. I've also added some additional names for discoverability. --- [](https://gitpod.io/from-referrer/) | t-set-theory documentation delegated | 24/18 | Mathlib/SetTheory/Ordinal/Principal.lean,Mathlib/SetTheory/Ordinal/Veblen.lean | 2 | 16 | ['SnirBroshi', 'Vierkantor', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 day ago | 1 day ago | 42 days |
| 33402 | AntoineChambert-Loir | feat(LinearAlgebra/Transvection/Generation): prove exceptional case in Dieudonné's theorem | Establish the fourth part of Dieudonné's theorem: is a linear equivalence is exceptional, it is the product of `finrank K (V ⧸ e.fixedSubmodule)` transvections and one dilatransvection. --- - [ ] depends on: #33348 - [ ] depends on: #33347 - [ ] depends on: #33387 - [ ] depends on: #33282 - [ ] depends on: #33392 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 713/0 | Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean | 5 | 12 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 122 days ago | 11 minutes |
| 33485 | AntoineChambert-Loir | feat(LinearAlgebra/Transvection/Generation): prove the third part of Dieudonné's theorem | Prove the third part of Dieudonné's theorem : if `e : V ≃ₗ[K] V` is a product of `finrank K (V ⧸ e.fixedSubmodule) - 1` transvections and one dilatransvection, then it is not exceptional. Actually, we prove something slightly stronger : if `e : V ≃ₗ[K] V` is a product of a transvection and of `finrank K (V ⧸ e.fixedSubmodule) - 1` dilatransvections, then it is not exceptional. --- - [ ] depends on: #33347 - [ ] depends on: #33348 - [ ] depends on: #33387 - [ ] depends on: #33282 - [ ] depends on: #33392 - [ ] depends on: #33402 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 1122/16 | Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Projectivization/Action.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean | 6 | 13 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 119 days ago | 15 minutes |
| 25978 | Bergschaf | feat(Order/Sublocale): Open Sublocales | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #25089 - [ ] depends on: #36364 | t-order blocked-by-other-PR | 153/36 | Mathlib/Order/Sublocale.lean | 1 | 12 | ['Bergschaf', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 55 days ago | 22 hours |
| 33560 | AntoineChambert-Loir | feat(LinearAlgebra/Transvection/Generation): a linear equivalence is the product of dilatransvections | Prove that a linear equivalence `e` is the product of `V ⧸ e.fixedSubmodule` dilatransvections. (It cannot be a product of less.) --- - [ ] depends on: #33347 - [ ] depends on: #33348 - [ ] depends on: #33387 - [ ] depends on: #33282 - [ ] depends on: #33392 - [ ] depends on: #33402 - [ ] depends on: #33485 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 1222/3 | Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Projectivization/Action.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean | 6 | 12 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 116 days ago | 21 minutes |
| 28807 | alreadydone | experiment: Submodule with SMul only (no Semiring) | --- `SubMulAction` already takes `SMul`. TODO: relax typeclass requirements of `Ideal` as well. [](https://gitpod.io/from-referrer/) | t-algebra awaiting-CI | 54/42 | Mathlib/Algebra/Module/Submodule/Defs.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | unknown | 0 seconds |
| 38740 | Bergschaf | feat(Order/Sublattice): The range of a LatticeHom is a Sublattice | --- [](https://gitpod.io/from-referrer/) | t-order easy | 12/0 | Mathlib/Order/Sublattice.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 33157 | wwylele | feat(Combinatorics): partitions and pentagonal numbers | --- - [ ] depends on: #33143 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 506/1 | Mathlib.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Combinatorics/Enumerative/Partition/Basic.lean,Mathlib/Combinatorics/Enumerative/Partition/Pentagonal.lean,Mathlib/RingTheory/PowerSeries/Pentagonal.lean,Mathlib/Topology/Algebra/InfiniteSum/Pentagonal.lean,Mathlib/Topology/Algebra/InfiniteSum/Ring.lean,docs/1000.yaml | 8 | 3 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] | nobody | 1 day ago | unknown | 0 seconds |
| 33431 | gululu996-ui | feat(Combinatorics/SimpleGraph/Bipartite): characterize bipartite simple graphs by even cycles | Add the classical characterization of bipartite simple graphs: a simple graph is bipartite if and only if every cycle has even length. Previously, mathlib has the definition of `IsBipartite` for `SimpleGraph` and various lemmas about bipartite graphs, but it does not provide this equivalence in a single theorem, so users have to reprove or reassemble it from existing results. Prove the forward direction by showing a 2-coloring alternates along any walk, so every cycle must have even length. Prove the converse by showing that if an odd cycle exists then no bipartition is possible, hence if all cycles are even the graph admits a bipartition. | new-contributor t-combinatorics awaiting-author merge-conflict | 186/1 | Mathlib/Combinatorics/SimpleGraph/Bipartite.lean | 1 | 6 | ['NickAdfor', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts'] | kmill | 1 day ago | 91 days ago | 26 days |
| 34472 | ADedecker | feat: characterize TVS asymptotics in terms of seminorms | --- [](https://gitpod.io/from-referrer/) | t-analysis merge-conflict | 472/24 | Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/Convex/EGauge.lean,Mathlib/Analysis/LocallyConvex/Asymptotics.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Seminorm.lean | 5 | 3 | ['eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | unknown | 0 seconds |
| 34716 | CoolRmal | feat: a right continuous strongly adapted process is progressively measurable | --- [](https://gitpod.io/from-referrer/) | WIP brownian t-measure-probability merge-conflict | 164/0 | Mathlib/Probability/Process/Adapted.lean | 1 | 3 | ['CoolRmal', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 88 days ago | 23 seconds |
| 34853 | GrigorenkoPV | feat(Combinatorics/Enumerative/Catalan): ratio of subsequent Catalan numbers | --- Should I split this into 2 PRs? Otherwise it'll get squashed & be less concise. UPD: ok, I've opened #34854 [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict | 304/194 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Catalan.lean,Mathlib/Combinatorics/Enumerative/Catalan/Basic.lean,Mathlib/Combinatorics/Enumerative/Catalan/Ratio.lean,Mathlib/Combinatorics/Enumerative/Catalan/Tree.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/RingTheory/PowerSeries/Catalan.lean | 7 | 6 | ['github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 day ago | 84 days ago | 1 day |
| 34940 | michaellee94 | feat: the graph of a continuous function on a $C^n$ manifold is a $C^n$ manifold | --- [](https://gitpod.io/from-referrer/) | t-differential-geometry new-contributor awaiting-author merge-conflict | 536/0 | Mathlib.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Geometry/Manifold/Instances/Graph.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Topology/Constructions/Graph.lean | 5 | 80 | ['botbaki-review', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'michaellee94', 'ocfnash'] | ocfnash | 1 day ago | 58 days ago | 15 days |
| 35043 | winstonyin | refactor(Analysis/ODE): restate existence and uniqueness using integral curve API | * Create `Mathlib/Analysis/ODE/ExistUnique.lean` to collect existence and uniqueness results for ODEs stated in terms of the integral curve API (`IsIntegralCurve`, `IsIntegralCurveOn`, `IsIntegralCurveAt`). * Move and restate the Picard-Lindelöf existence theorems from `PicardLindelof.lean` and the $C^1$ vector field results using `IsIntegralCurveOn`/`IsIntegralCurveAt` instead of raw `HasDerivWithinAt`/`HasDerivAt`. * Move and restate the Grönwall-based uniqueness theorems from `Gronwall.lean` using `IsIntegralCurveOn` with half-open intervals (`Ico`/`Ioc`) instead of `HasDerivWithinAt … (Ici t)`/`HasDerivWithinAt … (Iic t)`. * Rename uniqueness theorems to use dot notation on the integral curve types (e.g. `ODE_solution_unique_of_mem_Icc_right` becomes `IsIntegralCurveOn.eqOn_Icc_right`). * Add `IsIntegralCurveOn.eqOn_inter`: if two integral curves on preconnected sets `I` and `J` agree at a point in both sets, they agree on `I ∩ J`. * Add deprecation aliases for all renamed lemmas. - [ ] depends on: #29186 --- [](https://gitpod.io/from-referrer/) | t-analysis merge-conflict | 421/308 | Mathlib.lean,Mathlib/Analysis/ODE/ExistUnique.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,docs/1000.yaml,docs/undergrad.yaml | 7 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mcdoll'] | sgouezel | 1 day ago | 1 day ago | 32 days |
| 35193 | Brian-Nugent | feat(Topology/Closeds): implement category of closed sets in topological spaces | I copied over the nice API for working with `TopologicalSpace.Opens` as a category over for `TopologicalSpace.Closeds`. The only thing that did not immediately transfer was `Topology.IsInducing.functorObj` so I omitted it. Based on work of @kim-em --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor please-adopt merge-conflict | 352/6 | Mathlib.lean,Mathlib/Topology/Category/TopCat/Closeds.lean,Mathlib/Topology/Category/TopCat/Opens.lean | 3 | 24 | ['Brian-Nugent', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts'] | dagurtomas | 1 day ago | 42 days ago | 17 days |
| 35674 | astrainfinita | refactor: use `OrderSupSet` in `ConditionallyCompleteLattice` | --- - [x] depends on: #35774 - [x] depends on: #37079 - [ ] depends on: #37082 - [ ] depends on: #38328 [](https://gitpod.io/from-referrer/) | t-order blocked-by-other-PR merge-conflict | 421/204 | Mathlib/Algebra/Order/Nonneg/Lattice.lean,Mathlib/Algebra/Tropical/Lattice.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Data/Int/ConditionallyCompleteOrder.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Bounds/Defs.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/Copy.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Order/SetNotation.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/Exponential.lean,Mathlib/SetTheory/Ordinal/Family.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/UniformSpace/OfCompactT2.lean | 26 | 8 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | unknown | 0 seconds |
| 35755 | Vilin97 | feat(Analysis/ODE): forward Euler method convergence | WIP Prove the convergence of the Forward Euler Method. This is the first theorem in most textbooks on numerical analysis for ODEs. --- The initial proof was produced by [Aristotle](https://aristotle.harmonic.fun). The code was then iteratively refined (factoring out lemmas, golfing, simplifying proofs) using Claude Code (Claude Opus 4.6). * [ ] depends on: #35753 | new-contributor WIP LLM-generated merge-conflict | 404/0 | Mathlib.lean,Mathlib/Analysis/ODE/EulerMethod.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean | 3 | 6 | ['eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 65 days ago | 11 minutes |
| 36334 | Multramate | feat(AlgebraicGeometry/EllipticCurve): add notation and pretty printer for points | Co-authored-by: Kenny Lau |
t-algebraic-geometry t-meta WIP merge-conflict | 41/0 | Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean | 3 | 13 | ['CBirkbeck', 'Multramate', 'adamtopaz', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'riccardobrasca'] | adamtopaz | 1 day ago | 8 days ago | 45 days |
| 27493 | themathqueen | feat(RingTheory/Coalgebra): define Frobenius algebra | A Frobenius algebra `A` has the structure of both an algebra and a coalgebra such that: `(mul ⊗ id) ∘ assoc.symm ∘ (id ⊗ comul) = comul ∘ mul = (id ⊗ mul) ∘ assoc ∘ (comul ⊗ id)`. In diagrams this law looks like:  It suffices to show that `(mul ⊗ id) ∘ assoc.symm ∘ (id ⊗ comul) = (id ⊗ mul) ∘ assoc ∘ (comul ⊗ id)`. --- - [x] depends on: #27567 - [x] depends on: #27569 - [x] depends on: #32245 [](https://gitpod.io/from-referrer/) | t-ring-theory | 112/0 | Mathlib.lean,Mathlib/RingTheory/FrobeniusAlgebra.lean | 2 | 25 | ['YaelDillies', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'themathqueen'] | alreadydone | 1 day ago | 1 day ago | 48 days |
| 38743 | eric-wieser | feat: `Finite` instances for `Sym` | We already have the `Fintype` instances. I take the liberty of moving these into namespaces in order to produce nicer auto-generated instance names. --- [](https://gitpod.io/from-referrer/) | t-data | 25/3 | Mathlib/Data/Fintype/Vector.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 36701 | kim-em | feat(DefEqAbuse): detect and report leaky instance binder types | This PR adds `#check_instance` and `checkInstance` to `Mathlib/Tactic/FastInstance.lean` to diagnose individual instances for leaky data-field binder types, and integrates this into `#defeq_abuse` so it automatically reports leaky instances. A new `withDisabledInstance` helper temporarily evicts an instance from the discrimination tree (via `Attribute.erase` + `withoutModifyingEnv`), allowing `makeFastInstance` to compute the canonical form without `trySynthInstance` trivially finding the instance being checked. `#defeq_abuse` now checks instances used in the failing goal/command for leakiness and reports them alongside the isDefEq failure diagnostics. **Example: `#check_instance`** ```lean def MyNat := ℕ -- Without fast_instance%, the `add` field has binder type ℕ rather than MyNat. instance leakyAdd : Add MyNat := ⟨Nat.add⟩ #check_instance leakyAdd -- ❌ 'leakyAdd': leaky binder types detected. -- The data field `add` has binder type ℕ where MyNat is expected. -- The `fast_instance%` elaborator may be useful as a repair or band-aid: -- `instance : ... := fast_instance% ` instance fixedAdd : Add MyNat := fast_instance% ⟨Nat.add⟩ #check_instance fixedAdd -- ✅ 'fixedAdd': canonical (re-inferred form agrees at instances transparency) ``` 🤖 Prepared with Claude Code | LLM-generated awaiting-author t-meta merge-conflict | 317/17 | Mathlib/Tactic/DefEqAbuse.lean,Mathlib/Tactic/FastInstance.lean,MathlibTest/CheckInstance.lean,MathlibTest/DefEqAbuse.lean | 4 | 43 | ['JovanGerb', 'Vierkantor', 'eric-wieser', 'github-actions', 'kim-em', 'mathlib-merge-conflicts', 'ocfnash'] | Vierkantor | 1 day ago | 39 days ago | 6 days |
| 36740 | euprunin | chore: golf using `grind` | The goal of this PR is to decrease the number of times lemmas are called explicitly. Any decrease in compilation time is a welcome side effect, although it is not a primary objective. Trace profiling results (differences <30 ms considered measurement noise): * `AlgebraicGeometry.Scheme.isBasis_affineOpens`: unchanged 🎉 * `SimpleGraph.Walk.takeUntil_eq_take`: 263 ms before, 180 ms after 🎉 * `SimpleGraph.Walk.dropUntil_eq_drop`: 382 ms before, 261 ms after 🎉 * `Int.image_Ico_emod`: unchanged 🎉 * `Equiv.Perm.ofSubtype_swap_eq`: unchanged 🎉 Profiled using `set_option trace.profiler true in`. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 7/33 | Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Data/Int/Interval.lean,Mathlib/GroupTheory/Perm/Support.lean | 4 | 8 | ['artie2000', 'chenson2018', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 43 days |
| 37191 | artie2000 | chore(Geometry/Convex/Cone/Pointed): clean up variables | * Remove variable overwrites by changing `variable` declarations and renaming variables * Rename variables to maintain rough type-consistency within the file * Reorganise sections in order of increasing typeclass strength * Bring explicit/implicit variables in line with convention This PR doesn't change any declarations beyond changing variable explicitness. --- [](https://gitpod.io/from-referrer/) | t-convex-geometry awaiting-author merge-conflict | 148/129 | Mathlib/Geometry/Convex/Cone/Pointed.lean | 1 | 15 | ['YaelDillies', 'artie2000', 'github-actions', 'martinwintermath', 'mathlib-merge-conflicts'] | YaelDillies | 1 day ago | 8 days ago | 25 days |
| 38730 | vihdzp | feat: `IsBotOneClass` and `IsBotZeroClass` | We create typeclasses expressing that `0` or `1` is a bottom element in a type. We use this to unify and generalize various theorems which are currently stated for canonically ordered monoids. This has provisionally left us with a bunch of unnecessary aliases; these will be deprecated in a follow-up PR. See [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Typeclass.20for.20IsBot.200/near/586314552). --- [](https://gitpod.io/from-referrer/) | t-order large-import | 226/164 | Mathlib.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Range.lean,Mathlib/Algebra/Order/IsBotOne.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/Order/Interval/Set/Basic.lean,Mathlib/RingTheory/Valuation/Archimedean.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Topology/Algebra/ValuativeRel/ValuativeTopology.lean,Mathlib/Topology/UnitInterval.lean | 17 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38426 | SnirBroshi | feat(Data/Set/Card): `Fintype.card s = s.ncard` | We have `↑(Fintype.card s) = s.encard` but we don't yet have a theorem relating `Fintype.card` and `Set.ncard`. This adds `Fintype.card s = s.ncard` for `Fintype s`, and also `s.ncard = s.encard` for `Finite s`. --- ~~(tagging `simp` is problematic since the aforementioned theorem (`Set.coe_fintypeCard`) is `simp`, and I'm not sure we should untag it)~~ [](https://gitpod.io/from-referrer/) | t-data | 8/0 | Mathlib/Data/Set/Card.lean | 1 | 4 | ['SnirBroshi', 'Vierkantor', 'b-mehta', 'github-actions'] | Vierkantor | 1 day ago | 2 days ago | 6 days |
| 33692 | AntoineChambert-Loir | feat(LinearAlgebra/Transvection/SpecialLinearGroup): generation of the special linear group by transvections | Consider transvections in the special linear group. Prove that they generate the group. Prove Dieudonné's refinement about the minimal number needed to write an element as a product of transvections. --- - [ ] depends on: #33560 - [ ] depends on: #33485 - [ ] depends on: #33402 - [ ] depends on: #33392 - [ ] depends on: #33387 - [ ] depends on: #33348 - [ ] depends on: #33347 - [ ] depends on: #33282 - [x] depends on: #32757 [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR | 1459/18 | Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Projectivization/Action.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean,Mathlib/LinearAlgebra/Transvection/SpecialLinearGroup.lean | 7 | 10 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 114 days ago | 1 minute |
| 33882 | AntoineChambert-Loir | feat(LinearAlgebra/Transvection/SpecialLinearGroup): commutators in the special linear group | Over a field, prove the following results : * transvections are conjugate in the general linear group; except in rank 2, they are conjugate in the special linear group. * the special linear group is equal to its commutator subgroup (except when it doesn't, ie, in rank 2 over a field with 2 or 3 elements). --- - [x] depends on: #33347 - [x] depends on: #33348 - [x] depends on: #33387 - [x] depends on: #33282 - [ ] depends on: #33392 - [ ] depends on: #33402 - [ ] depends on: #33485 - [x] depends on: #32757 - [ ] depends on: #33560 - [ ] depends on: #33692 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 1991/31 | Mathlib.lean,Mathlib/GroupTheory/Commutator/Basic.lean,Mathlib/LinearAlgebra/Basis/Fin.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/Dual/Defs.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Projectivization/Action.lean,Mathlib/LinearAlgebra/SpecialLinearGroup.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean,Mathlib/LinearAlgebra/Transvection/SpecialLinearGroup.lean | 11 | 7 | ['AntoineChambert-Loir', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 109 days ago | 50 seconds |
| 33916 | AntoineChambert-Loir | feat(LinearAlgebra/SpecialLinearGroup/Simple): simplicity of the projective special linear group. | Let `K` be a field and `V` be a `K`-vector space. * `SpecialLinearGroup.isQuasiSimpleGroup`: if `finrank K V` is at least 3, or if `finrank K V = 2` and `K` has at least 4 elements, then `SpecialLinearGroup K V` is quasi-simple, namely, the quotient group `SpecialLinearGroup K V ⧸ Subgroup.center (SpecialLinearGroup K V)` is simple. --- - [x] depends on: #32757 - [x] depends on: #33347 - [x] depends on: #33282 - [x] depends on: #33348 - [x] depends on: #33387 - [ ] depends on: #33392 - [ ] depends on: #33402 - [ ] depends on: #33485 - [ ] depends on: #33560 - [ ] depends on: #33692 - [ ] depends on: #33882 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra | 2213/31 | Mathlib.lean,Mathlib/GroupTheory/Commutator/Basic.lean,Mathlib/LinearAlgebra/Basis/Fin.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/Dual/Defs.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Projectivization/Action.lean,Mathlib/LinearAlgebra/SpecialLinearGroup.lean,Mathlib/LinearAlgebra/SpecialLinearGroup/Simple.lean,Mathlib/LinearAlgebra/Transvection/Basic.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean,Mathlib/LinearAlgebra/Transvection/SpecialLinearGroup.lean | 12 | 6 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 day ago | 108 days ago | 18 minutes |
| 38746 | eric-wieser | chore: `AffineSubspace.Parallel` is an equivalence relation | --- [](https://gitpod.io/from-referrer/) | t-algebra | 12/0 | Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 36501 | AntoineChambert-Loir | feat(RingTheory/GradedAlgebra/Homogeneous/RingQuot): graded structure on the quotient of a graded ring by a homogeneous ideal | Define the graded structure on the quotient of a graded ring by a homogeneous ideal Co-authored with: @mariainesdff (Possible TODO: - Maybe define the graded structure on the quotient of a graded module by a homogeneous submodule. - There is also an issue of working with ring congruences rather than with ideals. ) --- [](https://gitpod.io/from-referrer/) | t-algebra | 552/19 | Mathlib.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/Data/DFinsupp/BigOperators.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/RingQuot.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean,Mathlib/RingTheory/Ideal/Span.lean | 11 | 117 | ['AntoineChambert-Loir', 'chrisflav', 'eric-wieser', 'github-actions', 'robin-carlier'] | eric-wieser, ocfnash, robin-carlier | 1 day ago | 1 day ago | 25 days |
| 38672 | drocta | feat(Algebra/Colimit/DirectLimit): add Algebra structure for DirectLimit | add `Algebra` instance to `DirectLimit`. also add a few lemmas for it for the algebra map, and also define the `of`, `lift`, and the `of_f`, `lift_of` and `hom_ext` lemmas for it. --- Use of AI: I again made some use of ChatGPT for some advice while writing this code, as well as the auto-complete in VS Code. However, I can personally vouch for all of these contributions, and that I understand all of it. This is the second part of my project towards supporting direct limits of $C^*$-algebras (as I described [on Zulip](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Early.20feedback.20on.20approach.20towards.20formalizing.20UHF.20algebras.3F) ). This PR adds an import of `Mathlib.Algebra.Algebra.Hom` (because it needs `AlgHom` and `AlgHomClass` ) in addition to the import of `Mathlib.Algebra.Star.StarRingHom` added in PR #38308 . In the next PR I intend to make, these two should be replaced with an import of `Mathlib.Algebra.Star.StarAlgHom` . | t-algebra new-contributor large-import | 84/0 | Mathlib/Algebra/Colimit/DirectLimit.lean | 1 | 5 | ['drocta', 'github-actions', 'mathlib-bors'] | nobody | 1 day ago | 2 days ago | 2 days |
| 37535 | grunweg | chore(FiberBundle/Trivialisation): tag with grind | I am unsure if all of these are good grind lemmas; close examination is welcome. I left XXX comments with my questions; there are about 3 different questions repeating a few times. --- [](https://gitpod.io/from-referrer/) | t-topology awaiting-author merge-conflict | 49/19 | Mathlib/Topology/FiberBundle/Trivialization.lean | 1 | 7 | ['chenson2018', 'github-actions', 'grunweg', 'mathlib-merge-conflicts'] | urkud | 1 day ago | 26 days ago | 2 days |
| 37553 | grunweg | chore: golf using .ne and friends | ne_of_gt -> .ne' ne_of_lt -> .ne le_of_lt -> .le Drive-by golfs using gcongr and positivity and been split into separate PRs. --- - [x] depends on: #37462 - [x] depends on: #37715 - [x] depends on: #37554 - [x] depends on: #37845 [](https://gitpod.io/from-referrer/) | merge-conflict | 254/269 | Archive/Imo/Imo1981Q3.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Counterexamples/TopologistsSineCurve.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/CharP/Defs.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Finite.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Interval/Set/Instances.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/QuadraticDiscriminant.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/DerivativeTest.lean,Mathlib/Analysis/Calculus/FDeriv/Extend.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Defs.lean,Mathlib/Analysis/Calculus/LHopital.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/Convex/Caratheodory.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/Radon.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/InnerProductSpace/Subspace.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/MellinInversion.lean,Mathlib/Analysis/MellinTransform.lean,Mathlib/Analysis/Normed/Field/Approximation.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/Analysis/Normed/Unbundled/IsPowMulFaithful.lean,Mathlib/Analysis/Normed/Unbundled/SmoothingSeminorm.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Analysis/Oscillation.lean,Mathlib/Analysis/Real/Hyperreal.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/IntegralRepresentation.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/PolarCoord.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Int/Interval.lean,Mathlib/Data/Int/ModEq.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Log.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Real/ConjExponents.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/Dynamics/Ergodic/AddCircle.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/MeasureTheory/Covering/LiminfLimsup.lean,Mathlib/MeasureTheory/Integral/Gamma.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/MeasureTheory/Measure/RegularityCompacts.lean,Mathlib/MeasureTheory/OuterMeasure/Caratheodory.lean,Mathlib/NumberTheory/Harmonic/ZetaAsymp.lean,Mathlib/NumberTheory/PythagoreanTriples.lean | 92 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 6 days |
| 37562 | IvanRenison | feat(Combinatorics/SimpleGraph): add several lemmas about when `Walk.bypass` and `Walk.cycleBypass` do nothing |
Co-authored-by: Vlad Tsyrklevich |
blocked-by-other-PR t-combinatorics merge-conflict | 55/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 8 | ['IvanRenison', 'SnirBroshi', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vlad902'] | nobody | 1 day ago | 29 days ago | 8 minutes |
| 37578 | IvanRenison | feat(Combinatorics/SimpleGraph/Girth): add lemma `Walk.IsCircuit.egirth_le_length` | --- - [x] depends on: #37574 - [ ] depends on: #37505 [](https://gitpod.io/from-referrer/) | t-combinatorics blocked-by-other-PR merge-conflict | 26/3 | Mathlib/Combinatorics/SimpleGraph/Girth.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean | 2 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 28 days ago | 25 minutes |
| 37579 | IvanRenison | feat(Combinatorics/SimpleGraph/Girth): add lemmas about the length of a walk being equal to the girth | --- - [ ] depends on: #37561 - [ ] depends on: #37505 - [x] depends on: #37574 - [ ] depends on: #37562 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics merge-conflict | 89/0 | Mathlib/Combinatorics/SimpleGraph/Girth.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Data/List/Basic.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 28 days ago | 11 minutes |
| 37603 | Parcly-Taxel | refactor: review of `SetSemiring` | * Rename `Set.up` and `SetSemiring.down` to `SetSemiring.ofSet` and `SetSemiring.toSet` respectively. Unprotect both and make them equivalences, following `FreeMonoid`. * Derive `CompleteAtomicBooleanAlgebra` for `SetSemiring` immediately. * Add `imageHom_id` and `imageHom_comp`. The three existing lemmas about `imageHom` are coalesced into `imageHom_apply`. Ultimately inspired by https://github.com/leanprover-community/mathlib4/pull/36934#issuecomment-4183475568. | maintainer-merge merge-conflict | 120/165 | Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Data/Set/Semiring.lean | 2 | 42 | ['Parcly-Taxel', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'sgouezel'] | nobody | 1 day ago | 1 day ago | 22 days |
| 37688 | grunweg | feat: try using grind as gcongr discharger | Let's see what benchmarks say! Also, this exposes some underlying bug in the gcongr discharger handling (which I have worked around in the handful of places hitting it). --- - [x] depends on: #37591 [](https://gitpod.io/from-referrer/) | awaiting-CI t-meta merge-conflict | 73/109 | Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo2019Q4.lean,Archive/Imo/Imo2020Q2.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Order/BigOperators/Ring/Multiset.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Ring/Abs.lean,Mathlib/Algebra/Order/Ring/Int.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/TangentCone/Seq.lean,Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Complex/BorelCaratheodory.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Convex/BetweenList.lean,Mathlib/Analysis/Convex/MetricSpace.lean,Mathlib/Analysis/Distribution/Support.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/Polynomial/MahlerMeasure.lean,Mathlib/Analysis/Real/Pi/Bounds.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog/Order.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Extremal.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/Combinatorics/Additive/AP/Three/Behrend.lean,Mathlib/Combinatorics/Additive/VerySmallDoubling.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Bound.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean,Mathlib/Computability/Ackermann.lean,Mathlib/Computability/AkraBazzi/GrowsPolynomially.lean,Mathlib/Data/Real/Basic.lean,Mathlib/GroupTheory/Archimedean.lean,Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Integral/FinMeasAdditive.lean,Mathlib/MeasureTheory/Integral/PeakFunction.lean,Mathlib/NumberTheory/Bertrand.lean,Mathlib/NumberTheory/Harmonic/ZetaAsymp.lean,Mathlib/NumberTheory/LSeries/SumCoeff.lean,Mathlib/NumberTheory/LucasLehmer.lean,Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Transcendental/Liouville/Basic.lean,Mathlib/Probability/Distributions/Fernique.lean,Mathlib/Probability/Martingale/Basic.lean,Mathlib/Probability/Moments/CovarianceBilinDual.lean,Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean,Mathlib/Tactic/GCongr.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Topology/Algebra/Polynomial.lean,Mathlib/Topology/Instances/ENNReal/Lemmas.lean | 55 | 13 | ['JovanGerb', 'github-actions', 'grunweg', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 25 days ago | 7 seconds |
| 37723 | xgenereux | feat(Adjoin/Polynomial/Transcendental): Adjoining transcendental elements | This PR establishes some basic properties about `A[y]` when `y` is transcendental over `A`. These are mostly just carried over from `A[X]`. - Move `algEquivOfTranscendental` in the newly created file `Mathlib.RingTheory.Adjoin.Polynomial.Transcendental` - Add `Algebra.adjoin.evalOfTranscendental`. This is technically very similar to `Algebra.adjoin.liftSingleton` but the definition is much simpler. It is also currently more general in the sense that it doesn't require `A` to be a field. - Some basic instances from `Polynomial`. Note that these are actually theorems because of the hypothesis `(h : Transcendental R s)` everywhere. I've also added a `Fact` version to allow the possibility of instances. Last note : I initially considered adding some results in `RingTheory.Polynomial.Quotient` where I golfed the file a tiny bit. I removed the unused results but kept the golf. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- - [ ] depends on: #36439 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR merge-conflict | 135/65 | Mathlib.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/RingTheory/Adjoin/Polynomial/Basic.lean,Mathlib/RingTheory/Adjoin/Polynomial/Bivariate.lean,Mathlib/RingTheory/Adjoin/Polynomial/Transcendental.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/Polynomial/Quotient.lean | 8 | 5 | ['github-actions', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'riccardobrasca'] | nobody | 1 day ago | 24 days ago | 32 minutes |
| 37806 | Raph-DG | chore(Topology): rename `Function.locallyFinsupp` to `Function.LocallyFinsupp` | And move single from `LocallyFinSuppWithin` to `LocallyFinsupp`. --- [](https://gitpod.io/from-referrer/) | awaiting-author merge-conflict | 343/146 | Mathlib/Analysis/Complex/JensenFormula.lean,Mathlib/Analysis/Complex/ValueDistribution/FirstMainTheorem.lean,Mathlib/Analysis/Complex/ValueDistribution/LogCounting/Asymptotic.lean,Mathlib/Analysis/Complex/ValueDistribution/LogCounting/Basic.lean,Mathlib/Analysis/Meromorphic/Divisor.lean,Mathlib/Analysis/Meromorphic/FactorizedRational.lean,Mathlib/Analysis/Meromorphic/NormalForm.lean,Mathlib/Topology/LocallyFinsupp.lean | 8 | 11 | ['Raph-DG', 'chrisflav', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 15 days ago | 4 days |
| 38194 | ryanncode | feat(LinearAlgebra/BilinearForm): add indefinite metrics | Add the `IndefiniteMetric` structure to support vector spaces equipped with a non-degenerate, symmetric, indefinite bilinear form. Provide the algebraic foundation for indefinite inner product spaces by formalizing the metric via `LinearMap.BilinForm` and extracting its associated quadratic form without enforcing the `IsPosSemidef` typeclass. Previously, mathlib required strictly positive-definite metrics to instantiate inner product spaces (`InnerProductSpace`), which prevented the formalization of indefinite geometries without causing typeclass inference failures. Bridge this gap by isolating the symmetric bilinear form from topological and positivity constraints, allowing the library to handle generalized indefinite metric spaces safely. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor merge-conflict | 47/0 | Mathlib.lean,Mathlib/LinearAlgebra/BilinearForm/IndefiniteMetric.lean | 2 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 11 days |
| 38328 | astrainfinita | feat: `OrderSupSet` | This PR introduces `OrderSupSet` and `OrderInfSet`, which are typeclasses expressing that `sSup` (resp., `sInf`) returns the least upper bound (resp., the greatest lower bound) of a set whenever one exists. This allows us to prove properties about the `sSup` of specific sets (such as `∅`, singletons, finite sets, and `univ`) without any typeclasses asserting the existence of LUBs. For example, `sSup ∅ = ⊥` holds for any type equipped with `OrderBot` `OrderSupSet`, no longer requiring typeclasses like `ConditionallyCompleteLinearOrderBot`. For a general set `s`, this gives a uniform way to extend results about `IsLUB s a → motive a` to `motive (sSup s)`, `motive (⨆ i, f i)`, `motive (a ⊔ b)`, etc., which allows proof reuse for basic API such as [`csSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/ConditionallyCompleteLattice/Basic.html#csSup_insert), [`iSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/CompleteLattice/Basic.html#iSup_insert), and [`sSup_insert`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/CompleteLattice/Basic.html#sSup_insert) and downstream code like [`csSup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.html#csSup_add), [`sSup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.html#sSup_add), and [`sup_add`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Group/Lattice.html#sup_add). Furthermore, this allows us to refactor incrementally, reducing the dependency of results about various completeness typeclasses on the specific implementation of `sSup`. --- [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F) [](https://gitpod.io/from-referrer/) | t-order merge-conflict | 156/73 | Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Bounds/Defs.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/SetNotation.lean,Mathlib/Topology/UniformSpace/OfCompactT2.lean | 7 | 16 | ['JovanGerb', 'astrainfinita', 'b-mehta', 'github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'openendings', 'vihdzp'] | nobody | 1 day ago | 1 day ago | 5 days |
| 38329 | jcommelin | chore: tighten down public/exposed API of AlgebraicClosure | This PR tightens down the API of AlgebraicClosure, by making few parts of FieldTheory/IsAlgClosed/AlgebraicClosure.lean public and/or exposed. We still need to expose the main definition. It would be great if we can unexpose it in the future. --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 73/53 | Mathlib/Algebra/Lie/TraceForm.lean,Mathlib/FieldTheory/AxGrothendieck.lean,Mathlib/FieldTheory/Differential/Liouville.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/ModelTheory/Algebra/Field/IsAlgClosed.lean,Mathlib/RingTheory/Discriminant.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Norm/Transitivity.lean,Mathlib/RingTheory/Trace/Basic.lean | 9 | 26 | ['eric-wieser', 'github-actions', 'jcommelin', 'kbuzzard', 'leanprover-radar', 'mathlib-merge-conflicts', 'plp127', 'riccardobrasca'] | nobody | 1 day ago | 1 day ago | 7 days |
| 38362 | vihdzp | feat: cofinal subset of regular cardinal is isomorphic to it | In set theory, one often identifies a cardinal `c` with its initial ordinal `c.ord`, and said ordinal with the lower set `Iio c.ord`. This is particularly pervasive in the theory of club and stationary subsets, where one often sees the hypothesis "let κ be a regular cardinal" in lieu of the more precise wording: that `κ` is an (infinite) well-order, whose order type equals the initial ordinal of its cardinality. We define a typeclass `IsRegularCardinalOrder` for this assumption. The benefit of using it is that our results won't apply only to `Iio c.ord` for regular `c`, but also to concrete types such as `Nat`, `Cardinal`, or `Ordinal`. --- - [ ] depends on: #38363 [](https://gitpod.io/from-referrer/) | file-removed blocked-by-other-PR t-set-theory merge-conflict | 340/198 | Mathlib.lean,Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean,Mathlib/LinearAlgebra/Dimension/Finite.lean,Mathlib/Order/BoundedOrder/Basic.lean,Mathlib/Order/Filter/Cocardinal.lean,Mathlib/SetTheory/Cardinal/Cofinality/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality/Enum.lean,Mathlib/SetTheory/Cardinal/Cofinality/Ordinal.lean,Mathlib/SetTheory/Cardinal/Regular.lean,Mathlib/SetTheory/Ordinal/FundamentalSequence.lean | 10 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 9 days ago | 16 minutes |
| 38444 | astrainfinita | refactor(Order/(Conditionally)CompletePartialOrder): extends `OrderSupSet` | --- - [ ] depends on: #35674 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 438/219 | Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.lean,Mathlib/Algebra/Order/Nonneg/Lattice.lean,Mathlib/Algebra/Tropical/Lattice.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Data/Int/ConditionallyCompleteOrder.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Data/Real/Pointwise.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/Bounds/Defs.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/CompletePartialOrder.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Basic.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Indexed.lean,Mathlib/Order/Copy.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Order/SetNotation.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/Probability/Process/HittingTime.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/Exponential.lean,Mathlib/SetTheory/Ordinal/Family.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/UniformSpace/OfCompactT2.lean | 33 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 7 days ago | 41 minutes |
| 38561 | mcdoll | feat: use `Is*Apply` classes for continuous linear maps | --- [](https://gitpod.io/from-referrer/) | merge-conflict | 912/416 | Mathlib.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Homology.lean,Mathlib/Algebra/Module/CharacterModule.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Analysis/Analytic/Binomial.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/Darboux.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/Deriv/CompMul.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Norm.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean,Mathlib/Analysis/Calculus/Implicit.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Calculus/VectorField.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/Harmonic/Analytic.lean,Mathlib/Analysis/Convex/Birkhoff.lean,Mathlib/Analysis/Convex/DoublyStochasticMatrix.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Convolution.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Deriv.lean,Mathlib/Analysis/Fourier/FourierTransform.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/ConformalLinearMap.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/InnerProductSpace/LinearMap.lean,Mathlib/Analysis/InnerProductSpace/Positive.lean,Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection/FiniteDimensional.lean,Mathlib/Analysis/InnerProductSpace/Rayleigh.lean,Mathlib/Analysis/InnerProductSpace/Reproducing.lean,Mathlib/Analysis/InnerProductSpace/StarOrder.lean,Mathlib/Analysis/LocallyConvex/PointwiseConvergence.lean,Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Normed/Algebra/GelfandFormula.lean,Mathlib/Analysis/Normed/Group/SeparationQuotient.lean,Mathlib/Analysis/Normed/Module/Alternating/Uncurry/Fin.lean,Mathlib/Analysis/Normed/Module/Bases.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Normed/Operator/Basic.lean,Mathlib/Analysis/Normed/Operator/Bilinear.lean,Mathlib/Analysis/Normed/Operator/Compact.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/Normed/Operator/Mul.lean,Mathlib/Analysis/Normed/Unbundled/FiniteExtension.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Data/FunLike/Group.lean,Mathlib/Data/FunLike/IsApply.lean,Mathlib/Data/FunLike/Module.lean,Mathlib/Data/FunLike/MonoidWithZero.lean,Mathlib/Data/FunLike/Ring.lean,Mathlib/Data/Matrix/PEquiv.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/LinearAlgebra/Eigenspace/ContinuousLinearMap.lean,Mathlib/LinearAlgebra/Matrix/Polynomial.lean,Mathlib/LinearAlgebra/QuadraticForm/Dual.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL1.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/JacobianOneDim.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Group/Prod.lean,Mathlib/MeasureTheory/Integral/Bochner/L1.lean,Mathlib/MeasureTheory/Integral/FinMeasAdditive.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/Haar/DistribChar.lean,Mathlib/MeasureTheory/Measure/Haar/MulEquivHaarChar.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/MeasureTheory/VectorMeasure/Decomposition/Hahn.lean,Mathlib/MeasureTheory/VectorMeasure/Decomposition/Jordan.lean,Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/Basic.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/Probability/Distributions/Uniform.lean,Mathlib/Probability/Moments/Variance.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/Module/LinearMapPiProd.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Module/Spaces/ContinuousLinearMap.lean,Mathlib/Topology/Algebra/Module/Spaces/UniformConvergenceCLM.lean | 101 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | unknown | 0 seconds |
| 35402 | samueloettl | feat(Dynamics/BirkhoffSum): birkhoffAverage const | --- I think this is useful and one of these should be a simp lemma. I'm not really sure if I got the naming of the theorems correct. When generalizing to the assumption (n : R) ≠ 0 instead of the special case CharZero R with n ≠ 0 I had to use "open Classical in". I'm a bit unfamiliar with that part so please check if this makes sense. See also https://github.com/leanprover-community/mathlib4/pull/35307#discussion_r2823586252 [](https://gitpod.io/from-referrer/) | t-dynamics new-contributor | 14/0 | Mathlib/Dynamics/BirkhoffSum/Average.lean | 1 | 25 | ['Maldooor', 'github-actions', 'lua-vr', 'mcdoll', 'samueloettl'] | mcdoll | 1 day ago | 2 days ago | 68 days |
| 36971 | Jun2M | feat(Combinatorics/GraphLike): Change SimpleGraph files to use GraphLike | Per discussion at ([#graph theory > HasAdj](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/HasAdj/with/575843445)), this PR changes a swath of files in `SimpleGraph` folder to use `GraphLike` class and its APIs. --- - [ ] depends on: #36743 - [ ] depends on: #36829 - [ ] depends on: #36756 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics | 2515/1594 | Archive/Wiedijk100Theorems/Konigsberg.lean,Mathlib.lean,Mathlib/CategoryTheory/Sites/IsSheafFor.lean,Mathlib/Combinatorics/Digraph/GraphLike.lean,Mathlib/Combinatorics/Graph/GraphLike.lean,Mathlib/Combinatorics/GraphLike/Basic.lean,Mathlib/Combinatorics/GraphLike/Symm.lean,Mathlib/Combinatorics/GraphLike/Walks/Basic.lean,Mathlib/Combinatorics/GraphLike/Walks/Simple.lean,Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Circulant.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Constructions.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Dart.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/DeleteEdges.lean,Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean,Mathlib/Combinatorics/SimpleGraph/Girth.lean,Mathlib/Combinatorics/SimpleGraph/GraphLike.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Metric.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Sum.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean,Mathlib/Combinatorics/SimpleGraph/Tutte.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Chord.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Counting.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Subwalks.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Traversal.lean,Mathlib/Data/Subtype.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/CastData.lean | 46 | 5 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 40 days ago | 8 minutes |
| 38365 | vihdzp | feat: `#Ordinal = univ` | --- [](https://gitpod.io/from-referrer/) | t-set-theory easy | 6/1 | Mathlib/SetTheory/Ordinal/Univ.lean | 1 | 2 | ['b-mehta', 'github-actions', 'vihdzp'] | nobody | 1 day ago | 9 days ago | 9 days |
| 35210 | kim-em | chore: use @[to_dual] in CompleteLattice extras and Set.Lattice | This PR uses `@[to_dual]` to auto-generate dual theorems in `Order.CompleteLattice.Lemmas`, `Order.CompleteLattice.Finset`, and `Data.Set.Lattice`, deleting hand-written dual versions. [Diff relative to previous PR](https://github.com/kim-em/mathlib4/compare/kim/to-dual-complete-lattice...kim/to-dual-complete-lattice-extras) - [ ] depends on: #35209 🤖 Prepared with Claude Code | LLM-generated | 37/94 | Mathlib/Data/Set/Lattice.lean,Mathlib/Order/CompleteLattice/Finset.lean,Mathlib/Order/CompleteLattice/Lemmas.lean,Mathlib/Tactic/SetLike.lean | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 1 day |
| 36495 | AlexKontorovich | chore(Finset/NatDivisors): refactor `card_divisors_mul` and `sum_divisors_mul` to not rely on `ArithmeticFunction` | `Nat.Coprime.card_divisors_mul` and `Nat.Coprime.sum_divisors_mul` are moved to not rely on `ArithmeticFunction`. See zulip discussion here: [#mathlib4 > Library design question, e.g.`Nat.Coprime.card_divisors_mul` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Library.20design.20question.2C.20e.2Eg.2E.60Nat.2ECoprime.2Ecard_divisors_mul.60/near/577769899)
Co-authored-by: Ziyan Wei |
large-import t-number-theory t-algebra | 41/14 | Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Data/Finset/NatDivisors.lean,Mathlib/NumberTheory/ArithmeticFunction/Misc.lean | 3 | 5 | ['AlexKontorovich', 'arajasek', 'github-actions'] | nobody | 1 day ago | 23 days ago | 46 days |
| 36604 | JovanGerb | feat(Translate): reorder universes | This PR improves the heuristic for reordering of universes in `to_dual`/`to_additive`. The previous heuristic worked well when the first two universes had to be swapped. For example for translating `a ^ n` to `n • a`, and for dualizing `GaloisConnection`. However, in Category theory we sometimes need to swap more universes because a category instance comes with 2 universes which both need to be swapped. In particular, the comma category, and adjunctions both need this feature. This PR doesn't add any syntax for specifying the reordering of universes. It is assumed that the universe reordering can always be inferred from the normal reordering and from the type. --- [](https://gitpod.io/from-referrer/) | t-meta | 204/91 | Mathlib/CategoryTheory/Comma/Basic.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/Reorder.lean,MathlibTest/ToDual.lean | 4 | 8 | ['JovanGerb', 'bryangingechen', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 23 days ago | 37 days |
| 38349 | SnirBroshi | chore(Combinatorics/SimpleGraph/Coloring/VertexColoring): rename to `Vertex.lean` | After #37525 moved `Coloring.lean` to `Coloring/VertexColoring.lean`, a [Zulip](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Coloring.20module.20names/with/583281500) poll decided to avoid duplicating the word "Coloring", so this renames `Coloring/VertexColoring.lean` to `Coloring/Vertex.lean`. --- I planned to make this move in #33313 but it isn't moving along, so I think it's best to split the renaming. #37546 adds module deprecation [](https://gitpod.io/from-referrer/) | file-removed t-combinatorics | 6/6 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Constructions.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Vertex.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/Partition.lean,Mathlib/Combinatorics/SimpleGraph/Sum.lean | 7 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 9 days |
| 37546 | SnirBroshi | chore(Combinatorics/SimpleGraph): add module deprecations for #36819 #36854 #37525 #37544 #38349 | --- - [ ] depends on: #37544 - [ ] depends on: #38349 [](https://gitpod.io/from-referrer/) | t-combinatorics blocked-by-other-PR | 689/611 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Constructions.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Vertex.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/WalkCounting.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/WalkDecomp.lean,Mathlib/Combinatorics/SimpleGraph/EdgeLabeling.lean,Mathlib/Combinatorics/SimpleGraph/Partition.lean,Mathlib/Combinatorics/SimpleGraph/Sum.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Counting.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Decomp.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Subwalks.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Traversal.lean | 20 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 9 days ago | 8 hours |
| 29434 | ntapiam | feat(NonAssoc/LieAdmissible): prove every ring/algebra is LieAdmissible | -awaiting-author | t-algebra new-contributor | 32/6 | Mathlib/Algebra/NonAssoc/LieAdmissible/Defs.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | ocfnash | 1 day ago | 16 days ago | 16 days |
| 36667 | NoneMore | feat(ModelTheory): add `exClosure` definition for first-order formulas | Prepare for moving realizations between elementarily equivalent structures. --- [](https://gitpod.io/from-referrer/) | new-contributor t-logic | 37/0 | Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 2 | 2 | ['github-actions'] | fpvandoorn | 1 day ago | 47 days ago | 47 days |
| 37682 | SabrinaJewson | refactor(Order/OrdContinuous): redefine left and right order continuity to not require preserving ⊥/⊤ | `LeftOrdContinuous` currently requires that `f ⊥ = ⊥`, but this means that many functions that are perhaps intuitively left-continuous (like `f x = x + 1` on `ℝ≥0`) are not. In particular, this change means that functions between conditionally complete lattices are `LeftOrdContinuous` iff they are monotone and topologically left continuous (see `MonotoneOn.map_csSup_of_continuousWithinAt` for the reverse direction). If one wants the concept that existed before, one can either accept the `f ⊥ = ⊥` hypothesis separately or, if the function is between complete lattices, use the left side of a `GaloisConnection` (which is equivalent, although I think this is not yet in Mathlib). This removes the definitional equality of the type in favour of a structure. Since most of the time users will be working with the `sSup` versions and not with `IsLUB`, I think this is justified. As a consequence, this removes the definitional equality between `LeftOrdContinuous` and `RightOrdContinuous` of the dual – the latter could be redefined to re-add this, but we do have conversion functions. `LeftOrdContinuous.continuousWithinAt_Iic` is rewritten to accomodate these changes; the superfluous `DenselyOrdered` assumption is also removed. [Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/LeftOrdContinuous.20requires.20f.28.E2.8A.A5.29.20.3D.20.E2.8A.A5/near/582932491) --- - [x] depends on: #37735 - [x] depends on: #37772 [](https://gitpod.io/from-referrer/) | new-contributor t-order | 52/38 | Mathlib/Order/OrdContinuous.lean,Mathlib/Order/SemiconjSup.lean,Mathlib/Topology/Order/Basic.lean | 3 | 10 | ['SabrinaJewson', 'astrainfinita', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | bryangingechen | 1 day ago | 21 days ago | 23 days |
| 37858 | tb65536 | feat(RingTheory/LocalRing/ResidueField/Fiber): `Ideal.Fiber` is a quotient of a localization | This PR proves that `Ideal.Fiber` is a quotient of a localization. This is needed for #37130. --- - [x] depends on: #37380 [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 16/0 | Mathlib/RingTheory/LocalRing/ResidueField/Fiber.lean | 1 | 2 | ['github-actions', 'mathlib-dependent-issues'] | mariainesdff | 1 day ago | 21 days ago | 21 days |
| 37955 | artie2000 | feat(Algebra/Polynomial): lemmas about `modByMonic` | * Add various small lemmas about `Polynomial.modByMonic` * Remove unneccesary commutativity assumption on `Polynomial.aeval_eq_zero_of_dvd_aeval_eq_zero` by proving `Polynomial.aeval_dvd` --- [](https://gitpod.io/from-referrer/) | t-algebra | 20/6 | Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/FieldTheory/Minpoly/Basic.lean,Mathlib/RingTheory/Polynomial/IsIntegral.lean | 5 | 1 | ['github-actions'] | ocfnash | 1 day ago | 19 days ago | 19 days |
| 38428 | tb65536 | refactor(RepresentationTheory/Coinvariants): use `IntertwiningMap` in `Coinvariants.map` | Currently `Coinvariants.map` has the intertwining condition as as a separatel hypothesis. This PR switches over to the bundled `IntertwiningMap`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 16/20 | Mathlib/RepresentationTheory/Coinvariants.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/Basic.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/FiniteCyclic.lean,Mathlib/RepresentationTheory/Homological/Resolution.lean,Mathlib/RepresentationTheory/Induced.lean,Mathlib/RepresentationTheory/Rep/Basic.lean | 6 | 1 | ['Whysoserioushah', 'github-actions'] | riccardobrasca | 1 day ago | 7 days ago | 7 days |
| 38564 | wwylele | chore(Algebra/Group): remove `backward.privateInPublic` | --- [](https://gitpod.io/from-referrer/) | t-algebra tech debt | 20/32 | Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Algebra/GroupWithZero/Basic.lean | 3 | 1 | ['github-actions'] | jcommelin | 1 day ago | 4 days ago | 4 days |
| 38682 | yuanyi-350 | chore(Geometry/Euclidean/Sphere/Basic): remove an erw | - rewrites through `Matrix.vecCons` before `Fin.cons_injective_iff`, so the affine-independence proof uses `rw` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-euclidean-geometry | 1/1 | Mathlib/Geometry/Euclidean/Sphere/Basic.lean | 1 | 3 | ['github-actions', 'jcommelin', 'yuanyi-350'] | jsm28 | 1 day ago | 2 days ago | 2 days |
| 38690 | yuanyi-350 | chore(Topology/Homotopy/Product): remove an erw | - uses `rw [pi_lift]` directly in `pi_proj`, so the quotient induction no longer needs `erw` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-topology LLM-generated | 1/2 | Mathlib/Topology/Homotopy/Product.lean | 1 | 2 | ['github-actions', 'jcommelin', 'yuanyi-350'] | ADedecker | 1 day ago | 2 days ago | 2 days |
| 38701 | loefflerd | feat(Mathlib/Topology): functional-analytic prereqs for PR 37984 | Various miscellaneous constructions around spaces of continuous functions and continuous linear maps, needed for the theory of nonarchimedean measures being developed in PR 37984. The main new result is a criterion for the map `C(X, R) ⊗[R] C(Y, R) → C(X × Y, R)` to have dense image. --- [](https://gitpod.io/from-referrer/) | t-topology | 88/0 | Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/ContinuousMap/Algebra.lean,Mathlib/Topology/UniformSpace/ProdApproximation.lean | 3 | 1 | ['github-actions'] | j-loreaux | 1 day ago | 2 days ago | 2 days |
| 36169 | SnirBroshi | feat(Order/ConditionallyCompleteLattice/Indexed): `iSup` of `sup`s vs `sup` of `iSup`s | `ciSup_sup_eq`/`ciInf_inf_eq` match `CompleteLattice`'s `iSup_sup_eq`/`iInf_inf_eq`, and in a `ConditionallyCompleteLinearOrder` we get an inequality without any bounded assumptions. `Finset.ciSup_union` for `ConditionallyCompleteLinearOrderBot` matches `CompleteLattice`'s `Finset.iSup_union`. --- [](https://gitpod.io/from-referrer/) | t-order | 58/0 | Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean | 3 | 11 | ['SnirBroshi', 'Vierkantor', 'github-actions', 'vihdzp'] | Vierkantor | 1 day ago | 1 day ago | 23 days |
| 38748 | SnirBroshi | feat(Combinatorics/SimpleGraph/Basic): `G.edgeSet ⊆ s.sym2 ↔ G.support ⊆ s` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 19/4 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean | 2 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38097 | NoahW314 | feat: add `IndiscreteTopology` instances | --- [](https://gitpod.io/from-referrer/) | t-topology | 24/0 | Mathlib/Topology/Homotopy/Contractible.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Separation/Connected.lean | 4 | 5 | ['NoahW314', 'github-actions', 'scholzhannah', 'vihdzp'] | PatrickMassot | 1 day ago | 15 days ago | 15 days |
| 37076 | ertwro | feat(Combinatorics/SimpleGraph/Hasse): Hasse diagram is triangle-free | Add `SimpleGraph.hasse_cliqueFree_three`: the Hasse diagram of a preorder is triangle-free (`CliqueFree 3`). This is the graph-theoretic formulation of `not_covBy_of_lt_of_lt`: if `a ⋖ b` and `b ⋖ c`, then `¬ a ⋖ c`, so no three elements can be pairwise adjacent in the Hasse diagram. The proof extracts three vertices from a hypothetical 3-clique, case-splits on the covering directions (8 cases), and closes each by `not_covBy_of_lt_of_lt` (6 transitive cases) or `lt_asymm` (2 cyclic cases). --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 11/0 | Mathlib/Combinatorics/SimpleGraph/Hasse.lean | 1 | 21 | ['Rida-Hamadani', 'SnirBroshi', 'ertwro', 'github-actions', 'vlad902'] | nobody | 1 day ago | 12 days ago | 20 days |
| 38392 | ldct | feat: (anti-)periodicity of complex sinh,cosh,tanh | Add antiperiodicity and periodicity theorems for complex sinh/cosh/tanh from AlexKontorovich/PrimeNumberTheoremAnd --- [](https://gitpod.io/from-referrer/) | t-analysis | 41/0 | Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean | 1 | 3 | ['SnirBroshi', 'github-actions', 'j-loreaux', 'ldct'] | j-loreaux | 1 day ago | 1 day ago | 1 day |
| 38092 | SnirBroshi | chore(Order/Defs/Unbundled): deprecate `def Symmetric` in favor of `class Std.Symm` | --- [Mathlib's `def Symmetric`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/Defs/Unbundled.html#Symmetric) [Core's `class Std.Symm`](https://leanprover-community.github.io/mathlib4_docs/Init/Core.html#Std.Symm) [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Relation.20properties.20duplication/near/544638270) [](https://gitpod.io/from-referrer/) | t-order | 468/412 | Archive/Wiedijk100Theorems/FriendshipGraphs.lean,Archive/Wiedijk100Theorems/Konigsberg.lean,Counterexamples/HeawoodUnitDistance.lean,Mathlib/Algebra/BigOperators/Group/List/Lemmas.lean,Mathlib/Algebra/Divisibility/Units.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/InnerProductSpace/Orthogonal.lean,Mathlib/Analysis/Normed/Operator/Compact/FredholmAlternative.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/IsConnected.lean,Mathlib/Combinatorics/Additive/ErdosGinzburgZiv.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/Graph/Basic.lean,Mathlib/Combinatorics/Graph/Delete.lean,Mathlib/Combinatorics/Graph/Lattice.lean,Mathlib/Combinatorics/Graph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Circulant.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Dart.lean,Mathlib/Combinatorics/SimpleGraph/Density.lean,Mathlib/Combinatorics/SimpleGraph/Hall.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/LineGraph.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Sum.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Tripartite.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean,Mathlib/Data/Finset/Pairwise.lean,Mathlib/Data/Finsupp/BigOperators.lean,Mathlib/Data/List/Pairwise.lean,Mathlib/Data/List/Sigma.lean,Mathlib/Data/Multiset/Bind.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/Data/Multiset/Pairwise.lean,Mathlib/Data/Multiset/Replicate.lean,Mathlib/Data/Nat/GCD/Basic.lean,Mathlib/Data/Rel/Separated.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/Set/Pairwise/Basic.lean,Mathlib/Data/Set/Pairwise/List.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/Data/WSeq/Relation.lean,Mathlib/GroupTheory/Perm/Cycle/Factors.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/Logic/Relation.lean,Mathlib/MeasureTheory/Measure/AEDisjoint.lean,Mathlib/MeasureTheory/Measure/NullMeasurable.lean,Mathlib/ModelTheory/Graph.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/NumberTheory/ArithmeticFunction/Defs.lean,Mathlib/Order/Antichain.lean,Mathlib/Order/Defs/Unbundled.lean,Mathlib/Order/Disjoint.lean,Mathlib/Order/Lattice.lean,Mathlib/Order/Preorder/Chain.lean,Mathlib/Order/PropInstances.lean,Mathlib/RingTheory/Coprime/Ideal.lean,Mathlib/RingTheory/Radical/Basic.lean,Mathlib/Topology/CWComplex/Classical/Graph.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/Connected/Clopen.lean,Mathlib/Topology/MetricSpace/MetricSeparated.lean,Mathlib/Topology/Separation/Basic.lean,Mathlib/Topology/Separation/GDelta.lean | 81 | 4 | ['SnirBroshi', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 14 days |
| 38635 | Fieldnote-Echo | chore(scripts): handle simple to_additive deprecations | Closes #38550. This updates `scripts/add_deprecations.sh` so that, when a renamed declaration is near an existing `@[to_additive]` attribute, the script also emits the additive deprecation alias in the common default-name case. For example, `foo_mul -> bar_mul` now produces: ```lean @[deprecated (since := "...")] alias foo_add := bar_add @[to_additive existing, deprecated (since := "...")] alias foo_mul := bar_mul ``` This is intentionally conservative and text-based, matching the existing script. It handles common name translations such as mul/add, prod/sum, one/zero, inv/neg, and div/sub, and skips cases that look like they need less common to_additive name generation. Tested with a local six-case fixture and a scratch Lean file confirming that the generated alias form compiles and produces deprecation warnings for both names. I opened this as draft because I still count as a new contributor under the LLM-assisted PR policy. I have one merged mathlib PR (#36443), and this is a one-file script patch that I reviewed/tested manually. I'll leave it as draft unless a maintainer gives it the green light to flip ready. I used Claude assistance while drafting and testing the patch. I reviewed the final diff manually and tested the generated Lean form locally. | CI new-contributor | 121/10 | scripts/add_deprecations.sh | 1 | 4 | ['Fieldnote-Echo', 'SnirBroshi', 'github-actions'] | kim-em | 1 day ago | unknown | 0 seconds |
| 37930 | vlad902 | chore(SimpleGraph): move `cycleGraph` to its own file | PR #34797 re-defined `cycleGraph` independent of `circulantGraph`. Now move the definition of `cycleGraph` to its own file so that the definition can be used without importing the algebra hierarchy. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 173/148 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Circulant.lean,Mathlib/Combinatorics/SimpleGraph/Cycle.lean | 3 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38744 | eric-wieser | feat: add `Nat.Coprime.divisors_mul` | The main result here is that products of divisors taken from coprime naturals are unique. A similar statement could be ``` theorem Nat.Coprime.divisors_mul' {m n : ℕ} (hmn : m.Coprime n) : divisors (m * n) = (divisors m).attach.disjiUnion (fun i => (divisors n).map ⟨(i.1 * ·), mul_right_injective₀ sorry⟩) sorry := sorry ``` but this seems even uglier. --- [](https://gitpod.io/from-referrer/) | t-number-theory t-data | 23/1 | Mathlib/Data/Finset/NatDivisors.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38582 | dennj | feat(LinearAlgebra/Matrix): add Hadamard matrices | Introduce `Matrix.IsHadamard` over a general `Ring R`, with the basic theory: - `IsHadamard` and `IsComplexHadamard` predicates (Definitions 2.3.1 and 2.7.1 of de Launey–Flannery, *Algebraic Design Theory*). - `IsHadamard.det_sq`: the Hadamard determinant identity `(det A)² = n^n`. - `IsHadamard.det_ne_zero`: over an integral domain of characteristic zero. - `IsHadamard.transpose`: `Aᵀ` is Hadamard whenever `A` is (Theorem 2.3.6), proved over `[CommRing R] [IsDomain R] [CharZero R]` via the adjugate. - `IsHadamard.card_eq_sq_of_const_row_sum`: a Hadamard matrix with constant row sum `s` has order `s²` (slightly stronger than Theorem 2.3.7: the constant-column-sum hypothesis is implied by orthogonality). - `IsHadamard.kronecker`: the Sylvester (Kronecker product) construction. - `IsHadamard.four_dvd_card`: order of a Hadamard matrix of order > 2 is divisible by 4. `Matrix.mul_eq_smul_one_symm`: if `M * N = c • 1` and `det M ≠ 0` over an integral domain, then `N * M = c • 1`. Used here for the transpose proof, but generally useful, analogous to how `mul_eq_one_comm` works over stably finite rings, but covers the integral-domain case (e.g. `ℤ`, `ℤ[X]`) where matrix inverses don't exist. ## References Adds the de Launey–Flannery bibliography entry, cited from the new file. Human-made PR with LLM used for proof golfing and documentation | t-algebra new-contributor | 152/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Adjugate.lean,Mathlib/LinearAlgebra/Matrix/HadamardMatrix.lean,docs/references.bib | 4 | 10 | ['JJYYY-JJY', 'dennj', 'eric-wieser', 'github-actions', 'themathqueen'] | nobody | 1 day ago | 4 days ago | 4 days |
| 35652 | dennj | feat(LinearAlgebra/Matrix): add `Matrix.mul_eq_smul_one_symm` | Adds three lemmas: - IsLeftRegular.mul_eq_of_comm (Algebra/Group/Defs.lean): if a is left-regular, a * b = c, and c commutes with a, then b * a = c. Generalises IsLeftRegular.mul_eq_one_symm from the c = 1 case. - IsRightRegular.mul_eq_of_comm: symmetric version. - mul_eq_smul_one_symm (Algebra/Group/Action/Defs.lean): scalar variant of mul_eq_one_symm. For a monoid β with a compatible scalar action by α, if a * b = c • 1 and a is left-regular, then b * a = c • 1. Proven in one line via IsLeftRegular.mul_eq_of_comm, since c • 1 is central thanks to IsScalarTower α β β and SMulCommClass α β β. The additive analogues are produced by to_additive. The general mul_eq_of_comm helpers capture the underlying pattern: "a left/right-regular element can be cancelled when the conclusion commutes with it" and are reusable beyond this PR's specialisation. Human made PR | t-algebra new-contributor LLM-generated | 19/0 | Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Defs.lean | 2 | 7 | ['dagurtomas', 'dennj', 'eric-wieser', 'github-actions', 'grunweg'] | ocfnash | 1 day ago | 4 days ago | 22 days |
| 38449 | WenrongZou | feat(MvPowerSeries): some lemmas about `subst` of infinite sum | In this PR, I add some lemmas about substituion of a infinite sum equal to infinite sum of substitution. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 34/0 | Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 7 days |
| 38731 | martinwintermath | feat(LinearAlgebra/AffineSpace/AffineSubspace): using `AffineSubspace.direction` to reinterpret `AffineSubspace` as `Submodule` | * add `AffineSubspace.vsub_self_of_zero_mem` that states `s -ᵥ s = s ` if `0 ∈ s` * add `AffineSubspace.direction_eq_self_of_zero_mem` that states that if `0 ∈ s`, then the directions coerce back to the affine subspace. * add corresponding `CanLift` instance. * modify doc-string of `AffineSubspace.direction` to state that this can be used for reinterpretation of an affine subspace as a submodule. * add `Coe` instance based on `Submodule.toAffineSubspace` and adds corresponding @[coe] attribute. The PR also performs a slight cleanup of the file: statements about `SetLike` or `Submodule.toAffineSubspace` have been moved closer to their respective definitions. --- [](https://gitpod.io/from-referrer/) | t-algebra | 56/26 | Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean | 1 | 3 | ['github-actions', 'wwylele'] | nobody | 1 day ago | 2 days ago | 2 days |
| 28613 | espottesmith | feat(Combinatorics): define undirected hypergraphs | This PR defines undirected hypergraphs: ``` @[ext] structure Hypergraph (α : Type*) where /-- The vertex set -/ vertexSet : Set α /-- The hyperedge set -/ hyperedgeSet : Set (Set α) /-- All hyperedges must be subsets of the vertex set -/ hyperedge_isSubset_vertexSet : ∀ ⦃e⦄, e ∈ hyperedgeSet → e ⊆ vertexSet ``` In addition to the main definition, some additional definitions and related lemmas are provided: - vertex adjacency - hyperedge adjacency - vertex "stars" - special cases (loops, empty hypergraphs, trivial hypergraphs, complete hypergraphs, simple hypergraphs, k-uniform hypergraphs, and d-regular hypergraphs) - (some) hypergraph cardinality - subhypergraphs, induced subhypergraphs, and partial hypergraphs This implementation is certainly bare-bones. I'm submitting this PR at this point, rather than when my developments are more fleshed out, because there has been some interest in others contributing to hypergraph formalization in mathlib. In the near future, goals include: - defining incidence matrices (i.e., conversion from `Hypergraph α` to `Matrix α (Set α) β` - coersion/generalization of graph as 2-uniform hypergraph - conversion of a hypergraph into its associated clique graph/two-section graph - constructing the dual of a hypergraph (note: on first blush, this appears somewhat challenging, given that we define hyperedges as `Set α` rather than some other type `β`) - rank and co-rank - walks, paths, cycles, etc. on hypergraphs --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 378/2 | Mathlib.lean,Mathlib/Combinatorics/Hypergraph/Basic.lean,lake-manifest.json | 3 | 57 | ['b-mehta', 'espottesmith', 'github-actions', 'jt496', 'lauramonk', 'mathlib4-merge-conflict-bot', 'tb65536'] | b-mehta | 1 day ago | 5 days ago | 82 days |
| 29744 | espottesmith | feat(Combinatorics): define directed hypergraphs | This PR defines directed hypergraphs: ``` @[ext] structure DiHypergraph (α : Type*) where /-- The vertex set -/ vertexSet : Set α /-- The edge set -/ edgeSet : Set ((Set α) × (Set α)) /-- Each edge is a pair (s, d), where s ⊆ vertexSet and d ⊆ vertexSet -/ edge_src_dst_isSubset_vertexSet' : ∀ ⦃e⦄, e ∈ edgeSet → e.1 ⊆ vertexSet ∧ e.2 ⊆ vertexSet ``` Additional definitions: - tail/head stars and negative/positive stars - some special cases (B-Graph, F-Graph, BF-Graph, and what I'm calling a "non-endless" dihypergraph, where neither the source/tail nor the destination/head are empty) - Vertex and (hyper)edge adjacency - isolated vertices - empty and nonempty dihypergraphs The design employed here is based off of #28613, but this PR does not depend on that one. --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 395/0 | Mathlib.lean,Mathlib/Combinatorics/DiHypergraph/Basic.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | YaelDillies | 1 day ago | 28 days ago | 86 days |
| 38062 | tb65536 | feat(RingTheory/RamificationInertia): alternate definitions of ramification index and inertia degree | This PR adds alternate definitions of ramification index and inertia degree, following the discussion here: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Improving.20the.20definition.20of.20ramification.20index.3F --- - [x] depends on: #38081 - [x] depends on: #38082 - [x] depends on: #38083 [](https://gitpod.io/from-referrer/) | t-algebra t-ring-theory t-number-theory | 215/0 | Mathlib.lean,Mathlib/RingTheory/RamificationInertia/Inertia.lean,Mathlib/RingTheory/RamificationInertia/Ramification.lean | 3 | 19 | ['github-actions', 'mathlib-dependent-issues', 'riccardobrasca', 'tb65536', 'xroblot'] | riccardobrasca | 1 day ago | 3 days ago | 3 days |
| 36963 | seewoo5 | feat(ModularForms): SL2 action and Serre derivative | --- [](https://gitpod.io/from-referrer/) Equivariance of Serre derivative under SL2 action. More precisely, $$\partial_k (F|_k \gamma) = (\partial_{k} F)|_{k+2} \gamma$$. From [Sphere Packing Project](https://github.com/thefundamentaltheor3m/Sphere-Packing-Lean). | t-number-theory large-import | 164/1 | Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/NumberTheory/ModularForms/Derivative.lean | 2 | 9 | ['github-actions', 'loefflerd', 'seewoo5', 'tb65536', 'wwylele'] | tb65536 | 1 day ago | 14 days ago | 16 days |
| 38752 | joelriou | feat(CategoryTheory): the bicategory of triangulated categories | See Zulip [#general > backward.isDefEq.respectTransparency @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/backward.2EisDefEq.2ErespectTransparency/near/591988149) --- [](https://gitpod.io/from-referrer/) | WIP t-category-theory | 168/0 | Mathlib.lean,Mathlib/CategoryTheory/Triangulated/Bicategory.lean | 2 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 2 seconds |
| 38556 | JovanGerb | feat(GCongr): `applyRflOrId` | This PR defines `MVarId.applyRflOrId`, which is a version of the `rfl` tactic (`MVarId.applyRfl`) that also closes goals of the form `p → p`. My original intent was to include this feature in `rfl` itself, but this proposal was rejected by core. As a result of this change, the operators `→`, `∧` and `∨` now only need to have a single `gcongr` lemma each. This is beneficial for the new `grw` implementation. I've also removed the `gcongr` attribute from `List.Sublist.append_left`, `List.Sublist.append_right`, `List.Perm.append_left` and `List.Perm.append_right` since they are similarly redundant. --- [](https://gitpod.io/from-referrer/) | t-meta | 76/18 | Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GCongr/CoreAttrs.lean,MathlibTest/GCongr/Core.lean,MathlibTest/GCongr/implications.lean | 4 | 7 | ['JovanGerb', 'Vierkantor', 'github-actions'] | Vierkantor | 1 day ago | 2 days ago | 4 days |
| 38757 | xgenereux | feat(IsDedekindDomain.HeightOneSpectrum): simp lemma ofPrime_prime | simp lemma for the composition of `ofPrime` and `prime`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory easy | 3/0 | Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38753 | tb65536 | chore(GroupTheory/Nilpotent): to_additivize file | This PR to_additivizes `Nilpotent.lean`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 201/35 | Mathlib/GroupTheory/Commutator/Finite.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/Subgroup/Center.lean | 3 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 37940 | BryceT233 | feat(Algebra/Category): the category of local algebras with a fixed residue field | This is an attempt to design the definitions of base category [[Stacks, 06GC]](https://stacks.math.columbia.edu/tag/06GC) and complete base category in deformation theory. The approach we take is to first introduce a larger category of local algebras with a fixed residue field, then define base category and complete base category to be full subcategories of this larger category via `ObjectProperty`. To be specific: * In `Defs.lean`, we define `LocAlgCat` and `LocAlgCat.Hom` to be the type of objects and morphisms in the category, and provide a universe lift functor. * In `Basic.lean`, we add the basic construction `ofQuot` and `toOfQuot`, which is the quotient of an object in `LocAlgCat` by a proper Ideal. Then we use them to define `infinitesimalNeighborhood` and `specialFiber` for an object in `LocAlgCat`. * In `Cotangent.lean`, we introduce `k`-vector space structures on `CotangentSpace` of objects in `LocAlgCat` and prove the exactness of the conormal sequence for the special fiber. * In `BaseCat.lean`, we define `BaseCat` to be the full subcategory of `LocAlgCat` consisting of Artinian local algebras and introduce the type class of a small extension for morphisms in `BaseCat`. We show that any surjective morphism in `BaseCat` can be factored into a finite composition of small extensions [[Stacks, 06GE]](https://stacks.math.columbia.edu/tag/06GE) This PR is intended to showcase the overall design and architecture, I will split this into smaller PRs once the community reaches a consensus on the design choices. --- - [x] depends on: #36657 - [ ] depends on: #37008 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-algebra WIP | 1756/0 | Mathlib.lean,Mathlib/Algebra/Category/LocAlgCat/BaseCat.lean,Mathlib/Algebra/Category/LocAlgCat/Basic.lean,Mathlib/Algebra/Category/LocAlgCat/Cotangent.lean,Mathlib/Algebra/Category/LocAlgCat/Defs.lean,Mathlib/Algebra/Group/Units/ULift.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/LocalRing/Pullback.lean,Mathlib/RingTheory/LocalRing/ResidueField/Instances.lean,Mathlib/RingTheory/LocalRing/RingHom/Basic.lean | 11 | 32 | ['BryceT233', 'Deicyde', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues'] | nobody | 1 day ago | 14 days ago | 2 days |
| 38759 | chrisflav | chore(CategoryTheory): more experiments with unification hints | --- [](https://gitpod.io/from-referrer/) | t-category-theory | 106/2 | Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Simps/UnifHintAttr.lean,MathlibTest/Simps.lean | 4 | 1 | ['github-actions'] | nobody | 1 day ago | unknown | 0 seconds |
| 38319 | Zetetic-Dhruv | feat(Combinatorics/SetFamily): Assouad's dual VC bound | Adds the Finset-level form of Assouad's 1983 dual VC bound: if a family `𝒜 : Finset (Finset α)` has VC dimension at most `d`, then for any ground set `X : Finset α` the dual family `{𝒜.filter (· ∋ x) : x ∈ X}` has VC dimension at most `2 ^ (d + 1) - 1`. New declarations (in `Finset` namespace): - `dualFamily 𝒜 X`: for each `x ∈ X`, the subfamily `{A ∈ 𝒜 | x ∈ A}` - `mem_dualFamily` (`@[simp]`): membership characterisation - `exists_shatters_of_dualFamily_shatters`: Assouad's bitstring-coding lemma - `vcDim_dualFamily_le`: the headline VC bound Proof by Assouad's classical bitstring-coding argument. Sits on top of `Finset.shatterer` / `Finset.vcDim` from `Mathlib.Combinatorics.SetFamily.Shatter`. References: - P. Assouad, Densite et dimension, Ann. Inst. Fourier 33(3) (1983), Thm 2.13 - J. Matousek, Lectures on Discrete Geometry, GTM 212, Springer, 2002, Section 10.3 Lemma 10.3.3 --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor | 200/0 | Mathlib.lean,Mathlib/Combinatorics/SetFamily/DualVC.lean,docs/references.bib | 3 | 26 | ['Shreyas4991', 'Zetetic-Dhruv', 'github-actions'] | nobody | 1 day ago | 9 days ago | 10 days |
| 38732 | eric-wieser | fix: revert and fix #38703 | #38703 removed the canary intended to detect a broken lemma, without fixing the lemma. --- [](https://gitpod.io/from-referrer/) | t-algebra delegated | 4/11 | Mathlib/Algebra/Group/Action/Units.lean | 1 | 5 | ['github-actions', 'kbuzzard', 'mathlib-bors'] | nobody | 1 day ago | 1 day ago | 15 hours |
| 38760 | ocfnash | feat: use Cartan's criterion for semisimplicty to drop redundant hypotheses | Thanks to @jano-wol 's work culminating in #38749 we can drop two redundant hypotheses about non-degeneracy of Killing forms. --- [](https://gitpod.io/from-referrer/) | t-algebra | 21/11 | Mathlib/Algebra/Lie/Weights/IsSimple.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Basis.lean | 2 | 2 | ['github-actions', 'ocfnash'] | nobody | 1 day ago | 1 day ago | 1 day |
| 35122 | Marygold-Dusk | feat: define C^n submersions | This PR defines submersions between C^n manifolds. In the infinite-dimensional setting, submersions are defined via local normal forms rather than surjectivity of the mfderiv. A map f is a submersion at x if, in suitable charts around x and f x, it has the form (u, v) ↦ u after identifying the model space with a product.
We prove a few basic properties:
- being a submersion is a local property,
- products of submersions are submersions,
- the set of submersed points is open
Future PRs will prove that submersions are C^n and deduce equivalence with the standard definition in finite dimensions. From the path towards the regular value theorem.
This file was developed under the supervision of Michael Rothgang.
Co-authored-by: Michael Rothgang |
t-differential-geometry new-contributor awaiting-author | 619/8 | Mathlib.lean,Mathlib/Geometry/Manifold/Immersion.lean,Mathlib/Geometry/Manifold/Submersion.lean | 3 | 29 | ['github-actions', 'grunweg'] | PatrickMassot and grunweg | 1 day ago | 14 days ago | 44 days |
| 38767 | yuanyi-350 | chore(Analysis/Fourier/FourierTransformDeriv): remove an erw | - rewrites `hasDerivAt_fourier` to use `fourierIntegral_continuousLinearMap_apply'`, `VectorFourier.fourierIntegral`, and `fourier_real_eq` in place of the former `erw` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated | 4/7 | Mathlib/Analysis/Fourier/FourierTransformDeriv.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38771 | yuanyi-350 | chore(LinearAlgebra/Eigenspace/Basic): remove an erw | - rewrites `genEigenspace_restrict` by replacing the induction with a single `simp only` chain using the restriction and kernel lemmas Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebra LLM-generated | 4/8 | Mathlib/LinearAlgebra/Eigenspace/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38736 | yuanyi-350 | chore(GroupTheory/PushoutI): remove an erw | - rewrites the `h₁` simplification in `eq_one_of_smul_normalized` into a single `simp only` chain, replacing the `rw` and `erw` steps around `equiv_one` and `mul_one` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-group-theory maintainer-merge | 2/3 | Mathlib/GroupTheory/PushoutI.lean | 1 | 3 | ['github-actions', 'tb65536'] | tb65536 | 1 day ago | 1 day ago | 1 day |
| 38735 | yuanyi-350 | chore(GroupTheory/HNNExtension): remove an erw | - rewrites the two `unitsSMul_neg` branches to use `rw` and `simp` directly with `IsComplement.equiv_mul_left`, instead of `conv_lhs => erw [...]` - replaces `erw [dif_neg this]` with `rw [dif_neg this]` in `exists_normalWord_prod_eq` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-group-theory maintainer-merge | 3/16 | Mathlib/GroupTheory/HNNExtension.lean | 1 | 7 | ['github-actions', 'tb65536', 'yuanyi-350'] | tb65536 | 1 day ago | 1 day ago | 1 day |
| 37840 | tb65536 | chore(RingTheory/Localization/AtPrime/Basic): use `under` instead of `comap (algebraMap R S)` | This PR switches over from `comap (algebraMap R S)` to `under`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra awaiting-zulip | 161/144 | Mathlib/AlgebraicGeometry/Noetherian.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Frobenius.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Localization.lean,Mathlib/RingTheory/Ideal/GoingUp.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Localization.lean,Mathlib/RingTheory/IntegralClosure/GoingDown.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/KrullDimension/Polynomial.lean,Mathlib/RingTheory/LocalProperties/Injective.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/AtPrime/Extension.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/Spectrum/Prime/Topology.lean | 19 | 9 | ['chrisflav', 'github-actions', 'robin-carlier', 'tb65536'] | chrisflav and erdOne | 1 day ago | 1 day ago | 20 days |
| 35510 | chrisflav | feat(RingTheory): weakly étale algebras | From Proetale. --- - [x] depends on: #35455 - [x] depends on: #35590 - [x] depends on: #37998 [](https://gitpod.io/from-referrer/) | t-ring-theory | 132/0 | Mathlib.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Weakly.lean,Mathlib/RingTheory/RingHom/Flat.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 day ago | 1 day ago | 1 day |
| 37988 | chrisflav | feat(AlgebraicGeometry): geometrically reduced group scheme over a field is smooth | --- - [ ] depends on: #37982 [](https://gitpod.io/from-referrer/) | t-algebraic-geometry blocked-by-other-PR | 200/7 | Mathlib.lean,Mathlib/AlgebraicGeometry/Group/Smooth.lean,Mathlib/AlgebraicGeometry/Morphisms/EtaleDescent.lean,Mathlib/AlgebraicGeometry/Morphisms/FlatDescent.lean,Mathlib/RingTheory/Etale/Basic.lean,Mathlib/RingTheory/Etale/Descent.lean | 6 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 18 days ago | 19 minutes |
| 38778 | felixpernegger | feat(Topology/EMetricSpace): instances of weak extended metric spaces | Continuation of #38105. In particular, this makes `ENNReal` and `EReal` weak extended metric spaces. After this PR one can probably generalise various results/definition which use `(Pseudo)EMetricSpace` to use `Weak(Pseudo)EMetricSpace` (so that they in particular also hold for `ENNReal` and `EReal`) | t-topology | 242/0 | Mathlib.lean,Mathlib/Topology/EMetricSpace/Weak.lean | 2 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 15 minutes |
| 38348 | mirajcs | feat(Geometry/Curve): add Frenet–Serret framework | --- This PR introduces a basic formalization of smooth parametrized curves in `ℝ³` (`EuclideanSpace ℝ (Fin 3)`) together with the Frenet frame and partial proofs of the Frenet–Serret formulas. Main contributions: * Define `ParametrizedDifferentiableCurve` as a smooth map on an open interval. * Define arc length and arc-length parametrization. * Define geometric quantities: - curvature `κ(t) = ‖α''(t)‖` - tangent, normal, and binormal vector fields - torsion via `‖B'(t)‖` * Introduce the `FrenetFrame` structure. * Prove key Frenet–Serret formulas: - `T' = κ • N` - `B' = -τ • N` - `N' = -κ • T + τ • B` The implementation relies on existing analysis and inner product space infrastructure, as well as properties of the cross product in `ℝ³`. Some intermediate lemmas about orthogonality and cross-product identities are included. At present, some results assume nonvanishing curvature/torsion and include auxiliary hypotheses about derivatives. These can be streamlined in future work. This development is intended as a foundation for further formalization of classical differential geometry (curves and surfaces). --- | new-contributor t-differential-geometry awaiting-author | 525/0 | Mathlib.lean,Mathlib/Geometry/Curves/Basic.lean,Mathlib/Geometry/Curves/FrenetFrame.lean | 3 | 16 | ['bryangingechen', 'github-actions', 'mirajcs', 'ocfnash', 'vihdzp', 'wwylele'] | ocfnash | 1 day ago | 3 days ago | 6 days |
| 36891 | vihdzp | feat(SetTheory/Ordinal/Exponential): characterization of `a ^ b = 1` | Used in the CGT repo. --- [](https://gitpod.io/from-referrer/) | t-set-theory delegated | 12/0 | Mathlib/SetTheory/Ordinal/Exponential.lean | 1 | 9 | ['SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'vihdzp'] | b-mehta | 1 day ago | 1 day ago | 41 days |
| 38476 | agusakov | refactor(Combinatorics/Digraph): add vertex sets | --- Adopting #33466 [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author | 381/50 | Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/Digraph/Orientation.lean | 2 | 11 | ['Shreyas4991', 'YaelDillies', 'agusakov', 'github-actions'] | nobody | 1 day ago | 2 days ago | 3 days |
| 38780 | yuanyi-350 | chore(Catalogue PR): kill some `erw`s by adding rfl lemmas | --- [](https://gitpod.io/from-referrer/) | 26/11 | Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean,Mathlib/LinearAlgebra/BilinearForm/Properties.lean,Mathlib/Topology/UniformSpace/Matrix.lean | 5 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 6 minutes | |
| 35394 | HugLycan | feat(Tactic/Positivity): make positivity work for types that are not partial orders | Make positivity work for types that are not partial orders Most PositivityExt haven't been updated for non partial order cases yet. They will be updated in the later PR. `Strictness` now does not depend `Q(PartialOrder $α)`, and the constructors of `Strictness` now have their order typeclass arguments. In order to help `Qq` synth instances property, we have to move `assertInstancesCommute` to inner branch, manually add `haveI'` or explicitly pass the order typeclass instance into `.positive`/`.nonnegative`. --- [](https://gitpod.io/from-referrer/) | new-contributor t-meta merge-conflict | 732/357 | Mathlib/Algebra/Order/AbsoluteValue/Basic.lean,Mathlib/Algebra/Order/Algebra.lean,Mathlib/Algebra/Order/BigOperators/Expect.lean,Mathlib/Algebra/Order/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Field/Power.lean,Mathlib/Algebra/Order/Floor/Extended.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Module/Field.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/Order.lean,Mathlib/Analysis/Complex/Trigonometric.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/SpecialFunctions/Bernstein.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Arctan.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/DerivHyp.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Bound.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Removal.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Real.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/Inv.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Factorial/DoubleFactorial.lean,Mathlib/Data/Nat/Totient.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/Geometry/Euclidean/Altitude.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Measure/Real.lean,Mathlib/NumberTheory/ArithmeticFunction/Misc.lean,Mathlib/NumberTheory/ArithmeticFunction/Zeta.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/Height/NumberField.lean,Mathlib/NumberTheory/Height/Projectivization.lean,Mathlib/NumberTheory/LucasLehmer.lean,Mathlib/NumberTheory/SelbergSieve.lean,Mathlib/Tactic/Positivity/Basic.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Tactic/Positivity/Finset.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean,MathlibTest/positivity.lean | 54 | 66 | ['HugLycan', 'JovanGerb', 'fpvandoorn', 'github-actions', 'joneugster', 'leanprover-radar', 'mathlib-merge-conflicts'] | dwrensha | 1 day ago | 1 day ago | 41 days |
| 36102 | Thmoas-Guan | feat(RingTheory): flat extension of local ring | This PR mainly formalize the theorem [[Stacks 03C3](https://stacks.math.columbia.edu/tag/03C3)] for flat extension of local ring. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 844/0 | Mathlib.lean,Mathlib/RingTheory/Flat/Extension.lean | 2 | 2 | ['github-actions', 'mathlib-bors'] | nobody | 1 day ago | 58 days ago | 6 seconds |
| 38104 | yuanyi-350 | refactor(MeasureTheory): golf 100 files | This PR is an experimental project. In this PR, we use an Agent to automatically scan and attempt to simplify proofs. We hope to eventually effectively golf 100 files and avoid reinventing the wheel in mathlib. We have chosen `Mathlib/MeasureTheory` as the testing ground. If this experiment is very successful and accepted by the mathlib community, we would be honored to open source it. The relevant projects includes - [ ] #37968, which golfs `Mathlib/Analysis`. - [ ] #38144 , which golfs `Mathlib/NumberTheory`. **This PR serves as an index. For the actual code review, please refer to the individual PRs linked below. Each of those PRs modifies only a single file to facilitate the review process.** - [ ] depends on: #38350 - [ ] depends on: #38353 - [ ] depends on: #38455 - [ ] depends on: #38456 - [ ] depends on: #38492 - [ ] depends on: #38636 - [ ] depends on: #38639 - [ ] depends on: #38640 --- [](https://gitpod.io/from-referrer/) | t-measure-probability codex LLM-generated blocked-by-other-PR | 186/363 | Mathlib/MeasureTheory/Constructions/BorelSpace/Metrizable.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/Constructions/Polish/EmbeddingReal.lean,Mathlib/MeasureTheory/Constructions/Polish/StronglyMeasurable.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Function/AEMeasurableOrder.lean,Mathlib/MeasureTheory/Function/AEMeasurableSequence.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/AEMeasurable.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/RadonNikodym.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Real.lean,Mathlib/MeasureTheory/Function/ContinuousMapDense.lean,Mathlib/MeasureTheory/Function/Egorov.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Count.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Complete.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean | 21 | 7 | ['github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'yuanyi-350'] | kex-y | 1 day ago | 6 days ago | 4 days |
| 38734 | yuanyi-350 | chore(AlgebraicTopology/SimplicialObject/Basic): remove an erw | - rewrites the `toArrow` and `whiskeringObj` naturality proofs for augmented simplicial and cosimplicial objects by extending the `rw` chains with `Functor.id_map`, `Functor.const_map_app`, and `NatTrans.comp_app`, instead of using `erw` on `η.w` Extracted from #38415 [](https://gitpod.io/from-referrer/) | t-algebraic-topology codex LLM-generated maintainer-merge | 15/19 | Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean | 1 | 5 | ['dagurtomas', 'github-actions', 'joelriou', 'yuanyi-350'] | dagurtomas | 1 day ago | 1 day ago | 1 day |
| 38768 | yuanyi-350 | chore(Condensed/Light/Epi): remove an erw | Removes an `erw` that is now handled by `simp`. Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-condensed LLM-generated maintainer-merge | 2/8 | Mathlib/Condensed/Light/Epi.lean | 1 | 3 | ['dagurtomas', 'github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 37832 | YaelDillies | chore(Algebra/Order/GroupWithZero): flatten `Unbundled` folder | The algebraic order classes are unbundled now. --- More thought is needed to do the same for `Algebra.Order.Monoid` since filenames conflict. [](https://gitpod.io/from-referrer/) | file-removed t-algebra t-order | 20/20 | Mathlib.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/List.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Field/Pointwise.lean,Mathlib/Algebra/Order/GroupWithZero/Basic.lean,Mathlib/Algebra/Order/GroupWithZero/Bounds.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Defs.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/GroupWithZero/OrderIso.lean,Mathlib/Algebra/Order/GroupWithZero/Submonoid.lean,Mathlib/Algebra/Order/GroupWithZero/WithZero.lean,Mathlib/Algebra/Order/Nonneg/Basic.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/Order/Filter/IsBounded.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/Tactic/FieldSimp/Lemmas.lean | 19 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 1 day ago | 20 days |
| 36746 | YaelDillies | refactor(Algebra/MonoidAlgebra): use `coeff`/`ofCoeff` more | Use `coeff : R[M] → M →₀ R` and `ofCoeff : (M →₀ R) → R[M]` more widely as a way to convert explicitly between `MonoidAlgebra` and `Finsupp` and thus avoiding defeq abuse. This is a fast and loose preliminary version of #25273. In particular, some proofs break and need to be fixed with either `set_option backward.isDefEq.respectTransparency false`. The situation will improve again once #25273. All the changes beyond using `coeff`/`ofCoeff` in the basic API are motivated by fixing downstream breakage. --- - [x] depends on: #36678 - [x] depends on: #36768 - [x] depends on: #36848 - [x] depends on: #36851 - [x] depends on: #37210 - [x] depends on: #37750 - [ ] depends on: #37755 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 1068/1269 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Lie/Loop.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Algebra/MonoidAlgebra/Grading.lean,Mathlib/Algebra/MonoidAlgebra/Ideal.lean,Mathlib/Algebra/MonoidAlgebra/Lift.lean,Mathlib/Algebra/MonoidAlgebra/MapDomain.lean,Mathlib/Algebra/MonoidAlgebra/Module.lean,Mathlib/Algebra/MonoidAlgebra/NoZeroDivisors.lean,Mathlib/Algebra/MonoidAlgebra/Opposite.lean,Mathlib/Algebra/MonoidAlgebra/Support.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Derivation.lean,Mathlib/Algebra/MvPolynomial/Division.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Funext.lean,Mathlib/Algebra/MvPolynomial/Monad.lean,Mathlib/Algebra/MvPolynomial/PDeriv.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/MvPolynomial/Supported.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Coeff.lean,Mathlib/Algebra/Polynomial/Degree/Defs.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Algebra/Polynomial/Homogenize.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean,Mathlib/Algebra/Polynomial/OfFn.lean,Mathlib/Algebra/Polynomial/Reverse.lean,Mathlib/Algebra/Polynomial/SumIteratedDerivative.lean,Mathlib/Algebra/Polynomial/UnitTrinomial.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/AlgebraicGeometry/Spec.lean,Mathlib/Analysis/Fourier/BoundedContinuousFunctionChar.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/FieldTheory/Finite/Polynomial.lean,Mathlib/LinearAlgebra/SymmetricAlgebra/Basis.lean,Mathlib/Logic/Equiv/Defs.lean,Mathlib/MeasureTheory/Measure/CharacteristicFunction/Basic.lean,Mathlib/MeasureTheory/Measure/LevyConvergence.lean,Mathlib/NumberTheory/BernoulliPolynomials.lean,Mathlib/NumberTheory/Height/MvPolynomial.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/AlgebraicIndependent/Transcendental.lean,Mathlib/RingTheory/Derivation/MapCoeffs.lean,Mathlib/RingTheory/Extension/Generators.lean,Mathlib/RingTheory/FinitePresentation.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/HopfAlgebra/MonoidAlgebra.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Morita/Matrix.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean,Mathlib/RingTheory/MvPolynomial/EulerIdentity.lean,Mathlib/RingTheory/MvPolynomial/FreeCommRing.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,Mathlib/RingTheory/MvPolynomial/Ideal.lean,Mathlib/RingTheory/MvPolynomial/IrreducibleQuadratic.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/IsIntegral.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/Spectrum/Prime/Polynomial.lean,Mathlib/RingTheory/TensorProduct/Free.lean,Mathlib/RingTheory/TensorProduct/MonoidAlgebra.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean | 77 | 11 | ['YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 day ago | 24 days ago | 50 minutes |
| 38714 | YaelDillies | refactor: make `MonoidAlgebra` into a one-field structure | --- - [x] depends on: #26732 - [x] depends on: #28407 - [x] depends on: #28460 - [x] depends on: #28511 - [x] depends on: #29207 - [x] depends on: #30877 - [x] depends on: #31143 - [x] depends on: #31144 - [x] depends on: #32253 - [x] depends on: #32254 - [x] depends on: #32398 - [x] depends on: #32501 - [x] depends on: #32508 - [x] depends on: #32562 - [x] depends on: #32588 - [x] depends on: #32591 - [x] depends on: #32592 - [x] depends on: #32604 - [x] depends on: #32965 - [x] depends on: #33093 - [x] depends on: #33094 - [x] depends on: #33099 - [x] depends on: #33137 - [x] depends on: #33139 - [x] depends on: #33141 - [x] depends on: #33452 - [x] depends on: #33453 - [x] depends on: #33482 - [x] depends on: #33492 - [x] depends on: #36675 - [ ] depends on: #36746 Port of #25273 to my fork [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR | 1529/1658 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/FreeAlgebra/Cardinality.lean,Mathlib/Algebra/Lie/Loop.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Algebra/MonoidAlgebra/Grading.lean,Mathlib/Algebra/MonoidAlgebra/Ideal.lean,Mathlib/Algebra/MonoidAlgebra/Lift.lean,Mathlib/Algebra/MonoidAlgebra/MapDomain.lean,Mathlib/Algebra/MonoidAlgebra/Module.lean,Mathlib/Algebra/MonoidAlgebra/NoZeroDivisors.lean,Mathlib/Algebra/MonoidAlgebra/Opposite.lean,Mathlib/Algebra/MonoidAlgebra/Support.lean,Mathlib/Algebra/MonoidAlgebra/ToDirectSum.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Cardinal.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Derivation.lean,Mathlib/Algebra/MvPolynomial/Division.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/MvPolynomial/Funext.lean,Mathlib/Algebra/MvPolynomial/Monad.lean,Mathlib/Algebra/MvPolynomial/PDeriv.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/MvPolynomial/Supported.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Basis.lean,Mathlib/Algebra/Polynomial/Cardinal.lean,Mathlib/Algebra/Polynomial/Coeff.lean,Mathlib/Algebra/Polynomial/Degree/Defs.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Eval/Coeff.lean,Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Algebra/Polynomial/Homogenize.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean,Mathlib/Algebra/Polynomial/OfFn.lean,Mathlib/Algebra/Polynomial/Reverse.lean,Mathlib/Algebra/Polynomial/SumIteratedDerivative.lean,Mathlib/Algebra/Polynomial/UnitTrinomial.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Ring/Subring/IntPolynomial.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/AlgebraicGeometry/Spec.lean,Mathlib/Analysis/Fourier/BoundedContinuousFunctionChar.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/FieldTheory/Finite/Polynomial.lean,Mathlib/LinearAlgebra/Finsupp/VectorSpace.lean,Mathlib/LinearAlgebra/FreeAlgebra.lean,Mathlib/LinearAlgebra/SymmetricAlgebra/Basis.lean,Mathlib/Logic/Equiv/Defs.lean,Mathlib/MeasureTheory/Measure/CharacteristicFunction/Basic.lean,Mathlib/MeasureTheory/Measure/LevyConvergence.lean,Mathlib/NumberTheory/BernoulliPolynomials.lean,Mathlib/NumberTheory/Height/MvPolynomial.lean,Mathlib/RepresentationTheory/Action.lean,Mathlib/RepresentationTheory/Basic.lean,Mathlib/RepresentationTheory/Equiv.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/AlgebraicIndependent/Transcendental.lean,Mathlib/RingTheory/Coalgebra/MonoidAlgebra.lean,Mathlib/RingTheory/Derivation/MapCoeffs.lean,Mathlib/RingTheory/Extension/Generators.lean,Mathlib/RingTheory/FinitePresentation.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Finsupp.lean,Mathlib/RingTheory/HopfAlgebra/MonoidAlgebra.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Morita/Matrix.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean,Mathlib/RingTheory/MvPolynomial/EulerIdentity.lean,Mathlib/RingTheory/MvPolynomial/FreeCommRing.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,Mathlib/RingTheory/MvPolynomial/Ideal.lean,Mathlib/RingTheory/MvPolynomial/IrreducibleQuadratic.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/IsIntegral.lean,Mathlib/RingTheory/Polynomial/Opposites.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/Spectrum/Prime/Polynomial.lean,Mathlib/RingTheory/TensorProduct/Free.lean,Mathlib/RingTheory/TensorProduct/MonoidAlgebra.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean | 94 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 day ago | 2 days ago | 13 minutes |
| 38026 | mrdouglasny | feat(Analysis/Calculus): define absolutely monotone functions | ## Summary
- Define `AbsolutelyMonotoneOn f s` for functions `f : ℝ → ℝ` that are smooth on `s` with all iterated derivatives within `s` nonneg
- Prove closure under `add`, `smul`, `mul`
- Show `exp`, `cosh`, constants, and powers are absolutely monotone on appropriate domains
This is the first part of a split of #37879. Follow-up PRs will add:
- Bernstein backward direction (nonneg coefficients → absolutely monotone)
- Bernstein forward direction (absolutely monotone → analytic at 0)
- Matrix applications (Schur product theorem for power series, entrywise exp)
## Test plan
- [ ] CI passes (build + lint)
- [ ] Verify `AbsolutelyMonotoneOn` structure and examples type-check
🤖 Generated with [Claude Code](https://claude.com/claude-code)
Co-Authored-By: Claude Opus 4.6 (1M context) |
t-analysis new-contributor LLM-generated | 123/0 | Mathlib.lean,Mathlib/Analysis/Calculus/AbsolutelyMonotone.lean,docs/references.bib | 3 | 28 | ['ADedecker', 'github-actions', 'j-loreaux', 'mrdouglasny', 'sgouezel', 'vihdzp', 'wwylele'] | sgouezel | 1 day ago | 1 day ago | 9 days |
| 37505 | IvanRenison | feat(Combinatorics/SimpleGraph): add lemma `SimpleGraph.length_cycleBypass_le` | --- [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author merge-conflict | 3/0 | Mathlib/Combinatorics/SimpleGraph/Paths.lean | 1 | 7 | ['IvanRenison', 'Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts'] | YaelDillies | 1 day ago | 8 days ago | 21 days |
| 37748 | YaelDillies | chore: syntactically generalise `symm_mk` | --- [](https://gitpod.io/from-referrer/) | 36/38 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/Logic/Equiv/Defs.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Morita/Matrix.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/TensorProduct/Free.lean | 10 | 12 | ['JovanGerb', 'YaelDillies', 'eric-wieser', 'github-actions'] | nobody | 1 day ago | 4 days ago | 18 days | |
| 36743 | Jun2M | feat(Combinatorics/GraphLike): introduce `GraphLike` typeclass | Per discussion at ([#graph theory > HasAdj](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/HasAdj/with/575843445)), This PR introduces the `GraphLike` typeclass to capture the notions like `dart` and `walk` across various graph objects, such as `SimpleGraph`, `Graph`, and `Digraph`. The goal is that by abstracting these core components into a typeclass, we can prove these results once for all graph-like structures rather than duplicating them across different graph types. This PR generalises #35776 to also unify `Graph`. ### Main definitions * `GraphLike V D E Gr`: A typeclass parameterized by a vertex type `V`, dart type `D` and a graph type `Gr` (with `V`, `D` & `E` as an `outParam`). * `GraphLike.verts : Set V`: The set of vertices of the graph. * `GraphLike.darts : Set D`: The set of darts of the graph. * `GraphLike.edges : Set E`: The set of edges of the graph. * `GraphLike.Adj : V → V → Prop`: The adjacency relation, defined by default as `∃ d ∈ darts, fst d = u ∧ snd d = v`. * Instance of `GraphLike V (Digraph V)` with `darts G := { (u, v) | G.Adj u v }` * Instance of `GraphLike V (SimpleGraph V)` with `darts G := { (u, v) | G.Adj u v }` * Instance of `GraphLike V (Graph V E)` with `darts G := {d : Dart α β | G.IsLink (edge d) (src d) (tgt d)}` --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 407/0 | Mathlib.lean,Mathlib/Combinatorics/Digraph/GraphLike.lean,Mathlib/Combinatorics/Graph/GraphLike.lean,Mathlib/Combinatorics/GraphLike/Basic.lean,Mathlib/Combinatorics/SimpleGraph/GraphLike.lean | 5 | 46 | ['IvanRenison', 'Jun2M', 'SnirBroshi', 'github-actions', 'lauramonk', 'mathlib-merge-conflicts'] | YaelDillies | 1 day ago | 3 days ago | 44 days |
| 38781 | JovanGerb | feat: instance diamond linter | --- [](https://gitpod.io/from-referrer/) | t-linter | 108/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/InstanceDiamonds.lean | 3 | 2 | ['github-actions', 'mathlib-bors'] | nobody | 1 day ago | 1 day ago | 12 seconds |
| 38147 | vihdzp | chore: deprecate `Cardinal.zero_le` | This is a duplicate of `zero_le` in the root namespace. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 9/10 | Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Order.lean | 2 | 5 | ['github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 day ago | 1 day ago | 13 days |
| 38637 | FLDutchmann | test(Tactic/Algebra): try to replace `ring` with algebra in many places | --- [](https://gitpod.io/from-referrer/) | large-import | 192/39 | Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/IsSimpleRing.lean,Mathlib/Algebra/Polynomial/DenomsClearable.lean,Mathlib/Algebra/Polynomial/Homogenize.lean,Mathlib/Algebra/Polynomial/PartialFractions.lean,Mathlib/LinearAlgebra/Basis/Submodule.lean,Mathlib/LinearAlgebra/Vandermonde.lean,Mathlib/NumberTheory/ClassNumber/AdmissibleAbs.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/QExpansion.lean,Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean,Mathlib/RingTheory/Derivation/ToSquareZero.lean,Mathlib/RingTheory/Nilpotent/Exp.lean,Mathlib/RingTheory/Polynomial/Pochhammer.lean,Mathlib/Tactic/Algebra/Basic.lean,Mathlib/Tactic/Algebra/Lemmas.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/Ring/Common.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,MathlibTest/Algebra.lean | 19 | 9 | ['FLDutchmann', 'github-actions', 'leanprover-radar'] | nobody | 1 day ago | unknown | 0 seconds |
| 38223 | Deicyde | feat(Geometry/Manifold): add `MfldCat`, the category of `C^n` manifolds | We define `MfldCat 𝕜 n`: the category of `C^n` manifolds over a field `𝕜`, following the pattern of `TopCat` in `Mathlib.Topology.Category.TopCat.Basic`. We also implement `HasForget₂ (MfldCat 𝕜 n) TopCat`—the forgetful functor into the category of topological spaces. For more discussion see the Zulip thread: [#PR reviews > #38223 The Category of C^n Manifolds](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2338223.20The.20Category.20of.20C.5En.20Manifolds/with/587038032) Also added: `ContMDiffMap.id_apply`, `.coe_id` and `.coe_comp` which are comparable to `ContinuousMap` API. ### Future work - ✅ Define a Monoidal structure via product manifolds, analogous to `Manifold.Topology.Category.TopCat.Monoidal` #38560 - ✅ Define the tangent functor: `M ↦ TM`, `F ↦ F.tangentMap` from `MfldCat (n+1) 𝕜` to `MfldCat n 𝕜` #38270 - Functor `FGModuleCat 𝕜 ⥤ MfldCat 𝕜 n` sending a finite-dimensional `𝕜`-vector space to the manifold modeled on itself. Left as `TODO`. - Define `FGModuleCat 𝕜` as an enriched category over `MfldCat n 𝕜`. Then _smooth functors_ can be realized as endofunctors on the enriched category. This is the main motivation for this construction. --- [](https://gitpod.io/from-referrer/) | t-differential-geometry new-contributor t-category-theory | 225/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean | 3 | 52 | ['Deicyde', 'chrisflav', 'dagurtomas', 'github-actions', 'idontgetoutmuch', 'peabrainiac'] | kim-em | 1 day ago | 6 days ago | 7 days |
| 38662 | joelriou | feat(AlgebraicTopology/SimplicialSet): faces of the boundary | --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology maintainer-merge | 67/0 | Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean | 1 | 3 | ['dagurtomas', 'github-actions'] | dagurtomas | 1 day ago | 1 day ago | 3 days |
| 38770 | yuanyi-350 | chore(LinearAlgebra/AffineSpace/Combination): remove an erw | - replaces the `erw` in `affineSpan_eq_affineSpan_lineMap_units` with `rw` on both the hypothesis and the goal Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebra LLM-generated easy maintainer-merge | 1/1 | Mathlib/LinearAlgebra/AffineSpace/Combination.lean | 1 | 3 | ['github-actions', 'themathqueen'] | nobody | 1 day ago | 1 day ago | 1 day |
| 34435 | huaizhangchu | feat(Probability): convolution of Poisson distributions | This PR proves that the convolution of two Poisson distributions is again a Poisson distribution: `Poisson(r₁) ∗ Poisson(r₂) = Poisson(r₁ + r₂)` ## Main results - `poissonMeasureReal_charFun`: characteristic function of Poisson distribution is `exp(r(exp(it) - 1))` - `poissonMeasureReal_conv_poissonMeasureReal`: convolution of Poisson distributions on ℝ - `poissonMeasure_conv_poissonMeasure`: convolution of Poisson distributions on ℕ - `poissonMeasure_add_poissonMeasure_of_indepFun`: sum of independent Poisson random variables ## Proof strategy Uses characteristic functions: `φ(t) = exp(r(eⁱᵗ - 1))`, then pulls back from ℝ to ℕ. --- - [x] depends on: #34521 - [ ] depends on: #36374 | t-measure-probability large-import new-contributor awaiting-author | 122/17 | Mathlib/Probability/Distributions/Poisson/Basic.lean | 1 | 81 | ['CoolRmal', 'DavidLedvinka', 'EtienneC30', 'github-actions', 'huaizhangchu', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'pfaffelh', 'vianna04', 'yuanyi-350'] | EtienneC30 | 1 day ago | 1 day ago | 59 days |
| 38741 | eric-wieser | feat: Nat.card lemmas for Sym and Sym2 | These are just translations of the `Fintype` counterparts. --- [](https://gitpod.io/from-referrer/) | t-data | 90/0 | Mathlib.lean,Mathlib/Data/Sym/NatCard.lean | 2 | 8 | ['SnirBroshi', 'eric-wieser', 'github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 38272 | yuanyi-350 | refactor(Analysis): golf `Mathlib/Analysis/Normed/Operator/Mul` | - refactors `Normed/Operator/Mul` by defining `ring_lmap_equiv_selfₗ` as the symmetry of `ContinuousLinearMap.toSpanSingletonLE` - shortens the norm proof for `ring_lmap_equiv_self` to `ContinuousLinearMap.norm_toSpanSingleton` Extracted from #37968 [](https://gitpod.io/from-referrer/) | t-analysis LLM-generated codex awaiting-author | 25/21 | Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/Normed/Operator/Mul.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 3 | 17 | ['github-actions', 'themathqueen', 'yuanyi-350'] | j-loreaux | 1 day ago | 7 days ago | 1 day |
| 37736 | EtienneC30 | feat: API for binomial distribution | Provide basic API regarding the binomial distribution, computing the measure of singletons and writing it as a sum of Dirac masses. Provide basic results regarding integrability. Deprecate [PMF.binomial](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Probability/ProbabilityMassFunction/Binomial.html#PMF.binomial). --- As I explain in the module docstring, I am proving most results in two versions: one for the measure over `Nat` and one for the cast version. This obviously leads to some duplications, I think it's fine but I am happy to hear other ideas. - [ ] depends on: #37534 - [ ] depends on: #37541 - [x] depends on: #37543 - [x] depends on: #37739 [](https://gitpod.io/from-referrer/) | t-measure-probability blocked-by-other-PR large-import | 196/18 | Mathlib/Data/Set/Card.lean,Mathlib/Probability/Distributions/Binomial.lean,Mathlib/Probability/Distributions/Poisson/PoissonLimitThm.lean,Mathlib/Probability/ProbabilityMassFunction/Binomial.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 day ago | unknown | 0 seconds |
| 38742 | Jun2M | feat(Tactic): simproc for `Eq.rec` | Note: This PR was written with a lot of help from AI (Opus 4.7). I am still learning Lean meta programming. I would very much welcome any feedback. Problem: There are a lot of `cast` like functions for various definitions in Mathlib: [`Fin.cast`](https://leanprover-community.github.io/mathlib4_docs/Init/Data/Fin/Basic.html#Fin.cast), [`List.Vector.congr`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Vector/Defs.html#List.Vector.congr), [`SimpleGraph.Walk.copy`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Combinatorics/SimpleGraph/Walk/Operations.html#SimpleGraph.Walk.copy), [`Path.cast`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Path.html#Path.cast), [`Sym.cast`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Sym/Basic.html#Sym.cast), [`Partition.copy`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/Partition/Basic.html#Partition.copy), [`Finpartition.copy`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/Partition/Finpartition.html#Finpartition.copy) & etc. All of these functions does the same as `h ▸ a` where `h` is a proof of equality of something in the type of `a`. I think this is caused because proving the properties about `h ▸ a` is too difficult without extra tooling. All of the above follows the pattern where it is an indexed type where it contains * some data * proof that the data is related to the index and casting only changes the second part. The trouble happens when I would like to talk about the data of the casted object. There is `congr_eqRec` lemma in Battery that are exactly for this situation but even after adding `simp` tag to it, it is not being used. [Here](https://live.lean-lang.org/#codez=JYWwDg9gTgLgBAWQIYwBYBtgCMBQeCmAHkuOvnAN6CNwHAFxwAqAnmPgFQC%2BlYdcNgSYR84ggApQIYLhSRwsvKlwAUhXgGUArlhgtyinkgCUBuItS8ZAXlnH6puIA7SOIQMA6AG5J0cK4Xee6VlhMcDhwcADOoDwA2gDGEAB2AOZQAPr4AI4ASvixALoExKTkFAlwILyAqIRKPPQAYsBlimUA1HAAjEYmZvRlViA23Q5wYK4eXlZgfl60gcGhEVFwcYkp6dm5BThEJGBklABqvMysnJQA4mpRZOdQSGBmB1LqcG5wAO68TyYA6rznLh%2BngA1nAXm5jHZ6C8rO9BnZHD9XPgACZJfDhbxwH4uVHozGzWTzMKRcDLeLJNKZHL5BYAWjpcCg%2BAAZo1yBS1tTcnAAPypOBmH6FXb7ajHHRnCiY%2BD0VT4eAKEwiXgiJCwYAwYCJCKQnoRLEweEIuAq%2BhqjVanVGtQKkzyxVdKxmuYhElRXnk1ZUjb5N1wBlM1nsuCcn00vkCswiPA4IA), all of these simp tactics fail. Solution: This PR introduces a simproc `castData` (I would welcome a name suggestion) and attribute `cast_data`. When it sees `f ... (h ▸ x)` where `f` is tagged with `cast_data`, `castData` will try to simplify to `f ... x`. This simproc proves all 4 examples linked above. Hopefully this removes the need for all the `cast`-like definition and their APIs. --- [](https://gitpod.io/from-referrer/) | LLM-generated | 122/7 | Mathlib.lean,Mathlib/CategoryTheory/Sites/IsSheafFor.lean,Mathlib/CategoryTheory/WithTerminal/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Basic.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/Data/Subtype.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/CastData.lean | 9 | 9 | ['Jun2M', 'SnirBroshi', 'github-actions', 'leanprover-radar', 'mathlib-bors'] | nobody | 1 day ago | 1 day ago | 47 minutes |
| 38376 | smmercuri | refactor(Algebra): semialgebra maps | --- - [ ] depends on: #38715 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR | 950/733 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/BialgCat/Basic.lean,Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/Algebra/Category/CommBialgCat.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/MvPolynomial/Comap.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean,Mathlib/Algebra/SkewMonoidAlgebra/Lift.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/AlgebraicGeometry/AffineSpace.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/FieldTheory/CardinalEmb.lean,Mathlib/FieldTheory/Extension.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/Notation.lean,Mathlib/FieldTheory/Galois/Profinite.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/FieldTheory/LinearDisjoint.lean,Mathlib/FieldTheory/Normal/Basic.lean,Mathlib/FieldTheory/Normal/Closure.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/FieldTheory/SeparableClosure.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/FieldTheory/SplittingField/IsSplittingField.lean,Mathlib/LinearAlgebra/FreeProduct/Basic.lean,Mathlib/LinearAlgebra/Matrix/ToLin.lean,Mathlib/LinearAlgebra/SymmetricAlgebra/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean,Mathlib/NumberTheory/Cyclotomic/Gal.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/Adjoin/Field.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/AlgebraTower.lean,Mathlib/RingTheory/Algebraic/MvPolynomial.lean,Mathlib/RingTheory/AlgebraicIndependent/Transcendental.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Derivation/ToSquareZero.lean,Mathlib/RingTheory/Etale/Field.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Etale/StandardEtale.lean,Mathlib/RingTheory/Extension/Generators.lean,Mathlib/RingTheory/Extension/Presentation/Basic.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/RingTheory/FinitePresentation.lean,Mathlib/RingTheory/FractionalIdeal/Inverse.lean,Mathlib/RingTheory/FractionalIdeal/Operations.lean,Mathlib/RingTheory/GradedAlgebra/AlgHom.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean,Mathlib/RingTheory/Invariant/Profinite.lean,Mathlib/RingTheory/IsAdjoinRoot.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/Kaehler/Basic.lean,Mathlib/RingTheory/LocalRing/ResidueField/Fiber.lean,Mathlib/RingTheory/Localization/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/FundamentalTheorem.lean,Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Evaluation.lean,Mathlib/RingTheory/NoetherNormalization.lean,Mathlib/RingTheory/Norm/Transitivity.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Factorization.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean,Mathlib/RingTheory/Smooth/Basic.lean,Mathlib/RingTheory/Smooth/IntegralClosure.lean,Mathlib/RingTheory/Smooth/Kaehler.lean,Mathlib/RingTheory/Smooth/Pi.lean,Mathlib/RingTheory/Spectrum/Prime/Homeomorph.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/Maps.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/RingTheory/Trace/Basic.lean,Mathlib/RingTheory/Unramified/Pi.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/Module/Spaces/CharacterSpace.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean,MathlibTest/GalNotation.lean | 96 | 8 | ['github-actions', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smmercuri'] | nobody | 1 day ago | 9 days ago | 8 seconds |
| 33313 | SnirBroshi | feat(Combinatorics/SimpleGraph/Coloring/Edge): create a basic edge-coloring API | Module name decided on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/Coloring.20module.20names/with/583281500). --- Future work (which I'm working on): - Relating degrees to edge-colorability (`G.maxDegree ≤ G.chromaticIndex`, `G.EdgeColorable 1 ↔ G.maxDegree ≤ 1`, `G.chromaticIndex = 1 ↔ G.maxDegree = 1`, `G.EdgeColorable 2 ↔ G.maxDegree ≤ 2`, `G.chromaticIndex = 2 ↔ G.maxDegree = 2`) - [Vizing's theorem](https://en.wikipedia.org/wiki/Vizing%27s_theorem) (`G.chromaticIndex ≤ G.maxDegree + 1`) - `chromaticIndex ⊤ = (if Even #V then #V - 1 else #V)` - `[Infinite α] → chromaticIndex ⊤ = ⊤` - [x] depends on: #33292 [](https://gitpod.io/from-referrer/) | t-combinatorics | 300/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/Edge.lean | 2 | 27 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'ooovi'] | YaelDillies | 1 day ago | 1 day ago | 38 days |
| 38005 | robin-carlier | chore(Algebra): remove simps projections for structures of bundled objects | I noticed that currently, adding a `@[simps]` tag to a `ModuleCat`-valued definition will generate projections for the `isModule` fields. These projections are removed. Same in `BialgCat` and `HopfAlgCat`. --- I did not look very hard for all cases of this, but those three should be a starter. Renaming `carrier` to `coe` will break a few things, so I opted for keeping it like this for now, feel free to disagree, but this will make the diff bigger. [](https://gitpod.io/from-referrer/) | t-algebra | 4/0 | Mathlib/Algebra/Category/BialgCat/Basic.lean,Mathlib/Algebra/Category/HopfAlgCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean | 4 | 1 | ['github-actions'] | nobody | 1 day ago | 18 days ago | 18 days |
| 38782 | tb65536 | chore(RingTheory/IntegralClosure/IsIntegralClosure/Basic): clean up variables | `RingTheory/IntegralClosure/IsIntegralClosure/Basic` has some redundant variables. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 1/3 | Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 1 day ago | 1 day ago | 1 day |
| 37252 | artie2000 | feat(Algebra/Group/Submonoid/Support): properties of submonoid support | * Prove how the support of a submonoid interacts with various operations --- [](https://gitpod.io/from-referrer/) | t-algebra | 50/1 | Mathlib/Algebra/Group/Submonoid/Support.lean | 1 | 9 | ['eric-wieser', 'github-actions', 'themathqueen'] | themathqueen | 1 day ago | 35 days ago | 35 days |
| 38127 | riccardobrasca | feat: add ClassGroup.extendedHom | --- [](https://gitpod.io/from-referrer/) | file-removed t-algebra t-ring-theory | 110/6 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Point.lean,Mathlib/NumberTheory/ClassNumber/Finite.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/FundamentalCone.lean,Mathlib/RingTheory/ClassGroup/Basic.lean,Mathlib/RingTheory/ClassGroup/ExtendedHom.lean,Mathlib/RingTheory/FractionalIdeal/Extended.lean,Mathlib/RingTheory/PicardGroup.lean,Mathlib/RingTheory/UniqueFactorizationDomain/ClassGroup.lean | 9 | 9 | ['faenuccio', 'github-actions', 'mathlib-merge-conflicts', 'riccardobrasca'] | mattrobball | 1 day ago | 1 day ago | 14 days |
| 38314 | pedroscortes | feat(CategoryTheory/Monoidal): tensorμ_braid_swap and tensor-product IsCommComonObj | ## Summary Two symmetric-monoidal coherence results: 1. `MonoidalCategory.tensorμ_braid_swap` (in `Monoidal/Braided/Basic.lean`) — canonical rearrangement `tensorμ A A Y Y` intertwines the braiding on `A ⊗ Y` with the pair of braidings on `A` and `Y`. Sibling of `CategoryTheory.MonObj.mul_braiding`. 2. Tensor-product instance for `IsCommComonObj` (in `Monoidal/CommComon_.lean`): if `A, B` carry commutative comonoid structures in a symmetric monoidal category, so does `A ⊗ B`. Fills a gap alongside the existing `instCommComonObjUnit` and `instIsCommComonObjOfCartesian`. ## Downstream consumer The `IsCommComonObj` tensor-product instance is load-bearing for an external library (markovcat, formalising Fritz–Klingler Markov categories). | t-category-theory new-contributor maintainer-merge | 15/0 | Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/CommComon_.lean | 2 | 19 | ['dagurtomas', 'github-actions', 'joelriou', 'pedroscortes', 'robin-carlier'] | riccardobrasca | 1 day ago | 1 day ago | 9 days |
| 38659 | ldct | chore(Counterexamples/MapFloor): remove `respectTransparency` | It seemed better to make this an `abbrev` since we want to copy most of the instances over. --- [](https://gitpod.io/from-referrer/) | 7/13 | Counterexamples/MapFloor.lean | 1 | 4 | ['github-actions', 'grunweg'] | nobody | 1 day ago | 2 days ago | 2 days | |
| 38766 | yuanyi-350 | chore(AlgebraicTopology/DoldKan/GammaCompN): remove an erw | - rewrites `N₂Γ₂ToKaroubiIso_inv_app` with a single `simp` invocation on the relevant splitting definitions Extracted from #38415 [](https://gitpod.io/from-referrer/) | t-algebraic-topology codex LLM-generated awaiting-author | 1/1 | Mathlib/AlgebraicTopology/DoldKan/GammaCompN.lean | 1 | 2 | ['dagurtomas', 'github-actions'] | nobody | 1 day ago | 1 day ago | 7 hours |
| 37353 | SnirBroshi | feat(Order/WellFounded): characterize `WellFoundedLT` and `IsWellOrder` in terms of nonempty sets | --- Both of these use the existing characterization of `WellFounded`. [](https://gitpod.io/from-referrer/) | t-order delegated | 12/0 | Mathlib/Order/WellFounded.lean | 1 | 14 | ['Komyyy', 'SnirBroshi', 'b-mehta', 'github-actions', 'mathlib-bors'] | nobody | 23 hours ago | 23 hours ago | 15 days |
| 37997 | emlis42 | feat(Algebra/ContinuedFractions): generalize determinant formula to GenContFract | Let $g$ be a `GenContFract K`. In this PR I generalize the determinant formula for continued fractions from the simple continued fraction case $$A_n B_{n+1} - B_n A_{n+1} = (-1)^n$$ to the generalized continued fraction product formula $$A_n B_{n+1} - B_n A_{n+1} = (-a_0) (-a_1) \dots (-a_n)$$ - The `SimpContFract` version is still available unchanged, so this should avoid breaking existing users of the old API. - The use of `0` as the default partial numerator in `(g.partNums.get? i).getD 0` allows product formulation that remains valid when the fraction is terminated. | t-algebra new-contributor large-import | 53/28 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/Determinant.lean | 2 | 13 | ['emlis42', 'github-actions', 'themathqueen', 'vihdzp'] | ocfnash | 23 hours ago | 4 days ago | 18 days |
| 37577 | SnirBroshi | feat(Combinatorics/SimpleGraph/Walk): upgrade subset theorems to sublist/prefix/suffix | Upgrades theorems about `p.support ⊆ q.support` / `p.darts ⊆ q.darts` / `p.edges ⊆ q.edges` to `List.IsInfix`/`List.IsSuffix`/`List.Sublist`, which imply the subset versions. --- I did not add such theorems where there was no subset theorem to begin with (e.g. `(p.take n).darts <+: p.darts`), as they are usually not worth stating since they're trivial and simp proves them. [](https://gitpod.io/from-referrer/) | t-combinatorics | 84/44 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean | 4 | 1 | ['github-actions'] | nobody | 23 hours ago | 28 days ago | 28 days |
| 38705 | justus-springer | refactor(Algebra/Category/ModuleCat/ChangeOfRings): golf `restrictScalarsEquivalenceOfRingEquiv` | Also add simps attribute. --- [](https://gitpod.io/from-referrer/) | t-algebra t-algebraic-geometry maintainer-merge | 5/12 | Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean | 1 | 3 | ['dagurtomas', 'github-actions'] | nobody | 22 hours ago | 2 days ago | 2 days |
| 38665 | joelriou | feat(AlgebraicTopology/SimplicialSet): characterization of Kan complexes | --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology maintainer-merge | 92/2 | Mathlib/AlgebraicTopology/SimplicialSet/CategoryWithFibrations.lean,Mathlib/AlgebraicTopology/SimplicialSet/KanComplex.lean | 2 | 4 | ['dagurtomas', 'github-actions', 'joelriou'] | nobody | 22 hours ago | 3 days ago | 3 days |
| 37531 | EtienneC30 | feat: integral of the binomial distribution | Provide the probability of singletons under the binomial distribution and compute the expectation. --- [](https://gitpod.io/from-referrer/) | t-measure-probability merge-conflict | 212/6 | Mathlib/Data/Set/Card.lean,Mathlib/Probability/Distributions/Binomial.lean,Mathlib/Probability/Distributions/SetBernoulli.lean | 3 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 21 hours ago | unknown | 0 seconds |
| 38764 | yuanyi-350 | chore(AlgebraicGeometry/Modules/Tilde): remove an erw | - rewrites the naturality proof in `fromTildeΓNatTrans` by making the `FullSubcategory.comp_hom` and `NatTrans.comp_app` steps explicit in the `rw` chain Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebraic-geometry LLM-generated awaiting-author | 3/1 | Mathlib/AlgebraicGeometry/Modules/Tilde.lean | 1 | 2 | ['dagurtomas', 'github-actions'] | nobody | 21 hours ago | 21 hours ago | 10 hours |
| 37755 | YaelDillies | chore(Algebra/MonoidAlgebra): make `uniqueRingEquiv_symm_apply` more useful | In essence, this changes the RHS from having support `univ` to having support `{1}`. These are equal, but having the RHS be `single 1 r` is much more useful in practice. --- - [ ] depends on: #37748 [](https://gitpod.io/from-referrer/) | t-ring-theory blocked-by-other-PR | 51/43 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/AlgebraicGeometry/Spec.lean,Mathlib/Logic/Equiv/Defs.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Morita/Matrix.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/TensorProduct/Free.lean | 14 | 3 | ['eric-wieser', 'github-actions', 'mathlib-dependent-issues'] | nobody | 21 hours ago | 24 days ago | 3 minutes |
| 38390 | mortarsanjaya | feat(Data/Nat/Cast/Order/Basic): introduce new class `IsMonotoneNatCast` | The class says that `Nat.cast` is monotone in an `AddMonoidWithOne`. Basically, we use this class when we only care about comparing the elements of a monoid that comes from the `Nat`s (so we do not have to care about the compatibility between the additive structure of the monoid and its order structure). --- Other than that, I'm also reorganizing some section naming, and I change the proof of the `Nontrivial` instance at the bottom to using `NeZero.nontrivial`. [](https://gitpod.io/from-referrer/) | t-data new-contributor | 28/18 | Mathlib/Data/Nat/Cast/Order/Basic.lean | 1 | 7 | ['github-actions', 'leanprover-radar', 'mathlib-bors', 'mortarsanjaya', 'vihdzp'] | nobody | 20 hours ago | 20 hours ago | 7 days |
| 31222 | Thmoas-Guan | feat(Algebra): `Hom` commute with flat base change | In this PR, we proved `Hom_S (M \tensor S, N \tensor S)` is base change of `Hom_R (M, N)` with respect to `LinearMap.baseChangeHom`.
Co-authored-by: Wang Jingting |
large-import t-algebra | 220/0 | Mathlib.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/RingTheory/Flat/IsBaseChange.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeRightExact.lean | 5 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 20 hours ago | 20 hours ago | 20 hours |
| 38693 | wwylele | feat(LinearMap, RingHom, FirstOrder.Language.Hom): simp lemma for composing domRestrict and codRestrict | --- ~~I am aware that this lemma is true for all function-like classes that has `domRestrict` and `codRestrict`. I didn't add the same for all of them, and only added the one I needed in #37295. Should we manually add this for all function classes? Or there should be some metaprogramming to generate them?~~ [](https://gitpod.io/from-referrer/) | t-algebra | 18/0 | Mathlib/Algebra/Module/Submodule/LinearMap.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/ModelTheory/Substructures.lean | 3 | 4 | ['eric-wieser', 'github-actions', 'wwylele'] | nobody | 20 hours ago | 2 days ago | 2 days |
| 38739 | CoolRmal | feat: Analytic Hahn Banach theorem for locally convex spaces | Closes #38419 This PR proves Hahn-Banach theorem for locally convex spaces, which allow us to generalize both [ContinuousLinearMap.exist_extension_of_finiteDimensional_range](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Normed/Module/HahnBanach.html#ContinuousLinearMap.exist_extension_of_finiteDimensional_range) and [Submodule.ClosedComplemented.of_finiteDimensional](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Normed/Module/HahnBanach.html#Submodule.ClosedComplemented.of_finiteDimensional) (I also moved these two lemmas to the new file I created). Some helper lemmas about continuity of seminorms/linear functions are added. --- [](https://gitpod.io/from-referrer/) | t-analysis | 118/40 | Mathlib.lean,Mathlib/Analysis/LocallyConvex/HahnBanach.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/Analysis/Seminorm.lean | 5 | 6 | ['ADedecker', 'CoolRmal', 'github-actions'] | ADedecker | 19 hours ago | 1 day ago | 1 day |
| 38324 | BryceT233 | chore(RingTheory/AdicCompletion): make `AdicCompletion.map` linear on linear maps | This PR upgrades `AdicCompletion.map` to be an R-linear map on the space of linear maps `M →ₗ[R] N`. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 38/12 | Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 19 hours ago | 7 days ago | 10 days |
| 36507 | BryceT233 | feat(RingTheory/MvPowerSeries): various equivalences for `MvPowerSeries` | This PR adds a number of equivalences related to power series rings and is patterned after `Mathlib/Algebra/MvPolynomial/Equiv.lean`. To be specific, it adds: * `MvPowerSeries.isEmptyEquiv` : The isomorphism between multivariable power series in no variables and the ground ring. * `MvPowerSeries.uniqueEquiv` : The isomorphism between multivariable power series in a single variable and power series over the ground ring. * `MvPowerSeries.mapEquiv`, `MvPowerSeries.mapAlgEquiv` : The isomorhism between multivariable power series induced by an isomorphism between the coefficient rings. * `MvPowerSeries.sumAlgEquiv` : The isomorphism between multivariable power series in a sum of two types, and multivariable power series in one of the types, with coefficients in multivariable power series in the other type. * `MvPowerSeries.commAlgEquiv` : The isomorphism between multivariable power series in variables `σ` of multivariable power series in variables `τ` and multivariable power series in variables `τ` of multivariable power series in variables `σ`. * `MvPowerSeries.optionEquivLeft` : The isomorphism between multivariable power series in `Option σ` and power series with coefficients in `MvPowerSeries σ R`. * `MvPowerSeries.optionEquivRight` : The isomorphism between multivariable power series in `Option σ` and multivariable power series in `σ` with coefficients in `PowerSeries R` * `MvPowerSeries.finSuccEquiv` : The isomorphism between multivariable power series in `Fin (n + 1)` and power series over multivariable power series in `Fin n`. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #35329 - [x] depends on: #36506 | t-ring-theory | 600/4 | Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean | 2 | 26 | ['AntoineChambert-Loir', 'BryceT233', 'Thmoas-Guan', 'WenrongZou', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues'] | mattrobball | 19 hours ago | 17 days ago | 24 days |
| 37008 | BryceT233 | feat(RingTheory/LocalRing): `IsLocalRing` for pullbacks | We provide basic lemmas for equalizers and pullbacks of `RingHom` and `AlgHom`, and show they are local rings under suitable condtions. This is needed in #37940 to construct a residue algebra structure on pullbacks. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 167/0 | Mathlib.lean,Mathlib/RingTheory/LocalRing/Pullback.lean | 2 | 6 | ['BryceT233', 'github-actions', 'wwylele'] | mattrobball | 19 hours ago | 4 days ago | 39 days |
| 38747 | SnirBroshi | feat(Combinatorics/SimpleGraph/Basic): more `neighborSet` and `IsIsolated` lemmas | --- `neighborSet_mono` moved from `Maps.lean` to `Basic.lean` with a simpler proof [](https://gitpod.io/from-referrer/) | t-combinatorics | 72/17 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean | 4 | 2 | ['github-actions', 'vlad902'] | nobody | 19 hours ago | 21 hours ago | 1 day |
| 26975 | Whysoserioushah | feat: a norm_num extension for complex numbers | co-authored-by : @thefundamentaltheor3m, @hrmacbeth --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-author | 424/12 | Mathlib.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/NormNum/Eq.lean,Mathlib/Tactic/NormNum/NormNumI.lean,Mathlib/Tactic/NormNum/Result.lean,MathlibTest/norm_numI.lean | 7 | 58 | ['JovanGerb', 'Vierkantor', 'Whysoserioushah', 'dupuisf', 'eric-wieser', 'github-actions', 'grunweg', 'hrmacbeth', 'mathlib4-merge-conflict-bot'] | Vierkantor | 19 hours ago | 58 days ago | 112 days |
| 38765 | yuanyi-350 | chore(AlgebraicGeometry/Restrict): remove erws | - replaces the `erw`-based argument in `isPullback_morphismRestrict` with `IsOpenImmersion.isPullback` - shortens `morphismRestrictRestrictBasicOpen` to a direct rewrite with `Scheme.Opens.ι_image_basicOpen` and `Scheme.basicOpen_res_eq` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebraic-geometry LLM-generated maintainer-merge | 3/17 | Mathlib/AlgebraicGeometry/Restrict.lean | 1 | 4 | ['dagurtomas', 'github-actions'] | nobody | 19 hours ago | 19 hours ago | 1 day |
| 38762 | yuanyi-350 | chore(AlgebraicGeometry/EllipticCurve/Projective/Point): remove erws | - rewrites `neg_of_Z_ne_zero` by splitting the `Fin 3` equality and closing the coordinates with `rw` - rewrites `addXYZ_neg` with `rw` followed by `simp` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebraic-geometry LLM-generated | 6/3 | Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean | 1 | 3 | ['dagurtomas', 'github-actions'] | nobody | 19 hours ago | 19 hours ago | 1 day |
| 38553 | Whysoserioushah | feat(RepresentationTheory/Homological): define Tate cohomology | co-authored-by : class field theory team --- [](https://gitpod.io/from-referrer/) | t-algebra CFT | 291/1 | Mathlib.lean,Mathlib/RepresentationTheory/Homological/GroupCohomology/LongExactSequence.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/LongExactSequence.lean,Mathlib/RepresentationTheory/Homological/TateCohomology/Basic.lean | 4 | 18 | ['Whysoserioushah', 'faenuccio', 'github-actions', 'kbuzzard', 'riccardobrasca'] | faenuccio | 18 hours ago | 18 hours ago | 5 days |
| 38788 | Whysoserioushah | chore(Algebra/Homology): make ChainComplex.ofHom and CochainComplex.ofHom abbrev | discussed in [#mathlib4 > changing definition of CochainComplex.of](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/changing.20definition.20of.20CochainComplex.2Eof/with/592140401) as a follow up PR of [#38661](https://github.com/leanprover-community/mathlib4/pull/38661) --- [](https://gitpod.io/from-referrer/) | t-category-theory | 33/38 | Mathlib/Algebra/Homology/HomologicalComplex.lean,Mathlib/AlgebraicTopology/AlternatingFaceMapComplex.lean,Mathlib/AlgebraicTopology/DoldKan/Normalized.lean,Mathlib/AlgebraicTopology/DoldKan/PInfty.lean,Mathlib/AlgebraicTopology/MooreComplex.lean | 5 | 5 | ['Whysoserioushah', 'github-actions', 'joelriou', 'leanprover-radar'] | joelriou | 18 hours ago | 18 hours ago | 19 hours |
| 37098 | vihdzp | feat: singular cardinals | We define a singular cardinal as an infinite cardinal which is larger than its cofinality. That's to say, every cardinal is exactly one of the following three: finite, regular, or singular.
Re-opened from #17005, with permission.
---
Co-authored-by: Nir Paz |
t-set-theory | 113/28 | Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Regular.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'plp127'] | nobody | 18 hours ago | 26 days ago | 37 days |
| 37623 | IvanRenison | feat(Order/RelIso): add theorems about `RelHom.comp` and `RelEmbedding.trans` | Co-authored-by: SnirBroshi <26556598+SnirBroshi@users.noreply.github.com> --- Missing of this theorems noticed by @SnirBroshi in #37598 [](https://gitpod.io/from-referrer/) | t-order | 18/0 | Mathlib/Order/RelIso/Basic.lean | 1 | 6 | ['IvanRenison', 'SnirBroshi', 'eric-wieser', 'github-actions'] | nobody | 18 hours ago | 26 days ago | 27 days |
| 36472 | EtienneC30 | feat: finite dimensional distribution of Brownian motion | Define `gaussianProjectiveFamily : (I : Finset ℝ≥0) → Measure (I → ℝ)`. Each `gaussianProjectiveFamily I` is the centered Gaussian measure over `I → ℝ` with covariance matrix given by `brownianCovMatrix I s t := min s t`. Prove that these measures satisfy `IsProjectiveMeasureFamily`, which means that they can be extended into a measure over `ℝ≥0 → ℝ` thanks to the Kolmogorov's extension theorem (not in Mathlib yet). The obtained measure is a measure over the set of real processes indexed by `ℝ≥0` and is the law of the Brownian motion. --- - [x] depends on: #36143 [](https://gitpod.io/from-referrer/) | brownian t-measure-probability | 226/1 | Mathlib.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/Probability/BrownianMotion/GaussianProjectiveFamily.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Probability/Moments/Basic.lean | 5 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 18 hours ago | 46 days ago | 46 days |
| 37388 | xgenereux | feat(FunctionField): constant extensions are finite | Let `F` be a function field over `Fq`. If `E` is an algebraic extension of `Fq` which is contained in `F` then it is finite over `Fq`. To implement this, we model the following tower of extensions: ``` E(X) - F / \ | E[X] Fq(X) / \ / E Fq[X] \ / Fq ``` by assuming algebra hypotheses on the level of `Fq[X]` and `E[X]` and use ``` attribute [local instance] Polynomial.algebra ``` together with the scoped `RatFunc` instances `RatFunc.liftAlgebra` and `RatFunc.isScalarTower_liftAlgebra` to obtain the appropriate algebra instances from `RatFunc Fq/E`. One annoying thing is that using these instances creates a diamond with `RatFunc.instSMulOfFractionRingPolynomial`, I am working on trying to find a fix but don't have anything at the moment. I am open to suggestions! Here are some details on this diamond: Since both `RatFunc E` and `FractionRing E[X]` (which are not defeq) have an `IsFractionRing E[X]` instance we get two maps coming from `RatFunc.liftAlgebra`: 1. (RatFunc.liftAlgebra Fq (FractionRing E[X])) 2. (RatFunc.liftAlgebra Fq (RatFunc E)) Where the first one is transported back to `RatFunc E` via `RatFunc.instSMulOfFractionRingPolynomial`. Analyzing ``` @RatFunc.instSMulOfFractionRingPolynomial _ _ (RatFunc Fq) (RatFunc.liftAlgebra Fq (FractionRing E[X])).toSMul = (RatFunc.liftAlgebra Fq (RatFunc E)).toSMul ``` we see that this boils down to `{ toFractionRing := (IsLocalization.lift ⋯) x } = (IsFractionRing.lift ⋯) x` not being defeq. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- [](https://gitpod.io/from-referrer/) | t-number-theory | 64/0 | Mathlib/NumberTheory/FunctionField.lean,docs/references.bib | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 18 hours ago | 21 days ago | 31 days |
| 36815 | EtienneC30 | feat: a measurable space structure on the type of continuous maps | Endow the type `C(X, Y)` of continuous maps from `X` to `Y` with the Borel sigma-algebra coming from the compact-open topology and show that, under some assumptions on `X` and `Y`, this is equal to the restriction of the product sigma-algebra over `X → Y`. Provide a measurable equivalence between `{f : X → Y // Continuous f}` and `C(X, Y)`. Co-authored-by: @RemyDegenne --- [](https://gitpod.io/from-referrer/) | t-topology brownian t-measure-probability | 256/0 | Mathlib.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/ContinuousMap.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Basic.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Separation/Regular.lean | 6 | 26 | ['ADedecker', 'EtienneC30', 'felixpernegger', 'github-actions'] | nobody | 18 hours ago | 22 days ago | 36 days |
| 32942 | kim-em | feat(CategoryTheory/Monoidal/Rigid): tensor product of exact pairings | This PR adds the tensor product construction for exact pairings in rigid monoidal categories: - `ExactPairing.tensor`: Given exact pairings `(X₁, Y₁)` and `(X₂, Y₂)`, we get an exact pairing `(X₁ ⊗ X₂, Y₂ ⊗ Y₁)`. Note the reversed order in the second factor - this is essential for the monoidal structure of dual functors. - `HasRightDual.tensor` and `HasLeftDual.tensor`: If `X` and `Y` have duals, so does `X ⊗ Y` - `rightDual_tensor` and `leftDual_tensor` simp lemmas 🤖 Prepared with Claude Code | t-category-theory LLM-generated awaiting-CI | 115/0 | Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean | 1 | 9 | ['github-actions', 'joelriou', 'kim-em', 'robin-carlier'] | nobody | 18 hours ago | 70 days ago | 3 days |
| 38292 | kim-em | feat(AlgebraicTopology): universal cover construction | This PR constructs the universal cover of a path-connected, locally path-connected, semilocally simply connected space `X` as the based-path space modulo endpoint-preserving homotopy, topologised by coinduction from the compact-open based-path space. Split across three files: * `FundamentalGroupoid/BasedPath.lean` — the based-path space and the path-component machinery of `endpoint ⁻¹' U`. * `FundamentalGroupoid/UniversalCover/Basic.lean` — quotient topology, `proj`, and the sheet decomposition. * `FundamentalGroupoid/UniversalCover/Covering.lean` — `isCoveringMap`, `pathConnectedSpace`, `simplyConnectedSpace`, and the universal lifting property `existsUnique_continuousMap_lifts`. - [ ] depends on: #31576 I want to note this takes a different approach than Hatcher et al, which build the universal cover as the path space, but with a "custom" topology. It is then a theorem (often not proved in textbooks) that with the usual hypotheses this topology coincides with the one coinduced from the compact-open topology. I decided that "the mathlib way" was just to start with the "natural" topology, and not take this shortcut. 🤖 Prepared with Claude Code and Codex. | 3031/38 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/BasedPath.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SemilocallySimplyConnected.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/UniversalCover/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/UniversalCover/Covering.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/UniversalCover/REVIEW.md,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Homotopy/Path.lean,Mathlib/Topology/Path.lean,Mathlib/Topology/UnitInterval.lean | 12 | 49 | ['github-actions', 'kim-em', 'mathlib-dependent-issues'] | nobody | 18 hours ago | unknown | 0 seconds | |
| 34891 | kim-em | wip: ConvexSpace constructor from binary convex combinations | t-algebra large-import | 3345/0 | Mathlib/LinearAlgebra/ConvexSpace.lean | 1 | 3 | ['github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 17 hours ago | 10 days ago | 7 minutes | |
| 31176 | mcdoll | feat(Analysis): Taylor's theorem with the integral remainder | Prove Taylor's theorem with the integral remainder in higher dimensions. --- [](https://gitpod.io/from-referrer/) | t-analysis | 145/1 | Mathlib.lean,Mathlib/Analysis/Calculus/TaylorIntegral.lean,docs/100.yaml,docs/undergrad.yaml | 4 | 8 | ['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'mcdoll', 'sgouezel'] | j-loreaux | 17 hours ago | 23 days ago | 30 days |
| 34271 | gasparattila | feat(Topology/Sets): second-countability of `(Nonempty)Compacts` | --- - [x] depends on: #34266 - [x] depends on: #34268 [](https://gitpod.io/from-referrer/) | t-topology | 17/76 | Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sets/VietorisTopology.lean | 2 | 8 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'scholzhannah'] | urkud | 17 hours ago | 23 days ago | 30 days |
| 35069 | A-M-Berns | feat(Geometry/Polygon): simple polygons and boundary map | This PR introduces Simple polygons with the predicate `IsSimple`, which captures the idea of a non-self-intersecting boundary, in the file Simple.lean. In the file Boundary.lean, a boundary map from `AddCircle n` is defined. I prove that the range of this map is the boundary and that this map is injective if and only if the polygon is simple. I kept Boundary.lean and Simple.lean separate because future results will include stuff just about the boundary map independent of simplicity (e.g. that it is continuous in the appropriate setting) and stuff just about simple polygons independent of the boundary map (e.g. that for n = 3, IsSimple iff HasNondegenerateVertices.) I used Claude Code to help generate some of the proof material, but I golfed and edited all AI contribution. - [x] depends on: #34598 --- | new-contributor t-euclidean-geometry LLM-generated | 360/0 | Mathlib.lean,Mathlib/Geometry/Polygon/Boundary.lean,Mathlib/Geometry/Polygon/Simple.lean,Mathlib/Logic/Equiv/Fin/Rotate.lean | 4 | 30 | ['A-M-Berns', 'eric-wieser', 'github-actions', 'joneugster', 'jsm28', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp', 'wwylele'] | eric-wieser | 17 hours ago | 65 days ago | 67 days |
| 35865 | vihdzp | chore: review `Cardinal.ord` API | This PR does the following: - Mark `Cardinal.ord` as no expose. - Prove the defining property `gciOrdCard` earlier. - Deprecate the unused `ord.orderEmbedding` (it simply restates that the function is strictly monotonic). - Rename `ord_nat` → `ord_natCast`. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 39/36 | Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean | 3 | 6 | ['github-actions', 'mathlib-merge-conflicts'] | b-mehta | 17 hours ago | 22 days ago | 58 days |
| 37347 | JovanGerb | feat: implementation of `@[use_set_notation_for_order]` | This PR allows the use of `⊆` notation while the underlying constant is `≤`. Similarly for `⊂`/`<`, `⊇`/`≥` and `⊃`/`>`. - The idea is to later extend this feature to other set notation constants, such as union/intersection. - There are some types for which we cannot use `LE.le` as the underlying constant, such as `List` and `Multiset`. So, the elaborator for the `⊆` notation needs to make a decision which underlying constant to elaborate to, depending on the type. Sometimes the type is not known yet, which makes things awkward. Most of these cases are solved by delaying the elaboration until later when the type is known. - However, in some cases this doesn't work either, such as `simp_rw [and_comm (_ ⊆ _)]`, where it is impossible to tell the type when elaborating the term. So, some such cases need to be fixed by making it `simp_rw [and_comm ((_ : Set _) ⊆ _)]`. This is because `simp_rw`, unlike `rw`, fully elaborates the rewrite rules before using them. A linter warns you whever there is such an ambiguity. See also https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F/near/579333629 --- [](https://gitpod.io/from-referrer/) | t-meta maintainer-merge | 364/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/SetNotationForOrder.lean,MathlibTest/SetNotationForOrder.lean | 4 | 51 | ['JovanGerb', 'Vierkantor', 'github-actions', 'thorimur'] | alexjbest and dwrensha | 17 hours ago | 18 days ago | 32 days |
| 37631 | linesthatinterlace | feat: add `Function.{prod,diag,fstComp,sndComp,prodMap}` | Adds `Mathlib/Logic/Function/Init.lean`, centralising a cluster of general-purpose function operations in the `Function` namespace: - `Function.dcomp` (notation `∘'`) — dependent composition, moved here from `Mathlib/Logic/Function/Defs.lean`. - `Function.prod` (notation `⋏`) — pointwise pair of two (possibly dependent) functions, `(f ▽ g) i = (f i, g i)`. - `Function.fstComp` / `Function.sndComp` — the two components of a function valued in a product; inverse to `Function.prod`. - `Function.diag` (notation `△`) — the diagonal `a ↦ (a, a)`. - `Function.prodMap` — dot-notation alias for `Prod.map`; collapses to `Prod.map` under `simp` so existing API applies unchanged. `Pi.prod` is removed in favour of `Function.prod` (which is itself the dependent version); a deprecated alias is provided. The file depends only on `Mathlib.Init` (and `Batteries.Tactic.Alias` for the deprecated alias) so it can be upstreamed to Batteries / core without pulling mathlib dependencies. | t-logic large-import | 322/82 | Archive/Sensitivity.lean,Mathlib.lean,Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Lie/Prod.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/Notation/Pi/Defs.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Combinatorics/Nullstellensatz.lean,Mathlib/Data/Fin/Tuple/Curry.lean,Mathlib/LinearAlgebra/AffineSpace/AffineMap.lean,Mathlib/LinearAlgebra/Dimension/DivisionRing.lean,Mathlib/LinearAlgebra/Goursat.lean,Mathlib/LinearAlgebra/Prod.lean,Mathlib/LinearAlgebra/QuadraticForm/Dual.lean,Mathlib/Logic/Function/Defs.lean,Mathlib/Logic/Function/Init.lean,Mathlib/MeasureTheory/Integral/Prod.lean,Mathlib/MeasureTheory/Measure/Prod.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/SetTheory/Cardinal/Finite.lean,Mathlib/Topology/Algebra/ContinuousAffineMap.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean,Mathlib/Topology/Algebra/InfiniteSum/Constructions.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/UniformSpace/LocallyUniformConvergence.lean | 30 | 15 | ['SnirBroshi', 'eric-wieser', 'github-actions', 'linesthatinterlace'] | fpvandoorn | 17 hours ago | 9 days ago | 21 days |
| 37900 | tb65536 | feat(RingTheory/Localization/FractionRing): add `IsFractionRing.ofAlgEquiv` and `IsFractionRing.ofAlgHom` | This PR gives constructors for `IsFractionRing` from an `AlgEquiv` and from an `AlgHom`. The first is just a specialization of `IsLocalization.isLocalization_of_algEquiv`, but the second has a bit more content. --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra | 9/0 | Mathlib/RingTheory/Localization/FractionRing.lean | 1 | 3 | ['github-actions', 'tb65536'] | alreadydone | 17 hours ago | 21 days ago | 21 days |
| 38597 | kim-em | chore: backport robustness changes from bump/nightly-2026-04-27 | See [#nightly-testing > nightly#213 adaptations for nightly-2026-04-27 @ 💬](https://leanprover.zulipchat.com/#narrow/channel/428973-nightly-testing/topic/nightly.23213.20adaptations.20for.20nightly-2026-04-27/near/591262169). | t-category-theory maintainer-merge | 91/26 | Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/Coherence.lean,Mathlib/CategoryTheory/Limits/Shapes/ConcreteCategory.lean,Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Sites/DenseSubsite/OneHypercoverDense.lean,Mathlib/CategoryTheory/Sites/Hypercover/One.lean | 7 | 8 | ['github-actions', 'kim-em', 'robin-carlier'] | joelriou | 17 hours ago | 2 days ago | 2 days |
| 38632 | joelriou | feat(CategoryTheory/Shift): lifting of single functors | Let `C`, `D` and `E` be categories. Let `A` be an additive monoid. Assume that `D` and `E` have shifts by `A` and that we have a fully faithful functor `G : D ⥤ A` which commutes with shifts. Given `F : SingleFunctors C E A`, and a family of functors `Φ a : C ⥤ D` with isomorphisms `Φ a ⋙ G ≅ F.functor a` for all `a : A`, we lift `F` in `SingleFunctor C D A`. --- [](https://gitpod.io/from-referrer/) | t-category-theory | 139/2 | Mathlib.lean,Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean,Mathlib/CategoryTheory/Shift/CommShift.lean,Mathlib/CategoryTheory/Shift/SingleFunctorsLift.lean | 4 | 7 | ['dagurtomas', 'github-actions', 'joelriou'] | dagurtomas | 17 hours ago | 21 hours ago | 3 days |
| 38639 | yuanyi-350 | refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Constructions/Polish/Basic` | - rewrites `MeasurableSet.image_of_measurable_injOn` to transport measurability with `borel_anti` and `eq_borel_upgradeStandardBorel` instead of building the auxiliary measurable-set proof by hand - installs the induced `MeasurableSpace` and `BorelSpace` instances on the refined Polish topology and closes with `hs'.image_of_continuousOn_injOn` Extracted from #38104 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-measure-probability | 4/8 | Mathlib/MeasureTheory/Constructions/Polish/Basic.lean | 1 | 4 | ['github-actions', 'leanprover-radar', 'yuanyi-350'] | RemyDegenne | 17 hours ago | 3 days ago | 3 days |
| 38722 | chrisflav | chore(CategoryTheory/Monoidal): additivize `ModObj` | --- [](https://gitpod.io/from-referrer/) | t-category-theory maintainer-merge | 124/21 | Mathlib/CategoryTheory/Monoidal/Mod.lean,Mathlib/Tactic/Translate/ToAdditive.lean | 2 | 2 | ['dagurtomas', 'github-actions'] | joelriou | 17 hours ago | 2 days ago | 2 days |
| 38754 | EtienneC30 | feat: generalize multiplication of independent random variables to scalar multiplication | If `X` and `Y` are independent then `∫ ω, X ω * Y ω ∂μ = ∫ ω, X ω ∂μ * ∫ ω, Y ω ∂μ`. We generalize this to the case of scalar multiplication. --- [](https://gitpod.io/from-referrer/) | t-measure-probability | 84/33 | Mathlib/Probability/Independence/Integration.lean | 1 | 1 | ['github-actions'] | sgouezel | 17 hours ago | 1 day ago | 1 day |
| 38769 | yuanyi-350 | chore(GroupTheory/FreeGroup/NielsenSchreier): remove an erw | - rewrites the `mapEnd` step in `endIsFree` with `simp only [Functor.mapEnd, DFunLike.coe, this, hF']` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-group-theory | 1/3 | Mathlib/GroupTheory/FreeGroup/NielsenSchreier.lean | 1 | 1 | ['github-actions'] | tb65536 | 17 hours ago | 1 day ago | 1 day |
| 38773 | yuanyi-350 | chore(MeasureTheory/Measure/Haar/Quotient): remove erws | - rewrites the two quotient-measure lemmas to use `rw` directly on `projection_respects_measure_apply` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex LLM-generated t-measure-probability | 2/4 | Mathlib/MeasureTheory/Measure/Haar/Quotient.lean | 1 | 1 | ['github-actions'] | EtienneC30 | 17 hours ago | 1 day ago | 1 day |
| 38775 | Raph-DG | feat(Topology): Skyscraper sheaves are flasque | In this PR we show that skyscraper sheaves are flasque. In particular, we show that a skyscraper sheaf valued in an object A whose map to the terminal object is an epimorphism is a flasque sheaf. We also show the useful corollary that in particular, any skyscraper sheaf is flasque if the sheaf takes values in a category with a zero object --- [](https://gitpod.io/from-referrer/) | t-topology | 34/0 | Mathlib/Topology/Sheaves/Flasque.lean | 1 | 1 | ['github-actions'] | j-loreaux | 17 hours ago | 1 day ago | 1 day |
| 38789 | dupuisf | feat(UniformOnFun): lemma for proving uniform convergence from uncurried form | --- [](https://gitpod.io/from-referrer/) | WIP t-topology | 23/0 | Mathlib/Topology/Continuous.lean,Mathlib/Topology/ContinuousOn.lean | 2 | 1 | ['github-actions'] | nobody | 17 hours ago | 17 hours ago | 2 seconds |
| 37870 | Jun2M | feat(Combinatorics/Graph): `Simple` typeclass for `Graph` | This PR introduces two type classes on `Graph`: `Loopless` and `Simple`. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 93/0 | Mathlib.lean,Mathlib/Combinatorics/Graph/Simple.lean | 2 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 17 hours ago | 17 hours ago | 20 days |
| 33143 | wwylele | feat(PowerSeries): pentagonal number theorem | The proof is split in two files: `Mathlib/Topology/Algebra/InfiniteSum/Pentagonal.lean` for the algebraic part, and `Mathlib/RingTheory/PowerSeries/Pentagonal.lean` for the summability part. In the near future, I also plan to prove the real/complex version that branches off from the algebraic part. --- - [x] depends on: #30436 - [x] depends on: #38179 [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author large-import | 371/1 | Mathlib.lean,Mathlib/Combinatorics/Enumerative/Pentagonal.lean,Mathlib/RingTheory/PowerSeries/Pentagonal.lean,Mathlib/Topology/Algebra/InfiniteSum/Pentagonal.lean,docs/1000.yaml | 5 | 54 | ['copilot-pull-request-reviewer', 'github-actions', 'jcommelin', 'mathlib-dependent-issues', 'tb65536', 'urkud', 'vihdzp', 'wwylele'] | chrisflav | 16 hours ago | 15 days ago | 110 days |
| 36783 | wwylele | feat(RingTheory/Localization): R ⧸ pⁿ ≃ₐ[R] Rₚ ⧸ (maximalIdeal Rₚ)ⁿ | This extends the existing `def equivQuotMaximalIdeal : R ⧸ p ≃+* Rₚ ⧸ maximalIdeal Rₚ` to powers of maximal ideals. --- Disclosure of AI usage: I chat with AI for a sketch of the proof. The code is entirely written by me. I didn't state the simp lemma for the symm direction because I am not sure how to state it. Following the analog of equivQuotMaximalIdeal_symm_apply_mk, this should be ``` theorem equivQuotMaximalIdealPow_symm_apply_mk (x : R) (s : p.primeCompl) : (equivQuotMaximalIdealPow p Rₚ n).symm (Ideal.Quotient.mk _ (IsLocalization.mk' Rₚ x s)) = (Ideal.Quotient.mk (p ^ n) x) * (Ideal.Quotient.mk (p ^ n) s)⁻¹ := by ``` But `(Ideal.Quotient.mk (p ^ n) s)⁻¹` is taking inverse in a non-field ring. Here the inverse always exists because s is not in p. What is the mathlib way to say this? [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 48/0 | Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Nilpotent.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean | 3 | 8 | ['chrisflav', 'github-actions', 'wwylele'] | chrisflav and mattrobball | 16 hours ago | 16 hours ago | 44 days |
| 33985 | YellPika | feat(Order/OmegaCompletePartialOrder): `OmegaCompletePartialOrder` instance for `Sum` with basic `ωScottContinuous` lemmas | This PR adds an `OmegaCompletePartialOrder` instance for `Sum`, along with `ωScottContinuous` lemmas for basic operations (`inl`, `inr`, `elim`). Appropriate lemmas are marked with `@[fun_prop]` so that the `fun_prop` tactic can automatically deduce `ωScottContinuous` proofs for functions involving `Sum`s (e.g. see the proof of `Sum.ωScottContinuous_map`). --- - [x] depends on: #33941 - [x] depends on: #37258 [](https://gitpod.io/from-referrer/) | new-contributor large-import t-order awaiting-author merge-conflict | 205/3 | Mathlib/Data/Sum/Basic.lean,Mathlib/Data/Sum/Order.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/ScottContinuity.lean,Mathlib/Topology/Constructions/SumProd.lean | 5 | 57 | ['Vierkantor', 'YaelDillies', 'YellPika', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] | YaelDillies and pechersky | 15 hours ago | 28 days ago | 52 days |
| 34054 | YellPika | feat(Order/OmegaCompletePartialOrder): OmegaCompletePartialOrder instance for `Sigma` with basic `ωScottContinuous` lemmas | This PR adds an `OmegaCompletePartialOrder` instance for `Sigma` along with `ωScottContinuous` lemmas for basic operations (`mk`, `fst`, `snd`). Appropriate lemmas are marked with `@[fun_prop]` so that the `fun_prop` tactic can automatically deduce `ωScottContinuous` proofs for functions involving `Sigma`s. --- - [x] depends on: #33941 - [ ] depends on: #37258 [](https://gitpod.io/from-referrer/) | new-contributor t-order please-merge-master awaiting-author merge-conflict | 172/0 | Mathlib/Data/Sigma/Order.lean,Mathlib/Order/OmegaCompletePartialOrder.lean | 2 | 29 | ['Vierkantor', 'YellPika', 'github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | grunweg | 15 hours ago | 69 days ago | 16 days |
| 37819 | YellPika | feat(Order/OmegaCompletePartialOrder): add `OmegaCompletePartialOrder` instance for `WithBot` with basic `ωScottContinuous` lemmas | This is a modification of #34093. See #34093 for details. --- - [x] depends on: #33941 - [x] depends on: #37258 [](https://gitpod.io/from-referrer/) | new-contributor t-order merge-conflict | 337/10 | Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/TypeTags.lean,Mathlib/Order/WithBot.lean | 6 | 5 | ['Komyyy', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | Komyyy | 14 hours ago | 14 hours ago | 22 days |
| 38537 | astrainfinita | refactor(Order): make completeness typeclasses mixins | This PR turns completeness typeclasses that are weaker than `CompleteLattice` into mixins. --- [](https://gitpod.io/from-referrer/) [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/Any.20infimum.20based.20version.20of.20.60OmegaCompletePartialOrder.60.3F/) Refactoring `CompleteLattice` would touch many more files, and there are still some unresolved design issues. I've modified 100 files and still haven't determined the correct approach. In this PR, `ConditionallyCompleteLattice` only requires `PartialOrder`, so that it can be used for types like `NonemptyInterval`. | t-order WIP merge-conflict | 578/580 | Counterexamples/SorgenfreyLine.lean,Mathlib/Algebra/FiniteSupport/Basic.lean,Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Group/CompleteLattice.lean,Mathlib/Algebra/Order/Group/Indicator.lean,Mathlib/Algebra/Order/Group/Pointwise/CompleteLattice.lean,Mathlib/Algebra/Order/Nonneg/Lattice.lean,Mathlib/Algebra/Tropical/BigOperators.lean,Mathlib/Algebra/Tropical/Lattice.lean,Mathlib/Analysis/Asymptotics/LinearGrowth.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Control/LawfulFix.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/Fintype/Order.lean,Mathlib/Data/Int/ConditionallyCompleteOrder.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Order.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Function/EssSup.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Integral/BoundedContinuousFunction.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/MeasureTheory/Measure/Decomposition/Lebesgue.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/Height/MvPolynomial.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/BourbakiWitt.lean,Mathlib/Order/Category/OmegaCompletePartialOrder.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/CompletePartialOrder.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/ConditionallyCompleteLattice/Group.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Basic.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Indexed.lean,Mathlib/Order/Copy.lean,Mathlib/Order/Filter/AtTopBot/CompleteLattice.lean,Mathlib/Order/Filter/Extr.lean,Mathlib/Order/Interval/Set/OrdConnectedLinear.lean,Mathlib/Order/IsNormal.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Order/Monotone/Extension.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/OrdContinuous.lean,Mathlib/Order/OrderIsoNat.lean,Mathlib/Order/PartialSups.lean,Mathlib/Order/SemiconjSup.lean,Mathlib/Order/SuccPred/Basic.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/Order/SupClosed.lean,Mathlib/Probability/IdentDistrib.lean,Mathlib/Probability/Martingale/BorelCantelli.lean,Mathlib/Probability/Martingale/Upcrossing.lean,Mathlib/Probability/Process/HittingTime.lean,Mathlib/Probability/Process/LocalProperty.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/Topology/Algebra/Order/LiminfLimsup.lean,Mathlib/Topology/FiberBundle/Basic.lean,Mathlib/Topology/MetricSpace/ProperSpace/Lemmas.lean,Mathlib/Topology/OmegaCompletePartialOrder.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/Bornology.lean,Mathlib/Topology/Order/Compact.lean,Mathlib/Topology/Order/IntermediateValue.lean,Mathlib/Topology/Order/IsLUB.lean,Mathlib/Topology/Order/LeftRightLim.lean,Mathlib/Topology/Order/LiminfLimsup.lean,Mathlib/Topology/Order/Monotone.lean,Mathlib/Topology/Order/MonotoneConvergence.lean,Mathlib/Topology/Order/OrderClosed.lean,Mathlib/Topology/Order/Rolle.lean,Mathlib/Topology/Semicontinuity/Basic.lean,MathlibTest/Delab/SupInf.lean | 76 | 4 | ['astrainfinita', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 14 hours ago | 5 days ago | 46 minutes |
| 38633 | JovanGerb | chore: golf some `grw` proofs | This PR cleans up a few `grw` proofs. These were found while making #38318, but are independent of it. --- [](https://gitpod.io/from-referrer/) | easy | 9/20 | Mathlib/Analysis/LocallyConvex/Bounded.lean,Mathlib/Data/Int/LeastGreatest.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Indicator.lean,Mathlib/NumberTheory/Height/MvPolynomial.lean | 5 | 1 | ['github-actions'] | nobody | 12 hours ago | 3 days ago | 3 days |
| 38382 | dagurtomas | feat(CategoryTheory/Limits): explicit coends in `Type` | --- [](https://gitpod.io/from-referrer/) | t-category-theory | 211/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/Chosen/End.lean,Mathlib/CategoryTheory/Limits/Types/End.lean | 3 | 7 | ['dagurtomas', 'github-actions', 'robin-carlier'] | nobody | 12 hours ago | 14 hours ago | 2 days |
| 33506 | Rida-Hamadani | feat(SimpleGraph): construct a cycle of two distinct paths with same start and end | Co-authored-by: Vlad Tsyrklevich |
t-combinatorics | 119/1 | Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Operations.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Nodup.lean | 5 | 42 | ['Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vlad902'] | nobody | 12 hours ago | 22 hours ago | 14 days |
| 38716 | YaelDillies | feat(Algebra/Order): `NNRat.cast_sub` | From AddCombi --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 29/22 | Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Ring/Rat.lean,Mathlib/Combinatorics/SetFamily/LYM.lean,Mathlib/Data/Finset/Density.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/NNRat/Floor.lean,Mathlib/Data/NNRat/Order.lean,Mathlib/Data/Rat/Star.lean,Mathlib/RingTheory/Binomial.lean,Mathlib/Topology/Instances/Rat.lean | 10 | 1 | ['github-actions'] | nobody | 12 hours ago | 12 hours ago | 13 hours |
| 38702 | jcommelin | chore(Data/Real): encapsulate real numbers | This PR: * hides the definition of the real numbers * preserves defeqs when casting `Nat`, `Int`, `Rat`, into the reals * preserves the defeq `x - y = x + (-y)` for `x y : Real` * removes a bunch of technical debt * adjusts imports in the library, where files relied on getting access to Cauchy sequences transitively via importing the reals. --- [](https://gitpod.io/from-referrer/) | delegated | 239/257 | Archive/Imo/Imo2013Q5.lean,Counterexamples/SeminormLatticeNotDistrib.lean,Mathlib.lean,Mathlib/Analysis/Complex/Norm.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/Real/Cardinality.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Counting.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/Real/Cauchy.lean,Mathlib/Data/Real/Sign.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/SelbergSieve.lean,Mathlib/Topology/Algebra/Ring/Real.lean,Mathlib/Topology/Instances/Real/Lemmas.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/UniformSpace/CompareReals.lean,Mathlib/Topology/UniformSpace/Real.lean,MathlibTest/Complex.lean,MathlibTest/Quaternion.lean,MathlibTest/Real.lean,MathlibTest/peel.lean | 26 | 17 | ['JovanGerb', 'YaelDillies', 'eric-wieser', 'fpvandoorn', 'github-actions', 'jcommelin', 'leanprover-radar', 'mathlib-bors', 'riccardobrasca', 'sgouezel'] | nobody | 12 hours ago | 2 days ago | 43 minutes |
| 38751 | YaelDillies | feat(Data/Finset/Density): more `NNRat.cast` lemmas | From AddCombi --- - [ ] depends on: #38716 [](https://gitpod.io/from-referrer/) | t-algebra large-import blocked-by-other-PR | 69/39 | Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Ring/Rat.lean,Mathlib/Combinatorics/SetFamily/LYM.lean,Mathlib/Data/Finset/Density.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/NNRat/Floor.lean,Mathlib/Data/NNRat/Order.lean,Mathlib/Data/Rat/Star.lean,Mathlib/RingTheory/Binomial.lean,Mathlib/Topology/Instances/Rat.lean | 10 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 12 hours ago | 1 day ago | 16 minutes |
| 38786 | martinwintermath | Add `IsConcreteNeg`+ lemmas + use for submodules | --- [](https://gitpod.io/from-referrer/) | t-convex-geometry | 113/20 | Mathlib.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Data/SetLike/Pointwise.lean,Mathlib/Geometry/Convex/Cone/Pointed.lean,Mathlib/LinearAlgebra/Span/Basic.lean | 5 | 1 | ['github-actions'] | nobody | 12 hours ago | unknown | 0 seconds |
| 37947 | LLaurance | chore(Probability): shorten proofs by omitting unfold where unnecessary | --- [](https://gitpod.io/from-referrer/) | t-measure-probability | 7/12 | Mathlib/Probability/Distributions/Uniform.lean | 1 | 4 | ['CoolRmal', 'LLaurance', 'github-actions'] | nobody | 11 hours ago | 11 hours ago | 11 hours |
| 37886 | LLaurance | chore(Algebra): shorten proofs by removing lemmas used in simp | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 5/7 | Mathlib/Algebra/Free.lean,Mathlib/Algebra/FreeAlgebra.lean | 2 | 7 | ['LLaurance', 'github-actions', 'joelriou', 'leanprover-radar', 'mathlib-merge-conflicts', 'themathqueen'] | joelriou | 11 hours ago | 21 hours ago | 15 days |
| 38783 | marcelolynch | experiment / do not review: breaking change for downstream | do not review | WIP | 7/0 | Mathlib/Probability/Combinatorics/BinomialRandomGraph/Defs.lean | 1 | 5 | ['downstream-reports-automation', 'github-actions'] | nobody | 11 hours ago | 1 day ago | 7 minutes |
| 38792 | openendings | [incomplete] rename Directed -> Predirected | This **incomplete** PR renames `Directed` to `Predirected`.
As [discussed in Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.3E.20complete.20partial.20order.20and.20domain.20theory.20formalization/near/592156927), `Directed` misleadingly mismatches the literature. (The literature says a directed set is nonempty, and we do not.)
#### f19d3e79 Rename Directed -> Predirected (class + namespace)
Automated changes:
- LSP code action renaming `Directed` to `Predirected`
- with the affected 69 files open in [lean.nvim](https://github.com/julian/lean.nvim), a series of commands roughly equivalent to
```nvim
:bufdo :silent %s/\(theorem \|lemma \|to_dual \)Directed\>/\1Predirected/ge
:bufdo :silent %s/\ |
please-adopt WIP new-contributor awaiting-author | 196/195 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Directed.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Group/Subgroup/Lattice.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Subsemigroup/Membership.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Strict.lean,Mathlib/Analysis/InnerProductSpace/Orthonormal.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/Data/Finset/Order.lean,Mathlib/Data/Fintype/Order.lean,Mathlib/Data/Set/Accumulate.lean,Mathlib/Data/Set/Dissipate.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Data/Set/Lattice/Image.lean,Mathlib/Data/Set/Pairwise/Lattice.lean,Mathlib/Data/Set/UnionLift.lean,Mathlib/Dynamics/PeriodicPts/Lemmas.lean,Mathlib/FieldTheory/CardinalEmb.lean,Mathlib/FieldTheory/Extension.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Basic.lean,Mathlib/LinearAlgebra/Eigenspace/Basic.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Span/Defs.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Sub.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/ModelTheory/Satisfiability.lean,Mathlib/ModelTheory/Substructures.lean,Mathlib/ModelTheory/Syntax.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/CompletePartialOrder.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Defs.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Indexed.lean,Mathlib/Order/Directed.lean,Mathlib/Order/Filter/Bases/Basic.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Lift.lean,Mathlib/Order/Filter/Map.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/Preorder/Chain.lean,Mathlib/Order/RelIso/Set.lean,Mathlib/Probability/Independence/Basic.lean,Mathlib/Probability/Independence/Conditional.lean,Mathlib/Probability/Independence/Kernel/Indep.lean,Mathlib/Probability/Independence/ZeroOne.lean,Mathlib/Probability/Kernel/Disintegration/CDFToKernel.lean,Mathlib/RingTheory/AlgebraicIndependent/Basic.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Category/TopCat/Limits/Konig.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Compactness/CompactSystem.lean,Mathlib/Topology/Compactness/CountablyCompact.lean,Mathlib/Topology/Semicontinuity/Basic.lean,Mathlib/Topology/Separation/Hausdorff.lean,Mathlib/Topology/Separation/Profinite.lean,Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean | 69 | 5 | ['github-actions', 'kbuzzard', 'openendings'] | nobody | 11 hours ago | unknown | 0 seconds |
| 38704 | kbuzzard | perf: raise prio of various Mul->SMul instances | The instances `instSMulOfMul` /`instVAddOfAdd`, `MulZeroClass.toSMulWithZero`, `Monoid.toMulAction` / `AddMonoid.toAddAction`, `MonoidWithZero.toMulActionWithZero` and `Semiring.toModule` are all of the form `F X -> G X X` (so rarely apply) and are essentially always the right choice when they do apply (I know of no counterexample, in fact). They are also all at lowered priority on master, a decision which came from mathlib3 (which had a very different algorithm for typeclass inference). I have raised them to higher priority than default (in fact to 1100) and this causes a speedup of around 20% in several of the slowest files in mathlib (`Mathlib.RingTheory.Etale.QuasiFinite`, `Mathlib.RingTheory.DedekindDomain.Different`, `Mathlib.RingTheory.ZariskisMainTheorem`,...) and a general speedup in far more files. --- [](https://gitpod.io/from-referrer/) | t-algebra maintainer-merge | 82/15 | Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/RingTheory/AdicCompletion/AsTensorProduct.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean | 6 | 33 | ['JovanGerb', 'Whysoserioushah', 'github-actions', 'grunweg', 'jcommelin', 'kbuzzard', 'leanprover-radar'] | nobody | 11 hours ago | 2 days ago | 2 days |
| 38654 | MichaelStollBayreuth | feat(RingTheory.DedekindDomain.Factorization): add API for factorization | This PR adds * `simp` lemmas that convert ways of expressing the multiplicity of a prime ideal `p` in the factorization of an ideal `I` into `multiplicity p.asIdeal I` (see [#Is there code for X? > Results on elements of number fields and ideals @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Results.20on.20elements.20of.20number.20fields.20and.20ideals/near/574739650)), * API lemmas on multiplicities, expressed in terms of `multiplicity p.asIdeal I`. * We also refactor a proof in Mathlib.RingTheory.DedekindDomain.Ideal.Lemmas by extracting a couple of lemmas that we can reuse in one of the new lemmas. These will be useful in proving the Northcott property of heights on number fields. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 164/23 | Mathlib/RingTheory/DedekindDomain/Factorization.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/UniqueFactorizationDomain/NormalizedFactors.lean | 3 | 5 | ['MichaelStollBayreuth', 'github-actions', 'xroblot'] | nobody | 11 hours ago | 2 days ago | 3 days |
| 36376 | jessealama | feat(SimpleGraph): hamiltonian cycle from cyclic permutation | This PR provides `IsHamiltonian.ofPerm`, a bridge from `Equiv.Perm.IsCycle` to `SimpleGraph.IsHamiltonian`: if σ is a permutation that is a single cycle with full support on at least 3 elements, and each step `v → σ v` is an edge of `G`, then `G` is Hamiltonian. ### New definitions and lemmas **`Mathlib/Combinatorics/SimpleGraph/Walk/Iterate.lean`** (new file): - `Walk.iterate`: builds a walk of length `n` from `x` to `f^[n] x` for any function `f` with `G.Adj x (f x)` for all `x`, defined via `Walk.ofSupport` - `Walk.length_iterate`, `Walk.support_iterate`, `Walk.edges_iterate`: basic API **`Mathlib/GroupTheory/Perm/Cycle/Basic.lean`**: - `IsCycleOn.injOn_pow_apply`: the map `n ↦ (f ^ n) a` is injective on `Finset.range #s` **`Mathlib/GroupTheory/Perm/Cycle/Concrete.lean`**: - `Perm.toList_eq_range_map_pow`: expresses `toList` as a range map over powers **`Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean`**: - `edge_ne_of_isCycleOn`: edge distinctness for cycle-on permutations - `IsHamiltonian.ofPerm`: the main theorem --- - [x] depends on: #36307 | large-import t-combinatorics awaiting-author | 147/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Iterate.lean,Mathlib/Data/List/Chain.lean,Mathlib/Data/List/Iterate.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | 7 | 42 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'jessealama', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | YaelDillies | 10 hours ago | 3 days ago | 35 days |
| 38798 | joelriou | chore(CategoryTheory): adding a test about typeclass inferrence regarding compositions of functors | There has been several bona fide attempts (#36652 and #38674) to fix issues with transparency by making the composition of functors more reducible. However, doing this would create diamonds for typeclasses like `Functor.Monoidal` and `Functor.CommShift`. The added tests are an attempt at preventing this in the future. --- [](https://gitpod.io/from-referrer/) | t-category-theory | 44/0 | MathlibTest/CategoryTheory/FunctorAssoc.lean | 1 | 1 | ['github-actions'] | nobody | 10 hours ago | 10 hours ago | 10 hours |
| 36913 | joelriou | feat(CategoryTheory/Monoidal): Yoneda embedding of ring objects | (This series of PR mostly builds on previous work by the Toric project.) --- - [x] depends on: #38366 - [x] depends on: #37587 - [x] depends on: #37167 - [x] depends on: #37265 - [x] depends on: #37263 [](https://gitpod.io/from-referrer/) | t-category-theory | 84/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Ring.lean | 2 | 10 | ['dagurtomas', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'robin-carlier'] | robin-carlier | 10 hours ago | 21 hours ago | 5 days |
| 37869 | mckoen | feat(AlgebraicTopology/Quasicategory): inner fibrations and inner anodyne morphisms | Defines inner fibrations, inner anodyne morphisms, and immediate results. --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology awaiting-author | 220/0 | Mathlib.lean,Mathlib/AlgebraicTopology/Quasicategory/Basic.lean,Mathlib/AlgebraicTopology/Quasicategory/InnerFibration.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/Inner/Basic.lean | 4 | 16 | ['github-actions', 'joelriou', 'mckoen', 'robin-carlier'] | nobody | 10 hours ago | 10 hours ago | 1 day |
| 38198 | JovanGerb | chore(Data/Real/Basic): `no_expose` the private operations | This PR puts `no_expose` on all of the operations on `Real` that are defined in terms of quotients. This is a step in the direction of not exposing the definiton of `Real`. Note that I leave the `irreducible_def`s as is. This is because the `simpNF` linter does not participate in the module system, and it would time out otherwise. --- [](https://gitpod.io/from-referrer/) | t-data | 11/32 | Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean | 3 | 11 | ['JovanGerb', 'eric-wieser', 'github-actions', 'leanprover-radar'] | nobody | 10 hours ago | 13 days ago | 13 days |
| 38799 | YaelDillies | refactor(Combinatorics/Additive/Energy): switch to the compact normalisation | In additive combinatorics, it is natural for the group of study to be considered with its compact normalisation (making it have total mass 1) and its dual group to be considered with its discrete normalisation (so that each singleton has mass 1), instead of the other way around and even when both groups are finite. In this case, I will soon generalise the energy to compact abelian groups, and possibly even to all abelian groups equipped with a mean. This PR is a first step towards that by renormalising the energy to be between 0 and 1. From AddCombi --- - [ ] depends on: #38751 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-combinatorics large-import | 180/94 | Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Ring/Rat.lean,Mathlib/Combinatorics/Additive/Energy.lean,Mathlib/Combinatorics/SetFamily/LYM.lean,Mathlib/Data/Finset/Density.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/NNRat/Floor.lean,Mathlib/Data/NNRat/Order.lean,Mathlib/Data/Rat/Star.lean,Mathlib/RingTheory/Binomial.lean,Mathlib/Topology/Instances/Rat.lean | 11 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 10 hours ago | 10 hours ago | 11 seconds |
| 38795 | YaelDillies | feat(Algebra/Group/Action/Pointwise): `#(s ∩ (a • t)) = #{x ∈ s ×ˢ t | x.1 / x.2 = a}` | The `Finset` lemma already exists. From AddCombi --- [](https://gitpod.io/from-referrer/) | t-algebra | 37/18 | Mathlib/Algebra/Group/Action/Pointwise/Finset.lean,Mathlib/Algebra/Group/Action/Pointwise/Set/Basic.lean,Mathlib/Algebra/GroupWithZero/Action/Pointwise/Finset.lean | 3 | 1 | ['github-actions'] | nobody | 10 hours ago | 10 hours ago | 11 hours |
| 30666 | erdOne | feat(NumberTheory): every number field has a ramified prime | --- [](https://gitpod.io/from-referrer/) | t-number-theory t-algebra delegated | 260/10 | Mathlib.lean,Mathlib/Algebra/Ring/Int/Field.lean,Mathlib/LinearAlgebra/Dimension/FreeAndStrongRankCondition.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/NumberTheory/NumberField/Discriminant/Different.lean,Mathlib/NumberTheory/NumberField/ExistsRamified.lean,Mathlib/NumberTheory/RamificationInertia/Inertia.lean,Mathlib/RingTheory/DedekindDomain/Basic.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean,Mathlib/RingTheory/KrullDimension/Basic.lean | 12 | 49 | ['MichaelStollBayreuth', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'riccardobrasca', 'tb65536', 'xroblot'] | jcommelin | 10 hours ago | 10 hours ago | 14 days |
| 37675 | vihdzp | feat: `Order.cof Ordinal = univ` | --- [](https://gitpod.io/from-referrer/) | t-set-theory t-order maintainer-merge | 11/0 | Mathlib/SetTheory/Cardinal/Cofinality.lean | 1 | 4 | ['YaelDillies', 'github-actions', 'vihdzp'] | nobody | 10 hours ago | 25 days ago | 25 days |
| 38793 | YaelDillies | chore: tag (almost) all `mono` lemmas as `@[gcongr]` | The few exceptions are the lemmas about `Set` and `Finset` which would make `gcongr` use `≤` instead of `⊆`, and `measure_mono_ae` which feels like a bigger than I want to undertake here, as well as a few lemmas that `gcongr` doesn't want to eat. From AddCombi --- [](https://gitpod.io/from-referrer/) | maintainer-merge | 139/139 | Mathlib/Algebra/ContinuedFractions/Computation/ApproximationCorollaries.lean,Mathlib/Algebra/Lie/Ideal.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Submodule/RestrictScalars.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/Ring/Ordering/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Filter.lean,Mathlib/Analysis/SpecialFunctions/Sigmoid.lean,Mathlib/CategoryTheory/Category/Preorder.lean,Mathlib/CategoryTheory/Sites/Closed.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/SetFamily/Intersecting.lean,Mathlib/Combinatorics/SetFamily/Shadow.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Combinatorics/Young/YoungDiagram.lean,Mathlib/Data/Finset/Density.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/PImage.lean,Mathlib/Data/Finset/Prod.lean,Mathlib/Data/Finset/Sigma.lean,Mathlib/Data/Fintype/Sets.lean,Mathlib/Data/Int/Log.lean,Mathlib/Data/Multiset/Fintype.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Nat/Count.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Nat/Fib/Basic.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/Data/Real/ENatENNReal.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/Set/Subset.lean,Mathlib/Data/SetLike/Basic.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/Geometry/Diffeology/Basic.lean,Mathlib/LinearAlgebra/Dual/Defs.lean,Mathlib/LinearAlgebra/Projectivization/Subspace.lean,Mathlib/LinearAlgebra/SModEq/Basic.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Basic.lean,Mathlib/MeasureTheory/MeasurableSpace/Defs.lean,Mathlib/MeasureTheory/Measure/AbsolutelyContinuous.lean,Mathlib/MeasureTheory/Measure/Map.lean,Mathlib/MeasureTheory/Measure/QuasiMeasurePreserving.lean,Mathlib/MeasureTheory/Measure/Typeclasses/Finite.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/MeasureTheory/OuterMeasure/Operations.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Closure.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Map.lean,Mathlib/Order/Filter/Pi.lean,Mathlib/Order/Filter/Prod.lean,Mathlib/Order/Filter/SmallSets.lean,Mathlib/Order/Height.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/UpperLower/Prod.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Maps.lean,Mathlib/RingTheory/Ideal/Norm/RelNorm.lean,Mathlib/RingTheory/Jacobson/Ideal.lean,Mathlib/RingTheory/Localization/Submodule.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubring/Defs.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/Topology/Algebra/InfiniteSum/ENNReal.lean,Mathlib/Topology/Compactness/SigmaCompact.lean,Mathlib/Topology/Connected/Basic.lean,Mathlib/Topology/DiscreteQuotient.lean,Mathlib/Topology/MetricSpace/HausdorffDimension.lean,Mathlib/Topology/MetricSpace/MetricSeparated.lean,Mathlib/Topology/NhdsKer.lean,Mathlib/Topology/Order/LeftRightLim.lean | 79 | 11 | ['SnirBroshi', 'YaelDillies', 'github-actions', 'grunweg'] | nobody | 10 hours ago | 12 hours ago | 12 hours |
| 38745 | FordUniver | chore(Combinatorics/SimpleGraph/Copy): rename labelledCopyCount | Renames `labelledCopyCount` to `labeledCopyCount` (American spelling per the [naming conventions](https://leanprover-community.github.io/contribute/naming.html#spelling)). Deprecated aliases are provided for all renamed declarations. --- Should probably be a prerequisite for #38631. | t-combinatorics new-contributor | 31/19 | Mathlib/Combinatorics/SimpleGraph/Copy.lean | 1 | 15 | ['FordUniver', 'SnirBroshi', 'YaelDillies', 'github-actions'] | nobody | 10 hours ago | 1 day ago | 1 day |
| 38363 | vihdzp | chore: split `SetTheory.Cardinal.Cofinality` | We split this file into a `Basic` file with only the basic results on `Order.cof`, and an `Ordinal` file for the interactions with ordinals. This avoids an import cycle in a subsequent PR. The module docstrings were rewritten, but no theorems were changed. --- This is necessary for #38362, as otherwise I'd get the cycle `Cardinal.Cofinality` → `Ordinal.Enum` → `Cardinal.Aleph` → `Cardinal.Arithmetic` → `Cardinal.Cofinality`. [](https://gitpod.io/from-referrer/) | file-removed | 219/198 | Mathlib.lean,Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean,Mathlib/LinearAlgebra/Dimension/Finite.lean,Mathlib/Order/Filter/Cocardinal.lean,Mathlib/SetTheory/Cardinal/Cofinality/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality/Ordinal.lean,Mathlib/SetTheory/Cardinal/Regular.lean,Mathlib/SetTheory/Ordinal/FundamentalSequence.lean | 8 | 3 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 10 hours ago | 10 hours ago | 8 days |
| 35287 | arnoudvanderleer | feat(AlgebraicTopology/SimplicialSet): define isomorphisms in simplicial sets, and the coherent isomorphism simplicial set | show that any edge in a simplicial set, that is the image of the forward edge of the coherent isomorphism under a simplicial set morphism, is an isomorphism. --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology new-contributor infinity-cosmos | 367/3 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplicialSet/CoherentIso.lean,Mathlib/AlgebraicTopology/SimplicialSet/CompStruct.lean,Mathlib/AlgebraicTopology/SimplicialSet/NerveCodiscrete.lean,Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean,Mathlib/CategoryTheory/CodiscreteCategory.lean | 6 | 109 | ['arnoudvanderleer', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib-merge-conflicts', 'robin-carlier'] | robin-carlier | 9 hours ago | 9 hours ago | 19 days |
| 38755 | TJHeeringa | feat(Analysis/innerProductSpace/GramMatrix): Add Gram.posSemidef_of_mapL | --- `Analysis/innerProductSpace/TensorProduct` has a TODO for a continuous version of `TensorProduct.map`. One place which contains a proof for this is at [stack](https://math.stackexchange.com/a/3934668). This PR is lemma 1 of that. It is written with `.PosSemidef` instead of `≤` because the Löwner Order on matrices is only defined in lean for matrices with values in `𝕜`. No AI used. [](https://gitpod.io/from-referrer/) | t-analysis new-contributor | 14/0 | Mathlib/Analysis/InnerProductSpace/GramMatrix.lean | 1 | 8 | ['TJHeeringa', 'github-actions', 'themathqueen'] | nobody | 9 hours ago | 9 hours ago | 17 hours |
| 34045 | smmercuri | feat: `algebraMap K L` is uniform continuous with respect to adic topologies, when the ideal `w` of `L` lies above `v` | - `A` is a Dedekind domain with field of fractions `K`. - `B` is a Dedekind domain with field of fractions `L`. - `L` is a field extension of `K`. - `v` is a height one prime ideal of `A`. - `w` is a height one prime ideal of `B` lying over `v`. Then respective valuations are related via the ramification index, and `algebraMap (WithVal (v.valuation K)) (WithVal (w.valuation L))` is uniform continuous. --- - [x] depends on: #34049 - [x] depends on: #35972 - [x] depends on: #36144 - [x] depends on: #36310 [](https://gitpod.io/from-referrer/) | FLT t-algebra t-number-theory | 159/12 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Units.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 6 | 10 | ['dagurtomas', 'github-actions', 'jjdishere', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smmercuri'] | nobody | 9 hours ago | 4 days ago | 22 days |
| 38547 | ADedecker | feat: define Submodule.IsTopCompl | Right now, Mathlib defines [Submodule.ClosedComplemented](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Algebra/Module/LinearMap.html#Submodule.ClosedComplemented). `Submodule.IsTopCompl` is the more precise version saying that two subspaces are topological complements to each other. --- [](https://gitpod.io/from-referrer/) | t-topology t-analysis delegated | 424/85 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/Analysis/Normed/Module/Complemented.lean,Mathlib/Analysis/Normed/Module/ContinuousInverse.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/LinearAlgebra/Projection.lean,Mathlib/Topology/Algebra/Module/Complement.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 9 | 63 | ['ADedecker', 'github-actions', 'mathlib-bors', 'ocfnash', 'themathqueen'] | themathqueen | 9 hours ago | 2 days ago | 1 day |
| 37342 | vasnesterov | feat(Tactic/ComputeAsymptotics/Multiseries): non-primitive corecursion for Seq: more `FriendlyOperation` API | This is a continuation of #35072. This PR adds more API about friendly operations: * `FriendlyOperation.coind`: a coinductive principle for proving that operation is friendly * `FriendlyOperationClass.eq_of_bisim`: a generalisation of `Seq.eq_of_bisim'` for proving two sequences are equal. --- - [x] depends on: #35072 This is a part of the `compute_asymptotics` tactic (#28291). [](https://gitpod.io/from-referrer/) | t-data t-meta awaiting-author | 161/0 | Mathlib/Tactic/ComputeAsymptotics/Multiseries/Corecursion.lean | 1 | 5 | ['github-actions', 'joneugster', 'mathlib-dependent-issues'] | joneugster | 9 hours ago | 9 hours ago | 28 days |
| 37171 | SnirBroshi | chore(Data/Int/Init): generalize `le_induction` from `Prop` to `Sort*` + def lemmas | --- - Generallise `le_induction` from `Prop` to `Sort*` and rename to `leInduction` - Add a few lemmas - Simplify proofs using `lia` - Move `inductionOn'_add_one` [Zulip 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Add.20note.20to.20help.20search.20similar.20thms/near/535331432) [](https://gitpod.io/from-referrer/) | t-data large-import maintainer-merge | 56/48 | Mathlib/Data/Int/Basic.lean,Mathlib/Data/Int/Init.lean,Mathlib/GroupTheory/CoprodI.lean | 3 | 9 | ['SnirBroshi', 'github-actions', 'joneugster', 'mathlib-merge-conflicts', 'plp127'] | joneugster | 9 hours ago | 30 days ago | 31 days |
| 37931 | Vierkantor | chore(Tactic): make the (deprecated) `replace` syntax a `@[tactic_alt]` | This PR replaces the tactic docstring for Mathlib's version of `replace` with a `@[tactic_alt]` attribute + `tactic_extension`. Also update the module docs which did not get updated when `replace` got upstreamed to core Lean. --- [](https://gitpod.io/from-referrer/) | documentation t-meta maintainer-merge | 7/31 | Mathlib/Tactic/Replace.lean | 1 | 2 | ['github-actions', 'joneugster'] | joneugster | 9 hours ago | 18 days ago | 18 days |
| 36442 | SnirBroshi | feat(Data/Sym/Sym2/Card): cardinality theorems about `Sym2 α` | --- [](https://gitpod.io/from-referrer/) | t-data awaiting-author | 100/0 | Mathlib.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Sym/Sym2/Card.lean | 3 | 20 | ['SnirBroshi', 'eric-wieser', 'github-actions', 'joneugster', 'themathqueen'] | joneugster | 9 hours ago | 9 hours ago | 38 days |
| 34909 | SnirBroshi | feat(Data/Sym/Sym2): `fromRel` equivalence with `Sigma` over a `Quotient` | Add a non-dependent recursor on members of a `fromRel` set, and the following `Equiv`s: - The `fromRel` set of a symmetric relation `r` is equivalent to summing that set restricted to fibers of `f`. - For a relation homomorphism `r →r r'` where `r` is symmetric, the `fromRel` set of `r` is equivalent to summing that set restricted to equivalence classes of `r'` using a `Subtype`. --- I find this recursor pretty useful when dealing with `fromRel`, the idea came from a suggestion by @kmill [on Zulip](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Eq.2Erec.20with.20a.20constant.20does.20nothing.3A.20h.20.E2.96.B8.20c.20.3D.20c/near/565176948) for another `Sym2` conundrum. [](https://gitpod.io/from-referrer/) | t-data delegated | 55/3 | Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Data/Sym/Sym2.lean | 2 | 15 | ['SnirBroshi', 'chrisflav', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | eric-wieser | 9 hours ago | 1 day ago | 82 days |
| 38228 | kim-em | ci: block merging PRs that increase technical debt unless reviewed | This PR adds a merge gate for technical debt increases. When the existing technical debt metrics script reports an increase, the `build` job adds an `increases-technical-debt` label. A `check-technical-debt` job then adds `blocked-by-increases-technical-debt`, which blocks bors. A reviewer can add `allow-increases-technical-debt` to unblock after confirming the increase is acceptable. ### Fail-closed detection The detection greps for the *safe* patterns (`Decrease in tech debt:` / `No changes to technical debt.`) rather than for `Increase`. If `mathlib-ci` changes the script's output wording, the label is added (fail closed) rather than silently skipped (fail open). ### Labels (three-label pattern, same as #38225) | Label | Managed by | Purpose | |---|---|---| | `increases-technical-debt` | `build` job (tech debt script) | Factual: this PR increases debt | | `blocked-by-increases-technical-debt` | `check-technical-debt` job | Operational: blocks bors | | `allow-increases-technical-debt` | Reviewer | Override: reviewer approves the increase | Bors's `block_labels` has no conditional logic, so we need the derived `blocked-by-increases-technical-debt` label to express the conjunction "increases-technical-debt AND NOT allow-increases-technical-debt". False positives can be reported on the [mathlib4 Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/increases-technical-debt.20label). 🤖 Prepared with Claude Code | CI | 76/2 | .github/workflows/PR_summary.yml,bors.toml | 2 | 5 | ['github-actions', 'jcommelin', 'joneugster', 'kim-em'] | Vierkantor and jcommelin | 9 hours ago | 10 days ago | 10 days |
| 38225 | kim-em | ci: block merging PRs with large import increases unless reviewed | This PR makes the existing `large-import` label into a merge gate. PRs that significantly increase transitive imports (>2% for any modified file) are now blocked from merging until a reviewer adds the `allow-large-import` label. ### Why three labels? Bors's `block_labels` has no conditional logic — if a label is in the list, merge is blocked unconditionally. We need "blocked unless a reviewer has approved", i.e. `large-import ∧ ¬allow-large-import`. Since bors can't express that, we use a derived label: | Label | Managed by | Purpose | |---|---|---| | `large-import` | `build` job (import analysis) | Factual: this PR increases imports | | `blocked-by-large-import` | `check-large-import` job | Operational: blocks bors | | `allow-large-import` | Reviewer | Override: reviewer approves the increase | Each label is managed by exactly one actor, so there is no label-fighting. ### How it works 1. The existing `build` job adds/removes `large-import` based on import analysis (unchanged). 2. A new `check-large-import` job (in the same workflow) waits for `build` to finish, then: - If `large-import` is present and `allow-large-import` is absent → adds `blocked-by-large-import` - Otherwise → removes `blocked-by-large-import` 3. `blocked-by-large-import` is added to `block_labels` in `bors.toml`. When a reviewer adds `allow-large-import`, the `labeled` event re-triggers the workflow. The heavy `build` job is skipped (guarded by `github.event.action != 'labeled'`), but the lightweight `check-large-import` job runs, sees both labels, and removes `blocked-by-large-import`. Bors can now merge. ### Reviewer workflow The CI failure message tells the reviewer to consider whether the PR could be improved by splitting files, rearranging material, or creating new intermediate files. If the import increase is reasonable, they add `allow-large-import`. False positives can be reported on the [mathlib4 Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/large-import.20label). 🤖 Prepared with Claude Code | CI | 78/2 | .github/workflows/PR_summary.yml,bors.toml | 2 | 6 | ['SnirBroshi', 'github-actions', 'jcommelin', 'joneugster', 'kim-em'] | jcommelin | 9 hours ago | 10 days ago | 10 days |
| 37584 | kennethgoodman | feat(Data/Nat/Fib): formalize Lamé's theorem | ## Summary Formalize [Lamé's theorem](https://en.wikipedia.org/wiki/Lam%C3%A9%27s_theorem) (1844), the founding result of computational complexity theory. **Lamé's Theorem:** If the Euclidean algorithm on inputs `(a, b)` with `b ≤ a` takes `n + 1` division steps, then `b ≥ fib(n + 1)` and `a ≥ fib(n + 2)`. ### New definitions - `Nat.euclidSteps`: counts the number of division steps in the Euclidean algorithm on natural number inputs. ### New theorems - `Nat.fib_le_of_euclidSteps`: the main Lamé bound — Fibonacci lower bound on inputs given a step count. - `Nat.euclidSteps_le_of_lt_fib`: the contrapositive — step count upper bound given a Fibonacci bound on the smaller input. - `Nat.add_mod_le`: helper lemma that `b + a % b ≤ a` when `b ≤ a` and `0 < b`. ### Proof strategy Induction on `n`, tracking both elements of the pair. The key insight is that each Euclidean step replaces `(a, b)` with `(b, a % b)`, and since `a ≥ b + a % b` (because `a / b ≥ 1`), the Fibonacci recurrence `fib(n+3) = fib(n+2) + fib(n+1)` matches the structure of the algorithm. ### References - Gabriel Lamé, *Note sur la limite du nombre des divisions dans la recherche du plus grand commun diviseur entre deux nombres entiers*, Comptes rendus de l'Académie des sciences, 1844. --- ### AI usage disclosure Per the [Mathlib AI guidelines](https://leanprover-community.github.io/contribute/index.html#use-of-ai): Claude Code (Claude Opus 4.6) was used to assist with writing the Lean 4 proof code, fixing tactic errors, and drafting this PR description. The mathematical proof (induction on step count, tracking both pair elements through the Fibonacci recurrence) was designed by hand and verified on paper before formalization. I have reviewed and understand every line of the resulting Lean code and can explain all proof steps. --- - [x] builds cleanly (`lake build Mathlib.Data.Nat.Fib.Lame`) - [x] no `sorry` - [x] lines ≤ 100 characters, no trailing whitespace - [x] `autoImplicit false` - [x] docstrings on all public declarations | new-contributor LLM-generated t-data | 121/0 | Mathlib.lean,Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Fib/Basic.lean,Mathlib/Data/Nat/Fib/Lame.lean,docs/1000.yaml | 5 | 24 | ['euprunin', 'github-actions', 'kennethgoodman', 'vihdzp', 'wwylele'] | nobody | 8 hours ago | 20 days ago | 27 days |
| 37561 | IvanRenison | feat(Data/List): add lemma `List.notMem_subset` | --- Zulip question: https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/List.2EnotMem_subset/with/583146215 [](https://gitpod.io/from-referrer/) | t-data awaiting-author | 3/0 | Mathlib/Data/List/Basic.lean | 1 | 2 | ['github-actions', 'joneugster'] | joneugster | 8 hours ago | 8 hours ago | 28 days |
| 36103 | SnkXyx | feat(Algebra/MvPolynomial/CharacteristicSet): add Characteristic Set | This PR adds some definitions and theorems of Characteristic Set Method (also known as Wu's Method). Definitions: * `MvPolynomial.mainDegree` * `MvPolynomial.initialOf` * `MvPolynomial.reducedTo` * `TriangulatedSet` * `MvPolynomial.pseudo` * `MvPolynomial.setPseudo` * `MvPolynomial.isRemainder` * `MvPolynomial.isSetRemainder` * `AscendingSetTheory` * `TriangulatedSet.isAscendingSet` * `HasBasicSet` * `TriangulatedSet.isCharacteristicSet` * `MvPolynomial.List.characteristicSet` * `MvPolynomial.List.zeroDecomposition` Main Theorems: * `MvPolynomial.initialOf_mul_eq`: $init_i(p \cdot q) = init_i(p) \cdot init_i(q)$ if there is no zero divisors in the coefficient ring. * `TriangulatedSet.instWellFoundedLT`: The set of Triangulated Sets is well-founded under the lexicographic ordering. * `MvPolynomial.pseudo_remainder_isRemainder`: The remainder $r$ of $g$ by $f$ is reduced with respect to $f$ and satisfies $init(f)^s \cdot g = q \cdot f + r$ for some $s \in \mathbb{N}$ and $q \in R[X_{\sigma}]$. * `MvPolynomial.setPseudo_remainder_isSetRemainder`: The remainder $r$ of $g$ by a set $S$ is reduced with respect to $S$ and satisfies $(\prod S_i^{e_i}) \cdot g = \sum q_i \cdot S_i + r$ for some sequences $\{e_i\}$ and $\{q_i\}$. * `MvPolynomial.setPseudo_remainder_eq_zero_of_mem`: The remainder of $p$ by a set $S$ is $0$ if $p \in S$. * `MvPolynomial.List.basicSet_append_lt_of_exists_reducedToSet`: Appending an element which is reduced w.r.t. the basic set of list strictly decreases the order. * `MvPolynomial.List.characteristicSet_isCharacteristicSet`: The computed Characteristic Set $CS$ satisfies the key algebraic property (pseudo-remainder of input polynomials is 0) and the geometric property ( $Zero(PS) \subseteq Zero(CS)$ ). * `MvPolynomial.List.vanishingSet_eq_zeroDecomposition_union`: The zero set of a polynomial system $PS$ can be decomposed into a finite union of "quasi-varieties" defined by triangular sets: $Zero(PS) = \bigcup_{CS \in \mathcal{ZD}} Zero(CS / \text{InitialProd}(CS))$ The PR is upstreamized from [github.com/WuProver/lean_characteristic_set](https://github.com/WuProver/lean_characteristic_set) --- [](https://gitpod.io/from-referrer/) - [x] depends on: #36386 - [ ] depends on: #37791 | t-algebra new-contributor merge-conflict | 3878/0 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/AscendingSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/CharacteristicSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/Initial.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/MainDegree.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/Order.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/PseudoDivision.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/Reduce.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/StandardAscendingSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/TriangularSet.lean,Mathlib/Algebra/MvPolynomial/CharacteristicSet/WeakAscendingSet.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,docs/references.bib | 13 | 20 | ['Hagb', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 8 hours ago | 8 hours ago | 3 days |
| 38797 | YaelDillies | chore(Tactic/Positivity): import `Algebra.Order.Field.Basic` | This is justified by the fact that said file contains some pretty basic positivity extensions that are hard to locate otherwise. From AddCombi --- [](https://gitpod.io/from-referrer/) | t-meta large-import | 1/0 | Mathlib/Tactic/Positivity.lean | 1 | 3 | ['YaelDillies', 'github-actions', 'joneugster'] | nobody | 8 hours ago | 8 hours ago | 11 hours |
| 38608 | bryangingechen | ci(shake.yaml): weekly workflow for running lake shake --fix | Modeled on `rm_set_option.yml` and `nolints.yml`. cf. [#mathlib4 > shake](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/shake/with/591056575) Prepared with Claude code. | LLM-generated CI awaiting-author | 165/0 | .github/workflows/shake.yaml,docs/workflows.md | 2 | 9 | ['bryangingechen', 'github-actions', 'joneugster'] | nobody | 7 hours ago | 8 hours ago | 3 days |
| 28685 | mitchell-horner | feat(Combinatorics/SimpleGraph): prove the minimal-degree version of the Erdős-Stone theorem | Proves the minimal degree-version of the Erdős-Stone theorem: If `G` has a minimal degree of at least `(1 - 1 / r + o(1)) * card V`, then `G` contains a copy of a `completeEquipartiteGraph` in `r + 1` parts each of size `t`. The double-counting construction from the proof is available in `namespace ErdosStone`. --- - [x] depends on: #25843 - [x] depends on: #27597 - [x] depends on: #27599 - [x] depends on: #28443 - [x] depends on: #28445 - [x] depends on: #28446 - [x] depends on: #28447 This is the first of several pull requests towards the full Erdős-Stone(-Simonovits) theorem, hence the name of the file. [](https://gitpod.io/from-referrer/) | t-combinatorics awaiting-author | 330/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/ErdosStoneSimonovits.lean | 2 | 17 | ['YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'mitchell-horner', 'robin-carlier'] | awainverse and b-mehta | 7 hours ago | 7 hours ago | 60 days |
| 37592 | erdOne | feat: set up API for `ConvexSpace` | We introduce `sConvexCombo` and the indexed version `iConvexCombo` as the main API for `ConvexSpace` and prove lemmas around the new definitions. --- [](https://gitpod.io/from-referrer/) | t-algebra large-import | 467/157 | Mathlib/Analysis/Convex/MetricSpace.lean,Mathlib/LinearAlgebra/ConvexSpace.lean,Mathlib/LinearAlgebra/ConvexSpace/AffineSpace.lean | 3 | 80 | ['ADedecker', 'YaelDillies', 'b-mehta', 'bryangingechen', 'erdOne', 'faenuccio', 'github-actions', 'grunweg', 'kbuzzard', 'mathlib-bors', 'ocfnash'] | nobody | 7 hours ago | 1 day ago | 6 days |
| 37714 | mortarsanjaya | feat(Algebra/Order/Floor/Defs): `Nat.cast` is strictly monotone in `FloorSemiring` and `FloorRing` | As title says, and without the `IsOrderedRing` assumption. Other than that, I removed the `IsOrderedRing` assumption from pretty much all the lemmas in `Algebra/Order/Floor/Defs` that could possibly have this assumption removed, and reduced some `IsStrictOrderedRing` assumptions to `IsOrderedRing` + `Nontrivial`. Due to strict monotonicity, we can also provide `CharZero` instance on `FloorSemiring` and `FloorRing`. Thus we can remove the `NeZero` and `Nontrivial` instances on them. The changes on `/Ring` and `/Semiring` are trivial changes due to some lemmas not requiring an `IsOrderedRing` instance anymore. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 96/39 | Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/Computation/TerminatesIffRat.lean,Mathlib/Algebra/Order/Floor/Defs.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Floor/Semiring.lean | 5 | 24 | ['dagurtomas', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mortarsanjaya'] | dagurtomas | 6 hours ago | 6 hours ago | 24 days |
| 38534 | AlexeyMilovanov | refactor(Computability): bundle PFun into a structure with FunLike instance | This PR refactors PFun from def PFun α β := α → Part β to a structure with a FunLike instance. [Discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Fix.20for.20fun_prop.20on.20PFun.20.28context.3A.20Computability.20Theory.29) **Core Architectural Changes** * **Structure Transition:** `PFun` is now a structure with a single field `toFun : α → Part β`. Raw lambdas are now explicitly packed using `PFun.mk` or `PFun.lift`. * **API Alignment:** Added the `FunLike (α →. β) α (Part β)` instance and `initialize_simps_projections`. Replaced direct `funext` usage with `DFunLike.ext`. Added comprehensive `@[simp]` lemmas for the structure (`mk_apply`, `coe_mk`, `toFun_eq_coe`, `lift_apply`). * **New Helpers:** Introduced `PFun.const` and `PFun.empty` to reduce boilerplate. **API & Breaking Changes** * **Loss of Defeq:** `PFun` is no longer definitionally equal to a raw function. Basic lemmas (like `PFun.res_univ`) now require explicit extensionality (`ext x y; rfl`). * **`prodLift_fst_comp_snd_comp`:** Rewrote the LHS using explicit `PFun.mk` wrappers. This Breaking API Change resolves a `simpNF` linter failure caused by the new `comp_lift` simp lemma. * **simpNF Compliance:** Removed `@[simp]` from `coe_val` and changed `mem_lift_iff` to `@[simp↓]` to prevent overlapping rewrite rules with `lift_apply`. **Downstream Impact** The refactor heavily impacts Computability Theory and Category Theory (`Category/PartialFun.lean`). The strict structure boundary breaks definitional equality, meaning tactics like `simp` and `grind` can no longer "see through" the function automatically. As a result, several proofs (e.g., `fix_aux`, `ppred`, `mem_eval`, and `unitIso`) grew in size, requiring explicit `ext` + `simp` breakdowns. **Affected Files:** * **Core:** `Mathlib/Data/PFun.lean` * **Computability:** `Partrec`, `PartrecBasis`, `PartrecCode`, `RE`, `RecursiveIn`, `Ackermann`, `Halting`, `StateTransition`, `TuringDegree`, `TuringMachine/Config` * **Category Theory:** `Category/PartialFun.lean` *(Successfully removed the `respectTransparency false` hack here!)* * **Other:** `Data/Finset/PImage.lean`, `NumberTheory/Dioph.lean` | new-contributor t-computability | 1248/822 | Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/Ackermann.lean,Mathlib/Computability/Halting.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecBasis.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/RE.lean,Mathlib/Computability/RecursiveIn.lean,Mathlib/Computability/StateTransition.lean,Mathlib/Computability/TuringDegree.lean,Mathlib/Computability/TuringMachine/Config.lean,Mathlib/Data/Finset/PImage.lean,Mathlib/Data/PFun.lean,Mathlib/NumberTheory/Dioph.lean | 14 | 3 | ['github-actions', 'mathlib-bors'] | nobody | 6 hours ago | 19 hours ago | 2 days |
| 38713 | justus-springer | feat(Algebra/Category/ModuleCat/Sheaf/ChangeOfRings): API for `restrictScalars` | Extend the `restrictScalars` API for presheaves and sheaves of modules to match the existing API in `ModuleCat/ChangeOfRings`. For both `PresheafOfModules` and `SheafOfModules` we add: - `restrictScalarsCongr`: restriction of scalars along equal morphisms are naturally isomorphic - `restrictScalarsId'/restrictScalarsId`: restriction along the identity is naturally isomorphic to the identity functor - `restrictScalarsComp'/restrictScalarsComp`: restriction along a composition is naturally isomorphic to the composition of restriction functors - `restrictScalarsEquivalenceOfIso`: an isomorphism `R ≅ R'` of (pre)sheaves of rings induces an equivalence of categories of (pre)sheaves of modules. We also move up the "simp barrier": `PresheafOfModules.restrictScalars` and `SheafOfModules.restrictScalars` are no longer `@[simps]` as they have their own API now. --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry t-algebra awaiting-author | 326/5 | Mathlib/Algebra/Category/ModuleCat/Presheaf/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Sheafification.lean,Mathlib/Algebra/Category/ModuleCat/Sheaf/ChangeOfRings.lean | 3 | 6 | ['dagurtomas', 'github-actions', 'justus-springer'] | nobody | 6 hours ago | 22 hours ago | 1 day |
| 38595 | openendings | chore(CategoryTheory): remove defeq abuse in toKleisli/fromKleisli | Currently the toKleisli/fromKleisli functors use defeq abuse to perform deep rewrites equivalent to `Kleisli.of_mk` and `Kleisli.mk_of`. Replacing the `map_comp` proofs lets us remove a couple of backward.isDefEq.respectTransparency lines. --- - I would greatly appreciate advice ([e.g. via Zulip](https://leanprover.zulipchat.com/#user/1060393)) on tackling the remainder of this file: the defeqs mostly appear in morally `simp`/`calc` proofs that look horrid in `refine` style. I can supply more rfl theorems like `of_mk` and `mk_of` (and hope to do so in subsequent PRs), but don't know how to use them for a deep type rewrite. New theorems: ```lean -- variable {C} {T : Monad C} theorem Kleisli.comp {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) : (f ≫ T.η.app Y) ≫ T.map (g ≫ T.η.app Z) ≫ T.μ.app Z ``` - **NOTE:** the Cokleisli half of the file has not been touched (and ought to be prior to approval). [](https://gitpod.io/from-referrer/) | t-category-theory new-contributor help-wanted awaiting-author | 15/14 | Mathlib/CategoryTheory/Monad/Basic.lean,Mathlib/CategoryTheory/Monad/Kleisli.lean | 2 | 11 | ['github-actions', 'joelriou', 'openendings'] | nobody | 6 hours ago | 3 days ago | 1 hour |
| 38785 | scholzhannah | feat: use `alias_in` attribute for CW complexes | Using the `alias_in` attribute for classical CW complexes to get rid of the `export` sections. --- [](https://gitpod.io/from-referrer/) | t-topology | 90/58 | Mathlib/Topology/CWComplex/Classical/Basic.lean,Mathlib/Topology/CWComplex/Classical/Finite.lean,Mathlib/Topology/CWComplex/Classical/Subcomplex.lean | 3 | 3 | ['github-actions', 'grunweg', 'scholzhannah'] | grunweg | 6 hours ago | 1 day ago | 1 day |
| 38126 | JovanGerb | feat: overlapping instances linter | This is a new attempt at the overlapping instances linter, with better performance. One question is where to put the yellow squiggle of the warning message. It is now at the start of the definition value, i.e. the `by` token for typical proofs. This is slightly annoying, because the yellow squiggle is overridden by the red squiggle from "unsolved goals". Another annoyance is the need for `withSetBoolOptionIn`. This is a private declaration in the `unusedInstancesInType` linter, with a link to an unsolved issue. I've marked it public, but maybe it should go to a separate file, depending on how fast we think the issue will be resolved. See #35095 and #34955 for previous iterations of this linter. See #14731 for an old attempt at a weaker form of this linter. Co-authored-by: @thorimur --- - [ ] depends on: #38151 - [ ] depends on: #38150 [](https://gitpod.io/from-referrer/) | t-linter | 689/35 | Mathlib.lean,Mathlib/Algebra/Category/Ring/FilteredColimits.lean,Mathlib/Algebra/Module/DedekindDomain.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Algebra/Order/Invertible.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/Analysis/Convex/StdSimplex.lean,Mathlib/Analysis/Normed/Field/Krasner.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/ConjSqrt.lean,Mathlib/Analysis/SpecificLimits/Normed.lean,Mathlib/CategoryTheory/Localization/Predicate.lean,Mathlib/CategoryTheory/Monoidal/Closed/Cartesian.lean,Mathlib/CategoryTheory/MorphismProperty/OverAdjunction.lean,Mathlib/Control/Applicative.lean,Mathlib/Control/Functor.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/GroupTheory/OreLocalization/Basic.lean,Mathlib/Init.lean,Mathlib/Lean/Elab/InfoTree.lean,Mathlib/LinearAlgebra/BilinearForm/Orthogonal.lean,Mathlib/LinearAlgebra/Eigenspace/Matrix.lean,Mathlib/LinearAlgebra/RootSystem/Finite/G2.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Lemmas.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean,Mathlib/Logic/Basic.lean,Mathlib/MeasureTheory/Measure/Haar/Unique.lean,Mathlib/NumberTheory/ClassNumber/Finite.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/ChainOfDivisors.lean,Mathlib/RingTheory/ClassGroup.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/DedekindDomain/Instances.lean,Mathlib/RingTheory/DedekindDomain/IntegralClosure.lean,Mathlib/RingTheory/DedekindDomain/LinearDisjoint.lean,Mathlib/RingTheory/DiscreteValuationRing/TFAE.lean,Mathlib/RingTheory/FractionalIdeal/Extended.lean,Mathlib/RingTheory/HahnSeries/Lex.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/Ideal/Norm/RelNorm.lean,Mathlib/RingTheory/NormalClosure.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Linter/OverlappingInstances.lean,Mathlib/Tactic/Linter/UnusedInstancesInType.lean,Mathlib/Tactic/NormNum/Ineq.lean,Mathlib/Topology/Algebra/MulAction.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Connected/PathConnected.lean,MathlibTest/OverlappingInstances.lean,MathlibTest/Subsingleton.lean,MathlibTest/Variable.lean,MathlibTest/WhitespaceLinter.lean,MathlibTest/congr.lean | 57 | 67 | ['JovanGerb', 'github-actions', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'thorimur'] | thorimur | 6 hours ago | 5 hours ago | 8 days |
| 37545 | vihdzp | feat(SetTheory): ℵ_ univ = univ | --- [](https://gitpod.io/from-referrer/) | t-set-theory maintainer-merge | 74/4 | Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Regular.lean | 2 | 15 | ['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'mattdiamond', 'plp127', 'vihdzp'] | nobody | 6 hours ago | 10 hours ago | 29 days |
| 34705 | mpenciak | feat(RingTheory): Grassmannian functor | This PR shows that the association `A → G(k, (A ⊗[R] M); A)` for an `R`-algebra `A` and `R`-module `M` forms a functor. (AI disclosure: an early version of this PR was prepared with the help of Claude) --- [](https://gitpod.io/from-referrer/) | t-ring-theory LLM-generated large-import | 138/2 | Mathlib/LinearAlgebra/TensorProduct/Quotient.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean,Mathlib/RingTheory/Grassmannian.lean | 3 | 13 | ['chrisflav', 'github-actions', 'mathlib-merge-conflicts', 'mpenciak', 'riccardobrasca', 'robin-carlier'] | riccardobrasca | 6 hours ago | 28 days ago | 70 days |
| 38790 | Jun2M | feat(Analysis/Normed/Module/Connected): Complement of hyperplane has two components | This PR proves that the complement of a hyperplane decomposes to two components, both wrt `IsConnected` and `IsPathConnected`. Specifically for subspaces, new file is created as they rely on `FiniteDimensional` which clashes with `assert_not_exists Subgroup.index Nat.divisors`. `ZerothHomotopy.equivOfIsClopenOfIsPathConnected` is also proved analogous to `ConnectedComponents.equivOfIsClopenOfIsConnected`. --- [](https://gitpod.io/from-referrer/) | t-topology | 179/2 | Mathlib.lean,Mathlib/Analysis/Normed/Module/Connected.lean,Mathlib/Analysis/Normed/Module/FiniteDimensionConnected.lean,Mathlib/Topology/Connected/PathConnected.lean | 4 | 1 | ['github-actions'] | nobody | 6 hours ago | 6 hours ago | 6 hours |
| 37267 | xroblot | feat(NumberTheory/NumberField/Cyclotomic): cardinality of the subgroup of characters associated to an intermediate field equals its degree | New main result : `card_intermediateFieldEquivSubgroupChar`: the cardinality of the subgroup of Dirichlet characters of level `n` associated to an intermediate field `F` of `ℚ(ζₙ)/ℚ` equals the degree `[F : ℚ]`. --- - [x] depends on: #34571 - [x] depends on: #37108 [](https://gitpod.io/from-referrer/) | t-number-theory delegated | 42/1 | Mathlib/Algebra/Group/Subgroup/Finite.lean,Mathlib/GroupTheory/FiniteAbelian/Duality.lean,Mathlib/NumberTheory/MulChar/Duality.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Galois.lean | 4 | 5 | ['github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'riccardobrasca'] | riccardobrasca | 5 hours ago | 5 hours ago | 9 days |
| 38784 | justus-springer | feat(Algebra/Algebra/RestrictScalars): Generalize `RestrictScalars` | Generalize `RestrictScalars` to allow restricting along a ring morphism `f : R →+* S` where `R` is not necessaritly commutative. This is a step towards resolving defeq abuses between `(restrictScalars f).obj M` and `M` for `M : ModuleCat R`, mentioned in the file `ModuleCat/ChangeOfRings.lean`. --- [](https://gitpod.io/from-referrer/) | WIP | 240/149 | Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Lie/BaseChange.lean,Mathlib/Analysis/Normed/Module/Basic.lean | 4 | 2 | ['eric-wieser', 'github-actions'] | nobody | 5 hours ago | 1 day ago | 7 seconds |
| 38774 | yuanyi-350 | chore(NumberTheory/Padics/Complex): remove an erw | - rewrites `norm_eq_norm'` to expand `Valuation.restrict_def`, `embedding_restrict₀`, and `PadicAlgCl.valuation_coe` inside `simp only` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-number-theory LLM-generated tech debt maintainer-merge | 2/3 | Mathlib/NumberTheory/Padics/Complex.lean | 1 | 4 | ['github-actions', 'loefflerd', 'riccardobrasca'] | MichaelStollBayreuth | 5 hours ago | 1 day ago | 1 day |
| 38750 | openendings | feat(Data/Nat): add padicValNat_add_eq_min | Add lemmas for `padicValNat` mirroring the [e]multiplicity API, including - padicValNat_eq_of_dvd_of_not_dvd - padicValNat_add_of_gt - padicValNat_add_eq_min --- [](https://gitpod.io/from-referrer/) | t-data new-contributor | 37/0 | Mathlib/Data/Nat/MaxPowDiv.lean | 1 | 2 | ['github-actions'] | nobody | 5 hours ago | 1 day ago | 1 day |
| 37307 | vihdzp | feat: a lot of results on `DirSupClosed` | This is just a work branch; I'll split off a bunch of PRs from this. --- [](https://gitpod.io/from-referrer/) | t-topology t-order | 141/6 | Mathlib/Order/DirSupClosed.lean,Mathlib/Order/Directed.lean,Mathlib/Topology/Order/ScottTopology.lean | 3 | 5 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 5 hours ago | unknown | 0 seconds |
| 37944 | YaelDillies | refactor(Algebra): replace `SemilinearEquivClass.semilinearEquiv` by structure-specific coercions | Remove the coercion from `E` to `SemilinearEquiv` assuming `SemilinearEquivClass E` and given by `SemilinearEquivClass.semilinearEquiv`. For each concrete type, reimplement this coercion through the relevant structure projection. --- - [ ] depends on: #38715 See also #21031, #37827. [](https://gitpod.io/from-referrer/) | t-algebra awaiting-CI blocked-by-other-PR | 33/38 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Manifold.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/LinearAlgebra/SymmetricAlgebra/Basic.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/RingTheory/Coalgebra/Equiv.lean,Mathlib/Topology/Algebra/Module/ClosedSubmodule.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean | 11 | 14 | ['Vierkantor', 'YaelDillies', 'github-actions', 'grunweg', 'mathlib-dependent-issues', 'themathqueen'] | nobody | 5 hours ago | 18 days ago | 1 hour |
| 37677 | vihdzp | feat: club sets | In set theory, a club set is a subset of an ordinal of uncountable cofinality, which is closed in the order topology, and unbounded within the ordinal. We generalize this notion to that of a club set in a well-order `α`: this is a set which is cofinal and closed under suprema. We recover the more standard notion by setting `α = Iio o`, whenever `ℵ₀ < o.cof`. We prove that club sets are closed under intersections of size less than the cofinality of `α`, and that the fixed points of a normal function are a club set. --- The idea is to eventually rework [`Ordinal.deriv`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/SetTheory/Ordinal/FixedPoint.html#Ordinal.deriv). This is simply the enumerator function for the fixed points of `f`, and enumerator functions for club sets are always normal. - [x] depends on: #37670 [](https://gitpod.io/from-referrer/) | t-set-theory t-order | 158/0 | Mathlib.lean,Mathlib/Order/IsNormal.lean,Mathlib/SetTheory/Cardinal/Club.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean | 4 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'staroperator', 'vihdzp'] | nobody | 5 hours ago | 5 hours ago | 9 days |
| 38694 | bryangingechen | experiment: running shake --fix again on top of #38691 results in more changes | I thought `shake --fix` would be idempotent but I ran `lake shake --add-public --keep-implied --keep-prefix --fix` again on top of commit https://github.com/leanprover-community/mathlib4/pull/38694/commits/4bb39b3ee338c910761d0c76514933ec38a41a29 from #38691 and imports were changed again. See 8dcfa7aea0c474a04bc47060fc82590c3c95d6e6 --- [](https://gitpod.io/from-referrer/) | large-import | 222915/297 | Mathlib/Algebra/Algebra/Unitization.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Group/List/Basic.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/Category/MonCat/Colimits.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/Algebra/Category/Ring/Topology.lean,Mathlib/Algebra/Free.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Int/Even.lean,Mathlib/Algebra/Group/Nat/Even.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/Algebra/Group/Submonoid/Support.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/Map.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/MapBijective.lean,Mathlib/Algebra/Homology/HomologicalComplexAbelian.lean,Mathlib/Algebra/Homology/ModelCategory/Lifting.lean,Mathlib/Algebra/LinearRecurrence.lean,Mathlib/Algebra/Module/Injective.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/Algebra/Module/Submodule/Invariant.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MvPolynomial/Cardinal.lean,Mathlib/Algebra/MvPolynomial/Division.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Funext.lean,Mathlib/Algebra/MvPolynomial/Nilpotent.lean,Mathlib/Algebra/Order/Archimedean/Class.lean,Mathlib/Algebra/Order/Archimedean/Submonoid.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Group/Indicator.lean,Mathlib/Algebra/Order/Ring/Archimedean.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Algebra/Polynomial/Eval/Coeff.lean,Mathlib/Algebra/Regular/Defs.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/Morphisms/Finite.lean,Mathlib/AlgebraicGeometry/Morphisms/SchemeTheoreticallyDominant.lean,Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean,Mathlib/AlgebraicGeometry/Morphisms/WeaklyEtale.lean,Mathlib/AlgebraicGeometry/Noetherian.lean,Mathlib/AlgebraicTopology/SimplicialCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplicialComplex/Basic.lean,Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/AlgebraicTopology/SimplicialSet/Monoidal.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplices.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplicesSubcomplex.lean,Mathlib/Analysis/Asymptotics/Lemmas.lean,Mathlib/Analysis/Asymptotics/TVS.lean,Mathlib/Analysis/CStarAlgebra/Projection.lean,Mathlib/Analysis/Calculus/DerivativeTest.lean,Mathlib/Analysis/Calculus/FDeriv/Affine.lean,Mathlib/Analysis/Calculus/LogDeriv.lean,Mathlib/Analysis/Complex/CanonicalDecomposition.lean,Mathlib/Analysis/Complex/Harmonic/Liouville.lean,Mathlib/Analysis/Complex/Harmonic/Poisson.lean,Mathlib/Analysis/Complex/JensenFormula.lean,Mathlib/Analysis/Complex/Schwarz.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Manifold.lean,Mathlib/Analysis/Complex/UpperHalfPlane/ProperAction.lean,Mathlib/Analysis/ConstantSpeed.lean,Mathlib/Analysis/Convex/Approximation.lean,Mathlib/Analysis/Convex/FunctionTopology.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/Positive.lean,Mathlib/Analysis/Normed/Module/Bases.lean,Mathlib/Analysis/Normed/Module/DoubleDual.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/ODE/DiscreteGronwall.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/RingInverseOrder.lean,Mathlib/Analysis/SpecialFunctions/Stirling.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/ChebyshevGauss.lean,Mathlib/CategoryTheory/Abelian/Preradical/Colon.lean,Mathlib/CategoryTheory/Adhesive/Subobject.lean,Mathlib/CategoryTheory/CopyDiscardCategory/Widesubcategory.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Jointly.lean,Mathlib/CategoryTheory/Limits/Constructions/WidePullbackOfTerminal.lean,Mathlib/CategoryTheory/Limits/FunctorCategory/Shapes/Terminal.lean,Mathlib/CategoryTheory/Limits/Preserves/SigmaConst.lean,Mathlib/CategoryTheory/Limits/Preserves/Yoneda.lean,Mathlib/CategoryTheory/Limits/Yoneda.lean,Mathlib/CategoryTheory/Monad/Types.lean,Mathlib/CategoryTheory/Monoidal/Internal/Limits.lean,Mathlib/CategoryTheory/Monoidal/Widesubcategory.lean,Mathlib/CategoryTheory/MorphismProperty/CommaSites.lean,Mathlib/CategoryTheory/MorphismProperty/OfObjectProperty.lean,Mathlib/CategoryTheory/Shift/Adjunction.lean,Mathlib/CategoryTheory/Sites/Continuous.lean,Mathlib/CategoryTheory/Sites/Descent/Precoverage.lean,Mathlib/CategoryTheory/Sites/Hypercover/One.lean,Mathlib/CategoryTheory/Sites/Hypercover/Saturate.lean,Mathlib/CategoryTheory/Sites/Over.lean,Mathlib/CategoryTheory/Sites/Point/OfIsCofiltered.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean | 360 | 2 | ['bryangingechen', 'github-actions'] | nobody | 5 hours ago | unknown | 0 seconds |
| 38777 | JJYYY-JJY | chore(Algebra/Group/Action): improve defeqs for composed scalar actions | This PR changes composed scalar-action constructors so that they carry the underlying `SMul.comp` action explicitly. This lets scalar action goals reduce through the generic composed-action layer instead of relying on ad hoc lemmas for stronger bundled structures. The original version of this PR added `Module.compHom_smul_def`. Review pointed out that the right fix is lower-level: `Module.compHom` should use the same `SMul.comp` structure as the weaker constructors underneath it. With that constructor shape fixed, the module-specific lemma is no longer needed. Main changes: - add the generic lemma `SMul.comp_smul_def`; - make the lower composed-action constructors expose the explicit `SMul.comp` field; - update `Module.compHom` to use the generic composed scalar action directly; - repair downstream elaboration/proof robustness fallout caused by the changed definitional shape. The downstream edits are intended to be proof-maintenance only: mostly explicit type annotations, explicit continuous-linear-map targets, or small rewrites where elaboration no longer infers the same scalar action automatically. No mathematical statement is intended to change. Verification: - `lake build` - `lake exe runLinter Mathlib.Analysis.Distribution.SchwartzSpace.Basic Mathlib.Analysis.Distribution.SchwartzSpace.Fourier Mathlib.Analysis.Fourier.Convolution` - `git diff --check HEAD~1..HEAD` | t-algebra new-contributor | 301/89 | Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Finite.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/End.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean,Mathlib/Analysis/Fourier/Convolution.lean,Mathlib/Analysis/Fourier/FourierTransform.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Normed/Operator/Basic.lean,Mathlib/RepresentationTheory/Rep/Basic.lean,Mathlib/RingTheory/Extension/Basic.lean | 17 | 11 | ['JJYYY-JJY', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions'] | nobody | 5 hours ago | 1 day ago | 1 day |
| 38807 | vihdzp | feat: `DirSupClosedOn` is preserved under union | --- [](https://gitpod.io/from-referrer/) | t-order | 81/0 | Mathlib/Order/DirSupClosed.lean | 1 | 1 | ['github-actions'] | nobody | 5 hours ago | 5 hours ago | 5 hours |
| 38800 | TJHeeringa | feat(Analysis/InnerProductSpace/Basic): Add InnerProductSpace.induced | --- There are many instances with a `.induced`. The `InnerProductSpace` didn't have one yet. There are two different versions here. If the map `f : H` is injective, we get an inner product space. If `f: H` is not injective, we only get a semi-inner product space. The letter `E` is used in the file for the complex inner product spaces. `F` is used for real inner product spaces, so we skipped that one and used the next two letters instead, i.e. `G` and `H`. The injective proof has `(_ : Function.Injective f)`. This is because using `(hf : Function.Injective f)` gave `Unused argument` errors. AI usage: I gave Claude `NormedAddCommGroup.induced` and ask it to produce the version with `f` injective. The only lines kept from its answer is the `@InnerProductSpace` line of the proposition and the `inner`, `add_left` and `smul_left` (after properly ordering the arguments) of the proof. [](https://gitpod.io/from-referrer/) | t-analysis new-contributor | 16/0 | Mathlib/Analysis/InnerProductSpace/Basic.lean | 1 | 17 | ['TJHeeringa', 'github-actions', 'themathqueen'] | nobody | 5 hours ago | 8 hours ago | 9 hours |
| 37968 | yuanyi-350 | refactor(Analysis): golf 100 files | This PR is an experimental project. In this PR, we use an Agent to automatically scan and attempt to simplify proofs. We hope to eventually effectively golf 100 files and avoid reinventing the wheel in mathlib. We have chosen `Mathlib/Analysis` as the testing ground. If this experiment is very successful and accepted by the mathlib community, we would be honored to open source it. The relevant projects includes - [ ] #38104, which golfs `Mathlib/MeasureTheory`. - [ ] #38144, which golfs `Mathlib/NumberTheory`. This PR serves as an index. For the actual code review, please refer to the individual PRs linked below. Each of those PRs modifies only a single file to facilitate the review process. - [ ] depends on: #37555 - [ ] depends on: #37731 - [ ] depends on: #37737 - [ ] depends on: #37754 - [ ] depends on: #37785 - [ ] depends on: #37788 - [ ] depends on: #37821 - [ ] depends on: #37876 - [ ] depends on: #37981 - [ ] depends on: #37987 - [ ] depends on: #37989 - [ ] depends on: #37991 - [ ] depends on: #38006 - [ ] depends on: #38010 - [ ] depends on: #38272 - [ ] depends on: #38273 - [ ] depends on: #38274 - [ ] depends on: #38352 - [ ] depends on: #38404 - [ ] depends on: #38435 - [ ] depends on: #38436 - [ ] depends on: #38437 - [ ] depends on: #38493 - [ ] depends on: #38513 - [ ] depends on: #38638 - [ ] depends on: #38646 --- [](https://gitpod.io/from-referrer/) | codex WIP t-analysis LLM-generated large-import blocked-by-other-PR | 451/991 | Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/CPolynomialDef.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Analytic/ConvergenceRadius.lean,Mathlib/Analysis/Analytic/Order.lean,Mathlib/Analysis/Analytic/Within.lean,Mathlib/Analysis/AperiodicOrder/Delone/Basic.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Defs.lean,Mathlib/Analysis/Asymptotics/ExpGrowth.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unique.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Complex/CauchyIntegral.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/Isometry.lean,Mathlib/Analysis/Complex/OperatorNorm.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/Analysis/Complex/ValueDistribution/CharacteristicFunction.lean,Mathlib/Analysis/Complex/ValueDistribution/LogCounting/Asymptotic.lean,Mathlib/Analysis/Complex/ValueDistribution/LogCounting/Basic.lean,Mathlib/Analysis/ConstantSpeed.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Between.lean,Mathlib/Analysis/Convex/BetweenList.lean,Mathlib/Analysis/Convex/Birkhoff.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Cone/Extension.lean,Mathlib/Analysis/Convex/Continuous.lean,Mathlib/Analysis/InnerProductSpace/LinearPMap.lean,Mathlib/Analysis/Normed/Lp/SmoothApprox.lean,Mathlib/Analysis/Normed/Lp/WithLp.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Analysis/Normed/Module/ContinuousInverse.lean,Mathlib/Analysis/Normed/Module/Convex.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/Analysis/Normed/Module/MStructure.lean,Mathlib/Analysis/Normed/Module/MultipliableUniformlyOn.lean,Mathlib/Analysis/Normed/Module/RieszLemma.lean,Mathlib/Analysis/Normed/Operator/Bilinear.lean,Mathlib/Analysis/Normed/Operator/BoundedLinearMaps.lean,Mathlib/Analysis/Normed/Operator/ContinuousLinearMap.lean,Mathlib/Analysis/Normed/Operator/Extend.lean,Mathlib/Analysis/Normed/Operator/LinearIsometry.lean,Mathlib/Analysis/Normed/Operator/Mul.lean,Mathlib/Analysis/Normed/Operator/NNNorm.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/Normed/Ring/Lemmas.lean,Mathlib/Analysis/Normed/Unbundled/AlgebraNorm.lean,Mathlib/Analysis/Normed/Unbundled/FiniteExtension.lean,Mathlib/Analysis/Normed/Unbundled/SeminormFromBounded.lean,Mathlib/Analysis/Normed/Unbundled/SeminormFromConst.lean,Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/Analysis/ODE/Transform.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/IntegralRepresentation.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean,Mathlib/Analysis/SpecialFunctions/Gamma/BohrMollerup.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/FourierTransform.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean,Mathlib/Analysis/SpecialFunctions/Gaussian/PoissonSummation.lean,Mathlib/Analysis/SpecialFunctions/Log/ENNRealLog.lean,Mathlib/Analysis/SpecialFunctions/Log/PosLog.lean,Mathlib/Analysis/SpecialFunctions/Log/RpowTendsto.lean,Mathlib/Analysis/SpecialFunctions/MulExpNegMulSqIntegral.lean,Mathlib/Analysis/SpecialFunctions/Pow/Continuity.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean | 76 | 23 | ['CoolRmal', 'Parcly-Taxel', 'euprunin', 'github-actions', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'themathqueen', 'yuanyi-350'] | nobody | 5 hours ago | 18 days ago | 26 seconds |
| 35868 | Raph-DG | feat(Topology): add variant of the sheaf condition which assumes non triviality of the cover | In this PR we add in a variant of the sheaf condition which assumes the cover present in the sheaf condition is nontrivial in the sense that the indexing type is nonempty and the values of the presheaf on each element of the cover are nonempty. --- [](https://gitpod.io/from-referrer/) | t-topology | 54/0 | Mathlib/Topology/Sheaves/SheafCondition/UniqueGluing.lean | 1 | 5 | ['Raph-DG', 'chrisflav', 'github-actions'] | PatrickMassot | 5 hours ago | 10 hours ago | 6 days |
| 38710 | FLDutchmann | fix(Tactic/Algebra): compatibility with module system | `algebra` does not work in any files using the module system because the lemmas used are not imported publicly. This issue was not caught because the test file did not use the module system. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-author | 4/2 | Mathlib/Tactic/Algebra/Basic.lean,MathlibTest/Algebra.lean | 2 | 4 | ['JovanGerb', 'bryangingechen', 'github-actions', 'joneugster'] | JovanGerb | 4 hours ago | 5 hours ago | 2 days |
| 38671 | dagurtomas | chore(CategoryTheory): start using `mk_concrete_cat` | --- - [ ] depends on: #38587 [](https://gitpod.io/from-referrer/) | WIP LLM-generated blocked-by-other-PR | 1134/1804 | Mathlib.lean,Mathlib/Algebra/Category/AlgCat/Basic.lean,Mathlib/Algebra/Category/BoolRing.lean,Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/Algebra/Category/CommBialgCat.lean,Mathlib/Algebra/Category/Grp/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Semi.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Basic.lean,Mathlib/Algebra/Category/MonCat/Basic.lean,Mathlib/Algebra/Category/Ring/Basic.lean,Mathlib/Algebra/Category/Semigrp/Basic.lean,Mathlib/AlgebraicGeometry/AffineSpace.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Subscheme.lean,Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean,Mathlib/Analysis/Normed/Group/SemiNormedGrp.lean,Mathlib/Condensed/Light/Sequence.lean,Mathlib/Order/Category/BddDistLat.lean,Mathlib/Order/Category/BddLat.lean,Mathlib/Order/Category/BddOrd.lean,Mathlib/Order/Category/BoolAlg.lean,Mathlib/Order/Category/DistLat.lean,Mathlib/Order/Category/FinBddDistLat.lean,Mathlib/Order/Category/Frm.lean,Mathlib/Order/Category/HeytAlg.lean,Mathlib/Order/Category/Lat.lean,Mathlib/Order/Category/LinOrd.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/Category/PartOrdEmb.lean,Mathlib/Order/Category/Preord.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/Functoriality.lean,Mathlib/RepresentationTheory/Rep/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/MkConcreteCategory.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean,Mathlib/Topology/Category/TopCat/Basic.lean,Mathlib/Topology/Category/UniformSpace.lean,Mathlib/Topology/Sheaves/LocalPredicate.lean,MathlibTest/CategoryTheory/MkConcreteCategory.lean | 40 | 4 | ['dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 hours ago | 2 days ago | 1 second |
| 38472 | Raph-DG | feat(AlgebraicGeometry): The princpal Weil divisor associated to an element of the function field on a locally Noetherian integral scheme | In this PR we define and provide some basic API for the principal Weil divisor associated to an element of the function field of a locally noetherian, integral scheme. - [ ] depends on: #29774 - [ ] depends on: #37985 - [ ] depends on: #37901 - [ ] depends on: #38002 --- [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR | 740/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/AlgebraicCycle/Basic.lean,Mathlib/AlgebraicGeometry/AlgebraicCycle/Principal.lean,Mathlib/AlgebraicGeometry/FunctionField.lean,Mathlib/AlgebraicGeometry/OrderOfVanishing.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/Minimal.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/LocallyFinsupp/Pushforward.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Sober.lean | 12 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 hours ago | 7 days ago | 19 minutes |
| 38415 | yuanyi-350 | chore: kill some `erw`s | - [ ] depends on: #38418 - [ ] depends on: #38417 - [ ] depends on: #38501 - [ ] depends on: #38502 - [ ] depends on: #38503 - [ ] depends on: #38504 - [ ] depends on: #38505 - [ ] depends on: #38506 - [ ] depends on: #38508 - [ ] depends on: #38514 - [ ] depends on: #38515 - [ ] depends on: #38516 - [ ] depends on: #38517 - [ ] depends on: #38518 - [ ] depends on: #38519 - [ ] depends on: #38520 - [ ] depends on: #38521 - [ ] depends on: #38522 - [ ] depends on: #38644 - [ ] depends on: #38645 - [ ] depends on: #38675 - [ ] depends on: #38676 - [ ] depends on: #38677 - [ ] depends on: #38678 - [ ] depends on: #38679 - [ ] depends on: #38680 - [ ] depends on: #38681 - [ ] depends on: #38682 - [ ] depends on: #38683 - [ ] depends on: #38684 - [ ] depends on: #38685 - [ ] depends on: #38686 - [ ] depends on: #38687 - [ ] depends on: #38688 - [ ] depends on: #38689 - [ ] depends on: #38690 - [ ] depends on: #38724 - [ ] depends on: #38725 - [ ] depends on: #38726 - [ ] depends on: #38727 - [ ] depends on: #38728 - [ ] depends on: #38734 - [ ] depends on: #38735 - [ ] depends on: #38736 - [ ] depends on: #38737 - [ ] depends on: #38738 - [ ] depends on: #38761 - [ ] depends on: #38762 - [ ] depends on: #38763 - [ ] depends on: #38764 - [ ] depends on: #38765 - [ ] depends on: #38766 - [ ] depends on: #38767 - [ ] depends on: #38768 - [ ] depends on: #38769 - [ ] depends on: #38770 - [ ] depends on: #38771 - [ ] depends on: #38772 - [ ] depends on: #38773 - [ ] depends on: #38774 --- [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 95/139 | Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Lie/Classical.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Point.lean,Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean,Mathlib/AlgebraicGeometry/Restrict.lean,Mathlib/AlgebraicGeometry/Stalk.lean,Mathlib/AlgebraicTopology/DoldKan/GammaCompN.lean,Mathlib/AlgebraicTopology/DoldKan/Homotopies.lean,Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/CategoryTheory/GlueData.lean,Mathlib/Condensed/Light/Epi.lean,Mathlib/Geometry/Euclidean/Sphere/Basic.lean,Mathlib/GroupTheory/FreeGroup/NielsenSchreier.lean,Mathlib/GroupTheory/HNNExtension.lean,Mathlib/GroupTheory/PushoutI.lean,Mathlib/LinearAlgebra/AffineSpace/Combination.lean,Mathlib/LinearAlgebra/CliffordAlgebra/EvenEquiv.lean,Mathlib/LinearAlgebra/Dimension/ErdosKaplansky.lean,Mathlib/LinearAlgebra/Eigenspace/Basic.lean,Mathlib/LinearAlgebra/FreeModule/Int.lean,Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean,Mathlib/MeasureTheory/Measure/Haar/Quotient.lean,Mathlib/NumberTheory/Padics/Complex.lean,Mathlib/Topology/Homotopy/Product.lean,Mathlib/Topology/Sheaves/SheafCondition/PairwiseIntersections.lean | 30 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 hours ago | 6 days ago | 1 day |
| 38758 | TBUGTB | feat(LinearAlgebra/ConvexSpace): StdSimplex bind operation | Define the monadic bind operation for StdSimplex and add basic API lemmas. This operation is needed for formalising the Komlós lemma used in the construction of Stochastic Integrals (cf. [this PR](https://github.com/RemyDegenne/brownian-motion/pull/399) in the brownian-motion project). | t-algebra new-contributor brownian ready-to-merge | 40/0 | Mathlib/LinearAlgebra/ConvexSpace.lean | 1 | 17 | ['EtienneC30', 'RemyDegenne', 'TBUGTB', 'YaelDillies', 'github-actions', 'mathlib-bors'] | nobody | 4 hours ago | 4 hours ago | 1 day |
| 36541 | BGuillemet | feat(CategoryTheory): define internal equivalence relations | Define internal equivalence relations in any category `C`, as a structure on parallel pairs of morphisms. Prove that equivalence relations on types are equivalence relations in the category of types. Prove that kernel pairs are equivalence relations. Define (universally) effective equivalence relations, and a associated class for categories in which every equivalence relation is effective universal. Prove that an effective equivalence relation yields a coequalizer diagram, and that the associated projection on the "quotient" of the relation is a regular epimorphism. --- [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author | 288/0 | Mathlib.lean,Mathlib/CategoryTheory/EquivalenceRelation.lean,Mathlib/CategoryTheory/Limits/Shapes/RegularMono.lean | 3 | 22 | ['BGuillemet', 'dagurtomas', 'github-actions', 'robin-carlier'] | b-mehta | 4 hours ago | 8 hours ago | 21 days |
| 38715 | smmercuri | refactor(Algebra): replace `AlgHomClass` coercions with structure-specific coercions | This PR removes the coercion from `F` to `AlgHom` via `AlgHomClass F R A B` in favour of type-specific projections --- See also #37827 [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 133/100 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Category/CommBialgCat.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/Star/StarAlgHom.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/AlgebraicGeometry/AffineSpace.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/FieldTheory/Extension.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/FieldTheory/LinearDisjoint.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean,Mathlib/NumberTheory/Cyclotomic/Gal.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/RingTheory/Algebraic/MvPolynomial.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Extension/Presentation/Basic.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/RingTheory/FinitePresentation.lean,Mathlib/RingTheory/GradedAlgebra/AlgHom.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/FundamentalTheorem.lean,Mathlib/RingTheory/NoetherNormalization.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Factorization.lean,Mathlib/RingTheory/Smooth/Basic.lean,Mathlib/RingTheory/Smooth/Pi.lean,Mathlib/RingTheory/Spectrum/Prime/Homeomorph.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 39 | 10 | ['YaelDillies', 'github-actions', 'leanprover-radar', 'smmercuri'] | YaelDillies | 4 hours ago | 5 hours ago | 23 hours |
| 34015 | erdOne | feat(AlgebraicGeometry): category of schemes affine over a base | --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry maintainer-merge | 522/11 | Mathlib.lean,Mathlib/AlgebraicGeometry/AffineOver.lean,Mathlib/AlgebraicGeometry/Limits.lean,Mathlib/AlgebraicGeometry/Morphisms/Affine.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/AlgebraicGeometry/RelativeGluing.lean,Mathlib/AlgebraicGeometry/Sites/SmallAffineZariski.lean,Mathlib/CategoryTheory/Sites/Hypercover/Subcanonical.lean | 8 | 50 | ['chrisflav', 'dagurtomas', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | chrisflav | 4 hours ago | 1 day ago | 31 days |
| 38144 | yuanyi-350 | refactor(NumberTheory): Golf 100 files | This PR is an experimental project. In this PR, we use an Agent to automatically scan and attempt to simplify proofs. We hope to eventually effectively golf 100 files and avoid reinventing the wheel in mathlib. We have chosen `Mathlib/NumberTheory` as the testing ground. If this experiment is very successful and accepted by the mathlib community, we would be honored to open source it. The relevant projects includes - [ ] #38104, which golfs `Mathlib/MeasureTheory`. - [ ] #37968, which golfs `Mathlib/Analysis`. This PR serves as an index. For the actual code review, please refer to the individual PRs linked below. Each of those PRs modifies only a single file to facilitate the review process. - [ ] depends on: #38204 - [ ] depends on: #38277 - [ ] depends on: #38278 - [ ] depends on: #38279 - [ ] depends on: #38280 - [ ] depends on: #38351 - [ ] depends on: #38402 - [ ] depends on: #38403 - [ ] depends on: #38454 - [ ] depends on: #38457 - [ ] depends on: #38494 - [ ] depends on: #38495 --- [](https://gitpod.io/from-referrer/) | t-number-theory large-import codex LLM-generated | 135/328 | Mathlib/NumberTheory/ArithmeticFunction/Defs.lean,Mathlib/NumberTheory/BernoulliPolynomials.lean,Mathlib/NumberTheory/Cyclotomic/PrimitiveRoots.lean,Mathlib/NumberTheory/DiophantineApproximation/Basic.lean,Mathlib/NumberTheory/Divisors.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean,Mathlib/NumberTheory/EulerProduct/Basic.lean,Mathlib/NumberTheory/FLT/Four.lean,Mathlib/NumberTheory/FLT/Polynomial.lean,Mathlib/NumberTheory/FrobeniusNumber.lean,Mathlib/NumberTheory/GaussSum.lean,Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean,Mathlib/NumberTheory/ModularForms/Derivative.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/MDifferentiable.lean,Mathlib/NumberTheory/ModularForms/SlashActions.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/Basic.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean,Mathlib/NumberTheory/Pell.lean,Mathlib/NumberTheory/PrimeCounting.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/SmoothNumbers.lean,Mathlib/NumberTheory/Zsqrtd/GaussianInt.lean | 23 | 8 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tb65536', 'yuanyi-350'] | nobody | 4 hours ago | 4 hours ago | 7 hours |
| 26304 | Raph-DG | feat(AlgebraicGeometry): Pushforward of algebraic cycles | In this PR we define a notion of the "pushfoward of functions with locally finite support". We give this PR the suggestive title "pushforward of algebraic cycles" because we will go on to model algebraic cycles on a scheme X as functions from X to the integers with locally finite support. - [x] depends on: #26225 - [x] depends on: #26259 - [x] depends on: #35807 --- [](https://gitpod.io/from-referrer/) | t-algebraic-geometry awaiting-author | 131/0 | Mathlib.lean,Mathlib/Topology/LocallyFinsupp/Pushforward.lean | 2 | 29 | ['Raph-DG', 'chrisflav', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | joelriou | 4 hours ago | 4 hours ago | 24 days |
| 38413 | yuanyi-350 | doc(CategoryTheory): fix typos | In this PR, we used a Codex agent to scan the `CategoryTheory` directory to check for typos in the docstrings. We picked out some of the more obvious errors to fix in this PR. Depends on #38441 Co-authored-by: @LehengChen --- [](https://gitpod.io/from-referrer/) | LLM-generated codex documentation t-category-theory WIP | 35/34 | Mathlib/CategoryTheory/Abelian/GrothendieckCategory/EnoughInjectives.lean,Mathlib/CategoryTheory/Abelian/GrothendieckCategory/Subobject.lean,Mathlib/CategoryTheory/Abelian/Injective/Basic.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/Action/Continuous.lean,Mathlib/CategoryTheory/Adjunction/AdjointFunctorTheorems.lean,Mathlib/CategoryTheory/Adjunction/Triple.lean,Mathlib/CategoryTheory/Center/Localization.lean,Mathlib/CategoryTheory/FiberedCategory/Fiber.lean,Mathlib/CategoryTheory/Functor/Const.lean,Mathlib/CategoryTheory/Functor/Derived/RightDerived.lean,Mathlib/CategoryTheory/Functor/KanExtension/Pointwise.lean,Mathlib/CategoryTheory/Functor/OfSequence.lean,Mathlib/CategoryTheory/Functor/Trifunctor.lean,Mathlib/CategoryTheory/GradedObject/Bifunctor.lean,Mathlib/CategoryTheory/Groupoid/Basic.lean,Mathlib/CategoryTheory/IsomorphismClasses.lean,Mathlib/CategoryTheory/Join/Final.lean,Mathlib/CategoryTheory/Limits/ExactFunctor.lean,Mathlib/CategoryTheory/Limits/Filtered.lean,Mathlib/CategoryTheory/Limits/Opposites.lean,Mathlib/CategoryTheory/Limits/Preserves/Shapes/Images.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Iso.lean,Mathlib/CategoryTheory/Limits/Shapes/StrictInitial.lean,Mathlib/CategoryTheory/Limits/SmallComplete.lean,Mathlib/CategoryTheory/Limits/Types/Yoneda.lean,Mathlib/CategoryTheory/Localization/DerivabilityStructure/Basic.lean,Mathlib/CategoryTheory/Localization/SmallShiftedHom.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Over.lean,Mathlib/CategoryTheory/Monoidal/Action/End.lean,Mathlib/CategoryTheory/Monoidal/Braided/Multifunctor.lean | 32 | 3 | ['github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] | nobody | 4 hours ago | 8 days ago | 36 minutes |
| 38761 | yuanyi-350 | chore(AlgebraicGeometry/EllipticCurve/Jacobian/Point): remove erws | - rewrites `neg_of_Z_ne_zero` with a `simp only` chain in place of the former `erw` - rewrites `addXYZ_neg` by splitting the vector equality into coordinate goals handled by `rw` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebraic-geometry LLM-generated | 5/3 | Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean | 1 | 5 | ['dagurtomas', 'github-actions', 'yuanyi-350'] | nobody | 4 hours ago | 19 hours ago | 1 day |
| 37492 | xgenereux | feat(Torsion/PrimaryComponent): restricted surjective map on primaryComponent is surjective | Given a surjective linear map between modules ` φ : M₁ →ₗ[A] M₂`, its restriction to primary components ``` primaryComponent.map P.asIdeal φ : ↥(primaryComponent M₁ P.asIdeal) →ₗ[A] ↥(primaryComponent M₂ P.asIdeal) ``` is also surjective when `P` is a non zero prime ideal in a Dedekind domain `A` and `M₁` and `M₂` are torsion. Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)> --- - [ ] depends on: #37466 [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 42/0 | Mathlib/Algebra/Module/Torsion/PrimaryComponent.lean | 1 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'ocfnash'] | nobody | 4 hours ago | 4 hours ago | 1 day |
| 38794 | YaelDillies | feat(Algebra/Order): strict monotonicity of `expect` | From AddCombi --- [](https://gitpod.io/from-referrer/) | t-algebra maintainer-merge | 10/5 | Mathlib/Algebra/Order/BigOperators/Expect.lean | 1 | 4 | ['YaelDillies', 'b-mehta', 'github-actions', 'grunweg'] | nobody | 4 hours ago | 12 hours ago | 12 hours |
| 38318 | JovanGerb | feat(GRewrite): new `grw` implementation | This PR adds a new implementation of the `grewrite` tactic. It replaces `grw` with the new implementation, and adds `grw'`/`grw +useKAbstract` for the old implementation. New features: - The new `grw` can rewrite terms with bound variables. - The new `grw` will only rewrite in places where this is valid. Previously, if there were both valid and non-valid positions, it would try rewriting everywhere and then complain. Future features that will build on the new implementation: - I'd like to add support for strict rewrites that can change the strictness of parts of the goal. This would require the concept of asymmetric `gcongr` lemmas, something like `le_imp_lt_of_lt_left` and `le_imp_lt_of_lt_right`. An example of such a lemma that already exists in mathlib is `Ico_subset_Ioo_left`. - I'd like to improve the support for rewriting with symmetric relations such as `=ᵥ`. The following doesn't work very well yet: ``` variable {R : Type*} [CommRing R] [ValuativeRel R] {x y z : R} example (h : x =ᵥ y) : x <ᵥ z ↔ y <ᵥ z := by grw [h] ``` Limitations: - The new implementation does not support occurrences. So, `nth_grw` still uses the old `kabstract`-based implementation. The reason is that there are often multiple `gcongr` lemmas for rewriting in the same place (e.g. `add_le_add` and `add_le_add_left`), and it's tricky to keep track of exactly what is "the same" subexpression. - The new implementation tries `gcongr` lemmas one by one, and commits to the first `gcongr` lemma that lets us do a rewrite. This means that we need to lower the priority of `add_le_add_left`, so that `add_le_add` is preferred, so that we can rewrite on both sides of `+` at the same time. However, `mul_le_mul_of_nonneg_left` and `mul_le_mul_of_nonneg_right` are still tried before `mul_le_mul`, to avoid getting unnecessary side goals. - Because the new term is constructed from `gcongr` lemmas, rather than by instantiating the result of `kabstract`, it may be that metadata gets lost, or that some implicit arguments change. For example, rewriting inside `a ≤ b` for `a b : Nat` will change the instance argument from `Nat.instLE` to `Nat.instPreorder.toLE`. This is not really a problem. - Some problems arise when implementing a rewriting tactic that can rewrite under binders, because metavariables have a fixed local context of free variables that they are allowed to depend on. This issue also affects the new `rw` tactic that the FRO is currenlty working on. This PR works around this by "illegally" changing the local context of metavariabes, so as to allow them to depend on bound variables. This has the unfortunate side effect that the "Expected Type" view can get messed up when rewriting bound variables, because the expression is being delaborated with the wrong local context. But I think this is only a minor problem. We coould reconsider this design when the new `rw` tactic is done. Changes to `gcongr`: - The `@[goncgr]` attribute now checks more thoroughly whether the given lemma is of the right form. Some lemmas are not suitable for use in `grw`, but they still "feel" like a `gcongr` lemma, so we still allow them to be used in `gcongr`. For such cases I've added a linter warning that can be turned off. - I've refactored how `gcongr` lemmas are applied, in order to share this code between `gcongr` and `grw`. Now, binder names are taken from the goal when possible, rather than not giving any name to new free variables. This improves `gcongr` (as it means you don't anymore need to write `gcongr with ...` to give the variable a name), and allows `grw` to preserve binder names in the goal. The grewrite test file now tests the new `grw` implementation. Should I make a copy of the test file to also test the old implementation? I have put myself as the copyright holder, instead of Sebastian Zimmer, as I think this more accurately reflect code ownership. The original `grw` PR was by Sebastian in 2023, but it was majorly rewritten by me in 2025. Sebastian is still in the list of authors. --- - [x] depends on: #38558 - [ ] depends on: #38556 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-meta | 629/254 | Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/Order/Group/Indicator.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Analysis/Convex/StrictCombination.lean,Mathlib/Analysis/Distribution/Support.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Integral/Average.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/AbsolutelyContinuousFun.lean,Mathlib/Order/Basic.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Independence.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GCongr/CoreAttrs.lean,Mathlib/Tactic/GRewrite/Core.lean,Mathlib/Tactic/GRewrite/Elab.lean,Mathlib/Topology/MetricSpace/ThickenedIndicator.lean,MathlibTest/GCongr/GCongr.lean,MathlibTest/GCongr/implications.lean,MathlibTest/GRewrite.lean | 21 | 27 | ['JovanGerb', 'PatrickMassot', 'Vierkantor', 'github-actions', 'leanprover-radar', 'mathlib-bors', 'mathlib-dependent-issues'] | nobody | 4 hours ago | 10 days ago | 18 seconds |
| 36788 | hommmmm | feat(RingTheory): height of span of a prime element is one | ## Summary - Add `Ideal.height_span_singleton_eq_one_of_prime`: in a Noetherian integral domain, the ideal generated by a prime element has height one. ## Notes The new theorem follows directly from `height_le_one_of_isPrincipal_of_mem_minimalPrimes` (upper bound) and the fact that `span {p} ≠ ⊥` for `p` prime (lower bound). --- [](https://gitpod.io/from-referrer/) | t-ring-theory new-contributor awaiting-author | 20/0 | Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/KrullsHeightTheorem.lean | 2 | 12 | ['Multramate', 'chrisflav', 'github-actions', 'hommmmm', 'robin-carlier'] | chrisflav | 3 hours ago | 4 hours ago | 43 days |
| 38675 | yuanyi-350 | chore(AlgebraicGeometry/Morphisms/QuasiSeparated): remove an erw | - rewrites the range-identification step to use `Scheme.Opens.range_ι` instead of `erw [Subtype.range_coe]` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebraic-geometry LLM-generated | 2/2 | Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean | 1 | 2 | ['github-actions', 'jcommelin'] | nobody | 3 hours ago | 3 hours ago | 2 days |
| 38587 | dagurtomas | feat(Tactic/CategoryTheory): concrete category boilerplate | Adds `mk_concrete_category`, a command for generating the initial boilerplate for concrete categories whose morphisms are given by a bundled function type. The command creates the wrapper `Hom` type, named category and concrete category instances, `ofHom`, `Hom.hom`, and the basic dsimp lemmas. It handles parameterized categories such as `ModuleCat`, and has a paired additive/multiplicative form for generating both structures at once (e.g. `MonCat`/`AddMonCat`). Includes test categories checking the generated declarations. [](https://gitpod.io/from-referrer/) | LLM-generated t-meta WIP | 914/4 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/MkConcreteCategory.lean,Mathlib/Tactic/Simps/Basic.lean,MathlibTest/CategoryTheory/MkConcreteCategory.lean | 5 | 8 | ['dagurtomas', 'eric-wieser', 'github-actions'] | nobody | 3 hours ago | 3 days ago | 12 minutes |
| 38369 | quantumsnow | feat(AlgebraicTopology): Eilenberg Steenrod axioms | This introduces the Eilenberg-Steenrod axioms for a homology theory. --- - [x] depends on: #36621 [](https://gitpod.io/from-referrer/) | new-contributor t-algebraic-topology awaiting-author | 514/9 | Mathlib.lean,Mathlib/AlgebraicTopology/EilenbergSteenrod.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Basic.lean,Mathlib/Topology/Category/TopCat/Basic.lean,Mathlib/Topology/Category/TopCat/Limits/Basic.lean,Mathlib/Topology/Category/TopPair.lean,Mathlib/Topology/Homotopy/TopCat/Basic.lean | 7 | 6 | ['github-actions', 'joelriou', 'mathlib-dependent-issues', 'quantumsnow'] | nobody | 3 hours ago | 3 hours ago | 1 hour |
| 38211 | gaetanserre | feat(Probability/Kernel): define `IsDeterministic` | Defines the `IsDeterministic` typeclass which state that a kernel is deterministic in a categorical sense, i.e., it "commutes" with `Kernel.copy`. For some additional context, please see #37851. --- [](https://gitpod.io/from-referrer/) | t-measure-probability awaiting-author | 333/11 | Mathlib.lean,Mathlib/Probability/Kernel/Composition/Comp.lean,Mathlib/Probability/Kernel/Composition/KernelLemmas.lean,Mathlib/Probability/Kernel/Deterministic.lean,Mathlib/Probability/Kernel/Posterior.lean,docs/references.bib | 6 | 26 | ['RemyDegenne', 'eric-wieser', 'gaetanserre', 'github-actions'] | RemyDegenne | 3 hours ago | 3 hours ago | 10 days |
| 28499 | yoh-tanimoto | feat(MeasureTheory/VectorMeasure): add integral of a vector-valued function against a vector measure | add `VectorMeasureWithPairing.integral` for normed vector spaces `E`, `F`, a Banach space `G` , a continuous linear pairing `B : E →L[ℝ] F →L[ℝ] → G` and an `F`-valued vector measure `μ`, which should be informally written as `∫ B (f x) ∂μ x`. motivation: there are natural vector measures such as signed measures and complex measures, and their integrals appear naturally e.g. in a proof of the spectral theorem for general bounded normal operators on a Hilbert space. - [x] depends on: #26160 for the definition and lemmas about the total variation of a vector measure. | t-measure-probability | 221/5 | Mathlib.lean,Mathlib/MeasureTheory/VectorMeasure/Integral.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Basic.lean | 3 | 95 | ['EtienneC30', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'yoh-tanimoto'] | EtienneC30 | 3 hours ago | 9 days ago | 15 days |
| 38809 | vihdzp | feat: `DirSupClosedOn` on linear orders | Every subset of a linear order is directed, so we can take off this part of the predicate. --- [](https://gitpod.io/from-referrer/) | t-order easy | 25/0 | Mathlib/Order/DirSupClosed.lean,Mathlib/Order/Directed.lean | 2 | 1 | ['github-actions'] | nobody | 3 hours ago | 3 hours ago | 3 hours |
| 37924 | JovanGerb | perf(Tactic/FastInstance): use `whnf` on data fields | This PR lets `fast_instance%` make even faster instances by using `whnf` on data fields. This PR also changes `withReducible` to the more appropriate `withReducibleAndInstances` in the implementation. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-author awaiting-CI | 4/3 | Mathlib/Tactic/FastInstance.lean,MathlibTest/InferInstanceAsPercent.lean | 2 | 10 | ['JovanGerb', 'github-actions', 'joneugster', 'leanprover-radar'] | joneugster | 3 hours ago | 7 days ago | 13 days |
| 38358 | yuanyi-350 | doc(1000.yaml): note more formalised theorems | --- [](https://gitpod.io/from-referrer/) | documentation | 29/4 | Mathlib/Topology/Order/IntermediateValue.lean,docs/1000.yaml | 2 | 8 | ['github-actions', 'grunweg', 'vihdzp', 'yuanyi-350'] | nobody | 3 hours ago | 8 days ago | 9 days |
| 38804 | joelriou | feat(CategoryTheory): localizer morphisms which induces fully faithful functors on localized categories | --- Unfortunately, we cannot define `CategoryTheory.FunctorProperty` as property of functors between categories with arbitrary universe parameters (all at the same time), so that some of the proofs here basically reproduce for `FullyFaithful` what was previously done for `IsEquivalence`. [](https://gitpod.io/from-referrer/) | t-category-theory | 114/0 | Mathlib/CategoryTheory/Localization/LocalizerMorphism.lean | 1 | 6 | ['github-actions', 'joelriou', 'robin-carlier'] | nobody | 3 hours ago | 3 hours ago | 5 hours |
| 38802 | joelriou | feat(CategoryTheory/Localization): lemmas regarding calculus of fractions and full/faithful functors | --- [](https://gitpod.io/from-referrer/) | t-category-theory maintainer-merge | 64/20 | Mathlib/CategoryTheory/Abelian/SerreClass/Localization.lean,Mathlib/CategoryTheory/EssentialImage.lean,Mathlib/CategoryTheory/Localization/CalculusOfFractions.lean,Mathlib/CategoryTheory/Localization/CalculusOfFractions/Fractions.lean,Mathlib/CategoryTheory/Localization/CalculusOfFractions/Preadditive.lean,Mathlib/CategoryTheory/Localization/Triangulated.lean,Mathlib/CategoryTheory/Triangulated/Orthogonal.lean | 7 | 4 | ['github-actions', 'joelriou', 'robin-carlier'] | nobody | 3 hours ago | 3 hours ago | 8 hours |
| 38378 | chrisflav | refactor(CategoryTheory/Limits): redefine `IsIPC` in terms of `IsIPCOfShape` | A category `C` satisfies the `w`-IPC property if `w`-sized filtered colimits commute with `w`-sized products. We introduce an intermediate class `IsIPCOfShape` which says that `w`-sized filtered colimits commute with products of the given shape and redefine `IsIPC` in terms of it. We also rephrase the condition as a certain cocone being colimiting instead of some morphism being an isomorphism. This allows to remove some colimit existence assumptions. The motivation for this is to give a tighter condition for when `ObjectProperty.ind` is stable under products of a certain shape. From Proetale. --- - [x] depends on: #38368 [](https://gitpod.io/from-referrer/) | t-category-theory | 242/47 | Mathlib/CategoryTheory/Discrete/Basic.lean,Mathlib/CategoryTheory/Limits/FilteredColimitCommutesProduct.lean,Mathlib/CategoryTheory/Limits/HasLimits.lean,Mathlib/CategoryTheory/Limits/Shapes/Products.lean | 4 | 15 | ['chrisflav', 'dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'robin-carlier'] | riccardobrasca | 3 hours ago | 3 hours ago | 6 days |
| 25848 | joelriou | feat/refactor: redefinition of homology + derived categories | This PR contains a redefinition of homology, theorems about localization of categories, including triangulated categories, a construction of the derived category of an abelian category, derived functors, spectral sequences, etc. (This is made a PR only to facilitate navigation in the code of this branch.)
This formalization is outlined in the paper _Formalization of derived categories in Lean/mathlib_ https://hal.science/hal-04546712
The homology of `ShortComplex C` (diagrams of two composable morphisms whose composition is zero) is developed in `Algebra.Homology.ShortComplex`. The files in that folder have been added one by one in separate PRs, and then, the current definition of `homology` has been replaced by this new definition in a refactor PR.
Homology refactor:* #4203 * #4204 * #4388 * #4609 * #4645 * #4787 * #4853 * #5250 * #5674 * #6008 * #6039 * #6089 * #6227 * #6230 * #6231 * #6245 * #6267 * #6279 * #6324 * #6443 * #6586 * #6994 * #7042 * #7047 * #7052 * #7192 * #7193 * #7194 * #7195 * #7197 * #7256 * #7262 * #7280 * #7623 * #7624 * #7806 * #7816 * #7817 * #7821 * #7954 * #7966 * #7993 * #7995 * #7996 * #7997 * #8058 * #8060 * #8069 * #8079 * #8081 * #8084 * #8091 * #8113 * #8114 * #8152 * #8159 * #8174 * #8200 * #8206 * #8208 * #8472 * #8468 * #8475 * #8490 * #8491 * #8507 * #8512 * #8593 * #8595 * #8706 * #8765 * #8766 * #8845 * #9022 * #12649 * #12638Homological complexes:* #9333 * #9335 * #9331Localization of categories:* #6233 * #6235 * #6236 * #6867 * #6869 * #6887 * #6882 * #8041 * #8055 * #8069 * #8516 * #8864 * #8865 * #9702 * #9692 * #10606 * #10607 * #11721 * #11728 * #11737 * #12728Shifts on categories:* #4429 * #6652 * #6653 * #6655 * #7268 * #7270 * #9001 * #11764Triangulated categories:* #6377 * #6688 * #6815 * #7053 * #7324 * #7327 * #7336 * #7626 * #7641 * #9049 * #9073 * #10527 * #11738 * #11740 * #11759 * #11786 * #11789 * #11805 * #12619Construction of the derived category:* #6626 * #6701 * #6720 * #6894 * #7048 * #7049 * #7050 * #7201 * #7656 * #8937 * #8966 * #8969 * #8970 * #9054 * #9447 * #8951 * #9483 * #9508 * #9509 * #9592 * #9614 * #9615 * #9032 * #9370 * #9550 * #9686 * #9660 * #11760 * #11782 * #11806Derived functors:* #10195 * #10270 * #10301 * #10384 * #10413 * #12168 * #12627 * #12631 * #12633 * #12785 * #12788Refactor of Ext-groups:* #12607 |
WIP t-category-theory large-import t-topology merge-conflict | 30950/254 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Free.lean,Mathlib/Algebra/Homology/Additive.lean,Mathlib/Algebra/Homology/BicomplexColumns.lean,Mathlib/Algebra/Homology/BicomplexRows.lean,Mathlib/Algebra/Homology/Bifunctor.lean,Mathlib/Algebra/Homology/BifunctorColimits.lean,Mathlib/Algebra/Homology/BifunctorCommShift.lean,Mathlib/Algebra/Homology/BifunctorHomotopy.lean,Mathlib/Algebra/Homology/BifunctorMappingCone.lean,Mathlib/Algebra/Homology/BifunctorShift.lean,Mathlib/Algebra/Homology/BifunctorSingle.lean,Mathlib/Algebra/Homology/BifunctorTriangulated.lean,Mathlib/Algebra/Homology/CategoryWithHomology.lean,Mathlib/Algebra/Homology/CochainComplexMinus.lean,Mathlib/Algebra/Homology/CochainComplexOpposite.lean,Mathlib/Algebra/Homology/ComplexShape.lean,Mathlib/Algebra/Homology/ConnectShortExact.lean,Mathlib/Algebra/Homology/DerivedCategory/Basic.lean,Mathlib/Algebra/Homology/DerivedCategory/DerivabilityStructureInjectives.lean,Mathlib/Algebra/Homology/DerivedCategory/DerivabilityStructureKInjectives.lean,Mathlib/Algebra/Homology/DerivedCategory/DerivabilityStructureProjectives.lean,Mathlib/Algebra/Homology/DerivedCategory/Fractions.lean,Mathlib/Algebra/Homology/DerivedCategory/FullyFaithful.lean,Mathlib/Algebra/Homology/DerivedCategory/HomologySequence.lean,Mathlib/Algebra/Homology/DerivedCategory/KInjective.lean,Mathlib/Algebra/Homology/DerivedCategory/KProjective.lean,Mathlib/Algebra/Homology/DerivedCategory/Minus.lean,Mathlib/Algebra/Homology/DerivedCategory/Monoidal.lean,Mathlib/Algebra/Homology/DerivedCategory/Plus.lean,Mathlib/Algebra/Homology/DerivedCategory/RightDerivedFunctorPlus.lean,Mathlib/Algebra/Homology/DerivedCategory/SingleTriangle.lean,Mathlib/Algebra/Homology/DerivedCategory/SpectralObject.lean,Mathlib/Algebra/Homology/DerivedCategory/TStructure.lean,Mathlib/Algebra/Homology/Double.lean,Mathlib/Algebra/Homology/DoubleHomology.lean,Mathlib/Algebra/Homology/Embedding/CochainComplex.lean,Mathlib/Algebra/Homology/Embedding/CochainComplexTrunc.lean,Mathlib/Algebra/Homology/Embedding/ComplementaryTrunc.lean,Mathlib/Algebra/Homology/Embedding/ExtendMap.lean,Mathlib/Algebra/Homology/Embedding/HomEquiv.lean,Mathlib/Algebra/Homology/Embedding/StupidFiltration.lean,Mathlib/Algebra/Homology/Embedding/StupidTrunc.lean,Mathlib/Algebra/Homology/Embedding/TruncGE.lean,Mathlib/Algebra/Homology/Embedding/TruncGEHomology.lean,Mathlib/Algebra/Homology/Embedding/TruncLE.lean,Mathlib/Algebra/Homology/Embedding/TruncLEHomology.lean,Mathlib/Algebra/Homology/Factorizations/Basic.lean,Mathlib/Algebra/Homology/Factorizations/CM5a.lean,Mathlib/Algebra/Homology/HomologicalBicomplex.lean,Mathlib/Algebra/Homology/HomologicalComplex.lean,Mathlib/Algebra/Homology/HomologicalComplexFunctorEquiv.lean,Mathlib/Algebra/Homology/HomologicalComplexLimits.lean,Mathlib/Algebra/Homology/Homology.lean,Mathlib/Algebra/Homology/HomologySequence.lean,Mathlib/Algebra/Homology/HomologySequenceLemmas.lean,Mathlib/Algebra/Homology/Homotopy.lean,Mathlib/Algebra/Homology/HomotopyCategory.lean,Mathlib/Algebra/Homology/HomotopyCategory/Acyclic.lean,Mathlib/Algebra/Homology/HomotopyCategory/DegreewiseSplit.lean,Mathlib/Algebra/Homology/HomotopyCategory/Devissage.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplex.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplexShift.lean,Mathlib/Algebra/Homology/HomotopyCategory/KInjective.lean,Mathlib/Algebra/Homology/HomotopyCategory/MappingCone.lean,Mathlib/Algebra/Homology/HomotopyCategory/Minus.lean,Mathlib/Algebra/Homology/HomotopyCategory/Monoidal.lean,Mathlib/Algebra/Homology/HomotopyCategory/MonoidalTriangulated.lean,Mathlib/Algebra/Homology/HomotopyCategory/Plus.lean,Mathlib/Algebra/Homology/HomotopyCategory/PreservesQuasiIso.lean,Mathlib/Algebra/Homology/HomotopyCategory/Pretriangulated.lean,Mathlib/Algebra/Homology/HomotopyCategory/Shift.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShiftSequence.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShortExact.lean,Mathlib/Algebra/Homology/HomotopyCategory/SingleFunctors.lean,Mathlib/Algebra/Homology/HomotopyCofiber.lean,Mathlib/Algebra/Homology/HomotopyFiber.lean,Mathlib/Algebra/Homology/LeftResolution/Basic.lean,Mathlib/Algebra/Homology/LeftResolution/CochainComplex.lean,Mathlib/Algebra/Homology/LeftResolution/CochainComplexMinus.lean,Mathlib/Algebra/Homology/Localization.lean,Mathlib/Algebra/Homology/ModelCategory/Injective.lean,Mathlib/Algebra/Homology/ModelCategory/Projective.lean,Mathlib/Algebra/Homology/Monoidal.lean,Mathlib/Algebra/Homology/ObjectProperty.lean,Mathlib/Algebra/Homology/Opposite.lean,Mathlib/Algebra/Homology/PreservesQuasiIso.lean,Mathlib/Algebra/Homology/QuasiIso.lean,Mathlib/Algebra/Homology/ShortComplex/Basic.lean,Mathlib/Algebra/Homology/ShortComplex/Exact.lean,Mathlib/Algebra/Homology/ShortComplex/FiveLemma.lean,Mathlib/Algebra/Homology/ShortComplex/FourLemma.lean,Mathlib/Algebra/Homology/ShortComplex/HomologicalComplex.lean,Mathlib/Algebra/Homology/ShortComplex/Images.lean,Mathlib/Algebra/Homology/ShortComplex/Preadditive.lean,Mathlib/Algebra/Homology/ShortComplex/ShortComplexFive.lean,Mathlib/Algebra/Homology/ShortComplex/ShortComplexFour.lean,Mathlib/Algebra/Homology/ShortComplex/ULift.lean,Mathlib/Algebra/Homology/Single.lean,Mathlib/Algebra/Homology/SpectralObject/Convergence.lean | 288 | 11 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 hours ago | 322 days ago | 2 seconds |
| 38669 | dannyply | feat(Topology/Algebra/PontryaginDual): prove compact monoids have discrete duals | Proves that the Pontryagin dual of a compact monoid is discrete. As a consequence, it also adds the corresponding finite-type instances for compact discrete monoids. This upstreams a result first added downstream in [`YaelDillies/APAP`](https://github.com/YaelDillies/APAP), where this fact was needed to close a `sorry`. The proof separates the trivial character from all the others using the right half of the circle and adds a few reusable `Circle` helper lemmas near the existing related API. The original APAP proof was AI-assisted and then reviewed/rewritten during downstream review. For this PR, I used Codex to help adapt the APAP proof to mathlib and to refactor the supporting lemmas. --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor awaiting-author | 111/16 | Mathlib/Analysis/Complex/Circle.lean,Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Topology/Algebra/PontryaginDual.lean | 3 | 23 | ['dannyply', 'github-actions', 'tb65536'] | j-loreaux | 2 hours ago | 2 days ago | 20 hours |
| 38651 | joelriou | feat(CategoryTheory/Triangulated): localizing subcategories | --- - [ ] depends on: #38804 - [ ] depends on: #38803 - [ ] depends on: #38802 - [ ] depends on: #38650 [](https://gitpod.io/from-referrer/) | t-category-theory WIP blocked-by-other-PR large-import | 577/8 | Mathlib.lean,Mathlib/CategoryTheory/EssentialImage.lean,Mathlib/CategoryTheory/Localization/CalculusOfFractions.lean,Mathlib/CategoryTheory/Localization/CalculusOfFractions/Fractions.lean,Mathlib/CategoryTheory/Localization/CalculusOfFractions/Preadditive.lean,Mathlib/CategoryTheory/Localization/LocalizerMorphism.lean,Mathlib/CategoryTheory/ObjectProperty/ContainsZero.lean,Mathlib/CategoryTheory/ObjectProperty/Opposite.lean,Mathlib/CategoryTheory/Opposites.lean,Mathlib/CategoryTheory/Triangulated/LocalizingSubcategory.lean,Mathlib/CategoryTheory/Triangulated/Opposite/Subcategory.lean,Mathlib/CategoryTheory/Triangulated/Subcategory.lean | 12 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 hours ago | 3 days ago | 4 minutes |
| 38801 | TBUGTB | feat(Topology/Order): order topology on WithTop API lemmas | Upstream lemmas on the order topology on WithTop from the brownian motion project.
Co-authored-by: Kexing Ying |
t-topology brownian new-contributor | 25/0 | Mathlib/Order/Filter/AtTopBot/Basic.lean,Mathlib/Topology/Order/WithTop.lean | 2 | 6 | ['TBUGTB', 'github-actions', 'plp127', 'vihdzp'] | nobody | 2 hours ago | 10 hours ago | 10 hours |
| 37878 | YaelDillies | chore(Combinatorics/SimpleGraph): avoid structure relation predicates | Relation predicates used to be `def`s over a `forall`, which was optimal for usability in fields of other structures. This changed in #35591 and #35192 as a byproduct of reducing apparent code duplication. Unfortunately, the usability issue was overlooked. This PR restores usability by dropping the use of those relation classes that are `structure`s, ie `Std.Irrefl` and `Std.Transitive`. It also uses more widely the `simp` auto-param on `SimpleGraph.loopless`. --- - [ ] depends on: #38554 I would also be happy to revert #35591 and #35192 since this demonstrates a good use case for the `def` versions of the relation predicates. [](https://gitpod.io/from-referrer/) | t-combinatorics blocked-by-other-PR | 43/53 | Archive/Wiedijk100Theorems/Konigsberg.lean,Mathlib/Combinatorics/Digraph/Orientation.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Circulant.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Uniform.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Sum.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Tripartite.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Basic.lean,Mathlib/ModelTheory/Graph.lean,Mathlib/Order/Cover.lean,Mathlib/Order/RelClasses.lean | 19 | 17 | ['SnirBroshi', 'Vierkantor', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 2 hours ago | 5 days ago | 16 days |
| 38170 | maddycrim | feat(Algebra/Module/FinitePresentation): Finitely Presented Module Lemma | From FLT Project Main Definitions: `Module.FinitePresentation.exists_fin_exact` : A finitely presented module M admits an exact sequence F' -> F -> M -> 0 where F' and F are finite free modules. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor | 9/0 | Mathlib/Algebra/Module/FinitePresentation.lean | 1 | 16 | ['github-actions', 'maddycrim', 'themathqueen', 'vlad902'] | nobody | 2 hours ago | 10 days ago | 13 days |
| 38812 | dependabot | chore(deps): bump the actions-version-updates group across 1 directory with 12 updates | Bumps the actions-version-updates group with 12 updates in the /.github/workflows directory:
| Package | From | To |
| --- | --- | --- |
| [leanprover/lean-action](https://github.com/leanprover/lean-action) | `1.4.0` | `1.5.0` |
| [actions/upload-artifact](https://github.com/actions/upload-artifact) | `7.0.0` | `7.0.1` |
| [actions/create-github-app-token](https://github.com/actions/create-github-app-token) | `3.0.0` | `3.1.1` |
| [tspascoal/get-user-teams-membership](https://github.com/tspascoal/get-user-teams-membership) | `3.0.0` | `4.0.1` |
| [marocchino/sticky-pull-request-comment](https://github.com/marocchino/sticky-pull-request-comment) | `3.0.2` | `3.0.4` |
| [docker/login-action](https://github.com/docker/login-action) | `4.0.0` | `4.1.0` |
| [docker/build-push-action](https://github.com/docker/build-push-action) | `7.0.0` | `7.1.0` |
| [actions/github-script](https://github.com/actions/github-script) | `8.0.0` | `9.0.0` |
| [dawidd6/action-download-artifact](https://github.com/dawidd6/action-download-artifact) | `19` | `21` |
| [peter-evans/create-pull-request](https://github.com/peter-evans/create-pull-request) | `8.1.0` | `8.1.1` |
| [softprops/action-gh-release](https://github.com/softprops/action-gh-release) | `2.6.1` | `3.0.0` |
| [actions/cache](https://github.com/actions/cache) | `5.0.4` | `5.0.5` |
Updates `leanprover/lean-action` from 1.4.0 to 1.5.0
Release notesSourced from leanprover/lean-action's releases.
ChangelogSourced from leanprover/lean-action's changelog.
... (truncated) Commits
Updates `actions/upload-artifact` from 7.0.0 to 7.0.1 Release notesSourced from actions/upload-artifact's releases.
CommitsUpdates `actions/create-github-app-token` from 3.0.0 to 3.1.1 Release notesSourced from actions/create-github-app-token's releases.
Commits
Updates `tspascoal/get-user-teams-membership` from 3.0.0 to 4.0.1 Release notesSourced from tspascoal/get-user-teams-membership's releases.
Commits
Updates `marocchino/sticky-pull-request-comment` from 3.0.2 to 3.0.4 Release notesSourced from marocchino/sticky-pull-request-comment's releases.
Commits
Updates `docker/login-action` from 4.0.0 to 4.1.0 Release notesSourced from docker/login-action's releases.
Commits
Updates `docker/build-push-action` from 7.0.0 to 7.1.0 Release notesSourced from docker/build-push-action's releases.
Commits
Updates `actions/github-script` from 8.0.0 to 9.0.0 Release notesSourced from actions/github-script's releases.
Commits
Updates `dawidd6/action-download-artifact` from 19 to 21 Release notesSourced from dawidd6/action-download-artifact's releases.
Commits
Updates `peter-evans/create-pull-request` from 8.1.0 to 8.1.1 Release notesSourced from peter-evans/create-pull-request's releases.
Commits
Updates `softprops/action-gh-release` from 2.6.1 to 3.0.0 Release notesSourced from softprops/action-gh-release's releases.
ChangelogSourced from softprops/action-gh-release's changelog.
|
dependencies github_actions CI | 44/44 | .github/workflows/add_label_from_diff.yaml,.github/workflows/build_template.yml,.github/workflows/check_pr_titles.yaml,.github/workflows/daily.yml,.github/workflows/docker_build.yml,.github/workflows/label_new_contributor.yml,.github/workflows/latest_import.yml,.github/workflows/maintainer_bors_wf_run.yml,.github/workflows/maintainer_merge_wf_run.yml,.github/workflows/nightly_bump_and_merge.yml,.github/workflows/nightly_detect_failure.yml,.github/workflows/nightly_merge_master.yml,.github/workflows/nolints.yml,.github/workflows/olean_report.yaml,.github/workflows/release.yml,.github/workflows/remove_deprecated_decls.yml,.github/workflows/rm_set_option.yml,.github/workflows/splice_bot_wf_run.yaml,.github/workflows/update_dependencies.yml,.github/workflows/update_dependencies_zulip.yml,.github/workflows/weekly-lints.yml | 21 | 1 | ['github-actions'] | nobody | 2 hours ago | 2 hours ago | 2 hours |
| 37831 | EtienneC30 | feat: the cardinal of a finset is an ite sum over a bigger finset | If `s ⊆ t` then `s.card = ∑ i ∈ t, if i ∈ s then 1 else 0`. --- [](https://gitpod.io/from-referrer/) | t-data t-algebra awaiting-author | 9/2 | Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Data/Finset/BooleanAlgebra.lean,Mathlib/Data/Finset/Filter.lean | 3 | 4 | ['EtienneC30', 'github-actions', 'robin-carlier'] | nobody | 2 hours ago | 2 hours ago | 22 days |
| 37744 | AntoineChambert-Loir | feat(RingTheory/Ideal/IsAugmentation): define the concept of an augmentation ideal | Define an augmentation ideal in an R-algebra A: this is an `Ideal A` which is a complement to `⊥ : Subalgebra R A` in `A`. (This subalgebra consists of `R`-multiples of `1`.) Co-authored with: @mariainesdff --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 98/3 | Mathlib.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Module/Submodule/RestrictScalars.lean,Mathlib/RingTheory/Ideal/IsAugmentation.lean | 4 | 1 | ['github-actions'] | mattrobball and robin-carlier | 2 hours ago | 24 days ago | 24 days |
| 36387 | FrankieeW | feat(NumberTheory/QuadraticField): parameter uniqueness for quadratic fields | ## Summary Prove that every quadratic field `ℚ(√d)` can be normalized to have a squarefree integer parameter, and that this parameter is unique. ## Main Results - `Qsqrtd.rescale`: rescaling isomorphism `ℚ(√d) ≃ₐ[ℚ] ℚ(√(a²d))` for `a ≠ 0` - `Qsqrtd_iso_int_param`: every `ℚ(√d)` is isomorphic to one with an integer parameter - `Qsqrtd_iso_squarefree_int_param`: every `ℚ(√d)` is isomorphic to one with a squarefree integer parameter - `Qsqrtd.param_unique`: if `ℚ(√d₁) ≃ₐ[ℚ] ℚ(√d₂)` with both `d₁, d₂` squarefree and `≠ 1`, then `d₁ = d₂` ## Helper Lemmas - `squarefree_eq_of_rat_sq_mul`: if `d₁ = d₂ · r²` with both squarefree, then `d₁ = d₂` - `int_dvd_of_ratio_square`: if `d₁/d₂` is a rational square and `d₂` is squarefree, then `d₂ ∣ d₁` - `not_isSquare_neg_one_rat`: `-1` is not a square in `ℚ` --- - [ ] depends on: #36347 | WIP t-number-theory blocked-by-other-PR new-contributor large-import LLM-generated | 400/0 | Mathlib.lean,Mathlib/Algebra/QuadraticAlgebra/Defs.lean,Mathlib/Algebra/Squarefree/Basic.lean,Mathlib/NumberTheory/QuadraticField/Basic.lean | 4 | 4 | ['FrankieeW', 'github-actions', 'mathlib-dependent-issues'] | nobody | 2 hours ago | 53 days ago | 2 seconds |
| 38727 | yuanyi-350 | chore(AlgebraicTopology/DoldKan): remove `erw`s | - replaces the `erw [ChainComplex.of_d]` step in `Hσ_eq_zero` with the direct rewrite lemma `AlternatingFaceMapComplex.obj_d_eq` Extracted from #38415 [](https://gitpod.io/from-referrer/) | t-algebraic-topology | 5/8 | Mathlib/AlgebraicTopology/DoldKan/Homotopies.lean | 1 | 5 | ['dagurtomas', 'github-actions', 'mathlib-merge-conflicts'] | nobody | 2 hours ago | 2 hours ago | 1 day |
| 38677 | yuanyi-350 | chore(CategoryTheory/GlueData): remove an erw | - expands `gluedIso` so `ι_gluedIso_hom` closes with `simp` instead of `erw [ι_preservesColimitIso_hom_assoc]` Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-category-theory LLM-generated | 1/2 | Mathlib/CategoryTheory/GlueData.lean | 1 | 3 | ['dagurtomas', 'github-actions', 'jcommelin'] | nobody | 2 hours ago | 2 hours ago | 1 day |
| 37216 | mbkybky | feat(Algebra/Module): a finite stably free module `M` is free if it is locally free of rank `1` | We show that a finite stably free module `M` is free if all of its localizations at maximal ideals are free of rank `1` - [ ] depends on: #36951 --- [](https://gitpod.io/from-referrer/) | t-algebra | 167/0 | Mathlib.lean,Mathlib/Algebra/Module/StablyFree/Basic.lean,Mathlib/Algebra/Module/StablyFree/FreeOfLocalizedEq.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mbkybky'] | nobody | 2 hours ago | 2 hours ago | 2 hours |
| 38726 | yuanyi-350 | chore(AlgebraicGeometry/Stalk): remove `erw`s | - rewrites both branches of `IsAffineOpen.fromSpecStalk_eq` using `Spec.map_comp_assoc` and `TopCat.Presheaf.germ_res`, replacing the longer `Scheme.Spec_map`/`Functor.map_comp_assoc` chain Extracted from #38415 [](https://gitpod.io/from-referrer/) | t-algebraic-geometry | 4/9 | Mathlib/AlgebraicGeometry/Stalk.lean | 1 | 3 | ['dagurtomas', 'github-actions', 'yuanyi-350'] | nobody | 2 hours ago | 2 hours ago | 1 day |
| 37676 | IvanRenison | feat(Data/Finset/Preimage): add lemmas about `Equiv.symm` | --- `Finset` version of lemmas already existing for `Set`. [](https://gitpod.io/from-referrer/) | t-data awaiting-author | 15/0 | Mathlib/Data/Finset/Preimage.lean | 1 | 2 | ['github-actions', 'robin-carlier'] | nobody | 2 hours ago | 2 hours ago | 25 days |
| 38646 | yuanyi-350 | refactor(Analysis): golf `Mathlib/Analysis/Normed/Unbundled/SpectralNorm` | - rewrites `spectralValue_eq_zero_iff` via `eq_X_pow_iff_natDegree_le_natTrailingDegree` and `spectralValueTerms_of_lt_natDegree` - rewrites `spectralNorm.eq_of_normalClosure'` as two applications of `spectralNorm.eq_of_tower` - tidies `spectralNorm_unique` by switching the local transported structures to `set`/`letI`/`haveI` with `inferInstanceAs` Extracted from #37968 [](https://gitpod.io/from-referrer/) | codex t-analysis LLM-generated | 9/23 | Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean | 1 | 7 | ['github-actions', 'leanprover-radar', 'sgouezel', 'themathqueen', 'yuanyi-350'] | sgouezel | 2 hours ago | 2 hours ago | 2 days |
| 37893 | abeldonate | feat: Module theory theorems | Added three theorems: - annihilator_sup - torsionOf_eq_annihilator_span_singleton - annihilator_eq_iInf_torsionOf | new-contributor t-algebra delegated | 15/0 | Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean | 2 | 12 | ['abeldonate', 'github-actions', 'mathlib-bors', 'ocfnash', 'scholzhannah', 'wwylele'] | nobody | 2 hours ago | 2 hours ago | 15 days |
| 38725 | yuanyi-350 | chore(AlgebraicGeometry/ProjectiveSpectrum): remove `erw`s | - folds the `erw` steps in `isSeparated` into the surrounding `simp only` rewrites, including `affineOpenCover_f` Extracted from #38415 [](https://gitpod.io/from-referrer/) | t-algebraic-geometry | 9/12 | Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Proper.lean | 1 | 2 | ['dagurtomas', 'github-actions'] | nobody | 2 hours ago | 2 hours ago | 1 day |
| 38660 | sharky564 | feat(Topology/Homeomorph): add Equiv.IsHomeomorph_iff and LinearEquiv.IsHomeomorph_iff | This PR adds two characterisations of `IsHomeomorph` for bundled equivalences. For a plain `Equiv` between topological spaces, `Equiv.isHomeomorph_iff` states that the equivalence is a homeomorphism if and only if it is continuous in both directions. The corresponding statement for a `LinearEquiv` between topological modules is added as `LinearEquiv.isHomeomorph_iff`, derived from the `Equiv` version. --- The motivation comes from work on topological complements of submodules in PR #38547, where one wants to upgrade a `LinearEquiv` to a `ContinuousLinearEquiv` and the cleanest characterisation is in terms of continuity in both directions. The existing API offers `isHomeomorph_iff_exists_inverse`, but for equivalences this requires manually identifying the existential inverse with `e.symm`, which is unnecessarily indirect. | t-topology new-contributor maintainer-merge | 17/0 | Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Homeomorph/Lemmas.lean | 2 | 8 | ['ADedecker', 'github-actions', 'robin-carlier', 'scholzhannah', 'sharky564'] | mcdoll | 2 hours ago | 2 days ago | 3 days |
| 38763 | yuanyi-350 | chore(AlgebraicGeometry/GammaSpecAdjunction): remove an erw | - rewrites `toStalk_stalkMap_toΓSpec` by folding the old `erw` into the surrounding `simp only`/`rw` chain Extracted from #38415 [](https://gitpod.io/from-referrer/) | codex t-algebraic-geometry LLM-generated | 2/2 | Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean | 1 | 2 | ['dagurtomas', 'github-actions'] | nobody | 2 hours ago | 2 hours ago | 12 hours |
| 38814 | sharky564 | feat(LinearAlgebra/Projection): characterise `quotientEquivOfIsCompl` on `mkQ` | This PR adds two related lemmas to `Mathlib.LinearAlgebra.Projection`: `Submodule.linearPorjOfIsCompl_sub_mem` records that for complementary submodules `p`, `q`, subtracting the projection of `x` onto `p` from `x` lands in `q`. `Submodule.quotientEquivOfIsCompl_apply_mk` records that the quotient equivalence `M ⧸ p ≃ q` induced by complementarity, when applied to a quotient class `Submodule.Quotient.mk x`, agrees with the linear projection onto `q` parallel to `p`. --- The motivation is work on topological complements of submodules in PR #38547. The proof of `IsCompl.isTopCompl_iff_continuous_quotientEquiv` reduces, via the quotient-map property of `mkQ`, to identifying the composite `quotientEquivOfIsCompl ∘ mkQ` with the linear projection. This identifications feels like it should belong at the algebraic level and not mixed in with the topological reasoning. Additionally, these lemmas seem useful independently. | t-algebra new-contributor | 13/0 | Mathlib/LinearAlgebra/Projection.lean | 1 | 3 | ['github-actions', 'themathqueen'] | nobody | 2 hours ago | 1 hour ago | 30 minutes |
| 36910 | Brian-Nugent | feat(CategoryTheory): 4 and 5 lemmas for ComposableArrows n | Adds versions of the 4 and 5 lemmas for morphisms in `ComposableArrows n`. --- [](https://gitpod.io/from-referrer/) | t-category-theory | 86/2 | Mathlib/Algebra/Homology/ExactSequence.lean,Mathlib/CategoryTheory/Abelian/DiagramLemmas/Four.lean,Mathlib/CategoryTheory/ComposableArrows/Basic.lean | 3 | 13 | ['Brian-Nugent', 'dagurtomas', 'erdOne', 'github-actions', 'robin-carlier'] | adamtopaz | 1 hour ago | 1 hour ago | 29 days |
| 38806 | CBirkbeck | feat(NumberTheory/ModularForms): Δ = (E₄³ - E₆²) / 1728 | Proves the classical identity expressing the modular discriminant as a combination of Eisenstein series: $$\Delta = \frac{E_4^3 - E_6^2}{1728}.$$ The work was done as part of the Sphere packing project. This PR was done with the help of Claude Code. (Resubmission of #37789 with a renamed branch; earlier dependency work has been merged via #37979.) | t-number-theory | 129/0 | Mathlib.lean,Mathlib/NumberTheory/ModularForms/Discriminant.lean,Mathlib/NumberTheory/ModularForms/GradedRing.lean | 3 | 4 | ['github-actions', 'loefflerd'] | nobody | 1 hour ago | 3 hours ago | 3 hours |
| 38080 | joelriou | feat(Topology/Convenient): the category of `X`-generated spaces, as a localization | In this PR, we show that the category of `X`-generated spaces identifies not only to a full subcategory of `TopCat`, but also as a localization with respect to the morphisms corresponding to the canonical continuous maps `WithGeneratedByTopology X Z → Z` for all topological spaces `Z`. --- - [x] depends on: #37799 [](https://gitpod.io/from-referrer/) | t-topology t-category-theory | 74/2 | Mathlib.lean,Mathlib/Topology/Convenient/Category.lean,Mathlib/Topology/Convenient/Localization.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 hour ago | 1 hour ago | 1 hour |
| 38803 | joelriou | feat(CategoryTheory): the opposite of a full subcategory | --- The large-import label comes from the addition of basic lemmas regarding the interaction between the lattice structure on `ObjectProperty` and `ObjectProperty.op`. I do not feel it would be worth creating a separate file. [](https://gitpod.io/from-referrer/) | t-category-theory large-import | 23/1 | Mathlib/CategoryTheory/ObjectProperty/Opposite.lean | 1 | 1 | ['github-actions'] | nobody | 1 hour ago | 9 hours ago | 9 hours |
| 38431 | joelriou | refactor(Topology): redefine Delta-generated spaces | --- - [ ] depends on: #38080 - [x] depends on: #37799 [](https://gitpod.io/from-referrer/) | WIP t-topology blocked-by-other-PR large-import | 130/204 | Mathlib/Topology/Category/DeltaGenerated.lean,Mathlib/Topology/Compactness/DeltaGeneratedSpace.lean,Mathlib/Topology/Convenient/Category.lean,Mathlib/Topology/Convenient/GeneratedBy.lean | 4 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 1 hour ago | 7 days ago | 2 seconds |
| 32725 | joelriou | feat(CategoryTheory): presheaves of types which preserve a limit | Let `F : J ⥤ Cᵒᵖ` be a functor. We show that a presheaf `P : Cᵒᵖ ⥤ Type w` preserves the limit of `F` iff `P` is a local object with respect to a suitable family of morphisms in `Cᵒᵖ ⥤ Type w` (this family contains `1` or `0` morphism depending on whether the limit of `F` exists or not). --- - [x] depends on: #38257 [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author WIP | 153/0 | Mathlib.lean,Mathlib/CategoryTheory/ObjectProperty/FunctorCategory/Presheaf.lean | 2 | 8 | ['github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'robin-carlier'] | nobody | 1 hour ago | 119 days ago | 3 days |
| 38815 | dagurtomas | feat(Tactic/CategoryTheory): extend `@[to_app]` to natural transformations | This extends the `@[to_app]` attribute so it also generates componentwise lemmas from equalities of natural transformations between functors, while preserving the existing bicategory behavior. It also ensures generated component lemmas remain usable by dsimp when they are definitionally true. | t-category-theory LLM-generated t-meta | 148/22 | Mathlib/Tactic/CategoryTheory/ToApp.lean,Mathlib/Util/AddRelatedDecl.lean,MathlibTest/CategoryTheory/ToApp.lean | 3 | 1 | ['github-actions'] | nobody | 1 hour ago | 1 hour ago | 1 hour |
| 37576 | WenrongZou | feat(MvPowerSeries): connection between rename and subst | --- [](https://gitpod.io/from-referrer/) | t-ring-theory large-import | 33/6 | Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Rename.lean | 2 | 7 | ['BryceT233', 'WenrongZou', 'github-actions', 'robin-carlier'] | mariainesdff | 1 hour ago | 1 hour ago | 28 days |
| 38631 | FordUniver | feat(Combinatorics/SimpleGraph/Copy): add indLabeledCopyCount and indCopyCount | Adds `indLabeledCopyCount` and `indCopyCount` to `SimpleGraph`, along with API mirroring the non-induced variants `labelledCopyCount` and `copyCount`. `indLabeledCopyCount_le_labelledCopyCount` and `indCopyCount_le_copyCount` relate the two families. The main auxiliary addition is `Embedding.ofIsInduced`, the canonical embedding of an induced subgraph into the ambient graph. Also removes file-wide `@[expose]`. --- This has been on my list for a while and addresses and resolves an explicit TODO in `Mathlib/Combinatorics/SimpleGraph/Copy.lean`. I am trying to push formalized flag algebras in Lean and need it for that. There are some additional things either building on this or orthogonal to this that I intentionally deferred and would do PRs for soon-ish: - A lot of uses of `Classical` seem like they should be replaced by `Fintype` or `Decidable{Rel,Eq}` assumptions? - Based on the first point, a lot of this could easily be made computational (another TODO in the file). - One can easily relate labelled and unlabelled count (induced and not-necessarily induced) through the number of automorphisms - One can express the induced counts through (a sum of) non-induced counts and vice-versa. - For all of this fractional density values and real limit values could be defined. **Standard disclosure.** *This PR was developed with assistance from LLM code tools, used for Mathlib style alignment and proof compactness. The mathematical content and proof strategy originate from myself; I have reviewed and vouch for the final code.* - [ ] depends on: #38745 | t-combinatorics new-contributor awaiting-author blocked-by-other-PR | 171/32 | Mathlib/Combinatorics/SimpleGraph/Copy.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 3 | 36 | ['FordUniver', 'SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'plp127'] | nobody | 1 hour ago | 12 hours ago | 2 days |
| 38322 | NoahW314 | feat(Algebra/MvPolynomial): add monomial prod lemma | --- [](https://gitpod.io/from-referrer/) | t-algebra | 4/0 | Mathlib/Algebra/MvPolynomial/Basic.lean | 1 | 2 | ['github-actions', 'robin-carlier', 'wwylele'] | nobody | 1 hour ago | 10 days ago | 10 days |
| 38634 | Maldooor | feat(MeasureTheory): `restrict_absolutelyContinuous_restrict` | Adding three lemmas about absolute continuity of restrictions of measures to subsets. --- [](https://gitpod.io/from-referrer/) | t-measure-probability awaiting-author | 19/0 | Mathlib/MeasureTheory/Measure/Restrict.lean | 1 | 3 | ['EtienneC30', 'Maldooor', 'github-actions'] | EtienneC30 | 1 hour ago | 22 hours ago | 2 days |
| 37084 | SnirBroshi | feat(Order/PropInstances): relations and `Subsingleton` | `r = ⊤ ↔ Refl r` and `r = ⊥ ↔ Irrefl r` given `Subsingleton` --- [](https://gitpod.io/from-referrer/) | t-order delegated | 10/1 | Mathlib/Order/PropInstances.lean | 1 | 6 | ['YaelDillies', 'github-actions', 'mathlib-bors', 'ocfnash', 'robin-carlier'] | nobody | 1 hour ago | 6 hours ago | 35 days |
| 38817 | chrisflav | feat(CategoryTheory/Monoidal): normal subgroup objects | We define normal subgroups of group objects in a cartesian monoidal category as a predicate on morphisms. A morphism `φ : H ⟶ G` of group objects is normal if it is mono, a monoid morphism and the conjugation map `(g, h) ↦ g * h * g⁻¹` factors through `φ`. Co-authored by: Thomas Browning --- [](https://gitpod.io/from-referrer/) | t-category-theory | 133/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Grp.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Mon.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/Normal.lean,Mathlib/CategoryTheory/Monoidal/Mon.lean | 5 | 1 | ['github-actions'] | nobody | 1 hour ago | 1 hour ago | 1 hour |
| 38819 | Brian-Nugent | chore(RingTheory): tensorRight is exact for flat modules | Proves that tensorRight in ModuleCat is exact in the category theory sense (preserves finite limits and colimits). This was a TODO but it was essentially already done in #32326. --- [](https://gitpod.io/from-referrer/) | t-ring-theory | 13/2 | Mathlib/RingTheory/Flat/CategoryTheory.lean | 1 | 1 | ['github-actions'] | nobody | 57 minutes ago | 57 minutes ago | 57 minutes |
| 33501 | SnirBroshi | feat(Combinatorics/SimpleGraph/Degree): degrees for infinite graphs | Define `ENat` versions of `degree`/`minDegree`/`maxDegree` called `edegree`/`minEDegree`/`maxEDegree` respectively. --- The `e` prefix matches the existing `edist` and `ediam`. I will split this PR, but first I'd like to get positive signals on the concept. TODO (future work): `tsum G.edegree = 2 * G.edgeSet.encard` and then `ENat.card V * G.minEDegree ≤ 2 * G.edgeSet.encard ≤ ENat.card V * G.maxEDegree` (can we avoid topology [somehow](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/588756615)?) - [x] depends on: #38244 - [x] depends on: #38354 - [x] depends on: #38355 - [ ] depends on: #38356 - [ ] depends on: #38612 - [ ] depends on: #38747 Note: this PR used to be a refactor of the existing `degree`/`maxDegree`/`minDegree`, see the edits of this description. [](https://gitpod.io/from-referrer/) | large-import t-combinatorics blocked-by-other-PR | 571/23 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Copy.lean,Mathlib/Combinatorics/SimpleGraph/Degree.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/Order/WithBot.lean | 8 | 35 | ['IvanRenison', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vlad902'] | nobody | 48 minutes ago | 89 days ago | 14 days |
| 38813 | CBirkbeck | feat(NumberTheory/ModularForms): E₄ and E₆ generate the graded ring of level-1 modular forms | Establishes that `E₄` and `E₆` generate the graded ring `⨁ k, ModularForm 𝒮ℒ k` of level-1 modular forms freely as a `ℂ`-algebra.
## Status
**Draft / WIP**: the file currently contains scaffolding with two `sorry`s that mark the surjectivity and injectivity proofs of the evaluation homomorphism `evalE₄E₆ : ℂ[X₀, X₁] →ₐ[ℂ] ⨁ k, ModularForm 𝒮ℒ k`. Both proofs will be ported in follow-up commits from |
t-number-theory | 1048/0 | Mathlib.lean,Mathlib/NumberTheory/ModularForms/Discriminant.lean,Mathlib/NumberTheory/ModularForms/GradedRing.lean | 3 | 1 | ['github-actions'] | nobody | 46 minutes ago | unknown | 0 seconds |
| 38169 | tb65536 | chore(GroupTheory/Finiteness): make `Subgroup.FG` a class | This PR refactors `Subgroup.FG` to be a class to match `Group.FG`. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 37/20 | Mathlib/GroupTheory/Commutator/Finite.lean,Mathlib/GroupTheory/Finiteness.lean,Mathlib/GroupTheory/Rank.lean,Mathlib/GroupTheory/Schreier.lean | 4 | 10 | ['JovanGerb', 'github-actions', 'mathlib-bors', 'riccardobrasca', 'tb65536'] | riccardobrasca | 45 minutes ago | 4 hours ago | 14 days |
| 37130 | tb65536 | wip: ramification | --- - [x] depends on: #37803 - [ ] depends on: #37858 - [x] depends on: #37882 - [ ] depends on: #37890 - [ ] depends on: #37900 - [x] depends on: #38031 - [ ] depends on: #38062 - [x] depends on: #38081 - [x] depends on: #38082 - [x] depends on: #38083 - [ ] depends on: #38182 - [ ] depends on: #38186 - [ ] depends on: #38188 - [x] depends on: #38452 - [ ] depends on: #38465 [](https://gitpod.io/from-referrer/) | WIP t-number-theory blocked-by-other-PR | 335/0 | Mathlib/NumberTheory/RamificationInertia/Basic copy.lean | 1 | 3 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 41 minutes ago | 37 days ago | 14 seconds |
| 38787 | peabrainiac | feat(CategoryTheory/MorphismProperty): some lemmas for `MorphismProperty.strictMap` | Add some API lemmas for `MorphismProperty.strictMap` and other ways to transport morphism properties across functors. --- [](https://gitpod.io/from-referrer/) | t-category-theory | 125/14 | Mathlib/CategoryTheory/MorphismProperty/Basic.lean | 1 | 8 | ['github-actions', 'joelriou', 'peabrainiac', 'robin-carlier'] | nobody | 38 minutes ago | 42 minutes ago | 20 hours |
| 38811 | sharky564 | feat(Topology/Algebra/Module): bundle Submodule.mkQ as a continuous linear map | This PR adds `Submodule.mkQL`, the bundled continuous linear map version of `Submodule.mkQ`, paralleling the existing `Submodule.subtypeL` for `Submodule.subtype`. Two related lemmas are also added: `Submodule.continuous_mkQ` records that `Submodule.mkQ` is continuous, and `Submodule.isQuotientMap_mkQL` records that the bundled map is a quotient map. --- The motivation comes from work on topological complements in PR #38547. Seveler characterisations of topological complementarity in that context are most cleanly stated in terms of `mkQ` being a continuous linear map and a quotient map. This PR fills that gap. See also PR #38660 | t-topology new-contributor | 27/0 | Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 2 | 20 | ['eric-wieser', 'github-actions', 'sharky564', 'themathqueen'] | nobody | 36 minutes ago | 2 hours ago | 2 hours |
| 37310 | CoolRmal | feat(MeasureTheory): uniformly distributed outer regular measures in a second countable pseudometric space are unique up to a finite constant | In this PR we define uniformly distributed measures and prove [Christensen's Lemma](https://en.wikipedia.org/wiki/Spherical_measure), which says that uniformly distributed outer regular measures in a second countable pseudometric space are unique up to a finite constant. A classical application of Christensen's Lemma is to show that the restriction of the `n - 1`-dimensional Hausdorff measure onto an `n`-dimensional sphere coincides with the spherical measure. This will be done in another PR. --- - [x] depends on: #37311 - [x] depends on: #37312 - [x] depends on: #37313 [](https://gitpod.io/from-referrer/) | t-measure-probability | 198/1 | Mathlib.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/UniformlyDistributed.lean,Mathlib/Order/LiminfLimsup.lean | 4 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 33 minutes ago | 4 hours ago | 4 hours |
| 38818 | YaelDillies | refactor(Algebra/QuadraticAlgebra): crush `ℚ`-algebra diamond | From FormalConjectures --- [](https://gitpod.io/from-referrer/) | t-algebra | 27/34 | Mathlib/Algebra/QuadraticAlgebra/Basic.lean,Mathlib/Algebra/QuadraticAlgebra/Defs.lean | 2 | 3 | ['Whysoserioushah', 'github-actions'] | nobody | 29 minutes ago | 59 minutes ago | 59 minutes |
| 33662 | Pjotr5 | feat(Algebra/Order/BigOperators/Expect): add lemmas and strict variants | ### Summary - Combine `le_expect_nonempty_of_subadditive` and `le_expect_of_subadditive` into a single lemma `le_expect_of_subadditive`. The extra assumptions `(hs : s.Nonempty)` and `(h_zero : m 0 = 0)` are unnecessary (since `m 0 = 0` follows from `h_div`). This requires a small downstream update to `Mathlib/Analysis/RCLike/Basic.lean` (`norm_expect_le`). - Add strict-inequality variants: `expect_lt_expect`, `expect_lt`, `lt_expect`. - Add existence lemmas: `exists_le_of_expect_le_expect`, `exists_le_of_le_expect`, `exists_le_of_expect_le`, and `exists_lt_of_expect_lt_expect`. --- [](https://gitpod.io/from-referrer/) | new-contributor t-algebra awaiting-author | 40/2 | Mathlib/Algebra/Order/BigOperators/Expect.lean | 1 | 10 | ['Pjotr5', 'b-mehta', 'felixpernegger', 'github-actions', 'mathlib-merge-conflicts'] | eric-wieser | 28 minutes ago | 16 days ago | 98 days |
| 38796 | FernandoChu | chore(CategoryTheory): Products of sifted categories | Sadly, I don't know of a better way of making the `e` equivalence... AI disclosure: Claude code assisted in preparing this PR. | t-category-theory LLM-generated ready-to-merge | 24/0 | Mathlib/CategoryTheory/Limits/Sifted.lean,Mathlib/CategoryTheory/Products/Associator.lean | 2 | 10 | ['FernandoChu', 'github-actions', 'joelriou', 'robin-carlier'] | nobody | 24 minutes ago | 24 minutes ago | 4 hours |
| 38465 | tb65536 | refactor(Localization/AtPrime/Basic): add predicate for algebra instance on `Localization.AtPrime` | Currently [Localization.AtPrime](https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Localization/AtPrime/Basic.html#Localization.AtPrime.instAlgebraOfLiesOver) induces a diamond when the top ring is already an algebra over the localization of the bottom ring (e.g., this happens for `Ideal.Fiber`). This PR resolves the diamond by turning the instance into a def and adding a predicate typeclass. Zulip thread: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/instance.20diamond.20with.20.60Ideal.2EFiber.60 --- [](https://gitpod.io/from-referrer/) | t-ring-theory t-algebra delegated | 162/42 | Mathlib/AlgebraicGeometry/Morphisms/QuasiFinite.lean,Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean,Mathlib/NumberTheory/RamificationInertia/Unramified.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/Etale/Locus.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Flat/Localization.lean,Mathlib/RingTheory/Flat/Rank.lean,Mathlib/RingTheory/Ideal/GoingDown.lean,Mathlib/RingTheory/LocalRing/ResidueField/Ideal.lean,Mathlib/RingTheory/LocalRing/ResidueField/Instances.lean,Mathlib/RingTheory/LocalRing/ResidueField/Polynomial.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/QuasiFinite/Polynomial.lean,Mathlib/RingTheory/QuasiFinite/Weakly.lean,Mathlib/RingTheory/Smooth/Fiber.lean,Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean,Mathlib/RingTheory/TensorProduct/Maps.lean,Mathlib/RingTheory/Unramified/Dedekind.lean,Mathlib/RingTheory/Unramified/LocalRing.lean,Mathlib/RingTheory/Unramified/LocalStructure.lean,Mathlib/RingTheory/Unramified/Locus.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean | 24 | 9 | ['github-actions', 'leanprover-radar', 'mathlib-bors', 'riccardobrasca', 'tb65536'] | riccardobrasca | 20 minutes ago | 5 hours ago | 6 days |
| 38820 | chrisflav | chore(CategoryTheory/Limits): generalize properties of `P.Over` to `P.CostructuredArrow` | We also add one instance about `CostructuredArrow.toOver`. --- [](https://gitpod.io/from-referrer/) | t-category-theory | 69/21 | Mathlib/CategoryTheory/Limits/Constructions/Over/Connected.lean,Mathlib/CategoryTheory/Limits/MorphismProperty.lean | 2 | 0 | [] | nobody | 17 minutes ago | 16 minutes ago | 16 minutes |
| 38816 | tb65536 | refactor(GroupTheory/Finiteness): make duplicate definitions into abbrevs | The definitions `Submonoid.FG`, `Group.FG`, and `Subgroup.FG` are all equivalent to `Monoid.FG`, so I've made them into abbrevs. In the future we might even want to consider deprecating all but one to avoid having four ways to write the same thing. --- [](https://gitpod.io/from-referrer/) | t-algebra t-group-theory | 140/122 | Mathlib/Algebra/AffineMonoid/Irreducible.lean,Mathlib/GroupTheory/Finiteness.lean,Mathlib/GroupTheory/MonoidLocalization/Finite.lean,Mathlib/GroupTheory/Schreier.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Defs.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Defs.lean,Mathlib/RingTheory/Localization/InvSubmonoid.lean | 9 | 1 | ['github-actions'] | nobody | 16 minutes ago | 15 minutes ago | 15 minutes |
| 33958 | chrisflav | feat(AlgebraicGeometry): the small affine étale site | We define the small affine étale site of a scheme `S`. The underlying category is the category of commutative rings `R` equipped with an étale structure morphism `Spec R ⟶ S`. This category is essentially small (in contrast to the full small étale site).
We show that it has the same category of sheaves as the small étale site of `S` and deduce from this that étale sheafification of presheaves with values in `Type u` exists and that the category of sheaves on the étale site with values in a Grothendieck abelian category is Grothendieck abelian.
In particular, this allows us to define the étale cohomology groups of a sheaf with values in `Ab.{u}` to be in `Type u`.
From Proetale.
Co-authored-by: Joël Riou |
t-algebraic-geometry | 344/30 | Mathlib.lean,Mathlib/AlgebraicGeometry/LimitsOver.lean,Mathlib/AlgebraicGeometry/Morphisms/Etale.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/AlgebraicGeometry/Sites/Affine.lean,Mathlib/AlgebraicGeometry/Sites/AffineEtale.lean,Mathlib/CategoryTheory/Limits/Constructions/Over/Connected.lean,Mathlib/CategoryTheory/Limits/MorphismProperty.lean,Mathlib/CategoryTheory/MorphismProperty/Comma.lean,Mathlib/CategoryTheory/ObjectProperty/Small.lean | 10 | 7 | ['github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] | nobody | 13 minutes ago | 16 minutes ago | 22 minutes |
| 38336 | chrisflav | feat(CategoryTheory/Monoidal): actions by monoid objects | We define `MulActionObj` as a class containing an action morphism `M ⊗ X ⟶ X` compatible with the monoid structure on `M`. --- - [ ] depends on: #38342 [](https://gitpod.io/from-referrer/) | t-category-theory awaiting-author WIP | 199/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Cartesian/MulAction.lean | 2 | 8 | ['JovanGerb', 'chrisflav', 'github-actions', 'mathlib-dependent-issues', 'robin-carlier'] | nobody | 11 minutes ago | 10 days ago | 1 hour |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 13847 | alreadydone | feat(EllipticCurve): the universal elliptic curve | + Define the universal Weierstrass curve (`Universal.curve`) over the polynomial ring `ℤ[A₁,A₂,A₃,A₄,A₆]`, and the universal pointed elliptic curve (`Universal.pointedCurve`) over the field of fractions (`Universal.Field`) of the universal ring `ℤ[A₁,A₂,A₃,A₄,A₆,X,Y]/⟨P⟩ = Universal.Poly/⟨P⟩` (`Universal.Ring`, where `P` is the Weierstrass polynomial) with distinguished point `(X,Y)`. + Given a Weierstrass curve `W` over a commutative ring `R`, we define the specialization homomorphism `W.specialize : ℤ[A₁,A₂,A₃,A₄,A₆] →+* R`. If `(x,y)` is a point on the affine plane, we define `W.polyEval x y : Universal.Poly →+* R`, which factors through `W.ringEval x y : Universal.Ring →+* R` if `(x,y)` is on `W`. + Introduce the cusp curve `Y² = X³`, on which lies the rational point `(1,1)`, with the nice property that `ψₙ(1,1) = n`, making it easy to prove nonvanishing of the universal `ψₙ` when `n ≠ 0` by specializing to the cusp curve, which shows that `(X,Y)` is a point of infinite order on the universal pointed elliptic curve. --- - [x] depends on: #13845 - [x] depends on: #12883 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-algebraic-geometry | 543/208 | Mathlib.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean | 6 | 4 | ['Multramate', 'alreadydone', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 14167 | alreadydone | feat: Group scheme structure on Weierstrass curve | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-geometry workshop-AIM-AG-2024 | 727/41 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Scheme.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/LinearAlgebra/FreeModule/Basic.lean,Mathlib/RingTheory/AlgebraTower.lean,Mathlib/RingTheory/MvPolynomial/Basic.lean | 12 | 3 | ['Multramate', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 674 days ago | 12 seconds |
| 13297 | urkud | feat(Semicontinuous): add `comp` lemma | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 31/13 | Mathlib/Topology/Semicontinuous.lean | 1 | 3 | ['sgouezel', 'urkud'] | nobody | 1 year ago | 703 days ago | 5 hours |
| 12608 | eric-wieser | feat: allow `nsmul` / `zsmul` to be omitted again, with a warning | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-meta | 118/2 | Mathlib.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DefaultFieldLinter.lean,scripts/noshake.json,test/default_field_linter.lean | 6 | 12 | ['YaelDillies', 'eric-wieser', 'fpvandoorn', 'github-actions'] | nobody | 1 year ago | 712 days ago | 5 days |
| 12679 | MichaelStollBayreuth | perf(NumberTheory/RamificationInertia): speed up slow file | A repetition of the earlier experiment at [#12412](https://github.com/leanprover-community/mathlib4/pull/12412) with Lean 4.8.0-rc1. This time, I tried not to introduce local instances if possible, but instead to tweak instance priorities. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 57/14 | Mathlib/NumberTheory/RamificationInertia.lean | 1 | 3 | ['MichaelStollBayreuth', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 13057 | alreadydone | feat(NumberTheory): characterize elliptic divisibility sequences | Main results: + Every `normEDS` is an elliptic divisibility sequence (EDS). The key proof is `rel₄_of_anti_oddRec_evenRec`, based on my original argument first published on [MathSE](https://math.stackexchange.com/a/4903422/12932) + Conversely, every EDS is equal to some `normEDS` (assuming that the first two terms are not zero divisors) --- - [ ] depends on: #13155 - [x] depends on: #13153 - [x] depends on: #10843 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-number-theory blocked-by-other-PR | 1032/55 | Mathlib/Algebra/Ring/NegOnePow.lean,Mathlib/Data/Int/Defs.lean,Mathlib/Data/Int/Parity.lean,Mathlib/GroupTheory/Perm/Sign.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 5 | 6 | ['Multramate', 'alreadydone', 'kbuzzard', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 707 days ago | 9 hours |
| 12192 | Ruben-VandeVelde | feat: generalize isLittleO_const_id_atTop/atBot | From PNT+. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 10/4 | Mathlib/Analysis/Asymptotics/Asymptotics.lean | 1 | 6 | ['Ruben-VandeVelde', 'llllvvuu', 'urkud'] | nobody | 1 year ago | 743 days ago | 1 day |
| 10024 | ADedecker | feat: rename `connectedComponentOfOne` to `identityComponent`, prove that it is normal and open | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology awaiting-CI | 58/24 | Mathlib/FieldTheory/AbsoluteGaloisGroup.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Algebra/Group/TopologicalAbelianization.lean,Mathlib/Topology/Algebra/OpenSubgroup.lean,Mathlib/Topology/Connected/Basic.lean | 5 | 0 | [] | nobody | 1 year ago | 826 days ago | 13 minutes |
| 10521 | eric-wieser | chore: generalize `IsBoundedLinearMap` to modules | Most of the lemmas don't actually need the normed on the scalars at all. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 58/42 | Mathlib/Analysis/NormedSpace/BoundedLinearMaps.lean | 1 | 3 | ['github-actions', 'j-loreaux', 'urkud'] | nobody | 1 year ago | 806 days ago | 1 day |
| 10594 | lecopivo | feat: `fun_trans` function transformation tactic e.g. for computing derivatives | feat: `fun_trans` function transformation tactic e.g. for computing derivatives Function transformation tactic/simproc. For example it can be used for computing derivatives. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 1819/56 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/FunProp/Elab.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/MorExt.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunTrans/Attr.lean,Mathlib/Tactic/FunTrans/Core.lean,Mathlib/Tactic/FunTrans/Decl.lean,Mathlib/Tactic/FunTrans/Elab.lean,Mathlib/Tactic/FunTrans/Theorems.lean,Mathlib/Tactic/FunTrans/Types.lean,test/fun_prop2.lean,test/fun_prop_dev.lean,test/fun_trans_dev.lean | 17 | 11 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 10721 | urkud | feat(Order/FunLike): define `PointwiseLE` | - introduce a mixin class `DFunLike.PointwiseLE`, use it to define `DFunLike.instPartialOrder`; - add a generic `DFunLike.orderEmbeddingCoe` - add `DFunLike.PointwiseLE` instances here and there. With this refactor and #13022, I'm going to generalize lemmas like `MeasureTheory.ae_mono` to `OuterMeasureClass`. --- - [x] depends on: #12983 [](https://gitpod.io/from-referrer/) | merge-conflict t-order t-logic | 123/50 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Ring.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/GroupTheory/Congruence.lean,Mathlib/Order/FunLike.lean,Mathlib/Order/Heyting/Hom.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Hom/Bounded.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Topology/Order/Hom/Basic.lean | 13 | 48 | ['YaelDillies', 'dupuisf', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 689 days ago | 64 days |
| 11100 | eric-wieser | feat(CategoryTheory/Limits): add `Functor.mapBinaryBiconeInv` | --- - [ ] depends on: #11130 [](https://gitpod.io/from-referrer/) It's tempting to try to prove something like ```lean theorem Functor.mapBinaryBiconeInv_toCone [Limits.HasZeroMorphisms C] [Limits.HasZeroMorphisms D] (e : D ⥤ C) [IsEquivalence e] {X Y : D} (b : BinaryBicone (e.obj X) (e.obj Y)) : (e.mapBinaryBiconeInv b).toCone = (e.mapConeInv <| (Cones.postcompose (pairComp X Y e).symm.hom).obj b.toCone) := by simp sorry theorem Functor.mapBinaryBiconeInv_toCocone [Limits.HasZeroMorphisms C] [Limits.HasZeroMorphisms D] (e : D ⥤ C) [IsEquivalence e] {X Y : D} (b : BinaryBicone (e.obj X) (e.obj Y)) : (e.mapBinaryBiconeInv b).toCocone = (e.mapCoconeInv <| (Cocones.precompose (pairComp X Y e).hom).obj b.toCocone) := by sorry ``` but maybe equality is evil here | merge-conflict t-category-theory awaiting-CI | 52/0 | Mathlib/CategoryTheory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Equivalence.lean,Mathlib/CategoryTheory/Limits/Preserves/Shapes/Biproducts.lean | 3 | 6 | ['TwoFX', 'eric-wieser', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8503 | thorimur | feat: meta utils for `refine?` | This PR introduces some metaprogramming infrastructure and utilities that are necessary for `refine?` (#8364). * `elabTermWithHoles'` (and `withCollectingNewGoalsFrom'`): a more configurable version of `elabTermWithHoles`, which allows: preserving the initial mvar type; *not* tagging untagged goals; and postponing mvars. * Some `Syntax` and `TSyntax` functionality, including: * `TSyntax.map`(`M`), for acting on `TSyntax` with functions `f : Syntax -> (m) Syntax` * Range operations: `includes` and `isEqByRange` * `setTrailingInfoBy?` and `unsetOriginalTrailing`, which is like `unsetTrailing`, but behaves as expected. * `Term.withoutModifyingState`, which does not allow unknown mvarIds to escape via the infotree * `hasNewErrors`, which runs a monad computation and returns the value along with `true` or `false` depending on whether new error messages have been logged * the option `pp.anonymousMVarSuffixes`, which can be set to `false` to replace all numeric suffixes of anonymous mvars with `✝`, which is useful in tandem with `#guard_msgs` for tests (but is essentially a workaround—although it can make some tactic states more legible). --- I'm open to suggestions on the location and name of the option/delaborator used for trimming the numeric suffixes of anonymous mvar names (which is used in the tests)—including whether or not it should exist in the first place, as it's essentially just a workaround. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 312/5 | Mathlib.lean,Mathlib/Lean/CoreM.lean,Mathlib/Lean/Elab/Tactic/ElabTerm.lean,Mathlib/Lean/Elab/Term.lean,Mathlib/Util/Delaborators.lean,Mathlib/Util/Syntax.lean | 6 | 2 | ['kmill', 'thorimur'] | kmill | 1 year ago | 856 days ago | 38 days |
| 8519 | eric-wieser | refactor(LinearAlgebra/TensorProduct): golf using `liftAddHom` | This new `TensorProduct.liftAddHom` doesn't require bilinearity, only that scalar multiplication can be moved between the arguments. While in theory we only need the `AddMonoidHom` version as it offers exactly the same generality, we first provide an unbundled `liftFun` as this seems to give a sizeable performance boost if used in downstream `lift` variants. --- - [x] depends on: #8571 - [x] depends on: #8584 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 53/50 | Mathlib/Algebra/Category/AlgebraCat/Monoidal.lean,Mathlib/LinearAlgebra/TensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean | 3 | 28 | ['bustercopley', 'eric-wieser', 'jcommelin', 'jjaassoonn', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib-bors'] | nobody | 1 year ago | 879 days ago | 5 days |
| 8616 | eric-wieser | feat(Algebra/FreeAlgebra): add right action and `IsCentralScalar` | --- - [ ] depends on: #8652 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI | 30/8 | Mathlib/Algebra/FreeAlgebra.lean | 1 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 886 days ago | 2 days |
| 8658 | eric-wieser | feat: support right actions for `Con` | This adds a new `Con.CompatibleSMul` typeclass that captures exactly the condition when `smul` descends to the quotient. I was not quite able to merge this with `MulAction.QuotientAction`: * The imports are such that the congruence relation `QuotientGroup.con` is not yet available in that file * `QuotientGroup.con` requires the subgroup to be normal, while `MulAction.QuotientAction` does not --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 80/18 | Mathlib/GroupTheory/Congruence.lean,Mathlib/RingTheory/Congruence.lean | 2 | 6 | ['YaelDillies', 'eric-wieser'] | nobody | 1 year ago | 856 days ago | 29 days |
| 8788 | FMLJohn | feat(Algebra/Module/GradeZeroModule): if `A` is a graded semiring and `M` is a graded `A`-module, then each grade of `M` is a module over the 0-th grade of `A`. | --- - [ ] depends on: #8187 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 237/4 | Mathlib.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean | 6 | 4 | ['FMLJohn', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 879 days ago | 1 day |
| 8906 | jjaassoonn | feat: add some missing lemmas about linear algebra | --- - [ ] depends on: #8905 [lifting injective modules to higher universe] [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 45/1 | Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Module/Injective.lean,Mathlib/LinearAlgebra/Basic.lean,Mathlib/LinearAlgebra/BilinearMap.lean | 4 | 21 | ['AntoineChambert-Loir', 'alreadydone', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 875 days ago | 5 minutes |
| 8961 | eric-wieser | refactor: use the coinduced topology on ULift | --- - [x] depends on: #8958 [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict awaiting-author awaiting-CI | 46/14 | Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Topology/Bornology/Constructions.lean,Mathlib/Topology/Constructions.lean | 3 | 6 | ['eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 872 days ago | 1 second |
| 9146 | laughinggas | feat(Data/ZMod/Defs): Topological structure on `ZMod` | Added a discrete topology structure to `ZMod n` for all `n` --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-topology | 55/3 | Mathlib.lean,Mathlib/Topology/Algebra/Constructions.lean,Mathlib/Topology/Algebra/Group/Basic.lean,Mathlib/Topology/Instances/ZMod.lean,Mathlib/Topology/Maps.lean | 5 | 61 | ['YaelDillies', 'eric-wieser', 'github-actions', 'jcommelin', 'laughinggas', 'mo271', 'urkud'] | nobody | 1 year ago | 845 days ago | 7 days |
| 9229 | eric-wieser | refactor(Algebra/GradedMonoid): Use `HMul` to define `GMul` | This make the notation much nicer, but I'm pretty sure this is a bad idea for performance / ambiguity reasons. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 114/125 | Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/DirectSum/Ring.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/GradedMulAction.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/MonoidAlgebra/ToDirectSum.lean,Mathlib/LinearAlgebra/TensorAlgebra/ToTensorPower.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean | 11 | 6 | ['eric-wieser', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9354 | chenyili0818 | feat: monotonicity of gradient on convex real-valued functions | This file is based on Mathlib.Analysis.Calculus.Gradient.Basic, and describes the calculation properties co-authored-by: Ziyu Wang [tropicalfish910@gmail.com](mailto:tropicalfish910@gmail.com) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 540/0 | Mathlib.lean,Mathlib/Analysis/Convex/ConvexFunction.lean | 2 | 15 | ['github-actions', 'winstonyin'] | nobody | 1 year ago | 829 days ago | 23 days |
| 9356 | alexjbest | feat: assumption? | A little helper for replacing `assumption`s with `exact` statements quickly --- If this is approved I will add tests This begs the question of whether it might simply be better to add some sort of code action for "replace with trythis output" [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 24/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/TryAssumption.lean | 4 | 5 | ['alexjbest', 'j-loreaux', 'jcommelin'] | nobody | 1 year ago | 833 days ago | 19 days |
| 9469 | dupuisf | feat: maximum modulus principle for functions vanishing at infinity | This PR adds versions of the maximum modulus principle for functions vanishing at infinity that parallel those we already had for functions over a bounded set. These will have applications in e.g. norm interpolation. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-analysis | 71/0 | Mathlib/Analysis/Complex/AbsMax.lean | 1 | 8 | ['dupuisf', 'j-loreaux'] | nobody | 1 year ago | 833 days ago | 12 days |
| 9487 | eric-wieser | feat: the exponential of dual numbers over non-commutative rings | This is a work in progress, as I don't know my way around the measure theory library. --- - [x] depends on: #9489 - [x] depends on: #9486 - [x] depends on: #10427 - [ ] depends on: #10452 [](https://gitpod.io/from-referrer/) | WIP t-algebra t-measure-probability merge-conflict t-analysis | 97/0 | Mathlib/Analysis/NormedSpace/TrivSqZeroExt.lean | 1 | 7 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9510 | eric-wieser | feat(Analysis/Calculus/DualNumber): Extending differentiable functions to dual numbers | This shows that this operation preserves multiplication and composition --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-analysis awaiting-CI | 119/0 | Mathlib/Analysis/Calculus/DualNumber.lean | 1 | 4 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 9570 | eric-wieser | feat(Algebra/Star): Non-commutative generalization of `StarModule` | [Zulip thread](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Star.20modules.20over.20non-commutative.20scalars/near/383664005). Until we address #7152, we have to have both `StarModule` and `StarModule'`. To prove this generalization is useful, this shows that with it as an assumption, `TrivSqZeroExt` is a `StarRing`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra awaiting-CI | 66/6 | Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/Pi.lean,Mathlib/Algebra/Star/Prod.lean,Mathlib/Algebra/TrivSqZeroExt.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 9642 | eric-wieser | refactor(Analysis/Normed/{Group/Field}/Basic): Let `extends` generate the repeated fields | New-style structure shenanigans mean that instance constructors randomly complain about a missing field that can be found with `__ : MetricSpace _ := infer_instance`. --- [](https://gitpod.io/from-referrer/) I will write a longer PR description for this once CI is happy | WIP merge-conflict awaiting-author help-wanted t-analysis | 122/202 | Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Matrix.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Group/Completion.lean,Mathlib/Analysis/Normed/Order/Basic.lean,Mathlib/Analysis/NormedSpace/ProdLp.lean,Mathlib/Analysis/NormedSpace/Star/Matrix.lean,Mathlib/Analysis/NormedSpace/Unitization.lean,Mathlib/Analysis/Quaternion.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/InformationTheory/Hamming.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean | 17 | 11 | ['eric-wieser', 'leanprover-bot', 'urkud'] | nobody | 1 year ago | unknown | 0 seconds |
| 6580 | adomani | chore: `move_add`-driven replacements | This PR accompanies #6576 and uses `move_add/mul` to simplify/streamline a selection of proofs. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 12/13 | Counterexamples/Monic_nonRegular.lean,Mathlib/Algebra/Associated.lean,Mathlib/Data/Polynomial/RingDivision.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean | 4 | 0 | [] | nobody | 1 year ago | 925 days ago | 62 days |
| 6630 | MohanadAhmed | feat: Reduced Spectral Theorem | For A hermitian matrix $A : n \times n$ with rank $A.rank \leq n$, we can eliminate the zero eigenvalues and their corresponding eigenvectors from the (alternate) spectral theorem. As such the matrix $A$ can be written as: $$A = V₁ D V₁ᴴ$$ where - $V₁$ : $n \times r$ is the matrix of eigenvector with non-zero associated eigenvalues. - $D$ is $r \times r$ is the diagonal matrix containing only non-zero eigenvalues on its main diagonal. with $r = A.rank$ being the rank of the matrix Towards that goal we make several equivalence definitions: - `{i // hA.eigenvalues i ≠ 0} ≃ Fin (A.rank)` the set of non-zero eigenvalues can be indexed by the numbers from 0 to (r - 1). - `{i // ¬ hA.eigenvalues i ≠ 0} ≃ Fin (n - A.rank)` the set of non-zero eigenvalues can be indexed by the numbers from 0 to (n - r - 1). - `{i // hA.eigenvalues i ≠ 0} ⊕ {i // ¬hA.eigenvalues i ≠ 0} ≃ n`: the index set of the matrix (together with the associated eigenvector matrix and eigenvalues matrix ) can be partitioned into two complement groups the ones corresponding to non-zero eigenvalues and the ones corresponding to zero eigenvalues. - We can then put the previous definitions together to obtain a: `Fin (A.rank) ⊕ Fin (Fintype.card n - A.rank) ≃ n` --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 31/0 | Mathlib/LinearAlgebra/Matrix/Spectrum.lean | 1 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6791 | eric-wieser | refactor: Use flat structures for morphisms | This restores the symmetry we had in Lean3, where we had `MonoidHom.mk f one mul` not `MonoidHom.mk (OneHom.mk f one) mul`, and `f.toFun` wasn't notation for `f.toMulHom.toFun`. The nesting provided by the previous inheritance is useless to us in the face of `MonoidHomClass.toMonoidHom`, which completely eta-expands the structure anyway. We call the class `FunLikeFlatHack._` because this means the field is called `to_` which uses up less space in the goal view than any alternative. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted awaiting-CI | 174/201 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Category/GroupCat/ZModuleEquivalence.lean,Mathlib/Algebra/Category/GroupWithZeroCat.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf.lean,Mathlib/Algebra/Category/MonCat/Basic.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/Hom/Equiv/Basic.lean,Mathlib/Algebra/Hom/Group/Defs.lean,Mathlib/Algebra/Hom/GroupAction.lean,Mathlib/Algebra/Hom/NonUnitalAlg.lean,Mathlib/Algebra/Hom/Ring/Defs.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Module/Equiv.lean,Mathlib/Algebra/Module/LinearMap.lean,Mathlib/Algebra/Order/Hom/Ring.lean,Mathlib/Algebra/Order/Interval.lean,Mathlib/Algebra/Ring/Equiv.lean,Mathlib/Analysis/Normed/Group/SemiNormedGroupCat.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Data/Rat/Cast/CharZero.lean,Mathlib/Data/Real/EReal.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/LinearAlgebra/Quotient.lean,Mathlib/LinearAlgebra/TensorProduct.lean,Mathlib/RingTheory/RingInvo.lean,Mathlib/Topology/Algebra/Module/Basic.lean,Mathlib/Topology/MetricSpace/Dilation.lean | 32 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6930 | kmill | feat: `resynth_instances` tactic for resynthesizing instances in the goal or local context | This tactic can be useful for debugging non-canonical instances or for fixing up goals and hypotheses after using the `classical` tactic. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 327/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ResynthInstances.lean,test/ResynthInstances.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6931 | urkud | refactor(Analysis/Normed*): use `RingHomIsometric` for `*.norm_cast` | --- I don't understand why linter fails. [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted t-analysis | 78/68 | Mathlib/Analysis/LocallyConvex/ContinuousOfBounded.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/NormedSpace/Basic.lean,Mathlib/Analysis/NormedSpace/Exponential.lean,Mathlib/Analysis/NormedSpace/Spectrum.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/NumberTheory/NumberField/Embeddings.lean | 8 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 7227 | kmill | feat: flexible binders and integration into notation3 | Introduces `flexibleBinders`, which is an extensible system for binder notations that allow destructuring, bounded domains, and other niceties. Integrates this into `notation3`, and makes `Finset.sum`/`Finset.prod` use it. --- - [ ] depends on: #6833 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 1215/131 | Mathlib.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/NatAntidiagonal.lean,Mathlib/Mathport/Notation.lean,Mathlib/Util/FlexibleBinders.lean,Mathlib/Util/FlexibleBindersFinset.lean,Mathlib/Util/SyntaxFun.lean,test/FlexibleBinders.lean,test/notation3.lean | 10 | 3 | ['eric-wieser', 'kmill', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 7351 | shuxuezhuyi | feat(Topology/Algebra/Order): extend function on `Ioo` to `Icc` | Extend a strictly monotone function defined on an open interval. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-order | 59/0 | Mathlib.lean,Mathlib/Data/Set/Function.lean,Mathlib/Topology/Algebra/Order/IccExtendFromIoo.lean | 3 | 7 | ['j-loreaux', 'shuxuezhuyi'] | nobody | 1 year ago | 918 days ago | 30 days |
| 7467 | ADedecker | feat: spectrum of X →ᵇ ℂ is StoneCech X | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 121/23 | Mathlib/Analysis/NormedSpace/Star/BoundedContinuousFunction.lean,Mathlib/Analysis/NormedSpace/Star/GelfandDuality.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/ContinuousFunction/Compact.lean | 4 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 7564 | shuxuezhuyi | feat(Topology/Algebra/Order): extend strictly monotone function on `Ioo` to homeomorphism on `Icc` | A strictly monotone function between open intervals can be extended to a homeomorphism between the closed intervals. --- - [ ] depends on: #7351 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR | 162/0 | Mathlib.lean,Mathlib/Topology/Algebra/Order/IccExtendFromIoo.lean | 2 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 937 days ago | 8 minutes |
| 7601 | digama0 | feat: ring hom support in `ring` | As [requested on Zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/aroots/near/395750055). Adds support for distributing ring morphisms in `ring`: ```lean example (p : ℤ[X]) (r : ℤ) : C (2 * r) * p = C r * p + C r * p := by ring ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-meta | 257/48 | Mathlib/Tactic/Ring/Basic.lean,test/linear_combination.lean,test/ring.lean | 3 | 1 | ['eric-wieser'] | nobody | 1 year ago | 872 days ago | 62 days |
| 7615 | eric-wieser | chore(LinearAlgebra/Basic): generalize compatibleMaps to semilinear maps | Spotted while reviewing #7611 --- - [x] depends on: #7611 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra easy awaiting-CI | 9/33 | Mathlib/LinearAlgebra/Basic.lean | 1 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 933 days ago | 1 second |
| 7713 | RemyDegenne | feat: add_left/right_inj for measures | `μ + ν₁ = μ + ν₂ ↔ ν₁ = ν₂`, and similarly on the right. This is not true in general for measures, but is true when `μ` is mutually singular with the two other measures or when `μ` is finite. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 53/1 | Mathlib/MeasureTheory/Measure/MutuallySingular.lean,lean-toolchain | 2 | 6 | ['RemyDegenne', 'digama0', 'eric-wieser', 'fpvandoorn'] | nobody | 1 year ago | 927 days ago | 17 hours |
| 7835 | shuxuezhuyi | feat(LinearAlgebra/Matrix): `lift` for projective special linear group | We provide converters to help with the use of "quotient.liftOn" on projective special linear groups. --- - [x] depends on: #7826 - [x] depends on: #7791 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 52/0 | Mathlib/LinearAlgebra/Matrix/ProjectiveSpecialLinearGroup.lean | 1 | 3 | ['jcommelin', 'leanprover-community-mathlib4-bot', 'shuxuezhuyi'] | jcommelin | 1 year ago | 785 days ago | 1 day |
| 7875 | astrainfinita | chore: make `SMulCommClass A A B` and `SMulCommClass A B B` higher priority | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 54/48 | Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Algebra/Group/Subgroup/Actions.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/Ring/CentroidHom.lean,Mathlib/Algebra/Ring/Subring/Basic.lean,Mathlib/Algebra/Ring/Subsemiring/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/NormedSpace/lpSpace.lean,Mathlib/Data/Matrix/Basic.lean,Mathlib/GroupTheory/GroupAction/Prod.lean,Mathlib/GroupTheory/GroupAction/Ring.lean,Mathlib/GroupTheory/GroupAction/SubMulAction.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/GroupTheory/Submonoid/Center.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/Topology/ContinuousFunction/ContinuousMapZero.lean,Mathlib/Topology/ContinuousFunction/StoneWeierstrass.lean,Mathlib/Topology/ContinuousFunction/ZeroAtInfty.lean | 27 | 15 | ['Parcly-Taxel', 'astrainfinita', 'jcommelin', 'leanprover-bot'] | nobody | 1 year ago | 693 days ago | 1 day |
| 7932 | eric-wieser | refactor(Algebra/TrivSqZeroExt): replace with a structure | This is dogfooding my claim that "one-field structures are the lesser evil in Lean 4". This runs into the `simp [(stupid_parens)]` bug; or rather, a particular nasty instance of it where the offending simp call is inside `@[simps]`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI | 155/73 | Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/TrivSqZeroExt.lean,Mathlib/Logic/Equiv/TransferInstance.lean,Mathlib/Topology/Instances/TrivSqZeroExt.lean | 4 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 7962 | eric-wieser | feat: `DualNumber (Quaternion R)` as a `CliffordAlgebra` | This provides a clifford algebra isomorphic to the dual quaternions --- - [x] depends on: #7934 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 307/7 | Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/QuaternionBasis.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Equivs.lean | 3 | 16 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8364 | thorimur | feat: `refine?` | This PR adds `refine? e`, which suggests replacing unsynthesized `_`'s in `e` with `?_` in order to make `refine e'` work: ```lean example : Nat → Nat := by refine? fun (_ : _) => _ -- Try this: refine fun (_ : _) => ?_ ``` Note that this only suggests replacements for `_`'s present in the syntax; to create goals for implicit or instance arguments, the user is expected to use `refine'`. --- I'm especially open to suggestions on the filename (currently `RefineFix`). I'm also curious if this behaves as expected! Feel free to try it out "in real life" and comment here on edge cases. - [ ] depends on: #8503 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-meta | 684/5 | Mathlib.lean,Mathlib/Lean/CoreM.lean,Mathlib/Lean/Elab/Tactic/ElabTerm.lean,Mathlib/Lean/Elab/Term.lean,Mathlib/Tactic.lean,Mathlib/Tactic/RefineFix.lean,Mathlib/Util/Delaborators.lean,Mathlib/Util/Syntax.lean,test/RefineFix.lean | 9 | 5 | ['j-loreaux', 'leanprover-community-mathlib4-bot', 'thorimur'] | nobody | 1 year ago | 894 days ago | 6 days |
| 4871 | j-loreaux | feat: define the additive submonoid of positive elements in a star ordered ring | This file defines the `AddSubmonoid` of nonegative elements `StarOrderedRing.positive R` in a star ordered ring `R` with carrier `{ x : R | 0 ≤ x }` (in fact, the definition only requires `OrderedAddCommMonoid R` to allow for other use cases, but it is primarily intended for `StarOrderedRing R`). Equivalently, this is the `AddSubmonoid` generated by the elements of the form `star s * s`. Even though this technically corresponds to the nonnegative elements, the "positive" terminology is standard throughout the literature (at least in C⋆-algebra theory and operator theory), so we choose to prefer that. The advantage of using this over other definitions of positivity is that it allows us to unify several different concepts under a single umbrella. For example, one might be tempted to consider the collection of bounded linear operators on an Hilbert space and define positivity as `∀ x, 0 ≤ ⟪T x, x⟫`, but this doesn't generalize nicely to C⋆-algebras. Alternatively, one could define positivity as those self-adjoint elements with nonnegative spectrum, but this requires the algebra to be unital. Our definition herein conveniently sidesteps these issues. --- Note: I declared the `AddMonoidWithOne` and `AddGroupWithOne` instances for `selfAdjoint R` separately because it made the proof of the latter easier. - [x] depends on: #6229 - [x] depends on: #10209 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-CI | 216/12 | Mathlib.lean,Mathlib/Algebra/Order/Ring/CharZero.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Star/Positive.lean,Mathlib/Algebra/Star/SelfAdjoint.lean,Mathlib/GroupTheory/Submonoid/Operations.lean | 6 | 28 | ['eric-wieser', 'j-loreaux', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 1052 days ago | 5 days |
| 5133 | kmill | feat: IntermediateField adjoin syntax for sets of elements | Adds support for both `F⟮S⟯` and `F⟮α⟯`. The term `x` in `F⟮x⟯` is elaborated, and if it has type `Set _` the first interpretation is used, and otherwise the second is. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 110/55 | Mathlib/FieldTheory/Adjoin.lean | 1 | 0 | [] | nobody | 1 year ago | 1050 days ago | 20 seconds |
| 5912 | ADedecker | feat(Analysis.Distribution.ContDiffMapSupportedIn): space of smooth maps with support in a fixed compact | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 513/13 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Data/Set/Function.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean | 8 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 6002 | slerpyyy | feat(Analysis.SpecialFunctions.Gaussian): add `integrable_fun_mul_exp_neg_mul_sq` | If `f : ℝ → ℝ` is bounded by a polynomial, `fun x : ℝ => f x * exp (-b * x ^ 2)` is integrable. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 26/0 | Mathlib/Analysis/SpecialFunctions/Gaussian.lean | 1 | 3 | ['ocfnash', 'slerpyyy', 'urkud'] | nobody | 1 year ago | 1007 days ago | 9 days |
| 6195 | eric-wieser | chore(RingTheory/TensorProduct): golf the `mul` definition | --- - [x] depends on: #6211 - [x] depends on: #6187 [](https://gitpod.io/from-referrer/) Strangely this causes a timeout downstream | merge-conflict t-algebra awaiting-CI | 4/29 | Mathlib/RingTheory/TensorProduct.lean | 1 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 6328 | astrainfinita | chore: make some instance about `Sub...Class` lower priority | Many similar instances have been marked as lower priority. I'd like to see if this would make things faster. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra awaiting-CI | 14/14 | Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/RingTheory/Subsemiring/Basic.lean,lean-toolchain | 3 | 1 | ['digama0'] | nobody | 1 year ago | unknown | 0 seconds |
| 6330 | astrainfinita | chore: make some instance about `Sub...Class` higher priority than `Sub...` | The opposite direction to #6328. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra slow-typeclass-synthesis | 123/128 | Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/FieldTheory/IsAlgClosed/Basic.lean,Mathlib/FieldTheory/Subfield.lean,Mathlib/RingTheory/NonUnitalSubring/Basic.lean,Mathlib/RingTheory/NonUnitalSubsemiring/Basic.lean,Mathlib/RingTheory/Polynomial/Quotient.lean,Mathlib/RingTheory/Subring/Basic.lean,Mathlib/RingTheory/Subsemiring/Basic.lean,lean-toolchain | 11 | 13 | ['astrainfinita', 'digama0', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 6403 | astrainfinita | chore: change instance priorities of `Ordered*` hierarchy | --- [](https://gitpod.io/from-referrer/) | t-algebra t-order merge-conflict slow-typeclass-synthesis awaiting-author | 253/79 | Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Star.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/RingTheory/HahnSeries.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 18 | 39 | ['Vierkantor', 'astrainfinita', 'digama0', 'eric-wieser', 'j-loreaux', 'leanprover-bot'] | nobody | 1 year ago | 883 days ago | 13 days |
| 6491 | eric-wieser | chore(Mathlib/Algebra/Hom/GroupAction): add `SMulHomClass.comp_smul` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 24/10 | Mathlib/Algebra/Hom/GroupAction.lean | 1 | 0 | [] | nobody | 1 year ago | 911 days ago | 83 days |
| 7076 | grunweg | feat: define measure zero subsets of a manifold | A topological manifold has no canonical measure, but there is a canonical notion of measure zero subsets. We show that these are closed under subsets and countable unions (hence define a filter, the almost everywhere filter) and that a closed nowhere dense has empty interior. This is necessary for stating the general version of Sard's theorem (in finite dimensions), and a first step towards its proof. This code was written at LftCM 2023. Thanks for @fpvandoorn for mentoring me! :heart: --- Unresolved questions/looking for feedback - Is "measure zero" a good name or would "null set" be better? I tend towards the former, but welcome input from a measure theorist (which I'm not). - What is the correct definition? One could also define "measure zero" using any `IsOpenPosMeasure` on the charted space. I think all results in this file still hold then, but for applications (e.g., Sard's theorem), this might be too general. - define custom notation, similar to the a.e. filter on a measure space? (We could include $J$ instead of $\mu$.) - what's the right syntax for formulas in docstrings --- use LaTeX or backticks? I don't know how to preview the generated docs, the guidelines are a bit ambiguous for me. | merge-conflict WIP t-differential-geometry t-measure-probability | 165/0 | Mathlib.lean,Mathlib/Geometry/Manifold/MeasureZero.lean,docs/references.bib | 3 | 27 | ['ADedecker', 'github-actions', 'grunweg', 'mo271', 'sgouezel'] | ADedecker | 1 year ago | 794 days ago | 43 days |
| 3757 | thorimur | feat: config options for `fail_if_no_progress` | This PR creates config options for `fail_if_no_progress` that allow the user to tweak what exactly counts as "progress". This includes whether to use defeq or `BEq`, what transparency to use, and which parts of the goal and local context to check. It also splits off the comparison functionality into `Mathlib.Lean.Meta.Compare`, which provides fully configurable comparison functions for common complex metaprogramming types not specific to `fail_if_no_progress`. These types are `Expr`, `LocalDecl`, `LocalContext`, `MetavarDecl`, `MVarId`, and `List MVarId`. --- See [zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/progress.20on.20fail_if_no_progress) for a couple review questions. Status update: this PR is now basically done, save for some extra tests which should probably be included. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 603/54 | Mathlib.lean,Mathlib/Lean/Meta.lean,Mathlib/Lean/Meta/Compare.lean,Mathlib/Tactic/FailIfNoProgress.lean,test/fail_if_no_progress.lean | 5 | 38 | ['alexjbest', 'github-actions', 'joneugster', 'kim-em', 'thorimur'] | nobody | 1 year ago | 978 days ago | 45 days |
| 12353 | thorimur | feat: `conv%` | This PR introduces `conv% e => tac`, along with `simp%`, `norm_num%`, and `push_neg%`, which are defined in terms of `conv%`. It also introduces `conv%?` (and `simp%?`, `norm_num%?`, and `push_neg%?`) as shortcuts for `show_term ...`. This is a relatively straightforward refactor of code already present in the implementation of `#conv`, and otherwise relies entirely on simple macros. This PR also introduces some modifications to existing command syntax for `#conv`, `#simp`, and `#norm_num`: * The syntax for `#conv` was `#conv tac => e`; however, this is inconsistent with the tactic syntax, and so this has been flipped to `#conv e => tac`. Likewise, `conv%` uses the same (new) syntax `conv% e => tac`. * `#simp` and `#norm_num` separated their config and `only` syntax from the expression by an optional `=>` (for `#simp`) and an optional `:` (for `#norm_num`) (e.g. `#simp only [lem] => e`). These have both been replaced with an optional`on` (e.g. `#simp only [lem] on e`) which is also used for `simp%` and `norm_num%`. Although `#whnf` is implemented in terms of `#conv`, this PR doesn't introduce `whnf%` in the same way, as that's probably better off being implemented directly instead of through `conv`. --- WIP: needs tests. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-meta | 131/32 | Mathlib/Tactic/Conv.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/PushNeg.lean,docs/Conv/Guide.lean | 4 | 0 | [] | nobody | 1 year ago | 738 days ago | 17 seconds |
| 7903 | urkud | feat: define `UnboundedSpace` | --- The new instances generate some timeouts, and I don't understand why. [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted t-topology | 111/59 | Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Topology/Bornology/Basic.lean,Mathlib/Topology/Bornology/Constructions.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/GromovHausdorffRealized.lean | 6 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 15679 | adomani | test: refactor in CI | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 213/5 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,Mathlib.lean,Mathlib/Algebra/Homology/HomotopyCategory/SingleFunctors.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unique.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/CategoryTheory/Bicategory/Adjunction.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/GroupTheory/Coxeter/Matrix.lean,Mathlib/Order/Filter/Cocardinal.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/TestRefactor.lean,Refactor/Main.lean,lakefile.lean,lean-toolchain | 21 | 1 | ['github-actions'] | nobody | 1 year ago | 629 days ago | 8 seconds |
| 7565 | shuxuezhuyi | feat(Topology/Algebra/Order): extend homeomorphism of `Ioo` to `Icc` | We extend the homeomorphisms between open intervals to homeomorphisms between the closed intervals. --- - [ ] depends on: #7018 - [ ] depends on: #7351 - [ ] depends on: #7564 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR t-order | 389/5 | Mathlib.lean,Mathlib/Data/Set/Intervals/Image.lean,Mathlib/Order/Directed.lean,Mathlib/Topology/Algebra/Order/IccExtendFromIoo.lean,Mathlib/Topology/Algebra/Order/IntermediateValue.lean | 5 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 937 days ago | 3 minutes |
| 10629 | madvorak | feat: List.cons_sublist_append_iff_right | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 11/0 | Mathlib/Data/List/Basic.lean | 1 | 1 | ['eric-wieser'] | nobody | 1 year ago | 751 days ago | 53 days |
| 9973 | Ruben-VandeVelde | feat: polynomials formed by lists | From https://github.com/leanprover-community/mathlib/pull/15476 --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-data | 311/0 | Mathlib.lean,Mathlib/Data/Polynomial/OfList.lean | 2 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 12926 | joelriou | feat(CategoryTheory): the monoidal category structure induced by a monoidal functor | In this PR, given a monoidal functor `F : MonoidalFunctor C D`, we define a monoidal category structure on the category `InducedCategory D F.obj`, which has the "same" objects as `C`, but the morphisms between `X` and `Y` identify to `F.obj X ⟶ F.obj Y`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 105/0 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Induced.lean | 2 | 3 | ['eric-wieser', 'github-actions', 'joelriou'] | nobody | 1 year ago | 716 days ago | 10 seconds |
| 12869 | adomani | feat: linter and script for `theorem` vs `lemma` | This PR contains a linter for flagging doc-string-less `theorem`s, as well as a bash script that, once the linter ran on Mathlib, automatically replaces every linter-offending `theorem` by `lemma`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 106/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/ThmLemma.lean,scripts/thmLemma.sh | 4 | 13 | ['adomani', 'github-actions', 'grunweg', 'joneugster'] | nobody | 1 year ago | 679 days ago | 38 days |
| 14563 | awueth | feat: if-then-else of exclusive or statement | --- If `¬(P ∧ Q)` then `ite (P ∨ Q) a 1 = (ite P a 1) * (ite Q a 1)` [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 5/0 | Mathlib/Algebra/Group/Basic.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'kim-em'] | nobody | 1 year ago | 654 days ago | 6 days |
| 12093 | ADedecker | feat: tweak the definition of semicontinuity to behave better in nonlinear orders | Summary of the changes: - change definitions to make [lowerSemicontinuous_iff_isClosed_preimage](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Semicontinuous.html#lowerSemicontinuous_iff_isClosed_preimage) true without assuming `LinearOrder`, so that semicontinuity corresponds to continuity for lower/upper order topology on the codomain. See discussion on [Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Semicontinuity.20definition.20for.20non-linear.20orders/near/432898278) - add new `iff` lemmas for unfolding the definition - add `iff` lemmas with the old definition in the linearly ordered case - some basic lemmas need to be changed in an easy way - minimize assumptions for continuity => semicontinuity - prove the semicontinuity criterion for indicators using "preimage of Ici/Iic" instead of a direct proof, because the proof is more natural (especially because we have no `filter_upwards` for `Frequently`) - in the rest of the file (which is about linear orders anyway), we don't touch the statements and just rewrite to the old definition. Some of these could be generalized, but we keep that for a later PR. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology | 274/130 | Mathlib/Analysis/BoundedVariation.lean,Mathlib/MeasureTheory/Integral/FundThmCalculus.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Topology/Semicontinuous.lean | 4 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 11393 | mcdoll | feat(Analysis/Distribution/SchwartzSpace): The Heine-Borel property | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 688/3 | Mathlib.lean,Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/UniformSpace/Ascoli.lean,Mathlib/Topology/UniformSpace/Pi.lean,Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean | 6 | 0 | [] | nobody | 1 year ago | unknown | 0 seconds |
| 9444 | erdOne | feat: Various instances regarding `𝓞 K`. | --- [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted t-number-theory | 27/0 | Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/RingTheory/IntegralClosure.lean | 2 | 9 | ['erdOne', 'leanprover-bot', 'mattrobball', 'riccardobrasca', 'xroblot'] | nobody | 1 year ago | 846 days ago | 1 day |
| 8931 | hmonroe | feat(Computable): define P, NP, and NP-complete | Revised to focus on languages that are binary strings, given the issue of non-acceptable encodings of unspecified Types --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author | 381/5 | Mathlib.lean,Mathlib/Computability/Complexity copy.lean,Mathlib/Computability/Complexity.lean,Mathlib/Computability/Encoding.lean,Mathlib/Computability/TMComputable.lean,Mathlib/Computability/TuringMachine.lean,Mathlib/Computability/halting example.lean,docs/references.bib | 8 | 3 | ['fpvandoorn', 'github-actions', 'hmonroe'] | nobody | 1 year ago | 780 days ago | 93 days |
| 10387 | adomani | feat(Tactic/ComputeDegree): add `polynomial` tactic | Introducing the `polynomial` tactic, summing up `compute_degree, monicity` and adding support for `leadingCoeff`. This is more of a proof of concept: if there is interest in this tactic, I can polish it up. See [this Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/Compute.20roots.20of.20polynomials/near/420713624). --- [](https://gitpod.io/from-referrer/) | WIP RFC t-meta | 24/0 | Mathlib/Tactic/ComputeDegree.lean | 1 | 0 | [] | nobody | 1 year ago | 668 days ago | 143 days |
| 9154 | astrainfinita | feat: `npow` / `nsmul` / `Nat.cast`/ `zpow` / `zsmul` implemented using `Nat.binaryRec` | --- - [ ] depends on: https://github.com/leanprover/lean4/pull/3756 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra blocked-by-other-PR | 168/359 | Mathlib/Algebra/Group/Defs.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/Primrec.lean,Mathlib/Data/Bool/Basic.lean,Mathlib/Data/Int/Bitwise.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Digits.lean,Mathlib/Data/Nat/EvenOddRec.lean,Mathlib/Data/Nat/Fib/Basic.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Order/Basic.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Nat/Size.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Init/Data/Nat/Bitwise.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean,Mathlib/Logic/Basic.lean,Mathlib/Logic/Denumerable.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/Logic/Equiv/Nat.lean,lake-manifest.json,lakefile.lean,test/zmod.lean | 25 | 7 | ['astrainfinita', 'eric-wieser', 'kim-em', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 6603 | tydeu | feat: automatically try `cache get` before build | --- A quick proof-of-concept. With this, `lake build` will always try `cache get` before building mathlib. [](https://gitpod.io/from-referrer/) | merge-conflict WIP CI | 29/0 | lakefile.lean | 1 | 3 | ['kim-em', 'tydeu'] | nobody | 1 year ago | 978 days ago | 11 days |
| 6058 | apurvnakade | feat: duality theory for cone programs | This PR tracks the development of duality theory for cone programs. [Reference](https://ti.inf.ethz.ch/ew/courses/ApproxSDP09/notes/conelp.pdf) --- [](https://gitpod.io/from-referrer/) - [x] depends on: #6059 - [ ] define direct sum of cones - [ ] weak duality - [ ] regular duality - [ ] slater condition - [ ] strong duality | merge-conflict WIP t-analysis | 159/0 | Mathlib.lean,Mathlib/Analysis/Convex/Cone/ConeLinearProgram.lean | 2 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 1013 days ago | 9 seconds |
| 6449 | ADedecker | feat: functions with finite fibers | --- This has been discussed before on [Zulip](https://leanprover.zulipchat.com/#narrow/stream/217875-Is-there-code-for-X.3F/topic/.E2.9C.94.20Cofinite.20maps.3F) and it came up again while working with @kkytola's student. As explained in the docstring, we could absolutely just use `Tendsto f cofinite cofinite` all the time, but (1) we lack some API for it (2) the API is nicer to setup if we have a separate def (e.g for dot notation) and (3) mentioning filters for such a simple concept is really not beginner-friendly. I'm not sure at all about the name. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 203/0 | Mathlib.lean,Mathlib/Logic/Function/HasFiniteFibers.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Cofinite.lean | 4 | 14 | ['ADedecker', 'YaelDillies', 'alexjbest', 'kkytola'] | nobody | 1 year ago | 990 days ago | 6 days |
| 13163 | erdOne | feat(.vscode/module-docstring.code-snippet): Prevent auto-complete from firing on `do` | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 5/0 | .vscode/module-docstring.code-snippets | 1 | 5 | ['erdOne', 'grunweg', 'robertylewis', 'trivial1711'] | nobody | 1 year ago | 656 days ago | 50 days |
| 13791 | digama0 | refactor: Primrec and Partrec | General cleanup of the `Primrec` and `Partrec` files, to better adjust to lean 4 things. The main user-visible change is that `Primrec₂` is no longer a `def` but an `abbrev`, because it was causing inference issues in lean 4. I also removed all the nonterminal `simp`s in `PartrecCode.lean`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability tech debt | 585/778 | Mathlib/Computability/Ackermann.lean,Mathlib/Computability/Halting.lean,Mathlib/Computability/Partrec.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/Primrec.lean | 5 | 2 | ['github-actions', 'grunweg'] | nobody | 1 year ago | 684 days ago | 1 day |
| 12418 | rosborn | style: replace preimage_val with ↓∩ notation | --- This is a rough draft of what the new `↓∩` notation would look like within mathlib. I believe this is an improvement in clarity and would like to have `↓∩` as a standard notation (along with `''`, `⁻¹'`, `↑`, etc...). As `↓∩` is specialized for `Set`s, I have only changed `preimage_val` when the left-hand side of `↓∩` is a `Set`. The introduction of the `↓∩` notation to Data.Set.Image is temporary as it isn't possible to import Data.Set.Subset directly. If we want `↓∩` unscoped, where would be the best place to define it? An option is Data.Set.Defs, but the notation cannot be defined without additional imports as the file does not import `notation3`. [](https://gitpod.io/from-referrer/) | merge-conflict | 56/61 | Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Data/Set/Function.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Set/Subset.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Clopen.lean,Mathlib/Topology/Connected/Basic.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/LocalAtTarget.lean,Mathlib/Topology/LocallyConstant/Basic.lean,Mathlib/Topology/Separation.lean,Mathlib/Topology/Sober.lean | 18 | 3 | ['grunweg', 'rosborn'] | nobody | 1 year ago | 707 days ago | 29 days |
| 9978 | astrainfinita | chore(FieldTheory/KummerExtension): move some lemmas earlier | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 197/177 | Mathlib.lean,Mathlib/Data/Polynomial/FieldDivision.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Polynomial/Irreducible.lean | 5 | 5 | ['alreadydone', 'grunweg', 'riccardobrasca'] | nobody | 1 year ago | 818 days ago | 8 days |
| 12429 | adomani | feat: toND -- auto-generating natDegree | This is an experiment to automatically translate theorems about `degree` to theorems about `natDegree`. --- [](https://gitpod.io/from-referrer/) | t-algebra RFC merge-conflict awaiting-author t-meta | 167/132 | Mathlib.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Degree/Lemmas.lean,Mathlib/Algebra/Polynomial/EraseLead.lean,Mathlib/Algebra/Polynomial/HasseDeriv.lean,Mathlib/Algebra/Polynomial/Inductions.lean,Mathlib/Algebra/Polynomial/Mirror.lean,Mathlib/Algebra/Polynomial/Reverse.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ToNatDegree.lean,scripts/noshake.json | 11 | 2 | ['adomani', 'grunweg'] | nobody | 1 year ago | 732 days ago | 3 days |
| 12751 | Command-Master | feat: add lemmas for Nat/Bits, Nat/Bitwise and Nat/Size | Remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data new-contributor | 66/7 | Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/Multiplicity.lean,Mathlib/Data/Nat/Size.lean | 4 | 26 | ['Command-Master', 'Rida-Hamadani', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 655 days ago | 56 days |
| 15448 | urkud | chore(*): deprecate `Option.elim'` | Use `Option.elim` instead. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt | 54/50 | Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/Calculus/LagrangeMultipliers.lean,Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/TMToPartrec.lean,Mathlib/Data/Option/Defs.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/Logic/Embedding/Set.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/Topology/Compactness/Paracompact.lean,Mathlib/Topology/LocallyFinite.lean | 17 | 12 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'grunweg', 'urkud'] | nobody | 1 year ago | 629 days ago | 7 days |
| 10350 | Shamrock-Frost | feat(Data/Setoid): add the operations of taking the equivalence class of an element and of saturating a set wrt an equivalence relation | I'm open to suggestions about changing the name "saturate", someone on zulip rightly pointed out this is a very overloaded term in math. That said, I think it's unlikely to cause confusion and that there's only one reasonable interpretation in the context of setoids. --- - [x] depends on: #10347 - [x] depends on: #10348 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 169/3 | Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/Order/Closure.lean | 3 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 737 days ago | 19 days |
| 13573 | Shamrock-Frost | feat: add multivariate polynomial modules | Add a type synonym for multivariate polynomials with coefficients in a module. --- Multivariate polynomials with module coefficients are sort of silly, but they sometimes show up in commutative algebra (eg in the definition of a quasi regular sequence). Writing this code involved a lot of copy and pasting from `PolynomialModule` and `MvPolynomial`. The API is definitely lacking at this stage but it's a start. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 691/6 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/Module/Basic.lean,Mathlib/Algebra/MvPolynomial/Module/MvAEval.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean | 4 | 9 | ['Shamrock-Frost', 'erdOne', 'github-actions'] | nobody | 1 year ago | 654 days ago | 39 days |
| 6517 | MohanadAhmed | feat: discrete Fourier transform of a finite sequence | # Discrete Fourier Transform (DFT) Matrix and DFT of a (finite) sequence This file defines the `dft` opertaion on a sequence (also a vecotr) and the DFT operation matrix ## Main definitions - `dft v`: given a sequence (v : (Fin n) → ℂ) we can transform it into a sequence (V : (Fin n) →ℂ) such that $$V [p] = ∑_{k = 0}^{N - 1} e^{-j*2πkp/n} v [k]$$ - `idft V` : given a sequence (V : (Fin n) → ℂ) we can transform it into a sequence (v : (Fin n) → ℂ) such that $$v [k] = \frac{1}{N}∑_{p = 0}^{n - 1} e^{j*2πkp/N} v [p]$$ - `dftMatrix n` : the dft matrix of dimensions $n \times n$ with the `k, p` entry equal to $$Wₙ[k, p] = e^{-j2πkp/n}$$ - `(dftMatrix n)⁻¹` : the idft matrix of dimensions $n \times n$ with the `k, p` entry equal to $$Wₙ[k, p] = (1/N) e^{j2πkp/n}$$ ## Main results - `dft v = (dftMatrix n) v` : the dft operation on a sequence is the same as the dft matrix applied to the vector - `idft V = (dftMatrix n)⁻¹ V` : the idft operation on a sequence is the same as the idft matrix applied to the vector - `dft (idft v) = dft ( idft v) = v` the dft and idft operations are inverses - `Wₙ = vandermonde (w)` : the dft matrix is vandermonde with `w` being the first row of the dft matrix - `circulant t = (dftMatrix n)⁻¹ ⬝ diagonal (dft t) ⬝ (dftMatrix n)` : a circulant matrix is diagonalizable by the dft and idft matrix pair. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 294/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/DFT.lean | 2 | 26 | ['MohanadAhmed', 'ericrbg'] | nobody | 1 year ago | 927 days ago | 65 days |
| 13155 | alreadydone | feat(NumberTheory/EllipticDivisibilitySequence): show elliptic relations follow from even-odd recursion | This PR is centered around the (generalized) elliptic relations (`rel₄`) $E(a,b,c,d): W_{a+b}W_{a-b}W_{c+d}W_{c-d}=W_{a+c}W_{a-c}W_{b+d}W_{b-d}-W_{a+d}W_{a-d}W_{b+c}W_{b-c}$. For an integer-indexed sequence W valued in a commutative ring, the relation makes sense only when a,b,c,d are all integers or all half integers. For convenience of formalization, we instead consider integers a,b,c,d of the same parity and divide all subscripts by 2. We extract the subexpression $W_{(a+b)/2}W_{(a-b)/2}$ (which appear six times) as `addMulSub W a b`. The collection of all $E(a,b,c,d)$ is equivalent to Stange's axiom for elliptic nets (`net`), and the literature (e.g. Silverman) commonly consider only the three-index special case $E(m,n,r,0)$ (`Rel₃`). Important special cases of these relations are (i) $E(m+1,m,1,0): W_{2m+1}W_1^3=W_{m+2}W_m^3-W_{m+1}^3 W_{m-1}$ (`oddRec`) and (ii) $E(m+1,m-1,1,0): W_{2m}W_2 W_1^2=W_m(W_{m+2}W_{m-1}^2-W_{m-2}W_{m+1}^2)$ (`evenRec`), which suffice to uniquely specify $W$ on all positive integers recursively from four initial values $W_1, W_2, W_3, W_4$ (`IsEllSequence.ext`, if $W_1 W_2$ is not a zero divisor). In the usual setting where $W_1=1$ and $W_2\mid W_4$, there does exist a sequence (`normEDS`) satisfying (i) and (ii) given initial values $W_2, W_3$ and $W_4/W_2$. It turns out the same non-zerodivisor condition also guarantees that W is an odd function with $W_0=0$, which naturally extends W to all integers. The main result of this PR (`rel₄_of_oddRec_evenRec`, `IsEllSequence.of_oddRec_evenRec`) is a purely algebraic proof that the sequence W defined by the single-parameter elliptic relations (i) and (ii) implies all $E(a,b,c,d)$, based on my original argument first published on [Math.SE](https://math.stackexchange.com/a/4903422/12932). It's based on the observation that a nonzerodivisor-multiple of $E(a,b,c,d)$ can be expressed as a linear combination of various $E(a,b,c_\min,d_\min)$ with the two smallest indices fixed at their minimal possible values, which can be transformed (`transf`) to an elliptic relation with smaller `a` (which can be assumed to hold by induction), unless they are of the form (i) or (ii) which hold by assumption. For this argument it's necessary to assume `a > b > c > d ≥ 0` (see `StrictAnti₄` and `Rel₄OfValid`), but it's easy to extend to arbitrary a,b,c,d by symmetry properties of `rel₄` under negation and permutations of indices. In the subsequent PR #13057, we show all normalized EDSs (`normEDS`), defined using the even-odd recursion (i)-(ii), are elliptic (i.e. satisfy the elliptic relations) divisibility sequences. This PR doesn't directly apply because a normEDS doesn't always satisfy the nonzerodivisor condition, but they are specializations of the universal normEDS, which does satisfy the condition. The technique of reducing to the universal case will be applied many times, and relies on the naturality (`map`) lemmas. We also change the `ℕ` in the definition `IsDivSequence` to `ℤ` which is more natural given that W is a `ℤ`-indexed sequence. --- - [x] depends on: #13153 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-number-theory | 565/12 | Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 1 | 55 | ['Multramate', 'alreadydone', 'github-actions', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 661 days ago | 26 days |
| 15600 | adomani | feat: lint also `let` vs `have` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter | 77/26 | Mathlib/Tactic/Linter/HaveLetLinter.lean,test/HaveLetLinter.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 631 days ago | 8 seconds |
| 16253 | Shreyas4991 | feat: Basics of Discrete Fair Division in Mathlib | This PR adds the basics of discrete fair division in mathlib. We include the definitions of allocations, valuations, properties of valuations, and the following notions : Envy-Freeness (EF), Envy-Freeness upto 1 good (EF1), and envy freeness upto any good (EFX). We also include the various implications between these notions. --- [](https://gitpod.io/from-referrer/) | WIP awaiting-author | 144/0 | Mathlib/GameTheory/FairDivision/Discrete/Basic.lean | 1 | 9 | ['Shreyas4991', 'eric-wieser', 'github-actions'] | nobody | 1 year ago | 610 days ago | 5 hours |
| 15121 | Eloitor | feat: iff theorems for IsSplitEpi and IsSplitMono in opposite category | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-category-theory new-contributor | 40/0 | Mathlib/CategoryTheory/EpiMono.lean | 1 | 3 | ['github-actions', 'joelriou', 'mattrobball'] | nobody | 1 year ago | 638 days ago | 7 days |
| 15895 | madvorak | feat(Computability/ContextFreeGrammar): mapping between two types of nonterminal symbols | --- [](https://gitpod.io/from-referrer/) | t-computability WIP | 172/0 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 43 | ['YaelDillies', 'github-actions', 'madvorak'] | nobody | 1 year ago | 610 days ago | 1 day |
| 14038 | adomani | test/decl diff in lean dev | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 231/2 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,.github/workflows/mk_build_yml.sh,Mathlib/Tactic/Eval.lean,scripts/decls_diff_hybrid.sh,scripts/list_decls.lean | 8 | 3 | ['github-actions'] | nobody | 1 year ago | 677 days ago | 8 seconds |
| 7861 | shuxuezhuyi | feat(Geometry/Hyperbolic/UpperHalfPlane): instance IsometricSMul PSL(2, ℝ) ℍ | --- - [ ] depends on: #7835 - [ ] depends on: #7791 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-euclidean-geometry | 98/0 | Mathlib.lean,Mathlib/Geometry/Hyperbolic/UpperHalfPlane/Basic.lean,Mathlib/LinearAlgebra/Matrix/ProjectiveSpecialLinearGroup.lean | 3 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 659 days ago | 43 days |
| 16570 | yuma-mizuno | chore(Tactic/CategoryTheory): change `TermElabM` to `MetaM` | Separated from #15335. To use `Qq`, we need to modify `Qq` to support universe matching. See [Zulip](https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.2315335.20meta.20code.20for.20monoidal.20categories). --- - [ ] depends on: #15335 [](https://gitpod.io/from-referrer/) | WIP t-meta | 26/15 | Mathlib/Tactic/CategoryTheory/BicategoryCoherence.lean,Mathlib/Tactic/CategoryTheory/Coherence.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mergify'] | nobody | 1 year ago | unknown | 0 seconds |
| 10591 | adri326 | feat(Topology/Algebra/ConstMulAction): properties of continuous actions in Hausdorff spaces | Defines some useful properties of `ContinuousConstSMul` group actions on Hausdorff spaces: - `MulAction.isClosed_fixedBy`, which proves that the `fixedBy α m` set is closed - `t2_separation_smul`, which constructs an open set `s` such that `s` and `g • s` are disjoint - `Set.InjOn.t2_separation_smul`, the extension of `t2_separation_smul` to a set of group elements whose action is injective --- This PR belongs my series of PR around the formalization of Rubin's theorem. `MulAction.isClosed_fixedBy` is used in several places along the proof, and the separation lemmas are primarily used in showing that `(fixedBy α g)ᶜ` and `(fixedBy α h)ᶜ` are disjoint under some intricate but fully group-theoretic condition. [](https://gitpod.io/from-referrer/) | t-topology awaiting-author t-algebra | 57/0 | Mathlib/Topology/Algebra/ConstMulAction.lean | 1 | 9 | ['ADedecker', 'adri326', 'j-loreaux', 'jcommelin'] | ADedecker | 1 year ago | 750 days ago | 55 days |
| 7545 | shuxuezhuyi | feat: APIs of `Function.extend f g e'` when `f` is injective | We characterizes `range g`, `Injective g`, `Surjective g` and `Bijective g` in terms of `extend f g e'`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 50/0 | Mathlib.lean,Mathlib/Logic/Function/ApiForExtend.lean | 2 | 1 | ['fpvandoorn'] | nobody | 1 year ago | 905 days ago | 32 days |
| 14078 | Ruben-VandeVelde | feat(CI): continue after mk_all fails | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 43/0 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml,Mathlib/Data/Nat/Test.lean | 5 | 2 | ['bryangingechen', 'github-actions'] | nobody | 1 year ago | 676 days ago | 3 hours |
| 11283 | hmonroe | feat(ModelTheory/Satisfiability): define theory with independent sentence | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-logic | 8/0 | Mathlib/ModelTheory/Satisfiability.lean | 1 | 2 | ['fpvandoorn', 'hmonroe'] | nobody | 1 year ago | 778 days ago | 3 days |
| 16914 | siddhartha-gadgil | Loogle syntax with non-reserved | This is PR mainly to test that loogle syntax does not break stuff downstream --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 4/4 | lake-manifest.json,lakefile.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 590 days ago | 4 hours |
| 13782 | alreadydone | feat(EllipticCurve): ZSMul formula in terms of division polynomials | The formula $[n]P = (\phi_n(x,y) : \omega_n(x,y) : \psi_n(x,y))$ in Jacobian coordinates for $P=(x,y)$ a nonsingular point on a Weierstrass/elliptic curve. --- - [x] depends on: #12883 - [x] depends on: #13399 - [ ] depends on: #13057 - [ ] depends on: #13155 - [x] depends on: #13845 - [x] depends on: #13846 - [ ] depends on: #13847 [](https://gitpod.io/from-referrer/) | t-algebra t-number-theory blocked-by-other-PR merge-conflict t-algebraic-geometry | 2462/232 | Mathlib.lean,Mathlib/Algebra/MvPolynomial/PDeriv.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/DivisionPolynomial/ZSMul.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Group.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Universal.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean | 10 | 8 | ['Multramate', 'alreadydone', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 8118 | iwilare | feat(CategoryTheory): add dinatural transformations | A starting point to define [dinatural transformations](https://ncatlab.org/nlab/show/dinatural+transformation). This is my first PR so style comments and improvements are very welcome! --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 147/7 | Mathlib.lean,Mathlib/CategoryTheory/DinatTrans.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/CategoryTheory/Products/Bifunctor.lean | 4 | 49 | ['Shamrock-Frost', 'github-actions', 'iwilare', 'joelriou'] | Shamrock-Frost | 1 year ago | 688 days ago | 21 days |
| 14242 | js2357 | feat: Prove equivalence of `isDedekindDomain` and `isDedekindDomainDvr` | Prove that `isDedekindDomainDvr` is equivalent to both `isDedekindDomain` and `isDedekindDomainInv`. Specifically, prove `isDedekindDomainDvr A → isDedekindDomainInv A`, because `isDedekindDomain A → isDedekindDomainDvr A` and `IsDedekindDomain A ↔ IsDedekindDomainInv A` are already in Mathlib. - [x] depends on: #14099 - [x] depends on: #14216 - [ ] depends on: #14237 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR new-contributor | 269/1 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean,Mathlib/RingTheory/Localization/Basic.lean | 4 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 671 days ago | 4 minutes |
| 7516 | ADedecker | perf: use `abbrev` to prevent unifying useless data | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 4/3 | Mathlib/Topology/ContinuousFunction/Bounded.lean | 1 | 3 | ['ADedecker', 'leanprover-bot', 'mattrobball'] | nobody | 1 year ago | 939 days ago | 16 seconds |
| 17127 | astrainfinita | chore: remove global `Quotient.mk` `⟦·⟧` notation | --- Merge this PR when we are ready to migrate to `QuotLike` API (#16421). [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 137/2 | Counterexamples/Pseudoelement.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Group/Finset.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/GroupWithZero/NonZeroDivisors.lean,Mathlib/Algebra/Order/CauSeq/Completion.lean,Mathlib/Algebra/Quandle.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Basic.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/FundamentalGroup.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Product.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnected.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/Limits/Shapes/SingleObj.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Skeletal.lean,Mathlib/Data/Finset/Card.lean,Mathlib/Data/Fintype/List.lean,Mathlib/Data/Fintype/Quotient.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean,Mathlib/Data/QPF/Univariate/Basic.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/Set/Finite.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/LinearAlgebra/Dual.lean,Mathlib/LinearAlgebra/Ray.lean,Mathlib/Logic/Encodable/Basic.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/Quotients.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/FundamentalCone.lean,Mathlib/NumberTheory/NumberField/Embeddings.lean,Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/RepresentationTheory/Action/Concrete.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Ordinal.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/Birthday.lean,Mathlib/SetTheory/Game/Impartial.lean,Mathlib/SetTheory/Game/Ordinal.lean,Mathlib/SetTheory/Game/State.lean,Mathlib/SetTheory/Lists.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Surreal/Basic.lean,Mathlib/SetTheory/Surreal/Dyadic.lean,Mathlib/SetTheory/Surreal/Multiplication.lean,Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Rank.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/Homotopy/HomotopyGroup.lean,Mathlib/Topology/Homotopy/Path.lean,Mathlib/Topology/Homotopy/Product.lean,Mathlib/Topology/MetricSpace/GromovHausdorff.lean,Mathlib/Topology/UniformSpace/Separation.lean,test/interactiveUnfold.lean | 68 | 1 | ['github-actions'] | nobody | 1 year ago | 578 days ago | 4 days |
| 16887 | metinersin | feat(ModelTheory/Complexity): define conjunctive and disjunctive formulas | Defines `FirstOrder.Language.BoundedFormula.IsConjunctive` and `FirstOrder.Language.BoundedFormula.IsDisjunctive`. --- - [ ] depends on: #16885 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 300/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 21 minutes |
| 16888 | metinersin | feat(ModelTheory/Complexity): Define conjunctive and disjunctive normal forms | Define `FirstOrder.Language.BoundedFormula.IsDNF` and `FirstOrder.Language.BoundedFormula.IsCNF`. --- - [ ] depends on: #16887 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 415/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 17 minutes |
| 16889 | metinersin | feat(ModelTheory/Complexity): Normal forms | Defines `FirstOrder.Language.BoundedFormula.toDNF` and `FirstOrder.Language.BoundedFormula.toCNF` - given a quantifier-free formula, these construct a semantically equivalent formula in disjunctive normal form and conjunctive normal form, respectively. --- - [ ] depends on: #16888 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR new-contributor t-logic | 525/7 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Syntax.lean | 3 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 591 days ago | 10 minutes |
| 5995 | astrainfinita | feat: add APIs about `Quotient.choice` | Some docs in this PR refer to the definition in #5576. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author RFC t-data | 76/6 | Mathlib/Data/Quot.lean | 1 | 3 | ['YaelDillies', 'astrainfinita', 'gebner'] | eric-wieser | 1 year ago | 694 days ago | 285 days |
| 13156 | erdOne | refactor(Algebra/Module/LocalizedModule): Redefine `LocalizedModule` in terms of `OreLocalization`. | --- - [x] depends on: #13151 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 519/628 | Mathlib.lean,Mathlib/Algebra/Module/LocalizedModule.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/RingTheory/OreLocalization/Module.lean,Mathlib/RingTheory/OreLocalization/Ring.lean | 8 | 4 | ['github-actions', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball'] | nobody | 1 year ago | 567 days ago | 49 days |
| 16348 | urkud | refactor(Topology): require `LinearOrder` with `OrderTopology` | While the definition formally makes sense for a preorder, this topology is usually not the right one for a non-linear order (e.g., `Real × Real`). See [Zulip thread](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Open.20Ioi) --- This PR doesn't cleanup any API, I'm going to do it in a later PR. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 33/46 | Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Topology/Algebra/Order/LiminfLimsup.lean,Mathlib/Topology/Instances/Sign.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/Filter.lean,Mathlib/Topology/Order/MonotoneContinuity.lean | 6 | 10 | ['YaelDillies', 'github-actions', 'jcommelin', 'urkud'] | nobody | 1 year ago | 604 days ago | 3 days |
| 13965 | pechersky | feat(Data/DigitExpansion): reals via digit expansion are complete | --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #13964 | merge-conflict blocked-by-other-PR t-data | 3876/0 | Mathlib.lean,Mathlib/Data/DigitExpansion/Add.lean,Mathlib/Data/DigitExpansion/Defs.lean,Mathlib/Data/DigitExpansion/Hensel.lean,Mathlib/Data/DigitExpansion/Integer/Basic.lean,Mathlib/Data/DigitExpansion/Integer/Mul.lean,Mathlib/Data/DigitExpansion/Real/Basic.lean,Mathlib/Data/DigitExpansion/Real/CompleteSpace.lean,Mathlib/Data/DigitExpansion/Real/ConditionallyComplete.lean,docs/references.bib | 10 | 4 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 681 days ago | 10 minutes |
| 12750 | Command-Master | feat: define Gray code | --- Define binary reflected gray code, both as a permutation of `Nat` and as a permutation of `BitVec n`, and prove some theorems about them. Additionally, remove `@[simp]` from `Nat.bit_false` and `Nat.bit_true`, as `bit0` and `bit1` are deprecated, and add some lemmas to `Bits`, `Bitwise` and `Size`. - [ ] depends on: #12751 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR t-data new-contributor merge-conflict awaiting-author | 226/0 | Mathlib.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Bitwise.lean,Mathlib/Data/Nat/GrayCode.lean,Mathlib/Data/Nat/Size.lean | 5 | 5 | ['Rida-Hamadani', 'alreadydone', 'github-actions', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 707 days ago | 16 days |
| 13514 | madvorak | feat(Computability/ContextFreeGrammar): closure under union | - [ ] depends on: #15895 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability blocked-by-other-PR | 448/4 | Mathlib/Computability/ContextFreeGrammar.lean | 1 | 50 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'leanprover-community-mathlib4-bot', 'madvorak'] | nobody | 1 year ago | 623 days ago | 72 days |
| 9654 | urkud | feat: add `@[mk_eq]` version of `@[mk_iff]` | The new attribute generates theorems like ```lean List.chain_eq : @List.Chain = fun {α} R a a_1 => a_1 = [] ∨ ∃ b l, R a b ∧ List.Chain R b l ∧ a_1 = b :: l ``` and is useful to rewrite in a theorem that argues about the properties of an unapplied inductive predicate. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 63/9 | Mathlib/Lean/Meta.lean,Mathlib/Tactic/MkIffOfInductiveProp.lean,test/MkIffOfInductive.lean | 3 | 6 | ['Vierkantor', 'github-actions', 'urkud'] | nobody | 1 year ago | 815 days ago | 25 days |
| 16704 | AntoineChambert-Loir | feat(Mathlib.Data.Ordering.Dickson): Dickson orders | Dickson orders are a particular class of well founded orders characterized by the fact that every nonempty set has finitely many minimal elements. They appear in the classical theory of Groebner bases because it is easier to prove that some sets are well founded using this property. WiP. In the `tfae` function, property 2 is exactly `Set.PartiallyWellOrderedOn`, so the PR should be rewritten so as to use that property (and not define `IsDickson`). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 324/0 | Mathlib.lean,Mathlib/Data/Ordering/Dickson.lean,scripts/noshake.json | 3 | 9 | ['AntoineChambert-Loir', 'b-mehta', 'github-actions'] | nobody | 1 year ago | 594 days ago | 2 days |
| 16355 | Ruben-VandeVelde | feat: odd_{add,sub}_one | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-number-theory | 12/0 | Mathlib/Algebra/Ring/Int.lean,Mathlib/Algebra/Ring/Parity.lean | 2 | 4 | ['Ruben-VandeVelde', 'github-actions', 'urkud'] | nobody | 1 year ago | 607 days ago | 16 hours |
| 14598 | Command-Master | chore: add typeclasses to unify various `add_top`, `add_eq_top`, etc. | Add the four typeclasses `IsTopAbsorbing`, `IsBotAbsorbing`, `NoTopSum`, `NoBotSum`, as additive equivalents for `MulZeroClass` and `NoZeroDivisors`. Add instances of these for `ENNReal`, `WithTop α`, `WithBot α`, `PUnit`, `EReal`, `PartENat`, `Measure`, `Interval` and `Filter`. Also split `Algebra/Order/AddGroupWithTop` to `Algebra/Order/Group/WithTop` and `Algebra/Order/Monoid/WithTop` --- Previous usages of lemmas with quantified names like `WithTop.add_top` have to be changed to just `add_top`. `add_lt_top` is `@[simp]`, in accordance with `ENNReal.add_lt_top` being `@[simp]`. This affects `WithTop.add_lt_top` which previously hadn't been `@[simp]`. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-order new-contributor | 264/195 | Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib.lean,Mathlib/Algebra/Order/Group/WithTop.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Interval/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/PUnitInstances/Order.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Polynomial/Monic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Analytic/Meromorphic.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/NormedSpace/ENorm.lean,Mathlib/Analysis/SpecialFunctions/JapaneseBracket.lean,Mathlib/Analysis/SpecialFunctions/Log/ENNRealLog.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Nat/WithBot.lean,Mathlib/Data/Real/EReal.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Decomposition/Lebesgue.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL1.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSpace.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/Bochner.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean,Mathlib/MeasureTheory/Integral/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/LevyProkhorovMetric.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Martingale/Convergence.lean,Mathlib/RingTheory/Multiplicity.lean,Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean,Mathlib/RingTheory/UniqueFactorizationDomain.lean,Mathlib/Topology/EMetricSpace/Defs.lean,Mathlib/Topology/MetricSpace/Bounded.lean,Mathlib/Topology/MetricSpace/HausdorffDistance.lean,Mathlib/Topology/MetricSpace/Lipschitz.lean | 57 | 30 | ['Command-Master', 'YaelDillies', 'github-actions'] | nobody | 1 year ago | 541 days ago | 7 days |
| 16885 | metinersin | feat(ModelTheory/Complexity): define literals | Defines `FirstOrder.Language.BoundedFormula.IsLiteral` and `FirstOrder.Language.BoundedFormula.simpleNot` - an auxiliary operation that takes the negation of a formula and does some simplification. --- - [x] depends on: #16800 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-logic | 148/5 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Syntax.lean | 4 | 20 | ['YaelDillies', 'awainverse', 'github-actions', 'mathlib4-dependent-issues-bot', 'metinersin'] | nobody | 1 year ago | 574 days ago | 5 hours |
| 18716 | jjaassoonn | feat(Algebra/Module/GradedModule): quotient and subgrading | - [ ] depends on: #9820 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR awaiting-CI merge-conflict | 997/191 | Counterexamples/HomogeneousPrimeNotPrime.lean,Mathlib.lean,Mathlib/Algebra/Group/Subgroup/Defs.lean,Mathlib/Algebra/Module/GradedModule/Basic.lean,Mathlib/Algebra/Module/GradedModule/QuotientGrading.lean,Mathlib/Algebra/Module/GradedModule/Subgrading.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Quotient.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,scripts/no_lints_prime_decls.txt | 12 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 9341 | winstonyin | feat: Naturality of integral curves | Let `v` and `v'` be sections of the tangent bundle of manifolds `M` and `M'`, respectively, and let `f : M → M'` be a differentiable map. Then `f` maps integral curves of `v` to integral curves of `v'` if and only if `v` and `v'` are `f`-related. - [x] depends on: #8483 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-differential-geometry | 45/0 | Mathlib/Geometry/Manifold/IntegralCurve.lean,Mathlib/Topology/Algebra/Module/Basic.lean | 2 | 9 | ['github-actions', 'grunweg', 'leanprover-community-mathlib4-bot', 'winstonyin'] | nobody | 1 year ago | 843 days ago | 7 hours |
| 13248 | hcWang942 | feat: basic concepts of auction theory | ## Description
Formalise some core concepts and results in auction theory: this includes definitions for first-price and second-price auctions, as well as several fundamental results and helping lemmas.
This is the very first PR of the project formalizing core concepts and results in auction theory.
Our group is working on more contributions on the formalization of game theory prefix.
Co-authored-by: Ma Jiajun |
merge-conflict awaiting-author new-contributor t-logic | 204/0 | Mathlib.lean,Mathlib/GameTheory/Auction/Basic.lean,docs/references.bib | 3 | 148 | ['Shreyas4991', 'YaelDillies', 'eric-wieser', 'faenuccio', 'github-actions', 'grunweg', 'hcWang942', 'tb65536', 'urkud', 'vihdzp'] | hcWang942 | 1 year ago | 548 days ago | 109 days |
| 9344 | erdOne | feat: Add `AddGroup.FG` -> `Module.Finite ℤ` as instances | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 4/0 | Mathlib/RingTheory/Finiteness.lean | 1 | 4 | ['alreadydone', 'erdOne', 'leanprover-bot'] | nobody | 1 year ago | 832 days ago | 21 days |
| 12133 | ADedecker | feat: generalize instIsLowerProd to arbitrary products | Also change a bit the proof of the product case to match my own taste, feel free to tell if you prefer the old one. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology t-order | 34/14 | Mathlib/Topology/Constructions.lean,Mathlib/Topology/Order/LowerUpperTopology.lean | 2 | 13 | ['Ruben-VandeVelde', 'TwoFX', 'github-actions', 'jcommelin', 'mans0954', 'mathlib-bors', 'riccardobrasca'] | nobody | 1 year ago | 683 days ago | 63 days |
| 16637 | astrainfinita | perf: reorder `extends` of `(Add)Monoid` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 46/51 | Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Ring/SumsOfSquares.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean | 20 | 3 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 597 days ago | 1 day |
| 8661 | joelriou | feat(CategoryTheory/Sites): descent of sheaves | In this PR, it is shown that the category of sheaves on a site `(C, J)` identifies as a full subcategory of a category of families of sheaves equipped with a descent data (for a family of objects which cover the final object). Under suitable conditions, it shall be shown that this is an equivalence of categories (TODO). --- This shall be split in small PRs later. - [x] depends on: #8622 - [x] depends on: #8632 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 1396/26 | Mathlib.lean,Mathlib/CategoryTheory/Over.lean,Mathlib/CategoryTheory/Sites/CoverPreserving.lean,Mathlib/CategoryTheory/Sites/Descent.lean,Mathlib/CategoryTheory/Sites/EqualizerSheafCondition.lean,Mathlib/CategoryTheory/Sites/InducedTopology.lean,Mathlib/CategoryTheory/Sites/ObjectsCoverTop.lean,Mathlib/CategoryTheory/Sites/Over.lean,Mathlib/CategoryTheory/Sites/SheafHom.lean,Mathlib/CategoryTheory/Sites/Sieves.lean | 10 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 10476 | shuxuezhuyi | feat(Topology/UniformSpace): define uniform preordered space | We define the semi-uniform structure and the uniform preordered space. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 94/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/UniformOrder.lean,docs/references.bib | 3 | 2 | ['shuxuezhuyi'] | nobody | 1 year ago | 756 days ago | 52 days |
| 17593 | astrainfinita | chore(Algebra/Order/GroupWithZero/Unbundled): deprecate useless lemmas, use `ZeroLEOneClass` | There are still some useless lemmas that were simply ported from `Algebra.Order.Monoid.Lemmas`, such as just chain an existing lemma with an assumption and lemmas whose assumptions imply `1 ≤ 0`. This PR removes them. Also, some lemmas have both assumptions like `1 < a` `0 < a`. This PR uses `ZeroLEOneClass` to remove redundant assumptions. --- - [ ] depends on: #17623 Ported from https://github.com/leanprover-community/mathlib/pull/16525 and https://github.com/leanprover-community/mathlib/pull/18158 Adapted from #9250. This version is easier to review. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR t-order | 188/48 | Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Counting.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Order/Field.lean | 6 | 4 | ['astrainfinita', 'github-actions', 'mathlib4-dependent-issues-bot', 'vihdzp'] | nobody | 1 year ago | 568 days ago | 20 hours |
| 17623 | astrainfinita | feat(Algebra/Order/GroupWithZero/Unbundled): add some lemmas | Some lemmas in `Algebra.Order.GroupWithZero.Unbundled` have incorrect or unsatisfactory names, or assumptions that can be omitted using `ZeroLEOneClass`. The lemmas added in this PR are versions of existing lemmas that use the correct or better name or `ZeroLEOneClass` to omit an assumption. The original lemmas will be deprecated in #17593. | New name | Old name | |-------------------------|-------------------------| | `mul_le_one_left₀` | `Left.mul_le_one_of_le_of_le` | | `mul_lt_one_of_le_of_lt_left₀` (`0 ≤ ·` version) / `mul_lt_one_of_le_of_lt_of_pos_left` | `Left.mul_lt_of_le_of_lt_one_of_pos` | | `mul_lt_one_of_lt_of_le_left₀` | `Left.mul_lt_of_lt_of_le_one_of_nonneg` | | `mul_le_one_right₀` | `Right.mul_le_one_of_le_of_le` | | `mul_lt_one_of_lt_of_le_right₀` (`0 ≤ ·` version) / `mul_lt_one_of_lt_of_le_of_pos_right` | `Right.mul_lt_one_of_lt_of_le_of_pos` | | `mul_lt_one_of_le_of_lt_right₀` | `Right.mul_lt_one_of_le_of_lt_of_nonneg` | The following lemmas use `ZeroLEOneClass`. | New name | Old name | |-------------------------|-------------------------| | `(Left.)one_le_mul₀` | `Left.one_le_mul_of_le_of_le` | | `Left.one_lt_mul_of_le_of_lt₀` | `Left.one_lt_mul_of_le_of_lt_of_pos` | | `Left.one_lt_mul_of_lt_of_le₀` | `Left.lt_mul_of_lt_of_one_le_of_nonneg` / `one_lt_mul_of_lt_of_le` (still there) | | `(Left.)one_lt_mul₀` | | | `Right.one_le_mul₀` | `Right.one_le_mul_of_le_of_le` | | `Right.one_lt_mul_of_lt_of_le₀` | `Right.one_lt_mul_of_lt_of_le_of_pos` | | `Right.one_lt_mul_of_le_of_lt₀` | `Right.one_lt_mul_of_le_of_lt_of_nonneg` / `one_lt_mul_of_le_of_lt` (still there) / `one_lt_mul` (still there) | | `Right.one_lt_mul₀` | `Right.one_lt_mul_of_lt_of_lt` | --- Split from #17593. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-zulip t-order | 146/44 | Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean | 2 | 11 | ['YaelDillies', 'astrainfinita', 'github-actions', 'j-loreaux'] | nobody | 1 year ago | 534 days ago | 33 days |
| 17624 | astrainfinita | feat(Algebra/Order/GroupWithZero/Unbundled): generalize lemmas | --- - [ ] depends on: #17623 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR t-order | 121/26 | Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 568 days ago | 7 minutes |
| 17513 | astrainfinita | perf: do not search algebraic hierarchies when using `map_*` lemmas | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra awaiting-bench | 5/3 | Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/GroupTheory/GroupAction/Hom.lean | 2 | 10 | ['astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | 566 days ago | 4 days |
| 17515 | astrainfinita | perf: do not need `simp low` now | --- - [ ] depends on: #17513 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 12/10 | Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Analysis/SpecialFunctions/Bernstein.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/NumberTheory/LucasLehmer.lean | 4 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 571 days ago | 6 minutes |
| 19212 | Julian | feat(LinearAlgebra): add a variable_alias for VectorSpace | Taken directly from the variable_alias docs. Zulip: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/why.20.5Bvariable_alias.5D.20attribute.20is.20not.20used.20in.20Mathlib.3F --- This is the first actual variable alias added to mathlib. I haven't reviewed variable_alias fully, but it seems like there's at least 3 ways they could be distributed in Mathlib: * alongside whatever subfolder they "belong to" (which is what I've tentatively done here) * In a file called `Aliases` somewhere near the thing they alias (which seems less discoverable to me) * In a single file, a la `Mathlib.TrainingWheels` (with some less playful name) which is meant to define a bunch of more "friendly" aliases all in one place. I kind of like the idea of the third thing as a future module but perhaps it can be synthesized if/when there are more aliases? For now as I say I've done the first one, but please let me know if someone prefers something else. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 25/0 | Mathlib.lean,Mathlib/LinearAlgebra/VectorSpace.lean,scripts/noshake.json | 3 | 10 | ['Julian', 'PieterCuijpers', 'github-actions', 'urkud'] | nobody | 1 year ago | 521 days ago | 7 days |
| 19337 | zeramorphic | feat(Data/Finsupp): generalise `Finsupp` to any "zero" value | Remove the explicit dependence of `Finsupp` on `[Zero M]`, instead defining `Finsupp'` (better name pending) to be functions that are equal to a fixed value `z : M` cofinitely often. This PR is intended to do the initial work of replacing the definition of `Finsupp` with an instantiation of the more general definition, without adding any appropriate API. If accepted, the API development will follow in later PRs. Issues to consider: - Naming of `Finsupp'.` - Where should `Finsupp'` lemmas go? Do they need their own file/folder under `Data/`? Relevant Zulip threads: - https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Finsupp.20generalisations - https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Finsupp-like.20partial.20function Comments are welcome. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 203/83 | Archive/Wiedijk100Theorems/Partition.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Data/Finsupp/BigOperators.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/RingTheory/PowerBasis.lean,scripts/nolints_prime_decls.txt | 13 | 5 | ['github-actions', 'vihdzp', 'zeramorphic'] | nobody | 1 year ago | 519 days ago | 3 days |
| 18756 | astrainfinita | refactor: deprecate `DistribMulActionSemiHomClass` `MulSemiringActionSemiHomClass` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 50/28 | Mathlib/Algebra/Algebra/NonUnitalHom.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/GroupTheory/GroupAction/Hom.lean | 3 | 4 | ['astrainfinita', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 507 days ago | 31 days |
| 19125 | yhtq | feat: add theorems to transfer `IsGalois` between pairs of fraction rings | feat: add theorems to transfer `IsGalois` between pairs of fraction rings. - [x] depends on: #18404 - [x] depends on: #19124 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra new-contributor | 121/0 | Mathlib.lean,Mathlib/FieldTheory/Galois/IsFractionRing.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'tb65536'] | nobody | 1 year ago | 531 days ago | 33 minutes |
| 18841 | hrmacbeth | chore: change some `linarith`s to `linear_combination`s | Change 100 `linarith`s to `linear_combination`s; this is generally a slight speedup. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #18714 (not strictly blocked by this, but the speed comparison will be more informative after it) | merge-conflict WIP | 106/107 | Archive/Imo/Imo1959Q2.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2013Q5.lean,Archive/Imo/Imo2021Q1.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Analysis/Calculus/BumpFunction/FiniteDimension.lean,Mathlib/Analysis/Complex/AbelLimit.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean,Mathlib/Analysis/Convex/Uniform.lean,Mathlib/Analysis/Convex/Visible.lean,Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/SpecialFunctions/Gamma/BohrMollerup.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/Monotone.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Analysis/SpecificLimits/FloorPow.lean,Mathlib/MeasureTheory/Covering/BesicovitchVectorSpace.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/NumberTheory/Modular.lean,Mathlib/NumberTheory/Transcendental/Liouville/LiouvilleWith.lean,Mathlib/Probability/Distributions/Pareto.lean | 30 | 29 | ['github-actions', 'grunweg', 'hrmacbeth', 'jcommelin', 'leanprover-bot', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 525 days ago | 3 days |
| 11142 | hmonroe | feat(ProofTheory): Define logical symbols abstractly; opens new top-level section, drawing from lean4-logic | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 468/1 | Mathlib.lean,Mathlib/Data/Fin/VecNotation.lean,Mathlib/ProofTheory/LogicSymbol.lean | 3 | 19 | ['PatrickMassot', 'YaelDillies', 'avigad', 'fpvandoorn', 'github-actions'] | nobody | 1 year ago | 694 days ago | 94 days |
| 11210 | hmonroe | Test commit | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 1950/1 | Mathlib.lean,Mathlib/Data/Fin/VecNotation.lean,Mathlib/ProofTheory/Calculus.lean,Mathlib/ProofTheory/FirstOrder/Arith/Language.lean,Mathlib/ProofTheory/FirstOrder/Basic/Syntax/Term.lean,Mathlib/ProofTheory/LogicSymbol.lean,Mathlib/ProofTheory/Matrix.lean,Mathlib/ProofTheory/Semantics.lean,Mathlib/ProofTheory/System.lean,docs/references.bib | 10 | 100 | ['github-actions'] | nobody | 1 year ago | 783 days ago | 2 days |
| 19621 | Command-Master | feat: Multiplicity and prime-adic valuation of derivations | --- - [ ] depends on: #19596 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR large-import | 397/13 | Mathlib.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Data/ENat/Basic.lean,Mathlib/Order/WithBot.lean,Mathlib/RingTheory/Derivation/Multiplicity.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/PrimeMultiplicity.lean | 9 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 517 days ago | 6 minutes |
| 18262 | joelriou | feat(Algebra/Category/ModuleCat/Presheaf): exterior powers of presheaves of modules | --- - [x] depends on: #18261 - [ ] depends on: #18236 - [ ] depends on: #18197 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR t-category-theory merge-conflict | 874/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/ExteriorPower.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/FunctorOfNatTrans.lean,Mathlib/Algebra/Category/ModuleCat/Pseudofunctor.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15269 | kkytola | feat: Add ENNReal.floor | A right-continuous floor function on `ENNReal`. --- - [x] depends on: #13938 - [ ] depends on: #15773 (general type class for `ENat`-valued floor functions) - [x] depends on: #15380 (topology on `ENat` is needed to state right continuity of the floor function) [](https://gitpod.io/from-referrer/) | t-algebra blocked-by-other-PR t-order merge-conflict awaiting-author | 445/0 | Mathlib.lean,Mathlib/Algebra/Order/EFloor.lean,Mathlib/Data/ENNReal/Floor.lean,Mathlib/Data/Nat/Lattice.lean | 4 | 18 | ['YaelDillies', 'github-actions', 'kkytola', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 632 days ago | 57 minutes |
| 15773 | kkytola | feat: Add type class for ENat-valued floor functions | This PR adds a type class for extended natural number -valued floor functions. This is split off from #15269, where the suggestions were to make the floor function on ENNReal ENat-valued and to have an API mimicling FloorSemirings. Besides ENNReal, at least ENNRat would naturally satisfy the general type class. --- Two things are worth noting: * To fully mimic `FloorSemiring` API, also ceiling functions need to be added. The plan is to do that in a later PR. * The PR introduces the class `CastNatENatClass` to ensure that `natCast` and a coercion from `ENat` behave in the natural and order-respecing manner. This feels a little ad hoc, but such assumptions are needed for general `ENat`-valued floor functions to behave well. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-order | 231/0 | Mathlib.lean,Mathlib/Algebra/Order/EFloor.lean,Mathlib/Data/ENat/Basic.lean | 3 | 5 | ['YaelDillies', 'github-actions', 'kkytola', 'urkud'] | nobody | 1 year ago | 559 days ago | 66 days |
| 3251 | kmill | feat: deriving `LinearOrder` for simple enough inductive types | Uses the same machinery underlying the `Fintype` derive handler to derive a lexicographical `LinearOrder` for non-recursive inductive types that have no indices. In principle more complicated types can have `LinearOrder`s, but that would require a more sophisticated implementation. --- - [x] depends on: #3198 [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-meta | 82/0 | Mathlib.lean,Mathlib/Tactic/DeriveLinearOrder.lean | 2 | 5 | ['ChrisHughes24', 'kim-em', 'kmill', 'vihdzp'] | nobody | 1 year ago | 1107 days ago | 1 day |
| 16120 | awainverse | feat(ModelTheory/Algebra/Ring/Basic): Ring homomorphisms are a `StrongHomClass` for the language of rings | Adds an `IsAlgebraic` instance to the language of rings Adds a `StrongHomClass` instance to the type of ring homomorphisms between rings with `CompatibleRing` structures --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra RFC t-logic | 34/13 | Mathlib/ModelTheory/Algebra/Ring/Basic.lean | 1 | 10 | ['ChrisHughes24', 'YaelDillies', 'awainverse', 'github-actions', 'jcommelin'] | nobody | 1 year ago | 479 days ago | 135 days |
| 20459 | Ruben-VandeVelde | chore: fix names of roots_C_mul_X_{add,sub}_C_of_IsUnit | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 11/5 | Mathlib/Algebra/Polynomial/FieldDivision.lean,Mathlib/Algebra/Polynomial/Roots.lean | 2 | 2 | ['eric-wieser', 'github-actions'] | nobody | 1 year ago | 478 days ago | 4 days |
| 20527 | trivial1711 | refactor(Topology/UniformSpace/Completion): more descriptive names for `α → Completion α` | - We rename the various maps `α → Completion α` in order to make their names more consistent. - Let `α` be a uniform space. We rename the uniformly continuous function `α → Completion α` from `UniformSpace.Completion.coe'` to `UniformSpace.Completion.coe`. - Let `α` be a uniform additive group. We rename the additive group homomorphism `α →+ Completion α` from `UniformSpace.Completion.toCompl` to `UniformSpace.Completion.coeAddHom`. - Let `α` be a uniform ring. The ring homomorphism `α →+* Completion α` is called `UniformSpace.Completion.coeRingHom`; its name is unchanged. - Let `α` be a normed space over a field `𝕜`. We rename the linear isometry `α →ₗᵢ[𝕜] Completion α` from `UniformSpace.Completion.toComplₗᵢ` to `UniformSpace.Completion.coeₗᵢ`. - Let `α` be a normed space over a field `𝕜`. We rename the continuous linear map `α →L[𝕜] Completion α` from `UniformSpace.Completion.toComplL` to `UniformSpace.Completion.coeL`. - Let `α` be a normed additive group. We rename the norm preserving homomorphism `NormedAddGroupHom α (Completion α)` from `NormedAddCommGroup.toCompl` to `UniformSpace.Completion.coeNormedAddGroupHom`. - We analogously rename some other theorems. - We add some trivial theorems (all of which are proved by `rfl`) that state that the functions considered above are equal. We give all of them the `simp` and `norm_cast` attributes. - We add a new theorem `UniformSpace.Completion.coeAddHom_eq_coe` that states that `UniformSpace.Completion.coeAddHom` and `UniformSpace.Completion.coe` are equal as functions. - We similarly add a new theorem `UniformSpace.Completion.coeRingHom_eq_coe`. - We rename the theorem `UniformSpace.Completion.coe_toComplₗᵢ` to `UniformSpace.Completion.coeₗᵢ_eq_coe`. - We rename the theorem `UniformSpace.Completion.coe_toComplL` to `UniformSpace.Completion.coeL_eq_coe`. - We similarly add a new theorem `UniformSpace.Completion.coeNormedAddGroupHom_eq_coe`. - We change all occurrences of the string `((↑) : α → Completion α)` to `(coe : α → Completion α)` or just `coe`. - We put the statements of some theorems into simp normal form by using the plain function `coe` rather than the homomorphisms that carry more structure. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 130/92 | Mathlib/Analysis/Analytic/Uniqueness.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Complex/AbsMax.lean,Mathlib/Analysis/Complex/Liouville.lean,Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Analysis/SpecialFunctions/NonIntegrable.lean,Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/Nonarchimedean.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformRing.lean,Mathlib/Topology/Category/UniformSpace.lean,Mathlib/Topology/MetricSpace/Completion.lean,Mathlib/Topology/UniformSpace/Completion.lean | 17 | 4 | ['eric-wieser', 'github-actions', 'trivial1711'] | nobody | 1 year ago | 473 days ago | 6 days |
| 17739 | Aaron1011 | feat(Topology/Order/DenselyOrdered): prove Not (IsOpen) for intervals | Prove that Iic/Ici/Ioc/Ico/Icc intervals are not open in densely ordered topologies with no min/max element --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology new-contributor | 27/0 | Mathlib/Topology/Order/DenselyOrdered.lean | 1 | 8 | ['github-actions', 'vihdzp'] | nobody | 1 year ago | 563 days ago | 1 hour |
| 18474 | astrainfinita | perf: lower the priority of `*WithOne.to*` instances | --- From #7873. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra t-data | 9/2 | Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/Data/Nat/Cast/Defs.lean | 3 | 7 | ['astrainfinita', 'eric-wieser', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 471 days ago | 76 days |
| 20656 | Komyyy | feat(Mathlib/Geometry/Manifold/VectorBundle/Sphere): convert orthogonal smooth `M → 𝕊ⁿ` & `M → ℝⁿ⁺¹` to smooth `M → T𝕊ⁿ` | Current Mathlib has no easy way to define function from a manifold to tangent bundles of sphere: `T𝕊ⁿ`. This PR gives this: `sphereTangentMap`. This convert orthogonal smooth `M → 𝕊ⁿ` & `M → ℝⁿ⁺¹` to smooth `M → T𝕊ⁿ`. I also proved that if `f : M → 𝕊ⁿ` & `g : M → ℝⁿ⁺¹` are smooth then `sphereTangentMap` of `f` & `g` is smooth too. --- ⚠ **CAUTION** I formalized this in my spare time. I don't have the energy to maintain the PR, but I create this PR so this may helps everyone. The only one thing to do is proof cleanup. TODO: - [x] `contDiff_uncurry_stereoInvFunAux` & `coe_sphere_comp_stereoInvFun` may have to be moved to `Mathlib.Geometry.Manifold.Instances.Sphere`. - [ ] Proof cleanup. Current proof may be redundant and ugly. [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-differential-geometry | 246/6 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/Geometry/Manifold/VectorBundle/Sphere.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | unknown | 0 seconds |
| 15711 | znssong | feat(Combinatorics/SimpleGraph): Some lemmas about walk, cycle and Hamiltonian cycle | --- These lemmas are separated from the `meow-sister/BondyChvatal` branch and will be needed for the proof of the Bondy-Chvátal theorem. - [x] depends on: #15536 - [x] depends on: #16294 | merge-conflict awaiting-author t-combinatorics new-contributor | 407/3 | Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Combinatorics/SimpleGraph/Walk.lean | 4 | 22 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'mathlib4-dependent-issues-bot', 'znssong'] | nobody | 1 year ago | 591 days ago | 9 days |
| 18629 | tomaz1502 | feat(Computability.Timed): Formalization of runtime complexity of List.merge | This PR adds the formalization of the runtime complexity of the merge function, defined in `Data/List/Sort`. Requires: https://github.com/leanprover-community/mathlib4/pull/15450 References: - Previous PR on mathlib3: https://github.com/leanprover-community/mathlib3/pull/14494/ - First discussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/BSc.20Final.20Project/near/220647062 - Second disussion on Zulip: https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Formalization.20of.20Runtime.20Complexity.20of.20Sorting.20Algorithms/near/284184450 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author new-contributor | 186/0 | Mathlib.lean,Mathlib/Computability/Timed/InsertionSort.lean,Mathlib/Computability/Timed/Merge.lean | 3 | 2 | ['github-actions', 'trivial1711'] | nobody | 1 year ago | 509 days ago | 33 days |
| 8362 | urkud | feat(Asymptotics): define `ReflectsGrowth` | --- - [x] depends on: #8349 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 268/0 | Mathlib.lean,Mathlib/Analysis/Asymptotics/ReflectsGrowth.lean | 2 | 14 | ['YaelDillies', 'fpvandoorn', 'github-actions', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 659 days ago | 240 days |
| 6692 | prakol16 | feat: disjoint indexed union of local homeomorphisms | Add disjoint indexed union of local equivs and local homeomorphisms --- This is leading up to PRing some things related to covering spaces that I wrote a long time ago in lean 3 but never submitted a PR for. Note that this was converted using mathport. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 126/0 | Mathlib/Logic/Equiv/PartialEquiv.lean,Mathlib/Topology/PartialHomeomorph.lean | 2 | 4 | ['alreadydone', 'github-actions', 'winstonyin'] | nobody | 1 year ago | 559 days ago | 118 days |
| 18461 | hannahfechtner | feat: left and right common multiples mixins | add mixins for left and right common multiples. These carry the data of what factors are used to create the common multiples --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 78/0 | Mathlib/Algebra/Group/Defs.lean | 1 | 13 | ['github-actions', 'hannahfechtner', 'jcommelin', 'kbuzzard', 'kim-em', 'trivial1711'] | nobody | 1 year ago | 466 days ago | 69 days |
| 19291 | PieterCuijpers | feat(Algebra/Order/Hom): add quantale homomorphism | Definition of quantale homomorphisms as functions that are both semigroup homomorphisms and complete lattice homomorphisms. --- - [x] depends on: #19810 - [x] depends on: #19811 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 209/0 | Mathlib.lean,Mathlib/Algebra/Order/Hom/Quantale.lean,scripts/noshake.json | 3 | 29 | ['PieterCuijpers', 'YaelDillies', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 470 days ago | 27 days |
| 19352 | hrmacbeth | chore: change some `nlinarith`s to `linear_combination`s | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 13/13 | Archive/Imo/Imo2021Q1.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Mathlib/Analysis/Normed/Group/AddCircle.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogBounds.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Increment.lean,Mathlib/NumberTheory/Modular.lean | 8 | 4 | ['github-actions', 'hrmacbeth', 'leanprover-bot'] | nobody | 1 year ago | 525 days ago | 2 hours |
| 20372 | jvlmdr | feat(MeasureTheory/Function): Add ContinuousLinearMap.bilinearCompLp(L) | Introduce ContinuousLinearMap.bilinearCompLp and bilinearCompLpL. Generalize eLpNorm_le_eLpNorm_mul_eLpNorm theorems to include constant C in bound condition. --- Expect this may be useful for defining tempered distributions from functions in `L^p`. The definitions more or less follow `ContinuousLinearMap.compLp...`. Names are loosely analogous to `ContinuousLinearMap.bilinearComp` and `SchwartzMap.bilinLeftCLM`. Note: I preferred the spelling `hpqr : p⁻¹ + q⁻¹ = r⁻¹` with `f` in `L^p` and `g` in `L^q` to `hpqr : 1 / p = 1 / q + 1 / r`. It's easier to obtain from `ENNReal.IsConjExponent` too. A few questions: - [ ] I defined `bilinear{Left,Right}LpL` in addition to `bilinearCompLpL` because `LinearMap.mkContinuous₂` is marked as `noncomputable` and `LinearMap.mkContinuous` is not. Is this worth the extra definitions? (Note: This is not visible in the source due to `noncomputable section`.) - [ ] Should I use `C : ℝ` instead of `C : NNReal` for `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'`? - [ ] Is it going to be painful to have `[Fact (1 ≤ p)] [Fact (1 ≤ q)] [Fact (1 ≤ r)]`? I don't think there's a way to avoid it though. Maybe providing specialized versions for `p.IsConjExponent q` with `L^1`? Naming: - [ ] Is it satisfactory to add a `'` to the `eLpNorm_le_eLpNorm_mul_eLpNorm ` definitions in `CompareExp.lean` where `≤ ‖f x‖ * ‖g x‖` has been replaced with `≤ C * ‖f x‖ * ‖g x‖`? These could replace the existing theorems, although I don't want to break backwards compatibility. There are 5 instances: `eLpNorm_le_eLpNorm_top_mul_eLpNorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm_top'`, `eLpNorm'_le_eLpNorm'_mul_eLpNorm''`, `eLpNorm_le_eLpNorm_mul_eLpNorm_of_nnnorm'`, `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm'` (I'm not sure why the existing theorem `eLpNorm_le_eLpNorm_mul_eLpNorm'_of_norm` has an internal `'`) - [ ] Is `bilinearLeftLpL` a suitable name? Other options: `bilinearCompLpLeftL`, `bilinearCompLeftLpL`, `bilinLeftLpL` (analogous to `SchwartzMap.bilinLeftCLM`) [](https://gitpod.io/from-referrer/) | merge-conflict t-measure-probability new-contributor | 203/40 | Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSpace.lean | 2 | 1 | ['github-actions'] | nobody | 1 year ago | 458 days ago | 27 days |
| 2605 | eric-wieser | chore: better error message in linarith | On this mwe: ```lean import Mathlib.Tactic.Linarith example (s : Set ℕ) (h : s = s) : 0 ≤ 1 := by linarith ``` this now indicates where the internal error is coming from. Is there a better way of chaining errors than this? --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 12/1 | Mathlib/Tactic/Linarith/Preprocessing.lean | 1 | 3 | ['Vierkantor', 'harahu', 'kim-em', 'mo271'] | nobody | 1 year ago | 1103 days ago | 51 days |
| 11837 | trivial1711 | feat: completion of a uniform multiplicative group | Multiplicativize `Topology.Algebra.GroupCompletion`. That is, rewrite it in the multiplicative setting and recover the original results using `@[to_additive]`. - Because `@[to_additive]` doesn't work with `noncomputable section` (https://github.com/leanprover/lean4/pull/2610), some instances with `@[to_additive]` need to be explicitly marked with `noncomputable instance`. - One might be tempted to multiplicativize this definition from `Topology.Algebra.GroupCompletion`: ```lean instance [UniformSpace α] [Add α] : Add (Completion α) := ⟨Completion.map₂ (· + ·)⟩ ``` to this: ```lean @[to_additive] instance [UniformSpace α] [Mul α] : Mul (Completion α) := ⟨Completion.map₂ (· * ·)⟩ ``` However, as Eric Wieser pointed out, doing so would create a bad diamond with the definition ```lean instance [UniformSpace α] [TopologicalRing α] [UniformAddGroup α] [Ring α] : Mul (Completion α) := ⟨curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))⟩ ``` in `Topology.Algebra.UniformRing`. How should this diamond be resolved? Well, the definition of multiplication that uses `curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))` is the "correct" one. For example, it yields the correct result if `α` is `ℚ`, unlike the definition that uses `Completion.map₂ (· * ·)`. (This is because `Completion.map₂` yields junk values if used on a function which is not uniformly continuous. Note, however, that if multiplication on `α` *is* uniformly continuous, then `Completion.map₂ (· * ·)` and `curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))` are propositionally equal.) So, following Eric's suggestion, we remove the definition that uses `Completion.map₂ (· * ·)`, and generalize the other definition to any uniform space with a multiplication operation: ```lean @[to_additive] noncomputable instance [UniformSpace α] [Mul α] : Mul (Completion α) := ⟨curry <| (denseInducing_coe.prod denseInducing_coe).extend ((↑) ∘ uncurry (· * ·))⟩ ``` This requires slightly modifying some of the proofs in `Topology.Algebra.GroupCompletion`. For example, suppose that `α` is a uniform group. Since we can no longer use `Completion.continuous_map₂`, it becomes more efficient to prove that the multiplication, inversion, and division operations on `Completion α` are uniformly continuous *before* we prove that `Completion α` is a group. - Previously, `Topology.Algebra.GroupCompletion` had an instance: ```lean instance [UniformSpace α] [Sub α] : Sub (Completion α) := ... ``` Naively multiplicativizing this would yield ```lean @[to_additive] instance [UniformSpace α] [Inv α] : Inv (Completion α) := ... ``` Unfortunately, this would conflict with `Topology.Algebra.UniformField`, which already instantiates `Inv (Completion α)` when `α` is a uniform field. Instead, we use two different `instance` declarations. (If `α` is an additive group, then this instantiates `Neg (Completion α)` twice, and the instances are syntactically equal.) ```lean @[to_additive] noncomputable instance [UniformSpace α] [Group α] : Inv (Completion α) := ... instance [UniformSpace α] [Neg α] : Neg (Completion α) := ... ``` This avoids the bad diamond (because a uniform field can never be a `Group`) while remaining backward compatible. Note that the `@[to_additive]` is necessary here, because it maintains the link between the additive setting and multiplicative setting. We use a similar method to instantiate `Div (Completion α)`. - Some definitions in this file involve a module structure on `α`. We leave these as is and do not attempt to multiplicativize them at all. - The instance of `DistribMulAction` must be multiplicativized to an instance of `MulDistribMulAction` manually. Zulip thread: https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Completion.20of.20a.20uniform.20multiplicative.20group --- # (Small) Issue Recall the following trick that this pull request uses to define inversion and negation on uniform spaces. The idea is that we define negation on the completion of any uniform space that has a negation operation, but we define inversion on only the completion of a uniform space that has the structure of a multiplicative group. We do this to avoid creating a bad diamond with the inversion operation on a uniform field. ```lean @[to_additive] noncomputable instance {α : Type*} [UniformSpace α] [Group α] : Inv (Completion α) := ... instance {α : Type*} [UniformSpace α] [Neg α] : Neg (Completion α) := ... ``` Now, suppose that we want to prove `coe_inv_of_group` (resp. `coe_neg`), which states that the coercion `α → Completion α` commutes with inversion (resp. negation). In the current version of this pull request, `coe_inv_of_group` (resp. `coe_neg`) only applies to uniform multiplicative (resp. additive) groups. However, we do not use the fact that multiplication (resp. addition) on `α` is uniformly continuous to prove it. We only use the fact that inversion (resp. negation) is continuous. So, what we really want is to have more general statements that look like this: ```lean theorem coe_inv_of_group {α : Type*} [UniformSpace α] [Group α] [ContinuousInv α] : ... theorem coe_neg {α : Type*} [UniformSpace α] [Neg α] [ContinuousNeg α] : ... ``` Note that `coe_inv_of_group` needs the assumption `[Group α]`, because otherwise inversion is not defined on `Completion α` at all. However, `coe_neg` does not need the analogous assumption `[AdditiveGroup α]`. The question is: If `coe_inv_of_group` and `coe_neg` are written in this more general form, how can we link them using `@[to_additive]`? Here is one option, but it obviously leaves something to be desired. ```lean @[to_additive coe_neg_do_not_use_this_use_the_more_general_version] theorem coe_inv_of_group {α : Type*} [UniformSpace α] [Group α] [ContinuousInv α] : ... theorem coe_neg {α : Type*} [UniformSpace α] [Neg α] [ContinuousNeg α] : ... ``` Co-authored-by: Eric Wieser --- [](https://gitpod.io/from-referrer/) | WIP t-algebra merge-conflict help-wanted t-topology | 342/217 | Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformField.lean,Mathlib/Topology/Algebra/UniformMulAction.lean,Mathlib/Topology/Algebra/UniformRing.lean | 9 | 14 | ['eric-wieser', 'github-actions', 'trivial1711'] | nobody | 1 year ago | 485 days ago | 101 days |
| 12670 | trivial1711 | feat: completion of a nonarchimedean multiplicative group | We prove that the completion of a nonarchimedean multiplicative group is a nonarchimedean multiplicative group. --- - [x] depends on: #12669 - [ ] depends on: #11837 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra t-topology blocked-by-other-PR | 358/228 | Mathlib/Analysis/InnerProductSpace/Completion.lean,Mathlib/Analysis/Normed/Group/HomCompletion.lean,Mathlib/Analysis/Normed/Module/Completion.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/InfiniteSum/GroupCompletion.lean,Mathlib/Topology/Algebra/Nonarchimedean/Completion.lean,Mathlib/Topology/Algebra/UniformField.lean,Mathlib/Topology/Algebra/UniformMulAction.lean,Mathlib/Topology/Algebra/UniformRing.lean | 9 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 482 days ago | 50 days |
| 9449 | hmonroe | feat: Add Turing machine with the quintet definition (TMQ) and a chainable step function for each TM type | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author | 458/1 | Mathlib/Computability/TuringMachine.lean,Mathlib/Logic/PartArith.lean | 2 | 8 | ['eric-wieser', 'github-actions', 'hmonroe'] | nobody | 1 year ago | 756 days ago | 91 days |
| 19697 | quangvdao | feat(BigOperators/Fin): Sum/product over `Fin` intervals | This PR adds new theorems about the sum/product of some vector over `Fin` intervals. One example is: ``` @[to_additive] theorem prod_Iic_succ (i : Fin n) : ∏ j ∈ Iic i.succ, v j = (∏ j ∈ Iic i.castSucc, v j) * v i.succ ``` --- - [x] depends on: #20360 This is in preparation for reworking `finSigmaFinEquiv` and `finProdFinEquiv` in #19013. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 87/12 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Data/Fintype/Fin.lean,Mathlib/Order/Interval/Finset/Fin.lean | 3 | 20 | ['Ruben-VandeVelde', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 1 year ago | 482 days ago | 6 days |
| 19353 | hrmacbeth | chore: golf some term/rw proofs using `linear_combination` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 47/102 | Archive/Wiedijk100Theorems/SumOfPrimeReciprocalsDiverges.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/MeasureTheory/Integral/RieszMarkovKakutani.lean,Mathlib/NumberTheory/Modular.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean,Mathlib/Topology/ContinuousMap/ZeroAtInfty.lean | 7 | 5 | ['github-actions', 'grunweg', 'hrmacbeth', 'leanprover-bot'] | grunweg | 1 year ago | 525 days ago | 2 hours |
| 20248 | peabrainiac | feat(Topology/Compactness): first-countable locally path-connected spaces are delta-generated | Shows that all first-countable locally path-connected spaces are delta-generated (so in particular all normed spaces and convex subsets thereof are), and that delta-generated spaces are equivalently generated by the unit interval or standard simplices. --- - [ ] depends on: #21616 In principle, this should be close to all that's required to show that all simplicial complexes and CW-complexes are delta-generated; I just haven't done it yet because I'm not sure which file to best do it in. [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import new-contributor merge-conflict awaiting-author t-topology | 1189/813 | Mathlib.lean,Mathlib/Geometry/Manifold/ChartedSpace.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean,Mathlib/Topology/Compactness/DeltaGeneratedSpace.lean,Mathlib/Topology/Connected/LocPathConnected.lean,Mathlib/Topology/Connected/PathConnected.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/Homotopy/HSpaces.lean,Mathlib/Topology/Path.lean | 9 | 22 | ['YaelDillies', 'github-actions', 'kbuzzard', 'mathlib4-dependent-issues-bot', 'peabrainiac'] | nobody | 1 year ago | 452 days ago | 39 days |
| 10678 | adri326 | feat(Topology/UniformSpace): prove that a uniform space is completely regular | Provides the pseudometric definition of a uniform space (for any open set `s` and `x ∈ s`, there exists a finite family of pseudometric spaces on `X` and an `ε > 0`, such that the intersection of the balls of these pseudometric spaces is a subset of `s`), and uses it to prove that `UniformSpace X` implies `CompletelyRegularSpace X`. --- This PR aims to close the gap of pi-base's theorem [T345](https://topology.pi-base.org/theorems/T000345), which says that topological groups are completely regular. We already have a proof that topological groups are uniform, but it turns out that we do not have any connection between `UniformSpace X` and `CompletelyRegularSpace X`. There is an equivalence between `UniformSpace X` and `CompletelyRegularSpace X`: the former implies the latter, and the latter implies *the existence of* the former. This PR provides the first half of this equivalence. The construction of the pseudometric definition is based on N. Bourbaki, Chapter 9, Theorem 4.1 The proof that a uniform space is completely regular is based on [the outline on mathexchange](https://math.stackexchange.com/questions/494718/how-to-prove-that-every-uniform-space-is-completely-regular). I tried to outline the major steps of the different proofs inside of comments; I can happily be more verbose to clear up any confusion. See [the corresponding Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Some.20missing.2C.20accessible.2C.20topology.20results) for more context. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 332/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/Basic.lean,Mathlib/Topology/UniformSpace/CompletelyRegular.lean | 3 | 6 | ['ADedecker', 'adri326'] | ADedecker | 1 year ago | 786 days ago | 17 days |
| 18785 | erdOne | feat(CategoryTheory): command that generates instances for `MorphismProperty` | Co-authored-by: Calle Sönne --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory t-meta | 369/0 | Mathlib.lean,Mathlib/CategoryTheory/MorphismProperty/Tactic.lean,MathlibTest/AddMorphismPropertyInstances.lean,scripts/noshake.json | 4 | 19 | ['alexjbest', 'chrisflav', 'erdOne', 'github-actions', 'grunweg', 'jcommelin', 'joelriou'] | nobody | 1 year ago | 464 days ago | 52 days |
| 16311 | madvorak | feat(Computability): regular languages are context-free | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-computability | 72/0 | Mathlib.lean,Mathlib/Computability/Chomsky.lean,Mathlib/Computability/ContextFreeGrammar.lean | 3 | 7 | ['Rida-Hamadani', 'YaelDillies', 'github-actions', 'madvorak'] | nobody | 1 year ago | unknown | 0 seconds |
| 19943 | AlexLoitzl | feat(Computability): Add Chomsky Normal Form Grammar and translation | - Define Chomsky normal form grammars - Add language-preserving translation between context-free grammars and Chomsky normal form grammars Co-authored-by: Martin Dvorak martin.dvorak@matfyz.cz --- [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-author new-contributor | 3151/0 | Mathlib.lean,Mathlib/Computability/ChomskyNormalForm/Basic.lean,Mathlib/Computability/ChomskyNormalForm/EmptyElimination.lean,Mathlib/Computability/ChomskyNormalForm/LengthRestriction.lean,Mathlib/Computability/ChomskyNormalForm/TerminalRestriction.lean,Mathlib/Computability/ChomskyNormalForm/Translation.lean,Mathlib/Computability/ChomskyNormalForm/UnitElimination.lean,Mathlib/Computability/ContextFreeGrammar.lean | 8 | 59 | ['AlexLoitzl', 'YaelDillies', 'github-actions', 'kim-em', 'madvorak'] | nobody | 1 year ago | 448 days ago | 37 days |
| 21501 | sksgurdldi | feat(List): add sum_zipWith_eq_finset_sum | ### **Description:** This PR adds the lemma `List.sum_zipWith_eq_finset_sum` to `Mathlib.Algebra.BigOperators.Group.Finset.Basic`. #### **Statement:** The sum of the `zipWith` operation on two lists equals the sum of applying the operation to corresponding elements of the two lists, indexed over the minimum of their lengths. #### **Formal Statement:** ```lean lemma sum_zipWith_eq_finset_sum [Inhabited α] [Inhabited β] [AddCommMonoid γ] {op : α → β → γ} (l : List α) (m : List β) : (List.zipWith op l m).sum = ∑ x ∈ (Finset.range (Nat.min l.length m.length)), op (l[x]!) (m[x]!) ``` #### **Remarks:** - This lemma provides a useful equivalence between `List.zipWith` and summation over a `Finset.range` indexed by `Nat.min l.length m.length`. - It can be helpful in algebraic manipulations involving list-based summations. #### **Dependencies:** No additional dependencies. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra new-contributor | 43/0 | Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean | 1 | 1 | ['github-actions', 'j-loreaux'] | nobody | 1 year ago | 435 days ago | 13 days |
| 12054 | adomani | feat: auto-bugs | This PR introduces a linter for suggesting bugs in tactics. See * #12077 * #12083 * #12084 for some bugs exposed by the test suite. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 737/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/MetaTesting.lean,scripts/noshake.json,test/MetaTesting.lean | 5 | 20 | ['adomani', 'eric-wieser', 'github-actions', 'joneugster', 'kim-em'] | joneugster | 1 year ago | 648 days ago | 45 days |
| 5062 | adomani | feat(Tactic/Prune + test/Prune): add `prune` tactic, for removing unnecessary hypotheses | This tactic removes very conservatively all local declarations that 1. do not appear in the main goal, 2. do not appear in a declaration that appears in the main goal, 3. ... and so on recursively. The main motivation for this tactic is that all available variables in the current `namespace/section` appear in the goal state, not just the ones that are needed for the statement to type-check. Using `prune` mitigates this situation. The tactic also admits an optional natural number argument: `prune n` removes all variables that have not appeared at the `(n+1)`-st stage in the above list. Thus, `prune 0` only leaves the variables needed for the statement to type-check. Also, for sufficiently large `n`, `prune n` is a synonym for `prune`. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/substitute.20for.20.60include.2Fomit.60.3F) --- [](https://gitpod.io/from-referrer/) | merge-conflict modifies-tactic-syntax awaiting-author t-meta | 181/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Prune.lean,test/Prune.lean | 4 | 5 | ['adomani', 'j-loreaux', 'kmill'] | nobody | 1 year ago | 856 days ago | 195 days |
| 21433 | grunweg | chore: change more lemmas to be about enorm instead of nnnorm | --- - [x] depends on: #21782 - [x] depends on: #21783 (and this PR modifies the file split, and file splits are painful to merge over) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author carleson t-measure-probability | 172/71 | Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousFunctions.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean | 9 | 18 | ['RemyDegenne', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 440 days ago | 2 days |
| 20454 | urkud | chore(TangentCone): review names | Also add some `@[simp]` attrs. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis | 201/139 | Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/ContDiff/Defs.lean,Mathlib/Analysis/Calculus/ContDiff/FTaylorSeries.lean,Mathlib/Analysis/Calculus/Deriv/Abs.lean,Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Calculus/FDeriv/Measurable.lean,Mathlib/Analysis/Calculus/FDeriv/RestrictScalars.lean,Mathlib/Analysis/Calculus/FDeriv/Symmetric.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/Calculus/MeanValue.lean,Mathlib/Analysis/Calculus/TangentCone.lean,Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/Analysis/Calculus/VectorField.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/InverseDeriv.lean,Mathlib/Geometry/Manifold/Instances/Real.lean,Mathlib/Geometry/Manifold/IsManifold/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/UniqueDifferential.lean,Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean,Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | 25 | 3 | ['github-actions', 'sgouezel', 'urkud'] | nobody | 1 year ago | 437 days ago | 4 days |
| 16550 | awainverse | feat(ModelTheory): A typeclass for languages expanding other languages | Defines `L.Expands L'` to consist of a privileged injective inclusion, `L'.Inclusion L`, from `L'` to `L`, corresponding to one language being a subset of the other in set-theoretic foundations. Replaces `L.IsOrdered` with `L.Expands Language.order` and `L.OrderLHom` with `Language.order.Inclusion L` Redefines `leSymb` in terms of `Language.order.Inclusion L` Deletions: - `FirstOrder.Language.IsOrdered` - `FirstOrder.Language.OrderLHom` - `instance : IsOrdered Language.order` - `sum.instIsOrdered` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 97/43 | Mathlib/ModelTheory/LanguageMap.lean,Mathlib/ModelTheory/Order.lean | 2 | 9 | ['YaelDillies', 'awainverse', 'github-actions'] | nobody | 1 year ago | 601 days ago | 17 hours |
| 10823 | alexkeizer | feat: convert curried type functions into uncurried type functions | Adds a conversion `TypeFun.ofCurried : CurriedTypeFun.{u, v} n -> TypeFun.{u, v} n`, where `CurriedTypeFun.{u,v} n` is a (def-eq) abbreviation for `Type u -> ... -> Type u -> Type v`, i.e., the type of *curried* functions taking `n` arguments of type `Type u` to return an element of `Type v`, and `TypeFun.{u, v} n` is an abbreviation for `TypeVec.{u} n -> Type v`. It is generally more idiomatic to define type functions with multiple arguments in the curried style, but in the QPF development we use the uncurried equivalent `TypeVec n -> Type _`. Thus, having a canonical conversion from curried functions to uncurried gives us a canonical way to ask if a curried type function, say `Sum` is a QPF (namely, "is there an instance of `MvQPF (TypeFun.ofCurried Sum)`"). --- This is code ported from https://github.com/alexkeizer/QpfTypes, where this conversion is crucial in presenting a high-level interface, in terms of idiomatic, curried, type functions to users, while being built on QPFs (and thus, uncurried typefunctions) underneath. There is also a conversion in the other direction, from uncurried to curried, which I've decided to PR later, to keep this PR smaller and hopefully easier to review. - [x] depends on: #10818 (all changes to `Fin2.lean` are part of 10818, not the current PR) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 66/0 | Mathlib.lean,Mathlib/Data/TypeFun.lean | 2 | 9 | ['YaelDillies', 'alexkeizer', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 676 days ago | 15 days |
| 13648 | urkud | feat(Topology/Module): generalize `ContinuousLinearMap.compSL` | Generalize `ContinuousLinearMap.compSL` to topological vector spaces. --- - [ ] depends on: #15217 This PR is not polished yet, but the main statement is there. @ADedecker This answers a question I asked you on Zulip a few months ago. [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict awaiting-author t-topology t-analysis | 23/18 | Mathlib/Analysis/NormedSpace/OperatorNorm/Bilinear.lean,Mathlib/Topology/Algebra/Module/StrongTopology.lean | 2 | 5 | ['fpvandoorn', 'github-actions', 'mathlib4-dependent-issues-bot', 'urkud'] | nobody | 1 year ago | 662 days ago | 28 days |
| 20636 | eric-wieser | feat: multiplication of intervals in rings | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 36/1 | Mathlib/Algebra/Order/Interval/Basic.lean | 1 | 16 | ['Timeroot', 'YaelDillies', 'eric-wieser', 'github-actions'] | nobody | 1 year ago | 459 days ago | 17 days |
| 22340 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Beck-Chevalley Conditions) | Building on top of the API of `ExponentiableMorphism` in #22321, we state and prove Beck-Chevalley conditions. This will be crucial for our development of polynomial functors along exponentiable morphisms.
Co-authored-by: Emily Riehl |
WIP blocked-by-other-PR t-category-theory large-import merge-conflict | 1144/24 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Comma/Over/Sections.lean,Mathlib/CategoryTheory/Galois/Examples.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/BeckChevalley.lean,docs/references.bib | 8 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 428 days ago | 17 seconds |
| 21959 | BGuillemet | feat(Topology/ContinuousMap): Stone-Weierstrass theorem for MvPolynomial | Add the subalgebra of multivariate polynomials and prove it separates points, on the same model as `ContinuousMap/Polynomial.lean`. Prove the Stone-Weierstrass theorem and some variations for multivariate polynomials. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology new-contributor | 285/1 | Mathlib.lean,Mathlib/Topology/ContinuousMap/MvPolynomial.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 422 days ago | 16 days |
| 18470 | astrainfinita | perf: lower the priority of `Normed*.to*` instances | --- From #7873. [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra t-analysis | 28/0 | Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean | 2 | 9 | ['astrainfinita', 'github-actions', 'jcommelin', 'leanprover-bot'] | nobody | 1 year ago | 417 days ago | 129 days |
| 17368 | Felix-Weilacher | feat(Topology/Baire/BaireMeasurable): add the Kuratowski-Ulam theorem | Add the Kuratowski-Ulam theorem, which one can think of as a "Fubini" for Baire category. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 187/1 | Mathlib/MeasureTheory/MeasurableSpace/Basic.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Topology/Baire/BaireMeasurable.lean,Mathlib/Topology/Constructions.lean,Mathlib/Topology/GDelta/Basic.lean | 5 | 6 | ['Felix-Weilacher', 'github-actions', 'urkud'] | nobody | 1 year ago | 553 days ago | 22 days |
| 8767 | eric-wieser | refactor(Cache): tidy lake-manifest parsing in Cache | This now respects local copies of Mathlib dependencies (though in practice these invalidate the *online* cache because to point to local copies of Mathlib, the hash for `lakefile.lean` and `lake-manifest.json` is first invalidated). --- - [x] depends on: #11492 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 49/49 | Cache/Hashing.lean,Cache/IO.lean,lake-manifest.json | 3 | 8 | ['digama0', 'eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 596 days ago | 119 days |
| 15578 | znssong | feat(Function): Fixed points of function `f` with `f(x) >= x` | We added some lemmas of fixed points of function `f` with `f(x) >= x`, where `f : α → α` is a function on a finite type `α`. This will be needed in proof of Bondy-Chvátal theorem. --- See also branch `meow-sister/BondyChvatal`. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis new-contributor | 82/0 | Mathlib.lean,Mathlib/Dynamics/FixedPoints/Basic.lean,Mathlib/Dynamics/FixedPoints/Increasing.lean | 3 | 32 | ['Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'urkud', 'vihdzp', 'znssong'] | nobody | 1 year ago | 597 days ago | 29 days |
| 22660 | Ruben-VandeVelde | chore: follow naming convention around Group.IsNilpotent | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 133/67 | Mathlib/GroupTheory/Frattini.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/SpecificGroups/ZGroup.lean | 3 | 1 | ['github-actions'] | nobody | 1 year ago | 410 days ago | 10 days |
| 13999 | adomani | feat: a linter to flag potential confusing conventions | Currently, the linter flags all uses of * `a - b` where `a b : Nat`; * `a / b` where `a b : Nat` or `a b : Int`; * `a / 0` more or less whenever the type of `a` has a `0` and a division. This comes up often when starting to use Lean and hopefully the flag can help mitigate initial confusions. When the local context contains the relevant inequality/divisibility hypothesis, the linter is quiet. A recent [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/not.20understanding.20deliberate.20error.20with.20.60ring.60.20over.20.E2.84.95/near/445879310) --- To make sure that the linter does not produce errors, #14007 activates the linter on "all" of mathlib. The expectation is that no error is thrown, just warnings. [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 251/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/Papercut.lean,MathlibTest/Papercut.lean | 4 | 24 | ['Julian', 'YaelDillies', 'adomani', 'eric-wieser', 'github-actions'] | nobody | 1 year ago | 670 days ago | 7 days |
| 19013 | quangvdao | feat(Algebra/BigOperators/Fin): Add `finSigmaFinEquiv` | This PR adds `finSigmaFinEquiv` which is the equivalence `(i : Fin m) × Fin (n i) ≃ Fin (∑ i, n i)`. This is the dependent version of `finProdFinEquiv`. CI should be passing, but there are two things I'd like feedback on: 1. When defining the mappings, I have to consider `m = 0` separately. Is there a more uniform definition? 2. I'm proving this as a step toward defining `Fin.join`, which is the analogue of `List.join`. I can now technically define `Fin.join` as: ``` variable {a : Fin n → ℕ} {α : (i : Fin n) → (j : Fin (a i)) → Sort*} def join (v : (i : Fin n) → (j : Fin (a i)) → α i j) (k : Fin (∑ i, a i)) : α (finSigmaFinEquiv.invFun k).1 (finSigmaFinEquiv.invFun k).2 := v (finSigmaFinEquiv.invFun k).1 (finSigmaFinEquiv.invFun k).2 ``` but this looks horrible. This highly motivates refactoring `invFun` as two new definitions: ``` def func1 {n : ℕ} (a : Fin n → ℕ) (k : Fin (∑ i, a i)) : Fin n := sorry def func2 {n : ℕ} (a : Fin n → ℕ) (k : Fin (∑ i, a i)) : Fin (a (func1 a k)) := sorry ``` I'm not sure what to call these functions. The analogues in the non-dependent case are `divNat` and `modNat`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 92/16 | Mathlib/Algebra/BigOperators/Fin.lean | 1 | 14 | ['YaelDillies', 'eric-wieser', 'github-actions', 'quangvdao'] | nobody | 1 year ago | 529 days ago | 3 days |
| 19227 | adomani | fix(CI): unwrap `lake test` in problem matcher | ... and also add a `#guard_msgs` in `AssertImported` test, so that `lake test` properly fails. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/CI.3A.20noisy.20.22test.20mathlib.22/near/483126955) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 9/20 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,MathlibTest/AssertImported.lean | 5 | 2 | ['bryangingechen', 'github-actions'] | nobody | 1 year ago | 505 days ago | 21 days |
| 15774 | kkytola | feat: Topology on `ENat` | This PR may contain some results that are not in the PR that adds a toppology on `ENat`. --- The immediate motivation is to be able to make the right continuity statement of the extended floor function on `ENNReal`, when this floor function is made `ENat`valued as suggested in the PR review of #15269. The API here is modelled on the early parts of [the corresponding ENNReal file](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Instances/ENNReal.html#top), although much of this case is more trivial. - [x] depends on: #15380 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology t-order | 161/9 | Mathlib/Data/ENat/Basic.lean,Mathlib/Topology/Instances/ENat.lean | 2 | 4 | ['YaelDillies', 'github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 626 days ago | 1 hour |
| 20222 | eric-wieser | feat: generalize lemmas about derivatives | Rather than creating a huge diff by shuffling things around, this generalizes everything in-place and swaps between `section`s for topological and normed vector spaces. The rationale for this approach is that: * we may further generalize the results of this file, and this avoids us jumbling up the order multiple times unnecessarily. * this greatly reduces the chance of merge conflicts --- - [ ] depends on: #21065 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-analysis | 554/50 | Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,MathlibTest/Recall.lean | 3 | 8 | ['adomani', 'eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 458 days ago | 7 days |
| 21018 | markimunro | feat(Data/Matrix): add file with key definitions and theorems about elementary row operations | Prove that each elementary row operation is equivalent to a multiplication by an elementary matrix, has another row operation which inverts it, and that each elementary matrix has a left inverse.
This is a very large PR and I understand it will take time. This is my first one and will likely have issues but I will be ready to answer questions/fix them as soon as possible.
Co-authored-by: Christopher Lynch |
t-data enhancement new-contributor merge-conflict awaiting-author | 1230/0 | Mathlib.lean,Mathlib/Data/Matrix/ElementaryRowOperations.lean,Mathlib/Data/Matrix/GaussianElimination.lean,Mathlib/Data/Matrix/GaussianEliminationOld,Mathlib/Data/Matrix/oldnames,et --hard 18533caba32,lean-toolchain | 7 | 17 | ['chrisflav', 'eric-wieser', 'github-actions', 'j-loreaux', 'markimunro'] | nobody | 1 year ago | 420 days ago | 23 days |
| 23514 | eric-wieser | refactor: smooth over Lattice/LinearOrder inheritance | This fixes the forgetful inheritance in `CompleteLinearOrder` and `ConditionallyCompleteLinearOrder`, which previously did not carry `compare` fields. (edit: moved to #23515) The following is the inheritance diagram before, where the dotted lines are manual instances. Note that every lattice typeclass that extends `LinearOrder` has to implement another dotted line edge, and remember to copy all the necessary data fields. ```mermaid graph TD LinearOrder --> Min,Max; LinearOrder --> PartialOrder; Lattice --> PartialOrder; CompleteLinearOrder --> Lattice; ConditionallyCompleteLinearOrder --> Lattice; LinearOrder-.-> Lattice; CompleteLinearOrder -.-> LinearOrder; ConditionallyCompleteLinearOrder -.-> LinearOrder; ``` This change introduces two new auxiliary typeclasses, to encapsulate these troublesome edges. `LinearOrderedLattice` can be thought of as `LinearOrder`, but with `sup`/`inf` instead of `min`/`max`. This is crucial, because it ensures the duplicate fields are merged in `extends CompleteLattice X, LinearOrderedLattice X`, which would not be the case for `extends CompleteLattice X, LinearOrder X`. The result is: ```mermaid graph TD LinearOrder --> Min,Max; LinearOrder --> LinearOrderBase; LinearOrderBase --> PartialOrder; Lattice --> PartialOrder; LinearOrderedLattice -.-> LinearOrder; LinearOrderedLattice --> LinearOrderBase; LinearOrderedLattice --> Lattice; CompleteLinearOrder --> LinearOrderedLattice; ConditionallyCompleteLinearOrder --> LinearOrderedLattice; ``` --- - [ ] depends on: #23515 - [ ] [](https://gitpod.io/from-referrer/) | merge-conflict | 85/66 | Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Order/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Defs/LinearOrder.lean,Mathlib/Order/Lattice.lean | 7 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 395 days ago | 15 minutes |
| 22810 | pechersky | feat(Counterexamples): metric space not induced by norm | Because the distance is not homogeneous --- [](https://gitpod.io/from-referrer/) - [x] depends on: #22845 | merge-conflict WIP t-topology t-analysis | 202/1 | Counterexamples.lean,Counterexamples/NotBoundedSMulMetricSpace.lean,Mathlib.lean,Mathlib/Analysis/Normed/PiNat.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean,Mathlib/Topology/MetricSpace/Polish.lean | 6 | 21 | ['eric-wieser', 'github-actions', 'loefflerd', 'mathlib4-dependent-issues-bot', 'pechersky'] | nobody | 1 year ago | 409 days ago | 23 hours |
| 13124 | astrainfinita | chore: remove `CovariantClass` and `ContravariantClass` | Lean cannot handle `CovariantClass` and `ContravariantClass` correctly - TC slowness - [Zulip](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/TC.20slowness) - https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1691792488 - It may also have made #6326 fail. - Needs a weird hack to find instance: #9252 --- - [x] depends on: #13154 [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 602/486 | Mathlib/Algebra/AddConstMap/Basic.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Algebra/BigOperators/Group/Multiset/Basic.lean,Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/Algebra/Group/Submonoid/Pointwise.lean,Mathlib/Algebra/Group/UniqueProds/Basic.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Group/Action.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/Units.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Unbundled.lean,Mathlib/Algebra/Order/GroupWithZero/WithZero.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Ring/Subring/Pointwise.lean,Mathlib/Algebra/Ring/Subsemiring/Pointwise.lean,Mathlib/Analysis/SumOverResidueClass.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/GroupTheory/OrderOfElement.lean,Mathlib/Order/Filter/IsBounded.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/Topology/Algebra/Order/LiminfLimsup.lean | 37 | 6 | ['MichaelStollBayreuth', 'astrainfinita', 'github-actions', 'leanprover-bot', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 15212 | victorliu5296 | feat: Add fundamental theorem of calculus-2 for Banach spaces | add the Mean Value Theorem for Banach spaces to the library and include reference for the theorem statement This theorem states that if `f : X → Y` is differentiable along the line segment from `a` to `b`, then the change in `f` equals the integral of its derivative along this path. This extends the mean value theorem to Banach spaces. This can be used for the eventual proof of the Newton-Kantorovich theorem with 1 constant contained inside the added reference. Here is the discussion on Zulipchat: https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Contributing.20FTC-2.20for.20Banach.20spaces | t-measure-probability new-contributor merge-conflict awaiting-author t-analysis | 60/1 | Mathlib/MeasureTheory/Integral/FundThmCalculus.lean | 1 | 3 | ['github-actions', 'hrmacbeth', 'victorliu5296'] | nobody | 1 year ago | 584 days ago | 51 days |
| 22888 | plp127 | perf: replace `Lean.Expr.swapBVars` with a better? implementation | Replaces `Lean.Expr.swapBVars` with a version that traverses the expression. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 14/12 | Mathlib/Tactic/FunProp/ToBatteries.lean | 1 | 23 | ['eric-wieser', 'github-actions', 'joneugster', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'plp127'] | eric-wieser and joneugster | 1 year ago | 409 days ago | 4 days |
| 22579 | kvanvels | doc(Topology/Defs/Induced): fix comments on three functions related to RestrictGenTopology | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-topology documentation awaiting-author | 10/9 | Mathlib/Topology/Defs/Induced.lean,Mathlib/Topology/RestrictGen.lean | 2 | 4 | ['github-actions', 'kvanvels', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 1 year ago | 410 days ago | 12 days |
| 21488 | imbrem | feat(CategoryTheory/Monoidal): premonoidal categories | Add support for premonoidal categories --- Still want to add support for: - Premonoidal braided/symmetric categories - The monoidal coherence theorem, which I've already ported in my `discretion` library - The `coherence` tactic, which should work fine for premonoidal categories too but wanted to get this in front of reviewers ASAP to make sure my general approach was alright [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory new-contributor | 900/361 | Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/End.lean,Mathlib/CategoryTheory/GradedObject/Monoidal.lean,Mathlib/CategoryTheory/Localization/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/CoherenceLemmas.lean,Mathlib/CategoryTheory/Monoidal/Discrete.lean,Mathlib/CategoryTheory/Monoidal/End.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Monoidal/Functor.lean,Mathlib/CategoryTheory/Monoidal/FunctorCategory.lean,Mathlib/CategoryTheory/Monoidal/Mon_.lean,Mathlib/CategoryTheory/Monoidal/Opposite.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean,MathlibTest/StringDiagram.lean | 21 | 9 | ['YaelDillies', 'github-actions', 'grunweg', 'imbrem', 'kim-em', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 387 days ago | 57 days |
| 21525 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Prelim) | This PR defines the basic preliminaries for defining locally cartesian closed categories (LCCCs). In particular, using the calculus of mates we define certain natural isomorphisms involving `Over.star` and `Over.pullback` which will be crucial in defining the right adjoint to the pullback functor in the development of LCCCs. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory large-import | 338/24 | Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Galois/Examples.lean | 3 | 13 | ['b-mehta', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'sinhp'] | nobody | 1 year ago | 387 days ago | 36 days |
| 22319 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Sections Right Adjoint) | we define the `Over.sections` functor in the file `CategoryTheory.Comma.Over.Sections` and prove that it is a right adjoint to the `Over.star`, thereby solving an existing TODO in `Over.pullback` file. The `sections` functor is used to define the right adjoint to the pullback functor `Over.pullback` in the development of LCCCs. Moreover, the rest of added lemmas and theorems to `CategoryTheory.Comma.Over.Pullback` are crucial for the development of LCCCs in the next PR. --- - [ ] depends on: #21525 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory large-import | 547/24 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Comma/Over/Sections.lean,Mathlib/CategoryTheory/Galois/Examples.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 429 days ago | 34 minutes |
| 22321 | sinhp | feat(CategoryTheory): Locally Cartesian Closed Categories (Definition) | This PR defines locally cartesian closed categories in terms of existence of the pushforward functors (right adjoint to the pullback functor) for all morphisms. We develop basic API and prove the following:
1. Existence of the pushforward functors is equivalent to cartesian closed slices.
2. Any locally cartesian closed category with a terminal object is cartesian closed.
3. The slices of a locally cartesian closed category are locally cartesian closed.
Some of the content is based on the project of formalization of polynomial functors at the Trimester "Prospect of Formal Mathematics" at the Hausdorff Institute (HIM) in Bonn. https://github.com/sinhp/Poly
I found this implementation of locally cartesian closed categories amenable to polynomial functors formalization.
Co-authored-by: Emily Riehl |
merge-conflict blocked-by-other-PR t-category-theory large-import | 812/24 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Comma/Over/Pullback.lean,Mathlib/CategoryTheory/Comma/Over/Sections.lean,Mathlib/CategoryTheory/Galois/Examples.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/Basic.lean | 6 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 429 days ago | 5 minutes |
| 19425 | hrmacbeth | perf: gcongr forward-reasoning adjustment | This PR changes the "forward-reasoning" component of `gcongr`, rendering it more efficient, particularly in problems with a large number of variables/hypotheses in the context.
Previously `gcongr` attempted to match *every* `LocalDecl` against *every* node in the parse tree using *each* of the five implemented `@[gcongr_forward]` mini-tactics: matching directly, matching after applying `symm`, matching after applying `le_of_lt`, etc etc.
The new algorithm filters out the non-Prop `LocalDecl`s, and also adjusts the `@[gcongr_forward]` extensions so that, rather than re-apply the relevant lemmas (`symm`, `le_of_lt`, etc) at every node in the parse tree, the lemmas are applied in advance to the `LocalDecl`s and the result (if successful) stored.
The performance effect on mathlib as a whole is miniscule, but it speeds up the profiler's count of "tactic execution of Mathlib.Tactic.GCongr" in the newly-added test from 257 ms to 47 ms, and has a similar effect on real-life examples in an analysis project of mine.
Co-authored-by: Mario Carneiro |
merge-conflict awaiting-author | 130/59 | Mathlib/Order/Lattice.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GCongr/ForwardAttr.lean,MathlibTest/GCongr/inequalities.lean | 4 | 17 | ['Vierkantor', 'github-actions', 'hrmacbeth', 'leanprover-bot', 'leanprover-community-bot-assistant'] | Vierkantor | 1 year ago | 519 days ago | 1 day |
| 20873 | vbeffara | feat(Topology/Covering): path lifting and homotopy lifting | This proves the existence and uniqueness of path and homotopy lifts through covering maps. --- I tried to separate as much of the proof as possible into separate PRs (which are already in Mathlib now), but the proof here relies on a monolithic construction of an explicit lift along a well-chosen subdivision, in `partial_lift`, with associated definitions. Only one standalone lean file added. An older WIP PR #10084 by Junyan Xu @alreadydone proves similar results using a very similar construction for path lifting, with a different argument to obtain continuity for homotopy lifting. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology new-contributor | 281/1 | Mathlib.lean,Mathlib/Topology/Covering/Basic.lean,Mathlib/Topology/Covering/Lift.lean | 3 | 9 | ['alreadydone', 'github-actions', 'grunweg', 'vbeffara'] | nobody | 1 year ago | 461 days ago | 5 days |
| 22817 | peabrainiac | feat(CategoryTheory/Sites): local sites | Defines local sites and shows that sheaves of types on them form a local topos, in that the global sections functor `Sheaf.Γ` has a right adjoint `Sheaf.codisc` that is fully faithful. --- - [x] depends on: #22816 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 263/0 | Mathlib.lean,Mathlib/CategoryTheory/Limits/FunctorCategory/Shapes/Products.lean,Mathlib/CategoryTheory/Limits/Types.lean,Mathlib/CategoryTheory/Sites/GlobalSections.lean,Mathlib/CategoryTheory/Sites/LocalSite.lean,Mathlib/CategoryTheory/Sites/Sheaf.lean | 6 | 4 | ['github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 416 days ago | 9 minutes |
| 16314 | astrainfinita | chore(Data/Quot): deprecate `ind*'` APIs | --- - [x] depends on: #16264 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 247/287 | Counterexamples/CliffordAlgebraNotInjective.lean,Mathlib/Algebra/Colimit/Module.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/CategoryTheory/Subobject/FactorThru.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Computability/Reduce.lean,Mathlib/Computability/Tape.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Multiset/ZeroCons.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/Data/Setoid/Partition.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/GroupTheory/Complement.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Hom.lean,Mathlib/GroupTheory/Coset/Basic.lean,Mathlib/GroupTheory/Coset/Defs.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/GroupTheory/GroupAction/Basic.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/MonoidLocalization/Basic.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean,Mathlib/GroupTheory/PresentedGroup.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SchurZassenhaus.lean,Mathlib/GroupTheory/Sylow.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/LinearAlgebra/Projectivization/Basic.lean,Mathlib/LinearAlgebra/Quotient/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/RepresentationTheory/GroupCohomology/Hilbert90.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Congruence/Basic.lean,Mathlib/RingTheory/Flat/FaithfullyFlat/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousLocalization.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Valuation/Quotient.lean,Mathlib/Topology/Algebra/Group/TopologicalAbelianization.lean,Mathlib/Topology/Algebra/InfiniteSum/Module.lean,Mathlib/Topology/Separation/Basic.lean | 65 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 381 days ago | 55 days |
| 23509 | eric-wieser | refactor: Make ENNReal an abbrev | The `Coe` instance becomes `CoeTC` to match what we do for `WithTop` (such that the priority kicks in) Probably we could have both copies and things would be ok. --- [](https://gitpod.io/from-referrer/) This includes part of #23750 | merge-conflict t-data | 22/66 | Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/BigOperators.lean,Mathlib/Data/ENNReal/Operations.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/MeasureTheory/Measure/Sub.lean,Mathlib/MeasureTheory/Measure/TightNormed.lean,Mathlib/Topology/MetricSpace/PartitionOfUnity.lean | 7 | 22 | ['eric-wieser', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'leanprover-community-mathlib4-bot', 'mattrobball', 'urkud'] | nobody | 1 year ago | 382 days ago | 5 days |
| 11455 | adomani | fix: unsqueeze simp, re Yaël's comments on #11259 | This PR reverts/simplifies some of the "squeeze `simp`" changes in #11259. See #11259 for context. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 3/6 | Mathlib/Algebra/Group/Conj.lean,Mathlib/Data/Seq/WSeq.lean | 2 | 8 | ['Ruben-VandeVelde', 'YaelDillies', 'grunweg', 'loefflerd', 'robertylewis', 'urkud'] | nobody | 1 year ago | 679 days ago | 93 days |
| 7325 | eric-wieser | chore: use preimageIso instead of defeq abuse for InducedCategory | This makes a few things slightly more verbose, but the type casts are now explicit in those places. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory awaiting-CI | 22/21 | Mathlib/CategoryTheory/EssentialImage.lean,Mathlib/CategoryTheory/Monoidal/Braided.lean,Mathlib/CategoryTheory/Monoidal/Subcategory.lean | 3 | 1 | ['grunweg'] | nobody | 1 year ago | unknown | 0 seconds |
| 7874 | astrainfinita | chore: make `IsScalarTower A A B` and `IsScalarTower A B B` higher priority | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra awaiting-CI | 10/9 | Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Group/Action/Defs.lean,Mathlib/Data/Rat/Cast/Defs.lean,Mathlib/GroupTheory/GroupAction/Ring.lean | 4 | 3 | ['astrainfinita', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 13038 | adomani | feat: Mathlib weekly reports | This PR introduces a weekly cron job that computes a "global" report on the evolution of Mathlib in the previous week. It consists of * a CI workflow with a cron job that runs at minight on Sunday (`.github/workflows/mathlib_stats.yaml`); * a Lean file extracting a categorized list of "all" the declarations in Mathlib (`scripts/count_decls.lean`); * a bash file computing Git-diff-related information and collating the data from the Lean file (`scripts/mathlib_stats.sh`); * a convenience CI workflow that is triggered on adding the `test-ci` label and results in posting on the PR and on Zulip the report (`.github/workflows/mathlib_stats_label.yaml`). The second CI workflow is intended to be removed just before/right after the PR is ready to merge. [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/113488-general) [Thread for the reports](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Mathlib.20weekly.20change.20report) --- [](https://gitpod.io/from-referrer/) | awaiting-author CI t-meta | 338/0 | .github/workflows/mathlib_stats.yaml,.github/workflows/mathlib_stats_label.yaml,scripts/count_decls.lean,scripts/mathlib_stats.sh | 4 | 10 | ['adomani', 'github-actions', 'grunweg', 'kim-em', 'kmill'] | nobody | 1 year ago | 655 days ago | 57 days |
| 5952 | eric-wieser | feat: add Qq wrappers for ToExpr | --- - [ ] depends on: #6699 (to appease the linter) [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-CI t-meta | 247/150 | Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/VecNotation.lean,Mathlib/Data/Matrix/Notation.lean,Mathlib/Tactic/DeriveToExpr.lean,Mathlib/Tactic/FBinop.lean,Mathlib/Tactic/ToExpr.lean,Mathlib/Util/Qq.lean,test/DeriveToExpr.lean,test/vec_notation.lean | 9 | 7 | ['eric-wieser', 'gebner', 'grunweg', 'leanprover-community-mathlib4-bot'] | nobody | 1 year ago | 987 days ago | 29 days |
| 15483 | astrainfinita | chore(GroupTheory/Coset): reduce defeq abuse | --- - [x] depends on: #15482 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 114/60 | Mathlib/GroupTheory/Commensurable.lean,Mathlib/GroupTheory/Coset.lean,Mathlib/GroupTheory/QuotientGroup.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/MeasureTheory/Measure/Haar/Quotient.lean,Mathlib/Topology/Algebra/Group/Compact.lean | 6 | 14 | ['astrainfinita', 'eric-wieser', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball', 'mergify', 'urkud'] | nobody | 1 year ago | 629 days ago | 4 days |
| 16594 | astrainfinita | perf: reorder `extends` and remove some instances in algebra hierarchy | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 240/92 | Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Associated/Basic.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Prod.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/Rat.lean,Mathlib/Algebra/Ring/SumsOfSquares.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/FieldTheory/SplittingField/Construction.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/MonoidLocalization/MonoidWithZero.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Order/Filter/Germ/Basic.lean,Mathlib/Order/Interval/Finset/Box.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/Ideal/Quotient.lean,Mathlib/RingTheory/Perfection.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/Util/NoInstances.lean,scripts/noshake.json | 50 | 8 | ['astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot'] | nobody | 1 year ago | 585 days ago | 14 days |
| 19467 | quangvdao | feat(MvPolynomial/Equiv): Add `MvPolynomial.finSuccEquivNth` | This PR adds `MvPolynomial.finSuccEquivNth`, which is the algebra isomorphism between `MvPolynomial (Fin (n + 1)) R` and `Polynomial (MvPolynomial (Fin n) R)` by identifying the `p`-th variable as the indeterminate.
This generalizes `MvPolynomial.finSuccEquiv` which is only for the `0`-th variable. The supporting theorems for the `Nth` version are identical to the current version, with the `Nth` version deduced from the former.
These changes require new definitions in `Finsupp/Fin`, which is a separate PR.
Co-authored-by: Yaël Dillies |
merge-conflict t-algebra blocked-by-other-PR | 541/163 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/Tuple/Basic.lean,Mathlib/Data/Finsupp/Fin.lean,scripts/nolints_prime_decls.txt | 7 | 9 | ['acmepjz', 'github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 1 year ago | 522 days ago | 13 minutes |
| 20313 | thefundamentaltheor3m | feat(Data/Complex/Exponential): prove some useful results about the complex exponential. | This PR proves two basic results about the complex exponential: * `abs_exp_mul_I (x : ℂ) : abs (Complex.exp (I * x)) = Real.exp (-x.im)` * `one_sub_rexp_re_le_abs_one_sub_cexp (x : ℂ) : 1 - Real.exp x.re ≤ Complex.abs (1 - Complex.exp x)` Both results were proved as part of the sphere packing project. There's a chance they're too specific for mathlib, but I thought they were worth PRing anyway. Would it also be a good idea to tag `abs_exp_mul_I` with `simp`? Feedback/suggestions welcome. Note: `one_sub_rexp_re_le_abs_one_sub_cexp` was proved by Bhavik Mehta @b-mehta --- [](https://gitpod.io/from-referrer/) | merge-conflict t-analysis new-contributor | 167/141 | Mathlib.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/ERealExp.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev.lean,Mathlib/Data/Complex/Exponential/Defs.lean,Mathlib/Data/Complex/Exponential/Lemmas.lean,Mathlib/Data/Complex/ExponentialBounds.lean,Mathlib/Tactic/FunProp.lean,MathlibTest/Recall.lean,MathlibTest/positivity.lean | 10 | 12 | ['b-mehta', 'github-actions', 'kim-em', 'thefundamentaltheor3m', 'trivial1711'] | nobody | 1 year ago | 462 days ago | 8 days |
| 22698 | Kiolt | feat: notation for whisker(Left/Right)Iso | From Toric --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory toric | 175/113 | Mathlib/Algebra/Homology/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Bicategory/Basic.lean,Mathlib/CategoryTheory/Bicategory/Coherence.lean,Mathlib/CategoryTheory/Bicategory/Extension.lean,Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean,Mathlib/CategoryTheory/Bicategory/NaturalTransformation/Strong.lean,Mathlib/CategoryTheory/Bicategory/SingleObj.lean,Mathlib/CategoryTheory/Closed/Functor.lean,Mathlib/CategoryTheory/Closed/Ideal.lean,Mathlib/CategoryTheory/Enriched/FunctorCategory.lean,Mathlib/CategoryTheory/GradedObject/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/CategoryTheory/Monoidal/Braided/Reflection.lean,Mathlib/CategoryTheory/Monoidal/Category.lean,Mathlib/CategoryTheory/Monoidal/Center.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Monoidal/Preadditive.lean,Mathlib/CategoryTheory/Monoidal/Transport.lean,Mathlib/Tactic/CategoryTheory/BicategoricalComp.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Normalize.lean,Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/MonoidalComp.lean | 27 | 21 | ['Kiolt', 'YaelDillies', 'b-mehta', 'github-actions', 'leanprover-bot'] | nobody | 1 year ago | 415 days ago | 3 days |
| 19613 | madvorak | refactor(Combinatorics/Optimization/ValuedCSP): make only valid `FractionalOperation` possible | Originally `FractionalOperation` was any multiset (possible empty). Then `FractionalOperation.IsValid` said it was nonempty. Instead, I would like to make it nonempty by definition. As a result, empty/invalid fractional operation couldn't be declared at all. --- [](https://gitpod.io/from-referrer/) | t-combinatorics | 14/17 | Mathlib/Combinatorics/Optimization/ValuedCSP.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | 508 days ago | 9 days |
| 20730 | kuotsanhsu | feat(LinearAlgebra/Matrix/SchurTriangulation): prove Schur decomposition/triangulation | `Matrix.schur_triangulation` shows that a matrix over an algebraically closed field is unitarily similar to an upper triangular matrix --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 317/2 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Block.lean,Mathlib/LinearAlgebra/Matrix/SchurTriangulation.lean,Mathlib/Logic/Equiv/Basic.lean | 4 | 14 | ['eric-wieser', 'github-actions', 'kim-em', 'kuotsanhsu'] | nobody | 1 year ago | 458 days ago | 13 days |
| 19117 | eric-wieser | feat: derivatives of matrix operations | These are finally possible to state after #19108. However, a lot of bundled `ContinuousLinearMap`s are missing. --- - [x] depends on: #19108 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 336/22 | Mathlib.lean,Mathlib/Analysis/Calculus/Deriv/Matrix.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Matrix.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | unknown | 0 seconds |
| 12605 | astrainfinita | chore: attribute [induction_eliminator] | Add attribute [induction_eliminator] to `AdjoinRoot.induction_on` `ENat.recTopCoe` `ENNReal.recTopCoe` `Finset.induction` `Magma.AssocQuotient.induction_on` `ManyOneDegree.ind_on` `Module.Ray.ind` (and add `Orientation.ind` for `Orientation`, an abbrev of it. I wish that we do not need to add it in the future.) `Multiset.induction` `MvPolynomial.induction_on` `OnePoint.rec` `Opposite.rec'` `Ordinal.limitRecOn` `PartENat.casesOn` `Polynomial.induction_on'` `QuotientAddGroup.induction_on'` (and add `AddCircle.induction_on` for `AddCircle`, an abbrev of it. I wish that we do not need to add it in the future.) `QuotientGroup.induction_on'` (doesn't actually work) `Real.Angle.induction_on` `SimplexCategory.rec` `Trunc.induction_on` --- - [x] depends on: #13476 - [x] depends on: #13264 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 354/342 | Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Group/Finset.lean,Mathlib/Algebra/BigOperators/Group/Multiset.lean,Mathlib/Algebra/BigOperators/Ring.lean,Mathlib/Algebra/GCDMonoid/Finset.lean,Mathlib/Algebra/GCDMonoid/Multiset.lean,Mathlib/Algebra/Group/Subgroup/Finite.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/Algebra/Lie/Weights/Basic.lean,Mathlib/Algebra/Module/BigOperators.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/Derivation.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Algebra/Polynomial/Degree/Lemmas.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Eval.lean,Mathlib/Algebra/Polynomial/Induction.lean,Mathlib/Algebra/Polynomial/Module/Basic.lean,Mathlib/Algebra/Polynomial/PartialFractions.lean,Mathlib/Algebra/Polynomial/Smeval.lean,Mathlib/Algebra/Tropical/BigOperators.lean,Mathlib/AlgebraicTopology/DoldKan/NCompGamma.lean,Mathlib/AlgebraicTopology/SimplexCategory.lean,Mathlib/AlgebraicTopology/SplitSimplicialObject.lean,Mathlib/Analysis/Analytic/Constructions.lean,Mathlib/Analysis/Asymptotics/Asymptotics.lean,Mathlib/Analysis/BoxIntegral/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/Calculus/ContDiff/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Analysis/Calculus/Deriv/Polynomial.lean,Mathlib/Analysis/Convex/Combination.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Fourier/AddCircle.lean,Mathlib/Analysis/NormedSpace/Exponential.lean,Mathlib/Analysis/NormedSpace/Multilinear/Basic.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/PolynomialExp.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Angle.lean,Mathlib/CategoryTheory/Filtered/Basic.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean,Mathlib/Combinatorics/SetFamily/Compression/Down.lean,Mathlib/Combinatorics/SetFamily/FourFunctions.lean,Mathlib/Combinatorics/SetFamily/HarrisKleitman.lean,Mathlib/Computability/Reduce.lean,Mathlib/Data/DFinsupp/Basic.lean,Mathlib/Data/DFinsupp/WellFounded.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finset/Lattice.lean,Mathlib/Data/Finset/NAry.lean,Mathlib/Data/Fintype/Sum.lean,Mathlib/Data/Multiset/Antidiagonal.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Multiset/Bind.lean,Mathlib/Data/Multiset/Fold.lean,Mathlib/Data/Multiset/Lattice.lean,Mathlib/Data/Multiset/Pi.lean,Mathlib/Data/Multiset/Powerset.lean,Mathlib/Data/Multiset/Sections.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/Quot.lean,Mathlib/Data/Set/Pointwise/BigOperators.lean,Mathlib/FieldTheory/IntermediateField.lean,Mathlib/FieldTheory/IsAlgClosed/AlgebraicClosure.lean,Mathlib/Geometry/Manifold/Algebra/Monoid.lean,Mathlib/Geometry/RingedSpace/Basic.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/Geometry/RingedSpace/PresheafedSpace/Gluing.lean,Mathlib/GroupTheory/Coset.lean,Mathlib/GroupTheory/NoncommPiCoprod.lean,Mathlib/GroupTheory/Perm/Cycle/Type.lean,Mathlib/LinearAlgebra/Determinant.lean,Mathlib/LinearAlgebra/Eigenspace/Basic.lean,Mathlib/LinearAlgebra/FiniteDimensional.lean,Mathlib/LinearAlgebra/LinearIndependent.lean,Mathlib/LinearAlgebra/Matrix/Determinant/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/LinearAlgebra/Projectivization/Basic.lean,Mathlib/LinearAlgebra/Ray.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/Logic/Hydra.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean,Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Integral/Lebesgue.lean,Mathlib/MeasureTheory/Integral/Marginal.lean,Mathlib/MeasureTheory/Integral/MeanInequalities.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean,Mathlib/MeasureTheory/Measure/AddContent.lean | 140 | 14 | ['YaelDillies', 'astrainfinita', 'eric-wieser', 'github-actions', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 1 year ago | 709 days ago | 4 days |
| 23859 | urkud | feat(Topology/../Order/Field): generalize to `Semifield` | .. from a linear ordered field to a linear ordered semifield--- - [ ] depends on: #23857 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 245/219 | Mathlib/Algebra/Order/Group/Pointwise/Interval.lean,Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean,Mathlib/Topology/Algebra/Order/Field.lean,Mathlib/Topology/Order/Basic.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 year ago | 387 days ago | 4 minutes |
| 24219 | Paul-Lez | feat: linear independence of the tensor product of two linearly independent families | This is still WIP (the proofs are a little too long, and some lemmas need to be moved to other files!) From Toric --- [](https://gitpod.io/from-referrer/) | WIP t-algebra toric | 193/0 | Mathlib/LinearAlgebra/LinearIndependent/Tprod.lean | 1 | 1 | ['github-actions'] | nobody | 1 year ago | 376 days ago | 3 minutes |
| 23810 | b-reinke | chore(Order/Interval): generalize succ/pred lemmas to partial orders | Many lemmas in `Mathlib/Order/Interval/Set/SuccPred.lean`and `Mathlib/Order/Interval/Finset/SuccPred.lean` also work for partial orders. They are generalized in this PR by introducing different sections for `PartialOrder` and `LinearOrder` assumptions in the respective files. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order | 231/89 | Mathlib/Order/Interval/Finset/SuccPred.lean,Mathlib/Order/Interval/Set/SuccPred.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 372 days ago | 16 days |
| 24285 | madvorak | chore(Algebra/*-{Category,Homology}): remove unnecessary universe variables | Discussions: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Call.20for.20help.3A.20technical.2F.20organisational.20debt/with/513620128 https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Algebra.20and.20.60Type*.60/with/513558902 https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Task.2026.3A.20Replace.20Type.20u.20by.20Type*.20wherever.20possible/with/513592993 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 542/916 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Field.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Central/Basic.lean,Mathlib/Algebra/Central/Defs.lean,Mathlib/Algebra/Central/TensorProduct.lean,Mathlib/Algebra/CharP/Pi.lean,Mathlib/Algebra/CharP/Quotient.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Finsupp.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/Field/IsField.lean,Mathlib/Algebra/Field/MinimalAxioms.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/Algebra/Field/Subfield/Defs.lean,Mathlib/Algebra/FreeNonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Equiv/Finite.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Hom/End.lean,Mathlib/Algebra/Group/Hom/Instances.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Invertible/Defs.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/Group/Pi/Lemmas.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/TypeTags/Finite.lean,Mathlib/Algebra/Group/TypeTags/Hom.lean,Mathlib/Algebra/Group/Units/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/Algebra/Group/WithOne/Basic.lean,Mathlib/Algebra/Group/WithOne/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Pi.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/NeZero.lean,Mathlib/Algebra/Lie/Abelian.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/Lie/CartanMatrix.lean,Mathlib/Algebra/Lie/CartanSubalgebra.lean,Mathlib/Algebra/Lie/Character.lean,Mathlib/Algebra/Lie/Classical.lean,Mathlib/Algebra/Lie/DirectSum.lean,Mathlib/Algebra/Lie/Free.lean,Mathlib/Algebra/Lie/Ideal.lean,Mathlib/Algebra/Lie/IdealOperations.lean,Mathlib/Algebra/Lie/Matrix.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/NonUnitalNonAssocAlgebra.lean,Mathlib/Algebra/Lie/OfAssociative.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Lie/SkewAdjoint.lean,Mathlib/Algebra/Lie/Solvable.lean,Mathlib/Algebra/Lie/Subalgebra.lean,Mathlib/Algebra/Lie/Submodule.lean,Mathlib/Algebra/Lie/TensorProduct.lean,Mathlib/Algebra/Lie/UniversalEnveloping.lean,Mathlib/Algebra/Module/Basic.lean,Mathlib/Algebra/Module/CharacterModule.lean,Mathlib/Algebra/Module/DedekindDomain.lean,Mathlib/Algebra/Module/Defs.lean,Mathlib/Algebra/Module/End.lean,Mathlib/Algebra/Module/Equiv/Opposite.lean,Mathlib/Algebra/Module/Lattice.lean,Mathlib/Algebra/Module/LinearMap/Basic.lean,Mathlib/Algebra/Module/LinearMap/Defs.lean,Mathlib/Algebra/Module/LinearMap/End.lean,Mathlib/Algebra/Module/LocalizedModule/Basic.lean,Mathlib/Algebra/Module/MinimalAxioms.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/Module/Opposite.lean,Mathlib/Algebra/Module/Pi.lean,Mathlib/Algebra/Module/Presentation/Differentials.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Algebra/Module/Rat.lean,Mathlib/Algebra/Module/RingHom.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/MonoidAlgebra/Support.lean,Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean | 182 | 22 | ['erdOne', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'madvorak', 'mattrobball'] | nobody | 1 year ago | 371 days ago | 2 days |
| 22583 | imathwy | feat: affinespace homeomorphism | There exists a homeomorphism (a continuous bijection with a continuous inverse) between an affine subspace s of a vector space V over a field 𝕜 and its direction s.direction , given a chosen point z ∈ s . --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 64/2 | Mathlib/Analysis/Normed/Group/AddTorsor.lean,Mathlib/LinearAlgebra/AffineSpace/ContinuousAffineEquiv.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/MulAction.lean | 4 | 6 | ['JovanGerb', 'eric-wieser', 'github-actions', 'grunweg'] | nobody | 1 year ago | 422 days ago | 5 hours |
| 23593 | erdOne | feat(AlgebraicGeometry): the tilde construction is functorial | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 95/38 | Mathlib/AlgebraicGeometry/Modules/Sheaf.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean | 2 | 4 | ['chrisflav', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 393 days ago | 19 hours |
| 21065 | eric-wieser | feat: generalize `tangentConeAt.lim_zero` to TVS | ... and then adjust the `variable`s down the rest of the file to make use of the generality. There are two key lemmas that this does not generalize, which would probably unlock the rest of the file: * `subset_tangentCone_prod_left` (and `_right`) * `zero_mem_tangentCone` --- - [ ] depends on: #20859 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 55/28 | Mathlib/Analysis/Calculus/TangentCone.lean | 1 | 16 | ['ADedecker', 'eric-wieser', 'github-actions', 'j-loreaux', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'urkud'] | nobody | 1 year ago | 435 days ago | 23 days |
| 22721 | grunweg | chore(MeasureTheory/Function/LpSeminorm/Basic): generalise more results to enorm classes | Done for the Carleson project. --- - depends on #22708 [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson t-measure-probability | 134/10 | Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 1 year ago | 418 days ago | 6 seconds |
| 14731 | adomani | feat: the repeated typeclass assumption linter | [#mathlib4 > recyclable variables @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/recyclable.20variables/near/451167963) also [#mathlib4 > Normed modules @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Normed.20modules/near/512242167) --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter large-import | 178/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter.lean,Mathlib/Tactic/Linter/DependentTypeclass.lean,MathlibTest/DependentTypeclass.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 1 year ago | 656 days ago | 1 minute |
| 24549 | grunweg | feat: define embedded submanifolds, attempt 1 | Not meant to be merged (I think a different design is better); opening this so I can find this more easily. --- - [ ] depends on: #23040 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 1445/2 | Mathlib.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Splits.lean,Mathlib/Geometry/Manifold/Diffeomorph.lean,Mathlib/Geometry/Manifold/EmbeddedSubmanifold.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean,Mathlib/Geometry/Manifold/MSplits.lean,Mathlib/LinearAlgebra/Prod.lean | 8 | 2 | ['leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 11 months ago | 364 days ago | 1 second |
| 22809 | b-reinke | feat: Category algebras and path algebras | This PR defines the category algebra of a linear category and path algebras of quivers. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory new-contributor | 218/0 | Mathlib/Algebra/Ring/Assoc.lean,Mathlib/CategoryTheory/Linear/CategoryAlgebra.lean,Mathlib/Combinatorics/Quiver/PathAlgebra.lean,Mathlib/Data/DFinsupp/BigOperators.lean | 4 | 2 | ['b-reinke', 'github-actions'] | nobody | 11 months ago | unknown | 0 seconds |
| 14675 | adomani | dev: the repeated variable linter | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-linter | 71/0 | Mathlib/Tactic/Linter/Lint.lean | 1 | 1 | ['github-actions'] | nobody | 11 months ago | 658 days ago | 8 seconds |
| 14330 | Ruben-VandeVelde | chore: split Mathlib.Algebra.Star.Basic | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 446/331 | Mathlib.lean,Mathlib/Algebra/Module/LinearMap/Star.lean,Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/BigOperators.lean,Mathlib/Algebra/Star/Defs.lean,Mathlib/Algebra/Star/Lemmas.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Star/Pi.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/Rat.lean,Mathlib/Algebra/Star/Regular.lean,Mathlib/Algebra/Star/StarRingHom.lean,Mathlib/Analysis/NormedSpace/LinearIsometry.lean,Mathlib/Data/Complex/Basic.lean,scripts/noshake.json | 15 | 3 | ['github-actions', 'grunweg', 'j-loreaux'] | nobody | 11 months ago | 668 days ago | 12 hours |
| 8511 | eric-wieser | refactor(MeasureTheory/Measure/Haar/Basic): partially generalize to the affine case | Without a `Mul` version of `AddTorsor`, this generalization can only go so far. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 52/46 | Mathlib/MeasureTheory/Measure/Haar/Basic.lean | 1 | 0 | [] | nobody | 11 months ago | 894 days ago | 7 seconds |
| 7994 | ericrbg | chore: generalize `LieSubalgebra.mem_map_submodule` | --- Not sure if we should rename to something like `mem_map_iff_mem_map_submodule` or not. [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-algebra | 16/4 | Mathlib/Algebra/Lie/SkewAdjoint.lean,Mathlib/Algebra/Lie/Subalgebra.lean | 2 | 3 | ['eric-wieser', 'ericrbg'] | nobody | 11 months ago | 916 days ago | 1 second |
| 6317 | eric-wieser | refactor(Data/Finsupp/Defs): make Finsupp.single defeq to Pi.single | By adding a `DecidableEq ι` argument to `Finsupp.single`, we remove the reference to `Classical.decEq ι` in the definition, which in turn means that when coerced to a function it is now defeq to `Pi.single`. This also brings it in line with `DFinsupp.single`. This does not go as far as making `Finsupp.single` computable. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-data | 269/226 | Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Data/Finsupp/AList.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/Fintype.lean,Mathlib/Data/Finsupp/Indicator.lean,Mathlib/Data/Finsupp/Multiset.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Finsupp/ToDFinsupp.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/LinearAlgebra/Basis.lean,Mathlib/LinearAlgebra/Finsupp.lean | 12 | 0 | [] | nobody | 11 months ago | unknown | 0 seconds |
| 11524 | mcdoll | refactor: Introduce type-class for SchwartzMap | --- There are a lot of other refactors to do (`seminormAux` should have a nicer name and gobble up more theorems from `seminorm`), then one can prove `integrable` and friends with only `SchwartzMapClass`. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis | 139/137 | Mathlib/Analysis/Distribution/SchwartzSpace.lean,Mathlib/Analysis/Fourier/PoissonSummation.lean,Mathlib/Topology/ContinuousFunction/ZeroAtInfty.lean | 3 | 0 | [] | nobody | 11 months ago | unknown | 0 seconds |
| 11003 | thorimur | chore: migrate to `tfae` block tactic | Migrates to the `tfae` block tactic syntax, eliminating uses of `tfae_have` and `tfae_finish`. --- - [ ] depends on: #11000 - [ ] depends on: #10991 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR t-meta | 1267/1081 | Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Homology/ShortComplex/ExactFunctor.lean,Mathlib/Algebra/Order/ToIntervalMod.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/NormedSpace/OperatorNorm/NormedSpace.lean,Mathlib/Analysis/RCLike/Basic.lean,Mathlib/Analysis/SpecificLimits/Normed.lean,Mathlib/CategoryTheory/Abelian/Exact.lean,Mathlib/CategoryTheory/Bicategory/Kan/Adjunction.lean,Mathlib/FieldTheory/Galois.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/LinearAlgebra/Eigenspace/Zero.lean,Mathlib/MeasureTheory/Group/Action.lean,Mathlib/NumberTheory/FLT/Basic.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/Height.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/RingTheory/Bezout.lean,Mathlib/RingTheory/DiscreteValuationRing/TFAE.lean,Mathlib/RingTheory/Flat/EquationalCriterion.lean,Mathlib/RingTheory/Henselian.lean,Mathlib/RingTheory/LocalRing/RingHom/Basic.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/SetTheory/Ordinal/Topology.lean,Mathlib/Tactic/TFAE.lean,Mathlib/Topology/Algebra/Group/SubmonoidClosure.lean,Mathlib/Topology/Category/CompHaus/EffectiveEpi.lean,Mathlib/Topology/Category/Profinite/EffectiveEpi.lean,Mathlib/Topology/Category/Stonean/EffectiveEpi.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/LocallyClosed.lean,Mathlib/Topology/LocallyConstant/Basic.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Order/LeftRightNhds.lean,Mathlib/Topology/Separation.lean,Mathlib/Topology/UniformSpace/UniformConvergence.lean,scripts/noshake.json,test/tfae.lean | 42 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 11 months ago | 592 days ago | 3 days |
| 22488 | smmercuri | fix: lower priority for `UniformSpace.Completion.instSMul` | Following the introduction of the `WithVal` type synonym in #22055 the following instance takes a long time to synthesise in FLT, and times out in the default heartbeats ```lean import Mathlib namespace IsDedekindDomain.HeightOneSpectrum variable (A K : Type*) [CommRing A] [Field K] [Algebra A K] [IsFractionRing A K] [IsDedekindDomain A] (v : HeightOneSpectrum A) #synth SMul (v.adicCompletionIntegers K) (v.adicCompletion K) ``` The issue is that `UniformSpace.Completion.instSMul (v.adicCompletionIntegers K) (v.adicCompletion K)` now fires during the start of instance search (because we now have `UniformSpace (WithVal (v.valuation K))` whereas previously this would be `UniformSpace K`, which was not automatic), and this takes a long time to fail (leading to ~1400 entries in the trace). The first few lines of the new trace is ```lean [Meta.synthInstance] [5.512418] ✅️ SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▼ [] [0.000118] new goal SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000537] ✅️ apply UniformSpace.Completion.instSMul to SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.004411] ✅️ apply @WithVal.instSMul to SMul (↥(adicCompletionIntegers K v)) (WithVal (valuation K v)) ▶ [] [0.000765] ❌️ apply @GradedMonoid.GradeZero.smul to SMul (↥(adicCompletionIntegers K v)) K ▶ [] [0.000378] ✅️ apply @Algebra.toSMul to SMul (↥(adicCompletionIntegers K v)) K ▶ ... [] 1339 more entries... ▶ ``` Lowering the priority of `UniformSpace.Completion.instSMul` fixes this particular issue, leading to a trace that matches that seen prior to the introduction of `WithVal`: ```lean [Meta.synthInstance] [0.016405] ✅️ SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▼ [] [0.000119] new goal SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000491] ❌️ apply @GradedMonoid.GradeZero.smul to SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000403] ✅️ apply @Algebra.toSMul to SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000134] ❌️ apply inst✝⁴ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000093] ❌️ apply inst✝⁵ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000077] ❌️ apply inst✝⁷ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000082] ❌️ apply inst✝⁹ to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000075] ❌️ apply inst✝¹² to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.000220] ❌️ apply Algebra.id to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [] [0.001015] ✅️ apply @ValuationSubring.instAlgebraSubtypeMem to Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [resume] [0.000038] propagating Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) to subgoal Algebra (↥(adicCompletionIntegers K v)) (adicCompletion K v) of SMul (↥(adicCompletionIntegers K v)) (adicCompletion K v) ▶ [check] [0.013358] ✅️ Algebra.toSMul [] result Algebra.toSMul ``` --- [](https://gitpod.io/from-referrer/) | awaiting-author t-topology FLT | 1/1 | Mathlib/Topology/Algebra/UniformMulAction.lean | 1 | 10 | ['github-actions', 'leanprover-bot', 'smmercuri', 'urkud'] | nobody | 11 months ago | 368 days ago | 55 days |
| 15654 | TpmKranz | feat(Computability): language-preserving maps between NFA and RE | Map REs to NFAs via Thompson's construction and NFAs to REs using GNFAs Last chunk of #12648 --- - [ ] depends on: #15651 - [ ] depends on: #15649 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR new-contributor t-computability merge-conflict awaiting-zulip | 985/2 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Data/FinEnum/Option.lean,docs/references.bib | 7 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot', 'meithecatte'] | nobody | 11 months ago | 630 days ago | 2 minutes |
| 19315 | quangvdao | feat(Data/Finsupp/Fin): Add `Finsupp` operations on `Fin` tuple | This PR adds more analogues of operations on `Fin` tuples to the `Finsupp` setting. Before, there were only `Finsupp.cons` and `Finsupp.tail`. Now there are also `Finsupp.snoc`, `Finsupp.insertNth`, `Finsupp.init`, and `Finsupp.removeNth`. These all come with supporting lemmas. I also removed the porting comment about `succAboveCases` in `Data/Fin/Basic`, and added a lemma about `succAbove` in `Data/Fin/Tuple/Basic`. --- - [x] depends on: #20361 - [x] depends on: #20771 - [x] depends on: #20770 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 193/16 | Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Data/Finsupp/Fin.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,scripts/nolints_prime_decls.txt | 6 | 44 | ['YaelDillies', 'github-actions', 'j-loreaux', 'kbuzzard', 'mathlib4-dependent-issues-bot', 'quangvdao'] | nobody | 11 months ago | 437 days ago | 43 days |
| 24155 | eric-wieser | feat: add a "rw_proc" for fin vectors | This seems a little nicer than an elaborator, since it means I can use the default elaboration rules to handle my first few variables. Ideally there would be something like ```lean rw_procQ {A : Type u} {B : A -> Type v} (a : A) (b : B a) : b = ?rhs => do /-- Context: u v : Level A : Q(Type u) B : Q($A -> Type v) a : Q($A) b : Q($B $a) rhs : Q($B $a) -- metavariable to assign |- MetaM Q($b = ?rhs) -/ ``` or ```lean rw_proc {A : Type u} {B : A -> Type v} (a : A) (b : B a) : b = ?rhs => do /-- Context: u v : Level A B a b : Expr rhs : MVarId |- MetaM Expr -/ ``` which would generate the code I wrote here --- [](https://gitpod.io/from-referrer/) | awaiting-author RFC t-data t-meta | 27/2 | Mathlib/Data/Fin/Tuple/Reflection.lean | 1 | 2 | ['github-actions', 'urkud'] | nobody | 11 months ago | 357 days ago | 20 days |
| 21276 | GabinKolly | feat(ModelTheory/Substructures): define equivalences between equal substructures | Define first-order equivalences between equal substructures, and prove related properties. --- This is some preparatory work for #18876 [](https://gitpod.io/from-referrer/) | awaiting-author t-logic | 62/0 | Mathlib/ModelTheory/Substructures.lean | 1 | 19 | ['GabinKolly', 'YaelDillies', 'fpvandoorn', 'github-actions', 'grunweg'] | nobody | 11 months ago | 357 days ago | 46 days |
| 24008 | meithecatte | chore(EpsilonNFA): replace manual lemmas with @[simps] | --- [](https://gitpod.io/from-referrer/) | t-computability awaiting-author new-contributor | 2/24 | Mathlib/Computability/EpsilonNFA.lean | 1 | 2 | ['YaelDillies', 'github-actions', 'urkud'] | nobody | 11 months ago | 355 days ago | 27 days |
| 24642 | grunweg | WIP-feat: add layercake formula for ENNReal-valued functions | Not much to see here yet; some significant amount of work remains. --- - [ ] depends on: #24643 - [ ] depends on: #24640 (based on that PR for simplicity) [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson t-analysis | 189/24 | Mathlib/Analysis/SpecialFunctions/Pow/Integral.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Integral/Layercake.lean | 4 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 11 months ago | unknown | 0 seconds |
| 21712 | grunweg | chore: generalise more lemmas to `ContinuousENorm` | --- - [x] depends on: #21781 (minor drive-by clean-up) - [x] depends on: #21670 - [x] depends on: #22708 (extracted from this) - some parts depend on #21433 (or better: #22175); when the dependent PR has landed, I will re-assess whether to split these into a separate PR [](https://gitpod.io/from-referrer/) | merge-conflict carleson awaiting-CI t-measure-probability | 76/31 | Mathlib/Analysis/Normed/MulAction.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousFunctions.lean | 4 | 5 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 11 months ago | unknown | 0 seconds |
| 21375 | grunweg | WIP: generalise lemmas to ENorm | This work is part of (and a necessary pre-requisite for) the Carleson project. --- [](https://gitpod.io/from-referrer/) | WIP awaiting-CI t-measure-probability carleson merge-conflict | 471/221 | Mathlib/Analysis/NormedSpace/IndicatorFunction.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/ChebyshevMarkov.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Trim.lean,Mathlib/MeasureTheory/Function/LpSpace.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/Probability/Independence/Integrable.lean | 13 | 2 | ['fpvandoorn', 'grunweg'] | nobody | 11 months ago | unknown | 0 seconds |
| 24618 | b-mehta | feat(Analysis): add Schur inequality and variants | Add Schur inequality and some of its common variants. TODO: - [x] add reference to source: https://www.cip.ifi.lmu.de/~grinberg/VornicuS.pdf - [ ] add other generalisations - [ ] move some of the lemmas elsewhere --- [](https://gitpod.io/from-referrer/) | WIP t-analysis | 145/0 | Mathlib/Analysis/Convex/Schur.lean | 1 | 16 | ['b-mehta', 'eric-wieser', 'github-actions'] | nobody | 11 months ago | 361 days ago | 2 seconds |
| 15115 | kkytola | feat: Generalize assumptions in liminf and limsup results in ENNReals | In a [review comment](https://github.com/leanprover-community/mathlib4/pull/13938#discussion_r1649744441) it was pointed out that results about liminf and limsup in ENNReal hold under milder assumptions. This PR does the generalization. --- This PR is split off from #13938, where the review comment was made. The changes needed for the suggested generalization were of different kind than the simple PR's content, justifying a separate PR. - [x] depends on: #13938 [](https://gitpod.io/from-referrer/) | t-order merge-conflict help-wanted awaiting-author t-topology | 215/27 | Mathlib/MeasureTheory/Measure/Portmanteau.lean,Mathlib/Order/LiminfLimsup.lean,Mathlib/Topology/Instances/ENNReal.lean | 3 | 8 | ['Ruben-VandeVelde', 'github-actions', 'grunweg', 'j-loreaux', 'kkytola', 'leanprover-community-mathlib4-bot'] | nobody | 11 months ago | 597 days ago | 21 days |
| 23349 | BGuillemet | feat: add LocallyLipschitzOn.lipschitzOnWith_of_isCompact and two small lemmas about Lipschitz functions | Main feat (in Mathlib/Topology/EMetricSpace/Basic.lean): if a function `f` from an extended pseudometric space to a pseudometric space is locally Lipschitz on a compact subset `s`, then `f` is Lipschitz on `s`. The theorem is true only when the codomain of `f` is a pseudometric space, so it needs imports from Mathlib/Topology/MetricSpace. Other small feat (in Mathlib/Analysis/Calculus/ContDiff/RCLike.lean): a function that is continuously differentiable on an open subset is locally Lipschitz on this subset. --- - [ ] depends on: #22890 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology large-import new-contributor | 59/4 | Mathlib/Analysis/Calculus/ContDiff/RCLike.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean | 2 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | PatrickMassot | 11 months ago | 339 days ago | 35 days |
| 12438 | jjaassoonn | feat: some APIs for flat modules | Need horseshoe lemma --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 1674/3 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Exact.lean,Mathlib/CategoryTheory/Abelian/Basic.lean,Mathlib/CategoryTheory/Abelian/DiagramLemmas/Horseshoe.lean,Mathlib/CategoryTheory/Abelian/LeftDerived.lean,Mathlib/RingTheory/Flat/Basic.lean | 8 | 21 | ['erdOne', 'github-actions', 'jjaassoonn', 'joelriou'] | nobody | 11 months ago | 735 days ago | 20 seconds |
| 25473 | adomani | feat(CI): check that Mathlib files have lean or md extension | Twice recently there have been files with an "intended" `.lean` extension in `Mathlib/`: * #24942, ending in `;lean`; * #25457, ending in `.Lean`. `mk_all` does not add these files to `Mathlib.lean`, since they do not end in `.lean` and this later causes problems. This CI step checks that all files in `Mathlib/` end with `.lean` or `.md`. See #25474 for a test where the new step [correctly fails](https://github.com/leanprover-community/mathlib4/actions/runs/15464097783/job/43532018379?pr=25474). --- [](https://gitpod.io/from-referrer/) | CI delegated | 10/0 | .github/workflows/lint_and_suggest_pr.yml | 1 | 10 | ['adomani', 'bryangingechen', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 10 months ago | 330 days ago | 2 hours |
| 16020 | adomani | feat: compare PR `olean`s size with `master` | Adds two CI steps: * `print the sizes of the oleans` that prints the sizes of all the folders containing `Mathlib` `.olean`s; * `compare oleans` that compares the sizes of the previous step with the corresponding sizes on `master`. In the test runs, the two steps have taken at most 3 seconds combined (the first is virtually instantaneous, the second one depends on `curl` to find a job id and on `gh` to retrieve the logs of a previous CI run -- everything else appears to be negligible). This hopefully helps finding out if some PR is bloating up the `.olean`s. See [this Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Error.3A.20No.20space.20left.20on.20device/near/463792355) for a PR of mine that prompted this check. --- [](https://gitpod.io/from-referrer/) | merge-conflict CI | 120/0 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,scripts/olean_comparison.sh | 5 | 50 | ['Vtec234', 'YaelDillies', 'adomani', 'bryangingechen', 'github-actions', 'grunweg', 'kim-em', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 10 months ago | 527 days ago | 87 days |
| 16062 | adomani | Test/ci olean size | Tests for oleans --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author CI | 114/0 | .github/build.in.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,scripts/olean_comparison.sh | 5 | 4 | ['Parcly-Taxel', 'adomani', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 617 days ago | 16 seconds |
| 12799 | jstoobysmith | feat(LinearAlgebra/UnitaryGroup): Add properties of Special Unitary Group | Add properties of the special unitary group, mirroring the properties of found in Algebra/Star/Unitary.lean. In particular, I add an instance of `specialUnitaryGroup` as a `Group`, `Star`, `InvolutiveStar`, and `StarMul`. --- [](https://gitpod.io/from-referrer/) | please-adopt t-algebra new-contributor merge-conflict awaiting-author | 78/0 | Mathlib/LinearAlgebra/UnitaryGroup.lean | 1 | 8 | ['chrisflav', 'jcommelin', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 712 days ago | 9 days |
| 23709 | plp127 | feat: `Nat.findFrom` | This PR adds `Nat.findFrom`, which is like `Nat.find`, but starting from an arbitrary `k` instead of `0`. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 190/47 | Mathlib/Data/Nat/Find.lean | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 390 days ago | 2 hours |
| 25340 | dupuisf | chore(Analysis/Convex): move files pertaining to convex/concave functions to their own folder | This PR creates a new folder under `Analysis/Convex` called `Analysis/Convex/Function`, which includes files that are mostly or entirely about convex/concave functions (as opposed to convex sets). --- [](https://gitpod.io/from-referrer/) | merge-conflict t-convex-geometry | 4264/4155 | Mathlib.lean,Mathlib/Analysis/Convex/Continuous.lean,Mathlib/Analysis/Convex/Deriv.lean,Mathlib/Analysis/Convex/Exposed.lean,Mathlib/Analysis/Convex/Extrema.lean,Mathlib/Analysis/Convex/Function.lean,Mathlib/Analysis/Convex/Function/Basic.lean,Mathlib/Analysis/Convex/Function/Continuous.lean,Mathlib/Analysis/Convex/Function/Deriv.lean,Mathlib/Analysis/Convex/Function/Extrema.lean,Mathlib/Analysis/Convex/Function/Integral.lean,Mathlib/Analysis/Convex/Function/Jensen.lean,Mathlib/Analysis/Convex/Function/Mul.lean,Mathlib/Analysis/Convex/Function/Piecewise.lean,Mathlib/Analysis/Convex/Function/Quasiconvex.lean,Mathlib/Analysis/Convex/Function/Slope.lean,Mathlib/Analysis/Convex/Function/Strong.lean,Mathlib/Analysis/Convex/Integral.lean,Mathlib/Analysis/Convex/Jensen.lean,Mathlib/Analysis/Convex/Mul.lean,Mathlib/Analysis/Convex/Piecewise.lean,Mathlib/Analysis/Convex/Quasiconvex.lean,Mathlib/Analysis/Convex/Slope.lean,Mathlib/Analysis/Convex/SpecificFunctions/Basic.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convex/Strong.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/MeanInequalitiesPow.lean,Mathlib/Analysis/Normed/Module/Convex.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Analysis/SpecialFunctions/Log/NegMulLog.lean,Mathlib/Analysis/SpecialFunctions/Pochhammer.lean,Mathlib/MeasureTheory/Measure/Decomposition/IntegralRNDeriv.lean,Mathlib/NumberTheory/Harmonic/GammaDeriv.lean | 34 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 328 days ago | 6 days |
| 21734 | adomani | fix(PR summary): checkout GITHUB_SHA | This should make the version of the script that is used on PRs more stable. Suggested by Eric Wieser on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/messageFile.2Emd/near/498941855). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author CI | 2/1 | .github/workflows/PR_summary.yml | 1 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 10 months ago | 443 days ago | 1 hour |
| 20334 | miguelmarco | feat: allow polyrith to use a local Singular/Sage install | Try to call a local install of Singular (either standalone or inside Sage) to find the witness for polyrith before trying to call the online sage cell server. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-meta | 171/48 | Mathlib/Tactic/Polyrith.lean,scripts/polyrith_sage.py | 2 | 16 | ['eric-wieser', 'github-actions', 'hanwenzhu', 'kim-em', 'miguelmarco', 'mkoeppe'] | nobody | 10 months ago | 460 days ago | 27 days |
| 23953 | b-reinke | feat(Data/Matroid/Tutte): define the Tutte polynomial of a matroid | This PR defines the Tutte polynomial of a matroid and shows basic properties. - [x] depends on: #23926 - [ ] depends on #24336 - [ ] depends on: #23951 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-data | 111/0 | Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Data/Matroid/Tutte/Basic.lean,Mathlib/Data/Set/Image.lean | 3 | 7 | ['apnelson1', 'b-reinke', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 18771 | joelriou | feat(LinearAlgebra/ExteriorPower): exterior powers of free modules are free | Co-authored-by: sophie.morel@ens-lyon.fr --- - [ ] depends on: #18662 - [x] depends on: #18534 - [x] depends on: #18651 - [x] depends on: #18590 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 1185/160 | Mathlib.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basis.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/ExteriorPower/Pairing.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorAlgebra/ToTensorPower.lean,Mathlib/LinearAlgebra/TensorPower/Basic.lean,Mathlib/LinearAlgebra/TensorPower/Pairing.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 19 | 3 | ['alreadydone', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 18441 | ADedecker | refactor(AdicTopology): use new API for algebraic filter bases, and factor some code | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 847/159 | Mathlib.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 3 | ['ADedecker', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 11 minutes |
| 18439 | ADedecker | refactor: use new algebraic filter bases API in `FiniteAdeleRing` | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 699/21 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 10 minutes |
| 18438 | ADedecker | refactor: adapt `KrullTopology` to the new algebraic filter bases API | --- - [x] depends on: #18437 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology t-algebra | 771/168 | Mathlib.lean,Mathlib/FieldTheory/KrullTopology.lean,Mathlib/Topology/Algebra/FilterBasis.lean,Mathlib/Topology/Algebra/FilterBasisNew.lean,Mathlib/Topology/Algebra/Nonarchimedean/Bases.lean,Mathlib/Topology/Algebra/Nonarchimedean/BasesNew.lean | 6 | 5 | ['ADedecker', 'AntoineChambert-Loir', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | 548 days ago | 10 minutes |
| 13964 | pechersky | feat(Data/DigitExpansion): begin defining variant of reals without rationals | Based on a de Bruijn 1976 paper. This file is just the basic definition of a digit expansion. Will be followed up with further constructions. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 518/0 | Mathlib.lean,Mathlib/Data/DigitExpansion/Defs.lean,docs/references.bib | 3 | 11 | ['eric-wieser', 'github-actions', 'kim-em', 'pechersky'] | dupuisf | 10 months ago | 551 days ago | 129 days |
| 18662 | joelriou | feat(LinearAlgebra/ExteriorPower): generators of the exterior powers | --- - [x] depends on: #18534 - [x] depends on: #18590 - [ ] depends on: #26464 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 818/158 | Mathlib.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 15 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 18735 | joelriou | feat(Algebra/Module): presentation of the exterior power | Given a presentation of a `R`-module `M`, we obtain a presentation of `⋀[R]^n M`. --- (Still one sorry left.) - [ ] depends on: #18527 - [ ] depends on: #18432 - [ ] depends on: #26464 - [ ] depends on: #18534 - [ ] depends on: #18662 - [x] depends on: #18590 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra blocked-by-other-PR | 1856/157 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/Module/Presentation/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/PiTensor.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 20 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 10 months ago | unknown | 0 seconds |
| 17458 | urkud | refactor(Algebra/Group): make `IsUnit` a typeclass | Also change some lemmas to assume `[IsUnit _]` instead of `[Invertible _]`. Motivated by potential non-defeq diamonds in #14986, see also [Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Invertible.20and.20data) I no longer plan to merge this PR, but I'm going to cherry-pick some changes to a new PR before closing this one. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-zulip | 82/72 | Mathlib/Algebra/CharP/Invertible.lean,Mathlib/Algebra/Group/Invertible/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Invertible.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Units.lean,Mathlib/Algebra/Polynomial/Splits.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Analysis/Normed/Affine/Isometry.lean,Mathlib/Analysis/Normed/Ring/Units.lean,Mathlib/CategoryTheory/Linear/Basic.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Separable.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/GroupTheory/Submonoid/Inverses.lean,Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean,Mathlib/LinearAlgebra/AffineSpace/Combination.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Contraction.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Inversion.lean,Mathlib/LinearAlgebra/CliffordAlgebra/SpinGroup.lean,Mathlib/LinearAlgebra/Eigenspace/Minpoly.lean,Mathlib/NumberTheory/MulChar/Basic.lean,Mathlib/RingTheory/Localization/NumDen.lean,Mathlib/RingTheory/Polynomial/Content.lean,Mathlib/RingTheory/Polynomial/GaussLemma.lean,Mathlib/RingTheory/Valuation/Basic.lean | 26 | 12 | ['MichaelStollBayreuth', 'acmepjz', 'eric-wieser', 'github-actions', 'leanprover-bot', 'leanprover-community-bot-assistant', 'urkud'] | nobody | 9 months ago | 572 days ago | 18 hours |
| 22928 | javra | feat(CategoryTheory): infrastructure for inclusion morphisms into products in categories with 0-morphisms | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 52/14 | Mathlib/CategoryTheory/Limits/Shapes/BinaryBiproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/Biproducts.lean,Mathlib/CategoryTheory/Limits/Shapes/ZeroMorphisms.lean | 3 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 413 days ago | 21 minutes |
| 24710 | chrisflav | chore(Data/Set): `tsum` version of `Set.encard_iUnion_of_finite` for non-finite types | As requested here: https://github.com/leanprover-community/mathlib4/pull/23849#discussion_r2081070200 --- - [ ] depends on: #23849 [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 163/0 | Mathlib.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Data/Set/Card/Arithmetic.lean,Mathlib/Data/Set/Card/InfiniteArithmetic.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/Instances/ENat/Lemmas.lean | 7 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 300 days ago | 1 day |
| 24823 | eric-wieser | refactor: add `hom` lemmas for the `MonoidalCategory` structure on `ModuleCat` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 148/164 | Mathlib/Algebra/Category/FGModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Closed.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/Symmetric.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Free.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Generator.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Monoidal.lean,Mathlib/CategoryTheory/Monoidal/Internal/Module.lean,Mathlib/RepresentationTheory/Coinvariants.lean,Mathlib/RepresentationTheory/Rep.lean | 11 | 21 | ['101damnations', 'YaelDillies', 'eric-wieser', 'github-actions', 'joelriou', 'kbuzzard', 'leanprover-community-bot-assistant'] | 101damnations | 9 months ago | 300 days ago | 40 days |
| 25071 | erdOne | feat(EllipticCurve): basic API for singular cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry | 320/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 3 | 35 | ['Multramate', 'acmepjz', 'erdOne', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 300 days ago | 45 days |
| 25218 | kckennylau | feat(AlgebraicGeometry): Tate normal form of elliptic curves | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry awaiting-zulip new-contributor | 291/26 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/IsomOfJ.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Modular/TateNormalForm.lean,Mathlib/AlgebraicGeometry/EllipticCurve/NormalForms.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean | 5 | 31 | ['MichaelStollBayreuth', 'Multramate', 'acmepjz', 'github-actions', 'grunweg', 'kckennylau', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 333 days ago | 6 days |
| 25561 | callesonne | feat(Category/Grpd): define the bicategory of groupoids | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 179/25 | Mathlib.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/InducedMaps.lean,Mathlib/CategoryTheory/Bicategory/Functor/Pseudofunctor.lean,Mathlib/CategoryTheory/Bicategory/Functor/Strict.lean,Mathlib/CategoryTheory/Category/Cat.lean,Mathlib/CategoryTheory/Category/Grpd.lean | 6 | 6 | ['callesonne', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'robin-carlier'] | nobody | 9 months ago | 317 days ago | 10 days |
| 20784 | eric-wieser | fix: prevent `exact?` recursing forever on `n = 55` | Test case thanks to @llllvvuu: ```lean import Mathlib.SetTheory.Ordinal.Basic theorem natCast_inj {m n : ℕ} : (m : Ordinal) = n ↔ m = n := sorry example (n : Nat) : n = 55 := by exact? ``` This is surely a workaround for some unreported lean bug. The bug still exists for `n = 71` or higher, so we can still track down the bug after merging this patch. --- [](https://gitpod.io/from-referrer/) | t-set-theory | 22/3 | Mathlib/SetTheory/Ordinal/Basic.lean,MathlibTest/LibrarySearchRecDepth.lean | 2 | 15 | ['Command-Master', 'eric-wieser', 'github-actions', 'kbuzzard', 'kim-em', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 9 months ago | 300 days ago | 32 days |
| 26647 | b-mehta | feat(Data/Sym/Sym2): lift commutative operations to sym2 | While we have `Sym2.lift`, it's often useful to lift operations which are known to be commutative to the typeclass system. Indeed, the existing `Sym2.mul` witnesses this already. Thus, this PR can also be seen as generalising `Sym2.mul`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-data | 48/28 | Mathlib/Data/Sym/Sym2.lean,Mathlib/Data/Sym/Sym2/Finsupp.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/QuadraticForm/Basis.lean | 4 | 12 | ['b-mehta', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 298 days ago | 3 days |
| 25611 | erdOne | chore(RingTheory): add `Algebra (FractionRing R) (FractionRing S)` | Co-authored-by: Yakov Pechersky --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 152/108 | Mathlib.lean,Mathlib/Algebra/Algebra/NonZeroDivisors.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/DedekindDomain/Different.lean,Mathlib/RingTheory/DedekindDomain/IntegralClosure.lean,Mathlib/RingTheory/Ideal/Norm/RelNorm.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Localization/FractionRing.lean,Mathlib/RingTheory/Localization/FractionRingAlgebra.lean,Mathlib/RingTheory/Localization/Integral.lean | 10 | 20 | ['alreadydone', 'erdOne', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'pechersky'] | nobody | 9 months ago | 323 days ago | 3 days |
| 18230 | digama0 | feat(Tactic/ScopedNS): extend `scoped[NS]` to more commands | refactor `ScopedNS` to remove error prone repetitiveness and extend it to other commands such as `syntax`, `macro`, `elab`, etc.
Co-authored-by: Jon Eugster |
awaiting-author t-meta | 201/26 | Mathlib/Tactic/ScopedNS.lean,MathlibTest/scopedNS.lean | 2 | 7 | ['adomani', 'digama0', 'eric-wieser', 'github-actions', 'joneugster', 'kbuzzard'] | nobody | 9 months ago | 431 days ago | 31 days |
| 25284 | alreadydone | feat(LinearAlgebra/Contraction): bijectivity of `dualTensorHom` + generalize to CommSemiring | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 167/32 | Mathlib/Data/Finsupp/Defs.lean,Mathlib/LinearAlgebra/Contraction.lean,Mathlib/LinearAlgebra/Pi.lean,Mathlib/LinearAlgebra/Trace.lean,Mathlib/RingTheory/Finiteness/Finsupp.lean | 5 | 16 | ['alreadydone', 'eric-wieser', 'github-actions', 'kckennylau', 'leanprover-bot', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 289 days ago | 45 days |
| 22749 | joelriou | feat(CategoryTheory/Abelian): the Gabriel-Popescu theorem as a localization with respect to a Serre class | This PR introduces a structure `GabrielPopescuPackage C` which contains the information to say that the abelian category `C` is a localization of a category of modules with respect to a suitable Serre class. --- - [x] depends on: #26033 - [ ] depends on: #26663 - [x] depends on: #22733 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 202/6 | Mathlib.lean,Mathlib/CategoryTheory/Abelian/GrothendieckCategory/ModuleEmbedding/GabrielPopescu.lean,Mathlib/CategoryTheory/Abelian/SerreClass/Bousfield.lean,Mathlib/CategoryTheory/Abelian/SerreClass/MorphismProperty.lean,Mathlib/CategoryTheory/ObjectProperty/ContainsZero.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 302 days ago | 2 hours |
| 24668 | robertmaxton42 | feat(LinearAlgebra): add inductive principle for the free product of algebras | * Add `FreeProduct.inductionOn` and `.asPowers.inductionOn`. - [ ] depends on: #24532 --- * `simp↓` on `empty_rel'_bot`: the LHS is indeed not in simp-normal form, but `simp` can't solve the full lemma (if only because `Function.onFun` isn't marked `@[simp]`) and the actual simp-normal form of `rel'` isn't terribly useful for humans. Since I do expect users to type `rel' R A` by hand, I claim this use of `simp↓` is justified. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 205/9 | Mathlib/LinearAlgebra/FreeProduct/Basic.lean | 1 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 9 months ago | 358 days ago | 5 minutes |
| 13973 | digama0 | feat: lake exe refactor, initial framework | This is the initial framework code for `lake exe refactor`. To use it, you add your refactoring to `Refactor/Main.lean` (note, you have to actually write some metaprogramming code here for the refactoring itself), and the harness will run it on specified files and apply the generated edits. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 139/0 | Refactor/Main.lean,lakefile.lean | 2 | 11 | ['adomani', 'digama0', 'eric-wieser', 'github-actions', 'joneugster', 'leanprover-community-bot-assistant', 'mattrobball'] | nobody | 9 months ago | 625 days ago | 6 days |
| 10190 | jstoobysmith | feat(AlgebraicTopology): add Augmented Simplex Category | - Added the definition of the category FinLinOrd of finite linear ordered sets. - Added the definition of the augmented simplex category `AugmentedSimplexCategory`, and showed it is the Skeleton of FinLinOrd. - Showed that the category of augmented simplicial objects defined as a comma category is equivalent to the category of functors from `AugmentedSimplexCategory^\op` --- [](https://gitpod.io/from-referrer/) | t-algebraic-topology WIP t-category-theory new-contributor merge-conflict | 720/0 | Mathlib.lean,Mathlib/AlgebraicTopology/AugmentedSimplexCategory.lean,Mathlib/AlgebraicTopology/SimplicialObject.lean,Mathlib/Order/Category/FinLinOrd.lean | 4 | 5 | ['TwoFX', 'YaelDillies', 'joelriou', 'jstoobysmith'] | nobody | 9 months ago | 811 days ago | 7 days |
| 25914 | eric-wieser | feat: add an ext lemma for the opposite category | This powers up `aesop_cat`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory awaiting-CI | 18/56 | Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/CategoryTheory/Abelian/Opposite.lean,Mathlib/CategoryTheory/Category/RelCat.lean,Mathlib/CategoryTheory/GuitartExact/Opposite.lean,Mathlib/CategoryTheory/Limits/Opposites.lean,Mathlib/CategoryTheory/Limits/Shapes/Products.lean,Mathlib/CategoryTheory/Opposites.lean,Mathlib/CategoryTheory/Triangulated/Opposite/Functor.lean,Mathlib/Combinatorics/Quiver/Basic.lean | 9 | 7 | ['eric-wieser', 'github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'robin-carlier'] | nobody | 9 months ago | 320 days ago | 20 minutes |
| 20208 | js2357 | feat: Define the localization of a fractional ideal at a prime ideal | Define the localization of a fractional ideal at a prime ideal, and prove some basic properties. --- Alternate version of #14237 generalized to use `IsLocalization` and `IsFractionRing` rather than `Localization.AtPrime` and `FractionRing` [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 248/0 | Mathlib.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean | 2 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 9 months ago | 493 days ago | 21 seconds |
| 24260 | plp127 | feat(Topology): add API for Hereditarily Lindelof spaces | Copies the stuff about Lindelof spaces to Hereditarily Lindelof spaces. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 222/42 | Mathlib/Topology/Compactness/Lindelof.lean | 1 | 15 | ['github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'urkud'] | urkud | 9 months ago | 345 days ago | 29 days |
| 25238 | Hagb | feat(Tactic/ComputeDegree): add support for scalar multiplication with different types | It would be able to deal with `a • (X : R[X])` where `a : S` is in a different type `S` with `[SMulZeroClass S R]`. --- - [x] depends on: #25237 [](https://gitpod.io/from-referrer/) | merge-conflict t-meta new-contributor | 17/5 | Mathlib/Tactic/ComputeDegree.lean,MathlibTest/ComputeDegree.lean | 2 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 300 days ago | 38 days |
| 22909 | AntoineChambert-Loir | feat(RingTheory/Pure): pure submodules | A submodule `N` of an `R`-module is *pure* if all maps `S ⊗[R] N → S ⊗[R] M` deduced by base change from the injection of `N` into `M` are injective, for all `R`-algebras `S`. This is expressed by the class `Submodule.IsPure`. For type theoretic reason, the definition of `Submodule.IsPure` only considers algebras `S` in the same universe as `R`, but `Submodule.IsPure.baseChange_injective` establishes the property for all universes. * `Submodule.IsComplemented.isPure` : a complemented submodule is pure. Co-authored with @mariainesdff --- - [ ] depends on: #22898 - [ ] depends on: #22908 - [x] depends on: #22911 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory blocked-by-other-PR | 592/3 | Mathlib.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/RingTheory/Adjoin/FG.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Finiteness/Cardinality.lean,Mathlib/RingTheory/Finiteness/Small.lean,Mathlib/RingTheory/Pure.lean,Mathlib/RingTheory/Spectrum/Prime/RingHom.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/FG.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/Small.lean | 11 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 413 days ago | 17 minutes |
| 22908 | AntoineChambert-Loir | feat(RingTheory/Finiteness/Small): tensor product of the system of small submodules | The directed limit of a tensor product for the directed system of small submodules. Co-authored with @mariainesdff --- - [ ] depends on: #22898 - [x] depends on: #22911 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory blocked-by-other-PR | 624/2 | Mathlib.lean,Mathlib/RingTheory/Adjoin/FG.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Finiteness/Cardinality.lean,Mathlib/RingTheory/Finiteness/Small.lean,Mathlib/RingTheory/Spectrum/Prime/RingHom.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/FG.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/Small.lean | 9 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 413 days ago | 59 minutes |
| 22898 | AntoineChambert-Loir | feat(RingTheory/TensorProduct/DirectLimit/FG): direct limit of finitely generated submodules and tensor product | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-ring-theory | 399/0 | Mathlib.lean,Mathlib/RingTheory/Adjoin/FG.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/DirectLimit/FG.lean | 5 | 9 | ['AntoineChambert-Loir', 'alreadydone', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 8 months ago | 403 days ago | 10 days |
| 20431 | erdOne | feat(RingTheory/AdicCompletion): monotonicity of adic-completeness | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 206/16 | Mathlib.lean,Mathlib/Algebra/Module/Submodule/Defs.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Mono.lean,Mathlib/RingTheory/Finiteness/Ideal.lean | 7 | 13 | ['chrisflav', 'erdOne', 'github-actions'] | nobody | 8 months ago | 445 days ago | 32 days |
| 19596 | Command-Master | feat(RingTheory/Valuation/PrimeMultiplicity): define `WithTop ℤ`-valued prime multiplicity on a fraction field | Moves: - `multiplicity_addValuation` -> `AddValuation.multiplicity` - `multiplicity_addValuation_apply` -> `AddValuation.multiplicity_apply` --- - [x] depends on: #19149 - [x] depends on: #18786 - [x] depends on: #19122 - [x] depends on: #18954 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory large-import | 101/37 | Mathlib/Data/ENat/Basic.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/Valuation/PrimeMultiplicity.lean | 3 | 11 | ['ChrisHughes24', 'Command-Master', 'Vierkantor', 'faenuccio', 'github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 474 days ago | 8 days |
| 18646 | jxjwan | feat(RingTheory): isotypic components | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory new-contributor | 308/0 | Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/RingTheory/Isotypic.lean,Mathlib/RingTheory/SimpleModule.lean | 3 | 1 | ['github-actions'] | nobody | 8 months ago | 542 days ago | 26 minutes |
| 17246 | pechersky | feat(RingTheory/PrimaryDecomposition): PIR of Noetherian under jacobson condition | --- - [x] depends on: #17634 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 653/1 | Mathlib.lean,Mathlib/NumberTheory/KummerDedekind.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Jacobson/Ideal.lean,Mathlib/RingTheory/PrimaryDecomposition.lean,docs/references.bib | 8 | 8 | ['erdOne', 'github-actions', 'mathlib4-dependent-issues-bot'] | erdOne | 8 months ago | 530 days ago | 13 days |
| 21474 | erdOne | feat(RingTheory): replace `Ring.DimensionLEOne` with `Ring.KrullDimLE` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory large-import | 285/170 | Mathlib.lean,Mathlib/RingTheory/DedekindDomain/Basic.lean,Mathlib/RingTheory/DedekindDomain/Dvr.lean,Mathlib/RingTheory/DedekindDomain/Ideal.lean,Mathlib/RingTheory/DiscreteValuationRing/TFAE.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/KrullDimension/Basic.lean,Mathlib/RingTheory/KrullDimension/Localization.lean,Mathlib/RingTheory/KrullDimension/Polynomial.lean,Mathlib/RingTheory/KrullDimension/Quotient.lean,Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean,Mathlib/RingTheory/Nilpotent/End.lean,Mathlib/RingTheory/Nilpotent/Lemmas.lean,Mathlib/RingTheory/PID/Quotient.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/Spectrum/Maximal/Localization.lean | 16 | 1 | ['github-actions'] | nobody | 8 months ago | 449 days ago | 5 hours |
| 11212 | shuxuezhuyi | feat(GroupTheory/GroupAction): instance `MulAction (β ⧸ H) α` | We instance this naturally from `MulAction β α` when `H` is a normal subgroup and acts trivially on `α`. We also instance `IsometricSMul (M ⧸ N) X` in this way. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-group-theory large-import | 53/1 | Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/Topology/MetricSpace/IsometricSMul.lean | 2 | 6 | ['YaelDillies', 'github-actions', 'grunweg', 'urkud'] | eric-wieser | 8 months ago | 482 days ago | 193 days |
| 17469 | joelriou | feat(Algebra/ModuleCat/Differentials/Presheaf): the presheaf of relative differentials | Given a functor `F : C ⥤ D`, presheaves of commutative rings `S`, `R` and a morphism `φ : S ⟶ F.op ⋙ R`, we show that derivations relative to `φ` are representable by a presheaf of `R`-modules. This is obtained by reducing to the case of absolute differentials. The construction shall allow to deduce the presheaf version of the cokernel sequence $$f^\star \Omega_{Y/S} ⟶ \Omega_{X/S} ⟶ \Omega_{X/Y} ⟶ 0$$ when `f : X ⟶ Y` and `g : Y ⟶ S` are morphisms of schemes. --- - [x] depends on: #17366 - [x] depends on: #19507 - [x] depends on: #17388 - [x] depends on: #16755 [](https://gitpod.io/from-referrer/) | WIP t-category-theory large-import merge-conflict t-algebraic-geometry | 391/10 | Mathlib/Algebra/Category/ModuleCat/Differentials/Presheaf.lean | 1 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 572 days ago | 8 minutes |
| 20671 | thefundamentaltheor3m | feat(Analysis/Asymptotics/SpecificAsymptotics): Proving that 𝛔ₖ(n) = O(nᵏ⁺¹) | This PR proves a result about the $\sigma_k(n)$ arithmetic function, namely, that it is $O\left(n^{k+1}\right)$. Main theorem: `theorem sigma_asymptotic (k : ℕ) : (fun n ↦ (σ k n : ℝ)) =O[atTop] (fun n ↦ (n ^ (k + 1) : ℝ))` This result was proved as part of the sphere packing project. --- [](https://gitpod.io/from-referrer/) | t-number-theory new-contributor large-import merge-conflict awaiting-author | 29/0 | Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean | 1 | 3 | ['b-mehta', 'github-actions', 'mathlib4-merge-conflict-bot'] | b-mehta | 8 months ago | 465 days ago | 9 days |
| 20267 | joelriou | feat(CategoryTheory): comma categories are accessible | --- (I shall probably not work on this PR in the near future.) - [ ] depends on: #19937 - [ ] depends on: #19945 - [ ] depends on: #19959 - [ ] depends on: #20005 - [ ] depends on: #19955 - [x] depends on: #20263 [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-category-theory | 1513/7 | Mathlib.lean,Mathlib/CategoryTheory/Comma/Arrow.lean,Mathlib/CategoryTheory/Comma/CardinalArrow.lean,Mathlib/CategoryTheory/EssentiallySmall.lean,Mathlib/CategoryTheory/Limits/Comma.lean,Mathlib/CategoryTheory/Limits/TypesFiltered.lean,Mathlib/CategoryTheory/Presentable/Basic.lean,Mathlib/CategoryTheory/Presentable/CardinalFilteredPresentation.lean,Mathlib/CategoryTheory/Presentable/Comma.lean,Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean,Mathlib/CategoryTheory/Presentable/Limits.lean,Mathlib/CategoryTheory/Presentable/LocallyPresentable.lean,Mathlib/CategoryTheory/Presentable/ParallelMaps.lean,Mathlib/SetTheory/Cardinal/HasCardinalLT.lean,docs/references.bib | 15 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | unknown | 0 seconds |
| 24862 | grunweg | feat(LocallyIntegrable): generalise more to enorms | --- Note: github's diff is very confused; it includes changes which very clearly are already on the master branch. I'll see which of the remaining changes after the dependencies have landed is already polished enough. - [x] depends on: #24352 - [x] depends on: #27457 (this half is settled already) - [ ] open question: filter lemmas; IsBoundedUnder is not the right condition as-is; need to think (or just not generalise) [](https://gitpod.io/from-referrer/) | merge-conflict WIP carleson t-measure-probability | 171/88 | Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean | 3 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 8 months ago | 352 days ago | 1 second |
| 27003 | eric-wieser | chore: use `Simp.ResultQ` more often | Also uses `~q` in place of manual `isDefEq` matching. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 18/22 | Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/NormNum/Result.lean,Mathlib/Tactic/ReduceModChar.lean | 3 | 7 | ['JovanGerb', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | JovanGerb | 8 months ago | 261 days ago | 32 days |
| 22925 | ggranberry | feat(Mathlib/PlaceHolder/ToeplitzHausdorff): Toeplitz-Hausdorff | --- [](https://gitpod.io/from-referrer/) | WIP new-contributor will-close-soon awaiting-author help-wanted t-analysis | 411/0 | Mathlib/PlaceHolder/ToeplitzHausdorff.lean,Mathlib/PlaceHolder/ToeplitzHausdorff_v2.lean | 2 | 11 | ['faenuccio', 'ggranberry', 'github-actions'] | faenuccio | 8 months ago | 409 days ago | 21 minutes |
| 25401 | digama0 | feat(Util): SuppressSorry option | See also leanprover/lean4#8611 and [#lean4 > Silent sorry @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/Silent.20sorry/near/503537964). This is a stop-gap solution while leanprover/lean4#8611 is underway, but it works about as well as any other built in option. Hooking declaration elaborators turns out to be a very powerful technique. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-meta | 342/0 | Mathlib.lean,Mathlib/Util/CommandElabHook.lean,Mathlib/Util/SuppressSorry.lean,MathlibTest/suppressSorry.lean | 4 | 15 | ['digama0', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | alexjbest | 8 months ago | 260 days ago | 71 days |
| 7873 | astrainfinita | perf: reorder `extends` and change instance priority in algebra hierarchy | There are no strict rules, but in general `Cancel` is dropped first, then `Comm`, then `Neg / Inv`, then `Assoc`. Not sure if there's a better way. --- - [ ] depends on: #14712 - [x] depends on: #16638 - [ ] depends on: #18464 - [ ] depends on: #18468 - [ ] depends on: #18470 - [ ] depends on: #18472 - [ ] depends on: #18474 [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra blocked-by-other-PR | 494/204 | Archive/Imo/Imo1998Q2.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Associated.lean,Mathlib/Algebra/BigOperators/Ring/List.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean,Mathlib/Algebra/DirectSum/Algebra.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/EuclideanDomain/Field.lean,Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/Field/IsField.lean,Mathlib/Algebra/GCDMonoid/Basic.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/InjSurj.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/GroupWithZero/InjSurj.lean,Mathlib/Algebra/GroupWithZero/Prod.lean,Mathlib/Algebra/GroupWithZero/Semiconj.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Homology/HomotopyCategory/DegreewiseSplit.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShiftSequence.lean,Mathlib/Algebra/Lie/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Grading.lean,Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Algebra/Order/Field/Canonical/Defs.lean,Mathlib/Algebra/Order/Field/Defs.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Roots.lean,Mathlib/Algebra/Quaternion.lean,Mathlib/Algebra/Ring/BooleanRing.lean,Mathlib/Algebra/Ring/Defs.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/InjSurj.lean,Mathlib/Algebra/Ring/Rat.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Fourier/FourierTransformDeriv.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Basic.lean,Mathlib/Analysis/NormedSpace/Star/Multiplier.lean,Mathlib/CategoryTheory/Preadditive/FunctorCategory.lean,Mathlib/CategoryTheory/Preadditive/SingleObj.lean,Mathlib/CategoryTheory/Triangulated/Functor.lean,Mathlib/Data/Finset/NoncommProd.lean,Mathlib/Data/Int/Cast/Defs.lean,Mathlib/Data/Nat/Cast/Defs.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Data/Rat/Denumerable.lean,Mathlib/Data/Real/ENatENNReal.lean,Mathlib/Dynamics/Ergodic/AddCircle.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/GroupTheory/Congruence/Basic.lean,Mathlib/GroupTheory/MonoidLocalization.lean,Mathlib/GroupTheory/SpecificGroups/Alternating.lean,Mathlib/GroupTheory/Torsion.lean,Mathlib/Init/ZeroOne.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/LinearAlgebra/Orientation.lean,Mathlib/LinearAlgebra/QuadraticForm/Basic.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/External.lean,Mathlib/MeasureTheory/Decomposition/Jordan.lean,Mathlib/MeasureTheory/Decomposition/SignedLebesgue.lean,Mathlib/NumberTheory/ArithmeticFunction.lean,Mathlib/NumberTheory/LegendreSymbol/GaussEisensteinLemmas.lean,Mathlib/NumberTheory/RamificationInertia.lean,Mathlib/NumberTheory/WellApproximable.lean,Mathlib/NumberTheory/Zsqrtd/QuadraticReciprocity.lean,Mathlib/Order/Filter/Germ.lean,Mathlib/Order/Interval/Finset/Box.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/Coalgebra/Hom.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/RingTheory/Henselian.lean,Mathlib/RingTheory/Ideal/IsPrincipal.lean,Mathlib/RingTheory/Ideal/LocalRing.lean,Mathlib/RingTheory/Ideal/Norm.lean,Mathlib/RingTheory/Localization/Integral.lean,Mathlib/RingTheory/MvPolynomial/Symmetric.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,Mathlib/RingTheory/UniqueFactorizationDomain.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/Tactic/Positivity/Core.lean | 104 | 84 | ['MichaelStollBayreuth', 'astrainfinita', 'github-actions', 'kim-em', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mattrobball'] | nobody | 8 months ago | 657 days ago | 7 days |
| 14583 | lecopivo | fix: make concrete cycle notation local | fix: make c[...] notation for concrete cycles local --- The notation for concrete cycles prevents you using `c[i]` notation for `c : Array _` This currently does not work ``` import Mathlib variable (c : Array Nat) (i : Fin c.size) #check c[i] -- breaks because of notation for concrete cycles ``` This PR just marks it as local to prevent this issue. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 1/1 | Mathlib/GroupTheory/Perm/Cycle/Concrete.lean | 1 | 3 | ['eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 660 days ago | 3 hours |
| 5897 | eric-wieser | feat: add a `MonadError` instance for `ContT` | We already have a `MonadExcept` instance; this promotes it to `MonadError`. Note the issue with the existing `MonadExcept` instance still applies. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta | 16/0 | Mathlib/Control/Monad/Cont.lean | 1 | 25 | ['Vierkantor', 'YaelDillies', 'eric-wieser', 'github-actions', 'kmill'] | nobody | 8 months ago | 682 days ago | 339 days |
| 24793 | tristan-f-r | feat: trace of unitarily similar matrices | adds a theorem relating trace to unitarily similar matrices used in the easy direction of specht's theorem --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 7/0 | Mathlib/LinearAlgebra/UnitaryGroup.lean | 1 | 4 | ['github-actions', 'j-loreaux', 'mathlib4-merge-conflict-bot', 'tristan-f-r'] | nobody | 8 months ago | 353 days ago | 1 day |
| 19582 | yu-yama | feat(GroupExtension/Abelian): define `OfMulDistribMulAction.equivH2` | Mainly defines: - `structure GroupExtension.OfMulDistribMulAction N G [MulDistribMulAction G N]`: group extensions of `G` by `N` where the multiplicative action of `G` on `N` is the conjugation - `structure GroupExtension.OfMulDistribMulActionWithSection N G [MulDistribMulAction G N]`: group extensions with specific choices of sections - `def GroupExtension.OfMulDistribMulAction.equivH2`: a bijection between the equivalence classes of group extensions and $H^2 (G, N)$ --- - [x] depends on: #20802 (split PR: contains changes to the `Defs` file) - [x] depends on: #20998 (split PR: mainly adds the `Basic` file) - [ ] depends on: #26670 (split PR: adds the first part of the `Abelian` file) Here is a relevant TODO in Mathlib: https://github.com/leanprover-community/mathlib4/blob/4e9fa40d7c480937e09cd6e47a591bd6f3b8be42/Mathlib/RepresentationTheory/GroupCohomology/LowDegree.lean#L46-L48 I would appreciate your comments. [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR new-contributor | 750/14 | Mathlib.lean,Mathlib/GroupTheory/GroupExtension/Abelian.lean,Mathlib/GroupTheory/GroupExtension/Defs.lean,docs/references.bib | 4 | 5 | ['YaelDillies', 'erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 8 months ago | 475 days ago | 43 days |
| 7300 | ah1112 | feat: synthetic geometry | This is adding synthetic geometry using Avigad's axioms and formalizing Euclid Book I, through the Pythagorean theorem. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted t-euclidean-geometry | 2661/0 | Mathlib.lean,Mathlib/Geometry/Synthetic/Avigad/Axioms.lean,Mathlib/Geometry/Synthetic/Avigad/EuclidBookI.lean,Mathlib/Geometry/Synthetic/Avigad/Tactics.lean | 4 | 74 | ['ah1112', 'alreadydone', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'plp127', 'tb65536', 'urkud'] | nobody | 8 months ago | 953 days ago | 1 minute |
| 24719 | madvorak | feat(LinearAlgebra/Matrix/NonsingularInverse): inverting `Matrix` inverts its `LinearEquiv` | --- Discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2324719.20cannot.20find.20home/with/517142655 | awaiting-author t-algebra | 10/0 | Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean | 1 | 16 | ['eric-wieser', 'github-actions', 'madvorak', 'ocfnash'] | nobody | 8 months ago | 270 days ago | 85 days |
| 25208 | erdOne | feat(LinearAlgebra): `tensor_induction` macro | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 87/116 | Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Central/TensorProduct.lean,Mathlib/LinearAlgebra/DirectSum/Finsupp.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/RingTheory/Flat/Equalizer.lean,Mathlib/RingTheory/TensorProduct/Basic.lean,Mathlib/RingTheory/TensorProduct/Finite.lean,Mathlib/RingTheory/Unramified/Finite.lean | 8 | 8 | ['chrisflav', 'eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 340 days ago | 10 minutes |
| 13036 | joelriou | feat(CategoryTheory/Sites): under certain conditions, cover preserving functors preserve 1-hypercovers | Previously, in order to show that a functor between Grothendieck sites was continuous, it was necessary to show that it was "cover preserving" and "compatible preserving". There were two lemmas which could be used in order to show that a functor was "compatible preserving". Since #13012, the better condition of "1-hypercover preserving" functor was introduced and it implies that the functor is continuous. In this PR, under the same assumptions as in the two lemmas mentionned above, we show that cover preserving functors are 1-hypercover preserving functors. This gives slightly better criteria in order to show that a functor is continuous. --- - [x] depends on: #13004 - [x] depends on: #13011 - [x] depends on: #13012 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 94/7 | Mathlib/CategoryTheory/Sites/Continuous.lean,Mathlib/CategoryTheory/Sites/CoverPreserving.lean,Mathlib/CategoryTheory/Sites/Over.lean,Mathlib/CategoryTheory/Sites/Sieves.lean | 4 | 3 | ['github-actions', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 712 days ago | 1 second |
| 27335 | eric-wieser | chore(Data/List): use simp-normal-form for boolean equalities | This replaces `¬(p x = true)` with `p x = false`. It also makes explicit some adjacent `h : p x` spellings for symmetry, but the `= true`s were already implied by the coercion. Zulip: [#lean4 > `h : ¬(b = true)` vs `h : b = false` @ 💬](https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/.60h.20.3A.20.C2.AC.28b.20.3D.20true.29.60.20vs.20.60h.20.3A.20b.20.3D.20false.60/near/529976237) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-data | 38/32 | Mathlib/Data/List/DropRight.lean,Mathlib/Data/List/SplitOn.lean,Mathlib/Data/List/TakeWhile.lean | 3 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 236 days ago | 6 hours |
| 22517 | j-loreaux | feat: `ℕ+` powers in semigroups | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP large-import | 275/28 | Mathlib.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/PNatPowAssoc.lean,Mathlib/Algebra/Group/PPow.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/ULift.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Data/Real/Basic.lean,Mathlib/Data/ZMod/Defs.lean,Mathlib/LinearAlgebra/LinearPMap.lean,Mathlib/NumberTheory/Dioph.lean,Mathlib/Tactic/ToAdditive/Frontend.lean | 14 | 6 | ['eric-wieser', 'github-actions', 'j-loreaux', 'leanprover-bot', 'mattrobball'] | nobody | 7 months ago | 423 days ago | 27 seconds |
| 25069 | erdOne | feat(EllipticCurve): rational points of singular nodal cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 251/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Node.lean | 3 | 14 | ['Multramate', 'acmepjz', 'chrisflav', 'erdOne', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | chrisflav | 7 months ago | 245 days ago | 100 days |
| 25070 | erdOne | feat(EllipticCurve): rational points on singular cuspidal cubics | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 123/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Singular/Cusp.lean | 2 | 12 | ['Multramate', 'acmepjz', 'adamtopaz', 'erdOne', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot'] | adamtopaz | 7 months ago | 255 days ago | 90 days |
| 28580 | kmill | refactor: simplify implementation of `filter_upwards` | This PR makes a few changes to `filter_upwards`: - it uses `focus`, which prevents multiGoalLinter from ever blaming the tactics used inside its implementation - it constructs the whole proof syntax and elaborates it at once using `evalTactic` and `refine`, rather than using the lower-level TermElab API, which can lose track of goals - it's written in a way that doesn't require goals to be in some particular order This was motivated by some multiGoalLinter issues I ran into when working on https://github.com/leanprover/lean4/pull/9942 --- [](https://gitpod.io/from-referrer/) | merge-conflict t-order t-meta | 14/16 | Mathlib/Order/Filter/Defs.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | 256 days ago | 25 minutes |
| 7125 | eric-wieser | feat: additive monoid structure via biproducts | I suspect I'm missing a trick with these transport lemmas. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory awaiting-CI | 237/0 | Mathlib/CategoryTheory/Limits/Skeleton.lean | 1 | 3 | ['alreadydone', 'eric-wieser', 'mathlib4-merge-conflict-bot'] | nobody | 7 months ago | unknown | 0 seconds |
| 21950 | erdOne | feat(NumberTheory/Padics): the completion of `ℚ` at a finite place is `ℚ_[p]` | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-number-theory | 253/1 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/WithZero.lean,Mathlib/NumberTheory/Padics/HeightOneSpectrum.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroMulInt.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean | 7 | 33 | ['Ruben-VandeVelde', 'erdOne', 'faenuccio', 'github-actions', 'leanprover-community-bot-assistant', 'pechersky', 'smmercuri', 'xroblot'] | nobody | 7 months ago | 298 days ago | 73 days |
| 23621 | astrainfinita | chore: deprecate `LinearOrderedComm{Monoid, Group}WithZero` | --- [](https://gitpod.io/from-referrer/) - [x] depends on: #20676 | merge-conflict t-algebra t-order | 261/205 | Archive/Imo/Imo1998Q2.lean,Counterexamples/LinearOrderWithPosMulPosEqZero.lean,Mathlib/Algebra/Order/Field/Canonical.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/GroupWithZero/Canonical.lean,Mathlib/Algebra/Order/GroupWithZero/Finset.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Nonneg/Field.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Ring/Nat.lean,Mathlib/Combinatorics/Additive/PluenneckeRuzsa.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Basic.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/NNRat/Lemmas.lean,Mathlib/Data/NNReal/Defs.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/GroupTheory/ArchimedeanDensely.lean,Mathlib/NumberTheory/EllipticDivisibilitySequence.lean,Mathlib/NumberTheory/FunctionField.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/RingTheory/Valuation/Archimedean.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/ExtendToLocalization.lean,Mathlib/RingTheory/Valuation/Integers.lean,Mathlib/RingTheory/Valuation/Integral.lean,Mathlib/RingTheory/Valuation/Minpoly.lean,Mathlib/RingTheory/Valuation/Quotient.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/RingTheory/Valuation/ValExtension.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean,Mathlib/Topology/Algebra/WithZeroTopology.lean,Mathlib/Topology/UnitInterval.lean,MathlibTest/instance_diamonds.lean,scripts/noshake.json | 44 | 24 | ['YaelDillies', 'astrainfinita', 'github-actions', 'grunweg', 'leanprover-bot', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | kbuzzard | 6 months ago | 379 days ago | 5 days |
| 16773 | arulandu | feat(Probability/Distributions): formalize Beta distribution | Formalize Beta distribution, using Gamma distribution as a reference. Added real-valued beta wrapper, in the manner of gamma. Thanks to @EtienneC30 for help with casting real <-> complex. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability | 286/1 | Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean,Mathlib/Probability/Distributions/Beta.lean | 3 | 50 | ['EtienneC30', 'arulandu', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] | arulandu | 6 months ago | 593 days ago | 1 day |
| 29855 | eric-wieser | chore(Data/Finset/Sort): lemmas about `0 : Fin _` and `Fin.last _` | We already had these for `⟨0, ⋯⟩` and `⟨k - 1, ⋯⟩`. Moves: - `Finset.orderEmbOfFin_zero` -> `Finset.orderEmbOfFin_mk_zero` - `Finset.orderEmbOfFin_last` -> `Finset.orderEmbOfFin_mk_last` --- [](https://gitpod.io/from-referrer/) | t-data t-order delegated easy | 17/7 | Mathlib/Combinatorics/Enumerative/Composition.lean,Mathlib/Data/Finset/Sort.lean | 2 | 4 | ['eric-wieser', 'github-actions', 'mathlib-bors', 'ocfnash'] | nobody | 6 months ago | 218 days ago | 3 days |
| 19616 | adamtopaz | fix: fix the definition of the absolute Galois group of a field | Previously it was defined as the Galois group of the algebraic closure, as opposed to the separable closure. Also, this adds some missing instances for this group. Still missing is compactness, but that seems like a bigger project. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-number-theory | 23/8 | Mathlib/FieldTheory/AbsoluteGaloisGroup.lean,Mathlib/FieldTheory/KrullTopology.lean | 2 | 4 | ['acmepjz', 'alreadydone', 'github-actions'] | nobody | 6 months ago | 514 days ago | 3 days |
| 25225 | xcloudyunx | feat(Combinatorics/SimpleGraph): Eulerian walk in connected graph contains all vertices | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-combinatorics new-contributor | 16/0 | Mathlib/Combinatorics/SimpleGraph/Trails.lean | 1 | 6 | ['IvanRenison', 'github-actions', 'vlad902'] | kmill | 6 months ago | 191 days ago | 148 days |
| 24532 | robertmaxton42 | feat(LinearAlgebra/FreeProduct): fill out the `FreeProduct.asPowers` namespace | * Replicate the existing API for `LinearAlgebra.FreeProduct` under `FreeProduct.asPowers`, for convenience when working primarily with the power algebra representation * Adds convenience lemmas for using the corresponding quotient relation `rel'` (used in the above). --- - [x] depends on: #24531 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 122/5 | Mathlib/LinearAlgebra/FreeProduct/Basic.lean | 1 | 26 | ['YaelDillies', 'adomani', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robertmaxton42'] | nobody | 6 months ago | 355 days ago | 13 hours |
| 25692 | Whysoserioushah | feat(RingTheory/MatrixAlgebra): add a more general version of `matrixEquivTensor` | This adds `tensorMatrixLinearEquiv : A ⊗[R] Matrix n n B ≃ₐ[S] Matrix n n (A ⊗[R] B)`
which is a more general version of `matrixEquivTensor : Matrix n n A ≃ₐ[R] (A ⊗[R] Matrix n n R)`.
The latter is then implemented as a trivial consequence of the former.
Many internal implementation details are deleted without deprecation, although strictly these were not private.
Co-authored-by: @erdOne |
merge-conflict awaiting-author t-ring-theory | 129/110 | Mathlib/RingTheory/MatrixAlgebra.lean | 1 | 28 | ['Whysoserioushah', 'chrisflav', 'eric-wieser', 'github-actions', 'jcommelin', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mattrobball'] | chrisflav | 5 months ago | 255 days ago | 47 days |
| 25012 | urkud | refactor(*): migrate from `Matrix.toLin'` to `Matrix.mulVecLin` | or `Matrix.mulVec` whenever we don't need the `LinearEquiv.symm` part. See [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Matrix.2EtoLin'.20vs.20Matrix.2EmulVecLin/with/515188548). It makes sense to have only one normal form, and `Matrix.toLin'` has an extra `DecidableEq` assumption. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 165/126 | Mathlib/Algebra/Lie/Matrix.lean,Mathlib/Algebra/Module/Equiv/Basic.lean,Mathlib/Analysis/CStarAlgebra/Matrix.lean,Mathlib/Analysis/Matrix.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/LinearAlgebra/Basis/Defs.lean,Mathlib/LinearAlgebra/Determinant.lean,Mathlib/LinearAlgebra/Finsupp/VectorSpace.lean,Mathlib/LinearAlgebra/Matrix/BilinearForm.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/Minpoly.lean,Mathlib/LinearAlgebra/Matrix/Diagonal.lean,Mathlib/LinearAlgebra/Matrix/Gershgorin.lean,Mathlib/LinearAlgebra/Matrix/Rank.lean,Mathlib/LinearAlgebra/Matrix/SesquilinearForm.lean,Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean,Mathlib/LinearAlgebra/Matrix/ToLin.lean,Mathlib/LinearAlgebra/Matrix/ToLinearEquiv.lean,Mathlib/LinearAlgebra/UnitaryGroup.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean | 19 | 4 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 225 days ago | 15 days |
| 14752 | AntoineChambert-Loir | fix(Topology/Algebra/Valued): repair definition of Valued | Following a [discussion on Zulip](https://leanprover.zulipchat.com/#narrow/stream/116395-maths/topic/Question.20about.20.60Valued.2Eis_topological_valuation.60), we modify the definition of the field `is_topological_valuation` of `Valued` insisting that the element $\gamma$ showing up there is in the subgroup generated by the image of the valuation map. Co-authored-by: @faenuccio - [x] depends on: #25496 | merge-conflict WIP t-topology t-algebra | 1166/301 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/NumberTheory/NumberField/FinitePlaces.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/Valuation/Basic.lean,Mathlib/RingTheory/Valuation/RankOne.lean,Mathlib/Topology/Algebra/Valued/LocallyCompact.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean,Mathlib/Topology/UniformSpace/AbstractCompletion.lean,docs/references.bib | 12 | 28 | ['AntoineChambert-Loir', 'faenuccio', 'github-actions', 'jcommelin', 'kbuzzard', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'riccardobrasca'] | nobody | 5 months ago | 330 days ago | 1 day |
| 15651 | TpmKranz | feat(Computability/NFA): operations for Thompson's construction | Lays the groundwork for a proof of equivalence of RE and NFA, w.r.t. described language. Actual connection to REs comes later, after the groundwork for the opposite direction has been laid. Third chunk of #12648 --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 307/5 | Mathlib/Computability/NFA.lean | 1 | 27 | ['TpmKranz', 'YaelDillies', 'dupuisf', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 5 months ago | 584 days ago | 45 days |
| 12032 | mcdoll | feat: delta distribution as a limit | --- - [ ] depends on: #11496 [](https://gitpod.io/from-referrer/) | WIP t-analysis | 58/0 | Mathlib/Analysis/Distribution/DiracDelta.lean | 1 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 752 days ago | 1 second |
| 9693 | madvorak | feat: Linear programming in the standard form | --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) - [x] depends on: #9652 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 86/0 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/LinearProgramming.lean | 2 | 15 | ['apurvanakade', 'github-actions', 'leanprover-community-mathlib4-bot', 'madvorak', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 667 days ago | 168 days |
| 15649 | TpmKranz | feat(Computability): introduce Generalised NFA as bridge to Regular Expression | Lays the groundwork for a proof of equivalence of NFA and RE, w.r.t. described language. Actual connection to NFA comes later, after the groundwork for the opposite direction has been laid. Second chunk of #12648 --- - [x] depends on: #15647 [Data.FinEnum.Option unchanged since then] [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 298/0 | Mathlib.lean,Mathlib/Computability/GNFA.lean,Mathlib/Computability/Language.lean,Mathlib/Computability/RegularExpressions.lean,docs/references.bib | 5 | 7 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'trivial1711'] | nobody | 5 months ago | 509 days ago | 23 days |
| 5745 | alexjbest | feat: a tactic to consume type annotations, and make constructor nicer | During the copenhagen masterclass I found some situations where applying the constructor tactic left the goal in a difficult to read state when autoParams were present. We add a simple tactic to clean these up, and a macro for `constructor` to behave more like the constructor notation and do this automatically (constructor is in core) It seems that these things should be cleaned up by simp, but a simp lemma to remove these annotations is not accepted by lean as the types are too similar. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 41/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Consume.lean,test/consume.lean | 4 | 5 | ['alexjbest', 'digama0', 'kim-em', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 978 days ago | 51 days |
| 5863 | eric-wieser | feat: add elaborators for concrete matrices | --- - [x] depends on: #5866 - [ ] depends on: #5897 [](https://gitpod.io/from-referrer/) | merge-conflict help-wanted blocked-by-other-PR t-meta | 257/7 | Mathlib/Control/Monad/Cont.lean,Mathlib/Data/Matrix/Auto.lean,MathlibTest/matrix_auto.lean | 3 | 8 | ['eric-wieser', 'github-actions', 'kim-em', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 1023 days ago | 1 second |
| 5919 | MithicSpirit | feat: implement orthogonality for AffineSubspace | Define `AffineSubspace.orthogonal` and `AffineSubspace.IsOrtho`, as well as develop an API emulating that of `Submodule.orthogonal` and `Submodule.IsOrtho`, respectively. Additionally, provide some relevant lemmas exclusive to affine subspaces, which are mostly to do with the relationship between orthogonality and `AffineSubspace.Parallel`. Closes #5539 --- Still WIP as I need to add more docstrings as well as notations for the new definitions. [](https://gitpod.io/from-referrer/) | WIP new-contributor merge-conflict help-wanted t-analysis | 287/0 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/AffineSubspace.lean | 2 | 7 | ['MithicSpirit', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | MithicSpirit | 5 months ago | 846 days ago | 7 minutes |
| 7386 | madvorak | feat: Define linear programs | Linear programs over a general `Module` with constraints given in the form "aᵀx - b ≥ 0" and the objective function as an `AffineMap` to be minimized. --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 87/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearProgramming.lean | 2 | 64 | ['Shreyas4991', 'YaelDillies', 'eric-wieser', 'github-actions', 'kim-em', 'madvorak', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 667 days ago | 232 days |
| 9352 | chenyili0818 | feat: arithmetic lemmas for `gradient` | This file is based on Mathlib.Analysis.Calculus.Gradient.Basic, and describes the calculation properties Co-authored-by: Ziyu Wang [tropicalfish910@gmail.com](mailto:tropicalfish910@gmail.com) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-analysis | 404/0 | Mathlib.lean,Mathlib/Analysis/Calculus/Gradient/Lemmas.lean | 2 | 31 | ['chenyili0818', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot', 'sgouezel', 'winstonyin'] | nobody | 5 months ago | 801 days ago | 52 days |
| 9795 | sinhp | feat: the type `Fib` of fibre of a function at a point | This is the most basic file of the theory of fibred categories developed here: https://github.com/sinhp/LeanFibredCategories/tree/master --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 74/0 | Mathlib.lean,Mathlib/Data/Fiber.lean | 2 | 18 | ['adri326', 'joelriou', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 5 months ago | 833 days ago | 2 days |
| 10660 | eric-wieser | feat(LinearAlgebra/CliffordAlgebra): construction from a basis | This is adapted from https://github.com/eric-wieser/lftcm2023-clifford_algebra, which only worked for the special case of `Q = 0`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author t-algebra | 573/0 | Mathlib.lean,Mathlib/LinearAlgebra/CliffordAlgebra/Basis.lean | 2 | 16 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 10977 | grunweg | feat: germs of smooth functions | Define the space of germs of smooth functions (between manifolds). Endow it with a ring structure if the target manifold is a smooth ring (e.g., a Lie group or a field). From the sphere eversion project, rewritten by me. Co-authored-by: Patrick Massot ------- Particular questions for review - is the authorship/copyright information appropriate? (`PatrickMassot` created the file `SmoothGerm` which I adapted; I didn't trace this far back through sphere-eversion.) - is providing all the intermediate algebraic structures (such as, an additive subgroup) on the space of smooth germs useful in practice? (The sphere eversion project only needs a ring structure.) - any further particular API lemmas (e.g., around coercions) which would be good to add? --- [](https://gitpod.io/from-referrer/) | t-differential-geometry merge-conflict awaiting-author t-topology t-analysis | 150/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Algebra/SmoothGerm.lean | 2 | 34 | ['YaelDillies', 'github-actions', 'grunweg', 'jcommelin', 'kim-em', 'mathlib4-merge-conflict-bot', 'mcdoll'] | fpvandoorn | 5 months ago | 612 days ago | 144 days |
| 10998 | hmonroe | feat(Logic): Arithmetization of partial recursive functions (toward Gödel's first incompleteness theorem) | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 364/0 | Mathlib.lean,Mathlib/Logic/Godel/PartArith.lean | 2 | 4 | ['Ruben-VandeVelde', 'YaelDillies', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 694 days ago | 99 days |
| 11890 | adomani | feat: the terminal refine linter | A linter that warns on usages of `refine` and `refine'` as a finishing tactic. See this [Zulip discussion](https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Usage.20of.20refine'). ### Conclusion of the experiment Systematic replacements of terminal `refine` with `exact` leads to an overall slow-down. --- - [ ] depends on: #15616 (disable the linter in downstream projects) [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 77/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/TerminalRefineLinter.lean | 3 | 15 | ['adomani', 'github-actions', 'grunweg', 'joneugster', 'leanprover-bot', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 5 months ago | 625 days ago | 18 days |
| 12006 | adomani | feat: the `suffa` tactic | The `suffa` tactic. `suffa tac` runs the tactic sequence `tac` and returns a `Try this:` suggestion of the form `suffices [target_after_tac] by tac; assumption`. For example ```lean example {m n : Nat} (h : m = n) : 0 + m = n := by suffa rewrite [Nat.zero_add] assumption ``` suggests the replacement ```lean example {m n : Nat} (h : m = n) : 0 + m = n := by suffices m = n by rewrite [Nat.zero_add] assumption assumption ``` See [this thread](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/Try.20this.3A.20suffices.20simpa) as well as [this message](https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.2311822.20flexible.20tactics.20linter/near/431895664). --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 161/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Suffa.lean,test/Suffa.lean | 4 | 4 | ['MoritzBeroRoos', 'YaelDillies', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 694 days ago | 59 days |
| 13442 | dignissimus | feat: mabel tactic for multiplicative abelian groups | Mabel tactic for multiplicative abelian groups (#10361) --- [](https://gitpod.io/from-referrer/) | new-contributor merge-conflict modifies-tactic-syntax awaiting-author help-wanted t-meta | 439/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MAbel.lean,MathlibTest/mabel.lean | 4 | 11 | ['BoltonBailey', 'dignissimus', 'github-actions', 'joneugster', 'kbuzzard', 'mathlib4-merge-conflict-bot'] | joneugster | 5 months ago | 613 days ago | 16 seconds |
| 14237 | js2357 | feat: Define the localization of a fractional ideal at a prime ideal | Define the localization of a fractional ideal at a prime ideal, and prove some basic properties. --- This PR is part 3 out of 4 of a proof of `isDedekindDomain_iff_isDedekindDomainDvr`. Part 4 is available here: #14242 - [x] depends on: #14099 Part 1 - [x] depends on: #14216 Part 2 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 230/0 | Mathlib.lean,Mathlib/RingTheory/FractionalIdeal/LocalizedAtPrime.lean,Mathlib/RingTheory/Localization/Basic.lean | 3 | 22 | ['Vierkantor', 'YaelDillies', 'github-actions', 'js2357', 'kbuzzard', 'leanprover-community-bot-assistant', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | Vierkantor | 5 months ago | 584 days ago | 26 days |
| 14345 | digama0 | feat: the Dialectica category is monoidal closed | - [x] depends on: #14274 The monoidal closed structure of the Dialectica category. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 252/0 | Mathlib.lean,Mathlib/CategoryTheory/Dialectica/Closed.lean | 2 | 4 | ['github-actions', 'kim-em', 'leanprover-community-mathlib4-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 655 days ago | 12 days |
| 14727 | jjaassoonn | feat(RingTheory/Flat/CategoryTheory): a flat module has vanishing higher Tor groups | [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 37/1 | Mathlib/RingTheory/Flat/CategoryTheory.lean | 1 | 4 | ['github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 652 days ago | 3 days |
| 14733 | jjaassoonn | feat(RingTheory/Flat/CategoryTheory): a module is flat iff tensoring preserves finite limits | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-ring-theory | 99/1 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Monoidal/RightExact.lean,Mathlib/RingTheory/Flat/CategoryTheory.lean | 4 | 3 | ['github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 650 days ago | 6 days |
| 15055 | sinhp | feat: the category of pointed objects of a concrete category | This file defines the category of pointed objects of a concrete category. After this we will have the categories of pointed groups, pointed abelian groups, pointed groupoids, etc. To define `Pointed.functor`, we need to add the following "pullback" construction to the category of elements. ``` @[simps obj map] def pullback (F : D ⥤ Type w) (G : C ⥤ D) : (G ⋙ F).Elements ⥤ F.Elements where obj X := ⟨G.obj X.1, X.2⟩ map {X Y} f := ⟨G.map f.1, f.2⟩ ``` This is called pullback since the display map of `G ⋙ F` (i.e. `π (G ⋙ F)`) is a pullback of the display map of `F`. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 185/0 | Mathlib.lean,Mathlib/CategoryTheory/ConcreteCategory/Pointed.lean,Mathlib/CategoryTheory/Elements.lean | 3 | 14 | ['dagurtomas', 'github-actions', 'kim-em', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 639 days ago | 7 days |
| 15224 | AnthonyBordg | feat(CategoryTheory/Sites): covering families and their associated Grothendieck topology | Define covering families on a category and their associated Grothendieck topology by using the API for `Coverage`. Give an explicit characterization of the covering sieves of the said topology. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 112/0 | Mathlib.lean,Mathlib/CategoryTheory/Sites/CoveringFamilies.lean | 2 | 21 | ['AnthonyBordg', 'adamtopaz', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 639 days ago | 1 day |
| 16303 | grunweg | feat(CI): check for badly formatted titles or missing/contradictory labels | --- The zulip workflow is entirely cargo-culted from #16296; please review carefully. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author CI | 325/0 | .github/build.in.yml,Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/ValidatePRTitle.lean,MathlibTest/ValidatePRTitle.lean,lakefile.lean,scripts/README.md,scripts/check-title-labels.lean | 8 | 45 | ['Command-Master', 'adomani', 'bryangingechen', 'edegeltje', 'github-actions', 'grunweg', 'joneugster', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | bryangingechen | 5 months ago | 481 days ago | 78 days |
| 18236 | joelriou | feat(Algebra/Category/ModuleCat/Presheaf): the endofunctor of presheaves of modules induced by an oplax natural transformation | An endomorphism of ` ModuleCat.restrictScalarsPseudofunctor`, i.e. a "compatible" family of functors `ModuleCat A ⥤ ModuleCat A` for all (commutative) rings `A` induces a functor `PresheafOfModules R ⥤ PresheafOfModules R` for any presheaf of (commutative) rings `R`. In #18262, this is applied to the construction of exterior powers of a presheaves of modules. --- - [x] depends on: #18197 [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory awaiting-CI merge-conflict awaiting-author | 180/0 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/FunctorOfNatTrans.lean | 2 | 6 | ['github-actions', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 18749 | GabinKolly | feat(ModelTheory): preparatory work for the existence of Fraïsse limits | Define the map of a PartialEquiv through an embedding, and related properties. Define embeddings and equivalences between equal structures or equal substructures, and related properties. Add miscellaneous lemmas which will be used to prove the existence of fraisse limits. --- This is preparation for #18876 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 308/5 | Mathlib/ModelTheory/Bundled.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/FinitelyGenerated.lean,Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/ModelTheory/Substructures.lean | 5 | 10 | ['GabinKolly', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] | nobody | 5 months ago | 466 days ago | 73 days |
| 18876 | GabinKolly | feat(ModelTheory/Fraisse): add proof that Fraïssé limits exist | Fraïssé limits exist. --- All the preparatory work done in other files is contained in the pull request #18749, this pull request adds the work done in ModelTheory/Fraisse, the definition of the sequence of structures whose limit will be the Fraïssé limit, lemmas about this sequence, and then the proof that the limit is indeed a Fraïssé limit. - [ ] depends on: #18749 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-logic | 666/5 | Mathlib/ModelTheory/Bundled.lean,Mathlib/ModelTheory/DirectLimit.lean,Mathlib/ModelTheory/FinitelyGenerated.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/ModelTheory/Substructures.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 536 days ago | 37 seconds |
| 19323 | madvorak | feat: Function to Sum decomposition | --- Discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Function.20to.20Sum.20decomposition | merge-conflict WIP t-data | 50/0 | Mathlib.lean,Mathlib/Data/Sum/Decompose.lean | 2 | 3 | ['github-actions', 'madvorak', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 483 days ago | 43 days |
| 19378 | adamtopaz | feat: Explanation widgets | This adds some simple widgets, wrapped in a tactic, term and command elaborator, for displaying markdown explanations in the infoview. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 101/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Widget/Explain.lean | 3 | 9 | ['adamtopaz', 'eric-wieser', 'github-actions', 'joneugster', 'kmill', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 475 days ago | 49 days |
| 19456 | AntoineChambert-Loir | feat(Data/Finsupp/MonomialOrder/DegRevLex): homogeneous reverse lexicographic order | Definition of the homogeneous reverse lexicographic order --- - [x] depends on: #19453 - [x] depends on: #19455 [](https://gitpod.io/from-referrer/) | WIP t-order t-data merge-conflict t-algebraic-geometry | 362/0 | Mathlib.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/Finsupp/MonomialOrder/DegRevLex.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 522 days ago | 27 seconds |
| 20051 | Timeroot | feat: `Clone` and some instances | Defines clones (`Clone`). And there is a file, `Instances.lean`, that gives several most important examples of Clones. In particular, it has all of the clones (in an appropriately general form) that occur in [Post's Lattice](https://en.wikipedia.org/wiki/Post%27s_lattice), and [later proving](https://github.com/leanprover-community/mathlib4/pull/24744) the completeness of Post's Lattice is why I'm making this PR. (Edit: Used to also say "Defined operads (`Operad`), symmetric operads (`SymmOperad`), and clones ... There is a proof that all clones have a natural operad structure.". This has been scrapped.) --- - [x] depends on: #20133 [basics and notations] - [x] depends on: #20134 [permutations] - [x] depends on: #20138 [operad] - [x] depends on: #20141 [clone] - [x] depends on: #23459 [defs] - [ ] depends on: #23460 [basic] [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra blocked-by-other-PR | 623/0 | Mathlib.lean,Mathlib/Algebra/Clone/Basic.lean,Mathlib/Algebra/Clone/Defs.lean,Mathlib/Algebra/Clone/Instances.lean,Mathlib/Data/Fin/Basic.lean | 5 | 33 | ['Timeroot', 'YaelDillies', 'eric-wieser', 'github-actions', 'jcommelin', 'kbuzzard', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'wmacmil'] | nobody | 5 months ago | 497 days ago | 5 minutes |
| 20466 | MohanadAhmed | feat: Sherman Morrison formula for rank 1 update of the matrix inverse | Provides the Sherman Morrison rank 1 update of the matrix inverse https://en.wikipedia.org/wiki/Sherman%E2%80%93Morrison_formula. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 37/0 | Mathlib/Data/Matrix/Invertible.lean | 1 | 5 | ['eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 459 days ago | 23 days |
| 20648 | anthonyde | feat: formalize regular expression -> εNFA | The file `Computability/RegularExpressionsToEpsilonNFA.lean` contains a formal definition of Thompson's method for constructing an `εNFA` from a `RegularExpression` and a proof of its correctness. --- - [x] depends on: #20644 - [x] depends on: #20645 [](https://gitpod.io/from-referrer/) | merge-conflict t-computability awaiting-zulip new-contributor | 490/0 | Mathlib.lean,Mathlib/Computability/RegularExpressionsToEpsilonNFA.lean,docs/references.bib | 3 | 7 | ['anthonyde', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'meithecatte', 'qawbecrdtey'] | nobody | 5 months ago | 360 days ago | 75 days |
| 20649 | GabinKolly | feat(ModelTheory/Graph): prove characterization of the fraisse limit of finite simple graphs | Prove that a countable graph with the extension property must be the Fraisse limit of finite simple graphs. --- [](https://gitpod.io/from-referrer/) | WIP large-import merge-conflict t-combinatorics t-logic | 175/0 | Mathlib/ModelTheory/Graph.lean,Mathlib/ModelTheory/Substructures.lean | 2 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 20652 | jjaassoonn | feat: categorical description of center of a ring | We show the isomorphism between `Z(R)` and `End(1 Mod-R)` --- - [x] depends on:#20721 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra t-category-theory | 212/21 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRings.lean,Mathlib/Algebra/Category/Ring/Center.lean,Mathlib/CategoryTheory/Conj.lean,Mathlib/CategoryTheory/Endomorphism.lean,Mathlib/CategoryTheory/Preadditive/AdditiveFunctor.lean,Mathlib/CategoryTheory/Preadditive/Basic.lean | 7 | 42 | ['alreadydone', 'github-actions', 'jcommelin', 'jjaassoonn', 'kbuzzard', 'mathlib4-merge-conflict-bot', 'qawbecrdtey'] | nobody | 5 months ago | 451 days ago | 7 days |
| 20924 | tomaz1502 | feat(Computability/QueryComplexity): Oracle-based computation | This PR adds the types and lemmas for oracle-based computation. In this model, computations are run on a monad which also counts the number of oracle queries executed. With it, it becomes possible to reason about the upper bound of the query complexity of algorithms. In the future, we could extend this work to include the necessary bits from information theory and probability to also reason about lower bounds on query complexity, like the work in https://github.com/girving/debate.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2318629.20runtime.20complexity.20of.20sorting.20a.20list
Co-authored-by: Geoffrey Irving |
merge-conflict t-computability | 305/0 | Mathlib.lean,Mathlib/Computability/QueryComplexity/Basic.lean,Mathlib/Computability/QueryComplexity/Defs.lean | 3 | 60 | ['eric-wieser', 'girving', 'github-actions', 'mathlib4-merge-conflict-bot', 'quangvdao', 'tomaz1502'] | nobody | 5 months ago | 432 days ago | 27 days |
| 20956 | tomaz1502 | feat(Computability/QueryComplexity/Sort.lean): Formalization of upper bound of queries for merge sort | This PR builds on top of #20924 to prove that merge sort (as defined in Lean's library) never executes more than `3 * n * ceil_log2 n` comparisons, where `n` is the size of the input list and `ceil_log2` is the ceil of the logarithm in base 2, which is defined in this PR.
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2318629.20runtime.20complexity.20of.20sorting.20a.20list
- [ ] depends on: #20924
Co-authored-by: Geoffrey Irving |
merge-conflict t-computability blocked-by-other-PR | 676/0 | Mathlib.lean,Mathlib/Computability/QueryComplexity/Basic.lean,Mathlib/Computability/QueryComplexity/Defs.lean,Mathlib/Computability/QueryComplexity/Sort.lean | 4 | 4 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 464 days ago | 41 seconds |
| 21270 | GabinKolly | feat(ModelTheory/Bundled): first-order embeddings and equivalences from equalities | Add first-order embeddings and equivalences from equalities between bundled structures. --- Add two definitions to get embeddings and equivalences from equalities between bundled structures, and simple properties. This is some preparatory work for #18876 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author large-import t-logic | 102/0 | Mathlib/ModelTheory/Bundled.lean | 1 | 27 | ['GabinKolly', 'Vierkantor', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 382 days ago | 50 days |
| 21277 | GabinKolly | feat(ModelTheory/PartialEquiv): Define the mapping of a self-partialEquiv through an embedding | Define the mapping of a self-partialEquiv through an embedding and the notion of fully extendable partialEquiv. --- This is some preparatory work for #18876 - [ ] depends on: #21276 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-logic | 215/5 | Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/ModelTheory/Substructures.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 455 days ago | 11 minutes |
| 21624 | sinhp | feat(CategoryTheory): The (closed) monoidal structure on the product category of families of (closed) monoidal categories | Given a family of closed monoidal categories, we show that the product of these categories is a closed monoidal category with the pointwise monoidal structure. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 144/0 | Mathlib.lean,Mathlib/CategoryTheory/Pi/Basic.lean,Mathlib/CategoryTheory/Pi/Monoidal.lean,Mathlib/CategoryTheory/Pi/MonoidalClosed.lean | 4 | 20 | ['TwoFX', 'YaelDillies', 'b-mehta', 'github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot', 'sinhp'] | nobody | 5 months ago | 388 days ago | 50 days |
| 21829 | Whysoserioushah | feat(LinearAlgebra/TensorProduct/HomTensor): Add TensorProduct of Hom-modules | Co-authored-by: Andrew Yang |
merge-conflict awaiting-author t-algebra | 174/0 | Mathlib.lean,Mathlib/LinearAlgebra/TensorProduct/HomTensor.lean | 2 | 27 | ['Whysoserioushah', 'YaelDillies', 'erdOne', 'github-actions', 'kbuzzard', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 395 days ago | 46 days |
| 21903 | yhtq | feat: add from/toList between `FreeSemigroup` and `List` with relative theorems | Add from/toList between `FreeSemigroup` and `List` with relative theorems, as well as an incidental definition of lexicographic order on `FreeSemigroup`. --- [](https://gitpod.io/from-referrer/) | t-algebra new-contributor awaiting-CI large-import merge-conflict | 169/0 | Mathlib/Algebra/Free.lean | 1 | 12 | ['YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 390 days ago | 50 days |
| 22159 | shetzl | feat: add definition of pushdown automata | Add the definition of pushdown automata and their two acceptance conditions: acceptance based on empty stack and acceptance based on final state.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 70/0 | Mathlib.lean,Mathlib/Computability/PDA.lean | 2 | 35 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 5 months ago | 410 days ago | 20 days |
| 22231 | pechersky | feat(Algebra/Valued): `AdicExpansion` initial defns | --- [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra awaiting-author t-topology | 299/0 | Mathlib.lean,Mathlib/Topology/Algebra/Valued/AdicExpansion.lean | 2 | 8 | ['Thmoas-Guan', 'github-actions', 'grunweg', 'jcommelin', 'mathlib4-merge-conflict-bot'] | jcommelin | 5 months ago | 242 days ago | 158 days |
| 22232 | pechersky | feat(Algebra/Valued): `AdicExpansion.apprUpto` | --- - [ ] depends on: #22231 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR | 399/0 | Mathlib.lean,Mathlib/Topology/Algebra/Valued/AdicExpansion.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 431 days ago | 2 minutes |
| 22233 | pechersky | feat(Algebra/Valued): `AdicExpansion.evalAt` | --- - [ ] depends on: #22231 [](https://gitpod.io/from-referrer/) | merge-conflict t-topology blocked-by-other-PR | 488/0 | Mathlib.lean,Mathlib/Topology/Algebra/Valued/AdicExpansion.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 431 days ago | 6 minutes |
| 22302 | 658060 | feat: add `CategoryTheory.Topos.Power` | This is a continuation of #21281 with the end goal of defining topoi in Mathlib. It introduces the notion of a power object in a category with a subobject classifier, which is a special case of an internal hom. The definition `HasPowerObjects C` contained in this PR is all that remains before `IsTopos C` can be defined. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 312/0 | Mathlib.lean,Mathlib/CategoryTheory/Topos/Power.lean | 2 | 3 | ['github-actions', 'joelriou', 'mathlib4-merge-conflict-bot'] | b-mehta | 5 months ago | 429 days ago | 25 minutes |
| 22662 | plp127 | feat: Localization.Away.lift (computably) | This PR adds `Localization.Away.lift'` and `Localization.Away.lift`, computable alternatives to `Localization.awayLift`. --- - [x] depends on: #24791 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 74/0 | Mathlib/RingTheory/Localization/Away/Basic.lean | 1 | 18 | ['eric-wieser', 'github-actions', 'grunweg', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] | kim-em | 5 months ago | 163 days ago | 257 days |
| 22790 | mhk119 | feat: Extend `taylor_mean_remainder_lagrange` to `x < x_0` | The `taylor_mean_remainder_lagrange` theorem has the assumption that $x_0 < x$. In many applications, we need $x < x_0$ and one cannot use the current version to obtain this (see [zulip](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Taylor's.20theorem)). This PR introduces a set of theorems that push negations through Taylor expansions so that one can extend `taylor_mean_remainder_lagrange` to the case when $x < x_0$. These theorems should also be useful elsewhere since they are quite general. | merge-conflict awaiting-author t-analysis new-contributor | 111/1 | Mathlib/Analysis/Calculus/Deriv/Basic.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/Calculus/Taylor.lean | 3 | 13 | ['Paul-Lez', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot', 'mhk119'] | nobody | 5 months ago | 391 days ago | 23 days |
| 22861 | eric-wieser | feat: add the trace of a bilinear form | Following the steps at [#Is there code for X? > Laplacian @ 💬](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Laplacian/near/450834505). --- [](https://gitpod.io/from-referrer/) Some questions: * Does this generalize to multilinear maps? * Is there an `RCLike` generalization? * Does this generalize to `BilinMap` instead of just `BilinForm`? Perhaps the approach in [#mathlib4 > Stating Schrodinger's equation @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Stating.20Schrodinger's.20equation/near/500409890) of using `ContinuousLinearMap.adjoint'` is better. | merge-conflict awaiting-author t-algebra | 100/0 | Mathlib.lean,Mathlib/LinearAlgebra/BilinearForm/Trace.lean | 2 | 4 | ['github-actions', 'jcommelin', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 392 days ago | 23 days |
| 22919 | plp127 | feat(Data/Fintype/Pi): Make `Fintype` instance for `RelHom`s computable | Makes the `Fintype` instance for rel homs computable. See this [Zulip](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Classical.20vs.20constructive.20logic.20in.20computation/near/496220816) message. --- - [x] depends on: #24748 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data | 178/44 | Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Data/Fintype/CardEmbedding.lean,Mathlib/Data/Fintype/Pi.lean | 5 | 31 | ['IvanRenison', 'b-mehta', 'eric-wieser', 'fpvandoorn', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'plp127'] | b-mehta | 5 months ago | 337 days ago | 71 days |
| 22954 | eric-wieser | feat(RingTheory/Congruence/Hom): copy from GroupTheory | This was motivated in review of #22355, but I no longer recall why. It also helps with #29357. Either way, this captures a definition that was inlined in a later file. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 214/16 | Mathlib/Algebra/RingQuot.lean,Mathlib/GroupTheory/Congruence/Hom.lean,Mathlib/RingTheory/Congruence/Defs.lean,Mathlib/RingTheory/Congruence/Hom.lean,Mathlib/RingTheory/TwoSidedIdeal/Kernel.lean | 5 | 3 | ['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 238 days ago | 1 hour |
| 23285 | AntoineChambert-Loir | refactor: directed systems in terms of functors | This is a WIP aiming to refactor the work on directed systems using the category theory library. But there are universes nightmares. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra t-category-theory large-import merge-conflict | 111/45 | Mathlib/Order/DirectedInverseSystem.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 402 days ago | 21 seconds |
| 23460 | Timeroot | feat: Definition of `Clone` | Basics about Clones. Part of #20051 --- - [ ] depends on: #26329 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 326/0 | Mathlib.lean,Mathlib/Algebra/Clone/Basic.lean,Mathlib/Algebra/Clone/Defs.lean,Mathlib/Data/Fin/Basic.lean | 4 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 246 days ago | 65 days |
| 23503 | apnelson1 | feat(Topology/Instances/ENat): ENat and tsum | We give API for the interactions between `tsum` and `ENat`. The type is especially nice, because every function is summable, and there are simplifying lemmas like the statement that a sum is infinite iff either some term is infinite, or the support is infinite. This provides one of the missing pieces for working painlessly with discrete objects, 'propositional' finiteness and cardinality. For instance, one can sum a function `f : a -> ENat` over an arbitrary set with the term `∑' a : s, 1`, and it will be provable that `∑' a : s, 1 = s.encard` and `(support f).encard ≤ ∑' a, f a` without ever having to split into finite/infinite cases. As is pointed out in the module docstring for `Data.ENat`, there are strong analogies between `ENat` and `ENNReal`, and the API runs parallel to the API for `tsum`/`ENNReal`. One could call it 'duplication', but I have yet to find a common generalization of the two that saves work, or a third example of a natural type with these same properties. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology large-import | 205/2 | Mathlib/Data/ENat/Basic.lean,Mathlib/Data/Set/Card.lean,Mathlib/Topology/Instances/ENat.lean | 3 | 3 | ['eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 381 days ago | 14 days |
| 23585 | plp127 | feat: `Filter.atMax` and `Filter.atMin` | Adds `atMax` and `atMin`, filters. Making an analogy, `atMax` : `atTop` :: `IsMax` : `IsTop`. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 148/0 | Mathlib.lean,Mathlib/Order/Filter/AtMaxMin.lean | 2 | 5 | ['github-actions', 'mathlib4-merge-conflict-bot', 'plp127', 'urkud'] | nobody | 5 months ago | unknown | 0 seconds |
| 23758 | erdOne | feat(Topology/Algebra): linearly topologized iff non-archimedean | ...for topological modules over compact rings or `ℤ`-finite rings --- [](https://gitpod.io/from-referrer/) | t-algebra large-import merge-conflict awaiting-author t-topology | 138/3 | Mathlib/LinearAlgebra/Span/Basic.lean,Mathlib/Topology/Algebra/LinearTopology.lean | 2 | 22 | ['ADedecker', 'AntoineChambert-Loir', 'erdOne', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | ADedecker and AntoineChambert-Loir | 5 months ago | 264 days ago | 124 days |
| 24333 | xcloudyunx | feat(Combinatorics/SimpleGraph): cycle graph implementation for generic vertex types | The existing `cycleGraph` implementation under Combinatorics/SimpleGraph/Circulant.lean only operates over `Fin n`. This PR implements a cycle graph implementation over any generic vertex type. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics new-contributor | 187/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Cycle.lean | 2 | 42 | ['IvanRenison', 'github-actions', 'mathlib4-merge-conflict-bot', 'vlad902'] | kmill | 5 months ago | 249 days ago | 123 days |
| 24540 | robertmaxton42 | feat(Quiv): add the empty, vertex, point, interval, and walking quivers | Add: * The empty quiver * The vertex quiver (one vertex, and no edges) and the point quiver (one vertex, one self-edge) * The interval quiver (two vertices with an edge between them) * The walking quiver (vertices `0` and `1` with two edges both `0 -> 1`. Functors from the walking quiver to `Type` define quivers, by interpreting `F.obj 0` as the type of vertices, `F.obj 1` as the type of edges, using one of the two edges to label the source of every edge and using the other to label the target.) - [x] depends on: #24538 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory | 370/0 | Mathlib.lean,Mathlib/CategoryTheory/Category/Quiv/Shapes.lean,Mathlib/CategoryTheory/Category/Quiv/WalkingQuiver.lean,Mathlib/Logic/Small/Defs.lean | 4 | 14 | ['github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robertmaxton42', 'robin-carlier'] | nobody | 5 months ago | 329 days ago | 5 hours |
| 24850 | pechersky | feat(Topology/UniformSpace/Ultra): uniform spaces induced by pseudometrics are ultra if system is ultra | Any uniform space has a natural system of pseudometrics definable on it, comprised of those pseudometrics constructed from a descending chain of equivalence relation entourages. In a nonarchimedean uniformity, this pseudometric system induces the uniformity. --- [](https://gitpod.io/from-referrer/) - [x] depends on: #23111 | merge-conflict t-topology | 509/1 | Mathlib.lean,Mathlib/Topology/MetricSpace/BundledFun.lean,Mathlib/Topology/UniformSpace/Ultra/Pseudometrizable.lean | 3 | 9 | ['ADedecker', 'fpvandoorn', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | urkud | 5 months ago | 163 days ago | 177 days |
| 25324 | eric-wieser | feat: more functorial results about DFinsupp | We have these already for Finsupp. The `DFinsupp` statements need some extra casts in some places. --- - [ ] depends on: #27182 [](https://gitpod.io/from-referrer/) [#mathlib4 > Equiv.cast for structures @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Equiv.2Ecast.20for.20structures/near/521390935) | merge-conflict awaiting-author t-algebra t-data | 137/16 | Mathlib/Data/DFinsupp/Defs.lean,Mathlib/LinearAlgebra/DFinsupp.lean | 2 | 13 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | pechersky | 5 months ago | 213 days ago | 19 days |
| 25585 | Paul-Lez | feat(Tactic/Linters/DeprecatedSimpLemma): lint for deprecated simp lemmas | The deprecated simp lemma linter flags declarations that have both the `deprecated` and `simp` attributes. See Zulip discussion: [#mathlib4 > Help with Mathlib.Order.Interval.Finset.Defs @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Help.20with.20Mathlib.2EOrder.2EInterval.2EFinset.2EDefs/near/505994843) --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author | 105/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/DeprecatedSimpLemma.lean,MathlibTest/DeprecatedSimpLemmaTest.lean | 4 | 8 | ['adomani', 'github-actions', 'grunweg', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 327 days ago | 13 minutes |
| 26648 | eric-wieser | chore(TensorProduct): remove more `suppress_compilation`s | --- [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-core-PR t-algebra | 3/7 | Mathlib/LinearAlgebra/CliffordAlgebra/Prod.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/External.lean,Mathlib/LinearAlgebra/TensorProduct/Graded/Internal.lean | 3 | 5 | ['eric-wieser', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 299 days ago | 3 days |
| 28316 | eric-wieser | feat(Tactic/NormNum): better trace nodes | Comparing the infoview on the first example in the test file
| Before | After |
|---|---|
| |
merge-conflict t-meta | 136/5 | Mathlib.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Util/Trace.lean,MathlibTest/norm_num_trace.lean | 4 | 20 | ['JovanGerb', 'eric-wieser', 'github-actions', 'kmill', 'leanprover-bot', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'plp127'] | JovanGerb | 5 months ago | 242 days ago | 18 days |
| 31587 | JovanGerb | Lean pr testing 11156 | Testing the performance improvement given by not deleting cache so often when modifying the environment. cf. https://github.com/leanprover/lean4/pull/11156 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 760/625 | Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1997Q3.lean,Archive/Imo/Imo2024Q5.lean,Archive/MiuLanguage/Basic.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Cache/Requests.lean,Counterexamples/PolynomialIsDomain.lean,Mathlib.lean,Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Ring/Finset.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/CharP/Subring.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.lean,Mathlib/Algebra/ContinuedFractions/ConvergentsEquiv.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Group/Int/Even.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/Submonoid/Operations.lean,Mathlib/Algebra/Group/Subsemigroup/Operations.lean,Mathlib/Algebra/Homology/Augment.lean,Mathlib/Algebra/Homology/Embedding/Connect.lean,Mathlib/Algebra/Lie/LieTheorem.lean,Mathlib/Algebra/Lie/Nilpotent.lean,Mathlib/Algebra/Lie/Weights/Chain.lean,Mathlib/Algebra/Lie/Weights/RootSystem.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/CauSeq/Basic.lean,Mathlib/Algebra/Order/Field/Power.lean,Mathlib/Algebra/Order/Group/Unbundled/Int.lean,Mathlib/Algebra/Order/Module/HahnEmbedding.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Polynomial/CoeffList.lean,Mathlib/Algebra/Polynomial/Degree/CardPowDegree.lean,Mathlib/Algebra/Polynomial/Degree/IsMonicOfDegree.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/Factors.lean,Mathlib/Algebra/Polynomial/Homogenize.lean,Mathlib/Algebra/Polynomial/Laurent.lean,Mathlib/Algebra/Polynomial/RingDivision.lean,Mathlib/Algebra/Polynomial/SumIteratedDerivative.lean,Mathlib/Algebra/Ring/Action/Invariant.lean,Mathlib/Algebra/Ring/Ext.lean,Mathlib/Algebra/Ring/Periodic.lean,Mathlib/Algebra/Ring/Subsemiring/Defs.lean,Mathlib/Algebra/Star/Module.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/SpreadingOut.lean,Mathlib/AlgebraicGeometry/StructureSheaf.lean,Mathlib/AlgebraicTopology/DoldKan/Degeneracies.lean,Mathlib/AlgebraicTopology/DoldKan/Faces.lean,Mathlib/AlgebraicTopology/Quasicategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplicialSet/Horn.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/Convex/Between.lean,Mathlib/Analysis/Convex/SpecificFunctions/Deriv.lean,Mathlib/Analysis/Convex/StdSimplex.lean,Mathlib/Analysis/Distribution/TemperateGrowth.lean,Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean,Mathlib/Analysis/Matrix/Spectrum.lean,Mathlib/Analysis/Meromorphic/Basic.lean,Mathlib/Analysis/Normed/Affine/Simplex.lean,Mathlib/Analysis/Normed/Field/UnitBall.lean,Mathlib/Analysis/Normed/Group/SemiNormedGrp/Kernels.lean,Mathlib/Analysis/Normed/Module/Ball/RadialEquiv.lean,Mathlib/Analysis/Normed/Ring/Ultra.lean,Mathlib/Analysis/NormedSpace/MStructure.lean,Mathlib/Analysis/SpecialFunctions/Gamma/Beta.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/CategoryTheory/ConcreteCategory/UnbundledHom.lean,Mathlib/CategoryTheory/Groupoid/Subgroupoid.lean,Mathlib/Combinatorics/Additive/AP/Three/Defs.lean,Mathlib/Combinatorics/Additive/FreimanHom.lean,Mathlib/Combinatorics/Quiver/Arborescence.lean,Mathlib/Combinatorics/Schnirelmann.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean,Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean,Mathlib/Computability/Primrec.lean,Mathlib/Control/Random.lean,Mathlib/Data/Char.lean,Mathlib/Data/ENNReal/Basic.lean,Mathlib/Data/ENNReal/Inv.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/SuccPred.lean | 297 | 5 | ['JovanGerb', 'github-actions', 'leanprover-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 169 days ago | 1 minute |
| 6268 | eric-wieser | fix: fixups to #3838 | This is an attempt to make #3838 universe polymorphic --- [](https://gitpod.io/from-referrer/) * Depends on #6271 * Depends on #8876 | merge-conflict WIP | 186/107 | Mathlib/Control/Random.lean,Mathlib/Tactic/SlimCheck.lean,Mathlib/Testing/SlimCheck/Functions.lean,Mathlib/Testing/SlimCheck/Gen.lean,Mathlib/Testing/SlimCheck/Sampleable.lean,Mathlib/Testing/SlimCheck/Testable.lean,test/slim_check.lean | 7 | 10 | ['github-actions', 'kim-em'] | nobody | 5 months ago | unknown | 0 seconds |
| 6859 | MohanadAhmed | feat: TryLean4Bundle: Windows Bundle Creator | # `TryLean4Bundle`: Windows Bundle Creator A Windows batch script and a CI yml file that create an self extracting archive. The user should 1. just download the archive, 2. double click the archive to expand 3. double click the `RunLean.bat` script in the expanded archive. The script currently downloads 7 dependencies into CI then unpacks them in the appropriate locations and finally packs them back. To try a bundle created using these scripts but from a different repo see (https://github.com/MohanadAhmed/TryLean4Bundle/releases) --- [](https://gitpod.io/from-referrer/) | WIP help-wanted CI | 114/0 | .github/workflows/mk_windows_bundle.yml,scripts/windowsBundle.bat | 2 | 0 | [] | nobody | 5 months ago | 975 days ago | 7 minutes |
| 6993 | jjaassoonn | feat: lemmas about `AddMonoidAlgebra.{divOf, modOf}` | --- - [x] depends on: #7582 - [x] depends on: #8975 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra | 147/3 | Mathlib/Algebra/MonoidAlgebra/Division.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/MvPolynomial/Basic.lean,Mathlib/Data/MvPolynomial/CommRing.lean,Mathlib/Data/MvPolynomial/Division.lean | 5 | 42 | ['YaelDillies', 'alreadydone', 'digama0', 'eric-wieser', 'github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 833 days ago | 103 days |
| 7427 | MohanadAhmed | feat: eigenvalues sorted in ascending/descending order | In the file `Analysis.InnerProductSpace.Spectrum` todo notes were left saying: > TODO Postcompose with a permutation so that these eigenvectors are listed in increasing order of eigenvalue. > TODO Postcompose with a permutation so that these eigenvalues are listed in increasing order. - This is a start in that direction --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 162/4 | Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/NormedSpace/PiLp.lean,Mathlib/LinearAlgebra/Matrix/Spectrum.lean | 3 | 0 | [] | nobody | 5 months ago | unknown | 0 seconds |
| 9339 | FMLJohn | feat(RingTheory/GradedAlgebra/HomogeneousIdeal): given a finitely generated homogeneous ideal of a graded semiring, construct a finite spanning set for the ideal which only contains homogeneous elements | --- - [ ] depends on: #8187 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 402/4 | Mathlib.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/Algebra/Module/GradeZeroModule.lean,Mathlib/RingTheory/Finiteness.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/RingTheory/GradedAlgebra/HomogeneousIdeal.lean,Mathlib/RingTheory/GradedAlgebra/Noetherian.lean | 8 | 11 | ['FMLJohn', 'github-actions', 'jjaassoonn', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 847 days ago | 6 days |
| 9564 | AntoineChambert-Loir | chore: weaken commutativity assumptions for AdjoinRoot.lift and AdjoinRoot.liftHom | I weaken a commutativity assumption for docs#AdjoinRoot.liftHom that the target algebra be commutative. It is only assumed to be a Semiring. For that, I need to generalize docs#AdjoinRoot.lift which takes `i : R ->+* S`, `a : S` with `f.eval₂ i a = 0` and defines `AdjoinRoot f ->+* S` that extends `i ` and sends `AdjoinRoot.root f` to `a`. --- The initial version of the PR was to define `AdjoinRoot.lift'` where `S` is only a Semiring, with the additional assumption `hcomm : ∀ r, Commute (i r) a` that the element `a` commutes with the image of `i`. @jcommelin suggested to provide this argument as an `autoParam`, filled in by an ad hoc `commutativity` tactic. However, such an argument cannot be made implicit and a first version required to have this argument given each time, most of the time by `_`, even for all subsequent lemmas, `AdjoinRoot.lift_mk`, etc. To avoid this, I tried to make this assumption a `⦃hcomm : ∀ r, Commute (i r) a⦄`. This appears to have some side effects that proofs using an `exact` tactic or in term mode do not work well, but one can resort on `by simp […]`. Maybe @eric-wieser or @Vierkantor will have opinions on that. In some cases one can still give the argument as `(hcomm := by commutativity)`. (There are 3 options : - separate lemmas for the fully commutative case and for the case where a proof is needed - using the `commutativity` tactic, but with an argument `_` sometimes - using the optional argument.) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 146/30 | Mathlib.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Group/Commute/Defs.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Commutativity.lean,Mathlib/Tactic/Commutativity/Init.lean | 8 | 14 | ['AntoineChambert-Loir', 'Vierkantor', 'eric-wieser', 'jcommelin'] | nobody | 5 months ago | 760 days ago | 16 days |
| 10026 | madvorak | feat: linear programming according to Antoine Chambert-Loir's book | --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 86/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearProgramming.lean | 2 | 10 | ['eric-wieser', 'madvorak', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | nobody | 5 months ago | 667 days ago | 154 days |
| 10159 | madvorak | feat: linear programming according to Antoine Chambert-Loir's book — affine version | --- Zulip discussion: https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.237386.20Linear.20Programming Four PRs incompatible with each other: https://github.com/leanprover-community/mathlib4/pull/7386 (list of constraints) https://github.com/leanprover-community/mathlib4/pull/9693 (matrix form) https://github.com/leanprover-community/mathlib4/pull/10026 (Antoine Chambert-Loir's def; semirings, linear) https://github.com/leanprover-community/mathlib4/pull/10159 (Antoine Chambert-Loir's def; rings, affine) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra RFC | 83/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearProgramming.lean | 2 | 8 | ['eric-wieser', 'madvorak', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] | nobody | 5 months ago | 667 days ago | 152 days |
| 10349 | Shamrock-Frost | refactor(CategoryTheory/MorphismProperty): some clean-ups | We make explicit some of the galois connections/closure operators in the existing MorphismProperty file, rewrite some proofs to take advantage of these structures, and change map/inverseImage by (1) swapping their argument order, for consistency with Set.range and Set.preimage and (2) making "map" perform the strict, evil map while "essMap" (previously called map) forms the closure of the image under isomorphisms. Finally we add `IsMultiplicative` instances for isos/epis/monos, with an eye towards constructing the wide subcategory on these classes of maps. --- - [x] depends on: #10347 - [x] depends on: #10348 [](https://gitpod.io/from-referrer/) | merge-conflict t-category-theory | 474/318 | Mathlib/CategoryTheory/Localization/Composition.lean,Mathlib/CategoryTheory/Localization/LocalizerMorphism.lean,Mathlib/CategoryTheory/MorphismProperty.lean,Mathlib/Data/Set/Lattice.lean,Mathlib/Order/Closure.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Hom/CompleteLattice.lean,Mathlib/Order/RelIso/Basic.lean | 8 | 1 | ['leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 813 days ago | 6 minutes |
| 11021 | jstoobysmith | feat(AlgebraicTopology): add join of augmented SSets | This pull-request adds the definition of the join of augmented SSets defined as contravariant functors from `WithInitial SimplexCategory` to `Type u`. In addition it shows that the join of two standard augmented SSets is again an augmented SSets. From this the definition of the join of simplicial sets should follow easily. To aid the above theory, an api for `WithInitial SimplexCategory` has been created, with the notion of the `join` and `split` (forming a sort of inverse to join) of objects in this category are defined. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebraic-topology new-contributor | 2137/1 | .gitignore,Mathlib.lean,Mathlib/AlgebraicTopology/Join.lean,Mathlib/AlgebraicTopology/SimplexCategory.lean,Mathlib/AlgebraicTopology/SimplexCategoryWithInitial.lean,Mathlib/AlgebraicTopology/SimplicialSet.lean | 6 | 47 | ['github-actions', 'jcommelin'] | nobody | 5 months ago | 792 days ago | 1 day |
| 11800 | JADekker | feat: KappaLindelöf spaces | Define KappaLindelöf spaces by following the first one-third of the API for Lindelöf spaces. The remainder will be added in a future PR. --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-topology awaiting-zulip | 301/2 | Mathlib.lean,Mathlib/Topology/Compactness/KappaLindelof.lean,Mathlib/Topology/Compactness/Lindelof.lean | 3 | 38 | ['ADedecker', 'JADekker', 'PatrickMassot', 'StevenClontz', 'adomani', 'github-actions', 'grunweg', 'kim-em', 'urkud'] | nobody | 5 months ago | 638 days ago | 123 days |
| 12087 | JADekker | feat: complete API for K-Lindelöf spaces | --- - [ ] depends on: #11800 (which is now awaiting a design decision) [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict t-topology blocked-by-other-PR | 789/17 | Mathlib.lean,Mathlib/Order/Filter/CardinalInter.lean,Mathlib/Topology/Compactness/KLindelof.lean,Mathlib/Topology/Compactness/Lindelof.lean | 4 | 2 | ['github-actions', 'leanprover-community-mathlib4-bot'] | nobody | 5 months ago | 638 days ago | 99 days |
| 12251 | ScottCarnahan | refactor(RingTheory/HahnSeries): several generalizations | This PR is a container for several smaller PRs that refactor and generalize the existing Hahn series theory. It is (I think) all we need from Hahn series to get a palatable theory of vertex algebras off the ground (other prerequisites from Lie algebras will eventually come in a different PR). Major changes include: - equivalence between iterated Hahn series and Hahn series on Lex products. - introduce `orderTop` and `leadingCoeff` functions. Here, `orderTop` is a `WithTop Γ`-valued version of `order` that does not need `[Zero Γ]` and `leadingCoeff` returns the coefficient of the minimal element of support (or zero if empty). - introduce ordered and cancellative vector addition classes together with some basic theory e.g., finiteness of antidiagonals for partially well-ordered sets. - `HahnSeries Γ R`-module structure on `HahnModule Γ' R V`, when `Γ` is an `OrderedCancelAddCommMonoid`, `Γ'` is a `PartialOrder` with `OrderedCancelVAdd Γ Γ'`, `R` is a semiring, and `V` is an `R`-module. - Move `AddVal` to a separate file - the underlying function is just `orderTop`, but the description of the valuation needs an additional import and an `IsDomain` hypothesis. Results that depended on `AddVal` are changed to use `orderTop` and generalized. --- - [x] depends on: #10781 [HahnSeries on Lex product] - [x] depends on: #10846 [HahnModule] - [x] depends on: #11965 [orderTop] - [x] depends on: #11979 [OrderedVAdd] - [x] depends on: #12996 [leadingTerm] - [x] depends on: #16649 - [x] depends on: #16701 - [x] depends on: #17004 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra t-order | 1059/97 | Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/HahnSeries/Basic.lean,Mathlib/RingTheory/HahnSeries/HEval.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean,Mathlib/RingTheory/HahnSeries/Summable.lean | 6 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 648 days ago | 42 days |
| 12394 | JADekker | feat: define pre-tight and tight measures | Define tight measures (by first defining separable and pre-tight measures). Define some api for all three concepts Prove Ulam's tightness theorem and a strengthened version of this. --- [](https://gitpod.io/from-referrer/) | please-adopt merge-conflict awaiting-author t-measure-probability | 503/0 | Mathlib.lean,Mathlib/MeasureTheory/Measure/Tight.lean | 2 | 34 | ['EtienneC30', 'JADekker', 'github-actions', 'sgouezel'] | nobody | 5 months ago | 725 days ago | 2 days |
| 12452 | JADekker | feat(Cocardinal): add some more api | Just a small PR to add a bit more API for cocardinal filters. Not everything seems to generalise nicely from cofinite, so I didn't include such results. Currently the file has one `sorry`, I'm not sure how to complete this proof. --- [](https://gitpod.io/from-referrer/) | t-topology awaiting-CI | 75/0 | Mathlib/Order/Filter/Cocardinal.lean | 1 | 0 | [] | nobody | 5 months ago | 735 days ago | 34 minutes |
| 14426 | adomani | feat: `#min_imps` command (development branch) | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP | 142/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/MinImports.lean,test/MinImports.lean | 4 | 2 | ['adomani', 'github-actions'] | nobody | 5 months ago | 665 days ago | 31 seconds |
| 14686 | smorel394 | feat(AlgebraicGeometry/Grassmannian): define the Grassmannian scheme | # The Grassmannian scheme Define the Grassmannian scheme by gluing affine charts. We fix a commutative ring `K`, a free `K`-module of finite type `V` and two natural numbers `r` and `c`. The scheme we define should parametrize surjective `K`-linear maps `V →ₗ[K] (Fin r → K)`, assuming that `V` is of rank `r + c`. We actually define the scheme without assuming the condition on the rank of `V`, but it is empty unless the rank of `V` is `r + c`. Main definitions: * `Grassmannian.glueData K V r c`: the `AlgebraicGeometry.Scheme.GlueData` defining the Grassmannian scheme. * `Grassmannian K V r c`: the Grassmannian scheme, defined as `(Grassmannian.glueData K V r c).glued`. * `Grassmannian.structMorphism K V r c`: the structural morphism from `Grassmannian K V r c` to `Spec K`. # Implementation We use as index type for the charts the type `Basis (Fin (r + c)) K V` (so this is empty unless `V` is free of rank `r + c`). All the charts are the same and equal to the affine space with coordinates indexed by `Fin c × Fin r`, that is, to `Spec (MvPolynomial (Fin c × Fin r) K)`. The idea is that, for `i` in `Basis (Fin (r + c)) K V`, the corresponding chart will parametrize all surjective `K`-linear maps `φ : V →ₗ[K] (Fin r → K)` that become isomorphisms when restricted to the `K`-submodule generated by the first `r` vectors of the basis `i`. To get the point of the chart corresponding to `φ`, we take the matrix of `φ` in the basis `i` of `V` and the canonical basis of `Fin r → K`, we divide it on the right by its top `r × r` square submatrix (which is invertible by assumption), and we taken the botton `c × r` submatrix. This is almost the usual description of the Grassmannian by charts, with three differences: * We consider the Grassmannian parametrizing `r`-dimensional quotients of `V` instead of `r`-dimensional subspaces of `V`, because this is more natural when working over a general ring (or scheme). * In the usual description, we fix a basis of `V` and index the chart by its subsets `I` of cardinality `r`. Here, to avoid making a choice, we instead index charts by the set of bases of `V` and always choose the subset `I` to consist of the first `r` vectors. * Instead of working with `FiniteDimensional.finrank K V - r`, which would cause technical trouble because of the way subtraction works on `ℕ`, we introduce the codimension `c` as an auxiliary variable, and our constructions are only interesting when `r + c` is equal to `FiniteDimensional.finrank K V`. # Why is this a WIP * There a bunch of lemmas in the file `AlgebraicGeometry/Grassmannian/Lemmas.lean` that either should not be necessary or should be put in another PR for some other part of mathlib. * The proofs in `AlgebraicGeometry/Grassmannian/Basic.lean` are probably too complicated, and the names suck. # Notes. This contribution was created as part of the AIM workshop "Formalizing algebraic geometry" in June 2024. --- - [x] depends on: #14711 [](https://gitpod.io/from-referrer/) | please-adopt WIP workshop-AIM-AG-2024 merge-conflict t-algebraic-geometry | 1002/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/Grassmannian/Basic.lean,Mathlib/AlgebraicGeometry/Grassmannian/Lemmas.lean | 3 | 15 | ['erdOne', 'github-actions', 'joelriou', 'leanprover-community-mathlib4-bot', 'smorel394'] | nobody | 5 months ago | 657 days ago | 3 minutes |
| 17071 | ScottCarnahan | feat(LinearAlgebra/RootSystem): separation, base, cartanMatrix | This PR defines an abstract separation structure for roots, together with the associated base and Cartan Matrix. In general, the good properties will follow from additional order hypotheses on the base ring (implemented in a future PR). --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 111/0 | Mathlib.lean,Mathlib/LinearAlgebra/RootSystem/Separation.lean | 2 | 1 | ['github-actions'] | nobody | 5 months ago | 564 days ago | 20 days |
| 17471 | joelriou | feat(Algebra/ModuleCat/Differentials/Sheaf): the sheaf of relative differentials | --- - [ ] depends on: #17366 - [x] depends on: #17388 - [x] depends on: #16755 - [ ] depends on: #17469 [](https://gitpod.io/from-referrer/) | WIP blocked-by-other-PR t-category-theory large-import merge-conflict t-algebraic-geometry | 740/10 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Differentials/Presheaf.lean,Mathlib/Algebra/Category/ModuleCat/Differentials/Sheaf.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Limits.lean,Mathlib/Algebra/Category/ModuleCat/Presheaf/Pullback.lean,Mathlib/Algebra/Category/Ring/Constructions.lean,Mathlib/Algebra/Ring/Hom/Defs.lean,Mathlib/AlgebraicGeometry/Modules/Differentials.lean,Mathlib/Geometry/RingedSpace/SheafedSpace.lean | 9 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 18626 | hannahfechtner | feat: define Artin braid groups | Define the Artin braid group on infinitely many strands. Includes a toGroup function which defines a function out of the braid group to any other group (given a function which satisfies the braid relations) (more to come in this file; next up: Artin braid groups on finitely many strands) --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra new-contributor | 91/0 | Mathlib.lean,Mathlib/GroupTheory/SpecificGroups/BraidGroup/Basic.lean | 2 | 22 | ['github-actions', 'hannahfechtner', 'jcommelin', 'joelriou'] | nobody | 5 months ago | 526 days ago | 15 days |
| 18784 | erdOne | feat(AlgebraicGeometry): use `addMorphismPropertyInstances` | --- - [ ] depends on: #18785 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry blocked-by-other-PR | 435/91 | Mathlib.lean,Mathlib/AlgebraicGeometry/Cover/Open.lean,Mathlib/AlgebraicGeometry/Morphisms/Affine.lean,Mathlib/AlgebraicGeometry/Morphisms/ClosedImmersion.lean,Mathlib/AlgebraicGeometry/Morphisms/FinitePresentation.lean,Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean,Mathlib/AlgebraicGeometry/Morphisms/OpenImmersion.lean,Mathlib/AlgebraicGeometry/Morphisms/Proper.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiSeparated.lean,Mathlib/AlgebraicGeometry/Morphisms/RingHomProperties.lean,Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean,Mathlib/AlgebraicGeometry/Morphisms/UniversallyClosed.lean,Mathlib/AlgebraicGeometry/Restrict.lean,Mathlib/CategoryTheory/MorphismProperty/Composition.lean,Mathlib/CategoryTheory/MorphismProperty/Limits.lean,Mathlib/CategoryTheory/MorphismProperty/Tactic.lean,MathlibTest/AddMorphismPropertyInstances.lean | 18 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 538 days ago | 12 minutes |
| 19062 | hannahfechtner | feat(Algebra/PresentedMonoid/Basic): facts about rel | Add in a number of useful theorems (reflexivity, closure under multiplication) and lemmas about when the PresentedMonoid.rel holds as an API for users --- [](https://gitpod.io/from-referrer/) | awaiting-author t-algebra | 38/0 | Mathlib/GroupTheory/Congruence/Defs.lean | 1 | 8 | ['github-actions', 'hannahfechtner', 'kbuzzard', 'riccardobrasca'] | nobody | 5 months ago | 430 days ago | 87 days |
| 19607 | madvorak | feat: block matrices are totally unimodular | --- Discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/TU.20block.20matrix.20.2319607 - [ ] depends on: #19323 - [ ] depends on: #20428 - [ ] depends on: #20433 [](https://gitpod.io/from-referrer/) | merge-conflict WIP blocked-by-other-PR | 156/0 | Mathlib.lean,Mathlib/Data/Sum/Decompose.lean,Mathlib/LinearAlgebra/Matrix/Determinant/TotallyUnimodular.lean | 3 | 11 | ['github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'madvorak', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | unknown | 0 seconds |
| 20029 | FrederickPu | feat(Tactic/simps): allow for Config attributes to be set directly | Allow for Config attributes to be set directly when using initialize_simp_projection as per issue #19895 Basically modified initialize_simp_projection so that the user has the option of specifying a tuple of config option values. Ex: ``` initialize_simp_projection MulEquiv (toFun → apply, invFun → symm_apply) (fullyApplied := false) ``` These config options are then converted into projections. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP new-contributor t-meta | 34/4 | Mathlib/Tactic/Simps/Basic.lean | 1 | 11 | ['FrederickPu', 'YaelDillies', 'fpvandoorn', 'github-actions', 'leanprover-community-bot-assistant'] | nobody | 5 months ago | 499 days ago | 9 hours |
| 21269 | 658060 | feat(CategoryTheory/Topos): basic definitions and results in topos theory | This code contains basic definitions and results in topos theory, including the definition of a subobject classifier, power objects, and topoi. It is proved that every topos has exponential objects, i.e. "internal homs". The mathematical content follows chapter IV sections 1-2 of Mac Lane and Moerdijk's text "Sheaves in Geometry and Logic". --- - [x] depends on: #21281 [](https://gitpod.io/from-referrer/) | WIP t-category-theory new-contributor merge-conflict awaiting-author | 1269/0 | Mathlib.lean,Mathlib/CategoryTheory/Topos/Basic.lean,Mathlib/CategoryTheory/Topos/Classifier.lean,Mathlib/CategoryTheory/Topos/Exponentials.lean,Mathlib/CategoryTheory/Topos/Power.lean | 5 | 10 | ['658060', 'gio256', 'github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 5 months ago | 455 days ago | 3 hours |
| 22805 | ScottCarnahan | feat(FieldTheory/Finite): fixed points of Frobenius automorphism | This PR identifies the prime field with the fixed points of frobenius. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra | 325/7 | Mathlib/Algebra/Algebra/ZMod.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/FieldTheory/Finite/GaloisField.lean | 4 | 1 | ['github-actions'] | nobody | 5 months ago | unknown | 0 seconds |
| 23990 | robertmaxton42 | feat(Types.Colimits): Quot is functorial and colimitEquivQuot is natural | Add `Functor.quotFunctor` to parallel `Functor.sectionsFunctor`, witnessing that `Quot` is functorial; add `colimNatIsoQuotFunctor` to parallel `limNatIsoSectionsFunctor`, witnessing that `colimitEquivQuot` is natural in the diagram $F$. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-category-theory new-contributor | 33/0 | Mathlib/CategoryTheory/Limits/Types/Colimits.lean | 1 | 5 | ['github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'robertmaxton42'] | nobody | 5 months ago | 375 days ago | 8 days |
| 24533 | robertmaxton42 | feat(ULift): conjugation by ULift.up/down, misc cast/heq lemmas | * Adds the convenience def `ULift.conj x := `down (f (up x))`, and corresponding basic lemmas * Adds lemmas showing that `ULift.up` and `.down` commute with casts and preserve `HEq`. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data | 31/0 | Mathlib/Data/ULift.lean | 1 | 23 | ['eric-wieser', 'github-actions', 'grunweg', 'robertmaxton42'] | nobody | 5 months ago | 246 days ago | 117 days |
| 24692 | ScottCarnahan | feat(RingTheory/HahnSeries/Basic): isomorphism of Hahn series induced by order isomorphism | This PR introduces an isomorphism of Hahn series induced by an order isomorphism on the exponent posets. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 35/0 | Mathlib/RingTheory/HahnSeries/Basic.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 326 days ago | 31 days |
| 25034 | ScottCarnahan | feat(Algebra/Module/Equiv/Basic): Restriction of scalars from a semilinear equivalence to a linear equivalence | If `M` and `M₂` are both `R`-modules and modules for `S` and `S₂`, respectively, then for any ring isomorphism `e` between `S` and `S₂` and any `e`-semilinear equivalence between `M` and `M₂` that respects the `R`-action, we obtain an `R`-linear equivalence between `M` and `M₂`. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra | 28/0 | Mathlib/Algebra/Module/Equiv/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 5 months ago | 326 days ago | 20 days |
| 24627 | pechersky | feat(Topology/Algebra/Valued): `IsLinearTopology 𝒪[K] K` and `𝒪[K] 𝒪[K]` | as well as `IsLinearTopology ℤ_[p] ℤ_[p]` --- [](https://gitpod.io/from-referrer/) - [x] depends on: #26829 | merge-conflict awaiting-author t-topology | 219/26 | Mathlib.lean,Mathlib/NumberTheory/Padics/LinearTopology.lean,Mathlib/Topology/Algebra/Valued/LinearTopology.lean,Mathlib/Topology/Algebra/Valued/ValuationTopology.lean,Mathlib/Topology/Algebra/Valued/ValuedField.lean | 5 | 55 | ['ADedecker', 'erdOne', 'faenuccio', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'loefflerd', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'pechersky'] | jcommelin | 5 months ago | 163 days ago | 36 days |
| 24016 | plp127 | feat: fine uniformity | Adds the fine uniformity, and proves some properties. --- - [ ] depends on: #24096 for showing the induced topology is equal on completely regular spaces [](https://gitpod.io/from-referrer/) | merge-conflict t-topology | 283/0 | Mathlib.lean,Mathlib/Topology/UniformSpace/FineUniformity.lean,Mathlib/Topology/UniformSpace/Uniformizable.lean | 3 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 5 months ago | 379 days ago | 2 days |
| 24514 | b-mehta | chore(Int/GCD): use fuel in xgcd | Modify the definition of xgcd to use fuel recursion, to allow it to be reduced in the kernel. As a consequence, this means the evaluation of field operations in ZMod p become provable by `rfl` and `decide`. Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/270676-lean4/topic/opaque.20recursion.20definitions.20break.20mergeSort.20decidability --- [](https://gitpod.io/from-referrer/) | awaiting-author t-data merge-conflict | 44/22 | Mathlib/Data/Int/GCD.lean | 1 | 6 | ['astrainfinita', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'nomeata', 'urkud'] | nobody | 5 months ago | 306 days ago | 58 days |
| 24441 | MrSumato | feat(Data/List): add Lyndon-Schutzenberger theorem on list commutativity | Add Lyndon-Schutzenberger theorem on list commutativity. Included definition for List.repeatSelf that returns list repeated n times. --- This is my first mathlib PR, so any comments are highly appreciated. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-data new-contributor | 129/1 | Mathlib.lean,Mathlib/Data/List/Commutativity.lean,Mathlib/Data/List/Defs.lean,Mathlib/Data/List/Lemmas.lean | 4 | 38 | ['MrSumato', 'github-actions', 'grunweg', 'madvorak', 'mathlib4-merge-conflict-bot', 'plp127'] | grunweg | 4 months ago | 329 days ago | 29 days |
| 18551 | joelriou | feat(AlgebraicGeometry): the algebraic De Rham complex | If `B` is an `A`-algebra, we construct the algebraic De Rham complex of `B` over `A`: it is a cochain complex of `A`-modules. --- - [ ] depends on: #18735 - [ ] depends on: #18662 - [ ] depends on: #26464 - [x] depends on: #18534 - [x] depends on: #18527 - [x] depends on: #18440 - [ ] depends on: #18432 - [x] depends on: #18408 - [x] depends on: #18389 - [x] depends on: #18374 - [x] depends on: #18359 - [x] depends on: #18332 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR merge-conflict t-algebraic-geometry | 2836/156 | Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/Basic.lean,Mathlib/Algebra/Module/Presentation/Cokernel.lean,Mathlib/Algebra/Module/Presentation/Differentials.lean,Mathlib/Algebra/Module/Presentation/DirectSum.lean,Mathlib/Algebra/Module/Presentation/ExteriorPower.lean,Mathlib/Algebra/Module/Presentation/PiTensor.lean,Mathlib/Algebra/Module/Presentation/RestrictScalars.lean,Mathlib/Algebra/Module/Presentation/Tensor.lean,Mathlib/Analysis/NormedSpace/Multilinear/Curry.lean,Mathlib/Analysis/NormedSpace/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Sum/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Basic.lean,Mathlib/LinearAlgebra/ExteriorPower/Generators.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Multilinear/TensorProduct.lean,Mathlib/LinearAlgebra/PiTensorProduct/Basic.lean,Mathlib/LinearAlgebra/PiTensorProduct/Finite.lean,Mathlib/LinearAlgebra/PiTensorProduct/Generators.lean,Mathlib/LinearAlgebra/Span.lean,Mathlib/LinearAlgebra/TensorPower.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/RingTheory/DeRham/Basic.lean,Mathlib/RingTheory/PiTensorProduct.lean | 26 | 2 | ['github-actions', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 23040 | grunweg | feat: define immersions and smooth embeddings in infinite dimensions | Sadly, we cannot prove most nice things about them yet, as we don't have the inverse function theorem yet. TODO: prove the few things we can already say --- - [ ] depends on: #28796 - [x] depends on: #28853 - [x] depends on: #23175 (preliminaries) - [x] depends on: #23186 - [ ] depends on: another PR, about `MSplitAt` (to be filed) - and perhaps some prerequisites about products of complemented modules etc. - [x] depends on: #23219 (preliminaries about local diffeomorphisms) - [x] depends on: #8738 - in fact, #9273 is not a strict pre-requisite for this. It suffices to know "extended charts have invertible differentials", which [isInvertible_mfderiv_extChartAt](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Geometry/Manifold/MFDeriv/Atlas.html#isInvertible_mfderiv_extChartAt) mostly proves. (There's nothing wrong with completing that PR, for all interior points.) [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 967/0 | Mathlib.lean,Mathlib/Analysis/NormedSpace/HahnBanach/Splits.lean,Mathlib/Geometry/Manifold/IsImmersionEmbedding.lean,Mathlib/Geometry/Manifold/LocalDiffeomorph.lean,Mathlib/Geometry/Manifold/MSplits.lean | 5 | 4 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 4 months ago | unknown | 0 seconds |
| 6633 | adomani | feat(..Polynomial..): `MvPolynomial`s have no zero divisors | This PR continues #6627, placing the `NoZeroDivisors` instance on `MvPolynomial`s and removing auxiliary intermediate results that are no longer needed. Affected files: ``` Data/MvPolynomial/Basic.lean Data/Polynomial/RingDivision.lean RingTheory/Polynomial/Basic.lean ``` --- - [x] depends on: #6227 for the `NoZeroDivisors` instance on `AddMonoidAlgebra`s [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebra | 143/57 | Mathlib/Algebra/MonoidAlgebra/NoZeroDivisors.lean,Mathlib/Data/MvPolynomial/Basic.lean,Mathlib/Data/Polynomial/RingDivision.lean,Mathlib/RingTheory/Polynomial/Basic.lean | 4 | 6 | ['SnirBroshi', 'YaelDillies', 'adomani', 'eric-wieser', 'leanprover-community-mathlib4-bot'] | nobody | 4 months ago | 987 days ago | 5 hours |
| 21447 | erdOne | feat(AlgebraicGeometry): the split algebraic torus | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-algebraic-geometry | 419/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/Torus.lean | 2 | 6 | ['erdOne', 'github-actions', 'jcommelin', 'joelriou', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 447 days ago | 2 days |
| 5934 | eric-wieser | feat: port Data.Rat.MetaDefs | --- [](https://gitpod.io/from-referrer/) This needs some eyes from people familiar with Qq | merge-conflict help-wanted mathlib-port t-meta | 183/0 | Mathlib.lean,Mathlib/Data/Rat/MetaDefs.lean,test/rat.lean | 3 | 5 | ['eric-wieser', 'gebner', 'vihdzp'] | nobody | 4 months ago | unknown | 0 seconds |
| 4960 | eric-wieser | chore: use `open scoped` | Earlier versions of mathport did not know about this. This was done by searching for all `open` commands referencing: * `Classical` * `BigOperators` * `Topology` * `Pointwise` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-CI | 1026/981 | Mathlib/Algebra/AddTorsor.lean,Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Pointwise.lean,Mathlib/Algebra/Algebra/Subalgebra/Tower.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/BigOperators/Associated.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/BigOperators/Fin.lean,Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/BigOperators/Finsupp.lean,Mathlib/Algebra/BigOperators/Intervals.lean,Mathlib/Algebra/BigOperators/NatAntidiagonal.lean,Mathlib/Algebra/BigOperators/Option.lean,Mathlib/Algebra/BigOperators/Order.lean,Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Algebra/BigOperators/Ring.lean,Mathlib/Algebra/BigOperators/RingEquiv.lean,Mathlib/Algebra/Bounds.lean,Mathlib/Algebra/Category/GroupCat/Biproducts.lean,Mathlib/Algebra/Category/GroupCat/FilteredColimits.lean,Mathlib/Algebra/Category/GroupCat/Injective.lean,Mathlib/Algebra/Category/ModuleCat/Adjunctions.lean,Mathlib/Algebra/Category/ModuleCat/Biproducts.lean,Mathlib/Algebra/Category/Mon/FilteredColimits.lean,Mathlib/Algebra/Category/Ring/Adjunctions.lean,Mathlib/Algebra/Category/Ring/FilteredColimits.lean,Mathlib/Algebra/CharP/Basic.lean,Mathlib/Algebra/CharP/Two.lean,Mathlib/Algebra/DirectLimit.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/DirectSum/Ring.lean,Mathlib/Algebra/EuclideanDomain/Defs.lean,Mathlib/Algebra/Field/Defs.lean,Mathlib/Algebra/GCDMonoid/Div.lean,Mathlib/Algebra/GeomSum.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/GroupWithZero/Commute.lean,Mathlib/Algebra/GroupWithZero/Units/Basic.lean,Mathlib/Algebra/Homology/Additive.lean,Mathlib/Algebra/Homology/ComplexShape.lean,Mathlib/Algebra/Homology/Homology.lean,Mathlib/Algebra/Homology/Homotopy.lean,Mathlib/Algebra/Homology/HomotopyCategory.lean,Mathlib/Algebra/Homology/ImageToKernel.lean,Mathlib/Algebra/IndicatorFunction.lean,Mathlib/Algebra/LinearRecurrence.lean,Mathlib/Algebra/Module/BigOperators.lean,Mathlib/Algebra/Module/GradedModule.lean,Mathlib/Algebra/Module/LinearMap.lean,Mathlib/Algebra/Module/PointwisePi.lean,Mathlib/Algebra/Module/Submodule/Basic.lean,Mathlib/Algebra/Module/Submodule/Bilinear.lean,Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/Module/Torsion.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Chebyshev.lean,Mathlib/Algebra/Order/Module.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Rearrangement.lean,Mathlib/Algebra/Order/SMul.lean,Mathlib/Algebra/Order/UpperLower.lean,Mathlib/Algebra/Periodic.lean,Mathlib/Algebra/Polynomial/BigOperators.lean,Mathlib/Algebra/Polynomial/GroupRingAction.lean,Mathlib/Algebra/Star/BigOperators.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/Algebra/Support.lean,Mathlib/Algebra/TrivSqZeroExt.lean,Mathlib/Algebra/Tropical/BigOperators.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/Basic.lean,Mathlib/AlgebraicGeometry/PrimeSpectrum/Maximal.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/AlgebraicTopology/AlternatingFaceMapComplex.lean,Mathlib/AlgebraicTopology/ExtraDegeneracy.lean,Mathlib/AlgebraicTopology/TopologicalSimplex.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean,Mathlib/Analysis/Asymptotics/Asymptotics.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Analysis/Asymptotics/Theta.lean,Mathlib/Analysis/BoxIntegral/Box/Basic.lean,Mathlib/Analysis/BoxIntegral/Box/SubboxInduction.lean,Mathlib/Analysis/BoxIntegral/Partition/Additive.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Filter.lean,Mathlib/Analysis/BoxIntegral/Partition/Split.lean,Mathlib/Analysis/BoxIntegral/Partition/SubboxInduction.lean,Mathlib/Analysis/BoxIntegral/Partition/Tagged.lean,Mathlib/Analysis/Calculus/ContDiffDef.lean,Mathlib/Analysis/Calculus/Deriv/Add.lean | 788 | 1 | ['vihdzp'] | nobody | 4 months ago | 1055 days ago | 12 minutes |
| 4127 | kmill | refactor: create HasAdj class, define Digraph, and generalize some SimpleGraph API | --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-combinatorics | 1403/551 | Mathlib.lean,Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/Graph/Classes.lean,Mathlib/Combinatorics/Graph/Dart.lean,Mathlib/Combinatorics/Graph/Hom.lean,Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Density.lean,Mathlib/Combinatorics/SimpleGraph/Ends/Defs.lean,Mathlib/Combinatorics/SimpleGraph/Finsubgraph.lean,Mathlib/Combinatorics/SimpleGraph/Hasse.lean,Mathlib/Combinatorics/SimpleGraph/Prod.lean,Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean | 18 | 2 | ['SnirBroshi', 'vihdzp'] | nobody | 4 months ago | 1069 days ago | 8 days |
| 25481 | kbuzzard | chore: refactor Algebra.TensorProduct.rightAlgebra | The declaration `Algebra.TensorProduct.rightAlgebra` makes `A ⊗[R] B` into a `B`-algebra (here `R` is a `CommSemiring`, `A` is a `Semiring` and an `R`-algebra, and `B` is a `CommSemiring` and an `R`-algebra). It is not an instance because if A = B it causes a diamond. However in the many cases where A isn't B, it can occasionally be useful. However one could imagine that in the many cases where an R-module `M` also isn't `B`, it might occasionally be useful to make `M ⊗[R] B` into a `B`-module (and indeed I am finding this in FLT). With the current definition of `Algebra.TensorProduct.rightAlgebra` this is difficult to do without causing diamonds in the case when `M` happens to be an `R`-algebra (by which I mean "I failed to do this in finite time"). One fix for this is just to redefine `Algebra.TensorProduct.rightAlgebra` so that the `smul` field is ``` smul b ab := TensorProduct.comm _ _ _ (b • (TensorProduct.comm _ _ _ ab)) ``` i.e. literally "swap the product around, use mathlib's instance making `B ⊗[R] A` into a `B`-algebra, and then swap back". Then the same definition can be used to make `M ⊗[R] B` into a `B`-module and on the odd occasion where this point of view is useful, there is no diamond. This is what we do in this PR. After adding one simp lemma there is no breakage at all in mathlib. Furthermore, for those who have observed that we want to build on this algebra instance sometimes and, for example, add instances of the form "if M is finite over R then M ⊗[R] B is finite over B" -- these instances are really easy to add now with this new definition, because you simply pull back the analogous finite left module instance along the isomorphism M ⊗[R] B = B ⊗[R] M. Examples (from FLT, where the right action is put in a scope): ``` scoped instance [Module.Finite R M] : Module.Finite A (M ⊗[R] A) := Module.Finite.equiv (Module.TensorProduct.comm R A M) scoped instance [Module.Free R M] : Module.Free A (M ⊗[R] A) := Module.Free.of_equiv (Module.TensorProduct.comm R A M) ``` --- [](https://gitpod.io/from-referrer/) | t-algebra | 29/6 | Mathlib/RingTheory/TensorProduct/Basic.lean | 1 | 8 | ['adomani', 'github-actions', 'kbuzzard', 'leanprover-bot', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | adomani | 4 months ago | 273 days ago | 56 days |
| 14444 | digama0 | fix(GeneralizeProofs): unreachable! bug | As [reported on Zulip](https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Unreachable.20code.20reached.20in.20Lean.204.2E8.2E0/near/449286780). --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 1/1 | Mathlib/Tactic/GeneralizeProofs.lean | 1 | 6 | ['github-actions', 'jcommelin', 'kmill', 'mathlib4-merge-conflict-bot', 'plby'] | nobody | 4 months ago | 654 days ago | 10 days |
| 25138 | chrisflav | chore(RingTheory/Ideal): make `RingHom.ker` take a `RingHom` instead of `RingHomClass` | --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author merge-conflict | 317/309 | Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Hom/Rat.lean,Mathlib/Algebra/Algebra/Opposite.lean,Mathlib/Algebra/Algebra/Subalgebra/Operations.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/Category/CommAlgCat/FiniteType.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/MonoidAlgebra/Basic.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Module/AEval.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Affine/Formula.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Projective/Basic.lean,Mathlib/AlgebraicGeometry/EllipticCurve/VariableChange.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Weierstrass.lean,Mathlib/AlgebraicGeometry/Pullbacks.lean,Mathlib/Combinatorics/Nullstellensatz.lean,Mathlib/FieldTheory/Minpoly/Field.lean,Mathlib/FieldTheory/PurelyInseparable/Tower.lean,Mathlib/LinearAlgebra/Semisimple.lean,Mathlib/LinearAlgebra/TensorProduct/RightExactness.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/Adjoin/Tower.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/Congruence/Hom.lean,Mathlib/RingTheory/Etale/Kaehler.lean,Mathlib/RingTheory/Extension/Cotangent/Basis.lean,Mathlib/RingTheory/Extension/Cotangent/LocalizationAway.lean,Mathlib/RingTheory/Extension/Generators.lean,Mathlib/RingTheory/Extension/Presentation/Basic.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/RingTheory/FinitePresentation.lean,Mathlib/RingTheory/FiniteStability.lean,Mathlib/RingTheory/Finiteness/NilpotentKer.lean,Mathlib/RingTheory/Ideal/Cotangent.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IsAdjoinRoot.lean,Mathlib/RingTheory/Jacobson/Ring.lean,Mathlib/RingTheory/Kaehler/Basic.lean,Mathlib/RingTheory/Kaehler/JacobiZariski.lean,Mathlib/RingTheory/LocalRing/ResidueField/Fiber.lean,Mathlib/RingTheory/LocalRing/ResidueField/Ideal.lean,Mathlib/RingTheory/Localization/Algebra.lean,Mathlib/RingTheory/MvPowerSeries/Evaluation.lean,Mathlib/RingTheory/Nilpotent/Lemmas.lean,Mathlib/RingTheory/NoetherNormalization.lean,Mathlib/RingTheory/Nullstellensatz.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/Polynomial/UniqueFactorization.lean,Mathlib/RingTheory/Polynomial/UniversalFactorizationRing.lean,Mathlib/RingTheory/Smooth/AdicCompletion.lean,Mathlib/RingTheory/Smooth/Basic.lean,Mathlib/RingTheory/Smooth/Flat.lean,Mathlib/RingTheory/Smooth/Kaehler.lean,Mathlib/RingTheory/Smooth/NoetherianDescent.lean,Mathlib/RingTheory/Spectrum/Prime/ChevalleyComplexity.lean,Mathlib/RingTheory/Unramified/Finite.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean | 68 | 8 | ['chrisflav', 'erdOne', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib4-merge-conflict-bot'] | nobody | 4 months ago | 229 days ago | 1 hour |
| 33462 | eric-wieser | feat: teach `fun_prop` about `ContinousMultilinearMap.compContinuousLinearMap` | For now I've omitted the curried version --- [](https://gitpod.io/from-referrer/) | t-analysis | 46/0 | Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean | 1 | 3 | ['github-actions', 'sgouezel'] | nobody | 3 months ago | 120 days ago | 2 minutes |
| 25500 | eric-wieser | feat: delaborators for metadata | Being able to see these is very important when debugging tactic failures. Probably these could be upstreamed, but I don't think that's a reason not to merge them here first. --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict awaiting-author delegated t-meta | 75/3 | Mathlib/Util/Delaborators.lean,Mathlib/Util/PPOptions.lean,MathlibTest/delaborators.lean | 3 | 19 | ['JovanGerb', 'Rob23oba', 'eric-wieser', 'github-actions', 'kmill', 'mathlib-bors', 'mathlib4-merge-conflict-bot', 'plp127'] | nobody | 3 months ago | 246 days ago | 43 days |
| 21344 | kbuzzard | chore: attempt to avoid diamond in OreLocalization | --- [](https://gitpod.io/from-referrer/) | please-adopt t-algebra | 16/5 | Mathlib/RingTheory/OreLocalization/Basic.lean | 1 | 6 | ['erdOne', 'github-actions', 'kbuzzard'] | nobody | 3 months ago | 451 days ago | 38 minutes |
| 17176 | arulandu | feat: integrals and integrability with .re | Lemmas for swapping order of .re and integration/integrability. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author new-contributor t-measure-probability please-adopt | 49/0 | Mathlib/MeasureTheory/Function/L1Space.lean,Mathlib/MeasureTheory/Integral/IntegrableOn.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral.lean,Mathlib/MeasureTheory/Integral/SetIntegral.lean | 4 | 32 | ['EtienneC30', 'arulandu', 'github-actions', 'loefflerd'] | nobody | 3 months ago | 563 days ago | 9 days |
| 24010 | grunweg | feat(Counterexamples): a non-negative function, not a.e. zero, with vanishing lowe… | …r Lebesgue integral. Came up in #23707, let's document this while we're at it. --- - [ ] depends on: #20722 [](https://gitpod.io/from-referrer/) | merge-conflict please-adopt WIP blocked-by-other-PR t-measure-probability | 110/0 | Counterexamples.lean,Counterexamples/LIntegralZero.lean | 2 | 3 | ['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 382 days ago | 22 seconds |
| 33669 | eric-wieser | chore(Data/Nat/Digits): refactor to use List.rightpad | --- [](https://gitpod.io/from-referrer/) | large-import merge-conflict | 32/12 | Mathlib/Algebra/BigOperators/Group/List/Defs.lean,Mathlib/Algebra/Group/Basic.lean,Mathlib/Data/List/Lemmas.lean,Mathlib/Data/Nat/Digits/Defs.lean,Mathlib/Data/Nat/Digits/Lemmas.lean | 5 | 3 | ['github-actions', 'mathlib4-merge-conflict-bot', 'xroblot'] | nobody | 3 months ago | 115 days ago | 56 minutes |
| 13158 | erdOne | refactor(RingTheory/OreLocalization/Module): remove `LocalizedModule.mk`. | --- - [x] depends on: #13151 - [ ] depends on: #13156 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebra blocked-by-other-PR | 49/48 | Mathlib/RingTheory/OreLocalization/Basic.lean,Mathlib/RingTheory/OreLocalization/Module.lean | 2 | 2 | ['leanprover-community-mathlib4-bot', 'urkud'] | nobody | 3 months ago | 694 days ago | 9 days |
| 12934 | grunweg | chore: replace more uses of > or ≥ by < or ≤ | These were flagged by the linter in https://github.com/leanprover-community/mathlib4/pull/12879: it is easy to simple avoid > or ≥ in hypotheses or haves. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author help-wanted | 41/42 | Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2019Q4.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib/Tactic/Linarith/Datatypes.lean,test/cancel_denoms.lean,test/congr.lean,test/interval_cases.lean,test/observe.lean | 15 | 12 | ['YaelDillies', 'adomani', 'github-actions', 'grunweg', 'jcommelin', 'urkud'] | nobody | 3 months ago | 714 days ago | 1 day |
| 31348 | PatrickMassot | chore: fix a docstring typo | --- [](https://gitpod.io/from-referrer/) | documentation awaiting-author t-analysis | 1/1 | Mathlib/Analysis/Calculus/Darboux.lean | 1 | 3 | ['ADedecker', 'dopamine333', 'github-actions'] | nobody | 3 months ago | 175 days ago | 6 hours |
| 10991 | thorimur | feat: `tfae` block tactic | This PR introduces `tfae` block tactic syntax: ```lean tfae 1 → 2 := /- proof of `P₁ → P₂` -/ 2 → 3 := /- proof of `P₂ → P₃` -/ 3 → 1 := /- proof of `P₃ → P₁` -/ ``` Like the recent change to `tfae_have`, this syntax also supports all sorts of matching that `have` itself supports: ```lean tfae 2 → 3 | h₂ => /- proof of `P₃` -/ 3 → 1 -- given `P₁ := ∀(a : A), (b : B), (c : C), X`: | h₃, a, b, c => /- proof of `X` -/ ⟨h_mp, h_mpr⟩ : 1 ↔ 2 := /- proof of `P₁ ↔ P₂`; puts `h_mp : P₁ → P₂`, `h_mpr : P₂ → P₁` in the lctx -/ ``` This initial implementation is currently very simple, and relies on `tfae_have` and `tfae_finish`. Although we intend to migrate away from that syntax, this PR does not remove support for it or deprecate `tfae_have`/`tfae_finish` in any way; migration (but not deprecation) is done in #11003. --- - [x] depends on: #10653 - [x] depends on: #10994 [](https://gitpod.io/from-referrer/) | merge-conflict WIP modifies-tactic-syntax t-meta | 392/124 | Mathlib/Tactic/TFAE.lean,scripts/noshake.json,test/tfae.lean | 3 | 5 | ['github-actions', 'joneugster', 'mathlib4-dependent-issues-bot', 'thorimur'] | joneugster | 3 months ago | 588 days ago | 7 days |
| 12879 | grunweg | feat: port ge_or_gt linter from mathlib3 | Code works and is essentially green: next step is to split up into separate PRs. Feedback welcome on whether: - all the test changes are good, or I should simply allow it in more cases - if calc blocks need to be explicitly exempt --- - [ ] depends on: #12933 - [ ] depends on: #12934 - [ ] depends on: #12931 [](https://gitpod.io/from-referrer/) | merge-conflict t-linter tech debt blocked-by-other-PR | 736/319 | Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo2001Q2.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2006Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2019Q4.lean,Archive/Sensitivity.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Archive/Wiedijk100Theorems/BirthdayProblem.lean,Archive/Wiedijk100Theorems/CubingACube.lean,Mathlib.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Star/CHSH.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/Normed/Group/ControlledClosure.lean,Mathlib/Analysis/NormedSpace/MStructure.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Computability/AkraBazzi/AkraBazzi.lean,Mathlib/Computability/AkraBazzi/GrowsPolynomially.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Int/Lemmas.lean,Mathlib/Data/Nat/Dist.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Nat/Upto.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/UInt.lean,Mathlib/GroupTheory/Coxeter/Length.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean,Mathlib/MeasureTheory/Integral/Layercake.lean,Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Rayleigh.lean,Mathlib/Order/Filter/AtTopBot.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/Adjoin/Basic.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CancelDenoms/Core.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/IntervalCases.lean,Mathlib/Tactic/Linarith/Datatypes.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linter/GeOrGt.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/NormNum/GCD.lean,Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Topology/Category/Profinite/Nobeling.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/MetricSpace/Cauchy.lean,Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sequences.lean,scripts/lint-style.py,test/Explode.lean,test/GCongr/inequalities.lean,test/GeOrGt.lean,test/LibrarySearch/IsCompact.lean,test/LibrarySearch/basic.lean,test/Recall.lean,test/Rify.lean,test/Use.lean,test/cancel_denoms.lean,test/congr.lean,test/delabLinearIndependent.lean,test/delaborators.lean,test/interval_cases.lean,test/linarith.lean | 109 | 4 | ['github-actions', 'grunweg', 'leanprover-community-mathlib4-bot', 'urkud'] | nobody | 3 months ago | 715 days ago | 4 hours |
| 8608 | eric-wieser | feat: multiplicativize `AddTorsor` | --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-algebra please-adopt | 268/199 | Mathlib/Algebra/AddTorsor.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Data/Set/Pointwise/SMul.lean,Mathlib/Tactic/ToAdditive.lean | 4 | 2 | ['alreadydone'] | nobody | 3 months ago | unknown | 0 seconds |
| 16074 | Rida-Hamadani | feat: combinatorial maps and planar graphs | We define combinatorial maps, then we define planar graph using combinatorial maps. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-combinatorics | 243/0 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Planar.lean,Mathlib/Data/CombinatorialMap.lean | 3 | 29 | ['MrBrain295', 'Parcly-Taxel', 'Rida-Hamadani', 'github-actions', 'lambda-fairy', 'leanprover-community-bot-assistant'] | kmill | 3 months ago | 300 days ago | 72 days |
| 24100 | eric-wieser | feat: restore some explicit binders from Lean 3 | Part of #24099 --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author tech debt t-topology t-algebra | 39/42 | Mathlib/Data/FinEnum.lean,Mathlib/FieldTheory/Galois/Profinite.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Compactness/CompactlyGeneratedSpace.lean,Mathlib/Topology/MetricSpace/IsometricSMul.lean,Mathlib/Topology/Metrizable/CompletelyMetrizable.lean,Mathlib/Topology/Metrizable/Uniformity.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/LowerUpperTopology.lean,Mathlib/Topology/UniformSpace/UniformEmbedding.lean | 10 | 3 | ['github-actions', 'grunweg', 'leanprover-community-bot-assistant'] | nobody | 3 months ago | 380 days ago | 16 minutes |
| 25474 | adomani | test for .lean/.md check | A test PR for #25473. --- [](https://gitpod.io/from-referrer/) | merge-conflict t-linter file-removed WIP | 10/1 | .github/workflows/lint_and_suggest_pr.yml,Mathlib.lean,Mathlib/NumberTheory/NumberField/CMField.Lean | 3 | 2 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 3 months ago | 300 days ago | 29 days |
| 33991 | grunweg | test: pretty-printing of class abbrev | Lake build fails with an error in batteries: what am I doing wrong? --- [](https://gitpod.io/from-referrer/) | merge-conflict file-removed large-import WIP | 118/303 | .github/workflows/daily.yml,Mathlib.lean,Mathlib/Algebra/Group/Action/TransferInstance.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Algebra/Notation/Lemmas.lean,Mathlib/Algebra/Notation/Pi/Defs.lean,Mathlib/Algebra/Notation/Prod.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Group/Unbundled/Basic.lean,Mathlib/CategoryTheory/Limits/Yoneda.lean,Mathlib/Data/Finite/Defs.lean,Mathlib/Data/Int/Cast/Pi.lean,Mathlib/Data/Int/Init.lean,Mathlib/Data/List/Flatten.lean,Mathlib/Data/List/GetD.lean,Mathlib/Data/List/Indexes.lean,Mathlib/Data/Multiset/Defs.lean,Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/Bits.lean,Mathlib/Data/Nat/Init.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfFixingSubgroup.lean,Mathlib/Lean/Meta/Simp.lean,Mathlib/Order/BoundedOrder/Basic.lean,Mathlib/Order/GaloisConnection/Defs.lean,Mathlib/Order/Monotone/Defs.lean,Mathlib/RingTheory/Valuation/Discrete/Basic.lean,Mathlib/SetTheory/Cardinal/Defs.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/FunProp/Decl.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/Positivity/Core.lean,Mathlib/Tactic/Push/Attr.lean,Mathlib/Tactic/Widget/LibraryRewrite.lean,Mathlib/Topology/Defs/Basic.lean,Mathlib/Util/AssertExists.lean,MathlibTest/AssertExists.lean,MathlibTest/CalcQuestionMark.lean,MathlibTest/DeprecatedSyntaxLinter.lean,MathlibTest/DirectoryDependencyLinter/Test.lean,MathlibTest/EmptyLine.lean,MathlibTest/ExtractGoal.lean,MathlibTest/HaveLetLinter.lean,MathlibTest/LibrarySearch/IsCompact.lean,MathlibTest/LintStyle.lean,MathlibTest/TacticAnalysis.lean,MathlibTest/UnusedInstancesInType.lean,MathlibTest/Util/PrintSorries.lean,MathlibTest/WhitespaceLinter.lean,MathlibTest/aesop_cat.lean,MathlibTest/eqns.lean,MathlibTest/fast_instance.lean,MathlibTest/globalAttributeIn.lean,MathlibTest/hintAll.lean,MathlibTest/jacobiSym.lean,MathlibTest/slim_check.lean,MathlibTest/toAdditive.lean,lake-manifest.json,lakefile.lean,lean-toolchain | 61 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 3 months ago | 106 days ago | 1 minute |
| 31110 | bryangingechen | ci: don't delete merged branches | This will only affect PRs that are not from forks (e.g. this one). The motivation is that #30913 was closed automatically due to its target branch deleted after #30912 was merged. See also [#PR reviews > #30913 feat(Computability/Language):add subtraction notation @ 💬](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2330913.20feat.28Computability.2FLanguage.29.3Aadd.20subtraction.20notation/near/548052556). Looking at the history, it looks like this option hasn't been changed since we added bors to mathlib3: https://github.com/leanprover-community/mathlib3/pull/2322 --- [](https://gitpod.io/from-referrer/) | awaiting-author CI merge-conflict | 1/1 | bors.toml | 1 | 5 | ['bryangingechen', 'eric-wieser', 'github-actions', 'mathlib4-merge-conflict-bot', 'urkud'] | nobody | 3 months ago | 182 days ago | 17 hours |
| 9820 | jjaassoonn | feat(RingTheory/GradedAlgebra/HomogeneousIdeal): generalize to homogeneous submodule | The definitions, constructions and theorems in `HomogeneousIdeal.lean` are generalized to a homogeneous submodules. So say $R$ is a ring and $M \cong \bigoplus_{i} M_i$ is an $R$-module. Then a homogeneous $R$-submodule of $M$ is an $R$-submodule $N$ such that for all $i$ and $n \in N$, $n_i \in N$. Note that this notion doesn't actually require $R$ to be graded and $M$ is a graded module. But for more interesting lemmas, we do need that $M$ is graded $R$-module. We bake the fact $R$ is graded into the definition of homogeneous submodule, otherwise, `CompleteLattice HomogeneousSubmodule` cannot find the order of synthesis (the proof depends on that $R$ is graded) All definitions/constructions/theorems have a copy for ideals as well, this is to make sure dot notation still works. The motivation of this generalization is graded quotient module --- - [x] depends on:#18728 [](https://gitpod.io/from-referrer/) | merge-conflict t-ring-theory | 516/185 | Mathlib/Algebra/Module/GradedModule.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Scheme.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Topology.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Submodule.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,scripts/nolints_prime_decls.txt | 7 | 3 | ['github-actions', 'leanprover-community-bot-assistant'] | nobody | 2 months ago | 300 days ago | 52 days |
| 14501 | jjaassoonn | feat: module structure of filtered colimit of abelian groups over filtered colimit of rings | This helps defining the module structure of stalks This contribution was inspired by the AIM workshop "Formalizing algebraic geometry" in June 2024. --- - [x] depends on: #15315 [I am going to move the result in the new file] [](https://gitpod.io/from-referrer/) | t-algebra workshop-AIM-AG-2024 t-category-theory merge-conflict awaiting-author | 439/2 | Mathlib/CategoryTheory/Limits/ConcreteCategory/Basic.lean,Mathlib/CategoryTheory/Limits/ConcreteCategory/WithAlgebraicStructures.lean | 2 | 49 | ['YaelDillies', 'adamtopaz', 'alreadydone', 'erdOne', 'github-actions', 'jjaassoonn', 'joelriou', 'kbuzzard'] | joelriou | 2 months ago | 521 days ago | 64 days |
| 25035 | ScottCarnahan | feat(Algebra/Module/Equiv/Defs): linear equivalence between linear hom and semilinear hom | Given a ring homomorphism `σ₂ : R →+* R₂`, an `R`-module `M`, and a module `M₂` for both `R` and `R₂` satisfying `SMulCommClass R R₂ M₂` and `(σ₂ r) • x = r • x`, we produce an `R₂`-linear equivalence between `M →ₗ[R] M₂` and `M →ₛₗ[σ₂] M₂`. --- [](https://gitpod.io/from-referrer/) | WIP t-algebra merge-conflict | 21/0 | Mathlib/Algebra/Module/Equiv/Defs.lean | 1 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 326 days ago | 20 days |
| 34931 | eric-wieser | perf: make TensorProduct.lift irreducible with a unification hint | --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 6/2 | Mathlib/LinearAlgebra/TensorProduct/Basic.lean | 1 | 7 | ['eric-wieser', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] | erdOne | 2 months ago | 78 days ago | 5 days |
| 23042 | joneugster | feat(CategoryTheory/Enriched/Limits): add HasConicalLimitsOfSize.shrink | --- Note: I've marked this "WIP" because I'm not yet sure when this will be needed and I'd probably put the PR on the queue once I've created some follow-up needing it. [](https://gitpod.io/from-referrer/) | WIP t-category-theory infinity-cosmos please-adopt | 22/1 | Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean | 1 | 1 | ['github-actions'] | nobody | 2 months ago | 409 days ago | 1 second |
| 23142 | joneugster | feat(CategoryTheory/Enriched/Limits): add API for HasConicalLimit | --- [](https://gitpod.io/from-referrer/) | awaiting-author t-category-theory infinity-cosmos please-adopt | 52/9 | Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean | 1 | 2 | ['github-actions', 'joelriou'] | nobody | 2 months ago | 406 days ago | 18 hours |
| 23145 | joneugster | feat(CategoryTheory/Enriched/Limits): add IsConicalLimits | --- - [ ] depends on: #23142 [](https://gitpod.io/from-referrer/) | merge-conflict blocked-by-other-PR t-category-theory infinity-cosmos please-adopt | 221/9 | Mathlib.lean,Mathlib/CategoryTheory/Enriched/Limits/HasConicalLimits.lean,Mathlib/CategoryTheory/Enriched/Limits/IsConicalLimit.lean | 3 | 3 | ['github-actions', 'joelriou', 'mathlib4-dependent-issues-bot'] | nobody | 2 months ago | 407 days ago | 13 minutes |
| 20401 | RemyDegenne | feat: add sigmaFinite_iUnion | ```lean lemma sigmaFinite_iUnion (μ : Measure α) {s : ℕ → Set α} (h_meas : MeasurableSet (⋃ n, s n)) [∀ n, SigmaFinite (μ.restrict (s n))] : SigmaFinite (μ.restrict (⋃ n, s n)) ``` --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-measure-probability | 37/28 | Mathlib/MeasureTheory/Decomposition/Exhaustion.lean,Mathlib/MeasureTheory/Measure/Typeclasses.lean | 2 | 6 | ['RemyDegenne', 'github-actions', 'sgouezel', 'urkud'] | nobody | 2 months ago | 483 days ago | 20 hours |
| 11500 | mcdoll | refactor(Topology/Algebra/Module/WeakDual): Clean up | - Move `Dual` and `dualPairing` lower in the import-hierachy - deduplicate `dualPairing` - Bundle continuity statements to `CLM`s. - Make `WeakDual` and `WeakSpace` reducible - Remove `refine'` in favor of `refine` --- Cleaning up `Analysis/NormedSpace/WeakDual` will be done in a second PR [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 227/179 | Mathlib.lean,Mathlib/Analysis/Fourier/RiemannLebesgueLemma.lean,Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/Dual.lean,Mathlib/Analysis/LocallyConvex/Polar.lean,Mathlib/Analysis/NormedSpace/Dual.lean,Mathlib/Analysis/NormedSpace/WeakDual.lean,Mathlib/Analysis/VonNeumannAlgebra/Basic.lean,Mathlib/MeasureTheory/Function/AEEqOfIntegral.lean,Mathlib/MeasureTheory/Measure/FiniteMeasure.lean,Mathlib/Topology/Algebra/Module/CharacterSpace.lean,Mathlib/Topology/Algebra/Module/Dual.lean,Mathlib/Topology/Algebra/Module/WeakDual.lean,docs/overview.yaml,docs/undergrad.yaml | 15 | 16 | ['ADedecker', 'grunweg', 'j-loreaux', 'kkytola', 'mathlib-bors', 'mcdoll', 'urkud'] | nobody | 2 months ago | 724 days ago | 46 days |
| 20428 | madvorak | feat(Data/Sign): lemmas about `∈ Set.range SignType.cast` | --- Perhaps `in_set_range_singType_cast_iff_abs` needs to be moved somewhere downstream. | merge-conflict WIP t-data | 40/0 | Mathlib/Data/Sign.lean | 1 | 13 | ['eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'madvorak', 'urkud'] | nobody | 2 months ago | unknown | 0 seconds |
| 16553 | grunweg | WIP: tinkering with orientable manifolds | - wait for #33307 to get merged - PR the "normed space" part separately - WIP: a linear isomorphism on a connected set is either orientation-preserving or orientation-preserving: some form of this was merged into mathlib recently; TODO update this PR accordingly! - [ ] depends on: #33307 - [x] depends on: #8738 --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-differential-geometry blocked-by-other-PR | 287/0 | Mathlib.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/Geometry/Manifold/Orientable.lean | 3 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 2 months ago | unknown | 0 seconds |
| 24965 | erdOne | refactor: Make `IsLocalHom` take unbundled map | Under the current definition, `IsLocalHom f` and `IsLocalHom f.toMonoidHom` are not defeq, which causes quite some annoyances. We also have a consensus to not use `*HomClass` in definitions. As a result, we change `IsLocalHom` to take an unbundled function instead of a funlike. --- [](https://gitpod.io/from-referrer/) | t-algebra delegated merge-conflict | 18/9 | Mathlib/Algebra/Group/Units/Hom.lean,Mathlib/AlgebraicGeometry/Scheme.lean,Mathlib/Geometry/RingedSpace/LocallyRingedSpace.lean,Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/RingTheory/LocalRing/ResidueField/Basic.lean | 5 | 15 | ['adomani', 'alreadydone', 'erdOne', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vihdzp'] | mattrobball | 2 months ago | 164 days ago | 24 days |
| 25622 | eric-wieser | refactor: overhaul instances on LocalizedModule | This: * Generalizes the `SMul`, `Module`, and `Algebra` instances via appropriate compatibility conditions * Generalizes the `Mul` instance to the non-unital setting * Fixes instances diamonds for the `Nat`- and `Int`-actions --- [](https://gitpod.io/from-referrer/) | t-algebra merge-conflict | 214/100 | Mathlib/Algebra/Module/LocalizedModule/Basic.lean | 1 | 6 | ['erdOne', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts'] | nobody | 2 months ago | 107 days ago | 9 minutes |
| 12933 | grunweg | chore: replace some use of > or ≥ by < or ≤ | These were flagged by the linter in #12879: it is easy to simple avoid > or ≥ in hypotheses or `have`s. --- - [x] depends on: #35346 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author | 123/123 | Archive/Imo/Imo1960Q1.lean,Archive/Imo/Imo1962Q1.lean,Archive/Imo/Imo1988Q6.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q4.lean,Archive/Imo/Imo2011Q5.lean,Archive/Imo/Imo2019Q4.lean,Archive/Wiedijk100Theorems/AreaOfACircle.lean,Archive/Wiedijk100Theorems/BallotProblem.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Algebra/Order/CauSeq/BigOperators.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/Algebra/Polynomial/Degree/Definitions.lean,Mathlib/Algebra/Star/CHSH.lean,Mathlib/Analysis/Analytic/Basic.lean,Mathlib/Analysis/Calculus/UniformLimitsDeriv.lean,Mathlib/Analysis/Complex/Hadamard.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection.lean,Mathlib/Analysis/Normed/Group/ControlledClosure.lean,Mathlib/Analysis/SpecialFunctions/Log/Base.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Basic.lean,Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/FP/Basic.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finsupp/Notation.lean,Mathlib/Data/Nat/Dist.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Nat/Parity.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/UInt.lean,Mathlib/GroupTheory/Coxeter/Length.lean,Mathlib/MeasureTheory/Constructions/Polish.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Covering/VitaliFamily.lean,Mathlib/MeasureTheory/Integral/Layercake.lean,Mathlib/NumberTheory/LegendreSymbol/JacobiSymbol.lean,Mathlib/NumberTheory/Padics/Hensel.lean,Mathlib/NumberTheory/Padics/PadicNorm.lean,Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Rayleigh.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/Tactic/CancelDenoms/Core.lean,Mathlib/Tactic/IntervalCases.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/NormNum/GCD.lean,Mathlib/Tactic/NormNum/Inv.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Topology/Category/Profinite/Nobeling.lean,Mathlib/Topology/ContinuousFunction/Bounded.lean,Mathlib/Topology/MetricSpace/CauSeqFilter.lean,Mathlib/Topology/Sequences.lean,test/LibrarySearch/basic.lean,test/Use.lean,test/cancel_denoms.lean,test/linarith.lean,test/norm_cast.lean | 64 | 7 | ['YaelDillies', 'github-actions', 'grunweg', 'mathlib-dependent-issues'] | nobody | 2 months ago | 715 days ago | 15 hours |
| 20238 | maemre | feat(Computability/DFA): Closure of regular languages under some set operations | This shows that regular languages are closed under complement and intersection by constructing DFAs for them. --- Closure under all other operations will be proved when someone adds the proof for DFA<->regular expression equivalence, so they are not part of this PR. [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 159/0 | Mathlib/Computability/DFA.lean,Mathlib/Computability/Language.lean | 2 | 60 | ['EtienneC30', 'YaelDillies', 'github-actions', 'maemre', 'mathlib4-merge-conflict-bot', 'meithecatte', 'urkud'] | nobody | 2 months ago | 410 days ago | 48 days |
| 22361 | rudynicolop | feat(Computability/NFA): nfa closure properties | Add the closure properties union, intersection and reversal for NFA. --- [](https://gitpod.io/from-referrer/) | new-contributor t-computability merge-conflict awaiting-author awaiting-zulip | 218/2 | Mathlib/Computability/Language.lean,Mathlib/Computability/NFA.lean | 2 | 91 | ['EtienneC30', 'b-mehta', 'ctchou', 'github-actions', 'leanprover-community-bot-assistant', 'meithecatte', 'rudynicolop'] | nobody | 2 months ago | 361 days ago | 39 days |
| 23929 | meithecatte | feat(Computability/NFA): improve bound on pumping lemma | --- - [x] depends on: #25321 [](https://gitpod.io/from-referrer/) | t-computability awaiting-zulip new-contributor awaiting-author | 101/10 | Mathlib/Computability/EpsilonNFA.lean,Mathlib/Computability/NFA.lean | 2 | 42 | ['YaelDillies', 'dagurtomas', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'meithecatte'] | nobody | 2 months ago | 327 days ago | 34 days |
| 8102 | miguelmarco | feat(Tactic): add `unify_denoms` and `collect_signs` tactics | This PR adds four new tactics: - `unify_denoms` tries to put expressions with several divisions in a form with only one division. In the case of fields, it works similarly to `field_simp`, but if the hypothesis about denominators being nonzero are not present, it assumes them, and leaves them as new goals to prove. In that sense, it is an "unsafe" tactic (but can be useful nevertheless, for example when you can't find which exact hypothesis is missing). It also works with expressions of naturals and Euclidean domains, assuming the corresponding hypothesis about the denominators dividing the numerators. - `unify_denoms!` extends `unify_denoms` to work with (in)equalities, assuming also that the denominators, once in normal form, are positive. - `collect_signs` works similarly with expressions using sums and substractions: it tries to put them in a form of one sum minus other sum. In the case of working with naturals, it assumes that we never substract a bigger number from a smaller one. Both are implemented essentially as a macro that combines several rewriting rules. Some new lemmas with the corresponding rules are added. --- | please-adopt new-contributor merge-conflict modifies-tactic-syntax good first issue t-meta | 407/0 | Mathlib.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CollectSigns.lean,Mathlib/Tactic/UnifyDenoms.lean,MathlibTest/unify_denoms.lean,scripts/noshake.json | 7 | 55 | ['Paul-Lez', 'YaelDillies', 'github-actions', 'joneugster', 'kbuzzard', 'mathlib4-merge-conflict-bot', 'miguelmarco'] | nobody | 2 months ago | 352 days ago | 17 days |
| 15355 | adomani | feat: MiM PR report | --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 193/0 | .github/workflows/monthly_pr_report.yaml,scripts/README.md,scripts/find_labels.sh | 3 | 18 | ['YaelDillies', 'adomani', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | unknown | 0 seconds |
| 22464 | adomani | feat(CI): declarations diff in Lean | Rewrites the `declaration_diff` script in Lean. You can see the effect of the new script in the testing branch #22497. The new CI step runs in approximately 5mins, but is separate from the `build` step. --- [](https://gitpod.io/from-referrer/) | awaiting-author CI merge-conflict | 151/0 | .github/workflows/PR_summary_lean.yml,scripts/README.md,scripts/declarations_diff.lean,scripts/declarations_diff_lean_shell_glue.sh | 4 | 8 | ['bryangingechen', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 276 days ago | 146 days |
| 35547 | Ruben-VandeVelde | chore: tidy various files | --- As usual, `simp`s didn't seem slow. [](https://gitpod.io/from-referrer/) | awaiting-author merge-conflict | 83/117 | Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/LinearRecurrence.lean,Mathlib/Algebra/Order/Ring/Unbundled/Basic.lean,Mathlib/AlgebraicGeometry/AffineScheme.lean,Mathlib/AlgebraicGeometry/Morphisms/Smooth.lean,Mathlib/AlgebraicGeometry/Properties.lean,Mathlib/AlgebraicGeometry/ZariskisMainTheorem.lean,Mathlib/Analysis/Complex/CoveringMap.lean,Mathlib/Analysis/Complex/MeanValue.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/Data/NNReal/Basic.lean,Mathlib/Data/Set/Dissipate.lean,Mathlib/Data/Set/PowersetCard.lean,Mathlib/Geometry/Euclidean/Angle/Bisector.lean,Mathlib/LinearAlgebra/DirectSum/Finsupp.lean,Mathlib/LinearAlgebra/JordanChevalley.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/Measure/SubFinite.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Indexed.lean,Mathlib/Probability/Distributions/Cauchy.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Polynomial/Subring.lean,Mathlib/RingTheory/Smooth/IntegralClosure.lean,Mathlib/RingTheory/UniqueFactorizationDomain/ClassGroup.lean,Mathlib/RingTheory/Unramified/LocalStructure.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Corecursion.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Majorized.lean,Mathlib/Topology/Algebra/IsUniformGroup/Defs.lean,Mathlib/Topology/Algebra/MulAction.lean | 32 | 14 | ['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'vihdzp'] | nobody | 1 month ago | 70 days ago | 18 hours |
| 8479 | alexjbest | feat: use leaff in CI | [Leaff](https://github.com/alexjbest/leaff) is an experimental lean-diff tool, this PR is to experiment with adding it as a CI step. --- I'm not sure yet if it is best to have this always run or only run on request (like bench). If it is always run should it post a comment or simply leave its output it the actions log (maybe as a summary object) the current iteration runs and updates a sticky comment with the latest result [](https://gitpod.io/from-referrer/) | merge-conflict WIP awaiting-author | 340/0 | .github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build.yml.in,.github/workflows/build_fork.yml | 4 | 13 | ['alexjbest', 'fpvandoorn', 'github-actions', 'grunweg', 'kim-em', 'mathlib-bors', 'urkud'] | nobody | 1 month ago | 896 days ago | 26 seconds |
| 13483 | adomani | feat: automatically replace deprecations | This PR introduces `lake exe update_deprecations` that uses the cache to automatically replace deprecated declarations with the corresponding un-deprecated one. The script handles namespacing, replacing a possibly non-fully-qualified, deprecated name with the fully-qualified non-deprecated name. It is also possible to use ```bash lake exe update_deprecations --mods One.Two.Three,Dd.Ee.Ff ``` to limit the scope of the replacements to the modules `One.Two.Three` and `Dd.Ee.Ff`. This is intended to be a first step in automating updates: combining this with a linter that emits appropriate warnings, the functionality of `lake exe update_deprecations` can be extended to perform more complicated updates. --- [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-meta | 306/0 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/UpdateDeprecations.lean,MathlibTest/UpdateDeprecations.lean,lakefile.lean,scripts/README.md,scripts/update_deprecations.lean | 7 | 18 | ['YaelDillies', 'adomani', 'fpvandoorn', 'github-actions', 'j-loreaux', 'jcommelin', 'leanprover-community-bot-assistant', 'mathlib-bors', 'sgouezel'] | joneugster | 1 month ago | 536 days ago | 34 days |
| 14313 | grhkm21 | feat(RepresentationTheory/FdRep): FdRep is a full subcategory of Rep | ``` /-- Equivalence between `FDRep` and the full subcategory of finite dimensional `Rep`. -/ def equivFiniteDimensional : FDRep k G ≌ FullSubcategory (fun V : Rep k G ↦ FiniteDimensional k V) ``` | merge-conflict t-algebra t-category-theory new-contributor | 47/8 | Mathlib/RepresentationTheory/FDRep.lean | 1 | 21 | ['fpvandoorn', 'github-actions', 'grhkm21', 'joelriou', 'kim-em', 'mathlib-bors'] | nobody | 1 month ago | 648 days ago | 4 days |
| 14712 | astrainfinita | perf: change instance priority and order about `OfNat` | --- [](https://gitpod.io/from-referrer/) | merge-conflict slow-typeclass-synthesis t-algebra | 49/20 | Mathlib/Algebra/Group/Nat.lean,Mathlib/Algebra/Group/ZeroOne.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Data/BitVec.lean,Mathlib/Data/Nat/Cast/Defs.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/UInt.lean,Mathlib/NumberTheory/ArithmeticFunction.lean | 9 | 26 | ['MichaelStollBayreuth', 'astrainfinita', 'eric-wieser', 'fpvandoorn', 'github-actions', 'j-loreaux', 'leanprover-bot', 'mathlib-bors'] | nobody | 1 month ago | 631 days ago | 20 days |
| 17627 | hrmacbeth | feat: universal properties of vector bundle constructions | Characterizations for the smoothness of maps into the total spaces of (1) the direct sum of two vector bundles; (2) the pullback of a vector bundle. This gap in the library was exposed by #17358. --- - [x] depends on: #22804 [](https://gitpod.io/from-referrer/) | merge-conflict t-differential-geometry | 311/9 | Mathlib/Data/Bundle.lean,Mathlib/Geometry/Manifold/VectorBundle/Basic.lean,Mathlib/Geometry/Manifold/VectorBundle/Pullback.lean,Mathlib/Topology/FiberBundle/Constructions.lean | 4 | 26 | ['PatrickMassot', 'fpvandoorn', 'github-actions', 'grunweg', 'hrmacbeth', 'j-loreaux', 'leanprover-community-bot-assistant', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'sgouezel'] | grunweg | 1 month ago | 316 days ago | 91 days |
| 19275 | eric-wieser | fix: if nolint files change, do a full rebuild | Otherwise CI will succeed when removing entries from the file, but fail later when someone changes something unrelated. --- [](https://gitpod.io/from-referrer/) | merge-conflict | 8/0 | lakefile.lean | 1 | 22 | ['YaelDillies', 'adomani', 'eric-wieser', 'fpvandoorn', 'github-actions', 'grunweg', 'mathlib-bors'] | nobody | 1 month ago | 527 days ago | 3 minutes |
| 24434 | joelriou | feat(CategoryTheory): effectiveness of descent | (This is very much a draft, it will be split in multiple PRs later.) Co-authored-by: Christian Merten [christian@merten.dev](mailto:christian@merten.dev) --- - [ ] depends on: #35452 - [ ] depends on: #35393 - [ ] depends on: #35396 - [ ] depends on: #35401 - [x] depends on: #24411 - [x] depends on: #24382 - [x] depends on: #25971 - [x] depends on: #13539 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-category-theory | 4052/66 | Mathlib.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Adj.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/BaseChange.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Basic.lean,Mathlib/CategoryTheory/Bicategory/Adjunction/Mate.lean,Mathlib/CategoryTheory/Bicategory/Functor/Cat.lean,Mathlib/CategoryTheory/Bicategory/Functor/LocallyDiscrete.lean,Mathlib/CategoryTheory/Bicategory/Functor/Strict.lean,Mathlib/CategoryTheory/Bicategory/Opposite.lean,Mathlib/CategoryTheory/CommSq.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/CommSq.lean,Mathlib/CategoryTheory/Sites/Descent/DescentData.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataAsCoalgebra.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataDoublePrime.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataPrime.lean,Mathlib/CategoryTheory/Sites/Descent/IsPrestack.lean,Mathlib/CategoryTheory/Sites/Descent/IsStack.lean,Mathlib/CategoryTheory/Sites/Descent/ModuleCat.lean,Mathlib/CategoryTheory/Sites/Descent/PullbackStruct.lean | 19 | 23 | ['alreadydone', 'callesonne', 'chrisflav', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib-dependent-issues', 'yuma-mizuno'] | nobody | 1 month ago | unknown | 0 seconds |
| 14603 | awueth | feat: degree is invariant under graph isomorphism | --- Mathlib has the definition `SimpleGraph.Iso.mapNeighborSet` which is an equivalence between neighbor sets induced by an isomorphism. Would it be beneficial to add the same equivalence for `neighborFinset`? [](https://gitpod.io/from-referrer/) | WIP t-combinatorics new-contributor | 24/0 | Mathlib/Combinatorics/SimpleGraph/Map/Finite.lean | 1 | 12 | ['SnirBroshi', 'awueth', 'github-actions', 'jcommelin', 'kim-em', 'urkud'] | nobody | 1 month ago | 627 days ago | 31 days |
| 9605 | davikrehalt | feat(Data/Finset & List): Add Lemmas for Sorting and Filtering | This PR includes several useful lemmas to the Data/Finset and Data/List modules in Lean's mathlib: 1. `toFinset_filter` (List): Shows that filtering commutes with toFinset. 2. `toFinset_is_singleton_implies_replicate` (List): Shows a list with a singleton toFinset is a List.replicate. 3. `filter_sort_commute` (Finset): Sorting and filtering can be interchanged in Finsets. 4. `Sorted.filter` (List): A sorted list stays sorted after filtering. 5. `Sorted.append_largest` (List): Appending the largest element keeps a list sorted. 6. `sort_monotone_map` (Finset): Relates sorting of a Finset after mapping to sorting of a list. 7. `sort_insert_largest` (Finset): Sorting a Finset with an inserted largest element. 8. `sort_range` (Finset): Sorting a range in a Finset equals the corresponding range list. 9. ~~`filter_eval_true` (List): Filtering a list with a predicate always true keeps the list unchanged.~~ 10. ~~`filter_eval_false` (List): Filtering with an always-false predicate gives an empty list.~~ 11. ~~`pairwise_concat` (List): Iff condition for Pairwise relation in concatenated lists (similar to pairwise_join).~~ 12. `list_map_toFinset` (Finset): toFinset commutes with map under injection --- - [x] depends on: #15952 This is my first PR to mathlib, so I'm not too familiar with etiquette's and more specifically there are two proofs in the PR which uses aesop, and I am not sure if it's frowned upon. I kept the aesop in there for now as I couldn't construct very short proofs otherwise. The sort_range function proof was suggested in https://leanprover.zulipchat.com/#narrow/stream/113489-new-members/topic/Computing.20Finset.20sort.20of.20Finset.20range/near/410346731 by Ruben Van de Velde. Thanks for your time for improving this PR. | please-adopt t-data new-contributor merge-conflict awaiting-author | 71/0 | Mathlib/Data/Finset/Basic.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Sort.lean,Mathlib/Data/List/Sort.lean | 4 | 30 | ['YaelDillies', 'davikrehalt', 'eric-wieser', 'github-actions', 'jcommelin', 'urkud', 'vihdzp'] | nobody | 1 month ago | 830 days ago | 12 days |
| 10332 | adri326 | feat(Topology/Sets): define regular open sets and their boolean algebra | Introduces a new module, `Mathlib.Topology.Sets.RegularOpens`, which defines the `IsRegularOpen s` predicate (`interior (closure s) = s`) and `TopologicalSpace.RegularOpens`, the type of bundled regular open sets (defined as `Heyting.Regular (Opens X)`). A few properties of regular open sets (bundled and unbundled) and `interior (closure s)` are proven, and a pointwise instance of `MulAction` is provided for regular open sets. --- This PR belongs to my series of PRs around my formalization of Rubin's theorem. There are two possible ways to implement `RegularOpens`: - either construct them by hand and show that they form a boolean algebra (better def-eq but more boilerplate code required) - or use `Heyting.Regular` on the heyting algebra of `Opens` inherited from the `Frame` instance on them I first chose to use the former approach, but using the latter cuts the length of the construction of the boolean algebra of regular open sets by 100 lines of code, and allows us to inherit all of the helper lemmas defined for `Heyting.Regular`. The big downside, though, is that an element of `RegularOpens` isn't defined as a bundled regular open set anymore, but rather as an `Opens` set `s` for which `Opens.interior ↑(Opens.interior ↑sᶜ)ᶜ = s`, so I added an alternative constructor `RegularOpens.of` that instead accepts any set `s` for which `IsRegularOpen s` holds. Another minor downside is that coercion to a set takes two coercions instead of one. [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-topology | 434/0 | Mathlib.lean,Mathlib/Data/Set/Pointwise/SMul.lean,Mathlib/Topology/Sets/Opens.lean,Mathlib/Topology/Sets/RegularOpens.lean,docs/references.bib | 5 | 1 | ['adri326'] | nobody | 1 month ago | 814 days ago | 18 minutes |
| 15720 | znssong | feat(SimpleGraph): The Bondy-Chvátal theorem | The proof of the Bondy-Chvátal theorem, with Dirac's theorem and Ore's theorem as its corollary. - [x] depends on: #15536 - [ ] depends on: #15711 - [ ] depends on: #15578 | merge-conflict blocked-by-other-PR t-combinatorics new-contributor | 903/3 | Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/BondyChvatal.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Path.lean,Mathlib/Combinatorics/SimpleGraph/Walk.lean,Mathlib/Dynamics/FixedPoints/Basic.lean,Mathlib/Dynamics/FixedPoints/Increasing.lean | 8 | 3 | ['github-actions', 'grunweg'] | nobody | 1 month ago | 627 days ago | 29 minutes |
| 16801 | awainverse | feat(ModelTheory/Equivalence): The quotient type of formulas modulo a theory | Defines `FirstOrder.Language.Theory.Formula`: `T.Formula α` is the quotient of `L.Formula α` by equivalence modulo a theory `T`. Puts a boolean algebra instance on `T.Formula α`, with `≤` corresponding to implication. --- - [x] depends on: #16799 - [x] depends on: #16800 [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-logic | 174/60 | Mathlib/ModelTheory/Complexity.lean,Mathlib/ModelTheory/Equivalence.lean,Mathlib/ModelTheory/Types.lean | 3 | 30 | ['YaelDillies', 'awainverse', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'metinersin'] | nobody | 1 month ago | 546 days ago | 29 days |
| 21616 | peabrainiac | feat(Topology): concatenating countably many paths | Adds `Path.countableConcat`, the concatenation of a sequence of paths leading up to some point `x`. --- - [x] depends on: #21591 - [x] depends on: #21607 This work is a prerequisite to #20248, where it is used to show that the topology of first-countable locally path-connected spaces is coinduced by all the paths in that space. [](https://gitpod.io/from-referrer/) | merge-conflict awaiting-author t-topology | 229/0 | Mathlib.lean,Mathlib/Topology/Path/CountableConcat.lean | 2 | 31 | ['YaelDillies', 'github-actions', 'kim-em', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'peabrainiac'] | nobody | 1 month ago | 376 days ago | 56 days |
| 22314 | shetzl | feat: add leftmost derivations for context-free grammars | Leftmost derivations are often easier to reason about than arbitrary derivations. This PR adds leftmost variants of Rewrites, Produces and Derives to the existing definition of context-free grammars and proves that a string of terminals can be derived iff it can be leftmost derived.
Co-authored-by: Tobias Leichtfried |
merge-conflict t-computability awaiting-author new-contributor | 383/0 | Mathlib.lean,Mathlib/Computability/LeftmostDerivation.lean | 2 | 55 | ['YaelDillies', 'github-actions', 'madvorak', 'mathlib4-merge-conflict-bot', 'shetzl'] | nobody | 1 month ago | 357 days ago | 72 days |
| 24690 | ScottCarnahan | feat(Data.Prod): reverse lexicographic order | This PR implements the type synonym RevLex as a one-field structure, defines an order on products, and proves an order isomorphism with the Lex product with factors switched. --- [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-order | 141/0 | Mathlib.lean,Mathlib/Data/Prod/RevLex.lean | 2 | 5 | ['ScottCarnahan', 'YaelDillies', 'github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 338 days ago | 19 days |
| 21342 | YaelDillies | refactor(Normed/Group/Quotient): generalise to non-abelian groups | The goal is to apply this to free groups, whose multiplication in either argument is an isometry, but isn't commutative. --- - [x] depends on: #21341 - [ ] depends on: #35037 [](https://gitpod.io/from-referrer/) | t-analysis | 97/70 | Mathlib/Analysis/Normed/Group/Quotient.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/Group/Quotient.lean,Mathlib/Topology/Bornology/BoundedOperation.lean | 6 | 12 | ['YaelDillies', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'sgouezel'] | sgouezel | 1 month ago | 47 days ago | 11 days |
| 19475 | YaelDillies | feat: group markings | From LeanCamCombi --- - [ ] depends on: #21342 [](https://gitpod.io/from-referrer/) | WIP t-algebra blocked-by-other-PR | 270/70 | Mathlib.lean,Mathlib/Analysis/Normed/Group/Quotient.lean,Mathlib/Analysis/Normed/Group/Uniform.lean,Mathlib/Geometry/Group/Marking.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Algebra/Group/Quotient.lean,Mathlib/Topology/Bornology/BoundedOperation.lean | 8 | 16 | ['YaelDillies', 'b-mehta', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 455 days ago | 22 days |
| 34195 | eric-wieser | feat: continuous bundled actions | These are `Continuous` versions of existing definitions. --- [](https://gitpod.io/from-referrer/) | t-topology t-algebra large-import | 64/0 | Mathlib/Topology/Algebra/ContinuousMonoidHom.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 43 days ago | 59 minutes |
| 35588 | eric-wieser | chore(Util/Qq): remove `meta` | These are wrappers of existing functions on `Expr`s which are also not marked `meta`. --- [](https://gitpod.io/from-referrer/) | t-meta awaiting-CI delegated | 7/7 | Mathlib/Data/Multiset/Sort.lean,Mathlib/Tactic/FieldSimp/Lemmas.lean,Mathlib/Tactic/NormNum/Core.lean,Mathlib/Tactic/Order/ToInt.lean,Mathlib/Tactic/Simproc/Divisors.lean,Mathlib/Tactic/Simproc/FinsetInterval.lean,Mathlib/Util/Qq.lean | 7 | 3 | ['Vierkantor', 'github-actions', 'mathlib-bors'] | nobody | 1 month ago | 69 days ago | 1 minute |
| 27225 | eric-wieser | refactor(Tactic/Lift): deprecate the third with argument | We already have a number of tactics where the clearing happens all the time, and you have to opt out with `id h`. This also fixes a bug where `lift z to Nat with n hn this_is_unused` would silently ignore `this_is_unused`. --- - [ ] depends on: #27223 [](https://gitpod.io/from-referrer/) | awaiting-author t-meta merge-conflict | 21/9 | Mathlib/Tactic/Lift.lean,MathlibTest/lift.lean | 2 | 9 | ['JovanGerb', 'adomani', 'eric-wieser', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'vihdzp'] | JovanGerb | 1 month ago | 272 days ago | 15 days |
| 29615 | eric-wieser | chore: add a computable shortcut for `AddCommMonoid ℂ` | --- [](https://gitpod.io/from-referrer/) | t-analysis easy | 9/1 | Mathlib/Analysis/Complex/Basic.lean | 1 | 1 | ['github-actions'] | nobody | 1 month ago | 230 days ago | 1 minute |
| 21495 | alreadydone | experiment: reducible HasQuotient.quotient' | --- [](https://gitpod.io/from-referrer/) | WIP merge-conflict | 2/0 | Mathlib/Algebra/Quotient.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 449 days ago | 3 minutes |
| 22366 | kim-em | feat: `check_equalities` tactic for diagnosing defeq problems | The `check_equalities` tactic, which checks the typing of equalities in the goal, reporting discrepancies between the implicit type argument of the equality, and the inferred types of the left and right hand sides, at "instances and reducible" transparency. Reports from this tactic do not necessarily indicate a problem, although typically `simp` should reduce rather than increase the reported discrepancies. `check_equalities` may be useful in diagnosing uses of `erw`. | t-meta please-adopt WIP | 123/4 | Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Basic.lean,Mathlib/Tactic/CategoryTheory/CheckCompositions.lean,Mathlib/Tactic/CheckEqualities.lean,Mathlib/Tactic/Common.lean,MathlibTest/check_equalities.lean | 7 | 21 | ['adomani', 'b-mehta', 'eric-wieser', 'fpvandoorn', 'github-actions', 'grunweg', 'kim-em', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] | adamtopaz | 1 month ago | 39 days ago | 32 days |
| 32473 | mattrobball | chore(Kaehler.JacobiZariski): remove egregious local instance hack | This code looks terrible and is no longer strictly necessary. Local timings give `lake build Mathlib/RingTheory/Kaehler/JacobiZariski.lean 39.77s user 1.07s system 263% cpu 15.482 total` after removal and `lake build Mathlib/RingTheory/Kaehler/JacobiZariski.lean 36.93s user 1.01s system 251% cpu 15.113 total` before the removal. So the preformance impact of removal is small. One could argue that keeping is a remainder that everything here needs to be seriously changed but the miminmal performance difference suggests that these local instances would be a red herring in that regard. --- [](https://gitpod.io/from-referrer/) | t-ring-theory awaiting-author merge-conflict | 0/4 | Mathlib/RingTheory/Kaehler/JacobiZariski.lean | 1 | 14 | ['chrisflav', 'erdOne', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'mattrobball'] | nobody | 1 month ago | 146 days ago | 1 day |
| 37232 | mathlib-splicebot | chore(Algebra/Order): bound on `|n / m|ₘ` and `|n - m|` | This PR was automatically created from PR #34722 by @GrigorenkoPV via a [review comment](https://github.com/leanprover-community/mathlib4/pull/34722#discussion_r2996870566) by @Vierkantor. | t-algebra delegated | 5/0 | Mathlib/Algebra/Order/Group/Unbundled/Abs.lean | 1 | 6 | ['Vierkantor', 'bryangingechen', 'github-actions', 'mathlib-bors'] | nobody | 1 month ago | 36 days ago | 9 minutes |
| 20719 | gio256 | feat(AlgebraicTopology): delaborators for truncated simplicial notations | We add delaborators for the following notations, introduced in #20688: - `⦋m⦌ₙ`, which denotes the `m`-dimensional simplex in the `n`-truncated simplex category. - `X _⦋m⦌ₙ`, which denotes the `m`-th term of an `n`-truncated simplicial object `X`. - `X ^⦋m⦌ₙ`, which denotes the `m`-th term of an `n`-truncated cosimplicial object `X`. If `pp.proofs` is set to `true`, we also pretty-print the proof `p : m ≤ n` for all three notations as `⦋m, p⦌ₙ`, `X _⦋m, p⦌ₙ`, and `X ^⦋m, p⦌ₙ`, respectively. Credit to @kmill for one piece of code and much metaprogramming inspiration. --- - [x] depends on: #20688 - [x] depends on: #23018 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-topology infinity-cosmos t-meta please-adopt will-close-soon | 525/33 | Mathlib.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/Defs.lean,Mathlib/AlgebraicTopology/SimplicialObject/Basic.lean,Mathlib/Tactic.lean,Mathlib/Tactic/SimplexCategory.lean,Mathlib/Util/Superscript.lean,MathlibTest/SimplexCategory.lean,MathlibTest/SimplicialObject.lean,MathlibTest/superscript.lean,scripts/noshake.json | 11 | 24 | ['eric-wieser', 'gio256', 'github-actions', 'joneugster', 'kim-em', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 284 days ago | 88 days |
| 21476 | grunweg | feat(lint-style): enable running on downstream projects | Enable lint-style to run on downstream projects, by making the following modifications: - allow passing an explicit list of libraries to lint: if nothing is passed, it lints `Mathlib`, `Archive` and `Counterexamples` (as before); otherwise, it lints precisely the passed modules - only check init imports, undocumented scripts and the errors from `lint-style.py` when linting Mathlib - make the style exceptions file configurable and optional: using the `nolints-file` flag, the exceptions file can be configured. If the flag is omitted, we try to find a file at `scripts/nolints-style.txt` --- and otherwise proceed with no style exceptions. This means mathlib can continue unchanged, and downstream projects can either add an explicit exceptions file, or proceed without any exceptions. After this PR, one should be able to run lint-style on a downstream project by `lake exe lint-style ProjectName`. Prompted by [this zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/lint-style.20for.20downstream.20libraries). --- - [x] depends on: #24570 - [x] depends on: #24953 (I did not test the last part.) [](https://gitpod.io/from-referrer/) | merge-conflict t-linter awaiting-author please-adopt | 58/19 | Mathlib/Tactic/Linter/TextBased.lean,scripts/lint-style.lean | 2 | 21 | ['Vierkantor', 'adomani', 'github-actions', 'grunweg', 'joneugster', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot'] | nobody | 1 month ago | 350 days ago | 43 days |
| 36706 | kim-em | feat(Tactic/FastInstance): warn when a synthesized sub-instance has leaky binder types | This PR adds a warning to `fast_instance%` and `inferInstanceAs%` when they encounter a synthesized sub-instance that has leaky data-field binder types. When `fast_instance%` recursively normalizes a class instance, it uses `trySynthInstance` to find canonical sub-instances. If a found sub-instance is not canonical at instances transparency (i.e., its internal lambda binder types reference an unexpanded type alias instead of the target carrier), the tool now emits a warning: ``` fast_instance%: 'leakySub' (for SubClass MyNat) has leaky data-field binder types, which may cause `isDefEq` failures at instances transparency (e.g. in `grind`). Consider redefining it with `fast_instance%` or `inferInstanceAs%`. To suppress: `set_option Elab.fast_instance.warnLeakySubInstances false` ``` The leakiness check uses `withDisabledInstance` to temporarily evict the sub-instance from the discrimination tree (preventing trivial self-match via `trySynthInstance`), then compares against the canonical form at instances transparency. A `warnLeaky` parameter propagates through recursive calls to prevent nested warnings. The warning is suppressed via `set_option Elab.fast_instance.warnLeakySubInstances false`. - [ ] depends on: #36701 🤖 Prepared with Claude Code | t-meta blocked-by-other-PR large-import LLM-generated merge-conflict | 415/21 | Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/Init.lean,Mathlib/RingTheory/Congruence/Defs.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Defs.lean,Mathlib/Tactic/DefEqAbuse.lean,Mathlib/Tactic/FastInstance.lean,MathlibTest/CheckInstance.lean,MathlibTest/DefEqAbuse.lean,MathlibTest/InferInstanceAsPercent.lean | 11 | 7 | ['Vierkantor', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | Vierkantor | 1 month ago | 46 days ago | 16 minutes |
| 11964 | adamtopaz | feat: The functor of points of a scheme | We construct the functor of points functor, and prove that it's full and faithful. --- - [x] depends on: #11947 [](https://gitpod.io/from-referrer/) | merge-conflict t-algebraic-geometry t-category-theory | 210/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/FunctorOfPoints.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean | 3 | 4 | ['github-actions', 'grunweg'] | nobody | 28 days ago | 749 days ago | 20 minutes |
| 24665 | Komyyy | feat(Mathlib/Topology/Metrizable/Uniformity): every uniform space is generated by a family of pseudometrics | --- [](https://gitpod.io/from-referrer/) | WIP t-topology | 55/0 | Mathlib/Topology/Metrizable/Uniformity.lean | 1 | 2 | ['github-actions', 'mathlib4-merge-conflict-bot'] | nobody | 26 days ago | 358 days ago | 1 second |
| 24957 | eric-wieser | feat: use ` binderNameHint` in sum_congr | Zulip thread: [#new members > Choosing dummy variable inside summation @ 💬](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Choosing.20dummy.20variable.20inside.20summation/near/518492888)
Co-authored-by: Joachim Breitner |
t-algebra merge-conflict | 23/16 | Mathlib/Algebra/BigOperators/Expect.lean,Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean,Mathlib/Analysis/BoxIntegral/Partition/Basic.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finset/Lattice/Fold.lean,Mathlib/Data/List/OfFn.lean,Mathlib/Data/Multiset/Count.lean,Mathlib/Data/Multiset/Filter.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Option/Basic.lean,Mathlib/Data/Set/Image.lean,Mathlib/Data/Sym/Basic.lean,Mathlib/Data/Sym/Sym2.lean | 13 | 2 | ['github-actions', 'mathlib-merge-conflicts'] | nobody | 22 days ago | 350 days ago | 14 minutes |
| 6777 | adomani | chore(Co*variantClass): replace eta-expanded (· * ·), (· + ·), (· ≤ ·), (· < ·) | Replace `CovariantClass X X (· * ·) (· ≤ ·)` with -> `CovariantClass X X HMul.hMul LE.le` and similarly for `HAdd`, `LT`, `Contravariant`.
This PR is inspired by [Issue #6646](https://github.com/leanprover-community/mathlib4/issues/6646) and, more specifically, [this comment](https://github.com/leanprover-community/mathlib4/issues/6646#issuecomment-1692792066).
Note that https://github.com/leanprover/lean4/pull/2267 would make this unnecessary
---
```bash
# First sed command:
# the first captured pattern is `Co*variantClass |
merge-conflict | 703/678 | Counterexamples/ZeroDivisorsInAddMonoidAlgebras.lean,Mathlib/Algebra/BigOperators/Basic.lean,Mathlib/Algebra/Bounds.lean,Mathlib/Algebra/CovariantAndContravariant.lean,Mathlib/Algebra/DirectSum/Internal.lean,Mathlib/Algebra/Group/UniqueProds.lean,Mathlib/Algebra/GroupPower/Order.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Archimedean.lean,Mathlib/Algebra/Order/Group/Abs.lean,Mathlib/Algebra/Order/Group/Defs.lean,Mathlib/Algebra/Order/Group/DenselyOrdered.lean,Mathlib/Algebra/Order/Group/MinMax.lean,Mathlib/Algebra/Order/Group/OrderIso.lean,Mathlib/Algebra/Order/Hom/Monoid.lean,Mathlib/Algebra/Order/Interval.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/Algebra/Order/LatticeGroup.lean,Mathlib/Algebra/Order/Module.lean,Mathlib/Algebra/Order/Monoid/Basic.lean,Mathlib/Algebra/Order/Monoid/Cancel/Defs.lean,Mathlib/Algebra/Order/Monoid/Canonical/Defs.lean,Mathlib/Algebra/Order/Monoid/Defs.lean,Mathlib/Algebra/Order/Monoid/Lemmas.lean,Mathlib/Algebra/Order/Monoid/MinMax.lean,Mathlib/Algebra/Order/Monoid/NatCast.lean,Mathlib/Algebra/Order/Monoid/OrderDual.lean,Mathlib/Algebra/Order/Monoid/Prod.lean,Mathlib/Algebra/Order/Monoid/WithTop.lean,Mathlib/Algebra/Order/Monoid/WithZero/Basic.lean,Mathlib/Algebra/Order/Monoid/WithZero/Defs.lean,Mathlib/Algebra/Order/Nonneg/Ring.lean,Mathlib/Algebra/Order/Pointwise.lean,Mathlib/Algebra/Order/Positive/Ring.lean,Mathlib/Algebra/Order/Ring/Canonical.lean,Mathlib/Algebra/Order/Ring/Defs.lean,Mathlib/Algebra/Order/Ring/Lemmas.lean,Mathlib/Algebra/Order/Sub/Basic.lean,Mathlib/Algebra/Order/Sub/Canonical.lean,Mathlib/Algebra/Order/Sub/Defs.lean,Mathlib/Algebra/Order/WithZero.lean,Mathlib/Algebra/Parity.lean,Mathlib/Algebra/Star/Order.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Analysis/Normed/Order/Lattice.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/DFinsupp/Order.lean,Mathlib/Data/Finset/Fold.lean,Mathlib/Data/Finsupp/Lex.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/List/BigOperators/Basic.lean,Mathlib/Data/List/BigOperators/Lemmas.lean,Mathlib/Data/Multiset/Basic.lean,Mathlib/Data/Nat/Cast/Order.lean,Mathlib/Data/PNat/Basic.lean,Mathlib/Data/Real/ENNReal.lean,Mathlib/Data/Real/NNReal.lean,Mathlib/Data/Set/Semiring.lean,Mathlib/Data/Sign.lean,Mathlib/MeasureTheory/Function/LpOrder.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/VectorMeasure.lean,Mathlib/Order/ConditionallyCompleteLattice/Group.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Pointwise.lean,Mathlib/Probability/Martingale/Basic.lean,Mathlib/Probability/Process/Stopping.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Game/Basic.lean,Mathlib/SetTheory/Game/PGame.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/NaturalOps.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/Positivity/Basic.lean,Mathlib/Topology/ContinuousFunction/Algebra.lean,lean-toolchain,test/Recall.lean,test/propose.lean | 81 | 37 | ['adomani', 'alreadydone', 'digama0', 'eric-wieser', 'ericrbg', 'jcommelin', 'leanprover-bot', 'sgouezel', 'vihdzp'] | nobody | 14 days ago | 914 days ago | 35 days |
| 34501 | eric-wieser | chore(Data/Fintype/Induction): add a workaround for a bug in `induction` | This works around leanprover/lean4#4246, as Zulip threads frequently run up against this. --- [](https://gitpod.io/from-referrer/) | awaiting-author t-meta please-adopt | 15/1 | Mathlib/Data/Fintype/Option.lean | 1 | 3 | ['github-actions', 'joneugster'] | joneugster | 14 days ago | 91 days ago | 2 days |
| 37432 | mariainesdff | feat(Algebra/BigOperators/NatAntidiagonal): add ofAdd_antidiagonal | Co-authored by: @xgenereux. --- [](https://gitpod.io/from-referrer/) | t-algebra awaiting-author | 27/0 | Mathlib/Algebra/BigOperators/NatAntidiagonal.lean | 1 | 2 | ['dagurtomas', 'github-actions'] | dagurtomas | 10 days ago | 21 days ago | 9 days |
| 34075 | eric-wieser | feat: add a typeclass for the continuum hypothesis | This allows a proof from the Archive to be promoted to mathlib itself. The proof strategy of `iff_exists_sierpinski_pathological_pred` was written almost entirely with public Gemini 3 Thinking, and then manually corrected. --- [](https://gitpod.io/from-referrer/) | t-set-theory merge-conflict | 204/58 | Counterexamples/Phillips.lean,Mathlib.lean,Mathlib/SetTheory/Cardinal/ContinuumHypothesis.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean | 4 | 27 | ['b-mehta', 'eric-wieser', 'github-actions', 'grunweg', 'mathlib-merge-conflicts', 'plp127', 'vihdzp'] | nobody | 7 days ago | 20 days ago | 12 hours |
| 36709 | kim-em | feat(DefEqAbuse): suggest minimal @[implicit_reducible] workaround | This PR extends `#defeq_abuse` to suggest a minimal set of `@[implicit_reducible]` annotations that would make the failing tactic or command succeed with `backward.isDefEq.respectTransparency true`. When `#defeq_abuse` detects a failure, it now runs a greedy minimisation over semireducible definitions reachable from the goal/command, finding a (possibly non-unique) minimal subset that, when temporarily marked `@[implicit_reducible]`, fixes the issue. The result is reported as an `info` message: ``` info: Workaround: the following @[implicit_reducible] annotations (a possibly non-unique minimal set) would paper over this problem, but the real issue is likely a leaky instance somewhere. set_option allowUnsafeReducibility true attribute [implicit_reducible] MyPred ``` This is a workaround, not a fix — the real cause is usually a leaky instance (which `#check_instance` from https://github.com/leanprover-community/mathlib4/pull/36706 can diagnose). But it can be useful for quick debugging. New helpers: `collectCandidates`, `markImplicitReducible`, `withTempImplicitReducible`, `withTempImplicitReducibleCmd`, `suggestAnnotationsTac`, `suggestAnnotationsCmd`, `formatAnnotations`, `logAnnotationSuggestions`. 🤖 Prepared with Claude Code | t-meta LLM-generated | 187/17 | Mathlib/Tactic/DefEqAbuse.lean,MathlibTest/DefEqAbuse.lean | 2 | 6 | ['github-actions', 'kim-em', 'mathlib-merge-conflicts', 'thorimur'] | dwrensha and thorimur | 3 days ago | 3 days ago | 20 days |
| 32305 | faenuccio | feat: define Sobolev Spaces | Nothing to see yet. --- - [ ] depends on: #32250 - [ ] depends on: #31809 [](https://gitpod.io/from-referrer/) | merge-conflict WIP t-analysis large-import | 2487/53 | Mathlib.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/Distribution.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Distribution/WeakDeriv.lean,Mathlib/Analysis/FunctionalSpaces/Sobolev/Basic.lean,Mathlib/MeasureTheory/Function/LocallyIntegrable.lean | 7 | 7 | ['ADedecker', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] | nobody | 3 days ago | 151 days ago | 2 seconds |
| 37364 | kim-em | feat(Tactic/Linter): add `auxLemma` linter for auto-generated declaration references | This PR adds a syntax linter that flags explicit references to auto-generated auxiliary declarations such as `_proof_N`, `match_N`, `_match_N`, and `_sizeOf_N`. These names are internal to the Lean elaborator and are not stable across refactors (e.g. reordering fields in a structure can renumber `_proof_` indices). The linter matches precisely: it requires the suffix after the prefix to be all digits, so `_proof_helper` would not be flagged. It only inspects identifier syntax nodes, so references in comments and docstrings are ignored. Current hits in Mathlib (suppressed with `set_option linter.style.auxLemma false`): - `Mathlib/CategoryTheory/Functor/Category.lean` — `hcomp._proof_2` - `Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean` — `constFormalMultilinearSeries.match_1.eq_2` - `Mathlib/Data/List/Sigma.lean` — `_sizeOf_1` Companion PR to track these suppressions in the tech debt report: https://github.com/leanprover-community/mathlib-ci/pull/17 🤖 Prepared with Claude Code | t-linter | 87/1 | Mathlib.lean,Mathlib/Analysis/Calculus/FormalMultilinearSeries.lean,Mathlib/CategoryTheory/Functor/Category.lean,Mathlib/Data/List/Sigma.lean,Mathlib/Init.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Linter/AuxLemma.lean,MathlibTest/CompileInductive.lean,MathlibTest/interactiveUnfold.lean,MathlibTest/toAdditive.lean | 10 | 35 | ['github-actions', 'kim-em', 'leanprover-radar', 'mathlib-merge-conflicts', 'thorimur'] | thorimur | 2 days ago | 2 days ago | 5 days |
| 37073 | kim-em | feat: add wrap_instance% using core's wrapInstance | This PR adds a new `wrap_instance%` term elaborator that delegates to Lean core's `wrapInstance` (from https://github.com/leanprover/lean4/pull/12897), and replaces ~53 `fast_instance%` call sites where the replacement is safe. `wrap_instance%` is a thin wrapper (~15 lines) around `Lean.Meta.wrapInstance`. Like `fast_instance%`, it reduces instances to constructor applications and reuses canonical sub-instances. Unlike `fast_instance%`, it works at `instances` transparency and delegates all normalization logic to core. The replaced sites cover: - Equiv/type-alias transfers (WithAbs, WithConv, WithVal, WithLp, TransferInstance) - Surjective constructors (Con, RingCon quotients, module congruences) - DFunLike leaf instances (MultilinearMap, ContinuousMultilinearMap, AlternatingMap, Intertwining) - Quotient instances (LinearAlgebra/Quotient/Defs) - inferInstanceAs% sites (StandardPart, Presentation/Core) - Miscellaneous (InfiniteAdeleRing, ZMod) This PR *doesn't* attempt to replace all `fast_instance%`; it gets more complicated! 🤖 Prepared with Claude Code | 88/59 | Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/Algebra/WithConv.lean,Mathlib/Analysis/Normed/Lp/WithLp.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/LinearAlgebra/Alternating/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/Tactic/FastInstance.lean,Mathlib/Topology/Algebra/Module/Alternating/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 16 | 7 | ['JovanGerb', 'github-actions', 'kim-em', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 5 days | |
| 36701 | kim-em | feat(DefEqAbuse): detect and report leaky instance binder types | This PR adds `#check_instance` and `checkInstance` to `Mathlib/Tactic/FastInstance.lean` to diagnose individual instances for leaky data-field binder types, and integrates this into `#defeq_abuse` so it automatically reports leaky instances. A new `withDisabledInstance` helper temporarily evicts an instance from the discrimination tree (via `Attribute.erase` + `withoutModifyingEnv`), allowing `makeFastInstance` to compute the canonical form without `trySynthInstance` trivially finding the instance being checked. `#defeq_abuse` now checks instances used in the failing goal/command for leakiness and reports them alongside the isDefEq failure diagnostics. **Example: `#check_instance`** ```lean def MyNat := ℕ -- Without fast_instance%, the `add` field has binder type ℕ rather than MyNat. instance leakyAdd : Add MyNat := ⟨Nat.add⟩ #check_instance leakyAdd -- ❌ 'leakyAdd': leaky binder types detected. -- The data field `add` has binder type ℕ where MyNat is expected. -- The `fast_instance%` elaborator may be useful as a repair or band-aid: -- `instance : ... := fast_instance% ` instance fixedAdd : Add MyNat := fast_instance% ⟨Nat.add⟩ #check_instance fixedAdd -- ✅ 'fixedAdd': canonical (re-inferred form agrees at instances transparency) ``` 🤖 Prepared with Claude Code | LLM-generated awaiting-author t-meta merge-conflict | 317/17 | Mathlib/Tactic/DefEqAbuse.lean,Mathlib/Tactic/FastInstance.lean,MathlibTest/CheckInstance.lean,MathlibTest/DefEqAbuse.lean | 4 | 43 | ['JovanGerb', 'Vierkantor', 'eric-wieser', 'github-actions', 'kim-em', 'mathlib-merge-conflicts', 'ocfnash'] | Vierkantor | 1 day ago | 39 days ago | 6 days |
| 38597 | kim-em | chore: backport robustness changes from bump/nightly-2026-04-27 | See [#nightly-testing > nightly#213 adaptations for nightly-2026-04-27 @ 💬](https://leanprover.zulipchat.com/#narrow/channel/428973-nightly-testing/topic/nightly.23213.20adaptations.20for.20nightly-2026-04-27/near/591262169). | t-category-theory maintainer-merge | 91/26 | Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Monoidal.lean,Mathlib/CategoryTheory/Bicategory/Coherence.lean,Mathlib/CategoryTheory/Limits/Shapes/ConcreteCategory.lean,Mathlib/CategoryTheory/Limits/Shapes/Equalizers.lean,Mathlib/CategoryTheory/Monoidal/Free/Coherence.lean,Mathlib/CategoryTheory/Sites/DenseSubsite/OneHypercoverDense.lean,Mathlib/CategoryTheory/Sites/Hypercover/One.lean | 7 | 8 | ['github-actions', 'kim-em', 'robin-carlier'] | joelriou | 17 hours ago | 2 days ago | 2 days |
| 38812 | dependabot | chore(deps): bump the actions-version-updates group across 1 directory with 12 updates | Bumps the actions-version-updates group with 12 updates in the /.github/workflows directory:
| Package | From | To |
| --- | --- | --- |
| [leanprover/lean-action](https://github.com/leanprover/lean-action) | `1.4.0` | `1.5.0` |
| [actions/upload-artifact](https://github.com/actions/upload-artifact) | `7.0.0` | `7.0.1` |
| [actions/create-github-app-token](https://github.com/actions/create-github-app-token) | `3.0.0` | `3.1.1` |
| [tspascoal/get-user-teams-membership](https://github.com/tspascoal/get-user-teams-membership) | `3.0.0` | `4.0.1` |
| [marocchino/sticky-pull-request-comment](https://github.com/marocchino/sticky-pull-request-comment) | `3.0.2` | `3.0.4` |
| [docker/login-action](https://github.com/docker/login-action) | `4.0.0` | `4.1.0` |
| [docker/build-push-action](https://github.com/docker/build-push-action) | `7.0.0` | `7.1.0` |
| [actions/github-script](https://github.com/actions/github-script) | `8.0.0` | `9.0.0` |
| [dawidd6/action-download-artifact](https://github.com/dawidd6/action-download-artifact) | `19` | `21` |
| [peter-evans/create-pull-request](https://github.com/peter-evans/create-pull-request) | `8.1.0` | `8.1.1` |
| [softprops/action-gh-release](https://github.com/softprops/action-gh-release) | `2.6.1` | `3.0.0` |
| [actions/cache](https://github.com/actions/cache) | `5.0.4` | `5.0.5` |
Updates `leanprover/lean-action` from 1.4.0 to 1.5.0
Release notesSourced from leanprover/lean-action's releases.
ChangelogSourced from leanprover/lean-action's changelog.
... (truncated) Commits
Updates `actions/upload-artifact` from 7.0.0 to 7.0.1 Release notesSourced from actions/upload-artifact's releases.
CommitsUpdates `actions/create-github-app-token` from 3.0.0 to 3.1.1 Release notesSourced from actions/create-github-app-token's releases.
Commits
Updates `tspascoal/get-user-teams-membership` from 3.0.0 to 4.0.1 Release notesSourced from tspascoal/get-user-teams-membership's releases.
Commits
Updates `marocchino/sticky-pull-request-comment` from 3.0.2 to 3.0.4 Release notesSourced from marocchino/sticky-pull-request-comment's releases.
Commits
Updates `docker/login-action` from 4.0.0 to 4.1.0 Release notesSourced from docker/login-action's releases.
Commits
Updates `docker/build-push-action` from 7.0.0 to 7.1.0 Release notesSourced from docker/build-push-action's releases.
Commits
Updates `actions/github-script` from 8.0.0 to 9.0.0 Release notesSourced from actions/github-script's releases.
Commits
Updates `dawidd6/action-download-artifact` from 19 to 21 Release notesSourced from dawidd6/action-download-artifact's releases.
Commits
Updates `peter-evans/create-pull-request` from 8.1.0 to 8.1.1 Release notesSourced from peter-evans/create-pull-request's releases.
Commits
Updates `softprops/action-gh-release` from 2.6.1 to 3.0.0 Release notesSourced from softprops/action-gh-release's releases.
ChangelogSourced from softprops/action-gh-release's changelog.
|
dependencies github_actions CI | 44/44 | .github/workflows/add_label_from_diff.yaml,.github/workflows/build_template.yml,.github/workflows/check_pr_titles.yaml,.github/workflows/daily.yml,.github/workflows/docker_build.yml,.github/workflows/label_new_contributor.yml,.github/workflows/latest_import.yml,.github/workflows/maintainer_bors_wf_run.yml,.github/workflows/maintainer_merge_wf_run.yml,.github/workflows/nightly_bump_and_merge.yml,.github/workflows/nightly_detect_failure.yml,.github/workflows/nightly_merge_master.yml,.github/workflows/nolints.yml,.github/workflows/olean_report.yaml,.github/workflows/release.yml,.github/workflows/remove_deprecated_decls.yml,.github/workflows/rm_set_option.yml,.github/workflows/splice_bot_wf_run.yaml,.github/workflows/update_dependencies.yml,.github/workflows/update_dependencies_zulip.yml,.github/workflows/weekly-lints.yml | 21 | 1 | ['github-actions'] | nobody | 2 hours ago | 2 hours ago | 2 hours |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 36503 | Mrigna01 | Add false theorem test file | --- [](https://gitpod.io/from-referrer/) | new-contributor | 135/0 | Mathlib/FalseBench/FalseTheorems.lean | 1 | 3 | ['github-actions'] | nobody | 1 month ago | 50 days ago | 6 minutes |
| 37281 | AltSoKoly | Update EdgeConnectivity.lean | --- [](https://gitpod.io/from-referrer/) | t-combinatorics new-contributor awaiting-author | 123/0 | Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Data/Int/GCD.lean | 2 | 5 | ['github-actions', 'grunweg', 'themathqueen'] | nobody | 23 days ago | 35 days ago | 7 minutes |
| 37010 | pion2024 | `Sl2`update: add theorem `finrank_weightSpace_eq_one_of_isIrreducible` | # Background: I am a 2nd year undergrad student in mathematics currently self-teaching Lie algebra and representation theory. Before starting the formalization, I searched for related keywords on Zulip and in the GitHub issues and commits. As far as I could tell, there were no existing results or ongoing attempts before I started. All feedback is welcome. Even a quick check on the statement design/an idea on the generalization (cf Limitations below) would be incredibly helpful. # Overview In this PR, I added the new section `IsAlgClosedIrreducible` which formalizes the well-known theorem `finrank_weightSpace_eq_one_of_isIrreducible` for the Lie algebra $\mathfrak{sl}_2$ step by step. It proves that for a finite-dimensional irreducible representation of $\mathfrak{sl}_2$ over an algebraically closed field $K$ of characteristic zero, every non-trivial weight space has a dimension of exactly 1. # Formalization Structure : Instead of relying on explicit finite sums (`Finset.sum`) and manipulating coefficients, I heavily leverage Mathlib's abstractions in Submodule Lattice Theory and Coordinate-free Linear Algebra. The formalization proceeds in the following logic: 1. Existence of a Primitive Vector (`exists_primitiveVector`): I construct a primitive (highest-weight) vector by showing that repeated applications of the raising operator $e$ must eventually yield zero due to the finite-dimensionality of $M$ and the linear independence of eigenvectors corresponding to distinct eigenvalues. 2. The span of $f$-Tower as a Lie Submodule equals to the whole space (`fTowerLieSubmodule_eq_top`): I define the $f$-tower submodule as the $K$-span of $\{f^k m \mid k \in \mathbb{N}\}$. By proving its closure under the action of $f, h$, and $e$, I establish it as a Lie submodule. Since $M$ is irreducible, this submodule must be the entire space ($\top$). 3. Submodule Lattice Operations (`exists_mem_fTower_of_weightSpace_ne_bot`): To prove that every weight in $M$ is of the form $\mu_0 - 2k$, I use lattice operations (iSup, inf, and Disjoint) to avoid element-wise tracking. Since the $f$-tower spans $M$, the supremum of its weight spaces is $\top$. By leveraging `Module.End.eigenspaces_iSupIndep`, I show that any arbitrary non-trivial weight space would have a trivial intersection with $\top$ if its weight didn't belong to the sequence, yielding a contradiction. 4. Dimension Calculation via Basis Equivalence (`finrank_weightSpace_eq_one_of_isIrreducible`): Finally, I construct a basis from the non-zero elements of the $f$-tower. To show the weight space is 1-dimensional, I use `Basis.equivFun` to compare coefficients algebraically. This avoids heavy manual indexing and index-shifting, proving that any vector in the weight space $\mu_0 - 2k$ is merely a scalar multiple of $f^k m$. # Use of AI: I used Gemini 3.1 Pro for tactics, theorems, improvement suggestions, and error explanations. I fully understand and can vouch for all the modifications I have made to the file. # Limitations: I only managed to formalize the finite-dimensional version, although the theorem also holds in the infinite-dimensional case. In the infinite case the existence of a primitive vector is not guaranteed. A quick search suggests that we might need heavy tools like Casimir operators and the universal enveloping algebra, which are totally beyond my current level. I am looking into it, but since there is a significant mathematical gap, I thought it would be best to get this finite-dimensional version merged first. | new-contributor t-algebra large-import awaiting-author merge-conflict | 336/0 | Mathlib/Algebra/Lie/Sl2.lean | 1 | 10 | ['github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'ocfnash', 'pion2024'] | ocfnash | 10 days ago | 30 days ago | 2 days |
| 37556 | edwin1729 | feat(Topology/Order): Locale.localePointOfSpacePoint if we have a Scott Topology from an Algebraic DCPO | (3/4) in a series of PRs proving that "Scott Topologies over Algebraic DCPOs are Sober" We prove here that the unit of the adjunction from `TopCat` to `Locale` defined in `Topology/Order/Category/FrameAdjunction.lean` is a surjective mapping, under the following condition: The underlying TopologicalSpace must be a Scott Topology generated with an underlying Algebraic DCPO structure. - [ ] depends on: #37445 --- [](https://gitpod.io/from-referrer/) | t-topology new-contributor blocked-by-other-PR merge-conflict | 393/1 | Mathlib.lean,Mathlib/Topology/Order/ScottTopology.lean,Mathlib/Topology/Order/ScottTopologyDCPO.lean,docs/references.bib | 4 | 5 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 3 days ago | 29 days ago | 21 minutes |
| 38596 | JJYYY-JJY | Add an API for row echelon forms of matrices | We write this PR to add `Mathlib.LinearAlgebra.Matrix.Echelon`, which is a theorem-oriented API for row-equivalence, echelon form, and reduced row echelon form of matrices.
The main additions are elementary row-scaling matrices, `Matrix.RowEquivalent`, echelon and reduced-echelon predicates, semantic representative predicates, existence and uniqueness of reduced echelon representatives over fields, and the noncomputable canonical representative `Matrix.rref`.
This is intentionally a semantic/theorem API rather than an executable row-reduction algorithm.
Co-authored-by: Joseph Qian |
t-algebra new-contributor | 1495/4 | Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Echelon.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean | 3 | 6 | ['JJYYY-JJY', 'copilot-pull-request-reviewer', 'github-actions', 'wwylele'] | nobody | 3 days ago | 3 days ago | 3 days |
| Number | Author | Title | Description | Labels | +/- | Modified files (first 100) | 📝 | 💬 | All users who commented or reviewed | Assignee(s) | Updated | Last status change | total time in review |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 34911 | smmercuri | feat: idelic product formula | --- - [x] depends on: #34915 - [x] depends on: #34918 - [x] depends on: #36184 - [x] depends on: #36204 - [ ] depends on: #36275 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 245/10 | Mathlib.lean,Mathlib/Algebra/Group/Submonoid/Units.lean,Mathlib/NumberTheory/NumberField/AdeleRing.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/FiniteAdeleRing.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean | 7 | 7 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 84 days ago | 10 seconds |
| 30579 | smmercuri | feat : `v.adicCompletionIntegers K` is compact when `K` is a number field | --- - [x] depends on: #30576 - [x] depends on: #33484 - [x] depends on: #33594 - [ ] depends on: #34045 - [x] depends on: #36067 - [x] depends on: #36137 - [x] depends on: #36184 - [x] depends on: #36492 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 353/15 | Mathlib.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/LiesOverInstances.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Valuation/Discrete/RankOne.lean,Mathlib/RingTheory/Valuation/Extension.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 8 | 10 | ['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] | nobody | 1 month ago | 198 days ago | 13 seconds |
| 36275 | smmercuri | feat: norm for the finite adele ring of a number field | --- - [ ] depends on: #35820 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 184/8 | Mathlib.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/FiniteAdeleRing.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean | 5 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 56 days ago | 8 seconds |
| 36404 | smmercuri | feat: the adele ring of a number field is locally compact | --- - [ ] depends on: #30579 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR large-import merge-conflict | 539/113 | Mathlib.lean,Mathlib/Algebra/GroupWithZero/Range.lean,Mathlib/NumberTheory/NumberField/AdeleRing.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/LiesOverInstances.lean,Mathlib/NumberTheory/NumberField/ProductFormula.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/Valuation/Extension.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 10 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 53 days ago | 4 minutes |
| 37023 | xroblot | feat(NumberTheory/NumberField): linear disjointness from coprime discriminants | The key new result is `dvd_discr_iff_dvd_discr_normalClosure`: a prime `p` divides `discr K` if and only if it divides the discriminant of the normal closure of `K` over `ℚ`. Thanks to this result, we generalize `linearDisjoint_of_isGalois_isCoprime_discr` by removing the Galois hypothesis: if K₁ and K₂ are number fields with coprime discriminants, then they are linearly disjoint over ℚ. --- [](https://gitpod.io/from-referrer/) - [ ] depends on: #36843 - [ ] depends on: #30666 | merge-conflict blocked-by-other-PR | 1575/57 | Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/Algebra/GroupWithZero/Action/TransferInstance.lean,Mathlib/Algebra/Ring/Int/Field.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/FieldTheory/IntermediateField/ExtendTop.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/NumberTheory/NumberField/Discriminant/Different.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/RingTheory/AlgebraTower.lean,Mathlib/RingTheory/Ideal/Galois.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean | 24 | 1 | ['mathlib-dependent-issues'] | nobody | 1 month ago | 39 days ago | 1 minute |
| 35991 | xroblot | feat(RamificationInertia): decomposition field and inertia field of compositum | --- - [ ] depends on: #35808 - [x] depends on: #35493 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 534/15 | Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean | 6 | 6 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 1 month ago | 60 days ago | 5 minutes |
| 36733 | xroblot | feat(RamificationInertia): decomposition field and inertia field of subfields | If `D` (resp. `E`) is the decomposition (resp. inertia) field of `P` in `L/K` and `F` is a subextension, then the decomposition (resp. inertia) field of the prime of `F` below `P` in `F/K` is` D ⊓ F` (resp. `E ⊓ F`). --- - [ ] depends on: #36544 - [ ] depends on: #35991 - [x] depends on: #36391. [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 818/31 | Mathlib.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/FieldTheory/IntermediateField/Algebraic.lean,Mathlib/FieldTheory/Normal/Defs.lean,Mathlib/GroupTheory/QuotientGroup/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/NumberTheory/RamificationInertia/HilbertTheory.lean,Mathlib/NumberTheory/RamificationInertia/Inertia.lean,Mathlib/NumberTheory/RamificationInertia/Ramification.lean,Mathlib/RingTheory/Ideal/Galois.lean | 13 | 4 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 20 days ago | 46 days ago | 48 seconds |
| 35790 | Brian-Nugent | feat(CategoryTheory/AlgebraicGeometry): Flasque Sheaves have vanishing cohomology | Proves cohomology vanishing for flasque sheaves. AI usage: The last 4 lines of `freeAbSheafHomEquiv_naturality` were generated by Claude Code. --- - [ ] depends on: #34742 - [x] depends on: #34267 - [x] depends on: #35785 - [ ] depends on: #36218 [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR | 409/4 | Mathlib.lean,Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/Algebra/Homology/ShortComplex/Exact.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/ExactSequences.lean,Mathlib/Topology/Sheaves/AddCommGrpCat.lean,Mathlib/Topology/Sheaves/Flasque.lean,Mathlib/Topology/Sheaves/Sheaf.lean | 9 | 9 | ['Brian-Nugent', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smorel394'] | dagurtomas | 15 days ago | 64 days ago | 23 seconds |
| 38036 | JovanGerb | feat: `NSMul`/`NPow` type class | This PR is adds `NSMul`, `NPow`, `ZSMul` and `ZPow` classes for the `nsmul`, `npow`, `zsmul`, `zpow` data fields. This has a few advantages: - If you first declare a `SMul` instance, then you don't need to manually write `nsmul := (· • ·)` and `zsmul := (· • ·)` . For `Pow`, the extra benefit is that inferring the instance is preferred over the default field `npowRecAuto`. So this helps avoid accidental diamonds. - If you first declare a `SMul` instance on a type synonym, then `inferInstanceAs` will infer the `nsmul` field from the `SMul` instance. This makes it easier to avoid diamonds on type synonyms like `Matrix` and `MonoidAlgebra`. - The not-yet-merged instance diamond linter will be able to detect cases where the `NSMul` and `SMul` classes do not agree. In the process of making this PR, I have identified two existing `NPow` diamonds: - In `Mathlib.Algebra.Order.Positive.Field`, there were two conflicting `NPow` instances. - For `Fin`, there are two conflicting `NPow` instances. I have overwritten the one in core lean with the one from mathlib that is more computationally efficient. TODO: the same for `QSMul` and `NNQSMul`. --- [](https://gitpod.io/from-referrer/) | 276/273 | Mathlib/Algebra/Colimit/DirectLimit.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/Group/Action/Opposite.lean,Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Group/Ext.lean,Mathlib/Algebra/Group/Int/Defs.lean,Mathlib/Algebra/Group/Opposite.lean,Mathlib/Algebra/Group/Prod.lean,Mathlib/Algebra/Group/Submonoid/Membership.lean,Mathlib/Algebra/Group/TypeTags/Basic.lean,Mathlib/Algebra/Group/Units/Defs.lean,Mathlib/Algebra/GroupWithZero/Action/Opposite.lean,Mathlib/Algebra/Module/NatInt.lean,Mathlib/Algebra/MonoidAlgebra/Defs.lean,Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Algebra/Order/Positive/Field.lean,Mathlib/Algebra/Order/Ring/Archimedean.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Algebra/Ring/MinimalAxioms.lean,Mathlib/Algebra/RingQuot.lean,Mathlib/CategoryTheory/Triangulated/Basic.lean,Mathlib/Data/BitVec.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/Data/Rat/Defs.lean,Mathlib/Data/ZMod/Defs.lean,Mathlib/Data/ZMod/IntUnitsPower.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/GroupTheory/GroupAction/Hom.lean,Mathlib/LinearAlgebra/Matrix/Defs.lean,Mathlib/LinearAlgebra/Matrix/ZPow.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Defs.lean,Mathlib/NumberTheory/ArithmeticFunction/Defs.lean,Mathlib/RingTheory/PolynomialLaw/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Tactic/Abel.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Topology/Algebra/GroupCompletion.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,MathlibTest/instance_diamonds.lean | 41 | 16 | ['JovanGerb', 'eric-wieser', 'github-actions', 'jcommelin', 'leanprover-radar', 'vihdzp'] | nobody | 10 days ago | 10 days ago | 10 days | |
| 38316 | tannerduve | feat(Order/OmegaCompletePartialOrder): least fixed point and Scott induction | Add `lfp` for endomorphisms on an ωCPO with a least element and its basic API (`map_lfp`, `isFixedPt_lfp`, `lfp_le_fixed`, `isLeast_lfp`) and the Scott induction theorem `lfp_induction` Also add corresponding induction principles for `Part.fix`: `fix_scott_induction` (ω-Scott continuous functional, admissible predicate) and `fix_scott_induction_pointwise` | new-contributor | 110/0 | Mathlib/Control/LawfulFix.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,docs/references.bib | 3 | 2 | ['github-actions'] | nobody | 8 days ago | 10 days ago | 10 days |
| 35976 | Phelixh | feat: add add Liu's uncertainty theory foundations (core/distribution/process modules) | --- [](https://gitpod.io/from-referrer/) | new-contributor awaiting-author LLM-generated | 2383/0 | Mathlib.lean,Mathlib/Uncertainty/Base.lean,Mathlib/Uncertainty/BaseCore.lean,Mathlib/Uncertainty/BaseDistribution.lean,Mathlib/Uncertainty/BaseProcess.lean,Mathlib/Uncertainty/Uncertainty.lean | 6 | 41 | ['Phelixh', 'copilot-pull-request-reviewer', 'github-actions', 'grunweg'] | nobody | 7 days ago | 13 days ago | 20 days |
| 38489 | Jun2M | feat(Topology/Algebra/InfiniteSum): Generalize ENNReal lemmas | This PR generalizes many theorems in Topology/Algebra/InfiniteSum/ENNReal.lean from `ENNREal` to any type that satisfies a list of order-related instances, mostly `[CommMonoid α] [CompleteLattice α] [CanonicallyOrderedMul α] [TopologicalSpace α] [SupConvergenceClass α]` Deprecation of the original `ENNReal` lemmas are done in the next PR: #38193. Related Zulip thread: [#Is there code for X? > Summing `ENat`s without topology](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/588756615) --- [](https://gitpod.io/from-referrer/) | 191/1 | Mathlib/Probability/ProbabilityMassFunction/Monad.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean | 2 | 2 | ['SnirBroshi', 'github-actions'] | nobody | 6 days ago | 6 days ago | 6 days | |
| 38193 | Jun2M | feat(Topology/Algebra/InfiniteSum): Deprecate generalized ENNReal lemmas | Following the PR #38489, this PR add deprecated tags to the original `ENNReal` lemmas and change the transitive children files to use the generalized lemmas rather than the deprecated lemmas. Related Zulip thread: [#Is there code for X? > Summing `ENat`s without topology](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Summing.20.60ENat.60s.20without.20topology/with/588756615) --- - [ ] depends on: #38489 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 483/329 | Mathlib/Algebra/Order/AddGroupWithTop.lean,Mathlib/Analysis/Normed/Group/InfiniteSum.lean,Mathlib/Analysis/PSeries.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean,Mathlib/MeasureTheory/Covering/Besicovitch.lean,Mathlib/MeasureTheory/Covering/Differentiation.lean,Mathlib/MeasureTheory/Covering/Vitali.lean,Mathlib/MeasureTheory/Function/AEMeasurableOrder.lean,Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean,Mathlib/MeasureTheory/Function/Egorov.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/LpSpace/Complete.lean,Mathlib/MeasureTheory/Function/SimpleFunc.lean,Mathlib/MeasureTheory/Integral/Bochner/VitaliCaratheodory.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Add.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Countable.lean,Mathlib/MeasureTheory/Measure/AbsolutelyContinuous.lean,Mathlib/MeasureTheory/Measure/AddContent.lean,Mathlib/MeasureTheory/Measure/Content.lean,Mathlib/MeasureTheory/Measure/Count.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/Measure/MeasuredSets.lean,Mathlib/MeasureTheory/Measure/MutuallySingular.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/Measure/Regular.lean,Mathlib/MeasureTheory/Measure/RegularityCompacts.lean,Mathlib/MeasureTheory/Measure/Restrict.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/MeasureTheory/Measure/Tight.lean,Mathlib/MeasureTheory/Measure/Typeclasses/SFinite.lean,Mathlib/MeasureTheory/Measure/WithDensity.lean,Mathlib/MeasureTheory/OuterMeasure/Caratheodory.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/MeasureTheory/OuterMeasure/OfAddContent.lean,Mathlib/MeasureTheory/OuterMeasure/OfFunction.lean,Mathlib/MeasureTheory/OuterMeasure/Operations.lean,Mathlib/MeasureTheory/VectorMeasure/Basic.lean,Mathlib/NumberTheory/Transcendental/Liouville/Measure.lean,Mathlib/Probability/Distributions/Uniform.lean,Mathlib/Probability/Kernel/Defs.lean,Mathlib/Probability/Kernel/WithDensity.lean,Mathlib/Probability/ProbabilityMassFunction/Basic.lean,Mathlib/Probability/ProbabilityMassFunction/Constructions.lean,Mathlib/Probability/ProbabilityMassFunction/Monad.lean,Mathlib/Probability/Process/LocalProperty.lean,Mathlib/Topology/Algebra/InfiniteSum/ENNReal.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean,Mathlib/Topology/MetricSpace/PiNat.lean,Mathlib/Topology/Semicontinuity/Basic.lean | 52 | 4 | ['SnirBroshi', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 5 days ago | 6 days ago | 6 days |
| 38567 | dagurtomas | feat(CategoryTheory/Monoidal): autogenerate some lemmas instead of stating them explicitly | --- - [ ] depends on: #38482 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 928/166 | Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Limits/HasLimits.lean,Mathlib/CategoryTheory/Monoidal/Limits/Shapes/Pullback.lean,Mathlib/CategoryTheory/Monoidal/PushoutProduct.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,Mathlib/Tactic/CategoryTheory/Op.lean,Mathlib/Tactic/CategoryTheory/SpecializeMap.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapSimp.lean,MathlibTest/CategoryTheory/Op.lean,MathlibTest/CategoryTheory/SpecializeMap.lean | 12 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 days ago | 4 days ago | 8 minutes |
| 37910 | wwylele | feat(Geometry/Euclidean): volume of a simplex | This defines the volume of a simplex in Euclidean geometry, and shows that it agrees with measure theory. It also adds the basic set of lemmas (base-and-height formula, reindex, positivity, map, and restrict). Further properties of the volume will be in future PRs. Three new file s are introduced and organized in the following dependency chain: Def.lean -> MeasureSimplex.Lean -> Basic.lean The Def.lean file has the definition only. MeasureSimplex.lean pulls in measure theory. Basic.lean publicly imports Def.lean, and privately imports MeasureSimplex.lean. When a downstream file imports Basic.lean, the measure theory part is not exposed and all properties of the volume is provided. --- - [ ] depends on: #36018 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR merge-conflict | 614/0 | Mathlib.lean,Mathlib/Geometry/Euclidean/Volume/Basic.lean,Mathlib/Geometry/Euclidean/Volume/Def.lean,Mathlib/Geometry/Euclidean/Volume/MeasureSimplex.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean | 6 | 3 | ['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] | nobody | 4 days ago | 20 days ago | 7 minutes |
| 38606 | dennj | feat: preparation for Vanishing Sum of Roots of Unity | Adds the Mathlib API extensions needed for an upcoming formalization of the Lam-style classification theorem for vanishing sums of roots of unity. * Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean + `exists_eq_const_of_sum_smul_eq_zero_of_sum_eq_zero_of_linearIndependent`: if `∑ vᵢ = 0` and the first `n-1` of `n` vectors are linearly independent, every linear relation has constant coefficients. * Mathlib/RingTheory/Radical/NatInt.lean + `Nat.totient_eq_div_radical_mul_totient_radical`: Euler's totient splits as `φ(n) = (n / rad n) * φ(rad n)`. * Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean + `IsPrimitiveRoot.sum_range_pow_mul_div_eq_zero_of_dvd`: the `d` evenly-spaced powers of a primitive `k`-th root sum to zero, for `d ∣ k` and `1 < d`. * Mathlib/NumberTheory/Cyclotomic/LinearDisjoint.lean (new) + `IsPrimitiveRoot.linearDisjoint_adjoin_pow_of_coprime`: cyclotomic subfields of coprime orders are linearly disjoint over `ℚ`. * Mathlib/NumberTheory/Cyclotomic/LinearRelations.lean (new) + `IsPrimitiveRoot.coeffs_eq_of_sum_pow_eq_zero_prime_coprime`: in the cyclotomic field of order `p * m` with `p` prime coprime to `m`, any `ℚ⟮ζ^p⟯`-linear relation among powers of `ζ^m` has all coefficients equal. --- I need these as preparation to start formalizing the theorem: Let k be a positive integer. If a finite family of complex k-th roots of unity sums to zero, then the size of the family is a non-negative integer combination of the prime divisors of k. --- Human-made PR with AI used for golfing and documentation | new-contributor | 219/0 | Mathlib.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/NumberTheory/Cyclotomic/LinearDisjoint.lean,Mathlib/NumberTheory/Cyclotomic/LinearRelations.lean,Mathlib/RingTheory/Radical/Totient.lean,Mathlib/RingTheory/RootsOfUnity/PrimitiveRoots.lean | 6 | 2 | ['github-actions'] | nobody | 3 days ago | 3 days ago | 3 days |
| 38551 | TTony2019 | feat(Analysis/Convex/Intrinsic): add `affineSpan_prod_eq` and `intrinsicInterior_prod_eq` | ### Summary We prove that the affine span of a product set equals the product of the affine spans, and that the intrinsic interior of a product set equals the product of the intrinsic interiors. - `affineSpan_prod_eq`: for `s : Set P₁` and `t : Set P₂`, `affineSpan k (s ×ˢ t) = (affineSpan k s) ×ˢ (affineSpan k t)` as sets. - `intrinsicInterior_prod_eq`: for `s : Set P` and `t : Set Q`, `intrinsicInterior 𝕜 (s ×ˢ t) = intrinsicInterior 𝕜 s ×ˢ intrinsicInterior 𝕜 t`. These two theorems are added to `Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean` and `Mathlib/Analysis/Convex/Intrinsic.lean`. ### Collaboration Co-authored-by: @imathwy | new-contributor | 144/0 | Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/Group/Pointwise/Set/Basic.lean,Mathlib/Analysis/Convex/Intrinsic.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Basic.lean,Mathlib/LinearAlgebra/Prod.lean | 5 | 21 | ['TTony2019', 'github-actions', 'wwylele'] | nobody | 2 days ago | 2 days ago | 5 days |
| 37073 | kim-em | feat: add wrap_instance% using core's wrapInstance | This PR adds a new `wrap_instance%` term elaborator that delegates to Lean core's `wrapInstance` (from https://github.com/leanprover/lean4/pull/12897), and replaces ~53 `fast_instance%` call sites where the replacement is safe. `wrap_instance%` is a thin wrapper (~15 lines) around `Lean.Meta.wrapInstance`. Like `fast_instance%`, it reduces instances to constructor applications and reuses canonical sub-instances. Unlike `fast_instance%`, it works at `instances` transparency and delegates all normalization logic to core. The replaced sites cover: - Equiv/type-alias transfers (WithAbs, WithConv, WithVal, WithLp, TransferInstance) - Surjective constructors (Con, RingCon quotients, module congruences) - DFunLike leaf instances (MultilinearMap, ContinuousMultilinearMap, AlternatingMap, Intertwining) - Quotient instances (LinearAlgebra/Quotient/Defs) - inferInstanceAs% sites (StandardPart, Presentation/Core) - Miscellaneous (InfiniteAdeleRing, ZMod) This PR *doesn't* attempt to replace all `fast_instance%`; it gets more complicated! 🤖 Prepared with Claude Code | 88/59 | Mathlib/Algebra/Algebra/TransferInstance.lean,Mathlib/Algebra/Module/Congruence/Defs.lean,Mathlib/Algebra/WithConv.lean,Mathlib/Analysis/Normed/Lp/WithLp.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/Congruence/Defs.lean,Mathlib/LinearAlgebra/Alternating/Basic.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean,Mathlib/LinearAlgebra/Quotient/Defs.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/Tactic/FastInstance.lean,Mathlib/Topology/Algebra/Module/Alternating/Basic.lean,Mathlib/Topology/Algebra/Module/Multilinear/Basic.lean,Mathlib/Topology/Algebra/Valued/WithVal.lean | 16 | 7 | ['JovanGerb', 'github-actions', 'kim-em', 'leanprover-radar', 'mathlib-merge-conflicts'] | nobody | 2 days ago | 2 days ago | 5 days | |
| 38579 | ADedecker | feat: generalize Submodule.ClosedComplemented.of_quotient_finiteDimensional | --- - [ ] depends on: #38547 [](https://gitpod.io/from-referrer/) | blocked-by-other-PR | 462/104 | Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Symmetric.lean,Mathlib/Analysis/Normed/Module/Complemented.lean,Mathlib/Analysis/Normed/Module/ContinuousInverse.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/LinearAlgebra/Projection.lean,Mathlib/Topology/Algebra/Module/Complement.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/FiniteDimension.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean | 10 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 2 days ago | 4 days ago | 3 minutes |
| 38472 | Raph-DG | feat(AlgebraicGeometry): The princpal Weil divisor associated to an element of the function field on a locally Noetherian integral scheme | In this PR we define and provide some basic API for the principal Weil divisor associated to an element of the function field of a locally noetherian, integral scheme. - [ ] depends on: #29774 - [ ] depends on: #37985 - [ ] depends on: #37901 - [ ] depends on: #38002 --- [](https://gitpod.io/from-referrer/) | large-import blocked-by-other-PR | 740/0 | Mathlib.lean,Mathlib/AlgebraicGeometry/AlgebraicCycle/Basic.lean,Mathlib/AlgebraicGeometry/AlgebraicCycle/Principal.lean,Mathlib/AlgebraicGeometry/FunctionField.lean,Mathlib/AlgebraicGeometry/OrderOfVanishing.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/Minimal.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/LocallyFinsupp/Pushforward.lean,Mathlib/Topology/NoetherianSpace.lean,Mathlib/Topology/Sober.lean | 12 | 2 | ['github-actions', 'mathlib-dependent-issues'] | nobody | 4 hours ago | 7 days ago | 19 minutes |