Welcome to the mathlib review page. Everybody's help with reviewing is appreciated. Reviewing contributions is important, and everybody is welcome to review pull requests! If you're not sure how, the pull request review guide is there to help you.
This page is the main reviewer-facing queue: if a PR is ready for review, it belongs here. The triage page contains additional triage-oriented views, but it is not the primary review queue.
This page contains tables of
| 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 |
| 34952 |
joneugster author: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 ` to chose between different interaction methods with github
- add `--force` to skip the check whether labels are already present. (note: the current `curl` setup doesn't perform this step and neither does the refactor, so I added a `Todo` to remember this. )
- make CI-workflow simpler and more robust by removing current stdout-parsing of the debug-messages which `autolabel` emits.
### Testing
Make some local changes and commit them. Ensure your local `origin/master` is in sync with `upstream/master` if you are on a fork.
- `lake exe autolabel`: prints the labels which would be applicable
- `lake exe autolabel --pr 34952 --gh --force` adds these labels to this PR using `gh`.
- `lake exe autolabel --pr 34952 --gh` adds these labels to this PR using `gh` if no topic labels are present.
- `lake exe autolabel --pr 34952 --curl ` adds these labels to this PR using `curl`. This requires a github access token for authentication
---
[](https://gitpod.io/from-referrer/)
|
CI |
85/72 |
.github/workflows/add_label_from_diff.yaml,scripts/autolabel.lean |
2 |
4 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
81-50142 2 months ago |
65-8370 65 days ago |
83-67951 83 days |
| 37865 |
Jun2M author: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 |
47-68026 1 month ago |
47-67047 47 days ago |
47-84733 47 days |
| 37420 |
artie2000 author: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 |
47-11195 1 month ago |
47-10443 47 days ago |
62-29812 62 days |
| 38356 |
SnirBroshi author: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 |
41-47219 1 month ago |
41-44591 41 days ago |
41-44341 41 days |
| 38325 |
Jun2M author: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 |
40-54217 1 month ago |
40-62256 40 days ago |
42-29090 42 days |
| 38498 |
SnirBroshi author: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 |
38-37861 1 month ago |
38-34628 38 days ago |
38-34378 38 days |
| 38344 |
robo7179 author: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 |
38-13784 1 month ago |
41-67006 41 days ago |
41-66756 41 days |
| 38222 |
IvanRenison author: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 |
37-83806 1 month ago |
37-83168 37 days ago |
44-55612 44 days |
| 38528 |
SnirBroshi author: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 |
37-82710 1 month ago |
37-82056 37 days ago |
37-81806 37 days |
| 38549 |
SnirBroshi author: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 |
37-2885 1 month ago |
37-2182 37 days ago |
37-1932 37 days |
| 38529 |
SnirBroshi author: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 |
37-2828 1 month ago |
37-79253 37 days ago |
37-79003 37 days |
| 37835 |
YaelDillies author: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
label:t-algebra$ |
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 |
36-81164 1 month ago |
36-78107 36 days ago |
51-64257 51 days |
| 38554 |
YaelDillies author: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 |
35-69784 1 month ago |
36-14942 36 days ago |
36-14692 36 days |
| 38364 |
openendings author: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 |
34-58040 1 month ago |
40-44746 40 days ago |
41-15964 41 days |
| 38612 |
SnirBroshi author: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 |
34-28849 1 month ago |
34-26736 34 days ago |
35-18936 35 days |
| 37930 |
vlad902 author: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 |
33-32818 1 month ago |
33-32177 33 days ago |
33-31927 33 days |
| 38747 |
SnirBroshi author: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 |
32-54497 1 month ago |
32-53798 32 days ago |
33-24766 33 days |
| 38841 |
SnirBroshi author:SnirBroshi |
feat(Mathlib/Order/SuccPred/Limit): more `WithTop` lemmas about `IsMin`/`CovBy`/`IsSuccLimit` |
---
Continues the work from #38244
We should probably also have such lemmas for `WithTopBot`/`WithBotTop`, but that's for another day
[](https://gitpod.io/from-referrer/)
|
t-order |
111/30 |
Mathlib/Order/Cover.lean,Mathlib/Order/SuccPred/Limit.lean,Mathlib/Order/WithBot.lean |
3 |
1 |
['github-actions'] |
nobody |
31-13295 1 month ago |
31-20553 31 days ago |
31-20303 31 days |
| 38316 |
tannerduve author:tannerduve |
feat(Order/OmegaCompletePartialOrder): least fixed point and Scott induction |
Adds `ContinuousHom.lfp` for endomorphisms on an ωCPO with `⊥`, as the `ωSup` of the iterate chain from `⊥`, together with `map_lfp`, `isFixedPt_lfp`, `lfp_le_fixed`, `isLeast_lfp`, and the Scott induction theorem `lfp_induction` (specialized from a more general seed-based `ωSup_iterate_induction`).
For `Part.fix`, adds:
* `Part.exists_mem_approx_of_mem_fix`: if `y ∈ Part.fix g x`, some finite approximation of `g` already contains `y`.
* `Part.Fix.approx_eq_iterate_bot` and `Part.Fix.approxChain_eq_iterateChain`: bridges between `Fix.approx`/`approxChain` and `f^[n] ⊥`/`iterateChain`.
* `Part.fix_eq_lfp`: `Part.fix g = ContinuousHom.lfp (.ofFun g hc)` when `g` is ω-Scott continuous.
* `Part.fix_scott_induction`: Scott induction specialized to `Part.fix`.
* `Part.fix_induction_mem`: membership induction on `Part.fix`, derived from `fix_scott_induction`. |
new-contributor |
114/0 |
Mathlib/Control/LawfulFix.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,docs/references.bib |
3 |
2 |
['github-actions'] |
nobody |
30-74520 30 days ago |
30-73823 30 days ago |
42-43117 42 days |
| 38358 |
yuanyi-350 author:yuanyi-350 |
doc(1000.yaml): note more formalised theorems |
---
[](https://gitpod.io/from-referrer/)
|
documentation
maintainer-merge
|
9/2 |
docs/1000.yaml |
1 |
12 |
['YaelDillies', 'github-actions', 'grunweg', 'vihdzp', 'yuanyi-350'] |
nobody |
30-18197 30 days ago |
30-17638 30 days ago |
41-14326 41 days |
| 38871 |
0xTerencePrime author:0xTerencePrime |
feat(Combinatorics/SimpleGraph): add parity lemmas for outer and inner vertices |
Adds three lemmas to `SimpleGraph.DegreeSum`:
- `sum_degrees_option_zmod_two`: the handshaking lemma for `Option I` over ZMod 2
- `degree_none_zmod_two_eq_sum`: simp-normal form of the above
- `card_degree_one_option_eq_outer_zmod_two`: under degree bound ≤ 2, count of degree-1 inner vertices equals outer vertex degree mod 2 |
t-combinatorics
new-contributor
|
65/3 |
Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean |
1 |
6 |
['0xTerencePrime', 'SnirBroshi', 'github-actions'] |
nobody |
29-37605 29 days ago |
29-43551 29 days ago |
30-4843 30 days |
| 38897 |
0xTerencePrime author:0xTerencePrime |
feat(Combinatorics/SetFamily): formalize 1D Sperner's Lemma parity |
Formalizes the 1-dimensional Sperner's Lemma (parity version): given a coloring of
the `n + 1` vertices of a subdivided line segment with two colors (`ZMod 2`), if the
two endpoints have different colors, then the number of color-changing edges is odd.
This is **distinct** from `IsAntichain.sperner` in `SetFamily.LYM`, which concerns
antichains in a power set. This file formalizes the topological/combinatorial parity
statement used as the base case in higher-dimensional Sperner arguments.
## Key declarations
- `SpernerColoring`: type-safe coloring via `Fin (n + 1) → ZMod 2`
- `edgeDiff`: color difference on adjacent vertices, computed in `ZMod 2`
- `totalDiff`: telescoping sum of all edge differences
- `diffEdges`: the `Finset` of bichromatic (color-changing) edges
- `sperner_1d`: main theorem — `Odd (diffEdges c).card`
## Design notes
- Using `Fin (n + 1) → ZMod 2` instead of `ℕ → ZMod 2` makes boundary conditions
unrepresentable at the type level, eliminating out-of-bounds cases entirely.
- The proof reduces to a telescoping sum in `ZMod 2`, using `CharTwo.add_self_eq_zero`
to cancel all interior vertices, avoiding parity case splits.
This is intended as the 1D base case, the approach generalizes to higher-dimensional
Sperner's Lemma in future work.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
133/0 |
Mathlib.lean,Mathlib/Combinatorics/SetFamily/Sperner1D.lean |
2 |
3 |
['github-actions', 'grunweg'] |
nobody |
29-28839 29 days ago |
29-38259 29 days ago |
29-38009 29 days |
| 36815 |
EtienneC30 author: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 |
27 |
['ADedecker', 'EtienneC30', 'felixpernegger', 'github-actions', 'mathlib-merge-conflicts'] |
nobody |
28-22952 28 days ago |
28-21117 28 days ago |
68-10573 68 days |
| 38951 |
thomaskwaring author:thomaskwaring |
feat(Order/PrimeSeparator): remove unnecessary hypotheses |
In `mem_ideal_sup_principal`, boundedness and distributivity were unused, and in `prime_ideal_of_disjoint_filter_ideal`, boundedness was only used to produce an element of the filter `F`, which is already nonempty by definition.
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
9/19 |
Mathlib/Order/PrimeSeparator.lean |
1 |
2 |
['github-actions'] |
nobody |
28-21530 28 days ago |
28-20870 28 days ago |
28-20620 28 days |
| 38667 |
SnirBroshi author: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 |
3 |
['SnirBroshi', 'dagurtomas', 'github-actions'] |
nobody |
27-58580 27 days ago |
27-58580 27 days ago |
34-48617 34 days |
| 38979 |
ldct author:ldct |
feat(EReal): simplify nat + ⊤ |
Alternative version of https://github.com/leanprover-community/mathlib4/pull/38975
---
[](https://gitpod.io/from-referrer/)
|
t-data |
28/2 |
Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/Operations.lean,MathlibTest/EReal.lean |
3 |
6 |
['SnirBroshi', 'eric-wieser', 'github-actions', 'ldct', 'leanprover-radar'] |
nobody |
27-2462 27 days ago |
27-689 27 days ago |
27-451 27 days |
| 39004 |
zhuyizheng author:zhuyizheng |
chore(ModelTheory): fix hypo of `realize_liftAt` |
changes the hypo of `realize_liftAt` from the incorrect `(hmn : m + n' ≤ n + 1)` to the correct `(hmn : m ≤ n)`
---
[](https://gitpod.io/from-referrer/)
|
t-logic |
2/2 |
Mathlib/ModelTheory/Semantics.lean |
1 |
3 |
['github-actions', 'plp127', 'zhuyizheng'] |
nobody |
26-49091 26 days ago |
26-84506 26 days ago |
26-84256 26 days |
| 38310 |
ZRTMRH author: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
LLM-generated
|
157/0 |
Mathlib/Combinatorics/Quiver/Schreier.lean |
1 |
2 |
['github-actions'] |
nobody |
26-35545 26 days ago |
42-68311 42 days ago |
42-68061 42 days |
| 39023 |
TBUGTB author:TBUGTB |
feat(Algebra/Order): API lemmas on floor and abs |
Co-authored-by: Etienne Marion @EtienneC30
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
brownian
new-contributor
label:t-algebra$ |
9/0 |
Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/Ring/Abs.lean |
2 |
3 |
['TBUGTB', 'github-actions'] |
nobody |
26-17271 26 days ago |
26-17986 26 days ago |
26-17736 26 days |
| 39078 |
fpvandoorn author:fpvandoorn |
feat: add lemmas about products over Finset.Iio |
* Mostly useful for `ℕ`
* I added the `Finset.Iic` lemmas by symmetry, but I'm happy to remove them if we think they are redundant.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
29/0 |
Mathlib/Algebra/Order/BigOperators/Group/LocallyFinite.lean |
1 |
1 |
['github-actions'] |
nobody |
25-7916 25 days ago |
25-5926 25 days ago |
25-5676 25 days |
| 38328 |
astrainfinita author: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 |
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 |
24-27426 24 days ago |
24-24271 24 days ago |
29-47464 29 days |
| 39123 |
SnirBroshi author:SnirBroshi |
chore(Data/Matrix/Basic): mention `mopMatrix` in `transpose{Ring/Alg}Equiv`s docstring and vice versa |
- `RingEquiv.mopMatrix` and `transposeRingEquiv` differ by a `ᵐᵒᵖ` since the latter assumes `CommMagma α` instead of `Mul α`
- `AlgEquiv.mopMatrix` and `transposeAlgEquiv` differ by a `ᵐᵒᵖ` since the latter assumes `CommSemiring α` instead of `Semiring α`
---
Also slightly golfs `RingEquiv.mopMatrix` as a drive-by.
[](https://gitpod.io/from-referrer/)
|
t-data |
18/11 |
Mathlib/Data/Matrix/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
23-72286 23 days ago |
23-70675 23 days ago |
23-70425 23 days |
| 38855 |
SnirBroshi author:SnirBroshi |
feat(Order/ConditionallyCompleteLattice/Indexed): `≤` version of `ciSup_or'` for `ConditionallyCompleteLattice` |
Deprime `ciSup_or'` because there's no `ciSup_or`, and add a `≤` version (and dual) for `ConditionallyCompleteLattice`.
Only `≤` because equality does not hold when `p ≠ q` without `sSup ∅ = ⊥`.
---
`ciSup_or'` can't have a dual because there's no dual to `ConditionallyCompleteLinearOrderBot`.
[](https://gitpod.io/from-referrer/)
|
t-order |
8/1 |
Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
1 |
1 |
['github-actions'] |
nobody |
23-24467 23 days ago |
23-21762 23 days ago |
30-39931 30 days |
| 39157 |
vihdzp author:vihdzp |
feat: `Nat.cast` commutes with addition |
---
[](https://gitpod.io/from-referrer/)
|
|
26/9 |
Mathlib/Data/Nat/Cast/Commute.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean |
2 |
2 |
['github-actions', 'plp127'] |
nobody |
22-2783 22 days ago |
22-61407 22 days ago |
22-61157 22 days |
| 39219 |
WenrongZou author:WenrongZou |
feat(FieldTheory/Finite): add variant theorems for `expand_card` |
Add `MvPolynomial, MvPowerSeries, PowerSeries` version of `FiniteField.expand_card`, which is only for polynomial.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
large-import
label:t-algebra$ |
45/4 |
Mathlib/FieldTheory/Finite/Basic.lean,Mathlib/LinearAlgebra/Matrix/Charpoly/FiniteField.lean,Mathlib/RingTheory/MvPolynomial/Expand.lean,Mathlib/RingTheory/MvPowerSeries/Expand.lean,Mathlib/RingTheory/PowerSeries/Expand.lean |
5 |
1 |
['github-actions'] |
nobody |
21-64570 21 days ago |
21-63810 21 days ago |
21-63560 21 days |
| 39162 |
anovickis author:anovickis |
feat(Topology/PartitionOfUnity): add pointwise_decomposition_finsum + companions |
Add three short lemmas to `Mathlib/Topology/PartitionOfUnity.lean` extending the existing `PartitionOfUnity` API:
- `pointwise_decomposition_finsum` — for `f : X → ℝ` and `x ∈ s`, `f x = ∑ᶠ i, ρ i x · f x`. This is the pointwise step that lifts to integral linearity in measure-theoretic PoU integration: `∫_s f dμ = ∑ᶠ i, ∫_s (ρ i · f) dμ`.
- `one_minus_sum_nonneg` — `0 ≤ 1 - ∑ᶠ i, ρ i x`. Direct rearrangement of the existing `sum_le_one` field; useful as a complement-mass remainder bound in chart-by-chart estimates.
- `abs_le_one` — `|ρ i x| ≤ 1`. Combines the existing `nonneg` and `le_one`; convenience for absolute-value bounds.
All three are short proofs using existing structure fields (`sum_eq_one`, `sum_le_one`, `nonneg`, `le_one`).
These came up while writing chart-by-chart Stokes-on-manifold estimates where one wants to decompose `∫_M f` into chart-supported pieces using a partition of unity. The pointwise identity is the obvious first step; the other two are complementary algebraic bounds that show up in remainder estimates.
---
🤖 Generated with [Claude Code](https://claude.com/claude-code) |
t-topology
new-contributor
LLM-generated
|
27/0 |
Mathlib/Topology/PartitionOfUnity.lean |
1 |
2 |
['github-actions'] |
urkud assignee:urkud |
21-49252 21 days ago |
22-44420 22 days ago |
22-44170 22 days |
| 39195 |
linesthatinterlace author:linesthatinterlace |
feat(Logic/Function/Defs): Add dcomp lemmas |
This PR adds API lemmas about `dcomp` that were previously missing.
---
[](https://gitpod.io/from-referrer/)
|
t-logic |
13/0 |
Mathlib/Logic/Function/Defs.lean |
1 |
6 |
['github-actions', 'linesthatinterlace', 'plp127'] |
nobody |
21-7684 21 days ago |
21-3616 21 days ago |
22-1197 22 days |
| 39230 |
bryangingechen author:bryangingechen |
chore: extract API from #38807 and golf |
I wanted to understand why these two proofs in #38807 were long (and also play around more with the API in this corner of the library) so I walked through them with Claude Opus.
prepared with Claude code
|
t-order
LLM-generated
|
23/37 |
Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/DirSupClosed.lean |
2 |
2 |
['github-actions', 'vihdzp'] |
nobody |
20-58447 20 days ago |
21-43454 21 days ago |
21-43204 21 days |
| 36202 |
vihdzp author: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 |
21 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
20-20369 20 days ago |
69-19034 69 days ago |
88-2935 88 days |
| 39279 |
jayscambler author:jayscambler |
feat(Cryptography/Sigma): Schnorr sigma protocol and signature scheme |
Adds `Mathlib/Cryptography/Sigma/Schnorr.lean`. New file in a new top-level directory; mathlib currently has no `Mathlib/Cryptography/`, so I've taken `Mathlib/Cryptography/Sigma/` as the natural home for sigma-protocol formalizations.
The file proves the three defining properties of Schnorr's identification scheme as a sigma protocol:
- `Schnorr.correct`: completeness. Honest verifier accepts honest signer's transcript.
- `Schnorr.specialSoundness`: from two accepting transcripts sharing the commitment but using different challenges `c, c'`, the witness `x = (s - s') / (c - c')` is recovered. Needs `q` prime so `c - c'` is invertible in `ZMod q`.
- `Schnorr.hvzkAccepts`: the HVZK simulator `g^s · (y^c)⁻¹` always yields accepting transcripts. This is the structural-correctness half of HVZK only; the distributional indistinguishability statement is a separate result and not in this PR.
On top of the sigma protocol there's `Schnorr.Signature.{keyGen, sign, verify, correct}` wrapping it as a Fiat-Shamir signature scheme; `Schnorr.Signature.correct` is a one-line corollary of `Schnorr.correct`.
Two auxiliary lemmas, `Schnorr.gpow_sub` and `Schnorr.gpow_mul`, bridge `ZMod q` arithmetic and group exponentiation under `Fintype.card G = q`. They're local to this file for now because the surrounding `gpow` API is itself cryptography-specific; if a general `ZMod q`-graded group action framework lands in mathlib later, both lemmas would become instances of it.
There's also a small `example` instantiating everything on `Multiplicative (ZMod q)` for `Fact q.Prime` to show the API typechecks. That instantiation is a toy (DLOG is trivial in that group), but it confirms the abstraction is usable.
**AI disclosure**: this PR was a collaboration between myself, Grey Haven's autocontext and Claude Opus 4.7 (Anthropic). I read each line and built locally on current master. (strawberry has three r's) |
new-contributor
LLM-generated
|
352/0 |
Mathlib.lean,Mathlib/Cryptography/Sigma/Schnorr.lean |
2 |
2 |
['github-actions'] |
nobody |
19-82267 19 days ago |
19-81671 19 days ago |
19-81421 19 days |
| 35255 |
vlad902 author: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 |
19-78907 19 days ago |
19-78054 19 days ago |
34-63507 34 days |
| 38114 |
javgomzar author:javgomzar |
feat(FinitelyPresentedGroup): add finite groups instance |
Add IsFinitelyPresented instance for finite groups.
Co-authored-by: Hang Lu Su , Thomas Browning
---
[](https://gitpod.io/from-referrer/)
|
t-group-theory
new-contributor
large-import
|
31/2 |
Mathlib/GroupTheory/FinitelyPresentedGroup.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean |
2 |
33 |
['github-actions', 'javgomzar', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536', 'vihdzp'] |
mattrobball assignee:mattrobball |
19-73877 19 days ago |
19-72001 19 days ago |
42-65930 42 days |
| 34855 |
staroperator author: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`.
- `IsCoatom.isProper`/`IsCoatom.isMaximal` is deprecated by `Order.Ideal.isProper_of_isCoatom`/`Order.Ideal.isMaximal_of_isProper`, since this result is special to ideals while `IsCoatom` namespace should be for orders in general.
---
- [x] depends on: #34820
---
[](https://gitpod.io/from-referrer/)
|
t-order |
292/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 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
19-66688 19 days ago |
19-62895 19 days ago |
31-70417 31 days |
| 37928 |
AlexeyMilovanov author: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
maintainer-merge
|
87/67 |
Mathlib/Computability/Encoding.lean,Mathlib/ModelTheory/Encoding.lean |
2 |
9 |
['AlexeyMilovanov', 'dagurtomas', 'github-actions', 'vihdzp'] |
nobody |
19-53738 19 days ago |
26-18316 26 days ago |
51-82853 51 days |
| 38816 |
tb65536 author: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
label:t-algebra$ |
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 |
5 |
['eric-wieser', 'github-actions', 'j-loreaux', 'tb65536'] |
mattrobball assignee:mattrobball |
19-48879 19 days ago |
31-71802 31 days ago |
31-71552 31 days |
| 39341 |
drocta author:drocta |
feat(Algebra/Colimit/DirectLimit): add DirectLimit.(NonUnital)StarAlgebra.(lift/of) maps and associated lemmas |
add the `of` and `lift` maps for `DirectLimit.StarAlgebra` and `DirectLimit.NonUnitalStarAlgebra`, as well as the associated lemmas, `of_f`, `lift_comp_of`, `lift_of`, and `hom_ext` for each. Also make `DirectLimit.NonUnitalAlgebra` only require `[Monoid R]` rather than `[CommSemiring R]`.
---
Use of AI: I again asked ChatGPT for some advice about some things about this code. I can personally vouch for all of the code I'm submitting, and that I understand all of it.
This is the third 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.Star.StarAlgHom` (because it needs `StarAlgHom` and `NonUnitalStarAlgHom`) replacing/encompassing the previously added imports of `Mathlib.Algebra.Star.StarRingHom` and `Mathlib.Algebra.Algebra.NonUnitalHom` (added in PR #38308 and #38672 respectively). |
t-algebra
new-contributor
label:t-algebra$ |
100/3 |
Mathlib/Algebra/Colimit/DirectLimit.lean |
1 |
2 |
['github-actions'] |
nobody |
19-48290 19 days ago |
19-47261 19 days ago |
19-48557 19 days |
| 39373 |
yuanyi-350 author:yuanyi-350 |
refactor(NumberTheory): golf `Mathlib/NumberTheory/ModularForms/CongruenceSubgroups` |
- simplifies `Gamma_mem` to a single `simp` proof via `Gamma_mem'` and `SpecialLinearGroup.ext_iff`
- shortens `ModularGroup_T_pow_mem_Gamma` and the `Gamma0` closure proofs with direct `simp`/`simpa` arguments
Extracted from #38144
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
|
4/22 |
Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
18-81364 18 days ago |
18-82096 18 days ago |
18-81846 18 days |
| 39375 |
yuanyi-350 author:yuanyi-350 |
refactor(NumberTheory): golf `Mathlib/NumberTheory/ModularForms/SlashActions` |
- streamlines `prod_slash_sum_weights` by letting `simp` handle the empty case and removing the redundant singleton split in the inductive step
Extracted from #38144
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
|
1/5 |
Mathlib/NumberTheory/ModularForms/SlashActions.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
18-81001 18 days ago |
18-81649 18 days ago |
18-81399 18 days |
| 39376 |
yuanyi-350 author:yuanyi-350 |
refactor(NumberTheory): golf `Mathlib/NumberTheory/RamificationInertia/Basic` |
- shortens `quotientToQuotientRangePowQuotSucc_surjective` by switching the ideal-factor argument to `irreducible_pow_sup` and `count_normalizedFactors_eq` after isolating the span hypotheses
Extracted from #38144
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
|
4/10 |
Mathlib/NumberTheory/RamificationInertia/Basic.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
18-80829 18 days ago |
18-82266 18 days ago |
18-82016 18 days |
| 39392 |
jayscambler author:jayscambler |
feat(Cryptography): one-time pad and Shannon perfect secrecy |
Adds `Mathlib/Cryptography/OTP.lean`. One-time pad over an arbitrary
finite abelian group `G`:
- `OTP.encrypt k m := m + k`, `OTP.decrypt k c := c - k`.
- `OTP.correct`: `decrypt k (encrypt k m) = m`, by `abel`.
- `OTP.perfect_secrecy`: for any `m₀, m₁`, the distributions of
`encrypt k m₀` and `encrypt k m₁` over uniform `k` are equal;
both reduce to `PMF.uniformOfFintype G`. Proof goes via
`Equiv.addLeft`.
Independent of the Schnorr PR (#39279); no shared definitions. Unlike
everything else likely to live under `Mathlib/Cryptography/`, the
security guarantee here is information-theoretic, not computational.
**AI disclosure**: this PR was a collaboration between myself, Grey
Haven's autocontext and Claude Opus 4.7 (Anthropic). I read each
line and built locally on current master. (strawberry has three r's) |
new-contributor
LLM-generated
|
76/0 |
Mathlib.lean,Mathlib/Cryptography/OTP.lean |
2 |
3 |
['MrBrain295', 'github-actions'] |
nobody |
18-44819 18 days ago |
18-66592 18 days ago |
18-66342 18 days |
| 37745 |
AntoineChambert-Loir author:AntoineChambert-Loir |
feat(RingTheory/AugmentationIdeal): base change for augmentation ideals |
Base change for augmentation ideals
Co-authored with: @mariainesdff
---
- [x] depends on: #37744
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
t-algebra
large-import
label:t-algebra$ |
441/1 |
Mathlib.lean,Mathlib/Algebra/Algebra/Hom.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Module/Submodule/Range.lean,Mathlib/LinearAlgebra/Projection.lean,Mathlib/LinearAlgebra/Span/Defs.lean,Mathlib/LinearAlgebra/TensorProduct/Projection.lean,Mathlib/LinearAlgebra/TensorProduct/RightExactness.lean,Mathlib/LinearAlgebra/TensorProduct/Submodule.lean,Mathlib/Order/Disjoint.lean,Mathlib/RingTheory/Ideal/IsAugmentation.lean,Mathlib/RingTheory/TensorProduct/Basic.lean |
12 |
18 |
['AntoineChambert-Loir', 'dagurtomas', 'github-actions', 'mathlib-dependent-issues'] |
nobody |
18-14158 18 days ago |
18-13576 18 days ago |
18-61941 18 days |
| 39438 |
SnirBroshi author:SnirBroshi |
chore(Order/WellFounded): use `to_dual` |
Creates `argmax`/`argmaxOn` duals to the existing `argmin`/`argminOn`,
and `WellFoundedLT.min`/`WellFoundedGT.max` in order to properly dualize `WellFounded.min_le`.
Some theorems about `WellFounded{LT/GT}` which didn't have a dual before have to be renamed to make room,
e.g. `StrictMono.range_inj` is renamed to `StrictMono.range_inj_of_wellFoundedLT`.
---
This is blocking dualizing things in `ConditionallyCompleteLattice/Basic.lean`.
`WellFounded.min_le` has ~30 usages in ~10 files, so deprecating it should probably happen in a separate PR.
[](https://gitpod.io/from-referrer/)
|
t-order |
80/34 |
Mathlib/Data/Finset/Sort.lean,Mathlib/Order/Hom/Set.lean,Mathlib/Order/WellFounded.lean,Mathlib/SetTheory/Ordinal/Enum.lean |
4 |
5 |
['SnirBroshi', 'github-actions', 'vihdzp'] |
nobody |
17-47225 17 days ago |
17-46267 17 days ago |
17-46105 17 days |
| 37707 |
MavenRain author:MavenRain |
feat(Combinatorics/SimpleGraph): add IsMaximalClique/IsMaximalIndepSet, refactor IsMaximum* to MaximalFor |
Addresses #34962
|
new-contributor
t-combinatorics
|
63/31 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean |
1 |
6 |
['MavenRain', 'SnirBroshi', 'eric-wieser', 'github-actions'] |
nobody |
17-28542 17 days ago |
17-27959 17 days ago |
17-27709 17 days |
| 39368 |
gasparattila author:gasparattila |
feat: homogenization of an affine space |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
401/0 |
Mathlib.lean,Mathlib/LinearAlgebra/AffineSpace/Homogenization.lean,docs/references.bib |
3 |
15 |
['eric-wieser', 'gasparattila', 'github-actions'] |
nobody |
17-5424 17 days ago |
17-4799 17 days ago |
18-80310 18 days |
| 39472 |
NoahW314 author:NoahW314 |
feat(RingTheory/MvPolynomial/Homogeneous): add homogeneous lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
large-import
|
74/2 |
Mathlib/Data/Finsupp/Weight.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean |
3 |
1 |
['github-actions'] |
nobody |
16-70873 16 days ago |
16-70260 16 days ago |
16-70010 16 days |
| 37720 |
cjrl author: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
|
19/0 |
Mathlib/Data/Finset/Card.lean,Mathlib/Data/Fintype/Card.lean |
2 |
10 |
['IvanRenison', 'cjrl', 'dagurtomas', 'ghseeli', 'github-actions'] |
nobody |
16-45522 16 days ago |
16-45522 16 days ago |
54-5231 54 days |
| 39443 |
justus-springer author:justus-springer |
feat(Data/Set/Image): `nonempty_preimage_iff` |
Basically a converse to `nonempty_of_nonempty_preimage`.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
4/0 |
Mathlib/Data/Set/Image.lean |
1 |
4 |
['Paul-Lez', 'github-actions', 'justus-springer', 'urkud'] |
nobody |
16-27623 16 days ago |
16-24371 16 days ago |
17-51958 17 days |
| 33392 |
AntoineChambert-Loir author: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 label:t-algebra$ |
551/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/LinearAlgebra/Transvection/Generation.lean |
4 |
16 |
['AntoineChambert-Loir', 'dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
joelriou assignee:joelriou |
16-24153 16 days ago |
16-24221 16 days ago |
63-52821 63 days |
| 39504 |
WenrongZou author:WenrongZou |
feat(MvPowerSeries/Ideal): kernel of map equals map `C` of kernel |
In this PR, we prove that given a ring homomorphism f, suppose that kernel of f is finitely generated, then kernel of map equals map `C` of kernel. (See `ker_map_of_FG`).
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
87/0 |
Mathlib.lean,Mathlib/RingTheory/MvPowerSeries/Ideal.lean |
2 |
4 |
['CoolRmal', 'WenrongZou', 'github-actions'] |
nobody |
16-4004 16 days ago |
16-3462 16 days ago |
16-12822 16 days |
| 39514 |
SnirBroshi author:SnirBroshi |
chore(RingTheory/Polynomial/Basic): golf `degreeLTEquiv` |
Also extracts the `monomial i a ∈ degreeLT R n` proof to a lemma.
---
The semicolons might be a bit excessive, let me know if so.
Also the `right_inv` proof is slower than the previous version, so maybe it should be reverted, but the rest is fine.
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
11/32 |
Mathlib/RingTheory/Polynomial/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
15-70202 15 days ago |
15-68995 15 days ago |
15-68745 15 days |
| 26479 |
thefundamentaltheor3m author: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
|
219/0 |
Mathlib/Analysis/Complex/CauchyIntegral.lean |
1 |
7 |
['github-actions', 'j-loreaux', 'loefflerd', 'mathlib4-merge-conflict-bot', 'thefundamentaltheor3m', 'wwylele'] |
urkud assignee:urkud |
15-36357 15 days ago |
15-36357 15 days ago |
49-46055 49 days |
| 35122 |
Marygold-Dusk author: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
---
Most of the design is analogues to immersions.
|
t-differential-geometry
new-contributor
|
642/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Submersion.lean,docs/references.bib |
3 |
54 |
['Marygold-Dusk', 'chrisflav', 'github-actions', 'grunweg'] |
PatrickMassot and grunweg assignee:grunweg assignee:PatrickMassot |
15-24545 15 days ago |
15-24545 15 days ago |
59-39431 59 days |
| 39370 |
fpvandoorn author:fpvandoorn |
feat: add specialized grind sets |
This adds two grind attributes for specialized tactics. See module doc for more information and motivation. This PR does not tag any lemmas yet.
[Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/small.20specialized.20grind.20sets/with/595132109)
---
[](https://gitpod.io/from-referrer/)
|
t-meta |
113/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/GrindAttrs.lean |
4 |
5 |
['chenson2018', 'fpvandoorn', 'github-actions'] |
dwrensha assignee:dwrensha |
14-85241 14 days ago |
18-67806 18 days ago |
18-76576 18 days |
| 39269 |
godofecht author:godofecht |
feat(Algebra/Spectrum): add the second resolvent identity |
Adds `spectrum.resolvent_sub_resolvent`:
For `a b : A` in an `R`-algebra and `r` in the resolvent set of both,
`resolvent a r - resolvent b r = resolvent a r * (a - b) * resolvent b r`.
Companion to `spectrum.resolvent_eq`. |
t-algebra
new-contributor
label:t-algebra$ |
15/0 |
Mathlib/Algebra/Algebra/Spectrum/Basic.lean |
1 |
3 |
['github-actions', 'wwylele'] |
nobody |
14-80739 14 days ago |
14-79489 14 days ago |
20-63944 20 days |
| 39366 |
akiezun author:akiezun |
feat(Data/Nat): add prime divisibility for ascFactorial and choose |
Adds two prime-divisibility lemmas for natural-number factorial/binomial APIs.
The first characterizes when a prime divides an ascending factorial:
`Nat.Prime.dvd_ascFactorial_iff`.
The second applies this to binomial coefficients:
`Nat.Prime.dvd_choose_add_sub_one_iff`, using
`Nat.ascFactorial_eq_factorial_mul_choose'` and cancellation of the `n!` factor
when `n < p`.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
large-import
|
46/0 |
Mathlib.lean,Mathlib/Data/Nat/Choose/Consecutive.lean,Mathlib/Data/Nat/Factorial/BigOperators.lean |
3 |
9 |
['SnirBroshi', 'akiezun', 'github-actions', 'wwylele'] |
nobody |
14-73286 14 days ago |
14-74002 14 days ago |
18-80778 18 days |
| 39549 |
Hagb author:Hagb |
feat(Order/RelIso/Basic): `swap`s and `compl`s are `Equiv`s |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
13/8 |
Mathlib/Order/RelIso/Basic.lean |
1 |
3 |
['Hagb', 'github-actions', 'leanprover-radar'] |
nobody |
14-65622 14 days ago |
14-64953 14 days ago |
14-64703 14 days |
| 39555 |
b-mehta author:b-mehta |
feat(Data/Finset/Image): relate images with nontriviality |
---
[](https://gitpod.io/from-referrer/)
|
t-data |
20/0 |
Mathlib/Data/Finset/Image.lean |
1 |
1 |
['github-actions'] |
nobody |
14-59162 14 days ago |
14-56292 14 days ago |
14-56042 14 days |
| 39098 |
BoltonBailey author:BoltonBailey |
chore(Data/Vector): add `grind` to cons lemmas |
This PR affects `List.Vector.head_cons` and `List.Vector.tail_cons`. It moves the simp attribute assignment of these lemmas to the lemma declarations and also applies the `grind =` attribute.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
2/2 |
Mathlib/Data/Vector/Basic.lean,Mathlib/Data/Vector/Defs.lean |
2 |
4 |
['BoltonBailey', 'github-actions', 'leanprover-radar'] |
nobody |
14-52284 14 days ago |
14-49954 14 days ago |
23-55881 23 days |
| 29744 |
espottesmith author: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
|
398/0 |
Mathlib.lean,Mathlib/Combinatorics/DiHypergraph/Basic.lean |
2 |
4 |
['b-mehta', 'espottesmith', 'github-actions', 'mathlib4-merge-conflict-bot'] |
nobody |
14-50149 14 days ago |
23-18813 23 days ago |
117-84033 117 days |
| 33928 |
jsm28 author: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'] |
nobody |
14-50148 14 days ago |
120-78585 120 days ago |
139-55236 139 days |
| 39027 |
fpvandoorn author:fpvandoorn |
feat: delaborators for inequalities in big operators |
`∏ i < n, f i` was already accepted as valid syntax, but this PR now also prints appropriate sums/products using this notation.
---
[Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/missing.20delaborator.20for.20finsum)
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-meta
label:t-algebra$ |
132/49 |
Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,MathlibTest/BigOps.lean |
2 |
2 |
['fpvandoorn', 'github-actions'] |
kim-em assignee:kim-em |
14-48678 14 days ago |
14-85475 14 days ago |
15-6780 15 days |
| 39558 |
b-mehta author:b-mehta |
feat(Data/Finset/Prod): count the number of ordered pairs in a set |
These proofs were written a while ago, so they may be golfable
---
[](https://gitpod.io/from-referrer/)
|
t-data |
21/0 |
Mathlib/Data/Finset/Prod.lean |
1 |
2 |
['github-actions', 'plp127'] |
nobody |
14-29280 14 days ago |
14-28413 14 days ago |
14-52688 14 days |
| 38906 |
lua-vr author:lua-vr |
feat(ConditionallyCompleteLattice/Indexed): add binary versions of lemmas |
Add binary versions of some of the lemmas. Those are useful when the domain is indexed over the members of a set.
From the Carleson project.
---
[](https://gitpod.io/from-referrer/)
|
t-order
carleson
|
21/5 |
Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
1 |
19 |
['JovanGerb', 'SnirBroshi', 'github-actions', 'grunweg', 'lua-vr', 'mathlib-merge-conflicts'] |
nobody |
14-1806 14 days ago |
13-85709 13 days ago |
21-27916 21 days |
| 39567 |
AlexBrodbelt author:AlexBrodbelt |
feat(Mathlib/Data/Finite/Option): option type is finite iff type is finite |
Option type is finite if and only if the type is finite.
This is an intermediate result to proving that if the `GroupWithZero` is (in)finite then the `Units` are (in)finite.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
25/0 |
Mathlib.lean,Mathlib/Data/Finite/Option.lean |
2 |
11 |
['AlexBrodbelt', 'github-actions', 'plp127', 'themathqueen'] |
nobody |
14-1421 14 days ago |
14-843 14 days ago |
14-15302 14 days |
| 37350 |
aditya-ramabadran author: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
|
225/0 |
Mathlib.lean,Mathlib/Analysis/Distribution/TestFunctionSchwartz.lean |
2 |
24 |
['aditya-ramabadran', 'github-actions', 'j-loreaux'] |
ADedecker and mcdoll assignee:mcdoll assignee:ADedecker |
13-79780 13 days ago |
19-77874 19 days ago |
51-73256 51 days |
| 39585 |
chrisflav author:chrisflav |
chore(RingTheory): add `rfl` lemmas for `Ideal.quotientInfRingEquivPiQuotient` |
From Pi1.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
11/0 |
Mathlib/RingTheory/Ideal/Quotient/Operations.lean |
1 |
1 |
['github-actions'] |
nobody |
13-78844 13 days ago |
13-77297 13 days ago |
13-77047 13 days |
| 39494 |
Hagb author:Hagb |
chore(Data/Finsupp/MonomialOrder): rename fields of `MonomialOrder` to match naming conventions |
Moves:
- MonomialOrder.acm -> MonomialOrder.addCommMonoid_syn
- MonomialOrder.lo -> MonomialOrder.linearOrder_syn
- MonomialOrder.iocam -> MonomialOrder.isOrderedCancelAddMonoid_syn
- MonomialOrder.wf -> MonomialOrder.wellFoundedLT_syn
---
See https://github.com/leanprover-community/mathlib4/pull/32829#discussion_r2716534558.
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
15/6 |
Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean |
2 |
1 |
['github-actions'] |
nobody |
13-75916 13 days ago |
16-40456 16 days ago |
16-40206 16 days |
| 34713 |
dennj author: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. |
new-contributor
t-measure-probability
|
166/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Stochastic.lean,Mathlib/Probability/Markov/Stationary.lean |
3 |
17 |
['EtienneC30', 'dennj', 'dupuisf', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts', 'riccardobrasca'] |
kex-y assignee:kex-y |
13-48614 13 days ago |
20-79874 20 days ago |
47-727 47 days |
| 38014 |
cduenasnavarro author: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
|
181/0 |
Mathlib.lean,Mathlib/InformationTheory/Coding/LinearCode.lean |
2 |
37 |
['cduenasnavarro', 'github-actions', 'linesthatinterlace', 'rkirov', 'vihdzp', 'wwylele'] |
kex-y assignee:kex-y |
13-48610 13 days ago |
17-8746 17 days ago |
49-62203 49 days |
| 38055 |
felixpernegger author: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'] |
urkud assignee:urkud |
13-48609 13 days ago |
47-18365 47 days ago |
47-18982 47 days |
| 38716 |
YaelDillies author:YaelDillies |
feat(Algebra/Order): `NNRat.cast_sub` |
From AddCombi
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
large-import
label:t-algebra$ |
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'] |
themathqueen assignee:themathqueen |
13-48608 13 days ago |
32-26642 32 days ago |
32-26392 32 days |
| 39172 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic` |
- refactors `Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic` by simplifying `stronglyMeasurable_in_set` and `stronglyMeasurable_of_measurableSpace_le_on`
Extracted from #38104
[](https://gitpod.io/from-referrer/)
|
codex
LLM-generated
t-measure-probability
|
16/42 |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
kex-y assignee:kex-y |
13-48605 13 days ago |
22-22978 22 days ago |
22-22728 22 days |
| 39384 |
EngelsVon author:EngelsVon |
feat(Analysis/Calculus/DifferentialForm): Stokes' theorem on rectangular boxes |
## Summary
This PR proves the generalized Stokes theorem for differential forms on rectangular boxes $[a, b] \subset \mathbb{R}^{m+1}$.
The proof strategy is:
1. Extract the `i`-th signed face component `boxFaceComponent ω i` from an `m`-form `ω` — a scalar function whose divergence equals the top-form density of the exterior derivative `dω`.
2. Apply Mathlib's existing divergence theorem for boxes (`integral_divergence_of_hasFDerivAt_off_countable'`).
This gives a genuine proved Stokes formula in the Euclidean setting, complementing the existing infrastructure for differential forms.
## Main definitions
- `DifferentialForm.topFormDensity`: density function of a top-form field
- `DifferentialForm.boxFaceComponent`: the `i`-th signed face component of an `m`-form on `ℝ^(m+1)`
- `DifferentialForm.boxBoundaryIntegral`: the signed boundary integral over `∂[a,b]`
## Main results
- `box_stokes_of_hasFDerivAt`: Stokes' theorem on boxes with pointwise differentiability hypotheses
- `box_stokes_of_contDiff`: a convenient `C¹` formulation
|
t-analysis
new-contributor
|
314/0 |
Mathlib.lean,Mathlib/Analysis/Calculus/DifferentialForm/BoxStokes.lean |
2 |
2 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
13-48601 13 days ago |
18-74965 18 days ago |
18-74715 18 days |
| 39389 |
i-love-lean author:i-love-lean |
feat(Analysis/SpecialFunctions): homeomorphism for spherical coordinates |
A few months ago, I noticed that mathlib was missing change of variables to spherical coordinates, which is taught in undergraduate calculus and useful for many 3D integrals. So far, I used `PolarCoord.lean` as reference and implemented a similar homeomorphism for spherical coordinates. There's still a lot of work left to prove an analog of `integral_comp_polarCoord_symm` but for spherical coordinates, so I'm splitting up the work into several PRs. I also fixed a typo in `PolarCoord.lean`. |
t-analysis
new-contributor
|
133/2 |
Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/PolarCoord.lean,Mathlib/Analysis/SpecialFunctions/SphericalCoord.lean |
4 |
4 |
['github-actions', 'i-love-lean', 'wwylele'] |
j-loreaux assignee:j-loreaux |
13-48600 13 days ago |
18-66045 18 days ago |
18-65795 18 days |
| 39406 |
roos-j author:roos-j |
feat(Analysis): van der Corput's lemma |
Adds van der Corput's lemma on one-dimensional oscillatory integrals, a standard tool in harmonic analysis.
Co-authored-by: Manasa Praveen
---
From https://github.com/roos-j/lean-oscillatory, see there for future plans
Zulip discussion [#mathlib4 > Oscillatory integrals in Lean](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Oscillatory.20integrals.20in.20Lean/with/584786060)
AI disclosure: The code in this PR was predominantly human-written. gpt-5.5 has helped in the later stages with shortening proofs, golfing and general advice.
|
t-analysis
new-contributor
|
551/0 |
Mathlib.lean,Mathlib/Analysis/OscillatoryIntegrals/VanDerCorput.lean |
2 |
2 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
13-48598 13 days ago |
18-7077 18 days ago |
18-6827 18 days |
| 39441 |
Paul-Lez author:Paul-Lez |
feat: small lemma about multilinear power series |
I'm currently working on a PR that connects the `PowerSeries` API to the `FormalMultilinearSeries` API, and in particular constructs a map from `PowerSeries A` to `FormalMultilinearSeries R A A` for any `R`-algebra `A`. This lemma was useful for proving that this map respects composition.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
7/0 |
Mathlib/Analysis/Analytic/Composition.lean |
1 |
3 |
['Paul-Lez', 'github-actions', 'grunweg'] |
j-loreaux assignee:j-loreaux |
13-48597 13 days ago |
16-46106 16 days ago |
17-57334 17 days |
| 39454 |
SnirBroshi author:SnirBroshi |
feat(Analysis/Convex/Jensen): more forms of Jensen's strict inequality |
Adds iff theorems for Jensen's strict inequality for `<`/`=`, positive/nonnegative weights, and canonical form versions.
---
Note that as established by existing theorems in the file, "canonical" here refers to comparing terms to the center of mass instead of to each other.
[](https://gitpod.io/from-referrer/)
|
t-analysis |
95/13 |
Mathlib/Analysis/Convex/Jensen.lean |
1 |
1 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
13-48595 13 days ago |
17-47112 17 days ago |
17-46862 17 days |
| 38896 |
peabrainiac author:peabrainiac |
feat(Algebra): multiplicative torsors |
Introduce a class `Torsor` for torsors of multiplicative groups, as a multiplicative counterpart to the existing `AddTorsor` for torsors of additive groups.
---
Adopted / migrated from #8608.
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
385/286 |
Mathlib/Algebra/AddTorsor/Basic.lean,Mathlib/Algebra/AddTorsor/Defs.lean,Mathlib/Algebra/Group/Pointwise/Set/Scalar.lean,Mathlib/Algebra/Notation/Defs.lean,Mathlib/Analysis/Convex/Segment.lean,Mathlib/Tactic/Translate/ToAdditive.lean |
6 |
2 |
['github-actions', 'grunweg'] |
nobody |
13-43591 13 days ago |
13-41916 13 days ago |
19-36863 19 days |
| 39547 |
Hagb author:Hagb |
chore(Order/Preorder/Finite): use `@[to_dual]` on lemmas about `{Min,Max}imal{For,}` |
Proofs of other theorems (e.g. in #39427) with dual theorems dependent on these lemmas would benefit from their duality.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
11/25 |
Mathlib/Order/Preorder/Finite.lean |
1 |
4 |
['Hagb', 'github-actions', 'vihdzp'] |
nobody |
13-41826 13 days ago |
14-65994 14 days ago |
14-65744 14 days |
| 39611 |
mbkybky author:mbkybky |
feat(RingTheory): let `B` be a faithfully flat `A`-algebra, then `A` is a local ring if `B` is |
Let `B` be a faithfully flat `A`-algebra, then `A` is a local ring if `B` is.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
13/0 |
Mathlib/RingTheory/Flat/FaithfullyFlat/Algebra.lean |
1 |
1 |
['github-actions'] |
nobody |
13-13255 13 days ago |
13-12260 13 days ago |
13-12010 13 days |
| 39605 |
Qinghev author:Qinghev |
Add docstrings for reversed range telescoping lemmas |
This PR adds docstrings for two existing Finset telescoping lemmas and their additive versions generated by `to_additive`:
* `Finset.prod_range_div'` / `Finset.sum_range_sub'`
* `Finset.eq_prod_range_div` / `Finset.eq_sum_range_sub`
The goal is a small documentation-only contribution that makes the reversed range telescoping API easier to discover from search and hover docs.
Local checks:
* `git diff --check -- Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean`
* Attempted `lake env lean Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean`, but local validation is currently blocked by downloading the `leanprover/lean4:v4.30.0-rc2` toolchain from GitHub timing out/connection-resetting on this machine.
Opened as draft until the toolchain/network check can be completed or CI confirms the documentation-only change.
|
t-algebra
new-contributor
label:t-algebra$ |
8/2 |
Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean |
1 |
2 |
['github-actions'] |
nobody |
13-11703 13 days ago |
13-11703 13 days ago |
13-11453 13 days |
| 39332 |
Michaillus author:Michaillus |
chore(Topology/Spectral): Added two small lemmas |
chore(Topology/Spectral): Added two lemmas
`IsCompact.isClosed_constructibleTopology_of_isOpen`
`IsCompact.isClosed_constructibleTopology_of_isClosed`
---
[](https://gitpod.io/from-referrer/)
|
t-topology
new-contributor
|
12/0 |
Mathlib/Topology/Spectral/ConstructibleTopology.lean |
1 |
7 |
['Michaillus', 'github-actions', 'plp127', 'qawbecrdtey'] |
PatrickMassot assignee:PatrickMassot |
13-8197 13 days ago |
19-61927 19 days ago |
19-61677 19 days |
| 39225 |
junodeveloper author:junodeveloper |
feat(SimpleGraph): add no-bridge theorem for even degree graphs |
This PR proves that a finite graph in which every vertex has even degree has no bridge.
It adds:
* `SimpleGraph.not_isBridge_of_even_degree`
The proof argues by contradiction: if an edge is a bridge, delete it and look at the connected component containing one endpoint. In that component, the endpoint has odd degree, while any other odd-degree vertex would contradict the bridge assumption and the even-degree hypothesis. This contradicts the handshaking lemma via the existing odd-degree API.
Local checks:
```bash
lake build Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
lake exe lint-style Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
lake exe runLinter Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
```
## AI usage disclosure
I used OpenClaw/Codex while developing this PR. Much of the Lean proof of `not_isBridge_of_even_degree` was drafted with AI assistance, including API search and proof refactoring. I reviewed the generated code, made edits, ran the local checks above, and understand and take responsibility for the final statement and proof. |
t-combinatorics
new-contributor
large-import
LLM-generated
|
122/0 |
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean |
1 |
12 |
['Rida-Hamadani', 'SnirBroshi', 'github-actions', 'junodeveloper', 'linesthatinterlace'] |
nobody |
13-2968 13 days ago |
13-46328 13 days ago |
21-55749 21 days |
| 39607 |
TentativeConvert author:TentativeConvert |
feat(Algebra/DirectSum): equivalence between direct sum indexed by ι₁ and double sum indexed by ι₂ and fibres of f : ι₁ → ι₂ |
1. Add variant `equivCongrLeft'` of `equivCongrLeft`, and corresponding `…_apply` lemma.
2. Add `…_of lemmas` for both `equivCongrLeft` and `equivCongrLeft'`.
3. Add `…of lemma` for `sigmaCurry`, i.e. `sigmaCurry_of`.
4. Add `sigmaFiberAddEquiv`: the equivalence between a direct sum indexed by a type `ι₁` and the double sum indexed by a type `ι₂` and the fibres of a map `f : ι₁ → ι₂`. Add two `…_apply` lemmas and an `…_of` lemma.
---
This is supposed to be a first step towards merging the draft PR #39356.
re 1: Mathematically, I don't see why one version should be preferred over the other, but I found the existing `equivCongrLeft` more difficult to work with when the equivalence `h : ι ≃ κ` is naturally given in the opposite direction. (I could not avoid explicit type casts through the equality `h.symm.symm = h` when defining `sigmaFiberAddEquiv` in terms of `equivCongrLeft`.)
Very unsure about the name of `equivCongrLeft'`. (I see that the name `equivCongrLeft` was chosen in analogy with `Equiv.piCongrLeft`. `Equiv.piCongrRight` looks very different, so presumably `equivCongrLeft'` should *not* be called `equivCongrRight`.)
re 4: Very unsure about the naming of the two different `…_apply` lemmas; called them `…_apply` and `…_apply'` for now. The second (`…_apply'`) cannot be a `simp` lemma as it would prevent the first (`…_apply`) from firing.
I've used Claude Opus for understanding error messages and git interaction, but everything is hand coded.
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
66/1 |
Mathlib/Algebra/DirectSum/Basic.lean |
1 |
3 |
['github-actions'] |
nobody |
13-2238 13 days ago |
13-12971 13 days ago |
13-12721 13 days |
| 39624 |
justus-springer author:justus-springer |
feat(Algebra/MvPolynomial/PDeriv): a coefficient formula for `pderiv` |
This formula is useful for defining partial derivatives of multivariate power series, see PR #39626.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
15/0 |
Mathlib/Algebra/MvPolynomial/PDeriv.lean |
1 |
1 |
['github-actions'] |
nobody |
12-78815 12 days ago |
12-78487 12 days ago |
12-78237 12 days |
| 39625 |
justus-springer author:justus-springer |
feat(RingTheory/MvPowerSeries/Trunc): generalize truncation lemmas |
Generalize `coeff_trunc_mul_trunc_eq_coeff_mul` (and its analogs for `truncFinset` and `trunc'`) to allow for different truncation levels for the two arguments. This matches the API for univariate power series, where we already have `PowerSeries.coeff_mul_eq_coeff_trunc_mul_trunc₂`.
This is useful for defining partial derivatives of multivariate power series, see PR #39626.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
39/7 |
Mathlib/RingTheory/MvPowerSeries/Trunc.lean |
1 |
1 |
['github-actions'] |
nobody |
12-78797 12 days ago |
12-78301 12 days ago |
12-78051 12 days |
| 33714 |
idontgetoutmuch author: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'] |
nobody |
12-50147 12 days ago |
44-2639 44 days ago |
89-9372 89 days |
| 39635 |
SnirBroshi author:SnirBroshi |
feat(LinearAlgebra/Eigenspace/Matrix): a scalar is in the spectrum iff it's an eigenvalue |
---
[#Is there code for X? > Matrix eigenvalues: spectrum and mulVec](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Matrix.20eigenvalues.3A.20spectrum.20and.20mulVec/with/596538140)
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
18/0 |
Mathlib/LinearAlgebra/Eigenspace/Matrix.lean |
1 |
1 |
['github-actions'] |
nobody |
12-48601 12 days ago |
12-47987 12 days ago |
12-47737 12 days |
| 38225 |
kim-em author: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 |
7 |
['SnirBroshi', 'github-actions', 'jcommelin', 'joneugster', 'kim-em'] |
bryangingechen assignee:bryangingechen |
12-48563 12 days ago |
42-54251 42 days ago |
42-54001 42 days |
| 38823 |
matthewjasper author:matthewjasper |
chore(LinearAlgebra/TensorProduct): fix diamond in `AddCommGroup` instance |
The `SMul` instance for tensor products directly used `AddCon.lift`, so wasn't type correct at instance transparency. This caused a diamond with the `AddCommGroup` instance on tensor products because after unfolding some types didn't match, so I've wrapped the sMul function in a semireducible def to prevent this.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
30/23 |
Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Defs.lean |
2 |
6 |
['dagurtomas', 'github-actions', 'kbuzzard', 'leanprover-radar'] |
themathqueen assignee:themathqueen |
12-48561 12 days ago |
14-65257 14 days ago |
31-57477 31 days |
| 39474 |
emlis42 author:emlis42 |
feat(Topology/Separation/Hausdorff): add `Filter.limUnder_congr` |
This PR adds `Filter.limUnder_congr` and some lemmas about `limUnder`.
`Filter.limUnder_congr` allows rewriting `limUnder` expressions using equivalences of convergence behavior, without proving the filters actually converge, allowing convergence proofs to be carried out on more convenient expressions latter. |
t-topology
new-contributor
large-import
|
24/1 |
Mathlib/Order/Filter/AtTopBot/Archimedean.lean,Mathlib/Topology/Separation/Hausdorff.lean |
2 |
2 |
['github-actions'] |
PatrickMassot assignee:PatrickMassot |
12-48559 12 days ago |
16-68104 16 days ago |
16-67854 16 days |
| 38483 |
jessealama author:jessealama |
feat(Algebra/BigOperators): add `Antiperiodic.sum_Ico_shift` |
Three lemmas about `Finset` sums of `Function.Antiperiodic` functions: `sum_map_add_right` says that for `f` antiperiodic with antiperiod `c`, summing `f` over a `Finset` shifted by `c` (via `addRightEmbedding c`) negates the sum over the original; `sum_Ico_shift` is the half-open-interval specialization, immediate via `Finset.map_add_right_Ico`; and `sum_Ico_mul_add_sum_Ico_mul_shift_eq_zero` is a bilinear cancellation variant. Spun off from #29713 (Euler-Poincaré formula), where the bilinear form is used. |
t-algebra label:t-algebra$ |
63/0 |
Mathlib.lean,Mathlib/Algebra/BigOperators/Periodic.lean |
2 |
5 |
['github-actions', 'j-loreaux', 'jessealama', 'wwylele'] |
ocfnash assignee:ocfnash |
12-47523 12 days ago |
12-46975 12 days ago |
37-81908 37 days |
| 38531 |
SnirBroshi author: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/30 |
Mathlib/Combinatorics/SimpleGraph/Paths.lean |
1 |
1 |
['github-actions'] |
nobody |
12-8434 12 days ago |
12-7787 12 days ago |
37-63043 37 days |
| 39627 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/LapMatrix): 0 is always an eigenvalue |
and the determinant is always zero, plus a few other small lemmas.
---
- [x] depends on: #39642
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
71/15 |
Mathlib/Combinatorics/SimpleGraph/LapMatrix.lean |
1 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
12-6549 12 days ago |
12-5977 12 days ago |
12-52126 12 days |
| 39657 |
mcdoll author:mcdoll |
feat(Algebra): add abstract `prod_apply` and `FunLike.coe_prod` |
Follow-up of #37779, where abstract `IsApply` classes were introduced. Now, we can prove a generic `sum_apply` lemma
and in following PRs this will replace specific ones in function spaces.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
25/5 |
Mathlib/Algebra/BigOperators/Pi.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Data/Matrix/PEquiv.lean,Mathlib/LinearAlgebra/Matrix/Polynomial.lean,Mathlib/LinearAlgebra/QuadraticForm/Dual.lean |
5 |
2 |
['github-actions', 'mcdoll'] |
nobody |
11-85169 11 days ago |
11-85773 11 days ago |
11-85523 11 days |
| 38319 |
Zetetic-Dhruv author: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
|
199/0 |
Mathlib.lean,Mathlib/Combinatorics/SetFamily/DualVC.lean,docs/references.bib |
3 |
37 |
['Shreyas4991', 'YaelDillies', 'Zetetic-Dhruv', 'github-actions'] |
nobody |
11-80534 11 days ago |
22-19428 22 days ago |
40-14872 40 days |
| 36667 |
NoneMore author: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'] |
nobody |
11-50146 11 days ago |
47-21683 47 days ago |
79-31928 79 days |
| 27493 |
themathqueen author: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'] |
mariainesdff assignee:mariainesdff |
11-48665 11 days ago |
33-61202 33 days ago |
80-32175 80 days |
| 38141 |
Jun2M author: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
---
[](https://gitpod.io/from-referrer/)
|
t-order |
41/7 |
Mathlib/Order/Partition/Basic.lean |
1 |
1 |
['github-actions'] |
bryangingechen assignee:bryangingechen |
11-48657 11 days ago |
46-46358 46 days ago |
46-46108 46 days |
| 38975 |
ldct author:ldct |
feat(EReal): Add equations for EReal |
Add equational lemmas for the simplifier to simplify `[natural number literal] + ⊤` in `EReal`, and add a test file in `MathlibTest/EReal.lean`.
Without these lemmas, `simp` fails to close many of the goals in `MathlibTest/EReal.lean`. I believe simp should close all of them.
An alternative is to add something like this as a simp lemma, to allow `top_add_of_ne_bot` to make progress, but it's not clear to me that this is desirable as a simp lemma, since it's not equational
```
example {n : ℕ} [n.AtLeastTwo] : (ofNat(n) : EReal) ≠ ⊤ := by
exact Ne.symm (not_eq_of_beq_eq_false rfl)
```
---
[](https://gitpod.io/from-referrer/)
|
t-data |
32/0 |
Mathlib/Data/EReal/Operations.lean,MathlibTest/EReal.lean |
2 |
2 |
['github-actions', 'vihdzp'] |
TwoFX assignee:TwoFX |
11-48653 11 days ago |
27-55812 27 days ago |
27-55562 27 days |
| 39174 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Integral/Asymptotics` |
- refactors `Mathlib/MeasureTheory/Integral/Asymptotics` by simplifying `IsBigO.set_integral_isBigO`
Extracted from #38104
[](https://gitpod.io/from-referrer/)
|
codex
LLM-generated
t-measure-probability
|
6/12 |
Mathlib/MeasureTheory/Integral/Asymptotics.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
kex-y assignee:kex-y |
11-48652 11 days ago |
22-13156 22 days ago |
22-22277 22 days |
| 39175 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Integral/CircleTransform` |
- refactors `Mathlib/MeasureTheory/Integral/CircleTransform` by shortening `circleTransformDeriv_periodic`
Extracted from #38104
[](https://gitpod.io/from-referrer/)
|
codex
LLM-generated
t-measure-probability
|
1/6 |
Mathlib/MeasureTheory/Integral/CircleTransform.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
RemyDegenne assignee:RemyDegenne |
11-48651 11 days ago |
22-23325 22 days ago |
22-23075 22 days |
| 39437 |
ooovi author:ooovi |
feat(Geometry/Convex/ConvexSpace): show that an `AffineMap` `IsAffineMap` |
Show that `Convexity.IsAffineMap` generalises `AffineMap`s between affine spaces.
---
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
34/3 |
Mathlib/Geometry/Convex/ConvexSpace/AffineSpace.lean,Mathlib/Geometry/Convex/ConvexSpace/Defs.lean |
2 |
3 |
['github-actions', 'mathlib-merge-conflicts', 'ooovi'] |
nobody |
11-28414 11 days ago |
11-27874 11 days ago |
16-35925 16 days |
| 39575 |
YaelDillies author:YaelDillies |
chore(Data/Finsupp): make `mapDomain_congr` congr |
This makes simp stronger. It particular, it breaks some proofs that relied on simp being weak.
From MeanFourier
---
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
29/36 |
Mathlib/Algebra/MvPolynomial/Nilpotent.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Geometry/Convex/ConvexSpace/Defs.lean,Mathlib/LinearAlgebra/Basis/Defs.lean,Mathlib/LinearAlgebra/Finsupp/Pi.lean,Mathlib/LinearAlgebra/Matrix/Basis.lean,Mathlib/NumberTheory/NumberField/EquivReindex.lean,Mathlib/NumberTheory/NumberField/House.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/Functoriality.lean,Mathlib/RepresentationTheory/Intertwining.lean |
10 |
1 |
['github-actions'] |
nobody |
11-23031 11 days ago |
11-20875 11 days ago |
11-20625 11 days |
| 39687 |
TentativeConvert author:TentativeConvert |
feat(Algebra/Group/Submonoid): type class to indicate that supremum in a SubmonoidClass agrees with supremum of submonoids |
Add a type class `SubmonoidClass.IsConcreteSSup` to indicate that the canonical map `.ofClass` from a class `S` of submonoids of `M` to `Submonoid M` preserves suprema.
---
This PR implements the minimal type class assumption needed to make „pushfoward of gradings along maps of indexing sets“ – see draft PR #39356 – work in some `SetLike` generality.
Given `{S M : Type*} [SetLike S M] [Monoid M] [SubmonoidClass S M]`, we have canonical maps
```
S → Submonoid M → Set M
```
The first is `Submonoid.ofClass`, the second and the composition are `coe` maps coming from the `SetLike` structures. Depending on `S`, these maps may or may not satisfy various properties with respect the lattice structures on `Submonoid M` and `Set M`. Mathlib so far includes the type class `[IsConcreteLE S M]`, which asserts that the composition `S → Set M` is order-preserving and order-reflecting. The type class defined here asserts that the first map, `S → Submonoid M`, preserves suprema.
In examples such as `S = Subgroup M`, `S = Submodule R M`, much more is true – in these cases, `S` is a complete sublattice of `Submonoid M`. But there are also examples where only the weaker property defined here holds, e.g. `S = OpenSubgroup M` for a topological group `M`.
Note on `outParam`: I did *not* write `(M : outParam Type*)` in the assumptions of `SubmonoidClass.IsConcreteSSup` in accordance with the [DocString of `Setlike`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/SetLike/Basic.html#SetLike). However, we do have `(B : outParam Type*)` in the definition of `IsConcreteLE`, so perhaps I'm misinterpreting the DocString.
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
label:t-algebra$ |
56/0 |
Mathlib.lean,Mathlib/Algebra/Group/Submonoid/SSup.lean |
2 |
2 |
['github-actions'] |
nobody |
11-18540 11 days ago |
11-17904 11 days ago |
11-17654 11 days |
| 39646 |
YaelDillies author:YaelDillies |
feat(Algebra/Order): maximally varying version of `prod_le_prod_of_subset_of_one_le` |
We need this for `gcongr`.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
49/26 |
Mathlib/Algebra/Module/ZLattice/Summable.lean,Mathlib/Algebra/Order/BigOperators/Group/Finset.lean,Mathlib/Algebra/Order/BigOperators/GroupWithZero/Finset.lean,Mathlib/Analysis/Complex/Exponential.lean |
4 |
7 |
['YaelDillies', 'b-mehta', 'github-actions'] |
nobody |
11-16850 11 days ago |
12-16925 12 days ago |
12-16675 12 days |
| 36275 |
smmercuri author:smmercuri |
feat: norm for the finite adele ring of a number field |
---
- [x] depends on: #35820
[](https://gitpod.io/from-referrer/)
|
|
137/1 |
Mathlib.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/FiniteAdeleRing.lean,Mathlib/Topology/Algebra/Valued/NormedValued.lean |
4 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
11-14836 11 days ago |
11-14289 11 days ago |
11-14039 11 days |
| 39621 |
chrisflav author:chrisflav |
refactor(Topology): use `WithTopology` to define `WithConstructibleTopology` |
We replace the type synonym `WithConstructibleTopology` by `WithTopology _ (constructibleTopology X)`. This breaks the def-eq `X = WithConstructibleTopology X`, which was luckily not abused much yet.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
38/5 |
Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Spectral/ConstructibleTopology.lean,Mathlib/Topology/WithTopology.lean |
3 |
2 |
['github-actions', 'plp127'] |
nobody |
10-78789 10 days ago |
12-78848 12 days ago |
12-78598 12 days |
| 37718 |
SabrinaJewson author: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.
The design is modelled closely after [`Init.Data.Order.PackageFactories`](https://leanprover-community.github.io/mathlib4_docs/Init/Data/Order/PackageFactories.html) (`Std.PreorderPackage` is equivalent-ish to Mathlib’s `Preorder`, and same for partial and linear orders). The `OfStdArgs` types allow conveniently bundling a whole bunch of default arguments together in a way that allows one default argument set to `extends` another.
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
maintainer-merge
|
391/0 |
Mathlib.lean,Mathlib/Order/Std.lean,MathlibTest/OrderOfStd.lean |
3 |
9 |
['SabrinaJewson', 'YaelDillies', 'github-actions'] |
YaelDillies assignee:YaelDillies |
10-65257 10 days ago |
10-75361 10 days ago |
56-47963 56 days |
| 39697 |
sorrachai author:sorrachai |
feat(Data/Tree/Basic): add Membership instance, new notation, rename Tree |
Summary:
1. [Rename]([#CSLib > Splay tree PR: BinaryTree vs Tree @ 💬](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Splay.20tree.20PR.3A.20BinaryTree.20vs.20Tree/near/596482765)) from Tree to BinaryTree, which propagates the changes to other files that use it.
2. Add membership instance, prove decidability of membership.
3. Add toListInOrder, toListPreOrder, toListPostOrder
Suggestion based on the discussion in the cslib [thread](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Splay.20tree.20PR/near/596568391)[#CSLib > Splay tree PR @ 💬](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Splay.20tree.20PR/near/596568391).
---
* depends on: #39707 |
new-contributor |
187/75 |
Mathlib/Combinatorics/Enumerative/Catalan/Tree.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Data/Tree/Basic.lean,Mathlib/Data/Tree/Get.lean,Mathlib/Data/Tree/Traversable.lean,Mathlib/Tactic/CancelDenoms/Core.lean,docs/overview.yaml |
7 |
4 |
['eric-wieser', 'github-actions', 'sorrachai'] |
nobody |
10-58272 10 days ago |
11-2717 11 days ago |
11-2467 11 days |
| 35069 |
A-M-Berns author: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'] |
nobody |
10-50149 10 days ago |
96-68664 96 days ago |
99-17409 99 days |
| 35402 |
samueloettl author: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 |
26 |
['Maldooor', 'github-actions', 'lua-vr', 'mcdoll', 'samueloettl'] |
sgouezel assignee:sgouezel |
10-48975 10 days ago |
29-2208 29 days ago |
99-82756 99 days |
| 39033 |
tb65536 author:tb65536 |
feat(Analysis/DirichletEigenvalue): Dirichlet eigenvalues of a set |
This PR defines the Dirichlet eigenvalues of a set (in the sense of "can you hear the shape of a drum").
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
58/0 |
Mathlib.lean,Mathlib/Analysis/DirichletEigenvalue.lean |
2 |
1 |
['github-actions'] |
sgouezel assignee:sgouezel |
10-48967 10 days ago |
26-6073 26 days ago |
26-5823 26 days |
| 39738 |
NoahW314 author:NoahW314 |
feat(Algebra/Algebra/Bilinear): generalize to `NonUnitalNonAssocCommSemiring` |
Complete a TODO which can now be done since #28604 is merged.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
2/4 |
Mathlib/Algebra/Algebra/Bilinear.lean |
1 |
1 |
['github-actions'] |
nobody |
10-41309 10 days ago |
10-39355 10 days ago |
10-39105 10 days |
| 39518 |
abeldonate author:abeldonate |
feat(RingTheory/LocalProperties/Projective): Projective Module theorem |
Theorem: R Noetherian, M finitely generated R-Mod. Then:
M projective iff M_m free for all m maximal
|
t-ring-theory
new-contributor
large-import
|
21/0 |
Mathlib/RingTheory/LocalProperties/Projective.lean |
1 |
9 |
['abeldonate', 'github-actions', 'mbkybky', 'vlad902'] |
nobody |
10-24664 10 days ago |
10-24012 10 days ago |
14-42206 14 days |
| 39530 |
RaggedR author:RaggedR |
feat(Combinatorics/SimpleGraph): group actions on simple graphs |
This adds the first connection between Mathlib's MulAction and SimpleGraph libraries. The GraphAction class asserts that a group action on the vertex type preserves the adjacency relation, and builds on it to define vertex-transitivity and arc-transitivity for graphs.
The GraphAction typeclass gives adj_smul_iff (the biconditional for group actions) and toIso (each group element induces a graph automorphism). The IsVertexTransitive class combines GraphAction with IsPretransitive, and IsArcTransitive requires transitivity on ordered adjacent pairs (arcs).
The main theorem is the standard characterization: a graph is arc-transitive if and only if it is vertex-transitive and locally transitive (the stabilizer of each vertex acts transitively on its neighbors). The forward direction is proved directly by composing a vertex-transporting element with a neighbor-transporting stabilizer element. The reverse direction shows that an arc-transitive graph with no isolated vertices is vertex-transitive.
These definitions are the algebraic graph theory prerequisites for formalizing coset graphs (Sabidussi's construction) and the characterization of symmetric graphs via double cosets and involutions (Lorimer's theorem).
---
LLM tools were used to assist with Lean formalization. The mathematical content is the author's own work. |
t-combinatorics
new-contributor
LLM-generated
|
130/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Action.lean |
2 |
7 |
['RaggedR', 'b-mehta', 'github-actions', 'mathlib-bors'] |
nobody |
10-14032 10 days ago |
10-14032 10 days ago |
14-67671 14 days |
| 38194 |
ryanncode author: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
label:t-algebra$ |
47/0 |
Mathlib.lean,Mathlib/LinearAlgebra/BilinearForm/IndefiniteMetric.lean |
2 |
5 |
['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'ryanncode'] |
nobody |
10-6232 10 days ago |
10-5650 10 days ago |
13-80182 13 days |
| 39412 |
mbkybky author:mbkybky |
feat(RingTheory/Flat): a finite flat `R`-module `M` is locally free if `rankAtStalk M` is constant |
Let `M` be a finite flat `R`-module, `p` be a prime ideal of `R`. We show that if `rankAtStalk M` is constant, then there exists `a ∉ p` such that the `M` is free after localization away from `a`.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
136/2 |
Mathlib.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/Algebra/Module/LocalizedModule/Submodule.lean,Mathlib/LinearAlgebra/FiniteDimensional/Basic.lean,Mathlib/RingTheory/Flat/LocallyFree.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Spectrum/Prime/FreeLocus.lean,Mathlib/RingTheory/Support.lean |
8 |
4 |
['github-actions', 'robin-carlier'] |
nobody |
10-4005 10 days ago |
10-3423 10 days ago |
17-79892 17 days |
| 39212 |
emlis42 author:emlis42 |
feat(Algebra/ContinuedFractions): add `partNums!` and `partDens!` |
This PR adds `partNums!` and `partDens!`, which provide infinite stream representations for the sequences of partial numerators and denominators of a generalized continued fraction. |
t-algebra
new-contributor
label:t-algebra$ |
8/0 |
Mathlib/Algebra/ContinuedFractions/Basic.lean |
1 |
4 |
['emlis42', 'github-actions', 'grunweg'] |
nobody |
9-77172 9 days ago |
9-76518 9 days ago |
21-77317 21 days |
| 38970 |
themathqueen author:themathqueen |
chore(Analysis/InnerProductSpace/Projection): rename `orthogonalProjection` to `orthogonalProjectionOnto` |
To match the current (continuous) linear projection to a submodule along its complement `Submodule.projection(Onto)(L)`, we change `Submodule.orthogonalProjection` to `Submodule.orthogonalProjectionOnto` (and later will change `Submodule.starProjection` to `Submodule.orthogonalProjection`).
---
Zulip thread: [#**mathlib4>Two variants of linear projections**](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Two.20variants.20of.20linear.20projections/with/591234152)
[](https://gitpod.io/from-referrer/)
|
t-analysis |
267/183 |
Mathlib/Analysis/InnerProductSpace/Adjoint.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Analysis/InnerProductSpace/MeanErgodic.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/InnerProductSpace/Positive.lean,Mathlib/Analysis/InnerProductSpace/ProdL2.lean,Mathlib/Analysis/InnerProductSpace/Projection/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection/FiniteDimensional.lean,Mathlib/Analysis/InnerProductSpace/Projection/Reflection.lean,Mathlib/Analysis/InnerProductSpace/Projection/Submodule.lean,Mathlib/Analysis/InnerProductSpace/Spectrum.lean,Mathlib/Analysis/InnerProductSpace/l2Space.lean,Mathlib/Geometry/Euclidean/Projection.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/Geometry/Manifold/Instances/Sphere.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondexpL2.lean,Mathlib/MeasureTheory/Measure/Hausdorff.lean,Mathlib/Topology/MetricSpace/HausdorffDimension.lean,docs/overview.yaml,docs/undergrad.yaml |
20 |
17 |
['ADedecker', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'themathqueen'] |
mcdoll assignee:mcdoll |
9-75896 9 days ago |
9-74975 9 days ago |
27-29074 27 days |
| 39696 |
jsm28 author:jsm28 |
refactor(LinearAlgebra/Orientation,LinearAlgebra/AffineSpace/FiniteDimensional): instances for arbitrary orientations |
Based on suggestions by @kim-em on Zulip https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/PRs.20towards.20IMO.20geometry.202024.20P4/near/596946072 add convenience scoped instances for choosing an arbitrary orientation of a module, and for the `finrank` of the span of the vertices of a simplex.
Note: I don't understand why the latter scoped instance is only found automatically in one of the two places using it; in `Sphere/Power.lean` it's necessary to use `Affine.Simplex.fact_finrank_direction_affineSpan_eq` rather than relying on typeclass inference, but in `Angle/Sphere.lean` typeclass inference suffices.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-euclidean-geometry
label:t-algebra$ |
26/23 |
Archive/Imo/Imo2019Q2.lean,Mathlib/Geometry/Euclidean/Angle/Sphere.lean,Mathlib/Geometry/Euclidean/Sphere/Power.lean,Mathlib/LinearAlgebra/AffineSpace/FiniteDimensional.lean,Mathlib/LinearAlgebra/Orientation.lean |
5 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
9-70824 9 days ago |
9-70057 9 days ago |
11-1942 11 days |
| 39576 |
plp127 author:plp127 |
chore(Topology): generalize `Topology.IsEmbedding.perfectlyNormalSpace` |
Generalize theorem `Topology.IsEmbedding.perfectlyNormalSpace` to inducing maps. Generalize some other theorem along the way. Rename `isGδ_induced` to `IsGδ.preimage`, to match `IsOpen.preimage` and `IsClosed.preimage`.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
29/27 |
Mathlib/Topology/Baire/LocallyCompactRegular.lean,Mathlib/Topology/GDelta/Basic.lean,Mathlib/Topology/Separation/GDelta.lean,Mathlib/Topology/Separation/PerfectlyNormal.lean,Mathlib/Topology/Separation/Regular.lean |
5 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
9-68099 9 days ago |
9-66293 9 days ago |
13-81447 13 days |
| 37716 |
slavanaprienko author: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
label:t-algebra$ |
217/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Determinant/DesnanotJacobi.lean |
2 |
13 |
['SnirBroshi', 'github-actions', 'grunweg', 'kim-em', 'slavanaprienko'] |
nobody |
9-57681 9 days ago |
9-57105 9 days ago |
23-15493 23 days |
| 35753 |
Vilin97 author: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
maintainer-merge
|
201/0 |
Mathlib.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean |
2 |
59 |
['Vilin97', 'YanYablonovskiy', 'adomani', 'botbaki-review', 'copilot-pull-request-reviewer', 'dagurtomas', 'eric-wieser', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-dependent-issues', 'wwylele'] |
ADedecker assignee:ADedecker |
9-48642 9 days ago |
31-60225 31 days ago |
64-13935 64 days |
| 39763 |
NoahW314 author:NoahW314 |
feat(Algebra/GroupWithZero/Divisibility): add `mul_dvd_left_iff_isUnit` |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
9/0 |
Mathlib/Algebra/GroupWithZero/Divisibility.lean |
1 |
1 |
['github-actions'] |
nobody |
9-39848 9 days ago |
9-37303 9 days ago |
9-37053 9 days |
| 39765 |
vlad902 author:vlad902 |
doc(RingTheory): fix local ring doc comment |
The predicate for local rings was updated to the current definition on non-commutative semirings back in mathlib3, but the outdated comment stating that local rings are commutative rings with a unique maximal ideal has not been updated since.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
4/4 |
Mathlib/RingTheory/LocalRing/Defs.lean |
1 |
1 |
['github-actions'] |
nobody |
9-23039 9 days ago |
9-21650 9 days ago |
9-21400 9 days |
| 39783 |
SnirBroshi author:SnirBroshi |
feat(Order/Interval/Finset): `Set.ncard` lemmas for `LocallyFiniteOrder` |
Followup to #39414 which untagged `Fintype.card_I??` as `@[simp]`.
Adds `Cardinal.mk`/`Set.encard`/`Set.ncard` lemmas for the 8 interval sets `Set.I??` (= 24 lemmas),
that convert them to `Finset.card` over the corresponding `Finset.I??` from a `LocallyFiniteOrder` instance.
---
`simp`? I think it's a bit strange since the `LocallyFiniteOrder` instance could have crazy definitions for the finset intervals which aren't "simpler", though the instances we currently have are simple.
[](https://gitpod.io/from-referrer/)
|
t-order |
115/0 |
Mathlib.lean,Mathlib/Order/Interval/Finset/Card.lean |
2 |
1 |
['github-actions'] |
nobody |
8-80978 8 days ago |
8-80421 8 days ago |
8-80171 8 days |
| 36501 |
AntoineChambert-Loir author: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 label:t-algebra$ |
504/20 |
Mathlib.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 |
10 |
133 |
['AntoineChambert-Loir', 'chrisflav', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'robin-carlier'] |
eric-wieser and robin-carlier assignee:eric-wieser assignee:robin-carlier |
8-77611 8 days ago |
8-76974 8 days ago |
56-56826 56 days |
| 39545 |
Hagb author:Hagb |
feat(Order/OrderIsoNat): some lemmas about `((· < ·) : ℕ → ℕ → Prop) ↪r r` |
This PR contains several lemmas about relation embedding from `<` in `Nat`, well order, and (in)finiteness.
- `RelEmbedding.infinite_iff_nonempty_relEmbedding_of_isWellOrder`: a type with a well order relation is infinite iff there is such a relation embedding.
- `RelEmbedding.finite_iff_empty_relEmbedding_of_isWellOrder`: a finite variant of `infinite_iff_nonempty_relEmbedding_of_isWellOrder`
- `IsWellOrder.finite_of_isWellOrder_of_isWellOrder_swap`: a type with a linear order relation well founded on both directions is finite.
- `instFiniteOfWellFoundedLTOfWellFoundedGT`: an instance variant of `IsWellOrder.finite_of_isWellOrder_of_isWellOrder_swap` on `WellFounded{LT,GT}`.
- `RelEmbedding.infinite_iff_nonempty_relEmbedding_lt_or_nonempty_relEmbedding_gt`: a type with a linear order relation is infinite iff there are both relation embedding between `<` in `Nat` and this relation, and between `>` in `Nat` and this relation.
- `RelEmbedding.finite_iff_isEmpty_relEmbedding_lt_and_isEmpty_relEmbedding_gt`: a finite variant of `infinite_iff_nonempty_relEmbedding_lt_or_nonempty_relEmbedding_gt`.
---
[](https://gitpod.io/from-referrer/)
Edit: remove the description on the original motivation since `WellQuasiOrdered` instead of theorems in this PR can be used for that goal.
`RelEmbedding.finite_iff_empty_relEmbedding_of_isWellOrder` might be used for proof of
```lean
example {α β γ} [LinearOrder α] [LinearOrder β] [WellFoundedLT α] [WellFoundedLT β] [LinearOrder γ]
{f : α × β ≃ γ} (mono : Monotone f) : WellFoundedLT γ := sorry
```
The latter will be used for
```lean
example {α β γ} [Finite α] [LinearOrder β] [WellFoundedLT β] [LinearOrder γ]
{f : (α → β) ≃ γ} (mono : Monotone f) : WellFoundedLT γ := sorry
```
And the finial goal is the well-foundedness of monomial order when the index type `σ` is finite (under the definition in #39214). |
t-order |
58/0 |
Mathlib/Order/OrderIsoNat.lean |
1 |
15 |
['Hagb', 'SnirBroshi', 'github-actions', 'leanprover-radar', 'vihdzp'] |
nobody |
8-75893 8 days ago |
13-73489 13 days ago |
14-19543 14 days |
| 28685 |
mitchell-horner author: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
maintainer-merge
|
329/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/ErdosStoneSimonovits.lean |
2 |
19 |
['YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'mitchell-horner', 'robin-carlier'] |
nobody |
8-50150 8 days ago |
28-53543 28 days ago |
89-55434 89 days |
| 39436 |
dtumad author:dtumad |
chore: Add `seqLeft` and `seqRight` unfolding to monad_norm simp set |
This PR adds `seqLeft_eq_bind` and `seqRight_eq_bind` to `monad_norm`, so that `<*` and `*>` get unfolded in the same way as `<*>` already does when using the `simp` set.
---
[](https://gitpod.io/from-referrer/)
|
t-meta
new-contributor
|
1/1 |
Mathlib/Tactic/Attr/Core.lean |
1 |
2 |
['github-actions'] |
dwrensha assignee:dwrensha |
8-49691 8 days ago |
8-46188 8 days ago |
17-55888 17 days |
| 30109 |
scholzhannah author: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'] |
alreadydone assignee:alreadydone |
8-48537 8 days ago |
34-22993 34 days ago |
45-74030 45 days |
| 35610 |
IvanRenison author:IvanRenison |
feat(Data/Fin): add several lemmas about subtraction of `Fin.{castLT, castAdd, castSucc, castPred}` |
---
[](https://gitpod.io/from-referrer/)
|
t-data |
66/0 |
Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/SuccPred.lean |
2 |
13 |
['IvanRenison', 'chrisflav', 'github-actions', 'robin-carlier', 'wwylele'] |
Vierkantor assignee:Vierkantor |
8-48535 8 days ago |
31-57289 31 days ago |
96-82319 96 days |
| 38142 |
SnirBroshi author: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 random `to_dual` (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 |
55/42 |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/SuccPred/CompleteLinearOrder.lean,Mathlib/SetTheory/Cardinal/Order.lean |
3 |
9 |
['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
bryangingechen assignee:bryangingechen |
8-48531 8 days ago |
31-40997 31 days ago |
46-31161 46 days |
| 38214 |
emlis42 author: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
label:t-algebra$ |
262/0 |
Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Euler.lean |
2 |
15 |
['github-actions', 'mathlib-bors', 'wwylele'] |
alreadydone assignee:alreadydone |
8-48530 8 days ago |
39-76665 39 days ago |
39-78759 39 days |
| 39256 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): add monotonicity lemma for LanguageOn |
In Symbolic dynamics.
Proof that the language of a set of configurations is monotone with respect to inclusion of configuration sets:
X ⊆ Y → LanguageOn X U ⊆ LanguageOn Y U
The proof is a direct unfolding of definitions: a pattern in the language of X comes from restricting some configuration x ∈ X, and inclusion X ⊆ Y allows the same witness to be used for Y.
Related to issue #39252 |
t-dynamics
new-contributor
|
9/1 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
3 |
['github-actions'] |
ADedecker assignee:ADedecker |
8-48529 8 days ago |
20-85922 20 days ago |
20-85697 20 days |
| 39799 |
NoahW314 author:NoahW314 |
chore(RingTheory/Ideal/Operations): deprecate duplicate theorem `Ideal.span_mul_span'` |
`Ideal.span_mul_span'` is identical to `Ideal.span_mul_span`.
---
[](https://gitpod.io/from-referrer/)
At one point, `Ideal.span_mul_span` and `Ideal.span_mul_span'` were distinct, but `Ideal.span_mul_span` was changed in #22151 to be identical to `Ideal.span_mul_span'`. |
t-ring-theory |
6/7 |
Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/Ideal/Norm/RelNorm.lean,Mathlib/RingTheory/Ideal/Operations.lean,scripts/nolints_prime_decls.txt |
4 |
1 |
['github-actions'] |
nobody |
8-47652 8 days ago |
8-46139 8 days ago |
8-45889 8 days |
| 39634 |
SnirBroshi author:SnirBroshi |
feat(LinearAlgebra/Matrix/Nondegenerate): more API and generalize to non-domains |
- Syntactically generalize the bilinear form identities to non-square matrices
- Prove iff and transpose theorems for `SeparatingLeft`/`SeparatingRight`/`Nondegenerate`
- Prove `M *ᵥ v = 0 → v = 0` and `v ᵥ* M = 0 → v = 0` given `Nondegenerate`
(extracted from the existing `eq_zero_of_*_eq_zero`)
- Generalize `M.det ≠ 0 → M.Nondegenerate` to `M.det ∈ R⁰ → M.Nondegenerate` (over any `CommRing`)
- Add `M *ᵥ v = 0 → v = 0` and `v ᵥ* M = 0 → v = 0` theorems given `M.det ∈ R⁰`
- Allow `NonUnitalNonAssocSemiring`s in the `def`s
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
130/44 |
Mathlib/Data/Matrix/Mul.lean,Mathlib/LinearAlgebra/Matrix/Nondegenerate.lean,Mathlib/LinearAlgebra/Matrix/ToLinearEquiv.lean |
3 |
9 |
['SnirBroshi', 'github-actions', 'themathqueen'] |
nobody |
8-42884 8 days ago |
8-41471 8 days ago |
12-43098 12 days |
| 39774 |
Hagb author:Hagb |
feat(Order/WellFounded): `WellFounded` on subtype iff the relation restricted on the subtype is `WellFounded` |
Equivalence between `WellFounded` on a subtype and `WellFounded` on the underlying type with the relation restricted on the subtype.
---
(It was a lemma for #39781, which has been closed since there would be a better proof.)
[](https://gitpod.io/from-referrer/)
|
t-order |
13/0 |
Mathlib/Order/WellFounded.lean |
1 |
3 |
['Hagb', 'SnirBroshi', 'github-actions'] |
nobody |
8-34143 8 days ago |
8-75815 8 days ago |
8-75565 8 days |
| 39808 |
chenson2018 author:chenson2018 |
chore(Data): refactor proofs where `grind?` fails |
These are sources of technical debt as now reported in the [weekly linting report](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/with/544658968). The idea is that a successful `grind` proof can fail to report the theorems it used via `grind?`, which means that if these proofs break across toolchains that it becomes significantly harder to repair.
Most of these are fixed by squeezing the call to `grind` and unsetting `linter.tacticAnalysis.verifyGrindOnly` so they no longer appear in the weekly report. Unfortunately, this can't be on by default for performance reasons, but I highly encourage using this linter when adding any `grind` proofs.
---
[](https://gitpod.io/from-referrer/)
|
t-data
tech debt
|
69/41 |
Mathlib/Data/Bool/Basic.lean,Mathlib/Data/Bool/Set.lean,Mathlib/Data/EReal/Operations.lean,Mathlib/Data/Fin/Tuple/NatAntidiagonal.lean,Mathlib/Data/Finset/Image.lean,Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Finset/Range.lean,Mathlib/Data/Finset/SMulAntidiagonal.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Chain.lean,Mathlib/Data/List/Count.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/List/Induction.lean,Mathlib/Data/List/ReduceOption.lean,Mathlib/Data/List/Sigma.lean,Mathlib/Data/List/Sort.lean,Mathlib/Data/List/TakeDrop.lean,Mathlib/Data/List/Triplewise.lean,Mathlib/Data/Option/Basic.lean,Mathlib/Data/Set/Card.lean,Mathlib/Data/Set/Disjoint.lean,Mathlib/Data/Set/Function.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Data/Sum/Order.lean |
24 |
1 |
['github-actions'] |
nobody |
8-22071 8 days ago |
8-32415 8 days ago |
8-32165 8 days |
| 39623 |
justus-springer author:justus-springer |
feat(Algebra/MvPolynomial/Basic): `coeff_C_of_ne_zero` and `coeff_add_single_C` |
These lemmas are multivariate analogs to `Polynomial.coeff_C_of_ne_zero`, `Polynomial.coeff_C_succ` and `PowerSeries.coeff_C_of_ne_zero` and `PowerSeries.coeff_succ_C`. They are useful for defining partial derivatives for multivariate power series, see PR #39626.
- [x] depends on: #39632
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
16/0 |
Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Basic.lean |
2 |
7 |
['Hagb', 'github-actions', 'justus-springer', 'mathlib-dependent-issues', 'wwylele'] |
nobody |
8-21543 8 days ago |
8-21649 8 days ago |
12-67015 12 days |
| 39769 |
chenson2018 author:chenson2018 |
chore(Topology): refactor proofs where `grind?` fails |
These are sources of technical debt as now reported in the [weekly linting report](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/with/544658968). The idea is that a successful `grind` proof can fail to report the theorems it used via `grind?`, which means that if these proofs break across toolchains that it becomes significantly harder to repair.
Most of these are fixed by squeezing the call to `grind` and unsetting `linter.tacticAnalysis.verifyGrindOnly` so they no longer appear in the weekly report. Unfortunately, this can't be on by default for performance reasons, but I highly encourage using this linter when adding any `grind` proofs.
---
[](https://gitpod.io/from-referrer/)
|
t-topology
tech debt
|
35/17 |
Mathlib/Topology/Compactness/CountablyCompact.lean,Mathlib/Topology/EMetricSpace/BoundedVariation.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/IsLUB.lean,Mathlib/Topology/Order/WithTop.lean,Mathlib/Topology/Path.lean,Mathlib/Topology/Sets/VietorisTopology.lean,Mathlib/Topology/Sheaves/Flasque.lean |
9 |
1 |
['github-actions'] |
nobody |
8-11998 8 days ago |
9-9155 9 days ago |
9-8905 9 days |
| 38669 |
dannyply author: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
|
130/16 |
Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Topology/Algebra/PontryaginDual.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean |
3 |
30 |
['dannyply', 'github-actions', 'j-loreaux', 'tb65536'] |
j-loreaux assignee:j-loreaux |
8-8263 8 days ago |
8-8263 8 days ago |
8-81558 8 days |
| 39820 |
samuelchassot author:samuelchassot |
Add proof of the existence of an Eulerian walk if all vertices have even degree or if exactly vertices have odd degree |
As per the TODO open in `Trails.lean`.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
671/3 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Eulerian.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean |
3 |
8 |
['SnirBroshi', 'copilot-pull-request-reviewer', 'github-actions'] |
nobody |
8-7105 8 days ago |
8-7498 8 days ago |
8-7248 8 days |
| 39818 |
Ljon4ik4 author:Ljon4ik4 |
feat: Transferring Lie Algebra structures along Equivalences |
This pr adds the functionality to transfer Lie brackets along equivalences (additive, linear and plain ones).
I followed the scheme of the existing `TransferInstance.lean` file.
For one of the proofs, I also needed `linearEquiv_apply `, which seemed missing so I added it.
AI use disclaimer: I used claude to search for lemmas/ understand error messages / proofreading and feedback, but wrote the whole code myself.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
124/0 |
Mathlib.lean,Mathlib/Algebra/Lie/TransferInstance.lean,Mathlib/Algebra/Module/TransferInstance.lean |
3 |
2 |
['github-actions'] |
nobody |
8-4258 8 days ago |
8-3659 8 days ago |
8-3409 8 days |
| 37984 |
loefflerd author:loefflerd |
feat: abstract theory of measures |
General foundations of non-archimedean measure theory (intended for applications to Iwasawa algebras)
---
- [x] depends on: #38701 |
t-topology |
306/0 |
Mathlib.lean,Mathlib/NumberTheory/Padics/Measure/Basic.lean,Mathlib/NumberTheory/Padics/Measure/Topology.lean |
3 |
11 |
['github-actions', 'j-loreaux', 'loefflerd', 'mathlib-dependent-issues'] |
PatrickMassot assignee:PatrickMassot |
8-3391 8 days ago |
8-3020 8 days ago |
23-2366 23 days |
| 39736 |
NoahW314 author:NoahW314 |
feat(RingTheory/MvPolynomial/MonomialOrder): add `leadingTerm` lemmas |
Add lemmas for `leadingTerm` to match those for `leadingCoeff`.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
87/0 |
Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean |
1 |
5 |
['Hagb', 'NoahW314', 'github-actions'] |
nobody |
8-2290 8 days ago |
8-1728 8 days ago |
10-41287 10 days |
| 39692 |
YaelDillies author:YaelDillies |
chore(Algebra/Order/BigOperators): follow the `₀` naming convention |
We have long agreed that `MonoidWithZero` lemmas corresponding to `Monoid` lemmas should be suffixed with `₀`, while currently it is the `Monoid` lemmas that are primed.
Also deprecate two primed lemmas that only differed from the unprimed versions in a minor way.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-order
label:t-algebra$ |
283/219 |
Mathlib/Algebra/BigOperators/Finprod.lean,Mathlib/Algebra/Group/Submonoid/Pointwise.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/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean,Mathlib/Analysis/BoxIntegral/DivergenceTheorem.lean,Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/JensenFormula.lean,Mathlib/Analysis/InnerProductSpace/Orientation.lean,Mathlib/Analysis/InnerProductSpace/Subspace.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/Normed/Ring/InfiniteProd.lean,Mathlib/Analysis/ODE/DiscreteGronwall.lean,Mathlib/Analysis/Polynomial/MahlerMeasure.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Extremal.lean,Mathlib/Analysis/SpecificLimits/Basic.lean,Mathlib/MeasureTheory/Constructions/Pi.lean,Mathlib/MeasureTheory/Measure/HasOuterApproxClosedProd.lean,Mathlib/MeasureTheory/Measure/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Measure/Lebesgue/VolumeOfBalls.lean,Mathlib/NumberTheory/Bertrand.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/NumberTheory/Height/MvPolynomial.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Basic.lean,Mathlib/NumberTheory/Primorial.lean,Mathlib/NumberTheory/SelbergSieve.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/NumberTheory/SmoothNumbers.lean,Mathlib/Probability/ProductMeasure.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Eval.lean,Mathlib/Topology/Algebra/InfiniteSum/ENNReal.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean |
35 |
4 |
['github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
nobody |
8-1831 8 days ago |
7-85657 7 days ago |
9-24868 9 days |
| 39829 |
or4nge19 author:or4nge19 |
feat(LinearAlgebra): basis flag lemmas and genEigenspace map |
Part 1/3 of #39139.
Introduces basis flag lemmas and intertwining `genEigenspace` map, using directly available constructors, ie introducing none (so improving on #39139)
Co-authored-by: [kuotsanhsu](https://github.com/kuotsanhsu) [learningstud@gmail.com](mailto:learningstud@gmail.com)
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
large-import
label:t-algebra$ |
76/2 |
Mathlib/LinearAlgebra/Basis/Flag.lean,Mathlib/LinearAlgebra/Eigenspace/Basic.lean |
2 |
1 |
['github-actions'] |
nobody |
8-97 8 days ago |
7-85784 7 days ago |
7-85534 7 days |
| 39745 |
joneugster author:joneugster |
feat: install gh inside the devcontainer |
* Install `gh` automatically in the dev container, try to login on startup.
* Mount local `.gitconfig` in the container. This allows access to the globally configured git user name and such.
The motivation behind this PR is to provide a simple way of sandboxing PRs during review. In particular, keeping the .olean files, which originate from an untrusted fork, contained. During review, `gh pr checkout` is defacto a required tool.
Other tools like [bubble](https://github.com/kim-em/bubble#bubble) aim to address the same use case. However, vscode devcontainer are more mature and the setup is done with few lines of code, easy to understand.
---
### LLM usage
The line
```text
source=${localEnv:HOME}/.gitconfig,target=/home/vscode/.gitconfig,type=bind,consistency=cached
```
has been suggested by querying an LLM. It looks like this is what literature online seems to be using:
* https://github.com/microsoft/vscode/issues/265651
* https://marcandreuf.com/blog/2024-07-12-gitdevcont/
[](https://gitpod.io/from-referrer/)
|
CI |
14/1 |
.devcontainer/devcontainer.json,.gitignore |
2 |
1 |
['github-actions'] |
bryangingechen assignee:bryangingechen |
7-81021 7 days ago |
7-80490 7 days ago |
10-8995 10 days |
| 38488 |
b-mehta author: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 |
35/0 |
Mathlib/Data/Finset/Card.lean,Mathlib/Data/Finset/Image.lean |
2 |
17 |
['SnirBroshi', 'b-mehta', 'github-actions'] |
joneugster assignee:joneugster |
7-78637 7 days ago |
7-75291 7 days ago |
38-44256 38 days |
| 38245 |
RemyDegenne author: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
|
381/66 |
Mathlib.lean,Mathlib/Order/CountableSupClosed.lean,Mathlib/Order/SupClosed.lean |
3 |
16 |
['RemyDegenne', 'b-mehta', 'github-actions', 'vihdzp'] |
nobody |
7-70873 7 days ago |
7-85288 7 days ago |
44-5844 44 days |
| 39747 |
vihdzp author:vihdzp |
feat: intervals `Ici`/`Ioi` are cofinal/closed under directed suprema |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
67/11 |
Mathlib/Order/Cofinal.lean,Mathlib/Order/DirSupClosed.lean,Mathlib/Order/Interval/Set/Basic.lean,Mathlib/Order/UpperLower/Basic.lean,Mathlib/Topology/Order/ScottTopology.lean |
5 |
16 |
['YaelDillies', 'b-mehta', 'github-actions', 'vihdzp'] |
nobody |
7-62322 7 days ago |
8-73074 8 days ago |
9-51311 9 days |
| 39850 |
Ljon4ik4 author:Ljon4ik4 |
feat: Lie-Rinehart subalgebras introduced |
This PR introduces subalgebras of Lie-Rinehart algebras. It defines the corresponding structures, introduces some basic api and shows that a Lie-Rinehart subalgebra is again a Lie-Rinehart algebra.
Most of the code was copied and adapted from `Mathlib/Algebra/Lie/Subalgebra.lean`, however I am not aware of a way to reuse the results from there without copy/pasting them. I also noticed a problem with the namespace of a few simp lemmas in `LieRinehartAlgebra/Defs.lean` and corrected it.
There are a few design decisions that I am not sure about:
* There is one structure, which only needs `[Module A L]` and `[LieRing L]` to be defined. Then additional properties are added along the file whenever needed. It is a little strange to have a `LieRinehartSubalgebra` of something which is not a `LieRinehartalgebra`, but I don't know what a better solution would be
* The structure only uses `A, L` and not `R`, so `R` has to be explicitly passed to the functions later in the file.
AI use disclaimer: I used claude to search for lemmas/ understand error messages / proofreading and feedback, but did not use it for generating the code.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
267/2 |
Mathlib.lean,Mathlib/Algebra/LieRinehartAlgebra/Defs.lean,Mathlib/Algebra/LieRinehartAlgebra/Subalgebra.lean |
3 |
1 |
['github-actions'] |
nobody |
7-61764 7 days ago |
7-61120 7 days ago |
7-60870 7 days |
| 39798 |
vihdzp author:vihdzp |
chore: use `notation3` for `Ordinal.typeLT` |
This creates a delaborator, which avoids goals from looking like `(type fun x1 x2 ↦ x1 < x2) < (type fun x1 x2 ↦ x1 < x2)`.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
easy
maintainer-merge
|
5/1 |
Mathlib/SetTheory/Ordinal/Basic.lean |
1 |
4 |
['YaelDillies', 'github-actions', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
7-60472 7 days ago |
7-60295 7 days ago |
7-76161 7 days |
| 39856 |
b-mehta author:b-mehta |
feat(Data/Set/Restrict): extend is injective on the range |
These lemmas are placed here since that puts them close to the other `extend` lemmas, but they can't be in Logic/Function/Basic since InjOn and Set.range aren't defined there yet
---
[](https://gitpod.io/from-referrer/)
|
t-data |
15/0 |
Mathlib/Data/Set/Restrict.lean |
1 |
1 |
['github-actions'] |
nobody |
7-53120 7 days ago |
7-49976 7 days ago |
7-49726 7 days |
| 39561 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Operations): a graph is the supremum of edge graphs |
- `G = ⨆ e ∈ G.edgeSet, fromEdgeSet {e}`
- `G = sSup { edge u v | (u : V) (v : V) (_ : G.Adj u v) }`
and `edgeSet` & `fromEdgeSet` preserve sup & inf.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
51/0 |
Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean |
2 |
2 |
['b-mehta', 'github-actions'] |
nobody |
7-52738 7 days ago |
12-6191 12 days ago |
14-33912 14 days |
| 39505 |
dannyhe652 author:dannyhe652 |
feat(SimpleGraph): add Vizing's theorem for edge coloring |
Hi! I'm a high school student interested in formulization of mathematics in Lean. Recently, I have worked on a project to formulize Vizing Theorem with Daniel Raggi from Cambridge University with AI assistance. In particular, we first drafted an outline for the proof, and built the proof using Claude Opus 4.5 and 4.6. The proof is optimized using Aristotle and finally reviewed by ourselves. We rewrote some parts of the code and some comments. The code now builds cleanly and we wish this code to be reviewed by Lean Community. I am aware that there are previous attempts, some being successful, on formulizing Vizing Theorem, including this one by Arohee https://github.com/aroheebhoja/vizing. However, I believe that no PR have been made. Our proof is not based on his proof, but it could be helpful for the community to review that project as well. I sincerely thank everyone who has time to verify and review our code. A summary of the project is as follows. Please contact me if there are any questions or problems.
## Summary
This PR completes the proof of **Vizing's theorem** for edge coloring in simple graphs, proving that the chromatic index of any graph is either Δ (the maximum degree) or Δ + 1.
## Changes
### New files
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/EdgeColoring.lean`** — Core definitions
- `edgeColoring`: Type for line graph colorings
- `edgeColorable`: Graph is edge-colorable with n colors
- `chromaticIndex`: Chromatic index as ℕ
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/KempeChain.lean`** — Kempe Chain
- Coloring observables: `incidentEdges`, `incidentColors`, `missingColors`
- Kempe subgraph structure with bounded degree
- `swapKempe`: Recolor edges in a connected component via color-swapping
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/VizingFan.lean`** — Vizing Fan Rotation
- `IsFan`: Vizing fan structure with special color properties
- Fan maximality and dichotomy on terminal vertices
- `rotate_termA`: Extend coloring when a free color exists at both endpoints
- `vizingAdjacencyLemma`: Main adjacency lemma for both cases
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/VizingTheorem.lean`** — Main theorems
- `edge_eq_of_color_eq`: Proper edge colorings assign different colors to distinct edges sharing a vertex
- `maxDegree_le_chromaticIndex`: χ'(G) ≥ Δ(G)
- `chromaticIndex_bot`: Empty graph has chromatic index 0
- `vizingUpperBound_aux`: Inductive proof of upper bound on number of edge
- `vizingTheorem`: χ'(G) ∈ {Δ(G), Δ(G) + 1}
### Modified files
- `Mathlib.lean` — Added imports for the four new coloring modules
## Technical Approach
**Lower bound** (χ'(G) ≥ Δ):
- Edges incident to a max-degree vertex form a clique in the line graph
- Clique number lower-bounds chromatic number
**Upper bound** (χ'(G) ≤ Δ + 1):
- Induction on the number of edges
- Base case: empty graph colored with 0 colors
- Inductive step:
- If a free color exists at both endpoints of an edge, then extend directly
- Otherwise:
- Build a maximal fan from one endpoint
- Apply dichotomy: either extend via Term-A (free color at both endpoints) or Term-B (Kempe swap)
- Term-B uses a three-vertex connectivity argument to derive a contradiction, forcing the fan to extend
## Key Lemmas
- `incidentEdges`, `incidentColors`, `missingColors`: Coloring observables at vertices
- `kempeSubgraph`: Restricted subgraph of edges with two specific colors
- `swapKempe`: Recolor via Kempe chain swapping
- `IsFan.singleton`: Trivial fan always valid
- `IsFan.length_le_card`: Fan length is bounded by vertex count
- `IsFan.dichotomy`: Maximal fan satisfies Term-A or Term-B
- `IsFan.rotate_termA`: Term-A case extends the coloring inductively
- `vizingAdjacencyLemma`: Handles both cases for extending one edge
- `vizingUpperBound_aux`: Framework for full inductive proof
- `edge_eq_of_color_eq`: Distinctness of edges with same color
## Testing
All four modules compile with no `sorry` nor errors or warnings.
## References
* V. G. Vizing, *On an estimate of the chromatic class of a p-graph*,
Diskret. Analiz. 3 (1964), 25–30.
## Co-authors
Co-authored-by: Daniel Raggi
Co-authored-by: Aristotle (Harmonic)
Co-authored-by: Claude Opus 4.5 & 4.6
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
LLM-generated
|
1915/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/EdgeColoring.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/KempeChain.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VizingFan.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VizingTheorem.lean |
5 |
3 |
['github-actions'] |
nobody |
7-52650 7 days ago |
7-52082 7 days ago |
15-52781 15 days |
| 33313 |
SnirBroshi author: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 |
28 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'ooovi'] |
b-mehta assignee:b-mehta |
7-48821 7 days ago |
32-78039 32 days ago |
70-23980 70 days |
| 39782 |
robin-carlier author:robin-carlier |
feat(Tactic): `nonempty` attribute |
This PR adds a `nonempty` attribute. When tagging a definition of type `α` with `[nonempty]`, an instance of type `Nonempty α` is automatically generated and registered using the definition.
Such an attribute is useful in the following scenario: certain structures are not classes (e.g., to avoid data-carrying classes potentially creating diamonds), but mere existence of terms of such structures allows to derive instances about the parameters of the structure. Using `[nonempty]` lets one auto-generate the instances derived instance (provided they correctly follow from `[Nonempty _]`).
Such is the case for the `CategoryTheory.Functor.FullyFaithful` structure, which allows to derive the `Prop`-classes `CategoryTheory.Functor.Full` and `CategoryTheory.Functor.Faithful`. Currently in mathlib, most definitions of type `CategoryTheory.Functor.FullyFaithful` are immediately followed by the corresponding `Full` and `Faithful` instances, adding "boilerplate" and increasing the surface for potential mistakes (like forgetting one or both of the instances.)
The attribute uses a variation of `addRelatedDecl` called `addRelatedInstance`, which handles automatic name generation and registration of instances from a given declaration and a "constructor" of type `Expr → List Name → MetaM (Expr × List Name)`.
---
I believe abstracting `addRelatedInst` might have other possible usages: for instance, given an adjunction `adj: L ⊣ R`, it would be nice to have an attribute that one can tag on such adjunctions that automatically registers `L.IsLeftAdjoint` and `R.IsRightAdjoint`. The `nonempty` attribute here can’t really do this because `R` can’t be inferred from a goal of type `L.IsLeftAdjoint`, but the situation is quite similar, and `addRelatedInst` could also help writing this kind of attribute.
[](https://gitpod.io/from-referrer/)
|
t-meta |
320/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/NonemptyAttr.lean,Mathlib/Util/AddRelatedDecl.lean,MathlibTest/NonemptyAttr.lean |
5 |
1 |
['github-actions'] |
dwrensha assignee:dwrensha |
7-48814 7 days ago |
7-66658 7 days ago |
7-66408 7 days |
| 39809 |
zcyemi author:zcyemi |
feat(LinearAlgebra/AffineSpace/Menelaus): add Menelaus' theorem |
Add Menelaus' theorem for both `AffineSpace` and `NormedAddTorsor`.
The `AffineSpace` version includes both the forward and converse directions, while the `NormedAddTorsor` version currently includes the forward direction.
For the converse direction in the `NormedAddTorsor` setting, I am still considering the most convenient formalization for future use. One possible approach is to use `sbtw` / `¬ sbtw` to distinguish the different positional cases for points on the edges of a triangle, but this seems too complicated under permutations of the triangle vertices.
|
t-euclidean-geometry |
218/0 |
Mathlib.lean,Mathlib/Analysis/Normed/Affine/Menelaus.lean,Mathlib/LinearAlgebra/AffineSpace/Menelaus.lean,docs/1000.yaml |
4 |
1 |
['github-actions'] |
jsm28 assignee:jsm28 |
7-48812 7 days ago |
8-26395 8 days ago |
8-26145 8 days |
| 39063 |
khwilson author:khwilson |
feat(Topology/Algebra/Module/LocallyConvex): a very nice basis of locally convex spaces |
In proving facts about locally convex spaces, you often work with a basis of the neighborhoods of 0 that are open, symmetric, convex, antitone, and have the property that `V (n + 1) + V (n + 1) ⊆ V n` and `closure (V (n + 1)) ⊆ V n`.
These lemmas construct such a basis.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
137/30 |
Mathlib/Analysis/LocallyConvex/AbsConvex.lean,Mathlib/Topology/Algebra/Group/Pointwise.lean,Mathlib/Topology/Algebra/Module/LocallyConvex.lean |
3 |
10 |
['github-actions', 'j-loreaux', 'khwilson'] |
j-loreaux assignee:j-loreaux |
7-44223 7 days ago |
7-42661 7 days ago |
19-2772 19 days |
| 39722 |
kg583 author:kg583 |
feat(Combinatorics): Link `Nat.Partition` to `YoungDiagram` |
---
AI disclosure: Claude was used to source some proof sketches.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
large-import
|
120/4 |
Mathlib.lean,Mathlib/Combinatorics/Enumerative/Partition/Basic.lean,Mathlib/Combinatorics/Enumerative/Partition/Conjugate.lean,Mathlib/Combinatorics/Young/YoungDiagram.lean |
4 |
36 |
['NoahW314', 'github-actions', 'kg583', 'wwylele'] |
nobody |
7-42131 7 days ago |
8-67394 8 days ago |
10-57258 10 days |
| 39789 |
vihdzp author:vihdzp |
feat: a cofinal set has a cofinal subset of order type `(cof α).ord` |
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
maintainer-merge
|
38/20 |
Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Cofinality/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality/Ordinal.lean,Mathlib/SetTheory/Ordinal/Basic.lean |
4 |
7 |
['YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
nobody |
7-31904 7 days ago |
7-32061 7 days ago |
8-43269 8 days |
| 38275 |
TTony2019 author: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
|
283/41 |
Mathlib/Analysis/Convex/Intrinsic.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/LinearAlgebra/AffineSpace/Restrict.lean,Mathlib/Topology/Algebra/AffineSubspace.lean,Mathlib/Topology/Homeomorph/Defs.lean |
5 |
29 |
['TTony2019', 'github-actions', 'imathwy', 'j-loreaux', 'themathqueen'] |
j-loreaux assignee:j-loreaux |
7-23557 7 days ago |
7-23557 7 days ago |
24-11084 24 days |
| 39693 |
yuanyi-350 author:yuanyi-350 |
feat(Combinatorics/Enumerative/Bell): sum over partition shapes |
Kill TODO in `Mathlib/Combinatorics/Enumerative/Bell.lean` which proves `Nat.bell` as a sum of `Multiset.bell` over partition shapes
---
Migrated from #37690
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
maintainer-merge
|
128/35 |
Mathlib/Combinatorics/Enumerative/Bell.lean |
1 |
6 |
['YaelDillies', 'github-actions'] |
nobody |
7-18572 7 days ago |
10-942 10 days ago |
11-11511 11 days |
| 39600 |
plp127 author:plp127 |
chore(Topology/Compactness/CountablyCompact): generalize theorem |
Generalize theorem `Topology.IsEmbedding.isSeqCompact_iff` to `Topology.IsInducing.isSeqCompact_iff` by replacing `IsEmbedding` by `IsInducing`.
Also fix capitalization error.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
10/4 |
Mathlib/Topology/Compactness/CountablyCompact.lean |
1 |
5 |
['grunweg', 'plp127', 'themathqueen'] |
nobody |
7-12332 7 days ago |
9-60205 9 days ago |
12-35824 12 days |
| 38950 |
smmercuri author:smmercuri |
chore(Algebra): `coe_algHom` -> `coe_toAlgHom` |
---
There are also instances of `coe_ringHom`, `coe_linearMap` etc which I can fix in follow-up PRs
[](https://gitpod.io/from-referrer/)
|
|
78/64 |
Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Centralizer.lean,Mathlib/Algebra/Azumaya/Basic.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/AlgebraicGeometry/AffineSpace.lean,Mathlib/Analysis/CStarAlgebra/GelfandDuality.lean,Mathlib/FieldTheory/Extension.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Isaacs.lean,Mathlib/FieldTheory/KummerExtension.lean,Mathlib/FieldTheory/LinearDisjoint.lean,Mathlib/FieldTheory/Minpoly/Field.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/LinearAlgebra/Charpoly/Basic.lean,Mathlib/LinearAlgebra/TensorProduct/Subalgebra.lean,Mathlib/NumberTheory/Cyclotomic/Gal.lean,Mathlib/RingTheory/Algebraic/MvPolynomial.lean,Mathlib/RingTheory/Bialgebra/Equiv.lean,Mathlib/RingTheory/Bialgebra/Hom.lean,Mathlib/RingTheory/DividedPowerAlgebra/Init.lean,Mathlib/RingTheory/Extension/Presentation/Basic.lean,Mathlib/RingTheory/Extension/Presentation/Core.lean,Mathlib/RingTheory/GradedAlgebra/AlgHom.lean,Mathlib/RingTheory/GradedAlgebra/TensorProduct.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/FundamentalTheorem.lean,Mathlib/RingTheory/NoetherNormalization.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Factorization.lean,Mathlib/RingTheory/Smooth/Basic.lean,Mathlib/RingTheory/Smooth/IntegralClosure.lean,Mathlib/RingTheory/TensorProduct/Maps.lean |
33 |
6 |
['github-actions', 'j-loreaux', 'mathlib-merge-conflicts'] |
nobody |
7-4630 7 days ago |
7-2158 7 days ago |
22-74481 22 days |
| 39870 |
YaelDillies author:YaelDillies |
feat(Data): interleaving lists |
Define interleaving of lists, both as an operation and as a relation.
This will be used to define interleaving polynomials, which in turn are a central concept in the line of work that earned June Huh his 2022 Fields medal.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
119/0 |
Mathlib.lean,Mathlib/Data/List/Interleave.lean |
2 |
1 |
['github-actions'] |
nobody |
7-494 7 days ago |
6-86324 6 days ago |
6-86074 6 days |
| 36814 |
YaelDillies author: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 |
41/32 |
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 |
7 |
9 |
['SnirBroshi', 'YaelDillies', 'b-mehta', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts'] |
nobody |
6-85647 6 days ago |
6-85037 6 days ago |
69-31145 69 days |
| 39864 |
8e7 author:8e7 |
feat(Combinatorics/SimpleGraph/Acyclic): helly property on subtrees |
This PR adds several lemmas regarding connected subsets of vertices in trees (subtrees). The main result is the Helly property for subtrees: For a finite set of subtrees, if any pair of subtrees intersect, then there is a common vertex in all subtrees.
This lemma is part of an effort to formalize tree decompositions (see #38334), and will be used in a future PR to prove `G.cliqueNum - 1 <= G.treeWidth`.
AI Usage: The proofs were developed with the help of Claude Code. I vouch for all the code written and understand the content fully.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
LLM-generated
|
114/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean |
2 |
2 |
['github-actions'] |
nobody |
6-85025 6 days ago |
7-19494 7 days ago |
7-19244 7 days |
| 39709 |
justus-springer author:justus-springer |
feat(RingTheory/): `MvPolynomial` is standard smooth |
Add the trivial submersive presentation for `MvPolynomial` and show that `MvPolynomial` is standard smooth over its base ring. This will be used to show that affine space is smooth in #39710.
- [x] depends on: #39708
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
47/0 |
Mathlib/RingTheory/Extension/Presentation/Basic.lean,Mathlib/RingTheory/Extension/Presentation/Submersive.lean,Mathlib/RingTheory/Smooth/StandardSmooth.lean |
3 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
6-72509 6 days ago |
6-72517 6 days ago |
6-74361 6 days |
| 39110 |
SnirBroshi author:SnirBroshi |
chore(Data/Set): reduce defeq abuse of `Set α = α → Prop` |
These are among the first places that would fail if `Set α` wasn't defeq to `α → Prop`.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
35/20 |
Mathlib/Data/Set/Basic.lean,Mathlib/Data/Set/Defs.lean,Mathlib/Data/Set/Insert.lean,Mathlib/Data/Set/Prod.lean,Mathlib/Order/BooleanAlgebra/Set.lean |
5 |
24 |
['SnirBroshi', 'Vierkantor', 'github-actions', 'leanprover-radar', 'mathlib-bors', 'themathqueen', 'urkud', 'vihdzp'] |
urkud assignee:urkud |
6-70938 6 days ago |
17-624 17 days ago |
23-4242 23 days |
| 39855 |
b-mehta author:b-mehta |
feat(InfiniteSum): zero function has product zero |
Prove that in a comm monoid with zero, the product of the zero function is zero.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
13/0 |
Mathlib/Topology/Algebra/InfiniteSum/Basic.lean |
1 |
3 |
['b-mehta', 'github-actions', 'plp127'] |
nobody |
6-56858 6 days ago |
6-55332 6 days ago |
7-20392 7 days |
| 37062 |
tannerduve author: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 assignee:Komyyy |
6-49973 6 days ago |
49-63788 49 days ago |
50-53886 50 days |
| 39895 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Normed/Module/MStructure` |
- refactors `Normed/Module/MStructure` by replacing a norm-zero argument with `nlinarith` and shortening the proof of `QP_eq_QPQ`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
6/10 |
Mathlib/Analysis/Normed/Module/MStructure.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49823 6 days ago |
6-50369 6 days ago |
6-50119 6 days |
| 39897 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Normed/Ring/Basic` |
- refactors `Normed/Ring/Basic` by removing redundant nonempty-case splits from `Real.iSup_fun_mul_eq_iSup_mul_iSup_of_nonneg`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
0/4 |
Mathlib/Analysis/Normed/Ring/Basic.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49821 6 days ago |
6-50240 6 days ago |
6-49990 6 days |
| 39894 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Normed/Lp/WithLp` |
- refactors `Normed/Lp/WithLp` by deriving scalar tower and scalar commutation instances from `WithLp.equiv`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
4/8 |
Mathlib/Analysis/Normed/Lp/WithLp.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49571 6 days ago |
6-50270 6 days ago |
6-50020 6 days |
| 39896 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Normed/Operator/ContinuousLinearMap` |
- refactors `Normed/Operator/ContinuousLinearMap` by reusing `mkContinuous` in bounded linear continuity proofs and shortening `homothety_inverse`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
5/16 |
Mathlib/Analysis/Normed/Operator/ContinuousLinearMap.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49496 6 days ago |
6-50219 6 days ago |
6-49969 6 days |
| 39898 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Normed/Unbundled/AlgebraNorm` |
- refactors `Normed/Unbundled/AlgebraNorm` by using structure inheritance in `MulRingNorm.toRingNorm`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
1/5 |
Mathlib/Analysis/Normed/Unbundled/AlgebraNorm.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49257 6 days ago |
6-50249 6 days ago |
6-49999 6 days |
| 39899 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Normed/Unbundled/FiniteExtension` |
- refactors `Normed/Unbundled/FiniteExtension` by proving `Basis.norm_smul` via `Finset.mul₀_sup'`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
4/15 |
Mathlib/Analysis/Normed/Unbundled/FiniteExtension.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49117 6 days ago |
6-50323 6 days ago |
6-50073 6 days |
| 39900 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral` |
- refactors `Gaussian/GaussianIntegral` by proving `integral_gaussian_complex_Ioi` using `integral_comp_neg_Ioi`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
13/20 |
Mathlib/Analysis/SpecialFunctions/Gaussian/GaussianIntegral.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
6-49014 6 days ago |
6-49891 6 days ago |
6-49641 6 days |
| 38881 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic` |
- shortens `stronglyMeasurable_in_set` by inlining the restricted approximation sequence and folding the `hg_eq` / `hg_zero` helper lemmas into the two `by_cases` branches
Extracted from #38104
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
t-measure-probability
|
7/13 |
Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
RemyDegenne assignee:RemyDegenne |
6-48518 6 days ago |
30-2905 30 days ago |
30-2655 30 days |
| 39185 |
ooovi author:ooovi |
feat(Geometry/Convex/Cone/Pointed): faces 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.
Co-authored-by: Martin Winter
---
split off of #33664
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
289/0 |
Mathlib.lean,Mathlib/Geometry/Convex/Cone/Face/Basic.lean |
2 |
4 |
['YaelDillies', 'github-actions', 'martinwintermath', 'mathlib-bors'] |
YaelDillies assignee:YaelDillies |
6-15156 6 days ago |
6-15156 6 days ago |
6-16194 6 days |
| 39067 |
mbkybky author:mbkybky |
feat(Algebra/Module): define modules admitting finite free resolutions |
We say that an `R`-module `M` has a finite free resolution if there exists an exact sequence `0 ⟶ Eₙ ⟶ ⋯ ⟶ E₀ ⟶ M ⟶ 0` such that `Eᵢ` are finite free `R`-modules.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
186/0 |
Mathlib.lean,Mathlib/Algebra/Module/Equiv/Defs.lean,Mathlib/Algebra/Module/FiniteFreeResolution/Basic.lean |
3 |
1 |
['github-actions'] |
nobody |
6-14459 6 days ago |
6-12049 6 days ago |
25-6309 25 days |
| 39369 |
pd4st8hb95-hub author:pd4st8hb95-hub |
feat: add basic fuzzy set definitions |
This PR adds a minimal `FuzzySet` API in `Mathlib/Order/FuzzySet`.
A fuzzy set is represented as an abbreviation:
`FuzzySet α L := α → L`
The file provides basic definitions and lemmas:
- `degree`
- `support`
- `core`
- `weakCut`
- `strongCut`
- membership simp lemmas
- extensionality
- basic monotonicity lemmas for weak and strong cuts
This PR intentionally does not add complement, union/intersection-specific API, normal or convex fuzzy sets, fuzzy relations, or advanced fuzzy set theory.
Validation:
- `lake build Mathlib.Order.FuzzySet`
- `#lint only docBlame docBlameThm`
Feedback on whether `Mathlib/Order/FuzzySet.lean` is the right location for this minimal API would be appreciated.
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
169/0 |
Mathlib.lean,Mathlib/Order/FuzzySet.lean |
2 |
6 |
['github-actions', 'grunweg', 'pd4st8hb95-hub', 'wwylele'] |
nobody |
6-6278 6 days ago |
6-5597 6 days ago |
16-85338 16 days |
| 39307 |
FordUniver author:FordUniver |
feat(Combinatorics/SimpleGraph/Copy): introduce `UnlabeledCopy` carrier subtype |
Adds `abbrev UnlabeledCopy A B := {B' : B.Subgraph // Nonempty (A ≃g B'.coe)}` and uses it to replace the previous inline filter-set body of `copyCount G H`. Drops the now unused legacy Finset-image bridge `copyCount_eq_card_image_copyToSubgraph`. Adds `uniqueUnlabeledCopyBot` instance so `copyCount_bot` is a one-liner via `Fintype.card_unique`.
Co-authored-by: Malte Jackisch <45597826+MaltyBlanket@users.noreply.github.com>
---
**Step 1/5 of the `Copy` / `InducedCopy` refactor-feat stack.**
This PR isolates the `UnlabeledCopy` type introduction and the count's type-form redefinition from the larger rename/convention work in the rest of the stack. Note that resolving the current clash in naming (`Copy` and `UnlabeledCopy` vs `labelledCopyCount` and `copyCount`) is part of #38745.
|
t-combinatorics
maintainer-merge
|
32/30 |
Mathlib/Combinatorics/SimpleGraph/Copy.lean |
1 |
8 |
['FordUniver', 'YaelDillies', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts', 'mitchell-horner'] |
nobody |
6-1909 6 days ago |
8-27638 8 days ago |
18-34320 18 days |
| 39288 |
FordUniver author:FordUniver |
feat(Combinatorics/SimpleGraph/Subgraph): add `Embedding.ofIsInduced` and `IsInduced.map` |
Three additions to the `SimpleGraph.Subgraph` API for induced subgraphs. `Embedding.ofIsInduced` is the canonical embedding of an induced subgraph into its ambient graph, paired with `toHom_ofIsInduced` and `ofIsInduced_apply` lemmas. This is the embedding counterpart of `Subgraph.hom`, which only produces a homomorphism because non-induced subgraphs do not reflect adjacency. `Subgraph.IsInduced.map` then records that the image of an induced subgraph under a graph embedding is induced, strengthened to `IsInduced.map_iff` for the iso case.
Co-authored-by: Malte Jackisch <45597826+MaltyBlanket@users.noreply.github.com>
---
**Orthogonal pre-requisite of the `Copy` / `InducedCopy` refactor-feat stack.**
Extracted as a prerequisite from #38631 that is otherwise independent of the wider `Copy` / `InducedCopy` refactor-feat stack. |
t-combinatorics |
27/4 |
Mathlib/Combinatorics/SimpleGraph/Copy.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean |
2 |
16 |
['FordUniver', 'SnirBroshi', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] |
nobody |
6-1373 6 days ago |
8-27244 8 days ago |
19-60722 19 days |
| 39690 |
b-mehta author:b-mehta |
feat(Analysis/Complex/Exponential): add new bounds on exponential |
We add new upper bounds on Real.exp in terms of 2x/(2+x), and use these to move some bounds on log higher in mathlib.
We also add a lemma for the common bound (1+1/n)^n <= e, though this is a special-case of `one_sub_div_pow_le_exp_neg` (immediately before), but is added for convenience and discoverability, as this is a "well-known" bound.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
36/11 |
Mathlib/Analysis/Complex/Exponential.lean,Mathlib/Analysis/Complex/ExponentialBounds.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Log/Deriv.lean |
4 |
3 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
5-86074 5 days ago |
5-84915 5 days ago |
9-51593 9 days |
| 39935 |
FordUniver author:FordUniver |
feat(Combinatorics/SimpleGraph/Finite): LocallyFiniteOrder |
Adds an order-theoretic `LocallyFiniteOrder (SimpleGraph V)` instance (closed intervals are finite), distinct from the existing graph-theoretic `LocallyFinite` (vertex degrees) already in this file. The instance takes `DecidableLE` as an explicit hypothesis rather than routing through `Classical`, because per-graph `DecidableRel G.Adj` is value-dependent and cannot be a free global instance.
Co-authored-by: Malte Jackisch <45597826+MaltyBlanket@users.noreply.github.com>
---
Came up while writing a Möbius inversion between copy counts and induced copy counts ([WIP](https://github.com/FordUniver/mathlib4/pull/36/changes)) that sums over the closed interval `Finset.Icc G ⊤` of supergraphs. Decidability of the order plus local-finiteness of the lattice felt like a clean standalone piece to land first, before the rest of the Möbius file.
Less sure about what the conventions for declaring type class instances are in mathlib, let me know if this is not of the expected shape or should not be included at all. |
t-combinatorics |
20/0 |
Mathlib/Combinatorics/SimpleGraph/Finite.lean |
1 |
1 |
['github-actions'] |
nobody |
5-83189 5 days ago |
5-83706 5 days ago |
5-83456 5 days |
| 39907 |
Hagb author:Hagb |
feat(Order/InititalSeg): `PrincipalSeg` is trichotomous for well orders |
For any two well orders, one is a principal segment of the other, or they are isomorphic.
Suggested by @vihdzp in the review of #39545
https://github.com/leanprover-community/mathlib4/pull/39545#discussion_r3262466782. It may slightly simplify the proof of `infinite_iff_nonempty_relEmbedding_of_isWellOrder`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
7/0 |
Mathlib/Order/InitialSeg.lean |
1 |
1 |
['github-actions', 'vihdzp'] |
nobody |
5-81201 5 days ago |
6-26771 6 days ago |
6-32336 6 days |
| 37071 |
ericluap author:ericluap |
feat: Dedekind completion of rationals is isomorphic to EReal |
|
t-order
new-contributor
|
128/4 |
Mathlib.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/DedekindCut.lean,Mathlib/Order/Completion.lean |
4 |
59 |
['ericluap', 'github-actions', 'plp127', 'vihdzp', 'wwylele'] |
vihdzp assignee:vihdzp |
5-70821 5 days ago |
21-81979 21 days ago |
44-72953 44 days |
| 39724 |
vihdzp author:vihdzp |
feat: finite sets are closed under directed suprema |
As are chains of length ≤ ω.
---
We don't prove `Set.Finite.dirSupClosed` via `DirectedOn.finite_le`, in order to save a few imports.
[](https://gitpod.io/from-referrer/)
|
file-removed
t-order
|
239/31 |
Mathlib.lean,Mathlib/Data/Fintype/Order.lean,Mathlib/Order/Cofinal.lean,Mathlib/Order/DirSupClosed/Basic.lean,Mathlib/Order/DirSupClosed/Finite.lean,Mathlib/Order/IsNormal.lean,Mathlib/SetTheory/Cardinal/Cofinality/Club.lean,Mathlib/SetTheory/Cardinal/Cofinality/Ordinal.lean,Mathlib/Topology/Order/ScottTopology.lean |
9 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
5-69759 5 days ago |
5-66606 5 days ago |
8-79973 8 days |
| 35217 |
kim-em author: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
|
98/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 |
17 |
['eric-wieser', 'github-actions', 'kim-em', 'mathlib-merge-conflicts', 'themathqueen'] |
thorimur assignee:thorimur |
5-69551 5 days ago |
5-64349 5 days ago |
20-43943 20 days |
| 39865 |
eliasjudin author:eliasjudin |
feat(Algebra): add eval API parity lemmas |
Adds two eval API parity lemmas from #23044: `MvPolynomial.hom_eval₂`, parallel to `Polynomial.hom_eval₂`, and `Polynomial.eval₂RingHom_comp_C`, parallel to `MvPolynomial.eval₂Hom_comp_C`.
This addresses the eval portion of #23044; the degree-name discussion there is left for separate work.
|
t-algebra
new-contributor
label:t-algebra$ |
10/0 |
Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/Polynomial/Eval/Defs.lean |
2 |
2 |
['github-actions'] |
nobody |
5-65891 5 days ago |
7-21411 7 days ago |
7-21161 7 days |
| 37870 |
Jun2M author: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 |
92/0 |
Mathlib.lean,Mathlib/Combinatorics/Graph/Simple.lean |
2 |
8 |
['Jun2M', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts'] |
YaelDillies assignee:YaelDillies |
5-65630 5 days ago |
5-72770 5 days ago |
51-75780 51 days |
| 39802 |
vihdzp author:vihdzp |
feat: more theorems on `toBoolRing` |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
23/0 |
Mathlib/Algebra/Ring/BooleanRing.lean |
1 |
3 |
['github-actions', 'plp127'] |
nobody |
5-62495 5 days ago |
5-61734 5 days ago |
7-15414 7 days |
| 39727 |
vihdzp author:vihdzp |
feat: stationary sets |
We define stationary sets as sets intersecting all club sets, and prove basic theorems about them.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
maintainer-merge
|
154/22 |
Mathlib/Order/Cofinal.lean,Mathlib/SetTheory/Cardinal/Cofinality/Club.lean |
2 |
7 |
['YaelDillies', 'github-actions', 'vihdzp'] |
nobody |
5-61535 5 days ago |
5-60824 5 days ago |
10-47458 10 days |
| 38231 |
NoneMore author: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 |
5-50150 5 days ago |
44-34148 44 days ago |
44-33898 44 days |
| 38815 |
dagurtomas author: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 |
5-50146 5 days ago |
31-72351 31 days ago |
31-72101 31 days |
| 32282 |
jsm28 author: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'] |
eric-wieser assignee:eric-wieser |
5-49008 5 days ago |
66-74102 66 days ago |
66-73852 66 days |
| 35868 |
Raph-DG author: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'] |
alreadydone assignee:alreadydone |
5-49006 5 days ago |
32-21826 32 days ago |
37-83985 37 days |
| 37714 |
mortarsanjaya author: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
label:t-algebra$ |
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'] |
riccardobrasca assignee:riccardobrasca |
5-49000 5 days ago |
32-9520 32 days ago |
56-3387 56 days |
| 38049 |
WilliamCoram author: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'] |
riccardobrasca assignee:riccardobrasca |
5-48998 5 days ago |
45-68151 45 days ago |
48-77068 48 days |
| 38432 |
SnirBroshi author: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'] |
fpvandoorn assignee:fpvandoorn |
5-48996 5 days ago |
34-26409 34 days ago |
39-44253 39 days |
| 39294 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): prove LanguageOn monotonicity under intersection |
In symbolic dynamics.
This PR proves that taking the language over a finite shape is monotone with respect to intersections of configuration sets:
```math
\mathrm{LanguageOn}(X \cap Y)\, U
\subseteq
\mathrm{LanguageOn}\, X\, U \cap \mathrm{LanguageOn}\, Y\, U
```
The proof is a direct unfolding of definitions: a pattern in the language of `X ∩ Y` comes from restricting a configuration `x ∈ X ∩ Y`. Since such an `x` belongs simultaneously to `X` and `Y`, the same restriction witness gives membership both in `LanguageOn X U` and in `LanguageOn Y U`, yielding membership in their intersection.
Related to issue #39252 |
t-dynamics
new-contributor
|
9/1 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
2 |
['github-actions'] |
ADedecker assignee:ADedecker |
5-48992 5 days ago |
20-16885 20 days ago |
20-16635 20 days |
| 39473 |
faenuccio author:faenuccio |
feat(Topology.Homeomorph.Lemmas): add lemmas about `coe` and `IsHomeomorph` |
Add lemmas `IsHomeomorph.coe_equiv` and `IsHomeomorph.coe_inv`
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
7/1 |
Mathlib/Topology/Homeomorph/Lemmas.lean |
1 |
2 |
['ADedecker', 'github-actions'] |
alreadydone assignee:alreadydone |
5-48989 5 days ago |
16-58349 16 days ago |
16-66698 16 days |
| 39903 |
akiezun author:akiezun |
feat(NumberTheory): add almost prime numbers |
Adds Nat.IsAlmostPrime k n for natural numbers with exactly k prime factors counted with multiplicity, plus
Nat.IsAtMostAlmostPrime and Nat.IsSemiprime. The definitions reuse the existing arithmetic function Ω, and the initial
API proves the basic zero/one cases, prime examples, and closure under multiplication.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-number-theory
|
87/0 |
Mathlib.lean,Mathlib/NumberTheory/AlmostPrime.lean |
2 |
5 |
['SnirBroshi', 'akiezun', 'github-actions', 'vihdzp'] |
loefflerd assignee:loefflerd |
5-48985 5 days ago |
6-49822 6 days ago |
6-49572 6 days |
| 38200 |
Parcly-Taxel author:Parcly-Taxel |
feat: Turán numbers and their strict monotonicity |
`strictMonoOn_turanNumber` was initially proved by @Aristotle-Harmonic, then hand-polished.
Co-authored-by: Aristotle (Harmonic) |
t-combinatorics |
45/21 |
Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean |
1 |
5 |
['Parcly-Taxel', 'github-actions', 'mathlib-merge-conflicts', 'tb65536'] |
nobody |
5-37071 5 days ago |
5-36373 5 days ago |
43-61074 43 days |
| 38086 |
dagurtomas author:dagurtomas |
feat(CategoryTheory): composition of profunctors |
---
- [x] depends on: #38085
- [x] depends on: #38382
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
365/0 |
Mathlib.lean,Mathlib/CategoryTheory/Profunctor/Comp.lean,Mathlib/Logic/Relation.lean |
3 |
16 |
['adamtopaz', 'dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'robin-carlier'] |
robin-carlier assignee:robin-carlier |
5-32349 5 days ago |
5-28366 5 days ago |
18-48713 18 days |
| 39133 |
Thmoas-Guan author:Thmoas-Guan |
feat(Algebra/ModuleCat): exactness of restrictScalars for general universe level |
Currently exactness of `ModuleCat.restrictScalars` is synth via being adjoint functor, however this needs the universe level to be some `max u v` where `u` is the universe level of the ring. Here we provide exactness of restrictScalars for general universe level using it preserves short exact sequence.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
46/0 |
Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/ChangeOfRingsExact.lean |
2 |
1 |
['github-actions'] |
nobody |
5-31566 5 days ago |
5-30850 5 days ago |
23-34439 23 days |
| 37374 |
NoneMore author: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 |
7 |
['NoneMore', 'github-actions', 'plp127', 'vihdzp'] |
fpvandoorn assignee:fpvandoorn |
5-29706 5 days ago |
5-28990 5 days ago |
62-76175 62 days |
| 38596 |
JJYYY-JJY author:JJYYY-JJY |
Add basic row-equivalence and echelon-form API for matrices |
This PR adds the first foundational slice of `Mathlib.LinearAlgebra.Matrix.Echelon`, a theorem-oriented API for elementary row operations, row-equivalence, and echelon-form predicates for matrices.
The main additions are:
* elementary row-scaling matrices and their `GL` versions;
* `Matrix.RowEquivalent` for the left action of `GL m R` on rectangular matrices;
* row-zero, pivot, echelon, and reduced-echelon predicates;
* semantic representative predicates `Matrix.IsEchelonFormOf` and `Matrix.IsReducedEchelonFormOf`.
This intentionally stops before row-space characterizations, existence and uniqueness of reduced echelon representatives, and the noncomputable canonical representative `Matrix.rref`; those are planned for later PRs.
Co-authored-by: Joseph Qian
Co-authored-by: Veer Shukla
Co-authored-by: Dhruv Bhatia
Co-authored-by: Zheng Wu <1036819072@qq.com>
---
This update trims the original full row-reduction API in response to reviewer feedback that the PR was too large. It keeps only the foundation needed by later row-reduction and `rref` PRs. |
t-algebra
new-contributor
label:t-algebra$ |
312/6 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Echelon.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean |
3 |
10 |
['JJYYY-JJY', 'SnirBroshi', 'copilot-pull-request-reviewer', 'dagurtomas', 'github-actions', 'wwylele'] |
nobody |
5-29169 5 days ago |
19-51357 19 days ago |
27-28219 27 days |
| 39841 |
hawkrobe author:hawkrobe |
feat(RingTheory/HopfAlgebra): Construction on primitive elements |
Adds `HopfAlgebra.ofPrimitives` which builds a Hopf algebra structure on a bialgebra generated by primitive elements, given a candidate anti-algebra hom that sends each generator to its negation.
---
The commutative case with `.ofAlgHom` gets this for free via `ext` but the non-commutative case needs extra work.
* [ ] depends on: #39785 |
t-ring-theory
new-contributor
|
314/20 |
Mathlib.lean,Mathlib/RingTheory/Bialgebra/Primitive.lean,Mathlib/RingTheory/HopfAlgebra/Basic.lean,Mathlib/RingTheory/HopfAlgebra/Generators.lean,Mathlib/RingTheory/HopfAlgebra/Primitive.lean,Mathlib/RingTheory/HopfAlgebra/TensorProduct.lean |
6 |
2 |
['github-actions'] |
nobody |
5-26304 5 days ago |
5-65422 5 days ago |
7-58447 7 days |
| 38052 |
WenrongZou author: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 |
253/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 |
19 |
['WenrongZou', 'eric-wieser', 'github-actions', 'mariainesdff', 'mathlib-merge-conflicts'] |
mattrobball assignee:mattrobball |
5-21782 5 days ago |
5-21049 5 days ago |
48-22945 48 days |
| 38228 |
kim-em author: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
-----------
- [x] depends on: leanprover-community/mathlib-ci#28 |
CI |
83/2 |
.github/workflows/PR_summary.yml,bors.toml |
2 |
9 |
['github-actions', 'grunweg', 'jcommelin', 'joneugster', 'kim-em', 'mathlib-dependent-issues'] |
Vierkantor and jcommelin assignee:Vierkantor assignee:jcommelin |
5-17699 5 days ago |
5-17116 5 days ago |
18-5470 18 days |
| 38594 |
ScottCarnahan author:ScottCarnahan |
feat(Algebra/Lie): grading on loop algebras |
In this PR we introduce a decomposition of a tensor product of modules induced by a decomposition of the module on the left side. This is used to produce the canonical "energy" grading on a loop Lie algebra. This will (eventually) give us the "energy" grading on smooth representations of affine algebras.
---
Should I make the tensor decomposition more ring-polymorphic?
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
144/9 |
Mathlib/Algebra/Lie/Loop.lean,Mathlib/LinearAlgebra/DirectSum/TensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct/Decomposition.lean,Mathlib/LinearAlgebra/TensorProduct/Map.lean |
4 |
1 |
['github-actions'] |
ocfnash assignee:ocfnash |
5-15281 5 days ago |
5-50764 5 days ago |
5-50514 5 days |
| 39202 |
FordUniver author:FordUniver |
feat(Analysis/Calculus/Gradient): add `toDual_gradient` and companions |
Add `toDual_gradient`, `toDual_gradientWithin`, and the composed variants `toDual_comp_gradient`, `toDual_comp_gradientWithin` — the natural inverse direction of the gradient's defining equation `∇ f x := (toDual 𝕜 F).symm (fderiv 𝕜 f x)`. These identify `(toDual 𝕜 F) (∇ f x)` with `fderiv 𝕜 f x` (and the `gradientWithin` and composed forms with the corresponding fderiv versions), making the Riesz isomorphism between the two derivative views explicit. The proofs of `DifferentiableAt.hasGradientAt` and `DifferentiableWithinAt.hasGradientWithinAt` in the same file are simplified to use them.
Co-authored-by: Sebastian Pokutta <23001135+pokutta@users.noreply.github.com>
---
Came up while formalizing the descent lemma for Lipschitz-smooth functions, where being able to switch between `LipschitzWith K (fderiv ℝ f)` and `LipschitzWith K (∇ f)` is helpful, which with this PR becomes `toDual_comp_gradient ▸ (toDual ℝ F).isometry.lipschitzWith_iff K`. Also slightly simplifies two call sites in mathlib. |
maintainer-merge |
20/5 |
Mathlib/Analysis/Calculus/Gradient/Basic.lean |
1 |
5 |
['FordUniver', 'Komyyy', 'github-actions'] |
nobody |
5-13013 5 days ago |
15-74037 15 days ago |
21-85239 21 days |
| 39707 |
sorrachai author:sorrachai |
chore(Data/Tree/Basic): Rename Tree to BinaryTree |
Rename `Tree` to `BinaryTree`.
This frees up the name `Tree` to cover n-ary trees in future.
We only deprecate the `def`s, and move the theorems without deprecation. |
new-contributor
t-data
|
157/62 |
Mathlib/Combinatorics/Enumerative/Catalan/Tree.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Data/Tree/Basic.lean,Mathlib/Data/Tree/Get.lean,Mathlib/Data/Tree/Traversable.lean,Mathlib/Tactic/CancelDenoms/Core.lean,docs/overview.yaml |
7 |
36 |
['b-mehta', 'eric-wieser', 'github-actions', 'sorrachai'] |
nobody |
5-8841 5 days ago |
5-8082 5 days ago |
8-82518 8 days |
| 36739 |
mbkybky author: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.
- [x] depends on: #37627
- [x] depends on: #38933
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
208/2 |
Mathlib.lean,Mathlib/RingTheory/Ideal/Height.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/UFD.lean,Mathlib/RingTheory/Localization/Away/Basic.lean,Mathlib/RingTheory/Localization/Away/Lemmas.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Localization.lean |
7 |
28 |
['chrisflav', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mbkybky', 'tb65536'] |
chrisflav assignee:chrisflav |
5-8693 5 days ago |
7-31130 7 days ago |
70-61231 70 days |
| 39975 |
gasparattila author:gasparattila |
chore: tag `(Continuous)LinearEquiv.prodCongr_symm` with `@[simp]` |
This is consistent with the other `prodCongr`s. Note that this also changes the type of `PiLp.sumPiLpEquivProdLpPiLp_symm_apply_ofLp`, which is now fully simplified.
---
[](https://gitpod.io/from-referrer/)
|
|
5/5 |
Mathlib/LinearAlgebra/Prod.lean,Mathlib/MeasureTheory/Measure/Haar/InnerProductSpace.lean,Mathlib/Topology/Algebra/Module/Equiv.lean |
3 |
1 |
['github-actions'] |
nobody |
5-2793 5 days ago |
5-329 5 days ago |
5-79 5 days |
| 39973 |
tb65536 author:tb65536 |
chore(Topology/Algebra/Category/ProfiniteGrp/*): to_additivize some declarations |
This PR to_additivizes some declarations relating to profinite groups. There were a few trickier declarations that I left out of this PR for now.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-group-theory
t-topology
label:t-algebra$ |
28/3 |
Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean,Mathlib/Topology/Algebra/Category/ProfiniteGrp/Completion.lean,Mathlib/Topology/Algebra/Category/ProfiniteGrp/Limits.lean |
3 |
2 |
['github-actions'] |
nobody |
5-2473 5 days ago |
5-2473 5 days ago |
5-2223 5 days |
| 39206 |
FordUniver author:FordUniver |
feat(Analysis/Calculus/AddTorsor/AffineMap): smoothness of `AffineMap.lineMap` |
Add `AffineMap.lineMap_contDiff_uncurry` (joint smoothness in all three arguments), `AffineMap.lineMap_contDiff` (smoothness in the parameter with fixed endpoints), and the composition family `ContDiff.lineMap`, `ContDiffOn.lineMap`, `ContDiffAt.lineMap`, `ContDiffWithinAt.lineMap`, mirroring the corresponding `Continuous` family in `Mathlib.Topology.Algebra.Affine`. The uncurried and `ContDiffWithinAt` forms are tagged `@[fun_prop]` so the rest are automatically derivable. Closes the TODO at `Mathlib.MeasureTheory.Integral.CurveIntegral.Poincare:333` where the proof now reduces to `fun_prop`.
Co-authored-by: Sebastian Pokutta <23001135+pokutta@users.noreply.github.com>
---
Came up while formalizing the descent lemma for Lipschitz-smooth functions, where `Path.segment a b` being smooth on the unit interval is needed to apply FTC along the segment (#39524); `AffineMap.lineMap_contDiff` is the lemma directly used there. Two things I was genuinely not quite sure about:
1. Should the **three convenience variants** `ContDiffAt.lineMap`, `ContDiffOn.lineMap`, and `ContDiff.lineMap` be included? They are not strictly necessary but they exist for users wanting to write `h₁.lineMap h₂ hg` in dot notation by hand, and they mirror the convention of the `Continuous.lineMap` family.
2. Is `Mathlib.Analysis.Calculus.AddTorsor.AffineMap` the **right home**, and is adding `public import Mathlib.Analysis.Calculus.AddTorsor.AffineMap` to `Poincare.lean` to close the TODO reasonable? The placement mirrors the `Continuous.lineMap` family in `Mathlib.Topology.Algebra.Affine`, but hiding a `@[fun_prop]` in a file at the bottom of the hierarchy and needing to import it feels a bit off. |
t-analysis
maintainer-merge
|
57/6 |
Mathlib/Analysis/Calculus/AddTorsor/AffineMap.lean,Mathlib/MeasureTheory/Integral/CurveIntegral/Poincare.lean |
2 |
8 |
['EtienneC30', 'FordUniver', 'github-actions'] |
EtienneC30 assignee:EtienneC30 |
4-83347 4 days ago |
8-26995 8 days ago |
21-8467 21 days |
| 37183 |
dagurtomas author: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
|
301/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/Map.lean,MathlibTest/CategoryTheory/MapSimp.lean |
5 |
13 |
['adamtopaz', 'dagurtomas', 'github-actions', 'joelriou'] |
kim-em assignee:kim-em |
4-82490 4 days ago |
5-31002 5 days ago |
67-73466 67 days |
| 37344 |
vihdzp author:vihdzp |
feat: monotone function `Cardinal → α` is eventually constant |
---
- [x] depends on: #39797
[](https://gitpod.io/from-referrer/)
|
t-set-theory
t-order
|
89/1 |
Mathlib.lean,Mathlib/Data/Set/Monotone.lean,Mathlib/Logic/Small/Basic.lean,Mathlib/SetTheory/Cardinal/EventuallyConst.lean |
4 |
5 |
['YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'vihdzp', 'wwylele'] |
nobody |
4-77691 4 days ago |
4-74771 4 days ago |
15-31674 15 days |
| 39807 |
vihdzp author:vihdzp |
feat: universe-heterogeneous cardinal equality |
We introduce a predicate `LiftEq a b`, with notation `a =ₗ b`, which states that two cardinals (in different universes) are equal. This serves as a single canonical spelling for `lift.{v} a = lift.{u} b` and similar incantations.
Future PRs will introduce the analogous predicates for `<` and `≤`, and a notation typeclass so the notation can be reused for `Ordinal` and `OrderType`.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
319/152 |
Mathlib/Algebra/FreeAlgebra/Cardinality.lean,Mathlib/CategoryTheory/Abelian/GrothendieckCategory/EnoughInjectives.lean,Mathlib/FieldTheory/IsAlgClosed/Classification.lean,Mathlib/LinearAlgebra/Dimension/Basic.lean,Mathlib/LinearAlgebra/Dimension/Constructions.lean,Mathlib/LinearAlgebra/Dimension/Free.lean,Mathlib/LinearAlgebra/Dimension/FreeAndStrongRankCondition.lean,Mathlib/LinearAlgebra/Dimension/LinearMap.lean,Mathlib/LinearAlgebra/Dimension/StrongRankCondition.lean,Mathlib/ModelTheory/Basic.lean,Mathlib/ModelTheory/Satisfiability.lean,Mathlib/RingTheory/AlgebraicIndependent/Basic.lean,Mathlib/RingTheory/AlgebraicIndependent/RankAndCardinality.lean,Mathlib/RingTheory/AlgebraicIndependent/TranscendenceBasis.lean,Mathlib/RingTheory/LinearDisjoint.lean,Mathlib/RingTheory/Localization/Cardinality.lean,Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Defs.lean,Mathlib/SetTheory/Cardinal/ENat.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Cardinal/ToNat.lean,Mathlib/SetTheory/Ordinal/Univ.lean,Mathlib/SetTheory/ZFC/Cardinal.lean |
25 |
2 |
['acmepjz', 'github-actions'] |
nobody |
4-65314 4 days ago |
4-63208 4 days ago |
7-71511 7 days |
| 28613 |
espottesmith author: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
|
286/0 |
Mathlib.lean,Mathlib/Combinatorics/Hypergraph/Basic.lean |
2 |
152 |
['SnirBroshi', 'b-mehta', 'espottesmith', 'github-actions', 'jt496', 'lauramonk', 'mathlib4-merge-conflict-bot', 'tb65536'] |
b-mehta assignee:b-mehta |
4-57961 4 days ago |
4-57165 4 days ago |
107-37386 107 days |
| 32294 |
jsm28 author: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 |
214/0 |
Mathlib/Geometry/Euclidean/Angle/Incenter.lean |
1 |
5 |
['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'peakpoint'] |
nobody |
4-57349 4 days ago |
4-56621 4 days ago |
66-72832 66 days |
| 39997 |
Whysoserioushah author:Whysoserioushah |
feat(LinearAlgebra/Projectivization/Action): More about PSL actions on projective space |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
79/0 |
Mathlib/LinearAlgebra/Projectivization/Action.lean |
1 |
1 |
['github-actions'] |
nobody |
4-52422 4 days ago |
4-51641 4 days ago |
4-51391 4 days |
| 36963 |
seewoo5 author: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
|
124/24 |
Mathlib/Analysis/Complex/UpperHalfPlane/Manifold.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/NumberTheory/ModularForms/Derivative.lean |
3 |
12 |
['github-actions', 'loefflerd', 'mathlib-merge-conflicts', 'seewoo5', 'tb65536', 'wwylele'] |
tb65536 assignee:tb65536 |
4-51469 4 days ago |
4-50754 4 days ago |
30-45763 30 days |
| 36103 |
SnkXyx author: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
- [x] depends on: #37791
|
t-algebra
new-contributor
label:t-algebra$ |
3860/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,docs/references.bib |
12 |
21 |
['Hagb', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
dagurtomas assignee:dagurtomas |
4-48570 4 days ago |
7-36166 7 days ago |
28-83819 28 days |
| 38009 |
CBirkbeck author: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'] |
alreadydone assignee:alreadydone |
4-48568 4 days ago |
49-699 49 days ago |
49-8820 49 days |
| 38098 |
astrainfinita author:astrainfinita |
chore: make `SMul.comp.smul` `implicit_reducible` |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
2/1 |
Mathlib/Algebra/Group/Action/Defs.lean |
1 |
3 |
['astrainfinita', 'github-actions', 'leanprover-radar'] |
kim-em assignee:kim-em |
4-48567 4 days ago |
47-36944 47 days ago |
47-36694 47 days |
| 38169 |
tb65536 author: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
label:t-algebra$ |
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'] |
mattrobball assignee:mattrobball |
4-48566 4 days ago |
32-1247 32 days ago |
45-75554 45 days |
| 38324 |
BryceT233 author: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'] |
alreadydone assignee:alreadydone |
4-48564 4 days ago |
5-29519 5 days ago |
42-28540 42 days |
| 38380 |
linesthatinterlace author: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]`.
This PR was prepared with the assistance of Claude Opus. |
t-data
LLM-generated
|
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'] |
TwoFX assignee:TwoFX |
4-48563 4 days ago |
21-6096 21 days ago |
40-47564 40 days |
| 38830 |
Jun2M author:Jun2M |
feat(Data/List): Nodup and head & getLast lemmas |
Given a Nodup list:
* If a prefix contains the last element, they are equal
* If a suffix contains the first element, they are equal
* If an infix contains the first element, it is a prefix
* If an infix contains the last element, it is a suffix
* If the first and the last element are the same, it is a singleton
* `countP` is cardinality of the filter of `toFinset`.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
29/0 |
Mathlib/Data/Finset/Card.lean,Mathlib/Data/List/Nodup.lean |
2 |
7 |
['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts'] |
joneugster assignee:joneugster |
4-48561 4 days ago |
11-65309 11 days ago |
27-43690 27 days |
| 39347 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): refactor of Pattern and shift-invariance of shape languages for subshifts |
## Summary
This PR refactors Pattern.mulShift in Mathlib/Dynamics/SymbolicDynamics/Basic.lean and uses the cleaner definition to prove shift-invariance of the language of a subshift on a finite shape.
## Changes
Pattern.mulShift now returns a Pattern instead of a configuration (more natural).
- Old type: Pattern.mulShift : Pattern A G → G → (G → A)
- New type: Pattern.mulShift : Pattern A G → G → Pattern A G
- The result carries its support (p.support.image (v * ·)) and the
default-outside-support proof, so callers don't have to re-derive them.
The [IsLeftCancelMul G] hypothesis is moved to the lemmas that actually use it.
- The definition Pattern.mulShift itself no longer needs left-cancellation (it only
chooses a preimage noncomputably).
- The hypothesis is now stated on mulShift_config_apply_mul_left_of_mem and
mulOccursInAt_eq_cylinder directly, instead of being a section-level variable.
Renames following the type change.
- mulShift_apply_mul_left_of_mem → mulShift_config_apply_mul_left_of_mem (because we
now write (p.mulShift v).config instead of p.mulShift v).
New @[simp] and @[ext] lemmas for Pattern.
- Pattern.ext: two patterns are equal iff their supports agree and their
configurations agree on the support.
- Pattern.mulShift_support: the support of p.mulShift v is p.support.image (v * ·).
- Pattern.fromConfig_support: the support of fromConfig x U is U.
- Pattern.fromConfig_config_of_mem: on its support, fromConfig x U agrees with x.
New lemma Pattern.fromConfig_mulShift.
For a left inverse g' * g = 1, shifting the pattern fromConfig x U by g equals
fromConfig (mulShift g' x) (U.image (g * ·)).
New theorem MulSubshift.languageOn_image_mulShift.
For a subshift Y and elements g, g' with g * g' = 1 and g' * g = 1:
(fun p => p.mulShift g) '' Y.languageOn U = Y.languageOn (U.image (g * ·))
i.e. the language on the translated shape is exactly the image of the language on U
under the pattern-shift map. This gives a bijection between Y.languageOn U and
Y.languageOn (U.image (g * ·)), with inverse p ↦ p.mulShift g'. Stated for
left-cancellative monoids with an invertible element.
Updated docstrings for Pattern.mulShift and the renamed lemma to reflect the
bundled-Pattern return type and clarify which results need [IsLeftCancelMul G]. |
t-dynamics
new-contributor
|
142/48 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
3 |
['github-actions'] |
sgouezel assignee:sgouezel |
4-48559 4 days ago |
19-43125 19 days ago |
19-42875 19 days |
| 39588 |
jvanwinden author:jvanwinden |
feat(MeasureTheory/Measure/ProbabilityMeasure): add toProbabilityMeasure and basic API |
Introduces `Measure.toProbabilityMeasure`, which converts a `Measure` into a `ProbabilityMeasure` in the presence of the typeclass assumption `[IsProbabilityMeasure]`. Some basic API is added for the interaction between `toProbabilityMeasure` and the coercion from `ProbabilityMeasure` to `Measure`. The main convenience is that the new method allows for dot notation on `Measure`.
This PR arose from the following situation: I needed to prove equality of two `Measure` objects, and I wanted to do this by using uniqueness of limits. But the topology of weak convergence is only defined on `ProbabilityMeasure` and not on `Measure`. With the new lemma `toProbabilityMeasure_inj`, an equality of measures can easily be rewritten into an equality of the corresponding probability measures, after which `tendsto_nhds_unique` can be applied.
Aside from this, `toProbabilityMeasure` has the potential to simplify theorem statements about `Measure` objects which use the topology of weak convergence either in the assumptions or the conclusion. For example, now one can simply write `Tendsto μ.toProbabilityMeasure f (nhds μ_lim.toProbabilityMeasure)` when appropriate `[IsProbabilityMeasure]` assumptions are present.
This PR is intended as a starting point for a discussion. I only added some basic API, but perhaps more lemmas should be added (which ones?). Also, a similar definition could be made for `FiniteMeasure`.
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
19/2 |
Mathlib/MeasureTheory/Measure/ProbabilityMeasure.lean |
1 |
1 |
['github-actions'] |
kex-y assignee:kex-y |
4-48558 4 days ago |
13-70438 13 days ago |
13-70188 13 days |
| 39882 |
chrisflav author:chrisflav |
chore(CategoryTheory): `StructuredArrow.map₂` along equivalences induces an equivalence |
Before that we only had an instance `IsEquivalence`, this provides the full equivalence with good def-eqs for the inverse.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
maintainer-merge
|
126/2 |
Mathlib/CategoryTheory/Comma/StructuredArrow/Basic.lean |
1 |
7 |
['chrisflav', 'github-actions', 'robin-carlier'] |
robin-carlier assignee:robin-carlier |
4-48554 4 days ago |
5-64236 5 days ago |
6-74875 6 days |
| 39959 |
chrisflav author:chrisflav |
chore(CategoryTheory/Sites): make auxiliary declarations for `OneHypercoverDenseData.isSheaf_iff` private |
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
maintainer-merge
|
7/7 |
Mathlib/CategoryTheory/Sites/DenseSubsite/OneHypercoverDense.lean |
1 |
2 |
['github-actions', 'grunweg'] |
robin-carlier assignee:robin-carlier |
4-48549 4 days ago |
5-23028 5 days ago |
5-22778 5 days |
| 36643 |
Thmoas-Guan author: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.
---
- [x] depends on: #36817
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
182/0 |
Mathlib/Algebra/Homology/ShortComplex/Exact.lean,Mathlib/CategoryTheory/Abelian/Injective/Dimension.lean,Mathlib/CategoryTheory/Abelian/Projective/Dimension.lean |
3 |
6 |
['dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
adamtopaz assignee:adamtopaz |
4-40978 4 days ago |
4-40180 4 days ago |
49-8669 49 days |
| 40005 |
tautschnig author:tautschnig |
feat(Data/ZMod/Basic): isUnit characterisation in prime power moduli |
Add two lemmas characterising units in ZMod (p^n) via divisibility of the canonical lift:
isUnit_iff_not_prime_dvd_val: for prime p and n > 0,
IsUnit x ↔ ¬ p ∣ x.val.
not_isUnit_iff_prime_dvd_val: for prime p and n > 0,
¬ IsUnit x ↔ p ∣ x.val.
These specialise the existing isUnit_iff_coprime to prime power moduli, where the coprimality condition reduces to a simple divisibility check on the unique prime factor.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
15/0 |
Mathlib/Data/ZMod/Basic.lean |
1 |
3 |
['copilot-pull-request-reviewer', 'github-actions'] |
nobody |
4-22696 4 days ago |
4-21876 4 days ago |
4-21636 4 days |
| 40006 |
tautschnig author:tautschnig |
feat(Data/ZMod/Basic): idempotents in ZMod (p^d) are exactly {0, 1} |
Add sq_eq_self_iff_eq_zero_or_one: in ZMod (p^d) for prime p and d > 0, x^2 = x iff x = 0 or x = 1.
This generalises eq_zero_or_one_of_sq_eq_self (which requires CancelMonoidWithZero, i.e., no zero divisors) to the prime-power case. ZMod (p^d) has zero divisors for d >= 2, so the mul_left_injective₀ argument used by the existing lemma does not apply. The proof works by lifting to ℕ, using that if gcd(a, b) = 1 and p^d | a*b then p^d divides one of a or b (by Euclid's lemma), then noting that a = x.val and b = x.val - 1 are consecutive naturals and hence coprime.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
56/0 |
Mathlib/Data/ZMod/Basic.lean |
1 |
2 |
['github-actions'] |
nobody |
4-20093 4 days ago |
4-18281 4 days ago |
4-18031 4 days |
| 35672 |
dennj author: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
LLM-generated
|
128/2 |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean,docs/references.bib |
3 |
7 |
['dennj', 'github-actions', 'grunweg', 'ocfnash', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
4-19896 4 days ago |
20-79579 20 days ago |
45-79841 45 days |
| 38002 |
Raph-DG author: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
|
113/0 |
Mathlib/Order/Hom/Basic.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Order/Minimal.lean,Mathlib/Topology/Inseparable.lean,Mathlib/Topology/Sober.lean |
5 |
7 |
['ADedecker', 'Raph-DG', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts'] |
dagurtomas assignee:dagurtomas |
4-19215 4 days ago |
4-18698 4 days ago |
44-66326 44 days |
| 39428 |
harahu author:harahu |
chore: add an empty line after module headers |
This makes the docs easier to read.
---
[](https://gitpod.io/from-referrer/)
|
|
120/4 |
Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q6.lean,Archive/Imo/Imo2005Q3.lean,Archive/Imo/Imo2008Q2.lean,Archive/Imo/Imo2008Q3.lean,Archive/Imo/Imo2008Q4.lean,Counterexamples/DiscreteTopologyNonDiscreteUniformity.lean,Counterexamples/PeanoCurve.lean,Counterexamples/Pseudoelement.lean,Mathlib/Algebra/Algebra/Spectrum/Basic.lean,Mathlib/Algebra/Category/Grp/EpiMono.lean,Mathlib/Algebra/Category/ModuleCat/Stalk.lean,Mathlib/Algebra/EuclideanDomain/Field.lean,Mathlib/Algebra/EuclideanDomain/Int.lean,Mathlib/Algebra/Homology/Opposite.lean,Mathlib/Algebra/Lie/Cochain.lean,Mathlib/Algebra/Lie/Extension.lean,Mathlib/Algebra/Lie/Loop.lean,Mathlib/Algebra/MonoidAlgebra/PointwiseSMul.lean,Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Algebra/Order/Archimedean/IndicatorCard.lean,Mathlib/Algebra/Squarefree/Basic.lean,Mathlib/Algebra/Vertex/HVertexOperator.lean,Mathlib/Algebra/Vertex/VertexOperator.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/Product.lean,Mathlib/AlgebraicTopology/FundamentalGroupoid/SimplyConnected.lean,Mathlib/Analysis/Analytic/RadiusLiminf.lean,Mathlib/Analysis/Normed/Affine/Convex.lean,Mathlib/Analysis/Normed/Lp/PiLp.lean,Mathlib/Analysis/Normed/Lp/ProdLp.lean,Mathlib/Analysis/Normed/Unbundled/SeminormFromBounded.lean,Mathlib/Analysis/Normed/Unbundled/SmoothingSeminorm.lean,Mathlib/CategoryTheory/DinatTrans.lean,Mathlib/CategoryTheory/Limits/Preserves/Filtered.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/HasPullback.lean,Mathlib/CategoryTheory/PathCategory/Basic.lean,Mathlib/CategoryTheory/Preadditive/Schur.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/LeftExact.lean,Mathlib/CategoryTheory/Thin.lean,Mathlib/Combinatorics/Configuration.lean,Mathlib/Data/Bracket.lean,Mathlib/Data/Bundle.lean,Mathlib/Data/Finsupp/BigOperators.lean,Mathlib/Data/Nat/Squarefree.lean,Mathlib/Data/PSigma/Order.lean,Mathlib/Data/SProd.lean,Mathlib/Data/Set/Enumerate.lean,Mathlib/Data/Set/UnionLift.lean,Mathlib/Dynamics/TopologicalEntropy/CoverEntropy.lean,Mathlib/Dynamics/TopologicalEntropy/NetEntropy.lean,Mathlib/Dynamics/TopologicalEntropy/Semiconj.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/Geometry/Manifold/Algebra/Monoid.lean,Mathlib/Geometry/Manifold/Diffeomorph.lean,Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean,Mathlib/GroupTheory/CommutingProbability.lean,Mathlib/LinearAlgebra/Multilinear/Curry.lean,Mathlib/LinearAlgebra/RootSystem/Finite/CanonicalBilinear.lean,Mathlib/LinearAlgebra/RootSystem/Hom.lean,Mathlib/LinearAlgebra/RootSystem/OfBilinear.lean,Mathlib/LinearAlgebra/RootSystem/RootPairingCat.lean,Mathlib/LinearAlgebra/RootSystem/WeylGroup.lean,Mathlib/Logic/Lemmas.lean,Mathlib/MeasureTheory/Function/EssSup.lean,Mathlib/MeasureTheory/Group/Prod.lean,Mathlib/ModelTheory/PartialEquiv.lean,Mathlib/NumberTheory/ClassNumber/AdmissibleAbs.lean,Mathlib/NumberTheory/ClassNumber/AdmissibleAbsoluteValue.lean,Mathlib/NumberTheory/ClassNumber/Finite.lean,Mathlib/NumberTheory/Cyclotomic/Discriminant.lean,Mathlib/NumberTheory/Cyclotomic/PrimitiveRoots.lean,Mathlib/NumberTheory/FLT/Four.lean,Mathlib/NumberTheory/FLT/Three.lean,Mathlib/NumberTheory/NumberField/Basic.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Embeddings.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/PID.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Three.lean,Mathlib/NumberTheory/NumberField/Discriminant/Basic.lean,Mathlib/NumberTheory/NumberField/Discriminant/Defs.lean,Mathlib/NumberTheory/NumberField/EquivReindex.lean,Mathlib/NumberTheory/NumberField/ExistsRamified.lean,Mathlib/NumberTheory/NumberField/House.lean,Mathlib/NumberTheory/NumberField/Norm.lean,Mathlib/NumberTheory/NumberField/Units/DirichletTheorem.lean,Mathlib/Order/Bounded.lean,Mathlib/Probability/Distributions/Uniform.lean,Mathlib/RepresentationTheory/Rep/Res.lean,Mathlib/RingTheory/AdicCompletion/RingHom.lean,Mathlib/RingTheory/Conductor.lean,Mathlib/RingTheory/Coprime/Lemmas.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean,Mathlib/RingTheory/DedekindDomain/Instances.lean,Mathlib/RingTheory/HahnSeries/Addition.lean,Mathlib/RingTheory/HahnSeries/Binomial.lean,Mathlib/RingTheory/HahnSeries/Multiplication.lean,Mathlib/RingTheory/HahnSeries/PowerSeries.lean |
120 |
3 |
['github-actions', 'grunweg', 'mathlib-merge-conflicts'] |
nobody |
4-16026 4 days ago |
5-22701 5 days ago |
11-72137 11 days |
| 37521 |
jessealama author: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
maintainer-merge
|
6/0 |
Mathlib/Data/Part.lean |
1 |
7 |
['github-actions', 'jessealama', 'joneugster', 'vihdzp'] |
joneugster assignee:joneugster |
4-13357 4 days ago |
12-45704 12 days ago |
57-61478 57 days |
| 39869 |
grunweg author:grunweg |
doc: clarify the scope of `field_simp` |
The term semi-field is sufficiently non-standard that it has led to confusion whether e.g. `NNReal` is supported by field_simp: it is (as it is a semifield). Let's clarify the doc-string.
Inspired by discussions at the ICERM workshop "Techniques and Tools for the Formalization of Analysis".
---
[](https://gitpod.io/from-referrer/)
|
documentation
easy
t-meta
maintainer-merge
|
4/4 |
Mathlib/Tactic/FieldSimp.lean |
1 |
2 |
['github-actions', 'joneugster'] |
thorimur assignee:thorimur |
4-10016 4 days ago |
7-6203 7 days ago |
7-5953 7 days |
| 39876 |
kim-em author:kim-em |
feat(scripts): dump cross-reference tags to TSV for downstream review |
This PR adds `scripts/dump_crossref_tags.lean`, which walks `Mathlib.CrossRef.tagExt` in the elaborated Mathlib environment and writes one TSV record per tagged declaration. The TSV is consumed by a privileged `workflow_run` job that posts the cross-reference review PR comment; the rest of that machinery lives in https://github.com/leanprover-community/external-tags and https://github.com/leanprover-community/mathlib-ci. Fields are sanitised so tabs/newlines in user-controlled comments can't break the TSV framing, and the output is capped at 2 MB.
Uses `importModules (loadExts := true)` rather than `withImportModules`, because the wrapper passes `loadExts := false` and would leave `tagExt` empty for imported modules.
🤖 Prepared with [Claude Code](https://claude.com/claude-code) |
CI
LLM-generated
|
96/0 |
scripts/README.md,scripts/dump_crossref_tags.lean |
2 |
3 |
['github-actions', 'jcommelin', 'kim-em'] |
nobody |
4-9134 4 days ago |
6-2019 6 days ago |
6-20870 6 days |
| 39353 |
Raph-DG author:Raph-DG |
feat(Topology): Show existence of a neighbourhood around p which avoids all points in the support of a locally finsupp function except those which specialize to p |
In this PR we show a simple lemma proving the existence of a neighbourhood around any point p which avoids every point in the support of a locally finsupp function except those which specialize to p.
AI disclosure: The statements and a sketch with sorries were provided by me, but I had claude fill in the sorries.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
29/0 |
Mathlib/Topology/LocallyFinsupp.lean |
1 |
1 |
['github-actions'] |
nobody |
4-3745 4 days ago |
4-3745 4 days ago |
4-34065 4 days |
| 39816 |
WenrongZou author:WenrongZou |
chore(MvPolynomial): rename a lemma using prime |
This PR renames a lemma by adding a prime. Many other lemmas in (mv)polynomial theory also use a prime in their names for the same reason — their primed versions should be rewritten in the `xxx_eq_ite` form.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
easy
|
13/10 |
Mathlib/Algebra/MvPolynomial/Basic.lean,Mathlib/RingTheory/MvPolynomial/IrreducibleQuadratic.lean,Mathlib/RingTheory/Smooth/IntegralClosure.lean,Mathlib/RingTheory/Spectrum/Prime/Polynomial.lean,Mathlib/RingTheory/TensorProduct/MvPolynomial.lean,scripts/nolints_prime_decls.txt |
6 |
11 |
['NoahW314', 'WenrongZou', 'github-actions', 'ocfnash'] |
nobody |
4-2711 4 days ago |
4-1045 4 days ago |
6-85703 6 days |
| 39941 |
mkaratarakis author:mkaratarakis |
feat(Data/List): add count lemmas for duplicate detection |
## Summary
Add general list count lemmas used in the Perron–Frobenius quiver-path development:
- `List.mem_tail_of_count_ge_two`
- `List.exists_pos_get_of_dropLast_count_ge_two`
Relocated from the PF-specific file per review feedback. Proofs use upstream `List.Duplicate` API and `grind` where appropriate (per @chenson2018).
Part of the Perron–Frobenius formalization (with @or4nge19).
## Test plan
- [x] `lake build Mathlib.Data.List.Count`
- [x] `lake build Mathlib.Combinatorics.Quiver.Path.PerronFrobenius` (on integration branch)
cc @or4nge19 for review |
t-data |
24/0 |
Mathlib/Data/List/Count.lean |
1 |
3 |
['chenson2018', 'github-actions', 'mkaratarakis'] |
nobody |
4-2638 4 days ago |
3-85686 3 days ago |
5-62609 5 days |
| 38859 |
SnirBroshi author:SnirBroshi |
feat(Order/CompleteLattice/Basic): tag `iSup_of_empty'` with `@[simp]` |
The theorem says `iSup f = sSup ∅` when the domain of `f` is empty, and dually `iInf f = sInf ∅`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
31/47 |
Mathlib/Algebra/Order/Archimedean/Real/Basic.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Analysis/Seminorm.lean,Mathlib/Data/ENat/Lattice.lean,Mathlib/Data/NNReal/Basic.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Set/Finite/Lattice.lean,Mathlib/LinearAlgebra/Eigenspace/Pi.lean,Mathlib/MeasureTheory/Constructions/BorelSpace/Order.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/ConditionallyCompletePartialOrder/Indexed.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/Filter/Lift.lean |
14 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
4-2195 4 days ago |
3-85252 3 days ago |
29-26998 29 days |
| 38856 |
SnirBroshi author:SnirBroshi |
feat(Order/ConditionallyCompleteLattice/Indexed): `iSup_iSup_eq_{left/right}` for `ConditionallyCompleteLinearOrderBot` |
and `≤` versions for `ConditionallyCompleteLattice`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
32/9 |
Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
2 |
1 |
['github-actions'] |
nobody |
4-2112 4 days ago |
3-84638 3 days ago |
30-28408 30 days |
| 38557 |
SnirBroshi author: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. This follows other basic definitions such as `IsMax`/`CovBy`.
[](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 |
2 |
['JovanGerb', 'github-actions'] |
nobody |
3-85317 3 days ago |
3-81710 3 days ago |
36-45965 36 days |
| 39158 |
SnirBroshi author:SnirBroshi |
feat(LinearAlgebra/Matrix/Rank): generalize `Matrix.rank`/`LinearMap.rank` to semirings |
- Generalize `Matrix.rank` from `CommRing` to `CommSemiring`
- Generalize `LinearMap.rank` from `AddCommGroup`s over `Ring`s to `AddCommMonoid`s over `Semiring`s (which are the minimum requirements for `Module`)
- Many `Matrix.rank` theorems now require `StrongRankCondition` explicitly (which `CommRing` used to provide)
- `Matrix.cRank` theorems don't need commutativity
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
58/64 |
Mathlib/LinearAlgebra/Dimension/LinearMap.lean,Mathlib/LinearAlgebra/Matrix/Rank.lean |
2 |
1 |
['github-actions'] |
nobody |
3-85244 3 days ago |
3-84076 3 days ago |
22-56399 22 days |
| 40019 |
grunweg author:grunweg |
chore: golf using fun_prop |
Partially enabled through #35683.
---
[](https://gitpod.io/from-referrer/)
|
|
14/30 |
Mathlib/Analysis/Convex/Contractible.lean,Mathlib/Condensed/Discrete/LocallyConstant.lean,Mathlib/Condensed/Light/Sequence.lean,Mathlib/MeasureTheory/Constructions/Polish/Basic.lean,Mathlib/MeasureTheory/Function/SpecialFunctions/Basic.lean |
5 |
1 |
['github-actions'] |
nobody |
3-83070 3 days ago |
3-82335 3 days ago |
3-82085 3 days |
| 40022 |
chenson2018 author:chenson2018 |
chore(Algebra): refactor proofs where `grind?` fails |
These are sources of technical debt as now reported in the [weekly linting report](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/with/544658968). The idea is that a successful grind proof can fail to report the theorems it used via grind?, which means that if these proofs break across toolchains that it becomes significantly harder to repair.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
16/6 |
Mathlib/Algebra/Group/Defs.lean,Mathlib/Algebra/Notation/Support.lean,Mathlib/Algebra/Order/BigOperators/Group/Finset.lean,Mathlib/Algebra/Order/Field/Basic.lean,Mathlib/Algebra/Order/Ring/StandardPart.lean,Mathlib/Algebra/Polynomial/Degree/Lemmas.lean |
6 |
1 |
['github-actions'] |
nobody |
3-81261 3 days ago |
3-77805 3 days ago |
3-77555 3 days |
| 40020 |
kbuzzard author:kbuzzard |
wip |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
38/27 |
Mathlib/Algebra/Group/Pi/Basic.lean |
1 |
4 |
['github-actions', 'kbuzzard', 'leanprover-radar'] |
nobody |
3-80661 3 days ago |
3-78415 3 days ago |
3-78165 3 days |
| 39787 |
Hagb author:Hagb |
feat(Order/WellQuasiOrder): `WellQuasiOrdered` if onto homomorphous from a `WellQuasiOrdered` relation |
It is used in #39788 for proof of well foundedness of `MonomialOrder` when the index type is finite.
The hypotheses can be further weaken once #38557 is merged.
---
[](https://gitpod.io/from-referrer/)
|
t-order
easy
|
16/0 |
Mathlib/Order/WellQuasiOrder.lean |
1 |
3 |
['Hagb', 'github-actions', 'plp127'] |
nobody |
3-79840 3 days ago |
8-63931 8 days ago |
8-63681 8 days |
| 39873 |
mkaratarakis author:mkaratarakis |
feat(RingTheory/IntegralClosure): add IsIntegral helpers for casts |
Add `IsIntegral.Cast` and `IsIntegral.Nat`, stating that integer and natural
literals are integral over `ℤ` in a field.
---
[](https://gitpod.io/from-referrer/) |
t-ring-theory |
7/0 |
Mathlib/RingTheory/IntegralClosure/Algebra/Basic.lean |
1 |
8 |
['github-actions', 'mkaratarakis', 'tb65536'] |
nobody |
3-79368 3 days ago |
3-77527 3 days ago |
6-27221 6 days |
| 34908 |
CoolRmal author: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`.
Created with the help of Codex.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-group-theory
LLM-generated
label:t-algebra$ |
25/0 |
Mathlib/Algebra/Group/Subgroup/Basic.lean |
1 |
22 |
['CoolRmal', 'github-actions', 'robin-carlier', 'tb65536'] |
mattrobball assignee:mattrobball |
3-75656 3 days ago |
3-72059 3 days ago |
14-25368 14 days |
| 39904 |
wwylele author:wwylele |
refactor(Analysis/Meromorphic): generalize 𝕜 → 𝕜 to 𝕜 → 𝕜' for order lemma when possible |
I don't have a real use for this, but this is the style that Meromorphic/Basic.lean follows, so let's unify them.
---
I unfortunately had to duplicate the proof for `meromorphicOrderAt_mul` from `meromorphicOrderAt_smul`. They are almost the same, but I don't find a good way to unify them.
[](https://gitpod.io/from-referrer/)
|
t-analysis |
38/22 |
Mathlib/Analysis/Meromorphic/Order.lean |
1 |
1 |
['github-actions'] |
nobody |
3-75499 3 days ago |
3-73180 3 days ago |
6-46761 6 days |
| 39831 |
wwylele author:wwylele |
feat(Topology): a preconnected set is discrete iff is subsingleton |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
9/0 |
Mathlib/Topology/Connected/TotallyDisconnected.lean |
1 |
1 |
['github-actions'] |
nobody |
3-75487 3 days ago |
3-71945 3 days ago |
7-80404 7 days |
| 39833 |
wwylele author:wwylele |
feat(Analysis/Meromorphic): const_smul lemma |
This allows more general scalar type than the existing `smul` ones
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
14/0 |
Mathlib/Analysis/Meromorphic/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
3-71707 3 days ago |
3-70841 3 days ago |
7-79451 7 days |
| 37415 |
vasnesterov author: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
maintainer-merge
|
378/1 |
Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basis.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Monomial/Basic.lean |
2 |
16 |
['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
joneugster assignee:joneugster |
3-70356 3 days ago |
4-13076 4 days ago |
17-83584 17 days |
| 39703 |
YaelDillies author:YaelDillies |
chore: create a `Basic` top folder |
Move a select few folders from `Logic` to a new `Basic` folder.
The goal is to finally move the material misplaced in the `Data` and `Logic` folder and to clarify the various expectations of each folder. Ultimately:
* the `Basic` folder will be about basic predicates on types and basic mathematical types not fitting in any other folder;
* the `Data` folder will be about data structures, instead of the current mix of data structures and basic mathematical types not fitting in any other folder;
* the `Logic` folder will be about advanced logic results not fitting in either `ModelTheory` or `SetTheory`, instead of the current mix of basic predicates on types and advanced logic results.
Many more files (~1000) could be moved, so I will do it in several PRs. Not all files should move to `Basic`. Some files should go to `Algebra.Order` instead (eg `Data.Nat.Lattice`) and some should be straight out deprecated (eg `Data.Analysis`).
[Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/345428-mathlib-reviewers/topic/Basic.20folder/with/597151406)
---
This PR stems from discussions at the MI retreat 2026.
[](https://gitpod.io/from-referrer/)
|
file-removed
t-data
maintainer-merge
|
148/96 |
Counterexamples/Girard.lean,Mathlib.lean,Mathlib/Algebra/CharZero/Defs.lean,Mathlib/Algebra/Group/Irreducible/Defs.lean,Mathlib/Algebra/Group/Nat/Units.lean,Mathlib/Algebra/Group/Pi/Basic.lean,Mathlib/Algebra/Group/Units/Basic.lean,Mathlib/Algebra/Group/WithOne/Defs.lean,Mathlib/Algebra/GroupWithZero/Basic.lean,Mathlib/Algebra/GroupWithZero/Defs.lean,Mathlib/Algebra/Module/Presentation/Free.lean,Mathlib/Algebra/Module/Projective.lean,Mathlib/Algebra/NeZero.lean,Mathlib/Basic/Denumerable.lean,Mathlib/Basic/ExistsUnique.lean,Mathlib/Basic/IsEmpty.lean,Mathlib/Basic/IsEmpty/Basic.lean,Mathlib/Basic/IsEmpty/Defs.lean,Mathlib/Basic/Logic/Basic.lean,Mathlib/Basic/Logic/Lemmas.lean,Mathlib/Basic/Nonempty.lean,Mathlib/Basic/Nontrivial/Basic.lean,Mathlib/Basic/Nontrivial/Defs.lean,Mathlib/Basic/README.md,Mathlib/Basic/Unique.lean,Mathlib/Basic/UnivLE.lean,Mathlib/CategoryTheory/EssentiallySmall.lean,Mathlib/CategoryTheory/Limits/Types/Colimits.lean,Mathlib/CategoryTheory/Limits/Types/Limits.lean,Mathlib/CategoryTheory/UnivLE.lean,Mathlib/Combinatorics/Quiver/Path.lean,Mathlib/Computability/Primrec/Basic.lean,Mathlib/Data/Bool/Basic.lean,Mathlib/Data/FunLike/Basic.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/GetD.lean,Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Nat/MaxPowDiv.lean,Mathlib/Data/Option/Basic.lean,Mathlib/Data/Quot.lean,Mathlib/Data/README.md,Mathlib/Data/Rat/Denumerable.lean,Mathlib/Data/TwoPointing.lean,Mathlib/Lean/Meta/CongrTheorems.lean,Mathlib/LinearAlgebra/Matrix/Defs.lean,Mathlib/Logic/Equiv/Defs.lean,Mathlib/Logic/Equiv/List.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/Logic/README.md,Mathlib/Order/OrderIsoNat.lean,Mathlib/Order/RelClasses.lean,Mathlib/Order/WithBot.lean,Mathlib/RingTheory/Coprime/Basic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/UnivLE.lean,Mathlib/SetTheory/ZFC/Rank.lean,Mathlib/Tactic/CancelDenoms/Core.lean,Mathlib/Tactic/CongrExclamation.lean,Mathlib/Tactic/ITauto.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean,Mathlib/Tactic/Nontriviality/Core.lean,Mathlib/Tactic/Push.lean,Mathlib/Tactic/Subsingleton.lean,Mathlib/Tactic/Tauto.lean,Mathlib/Testing/Plausible/Testable.lean,Mathlib/Topology/Order/UpperLowerSetTopology.lean,MathlibTest/Linter/PrivateModule/ImportOnly.lean,scripts/autolabel.lean,scripts/noshake.json |
69 |
25 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'grunweg', 'joneugster', 'mathlib-merge-conflicts', 'themathqueen'] |
joneugster assignee:joneugster |
3-69975 3 days ago |
3-68060 3 days ago |
6-78125 6 days |
| 37342 |
vasnesterov author: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
maintainer-merge
|
160/0 |
Mathlib/Tactic/ComputeAsymptotics/Multiseries/Corecursion.lean |
1 |
7 |
['github-actions', 'joneugster', 'mathlib-dependent-issues'] |
joneugster assignee:joneugster |
3-69842 3 days ago |
4-14181 4 days ago |
33-698 33 days |
| 39875 |
mkaratarakis author:mkaratarakis |
refactor(NumberField/House): expose Siegel lemma infrastructure |
Expose Siegel's lemma infrastructure in `NumberField.House`: rename the private
basis-matrix bound to `basisMatrixInvSupNorm`, make `house` reducible, and
adjust `exists_ne_zero_int_vec_house_le`.
---
[](https://gitpod.io/from-referrer/) |
|
59/48 |
Mathlib/NumberTheory/NumberField/House.lean |
1 |
4 |
['github-actions', 'mkaratarakis', 'tb65536'] |
nobody |
3-68873 3 days ago |
3-68065 3 days ago |
6-74402 6 days |
| 39872 |
mkaratarakis author:mkaratarakis |
feat(RingTheory/Algebraic): add natDenominator API |
Add `AlgebraicDenominator.denominator` and `AlgebraicDenominator.natDenominator`,
characterizing denominators of algebraic elements as generators of a colon ideal and,
over `ℤ`, their absolute value as a natural-number denominator.
Part of the Gelfond–Schneider formalization; see #39873, #39875, and #39874.
---
[](https://gitpod.io/from-referrer/)
cc @tb65536 |
t-ring-theory |
68/0 |
Mathlib.lean,Mathlib/RingTheory/Algebraic/NatDenominator.lean |
2 |
1 |
['github-actions'] |
nobody |
3-68831 3 days ago |
3-68126 3 days ago |
7-1706 7 days |
| 39996 |
RuthP628 author:RuthP628 |
feat(ModelTheory/Semantics): add simp theorems similar to Sentence.realize_not |
Add simp theorems Sentence.realize_bot, Sentence.realize_top, Sentence.realize_inf, Sentence.realize_sup, Sentence.realize_imp and Sentence.realize_iff in the style of Sentence.realize_not as consequences of the corresponding theorems for formulas. |
t-logic
new-contributor
|
31/1 |
Mathlib/ModelTheory/Semantics.lean |
1 |
10 |
['RuthP628', 'b-mehta', 'github-actions', 'plp127'] |
nobody |
3-65164 3 days ago |
3-64482 3 days ago |
4-10126 4 days |
| 40029 |
vasnesterov author:vasnesterov |
feat(Analysis/Analytic): alternating geometric series |
* Define `geometricAlternatingSeries`: `1 - x + x ^ 2 - ...` as a `FormalMultilinearSeries`.
* Prove the same lemmas as for existing `formalMultilinearSeries_geometric`.
* Move the "Composition with a linear map" section above as it's needed to directly translate the results about `formalMultilinearSeries_geometric` to results about `geometricAlternatingSeries`.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
132/65 |
Mathlib/Analysis/Analytic/Constructions.lean |
1 |
1 |
['github-actions'] |
nobody |
3-64116 3 days ago |
3-63051 3 days ago |
3-62801 3 days |
| 36888 |
CoolRmal author: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.
We also prove that if a function is in Lp then its conditional expectation is also in Lp. In order to prove these results, some of the lemmas about essSup are generalized to conditionally complete lattices.
Created with the help of Codex.
---
- [x] depends on: #36877
- [x] depends on: #39104
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
260/140 |
Mathlib/MeasureTheory/Function/ConditionalExpectation/Basic.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondJensen.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/Real.lean,Mathlib/MeasureTheory/Measure/Trim.lean,Mathlib/Probability/CondVar.lean,Mathlib/Probability/Martingale/BorelCantelli.lean,Mathlib/Probability/Martingale/Centering.lean |
7 |
42 |
['CoolRmal', 'EtienneC30', 'RemyDegenne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
EtienneC30 assignee:EtienneC30 |
3-50691 3 days ago |
3-51252 3 days ago |
11-64903 11 days |
| 38821 |
Jun2M author:Jun2M |
feat(Data/List): rotation of sublist is sublist of rotation |
This PR proves `(∃ L₁ : List α, L ~r L₁ ∧ L₁ <+ L') ↔ (∃ L₂ : List α, L <+ L₂ ∧ L₂ ~r L')`.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
10/0 |
Mathlib/Data/List/Rotate.lean |
1 |
3 |
['SnirBroshi', 'eric-wieser', 'github-actions'] |
nobody |
3-50147 3 days ago |
31-44393 31 days ago |
31-61348 31 days |
| 38785 |
scholzhannah author: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 |
103/58 |
Mathlib/Topology/CWComplex/Classical/Basic.lean,Mathlib/Topology/CWComplex/Classical/Finite.lean,Mathlib/Topology/CWComplex/Classical/Subcomplex.lean |
3 |
8 |
['github-actions', 'grunweg', 'scholzhannah'] |
nobody |
3-50142 3 days ago |
22-23496 22 days ago |
32-11155 32 days |
| 39755 |
wwylele author:wwylele |
chore(GroupTheory): remove a defeq abuse |
---
I am not sure if this is the right change to make, so I'd like to start a discussion from this. The issue here seems to be that the simp lemma [MulAction.orbitRel.Quotient.orbit_mk](https://leanprover-community.github.io/mathlib4_docs/Mathlib/GroupTheory/GroupAction/Defs.html#MulAction.orbitRel.Quotient.orbit_mk) fired and changed the underlying type of variables in the expression, which is not defeq at instance transparency, and fails defeq check for `MulAction` ([MulAction.instElemOrbit](https://leanprover-community.github.io/mathlib4_docs/Mathlib/GroupTheory/GroupAction/Defs.html#MulAction.instElemOrbit) vs [MulAction.instElemOrbit_1](https://leanprover-community.github.io/mathlib4_docs/Mathlib/GroupTheory/GroupAction/Defs.html#MulAction.instElemOrbit_1)). The easy change here is to disable the offending simp, but it feels like a common language pitfall. Should we do either of the following instead?
- remove `MulAction.orbitRel.Quotient.orbit_mk` from default simp set
- Make the the orbit definition more transparent
[](https://gitpod.io/from-referrer/)
|
tech debt
t-group-theory
|
1/2 |
Mathlib/GroupTheory/GroupAction/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
3-49594 3 days ago |
3-47493 3 days ago |
9-69112 9 days |
| 38957 |
wwylele author:wwylele |
chore(GroupTheory/DivisibleHull): remove `backward.privateInPublic` |
---
[](https://gitpod.io/from-referrer/)
|
tech debt
t-group-theory
|
5/12 |
Mathlib/GroupTheory/DivisibleHull.lean |
1 |
13 |
['Komyyy', 'github-actions', 'grunweg', 'jcommelin', 'wwylele'] |
jcommelin assignee:jcommelin |
3-49582 3 days ago |
3-48795 3 days ago |
21-15939 21 days |
| 37712 |
eric-wieser author: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'] |
TwoFX assignee:TwoFX |
3-48809 3 days ago |
27-49070 27 days ago |
34-39306 34 days |
| 38527 |
archiebrowne author:archiebrowne |
feat(Analysis/Calculus): 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
|
317/24 |
Mathlib.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/ContDiffMulAction.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean |
6 |
11 |
['archiebrowne', 'github-actions', 'grunweg', 'peabrainiac'] |
ocfnash assignee:ocfnash |
3-48807 3 days ago |
25-65093 25 days ago |
33-45048 33 days |
| 38895 |
emlis42 author:emlis42 |
chore(Algebra/ContinuedFractions): golf |
This PR simplifies some proofs in `Algebra/ContinuedFractions` |
t-algebra
new-contributor
label:t-algebra$ |
39/63 |
Mathlib/Algebra/ContinuedFractions/Computation/ApproximationCorollaries.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.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 |
7 |
2 |
['github-actions'] |
joelriou assignee:joelriou |
3-48803 3 days ago |
28-47335 28 days ago |
29-38835 29 days |
| 39655 |
joelriou author:joelriou |
feat(CategoryTheory): the κ-accessible category of κ-directed posets |
Given a regular cardinal `κ : Cardinal.{u}`, we show that the category `CardinalFilteredPoset κ` of `κ`-directed partially ordered types (with order embeddings as morphisms) is a `κ`-accessible category.
---
- [x] depends on: #39669
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
188/2 |
Mathlib/CategoryTheory/Presentable/CardinalDirectedPoset.lean |
1 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
robin-carlier assignee:robin-carlier |
3-48800 3 days ago |
4-4504 4 days ago |
4-16114 4 days |
| 39819 |
mathlib-splicebot author:mathlib-splicebot |
feat: variants of lemmas in CondJensen with a.e. inequalities for the trimmed measure |
This PR was automatically created from PR #35349 by @RemyDegenne via a [review comment](https://github.com/leanprover-community/mathlib4/pull/35349#discussion_r3298163528) by @RemyDegenne. |
t-measure-probability |
34/0 |
Mathlib/MeasureTheory/Function/ConditionalExpectation/CondJensen.lean |
1 |
1 |
['github-actions'] |
EtienneC30 assignee:EtienneC30 |
3-48795 3 days ago |
8-7747 8 days ago |
8-7497 8 days |
| 38227 |
vihdzp author: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
label:t-algebra$ |
233/501 |
Mathlib/Algebra/Order/Archimedean/Real/Basic.lean,Mathlib/Algebra/Order/Monoid/Unbundled/Basic.lean |
2 |
3 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
3-36419 3 days ago |
3-33393 3 days ago |
16-30375 16 days |
| 39637 |
mcdoll author:mcdoll |
feat(Topology/Algebra): use `Is*Apply` for `ContinuousLinearMap` |
This is the first in many PRs that use the new `Is*Apply` classes instead of structure specific `foo_apply` lemmas.
The main bulk of the PR is in Mathlib/Topology/Algebra/Module/ContinuousLinearMap/Basic.lean, everything else is just fixing errors.
For each `foo` in `zero`, `one`, `add`, `sub`, `neg`, smul` we do the following:
- add an instance `IsFooApply`
- rename `coe_foo` to `toLinearMap_foo`
- depreprecate `coe_foo`, `coe_foo'`, and `foo_apply`
We are rather conservative when it comes to the instances, in future PRs this will be used more.
---
Note to maintainers: please don't put multiple PRs regarding `Is*Apply` on the queue, they will most likely create merge conflicts.
[](https://gitpod.io/from-referrer/)
|
t-topology |
279/282 |
Archive/Sensitivity.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Basic.lean,Mathlib/Algebra/Category/ModuleCat/Topology/Homology.lean,Mathlib/Analysis/Analytic/Binomial.lean,Mathlib/Analysis/Analytic/IteratedFDeriv.lean,Mathlib/Analysis/CStarAlgebra/CStarMatrix.lean,Mathlib/Analysis/CStarAlgebra/Multiplier.lean,Mathlib/Analysis/CStarAlgebra/Unitization.lean,Mathlib/Analysis/Calculus/AbsolutelyMonotone.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/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/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/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/Separation.lean,Mathlib/Analysis/Normed/Group/SeparationQuotient.lean,Mathlib/Analysis/Normed/Module/Bases.lean,Mathlib/Analysis/Normed/Module/Multilinear/Basic.lean,Mathlib/Analysis/Normed/Operator/Bilinear.lean,Mathlib/Analysis/Normed/Operator/Compact/Basic.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/SpecialFunctions/Exponential.lean,Mathlib/Analysis/SpecialFunctions/Pow/Deriv.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/IntegralCurve/Transform.lean,Mathlib/Geometry/Manifold/VectorField/LieBracket.lean,Mathlib/LinearAlgebra/Eigenspace/ContinuousLinearMap.lean,Mathlib/MeasureTheory/Function/Jacobian.lean,Mathlib/MeasureTheory/Function/JacobianOneDim.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/Modular.lean,Mathlib/NumberTheory/ModularForms/CongruenceSubgroups.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/Basic.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/SiegelsLemma.lean,Mathlib/Probability/Distributions/Gaussian/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Fernique.lean,Mathlib/Probability/Distributions/Uniform.lean,Mathlib/Topology/Algebra/Module/ContinuousLinearMap/Basic.lean,Mathlib/Topology/ContinuousMap/StoneWeierstrass.lean |
80 |
8 |
['github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'mcdoll'] |
nobody |
3-35326 3 days ago |
3-33777 3 days ago |
8-76786 8 days |
| 37832 |
YaelDillies author: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
label:t-algebra$ |
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 |
4 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
3-30614 3 days ago |
3-27939 3 days ago |
51-55519 51 days |
| 39969 |
YaelDillies author:YaelDillies |
feat(Analysis): pre/postcomposition by an isometry preserves the operator norm |
From MeanFourier
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
62/19 |
Mathlib/Analysis/Normed/Operator/NormedSpace.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousFunctions.lean,Mathlib/Probability/Distributions/Gaussian/Multivariate.lean |
3 |
1 |
['github-actions'] |
nobody |
3-29095 3 days ago |
3-28355 3 days ago |
3-28105 3 days |
| 37381 |
martinwintermath author:martinwintermath |
chore(LinearAlgebra/SesquilinearForm): deprecate `IsOrtho` and associated lemmas |
Next 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`
---
- [x] depends on: #37389
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
112/94 |
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 |
12 |
['github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mcdoll', 'vihdzp'] |
nobody |
3-26945 3 days ago |
3-25572 3 days ago |
13-81563 13 days |
| 39958 |
BryceT233 author:BryceT233 |
feat(RingTheory/Kaehler/JacobiZariski): exactness at the left of Jacobi-Zariski sequence under flatness assumption |
Given algebras `R → S → T` and `T` flat over `S`, this PR adds the exactness of `T ⊗[S] H₁(L_{S/R}) → H₁(L_{T/R}) → H₁(L_{T/S})` at the left of Jacobi-Zariski sequence. Note that the flatness assumption here is stronger than the Tor-vanishing conditions required in the full statement of [Stacks Project, 00S2](https://stacks.math.columbia.edu/tag/00S2), this should be refactored and generalized once more results on Tor modules are available.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
70/0 |
Mathlib/RingTheory/Kaehler/JacobiZariski.lean |
1 |
1 |
['github-actions'] |
nobody |
3-26269 3 days ago |
3-25503 3 days ago |
5-23787 5 days |
| 37951 |
martinwintermath author: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`. 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/)
|
t-convex-geometry |
227/128 |
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 |
5 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
3-23248 3 days ago |
3-22506 3 days ago |
34-35943 34 days |
| 38198 |
JovanGerb author: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 |
12 |
['JovanGerb', 'eric-wieser', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] |
TwoFX assignee:TwoFX |
3-20074 3 days ago |
3-18491 3 days ago |
44-71963 44 days |
| 39988 |
grunweg author:grunweg |
refactor(Tactic/Translate): document name translation a bit more |
I found the code a bit hard to read: the following commits each improve the code slightly.
Also add a test exercising the "name matches the auto-generated name" code path.
#39962 will tweak the naming algorithm slightly.
---
[](https://gitpod.io/from-referrer/)
|
t-meta
maintainer-merge
|
34/20 |
Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/TagUnfoldBoundary.lean,MathlibTest/Attribute/ToAdditive/Basic.lean |
3 |
12 |
['JovanGerb', 'github-actions', 'grunweg', 'joneugster', 'thorimur'] |
joneugster assignee:joneugster |
3-15584 3 days ago |
3-14621 3 days ago |
4-51042 4 days |
| 39951 |
chrisflav author:chrisflav |
refactor(CategoryTheory/Sites): replace `Functor.inducedTopology` |
The current `Functor.inducedTopology` is only defined for a locally fully faithful and locally cover dense functor and in the general situation it does not make the functor continuous. We change the situation in two ways:
- Replace `Functor.inducedTopology` by the induced topology in the sense of SGA, III, 3.1: The finest topology on the domain making a functor continuous.
- Add `Functor.restrictedTopology`: This is the coarsest topology on the domain containing all sieves whose image generates a covering sieve in the codomain. In general, a functor does not preserve covers for this topology and in particular is not necessarily continuous.
The old `Functor.inducedTopology` is equal (but not def-eq) to the new `Functor.restrictedTopology` whenever the old definition applies. In the situation where `Functor.restrictedTopology` makes the functor continuous, for example when `F` is flat, locally fully faithful and locally cover dense, the two topologies agree.
Related Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Induced.20topology.20on.20a.20category/with/593098526
From Proetale.
---
- [ ] depends on: #39961
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
294/122 |
Mathlib.lean,Mathlib/AlgebraicGeometry/Sites/Affine.lean,Mathlib/AlgebraicGeometry/Sites/AffineEtale.lean,Mathlib/AlgebraicGeometry/Sites/Proetale.lean,Mathlib/AlgebraicGeometry/Sites/Small.lean,Mathlib/AlgebraicGeometry/Sites/SmallAffineZariski.lean,Mathlib/CategoryTheory/MorphismProperty/CommaSites.lean,Mathlib/CategoryTheory/Sites/Coherent/Equivalence.lean,Mathlib/CategoryTheory/Sites/Coherent/SheafComparison.lean,Mathlib/CategoryTheory/Sites/DenseSubsite/InducedTopology.lean,Mathlib/CategoryTheory/Sites/Equivalence.lean,Mathlib/CategoryTheory/Sites/InducedTopology.lean |
12 |
4 |
['dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
robin-carlier assignee:robin-carlier |
3-14508 3 days ago |
3-13800 3 days ago |
4-31389 4 days |
| 38589 |
vlad902 author: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
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
64/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 |
16 |
['8e7', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'vlad902'] |
nobody |
3-7407 3 days ago |
3-6704 3 days ago |
35-20393 35 days |
| 40046 |
gasparattila author:gasparattila |
feat(Topology/Sets): compositional continuity lemma for `(Nonempty)Compacts.map` |
This can be used to prove the continuity of a function containing `Compacts.map f`, where `f` itself depends on the variable.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
18/3 |
Mathlib/Topology/Sets/VietorisTopology.lean |
1 |
1 |
['github-actions'] |
nobody |
3-2256 3 days ago |
3-1515 3 days ago |
3-1265 3 days |
| 40017 |
vasnesterov author:vasnesterov |
feat(Tactic/ComputeAsymptotics/Multiseries): define `Trimmed` |
Define `Trimmed` predicate and prove basic lemmas about it.
---
This is a part of the `compute_asymptotics` tactic (#28291).
[](https://gitpod.io/from-referrer/)
|
t-meta |
170/5 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basis.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Defs.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Trimming.lean |
5 |
1 |
['github-actions'] |
dwrensha assignee:dwrensha |
3-374 3 days ago |
3-84901 3 days ago |
3-84651 3 days |
| 37939 |
AntoineChambert-Loir author: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 |
211/4 |
Mathlib.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Order/Completion.lean,Mathlib/Topology/Order/Completion.lean,Mathlib/Topology/Sion.lean |
5 |
70 |
['ADedecker', 'AntoineChambert-Loir', 'JovanGerb', 'YaelDillies', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
vihdzp assignee:vihdzp |
2-83236 2 days ago |
7-85581 7 days ago |
42-84745 42 days |
| 39591 |
plp127 author:plp127 |
feat: `Equiv.symm_trans` |
Add theorem `Equiv.symm_trans`, which says `(f.trans g).symm = g.symm.trans f.symm`. See [Zulip](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/.60Equiv.2Esymm_trans.60/near/596266434).
---
[](https://gitpod.io/from-referrer/)
|
easy
t-logic
|
2/0 |
Mathlib/Logic/Equiv/Defs.lean |
1 |
1 |
['Hagb', 'github-actions'] |
nobody |
2-81876 2 days ago |
13-64891 13 days ago |
13-64641 13 days |
| 40049 |
JovanGerb author:JovanGerb |
feat: use `inferInstanceAs` for algebraic `Lex`/`Colex` instances |
This PR uses the new capabilities of `inferInstanceAs` to define the algebraic instances on `Lex` and `Colex` in a less leaky way, which lets us remove some `backward.respectTransparency` options.
---
[](https://gitpod.io/from-referrer/)
|
|
186/229 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Order/Group/Action/Synonym.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Lex.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Module/HahnEmbedding.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Algebra/Order/Ring/Synonym.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Order/Lex.lean,Mathlib/RingTheory/HahnSeries/Lex.lean |
12 |
2 |
['JovanGerb', 'github-actions'] |
nobody |
2-81458 2 days ago |
2-80522 2 days ago |
2-80272 2 days |
| 40041 |
JovanGerb author:JovanGerb |
chore: use `inferInstanceAs` for `OrderDual` instances |
This PR uses the new `inferInstanceAs` to generate the algebraic instances on `OrderDual`.
This is a cleaner version of the more manual fix from #37195
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
102/161 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Order/Group/Action/Synonym.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Ring/Synonym.lean |
6 |
4 |
['JovanGerb', 'github-actions', 'leanprover-radar'] |
nobody |
2-80273 2 days ago |
3-5373 3 days ago |
3-5123 3 days |
| 34361 |
grunweg author:grunweg |
chore: rename comp' to fun_comp a few more times; use to_fun to autog… |
…enerate
--------
- [x] depends on: #34257 (then this PR can be done the proper way)
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
maintainer-merge
|
19/42 |
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 |
12 |
['JovanGerb', 'github-actions', 'grunweg', 'mathlib-dependent-issues'] |
j-loreaux assignee:j-loreaux |
2-80068 2 days ago |
13-61908 13 days ago |
14-17560 14 days |
| 39990 |
grunweg author:grunweg |
chore: move Data/Nat/Lattice to Order |
This file uses only order theory: that is a much better location
---
[](https://gitpod.io/from-referrer/)
|
tech debt
file-removed
|
19/19 |
Mathlib.lean,Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Data/ENat/Lattice.lean,Mathlib/Data/List/PeriodicityLemma.lean,Mathlib/Data/Multiset/Interval.lean,Mathlib/Data/NNReal/Basic.lean,Mathlib/Data/Set/Accumulate.lean,Mathlib/Dynamics/PeriodicPts/Lemmas.lean,Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean,Mathlib/MeasureTheory/SetSemiring.lean,Mathlib/Order/Interval/Set/OrdConnectedLinear.lean,Mathlib/Order/Lattice/Nat.lean,Mathlib/Order/OrderIsoNat.lean,Mathlib/RingTheory/Nilpotent/Basic.lean,Mathlib/RingTheory/Nilpotent/Defs.lean,Mathlib/Topology/Instances/Nat.lean,Mathlib/Topology/Metrizable/Uniformity.lean |
19 |
6 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'grunweg'] |
nobody |
2-76996 2 days ago |
3-79668 3 days ago |
4-63853 4 days |
| 39991 |
Brian-Nugent author:Brian-Nugent |
chore(Topology): refactor TopologicalSpace.Opens.map to use OrderHom.toFunctor |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
27/16 |
Mathlib/Geometry/RingedSpace/OpenImmersion.lean,Mathlib/Geometry/RingedSpace/PresheafedSpace/Gluing.lean,Mathlib/Topology/Category/TopCat/Opens.lean,Mathlib/Topology/Sheaves/Presheaf.lean |
4 |
1 |
['github-actions'] |
nobody |
2-76890 2 days ago |
2-76007 2 days ago |
4-64463 4 days |
| 39992 |
Brian-Nugent author:Brian-Nugent |
feat(CategoryTheory/Order): Lattice Homs preserve limits and colimits |
Provides instances for when [OrderHom.toFunctor](https://leanprover-community.github.io/mathlib4_docs/Mathlib/CategoryTheory/Category/Preorder.html#OrderHom.toFunctor) preserves limits and colimits.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
t-order
|
105/0 |
Mathlib.lean,Mathlib/CategoryTheory/Limits/Preserves/Lattice.lean |
2 |
2 |
['dagurtomas', 'github-actions'] |
nobody |
2-76871 2 days ago |
2-76044 2 days ago |
4-36067 4 days |
| 33640 |
JovanGerb author: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 |
213/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DuplicateDecls.lean,MathlibTest/Tactic/DuplicateDecls.lean,MathlibTest/Tactic/DuplicateDeclsAux.lean |
5 |
1 |
['github-actions'] |
dwrensha assignee:dwrensha |
2-76382 2 days ago |
2-75690 2 days ago |
9-7979 9 days |
| 40054 |
chrisflav author:chrisflav |
feat(Algebra/Category): `Over.mapPullbackAdj` as an adjunction on sheaves of modules |
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
t-algebra
label:t-algebra$ |
73/3 |
Mathlib/Algebra/Category/ModuleCat/Sheaf/PushforwardContinuous.lean |
1 |
1 |
['github-actions'] |
nobody |
2-75989 2 days ago |
2-75242 2 days ago |
2-74992 2 days |
| 40053 |
gasparattila author:gasparattila |
feat(Topology/Sets): disjoint `Compacts` form an open set |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
13/0 |
Mathlib/Topology/Sets/VietorisTopology.lean |
1 |
2 |
['gasparattila', 'github-actions'] |
nobody |
2-75978 2 days ago |
2-79383 2 days ago |
2-79133 2 days |
| 39994 |
Brian-Nugent author:Brian-Nugent |
feat(CategoryTheory): Functors that preserve the terminal object are Final |
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
29/1 |
Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Sites/CoproductSheafCondition.lean |
2 |
1 |
['github-actions'] |
nobody |
2-71660 2 days ago |
2-70514 2 days ago |
4-30915 4 days |
| 36218 |
Brian-Nugent author: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`.
---
- [x] depends on: #34742
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
231/1 |
Mathlib.lean,Mathlib/Algebra/Homology/SpectralObject/Page.lean,Mathlib/CategoryTheory/ComposableArrows/Basic.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/ExactSequences.lean |
4 |
29 |
['Brian-Nugent', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
robin-carlier assignee:robin-carlier |
2-70606 2 days ago |
2-69933 2 days ago |
20-7043 20 days |
| 40059 |
qawbecrdtey author:qawbecrdtey |
chore(Dynamics): removed imports |
---
Removed several imports from `Dynamics` directory.
[](https://gitpod.io/from-referrer/)
|
t-dynamics |
0/16 |
Mathlib/Dynamics/Circle/RotationNumber/TranslationNumber.lean,Mathlib/Dynamics/Ergodic/Ergodic.lean,Mathlib/Dynamics/Flow.lean,Mathlib/Dynamics/Newton.lean,Mathlib/Dynamics/OmegaLimit.lean,Mathlib/Dynamics/PeriodicPts/Lemmas.lean,Mathlib/Dynamics/SymbolicDynamics/Basic.lean,Mathlib/Dynamics/TopologicalEntropy/CoverEntropy.lean |
8 |
3 |
['github-actions', 'leanprover-radar', 'qawbecrdtey'] |
nobody |
2-69091 2 days ago |
2-68361 2 days ago |
2-68111 2 days |
| 36922 |
SnirBroshi author: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 |
6 |
['SnirBroshi', 'Vierkantor', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
eric-wieser assignee:eric-wieser |
2-68545 2 days ago |
4-13208 4 days ago |
73-33098 73 days |
| 37598 |
IvanRenison author: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
maintainer-merge
|
33/11 |
Mathlib/Combinatorics/SimpleGraph/Coloring/VertexColoring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean |
2 |
31 |
['IvanRenison', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] |
nobody |
2-67583 2 days ago |
2-75791 2 days ago |
53-27953 53 days |
| 38600 |
khwilson author: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 |
188/0 |
Mathlib/Topology/Semicontinuity/Defs.lean |
1 |
11 |
['eric-wieser', 'github-actions', 'j-loreaux', 'khwilson'] |
j-loreaux assignee:j-loreaux |
2-62583 2 days ago |
2-61231 2 days ago |
14-7619 14 days |
| 36299 |
grunweg author: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 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)
---
- [x] depends on: #36279
- [x] depends on: #34263
- [x] depends on: #39485
- [x] depends on: #39554
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
210/3 |
Mathlib.lean,Mathlib/Geometry/Manifold/VectorBundle/CovariantDerivative/Metric.lean,Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean |
3 |
28 |
['github-actions', 'grunweg', 'leanprover-radar', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'or4nge19', 'sgouezel'] |
nobody |
2-61213 2 days ago |
2-60495 2 days ago |
2-60245 2 days |
| 40048 |
vasnesterov author:vasnesterov |
feat(Analysis/SpecialFunctions): Taylor series for `log (1 + z)` |
Prove `hasFPowerSeriesAt_clog_one`: `Complex.log (1 + x) = x - x ^ 2 / 2 + x ^ 3 / 3 - ...` and its `ℝ`-version.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
52/0 |
Mathlib/Analysis/SpecialFunctions/Complex/Analytic.lean,Mathlib/Analysis/SpecialFunctions/Complex/LogDeriv.lean |
2 |
2 |
['github-actions', 'wwylele'] |
nobody |
2-60099 2 days ago |
2-59396 2 days ago |
2-84267 2 days |
| 40062 |
winstonyin author:winstonyin |
refactor(Analysis/ODE): restate existence and uniqueness using integral curve API |
* Restate the Picard-Lindelöf existence theorems and the $C^1$ vector field results using `IsIntegralCurveOn`/`IsIntegralCurveAt` instead of raw `HasDerivWithinAt`/`HasDerivAt`.
* Restate the Grönwall-based uniqueness theorems 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: #35043
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry
t-analysis
|
526/151 |
.claude/agents/lean-proof-optimizer.md,.claude/settings.json,.mcp.json,.vscode/settings.json,Mathlib/Analysis/ODE/ExistUnique.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,docs/1000.yaml,docs/undergrad.yaml,notes.md,summary_of_changes.md |
10 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
2-52136 2 days ago |
2-51491 2 days ago |
2-57924 2 days |
| 37190 |
cjrl author: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 |
2-50148 2 days ago |
50-69047 50 days ago |
66-34057 66 days |
| 34271 |
gasparattila author: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 |
9 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'scholzhannah'] |
PatrickMassot assignee:PatrickMassot |
2-48350 2 days ago |
24-65607 24 days ago |
61-72664 61 days |
| 34759 |
Hagb author: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` as `Polynomial.degree` is to `Polynomial.natDegree`.
It's upstreamized from https://github.com/WuProver/groebner_proj.
---
`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 [`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 |
243/2 |
Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean |
2 |
17 |
['Hagb', 'github-actions', 'joneugster', 'mariainesdff', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
mattrobball assignee:mattrobball |
2-48349 2 days ago |
25-2133 25 days ago |
59-73285 59 days |
| 38092 |
SnirBroshi author: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
maintainer-merge
|
465/408 |
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/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 |
80 |
8 |
['SnirBroshi', 'dagurtomas', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] |
bryangingechen assignee:bryangingechen |
2-48347 2 days ago |
14-35217 14 days ago |
46-1714 46 days |
| 38095 |
astrainfinita author: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 label: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'] |
kim-em assignee:kim-em |
2-48346 2 days ago |
47-30209 47 days ago |
47-33586 47 days |
| 38840 |
peabrainiac author:peabrainiac |
feat(Topology): continuous germs of maps |
Add a predicate `Filter.Germ.Continuous` for continuity of germs between topological spaces, and bundled types `ContinuousGerm x Y` / `PointedContinuousGerm x y` of continuous germs at `x` resp. continuous germs at `x` taking `x` to `y`.
---
See also #10977, which tried to introduce smooth germs between manifolds a while ago, though with a focus on pointwise algebraic operations instead of composability.
[](https://gitpod.io/from-referrer/)
|
t-topology |
171/1 |
Mathlib.lean,Mathlib/Topology/ContinuousGerm.lean,Mathlib/Topology/ContinuousOn.lean,Mathlib/Topology/Germ.lean |
4 |
6 |
['chrisflav', 'github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'peabrainiac'] |
mcdoll assignee:mcdoll |
2-48345 2 days ago |
14-49986 14 days ago |
26-82621 26 days |
| 38886 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Function/SimpleFuncDenseLp` |
- rewrites `measure_preimage_lt_top_of_memLp` via `FinMeasSupp.of_lintegral_ne_top` and `FinMeasSupp.map_iff`, instead of expanding `eLpNorm'` and splitting through `ENNReal.mul_lt_top_iff`
Extracted from #38104
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
t-measure-probability
|
9/21 |
Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
sgouezel assignee:sgouezel |
2-48344 2 days ago |
30-2149 30 days ago |
30-1899 30 days |
| 39214 |
Hagb author:Hagb |
refactor(Data/Finsupp/MonomialOrder): remove `.wf` (well foundedness) field from `MonomialOrder` |
Many properties still hold without the well-foundedness.
Although Gröbner basis theory requires the monomial order to be well founded for the termination of the division algorithm (formalized in `MonomialOrder.div`), many properties that don't relay on the division or remainder still hold without the well-foundedness.
Even the division algorithm can terminate in some cases where the monomial order isn't well founded. For example, if the divisors set is finite, then the algorithm can terminate w.r.t. `MonomialOrder.lex (σ := Nat)` even though it isn't well founded. Such cases cannot be directly stated if the formalization of monomial order requires well-foundedness.
Deletions:
- MonomialOrder.wf
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
21/13 |
Mathlib/Data/Finsupp/MonomialOrder.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder/DegLex.lean |
4 |
5 |
['Hagb', 'github-actions', 'vihdzp'] |
mariainesdff assignee:mariainesdff |
2-48343 2 days ago |
20-57935 20 days ago |
21-75076 21 days |
| 39720 |
vihdzp author:vihdzp |
feat: cofinality within order |
We introduce `Order.cofWithin x = Order.cof (Iio x)` for the cofinality of an element within a preorder. This generalizes `Ordinal.cof`, with the caveat that `cof o : Cardinal.{u}` for `o : Ordinal.{u}`, whereas `cofWithin o : Cardinal.{u + 1}`.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
maintainer-merge
|
104/14 |
Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality/Ordinal.lean |
3 |
11 |
['SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-merge-conflicts', 'vihdzp'] |
alreadydone assignee:alreadydone |
2-48341 2 days ago |
7-33276 7 days ago |
10-52411 10 days |
| 39753 |
mathlib-splicebot author:mathlib-splicebot |
feat: the sigma-algebra generated by the constant indicator of a set is smaller than the one generated by the set |
This PR was automatically created from PR #37259 by @EtienneC30 via a [review comment](https://github.com/leanprover-community/mathlib4/pull/37259#discussion_r3292960152) by @EtienneC30. |
t-measure-probability |
6/0 |
Mathlib/MeasureTheory/MeasurableSpace/MeasurablyGenerated.lean |
1 |
2 |
['EtienneC30', 'github-actions'] |
sgouezel assignee:sgouezel |
2-48341 2 days ago |
9-85267 9 days ago |
9-85017 9 days |
| 40051 |
grunweg author:grunweg |
fix: correct differential geometry elaborators around the tangent bundle |
The previous logic was simply wrong --- it was just masked in practice because
the `fromBaseInfo` strategy is tried first. (Indeed, just changing the order makes
both the build in `VectorBundle/Tangent` as well as a number of tests fail.)
This bugfix is important as #40047 (another elaborators bug fix) will change things,
so the tangent space strategy is tried first.
---
I don't feel strongly about the second commit, i.e. reordering the strategies now.
It yields slightly nicer output, so why not?
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry
t-meta
|
12/23 |
Mathlib/Geometry/Manifold/Notation.lean,MathlibTest/DifferentialGeometry/Notation/Advanced.lean,MathlibTest/DifferentialGeometry/Notation/Delaborators.lean |
3 |
1 |
['github-actions'] |
thorimur assignee:thorimur |
2-48338 2 days ago |
2-82893 2 days ago |
2-82643 2 days |
| 39857 |
plp127 author:plp127 |
chore(Order/CompleteLattice/Basic): `Sort*` polymorphism |
Generalize some theorems from `Type*` to `Sort*`. Also make type-variables explicitly either `Type*` or `Sort*`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
15/20 |
Mathlib/Order/CompleteLattice/Basic.lean |
1 |
4 |
['SnirBroshi', 'b-mehta', 'github-actions', 'mathlib-merge-conflicts'] |
nobody |
2-44801 2 days ago |
2-41768 2 days ago |
6-39252 6 days |
| 39372 |
yuanyi-350 author:yuanyi-350 |
refactor(NumberTheory): golf `Mathlib/NumberTheory/ModularForms/EisensteinSeries/MDifferentiable` |
- rewrites `eisensteinSeriesSIF_mdifferentiable` to use `UpperHalfPlane.mdifferentiable_iff` directly and conclude from local uniform convergence of the Eisenstein series
Extracted from #38144
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
|
1/6 |
Mathlib/NumberTheory/ModularForms/EisensteinSeries/MDifferentiable.lean |
1 |
3 |
['github-actions', 'mathlib-merge-conflicts', 'yuanyi-350'] |
nobody |
2-36066 2 days ago |
9-50901 9 days ago |
18-58131 18 days |
| 39759 |
plp127 author:plp127 |
chore(FieldTheory/KrullTopology): move lemmas to earlier file |
We move some lemmas unrelated to the Krull topology out of the `KrullTopology` file. They are placed in the earlier file `FieldTheory/IsGalois/Basic` instead.
---
In #23693 it is said that
> The proof of it uses some results in this file, so it can't be put into earlier files.
This is no longer true, so we want move it out of the `KrullTopology` file because the theorems have nothing to do with the Krull topology. I found that they can go in `FieldTheory/IsGalois/Basic` without modifying the proofs. They cannot go any earlier because the statement of the theorems contains `IsGalois`, which is defined in this file.
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
59/68 |
Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/KrullTopology.lean |
2 |
5 |
['acmepjz', 'github-actions', 'grunweg', 'plp127', 'vihdzp'] |
nobody |
2-34502 2 days ago |
5-65280 5 days ago |
9-61001 9 days |
| 39374 |
yuanyi-350 author:yuanyi-350 |
refactor(NumberTheory): golf `Mathlib/NumberTheory/ModularForms/Derivative` |
- rewrites `normalizedDerivOfComplex_sub` to reuse the additive and negation lemmas instead of reproving the subtraction formula pointwise
Extracted from #38144
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
|
5/10 |
Mathlib/NumberTheory/ModularForms/Derivative.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
2-27833 2 days ago |
2-27097 2 days ago |
18-81017 18 days |
| 39520 |
BryceT233 author:BryceT233 |
feat(RingTheory/Extension): `h1CotangentEquivCotangent` |
Given `Algebra R S` and an extension `P : Extension R S`, this PR adds `extendScalars` (viewing `P` as an extension of `S` over `P.Ring`), `defaultHom` (the canonical extension homomorphism from the universal extension `R[S] → S` to `P`) and some related linear equivalences on cotangent spaces or the first homology of the naive cotangent complexes. We show the commutativity of the following diagram:
Co-authored-by: @chrisflav
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
177/0 |
Mathlib.lean,Mathlib/RingTheory/Extension/Cotangent/Basic.lean,Mathlib/RingTheory/Extension/ExtendScalars.lean |
3 |
6 |
['BryceT233', 'chrisflav', 'github-actions', 'robin-carlier'] |
chrisflav assignee:chrisflav |
2-26966 2 days ago |
2-28272 2 days ago |
12-65436 12 days |
| 40067 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Analytic/Order` |
- refactors `AnalyticOnNhd.preimage_zero_mem_codiscreteWithin` to use `eqOn_zero_or_eventually_ne_zero_of_preconnected` directly
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
3/8 |
Mathlib/Analysis/Analytic/Order.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
2-25013 2 days ago |
2-25054 2 days ago |
2-24804 2 days |
| 40068 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Asymptotics/SpecificAsymptotics` |
- rewrites `Asymptotics.isLittleO_pow_pow_cobounded_of_lt` via `mul_isLittleO` and `isLittleO_const_id_cobounded`, avoiding the explicit cobounded estimate
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
3/12 |
Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
2-25012 2 days ago |
2-25144 2 days ago |
2-24894 2 days |
| 40070 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Complex/Isometry` |
- simplifies `LinearIsometry.im_apply_eq_im` by deriving real-part equality from the squared distance identity
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
6/11 |
Mathlib/Analysis/Complex/Isometry.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
2-25009 2 days ago |
2-24980 2 days ago |
2-24730 2 days |
| 40069 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction` |
- refactors `σ_mul` by simplifying the determinant sign split with `mul_pos_iff`
- rewrites `denom_cocycle'` as a direct consequence of `denom_cocycle`
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
1/7 |
Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
nobody |
2-24229 2 days ago |
2-23479 2 days ago |
2-23229 2 days |
| 39984 |
grunweg author:grunweg |
chore(Data): move some files to better locations |
Move a number of files in `Data` to clearly better locations.
See individual commit messages for details.
---
- [x] depends on: #39976
[](https://gitpod.io/from-referrer/)
|
file-removed
tech debt
maintainer-merge
|
30/30 |
Counterexamples/HomogeneousPrimeNotPrime.lean,Mathlib.lean,Mathlib/Algebra/Group/ConjFinite.lean,Mathlib/Algebra/Group/Subgroup/Finite.lean,Mathlib/Algebra/GroupWithZero/Units/Fintype.lean,Mathlib/Algebra/Lie/SerreConstruction.lean,Mathlib/Analysis/Calculus/ContDiff/FaaDiBruno.lean,Mathlib/Analysis/Real/Cardinality.lean,Mathlib/CategoryTheory/Galois/Basic.lean,Mathlib/Combinatorics/SimpleGraph/VertexCover.lean,Mathlib/Data/Set/PowersetCard.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/SpecificGroups/Alternating.lean,Mathlib/LinearAlgebra/Matrix/Action.lean,Mathlib/LinearAlgebra/Matrix/Bilinear.lean,Mathlib/LinearAlgebra/Matrix/Cartan.lean,Mathlib/LinearAlgebra/Matrix/DualNumber.lean,Mathlib/LinearAlgebra/Matrix/Invertible.lean,Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean,Mathlib/LinearAlgebra/Matrix/SchurComplement.lean,Mathlib/LinearAlgebra/Matrix/SpecialLinearGroup.lean,Mathlib/LinearAlgebra/Projectivization/Cardinality.lean,Mathlib/NumberTheory/MulChar/Basic.lean,Mathlib/RingTheory/SimpleModule/Basic.lean,Mathlib/SetTheory/Cardinal/Embedding.lean,Mathlib/SetTheory/Cardinal/NatCard.lean,Mathlib/SetTheory/Cardinal/Rat.lean,Mathlib/Topology/Compactification/OnePoint/ProjectiveLine.lean,scripts/noshake.json |
30 |
4 |
['YaelDillies', 'github-actions', 'mathlib-dependent-issues'] |
nobody |
2-22660 2 days ago |
3-68277 3 days ago |
3-68027 3 days |
| 40071 |
yuanyi-350 author:yuanyi-350 |
refactor(Analysis): golf `Mathlib/Analysis/Convex/BetweenList` |
- rewrites `SortedLE.wbtw` using `triplewise_iff_getElem` and sorted getElem inequalities instead of nested list induction
Extracted from #37968
[](https://gitpod.io/from-referrer/) |
codex
t-analysis
LLM-generated
|
3/14 |
Mathlib/Analysis/Convex/BetweenList.lean |
1 |
3 |
['github-actions', 'themathqueen', 'yuanyi-350'] |
nobody |
2-22033 2 days ago |
2-21350 2 days ago |
2-24068 2 days |
| 37073 |
kim-em author: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 |
12 |
['JovanGerb', 'github-actions', 'kim-em', 'leanprover-radar', 'mathlib-merge-conflicts'] |
nobody |
2-16971 2 days ago |
5-69247 5 days ago |
35-52062 35 days |
| 40014 |
vasnesterov author:vasnesterov |
feat(Tactic/ComputeAsymptotics/Multiseries): basic constructions |
Introduce basic constructions for multiseries: `const`, `monomial`, `monomialRpow`.
---
This is a part of the `compute_asymptotics` tactic (#28291).
[](https://gitpod.io/from-referrer/)
|
t-meta |
330/9 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basic.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Basis.lean,Mathlib/Tactic/ComputeAsymptotics/Multiseries/Defs.lean |
5 |
1 |
['github-actions'] |
thorimur assignee:thorimur |
2-14161 2 days ago |
2-13444 2 days ago |
4-258 4 days |
| 36709 |
kim-em author: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'] |
nobody |
2-13982 2 days ago |
35-11195 35 days ago |
51-85582 51 days |
| 40013 |
WilliamCoram author:WilliamCoram |
feat: define bounded sets and power bounded elements |
We define bounded sets, so that we can define power bounded elements in a topological ring. Using this we generalise some notions of topoligcally nilpotent elements and define a residue field.
AI usage: some proofs were initially generated with Claude code before being cleaned and/or rewritten by hand.
---
[](https://gitpod.io/from-referrer/)
|
t-topology
LLM-generated
large-import
|
430/5 |
Mathlib.lean,Mathlib/Topology/Algebra/Bounded.lean,Mathlib/Topology/Algebra/PowerBounded.lean,Mathlib/Topology/Algebra/TopologicallyNilpotent.lean |
4 |
10 |
['ADedecker', 'WilliamCoram', 'github-actions', 'vihdzp', 'wwylele'] |
nobody |
2-6861 2 days ago |
2-10483 2 days ago |
4-530 4 days |
| 32692 |
WilliamCoram author: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
|
159/0 |
Mathlib.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Algebra/Order/Antidiag/Tendsto.lean,Mathlib/RingTheory/MvPowerSeries/Restricted.lean |
4 |
52 |
['WilliamCoram', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'mbkybky'] |
jcommelin assignee:jcommelin |
2-5219 2 days ago |
2-4485 2 days ago |
56-47679 56 days |
| 39029 |
felixpernegger author:felixpernegger |
chore: remove redundant `unfold`s |
This PR removed roughly (estimated by files I went through) half of the `unfold`'s in mathlib which can be removed such that the proof still works (found by searching `unfold ` in VSCode in manually going through ~600/1100 occurences).
I originally planned to replace all, but I couldn't find any relevant discussion if this is actually a good practice, so to save potentially wasted time, I make this PR now. (similarly with the `clear` tactic)
---
[](https://gitpod.io/from-referrer/)
|
|
64/109 |
Archive/Imo/Imo1994Q1.lean,Archive/Imo/Imo1998Q2.lean,Archive/Imo/Imo2001Q5.lean,Archive/Wiedijk100Theorems/BuffonsNeedle.lean,Mathlib/Algebra/EuclideanDomain/Basic.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/AlgebraicTopology/SimplicialSet/Coskeletal.lean,Mathlib/Analysis/Asymptotics/SuperpolynomialDecay.lean,Mathlib/Analysis/Complex/JensenFormula.lean,Mathlib/Analysis/Convex/Strict.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean,Mathlib/Analysis/InnerProductSpace/GramSchmidtOrtho.lean,Mathlib/Analysis/InnerProductSpace/PiL2.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/Rpow/Basic.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Orthogonality.lean,Mathlib/CategoryTheory/Functor/Flat.lean,Mathlib/CategoryTheory/Functor/FullyFaithful.lean,Mathlib/CategoryTheory/Monoidal/Closed/Functor.lean,Mathlib/Combinatorics/Enumerative/Partition/Basic.lean,Mathlib/Combinatorics/Graph/Delete.lean,Mathlib/Computability/PartrecCode.lean,Mathlib/Computability/RegularExpressions.lean,Mathlib/Computability/TuringMachine/PostTuringMachine.lean,Mathlib/Computability/TuringMachine/StackTuringMachine.lean,Mathlib/Condensed/Light/TopCatAdjunction.lean,Mathlib/Data/Fintype/EquivFin.lean,Mathlib/Data/Fintype/List.lean,Mathlib/Data/Int/GCD.lean,Mathlib/Data/List/Intervals.lean,Mathlib/Data/Matrix/Basis.lean,Mathlib/Data/Nat/BinaryRec.lean,Mathlib/Data/Nat/ChineseRemainder.lean,Mathlib/Data/Nat/Digits/Div.lean,Mathlib/Data/Nat/Dist.lean,Mathlib/Data/Ordmap/Ordset.lean,Mathlib/Data/PNat/Prime.lean,Mathlib/Data/Real/Embedding.lean,Mathlib/Data/Seq/Defs.lean,Mathlib/Data/Stream/Init.lean,Mathlib/Data/WSeq/Basic.lean,Mathlib/Data/ZMod/Basic.lean |
44 |
5 |
['felixpernegger', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] |
nobody |
2-3052 2 days ago |
1-86096 1 day ago |
24-1318 24 days |
| 36605 |
martinwintermath author: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
---
- [x] depends on: #37464
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
65/0 |
Mathlib/Geometry/Convex/Cone/Pointed.lean |
1 |
66 |
['artie2000', 'github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
nobody |
2-1142 2 days ago |
2-51394 2 days ago |
24-53819 24 days |
| 39729 |
grunweg author:grunweg |
chore(Geometry/Manifold): make some doc-strings follow the style guide |
such as, by them beginning with the object they are defining as a subject.
This will yield much better doc-strings for the differential geometry elaborators in #39677.
It also increases conformance with the [documentation style guide](https://github.com/leanprover/lean4/blob/master/doc/style.md).
Inspired by the MI retreat in Lisbon.
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
32/22 |
Mathlib/Geometry/Manifold/ContMDiff/Defs.lean,Mathlib/Geometry/Manifold/MFDeriv/Defs.lean,Mathlib/Geometry/Manifold/MFDeriv/NormedSpace.lean |
3 |
3 |
['github-actions', 'grunweg', 'mathlib-merge-conflicts'] |
PatrickMassot assignee:PatrickMassot |
1-83384 1 day ago |
1-82511 1 day ago |
10-48832 10 days |
| 36219 |
gasparattila author:gasparattila |
chore(Order/SupClosed): use `to_dual` |
---
[](https://gitpod.io/from-referrer/)
|
t-order
maintainer-merge
|
68/215 |
Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/SupClosed.lean |
2 |
16 |
['JovanGerb', 'YaelDillies', 'gasparattila', 'github-actions', 'mathlib-merge-conflicts'] |
YaelDillies assignee:YaelDillies |
1-82694 1 day ago |
2-16342 2 days ago |
51-70448 51 days |
| 40033 |
JJYYY-JJY author:JJYYY-JJY |
chore: remove flexible linter suppressions |
This PR removes two local `linter.flexible` suppressions by replacing compact `simp; infer_instance` with explicit proofs.
Changed files:
- `Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean`
- `Mathlib/Topology/UniformSpace/Ultra/Constructions.lean`
Tested with:
`lake build`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor |
6/8 |
Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean,Mathlib/Topology/UniformSpace/Ultra/Constructions.lean |
2 |
6 |
['chenson2018', 'github-actions', 'vihdzp'] |
nobody |
1-78557 1 day ago |
2-64503 2 days ago |
3-56192 3 days |
| 38778 |
felixpernegger author: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 |
287/2 |
Mathlib.lean,Mathlib/Topology/EMetricSpace/Weak.lean,Mathlib/Topology/Order/WithTop.lean |
3 |
7 |
['SnirBroshi', 'felixpernegger', 'github-actions', 'j-loreaux'] |
PatrickMassot assignee:PatrickMassot |
1-67697 1 day ago |
1-67874 1 day ago |
16-50403 16 days |
| 40081 |
xroblot author:xroblot |
chore(Algebra/Algebra/Subalgebra): lower priority of Module instance |
Lower the priority of `Subalgebra.instModuleSubtypeMem` from default (1000) to `low` (100).
This instance uses `inferInstance`, which re-triggers typeclass synthesis and can be expensive
to succeed. Lowering the priority makes it a fallback when cheaper paths are available.
Benchmark results show no regressions and meaningful speedups on several files
(up to -23% on `Mathlib.LinearAlgebra.TensorProduct.Subalgebra`).
:robot: Prepared with Claude Code |
t-algebra label:t-algebra$ |
1/1 |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean |
1 |
7 |
['github-actions', 'leanprover-radar', 'plp127', 'xroblot'] |
nobody |
1-67603 1 day ago |
1-66720 1 day ago |
1-67627 1 day |
| 39629 |
hawkrobe author:hawkrobe |
feat(RingTheory/Coalgebra/Convolution): Algebra on convolution semiring |
This PR completes the algebraic structure on the convolution object.
---
I followed the pattern in [`Matrix/WithConv.lean`](https://github.com/leanprover-community/mathlib4/blob/5e932f97dd25535344f80f9dd8da3aab83df0fe6/Mathlib/LinearAlgebra/Matrix/WithConv.lean#L98) which splits out `IsScalarTower` and `SMulCommClass`. Used in pre-Lie / Oudom–Guin constructions. |
t-ring-theory
new-contributor
|
24/1 |
Mathlib/RingTheory/Coalgebra/Convolution.lean |
1 |
2 |
['github-actions'] |
nobody |
1-60754 1 day ago |
1-60036 1 day ago |
12-65082 12 days |
| 39239 |
alainchmt author:alainchmt |
feat(FieldTheory/Finite): irreducible polynomial divides X^q^n - X iff degree divides n |
---
Add the theorem saying that, for an irreducible polynomial `f` over a finite field `K`, the degree of `f` divides `n` if and only if `f` divides `X ^ (Nat.card K) ^ n - X`. Include auxiliary lemmas.
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
34/0 |
Mathlib/FieldTheory/Finite/Extension.lean,Mathlib/FieldTheory/Minpoly/Field.lean |
2 |
2 |
['github-actions'] |
nobody |
1-55573 1 day ago |
21-17323 21 days ago |
21-17073 21 days |
| 39282 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): add union morphism lemma for LanguageOn |
In symbolic dynamics.
This PR proves that taking the language over a finite shape commutes with unions of configuration sets:
$LanguageOn (X \cup Y) U = LanguageOn X U \cup LanguageOn Y U$
The proof is a direct unfolding of definitions: a pattern in the language of $X \cup Y$ comes from restricting a configuration $x ∈ X \cup Y$, and splitting on whether $x \in X$ or $x \in Y$ yields the corresponding inclusion in either $LanguageOn X U$ or $LanguageOn Y U$. The converse direction rebuilds a witness in $X \cup Y$ from either side of the union.
Related to issue #39252 |
t-dynamics
new-contributor
|
9/1 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
4 |
['Sfgangloff', 'github-actions', 'sgouezel'] |
sgouezel assignee:sgouezel |
1-51612 1 day ago |
1-50831 1 day ago |
20-24622 20 days |
| 38587 |
dagurtomas author: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
t-category-theory
|
905/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/CategoryTheory/MkConcreteCategory.lean,MathlibTest/CategoryTheory/MkConcreteCategory.lean |
4 |
8 |
['dagurtomas', 'eric-wieser', 'github-actions'] |
nobody |
1-50150 1 day ago |
26-39696 26 days ago |
26-39446 26 days |
| 38317 |
WenrongZou author: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 |
98/0 |
Mathlib/Data/Nat/Choose/Lucas.lean |
1 |
5 |
['WenrongZou', 'github-actions', 'joneugster'] |
nobody |
1-50148 1 day ago |
17-21097 17 days ago |
42-54453 42 days |
| 38349 |
SnirBroshi author: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 |
4 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
1-49511 1 day ago |
1-48759 1 day ago |
40-53949 40 days |
| 32583 |
MJ141592 author: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
|
95/93 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/DeleteEdges.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean |
5 |
48 |
['MJ141592', 'Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
b-mehta assignee:b-mehta |
1-48115 1 day ago |
8-4187 8 days ago |
57-10265 57 days |
| 36376 |
jessealama author:jessealama |
feat(SimpleGraph): hamiltonian cycle from cyclic permutation |
This PR provides `IsHamiltonian.of_perm`, 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/Data/List/Chain.lean`**:
- `IsChain.iterate`: `List.iterate f a n` is a chain under `r` whenever `r a (f a)` holds for all `a`
**`Mathlib/Data/List/Iterate.lean`**:
- `getLast_iterate`: the last element of `List.iterate f a n` is `f^[n - 1] a`
**`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`**:
- `IsCycleOn.injOn_sym2_pow_apply`: the unordered-pair edge map `k ↦ s((f ^ k) a, (f ^ (k + 1)) a)` is injective on `[0, #s)` when `#s ≠ 2`
- `IsCycleOn.sym2_pow_apply_ne`: edge distinctness for cycle-on permutations — `s((f ^ k) a, (f ^ (k + 1)) a) ≠ s(a, f a)` when `k ≠ 0`, `k < #s`, and `#s ≠ 2`
- `Perm.toList_eq_range_map_pow`: expresses `toList` as a range map over powers
**`Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean`**:
- `cons_isHamiltonianCycle_iff`: a Hamiltonian path closed by an edge outside its support is a Hamiltonian cycle, and conversely
- `IsHamiltonian.of_perm`: the main theorem
---
- [x] depends on: #36307 |
t-combinatorics
maintainer-merge
|
182/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian/Perm.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 |
8 |
78 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'jessealama', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
b-mehta assignee:b-mehta |
1-48113 1 day ago |
12-44248 12 days ago |
58-2392 58 days |
| 36743 |
Jun2M author: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.
### 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`.
---
This PR generalises #35776 to also unify `Graph`.
PRs depending on this PR are
#39047 (graphLike with no multi edges) => #39050 (Digraph is graphLike)
||
V
#36829 (undirected graphLike) => #39053 (Graph is graphLike) & #39054 (Simplegraph is graphLike)
||
V
#36756 (def of walk on GraphLike) => #36971 (change Simplegraph to use GraphLike walk)
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
104/0 |
Mathlib.lean,Mathlib/Combinatorics/GraphLike/Basic.lean |
2 |
78 |
['IvanRenison', 'Jun2M', 'SnirBroshi', 'YaelDillies', 'github-actions', 'lauramonk', 'mathlib-merge-conflicts'] |
b-mehta assignee:b-mehta |
1-48112 1 day ago |
20-1227 20 days ago |
75-46624 75 days |
| 38309 |
ntapiam author: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
label:t-algebra$ |
270/0 |
Mathlib.lean,Mathlib/Algebra/NonAssoc/Dendriform/Defs.lean,docs/references.bib |
3 |
5 |
['dagurtomas', 'github-actions', 'ntapiam'] |
themathqueen assignee:themathqueen |
1-48107 1 day ago |
25-15065 25 days ago |
40-19299 40 days |
| 38339 |
xroblot author: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`.
This group is useful for the Galois theory of cyclotomic fields
---
- [x] depends on: #38340
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
109/1 |
Mathlib/Data/ZMod/Coprime.lean,Mathlib/NumberTheory/DirichletCharacter/Basic.lean,Mathlib/NumberTheory/MulChar/Basic.lean |
3 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
loefflerd assignee:loefflerd |
1-48106 1 day ago |
2-25607 2 days ago |
2-37299 2 days |
| 38489 |
Jun2M author: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/)
|
t-topology |
261/3 |
Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/MeasureTheory/OuterMeasure/OfFunction.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean,Mathlib/Topology/Algebra/InfiniteSum/Order.lean |
4 |
9 |
['Jun2M', 'SnirBroshi', 'github-actions', 'wwylele'] |
alreadydone assignee:alreadydone |
1-48103 1 day ago |
22-60022 22 days ago |
38-42787 38 days |
| 38731 |
martinwintermath author: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 label:t-algebra$ |
56/26 |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean |
1 |
3 |
['github-actions', 'wwylele'] |
joelriou assignee:joelriou |
1-48102 1 day ago |
33-45867 33 days ago |
33-70993 33 days |
| 39298 |
joelriou author:joelriou |
feat(AlgebraicTopology/SimplicialSet): the pushout-product of a horn inclusion and a boundary inclusion is an anodyne extension |
In this PR, we construct a regular pairing for the union of `Λ[m + 1, l] ⊗ ∂Δ[n]` and ` Δ[m + 1] ⊗ ∂Δ[n]` in `Δ[m + 1] ⊗ Δ[n]`. It follows immediately that the inclusion of this subcomplex is an anodyne extension.
---
- [x] depends on: #39462
- [x] depends on: #39463
[](https://gitpod.io/from-referrer/)
|
t-algebraic-topology
large-import
maintainer-merge
|
740/2 |
Mathlib.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/PairingCore.lean,Mathlib/AlgebraicTopology/SimplicialSet/AnodyneExtensions/UnionProd.lean,Mathlib/AlgebraicTopology/SimplicialSet/Monoidal.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplicesSubcomplex.lean,Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean |
6 |
13 |
['dagurtomas', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
mattrobball assignee:mattrobball |
1-48101 1 day ago |
1-78351 1 day ago |
7-12047 7 days |
| 40012 |
SnirBroshi author:SnirBroshi |
feat(GroupTheory/PGroup): iSup of normal p-subgroups is a p-subgroup |
Also shows that the `iSup` of subgroups equals the set-union of all finite `iSup`s.
Co-authored-by: Albert Smith <10266947+ChiCubed@users.noreply.github.com>
---
[](https://gitpod.io/from-referrer/)
|
t-group-theory |
34/0 |
Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/GroupTheory/PGroup.lean |
2 |
1 |
['github-actions'] |
tb65536 assignee:tb65536 |
1-48098 1 day ago |
4-554 4 days ago |
4-1484 4 days |
| 40072 |
yuanyi-350 author:yuanyi-350 |
refactor(NumberTheory): golf `Mathlib/NumberTheory/ArithmeticFunction/Defs` |
- golfs `ArithmeticFunction/Defs` by replacing explicit divisor-antidiagonal singleton arguments in the left-identity theorem and `mul_one` with direct `simp_all` calls using divisor map lemmas and `sum_eq_single`
Extracted from #38144
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
t-number-theory
|
2/20 |
Mathlib/NumberTheory/ArithmeticFunction/Defs.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
1-48097 1 day ago |
2-24927 2 days ago |
2-24677 2 days |
| 40075 |
grunweg author:grunweg |
fix: more complete model finding for a given manifold in context |
When searching for a model with corners on a manifold, also try finding a model which is not just a local assumption, but the trivial model on a normed space or a non-trivially normed field.
Minimised from an elaborator failure in Kevin Buzzard's Jacobian challenge.
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry
t-meta
|
54/2 |
Mathlib/Geometry/Manifold/Notation.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean |
2 |
2 |
['github-actions', 'grunweg'] |
JovanGerb assignee:JovanGerb |
1-48096 1 day ago |
2-16796 2 days ago |
2-16546 2 days |
| 40080 |
wwylele author:wwylele |
feat(Analysis/Meromorphic): meromorphicOrderAt of derivative |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
34/0 |
Mathlib/Analysis/Meromorphic/Order.lean |
1 |
5 |
['copilot-pull-request-reviewer', 'github-actions'] |
nobody |
1-46111 1 day ago |
1-45389 1 day ago |
1-86046 1 day |
| 38027 |
8e7 author: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
|
87/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Star.lean |
2 |
41 |
['8e7', 'IvanRenison', 'JovanGerb', 'SnirBroshi', 'b-mehta', 'github-actions', 'vihdzp', 'vlad902'] |
b-mehta assignee:b-mehta |
1-43307 1 day ago |
1-42498 1 day ago |
49-30170 49 days |
| 39954 |
jihuang2024 author:jihuang2024 |
feat(Analysis/Polynomial): define Hurwitz stability and prove small-degree characterizations |
Proofs were developed with assistance from Claude Code. I have reviewed and understand all the code and can justify the design decisions.
This PR introduces the predicate Polynomial.IsHurwitzStable for real polynomials and proves the Routh–Hurwitz stability criterion for degrees 1 and 2.
A polynomial p : ℝ[X] is Hurwitz stable if every root of its complexification has strictly negative real part. This notion arises in control theory and the study of linear ODEs, where it characterises asymptotic stability of a system.
New definitions
Polynomial.IsHurwitzStable: ∀ z : ℂ, (p.map (algebraMap ℝ ℂ)).IsRoot z → z.re < 0
New theorems
Polynomial.not_isHurwitzStable_zero: the zero polynomial is not Hurwitz stable
Polynomial.IsHurwitzStable.ne_zero: Hurwitz stable polynomials are nonzero
Polynomial.isHurwitzStable_X_add_C: X + C a is Hurwitz stable ↔ 0 < a
Polynomial.isHurwitzStable_quadratic: X ^ 2 + C b * X + C c is Hurwitz stable ↔ 0 < b ∧ 0 < c
Proof strategy for the quadratic
The quadratic case splits on whether a root z is real (z.im = 0) or complex (z.im ≠ 0, which forces 2 * z.re + b = 0). Existence of a root uses Complex.exists_root (Fundamental Theorem of Algebra). The necessary condition in the real-root case uses the Vieta complementary root -b - z.re.
Future work
The general Routh–Hurwitz theorem (for degree n, stated in terms of the Hurwitz matrix and its leading principal minors) requires infrastructure not yet in Mathlib — in particular a theory of the Cauchy index or the Bezoutian of two polynomials. This PR lays the definitional foundation for that work.
This corresponds to [1000.yaml](https://github.com/leanprover-community/mathlib4/blob/master/docs/1000.yaml#L2697) Q4455015 - Routh–Hurwitz theorem |
t-analysis
new-contributor
LLM-generated
|
131/0 |
Mathlib.lean,Mathlib/Analysis/Polynomial/RouthHurwitz.lean |
2 |
10 |
['SnirBroshi', 'github-actions', 'jihuang2024', 'wwylele'] |
nobody |
1-41779 1 day ago |
1-41067 1 day ago |
5-2712 5 days |
| 40010 |
Hagb author:Hagb |
feat(Algebra/MvPolynomial/SupDegree): port `AddMonoidAlgebra.supDegree` to `MvPolynomial` |
This PR ports `AddMonoidAlgebra.{supDegree,leadingCoeff,Monic}` to `MvPolynomial.{supDegree,leadingCoeff,Monic}`, adopts some definitions about MvPolynomial to `supDegree`, and simplify some proofs with lemmas of `supDegree`.
Given `p : MvPolynomial σ R` and `D` (in a type as is required by `{MvPolynomial,AddMonoidAlgebra}.supDegree`), `MvPolynomial.supDegree D f` is def-eq to `AddMonoidAlgebra.supDegree D f`, while `MvPolynomial.supDegree` is stated directly on `MvPolynomial` and makes using it on `MvPolynomial` easier. Most of theorems about `MvPolynomial.supDegree` are also just specialized variants of their `AddMonoidAlgebra.supDegree` versions, and proved directly by the latter. (Note: some theorems of `MvPolynomial`, such as [`MvPolynomial.degrees_monomial_eq`](https://github.com/leanprover-community/mathlib4/blob/29c689a82e2f78fa770f8c6dd70cb9a21b7e4d05/Mathlib/Algebra/MvPolynomial/Degrees.lean#L94-L97), have used `AddMonoidAlgebra.supDegree` before this PR.)
The following definitions are reworded with `supDegree`, whose original definitions are def-eq to the new definitions:
- [`MvPolynomial.totalDegree`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MvPolynomial.totalDegree#doc)
- [`MvPolynomial.degrees`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MvPolynomial.degrees#doc)
- [`MvPolynomial.weightedTotalDegree`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MvPolynomial.weightedTotalDegree#doc)
- [`MvPolynomial.weightedTotalDegree'`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MvPolynomial.weightedTotalDegree'#doc)
- [`MonomialOrder.degree`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MonomialOrder.degree#doc)
The following definitions are not changed directly, while provided lemmas that express them with `supDegree`, `MvPolynomial.leadingCoeff` or `MvPolynomial.Monic`, since their original definitions are not def-eq to their `supDegree` versions.
- [`MvPolynomial.degreeOf`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MvPolynomial.degreeOf#doc)
- [`MonomialOrder.leadingCoeff`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MonomialOrder.leadingCoeff#doc)
- [`MonomialOrder.Monic`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=MonomialOrder.Monic#doc)
Further works (probably not in this PR):
- abstract general and reusable theorems in `supDegree` from some theorems about those specialized declarations;
- simplify proofs of more theorems about those specialized declarations with theorems in `supDegree`;
- add `D.Injective` as a hypothesis of `AddMonoidAlgebra.leadingCoeff` (#40084) or add another definition natural for cases where `D` is not injective.
---
This PR overlaps #40084, Once one gets merged, another should be updated.
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
415/188 |
Mathlib.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/SchwartzZippel.lean,Mathlib/Algebra/MvPolynomial/SupDegree.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/RingTheory/MvPolynomial/Homogeneous.lean,Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/Defs.lean,Mathlib/RingTheory/MvPolynomial/Symmetric/FundamentalTheorem.lean,Mathlib/RingTheory/MvPolynomial/WeightedHomogeneous.lean,Mathlib/RingTheory/NoetherNormalization.lean |
13 |
3 |
['Hagb', 'github-actions'] |
faenuccio assignee:faenuccio |
1-38432 1 day ago |
1-38432 1 day ago |
1-38182 1 day |
| 40092 |
korbonits author:korbonits |
feat(Topology/Connected): path-connectedness of products and pi types |
# Disclaimer
Following https://leanprover-community.github.io/contribute/index.html, I wanted to make a simple contribution to point set topology given some of the very welcoming Zulip mathematicians. I used Claude Code to plan, review, and test some example definitions before raising this PR. I'm using this as a way to make meaningful contributions to mathlib4 as I learn Lean. Background: mathematics and a decade+ in ML engineering/applied science.
# Description
Add path-connectedness of binary products and dependent products (pi types):
- `JoinedIn.prod`, `IsPathConnected.prod`, and `instance Prod.instPathConnectedSpace : PathConnectedSpace (X × Y)`
- `JoinedIn.pi`, `IsPathConnected.pi`, and `instance Pi.instPathConnectedSpace : PathConnectedSpace (∀ i, Z i)`
These instances were previously missing — `inferInstance` failed for both `PathConnectedSpace (X × Y)` and `PathConnectedSpace ((i : ι) → Z i)`. They were suggested as good first contributions on Zulip.
The analogous `LocPathConnectedSpace` / `LocallyConnectedSpace` product and pi instances (and further `connectedComponent` / `pathComponent` product lemmas) are left for follow-up PRs.
|
t-topology
LLM-generated
new-contributor
|
59/0 |
Mathlib/Topology/Connected/PathConnected.lean |
1 |
3 |
['github-actions', 'korbonits'] |
nobody |
1-35227 1 day ago |
1-34188 1 day ago |
1-33938 1 day |
| 40094 |
mcdoll author:mcdoll |
chore(Analysis/TemperedDistribution): add coercion and fix existing one |
Adds a missing coercion from Schwartz functions to `Lp` functions and changes the
current coercion from `Lp` functions to tempered distributions from `CoeDep` to `CoeHead`.
The second coercion can only appear at the head of a coercion chain, because `𝓢'(E, F)` can't infer the value of `p` or `μ`.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
8/4 |
Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean |
2 |
1 |
['github-actions'] |
nobody |
1-29878 1 day ago |
1-29222 1 day ago |
1-28972 1 day |
| 38534 |
AlexeyMilovanov author: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)
### Main changes
* `PFun` is now a structure with a single field `toFun : α → Part β`.
* Added the `FunLike (α →. β) α (Part β)` instance and `initialize_simps_projections`.
* Added the basic projection/application simp lemmas needed for the structure wrapper.
* Definitions which used to return raw lambdas as partial functions now explicitly use `PFun.mk` or `PFun.lift`.
* Equality proofs for partial functions now use `PFun.ext` / `DFunLike.ext` where `funext` no longer applies directly.
### Downstream impact
The refactor mainly impacts Computability Theory and Category Theory (`Category/PartialFun.lean`). Since `PFun` is no longer definitionally equal to `α → Part β`, tactics such as `rfl`, `simp`, and `funext` can no longer always see through the old raw-function representation.
As a result, several proofs (e.g. `fix_aux`, `ppred`, `mem_eval`, and `unitIso`) grew in size, requiring explicit `ext` + `simp` breakdowns. I tried to keep these proof changes minimal; further golfing suggestions are very welcome. It seems that fully recovering the old brevity in some places may require additional `PFun`-specific API/congruence support, which I avoided adding in this PR to keep the diff minimal.
### Affected files
* **Core:** `Mathlib/Data/PFun.lean`
* **Computability:** `Partrec`, `PartrecBasis`, `PartrecCode`, `RE`, `RecursiveIn`, `Ackermann`, `Halting`, `StateTransition`, `TuringDegree`, `TuringMachine/Config`
* **Category Theory:** `Category/PartialFun.lean`
* **Other:** `Data/Finset/PImage.lean`, `NumberTheory/Dioph.lean`
This also removes the previous `set_option linter.flexible false` workaround and the local transparency workaround in `TuringMachine/Config.lean`, as well as the local transparency workarounds in `Category/PartialFun.lean`.
### Note on LLM usage
The core `PFun` change caused numerous downstream errors. I initially used an LLM to help draft fixes for these files. Afterwards, I spent a significant amount of time manually correcting and modifying all of the generated changes.
|
new-contributor
t-computability
|
611/528 |
Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/Ackermann.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 |
13 |
9 |
['AlexeyMilovanov', 'dagurtomas', 'github-actions', 'j-loreaux', 'mathlib-bors', 'mathlib-merge-conflicts'] |
nobody |
1-28277 1 day ago |
1-27568 1 day ago |
15-69728 15 days |
| 38875 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Covering/Besicovitch` |
- shortens the proof of `r_t0` in `exists_closedBall_covering_tsum_measure_le` by turning the contradiction argument into a direct lambda
- replaces the manual `simp only` proof with `mem_iUnion₂` and a final `simp [r, this]`
Extracted from #38104
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
t-measure-probability
|
3/8 |
Mathlib/MeasureTheory/Covering/Besicovitch.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
kex-y assignee:kex-y |
1-27075 1 day ago |
30-5519 30 days ago |
30-5269 30 days |
| 38883 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Function/AEMeasurableSequence` |
- rewrites `iSup` by filtering directly along `aeSeq_eq_fun_ae hf hp`, instead of proving a subset statement about `aeSeqSet` and then using `measure_mono_null`
Extracted from #38104
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
t-measure-probability
|
2/6 |
Mathlib/MeasureTheory/Function/AEMeasurableSequence.lean |
1 |
2 |
['github-actions', 'yuanyi-350'] |
RemyDegenne assignee:RemyDegenne |
1-27043 1 day ago |
30-2765 30 days ago |
30-2515 30 days |
| 38873 |
yuanyi-350 author:yuanyi-350 |
refactor(MeasureTheory): golf `Mathlib/MeasureTheory/Constructions/BorelSpace/Real` |
- rewrites `measurable_const_mul` by splitting off the `c = 0` case and proving the nonzero case via `measurable_of_continuousOn_compl_singleton`
- replaces the ad hoc case analysis on `⊥`, `⊤`, and real coefficients with a direct continuity argument for multiplication on `EReal`
Extracted from #38104
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
t-measure-probability
|
5/19 |
Mathlib/MeasureTheory/Constructions/BorelSpace/Real.lean |
1 |
4 |
['LorenzoLuccioli', 'RemyDegenne', 'github-actions', 'yuanyi-350'] |
RemyDegenne assignee:RemyDegenne |
1-26902 1 day ago |
26-51914 26 days ago |
29-62005 29 days |
| 38938 |
lua-vr author:lua-vr |
chore(ConditionallyCompleteLattice/Indexed): dualize |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
94/260 |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
3 |
14 |
['JovanGerb', 'github-actions', 'lua-vr', 'mathlib-bors', 'mathlib-merge-conflicts'] |
nobody |
1-25782 1 day ago |
2-8255 2 days ago |
2-8005 2 days |
| 39913 |
mkaratarakis author:mkaratarakis |
feat(Combinatorics/Quiver): periodicity and aperiodicity |
cycle lengths, index of imprimitivity, and cyclic partitions for strongly connected quivers.
Part of the Perron–Frobenius formalization (with @or4nge19).
---
[](https://gitpod.io/from-referrer/)
cc @or4nge19 for review |
t-combinatorics |
194/0 |
Mathlib.lean,Mathlib/Combinatorics/Quiver/Cyclic.lean |
2 |
2 |
['github-actions', 'or4nge19'] |
nobody |
1-23526 1 day ago |
4-1901 4 days ago |
6-5567 6 days |
| 40098 |
grunweg author:grunweg |
chore: use differential geometry elaborators more |
Extracted from #40047: all these changes are already possible today.
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry
easy
|
10/10 |
Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean,Mathlib/Geometry/Manifold/VectorBundle/Riemannian.lean,Mathlib/Geometry/Manifold/VectorBundle/Tangent.lean |
5 |
1 |
['github-actions'] |
nobody |
1-23031 1 day ago |
1-22270 1 day ago |
1-22020 1 day |
| 39311 |
felixpernegger author:felixpernegger |
refactor: redefine `eLpNorm` at `p = 0` |
For Zulip discussion see https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/eLpNorm.20junk.20value/with/576356442. In partuclar this change is suggestion 2 in [#mathlib4 > eLpNorm junk value @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/eLpNorm.20junk.20value/near/576340531)
This redefined [MeasureTheory.eLpNorm](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Function/LpSeminorm/Defs.html#MeasureTheory.eLpNorm) at `p = 0`. Previously it was always `0` but now it is the measure of the support of the function (technical detail: In order to avoid having to add additional arguments to `eLpNorm`, we define it as the measure of the support of the norm of the function, but this is almost always the same)
The motivation for this comes from the counting measure, in particular this then unifies with https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Normed/Lp/lpSpace.html#Mem%E2%84%93p. In any case, it is "closer" to the actual mathematical definition
Unfortunately, since `eLpNorm` is widely used, the diff is very large and a lot of theorems break (i.e. now require `p != 0`). Oftentimes `p != 0` is still not required (sometimes with nontrivial arguments), I tried to avoid adding extra hypothesis whenever I could but I almost certainly missed some.
There now may also be places where we dont need `p != 0` as a hypothesis anymore (i.e. for `[Memℓp](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Normed/Lp/lpSpace.html#Mem%E2%84%93p)`), but this is not included in this PR.
---
[](https://gitpod.io/from-referrer/)
|
|
934/600 |
Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean,Mathlib/Analysis/Distribution/TemperateGrowth.lean,Mathlib/Analysis/Distribution/TemperedDistribution.lean,Mathlib/Analysis/Distribution/TestFunction.lean,Mathlib/Analysis/Fourier/LpSpace.lean,Mathlib/Analysis/FunctionalSpaces/SobolevInequality.lean,Mathlib/Analysis/Normed/Lp/SmoothApprox.lean,Mathlib/Data/ENNReal/Holder.lean,Mathlib/MeasureTheory/Function/ContinuousMapDense.lean,Mathlib/MeasureTheory/Function/ConvergenceInMeasure.lean,Mathlib/MeasureTheory/Function/Holder.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/L2Space.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Basic.lean,Mathlib/MeasureTheory/Function/LpSeminorm/CompareExp.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Defs.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Indicator.lean,Mathlib/MeasureTheory/Function/LpSeminorm/LpNorm.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Monotonicity.lean,Mathlib/MeasureTheory/Function/LpSeminorm/SMul.lean,Mathlib/MeasureTheory/Function/LpSeminorm/TriangleInequality.lean,Mathlib/MeasureTheory/Function/LpSeminorm/Trim.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Complete.lean,Mathlib/MeasureTheory/Function/LpSpace/CompleteOfCompleteLp.lean,Mathlib/MeasureTheory/Function/LpSpace/ContinuousFunctions.lean,Mathlib/MeasureTheory/Function/LpSpace/Indicator.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/MeasureTheory/Function/UniformIntegrable.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/Distributions/Gaussian/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Fernique.lean,Mathlib/Probability/Distributions/Gaussian/HasGaussianLaw/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean,Mathlib/Probability/IdentDistrib.lean,Mathlib/Probability/Kernel/Disintegration/CDFToKernel.lean,Mathlib/Probability/Kernel/Disintegration/Density.lean,Mathlib/Probability/Martingale/Convergence.lean,Mathlib/Probability/Moments/CovarianceBilinDual.lean,Mathlib/Probability/Moments/IntegrableExpMul.lean,Mathlib/Probability/Moments/SubGaussian.lean,Mathlib/Probability/Process/Filtration.lean,MathlibTest/congr.lean |
46 |
27 |
['felixpernegger', 'github-actions', 'mathlib-merge-conflicts', 'sgouezel'] |
nobody |
1-20430 1 day ago |
1-19396 1 day ago |
2-70140 2 days |
| 34278 |
gasparattila author:gasparattila |
feat(Topology/Sets): connectedness of `NonemptyCompacts` |
---
- [x] depends on: #34268
- [x] depends on: #34273
[](https://gitpod.io/from-referrer/)
|
t-topology |
108/0 |
Mathlib/Topology/Sets/VietorisTopology.lean |
1 |
6 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
nobody |
1-19763 1 day ago |
1-19153 1 day ago |
1-19160 1 day |
| 40109 |
gasparattila author:gasparattila |
feat(Topology/Sets): separability of `(Nonempty)Compacts` |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
31/71 |
Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sets/VietorisTopology.lean |
2 |
1 |
['github-actions'] |
nobody |
1-18291 1 day ago |
1-17585 1 day ago |
1-17335 1 day |
| 40050 |
ReemMelamed author:ReemMelamed |
feat(Algebra/Group/GreensRelations): add definitions for Green's relations |
This PR introduces the foundational definitions for Green's relations (L, R, H, D, and J) on semigroups.
This is the first in a series of PRs aimed at formalizing Green's relations for semigroups.
---
Zulip discussion: [Formalization of Green's Relations for semigroups](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Formalization.20of.20Green.27s.20Relations.20for.20semigroups/with/598557876) |
t-algebra
new-contributor
label:t-algebra$ |
348/0 |
Mathlib.lean,Mathlib/Algebra/Group/GreensRelations/Basic.lean,Mathlib/Algebra/Group/GreensRelations/Defs.lean |
3 |
11 |
['YaelDillies', 'YanYablonovskiy', 'github-actions', 'mathlib-bors'] |
nobody |
1-18189 1 day ago |
1-17174 1 day ago |
2-71525 2 days |
| 38848 |
jcreinhold author:jcreinhold |
feat(AlgebraicTopology/SimplicialSet): exists_isPushout_of_ne_top |
Every proper subcomplex of a simplicial set extends by attaching a single cell along its boundary, exhibited as a pushout of `∂Δ[n] ↪ Δ[n]`. This is the per-cell input for cell-by-cell filtrations of monomorphisms in `SSet`.
Adapted from @joelriou 's [proof](https://github.com/joelriou/topcat-model-category/blob/813338a8c88cfe0096deed7e3ba7daf92d4a1c71/TopCatModelCategory/SSet/Boundary.lean#L187). I also added the supporting lemma `Types.isPullback_of_eq_setPreimage` (set-preimage square is a pullback in `Type u`).
AI use: Claude helped locate `subtype_val_mono` and the `backward.isDefEq.respectTransparency` option.
|
t-algebraic-topology
new-contributor
|
119/3 |
Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/CategoryTheory/Limits/Types/Pullbacks.lean |
2 |
26 |
['github-actions', 'jcreinhold', 'joelriou', 'mckoen'] |
nobody |
1-10550 1 day ago |
1-9370 1 day ago |
29-25996 29 days |
| 38318 |
JovanGerb author:JovanGerb |
feat(GRewrite): new `grw` implementation |
This PR adds a new implementation of the `grewrite` tactic. It replaces `grw` with the new implementation. The old implementation can be used with `grw +useKAbstract`.
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
- [x] depends on: #38556
[](https://gitpod.io/from-referrer/)
|
t-meta |
690/255 |
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/CStarAlgebra/Extreme.lean,Mathlib/Analysis/Convex/StrictCombination.lean,Mathlib/Analysis/Distribution/Support.lean,Mathlib/Combinatorics/Graph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Data/DFinsupp/BigOperators.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/GRewrite/Core.lean,Mathlib/Tactic/GRewrite/Elab.lean,Mathlib/Topology/MetricSpace/ThickenedIndicator.lean,MathlibTest/Tactic/GCongr/Implications.lean,MathlibTest/Tactic/GRewrite.lean |
22 |
43 |
['JovanGerb', 'PatrickMassot', 'Vierkantor', 'github-actions', 'leanprover-radar', 'mathlib-bors', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
dwrensha assignee:dwrensha |
1-9622 1 day ago |
1-6069 1 day ago |
22-26102 22 days |
| 39868 |
JuanCoRo author:JuanCoRo |
feat(Algebra/Polynomial): linearity of `divByMonic` and adjacent results |
---
This PR adds the `R`-linearity of the monic polynomial division map `_ /ₘ q`. It also adds adjacent results that stem from this work.
#### Refactors:
- Reuses the proofs from `add_modByMonic` and `smul_modByMonic` to generalize these results to `add_div_modByMonic` and `smul_div_modByMonic` respectively.
- Replaces the proofs of `add_modByMonic` and `smul_modByMonic` as specializations of the more general theorems `add_div_modByMonic` and `smul_div_modByMonic` respectively.
#### Additions:
- Adds the necessary results for `_ /ₘ q` linearity:
- `add_divByMonic : (p₁ + p₂) /ₘ q = p₁ /ₘ q + p₂ /ₘ q`
- `smul_divByMonic : c • p /ₘ q = c • (p /ₘ q)`
- Adds `_ /ₘ q` as an `R`-linear map:
- `divByMonicHom`: definition of `_ /ₘ q` as a linear map
- `mem_ker_divByMonic`: kernel characterization for `_ /ₘ q`.
- In `Div.lean` adds dual results for `/ₘ` that were already present for `%ₘ`
- `neg_divByMonic : (-p) /ₘ q = -(p /ₘ q)`
- `sub_divByMonic : (p₁ - p₂) /ₘ q = p₁ /ₘ q - p₂ /ₘ q`
- `mul_divByMonic_assoc (hd : q ∣ p₂) : (p₁ * p₂) /ₘ q = p₁ * (p₂ /ₘ q)`
While `mul_divByMonic_assoc` is not exactly the dual of `mul_modByMonic`, I thought it wouldn't hurt to add it.
[](https://gitpod.io/from-referrer/) |
new-contributor
t-algebra
label:t-algebra$ |
54/17 |
Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/RingDivision.lean |
2 |
6 |
['JuanCoRo', 'github-actions', 'wwylele'] |
nobody |
1-9536 1 day ago |
1-9705 1 day ago |
4-9939 4 days |
| 37501 |
xgenereux author:xgenereux |
feat(DedekindDomain/AdicValuation): `intValuation` on uniformizers is `exp (-1)` |
This PR adds the lemma `intValuation_uniformizer` 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.
AI disclaimer : I used Claude to give me some feedback on the PR.
Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)>
---
- [x] depends on: #37497
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
218/175 |
Mathlib.lean,Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean,Mathlib/NumberTheory/NumberField/Completion/FinitePlace.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.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 |
9 |
7 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
1-6996 1 day ago |
1-5931 1 day ago |
50-55622 50 days |
| 39892 |
SnirBroshi author:SnirBroshi |
feat(GroupTheory/Commutator/Basic): more commutator identities |
From [Wikipedia](https://en.wikipedia.org/wiki/Commutator#Identities_(group_theory))
---
The last two aren't on Wikipedia but they're similar to Hall-Witt.
[](https://gitpod.io/from-referrer/)
|
t-group-theory
maintainer-merge
|
44/0 |
Mathlib/GroupTheory/Commutator/Basic.lean |
1 |
6 |
['SnirBroshi', 'github-actions', 'tb65536'] |
tb65536 assignee:tb65536 |
1-3223 1 day ago |
5-45153 5 days ago |
6-47370 6 days |
| 38431 |
joelriou author:joelriou |
refactor(Topology): redefine Delta-generated spaces |
Delta-generated spaces are made particular cases of `X`-generated spaces, where `X` is the family of spaces `Fin n → ℝ`.
---
- [x] depends on: #38080
- [x] depends on: #37799
[](https://gitpod.io/from-referrer/)
|
t-topology
large-import
|
144/211 |
Mathlib/Topology/Category/DeltaGenerated.lean,Mathlib/Topology/Compactness/DeltaGeneratedSpace.lean,Mathlib/Topology/Convenient/Category.lean,Mathlib/Topology/Convenient/GeneratedBy.lean |
4 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
PatrickMassot assignee:PatrickMassot |
1-1952 1 day ago |
1-1249 1 day ago |
25-4023 25 days |
| 33143 |
wwylele author: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
large-import
label:t-algebra$ |
361/6 |
Mathlib.lean,Mathlib/Combinatorics/Enumerative/Pentagonal.lean,Mathlib/RingTheory/PowerSeries/Pentagonal.lean,Mathlib/Topology/Algebra/InfiniteSum/Pentagonal.lean,docs/1000.yaml |
5 |
61 |
['copilot-pull-request-reviewer', 'github-actions', 'jcommelin', 'mathlib-dependent-issues', 'tb65536', 'urkud', 'vihdzp', 'wwylele'] |
mattrobball assignee:mattrobball |
1-858 1 day ago |
3-75884 3 days ago |
133-6746 133 days |
| 39495 |
hawkrobe author:hawkrobe |
feat(Data/Multiset/Antidiagonal): two structural lemmas |
Adds `map_swap_antidiagonal` and `antidiagonal_add`.
---
Fills out the API parallel to `Multiset.Nat.map_swap_antidiagonal` and `Finset.map_swap_antidiagonal`. (And adds `@[congr]` to `bind_congr`.)
Used for shuffle-coproduct constructions.
(#7486, I found this old [Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/antidiagonals.20having.20multiplicity.20.237595/near/238573473))
I used Claude Code to audit and polish. |
t-data
new-contributor
LLM-generated
|
20/0 |
Mathlib/Data/Multiset/Antidiagonal.lean,Mathlib/Data/Multiset/Bind.lean |
2 |
6 |
['github-actions', 'hawkrobe', 'j-loreaux'] |
nobody |
0-84205 23 hours ago |
5-48805 5 days ago |
15-67185 15 days |
| 39404 |
metakunt author:metakunt |
feat(NumberTheory/AKSPrimality): Introspective definition |
This defines the introspective relation and proves the key property for the AKS theorem.
From #34507 |
t-number-theory |
127/0 |
Mathlib.lean,Mathlib/NumberTheory/AKSPrimality/Introspective.lean |
2 |
4 |
['github-actions', 'metakunt', 'tb65536'] |
tb65536 assignee:tb65536 |
0-81679 22 hours ago |
2-76101 2 days ago |
3-74199 3 days |
| 39966 |
chrisflav author:chrisflav |
chore(Algebra/Exact): relate surjectivity / injectivity and exactness |
This came up while reviewing #39520, but ended up unnecessary.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
8/0 |
Mathlib/Algebra/Exact/Basic.lean |
1 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
0-78353 21 hours ago |
0-76739 21 hours ago |
2-43099 2 days |
| 35136 |
joelriou author: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
- [x] depends on: #33958
[](https://gitpod.io/from-referrer/)
|
t-algebraic-geometry
large-import
|
303/7 |
Mathlib.lean,Mathlib/AlgebraicGeometry/Fiber.lean,Mathlib/AlgebraicGeometry/Morphisms/Etale.lean,Mathlib/AlgebraicGeometry/Sites/Etale.lean,Mathlib/AlgebraicGeometry/Sites/EtalePoint.lean,Mathlib/CategoryTheory/Elements.lean,Mathlib/CategoryTheory/EssentialImage.lean,Mathlib/CategoryTheory/Limits/FinallySmall.lean,Mathlib/CategoryTheory/Limits/MorphismProperty.lean,Mathlib/CategoryTheory/MorphismProperty/Comma.lean,Mathlib/CategoryTheory/ObjectProperty/Small.lean |
11 |
6 |
['github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-75114 20 hours ago |
0-74352 20 hours ago |
10-8107 10 days |
| 39714 |
tb65536 author:tb65536 |
feat(RingTheory/Localization/AtPrime/Basic): add variants of `localAlgHom` and `localAlgEquiv` |
This PR adds variants of `localAlgHom` and `localAlgEquiv` where the base ring is also localized.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
t-algebra
label:t-algebra$ |
39/7 |
Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/Basic.lean |
2 |
2 |
['github-actions', 'tb65536'] |
nobody |
0-70644 19 hours ago |
0-68942 19 hours ago |
10-77473 10 days |
| 36954 |
FMLJohn author: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'] |
urkud assignee:urkud |
0-67722 18 hours ago |
0-65840 18 hours ago |
68-53304 68 days |
| 37279 |
imalinowskip author:imalinowskip |
feat(Probability): multivariate CLT (and Cramèr-Wold) |
---
- [x] depends on: #36208
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
large-import
|
499/1 |
Mathlib.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/CramerWold.lean |
3 |
13 |
['EtienneC30', 'RemyDegenne', 'github-actions', 'imalinowskip', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
RemyDegenne assignee:RemyDegenne |
0-66129 18 hours ago |
0-66129 18 hours ago |
6-43999 6 days |
| 39977 |
tb65536 author:tb65536 |
feat(RingTheory/RamificationInertia/Ramification): positivity of ramification index |
This PR proves positivity of the new definition of ramification index.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
t-algebra
label:t-algebra$ |
27/1 |
Mathlib/RingTheory/RamificationInertia/Ramification.lean |
1 |
1 |
['github-actions'] |
nobody |
0-65479 18 hours ago |
5-159 4 days ago |
4-86309 4 days |
| 36018 |
wwylele author:wwylele |
feat(LinearAlgebra/AffineSpace): parallel cross-section of a simplex |
This shows that the intersection of `AffineSubspace.shift` of the base of a simplex and the interior of the simplex is a smaller simplex. This is preparing to calculate the volume of a simplex by integrating this cross-section. Part of #37910.
---
- [ ] depends on: #38220
[](https://gitpod.io/from-referrer/)
|
t-algebra
large-import
label:t-algebra$ |
155/1 |
Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Shift.lean,Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean |
2 |
12 |
['alreadydone', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-bors', 'mathlib-dependent-issues', 'wwylele'] |
dagurtomas assignee:dagurtomas |
0-65174 18 hours ago |
0-64427 17 hours ago |
43-36359 43 days |
| 40123 |
tb65536 author:tb65536 |
chore(FieldTheory/Galois/IsGaloisGroup): remove `FaithfulSMul` from `IsGaloisGroup.finite` |
This PR removes the `FaithfulSMul` assumption from `IsGaloisGroup.finite`
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
t-algebra
label:t-algebra$ |
13/3 |
Mathlib/FieldTheory/Galois/IsGaloisGroup.lean |
1 |
1 |
['github-actions'] |
nobody |
0-65024 18 hours ago |
0-64252 17 hours ago |
0-75865 21 hours |
| 39189 |
tb65536 author:tb65536 |
feat(RingTheory/RamificationInertia/Basic): ramification-inertia formula for finite flat extensions |
This PR proves the ramification-inertia formula for finite flat extensions.
---
- [x] depends on: #38825
- [x] depends on: #39094
- [x] depends on: #39196
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
t-algebra
label:t-algebra$ |
109/0 |
Mathlib.lean,Mathlib/FieldTheory/Galois/IsGaloisGroup.lean,Mathlib/RingTheory/LocalRing/ResidueField/Fiber.lean,Mathlib/RingTheory/RamificationInertia/Basic.lean |
4 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
0-64922 18 hours ago |
0-64178 17 hours ago |
4-70821 4 days |
| 37682 |
SabrinaJewson author: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 |
12 |
['SabrinaJewson', 'astrainfinita', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
Komyyy assignee:Komyyy |
0-63516 17 hours ago |
0-73235 20 hours ago |
52-71400 52 days |
| 39136 |
vihdzp author:vihdzp |
feat: more results on `Order.enum` |
Most importantly, we prove that the enumerator function of a cofinal set is normal iff the set is closed (under non-empty suprema).
---
- [x] depends on: #38362
- [x] depends on: #39137
[](https://gitpod.io/from-referrer/)
|
t-set-theory
t-order
maintainer-merge
|
90/7 |
Mathlib/Order/Cofinal.lean,Mathlib/SetTheory/Cardinal/Cofinality/Club.lean,Mathlib/SetTheory/Cardinal/Cofinality/Enum.lean,Mathlib/SetTheory/Ordinal/Topology.lean |
4 |
7 |
['YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
nobody |
0-62631 17 hours ago |
3-35746 3 days ago |
5-24057 5 days |
| 39905 |
plp127 author:plp127 |
chore(Order/CompleteBooleanAlgebra): dualize `symmDiff` theorems |
Dualize some `symmDiff` theorems, and also generalize them from `CompleteBooleanAlgebra` to `Order.Coframe`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
76/39 |
Mathlib/Order/CompleteBooleanAlgebra.lean |
1 |
3 |
['github-actions', 'plp127', 'vihdzp'] |
nobody |
0-61829 17 hours ago |
6-45472 6 days ago |
6-45222 6 days |
| 39574 |
FordUniver author:FordUniver |
feat(Analysis/Calculus/LipschitzSmooth): add `LipschitzSmoothWith` and `CocoerciveWith` |
Introduces `LipschitzSmoothWith K f` on a normed real vector space and `CocoerciveWith K f` on a Hilbert space. `LipschitzSmoothWith` is opaque with characterisations in four derivative-flavoured forms (directional, Fréchet, 1D, gradient) under appropriate differentiability hypotheses, plus descent-inequality extractors and variance bounds; `CocoerciveWith` is an `abbrev` with the elementary direction `K`-cocoercive ⟹ `K`-Lipschitz gradient.
Co-authored-by: Sebastian Pokutta <23001135+pokutta@users.noreply.github.com>
---
The `lineDeriv` form is the internal canonical form because it does not presuppose Fréchet differentiability; the `@[expose]` annotation is deliberately omitted so that downstream code reaches the predicate through the named iff/extractor API rather than direct destruction, treating the choice as an implementation detail. The `K / 2` convention is chosen so that the descent lemma is constant-preserving: a function with `K`-Lipschitz Fréchet derivative is exactly `K`-smooth in this sense.
This PR is intentionally minimal and contains only the definition and some basic `rw` and `apply` lemmas. I have some follow up PRs planned (not fully polished yet) that establish the usual implications plus pre-requisites:
1. **Descent lemma.** Derives `LipschitzSmoothWith K f` from `LipschitzWith K (fderiv ℝ f)` (and its 1D / gradient variants) under `Differentiable ℝ f`, via segment-level FTC. [diff](https://github.com/FordUniver/mathlib4/compare/diffbase/lipschitzSmooth-descent...feat/lipschitzSmooth-descent)
2. **First-order convex inequalities.** Adds `ConvexOn.add_{lineDeriv,fderiv,gradient,deriv}_le` (and strict variants + concave duals) — the tangent-line-lower-bound characterisations of `ConvexOn`. [diff](https://github.com/FordUniver/mathlib4/compare/diffbase/convex-first-order-inequalities...feat/convex-first-order-inequalities)
3. **Baillon-Haddad theorem and convex equivalences.** Under `ConvexOn ℝ Set.univ f` + `Differentiable ℝ f`, `LipschitzSmoothWith K f → CocoerciveWith K f`, closing the four-way equivalence with `LipschitzWith K (fderiv ℝ f)` and `LipschitzWith K (∇ f)`. [diff](https://github.com/FordUniver/mathlib4/compare/diffbase/lipschitzSmooth-convex...feat/lipschitzSmooth-convex)
4. **Continuity and the `K = 0` boundary case.** A continuity statement `LipschitzSmoothWith K f → Continuous f` (non-trivial in the general non-differentiable case), and the characterisation `LipschitzSmoothWith 0 f ↔ ConcaveOn ℝ Set.univ f` under differentiability.
5. **Algebraic preservation lemmas.** `LipschitzSmoothWith` closed under `+` (with `K₁ + K₂`), `c •` for `c ≥ 0` (with `c · K`), composition with affine maps (with `‖A.linear‖² · K`). [diff](https://github.com/FordUniver/mathlib4/compare/feat/lipschitzSmooth-basic...feat/lipschitzSmooth-algebra)
Beyond those, larger-picture generalisations remain open: a set-restricted version `LipschitzSmoothOnWith K f s` (with `s` a convex subset, parallel to the standard pattern for `ConvexOn`, `LipschitzOn`, etc.), and possibly broadening the base field / target away from `ℝ` (e.g. complex Hilbert spaces; vector-valued targets would require a different right-hand side and likely a separate predicate).
The only unmerged upstream dependency is #39203, needed for the gradient-form characterisations. The base definition and the directional / Fréchet / 1D characterisations are independent of any unmerged work.
- [x] depends on: #39203
- [x] depends on: #14502
Diff for the changes *just* in this PR over its predecessor: [link](https://github.com/FordUniver/mathlib4/compare/refactor/gradient-ungate-inner-lemmas...feat/lipschitzSmooth-basic) |
t-analysis |
344/10 |
Mathlib.lean,Mathlib/Analysis/Calculus/Gradient/Basic.lean,Mathlib/Analysis/Calculus/LipschitzSmooth/Basic.lean,Mathlib/Analysis/Calculus/LipschitzSmooth/Deriv.lean,Mathlib/Analysis/Calculus/LipschitzSmooth/FDeriv.lean,Mathlib/Analysis/Calculus/LipschitzSmooth/Gradient.lean |
6 |
4 |
['FordUniver', 'Komyyy', 'github-actions', 'mathlib-dependent-issues'] |
nobody |
0-59489 16 hours ago |
0-60793 16 hours ago |
0-65081 18 hours |
| 40130 |
tb65536 author:tb65536 |
chore(Algebra/Group/Subgroup/Ker): generalize `ker_mulEquiv_comp` to injective homomorphisms |
This PR generalizes `ker_mulEquiv_comp` to injective homomorphisms.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-group-theory
label:t-algebra$ |
32/24 |
Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/GroupTheory/FinitelyPresentedGroup.lean,Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/GroupTheory/Index.lean,Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/Solvable.lean |
6 |
1 |
['github-actions'] |
nobody |
0-58169 16 hours ago |
0-58169 16 hours ago |
0-57919 16 hours |
| 40132 |
chrisflav author:chrisflav |
chore(CategoryTheory): dualise preservation of multicoequalizers |
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
75/15 |
Mathlib/CategoryTheory/Limits/Preserves/Shapes/Multiequalizer.lean,Mathlib/CategoryTheory/Limits/Shapes/Multiequalizer.lean,Mathlib/CategoryTheory/Sites/DenseSubsite/OneHypercoverDense.lean,Mathlib/CategoryTheory/Sites/Whiskering.lean |
4 |
2 |
['chrisflav', 'github-actions'] |
nobody |
0-56084 15 hours ago |
0-55336 15 hours ago |
0-55086 15 hours |
| 40025 |
artie2000 author:artie2000 |
chore(Data/SetLike/Basic): generalise instance |
* Generalise the standard `IsConcreteLE` instance from `PartialOrder.ofSetLike` to `LE.ofSetLike`
---
[](https://gitpod.io/from-referrer/)
|
t-data |
8/4 |
Mathlib/Data/SetLike/Basic.lean |
1 |
4 |
['github-actions', 'leanprover-radar', 'vihdzp'] |
nobody |
0-55452 15 hours ago |
3-74176 3 days ago |
3-73926 3 days |
| 36701 |
kim-em author: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
t-meta
|
344/37 |
Mathlib/Lean/MessageData/Trace.lean,Mathlib/Tactic/DefEqAbuse.lean,Mathlib/Tactic/FastInstance.lean,MathlibTest/CheckInstance.lean,MathlibTest/DefEqAbuse.lean |
5 |
58 |
['JovanGerb', 'Vierkantor', 'eric-wieser', 'github-actions', 'kim-em', 'mathlib-merge-conflicts', 'ocfnash'] |
Vierkantor assignee:Vierkantor |
0-51694 14 hours ago |
0-51694 14 hours ago |
7-6411 7 days |
| 37848 |
rwst author:rwst |
feat(RingTheory/PowerSeries/Log): log and exp as inverses |
This adds the lemmas `exp_subst_log` and `log_subst_exp_sub_one`, together with two helpers needed for the proofs.
Note: I'm using Claude + Opus for supervised formalization tasks. Claude has no permission to use git on my machine.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
LLM-generated
|
88/0 |
Mathlib/RingTheory/PowerSeries/Log.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean |
2 |
10 |
['chrisflav', 'github-actions', 'rwst'] |
nobody |
0-50149 13 hours ago |
22-532 22 days ago |
52-68375 52 days |
| 38649 |
chrisflav author: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 |
0-50149 13 hours ago |
35-401 35 days ago |
35-151 35 days |
| 36863 |
artie2000 author: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
label:t-algebra$ |
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 |
14 |
['artie2000', 'chrisflav', 'github-actions', 'mathlib-merge-conflicts'] |
nobody |
0-50147 13 hours ago |
21-61514 21 days ago |
64-13358 64 days |
| 38047 |
mbkybky author: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 |
10/3 |
Mathlib/RingTheory/Finiteness/Ideal.lean |
1 |
1 |
['github-actions'] |
nobody |
0-50146 13 hours ago |
13-4470 13 days ago |
48-29827 48 days |
| 39107 |
SnirBroshi author:SnirBroshi |
feat(Geometry/Manifold/ChartedSpace): `H ≃ₜ M` → `ChartedSpace H M` |
---
I thought it was strange that `Homeomorph`s didn't have this easy dot-notation, though I'm not familiar with this part of the library so I might be missing something.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
6/0 |
Mathlib/Geometry/Manifold/ChartedSpace.lean |
1 |
1 |
['github-actions'] |
nobody |
0-50146 13 hours ago |
24-26577 24 days ago |
24-26327 24 days |
| 36507 |
BryceT233 author: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 |
597/4 |
Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean |
2 |
27 |
['AntoineChambert-Loir', 'BryceT233', 'Thmoas-Guan', 'WenrongZou', 'YaelDillies', 'eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
mattrobball assignee:mattrobball |
0-50108 13 hours ago |
0-49287 13 hours ago |
55-57315 55 days |
| 31892 |
jsm28 author: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.
---
- [x] depends on: #31891
- [x] depends on: #32296
[](https://gitpod.io/from-referrer/)
|
t-euclidean-geometry |
159/0 |
Mathlib.lean,Mathlib/Geometry/Euclidean/Sphere/PolePolar.lean |
2 |
8 |
['Parcly-Taxel', 'github-actions', 'jsm28', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
eric-wieser assignee:eric-wieser |
0-48171 13 hours ago |
66-74091 66 days ago |
66-73841 66 days |
| 38185 |
Jun2M author: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
---
[](https://gitpod.io/from-referrer/)
|
t-order |
89/11 |
Mathlib/Order/Partition/Basic.lean,Mathlib/Order/SupIndep.lean |
2 |
1 |
['github-actions'] |
bryangingechen assignee:bryangingechen |
0-48168 13 hours ago |
45-62041 45 days ago |
45-61791 45 days |
| 38223 |
Deicyde author: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
|
224/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean |
3 |
57 |
['Deicyde', 'chrisflav', 'dagurtomas', 'github-actions', 'idontgetoutmuch', 'peabrainiac'] |
joelriou assignee:joelriou |
0-48167 13 hours ago |
24-68326 24 days ago |
38-25118 38 days |
| 38943 |
felixpernegger author:felixpernegger |
feat(Topology/CWComplex/Classical): discrete spaces are CW complexes |
as well as some useful lemmas
This is partly based on code by @scholzhannah
I think this is notable to include, since it is pretty much the only (easy) "topological" sufficient condition for something being a CW complex there is.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
89/3 |
Mathlib/Topology/CWComplex/Classical/Basic.lean,Mathlib/Topology/DiscreteSubset.lean |
2 |
28 |
['felixpernegger', 'github-actions', 'scholzhannah'] |
urkud assignee:urkud |
0-48165 13 hours ago |
27-19765 27 days ago |
28-28709 28 days |
| 39011 |
Vierkantor author:Vierkantor |
chore(Algebra/Polynomial/Module): workaround for backward.inferInstanceAs |
This PR, like #38990, works around a `backward.inferInstanceAs` compatibility flag introduced by identifying `PolynomialModule` with `Finsupp` in our definitions. We introduce a new dsimp lemma `funLike_eq` that transfers the `FunLike` instances, and now we can use `PolynomialModule`'s `FunLike` instance, instead of the custom `CoeFun` instance.
This is not a great approach, but it seems the least painful for the short term. The alternative would be to strictly enforce the defeq barrier between `PolynomialModule` and `Finsupp`, which would mean a substantial rewrite of this corner of Mathlib. We can't make `PolynomialModule` an `@[implicit_reducible]`, because we need different multiplication on it than `Finsupp` has.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
tech debt
label:t-algebra$ |
8/5 |
Mathlib/Algebra/Polynomial/Module/Basic.lean |
1 |
1 |
['github-actions'] |
joneugster assignee:joneugster |
0-48164 13 hours ago |
26-77273 26 days ago |
26-77023 26 days |
| 39223 |
BryceT233 author:BryceT233 |
feat(RingTheory/Extension): surjectivity and kernel of `Cotangent.map` |
This PR adds `Cotangent.map_surjective_of_comap_eq` and `Cotangent.map_ker_of_surjective`, which are adaptations of the existing lemmas `Ideal.mapCotangent_surjective_of_comap_eq` and `Ideal.mapCotangent_ker_of_surjective` to the cotangent space of extensions. Because `Algebra.Extension.Cotangent` uses a type synonym to define the cotangent space of an extension, the results for `Ideal.mapCotangent` could not be used directly and needed to be restated in terms of `Algebra.Extension.Cotangent.map`.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
32/0 |
Mathlib/RingTheory/Extension/Basic.lean |
1 |
1 |
['github-actions'] |
riccardobrasca assignee:riccardobrasca |
0-48163 13 hours ago |
1-53046 1 day ago |
21-56631 21 days |
| 39744 |
MichaelStollBayreuth author:MichaelStollBayreuth |
feat(NumberTheory/Height/NumberField): Northcott property |
This PR finally adds a proof of the *Northcott property* for heights on number fields:
```lean
theorem NumberField.finite_setOf_mulHeight₁_le (B : ℝ) : {x : K | mulHeight₁ x ≤ B}.Finite
```
---
- [x] depends on: #39127
(The branch was split off the one for the PR this depends on.)
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
225/2 |
Mathlib/NumberTheory/Height/NumberField.lean |
1 |
4 |
['MichaelStollBayreuth', 'github-actions', 'mathlib-dependent-issues', 'tb65536'] |
tb65536 assignee:tb65536 |
0-48160 13 hours ago |
0-76023 21 hours ago |
0-76433 21 hours |
| 39886 |
grunweg author:grunweg |
chore(Geometry/Manifold): remove some `@[expose] public` section |
Go through a few files and audit the exposed definitions there. Best reviewed commit by commit.
---
I'm happy to give more details on any file where desired.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry
tech debt
|
17/20 |
Mathlib/Geometry/Manifold/Bordism.lean,Mathlib/Geometry/Manifold/VectorField/LieBracket.lean,Mathlib/Geometry/Manifold/WhitneyEmbedding.lean |
3 |
1 |
['github-actions'] |
sgouezel assignee:sgouezel |
0-48159 13 hours ago |
6-14017 6 days ago |
6-65014 6 days |
| 39982 |
riccardobrasca author:riccardobrasca |
feat: add Ideal.IsPrincipal.of_isPrincipal_pow_of_coprime |
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
31/0 |
Mathlib/RingTheory/ClassGroup.lean |
1 |
1 |
['github-actions'] |
mariainesdff assignee:mariainesdff |
0-48158 13 hours ago |
4-73260 4 days ago |
4-73010 4 days |
| 40023 |
chenson2018 author:chenson2018 |
chore(AlgebraicTopology): refactor proofs where `grind?` fails |
These are sources of technical debt as now reported in the [weekly linting report](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Weekly.20linting.20log/with/544658968). The idea is that a successful grind proof can fail to report the theorems it used via grind?, which means that if these proofs break across toolchains that it becomes significantly harder to repair.
---
[](https://gitpod.io/from-referrer/)
|
t-algebraic-topology |
11/5 |
Mathlib/AlgebraicTopology/SimplexCategory/DeltaZeroIter.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/NormalForms.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplices.lean,Mathlib/AlgebraicTopology/SimplicialSet/NonDegenerateSimplicesSubcomplex.lean |
4 |
1 |
['github-actions'] |
joelriou assignee:joelriou |
0-48157 13 hours ago |
3-78981 3 days ago |
3-78731 3 days |
| 40078 |
mathlib-splicebot author:mathlib-splicebot |
feat: alias for extensionality of measures through singleton with Measure.real |
Add an alias for the backward direction of [MeasureTheory.ext_iff_measureReal_singleton](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Measure/Dirac.html#MeasureTheory.ext_iff_measureReal_singleton): if two sigma-finite measures coincide on every singleton with `Measure.real` on a countable space, then they are equal. |
t-measure-probability |
2/0 |
Mathlib/MeasureTheory/Measure/Dirac.lean |
1 |
1 |
['github-actions'] |
kex-y assignee:kex-y |
0-48155 13 hours ago |
2-8951 2 days ago |
2-8701 2 days |
| 40088 |
jeangud author:jeangud |
fix(Tactic/Linter/DocString): avoid false positive in syntax quotation patterns |
# Description
Syntax quotations are a key meta-programming feature for Lean 4, but the `linter.style.docString.empty` linter currently does not handle them correctly.
This PR:
- Closes #40087
- Adds a regression test for syntax quotation patterns
- :robot: Implemented and test with **Gemini 3.1 Pro**. This change is pretty targeted so I did not have much to redo except reviewing.
**Example false positive:**
In the [formal-conjectures](https://github.com/google-deepmind/formal-conjectures) repository, the `AMSLinter`:
```lean
/-- Checks if a command has the `AMS` attribute. -/
def toAMS (stx : TSyntax ``Command.declModifiers) :
CommandElabM (Array <| TSyntaxArray `num) := do
match stx with
| `(declModifiers| $(_)? @[$[$atts],*] $(_)? $(_)? $(_)? $(_)?) =>
atts.filterMapM fun att ↦ do
match att with
| `(attrInstance | AMS $nums*) => return some nums
| _ => return none
| _ => return #[]
```
**Proposed Fix:** We can fix this by explicitly checking the kind of the docstring node before processing it. Pattern nodes from syntax quotations use antiquotations for the docstring slot (like `$(_)?`), which have a different syntax kind than actual doc comments. Filtering by `docStx.getKind == ``Parser.Command.docComment` successfully filters out the false positives while keeping the linter working for actual source code:
```lean
if docStx.isMissing then continue -- this is probably superfluous, thanks to `some pos` above.
if docStx.getKind != ``Parser.Command.docComment then continue -- ignore antiquotations from syntax patterns like `$(_)?`
```
# Testing
:white_check_mark: Builds successfully
```shell
$ lake build Mathlib.Tactic.Linter.DocString
Build completed successfully (4 jobs).
```
:white_check_mark: Tests pass
```shell
$ lake build MathlibTest.Linter.DocString
Build completed successfully (6 jobs).
```
**Before :x:**
```shell
$ lake build ./FormalConjectures/Util/Linters/AMSLinter.lean
⚠ [68/68] Built FormalConjectures.Util.Linters.AMSLinter
warning: FormalConjectures/Util/Linters/AMSLinter.lean:48:21: warning: this doc-string is empty
Note: This linter can be disabled with `set_option linter.style.docString.empty false`
warning: FormalConjectures/Util/Linters/AMSLinter.lean:69:27: warning: this doc-string is empty
Note: This linter can be disabled with `set_option linter.style.docString.empty false`
Build completed successfully (68 jobs).
```
**After :white_check_mark:**
```shell
$ lake build ./FormalConjectures/Util/Linters/AMSLinter.lean
Build completed successfully (25 jobs).
```
|
t-linter
new-contributor
|
24/1 |
Mathlib/Tactic/Linter/DocString.lean,MathlibTest/Linter/DocString.lean |
2 |
2 |
['github-actions'] |
JovanGerb assignee:JovanGerb |
0-48154 13 hours ago |
1-46898 1 day ago |
1-46648 1 day |
| 40125 |
thorimur author:thorimur |
chore: remove underscores in some instance names |
This PR removes some underscores in (internal) user-named instances.
As far as I can tell, these are not used anywhere, and are only named for readability, which is maintained.
---
[](https://gitpod.io/from-referrer/)
|
easy
t-meta
|
22/14 |
Mathlib/Tactic/CategoryTheory/Coherence.lean |
1 |
1 |
['github-actions'] |
dwrensha assignee:dwrensha |
0-48146 13 hours ago |
0-66239 18 hours ago |
0-65989 18 hours |
| 40127 |
Timeroot author:Timeroot |
feat(RiemannZeta): zeta in terms of completedRiemannZeta₀ |
Gives riemannZeta directly in terms of completedRiemannZeta₀, which is useful for some computations.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
10/0 |
Mathlib/NumberTheory/LSeries/RiemannZeta.lean |
1 |
1 |
['github-actions'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
0-48145 13 hours ago |
0-63449 17 hours ago |
0-63199 17 hours |
| 33506 |
Rida-Hamadani author:Rida-Hamadani |
feat(SimpleGraph): construct a cycle of two distinct paths with same start and end |
Co-authored-by: Vlad Tsyrklevich
Co-authored-by: Snir Broshi <26556598+SnirBroshi@users.noreply.github.com>
---
- [x] depends on: #33249
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
maintainer-merge
|
112/5 |
Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Walk/Decomp.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/Nodup.lean |
5 |
72 |
['Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vlad902'] |
nobody |
0-47252 13 hours ago |
0-46464 12 hours ago |
37-77817 37 days |
| 26212 |
Thmoas-Guan author:Thmoas-Guan |
feat(Algebra): the Rees theorem for depth |
In this PR we proved the Rees theorem for depth.
Co-authored-by: Hu Yongle
---
- [x] depends on: #37355
- [x] depends on: #38613
- [x] depends on: #38466
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
218/26 |
Mathlib.lean,Mathlib/RingTheory/Depth/Rees.lean,Mathlib/RingTheory/Regular/LinearMap.lean,docs/references.bib |
4 |
61 |
['Thmoas-Guan', 'alreadydone', 'chrisflav', 'dagurtomas', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
chrisflav assignee:chrisflav |
0-44321 12 hours ago |
0-43598 12 hours ago |
99-4342 99 days |
| 40136 |
marcelolynch author:marcelolynch |
feat(ci): download prebuilt tools from master instead of rebuilding every run |
`build_template.yml` previously checked out a trusted branch (`master` for normal runs) and rebuilt the `cache` binary + `lake-build-*` helper scripts from source on every CI run (~30s plus a full second checkout of mathlib).
Add a `publish_tools.yml` workflow that builds these tools on every push to `master` and uploads them as a small `tools-bin` tarball artifact, and a `get-tools` composite action that downloads that artifact (pinned to the publisher's successful `master` push runs) and installs the matching toolchain.
Trust is preserved: the publisher is triggered only by pushes to `master`. The action falls back to the old source build whenever the fast path is unavailable -- bors/ci_dev tools_branch overrides, nightly-testing (no `master`), a missing artifact, or any download/verification failure.
|
CI |
233/19 |
.github/actions/get-tools/action.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,.github/workflows/build_template.yml,.github/workflows/publish_tools.yml |
5 |
3 |
['bryangingechen', 'github-actions', 'marcelolynch'] |
nobody |
0-43693 12 hours ago |
0-45437 12 hours ago |
0-45187 12 hours |
| 40134 |
tb65536 author:tb65536 |
chore(CategoryTheory/FinCategory/Basic): require `Fintype` for `FinCategory` instance |
Currently mathlib knows that every finite preorder is fintype: https://live.lean-lang.org/#codez=JYWwDg9gTgLgBAWQIYwBYBtgCMBQOBuSUwSW6ApnAN6CNwHAFxwAqAnmOQFQC%2BcA2gApRy0ACbkocGgF0%2BAMWAA7YDErS8AYgDOLBWjjzdbVUA
This PR fixes this by require `Fintype` for the `FinCategory` instance. Long-term `FinCategory` should be entirely switched over to `Finite`, but this would require a bigger refactor.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
1/1 |
Mathlib/CategoryTheory/FinCategory/Basic.lean |
1 |
2 |
['github-actions', 'plp127'] |
nobody |
0-41192 11 hours ago |
0-52021 14 hours ago |
0-51771 14 hours |
| 39491 |
Yu-Misaka author:Yu-Misaka |
feat(Mathlib/LinearAlgebra/RootSystem/CartanMatrix): a Cartan matrix of a reduced crystallographic root system cannot have eigenvalue 4 |
This proves the TODO that a Cartan matrix of a reduced crystallographic root system cannot have eigenvalue 4.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
codex
LLM-generated
label:t-algebra$ |
125/8 |
Mathlib/Data/Matrix/Mul.lean,Mathlib/LinearAlgebra/RootSystem/CartanMatrix.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Basis.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Semisimple.lean |
4 |
6 |
['Yu-Misaka', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-bors', 'ocfnash'] |
ocfnash assignee:ocfnash |
0-40077 11 hours ago |
0-38411 10 hours ago |
7-17040 7 days |
| 34909 |
SnirBroshi author: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
maintainer-merge
|
54/3 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Data/Sym/Sym2.lean |
2 |
19 |
['SnirBroshi', 'bryangingechen', 'chrisflav', 'eric-wieser', 'github-actions', 'mathlib-bors', 'mathlib-merge-conflicts'] |
eric-wieser assignee:eric-wieser |
0-38436 10 hours ago |
0-36815 10 hours ago |
79-68982 79 days |
| 37295 |
wwylele author: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 |
474/0 |
Mathlib.lean,Mathlib/Analysis/InnerProductSpace/NormDet.lean,docs/references.bib |
3 |
21 |
['copilot-pull-request-reviewer', 'github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-splicebot', 'themathqueen', 'wwylele'] |
faenuccio and urkud assignee:urkud assignee:faenuccio |
0-38412 10 hours ago |
0-37688 10 hours ago |
62-49467 62 days |
| 39956 |
SnirBroshi author:SnirBroshi |
feat(GroupTheory/IsPerfect): Grün's lemma |
Grün's lemma: In a perfect group (`commutator G = ⊤`), `center (G ⧸ center G) = ⊥`.
Also the `derivedSeries` and the `lowerCentralSeries` are a constant `⊤`, and the `upperCentralSeries` starts with `⊥` and afterwards is a constant `center G`.
---
[Wikipedia](https://en.wikipedia.org/wiki/Perfect_group#Gr.C3.BCn.27s_lemma)
[MathWorld](https://mathworld.wolfram.com/GruensLemma.html)
[](https://gitpod.io/from-referrer/)
|
t-group-theory |
81/0 |
Mathlib/Algebra/Group/Subgroup/Ker.lean,Mathlib/GroupTheory/Commutator/Basic.lean,Mathlib/GroupTheory/IsPerfect.lean,Mathlib/GroupTheory/Nilpotent.lean,Mathlib/GroupTheory/Subgroup/Centralizer.lean |
5 |
13 |
['SnirBroshi', 'github-actions', 'tb65536'] |
tb65536 assignee:tb65536 |
0-37026 10 hours ago |
0-43665 12 hours ago |
2-29398 2 days |
| 40040 |
JovanGerb author:JovanGerb |
chore(Order/Bounds/Basic): add missing `to_dual` tags |
This PR adds some `to_dual` tags that weren't added in #35208
---
[](https://gitpod.io/from-referrer/)
|
t-order |
43/68 |
Mathlib/Order/Bounds/Basic.lean |
1 |
1 |
['github-actions', 'vihdzp'] |
nobody |
0-35436 9 hours ago |
3-12682 3 days ago |
3-12432 3 days |
| 28683 |
Thmoas-Guan author: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
- [x] depends on: #37627
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
336/0 |
Mathlib.lean,Mathlib/Algebra/Module/SpanRank.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/RegularLocalRing/Basic.lean |
4 |
59 |
['Raph-DG', 'Thmoas-Guan', 'WenrongZou', 'erdOne', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'mbkybky'] |
nobody |
0-31712 8 hours ago |
0-30987 8 hours ago |
11-61344 11 days |
| 32058 |
Thmoas-Guan author:Thmoas-Guan |
feat(Algebra): Baer criterion for injective dimension |
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`. By dimension shifting, we also have `M` has injective dimension not exceeding `n` iff `Ext^{n + 1}(R/I, M)` vanish for all ideal `I`.
---
- [x] depends on: #36980
- [x] depends on: #39305
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-category-theory
label:t-algebra$ |
160/0 |
Mathlib.lean,Mathlib/Algebra/Category/ModuleCat/Ext/Baer.lean |
2 |
79 |
['Thmoas-Guan', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib-splicebot', 'mathlib4-merge-conflict-bot'] |
joelriou assignee:joelriou |
0-30588 8 hours ago |
0-29860 8 hours ago |
62-51283 62 days |
| 40101 |
sgouezel author:sgouezel |
feat: the smul on measures is ordered |
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
19/5 |
Mathlib/Algebra/Order/AddTorsor.lean,Mathlib/Data/ENNReal/Action.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean |
3 |
3 |
['github-actions', 'sgouezel', 'vihdzp'] |
EtienneC30 assignee:EtienneC30 |
0-30286 8 hours ago |
1-19829 1 day ago |
1-19579 1 day |
| 40110 |
kim-em author:kim-em |
perf(Tactic/Linarith): syntactic cache for atom lookup |
This PR makes `linarith`'s atomization scale linearly rather than quadratically in the number of distinct atoms by promoting `ExprMap` in `Tactic/Linarith/Parsing.lean` from a `List` abbreviation to a struct carrying both the original list (still authoritative — used for the `isDefEq` fallback scan) and a `Std.HashMap Expr ℕ` cache populated through a new `push`. `ExprMap.findDefeq` tries the cache first; on miss it falls back to the existing defeq scan. The cache can only succeed on a syntactic match against an already-stored key and `HashMap.insert` overwrites on syntactic match, so a cache hit always returns what the defeq scan would have returned.
Reproducer: https://gist.github.com/kim-em/196a969cd4cdf3e57885796861bd85c8. On the dense rational LP `0 ≤ xᵢ, xᵢ ≤ 1, Σxᵢ ≤ n` (median of 5 fresh runs, apple silicon, `lean-toolchain` `v4.31.0-rc1`):
| benchmark | before | after | speedup |
|-------------------|-------:|-------:|--------:|
| n = 80 (5 calls) | 338 ms | 216 ms | 1.56× |
| n = 160 (3 calls) | 513 ms | 292 ms | 1.76× |
🤖 Prepared with Claude Code |
t-meta
LLM-generated
|
30/7 |
Mathlib/Tactic/Linarith/Parsing.lean |
1 |
5 |
['adomani', 'b-mehta', 'github-actions', 'jcommelin', 'kim-em', 'leanprover-radar'] |
dwrensha assignee:dwrensha |
0-29456 8 hours ago |
1-6812 1 day ago |
1-6562 1 day |
| 39003 |
TwoFX author:TwoFX |
chore: avoid declaring duplicate instances `LE String` and `LT String` |
Since forever, mathlib has declared `LE String` and `LT String` instances which are propositionally, but not definitionally, equal to the `LE String` and `LT String` instances that have shipped with core. This regularly leads to problems with automation that expects instances to be canonical, most recently as described in leanprover/lean4#13544.
This PR removes the mathlib instances, and redefines the `LinearOrder String` instance to use the core-provided instances rather than the ones defined in mathlib. It also redeclares the theorems `String.lt_iff_toList_lt` and `String.le_iff_toList_le` to be about the core-provided instances rather than the mathlib ones.
The result relating `ltb (String.Legacy.iter s₁) (String.Legacy.iter s₂)` (the previous implementation) to `s₁ < s₂` is now packaged as `String.lt_iff_ltb`.
---
[](https://gitpod.io/from-referrer/)
|
t-data
maintainer-merge
|
43/58 |
Mathlib/Data/String/Basic.lean |
1 |
16 |
['TwoFX', 'eric-wieser', 'github-actions', 'joneugster', 'leanprover-radar', 'mathlib-merge-conflicts'] |
joneugster assignee:joneugster |
0-25157 6 hours ago |
0-25520 7 hours ago |
7-57028 7 days |
| 29701 |
Thmoas-Guan author:Thmoas-Guan |
feat(Algebra/RingTheory): polynomial over regular ring |
In this PR, we proved that polynomial over regular ring is regular.
---
- [x] depends on: #37627
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
137/0 |
Mathlib.lean,Mathlib/RingTheory/RegularLocalRing/Polynomial.lean |
2 |
12 |
['Thmoas-Guan', 'github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
joneugster assignee:joneugster |
0-24920 6 hours ago |
0-24213 6 hours ago |
32-37089 32 days |
| 38347 |
artie2000 author: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
documentation
|
28/41 |
Mathlib/LinearAlgebra/FreeModule/StrongRankCondition.lean,Mathlib/LinearAlgebra/InvariantBasisNumber.lean,Mathlib/RingTheory/FiniteType.lean |
3 |
5 |
['artie2000', 'github-actions', 'joneugster', 'mathlib-merge-conflicts'] |
nobody |
0-24346 6 hours ago |
1-69021 1 day ago |
24-20210 24 days |
| 39887 |
adomani author:adomani |
ci(build_template): validate dump outputs are regular files before upload |
Follow-up to #39880, adding a check that artifacts produced in CI exist. |
CI
maintainer-merge
|
10/0 |
.github/workflows/build_template.yml |
1 |
5 |
['adomani', 'github-actions', 'joneugster'] |
joneugster assignee:joneugster |
0-23716 6 hours ago |
3-9249 3 days ago |
5-63036 5 days |
| 38331 |
Thmoas-Guan author: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
|
267/2 |
Mathlib/RingTheory/AdicCompletion/Noetherian.lean |
1 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
0-23628 6 hours ago |
0-22913 6 hours ago |
1-70948 1 day |
| 37934 |
Thmoas-Guan author: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 label:t-algebra$ |
102/0 |
Mathlib.lean,Mathlib/FieldTheory/TranscendentalSeparable.lean |
2 |
14 |
['Thmoas-Guan', 'github-actions', 'robin-carlier'] |
nobody |
0-23625 6 hours ago |
0-22897 6 hours ago |
31-9053 31 days |
| 40106 |
sgouezel author:sgouezel |
feat: missing small lemmas in measure theory, cleanup |
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
maintainer-merge
|
71/15 |
Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/MeasureTheory/Function/L1Space/HasFiniteIntegral.lean,Mathlib/MeasureTheory/Function/L1Space/Integrable.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/AEStronglyMeasurable.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/MeasureTheory/Integral/Bochner/Basic.lean,Mathlib/MeasureTheory/Integral/Lebesgue/Basic.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/MeasureTheory/VectorMeasure/WithDensity.lean |
10 |
5 |
['eric-wieser', 'github-actions', 'mcdoll', 'sgouezel'] |
EtienneC30 assignee:EtienneC30 |
0-23556 6 hours ago |
0-30788 8 hours ago |
1-9411 1 day |
| 40143 |
SnirBroshi author:SnirBroshi |
feat(GroupTheory/PGroup): expand p-group API |
Basic properties and iffs with `orderOf`/`Nat.card`/`Monoid.exponent`, and also show that any normal p-subgroup is contained in any Sylow p-subgroup.
---
[](https://gitpod.io/from-referrer/)
|
t-group-theory |
87/1 |
Mathlib/GroupTheory/PGroup.lean,Mathlib/GroupTheory/Sylow.lean |
2 |
1 |
['github-actions'] |
nobody |
0-23287 6 hours ago |
0-22301 6 hours ago |
0-22051 6 hours |
| 37477 |
kebekus author: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 |
355/12 |
Mathlib.lean,Mathlib/Algebra/Order/WithTop/Untop0.lean,Mathlib/Analysis/Complex/CanonicalDecomposition.lean,Mathlib/Analysis/Meromorphic/Divisor.lean,Mathlib/Analysis/Meromorphic/Order.lean,Mathlib/Analysis/Meromorphic/RCLike.lean,Mathlib/Topology/LocallyFinsupp.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean |
8 |
30 |
['github-actions', 'j-loreaux', 'kebekus'] |
j-loreaux assignee:j-loreaux |
0-20204 5 hours ago |
0-35069 9 hours ago |
61-27369 61 days |
| 38983 |
kebekus author:kebekus |
feat: Invariance of `meromorphic in normal form` under composition. |
Establish invariance of `meromorphic in normal form` under composition with analytic functions of non-vanishing derivative.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
maintainer-merge
|
42/0 |
Mathlib/Analysis/Meromorphic/NormalForm.lean |
1 |
12 |
['github-actions', 'kebekus', 'themathqueen'] |
ADedecker assignee:ADedecker |
0-20081 5 hours ago |
0-19321 5 hours ago |
26-16289 26 days |
| 39075 |
Thmoas-Guan author:Thmoas-Guan |
feat(Algebra/CommRingCat): colimit of local ring via local hom |
In this PR, we deal with filtered colimit of local ring via local homomorphisms, proving it is
again local, with maximal ideal equal to the union of images of maximal ideals.
Co-authored-by: Wang Jingting
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
210/0 |
Mathlib.lean,Mathlib/Algebra/Category/Ring/FilteredColimitsLocal.lean |
2 |
1 |
['github-actions'] |
nobody |
0-19514 5 hours ago |
0-18748 5 hours ago |
24-85956 24 days |
| 40035 |
marcelolynch author:marcelolynch |
feat(cache): restructure cache tool server-side storage layout |
This PR significantly restructures the cache back-end storage layout to address some security issues and as a side benefit improve auditing, garbage collection, provenance.
1) Instead of setting the cache-universe boundary to the repository, we scope it to particular commit SHAs. This means a review of the changes in a PR does give you confidence in that pulling from the cache at that commit.
2) Split the cache universes from master, forks, and nightly-testing at the infrastructure level, using different azure containers. This has other benefits in management, like better auditing, the possibility of targeted garbage collection, etc.
See `SECURITY.md` for the motivation and explanation of the trust model implemented here.
Also added cache tool tests, and changed a bunch of the messages output to users to surface security concerns more clearly.
Extra details:
### Trust model
- Five containers — `master`, `forks`, `nightly-testing`, `pr-toolchain-tests`,
and `legacy` (the original bare `mathlib4` bucket) — each mapped to a dedicated
Azure container. Every trust level has its own writer identity. Azure RBAC on
the OIDC token is the enforced write boundary, not the workflow logic.
- Reads use a per-repo, trust-ordered chain (most-trusted first, stop at first
hit
- URL layout is fixed per container, not per repo: `master` is flat
(`/f/{hash}`), multi-writer containers namespace by repo (`/f/{repo}/{hash}`),
`legacy` preserves its historical mixed layout for older clients.
### Per-commit scoping & discovery
- Fork uploads are scoped to their commit SHA (`/f/{repo}/{sha}/{hash}`), so a
closed/hidden PR's artifacts can't be served to a later honest PR on the same
fork. A marker blob (`/m/{repo}/{sha}`) is written after a successful upload.
- New `cache query [REF]`: walks history to the merge-base with master and HEAD-
probes markers to report the most recent cached commit (or a boolean probe for
a single ref). `cache get --scope=` then reads that commit's namespace.
- `cache get` prints a security notice whenever a read leaves the repo's
default trust boundary (a scope, a widened `--cache-from`, or a `--repo` that
diverges from the git remote), plus a hint pointing uncached fork HEADs at
`cache query`.
### CLI / env surface
- New flags: `--cache-from=LIST`, `--container=NAME`, `--scope=REF`; new command
`cache query`.
- New env: `MATHLIB_CACHE_FROM`, `MATHLIB_CACHE_REPO_SCOPE`. `MATHLIB_CACHE_GET_URL`
/ `_PUT_URL` retained as single-URL escape hatches; `MATHLIB_CACHE_USE_CLOUDFLARE`
removed.
### CI wiring
- New composite action `cache-trust-dispatch` is the single source mapping
`(repo, branch) → (write container, read chain, per-commit scope)`; `build.yml`,
`bors.yml`, and `build_template.yml` consult it. Trust policy lives in YAML,
not in the Lean tool.
- During migration, master CI dual-writes to `legacy` so older cache clients
keep working; forks/nightly never write to `legacy`.
### Code organization & testing
- Backend split into focused modules: `Cache.Infra` (container model),
`Cache.Cli` (option parsing), `Cache.Marker`, `Cache.Query`, `Cache.Warning`;
`Cache.Init` folded away.
- New standalone `lake exe cache-test` (`Cache.Test`) unit-tests the pure logic —
container model, URL construction, per-repo read chains, flag parsing, and the
warning conditions — without building Mathlib. |
file-removed
CI
|
2530/291 |
.github/actions/cache-trust-dispatch/action.yml,.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_template.yml,Cache/Cli.lean,Cache/Infra.lean,Cache/Init.lean,Cache/Main.lean,Cache/Marker.lean,Cache/Query.lean,Cache/README.md,Cache/Requests.lean,Cache/SECURITY.md,Cache/Test.lean,Cache/Warning.lean,lakefile.lean |
16 |
8 |
['github-actions', 'joneugster'] |
nobody |
0-18009 5 hours ago |
0-48330 13 hours ago |
3-17708 3 days |
| 39543 |
jvanwinden author:jvanwinden |
feat(MeasureTheory/Measure/Tight): portmanteau condition for compact sets |
One part of the portmanteau theorem states that a limsup condition for closed sets implies weak convergence of probability measures. In the situation where the measures are tight however, one only needs to check the limsup condition for compact sets.
This PR thus introduces `tendsto_of_forall_isCompact_of_isTightMeasureSet`, which is a version of [tendsto_of_forall_isClosed_limsup_le](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Measure/Portmanteau.html#MeasureTheory.tendsto_of_forall_isClosed_limsup_le) but replaces `IsClosed` with `IsCompact`, under the additional hypothesis that the measures are tight.
I would have liked to put this lemma in MeasureTheory/Portmeanteau, but this created an import cycle. I am open to suggestions for where it could otherwise be moved.
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
200/151 |
Mathlib/MeasureTheory/Measure/LevyConvergence.lean,Mathlib/MeasureTheory/Measure/Portmanteau.lean,Mathlib/MeasureTheory/Measure/Prokhorov.lean,Mathlib/MeasureTheory/Measure/Tight.lean,Mathlib/MeasureTheory/Measure/TightNormed.lean |
5 |
31 |
['EtienneC30', 'RemyDegenne', 'github-actions', 'jvanwinden'] |
EtienneC30 assignee:EtienneC30 |
0-17156 4 hours ago |
0-67193 18 hours ago |
13-20853 13 days |
| 38500 |
kebekus author: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 |
212/0 |
Mathlib.lean,Mathlib/Analysis/Complex/ValueDistribution/Proximity/IntegralPresentation.lean |
2 |
11 |
['github-actions', 'kebekus', 'wwylele'] |
j-loreaux assignee:j-loreaux |
0-15094 4 hours ago |
0-14370 3 hours ago |
38-20496 38 days |
| 40131 |
b-mehta author:b-mehta |
feat(ENat): `Nat.cast` tends to `⊤` in `ENat` |
A simple lemma that came up when adding new ENat tsum lemmas.
(If - like me - you were surprised that this is missing, [note that `exact?` can't prove this](https://live.lean-lang.org/#codez=JYWwDg9gTgLgBAWQIYwBYBtgCMBQO0Cm0BIcMBAdgCYDOMEA%2BhSgMJJ1Oq0P1hwBccHHBFwAYsHTkoAOgAqlWvTgA5FDIDG7eBKkFZKORD4AKClxpwTgEqIBcAKJqYASmcCAvHCwBPYXAIAHkgaMAD8QA))
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
5/0 |
Mathlib/Topology/Instances/ENat.lean |
1 |
4 |
['b-mehta', 'eric-wieser', 'github-actions'] |
nobody |
0-14887 4 hours ago |
0-55539 15 hours ago |
0-55289 15 hours |
| 38916 |
yuanyi-350 author:yuanyi-350 |
chore(CategoryTheory/CatCommSq): remove an erw |
- rewrites `hInv_hInv` by using `conv_rhs` with `iso_hom_naturality`
- removes the `rw`/`erw` pair around `Functor.comp_map`
Extracted from #38415
[](https://gitpod.io/from-referrer/) |
codex
LLM-generated
|
3/2 |
Mathlib/CategoryTheory/CatCommSq.lean |
1 |
2 |
['github-actions', 'loefflerd'] |
nobody |
0-14730 4 hours ago |
0-13767 3 hours ago |
29-12070 29 days |
| 38934 |
YaelDillies author:YaelDillies |
feat(Geometry): convex hull in a `ConvexSpace` |
---
- [x] depends on: #38905
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
119/0 |
Mathlib.lean,Mathlib/Geometry/Convex/Hull.lean |
2 |
14 |
['TBUGTB', 'YaelDillies', 'github-actions', 'martinwintermath', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-12345 3 hours ago |
12-13927 12 days ago |
12-14027 12 days |
| 40138 |
faenuccio author:faenuccio |
doc: fix the doc of two files about group actions |
|
documentation
t-group-theory
|
150/148 |
Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/Schreier.lean |
2 |
14 |
['b-mehta', 'eric-wieser', 'faenuccio', 'github-actions', 'jcommelin'] |
nobody |
0-11697 3 hours ago |
0-9618 2 hours ago |
0-33626 9 hours |
| 39739 |
RemyDegenne author:RemyDegenne |
chore: generalize `IsZeroOneMeasure.exists_eq_dirac` |
Replace the `StandardBorelSpace` assumption by `CountablySeparated`, since the existing proof used only that.
Add another version of the result for `CountablyGenerated`.
---
- [x] depends on: #39770
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
92/63 |
Mathlib/MeasureTheory/Measure/Typeclasses/ZeroOne.lean,Mathlib/Probability/Kernel/Basic.lean,Mathlib/Probability/Kernel/Deterministic.lean |
3 |
11 |
['RemyDegenne', 'gaetanserre', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib-splicebot'] |
nobody |
0-11274 3 hours ago |
0-11078 3 hours ago |
0-16500 4 hours |
| 31222 |
Thmoas-Guan author: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
---
- [x] depends on: #31218
- [x] depends on: #31219
- [x] depends on: #31696
[](https://gitpod.io/from-referrer/)
|
large-import
t-algebra
label:t-algebra$ |
49/0 |
Mathlib/Algebra/Module/FinitePresentation.lean |
1 |
5 |
['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] |
kim-em assignee:kim-em |
0-11136 3 hours ago |
0-10272 2 hours ago |
32-54044 32 days |
| 26304 |
Raph-DG author: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
maintainer-merge
|
91/0 |
Mathlib.lean,Mathlib/Topology/LocallyFinsupp.lean,Mathlib/Topology/LocallyFinsupp/Pushforward.lean |
3 |
64 |
['Raph-DG', 'chrisflav', 'github-actions', 'joelriou', 'leanprover-community-bot-assistant', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'riccardobrasca'] |
joelriou assignee:joelriou |
0-10816 3 hours ago |
7-3462 7 days ago |
49-35887 49 days |
| 40149 |
b-mehta author:b-mehta |
feat(Order/Filter/Cofinite): `Tendsto f cofinite (pure 0)` iff finite support |
A simple lemma relating these two notions. The import increase should be minimal since it's a light file.
---
[](https://gitpod.io/from-referrer/)
|
easy
t-order
|
6/0 |
Mathlib/Order/Filter/Cofinite.lean |
1 |
1 |
['github-actions'] |
nobody |
0-9477 2 hours ago |
0-7596 2 hours ago |
0-7346 2 hours |
| 40150 |
b-mehta author:b-mehta |
feat(Topology/Instances/ENat): `ℕ∞` is a topological semiring |
We already had all the maths here, this just bundles them together.
---
[](https://gitpod.io/from-referrer/)
|
easy
t-topology
large-import
|
5/0 |
Mathlib/Topology/Instances/ENat.lean |
1 |
1 |
['github-actions'] |
nobody |
0-9422 2 hours ago |
0-8541 2 hours ago |
0-8291 2 hours |
| 39812 |
RemyDegenne author:RemyDegenne |
feat(Probability/Decision): risk in countable spaces |
This PR adds lemmas to write the average and Bayes risk with sums instead of integrals in countable spaces.
Co-authored-by: Lorenzo Luccioli @LorenzoLuccioli
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
maintainer-merge
|
86/0 |
Mathlib.lean,Mathlib/Probability/Decision/Risk/Countable.lean |
2 |
13 |
['EtienneC30', 'RemyDegenne', 'github-actions'] |
EtienneC30 assignee:EtienneC30 |
0-8182 2 hours ago |
0-7184 1 hour ago |
3-22552 3 days |
| 37534 |
EtienneC30 author: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
maintainer-merge
|
20/0 |
Mathlib/Data/Set/Card.lean,Mathlib/Data/Set/Finite/Basic.lean |
2 |
7 |
['EtienneC30', 'b-mehta', 'github-actions', 'joneugster'] |
Vierkantor assignee:Vierkantor |
0-7997 2 hours ago |
0-4837 1 hour ago |
59-42609 59 days |
| 38780 |
yuanyi-350 author:yuanyi-350 |
chore(Catalogue PR): kill some `erw`s by adding rfl lemmas |
---
[](https://gitpod.io/from-referrer/)
|
|
44/17 |
Mathlib/AlgebraicGeometry/EllipticCurve/Jacobian/Point.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/AlgebraicGeometry/OpenImmersion.lean,Mathlib/AlgebraicGeometry/ProjectiveSpectrum/Basic.lean,Mathlib/LinearAlgebra/BilinearForm/Properties.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/Topology/UniformSpace/Matrix.lean |
7 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
0-7971 2 hours ago |
0-7063 1 hour ago |
0-6813 1 hour |
| 38621 |
mariainesdff author: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 label:t-algebra$ |
298/4 |
Mathlib/Algebra/SkewPolynomial/Basic.lean |
1 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
0-7706 2 hours ago |
0-6990 1 hour ago |
0-77038 21 hours |
| 39665 |
justus-springer author:justus-springer |
feat(AlgebraicGeometry/AffineSpace): affine space over an integral base is integral |
Prove that `AffineSpace` inherits the properties `IrreducibleSpace`, `IsReduced` and `IsIntegral` from its base.
Also clean up a few variables, that were used very scarcely. These were causing weird issues in these new instances, where they would be automatically included.
---
[](https://gitpod.io/from-referrer/)
|
t-algebraic-geometry |
50/12 |
Mathlib/AlgebraicGeometry/AffineSpace.lean,Mathlib/AlgebraicGeometry/Properties.lean |
2 |
8 |
['chrisflav', 'github-actions', 'justus-springer', 'mathlib-merge-conflicts'] |
chrisflav assignee:chrisflav |
0-7687 2 hours ago |
0-7687 2 hours ago |
9-60016 9 days |
| 38622 |
mariainesdff author: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 |
378/0 |
Mathlib.lean,Mathlib/Algebra/BigOperators/Finsupp/Fin.lean,Mathlib/Data/Nat/Choose/Sum.lean,Mathlib/RingTheory/PowerSeries/ExponentialModule.lean |
4 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
alreadydone assignee:alreadydone |
0-7508 2 hours ago |
0-6549 1 hour ago |
28-50339 28 days |
| 38551 |
TTony2019 author: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
t-analysis
|
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 |
26 |
['TTony2019', 'github-actions', 'themathqueen', 'wwylele'] |
themathqueen assignee:themathqueen |
0-7423 2 hours ago |
34-43798 34 days ago |
36-58069 36 days |
| 39785 |
hawkrobe author:hawkrobe |
refactor(RingTheory/HopfAlgebra): `ofConvInverse` constructor |
The antipode of a Hopf algebra is [generally](https://arxiv.org/pdf/1409.8356) the two-sided inverse of the identity in the convolution algebra `End(A)`. When `A` is commutative, algebra homs are closed under convolution and this lifts to AlgHom equality. See [this comment](https://github.com/leanprover-community/mathlib4/pull/31898#issuecomment-3566663278) on #31898.
---
Sadly the AlgHom-equality formulation is unavailable in the noncommutative case.
|
t-ring-theory
new-contributor
maintainer-merge
|
41/20 |
Mathlib/RingTheory/HopfAlgebra/Basic.lean,Mathlib/RingTheory/HopfAlgebra/TensorProduct.lean |
2 |
35 |
['YaelDillies', 'eric-wieser', 'faenuccio', 'github-actions', 'grunweg', 'hawkrobe', 'themathqueen'] |
nobody |
0-7092 1 hour ago |
0-52317 14 hours ago |
7-81827 7 days |
| 40144 |
astrainfinita author:astrainfinita |
perf: lower the priority of `Normed*.to*` instances |
This PR further lowers the priority of these instances, since lower instance priority usually means priority 100, whereas we want these instances to have an even lower priority.
Only one file got significantly slower from searching for AddCommMonoid ↥(Lp ?m 1 ?m') during unification. Lean tries AddSubgroupClass.toAddCommGroup and then gets stuck on the metavariables. Adding a shortcut instance for Lp resolves it directly and avoids any further search.
---
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Slow.20Riemannian.20geometry/with/599416865)
[](https://gitpod.io/from-referrer/)
|
t-analysis
t-algebra
label:t-algebra$ |
37/16 |
Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Group/Defs.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean |
4 |
5 |
['astrainfinita', 'github-actions', 'leanprover-radar'] |
nobody |
0-6130 1 hour ago |
0-10750 2 hours ago |
0-18276 5 hours |
| 39163 |
j-loreaux author:j-loreaux |
feat: `star` structures on `ContinuousLinearMapWOT` |
In particular, with these instances it makes sense to consider the `StarSubalgebra.topologicalClosure` of some `S : StarSubalgebra 𝕜 (F →WOT[𝕜] F)`.
---
- [ ] depends on: #37914
[](https://gitpod.io/from-referrer/)
|
|
157/4 |
Mathlib.lean,Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/Pointwise.lean,Mathlib/Algebra/Star/TransferInstance.lean,Mathlib/Analysis/InnerProductSpace/WeakOperatorTopology.lean |
5 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
0-5992 1 hour ago |
0-5996 1 hour ago |
0-5746 1 hour |
| 39953 |
plp127 author:plp127 |
feat(RingTheory/Valuation): embedding of valuation groups |
We show that if `vR` and `vA` are valuations satisfying `vR.HasExtension vA`, then there is an induced embedding of the valuation groups compatible with the valuations and with the extension.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
39/1 |
Mathlib/Algebra/Group/WithOne/Defs.lean,Mathlib/RingTheory/Valuation/Extension.lean |
2 |
3 |
['github-actions', 'plp127', 'riccardobrasca'] |
nobody |
0-5867 1 hour ago |
5-44631 5 days ago |
5-44381 5 days |
| 39908 |
SnirBroshi author:SnirBroshi |
chore(Order): infer `toDecidable*` in `*LinearOrder`s when possible |
Surround the `toDecidableEq`/`toDecidableLE`/`toDecidableLT` fields in `LinearOrder`/`CompleteLinearOrder`/`ConditionallyCompleteLinearOrder` with square brackets to let TC-search try to infer it.
---
I also tried prepending `by first | infer_instance | exact` to the existing defaults of `toDecidableEq`/`toDecidableLT` but it broke instances. It looks like a tactic block can't reference other fields unlike a default term.
[](https://gitpod.io/from-referrer/)
|
t-order |
168/221 |
Mathlib/Algebra/BigOperators/Ring/Nat.lean,Mathlib/Algebra/Order/Archimedean/Class.lean,Mathlib/Algebra/Order/Group/Cone.lean,Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean,Mathlib/Algebra/Tropical/Basic.lean,Mathlib/Combinatorics/Colex.lean,Mathlib/Combinatorics/SimpleGraph/VertexCover.lean,Mathlib/Data/Bool/Basic.lean,Mathlib/Data/Char.lean,Mathlib/Data/DFinsupp/Lex.lean,Mathlib/Data/Finsupp/MonomialOrder/DegLex.lean,Mathlib/Data/Int/Order/Basic.lean,Mathlib/Data/Nat/Basic.lean,Mathlib/Data/Num/Lemmas.lean,Mathlib/Data/Num/ZNum.lean,Mathlib/Data/PSigma/Order.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Data/Set/Card.lean,Mathlib/Data/Sigma/Order.lean,Mathlib/Data/Sign/Defs.lean,Mathlib/Data/String/Basic.lean,Mathlib/Data/Sum/Order.lean,Mathlib/GroupTheory/DivisibleHull.lean,Mathlib/GroupTheory/MonoidLocalization/Order.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/LinearAlgebra/Center.lean,Mathlib/LinearAlgebra/Projectivization/Cardinality.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/ModelTheory/Order.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean,Mathlib/Order/Antisymmetrization.lean,Mathlib/Order/Atoms.lean,Mathlib/Order/Basic.lean,Mathlib/Order/Comparable.lean,Mathlib/Order/Compare.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/Completion.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Defs/LinearOrder.lean,Mathlib/Order/Extension/Linear.lean,Mathlib/Order/Extension/Well.lean,Mathlib/Order/Interval/Lex.lean,Mathlib/Order/Lattice.lean,Mathlib/Order/OrderDual.lean,Mathlib/Order/Preorder/Chain.lean,Mathlib/Order/Quotient.lean,Mathlib/Order/RelClasses.lean,Mathlib/Order/SuccPred/Archimedean.lean,Mathlib/RingTheory/HahnSeries/Lex.lean,Mathlib/RingTheory/RegularLocalRing/Defs.lean,Mathlib/RingTheory/Valuation/ValuationRing.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Basic.lean,Mathlib/SetTheory/Cardinal/Finite.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/SetTheory/Ordinal/Basic.lean |
56 |
20 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'leanprover-radar'] |
YaelDillies assignee:YaelDillies |
0-5808 1 hour ago |
0-39715 10 hours ago |
0-39465 10 hours |
| 39433 |
JovanGerb author:JovanGerb |
feat(Tactic): `#click_suggestions` |
This is an initial PR for a point&click suggestion tool that can suggest theorems and tactics. This PR only implements theorem suggestions.
This PR adds the `#click_suggestions` command that activates the tool. It could potentially in the future be active by default.
The code is ported from this repository: https://github.com/JovanGerb/infoview_search
TODO: import this feature in Tactic.Common (during development it's easier to not do this to avoid import tangles)
This PR deletes `unfold?` in favour of the `#click_suggestions`. For backwards compatability, I have left `rw??` in place, but I plan to deprecate it in the future.
---
[](https://gitpod.io/from-referrer/)
|
file-removed
t-meta
|
2302/124 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ClickSuggestions.lean,Mathlib/Tactic/ClickSuggestions/Apply.lean,Mathlib/Tactic/ClickSuggestions/ApplyAt.lean,Mathlib/Tactic/ClickSuggestions/FindPremises.lean,Mathlib/Tactic/ClickSuggestions/GRewrite.lean,Mathlib/Tactic/ClickSuggestions/Rewrite.lean,Mathlib/Tactic/ClickSuggestions/SectionState.lean,Mathlib/Tactic/ClickSuggestions/TryPremises.lean,Mathlib/Tactic/ClickSuggestions/Unfold.lean,Mathlib/Tactic/ClickSuggestions/Util.lean,Mathlib/Tactic/Widget/LibraryRewrite.lean,MathlibTest/ClickSuggestions/Benchmark.lean,MathlibTest/ClickSuggestions/Test.lean,MathlibTest/ClickSuggestions/TestImpl.lean,MathlibTest/ClickSuggestions/Unfold.lean |
17 |
21 |
['JovanGerb', 'fpvandoorn', 'github-actions', 'mathlib-merge-conflicts'] |
fpvandoorn assignee:fpvandoorn |
0-5167 1 hour ago |
1-38404 1 day ago |
4-19610 4 days |
| 40091 |
mcdoll author:mcdoll |
chore(Analysis/InnerProductSpace): make `adjointAux` private |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
maintainer-merge
|
7/3 |
Mathlib/Analysis/InnerProductSpace/Adjoint.lean |
1 |
8 |
['b-mehta', 'github-actions', 'leanprover-radar', 'mcdoll', 'themathqueen'] |
nobody |
0-5121 1 hour ago |
1-8115 1 day ago |
1-7865 1 day |
| 39815 |
sharky564 author:sharky564 |
feat(Analysis/Normed/Module/Complemented): add `IsCompl.isTopCompl_of_isClosed` and `isTopCompl_iff_isCompl_isClosed_isClosed` |
Adds two theorems:
- `IsCompl.isTopCompl_of_isClosed`: In a Banach space, two closed submodules that are algebraic complements are topological
- `isTopCompl_iff_isCompl_isClosed_isClosed`: `p` and `q` are topological complements if and only if `p` and `q` are algebraic complements and `p` and `q` are both closed.
---
This PR addresses the final point of #38416, and finally close it. However, this is no longer much of a refactor as it is more just adding these theorems in. |
t-analysis |
14/1 |
Mathlib/Analysis/Normed/Module/Complemented.lean |
1 |
5 |
['github-actions', 'themathqueen'] |
nobody |
0-4365 1 hour ago |
7-85041 7 days ago |
8-10436 8 days |
| 37008 |
BryceT233 author: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 |
178/0 |
Mathlib.lean,Mathlib/RingTheory/LocalRing/Pullback.lean |
2 |
10 |
['BryceT233', 'github-actions', 'riccardobrasca', 'wwylele'] |
riccardobrasca assignee:riccardobrasca |
0-4310 1 hour ago |
0-47646 13 hours ago |
70-75184 70 days |
| 40117 |
gaetanserre author:gaetanserre |
feat(gaussianReal): `gaussianReal` is measurable w.r.t. its parameters |
Add `measurable_gaussianReal` that shows that `fun (m, v) => gaussianReal m v` is measurable.
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
40/6 |
Mathlib/MeasureTheory/Measure/WithDensity.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean |
2 |
7 |
['DavidLedvinka', 'EtienneC30', 'gaetanserre', 'github-actions'] |
nobody |
0-4027 1 hour ago |
0-2912 44 minutes ago |
0-25232 7 hours |
| 40135 |
kim-em author:kim-em |
feat(Topology/Covering): introduce Deck transformation group |
This PR introduces `Deck p`, the subgroup of `E ≃ₜ E` consisting of self-homeomorphisms commuting with a map `p : E → X`. The definition is stated for an arbitrary `p` so the basic group structure and canonical action are available without a covering-map hypothesis; covering-specific theorems (lifting characterisation, the iso with `π₁(X)/p_*π₁(E)`) belong to follow-up files.
The upstream additions in `Topology/Algebra/ConstMulAction.lean` add the tautological action `MulAction (X ≃ₜ X) X`, its faithfulness, and the matching `ContinuousConstSMul` instance. These parallel `Equiv.Perm.applyMulAction` and unlock the subgroup-action transfers that automatically give `Deck p` its `Group`, `MulAction E`, `FaithfulSMul E`, and `ContinuousConstSMul E` instances.
🤖 Prepared with [Claude Code](https://claude.com/claude-code) |
t-topology |
87/0 |
Mathlib.lean,Mathlib/Topology/Algebra/ConstMulAction.lean,Mathlib/Topology/Covering/Deck.lean |
3 |
4 |
['github-actions', 'ocfnash', 'vihdzp'] |
nobody |
0-3584 59 minutes ago |
0-29980 8 hours ago |
0-42705 11 hours |
| 39792 |
vihdzp author:vihdzp |
chore: deprecate `Ordinal.IsAcc` and `Ordinal.IsClosedBelow` |
These predicates were introduced in #16710 as preliminaries for a development of club sets. Those have [since been defined](https://leanprover-community.github.io/mathlib4_docs/Mathlib/SetTheory/Cardinal/Cofinality/Club.html#IsClub) without them, so we deprecate them, and generalize the results on them to the setting of successor orders.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
maintainer-merge
|
64/37 |
Mathlib/SetTheory/Ordinal/Topology.lean,Mathlib/Topology/Order/SuccPred.lean |
2 |
4 |
['YaelDillies', 'github-actions', 'mathlib-bors'] |
nobody |
0-3339 55 minutes ago |
8-43263 8 days ago |
8-61358 8 days |
| 39740 |
Thmoas-Guan author:Thmoas-Guan |
feat(FieldTheory): the field of adjoining all `p`th roots |
In this PR, we define the field extension of adjoining all `p`th roots to a field of characteristic `p`.
The definition is via defining it as the field itself with algebra map equal to frobenious. Thanks to @erdOne for this idea.
Co-authored by:@dleijnse
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
maintainer-merge
label:t-algebra$ |
68/0 |
Mathlib.lean,Mathlib/FieldTheory/PurelyInseparable/AdjoinPthRoots.lean |
2 |
57 |
['Thmoas-Guan', 'chrisflav', 'erdOne', 'github-actions', 'plp127', 'vihdzp'] |
chrisflav assignee:chrisflav |
0-3210 53 minutes ago |
0-22877 6 hours ago |
9-48603 9 days |
| 39613 |
sharky564 author:sharky564 |
feat(LinearAlgebra/Projection): add quotientEquivOfIsCompl_comp_mkQ and quotientEquivOfIsTopCompl_comp_mkQ |
Adds the lemmas `Submodule.quotientEquivOfIsCompl_comp_mkQ` and `quotientEquivOfIsTopCompl_comp_mkQ` - the composition of `quotientEquivOfIsCompl`/`quotientEquivOfIsTopCompl` with `mkQ` agrees with the linear projection onto `q` along `p`. Additionally the proof of `IsCompl.isTopCompl_iff_continuous_quotientEquivOfIsCompl` is simplified.
---
This lemma was flagged as missing in the API in the review of #39260 by @themathqueen. Upon review of the lemma, I found it could be further simplified. |
t-algebra
t-topology
label:t-algebra$ |
11/4 |
Mathlib/LinearAlgebra/Projection.lean,Mathlib/Topology/Algebra/Module/Complement.lean |
2 |
10 |
['ADedecker', 'github-actions', 'sharky564', 'themathqueen'] |
jcommelin assignee:jcommelin |
0-2995 49 minutes ago |
9-33300 9 days ago |
12-43507 12 days |
| 36616 |
EtienneC30 author:EtienneC30 |
feat: add predicates IsPreBrownianReal and IsBrownianReal |
The predicate `IsPreBrownianReal 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 `BrownianReal.projectiveFamily`. The predicate `IsBrownianReal 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.
---
- [x] depends on: #36472
- [x] depends on: #36615
- [x] depends on: #40083
[](https://gitpod.io/from-referrer/)
|
brownian
t-measure-probability
|
269/0 |
Mathlib.lean,Mathlib/Probability/BrownianMotion/Basic.lean,Mathlib/Probability/Distributions/Gaussian/Real.lean |
3 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-2161 36 minutes ago |
0-2161 31 minutes ago |
0-1911 31 minutes |
| 39487 |
ADedecker author:ADedecker |
chore: switch `EqLocus` from `LinearMapClass` to `LinearMap` |
---
Note: this PR was opened at 35000 feet :slightly_smiling_face:
[](https://gitpod.io/from-referrer/)
|
t-algebra
maintainer-merge
label:t-algebra$ |
18/14 |
Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Module/Submodule/EqLocus.lean,Mathlib/Analysis/InnerProductSpace/MeanErgodic.lean,Mathlib/Topology/Algebra/Module/ContinuousLinearMap/Basic.lean |
4 |
12 |
['ADedecker', 'b-mehta', 'github-actions', 'j-loreaux', 'themathqueen'] |
nobody |
0-1451 24 minutes ago |
12-59997 12 days ago |
15-68525 15 days |
| 35812 |
khwilson author: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
---
- [x] depends on #37738
- [x] depends on #37740
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
349/36 |
Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean,Mathlib/NumberTheory/NumberField/Units/Regulator.lean |
6 |
86 |
['Vierkantor', 'YaelDillies', 'github-actions', 'joneugster', 'khwilson', 'mathlib-merge-conflicts'] |
YaelDillies assignee:YaelDillies |
0-1366 22 minutes ago |
0-41282 11 hours ago |
37-84445 37 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 |
| 38344 |
robo7179 author: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 |
38-13784 1 month ago |
41-67006 41 days ago |
41-66756 41 days |
| 38364 |
openendings author: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 |
34-58040 1 month ago |
40-44746 40 days ago |
41-15964 41 days |
| 38316 |
tannerduve author:tannerduve |
feat(Order/OmegaCompletePartialOrder): least fixed point and Scott induction |
Adds `ContinuousHom.lfp` for endomorphisms on an ωCPO with `⊥`, as the `ωSup` of the iterate chain from `⊥`, together with `map_lfp`, `isFixedPt_lfp`, `lfp_le_fixed`, `isLeast_lfp`, and the Scott induction theorem `lfp_induction` (specialized from a more general seed-based `ωSup_iterate_induction`).
For `Part.fix`, adds:
* `Part.exists_mem_approx_of_mem_fix`: if `y ∈ Part.fix g x`, some finite approximation of `g` already contains `y`.
* `Part.Fix.approx_eq_iterate_bot` and `Part.Fix.approxChain_eq_iterateChain`: bridges between `Fix.approx`/`approxChain` and `f^[n] ⊥`/`iterateChain`.
* `Part.fix_eq_lfp`: `Part.fix g = ContinuousHom.lfp (.ofFun g hc)` when `g` is ω-Scott continuous.
* `Part.fix_scott_induction`: Scott induction specialized to `Part.fix`.
* `Part.fix_induction_mem`: membership induction on `Part.fix`, derived from `fix_scott_induction`. |
new-contributor |
114/0 |
Mathlib/Control/LawfulFix.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,docs/references.bib |
3 |
2 |
['github-actions'] |
nobody |
30-74520 30 days ago |
30-73823 30 days ago |
42-43117 42 days |
| 38871 |
0xTerencePrime author:0xTerencePrime |
feat(Combinatorics/SimpleGraph): add parity lemmas for outer and inner vertices |
Adds three lemmas to `SimpleGraph.DegreeSum`:
- `sum_degrees_option_zmod_two`: the handshaking lemma for `Option I` over ZMod 2
- `degree_none_zmod_two_eq_sum`: simp-normal form of the above
- `card_degree_one_option_eq_outer_zmod_two`: under degree bound ≤ 2, count of degree-1 inner vertices equals outer vertex degree mod 2 |
t-combinatorics
new-contributor
|
65/3 |
Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean |
1 |
6 |
['0xTerencePrime', 'SnirBroshi', 'github-actions'] |
nobody |
29-37605 29 days ago |
29-43551 29 days ago |
30-4843 30 days |
| 38897 |
0xTerencePrime author:0xTerencePrime |
feat(Combinatorics/SetFamily): formalize 1D Sperner's Lemma parity |
Formalizes the 1-dimensional Sperner's Lemma (parity version): given a coloring of
the `n + 1` vertices of a subdivided line segment with two colors (`ZMod 2`), if the
two endpoints have different colors, then the number of color-changing edges is odd.
This is **distinct** from `IsAntichain.sperner` in `SetFamily.LYM`, which concerns
antichains in a power set. This file formalizes the topological/combinatorial parity
statement used as the base case in higher-dimensional Sperner arguments.
## Key declarations
- `SpernerColoring`: type-safe coloring via `Fin (n + 1) → ZMod 2`
- `edgeDiff`: color difference on adjacent vertices, computed in `ZMod 2`
- `totalDiff`: telescoping sum of all edge differences
- `diffEdges`: the `Finset` of bichromatic (color-changing) edges
- `sperner_1d`: main theorem — `Odd (diffEdges c).card`
## Design notes
- Using `Fin (n + 1) → ZMod 2` instead of `ℕ → ZMod 2` makes boundary conditions
unrepresentable at the type level, eliminating out-of-bounds cases entirely.
- The proof reduces to a telescoping sum in `ZMod 2`, using `CharTwo.add_self_eq_zero`
to cancel all interior vertices, avoiding parity case splits.
This is intended as the 1D base case, the approach generalizes to higher-dimensional
Sperner's Lemma in future work.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
133/0 |
Mathlib.lean,Mathlib/Combinatorics/SetFamily/Sperner1D.lean |
2 |
3 |
['github-actions', 'grunweg'] |
nobody |
29-28839 29 days ago |
29-38259 29 days ago |
29-38009 29 days |
| 38951 |
thomaskwaring author:thomaskwaring |
feat(Order/PrimeSeparator): remove unnecessary hypotheses |
In `mem_ideal_sup_principal`, boundedness and distributivity were unused, and in `prime_ideal_of_disjoint_filter_ideal`, boundedness was only used to produce an element of the filter `F`, which is already nonempty by definition.
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
9/19 |
Mathlib/Order/PrimeSeparator.lean |
1 |
2 |
['github-actions'] |
nobody |
28-21530 28 days ago |
28-20870 28 days ago |
28-20620 28 days |
| 38310 |
ZRTMRH author: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
LLM-generated
|
157/0 |
Mathlib/Combinatorics/Quiver/Schreier.lean |
1 |
2 |
['github-actions'] |
nobody |
26-35545 26 days ago |
42-68311 42 days ago |
42-68061 42 days |
| 39023 |
TBUGTB author:TBUGTB |
feat(Algebra/Order): API lemmas on floor and abs |
Co-authored-by: Etienne Marion @EtienneC30
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
brownian
new-contributor
label:t-algebra$ |
9/0 |
Mathlib/Algebra/Order/Floor/Semiring.lean,Mathlib/Algebra/Order/Ring/Abs.lean |
2 |
3 |
['TBUGTB', 'github-actions'] |
nobody |
26-17271 26 days ago |
26-17986 26 days ago |
26-17736 26 days |
| 39162 |
anovickis author:anovickis |
feat(Topology/PartitionOfUnity): add pointwise_decomposition_finsum + companions |
Add three short lemmas to `Mathlib/Topology/PartitionOfUnity.lean` extending the existing `PartitionOfUnity` API:
- `pointwise_decomposition_finsum` — for `f : X → ℝ` and `x ∈ s`, `f x = ∑ᶠ i, ρ i x · f x`. This is the pointwise step that lifts to integral linearity in measure-theoretic PoU integration: `∫_s f dμ = ∑ᶠ i, ∫_s (ρ i · f) dμ`.
- `one_minus_sum_nonneg` — `0 ≤ 1 - ∑ᶠ i, ρ i x`. Direct rearrangement of the existing `sum_le_one` field; useful as a complement-mass remainder bound in chart-by-chart estimates.
- `abs_le_one` — `|ρ i x| ≤ 1`. Combines the existing `nonneg` and `le_one`; convenience for absolute-value bounds.
All three are short proofs using existing structure fields (`sum_eq_one`, `sum_le_one`, `nonneg`, `le_one`).
These came up while writing chart-by-chart Stokes-on-manifold estimates where one wants to decompose `∫_M f` into chart-supported pieces using a partition of unity. The pointwise identity is the obvious first step; the other two are complementary algebraic bounds that show up in remainder estimates.
---
🤖 Generated with [Claude Code](https://claude.com/claude-code) |
t-topology
new-contributor
LLM-generated
|
27/0 |
Mathlib/Topology/PartitionOfUnity.lean |
1 |
2 |
['github-actions'] |
urkud assignee:urkud |
21-49252 21 days ago |
22-44420 22 days ago |
22-44170 22 days |
| 39279 |
jayscambler author:jayscambler |
feat(Cryptography/Sigma): Schnorr sigma protocol and signature scheme |
Adds `Mathlib/Cryptography/Sigma/Schnorr.lean`. New file in a new top-level directory; mathlib currently has no `Mathlib/Cryptography/`, so I've taken `Mathlib/Cryptography/Sigma/` as the natural home for sigma-protocol formalizations.
The file proves the three defining properties of Schnorr's identification scheme as a sigma protocol:
- `Schnorr.correct`: completeness. Honest verifier accepts honest signer's transcript.
- `Schnorr.specialSoundness`: from two accepting transcripts sharing the commitment but using different challenges `c, c'`, the witness `x = (s - s') / (c - c')` is recovered. Needs `q` prime so `c - c'` is invertible in `ZMod q`.
- `Schnorr.hvzkAccepts`: the HVZK simulator `g^s · (y^c)⁻¹` always yields accepting transcripts. This is the structural-correctness half of HVZK only; the distributional indistinguishability statement is a separate result and not in this PR.
On top of the sigma protocol there's `Schnorr.Signature.{keyGen, sign, verify, correct}` wrapping it as a Fiat-Shamir signature scheme; `Schnorr.Signature.correct` is a one-line corollary of `Schnorr.correct`.
Two auxiliary lemmas, `Schnorr.gpow_sub` and `Schnorr.gpow_mul`, bridge `ZMod q` arithmetic and group exponentiation under `Fintype.card G = q`. They're local to this file for now because the surrounding `gpow` API is itself cryptography-specific; if a general `ZMod q`-graded group action framework lands in mathlib later, both lemmas would become instances of it.
There's also a small `example` instantiating everything on `Multiplicative (ZMod q)` for `Fact q.Prime` to show the API typechecks. That instantiation is a toy (DLOG is trivial in that group), but it confirms the abstraction is usable.
**AI disclosure**: this PR was a collaboration between myself, Grey Haven's autocontext and Claude Opus 4.7 (Anthropic). I read each line and built locally on current master. (strawberry has three r's) |
new-contributor
LLM-generated
|
352/0 |
Mathlib.lean,Mathlib/Cryptography/Sigma/Schnorr.lean |
2 |
2 |
['github-actions'] |
nobody |
19-82267 19 days ago |
19-81671 19 days ago |
19-81421 19 days |
| 38114 |
javgomzar author:javgomzar |
feat(FinitelyPresentedGroup): add finite groups instance |
Add IsFinitelyPresented instance for finite groups.
Co-authored-by: Hang Lu Su , Thomas Browning
---
[](https://gitpod.io/from-referrer/)
|
t-group-theory
new-contributor
large-import
|
31/2 |
Mathlib/GroupTheory/FinitelyPresentedGroup.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean |
2 |
33 |
['github-actions', 'javgomzar', 'kbuzzard', 'mathlib-merge-conflicts', 'plp127', 'tb65536', 'vihdzp'] |
mattrobball assignee:mattrobball |
19-73877 19 days ago |
19-72001 19 days ago |
42-65930 42 days |
| 37928 |
AlexeyMilovanov author: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
maintainer-merge
|
87/67 |
Mathlib/Computability/Encoding.lean,Mathlib/ModelTheory/Encoding.lean |
2 |
9 |
['AlexeyMilovanov', 'dagurtomas', 'github-actions', 'vihdzp'] |
nobody |
19-53738 19 days ago |
26-18316 26 days ago |
51-82853 51 days |
| 39341 |
drocta author:drocta |
feat(Algebra/Colimit/DirectLimit): add DirectLimit.(NonUnital)StarAlgebra.(lift/of) maps and associated lemmas |
add the `of` and `lift` maps for `DirectLimit.StarAlgebra` and `DirectLimit.NonUnitalStarAlgebra`, as well as the associated lemmas, `of_f`, `lift_comp_of`, `lift_of`, and `hom_ext` for each. Also make `DirectLimit.NonUnitalAlgebra` only require `[Monoid R]` rather than `[CommSemiring R]`.
---
Use of AI: I again asked ChatGPT for some advice about some things about this code. I can personally vouch for all of the code I'm submitting, and that I understand all of it.
This is the third 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.Star.StarAlgHom` (because it needs `StarAlgHom` and `NonUnitalStarAlgHom`) replacing/encompassing the previously added imports of `Mathlib.Algebra.Star.StarRingHom` and `Mathlib.Algebra.Algebra.NonUnitalHom` (added in PR #38308 and #38672 respectively). |
t-algebra
new-contributor
label:t-algebra$ |
100/3 |
Mathlib/Algebra/Colimit/DirectLimit.lean |
1 |
2 |
['github-actions'] |
nobody |
19-48290 19 days ago |
19-47261 19 days ago |
19-48557 19 days |
| 39392 |
jayscambler author:jayscambler |
feat(Cryptography): one-time pad and Shannon perfect secrecy |
Adds `Mathlib/Cryptography/OTP.lean`. One-time pad over an arbitrary
finite abelian group `G`:
- `OTP.encrypt k m := m + k`, `OTP.decrypt k c := c - k`.
- `OTP.correct`: `decrypt k (encrypt k m) = m`, by `abel`.
- `OTP.perfect_secrecy`: for any `m₀, m₁`, the distributions of
`encrypt k m₀` and `encrypt k m₁` over uniform `k` are equal;
both reduce to `PMF.uniformOfFintype G`. Proof goes via
`Equiv.addLeft`.
Independent of the Schnorr PR (#39279); no shared definitions. Unlike
everything else likely to live under `Mathlib/Cryptography/`, the
security guarantee here is information-theoretic, not computational.
**AI disclosure**: this PR was a collaboration between myself, Grey
Haven's autocontext and Claude Opus 4.7 (Anthropic). I read each
line and built locally on current master. (strawberry has three r's) |
new-contributor
LLM-generated
|
76/0 |
Mathlib.lean,Mathlib/Cryptography/OTP.lean |
2 |
3 |
['MrBrain295', 'github-actions'] |
nobody |
18-44819 18 days ago |
18-66592 18 days ago |
18-66342 18 days |
| 37707 |
MavenRain author:MavenRain |
feat(Combinatorics/SimpleGraph): add IsMaximalClique/IsMaximalIndepSet, refactor IsMaximum* to MaximalFor |
Addresses #34962
|
new-contributor
t-combinatorics
|
63/31 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean |
1 |
6 |
['MavenRain', 'SnirBroshi', 'eric-wieser', 'github-actions'] |
nobody |
17-28542 17 days ago |
17-27959 17 days ago |
17-27709 17 days |
| 37720 |
cjrl author: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
|
19/0 |
Mathlib/Data/Finset/Card.lean,Mathlib/Data/Fintype/Card.lean |
2 |
10 |
['IvanRenison', 'cjrl', 'dagurtomas', 'ghseeli', 'github-actions'] |
nobody |
16-45522 16 days ago |
16-45522 16 days ago |
54-5231 54 days |
| 26479 |
thefundamentaltheor3m author: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
|
219/0 |
Mathlib/Analysis/Complex/CauchyIntegral.lean |
1 |
7 |
['github-actions', 'j-loreaux', 'loefflerd', 'mathlib4-merge-conflict-bot', 'thefundamentaltheor3m', 'wwylele'] |
urkud assignee:urkud |
15-36357 15 days ago |
15-36357 15 days ago |
49-46055 49 days |
| 35122 |
Marygold-Dusk author: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
---
Most of the design is analogues to immersions.
|
t-differential-geometry
new-contributor
|
642/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Submersion.lean,docs/references.bib |
3 |
54 |
['Marygold-Dusk', 'chrisflav', 'github-actions', 'grunweg'] |
PatrickMassot and grunweg assignee:grunweg assignee:PatrickMassot |
15-24545 15 days ago |
15-24545 15 days ago |
59-39431 59 days |
| 39269 |
godofecht author:godofecht |
feat(Algebra/Spectrum): add the second resolvent identity |
Adds `spectrum.resolvent_sub_resolvent`:
For `a b : A` in an `R`-algebra and `r` in the resolvent set of both,
`resolvent a r - resolvent b r = resolvent a r * (a - b) * resolvent b r`.
Companion to `spectrum.resolvent_eq`. |
t-algebra
new-contributor
label:t-algebra$ |
15/0 |
Mathlib/Algebra/Algebra/Spectrum/Basic.lean |
1 |
3 |
['github-actions', 'wwylele'] |
nobody |
14-80739 14 days ago |
14-79489 14 days ago |
20-63944 20 days |
| 39366 |
akiezun author:akiezun |
feat(Data/Nat): add prime divisibility for ascFactorial and choose |
Adds two prime-divisibility lemmas for natural-number factorial/binomial APIs.
The first characterizes when a prime divides an ascending factorial:
`Nat.Prime.dvd_ascFactorial_iff`.
The second applies this to binomial coefficients:
`Nat.Prime.dvd_choose_add_sub_one_iff`, using
`Nat.ascFactorial_eq_factorial_mul_choose'` and cancellation of the `n!` factor
when `n < p`.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
large-import
|
46/0 |
Mathlib.lean,Mathlib/Data/Nat/Choose/Consecutive.lean,Mathlib/Data/Nat/Factorial/BigOperators.lean |
3 |
9 |
['SnirBroshi', 'akiezun', 'github-actions', 'wwylele'] |
nobody |
14-73286 14 days ago |
14-74002 14 days ago |
18-80778 18 days |
| 29744 |
espottesmith author: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
|
398/0 |
Mathlib.lean,Mathlib/Combinatorics/DiHypergraph/Basic.lean |
2 |
4 |
['b-mehta', 'espottesmith', 'github-actions', 'mathlib4-merge-conflict-bot'] |
nobody |
14-50149 14 days ago |
23-18813 23 days ago |
117-84033 117 days |
| 39567 |
AlexBrodbelt author:AlexBrodbelt |
feat(Mathlib/Data/Finite/Option): option type is finite iff type is finite |
Option type is finite if and only if the type is finite.
This is an intermediate result to proving that if the `GroupWithZero` is (in)finite then the `Units` are (in)finite.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
25/0 |
Mathlib.lean,Mathlib/Data/Finite/Option.lean |
2 |
11 |
['AlexBrodbelt', 'github-actions', 'plp127', 'themathqueen'] |
nobody |
14-1421 14 days ago |
14-843 14 days ago |
14-15302 14 days |
| 37350 |
aditya-ramabadran author: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
|
225/0 |
Mathlib.lean,Mathlib/Analysis/Distribution/TestFunctionSchwartz.lean |
2 |
24 |
['aditya-ramabadran', 'github-actions', 'j-loreaux'] |
ADedecker and mcdoll assignee:mcdoll assignee:ADedecker |
13-79780 13 days ago |
19-77874 19 days ago |
51-73256 51 days |
| 34713 |
dennj author: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. |
new-contributor
t-measure-probability
|
166/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Stochastic.lean,Mathlib/Probability/Markov/Stationary.lean |
3 |
17 |
['EtienneC30', 'dennj', 'dupuisf', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-merge-conflicts', 'riccardobrasca'] |
kex-y assignee:kex-y |
13-48614 13 days ago |
20-79874 20 days ago |
47-727 47 days |
| 38014 |
cduenasnavarro author: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
|
181/0 |
Mathlib.lean,Mathlib/InformationTheory/Coding/LinearCode.lean |
2 |
37 |
['cduenasnavarro', 'github-actions', 'linesthatinterlace', 'rkirov', 'vihdzp', 'wwylele'] |
kex-y assignee:kex-y |
13-48610 13 days ago |
17-8746 17 days ago |
49-62203 49 days |
| 39384 |
EngelsVon author:EngelsVon |
feat(Analysis/Calculus/DifferentialForm): Stokes' theorem on rectangular boxes |
## Summary
This PR proves the generalized Stokes theorem for differential forms on rectangular boxes $[a, b] \subset \mathbb{R}^{m+1}$.
The proof strategy is:
1. Extract the `i`-th signed face component `boxFaceComponent ω i` from an `m`-form `ω` — a scalar function whose divergence equals the top-form density of the exterior derivative `dω`.
2. Apply Mathlib's existing divergence theorem for boxes (`integral_divergence_of_hasFDerivAt_off_countable'`).
This gives a genuine proved Stokes formula in the Euclidean setting, complementing the existing infrastructure for differential forms.
## Main definitions
- `DifferentialForm.topFormDensity`: density function of a top-form field
- `DifferentialForm.boxFaceComponent`: the `i`-th signed face component of an `m`-form on `ℝ^(m+1)`
- `DifferentialForm.boxBoundaryIntegral`: the signed boundary integral over `∂[a,b]`
## Main results
- `box_stokes_of_hasFDerivAt`: Stokes' theorem on boxes with pointwise differentiability hypotheses
- `box_stokes_of_contDiff`: a convenient `C¹` formulation
|
t-analysis
new-contributor
|
314/0 |
Mathlib.lean,Mathlib/Analysis/Calculus/DifferentialForm/BoxStokes.lean |
2 |
2 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
13-48601 13 days ago |
18-74965 18 days ago |
18-74715 18 days |
| 39389 |
i-love-lean author:i-love-lean |
feat(Analysis/SpecialFunctions): homeomorphism for spherical coordinates |
A few months ago, I noticed that mathlib was missing change of variables to spherical coordinates, which is taught in undergraduate calculus and useful for many 3D integrals. So far, I used `PolarCoord.lean` as reference and implemented a similar homeomorphism for spherical coordinates. There's still a lot of work left to prove an analog of `integral_comp_polarCoord_symm` but for spherical coordinates, so I'm splitting up the work into several PRs. I also fixed a typo in `PolarCoord.lean`. |
t-analysis
new-contributor
|
133/2 |
Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Complex/Arg.lean,Mathlib/Analysis/SpecialFunctions/PolarCoord.lean,Mathlib/Analysis/SpecialFunctions/SphericalCoord.lean |
4 |
4 |
['github-actions', 'i-love-lean', 'wwylele'] |
j-loreaux assignee:j-loreaux |
13-48600 13 days ago |
18-66045 18 days ago |
18-65795 18 days |
| 39406 |
roos-j author:roos-j |
feat(Analysis): van der Corput's lemma |
Adds van der Corput's lemma on one-dimensional oscillatory integrals, a standard tool in harmonic analysis.
Co-authored-by: Manasa Praveen
---
From https://github.com/roos-j/lean-oscillatory, see there for future plans
Zulip discussion [#mathlib4 > Oscillatory integrals in Lean](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Oscillatory.20integrals.20in.20Lean/with/584786060)
AI disclosure: The code in this PR was predominantly human-written. gpt-5.5 has helped in the later stages with shortening proofs, golfing and general advice.
|
t-analysis
new-contributor
|
551/0 |
Mathlib.lean,Mathlib/Analysis/OscillatoryIntegrals/VanDerCorput.lean |
2 |
2 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
13-48598 13 days ago |
18-7077 18 days ago |
18-6827 18 days |
| 39605 |
Qinghev author:Qinghev |
Add docstrings for reversed range telescoping lemmas |
This PR adds docstrings for two existing Finset telescoping lemmas and their additive versions generated by `to_additive`:
* `Finset.prod_range_div'` / `Finset.sum_range_sub'`
* `Finset.eq_prod_range_div` / `Finset.eq_sum_range_sub`
The goal is a small documentation-only contribution that makes the reversed range telescoping API easier to discover from search and hover docs.
Local checks:
* `git diff --check -- Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean`
* Attempted `lake env lean Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean`, but local validation is currently blocked by downloading the `leanprover/lean4:v4.30.0-rc2` toolchain from GitHub timing out/connection-resetting on this machine.
Opened as draft until the toolchain/network check can be completed or CI confirms the documentation-only change.
|
t-algebra
new-contributor
label:t-algebra$ |
8/2 |
Mathlib/Algebra/BigOperators/Group/Finset/Basic.lean |
1 |
2 |
['github-actions'] |
nobody |
13-11703 13 days ago |
13-11703 13 days ago |
13-11453 13 days |
| 39332 |
Michaillus author:Michaillus |
chore(Topology/Spectral): Added two small lemmas |
chore(Topology/Spectral): Added two lemmas
`IsCompact.isClosed_constructibleTopology_of_isOpen`
`IsCompact.isClosed_constructibleTopology_of_isClosed`
---
[](https://gitpod.io/from-referrer/)
|
t-topology
new-contributor
|
12/0 |
Mathlib/Topology/Spectral/ConstructibleTopology.lean |
1 |
7 |
['Michaillus', 'github-actions', 'plp127', 'qawbecrdtey'] |
PatrickMassot assignee:PatrickMassot |
13-8197 13 days ago |
19-61927 19 days ago |
19-61677 19 days |
| 39225 |
junodeveloper author:junodeveloper |
feat(SimpleGraph): add no-bridge theorem for even degree graphs |
This PR proves that a finite graph in which every vertex has even degree has no bridge.
It adds:
* `SimpleGraph.not_isBridge_of_even_degree`
The proof argues by contradiction: if an edge is a bridge, delete it and look at the connected component containing one endpoint. In that component, the endpoint has odd degree, while any other odd-degree vertex would contradict the bridge assumption and the even-degree hypothesis. This contradicts the handshaking lemma via the existing odd-degree API.
Local checks:
```bash
lake build Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
lake exe lint-style Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
lake exe runLinter Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity
```
## AI usage disclosure
I used OpenClaw/Codex while developing this PR. Much of the Lean proof of `not_isBridge_of_even_degree` was drafted with AI assistance, including API search and proof refactoring. I reviewed the generated code, made edits, ran the local checks above, and understand and take responsibility for the final statement and proof. |
t-combinatorics
new-contributor
large-import
LLM-generated
|
122/0 |
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean |
1 |
12 |
['Rida-Hamadani', 'SnirBroshi', 'github-actions', 'junodeveloper', 'linesthatinterlace'] |
nobody |
13-2968 13 days ago |
13-46328 13 days ago |
21-55749 21 days |
| 39607 |
TentativeConvert author:TentativeConvert |
feat(Algebra/DirectSum): equivalence between direct sum indexed by ι₁ and double sum indexed by ι₂ and fibres of f : ι₁ → ι₂ |
1. Add variant `equivCongrLeft'` of `equivCongrLeft`, and corresponding `…_apply` lemma.
2. Add `…_of lemmas` for both `equivCongrLeft` and `equivCongrLeft'`.
3. Add `…of lemma` for `sigmaCurry`, i.e. `sigmaCurry_of`.
4. Add `sigmaFiberAddEquiv`: the equivalence between a direct sum indexed by a type `ι₁` and the double sum indexed by a type `ι₂` and the fibres of a map `f : ι₁ → ι₂`. Add two `…_apply` lemmas and an `…_of` lemma.
---
This is supposed to be a first step towards merging the draft PR #39356.
re 1: Mathematically, I don't see why one version should be preferred over the other, but I found the existing `equivCongrLeft` more difficult to work with when the equivalence `h : ι ≃ κ` is naturally given in the opposite direction. (I could not avoid explicit type casts through the equality `h.symm.symm = h` when defining `sigmaFiberAddEquiv` in terms of `equivCongrLeft`.)
Very unsure about the name of `equivCongrLeft'`. (I see that the name `equivCongrLeft` was chosen in analogy with `Equiv.piCongrLeft`. `Equiv.piCongrRight` looks very different, so presumably `equivCongrLeft'` should *not* be called `equivCongrRight`.)
re 4: Very unsure about the naming of the two different `…_apply` lemmas; called them `…_apply` and `…_apply'` for now. The second (`…_apply'`) cannot be a `simp` lemma as it would prevent the first (`…_apply`) from firing.
I've used Claude Opus for understanding error messages and git interaction, but everything is hand coded.
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
66/1 |
Mathlib/Algebra/DirectSum/Basic.lean |
1 |
3 |
['github-actions'] |
nobody |
13-2238 13 days ago |
13-12971 13 days ago |
13-12721 13 days |
| 33714 |
idontgetoutmuch author: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'] |
nobody |
12-50147 12 days ago |
44-2639 44 days ago |
89-9372 89 days |
| 39474 |
emlis42 author:emlis42 |
feat(Topology/Separation/Hausdorff): add `Filter.limUnder_congr` |
This PR adds `Filter.limUnder_congr` and some lemmas about `limUnder`.
`Filter.limUnder_congr` allows rewriting `limUnder` expressions using equivalences of convergence behavior, without proving the filters actually converge, allowing convergence proofs to be carried out on more convenient expressions latter. |
t-topology
new-contributor
large-import
|
24/1 |
Mathlib/Order/Filter/AtTopBot/Archimedean.lean,Mathlib/Topology/Separation/Hausdorff.lean |
2 |
2 |
['github-actions'] |
PatrickMassot assignee:PatrickMassot |
12-48559 12 days ago |
16-68104 16 days ago |
16-67854 16 days |
| 38319 |
Zetetic-Dhruv author: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
|
199/0 |
Mathlib.lean,Mathlib/Combinatorics/SetFamily/DualVC.lean,docs/references.bib |
3 |
37 |
['Shreyas4991', 'YaelDillies', 'Zetetic-Dhruv', 'github-actions'] |
nobody |
11-80534 11 days ago |
22-19428 22 days ago |
40-14872 40 days |
| 36667 |
NoneMore author: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'] |
nobody |
11-50146 11 days ago |
47-21683 47 days ago |
79-31928 79 days |
| 39687 |
TentativeConvert author:TentativeConvert |
feat(Algebra/Group/Submonoid): type class to indicate that supremum in a SubmonoidClass agrees with supremum of submonoids |
Add a type class `SubmonoidClass.IsConcreteSSup` to indicate that the canonical map `.ofClass` from a class `S` of submonoids of `M` to `Submonoid M` preserves suprema.
---
This PR implements the minimal type class assumption needed to make „pushfoward of gradings along maps of indexing sets“ – see draft PR #39356 – work in some `SetLike` generality.
Given `{S M : Type*} [SetLike S M] [Monoid M] [SubmonoidClass S M]`, we have canonical maps
```
S → Submonoid M → Set M
```
The first is `Submonoid.ofClass`, the second and the composition are `coe` maps coming from the `SetLike` structures. Depending on `S`, these maps may or may not satisfy various properties with respect the lattice structures on `Submonoid M` and `Set M`. Mathlib so far includes the type class `[IsConcreteLE S M]`, which asserts that the composition `S → Set M` is order-preserving and order-reflecting. The type class defined here asserts that the first map, `S → Submonoid M`, preserves suprema.
In examples such as `S = Subgroup M`, `S = Submodule R M`, much more is true – in these cases, `S` is a complete sublattice of `Submonoid M`. But there are also examples where only the weaker property defined here holds, e.g. `S = OpenSubgroup M` for a topological group `M`.
Note on `outParam`: I did *not* write `(M : outParam Type*)` in the assumptions of `SubmonoidClass.IsConcreteSSup` in accordance with the [DocString of `Setlike`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/SetLike/Basic.html#SetLike). However, we do have `(B : outParam Type*)` in the definition of `IsConcreteLE`, so perhaps I'm misinterpreting the DocString.
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
label:t-algebra$ |
56/0 |
Mathlib.lean,Mathlib/Algebra/Group/Submonoid/SSup.lean |
2 |
2 |
['github-actions'] |
nobody |
11-18540 11 days ago |
11-17904 11 days ago |
11-17654 11 days |
| 37718 |
SabrinaJewson author: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.
The design is modelled closely after [`Init.Data.Order.PackageFactories`](https://leanprover-community.github.io/mathlib4_docs/Init/Data/Order/PackageFactories.html) (`Std.PreorderPackage` is equivalent-ish to Mathlib’s `Preorder`, and same for partial and linear orders). The `OfStdArgs` types allow conveniently bundling a whole bunch of default arguments together in a way that allows one default argument set to `extends` another.
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
maintainer-merge
|
391/0 |
Mathlib.lean,Mathlib/Order/Std.lean,MathlibTest/OrderOfStd.lean |
3 |
9 |
['SabrinaJewson', 'YaelDillies', 'github-actions'] |
YaelDillies assignee:YaelDillies |
10-65257 10 days ago |
10-75361 10 days ago |
56-47963 56 days |
| 39697 |
sorrachai author:sorrachai |
feat(Data/Tree/Basic): add Membership instance, new notation, rename Tree |
Summary:
1. [Rename]([#CSLib > Splay tree PR: BinaryTree vs Tree @ 💬](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Splay.20tree.20PR.3A.20BinaryTree.20vs.20Tree/near/596482765)) from Tree to BinaryTree, which propagates the changes to other files that use it.
2. Add membership instance, prove decidability of membership.
3. Add toListInOrder, toListPreOrder, toListPostOrder
Suggestion based on the discussion in the cslib [thread](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Splay.20tree.20PR/near/596568391)[#CSLib > Splay tree PR @ 💬](https://leanprover.zulipchat.com/#narrow/channel/513188-CSLib/topic/Splay.20tree.20PR/near/596568391).
---
* depends on: #39707 |
new-contributor |
187/75 |
Mathlib/Combinatorics/Enumerative/Catalan/Tree.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Data/Tree/Basic.lean,Mathlib/Data/Tree/Get.lean,Mathlib/Data/Tree/Traversable.lean,Mathlib/Tactic/CancelDenoms/Core.lean,docs/overview.yaml |
7 |
4 |
['eric-wieser', 'github-actions', 'sorrachai'] |
nobody |
10-58272 10 days ago |
11-2717 11 days ago |
11-2467 11 days |
| 35069 |
A-M-Berns author: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'] |
nobody |
10-50149 10 days ago |
96-68664 96 days ago |
99-17409 99 days |
| 35402 |
samueloettl author: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 |
26 |
['Maldooor', 'github-actions', 'lua-vr', 'mcdoll', 'samueloettl'] |
sgouezel assignee:sgouezel |
10-48975 10 days ago |
29-2208 29 days ago |
99-82756 99 days |
| 39518 |
abeldonate author:abeldonate |
feat(RingTheory/LocalProperties/Projective): Projective Module theorem |
Theorem: R Noetherian, M finitely generated R-Mod. Then:
M projective iff M_m free for all m maximal
|
t-ring-theory
new-contributor
large-import
|
21/0 |
Mathlib/RingTheory/LocalProperties/Projective.lean |
1 |
9 |
['abeldonate', 'github-actions', 'mbkybky', 'vlad902'] |
nobody |
10-24664 10 days ago |
10-24012 10 days ago |
14-42206 14 days |
| 39530 |
RaggedR author:RaggedR |
feat(Combinatorics/SimpleGraph): group actions on simple graphs |
This adds the first connection between Mathlib's MulAction and SimpleGraph libraries. The GraphAction class asserts that a group action on the vertex type preserves the adjacency relation, and builds on it to define vertex-transitivity and arc-transitivity for graphs.
The GraphAction typeclass gives adj_smul_iff (the biconditional for group actions) and toIso (each group element induces a graph automorphism). The IsVertexTransitive class combines GraphAction with IsPretransitive, and IsArcTransitive requires transitivity on ordered adjacent pairs (arcs).
The main theorem is the standard characterization: a graph is arc-transitive if and only if it is vertex-transitive and locally transitive (the stabilizer of each vertex acts transitively on its neighbors). The forward direction is proved directly by composing a vertex-transporting element with a neighbor-transporting stabilizer element. The reverse direction shows that an arc-transitive graph with no isolated vertices is vertex-transitive.
These definitions are the algebraic graph theory prerequisites for formalizing coset graphs (Sabidussi's construction) and the characterization of symmetric graphs via double cosets and involutions (Lorimer's theorem).
---
LLM tools were used to assist with Lean formalization. The mathematical content is the author's own work. |
t-combinatorics
new-contributor
LLM-generated
|
130/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Action.lean |
2 |
7 |
['RaggedR', 'b-mehta', 'github-actions', 'mathlib-bors'] |
nobody |
10-14032 10 days ago |
10-14032 10 days ago |
14-67671 14 days |
| 38194 |
ryanncode author: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
label:t-algebra$ |
47/0 |
Mathlib.lean,Mathlib/LinearAlgebra/BilinearForm/IndefiniteMetric.lean |
2 |
5 |
['dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'ryanncode'] |
nobody |
10-6232 10 days ago |
10-5650 10 days ago |
13-80182 13 days |
| 39212 |
emlis42 author:emlis42 |
feat(Algebra/ContinuedFractions): add `partNums!` and `partDens!` |
This PR adds `partNums!` and `partDens!`, which provide infinite stream representations for the sequences of partial numerators and denominators of a generalized continued fraction. |
t-algebra
new-contributor
label:t-algebra$ |
8/0 |
Mathlib/Algebra/ContinuedFractions/Basic.lean |
1 |
4 |
['emlis42', 'github-actions', 'grunweg'] |
nobody |
9-77172 9 days ago |
9-76518 9 days ago |
21-77317 21 days |
| 37716 |
slavanaprienko author: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
label:t-algebra$ |
217/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Determinant/DesnanotJacobi.lean |
2 |
13 |
['SnirBroshi', 'github-actions', 'grunweg', 'kim-em', 'slavanaprienko'] |
nobody |
9-57681 9 days ago |
9-57105 9 days ago |
23-15493 23 days |
| 35753 |
Vilin97 author: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
maintainer-merge
|
201/0 |
Mathlib.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean |
2 |
59 |
['Vilin97', 'YanYablonovskiy', 'adomani', 'botbaki-review', 'copilot-pull-request-reviewer', 'dagurtomas', 'eric-wieser', 'github-actions', 'grunweg', 'j-loreaux', 'mathlib-dependent-issues', 'wwylele'] |
ADedecker assignee:ADedecker |
9-48642 9 days ago |
31-60225 31 days ago |
64-13935 64 days |
| 39436 |
dtumad author:dtumad |
chore: Add `seqLeft` and `seqRight` unfolding to monad_norm simp set |
This PR adds `seqLeft_eq_bind` and `seqRight_eq_bind` to `monad_norm`, so that `<*` and `*>` get unfolded in the same way as `<*>` already does when using the `simp` set.
---
[](https://gitpod.io/from-referrer/)
|
t-meta
new-contributor
|
1/1 |
Mathlib/Tactic/Attr/Core.lean |
1 |
2 |
['github-actions'] |
dwrensha assignee:dwrensha |
8-49691 8 days ago |
8-46188 8 days ago |
17-55888 17 days |
| 38214 |
emlis42 author: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
label:t-algebra$ |
262/0 |
Mathlib.lean,Mathlib/Algebra/ContinuedFractions/Euler.lean |
2 |
15 |
['github-actions', 'mathlib-bors', 'wwylele'] |
alreadydone assignee:alreadydone |
8-48530 8 days ago |
39-76665 39 days ago |
39-78759 39 days |
| 39256 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): add monotonicity lemma for LanguageOn |
In Symbolic dynamics.
Proof that the language of a set of configurations is monotone with respect to inclusion of configuration sets:
X ⊆ Y → LanguageOn X U ⊆ LanguageOn Y U
The proof is a direct unfolding of definitions: a pattern in the language of X comes from restricting some configuration x ∈ X, and inclusion X ⊆ Y allows the same witness to be used for Y.
Related to issue #39252 |
t-dynamics
new-contributor
|
9/1 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
3 |
['github-actions'] |
ADedecker assignee:ADedecker |
8-48529 8 days ago |
20-85922 20 days ago |
20-85697 20 days |
| 38669 |
dannyply author: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
|
130/16 |
Mathlib/Analysis/SpecialFunctions/Complex/Circle.lean,Mathlib/Topology/Algebra/PontryaginDual.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean |
3 |
30 |
['dannyply', 'github-actions', 'j-loreaux', 'tb65536'] |
j-loreaux assignee:j-loreaux |
8-8263 8 days ago |
8-8263 8 days ago |
8-81558 8 days |
| 39820 |
samuelchassot author:samuelchassot |
Add proof of the existence of an Eulerian walk if all vertices have even degree or if exactly vertices have odd degree |
As per the TODO open in `Trails.lean`.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
671/3 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Eulerian.lean,Mathlib/Combinatorics/SimpleGraph/Trails.lean |
3 |
8 |
['SnirBroshi', 'copilot-pull-request-reviewer', 'github-actions'] |
nobody |
8-7105 8 days ago |
8-7498 8 days ago |
8-7248 8 days |
| 39505 |
dannyhe652 author:dannyhe652 |
feat(SimpleGraph): add Vizing's theorem for edge coloring |
Hi! I'm a high school student interested in formulization of mathematics in Lean. Recently, I have worked on a project to formulize Vizing Theorem with Daniel Raggi from Cambridge University with AI assistance. In particular, we first drafted an outline for the proof, and built the proof using Claude Opus 4.5 and 4.6. The proof is optimized using Aristotle and finally reviewed by ourselves. We rewrote some parts of the code and some comments. The code now builds cleanly and we wish this code to be reviewed by Lean Community. I am aware that there are previous attempts, some being successful, on formulizing Vizing Theorem, including this one by Arohee https://github.com/aroheebhoja/vizing. However, I believe that no PR have been made. Our proof is not based on his proof, but it could be helpful for the community to review that project as well. I sincerely thank everyone who has time to verify and review our code. A summary of the project is as follows. Please contact me if there are any questions or problems.
## Summary
This PR completes the proof of **Vizing's theorem** for edge coloring in simple graphs, proving that the chromatic index of any graph is either Δ (the maximum degree) or Δ + 1.
## Changes
### New files
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/EdgeColoring.lean`** — Core definitions
- `edgeColoring`: Type for line graph colorings
- `edgeColorable`: Graph is edge-colorable with n colors
- `chromaticIndex`: Chromatic index as ℕ
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/KempeChain.lean`** — Kempe Chain
- Coloring observables: `incidentEdges`, `incidentColors`, `missingColors`
- Kempe subgraph structure with bounded degree
- `swapKempe`: Recolor edges in a connected component via color-swapping
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/VizingFan.lean`** — Vizing Fan Rotation
- `IsFan`: Vizing fan structure with special color properties
- Fan maximality and dichotomy on terminal vertices
- `rotate_termA`: Extend coloring when a free color exists at both endpoints
- `vizingAdjacencyLemma`: Main adjacency lemma for both cases
- **`Mathlib/Combinatorics/SimpleGraph/Coloring/VizingTheorem.lean`** — Main theorems
- `edge_eq_of_color_eq`: Proper edge colorings assign different colors to distinct edges sharing a vertex
- `maxDegree_le_chromaticIndex`: χ'(G) ≥ Δ(G)
- `chromaticIndex_bot`: Empty graph has chromatic index 0
- `vizingUpperBound_aux`: Inductive proof of upper bound on number of edge
- `vizingTheorem`: χ'(G) ∈ {Δ(G), Δ(G) + 1}
### Modified files
- `Mathlib.lean` — Added imports for the four new coloring modules
## Technical Approach
**Lower bound** (χ'(G) ≥ Δ):
- Edges incident to a max-degree vertex form a clique in the line graph
- Clique number lower-bounds chromatic number
**Upper bound** (χ'(G) ≤ Δ + 1):
- Induction on the number of edges
- Base case: empty graph colored with 0 colors
- Inductive step:
- If a free color exists at both endpoints of an edge, then extend directly
- Otherwise:
- Build a maximal fan from one endpoint
- Apply dichotomy: either extend via Term-A (free color at both endpoints) or Term-B (Kempe swap)
- Term-B uses a three-vertex connectivity argument to derive a contradiction, forcing the fan to extend
## Key Lemmas
- `incidentEdges`, `incidentColors`, `missingColors`: Coloring observables at vertices
- `kempeSubgraph`: Restricted subgraph of edges with two specific colors
- `swapKempe`: Recolor via Kempe chain swapping
- `IsFan.singleton`: Trivial fan always valid
- `IsFan.length_le_card`: Fan length is bounded by vertex count
- `IsFan.dichotomy`: Maximal fan satisfies Term-A or Term-B
- `IsFan.rotate_termA`: Term-A case extends the coloring inductively
- `vizingAdjacencyLemma`: Handles both cases for extending one edge
- `vizingUpperBound_aux`: Framework for full inductive proof
- `edge_eq_of_color_eq`: Distinctness of edges with same color
## Testing
All four modules compile with no `sorry` nor errors or warnings.
## References
* V. G. Vizing, *On an estimate of the chromatic class of a p-graph*,
Diskret. Analiz. 3 (1964), 25–30.
## Co-authors
Co-authored-by: Daniel Raggi
Co-authored-by: Aristotle (Harmonic)
Co-authored-by: Claude Opus 4.5 & 4.6
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
LLM-generated
|
1915/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/EdgeColoring.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/KempeChain.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VizingFan.lean,Mathlib/Combinatorics/SimpleGraph/Coloring/VizingTheorem.lean |
5 |
3 |
['github-actions'] |
nobody |
7-52650 7 days ago |
7-52082 7 days ago |
15-52781 15 days |
| 39722 |
kg583 author:kg583 |
feat(Combinatorics): Link `Nat.Partition` to `YoungDiagram` |
---
AI disclosure: Claude was used to source some proof sketches.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
large-import
|
120/4 |
Mathlib.lean,Mathlib/Combinatorics/Enumerative/Partition/Basic.lean,Mathlib/Combinatorics/Enumerative/Partition/Conjugate.lean,Mathlib/Combinatorics/Young/YoungDiagram.lean |
4 |
36 |
['NoahW314', 'github-actions', 'kg583', 'wwylele'] |
nobody |
7-42131 7 days ago |
8-67394 8 days ago |
10-57258 10 days |
| 38275 |
TTony2019 author: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
|
283/41 |
Mathlib/Analysis/Convex/Intrinsic.lean,Mathlib/Analysis/Normed/Module/FiniteDimension.lean,Mathlib/LinearAlgebra/AffineSpace/Restrict.lean,Mathlib/Topology/Algebra/AffineSubspace.lean,Mathlib/Topology/Homeomorph/Defs.lean |
5 |
29 |
['TTony2019', 'github-actions', 'imathwy', 'j-loreaux', 'themathqueen'] |
j-loreaux assignee:j-loreaux |
7-23557 7 days ago |
7-23557 7 days ago |
24-11084 24 days |
| 39864 |
8e7 author:8e7 |
feat(Combinatorics/SimpleGraph/Acyclic): helly property on subtrees |
This PR adds several lemmas regarding connected subsets of vertices in trees (subtrees). The main result is the Helly property for subtrees: For a finite set of subtrees, if any pair of subtrees intersect, then there is a common vertex in all subtrees.
This lemma is part of an effort to formalize tree decompositions (see #38334), and will be used in a future PR to prove `G.cliqueNum - 1 <= G.treeWidth`.
AI Usage: The proofs were developed with the help of Claude Code. I vouch for all the code written and understand the content fully.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
LLM-generated
|
114/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean |
2 |
2 |
['github-actions'] |
nobody |
6-85025 6 days ago |
7-19494 7 days ago |
7-19244 7 days |
| 37062 |
tannerduve author: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 assignee:Komyyy |
6-49973 6 days ago |
49-63788 49 days ago |
50-53886 50 days |
| 39369 |
pd4st8hb95-hub author:pd4st8hb95-hub |
feat: add basic fuzzy set definitions |
This PR adds a minimal `FuzzySet` API in `Mathlib/Order/FuzzySet`.
A fuzzy set is represented as an abbreviation:
`FuzzySet α L := α → L`
The file provides basic definitions and lemmas:
- `degree`
- `support`
- `core`
- `weakCut`
- `strongCut`
- membership simp lemmas
- extensionality
- basic monotonicity lemmas for weak and strong cuts
This PR intentionally does not add complement, union/intersection-specific API, normal or convex fuzzy sets, fuzzy relations, or advanced fuzzy set theory.
Validation:
- `lake build Mathlib.Order.FuzzySet`
- `#lint only docBlame docBlameThm`
Feedback on whether `Mathlib/Order/FuzzySet.lean` is the right location for this minimal API would be appreciated.
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
169/0 |
Mathlib.lean,Mathlib/Order/FuzzySet.lean |
2 |
6 |
['github-actions', 'grunweg', 'pd4st8hb95-hub', 'wwylele'] |
nobody |
6-6278 6 days ago |
6-5597 6 days ago |
16-85338 16 days |
| 37071 |
ericluap author:ericluap |
feat: Dedekind completion of rationals is isomorphic to EReal |
|
t-order
new-contributor
|
128/4 |
Mathlib.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Data/EReal/DedekindCut.lean,Mathlib/Order/Completion.lean |
4 |
59 |
['ericluap', 'github-actions', 'plp127', 'vihdzp', 'wwylele'] |
vihdzp assignee:vihdzp |
5-70821 5 days ago |
21-81979 21 days ago |
44-72953 44 days |
| 39865 |
eliasjudin author:eliasjudin |
feat(Algebra): add eval API parity lemmas |
Adds two eval API parity lemmas from #23044: `MvPolynomial.hom_eval₂`, parallel to `Polynomial.hom_eval₂`, and `Polynomial.eval₂RingHom_comp_C`, parallel to `MvPolynomial.eval₂Hom_comp_C`.
This addresses the eval portion of #23044; the degree-name discussion there is left for separate work.
|
t-algebra
new-contributor
label:t-algebra$ |
10/0 |
Mathlib/Algebra/MvPolynomial/Eval.lean,Mathlib/Algebra/Polynomial/Eval/Defs.lean |
2 |
2 |
['github-actions'] |
nobody |
5-65891 5 days ago |
7-21411 7 days ago |
7-21161 7 days |
| 37714 |
mortarsanjaya author: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
label:t-algebra$ |
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'] |
riccardobrasca assignee:riccardobrasca |
5-49000 5 days ago |
32-9520 32 days ago |
56-3387 56 days |
| 38049 |
WilliamCoram author: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'] |
riccardobrasca assignee:riccardobrasca |
5-48998 5 days ago |
45-68151 45 days ago |
48-77068 48 days |
| 39294 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): prove LanguageOn monotonicity under intersection |
In symbolic dynamics.
This PR proves that taking the language over a finite shape is monotone with respect to intersections of configuration sets:
```math
\mathrm{LanguageOn}(X \cap Y)\, U
\subseteq
\mathrm{LanguageOn}\, X\, U \cap \mathrm{LanguageOn}\, Y\, U
```
The proof is a direct unfolding of definitions: a pattern in the language of `X ∩ Y` comes from restricting a configuration `x ∈ X ∩ Y`. Since such an `x` belongs simultaneously to `X` and `Y`, the same restriction witness gives membership both in `LanguageOn X U` and in `LanguageOn Y U`, yielding membership in their intersection.
Related to issue #39252 |
t-dynamics
new-contributor
|
9/1 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
2 |
['github-actions'] |
ADedecker assignee:ADedecker |
5-48992 5 days ago |
20-16885 20 days ago |
20-16635 20 days |
| 39903 |
akiezun author:akiezun |
feat(NumberTheory): add almost prime numbers |
Adds Nat.IsAlmostPrime k n for natural numbers with exactly k prime factors counted with multiplicity, plus
Nat.IsAtMostAlmostPrime and Nat.IsSemiprime. The definitions reuse the existing arithmetic function Ω, and the initial
API proves the basic zero/one cases, prime examples, and closure under multiplication.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-number-theory
|
87/0 |
Mathlib.lean,Mathlib/NumberTheory/AlmostPrime.lean |
2 |
5 |
['SnirBroshi', 'akiezun', 'github-actions', 'vihdzp'] |
loefflerd assignee:loefflerd |
5-48985 5 days ago |
6-49822 6 days ago |
6-49572 6 days |
| 37374 |
NoneMore author: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 |
7 |
['NoneMore', 'github-actions', 'plp127', 'vihdzp'] |
fpvandoorn assignee:fpvandoorn |
5-29706 5 days ago |
5-28990 5 days ago |
62-76175 62 days |
| 38596 |
JJYYY-JJY author:JJYYY-JJY |
Add basic row-equivalence and echelon-form API for matrices |
This PR adds the first foundational slice of `Mathlib.LinearAlgebra.Matrix.Echelon`, a theorem-oriented API for elementary row operations, row-equivalence, and echelon-form predicates for matrices.
The main additions are:
* elementary row-scaling matrices and their `GL` versions;
* `Matrix.RowEquivalent` for the left action of `GL m R` on rectangular matrices;
* row-zero, pivot, echelon, and reduced-echelon predicates;
* semantic representative predicates `Matrix.IsEchelonFormOf` and `Matrix.IsReducedEchelonFormOf`.
This intentionally stops before row-space characterizations, existence and uniqueness of reduced echelon representatives, and the noncomputable canonical representative `Matrix.rref`; those are planned for later PRs.
Co-authored-by: Joseph Qian
Co-authored-by: Veer Shukla
Co-authored-by: Dhruv Bhatia
Co-authored-by: Zheng Wu <1036819072@qq.com>
---
This update trims the original full row-reduction API in response to reviewer feedback that the PR was too large. It keeps only the foundation needed by later row-reduction and `rref` PRs. |
t-algebra
new-contributor
label:t-algebra$ |
312/6 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/Echelon.lean,Mathlib/LinearAlgebra/Matrix/Transvection.lean |
3 |
10 |
['JJYYY-JJY', 'SnirBroshi', 'copilot-pull-request-reviewer', 'dagurtomas', 'github-actions', 'wwylele'] |
nobody |
5-29169 5 days ago |
19-51357 19 days ago |
27-28219 27 days |
| 39841 |
hawkrobe author:hawkrobe |
feat(RingTheory/HopfAlgebra): Construction on primitive elements |
Adds `HopfAlgebra.ofPrimitives` which builds a Hopf algebra structure on a bialgebra generated by primitive elements, given a candidate anti-algebra hom that sends each generator to its negation.
---
The commutative case with `.ofAlgHom` gets this for free via `ext` but the non-commutative case needs extra work.
* [ ] depends on: #39785 |
t-ring-theory
new-contributor
|
314/20 |
Mathlib.lean,Mathlib/RingTheory/Bialgebra/Primitive.lean,Mathlib/RingTheory/HopfAlgebra/Basic.lean,Mathlib/RingTheory/HopfAlgebra/Generators.lean,Mathlib/RingTheory/HopfAlgebra/Primitive.lean,Mathlib/RingTheory/HopfAlgebra/TensorProduct.lean |
6 |
2 |
['github-actions'] |
nobody |
5-26304 5 days ago |
5-65422 5 days ago |
7-58447 7 days |
| 39707 |
sorrachai author:sorrachai |
chore(Data/Tree/Basic): Rename Tree to BinaryTree |
Rename `Tree` to `BinaryTree`.
This frees up the name `Tree` to cover n-ary trees in future.
We only deprecate the `def`s, and move the theorems without deprecation. |
new-contributor
t-data
|
157/62 |
Mathlib/Combinatorics/Enumerative/Catalan/Tree.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Data/Tree/Basic.lean,Mathlib/Data/Tree/Get.lean,Mathlib/Data/Tree/Traversable.lean,Mathlib/Tactic/CancelDenoms/Core.lean,docs/overview.yaml |
7 |
36 |
['b-mehta', 'eric-wieser', 'github-actions', 'sorrachai'] |
nobody |
5-8841 5 days ago |
5-8082 5 days ago |
8-82518 8 days |
| 28613 |
espottesmith author: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
|
286/0 |
Mathlib.lean,Mathlib/Combinatorics/Hypergraph/Basic.lean |
2 |
152 |
['SnirBroshi', 'b-mehta', 'espottesmith', 'github-actions', 'jt496', 'lauramonk', 'mathlib4-merge-conflict-bot', 'tb65536'] |
b-mehta assignee:b-mehta |
4-57961 4 days ago |
4-57165 4 days ago |
107-37386 107 days |
| 36103 |
SnkXyx author: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
- [x] depends on: #37791
|
t-algebra
new-contributor
label:t-algebra$ |
3860/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,docs/references.bib |
12 |
21 |
['Hagb', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
dagurtomas assignee:dagurtomas |
4-48570 4 days ago |
7-36166 7 days ago |
28-83819 28 days |
| 39347 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): refactor of Pattern and shift-invariance of shape languages for subshifts |
## Summary
This PR refactors Pattern.mulShift in Mathlib/Dynamics/SymbolicDynamics/Basic.lean and uses the cleaner definition to prove shift-invariance of the language of a subshift on a finite shape.
## Changes
Pattern.mulShift now returns a Pattern instead of a configuration (more natural).
- Old type: Pattern.mulShift : Pattern A G → G → (G → A)
- New type: Pattern.mulShift : Pattern A G → G → Pattern A G
- The result carries its support (p.support.image (v * ·)) and the
default-outside-support proof, so callers don't have to re-derive them.
The [IsLeftCancelMul G] hypothesis is moved to the lemmas that actually use it.
- The definition Pattern.mulShift itself no longer needs left-cancellation (it only
chooses a preimage noncomputably).
- The hypothesis is now stated on mulShift_config_apply_mul_left_of_mem and
mulOccursInAt_eq_cylinder directly, instead of being a section-level variable.
Renames following the type change.
- mulShift_apply_mul_left_of_mem → mulShift_config_apply_mul_left_of_mem (because we
now write (p.mulShift v).config instead of p.mulShift v).
New @[simp] and @[ext] lemmas for Pattern.
- Pattern.ext: two patterns are equal iff their supports agree and their
configurations agree on the support.
- Pattern.mulShift_support: the support of p.mulShift v is p.support.image (v * ·).
- Pattern.fromConfig_support: the support of fromConfig x U is U.
- Pattern.fromConfig_config_of_mem: on its support, fromConfig x U agrees with x.
New lemma Pattern.fromConfig_mulShift.
For a left inverse g' * g = 1, shifting the pattern fromConfig x U by g equals
fromConfig (mulShift g' x) (U.image (g * ·)).
New theorem MulSubshift.languageOn_image_mulShift.
For a subshift Y and elements g, g' with g * g' = 1 and g' * g = 1:
(fun p => p.mulShift g) '' Y.languageOn U = Y.languageOn (U.image (g * ·))
i.e. the language on the translated shape is exactly the image of the language on U
under the pattern-shift map. This gives a bijection between Y.languageOn U and
Y.languageOn (U.image (g * ·)), with inverse p ↦ p.mulShift g'. Stated for
left-cancellative monoids with an invertible element.
Updated docstrings for Pattern.mulShift and the renamed lemma to reflect the
bundled-Pattern return type and clarify which results need [IsLeftCancelMul G]. |
t-dynamics
new-contributor
|
142/48 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
3 |
['github-actions'] |
sgouezel assignee:sgouezel |
4-48559 4 days ago |
19-43125 19 days ago |
19-42875 19 days |
| 40005 |
tautschnig author:tautschnig |
feat(Data/ZMod/Basic): isUnit characterisation in prime power moduli |
Add two lemmas characterising units in ZMod (p^n) via divisibility of the canonical lift:
isUnit_iff_not_prime_dvd_val: for prime p and n > 0,
IsUnit x ↔ ¬ p ∣ x.val.
not_isUnit_iff_prime_dvd_val: for prime p and n > 0,
¬ IsUnit x ↔ p ∣ x.val.
These specialise the existing isUnit_iff_coprime to prime power moduli, where the coprimality condition reduces to a simple divisibility check on the unique prime factor.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
15/0 |
Mathlib/Data/ZMod/Basic.lean |
1 |
3 |
['copilot-pull-request-reviewer', 'github-actions'] |
nobody |
4-22696 4 days ago |
4-21876 4 days ago |
4-21636 4 days |
| 40006 |
tautschnig author:tautschnig |
feat(Data/ZMod/Basic): idempotents in ZMod (p^d) are exactly {0, 1} |
Add sq_eq_self_iff_eq_zero_or_one: in ZMod (p^d) for prime p and d > 0, x^2 = x iff x = 0 or x = 1.
This generalises eq_zero_or_one_of_sq_eq_self (which requires CancelMonoidWithZero, i.e., no zero divisors) to the prime-power case. ZMod (p^d) has zero divisors for d >= 2, so the mul_left_injective₀ argument used by the existing lemma does not apply. The proof works by lifting to ℕ, using that if gcd(a, b) = 1 and p^d | a*b then p^d divides one of a or b (by Euclid's lemma), then noting that a = x.val and b = x.val - 1 are consecutive naturals and hence coprime.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
56/0 |
Mathlib/Data/ZMod/Basic.lean |
1 |
2 |
['github-actions'] |
nobody |
4-20093 4 days ago |
4-18281 4 days ago |
4-18031 4 days |
| 35672 |
dennj author: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
LLM-generated
|
128/2 |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean,docs/references.bib |
3 |
7 |
['dennj', 'github-actions', 'grunweg', 'ocfnash', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
4-19896 4 days ago |
20-79579 20 days ago |
45-79841 45 days |
| 39996 |
RuthP628 author:RuthP628 |
feat(ModelTheory/Semantics): add simp theorems similar to Sentence.realize_not |
Add simp theorems Sentence.realize_bot, Sentence.realize_top, Sentence.realize_inf, Sentence.realize_sup, Sentence.realize_imp and Sentence.realize_iff in the style of Sentence.realize_not as consequences of the corresponding theorems for formulas. |
t-logic
new-contributor
|
31/1 |
Mathlib/ModelTheory/Semantics.lean |
1 |
10 |
['RuthP628', 'b-mehta', 'github-actions', 'plp127'] |
nobody |
3-65164 3 days ago |
3-64482 3 days ago |
4-10126 4 days |
| 38527 |
archiebrowne author:archiebrowne |
feat(Analysis/Calculus): 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
|
317/24 |
Mathlib.lean,Mathlib/Analysis/Calculus/BumpFunction/Basic.lean,Mathlib/Analysis/Calculus/ContDiff/Operations.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Lemmas.lean,Mathlib/Analysis/ContDiffMulAction.lean,Mathlib/Analysis/InnerProductSpace/Calculus.lean |
6 |
11 |
['archiebrowne', 'github-actions', 'grunweg', 'peabrainiac'] |
ocfnash assignee:ocfnash |
3-48807 3 days ago |
25-65093 25 days ago |
33-45048 33 days |
| 38895 |
emlis42 author:emlis42 |
chore(Algebra/ContinuedFractions): golf |
This PR simplifies some proofs in `Algebra/ContinuedFractions` |
t-algebra
new-contributor
label:t-algebra$ |
39/63 |
Mathlib/Algebra/ContinuedFractions/Computation/ApproximationCorollaries.lean,Mathlib/Algebra/ContinuedFractions/Computation/Approximations.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 |
7 |
2 |
['github-actions'] |
joelriou assignee:joelriou |
3-48803 3 days ago |
28-47335 28 days ago |
29-38835 29 days |
| 37190 |
cjrl author: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 |
2-50148 2 days ago |
50-69047 50 days ago |
66-34057 66 days |
| 32692 |
WilliamCoram author: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
|
159/0 |
Mathlib.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Algebra/Order/Antidiag/Tendsto.lean,Mathlib/RingTheory/MvPowerSeries/Restricted.lean |
4 |
52 |
['WilliamCoram', 'erdOne', 'github-actions', 'jcommelin', 'mathlib-merge-conflicts', 'mbkybky'] |
jcommelin assignee:jcommelin |
2-5219 2 days ago |
2-4485 2 days ago |
56-47679 56 days |
| 40033 |
JJYYY-JJY author:JJYYY-JJY |
chore: remove flexible linter suppressions |
This PR removes two local `linter.flexible` suppressions by replacing compact `simp; infer_instance` with explicit proofs.
Changed files:
- `Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean`
- `Mathlib/Topology/UniformSpace/Ultra/Constructions.lean`
Tested with:
`lake build`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor |
6/8 |
Mathlib/Dynamics/TopologicalEntropy/DynamicalEntourage.lean,Mathlib/Topology/UniformSpace/Ultra/Constructions.lean |
2 |
6 |
['chenson2018', 'github-actions', 'vihdzp'] |
nobody |
1-78557 1 day ago |
2-64503 2 days ago |
3-56192 3 days |
| 39629 |
hawkrobe author:hawkrobe |
feat(RingTheory/Coalgebra/Convolution): Algebra on convolution semiring |
This PR completes the algebraic structure on the convolution object.
---
I followed the pattern in [`Matrix/WithConv.lean`](https://github.com/leanprover-community/mathlib4/blob/5e932f97dd25535344f80f9dd8da3aab83df0fe6/Mathlib/LinearAlgebra/Matrix/WithConv.lean#L98) which splits out `IsScalarTower` and `SMulCommClass`. Used in pre-Lie / Oudom–Guin constructions. |
t-ring-theory
new-contributor
|
24/1 |
Mathlib/RingTheory/Coalgebra/Convolution.lean |
1 |
2 |
['github-actions'] |
nobody |
1-60754 1 day ago |
1-60036 1 day ago |
12-65082 12 days |
| 39239 |
alainchmt author:alainchmt |
feat(FieldTheory/Finite): irreducible polynomial divides X^q^n - X iff degree divides n |
---
Add the theorem saying that, for an irreducible polynomial `f` over a finite field `K`, the degree of `f` divides `n` if and only if `f` divides `X ^ (Nat.card K) ^ n - X`. Include auxiliary lemmas.
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
34/0 |
Mathlib/FieldTheory/Finite/Extension.lean,Mathlib/FieldTheory/Minpoly/Field.lean |
2 |
2 |
['github-actions'] |
nobody |
1-55573 1 day ago |
21-17323 21 days ago |
21-17073 21 days |
| 39282 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): add union morphism lemma for LanguageOn |
In symbolic dynamics.
This PR proves that taking the language over a finite shape commutes with unions of configuration sets:
$LanguageOn (X \cup Y) U = LanguageOn X U \cup LanguageOn Y U$
The proof is a direct unfolding of definitions: a pattern in the language of $X \cup Y$ comes from restricting a configuration $x ∈ X \cup Y$, and splitting on whether $x \in X$ or $x \in Y$ yields the corresponding inclusion in either $LanguageOn X U$ or $LanguageOn Y U$. The converse direction rebuilds a witness in $X \cup Y$ from either side of the union.
Related to issue #39252 |
t-dynamics
new-contributor
|
9/1 |
Mathlib/Dynamics/SymbolicDynamics/Basic.lean |
1 |
4 |
['Sfgangloff', 'github-actions', 'sgouezel'] |
sgouezel assignee:sgouezel |
1-51612 1 day ago |
1-50831 1 day ago |
20-24622 20 days |
| 32583 |
MJ141592 author: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
|
95/93 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/DeleteEdges.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean |
5 |
48 |
['MJ141592', 'Rida-Hamadani', 'SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
b-mehta assignee:b-mehta |
1-48115 1 day ago |
8-4187 8 days ago |
57-10265 57 days |
| 38309 |
ntapiam author: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
label:t-algebra$ |
270/0 |
Mathlib.lean,Mathlib/Algebra/NonAssoc/Dendriform/Defs.lean,docs/references.bib |
3 |
5 |
['dagurtomas', 'github-actions', 'ntapiam'] |
themathqueen assignee:themathqueen |
1-48107 1 day ago |
25-15065 25 days ago |
40-19299 40 days |
| 38027 |
8e7 author: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
|
87/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Star.lean |
2 |
41 |
['8e7', 'IvanRenison', 'JovanGerb', 'SnirBroshi', 'b-mehta', 'github-actions', 'vihdzp', 'vlad902'] |
b-mehta assignee:b-mehta |
1-43307 1 day ago |
1-42498 1 day ago |
49-30170 49 days |
| 39954 |
jihuang2024 author:jihuang2024 |
feat(Analysis/Polynomial): define Hurwitz stability and prove small-degree characterizations |
Proofs were developed with assistance from Claude Code. I have reviewed and understand all the code and can justify the design decisions.
This PR introduces the predicate Polynomial.IsHurwitzStable for real polynomials and proves the Routh–Hurwitz stability criterion for degrees 1 and 2.
A polynomial p : ℝ[X] is Hurwitz stable if every root of its complexification has strictly negative real part. This notion arises in control theory and the study of linear ODEs, where it characterises asymptotic stability of a system.
New definitions
Polynomial.IsHurwitzStable: ∀ z : ℂ, (p.map (algebraMap ℝ ℂ)).IsRoot z → z.re < 0
New theorems
Polynomial.not_isHurwitzStable_zero: the zero polynomial is not Hurwitz stable
Polynomial.IsHurwitzStable.ne_zero: Hurwitz stable polynomials are nonzero
Polynomial.isHurwitzStable_X_add_C: X + C a is Hurwitz stable ↔ 0 < a
Polynomial.isHurwitzStable_quadratic: X ^ 2 + C b * X + C c is Hurwitz stable ↔ 0 < b ∧ 0 < c
Proof strategy for the quadratic
The quadratic case splits on whether a root z is real (z.im = 0) or complex (z.im ≠ 0, which forces 2 * z.re + b = 0). Existence of a root uses Complex.exists_root (Fundamental Theorem of Algebra). The necessary condition in the real-root case uses the Vieta complementary root -b - z.re.
Future work
The general Routh–Hurwitz theorem (for degree n, stated in terms of the Hurwitz matrix and its leading principal minors) requires infrastructure not yet in Mathlib — in particular a theory of the Cauchy index or the Bezoutian of two polynomials. This PR lays the definitional foundation for that work.
This corresponds to [1000.yaml](https://github.com/leanprover-community/mathlib4/blob/master/docs/1000.yaml#L2697) Q4455015 - Routh–Hurwitz theorem |
t-analysis
new-contributor
LLM-generated
|
131/0 |
Mathlib.lean,Mathlib/Analysis/Polynomial/RouthHurwitz.lean |
2 |
10 |
['SnirBroshi', 'github-actions', 'jihuang2024', 'wwylele'] |
nobody |
1-41779 1 day ago |
1-41067 1 day ago |
5-2712 5 days |
| 40092 |
korbonits author:korbonits |
feat(Topology/Connected): path-connectedness of products and pi types |
# Disclaimer
Following https://leanprover-community.github.io/contribute/index.html, I wanted to make a simple contribution to point set topology given some of the very welcoming Zulip mathematicians. I used Claude Code to plan, review, and test some example definitions before raising this PR. I'm using this as a way to make meaningful contributions to mathlib4 as I learn Lean. Background: mathematics and a decade+ in ML engineering/applied science.
# Description
Add path-connectedness of binary products and dependent products (pi types):
- `JoinedIn.prod`, `IsPathConnected.prod`, and `instance Prod.instPathConnectedSpace : PathConnectedSpace (X × Y)`
- `JoinedIn.pi`, `IsPathConnected.pi`, and `instance Pi.instPathConnectedSpace : PathConnectedSpace (∀ i, Z i)`
These instances were previously missing — `inferInstance` failed for both `PathConnectedSpace (X × Y)` and `PathConnectedSpace ((i : ι) → Z i)`. They were suggested as good first contributions on Zulip.
The analogous `LocPathConnectedSpace` / `LocallyConnectedSpace` product and pi instances (and further `connectedComponent` / `pathComponent` product lemmas) are left for follow-up PRs.
|
t-topology
LLM-generated
new-contributor
|
59/0 |
Mathlib/Topology/Connected/PathConnected.lean |
1 |
3 |
['github-actions', 'korbonits'] |
nobody |
1-35227 1 day ago |
1-34188 1 day ago |
1-33938 1 day |
| 38534 |
AlexeyMilovanov author: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)
### Main changes
* `PFun` is now a structure with a single field `toFun : α → Part β`.
* Added the `FunLike (α →. β) α (Part β)` instance and `initialize_simps_projections`.
* Added the basic projection/application simp lemmas needed for the structure wrapper.
* Definitions which used to return raw lambdas as partial functions now explicitly use `PFun.mk` or `PFun.lift`.
* Equality proofs for partial functions now use `PFun.ext` / `DFunLike.ext` where `funext` no longer applies directly.
### Downstream impact
The refactor mainly impacts Computability Theory and Category Theory (`Category/PartialFun.lean`). Since `PFun` is no longer definitionally equal to `α → Part β`, tactics such as `rfl`, `simp`, and `funext` can no longer always see through the old raw-function representation.
As a result, several proofs (e.g. `fix_aux`, `ppred`, `mem_eval`, and `unitIso`) grew in size, requiring explicit `ext` + `simp` breakdowns. I tried to keep these proof changes minimal; further golfing suggestions are very welcome. It seems that fully recovering the old brevity in some places may require additional `PFun`-specific API/congruence support, which I avoided adding in this PR to keep the diff minimal.
### Affected files
* **Core:** `Mathlib/Data/PFun.lean`
* **Computability:** `Partrec`, `PartrecBasis`, `PartrecCode`, `RE`, `RecursiveIn`, `Ackermann`, `Halting`, `StateTransition`, `TuringDegree`, `TuringMachine/Config`
* **Category Theory:** `Category/PartialFun.lean`
* **Other:** `Data/Finset/PImage.lean`, `NumberTheory/Dioph.lean`
This also removes the previous `set_option linter.flexible false` workaround and the local transparency workaround in `TuringMachine/Config.lean`, as well as the local transparency workarounds in `Category/PartialFun.lean`.
### Note on LLM usage
The core `PFun` change caused numerous downstream errors. I initially used an LLM to help draft fixes for these files. Afterwards, I spent a significant amount of time manually correcting and modifying all of the generated changes.
|
new-contributor
t-computability
|
611/528 |
Mathlib/CategoryTheory/Category/PartialFun.lean,Mathlib/Computability/Ackermann.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 |
13 |
9 |
['AlexeyMilovanov', 'dagurtomas', 'github-actions', 'j-loreaux', 'mathlib-bors', 'mathlib-merge-conflicts'] |
nobody |
1-28277 1 day ago |
1-27568 1 day ago |
15-69728 15 days |
| 40050 |
ReemMelamed author:ReemMelamed |
feat(Algebra/Group/GreensRelations): add definitions for Green's relations |
This PR introduces the foundational definitions for Green's relations (L, R, H, D, and J) on semigroups.
This is the first in a series of PRs aimed at formalizing Green's relations for semigroups.
---
Zulip discussion: [Formalization of Green's Relations for semigroups](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Formalization.20of.20Green.27s.20Relations.20for.20semigroups/with/598557876) |
t-algebra
new-contributor
label:t-algebra$ |
348/0 |
Mathlib.lean,Mathlib/Algebra/Group/GreensRelations/Basic.lean,Mathlib/Algebra/Group/GreensRelations/Defs.lean |
3 |
11 |
['YaelDillies', 'YanYablonovskiy', 'github-actions', 'mathlib-bors'] |
nobody |
1-18189 1 day ago |
1-17174 1 day ago |
2-71525 2 days |
| 38848 |
jcreinhold author:jcreinhold |
feat(AlgebraicTopology/SimplicialSet): exists_isPushout_of_ne_top |
Every proper subcomplex of a simplicial set extends by attaching a single cell along its boundary, exhibited as a pushout of `∂Δ[n] ↪ Δ[n]`. This is the per-cell input for cell-by-cell filtrations of monomorphisms in `SSet`.
Adapted from @joelriou 's [proof](https://github.com/joelriou/topcat-model-category/blob/813338a8c88cfe0096deed7e3ba7daf92d4a1c71/TopCatModelCategory/SSet/Boundary.lean#L187). I also added the supporting lemma `Types.isPullback_of_eq_setPreimage` (set-preimage square is a pullback in `Type u`).
AI use: Claude helped locate `subtype_val_mono` and the `backward.isDefEq.respectTransparency` option.
|
t-algebraic-topology
new-contributor
|
119/3 |
Mathlib/AlgebraicTopology/SimplicialSet/Boundary.lean,Mathlib/CategoryTheory/Limits/Types/Pullbacks.lean |
2 |
26 |
['github-actions', 'jcreinhold', 'joelriou', 'mckoen'] |
nobody |
1-10550 1 day ago |
1-9370 1 day ago |
29-25996 29 days |
| 39868 |
JuanCoRo author:JuanCoRo |
feat(Algebra/Polynomial): linearity of `divByMonic` and adjacent results |
---
This PR adds the `R`-linearity of the monic polynomial division map `_ /ₘ q`. It also adds adjacent results that stem from this work.
#### Refactors:
- Reuses the proofs from `add_modByMonic` and `smul_modByMonic` to generalize these results to `add_div_modByMonic` and `smul_div_modByMonic` respectively.
- Replaces the proofs of `add_modByMonic` and `smul_modByMonic` as specializations of the more general theorems `add_div_modByMonic` and `smul_div_modByMonic` respectively.
#### Additions:
- Adds the necessary results for `_ /ₘ q` linearity:
- `add_divByMonic : (p₁ + p₂) /ₘ q = p₁ /ₘ q + p₂ /ₘ q`
- `smul_divByMonic : c • p /ₘ q = c • (p /ₘ q)`
- Adds `_ /ₘ q` as an `R`-linear map:
- `divByMonicHom`: definition of `_ /ₘ q` as a linear map
- `mem_ker_divByMonic`: kernel characterization for `_ /ₘ q`.
- In `Div.lean` adds dual results for `/ₘ` that were already present for `%ₘ`
- `neg_divByMonic : (-p) /ₘ q = -(p /ₘ q)`
- `sub_divByMonic : (p₁ - p₂) /ₘ q = p₁ /ₘ q - p₂ /ₘ q`
- `mul_divByMonic_assoc (hd : q ∣ p₂) : (p₁ * p₂) /ₘ q = p₁ * (p₂ /ₘ q)`
While `mul_divByMonic_assoc` is not exactly the dual of `mul_modByMonic`, I thought it wouldn't hurt to add it.
[](https://gitpod.io/from-referrer/) |
new-contributor
t-algebra
label:t-algebra$ |
54/17 |
Mathlib/Algebra/Polynomial/Div.lean,Mathlib/Algebra/Polynomial/RingDivision.lean |
2 |
6 |
['JuanCoRo', 'github-actions', 'wwylele'] |
nobody |
1-9536 1 day ago |
1-9705 1 day ago |
4-9939 4 days |
| 39495 |
hawkrobe author:hawkrobe |
feat(Data/Multiset/Antidiagonal): two structural lemmas |
Adds `map_swap_antidiagonal` and `antidiagonal_add`.
---
Fills out the API parallel to `Multiset.Nat.map_swap_antidiagonal` and `Finset.map_swap_antidiagonal`. (And adds `@[congr]` to `bind_congr`.)
Used for shuffle-coproduct constructions.
(#7486, I found this old [Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/antidiagonals.20having.20multiplicity.20.237595/near/238573473))
I used Claude Code to audit and polish. |
t-data
new-contributor
LLM-generated
|
20/0 |
Mathlib/Data/Multiset/Antidiagonal.lean,Mathlib/Data/Multiset/Bind.lean |
2 |
6 |
['github-actions', 'hawkrobe', 'j-loreaux'] |
nobody |
0-84205 23 hours ago |
5-48805 5 days ago |
15-67185 15 days |
| 37279 |
imalinowskip author:imalinowskip |
feat(Probability): multivariate CLT (and Cramèr-Wold) |
---
- [x] depends on: #36208
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
large-import
|
499/1 |
Mathlib.lean,Mathlib/Probability/CentralLimitTheorem.lean,Mathlib/Probability/CramerWold.lean |
3 |
13 |
['EtienneC30', 'RemyDegenne', 'github-actions', 'imalinowskip', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
RemyDegenne assignee:RemyDegenne |
0-66129 18 hours ago |
0-66129 18 hours ago |
6-43999 6 days |
| 37682 |
SabrinaJewson author: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 |
12 |
['SabrinaJewson', 'astrainfinita', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
Komyyy assignee:Komyyy |
0-63516 17 hours ago |
0-73235 20 hours ago |
52-71400 52 days |
| 38223 |
Deicyde author: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
|
224/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Category/MfldCat/Basic.lean,Mathlib/Geometry/Manifold/ContMDiffMap.lean |
3 |
57 |
['Deicyde', 'chrisflav', 'dagurtomas', 'github-actions', 'idontgetoutmuch', 'peabrainiac'] |
joelriou assignee:joelriou |
0-48167 13 hours ago |
24-68326 24 days ago |
38-25118 38 days |
| 40088 |
jeangud author:jeangud |
fix(Tactic/Linter/DocString): avoid false positive in syntax quotation patterns |
# Description
Syntax quotations are a key meta-programming feature for Lean 4, but the `linter.style.docString.empty` linter currently does not handle them correctly.
This PR:
- Closes #40087
- Adds a regression test for syntax quotation patterns
- :robot: Implemented and test with **Gemini 3.1 Pro**. This change is pretty targeted so I did not have much to redo except reviewing.
**Example false positive:**
In the [formal-conjectures](https://github.com/google-deepmind/formal-conjectures) repository, the `AMSLinter`:
```lean
/-- Checks if a command has the `AMS` attribute. -/
def toAMS (stx : TSyntax ``Command.declModifiers) :
CommandElabM (Array <| TSyntaxArray `num) := do
match stx with
| `(declModifiers| $(_)? @[$[$atts],*] $(_)? $(_)? $(_)? $(_)?) =>
atts.filterMapM fun att ↦ do
match att with
| `(attrInstance | AMS $nums*) => return some nums
| _ => return none
| _ => return #[]
```
**Proposed Fix:** We can fix this by explicitly checking the kind of the docstring node before processing it. Pattern nodes from syntax quotations use antiquotations for the docstring slot (like `$(_)?`), which have a different syntax kind than actual doc comments. Filtering by `docStx.getKind == ``Parser.Command.docComment` successfully filters out the false positives while keeping the linter working for actual source code:
```lean
if docStx.isMissing then continue -- this is probably superfluous, thanks to `some pos` above.
if docStx.getKind != ``Parser.Command.docComment then continue -- ignore antiquotations from syntax patterns like `$(_)?`
```
# Testing
:white_check_mark: Builds successfully
```shell
$ lake build Mathlib.Tactic.Linter.DocString
Build completed successfully (4 jobs).
```
:white_check_mark: Tests pass
```shell
$ lake build MathlibTest.Linter.DocString
Build completed successfully (6 jobs).
```
**Before :x:**
```shell
$ lake build ./FormalConjectures/Util/Linters/AMSLinter.lean
⚠ [68/68] Built FormalConjectures.Util.Linters.AMSLinter
warning: FormalConjectures/Util/Linters/AMSLinter.lean:48:21: warning: this doc-string is empty
Note: This linter can be disabled with `set_option linter.style.docString.empty false`
warning: FormalConjectures/Util/Linters/AMSLinter.lean:69:27: warning: this doc-string is empty
Note: This linter can be disabled with `set_option linter.style.docString.empty false`
Build completed successfully (68 jobs).
```
**After :white_check_mark:**
```shell
$ lake build ./FormalConjectures/Util/Linters/AMSLinter.lean
Build completed successfully (25 jobs).
```
|
t-linter
new-contributor
|
24/1 |
Mathlib/Tactic/Linter/DocString.lean,MathlibTest/Linter/DocString.lean |
2 |
2 |
['github-actions'] |
JovanGerb assignee:JovanGerb |
0-48154 13 hours ago |
1-46898 1 day ago |
1-46648 1 day |
| 39491 |
Yu-Misaka author:Yu-Misaka |
feat(Mathlib/LinearAlgebra/RootSystem/CartanMatrix): a Cartan matrix of a reduced crystallographic root system cannot have eigenvalue 4 |
This proves the TODO that a Cartan matrix of a reduced crystallographic root system cannot have eigenvalue 4.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
codex
LLM-generated
label:t-algebra$ |
125/8 |
Mathlib/Data/Matrix/Mul.lean,Mathlib/LinearAlgebra/RootSystem/CartanMatrix.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Basis.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Semisimple.lean |
4 |
6 |
['Yu-Misaka', 'copilot-pull-request-reviewer', 'github-actions', 'mathlib-bors', 'ocfnash'] |
ocfnash assignee:ocfnash |
0-40077 11 hours ago |
0-38411 10 hours ago |
7-17040 7 days |
| 38551 |
TTony2019 author: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
t-analysis
|
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 |
26 |
['TTony2019', 'github-actions', 'themathqueen', 'wwylele'] |
themathqueen assignee:themathqueen |
0-7423 2 hours ago |
34-43798 34 days ago |
36-58069 36 days |
| 39785 |
hawkrobe author:hawkrobe |
refactor(RingTheory/HopfAlgebra): `ofConvInverse` constructor |
The antipode of a Hopf algebra is [generally](https://arxiv.org/pdf/1409.8356) the two-sided inverse of the identity in the convolution algebra `End(A)`. When `A` is commutative, algebra homs are closed under convolution and this lifts to AlgHom equality. See [this comment](https://github.com/leanprover-community/mathlib4/pull/31898#issuecomment-3566663278) on #31898.
---
Sadly the AlgHom-equality formulation is unavailable in the noncommutative case.
|
t-ring-theory
new-contributor
maintainer-merge
|
41/20 |
Mathlib/RingTheory/HopfAlgebra/Basic.lean,Mathlib/RingTheory/HopfAlgebra/TensorProduct.lean |
2 |
35 |
['YaelDillies', 'eric-wieser', 'faenuccio', 'github-actions', 'grunweg', 'hawkrobe', 'themathqueen'] |
nobody |
0-7092 1 hour ago |
0-52317 14 hours ago |
7-81827 7 days |
| 35812 |
khwilson author: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
---
- [x] depends on #37738
- [x] depends on #37740
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
349/36 |
Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean,Mathlib/NumberTheory/NumberField/Units/Regulator.lean |
6 |
86 |
['Vierkantor', 'YaelDillies', 'github-actions', 'joneugster', 'khwilson', 'mathlib-merge-conflicts'] |
YaelDillies assignee:YaelDillies |
0-1366 22 minutes ago |
0-41282 11 hours ago |
37-84445 37 days |