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 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 |
| 33963 |
gasparattila author:gasparattila |
feat(Topology/UniformSpace/Closeds): completeness of `(Nonempty)Compacts` |
This PR generalizes the completeness result of `NonemptyCompacts` from metric spaces to uniform spaces.
---
- [x] depends on: #34036
[](https://gitpod.io/from-referrer/)
|
t-topology |
71/8 |
Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/UniformSpace/Closeds.lean |
2 |
3 |
['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
PatrickMassot assignee:PatrickMassot |
35-66455 1 month ago |
35-66473 35 days ago |
46-56424 46 days |
| 34268 |
gasparattila author:gasparattila |
feat(Topology/Sets): continuity of operations on `(Nonempty)Compacts` |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
144/17 |
Mathlib/Topology/Sets/Compacts.lean,Mathlib/Topology/Sets/VietorisTopology.lean,Mathlib/Topology/UniformSpace/Closeds.lean |
3 |
2 |
['github-actions', 'mathlib4-merge-conflict-bot'] |
PatrickMassot assignee:PatrickMassot |
35-65796 1 month ago |
35-65814 35 days ago |
41-37140 41 days |
| 34270 |
gasparattila author:gasparattila |
feat(Topology/UniformSpace/Closeds): `(Nonempty)Compacts.toCloseds` is a closed embedding |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
36/35 |
Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/UniformSpace/Closeds.lean |
2 |
2 |
['github-actions', 'mathlib4-merge-conflict-bot'] |
PatrickMassot assignee:PatrickMassot |
35-65304 1 month ago |
35-65323 35 days ago |
41-36283 41 days |
| 34123 |
staroperator author:staroperator |
feat(Data/Set/Finite): finite distributivity for complete distributive lattices |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
52/0 |
Mathlib/Data/Set/Finite/Lattice.lean |
1 |
11 |
['github-actions', 'plp127', 'staroperator'] |
bryangingechen assignee:bryangingechen |
35-20219 1 month ago |
44-41942 44 days ago |
44-67826 44 days |
| 34092 |
staroperator author:staroperator |
feat(SetTheory/ZFC): properties of `ZFSet.omega` |
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
77/10 |
Mathlib/SetTheory/ZFC/Basic.lean,Mathlib/SetTheory/ZFC/Ordinal.lean,Mathlib/SetTheory/ZFC/PSet.lean |
3 |
25 |
['Komyyy', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator', 'vihdzp'] |
alreadydone assignee:alreadydone |
34-42193 1 month ago |
34-42255 34 days ago |
46-1161 46 days |
| 33817 |
FlAmmmmING author:FlAmmmmING |
fix(Combinatorics/Enumerative/Schroder.lean): Fix the definition and theorem of smallSchroder. |
In the previous definition, the small Schröder numbers were defined as
```LaTeX
s_0 = 1, s_1 = 1, s_2 = 1, s_3 = 3...
```
, which does not match the sequence listed in OEIS A006318. Moreover, this definition makes it difficult to correctly write the generating function for the small Schröder numbers. This PR fixes this issue.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-combinatorics
large-import
|
61/39 |
Mathlib/Combinatorics/Enumerative/Schroder.lean |
1 |
19 |
['FlAmmmmING', 'github-actions', 'vihdzp'] |
awainverse assignee:awainverse |
34-20235 1 month ago |
49-9511 49 days ago |
53-60859 53 days |
| 34227 |
stepan2698-cpu author:stepan2698-cpu |
feat: If sum of densities is at least one, the sumset covers the naturals |
Proves an outstanding TODO item from Mathlib.Combinatorics.Schnirelmann : shows that if the sum of two densities is at least one, the sumset covers the positive naturals.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
51/1 |
Mathlib/Combinatorics/Schnirelmann.lean |
1 |
3 |
['github-actions', 'grunweg', 'kbuzzard'] |
awainverse assignee:awainverse |
34-20232 1 month ago |
42-26607 42 days ago |
42-40601 42 days |
| 34028 |
floor-licker author:floor-licker |
feat(SimpleGraph): add max-flow/min-cut weak duality |
This PR introduces a basic s–t flow setup for undirected SimpleGraphs and proves the standard weak-duality
inequality: for any feasible flow f and any s–t cut S, value f ≤ cutCapacity S.
This is a small, self-contained lemma I extracted while working on larger graph-theoretic formalizations, in particular, results that will ultimately rely on a full max-flow/min-cut theorem. The full MFMC equality/existence statement is not included here. This is the weak-duality direction (∀ f S, value f ≤ cutCapacity S).
|
t-combinatorics
new-contributor
|
169/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/MaxFlowMinCut.lean |
2 |
13 |
['SnirBroshi', 'floor-licker', 'github-actions'] |
kmill assignee:kmill |
33-20242 1 month ago |
46-37931 46 days ago |
46-41033 46 days |
| 33520 |
NoneMore author:NoneMore |
feat(ModelTheory/ElementarySubstructures): add a variant of Tarski-Vaught test taking sets as input |
There should exist an `ElementarySubstructure.copy` such that we can directly bundle the set itself instaed of its closure as an elementary substructure.
The other direction depends on #33458.
---
[](https://gitpod.io/from-referrer/)
|
t-logic
new-contributor
|
55/0 |
Mathlib/ModelTheory/ElementarySubstructures.lean |
1 |
3 |
['Citronhat', 'NoneMore', 'github-actions'] |
awainverse assignee:awainverse |
32-20193 1 month ago |
60-69814 60 days ago |
60-69705 60 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 |
22 |
['b-mehta', 'eric-wieser', 'github-actions', 'jsm28', 'vihdzp'] |
kmill assignee:kmill |
31-49532 1 month ago |
50-37452 50 days ago |
50-37343 50 days |
| 34171 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Hasse): Define the Eulerian path of a path graph |
---
Such statements are left for a future PR, since they add imports so we probably want to split them into a separate file:
```lean
theorem IsEulerian.ofPathGraph : ofPathGraph n |>.IsEulerian := by sorry
theorem IsHamiltonian.ofPathGraph : ofPathGraph n |>.IsHamiltonian := by sorry
theorem exists_path_iff_isContained_pathGraph :
(∃ (u v : V) (w : G.Path u v), w.val.support.length = n) ↔ pathGraph n ⊑ G := by
sorry
```
(the last statement also requires #33121, this PR gives the right-to-left implication and that PR gives the left-to-right)
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
37/1 |
Mathlib/Combinatorics/SimpleGraph/Hasse.lean |
1 |
9 |
['SnirBroshi', 'github-actions', 'vihdzp', 'vlad902'] |
kmill assignee:kmill |
31-1691 1 month ago |
42-26107 42 days ago |
43-58831 43 days |
| 34375 |
jvanwinden author:jvanwinden |
feat(MeasureTheory/Function/AEEqOfLIntegral): introduce lemmas for rewriting a.e. inequalities |
Introduce the following lemmas:
- ae_le_const_iff_forall_gt_imp_ae_lt,
- ae_const_le_iff_forall_lt_imp_ae_gt,
- ae_le_const_iff_forall_gt_imp_ae_le,
- ae_const_le_iff_forall_lt_imp_ae_ge,
which can be used get an epsilon of room in a.e. inequalities, with the epsilon being outside the a.e. quantifier. The 'le/ge' variants require a dense ordering.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
24/0 |
Mathlib/MeasureTheory/Function/AEEqOfLIntegral.lean |
1 |
4 |
['github-actions', 'jvanwinden', 'urkud'] |
kex-y assignee:kex-y |
29-54034 1 month ago |
39-56516 39 days ago |
39-56407 39 days |
| 32570 |
ksenono author:ksenono |
feat(Combinatorics/SimpleGraph): bipartite subgraphs and vertex-disjoint graphs for Konig's theorem |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
22/0 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean |
2 |
19 |
['SnirBroshi', 'github-actions', 'jcommelin', 'ksenono', 'vlad902'] |
kmill assignee:kmill |
29-30002 1 month ago |
29-30002 29 days ago |
81-66096 81 days |
| 34636 |
CoolRmal author:CoolRmal |
feat(MeasureTheory/Analysis): the Fourier coefficients of a function can be computed by integrating over a box |
The main result proved in this PR is `integral_preimage`, which is the analogue of the one-dimensional result: [UnitAddCircle.integral_preimage](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Integral/IntervalIntegral/Periodic.html#UnitAddCircle.integral_preimage). This theorem allows us to compute an integral over UnitAddTorus as an integral over a box in the Euclidean space. As an application, I prove that the Fourier coefficients of a function can be computed by integrating over a box.
The main motivation for this PR is the higher dimensional Poisson summation formula, which is needed in the [Sphere Packing project](https://github.com/thefundamentaltheor3m/Sphere-Packing-Lean).
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
80/0 |
Mathlib/Analysis/Fourier/AddCircleMulti.lean,Mathlib/MeasureTheory/MeasurableSpace/Embedding.lean |
2 |
1 |
['github-actions'] |
RemyDegenne assignee:RemyDegenne |
29-20218 1 month ago |
32-42145 32 days ago |
32-45506 32 days |
| 34191 |
IlPreteRosso author:IlPreteRosso |
feat(Topology/Algebra/InfiniteSum): Discrete Convolution API 1st PR |
Defines the very basics of the discrete convolution API. In analogy with [MeasureTheory.Convolution](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Convolution.html#MeasureTheory.convolution).
Main definitions include
- `mulFiber`, `convolution`, `ConvolutionExists`, `ConvolutionExists.add_distrib`, `ConvolutionExistsAt.smul_convolution`, `mulFiber_swapEquiv`, `convolution_comm`
RM:
- The main docstring is *as is*
- Next step is triple sum intrastrcutre + `assoc` theorems for convolution (long)
Continues the work from #33411 and #33410 (splitting into shorter PRs, carries over the modifications from previous reviews) |
t-topology
new-contributor
|
277/0 |
Mathlib.lean,Mathlib/Topology/Algebra/InfiniteSum/DiscreteConvolution.lean |
2 |
18 |
['IlPreteRosso', 'github-actions', 'j-loreaux'] |
PatrickMassot assignee:PatrickMassot |
28-49108 1 month ago |
28-49303 28 days ago |
37-50877 37 days |
| 34709 |
dennj author:dennj |
feat(Analysis/ODE): add discrete Grönwall inequality |
## Summary
Add discrete Grönwall inequality to `Mathlib/Analysis/ODE/DiscreteGronwall.lean`
Provides bounds for recurrence inequalities of the form `u(n+1) ≤ c(n) * u(n) + b(n)`
### Main results
- `discrete_gronwall_prod_general`: Product form working over any linearly ordered commutative ring
- `prod_one_add_Ico_mono`: Auxiliary lemma for product comparisons over subintervals
- `discrete_gronwall`: Classical exponential bound `u(n) ≤ (u(n₀) + ∑ b(k)) * exp(∑ c(i))` (ℝ-specific)
- `discrete_gronwall_Ico`: Uniform bound over a finite interval (ℝ-specific)
## Related work
Complements the continuous Grönwall inequality in `Mathlib.Analysis.ODE.Gronwall`
## References
* Grönwall, T. H. (1919). "Note on the derivatives with respect to a parameter of the solutions of a system of differential equations". *Annals of Mathematics*, 20(4), 292–296.
|
t-analysis
new-contributor
|
174/0 |
Mathlib.lean,Mathlib/Analysis/ODE/DiscreteGronwall.lean |
2 |
1 |
['github-actions'] |
ADedecker assignee:ADedecker |
27-20326 27 days ago |
31-9761 31 days ago |
31-9652 31 days |
| 34729 |
vihdzp author:vihdzp |
chore: `no_expose` various `Ordinal` definitions |
These all have convoluted definitions that are better characterized by their API, or (in the case of `Ordinal.ToType`) are defined through choice and have no useful definitional equalities.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
13/11 |
Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/Exponential.lean |
2 |
3 |
['github-actions', 'leanprover-radar', 'vihdzp'] |
b-mehta assignee:b-mehta |
27-20325 27 days ago |
30-50111 30 days ago |
30-50147 30 days |
| 34182 |
IlPreteRosso author:IlPreteRosso |
feat(Data/Finsupp/Single, Data/Finsupp/Indicator): Add set_indicator_singleton, indicator_singleton; golfed single_eq_set_indicator, single_eq_indicator |
[Mathlib.Data.Finsupp.Single](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finsupp/Single.html#Finsupp.single)
- Add `set_indicator_singleton`, golfed `single_eq_set_indicator`
[Mathlib.Data.Finsupp.Indicator](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finsupp/Indicator.html#Finsupp.indicator_apply)
- Add `indicator_singleton`, golfed `single_eq_indicator`
Continues the work from #34095 |
large-import
t-data
new-contributor
|
17/17 |
Mathlib/Data/Finsupp/Indicator.lean,Mathlib/Data/Finsupp/Single.lean |
2 |
29 |
['IlPreteRosso', 'eric-wieser', 'github-actions', 'mathlib-bors', 'urkud'] |
eric-wieser and urkud assignee:urkud assignee:eric-wieser |
26-50019 26 days ago |
43-8636 43 days ago |
43-16520 43 days |
| 34151 |
gasparattila author:gasparattila |
feat(Topology/Sets): product of `Closeds` |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
30/0 |
Mathlib/Topology/MetricSpace/Closeds.lean,Mathlib/Topology/Sets/Closeds.lean,Mathlib/Topology/Sets/Compacts.lean |
3 |
1 |
['github-actions'] |
PatrickMassot assignee:PatrickMassot |
26-44229 26 days ago |
44-40402 44 days ago |
44-40293 44 days |
| 34093 |
YellPika author:YellPika |
feat(Order/OmegaCompletePartialOrder): add `OmegaCompletePartialOrder` instance for `Option` with basic `ωScottContinuous` lemmas |
---
- [x] depends on: #33941
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
297/0 |
Mathlib.lean,Mathlib/Data/Option/Order.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Order/OmegaCompletePartialOrder.lean |
4 |
5 |
['YellPika', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
pechersky assignee:pechersky |
24-20312 24 days ago |
29-2648 29 days ago |
29-5503 29 days |
| 34266 |
gasparattila author:gasparattila |
feat(Topology/Sets): basis of `(Nonempty)Compacts` |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
147/0 |
Mathlib/Topology/Bases.lean,Mathlib/Topology/Sets/VietorisTopology.lean |
2 |
2 |
['github-actions', 'mathlib4-merge-conflict-bot'] |
PatrickMassot assignee:PatrickMassot |
24-20310 24 days ago |
35-66247 35 days ago |
41-42636 41 days |
| 34756 |
Hagb author:Hagb |
feat(Algebra/Order/Monoid/Unbundled/WithTop): `AddEquiv` between `WithBot` |
It is like `Equiv.withBotCongr` but preserving also addition (`AddEquiv`).
---
It is like [`Equiv.withBotCongr`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=Equiv.withBotCongr#doc) but preserving also addition ([`AddEquiv`](https://leanprover-community.github.io/mathlib4_docs/find/?pattern=AddEquiv#doc)).
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
39/0 |
Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean |
1 |
3 |
['Hagb', 'github-actions', 'plp127'] |
mattrobball assignee:mattrobball |
23-20045 23 days ago |
27-20435 27 days ago |
29-60296 29 days |
| 34808 |
YaelDillies author:YaelDillies |
feat(Combinatorics/SimpleGraph): isolated vertices |
RFC for now. Do you think this is a reasonable definition to have? What should its API be?
From ProofBench
---
[](https://gitpod.io/from-referrer/)
|
RFC
t-combinatorics
|
3/0 |
Mathlib/Combinatorics/SimpleGraph/Basic.lean |
1 |
1 |
['github-actions'] |
kmill assignee:kmill |
23-20040 23 days ago |
29-35194 29 days ago |
29-35085 29 days |
| 26985 |
agjftucker author:agjftucker |
feat(Analysis/Calculus/ImplicitFunction): define implicitFunctionOfProdDomain |
This PR continues the work from #16743.
Original PR: https://github.com/leanprover-community/mathlib4/pull/16743
---
- [x] depends on: #28352
[](https://gitpod.io/from-referrer/) |
t-analysis
new-contributor
|
269/157 |
Mathlib.lean,Mathlib/Analysis/Calculus/Implicit.lean,Mathlib/Analysis/Calculus/ImplicitContDiff.lean,Mathlib/Analysis/Calculus/ImplicitFunction/ProdDomain.lean |
4 |
27 |
['agjftucker', 'github-actions', 'j-loreaux', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'winstonyin'] |
hrmacbeth assignee:hrmacbeth |
22-82171 22 days ago |
22-82171 22 days ago |
91-14114 91 days |
| 32744 |
NoneMore author:NoneMore |
feat(ModelTheory/Definablity): add `DefinableFun` definition and lemmas |
This PR adds two basic shapes of definable sets and `DefinableFun` definition with relevant lemmas.
The main result is `Set.Definable.preimage_of_map` asserting that the preimage of a definable set under a definable map is definable.
There are also some tool lemmas derived by the preimage lemma.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-logic
|
147/0 |
Mathlib/ModelTheory/Definability.lean |
1 |
59 |
['NoneMore', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator'] |
awainverse assignee:awainverse |
22-76207 22 days ago |
54-85927 54 days ago |
82-38082 82 days |
| 33631 |
xgenereux author:xgenereux |
feat(ValuationSubring): simp lemmas for idealOfLE/ofPrime in relation to top/bot |
simp lemmas for `idealOfLE`/`ofPrime` in the trivial cases of `⊥`, `⊤` .
This is my second try at this PR (after I bailed on #33618), sorry about this!
---
- [ ] depends on: #33612
- [ ] depends on: #33609
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
19/0 |
Mathlib/RingTheory/Valuation/ValuationSubring.lean |
1 |
4 |
['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
alreadydone assignee:alreadydone |
22-20159 22 days ago |
25-80738 25 days ago |
25-82223 25 days |
| 34481 |
DAE123456 author:DAE123456 |
feat: Ore's Theorem |
Ore Theorem : Let G be a graph of order n ≥ 3 that satisfies the Ore property. Then G has a Hamilton cycle. |
t-combinatorics
new-contributor
|
3372/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Ore.lean |
2 |
25 |
['DAE123456', 'LLaurance', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'kim-em', 'tb65536', 'vlad902'] |
b-mehta assignee:b-mehta |
22-20158 22 days ago |
30-75173 30 days ago |
34-40178 34 days |
| 34722 |
GrigorenkoPV author:GrigorenkoPV |
feat(Data/Finset/RangeDistance): add |
---
Rebase of https://github.com/leanprover-community/mathlib4/pull/26347
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-data
|
34/0 |
Mathlib.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Data/Finset/RangeDistance.lean |
3 |
4 |
['GrigorenkoPV', 'github-actions', 'joneugster', 'plp127'] |
TwoFX assignee:TwoFX |
22-20154 22 days ago |
30-60965 30 days ago |
30-62761 30 days |
| 34809 |
YaelDillies author:YaelDillies |
feat: induced subgraphs of complete multipartite graphs are complete multipartite |
From ProofBench
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
4/2 |
Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean |
1 |
1 |
['github-actions'] |
b-mehta assignee:b-mehta |
22-20150 22 days ago |
29-34963 29 days ago |
29-34854 29 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 submersions.
|
t-differential-geometry
new-contributor
|
596/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Submersion.lean |
2 |
2 |
['github-actions'] |
grunweg assignee:grunweg |
21-56574 21 days ago |
21-58348 21 days ago |
21-59654 21 days |
| 34990 |
bwangpj author:bwangpj |
feat: `ContinuousSMul (∀ i, N i) (∀ i, γ i)` |
FLT
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
7/0 |
Mathlib/Topology/Algebra/MulAction.lean |
1 |
4 |
['bwangpj', 'github-actions', 'themathqueen'] |
PatrickMassot assignee:PatrickMassot |
21-20309 21 days ago |
24-41407 24 days ago |
24-46280 24 days |
| 34994 |
bwangpj author:bwangpj |
feat: Countable.of_module_finite |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
large-import
FLT
label:t-algebra$ |
7/0 |
Mathlib/LinearAlgebra/Countable.lean |
1 |
3 |
['bwangpj', 'eric-wieser', 'github-actions'] |
eric-wieser assignee:eric-wieser |
21-13553 21 days ago |
24-38416 24 days ago |
24-38307 24 days |
| 34969 |
kim-em author:kim-em |
feat(RingTheory/HopfAlgebra): prove antipode is antihomomorphism |
This PR proves that the antipode of a Hopf algebra is an antihomomorphism:
`antipode (a * b) = antipode b * antipode a`.
The proof uses the convolution algebra structure on `(A ⊗ A) →ₗ[R] A` and shows that `S ∘ μ` and `μ ∘ (S ⊗ S) ∘ comm` are both convolution inverses of `μ`, hence they must be equal by uniqueness of inverses.
This resolves a TODO listed in the file header.
🤖 Prepared with Claude Code |
t-ring-theory |
88/2 |
Mathlib/RingTheory/HopfAlgebra/Basic.lean |
1 |
1 |
['github-actions'] |
erdOne assignee:erdOne |
20-20292 20 days ago |
24-10542 24 days ago |
24-10433 24 days |
| 32807 |
WilliamCoram author:WilliamCoram |
feat: Define the Gauss norm for MvPowerSeries |
We adjust the current definition for Gauss norm on power series to work for multivariate power series.
If this seems acceptable I can refactor the single variable case.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
new-contributor
|
124/0 |
Mathlib.lean,Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean |
2 |
25 |
['WilliamCoram', 'erdOne', 'fbarroero', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] |
alreadydone assignee:alreadydone |
19-60592 19 days ago |
19-60658 19 days ago |
32-68411 32 days |
| 31560 |
AntoineChambert-Loir author:AntoineChambert-Loir |
feat(Topology/Sion): the minimax theorem of von Neumann - Sion |
Prove `Sion.exists_isSaddlePointOn` :
Let X and Y be convex subsets of topological vector spaces E and F,
X being moreover compact,
and let f : X × Y → ℝ be a function such that
- for all x, f(x, ⬝) is upper semicontinuous and quasiconcave
- for all y, f(⬝, y) is lower semicontinuous and quasiconvex
Then inf_x sup_y f(x,y) = sup_y inf_x f(x,y).
The classical case of the theorem assumes that f is continuous,
f(x, ⬝) is concave, f(⬝, y) is convex.
As a particular case, one get the von Neumann theorem where
f is bilinear and E, F are finite dimensional.
We follow the proof of Komiya (1988).
## Remark on implementation
* The essential part of the proof holds for a function
`f : X → Y → β`, where `β` is a complete dense linear order.
* We have written part of it for just a dense linear order,
* On the other hand, if the theorem holds for such `β`,
it must hold for any linear order, for the reason that
any linear order embeds into a complete dense linear order.
However, this result does not seem to be known to Mathlib.
* When `β` is `ℝ`, one can use `Real.toEReal` and one gets a proof for `ℝ`.
## TODO
Give particular important cases (eg, bilinear maps in finite dimension).
Co-authored with @ADedecker
---
- [x] depends on: #31548
- [x] depends on: #31547
- [x] depends on: #31558
[](https://gitpod.io/from-referrer/)
|
t-topology |
733/0 |
Mathlib.lean,Mathlib/Data/EReal/Basic.lean,Mathlib/Topology/Semicontinuity/Basic.lean,Mathlib/Topology/Sion.lean,docs/references.bib |
5 |
10 |
['AntoineChambert-Loir', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'riccardobrasca', 'thorimur'] |
dwrensha and kmill assignee:kmill assignee:dwrensha |
19-33187 19 days ago |
19-33187 19 days ago |
80-72731 80 days |
| 33944 |
artie2000 author:artie2000 |
feat(Algebra/Ring): formally real rings |
* Define formally real rings
* Prove basic inductive facts about them
Co-authored-by: Violeta Hernández Palacios
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
160/0 |
Mathlib.lean,Mathlib/Algebra/Ring/IsFormallyReal.lean |
2 |
24 |
['artie2000', 'github-actions', 'vihdzp'] |
mariainesdff assignee:mariainesdff |
19-27320 19 days ago |
28-15063 28 days ago |
30-17933 30 days |
| 34069 |
artie2000 author:artie2000 |
feat(Algebra/Order/Algebra): algebra is ordered iff inclusion map is monotone |
* Prove that an extension of ordered semirings forms an ordered algebra iff the inclusion map is injective
* Reorganise section variables for clarity
The typeclass `PartialOrder α` in `IsOrderedModule.of_algebraMap_mono` can be generalised to `Preorder α`. This has no mathematical application and all the other lemmas are proved over a partially ordered type, so this generalisation was not made.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-order
label:t-algebra$ |
18/7 |
Mathlib/Algebra/Order/Algebra.lean |
1 |
1 |
['github-actions'] |
pechersky assignee:pechersky |
19-27303 19 days ago |
45-31839 45 days ago |
45-33728 45 days |
| 34702 |
pfaffelh author:pfaffelh |
feat(Data/FinsetPowerset): The set `{v : List.Vector Bool n | v.val.count = k}` has cardinality `n.choose k` |
Show that `{v : List.Vector Bool n | v.val.count = k}` has cardinality `n.choose k`.
The proof builds on `powersetCard k s` (the subsets of `s : Finset _` with cardinality `k`), and an equivalence to the above set.
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-data
|
52/1 |
Mathlib/Data/Finset/Powerset.lean,Mathlib/Data/Fintype/Pi.lean,Mathlib/Logic/Equiv/Fintype.lean |
3 |
25 |
['DavidLedvinka', 'b-mehta', 'eric-wieser', 'github-actions', 'joneugster', 'pfaffelh'] |
pechersky assignee:pechersky |
19-20326 19 days ago |
27-23852 27 days ago |
30-37169 30 days |
| 34820 |
staroperator author:staroperator |
feat(Order/Ideal): more results on order ideals |
Some iffs, closure of finite supremum, and that every proper ideal is contained in a maximal ideal.
---
[](https://gitpod.io/from-referrer/)
|
t-order
large-import
|
79/5 |
Mathlib/Order/Ideal.lean |
1 |
5 |
['bryangingechen', 'github-actions', 'leanprover-radar', 'staroperator'] |
pechersky assignee:pechersky |
19-20325 19 days ago |
22-24908 22 days ago |
28-70729 28 days |
| 30900 |
vihdzp author:vihdzp |
feat: run-length encoding |
---
- [x] depends on: #30898
Moved from #17105.
[](https://gitpod.io/from-referrer/)
|
t-data |
167/0 |
Mathlib.lean,Mathlib/Data/List/RunLength.lean,Mathlib/Data/List/SplitBy.lean |
3 |
5 |
['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'plp127'] |
TwoFX assignee:TwoFX |
18-20319 18 days ago |
22-23656 22 days ago |
22-24126 22 days |
| 34948 |
joneugster author:joneugster |
feat(scripts/autolabel): add option to configure number of applied labels |
add option to change the maximum number of labels the script can apply simultaneously.
This does not change the behaviour of the script. The option remains at `1`, but it prepares for potential future adjustments.
factored out from: #34066
---
[](https://gitpod.io/from-referrer/)
|
CI |
13/9 |
scripts/autolabel.lean |
1 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
adomani assignee:adomani |
18-20038 18 days ago |
18-20058 18 days ago |
19-33063 19 days |
| 34677 |
joneugster author:joneugster |
feat(scripts/autolabel): add missing folders |
add the following rules for folders not covered by the script yet:
- `Mathlib/Geometry/Polygon` to `t-euclidean-geometry`
- `Mathlib/Geometry/Diffeology` to `t-differential-geometry`
- `Cache` to `ci`
---
[](https://gitpod.io/from-referrer/)
|
CI |
7/2 |
scripts/autolabel.lean |
1 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
18-17637 18 days ago |
18-17712 18 days ago |
18-17801 18 days |
| 35152 |
j-loreaux author:j-loreaux |
feat: add missing API for `lp E p` |
The API for `lp` is significantly underdeveloped. This PR attempts to rectify some of the shortcomings. In particular, we provide:
+ some missing tools for `Memℓp`, notably `memℓp_norm_iff` and `Memℓp.mono`.
+ some improved docstrings and more uniform notation for the non-dependent case; note that we also *remove* the notation `ℓ^∞(ι)` for `lp (fun _ : ι ↦ ℝ) ∞` on the basis that there are other choices besides `ℝ` which would make at least as much sense here, including `ℂ`.
+ bundled version of maps (evaluation, inclusion as a linear map, summation in `ℓ¹`)
as well as cleaning-up a few other odds and ends.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
189/26 |
Mathlib/Analysis/InnerProductSpace/l2Space.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Topology/MetricSpace/Kuratowski.lean |
3 |
1 |
['github-actions'] |
sgouezel assignee:sgouezel |
17-20311 17 days ago |
21-30420 21 days ago |
21-30311 21 days |
| 35398 |
vlad902 author:vlad902 |
feat(SimpleGraph): `bypass` lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
17/0 |
Mathlib/Combinatorics/SimpleGraph/Paths.lean |
1 |
1 |
['github-actions'] |
nobody |
16-65803 16 days ago |
16-67046 16 days ago |
16-66937 16 days |
| 35414 |
joneugster author:joneugster |
feat(Cache): Allow arguments of the form `Mathlib.Data.+` which correspond to a folder but not a file |
This PR continues the work from #21838.
Original PR: https://github.com/leanprover-community/mathlib4/pull/21838 |
CI
t-meta
|
74/31 |
Cache/IO.lean,Cache/Main.lean |
2 |
2 |
['github-actions', 'joneugster'] |
eric-wieser assignee:eric-wieser |
16-49083 16 days ago |
16-49907 16 days ago |
16-49798 16 days |
| 35413 |
joneugster author:joneugster |
fix(Util/CountHeartbeats): move elaboration in #count_heartbeats inside a namespace |
This PR continues the work from #21182.
Original PR: https://github.com/leanprover-community/mathlib4/pull/21182 |
t-meta |
73/6 |
Mathlib/Util/CountHeartbeats.lean,MathlibTest/CountHeartbeats.lean |
2 |
3 |
['github-actions', 'joneugster', 'mathlib-bors'] |
adomani assignee:adomani |
16-48165 16 days ago |
16-49979 16 days ago |
16-49870 16 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 |
43/0 |
Mathlib/Data/Sym/Sym2.lean |
1 |
7 |
['SnirBroshi', 'eric-wieser', 'github-actions'] |
pechersky assignee:pechersky |
16-40128 16 days ago |
26-77337 26 days ago |
26-77228 26 days |
| 33275 |
YuvalFilmus author:YuvalFilmus |
feat(Trigonometric/Chebyshev/Extremal): Chebyshev polynomials maximize iterated derivatives |
We prove that Chebyshev polynomials maximized iterated derivatives at points x≥1.
---
- [x] depends on: #33259
- [x] depends on: #33274
[](https://gitpod.io/from-referrer/)
|
t-analysis |
74/1 |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Extremal.lean |
1 |
6 |
['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
dupuisf assignee:dupuisf |
16-39438 16 days ago |
40-69363 40 days ago |
40-71585 40 days |
| 33850 |
YuvalFilmus author:YuvalFilmus |
feat(Chebyshev/ChebyshevGauss): Chebyshev–Gauss formula |
We prove the Chebyshev–Gauss quadrature formula, which reduces an integral with respect to the Chebyshev weight function to a finite sum.
---
- [ ] depends on: #33676
[](https://gitpod.io/from-referrer/)
|
t-analysis |
167/0 |
Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/ChebyshevGauss.lean |
2 |
4 |
['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
ADedecker assignee:ADedecker |
16-39371 16 days ago |
35-81050 35 days ago |
35-82529 35 days |
| 35017 |
robo7179 author:robo7179 |
feat(Combinatorics/SimpleGraph/Acyclic): add every nontrivial tree has atleast two leaves |
Added two theorems to prove that every non trivial tree has atleast two leaves (one in Finite the other in Acyclic).
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
94/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean |
2 |
24 |
['IvanRenison', 'SnirBroshi', 'github-actions', 'robo7179'] |
nobody |
16-34172 16 days ago |
16-36424 16 days ago |
22-44340 22 days |
| 34578 |
dennj author:dennj |
feat: define Boolean circuits over abstract gate families |
This PR introduces a foundation for Boolean circuits parameterized by abstract gate families.
## Main definitions
- `GateEval`: typeclass for gate families with Boolean semantics
- `GateHom`: arity-preserving maps between gate families
- `Circuit`: inductive type representing circuit syntax trees
- `AC0Gate`, `ACC0Gate`, `TC0Gate`: standard complexity-theoretic gate bases
## Design notes
The key design choice is to keep **syntax** (gate labels `G : Nat → Type`) separate from
**semantics** (`GateEval.eval`), allowing users to define custom gate families (e.g., MAJ, XOR,
arbitrary threshold gates) without modifying core definitions.
### Tree vs DAG representation
We evaluated two approaches for circuit representation:
1. **Tree-based** (this PR): Circuits as inductive syntax trees
2. **DAG-based**: Circuits as lists of gates with index-based references
We chose tree-based circuits because:
- **Compositionality**: Easy to build circuits via `gate g (fun i => subcircuit i)`
- **Type safety**: Arity-indexed gates (`G : Nat → Type`) catch errors at compile time
- **Manipulation**: Natural support for `mapGate`, `subst`, `mapInputs`
- **Mathlib philosophy**: Aligns with structural/compositional reasoning patterns
For use cases requiring explicit sharing (complexity analysis, evaluation efficiency),
a separate `DAG` type can be added later with proven equivalence via `Circuit.toDAG`.
The current representation serves as a minimal foundation for size/depth measures,
circuit families, and complexity classes (AC0, ACC0, TC0).
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-computability
|
919/0 |
Mathlib.lean,Mathlib/Computability/Circuit/Basic.lean,Mathlib/Computability/Formula/Basic.lean,Mathlib/Computability/Gate.lean |
4 |
18 |
['LLaurance', 'YuvalFilmus', 'dennj', 'github-actions'] |
nobody |
16-13776 16 days ago |
16-13776 16 days ago |
23-52894 23 days |
| 35418 |
vlad902 author:vlad902 |
feat(SimpleGraph): `IsAcyclic` iff not 2-edge-reachable |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
46/5 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Paths.lean |
3 |
3 |
['SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
15-78675 15 days ago |
16-34514 16 days ago |
16-34405 16 days |
| 33736 |
fbarroero author:fbarroero |
feat(RingTheory/Polynomial/GaussNorm): The `gaussNorm` is an absolute value if `v` is a nonarchimedean absolute value |
We prove
```
Polynomial.gaussNorm_isAbsoluteValue {c : ℝ} {R : Type*} [Ring R] {v : AbsoluteValue R ℝ}
(hna : IsNonarchimedean v) (hc : 0 < c) : IsAbsoluteValue (gaussNorm v c)
```
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
189/7 |
Mathlib/Algebra/Order/AbsoluteValue/Basic.lean,Mathlib/Algebra/Order/Ring/IsNonarchimedean.lean,Mathlib/RingTheory/Polynomial/GaussNorm.lean |
3 |
11 |
['copilot-pull-request-reviewer', 'erdOne', 'fbarroero', 'github-actions'] |
ADedecker assignee:ADedecker |
15-59547 15 days ago |
22-62287 22 days ago |
51-44438 51 days |
| 31425 |
robertmaxton42 author:robertmaxton42 |
feat(Topology): implement delaborators for non-standard topology notation |
Add delaborators for unary and binary notation related to non-standard topologies in the TopologicalSpace namespace.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
250/4 |
Mathlib.lean,Mathlib/Topology/Defs/Basic.lean,Mathlib/Util/DelabNonCanonical.lean,MathlibTest/Delab/TopologicalSpace.lean |
4 |
45 |
['eric-wieser', 'github-actions', 'jcommelin', 'kckennylau', 'robertmaxton42'] |
eric-wieser assignee:eric-wieser |
15-55360 15 days ago |
47-22529 47 days ago |
100-84327 100 days |
| 35400 |
vlad902 author:vlad902 |
feat(SimpleGraph): `IsEdgeReachable` lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
18/0 |
Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean |
1 |
7 |
['SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
15-35422 15 days ago |
16-65850 16 days ago |
16-65741 16 days |
| 34851 |
dennj author:dennj |
feat(Data/Matrix/Mul): add diagonal and transpose lemmas for vector operations |
This adds three lemmas for matrix-vector operations that serve as foundational support for future ML formalization:
- `vecMul_diagonal_dotProduct`: weighted inner product `x ᵥ* diagonal d ⬝ᵥ y = ∑ i, d i * x i * y i`
- `dotProduct_transpose_mulVec`: bilinear form symmetry `x ⬝ᵥ Aᵀ *ᵥ y = y ⬝ᵥ A *ᵥ x`
- `mul_diagonal_mulVec`: column-weighted sum `(A * diagonal d) *ᵥ x = ∑ i, (d i * x i) • A.col i`
These are basic linear algebra identities involving diagonal matrices and vector operations that appear frequently in machine learning contexts (weighted inner products, attention mechanisms, feature scaling, diagonal preconditioning). |
t-data
new-contributor
|
22/0 |
Mathlib/Data/Matrix/Mul.lean |
1 |
5 |
['dennj', 'eric-wieser', 'github-actions', 'themathqueen'] |
pechersky assignee:pechersky |
15-26336 15 days ago |
28-35812 28 days ago |
28-35703 28 days |
| 28546 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): basic setup of Zd, full shift, cylinders, pat… |
This PR adds a **group-generic** foundation for symbolic dynamics over an arbitrary group `G`, together with convenient specializations for `ℤ` and `ℤ^d`.
Summary of additions:
- **Full shift and shift action**
- `abbrev FullShift (A G) := G → A` (inherits product topology from the Π-type).
- Right shift `shift g x` with convention `(shift g x) h = x (h * g)`.
- **Cylinders and topology**
- `cylinder U x : Set (G → A)` for finite `U : Finset G`.
- Cylinders are open under `[DiscreteTopology A]`; with a finite alphabet they are also closed.
- Equality with dependent products:
`cylinder U x = Set.pi (↑U) (fun i => ({x i} : Set A))`, enabling use of the `Set.pi` API.
- **Patterns, occurrences, and subshifts**
- `Pattern A G` with finite `support : Finset G` and `data : support → A`.
- `Pattern.occursIn p x g` (occurrence at translate `g`) and the expected shift law.
- `forbids F` and `Subshift A G` (closed, shift-invariant subsets).
- `FixedSupport A G U` with an equivalence to `(U → A)` to obtain finiteness.
- **Language on finite shapes and counting**
- `languageOn X U`, `languageCardOn X U`, and `patternCountOn Y U`.
- **Entropy along a shape sequence**
- `limsupAtTop` (as an `sInf` of eventual upper bounds).
- `entropyAlong X F hF := limsup (log (patternCountOn X (F n) + 1) / |F n|)`
for any nonempty finite shapes `F : ℕ → Finset G` (the `+ 1` avoids `log 0`).
- **Specializations**
- `IntShapes`: segments `[-n,n]` on `Multiplicative ℤ`, with `entropy_Z`.
- `ZdShapes`: boxes `[-n,n]^d` on `ℤ^d` (as functions `Fin d → ℤ`), with `entropy_Zd`.
Mathematical remarks:
- The API is **shape-parametric**: entropy is defined along user-provided finite shapes.
- On **amenable** groups, using a **Følner** sequence yields a canonical value (Ornstein–Weiss).
This PR does not assume amenability; the family of shapes is an explicit input.
Motivation:
Provide a clean, reusable base for symbolic dynamics on groups in mathlib.
Future work:
- Add a Følner predicate and prove shape-independence / limit existence on amenable groups.
- Expand the `ℤ`/`ℤ^d` toolkit (alternative shapes, mixing, factors).
- Develop 1D theory and, longer-term, multidimensional SFT results (e.g. along the lines of Hochman–Meyerovitch).
|
t-dynamics
new-contributor
|
746/0 |
Mathlib.lean,Mathlib/Dynamics/SymbolicDynamics/Basic.lean,Mathlib/Tactic/Translate/ToAdditive.lean |
3 |
180 |
['Sfgangloff', 'botbaki-review', 'eric-wieser', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'sgouezel'] |
sgouezel assignee:sgouezel |
15-21805 15 days ago |
16-21103 16 days ago |
119-66864 119 days |
| 35360 |
vlad902 author:vlad902 |
chore: rename `cycleGraph_EulerianCircuit` to `cycleGraph.cycle` |
Per [this](https://github.com/leanprover-community/mathlib4/pull/34797#discussion_r2807963752) review feedback, this definition is inappropriately named with an underscore and should be renamed.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
21/17 |
Mathlib/Combinatorics/SimpleGraph/Circulant.lean,Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean |
2 |
2 |
['github-actions', 'vlad902'] |
nobody |
14-53353 14 days ago |
17-53396 17 days ago |
17-53287 17 days |
| 33252 |
SnirBroshi author:SnirBroshi |
chore(Combinatorics/SimpleGraph/Coloring): use `IsIndepSet` instead of `IsAntichain` to spell "a color class is an independent set" |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
6/2 |
Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Partition.lean |
2 |
1 |
['github-actions'] |
b-mehta assignee:b-mehta |
14-20323 14 days ago |
26-24109 26 days ago |
38-63735 38 days |
| 34193 |
bwangpj author:bwangpj |
feat(Topology/Algebra/Ring): ContinuousAddEquiv.mulLeft, mulRight |
The additive homeomorphism from a topological ring to itself, induced by left/right multiplication by a unit.
From FLT.
---
[](https://gitpod.io/from-referrer/)
|
t-topology
FLT
maintainer-merge
|
25/0 |
Mathlib/Topology/Algebra/Ring/Basic.lean |
1 |
10 |
['bwangpj', 'dagurtomas', 'eric-wieser', 'github-actions', 'riccardobrasca'] |
dagurtomas assignee:dagurtomas |
13-82173 13 days ago |
42-77072 42 days ago |
42-84230 42 days |
| 34954 |
brianrabern author:brianrabern |
feat(Combinatorics/SimpleGraph/Acyclic): add colorable and chromaticN… |
…umber bridges for acyclic and tree graphs
Add thin bridge lemmas expressing that acyclic graphs (forests) and trees
are 2-colorable, and that their chromatic number is at most 2, directly
in terms of `Colorable` and `chromaticNumber`.
The existing `IsAcyclic.isBipartite` already proves this via the
definitional equality `IsBipartite = Colorable 2`, but these bridges
improve discoverability for users who reason about `Colorable` or
`chromaticNumber` without passing through `IsBipartite`.
This is a first step toward building out the graph coloring API.
New declarations:
- `IsAcyclic.colorable_two`
- `IsTree.colorable_two`
- `IsAcyclic.chromaticNumber_le_two`
- `IsTree.chromaticNumber_le_two`
All are one-line proofs reusing existing results; no new imports needed.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
16/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean |
1 |
1 |
['github-actions'] |
b-mehta assignee:b-mehta |
13-20331 13 days ago |
25-44276 25 days ago |
25-44167 25 days |
| 34637 |
mcdoll author:mcdoll |
feat(Analysis/Distribution): support |
We define the support of distributions. The definition applies to both tempered and classical distributions, but for this PR we only prove some elementary statements for tempered distributions.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
241/0 |
Mathlib.lean,Mathlib/Analysis/Distribution/Support.lean |
2 |
14 |
['github-actions', 'lauramonk', 'mcdoll', 'urkud'] |
ADedecker assignee:ADedecker |
13-6542 13 days ago |
13-6601 13 days ago |
28-21961 28 days |
| 34298 |
CoolRmal author:CoolRmal |
feat(MeasureTheory): Integral over Ioi tends to zero |
This PR proves that if `f` is integrable on `Ioi a`, then `∫ x in Ioi (b i), f x ∂μ` tends to zero as `b i` tends to infinity. This is an easy corollary of `intervalIntegral_tendsto_integral_Ioi`.
---
- [x] depends on #34197
- [x] depends on #34289
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
20/0 |
Mathlib/MeasureTheory/Integral/IntegralEqImproper.lean |
1 |
4 |
['CoolRmal', 'github-actions', 'mcdoll'] |
thorimur assignee:thorimur |
13-3601 13 days ago |
13-3601 13 days ago |
41-4950 41 days |
| 30077 |
agjftucker author:agjftucker |
feat(Analysis/Calculus/ImplicitFunction): define implicitFunctionOfBivariate |
Two specializations of the implicit function theorem, one applying to an uncurried bivariate function and one applying to a curried bivariate function.
---
This PR is a synthesis of material from others which failed to make progress. But there seems always to have been a different reason for it, so I'm afraid I keep trying where maybe I shouldn't.
#26985 reviewed by j-loreaux and later on by winstonyin.
#16743 and #26300 reviewed by sgouezel.
[Zulip chat](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Inverse.20function.20theorem.20and.20ContinuousLinearEquiv/with/567586606) with Yury Kudryashov.
There are certain changes agreed upon in those PRs, e.g. to existing names, that are doubtless good but that I have excised from this PR to avoid distraction.
[](https://gitpod.io/from-referrer/)
|
t-analysis |
311/2 |
Mathlib.lean,Mathlib/Analysis/Calculus/FDeriv/Partial.lean,Mathlib/Analysis/Calculus/Implicit.lean,Mathlib/Analysis/Calculus/ImplicitFunction/Bivariate.lean,Mathlib/Analysis/Calculus/ImplicitFunction/ProdDomain.lean |
5 |
2 |
['github-actions', 'mathlib4-merge-conflict-bot'] |
ADedecker assignee:ADedecker |
12-20342 12 days ago |
15-33865 15 days ago |
30-8371 30 days |
| 35441 |
harahu author:harahu |
chore(NumberTheory): fix indentation in markdown lists |
Make sure to also indent subsequent lines of an item: this is required by the markdown specification (though not doc-gen), it expresses intent more clearly, and makes it easier to catch accidental misindentations.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
16/16 |
Mathlib/NumberTheory/ClassNumber/FunctionField.lean,Mathlib/NumberTheory/ModularForms/DedekindEta.lean,Mathlib/NumberTheory/NumberField/ClassNumber.lean,Mathlib/NumberTheory/NumberField/FractionalIdeal.lean,Mathlib/NumberTheory/NumberField/ProductFormula.lean,Mathlib/NumberTheory/Ostrowski.lean,Mathlib/NumberTheory/SiegelsLemma.lean |
7 |
1 |
['github-actions'] |
alexjbest assignee:alexjbest |
12-20330 12 days ago |
15-63610 15 days ago |
15-63937 15 days |
| 35447 |
themathqueen author:themathqueen |
feat(LinearAlgebra/UnitaryGroup): the transpose and conjugate of a unitary matrix as a unitary matrix |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
35/0 |
Mathlib/LinearAlgebra/UnitaryGroup.lean |
1 |
1 |
['github-actions'] |
kim-em assignee:kim-em |
12-20328 12 days ago |
15-54312 15 days ago |
15-55014 15 days |
| 35451 |
samueloettl author:samueloettl |
feat(MeasureTheory.Function): compMeasurePreserving_iterate |
---
These are useful for dynamics/ergodic theory.
Possibly some of these could be simp lemmas but I'm not confident enough to say that they are so I didn't mark them as such.
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
32/0 |
Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean |
2 |
2 |
['github-actions'] |
RemyDegenne assignee:RemyDegenne |
12-20328 12 days ago |
15-49926 15 days ago |
15-49817 15 days |
| 35458 |
harahu author:harahu |
chore(Algebra): fix indentation in markdown lists |
Make sure to also indent subsequent lines of an item: this is required by the markdown specification (though not doc-gen), it expresses intent more clearly, and makes it easier to catch accidental misindentations.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
51/51 |
Mathlib/Algebra/BigOperators/Group/Finset/Gaps.lean,Mathlib/Algebra/Homology/BifunctorShift.lean,Mathlib/Algebra/Homology/DerivedCategory/Basic.lean,Mathlib/Algebra/Homology/DerivedCategory/Ext/TStructure.lean,Mathlib/Algebra/Homology/Embedding/Basic.lean,Mathlib/Algebra/Homology/Linear.lean,Mathlib/Algebra/Homology/ShortComplex/Ab.lean,Mathlib/Algebra/Lie/Derivation/AdjointAction.lean,Mathlib/Algebra/Lie/Derivation/Basic.lean,Mathlib/Algebra/Lie/Derivation/Killing.lean,Mathlib/Algebra/Module/CharacterModule.lean,Mathlib/Algebra/Module/Submodule/Pointwise.lean,Mathlib/Algebra/Module/Submodule/Union.lean,Mathlib/Algebra/Module/ZLattice/Covolume.lean,Mathlib/Algebra/MvPolynomial/CommRing.lean,Mathlib/Algebra/MvPolynomial/Degrees.lean,Mathlib/Algebra/MvPolynomial/Equiv.lean,Mathlib/Algebra/MvPolynomial/PDeriv.lean,Mathlib/Algebra/MvPolynomial/Rename.lean,Mathlib/Algebra/MvPolynomial/Variables.lean,Mathlib/Algebra/Ring/Semireal/Defs.lean,Mathlib/Algebra/SkewMonoidAlgebra/Basic.lean |
22 |
1 |
['github-actions'] |
kim-em assignee:kim-em |
12-20326 12 days ago |
15-31787 15 days ago |
15-33694 15 days |
| 33121 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Hasse): paths in a graph are isomorphic to path graphs |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
43/1 |
Mathlib/Combinatorics/SimpleGraph/Hasse.lean |
1 |
23 |
['MrQubo', 'SnirBroshi', 'erdOne', 'github-actions', 'jcommelin', 'mitchell-horner'] |
b-mehta assignee:b-mehta |
12-17197 12 days ago |
12-17216 12 days ago |
70-84423 70 days |
| 34859 |
wwylele author:wwylele |
feat(MeasureTheory): WithLp 2 (U × V) → U × V is measure preserving |
Intermediate lemmas towards #34826, and analogue to three existing lemma in the same file:
```
theorem EuclideanSpace.volume_preserving_symm_measurableEquiv_toLp :
MeasurePreserving (MeasurableEquiv.toLp 2 (ι → ℝ)).symm := by
theorem PiLp.volume_preserving_ofLp : MeasurePreserving (@ofLp 2 (ι → ℝ)) :=
theorem PiLp.volume_preserving_toLp : MeasurePreserving (@toLp 2 (ι → ℝ)) :=
```
---
I am not very good at working with measure theory directly, so this implementation just reduces the problem to known lemmas, but it is pretty cumbersome. Golfing is welcome!
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
58/0 |
Mathlib/MeasureTheory/Measure/Haar/InnerProductSpace.lean |
1 |
6 |
['b-mehta', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] |
RemyDegenne assignee:RemyDegenne |
12-13268 12 days ago |
28-19642 28 days ago |
28-19533 28 days |
| 33292 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/LineGraph): lift copies/isomorphisms to line-graph |
Non-injective homomorphisms (`G →g G'`) cannot be lifted to a homomorphism on line-graphs (`G.lineGraph →g G'.lineGraph`) because e.g. `∀ k > 1` there is a homomorphism from `pathGraph k` to `G'` iff `G'` has an edge, and `∀ n > 0, (pathGraph (n + 1)).lineGraph ≃ pathGraph n`, but there is no homomorphism from `pathGraph k` to `pathGraph 1` because it has no edges.
So for `G := pathGraph 3` and `G' := pathGraph 2` there is a `G →g G'` but no `G.lineGraph →g G'.lineGraph`.
But we can lift `Copy`/`Embedding`/`Iso`.
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-combinatorics
|
45/4 |
Mathlib/Combinatorics/SimpleGraph/LineGraph.lean,Mathlib/Data/Sym/Sym2.lean |
2 |
6 |
['SnirBroshi', 'github-actions', 'tb65536'] |
b-mehta assignee:b-mehta |
12-12666 12 days ago |
12-14020 12 days ago |
65-74057 65 days |
| 35285 |
SnirBroshi author:SnirBroshi |
feat(Algebra/LinearRecurrence): define a standard basis for the solution space of a linear recurrence |
Also `mkSol` is injective.
---
The hard work was already done by the existing equivalence `toInit`; this defines the basis that the equivalence provides and uses it to simplify a couple of proofs.
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
24/12 |
Mathlib/Algebra/LinearRecurrence.lean |
1 |
1 |
['github-actions'] |
Vierkantor assignee:Vierkantor |
11-65399 11 days ago |
19-8686 19 days ago |
19-8577 19 days |
| 34315 |
LessnessRandomness author:LessnessRandomness |
feat(Combinatorics/SimpleGraph/Bipartite): Prove upper bound of edge set cardinality of bipartite graph |
Two ways to express upper bound of the edge set of bipartite graph:
1) If the cardinalities of both parts/sets, that make bipartite graph, are known, then the upper bound is equal to product of the cardinalities of both parts;
2) Four times of the cardinality of the edge set is less or equal to squared cardinality of vertex set.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
53/0 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean |
1 |
55 |
['LessnessRandomness', 'SnirBroshi', 'b-mehta', 'github-actions', 'vlad902'] |
awainverse assignee:awainverse |
11-62274 11 days ago |
11-63106 11 days ago |
35-71191 35 days |
| 34966 |
Deep0Thinking author:Deep0Thinking |
feat(MeasureTheory): add `continuousWithinAt_Ici/Iic_primitive_Ioi/Iio` and `continuousOn_Ici/Iic_primitive_Ioi/Iio/Ici/Iic` |
This PR proves:
- `continuousWithinAt_Ici/Iic_primitive_Ioi/Iio`
- `continuousOn_Ici/Iic_primitive_Ioi/Iio/Ici/Iic`
- `integral_Ioi_sub_Ioi`, `integral_Ioi_sub_Ioi'`, `integral_Iio_sub_Iio`, `integral_Iio_sub_Iio'`
- `Ioi_diff_Ioc`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
125/1 |
Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/Order/Interval/Set/LinearOrder.lean |
3 |
14 |
['CoolRmal', 'Deep0Thinking', 'github-actions'] |
RemyDegenne assignee:RemyDegenne |
11-48783 11 days ago |
12-14305 12 days ago |
23-79195 23 days |
| 34144 |
IvanRenison author:IvanRenison |
feat(Data/ENat): add lemma `ENat.iInf_eq_coe_iff` |
Co-authored-by: SnirBroshi <26556598+SnirBroshi@users.noreply.github.com>
---
[Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/ENat.2EiInf_eq_nat_iff/with/568699219)
[](https://gitpod.io/from-referrer/)
|
t-data |
21/0 |
Mathlib/Data/ENat/Lattice.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
3 |
16 |
['IvanRenison', 'Ruben-VandeVelde', 'SnirBroshi', 'eric-wieser', 'github-actions', 'tb65536'] |
TwoFX assignee:TwoFX |
11-37371 11 days ago |
11-37408 11 days ago |
39-60082 39 days |
| 35615 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Maps): lemmas about support |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
41/0 |
Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean |
2 |
1 |
['github-actions'] |
nobody |
11-24834 11 days ago |
11-24911 11 days ago |
11-24802 11 days |
| 35616 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Copy): `IsContained` and `IsIndContained` are preorders |
---
This makes `calc` work and provides `Std.Refl` and `IsTrans` instances.
`grw` still doesn't work and mixing the two predicates in `calc` (to prove `IsContained`) also doesn't work.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
20/0 |
Mathlib/Combinatorics/SimpleGraph/Copy.lean |
1 |
1 |
['github-actions'] |
nobody |
11-23966 11 days ago |
11-24045 11 days ago |
11-23936 11 days |
| 35613 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Clique): use `IsContained` instead of an explicit embedding from top |
This makes theorems require only a proof that a `Copy` exists rather than provide an explicit `Embedding`.
Also tag monotonicity lemmas with `@[gcongr]`.
---
This isn't a generalization per-se since one could use choice plus `Copy.topEmbedding` to upgrade the `IsContained` to an embedding, but `IsContained` makes more sense in theorems.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
37/36 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/Turan.lean |
3 |
1 |
['github-actions'] |
nobody |
11-23860 11 days ago |
11-23925 11 days ago |
11-24116 11 days |
| 35619 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Clique): intersection and union of cliques |
Plus a couple of lemmas.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
29/0 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean |
1 |
1 |
['github-actions'] |
nobody |
11-21697 11 days ago |
11-21790 11 days ago |
11-21681 11 days |
| 30526 |
SnirBroshi author:SnirBroshi |
chore(Logic/Relation): use `≤` to spell subrelation |
Replace every `∀ x y, r x y → r' x y` with `r ≤ r'`
---
[](https://gitpod.io/from-referrer/)
|
t-logic |
161/136 |
Mathlib.lean,Mathlib/Algebra/Category/Grp/FilteredColimits.lean,Mathlib/Algebra/Category/ModuleCat/FilteredColimits.lean,Mathlib/Algebra/Category/MonCat/FilteredColimits.lean,Mathlib/CategoryTheory/Action.lean,Mathlib/CategoryTheory/ConnectedComponents.lean,Mathlib/CategoryTheory/Filtered/Connected.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/CategoryTheory/Limits/Final.lean,Mathlib/CategoryTheory/Limits/Types/Coequalizers.lean,Mathlib/CategoryTheory/Limits/Types/Filtered.lean,Mathlib/Combinatorics/Enumerative/DyckWord.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Computability/ContextFreeGrammar.lean,Mathlib/Computability/TMConfig.lean,Mathlib/Data/PFunctor/Multivariate/M.lean,Mathlib/Data/Quot.lean,Mathlib/FieldTheory/PerfectClosure.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/Logic/Relation.lean,Mathlib/Order/Basic.lean,Mathlib/Order/Defs/Prop.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/Topology/Gluing.lean |
25 |
14 |
['SnirBroshi', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'thorimur', 'vihdzp'] |
thorimur assignee:thorimur |
11-21107 11 days ago |
11-45351 11 days ago |
41-31116 41 days |
| 35622 |
SnirBroshi author:SnirBroshi |
feat(Logic/Function/Basic): `onFun` and `swap` preserve relation properties |
---
[](https://gitpod.io/from-referrer/)
|
t-logic |
105/1 |
Mathlib/Logic/Function/Basic.lean,Mathlib/Logic/Function/Defs.lean,Mathlib/Order/Defs/Unbundled.lean |
3 |
4 |
['SnirBroshi', 'github-actions', 'vihdzp'] |
nobody |
10-70947 10 days ago |
11-13259 11 days ago |
11-13254 11 days |
| 35295 |
Rida-Hamadani author:Rida-Hamadani |
feat(SimpleGraph): `dropLast` of a cycle is a path |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
18/1 |
Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean |
2 |
6 |
['Rida-Hamadani', 'SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
10-31740 10 days ago |
10-59282 10 days ago |
12-6082 12 days |
| 35504 |
JoaBjo author:JoaBjo |
feat(Probability/Distributions/Exponential): add MGF, moments, and memoryless property |
feat(Probability/Distributions/Exponential): add MGF, moments, and memoryless property
Add the main analytic results for the exponential distribution:
- moment-generating function `mgf id (expMeasure r) t = r / (r - t)` for `t < r`
- mean `∫ x, x ∂(expMeasure r) = r⁻¹`
- variance `Var[id; expMeasure r] = r⁻¹ ^ 2`
- `ℒp` membership for all `p`
- tail probability `P(X > x) = exp (-(r * x))`
- memoryless property `P(X > s + t | X > s) = P(X > t)`
The MGF is computed by reducing to the known improper integral `∫ exp(c * x)` on `Ioi`,
and integrability is deduced by contradiction from the positive closed-form value.
The mean and variance are computed via the Gamma function integral
`∫₀^∞ x^(n-1) exp(-r x) dx = Γ(n) / rⁿ`. The memoryless property follows from
the exponential identity `exp(-(r(s+t))) = exp(-rt) * exp(-rs)`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
200/0 |
Mathlib/Probability/Distributions/Exponential.lean |
1 |
6 |
['JoaBjo', 'Timeroot', 'github-actions'] |
kex-y assignee:kex-y |
10-20331 10 days ago |
14-41209 14 days ago |
14-41100 14 days |
| 35011 |
whocares-abt author:whocares-abt |
feat(Combinatorics/SimpleGraph/Copy): add degree of copy less than original |
add two theorems relating degree of a graph and it's copy |
t-combinatorics
new-contributor
|
17/0 |
Mathlib/Combinatorics/SimpleGraph/Copy.lean |
1 |
12 |
['SnirBroshi', 'github-actions', 'themathqueen', 'vihdzp'] |
nobody |
9-81143 9 days ago |
23-81382 23 days ago |
23-81273 23 days |
| 35682 |
chenson2018 author:chenson2018 |
chore(Computability/Partrec): remove `linter.flexible` exceptions |
This removes all `set_option linter.flexible false` from this module. Some proofs simply required moving around the usage of `simp`. For others I used `grind`, which is permitted to follow flexible tactics. In all cases I prioritized leaving the structure of the proof either mostly as-is or slightly improving readability.
---
[](https://gitpod.io/from-referrer/)
|
t-computability
maintainer-merge
|
23/41 |
Mathlib/Computability/Partrec.lean |
1 |
6 |
['chenson2018', 'github-actions', 'grunweg'] |
nobody |
9-28551 9 days ago |
9-51184 9 days ago |
9-51075 9 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.
---
- [ ] depends on: #30436
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
332/1 |
Mathlib.lean,Mathlib/RingTheory/PowerSeries/Pentagonal.lean,Mathlib/Topology/Algebra/InfiniteSum/Pentagonal.lean,docs/1000.yaml |
4 |
21 |
['copilot-pull-request-reviewer', 'github-actions', 'jcommelin', 'mathlib4-dependent-issues-bot', 'urkud', 'vihdzp', 'wwylele'] |
kex-y assignee:kex-y |
9-26943 9 days ago |
34-34431 34 days ago |
68-4863 68 days |
| 33257 |
NickAdfor author:NickAdfor |
feat(Combinatorics/SimpleGraph/Bipartite): Odd Cycle Theorem (A Solution to TODO) |
Prove bipartite iff all cycles are even
This PR formalizes the classical graph theory theorem: a graph is bipartite if and only if all its cycles have even length.
Co-authored-by: Nick Adfor
Co-authored-by: Yue Sun
Co-authored-by: Aristotle AI
---
## Main results
- `SimpleGraph.bipartite_iff_all_cycles_even` : the main equivalence theorem
## Key supporting lemmas
- `SimpleGraph.even_length_iff_same_color` : parity lemma for 2-colorings
- `SimpleGraph.even_length_iff_even_bypass_length` : bypass length parity
- `SimpleGraph.even_cycle_length_of_path` : cycle construction lemma
- `SimpleGraph.bypass_eq_nil_of_closed` : closed path properties
## Proof outline
1. For bipartite graphs: use the 2-coloring to show that in a 2-coloring, a walk has even length iff its endpoints have the same color.
2. For cycles (start = end), this forces even length.
3. For the converse: if all cycles are even, construct a 2-coloring using the `two_colorable_iff_forall_loop_even` characterization.
4. Show this coloring is valid using bypass operations and path properties.
## Technical notes
- Uses `SimpleGraph.Walk` for path/cycle representation
- Handles both `IsPath` and `IsCycle` predicates
- Uses bypass operations (`takeUntil`, `dropUntil`, `bypass`) to analyze walks
- Requires `DecidableEq V` for some lemmas
- Uses classical logic for case analysis
## Reviewer notes
- The proof uses induction on walks and case analysis on colorings
- Some lemmas (like `even_length_iff_same_color`) could be extracted to more general locations
- All theorems are in the `SimpleGraph` namespace
- The `bipartite_iff_all_cycles_even` theorem provides the complete characterization |
t-combinatorics
new-contributor
|
164/8 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean |
2 |
70 |
['IvanRenison', 'NickAdfor', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'kmill', 'mitchell-horner', 'vihdzp', 'vlad902'] |
kmill assignee:kmill |
9-20330 9 days ago |
25-19264 25 days ago |
33-27101 33 days |
| 34599 |
cameronfreer author:cameronfreer |
feat(Logic/Equiv/Fintype): generalize toCompl and exists_extending_pair to finite source |
Generalize the Equiv subtype-extension API so it only needs finiteness of
the source subtype, then use that to drastically simplify
`Equiv.Perm.isMultiplyPretransitive`.
### Changes to `Logic/Equiv/Fintype.lean`
* **`Equiv.toCompl`**: generalize from `[Finite α]` to `[Finite {x | p x}]`.
New proof (due to tb65536) uses finset symmetric differences to avoid
needing finiteness of the ambient type.
* **`Equiv.extendSubtype`** and related lemmas: adapt to `[Finite {x | p x}]`.
* **`Equiv.Perm.exists_extending_pair`**: strengthen from `[Finite β]` to
`[Finite α]`. Given two injective functions `f, g : α → β` where `α` is
finite, there exists `σ : Perm β` with `σ ∘ f = g`. The target `β` can
now be infinite.
### Changes to `MultipleTransitivity.lean`
* **`Equiv.Perm.isMultiplyPretransitive`**: replace ~70-line manual
bijectivity construction with a two-line proof via
`exists_smul_eq_embedding`.
* **`exists_smul_eq_embedding`**: rewire to use `exists_extending_pair`
directly (removing the old cardinal-arithmetic proof
`exists_extending_pair_of_finite_source`).
### Application
Used in formalizing de Finetti's theorem (exchangeability ⇒ contractability):
https://github.com/cameronfreer/exchangeability/blob/03a854a2/Exchangeability/Contractability.lean#L459
Co-authored-by: tb65536 |
t-group-theory
new-contributor
|
49/77 |
Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/Logic/Equiv/Fintype.lean |
2 |
24 |
['LLaurance', 'cameronfreer', 'github-actions', 'mathlib-merge-conflicts', 'tb65536'] |
mattrobball assignee:mattrobball |
9-20329 9 days ago |
9-26712 9 days ago |
18-68097 18 days |
| 35440 |
harahu author:harahu |
chore(Order): fix indentation in markdown lists |
Make sure to also indent subsequent lines of an item: this is required by the markdown specification (though not doc-gen), it expresses intent more clearly, and makes it easier to catch accidental misindentations.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
11/11 |
Mathlib/Order/BourbakiWitt.lean,Mathlib/Order/GameAdd.lean,Mathlib/Order/Interval/Finset/Gaps.lean,Mathlib/Order/PrimeSeparator.lean |
4 |
1 |
['github-actions'] |
Vierkantor assignee:Vierkantor |
9-20322 9 days ago |
15-65876 15 days ago |
15-65767 15 days |
| 30982 |
jsm28 author:jsm28 |
feat(Geometry/Euclidean/Angle/Incenter): angle bisection and the incenter |
Add lemmas relating the incenter and excenters of a simplex to angle bisection, both generally for a simplex and more specifically with oriented angles for a triangle.
More specific lemmas for a simplex (identifying exactly which excenter corresponds to which bisectors) will require various additional API for bisectors of angles betweeen oriented affine subspaces (but for the most common applications to typical plane geometry problems, I expect the triangle lemmas with oriented angles to be more useful).
---
- [ ] depends on: #30474
- [ ] depends on: #30477
- [ ] depends on: #30600
- [ ] depends on: #30703
- [ ] depends on: #30938
- [ ] depends on: #30981
[](https://gitpod.io/from-referrer/)
|
t-euclidean-geometry |
269/0 |
Mathlib.lean,Mathlib/Geometry/Euclidean/Angle/Incenter.lean |
2 |
6 |
['Parcly-Taxel', 'github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'wwylele'] |
JovanGerb assignee:JovanGerb |
9-18650 9 days ago |
22-60338 22 days ago |
22-62707 22 days |
| 35642 |
SnirBroshi author:SnirBroshi |
feat(SimpleGraph/Walks/Operations): `p.dropLast.length` lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
12/1 |
Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean |
1 |
1 |
['github-actions', 'vlad902'] |
nobody |
8-74492 8 days ago |
10-71380 10 days ago |
10-71271 10 days |
| 31046 |
Thmoas-Guan author:Thmoas-Guan |
feat(Homology) : compatibility of map between `Ext` |
In this PR, we proved the compatibility of map between `Ext` induced by exact functor with
1: `mk_0` 2: `comp` 3: `extClass`
---
- [x] depends on: #31707
[](https://gitpod.io/from-referrer/) |
t-category-theory |
232/1 |
Mathlib/Algebra/Homology/DerivedCategory/Ext/Map.lean,Mathlib/Algebra/Homology/DerivedCategory/ShortExact.lean,Mathlib/Algebra/Homology/HomologicalComplexAbelian.lean,Mathlib/Algebra/Homology/HomotopyCategory/ShortExact.lean |
4 |
20 |
['Thmoas-Guan', 'dagurtomas', 'github-actions', 'joelriou', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'robin-carlier'] |
eric-wieser assignee:eric-wieser |
8-64408 8 days ago |
8-64408 8 days ago |
21-13661 21 days |
| 35150 |
JovanGerb author:JovanGerb |
chore(Order/OrderDual): move material on `OrderDual` |
This PR moves material about `OrderDual` from `Mathlib.Order.Synonym` to `Mathlib.Order.OrderDual`, so that these two files become independent. This way, `Mathlib.Order.Synonym` will not be on the long pole.
Note: it seems that the file `Mathlib.Order.Synonym` used to define `OrderDual`. Maybe that file should now be renamed to `Order.Lex`?
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-order
|
75/76 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Data/Fintype/Defs.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Data/PSigma/Order.lean,Mathlib/Data/Prod/Lex.lean,Mathlib/Data/Sigma/Order.lean,Mathlib/Data/Sum/Order.lean,Mathlib/Order/Compare.lean,Mathlib/Order/Max.lean,Mathlib/Order/Monotone/Defs.lean,Mathlib/Order/OrderDual.lean,Mathlib/Order/PiLex.lean,Mathlib/Order/Synonym.lean |
14 |
3 |
['MichaelStollBayreuth', 'bryangingechen', 'github-actions'] |
Vierkantor assignee:Vierkantor |
8-59848 8 days ago |
21-29636 21 days ago |
21-30128 21 days |
| 35631 |
SnirBroshi author:SnirBroshi |
feat(SimpleGraph/Walks/Operations): `p.dropLast.support` lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
9/0 |
Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean |
1 |
2 |
['github-actions', 'vlad902'] |
nobody |
8-57604 8 days ago |
10-72761 10 days ago |
10-74317 10 days |
| 35493 |
xroblot author:xroblot |
feat(RamificationInertia): add `ramificationIdx_algebra_tower'` |
The result [Ideal.ramificationIdx_algebra_tower](https://leanprover-community.github.io/mathlib4_docs/Mathlib/NumberTheory/RamificationInertia/Basic.html#Ideal.ramificationIdx_algebra_tower) is stated in a very general situation whereas most of its applications should be when there is a tower of prime ideals like in [Ideal.inertiaDeg_algebra_tower](https://leanprover-community.github.io/mathlib4_docs/Mathlib/NumberTheory/RamificationInertia/Basic.html#Ideal.inertiaDeg_algebra_tower).
This PR adds a version of `Ideal.ramificationIdx_algebra_tower` specialized to this case. The instances needed are stronger but there is no side condition. I believe that this corresponds to the more useful situation and thus I replaced all the use of `Ideal.ramificationIdx_algebra_tower` by the new version even if that means having to adjust the hypotheses.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
37/24 |
Mathlib/NumberTheory/NumberField/Cyclotomic/Ideal.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Galois.lean,Mathlib/RingTheory/Localization/AtPrime/Extension.lean |
4 |
3 |
['MichaelStollBayreuth', 'github-actions', 'xroblot'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
8-48401 8 days ago |
14-55474 14 days ago |
14-55365 14 days |
| 35664 |
Rida-Hamadani author:Rida-Hamadani |
feat(SimpleGraph): the adjacency matrix of empty and complete graphs |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
11/0 |
Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean |
1 |
2 |
['IvanRenison', 'github-actions'] |
nobody |
8-42293 8 days ago |
10-23169 10 days ago |
10-23060 10 days |
| 35292 |
Rida-Hamadani author:Rida-Hamadani |
feat(SimpleGraph): taking twice from a walk equals taking the minimum |
this is an analogue to `List.take_take`.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
5/0 |
Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean |
1 |
2 |
['SnirBroshi', 'github-actions'] |
nobody |
8-24699 8 days ago |
18-70993 18 days ago |
18-70884 18 days |
| 28248 |
YaelDillies author:YaelDillies |
feat: binomial random variables |
Define the binomial distribution and compute the expectation, variance, conditional variance of a binomial random variable.
From MiscYD
---
- [x] depends on: #31908
- [x] depends on: #31910
- [x] depends on: #31942
- [x] depends on: #31947
- [x] depends on: #34367
- [x] depends on: #34370
- [x] depends on: #34374
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
232/0 |
Mathlib.lean,Mathlib/MeasureTheory/Integral/Bochner/Set.lean,Mathlib/Probability/Distributions/Binomial.lean |
3 |
64 |
['DavidLedvinka', 'RemyDegenne', 'YaelDillies', 'b-mehta', 'eric-wieser', 'github-actions', 'kex-y', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'pfaffelh', 'themathqueen'] |
kex-y assignee:kex-y |
8-20995 8 days ago |
16-59540 16 days ago |
54-40649 54 days |
| 33985 |
YellPika author:YellPika |
feat(Order/OmegaCompletePartialOrder): `OmegaCompletePartialOrder` instance for `Sum` with basic `ωScottContinuous` lemmas |
This PR adds an `OmegaCompletePartialOrder` instance for `Sum`, along with `ωScottContinuous` lemmas for basic operations (`inl`, `inr`, `elim`). Appropriate lemmas are marked with `@[fun_prop]` so that the `fun_prop` tactic can automatically deduce `ωScottContinuous` proofs for functions involving `Sum`s (e.g. see the proof of `Sum.ωScottContinuous_map`).
---
- [x] depends on: #33941
[](https://gitpod.io/from-referrer/)
|
new-contributor
large-import
t-order
|
191/1 |
Mathlib/Data/Sum/Basic.lean,Mathlib/Data/Sum/Order.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/ScottContinuity.lean |
4 |
20 |
['Vierkantor', 'YellPika', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
bryangingechen assignee:bryangingechen |
8-20310 8 days ago |
19-48473 19 days ago |
29-10616 29 days |
| 34697 |
wwylele author:wwylele |
feat(Geometry/Euclidean): the Euclidean volume measure |
This PR starts a series to set up volume measure for Euclidean geometry, so it can be used in formalizing problems involving area and volume.
This PR only introduce the basic definition and properties. Some future PR will also include
- Integral along an affine subspace to calculate the volume of an object
- Define volume of a simplex using the base * height / n formula (not assuming measurability)
- Show that the defined volume matches the measure of the interior (see the draft #34826 for the target lemma)
- More specialized formula for the area of triangles.
---
Zulip thread: [#Is there code for X? > Measure on affine space](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/Measure.20on.20affine.20space/with/570193872)
[](https://gitpod.io/from-referrer/)
|
t-euclidean-geometry
t-measure-probability
|
165/0 |
Mathlib.lean,Mathlib/Geometry/Euclidean/Volume/Measure.lean |
2 |
11 |
['copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] |
urkud assignee:urkud |
8-20309 8 days ago |
28-58059 28 days ago |
31-33033 31 days |
| 35042 |
JovanGerb author:JovanGerb |
chore: remove `meta` form `import Mathlib.Tactic...` |
This PR cleans up some imports of the form `import Mathlib.Tactic...`, by either removing them entirely, or removing the `meta` keyword. It should never be necessary to `meta import` a file from `Mathlib.Tactic`, because the relevant definitions should already have been marked as `meta`.
The motivation is to reduce the amount of files that are `meta` imported when writing e.g. `import Mathlib`, hence reducing the amount of stuff that needs to be loaded. There are more other `meta import`s that need to be removed, but this PR is a good start.
---
[](https://gitpod.io/from-referrer/)
|
large-import |
61/142 |
Mathlib/Algebra/BigOperators/Group/Finset/Defs.lean,Mathlib/Algebra/FreeMonoid/Basic.lean,Mathlib/Algebra/Group/Action/Hom.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/CategoryTheory/Functor/Basic.lean,Mathlib/Data/List/ChainOfFn.lean,Mathlib/Dynamics/OmegaLimit.lean,Mathlib/GroupTheory/GroupAction/Defs.lean,Mathlib/GroupTheory/GroupAction/DomAct/Basic.lean,Mathlib/Tactic/Algebraize.lean,Mathlib/Tactic/ApplyFun.lean,Mathlib/Tactic/ArithMult.lean,Mathlib/Tactic/Bound.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Bicategory/Normalize.lean,Mathlib/Tactic/CategoryTheory/Bicategory/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/CheckCompositions.lean,Mathlib/Tactic/CategoryTheory/Coherence/Basic.lean,Mathlib/Tactic/CategoryTheory/Coherence/Normalize.lean,Mathlib/Tactic/CategoryTheory/Coherence/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/Elementwise.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Datatypes.lean,Mathlib/Tactic/CategoryTheory/Monoidal/Normalize.lean,Mathlib/Tactic/CategoryTheory/Monoidal/PureCoherence.lean,Mathlib/Tactic/CategoryTheory/ToApp.lean,Mathlib/Tactic/Choose.lean,Mathlib/Tactic/DeclarationNames.lean,Mathlib/Tactic/DefEqTransformations.lean,Mathlib/Tactic/DeriveCountable.lean,Mathlib/Tactic/DeriveFintype.lean,Mathlib/Tactic/DeriveTraversable.lean,Mathlib/Tactic/ENatToNat.lean,Mathlib/Tactic/Explode.lean,Mathlib/Tactic/Explode/Pretty.lean,Mathlib/Tactic/FinCases.lean,Mathlib/Tactic/FunProp.lean,Mathlib/Tactic/FunProp/Attr.lean,Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Theorems.lean,Mathlib/Tactic/FunProp/Types.lean,Mathlib/Tactic/GCongr/Core.lean,Mathlib/Tactic/GRewrite/Elab.lean,Mathlib/Tactic/Group.lean,Mathlib/Tactic/IrreducibleDef.lean,Mathlib/Tactic/Lift.lean,Mathlib/Tactic/Linarith.lean,Mathlib/Tactic/Linarith/Lemmas.lean,Mathlib/Tactic/Linarith/Oracle/FourierMotzkin.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/Gauss.lean,Mathlib/Tactic/Linarith/Oracle/SimplexAlgorithm/SimplexAlgorithm.lean,Mathlib/Tactic/Linarith/Preprocessing.lean,Mathlib/Tactic/Linarith/Verification.lean,Mathlib/Tactic/LinearCombination/Lemmas.lean,Mathlib/Tactic/Linter/DeprecatedSyntaxLinter.lean,Mathlib/Tactic/Linter/DocPrime.lean,Mathlib/Tactic/Linter/DocString.lean,Mathlib/Tactic/Linter/EmptyLine.lean,Mathlib/Tactic/Linter/FlexibleLinter.lean,Mathlib/Tactic/Linter/GlobalAttributeIn.lean,Mathlib/Tactic/Linter/HashCommandLinter.lean,Mathlib/Tactic/Linter/Multigoal.lean,Mathlib/Tactic/Linter/OldObtain.lean,Mathlib/Tactic/Linter/Style.lean,Mathlib/Tactic/Linter/TextBased.lean,Mathlib/Tactic/Linter/TextBased/UnicodeLinter.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,Mathlib/Tactic/Linter/UnusedTacticExtension.lean,Mathlib/Tactic/MinImports.lean,Mathlib/Tactic/MoveAdd.lean,Mathlib/Tactic/Nontriviality/Core.lean,Mathlib/Tactic/NormNum/DivMod.lean,Mathlib/Tactic/NormNum/Ineq.lean,Mathlib/Tactic/NormNum/Prime.lean,Mathlib/Tactic/Order.lean,Mathlib/Tactic/Order/CollectFacts.lean,Mathlib/Tactic/Order/Graph/Tarjan.lean,Mathlib/Tactic/PNatToNat.lean,Mathlib/Tactic/Peel.lean,Mathlib/Tactic/ProdAssoc.lean,Mathlib/Tactic/ProxyType.lean,Mathlib/Tactic/Push.lean,Mathlib/Tactic/Qify.lean,Mathlib/Tactic/RSuffices.lean,Mathlib/Tactic/Ring/Basic.lean,Mathlib/Tactic/Ring/Common.lean,Mathlib/Tactic/Ring/Compare.lean,Mathlib/Tactic/Ring/PNat.lean,Mathlib/Tactic/Simproc/Divisors.lean,Mathlib/Tactic/Simproc/FinsetInterval.lean,Mathlib/Tactic/Simps/Basic.lean,Mathlib/Tactic/Subsingleton.lean,Mathlib/Tactic/TacticAnalysis/Declarations.lean,Mathlib/Tactic/TautoSet.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/TagUnfoldBoundary.lean,Mathlib/Tactic/Widget/Calc.lean,Mathlib/Tactic/Widget/CommDiag.lean,Mathlib/Tactic/Widget/CongrM.lean |
107 |
7 |
['JovanGerb', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] |
dupuisf assignee:dupuisf |
8-20306 8 days ago |
11-72841 11 days ago |
15-67210 15 days |
| 35273 |
grunweg author:grunweg |
chore: replace `continuity` -> `fun_prop` in remaining auto-parameters |
Resurrected version of #13994. Let's look at the current fall-out and performance effect.
---
- [x] depends on: #35278
[](https://gitpod.io/from-referrer/)
|
t-topology |
23/16 |
Mathlib/Analysis/Convex/PathConnected.lean,Mathlib/Analysis/LocallyConvex/WeakSpace.lean,Mathlib/Analysis/SpecialFunctions/Arcosh.lean,Mathlib/Topology/Algebra/Algebra.lean,Mathlib/Topology/Algebra/Category/ProfiniteGrp/Basic.lean,Mathlib/Topology/Algebra/ContinuousMonoidHom.lean,Mathlib/Topology/Algebra/Module/Equiv.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean,Mathlib/Topology/Algebra/SeparationQuotient/Basic.lean,Mathlib/Topology/Category/TopCat/Limits/Products.lean,Mathlib/Topology/Category/TopCat/ULift.lean,Mathlib/Topology/ContinuousMap/Basic.lean,Mathlib/Topology/ContinuousMap/Defs.lean,Mathlib/Topology/FiberPartition.lean |
14 |
4 |
['github-actions', 'grunweg', 'leanprover-radar', 'mathlib-dependent-issues'] |
urkud assignee:urkud |
8-20305 8 days ago |
14-76643 14 days ago |
15-3626 15 days |
| 35481 |
FrankieeW author:FrankieeW |
chore(NumberTheory/Zsqrtd): inline duplicated order lemmas into instances |
This PR follows reviewer feedback by removing duplicated order/additive wrapper theorems in `Zsqrtd` and inlining the proofs into the corresponding typeclass instances.
Changes include:
- remove redundant wrappers such as `Zsqrtd.le_total`, `Zsqrtd.add_le_add_left`, `Zsqrtd.le_of_add_le_add_left`, `Zsqrtd.add_lt_add_left`, and `Zsqrtd.le_antisymm`
- keep the canonical API through `LinearOrder` / ordered additive structure fields
- update downstream use in `PellMatiyasevic` to the canonical theorem (`_root_.le_antisymm`)
This reduces namespace-level duplicate APIs and keeps proofs aligned with standard typeclass lemmas.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-number-theory
|
26/10 |
Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean |
2 |
8 |
['FrankieeW', 'github-actions', 'vihdzp'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
8-20302 8 days ago |
13-15298 13 days ago |
14-57430 14 days |
| 35565 |
felixpernegger author:felixpernegger |
feat(Topology): sequentially T2 spaces |
Adds typeclass for topoligcal spaces where convergent sequences have a unique limit. This lies between T2 and T1 and is occassionally useful when T2 is not strictly required.
An example of a non T2 space with unique limit is the one point compactification of Q.
There are some more implications not in this PR, see https://topology.pi-base.org/properties/P000099
In particular, (countably) compact sets are closed in sequentially T2 spaces.
|
t-topology |
135/0 |
Mathlib.lean,Mathlib/Topology/SequentiallyHausdorff.lean |
2 |
1 |
['github-actions'] |
urkud assignee:urkud |
8-20300 8 days ago |
12-66998 12 days ago |
12-67433 12 days |
| 35590 |
chrisflav author:chrisflav |
feat(Algebra): add `AlgHom.ulift` |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
71/3 |
Mathlib/Algebra/Algebra/Basic.lean,Mathlib/Algebra/Algebra/Equiv.lean,Mathlib/Algebra/Ring/ULift.lean |
3 |
4 |
['chrisflav', 'github-actions', 'wwylele'] |
kim-em assignee:kim-em |
8-20295 8 days ago |
12-25906 12 days ago |
12-25797 12 days |
| 35280 |
khwilson author:khwilson |
feat(Mathlib/Analysis/Polynomial/MahlerMeasure): Mahler Measure estimate in terms of supNorm |
The Mahler measure of a polynomial is bounded above by `√(p.natDegree + 1) * p.supNorm`. This is a tighter estimate than `(p.natDegree + 1) * p.supNorm`, which is implied by `mahlerMeasure_le_sum_norm_coeff`.
AI Usage: Claude Code (Opus 4.6) provided first drafts for several sorries in the main calc block. Gemini Pro was used for one-off looks ups of lemma names like `ae_restrict_iff'`. The final code was edited by me.
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
67/0 |
Mathlib/Analysis/Polynomial/MahlerMeasure.lean |
1 |
12 |
['github-actions', 'j-loreaux', 'khwilson', 'mathlib-merge-conflicts'] |
j-loreaux assignee:j-loreaux |
8-13726 8 days ago |
8-13779 8 days ago |
18-19898 18 days |
| 33364 |
BoltonBailey author:BoltonBailey |
feat(Analysis/Convex/SimplicialComplex): add AbstractSimplicialComplex + constructions |
This adds the concept of [abstract simplicial complex](https://en.wikipedia.org/wiki/Abstract_simplicial_complex) (and refactors SimplicialComplex in terms of it).
It also adds constructions that makes it easy to define a simplicial complex for any index family of points which is downward closed and which is affinely independent. I also include a construction of (abstract and geometric) simplicial complexes associated with a SimpleGraph, where vertices become 0-faces and edges become 1-faces, which could be useful later in defining the topological notion of a graph embedding.
Co-authored-by: Claude Opus 4.5
---
- [x] depends on: #35115
[](https://gitpod.io/from-referrer/)
|
t-analysis
t-algebraic-topology
maintainer-merge
|
440/16 |
Mathlib.lean,Mathlib/AlgebraicTopology/SimplicialComplex/Basic.lean,Mathlib/Analysis/Convex/SimplicialComplex/AffineIndependentUnion.lean,Mathlib/Analysis/Convex/SimplicialComplex/Basic.lean,Mathlib/Data/Sym/Sym2.lean,Mathlib/LinearAlgebra/AffineSpace/Independent.lean,Mathlib/Order/UpperLower/Relative.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean |
8 |
30 |
['BoltonBailey', 'denisgorod', 'eric-wieser', 'github-actions', 'j-loreaux', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'peabrainiac'] |
j-loreaux assignee:j-loreaux |
8-7877 8 days ago |
8-7947 8 days ago |
20-12082 20 days |
| 34364 |
YuvalFilmus author:YuvalFilmus |
feat(Chebyshev/RootsExtrema): bound iterated derivatives of Chebyshev T on [-1, 1] |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
72/4 |
Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/RootsExtrema.lean,Mathlib/RingTheory/Polynomial/Chebyshev.lean |
2 |
16 |
['YuvalFilmus', 'eric-wieser', 'github-actions', 'j-loreaux'] |
eric-wieser assignee:eric-wieser |
7-74435 7 days ago |
7-74497 7 days ago |
39-27696 39 days |
| 34871 |
zhuyizheng author:zhuyizheng |
feat(Calculus): Taylor with integral remainder |
This PR proves Taylor's theorem with the integral remainder. It provides two versions:
1. based on $f^{(n)}$ is absolutely continuous
2. based on $f \in C^{(n+1)}$
It also weakens the hypotheses `(hx : x₀ < x)` to `(hx : x₀ ≠ x)` in the following theorems:
- `taylor_mean_remainder`
- `taylor_mean_remainder_lagrange`
- `taylor_mean_remainder_lagrange_iteratedDeriv`
- `taylor_mean_remainder_cauchy`
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-analysis
|
215/71 |
Mathlib/Analysis/Calculus/ContDiff/Deriv.lean,Mathlib/Analysis/Calculus/IteratedDeriv/Defs.lean,Mathlib/Analysis/Calculus/Taylor.lean,Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean,Mathlib/Probability/Moments/MGFAnalytic.lean,Mathlib/Topology/Algebra/InfiniteSum/TsumUniformlyOn.lean,docs/undergrad.yaml |
7 |
7 |
['Komyyy', 'b-mehta', 'github-actions', 'joneugster', 'mathlib-merge-conflicts', 'zhuyizheng'] |
sgouezel assignee:sgouezel |
7-60499 7 days ago |
7-60522 7 days ago |
24-1826 24 days |
| 33662 |
Pjotr5 author:Pjotr5 |
feat(Algebra/Order/BigOperators/Expect): add lemmas and strict variants |
### Summary
- Combine `le_expect_nonempty_of_subadditive` and `le_expect_of_subadditive` into a single lemma `le_expect_of_subadditive`.
The extra assumptions `(hs : s.Nonempty)` and `(h_zero : m 0 = 0)` are unnecessary (since `m 0 = 0` follows from `h_div`).
This requires a small downstream update to `Mathlib/Analysis/RCLike/Basic.lean` (`norm_expect_le`).
- Add strict-inequality variants:
`expect_lt_expect`, `expect_lt`, `lt_expect`.
- Add existence lemmas:
`exists_le_of_expect_le_expect`, `exists_le_of_le_expect`, `exists_le_of_expect_le`,
and `exists_lt_of_expect_lt_expect`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
label:t-algebra$ |
46/16 |
Mathlib/Algebra/Order/BigOperators/Expect.lean,Mathlib/Analysis/RCLike/Basic.lean |
2 |
1 |
['github-actions'] |
thorimur assignee:thorimur |
7-58189 7 days ago |
57-76984 57 days ago |
57-76875 57 days |
| 30505 |
mariainesdff author:mariainesdff |
feat(NumberTheory/RatFunc/Ostrowski): prove Ostrowski's theorem for K(X) |
We prove Ostrowski's theorem for the field of rational functions `K(X)`, where `K` is any field.
Co-authored-by: @xgenereux
---
- [x] depends on: #30404
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-number-theory
label:t-algebra$ |
338/13 |
Mathlib.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/FieldTheory/RatFunc/Degree.lean,Mathlib/NumberTheory/FunctionField.lean,Mathlib/NumberTheory/RatFunc/Ostrowski.lean |
5 |
38 |
['MichaelStollBayreuth', 'alreadydone', 'github-actions', 'mariainesdff', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
7-54533 7 days ago |
7-54533 7 days ago |
10-7264 10 days |
| 34154 |
euprunin author:euprunin |
chore: golf using `grind` (and add four supporting `grind` annotations) |
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (shown if ≥10 ms before or after):
* `Orientation.nonneg_inner_and_areaForm_eq_zero_iff_sameRay`: 311 ms before, 284 ms after 🎉
* `UV.compression_self`: 29 ms before, 19 ms after 🎉
* `IsSepClosed.exists_root_C_mul_X_pow_add_C_mul_X_add_C`: 405 ms before, 291 ms after 🎉
* `InnerProductGeometry.norm_add_eq_add_norm_iff_angle_eq_zero`: 425 ms before, 309 ms after 🎉
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
9/30 |
Mathlib/Algebra/Polynomial/Degree/Defs.lean,Mathlib/Algebra/Polynomial/Degree/Operations.lean,Mathlib/Analysis/InnerProductSpace/TwoDim.lean,Mathlib/Combinatorics/SetFamily/Compression/UV.lean,Mathlib/FieldTheory/IsSepClosed.lean,Mathlib/Geometry/Euclidean/Angle/Unoriented/Basic.lean |
6 |
13 |
['Parcly-Taxel', 'euprunin', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'tb65536'] |
kim-em assignee:kim-em |
7-46663 7 days ago |
7-67460 7 days ago |
35-80108 35 days |
| 35740 |
LLaurance author:LLaurance |
chore(SimpleGraph/Basic): clean up and shorten |
Clean up and shorten some proofs
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
43/50 |
Mathlib/Combinatorics/SimpleGraph/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
7-28607 7 days ago |
7-28868 7 days ago |
7-28759 7 days |
| 34760 |
astrainfinita author:astrainfinita |
chore: use `RelHomClass` in `IsChain.image` |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
24/24 |
Counterexamples/AharoniKorman.lean,Mathlib/Order/Height.lean,Mathlib/Order/Preorder/Chain.lean |
3 |
5 |
['Vierkantor', 'astrainfinita', 'github-actions'] |
Vierkantor assignee:Vierkantor |
7-21969 7 days ago |
7-21969 7 days ago |
17-41367 17 days |
| 35402 |
samueloettl author:samueloettl |
feat(Dynamics/BirkhoffSum): birkhoffAverage const |
---
I think this might be useful.
My feeling tells me that 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
|
22/0 |
Mathlib/Dynamics/BirkhoffSum/Average.lean |
1 |
2 |
['github-actions'] |
urkud assignee:urkud |
7-20332 7 days ago |
10-30006 10 days ago |
16-63185 16 days |
| 31595 |
astrainfinita author:astrainfinita |
chore: redefine `Ideal.IsPrime` |
Redefine `Ideal.IsPrime` to make it correct for non-commutative cases
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
333/100 |
Mathlib/Algebra/Order/Ring/Ordering/Defs.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/GradedAlgebra/Radical.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Basic.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/Ideal/Maximal.lean,Mathlib/RingTheory/Ideal/MinimalPrime/Noetherian.lean,Mathlib/RingTheory/Ideal/Oka.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Over.lean,Mathlib/RingTheory/Ideal/Pointwise.lean,Mathlib/RingTheory/Ideal/Prime.lean,Mathlib/RingTheory/Ideal/Prod.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/IsPrimary.lean,Mathlib/RingTheory/Localization/AtPrime/Basic.lean,Mathlib/RingTheory/Localization/Ideal.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/RingTheory/Spectrum/Prime/Topology.lean,Mathlib/RingTheory/Valuation/Basic.lean |
22 |
32 |
['alreadydone', 'artie2000', 'astrainfinita', 'erdOne', 'github-actions', 'leanprover-bot', 'leanprover-radar', 'mathlib4-merge-conflict-bot'] |
alreadydone assignee:alreadydone |
7-9221 7 days ago |
7-13617 7 days ago |
35-73466 35 days |
| 35530 |
xroblot author:xroblot |
feat(RingTheory): add the class `HasFiniteQuotients` |
As discussed on [Zulip](https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Rings.20with.20finite.20quotients/with/574554760), this PR add the class of commutative rings `R` such that, for all nonzero ideals `I` of `R`, the quotient `R ⧸ I` is finite and prove several results including:
- If `R` has finite quotients then it has dimension ≤ 1
- If `R` has finite quotients then it is a Noetherian ring
- Assume that `R` a finite quotients and that `S` is a domain and a finite `R`-module. Then `S` has finite quotients
- A domain that is also a finite `ℤ`-module has finite quotients.
Also add two instances:
- Assume that `S` is a finite `R`-module and that `S ⧸ J` is a `(R ⧸ I)`-module with `I`, resp. `J`, an ideal of `R`, resp. `S`, then `S ⧸ J` is a finite `(R ⧸ I)`-module.
- For nonzero `n` , `ℤ ⧸ Ideal.span {n}` is finite.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
121/0 |
Mathlib.lean,Mathlib/Data/ZMod/QuotientRing.lean,Mathlib/RingTheory/FiniteType.lean,Mathlib/RingTheory/Finiteness/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/HasFiniteQuotients.lean |
5 |
4 |
['github-actions', 'leanprover-radar', 'tb65536', 'xroblot'] |
chrisflav assignee:chrisflav |
6-78377 6 days ago |
10-59521 10 days ago |
13-57569 13 days |
| 26735 |
Raph-DG author:Raph-DG |
feat(AlgebraicGeometry): The codimension of a point of a scheme is equal to the krull dimension of the stalk |
In this PR we show that the codimension of a point in a scheme is equal to the krull dimension of the local ring at that point, as in stacks 02IZ.
---
The proof of the main result `stalk_dim_eq_coheight` is currently a bit long for my (and I suspect the broader community's) tastes. That said, I'm not quite sure the best way to break it into pieces, any comments would be very much appreciated!
- [x] depends on: #26204 [For the notion of codimension, here we are using the coheight in the specialization order. ]
- [x] depends on: #26225
[](https://gitpod.io/from-referrer/)
|
t-algebraic-geometry |
171/0 |
Mathlib/AlgebraicGeometry/Properties.lean,Mathlib/Order/KrullDimension.lean,Mathlib/Topology/KrullDimension.lean,Mathlib/Topology/Sets/Closeds.lean |
4 |
54 |
['Raph-DG', 'chrisflav', 'erdOne', 'github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'tb65536'] |
erdOne assignee:erdOne |
6-74682 6 days ago |
6-74682 6 days ago |
43-18242 43 days |
| 33780 |
ooovi author:ooovi |
feat(Geometry/Convex/Cone): lineality space of pointed cones |
Define the lineality space `PointedCone.lineal` as the submodule `C ⊓ -C`. Prove that it is the largest submodule of the cone, which is sometimes used as an alternative definition.
Co-authored-by: Martin Winter
---
dependency of #33664
- [x] depends on #33761
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
42/1 |
Mathlib/Geometry/Convex/Cone/Pointed.lean |
1 |
19 |
['artie2000', 'eric-wieser', 'github-actions', 'martinwintermath', 'mathlib4-merge-conflict-bot', 'ooovi', 'vihdzp'] |
nobody |
6-66091 6 days ago |
8-79730 8 days ago |
21-13974 21 days |
| 35365 |
wwylele author:wwylele |
feat(LinearAlgebra/Simplex): closedInterior = interior + face.closedInterior |
Intermediate lemma towards #34826. This will be used to show the measure on `interior` and `closedInterior` are equal, as the difference is a zero-measure set.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
53/0 |
Mathlib/LinearAlgebra/AffineSpace/Simplex/Basic.lean |
1 |
4 |
['copilot-pull-request-reviewer', 'github-actions'] |
kim-em assignee:kim-em |
6-56323 6 days ago |
6-56302 6 days ago |
17-51338 17 days |
| 33449 |
yuanyi-350 author:yuanyi-350 |
feat(ProbabilityTheory): Add Poisson limit theorem |
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
file-removed
maintainer-merge
|
127/3 |
Mathlib.lean,Mathlib/Probability/Distributions/Poisson/Basic.lean,Mathlib/Probability/Distributions/Poisson/PoissonLimitThm.lean,Mathlib/Probability/ProbabilityMassFunction/Binomial.lean,docs/1000.yaml |
5 |
24 |
['EtienneC30', 'github-actions', 'vihdzp'] |
EtienneC30 assignee:EtienneC30 |
6-49551 6 days ago |
6-49613 6 days ago |
61-76587 61 days |
| 35821 |
SnirBroshi author:SnirBroshi |
feat(Order/ConditionallyCompleteLattice): `sInf s ≤ sSup t` for `(s ∩ t).Nonempty` |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
27/1 |
Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean |
3 |
1 |
['github-actions'] |
nobody |
6-49403 6 days ago |
6-49478 6 days ago |
6-49369 6 days |
| 35081 |
tb65536 author:tb65536 |
feat(Topology/Algebra/Group/Extension): define short exact sequence of topological groups |
This PR defines a short exact sequence of topological groups to be a closed embedding followed by an open quotient map (extracted from #32672).
---
[](https://gitpod.io/from-referrer/)
|
t-topology
maintainer-merge
|
57/0 |
Mathlib.lean,Mathlib/Topology/Algebra/Group/Extension.lean |
2 |
3 |
['dagurtomas', 'github-actions'] |
dagurtomas assignee:dagurtomas |
6-38635 6 days ago |
22-65195 22 days ago |
22-65088 22 days |
| 35041 |
b-mehta author:b-mehta |
feat(Combinatorics): prove the Rado selection lemma |
This PR should supercede #29030
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
132/0 |
Mathlib.lean,Mathlib/Combinatorics/Compactness.lean |
2 |
3 |
['b-mehta', 'github-actions'] |
kmill assignee:kmill |
6-20344 6 days ago |
23-44065 23 days ago |
23-43956 23 days |
| 35652 |
dennj author:dennj |
feat(LinearAlgebra/Matrix): add `Matrix.mul_eq_smul_one_symm` |
## Summary
- Add `Matrix.mul_eq_smul_one_symm`: if `M * N = c • 1` and `det M ≠ 0`, then `N * M = c • 1`
- A scalar generalisation of `mul_eq_one_symm` (the `c = 1` case) to arbitrary scalars, requiring `IsDomain` and `det M ≠ 0`
- The proof uses the adjugate identity `adjugate M * M = det M • 1` to derive `det M • (N * M) = det M • (c • 1)`, then cancels `det M` via `mul_left_cancel₀`
Theorem imported from: https://github.com/Latinum-Agentic-Commerce/AlgebraicDesignTheory |
t-algebra
new-contributor
label:t-algebra$ |
28/0 |
Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean |
1 |
2 |
['eric-wieser', 'github-actions'] |
joelriou assignee:joelriou |
6-20340 6 days ago |
10-42846 10 days ago |
10-42737 10 days |
| 35654 |
euprunin author:euprunin |
chore: golf using `grind` |
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `CochainComplex.HomComplex.mem_coboundaries_iff`: unchanged 🎉
* `integral_cos_mul_complex`: unchanged 🎉
* `List.next_getLast_cons`: unchanged 🎉
* `foldl_argAux_mem`: unchanged 🎉
* `Equiv.Perm.support_swap`: unchanged 🎉
* `Fermat42.mul`: unchanged 🎉
* `Filter.high_scores`: 155 ms before, 108 ms after 🎉
* `IocProdIoc_preimage`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
11/65 |
Mathlib/Algebra/Homology/HomotopyCategory/HomComplexCohomology.lean,Mathlib/Analysis/SpecialFunctions/Integrals/Basic.lean,Mathlib/Data/List/Cycle.lean,Mathlib/Data/List/MinMax.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/NumberTheory/FLT/Four.lean,Mathlib/Order/Filter/AtTopBot/Finite.lean,Mathlib/Probability/Kernel/IonescuTulcea/Maps.lean |
8 |
3 |
['euprunin', 'github-actions', 'vihdzp'] |
kex-y assignee:kex-y |
6-20339 6 days ago |
10-39012 10 days ago |
10-38903 10 days |
| 35662 |
FrankieeW author:FrankieeW |
feat(NumberTheory/Zsqrtd): add Archimedean instance via le_arch |
This PR follows a suggestion made in #35606 , #35481
- add `Zsqrtd.le_arch_smul` in `Mathlib/NumberTheory/Zsqrtd/Basic.lean`
- use it to provide `instance : Archimedean (ℤ√d)` in the `Nonsquare` section
- refactor the proof using symmetry to reduce duplication while keeping checks clean
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
|
43/2 |
Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean |
2 |
6 |
['FrankieeW', 'github-actions', 'tb65536'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
6-20337 6 days ago |
9-49100 9 days ago |
10-26870 10 days |
| 35683 |
gasparattila author:gasparattila |
fix(Tactic/FunProp): detect `Continuous.subtype_mk` as compositional |
This PR changes `fun_prop` to detect some theorems involving dependent types, such as `Continous.subtype_mk` to be in compositional form. This lets `fun_prop` solve goals such as `Continuous fun x => (⟨x, trivial⟩ : {x : ℝ // True})`.
---
These theorems become compositional: `Continuous.subtype_mk`, `Topology.IsEmbedding.inclusion`, `Topology.IsOpenEmbedding.inclusion`, `Topology.IsClosedEmbedding.inclusion`, `Measurable.subtype_mk`, `Measurable.imp`, `Path.symm_continuous_family`, `Continuous.upperHalfPlaneMk`
These theorems become simple: `hasFDerivAt_prodMk_left`, `hasFDerivAt_prodMk_right`, `contDiff_prodMk_left`, `contDiff_prodMk_right`
[](https://gitpod.io/from-referrer/)
|
t-meta |
53/31 |
Mathlib/Tactic/FunProp/Core.lean,Mathlib/Tactic/FunProp/FunctionData.lean,Mathlib/Tactic/FunProp/Theorems.lean,MathlibTest/fun_prop_dev.lean |
4 |
1 |
['github-actions'] |
JovanGerb assignee:JovanGerb |
6-20335 6 days ago |
9-34426 9 days ago |
9-34317 9 days |
| 35573 |
antisubnoous author:antisubnoous |
feat(NumberTheory/Chebyshev): express the Chebyshev theta function in terms of the prime counting function |
This is a sibling theorem to Chebyshev.primeCounting_eq_theta_div_log_add_integral.
---
This is my first mathlib4 commit. I am working through some exercises and results in Apostol's ANT book as a means to practice Lean, and this result seemed like an opportunity to practice the mechanics of contributing to Mathlib because the new theorem mirrors closely the sibling theorem above (both appear in Apostol Theorem 4.3).
[](https://gitpod.io/from-referrer/) |
t-number-theory
new-contributor
|
36/1 |
Mathlib/NumberTheory/Chebyshev.lean |
1 |
2 |
['github-actions'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
6-15623 6 days ago |
12-52447 12 days ago |
12-52338 12 days |
| 35713 |
Parcly-Taxel author:Parcly-Taxel |
feat: Bird–Wadler duality theorems |
Forms of these three theorems already exist in mathlib and the Lean standard library, but they are scattered about. Bring them together in one file, deprecating the _ad hoc_ names for the first and second theorems. |
t-data |
167/82 |
Mathlib.lean,Mathlib/Data/List/Basic.lean,Mathlib/Data/List/BirdWadler.lean,docs/references.bib |
4 |
1 |
['github-actions'] |
nobody |
6-2019 6 days ago |
8-71334 8 days ago |
8-71481 8 days |
| 35656 |
euprunin author:euprunin |
chore(ModelTheory): golf proofs |
This PR removes unused `have`/`haveI`/`let`/`letI` calls.
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `FirstOrder.Field.realize_genericMonicPolyHasRoot`: unchanged 🎉
* `FirstOrder.Language.exists_cg_is_age_of`: unchanged 🎉
* `FirstOrder.Language.Theory.models_formula_iff_onTheory_models_equivSentence`: unchanged 🎉
* `FirstOrder.Language.Sentence.realize_cardGe`: unchanged 🎉
* `FirstOrder.Language.Ultraproduct.boundedFormula_realize_cast`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
t-logic |
3/16 |
Mathlib/ModelTheory/Algebra/Field/IsAlgClosed.lean,Mathlib/ModelTheory/Fraisse.lean,Mathlib/ModelTheory/Satisfiability.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/ModelTheory/Ultraproducts.lean |
5 |
6 |
['euprunin', 'github-actions', 'leanprover-radar', 'vihdzp'] |
nobody |
6-6 6 days ago |
10-32511 10 days ago |
10-32402 10 days |
| 35677 |
euprunin author:euprunin |
chore(SetTheory): golf proofs |
This PR removes unused `have`/`haveI`/`let`/`letI` calls + some small similar cleanups.
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `Cardinal.mul_eq_self`: unchanged 🎉
* `Cardinal.succ_natCast`: unchanged 🎉
* `Ordinal.exists_fundamental_sequence`: unchanged 🎉
* `Cardinal.mk_subtype_le_of_countable_eventually_mem`: unchanged 🎉
* `Nat.card_image_of_injOn`: unchanged 🎉
* `mul_le_of_limit_aux`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
2/11 |
Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/CountableCover.lean,Mathlib/SetTheory/Cardinal/Finite.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/ZFC/PSet.lean |
7 |
4 |
['euprunin', 'github-actions', 'leanprover-radar', 'vihdzp'] |
nobody |
5-86298 5 days ago |
9-81484 9 days ago |
9-81375 9 days |
| 35552 |
vihdzp author:vihdzp |
chore(SetTheory/Ordinal/Basic): remove `backward.privateInPublic` |
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
tech debt
|
7/27 |
Mathlib/SetTheory/Ordinal/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
5-79296 5 days ago |
13-23199 13 days ago |
13-23281 13 days |
| 35853 |
vihdzp author:vihdzp |
chore(SetTheory/Ordinal): deprecate more theorems on `succ` |
---
- [x] depends on: #35844
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
39/37 |
Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Cardinal/Ordinal.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean,Mathlib/SetTheory/Ordinal/Exponential.lean,Mathlib/SetTheory/Ordinal/FixedPoint.lean,Mathlib/SetTheory/Ordinal/Notation.lean,Mathlib/SetTheory/Ordinal/Principal.lean,Mathlib/SetTheory/Ordinal/Topology.lean |
9 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
5-73461 5 days ago |
5-73636 5 days ago |
5-74520 5 days |
| 35084 |
edegeltje author:edegeltje |
feat(Combinatorics/SimpleGraph): The Cayley graph for structures with `Mul`/`Add` |
This pr:
- adds the definition `SimpleGraph.mulCayley`, where `x` is adjacent to a distinct `y` when there is `g` such that `x * g = y` or `x = y * g`,
- proves various lemmas about the above,
- adds/proves the additive versions of all of the above
some related zulip conversation: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Cayley.20and.20circulant.20graph/with/572839048
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
106/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Cayley.lean |
2 |
27 |
['SnirBroshi', 'edegeltje', 'github-actions', 'vihdzp', 'vlad902'] |
nobody |
5-65814 5 days ago |
19-35343 19 days ago |
22-59034 22 days |
| 35865 |
vihdzp author:vihdzp |
chore: review `Cardinal.ord` API |
This PR does the following:
- Mark `Cardinal.ord` as no expose.
- Prove the defining property `gciOrdCard` earlier.
- Deprecate the unused `ord.orderEmbedding` (it simply restates that the function is strictly monotonic).
- Rename `ord_nat` → `ord_natCast`.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
45/39 |
Mathlib/SetTheory/Cardinal/Aleph.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean |
4 |
1 |
['github-actions'] |
nobody |
5-63893 5 days ago |
5-63965 5 days ago |
5-63856 5 days |
| 33458 |
NoneMore author:NoneMore |
feat(ModelTheory): add lifting for embeddings to languages with constants |
Prepare for a generalized Tarski-Vaught test with a set as input instead of a substructure.
---
[](https://gitpod.io/from-referrer/)
|
t-logic
new-contributor
|
46/0 |
Mathlib/ModelTheory/ElementaryMaps.lean,Mathlib/ModelTheory/LanguageMap.lean |
2 |
7 |
['Citronhat', 'NoneMore', 'fpvandoorn', 'github-actions'] |
fpvandoorn assignee:fpvandoorn |
5-61481 5 days ago |
5-61699 5 days ago |
61-74169 61 days |
| 35435 |
WenrongZou author:WenrongZou |
feat(RingTheory/MvPowerSeries): toMvPowerSeries and rename |
---
Some APIs about `rename` and `toMvPowerSeries`. This follows the inspiration in `Polynomial.toMvPolynomial` and `MvPolynomial.rename`. I will add more theorems related to these in the next PR.
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
325/4 |
Mathlib.lean,Mathlib/RingTheory/MvPowerSeries/Rename.lean,Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean |
4 |
5 |
['BryceT233', 'WenrongZou', 'github-actions'] |
mariainesdff assignee:mariainesdff |
5-61076 5 days ago |
15-81747 15 days ago |
15-82071 15 days |
| 35415 |
joneugster author:joneugster |
feat(Cache): enable partial cache in downstream projects |
Migrated to fork from: #21238.
Add features to `cache` and cleanup code:
* enable partial cache retrieval in downstream projects: `lake exe cache get MyProject.Basic` downloads only the relevant cache to build `MyProject/Basic.lean`
---
- [x] depends on: #21834
### Notes:
- replaces: #21195
- should address: #8767
- should address: #20568
### Completed:
- [x] depends on: #21632
- [x] ~~depends on: #21663~~
- [x] depends on: #21666
- [x] depends on: #21701
- [x] depends on: #21703
- [x] depends on: #21704
- [x] depends on: #21705
- [x] depends on: #21707
- [x] depends on: #21711
- [x] depends on: #21750
- [x] depends on: #21815
- [x] depends on: #21816
- [x] depends on: #21817
- [x] depends on: #21818
- [x] depends on: #21822
- [x] depends on: #21830
- #21848
[](https://gitpod.io/from-referrer/)
|
CI
t-meta
|
34/15 |
Cache/Hashing.lean,Cache/IO.lean,Cache/Main.lean |
3 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
5-57463 5 days ago |
5-57485 5 days ago |
8-9471 8 days |
| 35465 |
MixedMatched author:MixedMatched |
feat(Data/Multiset/Powerset): show injectivity and monotonicity of powerset |
Add Injective, Monotone, and StrictMono proofs for `Multiset.powerset`. Also, add a theorem showing that the sizes of two powersets are bidirectionally related to the sizes of the underlying Multisets (`powerset_le_powerset_iff_le`), a couple of other small `Multiset.powerset` lemmas, and theorems for append and map for `List.Subperm`.
Also, thanks to Ruben Van de Velde for looking this over on the Zulip!
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
81/0 |
Mathlib/Data/List/Perm/Subperm.lean,Mathlib/Data/List/Sublists.lean,Mathlib/Data/Multiset/Powerset.lean |
3 |
28 |
['MixedMatched', 'eric-wieser', 'github-actions', 'joneugster', 'vihdzp'] |
joneugster assignee:joneugster |
5-55750 5 days ago |
12-36639 12 days ago |
12-59260 12 days |
| 34583 |
adomani author:adomani |
feat: basic properties of subnormal subgroups |
This is a follow up to #34284.
Co-authored-by: Inna Capdeboscq
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-group-theory
|
107/3 |
Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Subgroup/Pointwise.lean,Mathlib/GroupTheory/IsSubnormal.lean |
3 |
38 |
['LLaurance', 'adomani', 'github-actions', 'tb65536'] |
mattrobball assignee:mattrobball |
5-53587 5 days ago |
5-53398 5 days ago |
21-48491 21 days |
| 35268 |
tb65536 author:tb65536 |
feat(Topology/Algebra/Module/LinearMap): units in `M →L[R] M` are homeomorphisms |
This PR proves that a units in `M →L[R] M` are homeomorphisms.
---
[](https://gitpod.io/from-referrer/)
|
t-topology
t-algebra
label:t-algebra$ |
11/1 |
Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Topology/Algebra/Module/LinearMap.lean |
2 |
4 |
['dagurtomas', 'github-actions', 'tb65536'] |
dagurtomas assignee:dagurtomas |
5-53367 5 days ago |
5-53367 5 days ago |
18-67706 18 days |
| 34209 |
mike1729 author:mike1729 |
feat(Analysis/Normed): Schauder basis definition and characterization via projections |
A Schauder basis is a fundamental concept in functional analysis, providing a way to represent every element of a Banach space as a unique convergent series. This PR adds the core structures, some theorems necessary to work with these bases and a characterization of a Schauder basis using projections.
This PR is based on Chapter 1. from Albiac, F., & Kalton, N. J. (2016). Topics in Banach Space Theory.
This is a first PR in a series of three aiming for Eberlein-Smulyan Theorem. The next one will contain theory of basic sequences and the final one will contain a proof of Eberlein-Smulyan Theorem using basic sequences.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
524/0 |
Mathlib.lean,Mathlib/Analysis/Normed/Module/Bases.lean,docs/references.bib |
3 |
181 |
['Ruben-VandeVelde', 'faenuccio', 'github-actions', 'goliath-klein', 'j-loreaux', 'mike1729', 'sgouezel', 'themathqueen'] |
sgouezel assignee:sgouezel |
5-52771 5 days ago |
5-52778 5 days ago |
30-9201 30 days |
| 35653 |
pepamontero author:pepamontero |
feat: add ChartedSpace structure on orbit space |
feat: add ChartedSpace structure on orbit space
Add topological preliminaries for properly discontinuous group actions, and use them to equip the orbit space `orbitRel.Quotient G M` with a `ChartedSpace` structure.
In particular:
- Show that the quotient map `Quotient.mk _ : M → orbitRel.Quotient G M` is a covering map and hence a local homeomorphism.
- Construct chosen local inverses of the quotient map and establish properties over them.
- Define a `ChartedSpace` instance on the quotient by composing these local inverses with charts of M.
This started as an ItaLean2025 project; here is the [Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/541885-ItaLean-2025/topic/Projects.3A.20Quotient.20Manifolds/with/575121158) dedicated to it.
---
|
new-contributor
t-differential-geometry
|
186/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Instances/OrbitSpace.lean,Mathlib/Topology/Algebra/OrbitSpace.lean |
3 |
2 |
['github-actions'] |
grunweg assignee:grunweg |
5-51630 5 days ago |
10-39375 10 days ago |
10-39941 10 days |
| 35608 |
BoltonBailey author:BoltonBailey |
chore(Computability): move TM files to a single folder |
This PR takes files relevant to Turing machines and moves them to a single folder for better organization.
In the process, we do some renaming of these files
* We remove the "TM" from the front of these files, as it's now redundant.
* TuringMachine.lean --> TuringMachine/StackMachine.lean
* (really the key difference between the TM2 model presented in this file, and the TM1 model from the previous, is the introduction of stacks instead of tapes)
I also remove `EvalsTo` and friends from TuringMachine.Computable, as these in #33291 were moved out of the TM namespace.
---
[](https://gitpod.io/from-referrer/)
|
t-computability
file-removed
|
21/58 |
Mathlib.lean,Mathlib/Computability/StateTransition.lean,Mathlib/Computability/TuringMachine/Computable.lean,Mathlib/Computability/TuringMachine/Config.lean,Mathlib/Computability/TuringMachine/PostTuringMachine.lean,Mathlib/Computability/TuringMachine/StackMachine.lean,Mathlib/Computability/TuringMachine/Tape.lean,Mathlib/Computability/TuringMachine/ToPartrec.lean |
8 |
3 |
['BoltonBailey', 'github-actions', 'mathlib-merge-conflicts'] |
nobody |
5-42149 5 days ago |
5-42172 5 days ago |
11-4512 11 days |
| 35630 |
SnirBroshi author:SnirBroshi |
feat(Data/List/Basic): relate `dropLast` and `concat` |
---
[](https://gitpod.io/from-referrer/)
|
t-data |
8/0 |
Mathlib/Data/List/Basic.lean |
1 |
4 |
['SnirBroshi', 'github-actions', 'joneugster'] |
joneugster assignee:joneugster |
5-35073 5 days ago |
5-42282 5 days ago |
10-76121 10 days |
| 35830 |
AntoineChambert-Loir author:AntoineChambert-Loir |
feat(Data/Nat/Choose/Plurinomial): plurinomial coefficients |
Define the multinomial coefficients, a variant of `Nat.multinomial`.
- `Multiset.plurinomial`.
Given a multiset `m` of natural numbers, `m.plurinomial` is the
multinomial coefficient defined by (m.sum) ! / ∏ i ∈ m, m i !.
As an example, `Multiset.plurinomial {1, 2, 2} = 30`.
This is the exponent of $x y^2 z^2$ in $(x+y+z)^5$.
This should not be confused with the existing `Multiset.multinomial` which gives a different answer,
for example, `Multiset.multinomial {1, 2, 2} = 3`.
We chose the name “plurinomial” by changing the Greek root “multi” to its Latine version “pluri”.
- `Multiset.plurinomial_cons` proves that
`(x ::ₘ m).plurinomial = Nat.choose (x + m.sum) x * m.plurinomial`
- `Multiset.plurinomial_add` proves that
`(m + m').plurinomial = Nat.choose (m + m').sum m.sum * m.plurinomial * m'.plurinomial`
co-authored with @mariainesdff
---
[](https://gitpod.io/from-referrer/)
|
t-data |
179/20 |
Mathlib/Analysis/Calculus/ContDiff/Bounds.lean,Mathlib/Data/List/ToFinsupp.lean,Mathlib/Data/Nat/Choose/Multinomial.lean,Mathlib/RingTheory/GradedAlgebra/Basic.lean |
4 |
9 |
['AntoineChambert-Loir', 'github-actions', 'vihdzp'] |
nobody |
5-32886 5 days ago |
5-32953 5 days ago |
5-67442 5 days |
| 35857 |
AlexeyMilovanov author:AlexeyMilovanov |
feat(Logic.Equiv.BijectiveBase2): add bijective base-2 numeration |
This PR introduces a formalization of the bijective base-2 numeration system.
Unlike standard binary representation, bijective base-2 avoids the "leading zeros" problem, providing a strict mathematical bijection between natural numbers (`ℕ`) and lists of booleans (`List Bool`).
**Main additions:**
* `Equiv.BijectiveBase2.toBits`: Encodes `ℕ` to `List Bool`.
* `Equiv.BijectiveBase2.ofBits`: Decodes `List Bool` to `ℕ`.
* `equivBijectiveBase2`: The formal `ℕ ≃ List Bool` equivalence.
*(Note: This replaces my previously closed PR to avoid the terminology clash between "Dyadic" and dyadic rationals. The namespace and definitions have been updated accordingly).*
*(Note: Used AI to assist with standardizing proof structures).* |
t-logic
new-contributor
|
95/0 |
Mathlib.lean,Mathlib/Logic/Equiv/ListNatBijective.lean |
2 |
4 |
['AlexeyMilovanov', 'SnirBroshi', 'github-actions'] |
nobody |
5-32464 5 days ago |
5-41536 5 days ago |
5-41884 5 days |
| 35776 |
IvanRenison author:IvanRenison |
feat(Combinatorics): define `HasAdj` for capturing the common structure of different kinds of (simple) graphs |
We add a vertex set considering that we want to refactor `SimpleGraph` to also use one
---
This pr replaces #4127
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/252551-graph-theory/topic/HasAdj/with/575843445
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
101/0 |
Mathlib.lean,Mathlib/Combinatorics/Digraph/HasAdj.lean,Mathlib/Combinatorics/HasAdj/Basic.lean,Mathlib/Combinatorics/SimpleGraph/HasAdj.lean |
4 |
1 |
['github-actions'] |
nobody |
5-30544 5 days ago |
5-30544 5 days ago |
5-30435 5 days |
| 35822 |
SnirBroshi author:SnirBroshi |
feat(Order/ConditionallyCompleteLattice): `sSup (f '' s) ≤ f (sSup s)` |
---
#35260 will add `iSup` versions.
Future work: `Antitone`, `MonotoneOn`, `AntitoneOn`
[](https://gitpod.io/from-referrer/)
|
t-order |
39/1 |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Finset.lean |
2 |
5 |
['SnirBroshi', 'github-actions', 'vihdzp'] |
nobody |
5-26878 5 days ago |
6-48784 6 days ago |
6-48675 6 days |
| 35423 |
Rob23oba author:Rob23oba |
feat: add congruence lemmas for `Function.update` and `Pi.single` |
Adds `simp` congruence lemmas to `Function.update` and `Pi.single` that are specialized for the non-dependent case. See also [#mathlib4 > Simp fails to apply with `Function.update`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Simp.20fails.20to.20apply.20with.20.60Function.2Eupdate.60/with/573889929).
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
29/6 |
Mathlib/Algebra/Notation/Pi/Basic.lean,Mathlib/Logic/Function/Basic.lean,Mathlib/NumberTheory/ModularForms/QExpansion.lean,Mathlib/RepresentationTheory/Tannaka.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean |
5 |
9 |
['Rob23oba', 'eric-wieser', 'github-actions', 'joneugster', 'loefflerd'] |
thorimur assignee:thorimur |
5-26099 5 days ago |
15-74643 15 days ago |
16-23826 16 days |
| 35250 |
vlad902 author:vlad902 |
feat(SimpleGraph): redefine `cycleGraph` independent of `circulantGraph` |
Right now the `cycleGraph` definition relies on `circulantGraph` which requires importing Group definitions from the algebra hierarchy. This causes large-imports for me in later PRs where I try to make more widespread use of cycleGraphs, so here I redefine it to be its own independent object, and leave moving it from `Circulant.lean` to another PR (this is parallel to #35084.)
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
10/10 |
Mathlib/Combinatorics/SimpleGraph/Circulant.lean |
1 |
4 |
['SnirBroshi', 'github-actions', 'vihdzp', 'vlad902'] |
kmill assignee:kmill |
5-20356 5 days ago |
19-62649 19 days ago |
19-62540 19 days |
| 35540 |
tb65536 author:tb65536 |
feat(GroupTheory/ResiduallyFinite): define residually finite groups |
This PR defines residually finite groups, provides some basic API, and gives the connection with profinite completion.
Some to_additivizing is still waiting on #34784.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-group-theory
label:t-algebra$ |
91/1 |
Mathlib.lean,Mathlib/GroupTheory/FiniteIndexNormalSubgroup.lean,Mathlib/GroupTheory/ResiduallyFinite.lean,Mathlib/Topology/Algebra/Category/ProfiniteGrp/Completion.lean |
4 |
1 |
['github-actions'] |
mattrobball assignee:mattrobball |
5-20354 5 days ago |
13-39550 13 days ago |
13-39442 13 days |
| 35592 |
SnirBroshi author:SnirBroshi |
chore(Order/Defs/Unbundled): deprecate `def Transitive` in favor of `class IsTrans` |
---
[`def Transitive`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/Defs/Unbundled.html#Transitive)
[`class IsTrans`](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Order/Defs/Unbundled.html#IsTrans)
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Relation.20properties.20duplication/near/544638270)
[](https://gitpod.io/from-referrer/)
|
t-order |
141/110 |
Mathlib/Algebra/Group/Semiconj/Defs.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/IsConnected.lean,Mathlib/Combinatorics/SimpleGraph/CompleteMultipartite.lean,Mathlib/Combinatorics/SimpleGraph/FiveWheelLike.lean,Mathlib/Computability/Reduce.lean,Mathlib/Data/List/MinMax.lean,Mathlib/Data/Seq/Computation.lean,Mathlib/Data/WSeq/Relation.lean,Mathlib/GroupTheory/FreeGroup/Basic.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/Logic/Relation.lean,Mathlib/ModelTheory/Order.lean,Mathlib/ModelTheory/Semantics.lean,Mathlib/Order/Defs/Unbundled.lean,Mathlib/Order/Interval/Finset/Basic.lean,Mathlib/Order/Quotient.lean,Mathlib/Order/RelClasses.lean,Mathlib/Topology/Connected/Clopen.lean,Mathlib/Topology/Metrizable/Uniformity.lean |
20 |
1 |
['github-actions', 'vihdzp'] |
pechersky assignee:pechersky |
5-20352 5 days ago |
12-15298 12 days ago |
12-16801 12 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 |
79/0 |
Mathlib/Data/Fin/Basic.lean,Mathlib/Data/Fin/SuccPred.lean |
2 |
3 |
['github-actions', 'wwylele'] |
TwoFX assignee:TwoFX |
5-20350 5 days ago |
10-70255 10 days ago |
10-84652 10 days |
| 35720 |
tb65536 author:tb65536 |
feat(NumberTheory/FunctionField): add instances on `FqtInfty` |
This PR proves the relevant instances on `FqtInfty` by locally replacing the existing valued instance `RatFunc.valuedRatFunc` coming from the ideal `X` with the required `UniformSpace` instance coming from the valuation at infinity and then deriving the relevant instances.
---
[](https://gitpod.io/from-referrer/)
|
t-topology
t-algebra
label:t-algebra$ |
16/9 |
Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/NumberTheory/FunctionField.lean |
2 |
1 |
['github-actions'] |
dagurtomas assignee:dagurtomas |
5-20346 5 days ago |
8-48776 8 days ago |
8-53221 8 days |
| 35721 |
chrisflav author:chrisflav |
chore: fix delaborators for `[Comm][Semi]RingCat` and some more |
Since #31622 terms of type `CommRingCat` are pretty printed as `{ carrier := R, commRing := inst }`. We make it pretty print as `CommRingCat.of R` again, which was the previous behaviour.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
77/0 |
Mathlib/Algebra/Category/Ring/Basic.lean,Mathlib/CategoryTheory/FintypeCat.lean,Mathlib/Topology/Category/TopCat/Basic.lean,Mathlib/Topology/Category/TopCommRingCat.lean |
4 |
1 |
['github-actions'] |
dagurtomas assignee:dagurtomas |
5-20345 5 days ago |
8-50947 8 days ago |
8-50838 8 days |
| 35628 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Maps): characterize `neighborSet` and `edgeSet` across an embedding |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
40/0 |
Mathlib/Combinatorics/SimpleGraph/Maps.lean |
1 |
1 |
['github-actions'] |
nobody |
5-7194 5 days ago |
11-8938 11 days ago |
11-8829 11 days |
| 35878 |
Parcly-Taxel author:Parcly-Taxel |
chore: use `induction` for `Quotient.induction` invocations |
Found through the regex `(refine|apply|exact).*Quotient.induction`. Includes the multiple-argument variants. |
tech debt |
93/102 |
Mathlib/Algebra/GroupWithZero/Associated.lean,Mathlib/Algebra/Lie/Quotient.lean,Mathlib/Algebra/Module/ZLattice/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/Basic.lean,Mathlib/CategoryTheory/Abelian/Pseudoelements.lean,Mathlib/CategoryTheory/Monoidal/Free/Basic.lean,Mathlib/CategoryTheory/Subobject/Basic.lean,Mathlib/Combinatorics/Tiling/Tile.lean,Mathlib/Computability/Tape.lean,Mathlib/Data/Multiset/Functor.lean,Mathlib/Data/Multiset/Sym.lean,Mathlib/Data/Setoid/Basic.lean,Mathlib/FieldTheory/Fixed.lean,Mathlib/GroupTheory/Perm/Cycle/Concrete.lean,Mathlib/LinearAlgebra/Alternating/DomCoprod.lean,Mathlib/LinearAlgebra/Quotient/Pi.lean,Mathlib/Logic/Equiv/Basic.lean,Mathlib/NumberTheory/Padics/PadicNumbers.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/Order/Category/PartOrd.lean,Mathlib/Order/RelIso/Basic.lean,Mathlib/RingTheory/AdicCompletion/Algebra.lean,Mathlib/RingTheory/AdicCompletion/Basic.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean,Mathlib/RingTheory/Ideal/Norm/AbsNorm.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/Topology/Algebra/InfiniteSum/Module.lean |
28 |
1 |
['github-actions'] |
nobody |
5-4981 5 days ago |
5-5052 5 days ago |
5-4943 5 days |
| 35841 |
astrainfinita author:astrainfinita |
chore(Order/Defs/LinearOrder): avoid `grind` in very fundamental lemmas |
---
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/144837-PR-reviews/topic/.2334013.20chore.3A.20golf.20with.20grind.20to.20reduce.20explicit.20lemma.20refer/near/570429476)
[](https://gitpod.io/from-referrer/)
|
t-order |
40/19 |
Mathlib/Order/Defs/LinearOrder.lean |
1 |
2 |
['github-actions', 'grunweg'] |
nobody |
5-3681 5 days ago |
5-6331 5 days ago |
5-37243 5 days |
| 26770 |
Jun2M author:Jun2M |
feat(Combinatorics/Graph): subgraph relations on `Graph` |
This PR creates a new file `Combinatorics/Graph/Subgraph.lean`. In it, the PR introduces a partial order on graphs by subgraph relation, defines relations `IsInducedSubgraph`, `IsSpanningSubgraph` and `IsClosedSubgraph`.
Co-authored-by: Peter Nelson
---
- [x] depends on: #34783
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
325/0 |
Mathlib.lean,Mathlib/Combinatorics/Graph/Subgraph.lean |
2 |
60 |
['Jun2M', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] |
YaelDillies assignee:YaelDillies |
5-948 5 days ago |
5-51283 5 days ago |
157-42016 157 days |
| 35880 |
astrainfinita author:astrainfinita |
feat(Order/Defs/LinearOrder): `min_ind` |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
5/0 |
Mathlib/Order/Defs/LinearOrder.lean |
1 |
1 |
['github-actions'] |
nobody |
5-816 5 days ago |
5-891 5 days ago |
5-782 5 days |
| 34423 |
euprunin author:euprunin |
chore: golf using `grind` |
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (shown if ≥10 ms before or after):
* `LucasLehmer.norm_num_ext.sModNat_eq_sMod`: 950 ms before, 758 ms after 🎉
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
1/18 |
Mathlib/NumberTheory/LucasLehmer.lean |
1 |
14 |
['eric-wieser', 'euprunin', 'github-actions', 'leanprover-radar', 'robin-carlier'] |
eric-wieser assignee:eric-wieser |
4-74640 4 days ago |
4-74640 4 days ago |
37-54827 37 days |
| 35840 |
SnirBroshi author:SnirBroshi |
feat(SetTheory/Ordinal/Arithmetic): `typein (· < ·) = natCast` for `ℕ` and `Fin n` |
Co-authored-by: Matt Diamond
---
[#Is there code for X? > `Ordinal.typein = NatCast`](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/.60Ordinal.2Etypein.20.3D.20NatCast.60/with/576057726)
The same statement but for ordinals exists as [Ordinal.typein_ordinal](https://leanprover-community.github.io/mathlib4_docs/Mathlib/SetTheory/Ordinal/Arithmetic.html#Ordinal.typein_ordinal).
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
25/0 |
Mathlib/SetTheory/Ordinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Basic.lean |
2 |
16 |
['SnirBroshi', 'github-actions', 'vihdzp'] |
vihdzp assignee:vihdzp |
4-74548 4 days ago |
5-5374 5 days ago |
5-80990 5 days |
| 35716 |
IvanRenison author:IvanRenison |
feat(Combinatorics/SimpleGraph/Connectivity): add lemmas about reachable, degree and neighbor set |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
28/6 |
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean |
1 |
10 |
['IvanRenison', 'SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
4-66971 4 days ago |
8-60217 8 days ago |
8-60108 8 days |
| 35829 |
IvanRenison author:IvanRenison |
refactor(Data/Last): move `Mathlib.Tactic.BicategoryLike.pairs` to `List.consecutivePairs` |
Moves:
- Mathlib.Tactic.BicategoryLike.pairs -> List.consecutivePairs
---
[](https://gitpod.io/from-referrer/)
|
t-data |
12/6 |
Mathlib/Data/List/Defs.lean,Mathlib/Tactic/Widget/StringDiagram.lean |
2 |
5 |
['IvanRenison', 'SnirBroshi', 'github-actions', 'robin-carlier'] |
nobody |
4-66829 4 days ago |
5-30628 5 days ago |
6-11471 6 days |
| 33878 |
xroblot author:xroblot |
feat(MulChar): generalize duality results on finite abelian groups to multiplicative characters |
---
- [x] depends on: #33792
[](https://gitpod.io/from-referrer/)
|
large-import
t-number-theory
|
116/5 |
Mathlib/Algebra/Group/Submonoid/Units.lean,Mathlib/NumberTheory/MulChar/Basic.lean,Mathlib/NumberTheory/MulChar/Duality.lean,Mathlib/NumberTheory/MulChar/Lemmas.lean |
4 |
13 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tb65536', 'xroblot'] |
tb65536 assignee:tb65536 |
4-58731 4 days ago |
5-81778 5 days ago |
13-67556 13 days |
| 35405 |
xroblot author:xroblot |
feat(RamificationInertia): add `ramificationIdx_le_ramificationIdx` and `inertiaDeg_le_inertiaDeg` |
Assume that `Q` is over `P` that is over `p`. We prove that:
- `Ideal.ramificationIdx P Q ≤ Ideal.ramificationIdx p Q`
- `Ideal.inertiaDeg P Q ≤ Ideal.inertiaDeg p Q`
These results follow from [Ideal.ramificationIdx_algebra_tower](https://leanprover-community.github.io/mathlib4_docs/Mathlib/NumberTheory/RamificationInertia/Basic.html#Ideal.ramificationIdx_algebra_tower) and [Ideal.inertiaDeg_algebra_tower](https://leanprover-community.github.io/mathlib4_docs/Mathlib/NumberTheory/RamificationInertia/Basic.html#Ideal.inertiaDeg_algebra_tower) but they are proved here in a more general situation.
---
- [x] depends on: #35483
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
31/0 |
Mathlib/NumberTheory/RamificationInertia/Basic.lean |
1 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
alexjbest assignee:alexjbest |
4-58401 4 days ago |
4-58425 4 days ago |
15-79823 15 days |
| 35774 |
astrainfinita author:astrainfinita |
chore: use `IsLUB` `IsGLB` in `ConditionallyCompleteLattice` |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
142/197 |
Mathlib/Algebra/Tropical/Lattice.lean,Mathlib/Data/Int/ConditionallyCompleteOrder.lean,Mathlib/Data/Nat/Lattice.lean,Mathlib/Data/Real/Archimedean.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Copy.lean |
9 |
8 |
['astrainfinita', 'github-actions', 'vihdzp'] |
nobody |
4-57001 4 days ago |
7-45884 7 days ago |
7-45898 7 days |
| 35769 |
SnirBroshi author:SnirBroshi |
feat(Order/WellFounded): the cardinality of a set is an upper-bound for the amount of elements before the set's mex |
The "mex" of a set is its minimum excluded value, see https://en.wikipedia.org/wiki/Mex_(mathematics)
---
Extracted from #35669
[](https://gitpod.io/from-referrer/)
|
t-order |
19/0 |
Mathlib/Order/WellFounded.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Ordinal/Basic.lean |
3 |
1 |
['github-actions'] |
nobody |
4-50673 4 days ago |
4-50728 4 days ago |
7-52826 7 days |
| 34963 |
Parcly-Taxel author:Parcly-Taxel |
feat(Archive): proof of the Robbins conjecture |
Cf. [#mathlib4 > Alternative axiomatization of boolean algebras @ 💬](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Alternative.20axiomatization.20of.20boolean.20algebras/near/558900960) and #31924. |
t-algebra label:t-algebra$ |
610/0 |
Archive.lean,Archive/Robbins.lean |
2 |
1 |
['github-actions'] |
dwrensha assignee:dwrensha |
4-48151 4 days ago |
25-12902 25 days ago |
25-14445 25 days |
| 33363 |
BoltonBailey author:BoltonBailey |
feat: add `empty_eq_image` simp lemmas |
Creates new simp lemmas `empty_eq_image`, similar to existing simp lemmas, but with the LHS equality reversed, so that simp can identify these when in this form.
---
[](https://gitpod.io/from-referrer/)
|
t-data |
26/0 |
Mathlib/Data/Finset/Image.lean,Mathlib/Data/Multiset/MapFold.lean,Mathlib/Data/Option/Basic.lean,Mathlib/Data/Set/Image.lean,Mathlib/Order/Filter/Map.lean |
5 |
7 |
['BoltonBailey', 'github-actions', 'joneugster', 'urkud'] |
joneugster and urkud assignee:urkud assignee:joneugster |
4-43715 4 days ago |
4-43715 4 days ago |
34-30717 34 days |
| 34678 |
joneugster author:joneugster |
feat(scripts/autolabel): add dependencies for `t-ring-theory` |
these changes are motivated by clearing the [triage queue: PRs without topic label](https://leanprover-community.github.io/queueboard/triage.html#unlabelled): about 60-70% of unlabelled PRs were `feat(RingTheory/...)` which also modified stuff falling under `t-algebra`, `t-group-theory` or `t-data`.
- [ ] depends on: #34066
---
[](https://gitpod.io/from-referrer/)
|
CI |
23/5 |
scripts/autolabel.lean |
1 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
4-42816 4 days ago |
4-42817 4 days ago |
4-44257 4 days |
| 35315 |
mkaratarakis author:mkaratarakis |
feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 3/5) |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
26/0 |
Mathlib/Analysis/Analytic/Order.lean |
1 |
6 |
['SnirBroshi', 'github-actions', 'j-loreaux', 'mkaratarakis'] |
j-loreaux assignee:j-loreaux |
4-41691 4 days ago |
8-12519 8 days ago |
18-6106 18 days |
| 35317 |
mkaratarakis author:mkaratarakis |
feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 5/5) |
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
t-analysis
|
62/0 |
Mathlib/Analysis/Complex/CauchyIntegral.lean |
1 |
7 |
['MichaelStollBayreuth', 'github-actions', 'mkaratarakis'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
4-41672 4 days ago |
12-28767 12 days ago |
17-31765 17 days |
| 35439 |
harahu author:harahu |
chore(RingTheory): fix indentation in markdown lists |
Make sure to also indent subsequent lines of an item: this is required by the markdown specification (though not doc-gen), it expresses intent more clearly, and makes it easier to catch accidental misindentations.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
94/88 |
Mathlib/RingTheory/DedekindDomain/Factorization.lean,Mathlib/RingTheory/DividedPowers/Basic.lean,Mathlib/RingTheory/DividedPowers/DPMorphism.lean,Mathlib/RingTheory/DividedPowers/RatAlgebra.lean,Mathlib/RingTheory/Etale/QuasiFinite.lean,Mathlib/RingTheory/Extension/Basic.lean,Mathlib/RingTheory/Flat/EquationalCriterion.lean,Mathlib/RingTheory/Ideal/Quotient/PowTransition.lean,Mathlib/RingTheory/IdealFilter/Topology.lean,Mathlib/RingTheory/IntegralClosure/IntegralRestrict.lean,Mathlib/RingTheory/Jacobson/Artinian.lean,Mathlib/RingTheory/MvPolynomial/Groebner.lean,Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Expand.lean,Mathlib/RingTheory/MvPowerSeries/NoZeroDivisors.lean,Mathlib/RingTheory/MvPowerSeries/Order.lean,Mathlib/RingTheory/NormalClosure.lean,Mathlib/RingTheory/Perfectoid/BDeRham.lean,Mathlib/RingTheory/Perfectoid/FontaineTheta.lean,Mathlib/RingTheory/PolynomialLaw/Basic.lean,Mathlib/RingTheory/PowerSeries/PiTopology.lean,Mathlib/RingTheory/ReesAlgebra.lean,Mathlib/RingTheory/RingHom/FiniteType.lean,Mathlib/RingTheory/UniqueFactorizationDomain/ClassGroup.lean,Mathlib/RingTheory/WittVector/TeichmullerSeries.lean,Mathlib/RingTheory/ZMod/UnitsCyclic.lean |
26 |
6 |
['erdOne', 'github-actions', 'harahu', 'mathlib-merge-conflicts'] |
erdOne assignee:erdOne |
4-36008 4 days ago |
4-36008 4 days ago |
13-40495 13 days |
| 35272 |
jvanwinden author:jvanwinden |
feat(Topology/Instances/EReal): limsup of multiplication by a constant |
add an analogue of `limsup_const_mul_of_ne_top` which applies to `EReal` instead of `ENNReal`
---
[](https://gitpod.io/from-referrer/)
|
t-topology
new-contributor
|
28/0 |
Mathlib/Topology/Instances/EReal/Lemmas.lean |
1 |
13 |
['github-actions', 'j-loreaux', 'jvanwinden', 'mathlib-merge-conflicts', 'vihdzp'] |
j-loreaux assignee:j-loreaux |
4-35554 4 days ago |
4-35554 4 days ago |
8-73555 8 days |
| 35892 |
vlad902 author:vlad902 |
feat(Data): lemmas for `List.bagInter` |
Basic API lemmas for `List.bagInter` and correct a few misnamed lemmas.
Co-authored-by: Aristotle (Harmonic)
---
[](https://gitpod.io/from-referrer/)
|
t-data |
60/5 |
Mathlib/Data/List/Lattice.lean,Mathlib/Data/List/Perm/Lattice.lean,Mathlib/Data/Multiset/UnionInter.lean |
3 |
1 |
['github-actions'] |
nobody |
4-28123 4 days ago |
4-28200 4 days ago |
4-30735 4 days |
| 34246 |
staroperator author:staroperator |
feat(SetTheory/Cardinal): Δ-system lemma |
We prove the Δ-system lemma, which says for any regular cardinal `θ` and infinite cardinal `κ < θ`, if `∀ c < θ, c ^< κ < θ`, any `θ`-sized family of sets whose cardinalities are less than `κ` must contain a `θ`-sized Δ-system (this condition is called Δ-system property for `θ` and `κ`, noted as `Δ(θ, k)`). As a special case, `Δ(ℵ₁, ℵ₀)` ensures any uncountable family of finite sets must contain an uncountable Δ-system.
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory |
384/0 |
Mathlib.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Cardinal/Basic.lean,Mathlib/SetTheory/Cardinal/DeltaSystem.lean,Mathlib/SetTheory/Cardinal/Pigeonhole.lean,docs/references.bib |
6 |
1 |
['github-actions'] |
alreadydone assignee:alreadydone |
4-20232 4 days ago |
10-45103 10 days ago |
10-45893 10 days |
| 35528 |
euprunin author:euprunin |
chore: golf using `grind` |
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <20 ms considered measurement noise):
* `CochainComplex.HomComplex.mem_coboundaries_iff`: <20 ms before, 43 ms after
* `Affine.Simplex.Scalene.dist_ne`: unchanged 🎉
* `List.next_getLast_cons`: unchanged 🎉
* `AbsolutelyContinuousOnInterval.biUnion_uIoc_subset_of_mem_disjWithin`: unchanged 🎉
* `Filter.high_scores`: 109 ms before, 139 ms after
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
9/55 |
Mathlib/Algebra/Homology/HomotopyCategory/HomComplexCohomology.lean,Mathlib/Analysis/Normed/Affine/Simplex.lean,Mathlib/Combinatorics/SimpleGraph/Regularity/Chunk.lean,Mathlib/Data/List/Cycle.lean,Mathlib/MeasureTheory/Function/AbsolutelyContinuous.lean,Mathlib/Order/Filter/AtTopBot/Finite.lean |
6 |
1 |
['github-actions', 'vihdzp'] |
adamtopaz assignee:adamtopaz |
4-20229 4 days ago |
13-77497 13 days ago |
13-77388 13 days |
| 35567 |
goliath-klein author:goliath-klein |
refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): Golfs |
This PR cleans up the proofs in
Analysis/Normed/Module/PiTensorProduct/{InjectiveSeminorm.lean, ProjectiveSeminorm.lean}
In addition, it performs the following minor structural changes:
* Weaken assumptions from `NontriviallyNormedField 𝕜` to `NormedField 𝕜` where possible
* The proofs showing that `projectiveSeminorm` actually defines a `Seminorm` are split off into separate lemmas. This mimics the idiom used e.g. in `Analysis.Normed.Modula.Operator.Basic` to define the operator norm.
* Register a `Nonempty x.lifts` instance in PiTensorProduct.lean, to avoid creating a half-dozen local instances.
This is the first in a series of three PRs with the goal to [deprecate `PiTensorProuduct.injectiveSeminorm`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798633).
---
Co-authored-by: Davood H. T. Tehrani
[](https://gitpod.io/from-referrer/)
|
maintainer-merge
new-contributor
|
101/158 |
Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean |
3 |
10 |
['github-actions', 'goliath-klein', 'leanprover-radar', 'tb65536'] |
sgouezel assignee:sgouezel |
4-20228 4 days ago |
12-58703 12 days ago |
12-60281 12 days |
| 35745 |
khwilson author:khwilson |
feat(Mathlib/Analysis/Asymptotics/Defs): congr lemmas for IsBigO* |
This PR primarily provides two calculational lemmas that are commonly used in bounding functions.
First, it provides `IsBigO*.sum_congr`. This theorem allows the user to bound each term of a (finite) sum individually. This is different than `IsBigO.sum` which requires all terms to be bound by the _same_ function.
Second, it provides `IsBigO*.sum_congr'`. This theorem allows the user to bound the terms of a sum individually _when the length of the sum changes with respect to the running variable_. This is a common setup with certain techniques such as the method of the hyperbola.
Note: This makes the overall length of this file go above 1500 lines. I'm happy to break it up at the request of reviewers, but that's a bigger change to the API.
AI Usage: Looking up various lemma names in Google Gemini.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
92/1 |
Mathlib/Analysis/Asymptotics/Defs.lean |
1 |
2 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
4-20221 4 days ago |
8-13562 8 days ago |
8-13453 8 days |
| 35771 |
euprunin author:euprunin |
chore: golf using `exact` |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `IsBaseChange.comp`: 132 ms before, 98 ms after 🎉
* `Cardinal.powerlt_aleph0`: unchanged 🎉
* `ONote.fastGrowing_one`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
3/11 |
Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/SetTheory/Cardinal/Arithmetic.lean,Mathlib/SetTheory/Ordinal/Notation.lean |
3 |
1 |
['github-actions', 'vihdzp'] |
EtienneC30 assignee:EtienneC30 |
4-20216 4 days ago |
7-49893 7 days ago |
7-49784 7 days |
| 35858 |
vihdzp author:vihdzp |
doc(SetTheory/Ordinal/Arithmetic): improve documentation |
This PR does the following:
- Use better variable names in the docs (instead of just variants of the letter `o`).
- Remove mentions of things defined in other files, or specify that they are defined on other files.
---
[](https://gitpod.io/from-referrer/)
|
documentation
t-set-theory
|
14/21 |
Mathlib/SetTheory/Ordinal/Arithmetic.lean |
1 |
3 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
4-17501 4 days ago |
4-17525 4 days ago |
5-24131 5 days |
| 35905 |
Jun2M author:Jun2M |
feat(Combinatorics/Graph): Add definitions for small graphs (noEdge, bouquet, banana) |
This pull request adds new constructors and supporting lemmas for special types of graphs in the `Mathlib/Combinatorics/Graph/Basic.lean` file.
It introduces:
* `Graph.noEdge V`: The graph with vertex set V and empty edge set.
* `Graph.bouquet v E`: The graph with vertex set {v} and edge set E, where all edges are loops at v.
* `Graph.banana u v E`: The graph with vertex set {u, v} and edge set E, where all edges connect u and v.
along with various properties and characterizations for these graphs.
Co-authored-by: Peter Nelson [apn.uni@gmail.com](mailto:apn.uni@gmail.com)
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
126/0 |
Mathlib/Combinatorics/Graph/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
4-12886 4 days ago |
4-12954 4 days ago |
4-13273 4 days |
| 35539 |
xgenereux author:xgenereux |
feat(DedekindDomain/Factorization): add `iInf` version of `finprod_heightOneSpectrum_factorization` |
This PR adds an `iInf` version of `finprod_heightOneSpectrum_factorization`. This requires two lemmas:
- `prod_eq_iInf_of_coprime` - An `iInf` version of `mul_eq_inf_of_coprime`.
- `HeightOneSpectrum.pow_sup_pow_eq_top` - Bundled up version of `Ideal.IsMaximal.coprime_of_ne` + `Ideal.pow_sup_pow_eq_top` for `HeightOneSpectrum`.
------
I noticed that these lemmas simplify a bit the work on the Chinese remainder theorem done in the file. The last commit of this PR is this simplification. I can remove it if this is not relevant.
Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)>
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
73/42 |
Mathlib/RingTheory/DedekindDomain/Factorization.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/Ideal/Operations.lean |
3 |
10 |
['erdOne', 'github-actions', 'xgenereux'] |
chrisflav assignee:chrisflav |
3-70386 3 days ago |
3-70460 3 days ago |
12-83536 12 days |
| 35705 |
jdhart81 author:jdhart81 |
feat(Data/ENNReal, Probability/Independence): division decomposition and self-independence |
Two general-purpose lemmas extracted from a formal verification of "The Intelligence Bound" (Hart 2025).
---
### New lemmas
- `ENNReal.div_eq_div_mul_div`: Division decomposition `a / c = a / b * (b / c)` when `b ≠ 0` and `b ≠ ⊤`. Added to `Mathlib.Data.ENNReal.Inv`.
- `IndepFun.of_self`: If `Y` is independent of itself under a probability measure, then `X` and `Y` are independent. Self-independence implies `Y` is a.e. constant. Added to `Mathlib.Probability.Independence.Basic`.
### Context
These lemmas arose in formalizing information-theoretic results where:
- The ENNReal division identity is needed for decomposing rate expressions (limsup of ratios)
- The self-independence result bridges entropy = 0 and measure-theoretic independence
### References
- Formal verification: https://github.com/jdhart81/intelligence-bound-lean
- Paper: "The Intelligence Bound" (Hart 2025) |
new-contributor
t-data
|
47/0 |
Mathlib/Data/ENNReal/Inv.lean,Mathlib/Probability/Independence/Basic.lean |
2 |
10 |
['SnirBroshi', 'github-actions', 'jdhart81', 'joneugster', 'kbuzzard'] |
nobody |
3-65188 3 days ago |
6-55224 6 days ago |
8-25117 8 days |
| 34477 |
spanning-tree author:spanning-tree |
refactor(Order): make CompletePartialOrder extend OrderBot |
Make `CompletePartialOrder` extend `OrderBot`, and add a constructor `completePartialOrderOfLubOfDirected`. Previously, `CompletePartialOrder` had an implicit bottom element but did not extend OrderBot explicitly.
Breaking change: `CompletePartialOrder` instances must provide `⊥` and `bot_le`, or use the constructor.
See discussion in [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.3E.20complete.20partial.20order.20and.20domain.20theory.20formalization).
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
15/1 |
Mathlib/Order/CompletePartialOrder.lean |
1 |
3 |
['Citronhat', 'github-actions', 'mathlib-merge-conflicts'] |
pechersky assignee:pechersky |
3-59623 3 days ago |
3-59646 3 days ago |
24-34694 24 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
|
680/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/ExistsRiemannianMetric.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean |
3 |
200 |
['github-actions', 'grunweg', 'idontgetoutmuch'] |
grunweg assignee:grunweg |
3-52781 3 days ago |
3-52807 3 days ago |
17-82873 17 days |
| 34875 |
banrovegrie author:banrovegrie |
feat(LinearAlgebra/Matrix): add Sherman-Morrison formula |
Mathlib has the matrix determinant lemma (`det_add_replicateCol_mul_replicateRow` in SchurComplement.lean) but lacked the corresponding inverse formula. This PR fills that gap.
- Add `Matrix.inv_add_vecMulVec`: Sherman-Morrison formula for `(A + uv^T)^{-1}`
- Add `Matrix.inv_sub_vecMulVec`: subtraction variant
- Add `Matrix.isUnit_det_add_vecMulVec`: invertibility under the formula's hypotheses
## Test plan
- [x] `lake build` passes
- [x] Lines within 100 char limit
- [x] All declarations have docstrings |
t-algebra
new-contributor
label:t-algebra$ |
135/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/ShermanMorrison.lean |
2 |
11 |
['Xxxjdjdid', 'banrovegrie', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] |
kim-em assignee:kim-em |
3-51227 3 days ago |
27-55044 27 days ago |
27-54935 27 days |
| 29982 |
hrmacbeth author:hrmacbeth |
feat: new `isolate` tactic |
This PR adds a new tactic, `isolate`, which "solves for x" in an equation or relation. For example:
```lean
example (a b : ℝ) (f : ℝ → ℝ) : 5 * f a - 3 < b := by
isolate f a
-- new goal: `⊢ f a < (b + 3) / 5`
```
The `isolate` tactic may generate side goals, if these are necessary to justify the transformation. The tactic will attempt to justify such side goals using `positivity` (as in the above example), unification, or type class inference, but if unsuccessful will present them to the user. For example:
```lean
example (a b c : ℝ) (f : ℝ → ℝ) : c * f a - 3 < b := by
isolate f a
-- new goal: `⊢ f a < (b + 3) / c`
-- second (side) new goal: `⊢ 0 < c`
```
The `isolate` tactic is extensible. Coverage may be extended to new relations and new operations-to-be-undone by tagging appropriate lemmas with the new `@[isolate]` attribute.
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-meta
|
943/1 |
Mathlib.lean,Mathlib/Analysis/SpecialFunctions/Log/Basic.lean,Mathlib/Analysis/SpecialFunctions/Pow/Real.lean,Mathlib/Data/Real/Sqrt.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Isolate.lean,Mathlib/Tactic/Isolate/Core.lean,Mathlib/Tactic/Isolate/Tagging.lean,Mathlib/Tactic/Relation/Symm.lean,MathlibTest/Isolate/Heavyweight.lean,MathlibTest/Isolate/Lightweight.lean,scripts/noshake.json |
12 |
45 |
['JovanGerb', 'PatrickMassot', 'Vierkantor', 'github-actions', 'hrmacbeth', 'kim-em', 'mathlib4-merge-conflict-bot'] |
JovanGerb assignee:JovanGerb |
3-40505 3 days ago |
3-40505 3 days ago |
52-35100 52 days |
| 35639 |
vihdzp author:vihdzp |
chore(Order/SuccPred/Limit): use `to_dual` on everything that was missing |
---
- [x] depends on: #34882
[](https://gitpod.io/from-referrer/)
|
maintainer-merge |
36/135 |
Mathlib/Data/Fintype/Card.lean,Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/SuccPred/Limit.lean |
3 |
4 |
['JovanGerb', 'github-actions', 'mathlib-dependent-issues'] |
adamtopaz assignee:adamtopaz |
3-29347 3 days ago |
10-58418 10 days ago |
10-58590 10 days |
| 35325 |
SnirBroshi author:SnirBroshi |
feat(SimpleGraph/Acyclic): `ENat.card V ≤ 2 → G.IsAcyclic` |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
26/3 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Data/Finite/Card.lean |
2 |
2 |
['Rida-Hamadani', 'github-actions'] |
nobody |
3-28007 3 days ago |
12-18225 12 days ago |
17-82064 17 days |
| 35772 |
euprunin author:euprunin |
chore: golf using `grind` |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `CategoryTheory.Precoverage.toGrothendieck_toCoverage`: unchanged 🎉
* `Int.nonneg_or_nonpos_of_mul_nonneg`: unchanged 🎉
* `Associated.separable`: 113 ms before, 67 ms after 🎉
* `ModelWithCorners.isInteriorPoint_disjointUnion_left`: unchanged 🎉
* `ModelWithCorners.isInteriorPoint_disjointUnion_right`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
5/49 |
Mathlib/CategoryTheory/Sites/Coverage.lean,Mathlib/Data/Int/Order/Basic.lean,Mathlib/FieldTheory/Separable.lean,Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean |
4 |
1 |
['github-actions', 'vihdzp'] |
nobody |
3-22325 3 days ago |
7-47851 7 days ago |
7-47742 7 days |
| 34554 |
SnirBroshi author:SnirBroshi |
feat(Data/Nat/Factorization/Divisors): calculate divisors using prime factorization |
---
There are over 200 files that import both `divisors` and `factorization`, but none of them seemed to fit, so I created a new file for this.
(`Data.Nat.Factorization.PrimePow` and `NumberTheory.ArithmeticFunction.Misc` are the best I found)
[](https://gitpod.io/from-referrer/)
|
t-data |
91/0 |
Mathlib.lean,Mathlib/Data/Nat/Factorization/Divisors.lean |
2 |
20 |
['SnirBroshi', 'YaelDillies', 'b-mehta', 'eric-wieser', 'github-actions', 'jcommelin', 'mathlib-bors', 'plp127'] |
joneugster assignee:joneugster |
3-20337 3 days ago |
7-76911 7 days ago |
8-37913 8 days |
| 35058 |
GrigorenkoPV author:GrigorenkoPV |
chore: move tendsto_{floor,ceil}_at{Top,Bot} |
Moves:
- Topology.Algebra.Order.Floor.tendsto_floor_atTop -> Order.Filter.AtTopBot.Floor.tendsto_floor_atTop
- Topology.Algebra.Order.Floor.tendsto_floor_atBot -> Order.Filter.AtTopBot.Floor.tendsto_floor_atBot
- Topology.Algebra.Order.Floor.tendsto_ceil_atTop -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atTop
- Topology.Algebra.Order.Floor.tendsto_ceil_atBot -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atBot
---
Tracked in #7987
[](https://gitpod.io/from-referrer/)
|
new-contributor
large-import
|
22/25 |
Mathlib/Order/Filter/AtTopBot/Floor.lean,Mathlib/Topology/Algebra/Order/Floor.lean |
2 |
1 |
['github-actions'] |
adamtopaz assignee:adamtopaz |
3-20336 3 days ago |
21-74647 21 days ago |
21-74538 21 days |
| 35189 |
euprunin author:euprunin |
chore: golf proofs |
The goal of this golfing PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (shown if ≥10 ms before or after):
* `Complex.orderClosedTopology`: 227 ms before, <10 ms after 🎉
* `CategoryTheory.Functor.map_shiftFunctorComm`: 73 ms before, <10 ms after 🎉
* `CategoryTheory.extensiveTopology.presheafIsLocallySurjective_iff`: 154 ms before, 65 ms after 🎉
* `CategoryTheory.Presieve.functorPushforward_overForget`: 13 ms before, <10 ms after 🎉
* `Equiv.Perm.IsCycle.isCycle_pow_pos_of_lt_prime_order`: 15 ms before, <10 ms after 🎉
* `Equiv.Perm.IsCycle.isConj_iff`: <10 ms before, <10 ms after 🎉
* `Equiv.Perm.zpow_eq_ofSubtype_subtypePerm_iff`: 31 ms before, 32 ms after
* `StieltjesFunction.measure_Ici`: 242 ms before, 102 ms after 🎉
* `le_iff_eq_sup_sdiff`: 54 ms before, 19 ms after 🎉
This golfing PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
12/55 |
Mathlib/Analysis/Complex/Basic.lean,Mathlib/CategoryTheory/Shift/CommShift.lean,Mathlib/CategoryTheory/Sites/Coherent/LocallySurjective.lean,Mathlib/CategoryTheory/Sites/Sieves.lean,Mathlib/GroupTheory/Perm/Cycle/Basic.lean,Mathlib/MeasureTheory/Measure/Stieltjes.lean,Mathlib/Order/BooleanAlgebra/Basic.lean |
7 |
5 |
['euprunin', 'github-actions', 'leanprover-radar'] |
dwrensha assignee:dwrensha |
3-20336 3 days ago |
20-50476 20 days ago |
20-50367 20 days |
| 35756 |
mariainesdff author:mariainesdff |
feat(Data/Nat/Choose/Multinomial): add lemmas |
Co-authored-by: @AntoineChambert-Loir.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
t-data
|
25/0 |
Mathlib/Data/Nat/Choose/Multinomial.lean |
1 |
1 |
['github-actions'] |
Vierkantor assignee:Vierkantor |
3-20334 3 days ago |
7-73247 7 days ago |
7-73138 7 days |
| 35764 |
YaelDillies author:YaelDillies |
feat(Data/Finsupp): characterise when `Finsupp` is `Nontrivial` |
From ClassFieldTheory
---
[](https://gitpod.io/from-referrer/)
|
t-data |
15/6 |
Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/Single.lean |
2 |
1 |
['github-actions'] |
joneugster assignee:joneugster |
3-20333 3 days ago |
7-65129 7 days ago |
7-65020 7 days |
| 35804 |
mariainesdff author:mariainesdff |
feat(RingTheory/DividedPowerAlgebra/Init): add universal divided power algebra |
We define the universal divided power algebra of an `R`-module `M`.
Co-authored by @AntoineChambert-Loir
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
281/0 |
Mathlib.lean,Mathlib/RingTheory/DividedPowerAlgebra/Init.lean |
2 |
1 |
['github-actions'] |
mattrobball assignee:mattrobball |
3-20327 3 days ago |
6-59055 6 days ago |
6-59486 6 days |
| 35807 |
Raph-DG author:Raph-DG |
chore(Topology): Generalised some of the instances for Function.locallyFinsuppWithin |
In this PR, we generalised the various instances for locally fin supp functions. These changes were originally made on the PR #26304 about algebraic cycles, but it was decided that these changes are more appropriate in their own PR.
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
57/23 |
Mathlib/Topology/LocallyFinsupp.lean |
1 |
1 |
['github-actions'] |
dagurtomas assignee:dagurtomas |
3-20326 3 days ago |
6-66129 6 days ago |
6-66475 6 days |
| 35818 |
Vierkantor author:Vierkantor |
chore(Tactic): rewrite `finiteness` tactic docstring |
This PR (re)writes the docstrings for the `finiteness` tactic, to consistently match the official style guide, to make sure they are complete while not getting too long.
A bit of restructuring and clarification.
---
[](https://gitpod.io/from-referrer/)
|
documentation
t-meta
|
18/5 |
Mathlib/Tactic/Finiteness.lean |
1 |
1 |
['github-actions'] |
adamtopaz assignee:adamtopaz |
3-20322 3 days ago |
6-50903 6 days ago |
6-50794 6 days |
| 31891 |
jsm28 author:jsm28 |
feat(Geometry/Euclidean/Sphere/OrthRadius): lemmas for setting up and using polars |
Add further lemmas about `orthRadius` that are of use in setting up and using poles and polars. In particular,
`ncard_inter_orthRadius_eq_two_of_dist_lt_radius` is the key part of showing that, in two dimensions, there are exactly two tangents to a circle from a point outside that circle (where the points of tangency lie on the polar of the point from which the two tangents are drawn).
---
Feel free to golf the proof of `ncard_inter_orthRadius_eq_two_of_dist_lt_radius`, it could probably be rather shorter.
---
- [ ] depends on: #32296
[](https://gitpod.io/from-referrer/)
|
t-euclidean-geometry |
265/7 |
Mathlib/Geometry/Euclidean/Sphere/OrthRadius.lean,Mathlib/Geometry/Euclidean/Sphere/Tangent.lean |
2 |
28 |
['Parcly-Taxel', 'eric-wieser', 'github-actions', 'jsm28', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot'] |
JovanGerb assignee:JovanGerb |
3-20175 3 days ago |
14-63073 14 days ago |
102-84191 102 days |
| 35884 |
Parcly-Taxel author:Parcly-Taxel |
chore: fix induction and recursor names |
* `Finset.induction_on_{min,max}`, `Finset.induction_on_{min,max}_value`
* `FreeAbelianGroup.induction_on`, `FreeAbelianGroup.induction_on'`
Applications of these induction principles are also fixed. |
tech debt |
109/112 |
Mathlib/Algebra/Order/Rearrangement.lean,Mathlib/Combinatorics/Additive/SubsetSum.lean,Mathlib/Data/Finset/Max.lean,Mathlib/GroupTheory/FreeAbelianGroup.lean,Mathlib/LinearAlgebra/Multilinear/Basic.lean |
5 |
6 |
['Parcly-Taxel', 'chenson2018', 'github-actions'] |
nobody |
3-20158 3 days ago |
4-79147 4 days ago |
4-79038 4 days |
| 35954 |
mcdoll author:mcdoll |
feat(Analysis/Fourier): the Fourier transform as bounded continuous function |
This is the main step in proving that the Fourier transform defined via the integral is equal to the Fourier transform on `L1` via extension of Schwartz functions. We do not use the Riemann-Lebesgue lemma here to define the map into `ZeroAtInftyContinuousMap` because it is possible to deduce Riemann-Lebesgue from embedding of Schwartz functions.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
87/5 |
Mathlib/Analysis/Fourier/FourierTransform.lean |
1 |
1 |
['github-actions'] |
nobody |
3-8704 3 days ago |
3-8790 3 days ago |
3-8681 3 days |
| 34632 |
mitchell-horner author:mitchell-horner |
feat(Combinatorics/SimpleGraph): add `BipartiteDoubleCover` |
`bipartiteDoubleCover G` has two vertices `inl v` and `inr v` for each vertex `v` in `G` such that `inl v` (`inr v`) is adjacent to `inr w` (`inl w`) iff `v` is adjacent to `w` in `G`.
---
This comes from splitting up #25841 into smaller PRs.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
87/0 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean |
1 |
10 |
['github-actions', 'mitchell-horner', 'vihdzp', 'vlad902'] |
nobody |
3-7989 3 days ago |
12-4183 12 days ago |
33-14494 33 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.
- [ ] depends on: #34598
---
|
new-contributor
t-euclidean-geometry
|
360/0 |
Mathlib.lean,Mathlib/Geometry/Polygon/Boundary.lean,Mathlib/Geometry/Polygon/Simple.lean,Mathlib/Logic/Equiv/Fin/Rotate.lean |
4 |
29 |
['A-M-Berns', 'eric-wieser', 'github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp', 'wwylele'] |
nobody |
3-5842 3 days ago |
7-46200 7 days ago |
9-80377 9 days |
| 35243 |
ScottCarnahan author:ScottCarnahan |
chore(Algebra/MonoidAlgebra/PointwiseSMul): switch action from Finsupp to (Add)MonoidAlgebra and multiplicativize |
This PR moves the API for convolution action on functions from `Finsupp` to `MonoidAlgebra`, adding a `Semiring` hypothesis. We do this move, because the convolution action of finsupps on formal functions is more naturally expressed as an action by the monoid algebra with its convolutional multiplication.
This PR also multiplicativizes, preserving the original material with `to_additive`.
---
[](https://gitpod.io/from-referrer/)
|
large-import
t-algebra
label:t-algebra$ |
109/52 |
Mathlib.lean,Mathlib/Algebra/MonoidAlgebra/PointwiseSMul.lean,Mathlib/Data/Finsupp/PointwiseSMul.lean |
3 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
eric-wieser assignee:eric-wieser |
3-1679 3 days ago |
3-1679 3 days ago |
7-68909 7 days |
| 35851 |
vihdzp author:vihdzp |
chore(SetTheory/Ordinal/Arithmetic): remove `backward.privateInPublic` |
---
[](https://gitpod.io/from-referrer/)
|
t-set-theory
tech debt
|
12/17 |
Mathlib/SetTheory/Ordinal/Arithmetic.lean |
1 |
5 |
['github-actions', 'plp127', 'vihdzp'] |
nobody |
3-1528 3 days ago |
5-79475 5 days ago |
5-79366 5 days |
| 35956 |
Scarlett-le author:Scarlett-le |
feat: add orthogonality lemmas for inner product spacesonal |
## Summary
Adds two lemmas about orthogonality in inner product spaces.
## New declarations
- `real_inner_sub_smul_div_inner_self_eq_zero` (`Mathlib.Analysis.InnerProductSpace.Basic`): the inner product of `u - (⟪u, d⟫_ℝ / ⟪d, d⟫_ℝ) • d` with `d` is zero; subtracting the orthogonal projection of `u` onto `d` yields a vector orthogonal to `d`. Holds unconditionally including when `d = 0`.
- `mem_span_singleton_of_inner_eq_zero_of_inner_eq_zero` (`Mathlib.Analysis.InnerProductSpace.Projection.FiniteDimensional`): in a two-dimensional inner product space, if nonzero vectors `w` and `u` are both orthogonal to the same nonzero vector `v`, then `u` lies in the span of `w`. |
t-analysis |
25/0 |
Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/InnerProductSpace/Projection/FiniteDimensional.lean |
2 |
1 |
['github-actions'] |
nobody |
3-520 3 days ago |
3-637 3 days ago |
3-528 3 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 |
323/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Extremal/ErdosStoneSimonovits.lean |
2 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] |
nobody |
2-86221 2 days ago |
2-86221 2 days ago |
2-86158 2 days |
| 32987 |
kim-em author:kim-em |
feat: pipeline downloads and decompression in `cache get` |
This PR modifies `lake exe cache get` to decompress files as they download, rather than waiting for all downloads to complete first.
Previously the cache system had two sequential phases: download all files using `curl --parallel`, then decompress all files using a single `leantar` call. Now a background task spawns sequential batched `leantar` calls to decompress files as downloads complete, pipelining network I/O and disk I/O.
🤖 Prepared with Claude Code
- [x] depends on: #34667 |
t-meta
maintainer-merge
|
190/35 |
Cache/IO.lean,Cache/Requests.lean |
2 |
65 |
['Vierkantor', 'eric-wieser', 'github-actions', 'joneugster', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
joneugster assignee:joneugster |
2-83673 2 days ago |
5-71621 5 days ago |
61-70211 61 days |
| 35947 |
euprunin author:euprunin |
chore: replace `aesop` with `grind` where the latter is significantly faster |
This experiment investigates the impact of replacing particularly heavy `aesop` calls with `grind`, specifically how this change affects the instruction count as measured by the benchmarking infrastructure.
Trace profiling results (differences <30 ms considered measurement noise):
* `Submonoid.mem_closure_image_one_lt_iff`: 125 ms before, 61 ms after 🎉
* `SimpleGraph.Connected.connected_delete_edge_of_not_isBridge`: 230 ms before, 51 ms after 🎉
* `SimpleGraph.Subgraph.IsMatching.exists_of_disjoint_sets_of_equiv`: 899 ms before, 666 ms after 🎉
* `SimpleGraph.IsCycles.existsUnique_ne_adj`: 855 ms before, 599 ms after 🎉
* `SimpleGraph.Walk.IsPath.isCycles_spanningCoe_toSubgraph_sup_edge`: 962 ms before, 619 ms after 🎉
* `SimpleGraph.IsAlternating.sup_edge`: 2854 ms before, 1615 ms after 🎉
* `SimpleGraph.Subgraph.IsPerfectMatching.symmDiff_of_isAlternating`: 3103 ms before, 1734 ms after 🎉
* `SimpleGraph.edgeSet_replaceVertex_of_not_adj`: 1525 ms before, 933 ms after 🎉
* `SimpleGraph.edgeSet_replaceVertex_of_adj`: 2194 ms before, 1605 ms after 🎉
* `SimpleGraph.tutte_exists_isPerfectMatching_of_near_matchings`: 3161 ms before, 1652 ms after 🎉
* `RootPairing.Base.sub_notMem_range_root`: 1025 ms before, 978 ms after 🎉
* `RootPairing.EmbeddedG2.mem_allRoots`: 3832 ms before, 3255 ms after 🎉
* `RootSystem.GeckConstruction.Lemmas.0.RootPairing.chainBotCoeff_mul_chainTopCoeff.aux_2`: 3572 ms before, 2631 ms after 🎉
* `isCompact_generateFrom`: 1987 ms before, 763 ms after 🎉
* `IsCompactOpenCovered.of_isCompact_of_forall_exists_isCompactOpenCovered`: 2279 ms before, 2009 ms after 🎉
* `UniformContinuousOn.comp_tendstoUniformly_eventually`: 416 ms before, 151 ms after 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
27/27 |
Mathlib/Algebra/Group/Irreducible/Indecomposable.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean,Mathlib/Combinatorics/SimpleGraph/Operations.lean,Mathlib/Combinatorics/SimpleGraph/Tutte.lean,Mathlib/LinearAlgebra/RootSystem/Base.lean,Mathlib/LinearAlgebra/RootSystem/Finite/G2.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Lemmas.lean,Mathlib/Topology/Compactness/Compact.lean,Mathlib/Topology/Sets/CompactOpenCovered.lean,Mathlib/Topology/UniformSpace/UniformConvergenceTopology.lean |
11 |
4 |
['euprunin', 'github-actions', 'leanprover-radar', 'vihdzp'] |
nobody |
2-80843 2 days ago |
3-24271 3 days ago |
3-24162 3 days |
| 35632 |
SnirBroshi author:SnirBroshi |
feat(Data/List/TakeDrop): `take`/`drop` + `tail`/`dropLast` almost commute |
---
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/List.2Etail.2FList.2EdropLast.20.2B.20List.2Etake/with/572294698)
[](https://gitpod.io/from-referrer/)
|
t-data |
22/0 |
Mathlib/Data/List/TakeDrop.lean |
1 |
3 |
['SnirBroshi', 'github-actions', 'joneugster'] |
joneugster assignee:joneugster |
2-80416 2 days ago |
11-4896 11 days ago |
11-5802 11 days |
| 35962 |
euprunin author:euprunin |
chore: golf using `simp` |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `CategoryTheory.MonoidalCategory.leftUnitor_monoidal`: unchanged 🎉
* `MeasureTheory.Measure.haar.is_left_invariant_index`: unchanged 🎉
* `Ideal.Filtration.submodule_fg_iff_stable`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
4/10 |
Mathlib/CategoryTheory/Monoidal/Braided/Basic.lean,Mathlib/MeasureTheory/Measure/Haar/Basic.lean,Mathlib/RingTheory/Filtration.lean |
3 |
1 |
['github-actions'] |
nobody |
2-79508 2 days ago |
2-79582 2 days ago |
2-79473 2 days |
| 35960 |
vihdzp author:vihdzp |
chore(Order/ConditionallyCompleteLattice/Basic): remove `backward.isDefEq.respectTransparency` |
---
[](https://gitpod.io/from-referrer/)
|
t-order
easy
|
0/8 |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
2-78299 2 days ago |
2-78299 2 days ago |
2-78204 2 days |
| 34758 |
Hagb author:Hagb |
feat(RingTheory/MvPolynomial/MonomialOrder): misc lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
52/2 |
Mathlib/RingTheory/MvPolynomial/MonomialOrder.lean |
1 |
7 |
['Hagb', 'erdOne', 'github-actions'] |
mattrobball assignee:mattrobball |
2-77814 2 days ago |
2-77870 2 days ago |
21-51616 21 days |
| 35896 |
harahu author:harahu |
chore(misc): fix typos |
The typos were identified by `PyCharm`'s proofreading inspection.
---
[](https://gitpod.io/from-referrer/)
|
|
90/90 |
Mathlib/Algebra/Category/ModuleCat/Ulift.lean,Mathlib/Algebra/Group/Hom/Defs.lean,Mathlib/Algebra/Homology/BifunctorShift.lean,Mathlib/Algebra/Homology/Embedding/ExtendHomotopy.lean,Mathlib/Algebra/Homology/HomotopyCategory/HomComplexSingle.lean,Mathlib/Algebra/Homology/HomotopyCategory/Pretriangulated.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/Lie/EngelSubalgebra.lean,Mathlib/Algebra/Order/Antidiag/Prod.lean,Mathlib/Algebra/Order/SuccPred/TypeTags.lean,Mathlib/Algebra/Polynomial/PartialFractions.lean,Mathlib/AlgebraicGeometry/Modules/Tilde.lean,Mathlib/AlgebraicGeometry/Morphisms/Flat.lean,Mathlib/AlgebraicGeometry/Normalization.lean,Mathlib/AlgebraicTopology/SimplexCategory/Augmented/Basic.lean,Mathlib/AlgebraicTopology/SimplexCategory/GeneratorsRelations/EpiMono.lean,Mathlib/AlgebraicTopology/SimplicialSet/HoFunctorMonoidal.lean,Mathlib/Analysis/Analytic/Composition.lean,Mathlib/Analysis/Calculus/DifferentialForm/VectorField.lean,Mathlib/Analysis/Calculus/TangentCone/Seq.lean,Mathlib/Analysis/Complex/Positivity.lean,Mathlib/Analysis/Complex/UnitDisc/Basic.lean,Mathlib/Analysis/Complex/ValueDistribution/LogCounting/Basic.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Distribution/ContDiffMapSupportedIn.lean,Mathlib/Analysis/Distribution/Distribution.lean,Mathlib/Analysis/InnerProductSpace/Coalgebra.lean,Mathlib/Analysis/InnerProductSpace/OfNorm.lean,Mathlib/Analysis/LocallyConvex/WithSeminorms.lean,Mathlib/Analysis/Normed/Algebra/GelfandMazur.lean,Mathlib/Analysis/Normed/Module/ContinuousInverse.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/RCLike/Real.lean,Mathlib/Analysis/Normed/Operator/ContinuousAlgEquiv.lean,Mathlib/Analysis/Normed/Unbundled/FiniteExtension.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Extremal.lean,Mathlib/CategoryTheory/Abelian/Injective/Resolution.lean,Mathlib/CategoryTheory/Comma/Over/Basic.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/Categorical/Basic.lean,Mathlib/CategoryTheory/LocallyCartesianClosed/ExponentiableMorphism.lean,Mathlib/CategoryTheory/Sites/Descent/DescentDataAsCoalgebra.lean,Mathlib/CategoryTheory/Sites/Point/Over.lean,Mathlib/CategoryTheory/Sites/SheafOfTypes.lean,Mathlib/Combinatorics/Matroid/Map.lean,Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Condensed/Light/InternallyProjective.lean,Mathlib/Data/Matrix/ColumnRowPartitioned.lean,Mathlib/Data/Seq/Defs.lean,Mathlib/Data/Set/Operations.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/Combination.lean,Mathlib/LinearAlgebra/RootSystem/Reduced.lean,Mathlib/LinearAlgebra/TensorPower/Symmetric.lean,Mathlib/LinearAlgebra/Transvection.lean,Mathlib/NumberTheory/Chebyshev.lean,Mathlib/NumberTheory/Height/Basic.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Def.lean,Mathlib/Probability/Independence/Process.lean,Mathlib/RingTheory/Extension/Cotangent/Basic.lean,Mathlib/RingTheory/Flat/TorsionFree.lean,Mathlib/RingTheory/FractionalIdeal/Extended.lean,Mathlib/RingTheory/IntegralClosure/Algebra/Ideal.lean,Mathlib/RingTheory/PowerSeries/Expand.lean,Mathlib/RingTheory/QuasiFinite/Basic.lean,Mathlib/RingTheory/Smooth/Fiber.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean,Mathlib/Topology/MetricSpace/CoveringNumbers.lean,Mathlib/Topology/MetricSpace/PartitionOfUnity.lean |
69 |
1 |
['github-actions'] |
nobody |
2-77153 2 days ago |
2-77224 2 days ago |
2-79846 2 days |
| 35928 |
xgenereux author:xgenereux |
feat(Subalgebra/Lattice): add notation for Algebra.adjoin |
This PR proposes a scoped notation for Algebra.adjoin, `R[a]`, inspired from `IntermediateField.adjoin`.
See [here](https://live.lean-lang.org/#codez=JYWwDg9gTgLgBAWQIYwBYBtgCMBQOC0+cAggCZJgwCmpcAxhKVXAGZQQhwAGAkgHbUoIGsBRUAYsCrpSXAHQ4+SYQGcwSOs2LoA5lSxQkeCGCp84AGSpJzwPjgD0hOAGUArmEiw7O1m750MMAQ5izQcGjMXABKANoAHoCBBAA08YBBBMlyWamAmQQAulxwSKQAVv6BweZ8EDAolXJw+A44YFDAAG5icMK1cEws3QDW/CpUsAAqY5wA3pwAXHDjAJ6mcIBJhIsrVAC+cLEIIcXdeXsHSqQAim41dSHHOHCPcAAU8SpwC+MuSwJI8cRQQxLbiCEAASg+3UWUw+AF44FB/HAAAxwADuqDGVAeCKRz2AkIAcigIQtOJMhHC+hAcY9gANUJCCQBqOAARjg8LechUwAAXsxIvYnk8uFxnry+Dp0FQYHcACSvFSxYB5MFg2lwaSjOD0uCMhYEgA8cG5vIFEUxwpF3HFdlGsDgireKrVTuegATCXHmfFwVls9UakXa7E223PACi4BgSwAwhB0DKKiE5FRo3GE0mgiENY5nDwBlwkqa0nAsg14jlIcRCkLuHEkqkMuXcgVde9Itx3FgkLp9IY4NESFwcHo+GMxLQsMDIjrpGmzDAVA0mjgVAxTLQQBp2HMAJxs5GogDSc1BcAARLEL6aVGepskAFSXvI3hbn2EAPmp4eKJQgdhOse7peiAwx8A6MAUpw3J6DAEYyiAKjqsYpjmFYNhwAAClAsoxjhdiCHIAAi0hIFg0AoOE3YRvErS6vYAACsQUGAAD6TDoORJB9gYSByH+AF8HkOA9EgcDqN4vZ9FQAyceRZD/nYhI3Nm5gLKRXFYFSGJmFhWEAPKUJUcBwfpKm1Gp1I4jK8DMF6cG0a0OI6G4SBQLQRoAD5anIwAqMQngGSwALADGtqCYBABsNmynA4hwF6aJhagxJQEsAK+Ki8m4I8tm3ol6IpWlGVQL4ACsMlaSMYwwACQI4uK8riLEzrLnK9VIEsYJPmqOC6bhOI5TVsCdcCGlkVgCAvBY/nwNBpLwqQNIivl9mmbKTlQJqepUH5AVBSFbThWKUaUBmiZUMmfCpum8aXddcAAEyWmYmqPLhMBuFA5ixCJwboDqu37YFYDBaFJ1cJK0qyncAAsr3WqtcXxIVyVoCVmVwAAzFV5HvQisrfb98T/U8Ia6gMe3+aD4PHcCYr2rVcCVUKBP5ajSXFe5pW+LjOXsyj7xcxjPNYwjw0QbVY0E59xOmh8CxvJqFMsEgwDoN92I4GYtDaHofF4M4tHKGAMoqHgoyPdUQi9gAqqMsZIKMqFmDxBuGEbRAqbb6BwG4LudG05Eyi8Q7EJCyymI+EKxPGIAgC4abAG0UqDicsRJyAKc+CQGf6/24nhyc0zidpdDVtseBUPEpuhwscRICc8KN8kRQnHM8LTnAvLgHgADEdCYnQgyDixImD8Po+t3AWAT0PV3TyxbdYG3dAiTrfC0Db27oA7VBOy7a5XVZdBcSoqB4EHohYKHzzh5HWwx3s8eJ8nqe+NEGdZznafEPnvEBzFzgNMAAGpXV25gsIJh+BwUQ6AcAmDdgXPicAcCT0XmPUBJxnBxGwY/VYbg2Jsmrlveg59L54BwEAA) for a preview of how it would look like.
Note that I am currently using bracked, `[`, `]`. I know this clashes with the notation for `Polynomial`, `DualNumber`, `AdjoinRoot` and `GetElem` but it is my impression that it would rarely cause issues.
See [#mathlib4 > Notation for Algebra.adjoin](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Notation.20for.20Algebra.2Eadjoin/with/576551144).
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
239/186 |
Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/DualNumber.lean,Mathlib/Analysis/Normed/Unbundled/IsPowMulFaithful.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Algebra.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean,Mathlib/FieldTheory/Minpoly/IsIntegrallyClosed.lean,Mathlib/FieldTheory/Minpoly/MinpolyDiv.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/LinearAlgebra/Semisimple.lean,Mathlib/NumberTheory/JacobiSum/Basic.lean,Mathlib/NumberTheory/NumberField/Cyclotomic/Basic.lean,Mathlib/RingTheory/Adjoin/Polynomial/Basic.lean,Mathlib/RingTheory/Adjoin/PowerBasis.lean,Mathlib/RingTheory/Adjoin/Singleton.lean,Mathlib/RingTheory/Algebraic/Basic.lean,Mathlib/RingTheory/Conductor.lean,Mathlib/RingTheory/IntegralClosure/IsIntegralClosure/Basic.lean,Mathlib/RingTheory/Polynomial/Eisenstein/IsIntegral.lean,Mathlib/RingTheory/Polynomial/Ideal.lean,Mathlib/RingTheory/RootsOfUnity/Lemmas.lean,Mathlib/RingTheory/Unramified/LocalStructure.lean,Mathlib/RingTheory/Valuation/LocalSubring.lean,Mathlib/Topology/Algebra/Algebra.lean |
23 |
3 |
['github-actions', 'xgenereux'] |
nobody |
2-76414 2 days ago |
2-76414 2 days ago |
3-29858 3 days |
| 35805 |
adrianmartir author:adrianmartir |
feat(NumberTheory/Divisors): Add `infinite_setOf_divisors_iff` |
This proves that the set of divisors `{ m | m | n }` of a natural number `n` is infinite if and only if `n` is zero. The first proof draft was by @Aristotle-Harmonic.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
|
10/0 |
Mathlib/NumberTheory/Divisors.lean |
1 |
5 |
['adrianmartir', 'alexjbest', 'github-actions'] |
alexjbest assignee:alexjbest |
2-75130 2 days ago |
6-73132 6 days ago |
6-73059 6 days |
| 35966 |
joelriou author:joelriou |
feat(CategoryTheory/Abelian): the localization w.r.t. a Serre class is abelian |
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
large-import
|
276/6 |
Mathlib/CategoryTheory/Abelian/SerreClass/Localization.lean |
1 |
1 |
['github-actions'] |
nobody |
2-71295 2 days ago |
2-71372 2 days ago |
2-71263 2 days |
| 35874 |
xgenereux author:xgenereux |
feat(Adjoin/Polynomial/Bivariate): IsAlgebraic.adjoin_singleton |
This PR builds up to the following theorem:
- `IsAlgebraic.adjoin_singleton`:
Given two transcendental elements `a`, `b` over `R`, if one of them, say `a`, is algebraic over
`R[b]` then `b` is algebraic over `R[a]`.
In particular, it uses maps between `R[a]` and `R[X]` as well of some of the Bivariate polynomial API.
The results are necessary in preparation for the following: Given a function field `K` and `(y : K)` such that
`(hy : Transcendental Fq y)` then we have:
```
FiniteDimensional Fq⟮y⟯ K
```
Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)>
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
90/0 |
Mathlib.lean,Mathlib/RingTheory/Adjoin/Polynomial/Bivariate.lean |
2 |
6 |
['github-actions', 'joneugster', 'mathlib-merge-conflicts', 'robin-carlier', 'xgenereux'] |
nobody |
2-67945 2 days ago |
2-72538 2 days ago |
2-72954 2 days |
| 35637 |
vihdzp author:vihdzp |
chore(Topology/Order/LeftRight): use `to_dual` |
This overlaps with #35635, but the overlap is small (and that PR still needs some work, so I'd rather get this out of the way first).
---
[](https://gitpod.io/from-referrer/)
|
maintainer-merge |
32/26 |
Mathlib/Order/Interval/Set/LinearOrder.lean,Mathlib/Tactic/Translate/ToDual.lean,Mathlib/Topology/Order/LeftRight.lean |
3 |
8 |
['JovanGerb', 'github-actions', 'vihdzp'] |
jcommelin assignee:jcommelin |
2-67012 2 days ago |
11-646 11 days ago |
11-537 11 days |
| 34757 |
Hagb author:Hagb |
feat(Algebra/MvPolynomial/Rename): some lemmas about `rename` and `killCompl` |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
66/1 |
Mathlib/Algebra/MvPolynomial/Rename.lean |
1 |
6 |
['Hagb', 'dagurtomas', 'github-actions'] |
dagurtomas assignee:dagurtomas |
2-67001 2 days ago |
2-67001 2 days ago |
25-21362 25 days |
| 33129 |
Paul-Lez author:Paul-Lez |
feat(Tactic/Simproc/VecPerm): add simproc for permuting entries of a vector |
---
[](https://gitpod.io/from-referrer/)
|
t-meta |
160/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Simproc/VecPerm.lean,MathlibTest/Simproc/VecPerm.lean |
4 |
83 |
['JovanGerb', 'Paul-Lez', 'b-mehta', 'eric-wieser', 'github-actions', 'ocfnash'] |
JovanGerb assignee:JovanGerb |
2-60484 2 days ago |
7-74381 7 days ago |
54-61582 54 days |
| 35984 |
urkud author:urkud |
feat(Topology/VectorBundle): add `simp` lemmas |
---
[](https://gitpod.io/from-referrer/)
|
t-topology |
21/8 |
Mathlib/Topology/VectorBundle/Basic.lean,Mathlib/Topology/VectorBundle/Hom.lean |
2 |
1 |
['github-actions'] |
nobody |
2-56103 2 days ago |
2-56177 2 days ago |
2-56068 2 days |
| 35597 |
BryceT233 author:BryceT233 |
feat(AdicTopology): add lemmas about adic topology |
This PR adds APIs to transport topological and uniform properties of adic topologies across ring equivalences, By upgrading an ideal-preserving ring equivalence to a `UniformEquiv`, we provide natural congruence lemmas for adic completeness, precompleteness, and Hausdorffness, which serve as necessary topological preliminaries for the ongoing formalization of the Cohen Structure Theorem.
Co-authored-by: @Thmoas-Guan
---
[](https://gitpod.io/from-referrer/)
|
t-topology
new-contributor
|
55/2 |
Mathlib/RingTheory/AdicCompletion/Topology.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean |
2 |
7 |
['erdOne', 'github-actions'] |
urkud assignee:urkud |
2-54939 2 days ago |
9-11695 9 days ago |
11-85346 11 days |
| 35647 |
BryceT233 author:BryceT233 |
feat(RingTheory/Ideal/Quotient): add a canonical inclusion map |
This is the second PR split from the larger PR https://github.com/leanprover-community/mathlib4/pull/34936 to make the review process easier.
It introduces `Submodule.powSmulQuotInclusion`, which is the canonical inclusion from `I ^ a • N ⧸ I ^ b • (I ^ a • N)` to `M ⧸ I ^ c • N` where `c = b + a`, and provides auxiliary lemmas for it
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
new-contributor
|
37/0 |
Mathlib/RingTheory/Ideal/Quotient/PowTransition.lean |
1 |
9 |
['BryceT233', 'erdOne', 'github-actions', 'wwylele'] |
chrisflav assignee:chrisflav |
2-54818 2 days ago |
4-13783 4 days ago |
10-28461 10 days |
| 35594 |
chrisflav author:chrisflav |
feat(RingTheory): `Extension.CotangentSpace` commutes with base change |
From Pi1.
---
- [x] depends on: #35557
- [x] depends on: #35699
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
136/0 |
Mathlib.lean,Mathlib/RingTheory/Extension/Basic.lean,Mathlib/RingTheory/Extension/Cotangent/BaseChange.lean,Mathlib/RingTheory/Extension/Cotangent/Basic.lean |
4 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
2-51103 2 days ago |
2-51103 2 days ago |
2-52381 2 days |
| 35963 |
Parcly-Taxel author:Parcly-Taxel |
refactor: review Kleene algebra axioms |
The docstring did not match the actual conditions in the `KleeneAlgebra` class and there was one more condition than necessary. We replace `one_le_kstar, mul_kstar_le_kstar, kstar_mul_le_kstar` with
```lean
one_add_mul_kstar (a : α) : 1 + a * a∗ = a∗
one_add_kstar_mul (a : α) : 1 + a∗ * a = a∗
```
From the pair, the trio is trivially derivable. The pair's derivation from the trio is Proposition 2 in Kozen's 1994 paper.
We also remove the `bot` and `bot_le` fields in `IdemSemiring`, since the remaining axioms already show `0 ≤ a` for all `a`. |
t-algebra label:t-algebra$ |
102/93 |
Mathlib/Algebra/Algebra/Operations.lean,Mathlib/Algebra/Order/Kleene.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/Computability/Language.lean |
4 |
11 |
['Parcly-Taxel', 'github-actions', 'plp127', 'vihdzp'] |
nobody |
2-47538 2 days ago |
2-59501 2 days ago |
2-70449 2 days |
| 35477 |
harahu author:harahu |
chore(Geometry): fix markdown lists |
We make sure to also indent subsequent lines of an item: this is required by the markdown specification (though not doc-gen), it expresses intent more clearly, and makes it easier to catch accidental misindentations.
Furthermore, we split some text out of the ultimate item of some markdown lists, where the text was accidentally attached to it.
---
[](https://gitpod.io/from-referrer/)
|
|
11/9 |
Mathlib/Geometry/Diffeology/Basic.lean,Mathlib/Geometry/Euclidean/Sphere/Ptolemy.lean,Mathlib/Geometry/Manifold/ContMDiff/Constructions.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean,Mathlib/Geometry/Manifold/MFDeriv/Defs.lean |
6 |
9 |
['github-actions', 'grunweg', 'harahu', 'mathlib-merge-conflicts'] |
grunweg assignee:grunweg |
2-39654 2 days ago |
2-40077 2 days ago |
12-74838 12 days |
| 35977 |
jessealama author:jessealama |
feat(Algebra/Homology): add dimension lemmas for homological complex differentials |
Show that `dFrom` and `dTo` in a homological complex vanish when the target or source object is zero, and add `Mathlib.Algebra.Homology.ChainComplex.Dimension` with dimension-related properties for complexes of modules over a division ring over an arbitrary `ComplexShape ι`: zero range from zero objects, finrank equalities between `dFrom`/`dTo` ranges and the underlying differential, inclusion of the range of `dTo` in the kernel of `dFrom`, and a finrank equality for adjacent differentials in ℤ-indexed chain complexes.
Spun off from #29713. |
t-algebra label:t-algebra$ |
111/0 |
Mathlib.lean,Mathlib/Algebra/Homology/ChainComplex/Dimension.lean,Mathlib/Algebra/Homology/HomologicalComplex.lean |
3 |
2 |
['github-actions', 'mathlib-bors'] |
nobody |
2-37353 2 days ago |
2-59452 2 days ago |
2-59381 2 days |
| 29186 |
winstonyin author:winstonyin |
feat: IsIntegralCurve for solutions to ODEs |
I define `IsIntegralCurve` etc. for solutions to ODEs on vector spaces. The translation and scaling lemmas are also included. This parallels `IsMIntegralCurve` etc. for manifolds.
Moved from #26534.
- [x] depends on: #26563
---
[](https://gitpod.io/from-referrer/)
|
t-dynamics
t-differential-geometry
t-analysis
|
309/17 |
Mathlib.lean,Mathlib/Analysis/ODE/Basic.lean,Mathlib/Analysis/ODE/Transform.lean,Mathlib/Geometry/Manifold/IntegralCurve/Transform.lean,Mathlib/Geometry/Manifold/IntegralCurve/UniformTime.lean |
5 |
32 |
['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'mcdoll', 'michaellee94', 'sgouezel', 'winstonyin'] |
sgouezel assignee:sgouezel |
2-36959 2 days ago |
2-36998 2 days ago |
134-41633 134 days |
| 35998 |
gasparattila author:gasparattila |
feat: affine isomorphisms between spaces of affine maps |
These isomorphisms are analogous to `LinearEquiv.arrowCongr` and `LinearEquiv.congrLeft`.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
123/0 |
Mathlib/LinearAlgebra/AffineSpace/AffineEquiv.lean |
1 |
1 |
['github-actions'] |
nobody |
2-32554 2 days ago |
2-41605 2 days ago |
2-41496 2 days |
| 36007 |
grunweg author:grunweg |
chore(Geometry/Manifold/Algebra): golf using custom elaborators |
---
Split out from #30357.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
110/112 |
Mathlib/Geometry/Manifold/Algebra/LieGroup.lean,Mathlib/Geometry/Manifold/Algebra/Monoid.lean,Mathlib/Geometry/Manifold/Algebra/SmoothFunctions.lean,Mathlib/Geometry/Manifold/Algebra/Structures.lean |
4 |
1 |
['github-actions'] |
nobody |
2-30332 2 days ago |
2-30407 2 days ago |
2-30298 2 days |
| 36009 |
grunweg author:grunweg |
chore(Geometry/Manifold/MFDeriv/SpecificFunctions): golf using custom… |
… elaborators
---
Split out from #30357.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
185/241 |
Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean |
1 |
1 |
['github-actions'] |
nobody |
2-30257 2 days ago |
2-30329 2 days ago |
2-30220 2 days |
| 36010 |
grunweg author:grunweg |
chore(Geometry/Manifold/MFDeriv): golf using custom elaborators |
---
Split out from #30357.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
64/70 |
Mathlib/Geometry/Manifold/MFDeriv/Atlas.lean,Mathlib/Geometry/Manifold/MFDeriv/FDeriv.lean,Mathlib/Geometry/Manifold/MFDeriv/Tangent.lean,Mathlib/Geometry/Manifold/MFDeriv/UniqueDifferential.lean |
4 |
1 |
['github-actions'] |
nobody |
2-30247 2 days ago |
2-30318 2 days ago |
2-30209 2 days |
| 36011 |
grunweg author:grunweg |
chore(Geometry/Manifold/VectorBundle/MDifferentiable): golf using cus… |
…tom elaborators
---
Split out from #30357.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
104/160 |
Mathlib/Geometry/Manifold/VectorBundle/MDifferentiable.lean |
1 |
1 |
['github-actions'] |
nobody |
2-30235 2 days ago |
2-30309 2 days ago |
2-30200 2 days |
| 35724 |
matthewjasper author:matthewjasper |
feat(RingTheory/DedekindDomain/AdicValuation): v-adic integers of `K` are a localization at v^c |
Part of showing `R` is dense in `O_v`, which is used to show that `R / v` is isomorphic to the residue field of `O_v` and
to construct the base change isomorphism for finite adeles.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
new-contributor
large-import
FLT
|
59/0 |
Mathlib/RingTheory/DedekindDomain/AdicValuation.lean |
1 |
6 |
['github-actions', 'matthewjasper', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
2-28823 2 days ago |
8-44268 8 days ago |
8-44159 8 days |
| 34705 |
mpenciak author:mpenciak |
feat(AlgebraicGeometry): Grassmannian functor |
This PR shows that the association `A → A ⊗[R] M` for an `R`-module `M`, and `R`-algebra `A` forms a functor.
(Disclosure: This PR was partially prepared by Claude)
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
109/2 |
Mathlib/LinearAlgebra/TensorProduct/Tower.lean,Mathlib/RingTheory/Grassmannian.lean |
2 |
7 |
['github-actions', 'mathlib-merge-conflicts', 'mpenciak', 'robin-carlier'] |
mariainesdff assignee:mariainesdff |
2-28032 2 days ago |
2-28056 2 days ago |
19-33633 19 days |
| 35513 |
vihdzp author:vihdzp |
refactor: redefine `Order.cof` for a preorder |
... instead of using an unbundled relation. This makes it easier to work with, and avoids some `swap rᶜ` incantations.
There are still a bunch of lemmas that make use of unbundled order relations; these will get fixed in follow-up PRs.
---
- [x] depends on: #35517
- [x] depends on: #35519
[](https://gitpod.io/from-referrer/)
|
t-set-theory
t-order
maintainer-merge
|
220/241 |
Mathlib/CategoryTheory/Presentable/IsCardinalFiltered.lean,Mathlib/Order/Cofinal.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean |
3 |
9 |
['SnirBroshi', 'YaelDillies', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
b-mehta assignee:b-mehta |
2-27924 2 days ago |
5-86187 5 days ago |
9-2704 9 days |
| 36014 |
euprunin author:euprunin |
chore: golf proofs |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `Polynomial.smeval_commute_left`: unchanged 🎉
* `lp.norm_rpow_eq_tsum`: unchanged 🎉
* `ComputablePred.rice`: unchanged 🎉
* `ZNum.cmp_to_int`: unchanged 🎉
* `ZMod.inv_coe_unit`: unchanged 🎉
* `Ideal.Filtration.submodule_fg_iff_stable`: 343 ms before, 197 ms after 🎉
* `t2Space_of_properSMul_of_t1Group`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
10/43 |
Mathlib/Algebra/Polynomial/Smeval.lean,Mathlib/Analysis/Normed/Lp/lpSpace.lean,Mathlib/Computability/Halting.lean,Mathlib/Data/Num/ZNum.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/RingTheory/Filtration.lean,Mathlib/Topology/Algebra/ProperAction/Basic.lean |
7 |
1 |
['github-actions'] |
nobody |
2-27041 2 days ago |
2-27110 2 days ago |
2-27001 2 days |
| 35329 |
BryceT233 author:BryceT233 |
feat(Data/Finsupp): add computational lemmas for cons and single |
This PR introduces `cons_eq_single_zero_iff` and `cons_eq_single_succ_iff`, which are helper lemmas designed to facilitate calculations (or simplification) of equalities involving `Finsupp.cons` and `Finsupp.single`.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
25/0 |
Mathlib/Data/Finsupp/Fin.lean |
1 |
2 |
['github-actions'] |
TwoFX assignee:TwoFX |
2-26808 2 days ago |
2-26867 2 days ago |
17-82426 17 days |
| 36015 |
mcdoll author:mcdoll |
chore(Analysis/SchwartzMap): unify style for `mkCLM` uses |
Avoid using `refine` for definitions and unify the indentation.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
86/85 |
Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean |
2 |
1 |
['github-actions'] |
nobody |
2-26331 2 days ago |
2-26798 2 days ago |
2-26689 2 days |
| 35953 |
mcdoll author:mcdoll |
feat(Analysis/SchwartzMap): estimates for `Lp` and `BCF` norms |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
50/0 |
Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean |
2 |
1 |
['github-actions'] |
nobody |
2-25952 2 days ago |
2-26010 2 days ago |
3-8628 3 days |
| 33935 |
mckoen author:mckoen |
feat(CategoryTheory/Monoidal/Arrow): define monoidal structure on arrow category |
defines a monoidal category structure on the arrow category of a cartesian closed category.
---
- [x] depends on: #33974
- [x] depends on: #34887
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
487/0 |
Mathlib.lean,Mathlib/CategoryTheory/Monoidal/Arrow.lean,Mathlib/CategoryTheory/Monoidal/Limits/Shapes/Pullback.lean |
3 |
6 |
['dagurtomas', 'github-actions', 'mathlib-dependent-issues', 'mckoen'] |
nobody |
2-25612 2 days ago |
2-25612 2 days ago |
5-18474 5 days |
| 35900 |
matthewjasper author:matthewjasper |
chore: Fix non-defeq diamonds on OrderDual |
This only makes changes to fix the diamonds, rather than the general defeq abuse with `OrderDual`.
---
- [ ] depends on: #35995
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-order
|
213/116 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Module/Defs.lean,Mathlib/Algebra/Order/Module/Synonym.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Algebra/Order/Ring/Synonym.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Normed/Group/Constructions.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Order/Lattice.lean |
13 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
2-21278 2 days ago |
2-21307 2 days ago |
4-7591 4 days |
| 35328 |
astrainfinita author:astrainfinita |
chore: use `IsLUB` `IsGLB` in `CompleteLattice` |
---
- [ ] depends on: #35297
[](https://gitpod.io/from-referrer/)
|
t-order |
322/415 |
Mathlib/Algebra/Module/Submodule/Lattice.lean,Mathlib/AlgebraicGeometry/IdealSheaf/Basic.lean,Mathlib/CategoryTheory/Sites/Sieves.lean,Mathlib/CategoryTheory/Subfunctor/Basic.lean,Mathlib/CategoryTheory/Subobject/Lattice.lean,Mathlib/Combinatorics/Digraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Basic.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean,Mathlib/Data/Fintype/Order.lean,Mathlib/Data/Set/BooleanAlgebra.lean,Mathlib/Geometry/Convex/Cone/Basic.lean,Mathlib/LinearAlgebra/AffineSpace/AffineSubspace/Defs.lean,Mathlib/MeasureTheory/Measure/MeasureSpace.lean,Mathlib/Order/Atoms.lean,Mathlib/Order/Bounds/Image.lean,Mathlib/Order/CompactlyGenerated/Basic.lean,Mathlib/Order/CompleteBooleanAlgebra.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/CompleteLattice/Lemmas.lean,Mathlib/Order/CompleteLattice/PiLex.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/Concept.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/Copy.lean,Mathlib/Order/Filter/Basic.lean,Mathlib/Order/FixedPoints.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Hom/Order.lean,Mathlib/Order/Interval/Basic.lean,Mathlib/Order/Nucleus.lean,Mathlib/Order/ScottContinuity/Prod.lean,Mathlib/Order/SupClosed.lean,Mathlib/Probability/Process/Filtration.lean,Mathlib/RingTheory/TwoSidedIdeal/Lattice.lean,Mathlib/Topology/Algebra/Group/GroupTopology.lean,Mathlib/Topology/Algebra/Module/ClosedSubmodule.lean,Mathlib/Topology/Algebra/Ring/Basic.lean,Mathlib/Topology/UniformSpace/Basic.lean |
39 |
20 |
['astrainfinita', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
Vierkantor assignee:Vierkantor |
2-20328 2 days ago |
7-47585 7 days ago |
10-12676 10 days |
| 35401 |
joelriou author:joelriou |
feat(CategoryTheory/Sites): the equivalence between `DescentData'` and `DescentData` |
Co-authored-by: Christian Merten
---
- [x] depends on: #35393
- [x] depends on: #35396
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
64/3 |
Mathlib/CategoryTheory/Sites/Descent/DescentDataPrime.lean |
1 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
adamtopaz assignee:adamtopaz |
2-20326 2 days ago |
5-41967 5 days ago |
5-41859 5 days |
| 35693 |
euprunin author:euprunin |
chore: avoid passing explicit lemmas to `grind` and (terminal) `simp_all` where unnecessary |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `SimpleGraph.Walk.IsCycle.getVert_injOn`: 684 ms before, 596 ms after 🎉
* `List.HasPeriod.gcd`: 846 ms before, 807 ms after 🎉
* `List.Sublist.orderedInsert_sublist`: unchanged 🎉
* `Affine.Simplex.exists_forall_dist_eq_iff_exists_excenterExists_and_eq_excenter`: unchanged 🎉
* `Matrix.pow_apply_pos_iff_nonempty_path`: unchanged 🎉
* `RootPairing.Hom.coweightHom_injective`: unchanged 🎉
* `RootPairing.isReduced_iff'`: unchanged 🎉
* `Set.Ico_eq_Ico_iff`: unchanged 🎉
* `Set.Ioc_eq_Ioc_iff`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
9/9 |
Mathlib/Combinatorics/SimpleGraph/Paths.lean,Mathlib/Data/List/PeriodicityLemma.lean,Mathlib/Data/List/Sort.lean,Mathlib/Geometry/Euclidean/Incenter.lean,Mathlib/LinearAlgebra/Matrix/Irreducible/Defs.lean,Mathlib/LinearAlgebra/RootSystem/Hom.lean,Mathlib/LinearAlgebra/RootSystem/Reduced.lean,Mathlib/Order/Interval/Set/LinearOrder.lean |
8 |
1 |
['github-actions'] |
dupuisf assignee:dupuisf |
2-20322 2 days ago |
9-36097 9 days ago |
9-35988 9 days |
| 35702 |
plp127 author:plp127 |
feat: uniqueness of partial fraction decomposition |
We prove a uniqueness theorem for each existence theorem in the file.
---
- [x] depends on: #35000
- [x] depends on: #35703
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
254/18 |
Mathlib/Algebra/Polynomial/PartialFractions.lean |
1 |
3 |
['github-actions', 'mathlib-bors', 'mathlib-dependent-issues'] |
dagurtomas assignee:dagurtomas |
2-20321 2 days ago |
5-55512 5 days ago |
5-58383 5 days |
| 35731 |
euprunin author:euprunin |
chore: golf using `exact`/`simpa` |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `AlgebraicGeometry.Scheme.Cover.exists_of_trans_eq_trans`: unchanged 🎉
* `AlgebraicGeometry.compactSpace_iff_exists`: unchanged 🎉
* `SimplexCategory.eq_id_of_mono`: unchanged 🎉
* `SimplexCategory.eq_id_of_epi`: unchanged 🎉
* `CategoryTheory.GrothendieckTopology.isIso_toPlus_of_isSheaf`: unchanged 🎉
* `CategoryTheory.Functor.isTriangulated_of_op`: unchanged 🎉
* `SimpleGraph.chromaticNumber_top`: unchanged 🎉
* `SimpleGraph.Subgraph.singletonSubgraph_connected`: unchanged 🎉
* `SimpleGraph.Walk.exists_length_eq_one_iff`: unchanged 🎉
* `Turing.TM2to1.addBottom_modifyNth`: unchanged 🎉
* `IsNoetherian.iff_fg`: unchanged 🎉
* `contMDiff_inclusion`: unchanged 🎉
* `FermatLastTheoremForThree_of_FermatLastTheoremThreeGen`: 146 ms before, 91 ms after 🎉
* `FermatLastTheoremForThreeGen.lambda_sq_dvd_c`: 313 ms before, 218 ms after 🎉
* `WithTop.isGLB_sInf`: unchanged 🎉
* `WithBot.succ_eq_bot`: 56 ms before, <30 ms after 🎉
* `WithTop.pred_eq_top`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
22/88 |
Mathlib/AlgebraicGeometry/Cover/Directed.lean,Mathlib/AlgebraicGeometry/Morphisms/QuasiCompact.lean,Mathlib/AlgebraicTopology/SimplexCategory/Basic.lean,Mathlib/CategoryTheory/Sites/Plus.lean,Mathlib/CategoryTheory/Triangulated/Opposite/Functor.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Subgraph.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Basic.lean,Mathlib/FieldTheory/Finiteness.lean,Mathlib/Geometry/Manifold/ContMDiff/Basic.lean,Mathlib/NumberTheory/FLT/Three.lean,Mathlib/Order/ConditionallyCompleteLattice/Basic.lean,Mathlib/Order/SuccPred/WithBot.lean |
13 |
22 |
['euprunin', 'github-actions', 'leanprover-radar', 'vihdzp'] |
robin-carlier assignee:robin-carlier |
2-20320 2 days ago |
8-40881 8 days ago |
8-40772 8 days |
| 35732 |
TJHeeringa author:TJHeeringa |
feat: Added reproducing kernels |
Develops the basic theory of reproducing kernels, which underlies the reproducing kernel
Hilbert spaces. It shows that the kernels form an ordered semiring and common ways of constructing
kernels from other kernels.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-analysis
|
1193/0 |
Mathlib.lean,Mathlib/KernelTheory/Kernel.lean |
2 |
5 |
['TJHeeringa', 'github-actions', 'joneugster', 'vihdzp'] |
j-loreaux assignee:j-loreaux |
2-20320 2 days ago |
7-76797 7 days ago |
7-78713 7 days |
| 35760 |
astrainfinita author:astrainfinita |
chore: deprecate `ConditionallyCompleteLinearOrderedField` |
Use the new mixin typeclass instead. Also, move the API for conditionally complete linear ordered fields into the `ConditionallyCompleteLinearOrderedField` namespace, and make instances scoped to this namespace. We should usually use `ℝ` instead.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-order
label:t-algebra$ |
82/30 |
Mathlib/Algebra/Order/CompleteField.lean,Mathlib/Data/Real/CompleteField.lean |
2 |
3 |
['astrainfinita', 'github-actions', 'leanprover-radar'] |
Vierkantor assignee:Vierkantor |
2-20317 2 days ago |
7-68093 7 days ago |
7-68180 7 days |
| 26394 |
winstonyin author:winstonyin |
feat: existence of local flows on manifolds |
This PR continues the work from #21777.
Original PR: https://github.com/leanprover-community/mathlib4/pull/21777
Transfer the existence theorem of local flows on vector spaces to manifolds. The precise statement is:
> If a vector field `v` on a manifold `M` is continuously differentiable at an interior point `x₀`, then for a given `t₀` there exists a neighbourhood `u` of `x₀`, a positive `ε`, and `γ : M → ℝ → M` such that `γ x` is an integral curve of `v` on `(t₀ - ε, t₀ + ε)` for all `x ∈ u`.
This is powerful because all curves `γ x` (each with initial condition `x ∈ u`) share the same existence time interval `(t₀ - ε, t₀ + ε)`, rather than each curve having its own `ε`. This will allow us to show that $C^1$ vector fields on compact manifolds always have global integral curves / global flows.
Any suggestions to shorten the proof or split out useful lemmas are welcome!
- [x] depends on: #26392
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
135/52 |
Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Geometry/Manifold/IntegralCurve/ExistUnique.lean,Mathlib/Order/Filter/Prod.lean |
3 |
5 |
['github-actions', 'leanprover-community-bot-assistant', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'winstonyin'] |
nobody |
2-20316 2 days ago |
2-20316 2 days ago |
2-20277 2 days |
| 35775 |
IvanRenison author:IvanRenison |
feat(Data/List): add theorem `length_eq_two'` |
---
[](https://gitpod.io/from-referrer/)
|
t-data |
3/0 |
Mathlib/Data/List/Basic.lean |
1 |
2 |
['IvanRenison', 'github-actions', 'vihdzp'] |
Vierkantor assignee:Vierkantor |
2-20316 2 days ago |
7-45222 7 days ago |
7-45113 7 days |
| 35786 |
DavidLedvinka author:DavidLedvinka |
feat(Order): Add simp lemma for `IsRelUpperSet` and `IsRelLowerSet` |
This is useful in scenarios when `simp` can simplify the relation to true. |
t-order |
8/0 |
Mathlib/Order/UpperLower/Relative.lean |
1 |
3 |
['DavidLedvinka', 'eric-wieser', 'github-actions'] |
bryangingechen assignee:bryangingechen |
2-20315 2 days ago |
7-25504 7 days ago |
7-25395 7 days |
| 35820 |
smmercuri author:smmercuri |
feat: unit lemmas and embedding for `FiniteAdeleRing` |
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
33/0 |
Mathlib/RingTheory/DedekindDomain/FiniteAdeleRing.lean |
1 |
1 |
['github-actions'] |
alreadydone assignee:alreadydone |
2-20311 2 days ago |
6-49924 6 days ago |
6-50045 6 days |
| 35828 |
AntoineChambert-Loir author:AntoineChambert-Loir |
feat(RingTheory/GradedAlgebra/Homogeneous/Hom): homogeneous algebra maps and evaluation |
Define the notion of homogeneous algebra morphism between algebra maps.
Prove that the evaluation of a (weighted) homogeneous multivariate polynomial at adequate elements
of a graded algebra define a homogeneous algebra morphism.
co-authored with @mariainesdff
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
74/0 |
Mathlib.lean,Mathlib/Algebra/GradedMonoid.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Hom.lean |
3 |
2 |
['github-actions', 'joneugster'] |
mattrobball assignee:mattrobball |
2-20310 2 days ago |
6-24882 6 days ago |
6-25397 6 days |
| 35842 |
WenrongZou author:WenrongZou |
feat(MvPowerSeries): subst_C and omit some finiteness of index set |
---
I add some elementary lemma related to substitution of multi variate power series and omit some finiteness of index set (for example in `map_subst` and `HasSubst.X_pow`).
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
78/18 |
Mathlib/Data/Finsupp/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Expand.lean,Mathlib/RingTheory/MvPowerSeries/Substitution.lean,Mathlib/RingTheory/PowerSeries/Expand.lean,Mathlib/RingTheory/PowerSeries/Substitution.lean |
5 |
2 |
['WenrongZou', 'github-actions'] |
chrisflav assignee:chrisflav |
2-20309 2 days ago |
6-1408 6 days ago |
6-4027 6 days |
| 35866 |
gad-wiseman author:gad-wiseman |
feat(Topology/Homotopy/Basic): maps homotopic rel S agree on S |
---
This adds an easy lemma showing maps that are `HomotopicRel` a set agree on it. |
t-topology
new-contributor
|
5/0 |
Mathlib/Topology/Homotopy/Basic.lean |
1 |
2 |
['github-actions'] |
dagurtomas assignee:dagurtomas |
2-20306 2 days ago |
5-62647 5 days ago |
5-62538 5 days |
| 34863 |
JovanGerb author:JovanGerb |
feat(to_dual): support recursively reordering arguments |
This PR implements the feature of recursively reordering arguments of arguments in `to_dual`. All of the material on reorderings has been put in the new file `Mathlib.Tactic.Translate.Reorder`.
Ideally, when tagging a structure with `to_dual`, it will try to automatically add the correct `reorder` arguments. But this is only a small quality of life improvement, so I will leave that for a potential future PR. Currently, you have to manually re-tag the projections and constructor if you want them to get a `reorder`.
This PR also improves the trace messages of `trace.translate_detail`.
This PR also adds new error messages for when the given `(reorder := ...)` is malformed.
---
[](https://gitpod.io/from-referrer/)
|
t-meta |
573/379 |
Mathlib.lean,Mathlib/CategoryTheory/Iso.lean,Mathlib/Order/Basic.lean,Mathlib/Order/BoundedOrder/Basic.lean,Mathlib/Order/Defs/PartialOrder.lean,Mathlib/Order/Directed.lean,Mathlib/Order/Hom/Basic.lean,Mathlib/Order/Lattice.lean,Mathlib/Tactic.lean,Mathlib/Tactic/ToDual.lean,Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/Reorder.lean,Mathlib/Tactic/Translate/ToDual.lean,MathlibTest/ToDual.lean,MathlibTest/toAdditive.lean |
15 |
7 |
['JovanGerb', 'bryangingechen', 'github-actions', 'mathlib-merge-conflicts'] |
bryangingechen assignee:bryangingechen |
2-18150 2 days ago |
2-18176 2 days ago |
17-57424 17 days |
| 35939 |
joelriou author:joelriou |
feat(Algebra/Homology): a homology exact sequence for triangles of cochain complexes |
... which become distinguished in the derived category.
---
- [x] depends on: #35938
- [x] depends on: #35937
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
118/0 |
Mathlib/Algebra/Homology/DerivedCategory/Basic.lean,Mathlib/Algebra/Homology/DerivedCategory/HomologySequence.lean |
2 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
2-17859 2 days ago |
2-22400 2 days ago |
2-22699 2 days |
| 35286 |
urkud author:urkud |
chore: reduce defeq abuse |
Cherry-picked from #35182, improved
---
[](https://gitpod.io/from-referrer/)
|
|
56/33 |
Mathlib/Algebra/Module/SnakeLemma.lean,Mathlib/Algebra/MonoidAlgebra/Grading.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Kaehler/Basic.lean,Mathlib/RingTheory/KrullDimension/Polynomial.lean |
5 |
10 |
['github-actions', 'kbuzzard', 'kim-em', 'urkud'] |
dwrensha assignee:dwrensha |
2-14724 2 days ago |
2-14777 2 days ago |
13-59223 13 days |
| 35467 |
ZRTMRH author:ZRTMRH |
feat(Combinatorics): add Schreier graphs, Cayley graphs, and Cayley sum graphs |
## Summary
- Defines Schreier graphs and Cayley graphs as quivers with labeled edges, porting the approach from Lean 3 PR leanprover-community/mathlib3#18693 by @bottine, @YaelDillies, and @antoinelab01.
- Proves the labelling prefunctor is a covering for group actions, establishes reachability characterization, connectivity, and vertex-transitivity (right multiplication is a covering isomorphism).
- Provides concrete examples: cyclic groups ℤ/nℤ, symmetric groups S_n, and integers ℤ.
- Defines Cayley sum graphs as `SimpleGraph` where `Adj u v ↔ u ≠ v ∧ u + v ∈ s`, with translation properties and connection to circulant graphs.
## References
- Lean 3 PR: leanprover-community/mathlib3#18693 (Rémi Bottinelli, Yaël Dillies, Antoine Labelle)
- Lean 3 branch: https://github.com/leanprover-community/mathlib3/tree/geometric-group-theory
## New files
| File | Lines | Content |
|------|-------|---------|
| `Mathlib/Combinatorics/Quiver/Schreier.lean` | 770 | Core theory |
| `Mathlib/Combinatorics/Quiver/SchreierExamples.lean` | 183 | Examples |
| `Mathlib/Combinatorics/SimpleGraph/CayleySumGraph.lean` | 159 | Cayley sum graphs |
## Test plan
- [x] All three files build clean on latest master
- [x] No `sorry`
- [x] All public declarations have docstrings
- [x] `lake exe mk_all --check` passes
- [x] `lake exe runLinter` passes
## AI disclosure
This PR was developed with assistance from [Claude Code](https://claude.com/claude-code) (Anthropic's CLI tool). Claude Code was used for: writing proof scaffolding, debugging type errors, style cleanup (naming conventions, `fun ↦` syntax), rebasing onto upstream master, and PR preparation. All mathematical content, design decisions, and proof strategies were directed by the author. The code has been reviewed by the author and their advisor. |
t-combinatorics
new-contributor
|
1101/0 |
Mathlib.lean,Mathlib/Combinatorics/Quiver/CayleyExamples.lean,Mathlib/Combinatorics/Quiver/Schreier.lean,Mathlib/Combinatorics/SimpleGraph/CayleySumGraph.lean |
4 |
34 |
['SnirBroshi', 'ZRTMRH', 'github-actions', 'tb65536'] |
nobody |
2-6300 2 days ago |
8-38648 8 days ago |
15-19938 15 days |
| 35733 |
mkaratarakis author:mkaratarakis |
feat: Algebraic setup and matrix coefficients for Gelfond-Schneider theorem |
This PR introduces the foundational algebraic setup and coefficient bounds required for the proof of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem), which establishes that for algebraic numbers $\alpha \neq 0, 1$ and irrational algebraic $\beta$, the number $\alpha^\beta$ is transcendental.
Following the contradiction argument presented in Loo-Keng Hua's "Introduction to Number Theory" (Chapter 17.9, 490 -493) Gelfond's Proof), this file constructs the common number field $K$ and sets up the scaled algebraic integers for the auxiliary linear system. This system will later be solved via Siegel's lemma (Lemma 8.2, 490, Hua).
This PR is essentially the first half of page 490 in the book.
The proof proceeds by assuming $\gamma = \alpha^\beta$ is algebraic, meaning $\alpha$, $\beta$, and $\gamma$ all lie in an algebraic field $K$ of degree $h$.
1. Bundles the common number field $K$, the complex embeddings, and the algebraic preimages $\alpha', \beta', \gamma'$, alongside the core hypotheses of the theorem.
2. Defines the field degree $h = [K : \mathbb{Q}]$, and bounds $m = 2h + 2$ and $n = q^2 / (2m)$ to control the dimensions of the linear system.
3. Defines $c_1$, a natural number chosen so that $c_1 \alpha$, $c_1 \beta$, and $c_1 \gamma$ are algebraic integers in $K$. We prove numerous bounding and integrality lemmas (`isIntegral_c₁α`, `isInt_β_bound`, etc.).
4. Formalizes the core algebraic coefficients $(a+b\beta)^k \alpha^{al} \gamma^{bl}$ which appear in the evaluation of the derivatives of the auxiliary function $R(x)$.
5. By scaling the system by $c_1^{n-1+2mq}$, we successfully restrict the entries of our linear system matrix `A` entirely to the ring of integers $\mathcal{O}_K$, preparing it for the application of Siegel's lemma.
6. House Bounds (`c₂`) : Establishes the foundational base integer $c_2$ to bound the absolute values of the conjugates (houses) of our coefficients.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
|
416/0 |
Mathlib.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean |
2 |
2 |
['github-actions'] |
nobody |
2-6095 2 days ago |
8-37327 8 days ago |
8-37566 8 days |
| 35781 |
mcdoll author:mcdoll |
feat(Analysis/SchwartzMap): translation of arguments |
We only define the translation with subtraction, because this is more common in applications.
Co-authored-by: Michael Douglas
---
From https://github.com/mrdouglasny/OSforGFF and made mathlib ready by me
[](https://gitpod.io/from-referrer/)
|
t-analysis |
44/11 |
Mathlib/Analysis/Distribution/SchwartzSpace/Basic.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Deriv.lean |
2 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
urkud assignee:urkud |
2-4479 2 days ago |
2-4500 2 days ago |
6-84734 6 days |
| 34288 |
winstonyin author:winstonyin |
feat: Integral curve is smooth in initial condition |
I prove the local smoothness theorem for integral curves of ODEs on Banach spaces with respect to the initial condition. Serge Lang's _Fundamentals of Differential Geometry_ gives two proofs (Theorem 1.11). The first one is based on Grönwall's inequality. The second one (p. 81 onwards) is based on the implicit function theorem, found by Pugh and Robbin 1968. I've chosen to formalise the second, even though it may be more involved. I wanted to do this as a challenge, and because the second proof also applies to $H^k$ vector fields (Ebin and Marsden 1970), which are not yet in Mathlib.
I am open to splitting this up into several smaller PRs.
## Statement
Let $f : E \to E$ be a vector field that is $C^n$ at $x_0 : E$ with $n \geq 1$. There exists a neighbourhood $U$ of $x_0$ and time interval $[t_{\mathrm{min}},t_{\mathrm{max}}]$ containing $t_0$ such that for every $x \in U$, there exists an integral curve $\alpha_x : C([t_{\mathrm{min}},t_{\mathrm{max}}], E)$ of $f$ with initial condition $\alpha_x(t_0) = x$, and that $x \mapsto \alpha_x$ is $C^n$.
Note that this is not the full smoothness theorem for local flows, which states that the local flow $\alpha : [t_{\mathrm{min}},t_{\mathrm{max}}] \times U \to E$ is $C^n$ at $(t_0, x_0)$. We will prove this in a series of future PRs.
## Proof strategy
* Define implicit equation $T_f : E \times C([t_{\mathrm{min}},t_{\mathrm{max}}],E) \to C([t_{\mathrm{min}},t_{\mathrm{max}}],E)$ so that $T(x,\alpha) = 0$ implies that $\alpha$ is an integral curve of $f$ with initial condition $x$.
* Prove implicit equation is $C^n$ if $f$ is $C^n$.
* Prove $\partial_\alpha T_f$ is invertible for some choice of $[t_{\mathrm{min}},t_{\mathrm{max}}]$.
* Extract the local flow $(x : E) \mapsto (\alpha_x : C([t_{\mathrm{min}},t_{\mathrm{max}}],E))$ as the implicit function of $T_f$ around a known integral curve.
* Conclude that $x \mapsto \alpha_x$ is $C^n$.
## For reviewers
* Where should `Set.Icc.abs_sub_le` go?
* Some proofs (marked with TODO) can be shortened after #34120, but I don't want it to be blocking.
- [x] depends on: #34860
- [x] depends on: #34861
- [x] depends on: #34862
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
869/0 |
Mathlib.lean,Mathlib/Analysis/Calculus/ImplicitContDiff.lean,Mathlib/Analysis/ODE/SmoothFlow.lean,Mathlib/Topology/MetricSpace/Pseudo/Lemmas.lean |
4 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
j-loreaux assignee:j-loreaux |
2-1003 2 days ago |
2-1069 2 days ago |
9-16885 9 days |
| 26377 |
Whysoserioushah author:Whysoserioushah |
feat(RingTheory/SimpleRing/TensorProduct): tensor product of a simple algebra and a central simple algebra is simple |
co-authored-by: @jjaassoonn
---
|
t-ring-theory
large-import
|
326/8 |
Mathlib.lean,Mathlib/RingTheory/SimpleRing/TensorProduct.lean,Mathlib/RingTheory/TwoSidedIdeal/Kernel.lean,Mathlib/RingTheory/TwoSidedIdeal/Lattice.lean,Mathlib/RingTheory/TwoSidedIdeal/Operations.lean |
5 |
69 |
['Ruben-VandeVelde', 'Whysoserioushah', 'eric-wieser', 'github-actions', 'kbuzzard', 'kckennylau', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'vlad902'] |
kbuzzard assignee:kbuzzard |
1-84382 1 day ago |
15-25255 15 days ago |
29-27940 29 days |
| 34402 |
loefflerd author:loefflerd |
feat(Analysis/Complex/UpperHalfPlane): invariant measure |
Add the invariant measure on the upper half-plane (& prove that it is indeed invariant).
Also includes various minor improvements to upper half-plane & related code:
* improve documentation of `GeneralLinearGroup/FinTwo.lean`
* remove no-longer-needed coercion notation
---
- [x] depends on: #34597
[](https://gitpod.io/from-referrer/)
|
large-import
t-analysis
|
320/57 |
Mathlib.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Manifold.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Measure.lean,Mathlib/Analysis/Complex/UpperHalfPlane/MoebiusAction.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean,Mathlib/LinearAlgebra/Matrix/GeneralLinearGroup/FinTwo.lean,Mathlib/NumberTheory/ModularForms/Basic.lean,Mathlib/Topology/Algebra/Algebra/Equiv.lean |
9 |
11 |
['github-actions', 'j-loreaux', 'loefflerd', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'urkud'] |
ADedecker assignee:ADedecker |
1-83866 1 day ago |
1-83929 1 day ago |
27-15572 27 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
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
392/33 |
Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/LinearAlgebra/FiniteDimensional/Lemmas.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean |
6 |
3 |
['github-actions', 'joneugster'] |
nobody |
1-82289 1 day ago |
6-9290 6 days ago |
6-12147 6 days |
| 35997 |
themathqueen author:themathqueen |
feat(Analysis/CStarAlgebra/CFC/Order): conjugating with a star projection in a C*-algebra |
When `e` is a star projection and `0 ≤ a ≤ e`, we get `e * a * e = a`.
Co-authored-by: Jon Bannon [59937998+JonBannon@users.noreply.github.com](mailto:59937998+JonBannon@users.noreply.github.com)
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
19/0 |
Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean |
1 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
1-80681 1 day ago |
1-80703 1 day ago |
2-30444 2 days |
| 35961 |
joelriou author:joelriou |
feat(CategoryTheory/Sites): fiber functors invert morphisms which become isomorphisms after sheafification |
The assumptions on the target category are relaxed.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
61/46 |
Mathlib/CategoryTheory/Sites/Point/Basic.lean,Mathlib/CategoryTheory/Sites/Point/Conservative.lean,Mathlib/CategoryTheory/Sites/Point/Skyscraper.lean |
3 |
2 |
['github-actions', 'joelriou'] |
nobody |
1-79134 1 day ago |
2-70347 2 days ago |
2-70238 2 days |
| 36012 |
grunweg author:grunweg |
chore(Geometry/Manifold/VectorField/Pullback): golf using custom elab… |
…orators
---
Split out from #30357.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
96/143 |
Mathlib/Geometry/Manifold/VectorField/Pullback.lean |
1 |
1 |
['github-actions'] |
nobody |
1-75888 1 day ago |
1-75949 1 day ago |
1-76369 1 day |
| 36008 |
grunweg author:grunweg |
chore(Geometry/Manifold/ContMDiffMFDeriv): golf using custom elaborators |
---
Split out from #30357.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
59/79 |
Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean |
1 |
1 |
['github-actions'] |
nobody |
1-75836 1 day ago |
1-75900 1 day ago |
1-75898 1 day |
| 35986 |
grunweg author:grunweg |
feat: tag ContDiff.{continuous,differentiable} as fun_prop |
The second one requires proving a side condition n \neq 0, which should be fine when passing a discharger.
----------
Open question: will this break existing proofs by making fun_prop try paths with a longer transition depth? It seems to be fine!
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
2/0 |
Mathlib/Analysis/Calculus/ContDiff/Defs.lean |
1 |
4 |
['github-actions', 'grunweg', 'leanprover-radar', 'mathlib-merge-conflicts'] |
nobody |
1-75069 1 day ago |
1-75093 1 day ago |
2-51261 2 days |
| 33372 |
kex-y author:kex-y |
feat(Probability): Countable infimum of stopping times is a stopping time |
---
- [x] depends on: #33371
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
brownian
|
84/0 |
Mathlib/Probability/Process/Stopping.lean |
1 |
5 |
['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
RemyDegenne assignee:RemyDegenne |
1-74714 1 day ago |
1-74737 1 day ago |
59-29339 59 days |
| 26160 |
oliver-butterley author:oliver-butterley |
feat(MeasureTheory.VectorMeasure): add several lemmas which characterize variation |
Add the following lemmas concerning variation of a VectorMeasure:
* `norm_measure_le_variation`: `‖μ E‖ₑ ≤ variation μ E`.
* `variation_neg`: `(-μ).variation = μ.variation`.
* `variation_zero`: `(0 : VectorMeasure X V).variation = 0`.
* `absolutelyContinuous`
Co-authored-by: @yoh-tanimoto
- [x] depends on: #26156
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
248/15 |
Mathlib.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/Order/Partition/Finpartition.lean |
8 |
18 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'sgouezel', 'yoh-tanimoto'] |
nobody |
1-74324 1 day ago |
1-74387 1 day ago |
35-19109 35 days |
| 34622 |
vihdzp author:vihdzp |
feat: Nat/Int casts on char two rings |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
50/8 |
Mathlib/Algebra/CharP/Two.lean,Mathlib/Data/Set/Insert.lean |
2 |
10 |
['erdOne', 'eric-wieser', 'github-actions', 'vihdzp'] |
erdOne assignee:erdOne |
1-74156 1 day ago |
1-74216 1 day ago |
33-10045 33 days |
| 35979 |
xgenereux author:xgenereux |
chore(RatFunc/AsPolynomial): use Valuation.IsTrivialOn and simplify proofs |
Use the recently added typeclass `Valuation.IsTrivialOn` instead of the explicit hypothesis.
I have taken the opportunity to simplify some proofs with grind.
Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)>
---
[](https://gitpod.io/from-referrer/)
|
|
23/26 |
Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Basic.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/FieldTheory/RatFunc/Basic.lean,Mathlib/RingTheory/Valuation/Basic.lean |
5 |
7 |
['github-actions', 'vihdzp', 'xgenereux'] |
nobody |
1-73953 1 day ago |
2-58701 2 days ago |
2-60407 2 days |
| 35933 |
urkud author:urkud |
chore(WellFounded): drop unneeded `Set.Nonempty` assumptions |
... in theorems that also assume
that a specific element belongs to the set.
---
[](https://gitpod.io/from-referrer/)
|
|
60/56 |
Archive/Imo/Imo1988Q6.lean,Counterexamples/AharoniKorman.lean,Mathlib/Combinatorics/Quiver/Arborescence.lean,Mathlib/Data/DFinsupp/WellFounded.lean,Mathlib/FieldTheory/Minpoly/Basic.lean,Mathlib/FieldTheory/SeparableClosure.lean,Mathlib/FieldTheory/SeparablyGenerated.lean,Mathlib/Order/Atoms.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/Cover.lean,Mathlib/Order/InitialSeg.lean,Mathlib/Order/OrderIsoNat.lean,Mathlib/Order/PiLex.lean,Mathlib/Order/SuccPred/Basic.lean,Mathlib/Order/WellFounded.lean,Mathlib/Order/WellFoundedSet.lean,Mathlib/RingTheory/MvPowerSeries/LexOrder.lean,Mathlib/RingTheory/Polynomial/Basic.lean,Mathlib/RingTheory/PrincipalIdealDomain.lean,Mathlib/SetTheory/Cardinal/Cofinality.lean,Mathlib/SetTheory/ZFC/Class.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean |
22 |
4 |
['github-actions', 'urkud', 'vihdzp'] |
nobody |
1-72846 1 day ago |
3-26825 3 days ago |
3-30126 3 days |
| 36001 |
harahu author:harahu |
fix(docs): deduplicate yaml key |
---
[](https://gitpod.io/from-referrer/)
|
easy |
3/2 |
docs/1000.yaml |
1 |
2 |
['github-actions', 'harahu'] |
nobody |
1-72650 1 day ago |
2-33093 2 days ago |
2-32984 2 days |
| 33082 |
AntoineChambert-Loir author:AntoineChambert-Loir |
feat(GroupTheory/SpecificGroups/Alternating/Simple): the alternating group on at least 5 letters is simple. |
This is the conclusion of the story of the proof of simplicity of the alternating group using the
Iwasawa criterion.
* `Equiv.Perm.iwasawaStructure_two`:
the natural `IwasawaStructure` of `Equiv.Perm α` acting on `Nat.Combination α 2`
Its commutative subgroups consist of the permutations with support
in a given element of `Nat.Combination α 2`.
They are cyclic of order 2.
* `alternatingGroup_of_le_of_normal`:
If `α` has at least 5 elements, then a nontrivial normal subgroup
of `Equiv.Perm α` contains the alternating group.
* `alternatingGroup.iwasawaStructure_three`:
the natural `IwasawaStructure` of `alternatingGroup α` acting on `Nat.Combination α 3`
Its commutative subgroups consist of the permutations with support
in a given element of `Nat.Combination α 2`.
They are cyclic of order 3.
* `alternatingGroup.iwasawaStructure_three`:
the natural `IwasawaStructure` of `alternatingGroup α` acting on `Nat.Combination α 4`
Its commutative subgroups consist of the permutations of
cycleType (2, 2) with support in a given element of `Nat.Combination α 2`.
They have order 4 and exponent 2 (`IsKleinFour`).
* `alternatingGroup.normal_subgroup_eq_bot_or_eq_top`:
If `α` has at least 5 elements, then a nontrivial normal subgroup of `alternatingGroup` is `⊤`.
* `alternatingGroup.isSimpleGroup`:
If `α` has at least 5 elements, then `alternatingGroup α`
is a simple group.
---
- [x] depends on: #34307
- [x] depends on: #34308
[](https://gitpod.io/from-referrer/)
|
t-group-theory |
467/5 |
Mathlib.lean,Mathlib/GroupTheory/Perm/ConjAct.lean,Mathlib/GroupTheory/Perm/Finite.lean,Mathlib/GroupTheory/Perm/Support.lean,Mathlib/GroupTheory/SpecificGroups/Alternating.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/MaximalSubgroups.lean,Mathlib/GroupTheory/SpecificGroups/Alternating/Simple.lean,Mathlib/GroupTheory/SpecificGroups/KleinFour.lean |
8 |
56 |
['AntoineChambert-Loir', 'Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'tb65536'] |
mattrobball assignee:mattrobball |
1-71153 1 day ago |
1-71169 1 day ago |
60-61931 60 days |
| 36040 |
grunweg author:grunweg |
feat: better error message in T% elaborator |
When applying the `T%` elaborator to sections of a fibre bundle, previously in the case of missing typeclass assumptions the elaborator would silently do nothing. Now it errors about this case.
Thanks to Patrick Massot for reporting this bug in person.
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry
t-meta
|
46/4 |
Mathlib/Geometry/Manifold/Notation.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean |
2 |
2 |
['github-actions'] |
nobody |
1-71139 1 day ago |
1-71350 1 day ago |
1-71775 1 day |
| 36024 |
euprunin author:euprunin |
chore: golf proofs |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `Fin.coe_sub_one`: unchanged 🎉
* `LieAlgebra.engel_isBot_of_isMin.lieCharpoly_coeff_natDegree`: 66 ms before, 35 ms after 🎉
* `WithTop.mul_lt_mul`: unchanged 🎉
* `CFC.spectrum_nonempty`: unchanged 🎉
* `ODE.hasDerivWithinAt_picard_Icc`: unchanged 🎉
* `Matrix.vecMul_injective_iff_isUnit`: 240 ms before, 68 ms after 🎉
* `MeasureTheory.SimpleFunc.measure_preimage_lt_top_of_memLp`: unchanged 🎉
* `Polynomial.content_eq_gcd_range_of_lt`: unchanged 🎉
* `RingHom.finiteType_isStableUnderBaseChange`: 163 ms before, 49 ms after 🎉
* `RingHom.Flat.holdsForLocalizationAway`: 91 ms before, <30 ms after 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
15/46 |
Mathlib/Algebra/Group/Fin/Basic.lean,Mathlib/Algebra/Lie/CartanExists.lean,Mathlib/Algebra/Order/Ring/WithTop.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Instances.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Order.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Unital.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean,Mathlib/MeasureTheory/Function/SimpleFuncDenseLp.lean,Mathlib/RingTheory/Polynomial/Content.lean,Mathlib/RingTheory/RingHom/FiniteType.lean,Mathlib/RingTheory/RingHom/Flat.lean |
12 |
7 |
['euprunin', 'github-actions', 'vihdzp'] |
nobody |
1-69699 1 day ago |
1-69761 1 day ago |
1-75503 1 day |
| 35368 |
joelriou author:joelriou |
feat(CategoryTheory/Triangulated/TStructure): extensions of truncations to the extended integers |
Given a `t`-structure, we extend the definition of the truncation functors `truncLT` and `truncGE` for indices in `ℤ` to `EInt`, as `t.eTruncLT : EInt ⥤ C ⥤ C` and `t.eTruncGE : EInt ⥤ C ⥤ C`.
---
- [x] depends on: #35364
- [x] depends on: #35363
- [x] depends on: #35362
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
301/0 |
Mathlib.lean,Mathlib/CategoryTheory/Triangulated/TStructure/ETrunc.lean |
2 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
1-68683 1 day ago |
1-69958 1 day ago |
1-69850 1 day |
| 35643 |
chrisflav author:chrisflav |
chore(Algebra): make `TensorProduct.equivOfCompatibleSMul` more linear |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
64/47 |
Mathlib/LinearAlgebra/TensorProduct/Associator.lean,Mathlib/LinearAlgebra/TensorProduct/Basic.lean,Mathlib/RingTheory/Coalgebra/TensorProduct.lean,Mathlib/RingTheory/LinearDisjoint.lean,Mathlib/RingTheory/Localization/BaseChange.lean,Mathlib/RingTheory/Smooth/Fiber.lean,Mathlib/RingTheory/TensorProduct/Maps.lean,Mathlib/RingTheory/TensorProduct/Nontrivial.lean |
8 |
7 |
['github-actions', 'kckennylau'] |
kim-em assignee:kim-em |
1-67627 1 day ago |
1-67738 1 day ago |
10-66015 10 days |
| 36051 |
euprunin author:euprunin |
chore: golf using `grind` |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `Cycle.chain_of_pairwise`: unchanged 🎉
* `List.argmax_cons`: 387 ms before, 94 ms after 🎉
* `ciSup_subtype`: 118 ms before, 77 ms after 🎉
* `exists_seq_forall_proj_of_forall_finite`: unchanged 🎉
* `Polynomial.roots_quadratic_eq_pair_iff_of_ne_zero'`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
7/30 |
Mathlib/Data/List/Cycle.lean,Mathlib/Data/List/MinMax.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean,Mathlib/Order/KonigLemma.lean,Mathlib/RingTheory/Polynomial/SmallDegreeVieta.lean |
5 |
1 |
['github-actions'] |
nobody |
1-67268 1 day ago |
1-67333 1 day ago |
1-67224 1 day |
| 27229 |
WilliamCoram author:WilliamCoram |
feat(GroupTheory/DoubleCoset): multiple lemmas |
From FLT
---
[](https://gitpod.io/from-referrer/)
|
FLT
t-group-theory
new-contributor
|
85/2 |
Mathlib/GroupTheory/DoubleCoset.lean |
1 |
41 |
['CBirkbeck', 'Ruben-VandeVelde', 'WilliamCoram', 'github-actions', 'kim-em', 'mariainesdff', 'mathlib4-merge-conflict-bot', 'tb65536'] |
mariainesdff assignee:mariainesdff |
1-65418 1 day ago |
15-75823 15 days ago |
105-20507 105 days |
| 36062 |
huaizhangchu author:huaizhangchu |
feat(Probability/PMF): add PMF.integrable_of_summable_norm |
Adds `PMF.integrable_of_summable_norm`: a function `f` is integrable with respect to `p.toMeasure` when the weighted norms `‖f a‖ * (p a).toReal` form a summable family.
This is useful for computing expectations of discrete distributions (Poisson, geometric, etc.) without manually expanding the `HasFiniteIntegral` definition each time. |
t-measure-probability
new-contributor
|
14/0 |
Mathlib/Probability/ProbabilityMassFunction/Integrals.lean |
1 |
2 |
['github-actions'] |
nobody |
1-56400 1 day ago |
1-56476 1 day ago |
1-56367 1 day |
| 35175 |
joelriou author:joelriou |
feat(CategoryTheory/Sites): characterization of conservative families of points |
Given a family of points `P` of a site, we characterize the property the `P` is a conservative family in terms of covering sieves. We show that if `(C, J)` has enough points, then so does `(Over X, J.over X)` for `X : C`.
---
- [x] depends on: #35759
- [x] depends on: #35529
- [x] depends on: #35527
- [x] depends on: #35525
- [x] depends on: #35141
- [x] depends on: #35139
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
238/15 |
Mathlib/CategoryTheory/Elements.lean,Mathlib/CategoryTheory/Sites/Point/Basic.lean,Mathlib/CategoryTheory/Sites/Point/Conservative.lean,Mathlib/CategoryTheory/Sites/Point/Over.lean |
4 |
5 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
1-56318 1 day ago |
1-56282 1 day ago |
1-56300 1 day |
| 35048 |
b-mehta author:b-mehta |
feat(Analysis/Normed/Operator): prove the Fredholm alternative |
This PR proves the Fredholm alternative for compact operators on a Banach space over a nontrivially normed field
- [x] depends on: #35001
- [x] depends on: #35052
- [x] depends on: #35226
|
t-analysis |
229/0 |
Mathlib.lean,Mathlib/Analysis/Normed/Operator/FredholmAlternative.lean |
2 |
12 |
['b-mehta', 'github-actions', 'loefflerd', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tb65536'] |
nobody |
1-55350 1 day ago |
1-71486 1 day ago |
6-44998 6 days |
| 36067 |
smmercuri author:smmercuri |
feat(NumberTheory/NumberField/FinitePlaces): `Module.Finite (v.adicCompletion K) (w.adicCompletion L)` |
Let `v : HeightOneSpectrum (𝓞 K)` and `w : HeightOneSpectrum (𝓞 L)` be such that we have `Algebra (v.adicCompletion K) (w.adicCompletion L)`. If this algebra gives continuous scalar multiplication and we have `IsScalarTower K (v.adicCompletion K) (w.adicCompletion L)`, then `w.adicCompletion L` is finite-dimensional over `v.adicCompletion K`.
---
[](https://gitpod.io/from-referrer/)
|
|
35/0 |
Mathlib/NumberTheory/NumberField/FinitePlaces.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean |
2 |
1 |
['github-actions'] |
nobody |
1-50410 1 day ago |
1-50470 1 day ago |
1-51057 1 day |
| 35374 |
joelriou author:joelriou |
feat(Algebra/Homology/SpectralObject): `HasSpectralSequence` |
---
- [x] depends on: #35373
- [x] depends on: #35372
- [x] depends on: #35357
- [x] depends on: #35355
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
221/4 |
Mathlib/Algebra/Homology/SpectralObject/HasSpectralSequence.lean |
1 |
5 |
['github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
1-49649 1 day ago |
1-51337 1 day ago |
1-51230 1 day |
| 35970 |
adrianmartir author:adrianmartir |
feat(CategoryTheory/Profunctor): Add profunctors and a basic API for them |
This adds a definition of a profunctor and the definition of a natural transformation between two profunctors. Profunctors are defined as a structure, as suggested by @adamtopaz [on Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Operads.20Formalization/with/566160316).
Using this as a base, I wrote a basic API for profunctors. This will be needed for a future formalization of operads.
A lot of the API was first drafted by @Aristotle-Harmonic.
Co-authored-by: Aristotle (Harmonic)
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
new-contributor
|
185/0 |
Mathlib.lean,Mathlib/CategoryTheory/Profunctor.lean |
2 |
10 |
['adrianmartir', 'emilyriehl', 'github-actions'] |
nobody |
1-48456 1 day ago |
2-36712 2 days ago |
2-38104 2 days |
| 36060 |
edegeltje author:edegeltje |
chore(CategoryTheory/Classifier): namespace Classifier, rename HasClassifier, move file |
The declaration `CategoryTheory.Classifier` (and various lemmas about it) is/are moved to the `Subobject` namespace.
The declaration `CategoryTheory.HasClassifier` is renamed `CategoryTheory.HasSubobjectClassifier`.
The file `CategoryTheory/Topos/Classifier.lean` is moved to `CategoryTheory/Subobject/Classifier/Defs.lean`.
Moves:
- Classifier.* -> Subobject.Classifier.*
---
[](https://gitpod.io/from-referrer/)
|
file-removed
t-category-theory
|
26/24 |
Mathlib.lean,Mathlib/CategoryTheory/Subobject/Classifier/Defs.lean |
2 |
2 |
['edegeltje', 'github-actions'] |
nobody |
1-46977 1 day ago |
1-48187 1 day ago |
1-48377 1 day |
| 36072 |
erdOne author:erdOne |
feat(AlgebraicGeometry): essential smallness of affine schemes locally of finite type over a base |
Co-authored-by: Joël Riou
---
[](https://gitpod.io/from-referrer/)
|
|
151/2 |
Mathlib.lean,Mathlib/Algebra/Category/CommAlgCat/FiniteType.lean,Mathlib/Algebra/Category/Ring/Small.lean,Mathlib/AlgebraicGeometry/Morphisms/FiniteType.lean,Mathlib/CategoryTheory/MorphismProperty/Comma.lean,Mathlib/CategoryTheory/ObjectProperty/Small.lean |
6 |
1 |
['github-actions'] |
nobody |
1-45550 1 day ago |
1-45620 1 day ago |
1-46844 1 day |
| 32245 |
erdOne author:erdOne |
feat(RingTheory): the `coassoc_simps` simp set |
From Toric
Co-authored-by: Yaël Dillies
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
toric
t-meta
maintainer-merge
|
815/0 |
Mathlib.lean,Mathlib/RingTheory/Coalgebra/CoassocSimps.lean,Mathlib/Tactic/Attr/Register.lean,MathlibTest/RingTheory/CoassocSimps.lean |
4 |
22 |
['erdOne', 'github-actions', 'joneugster', 'riccardobrasca'] |
b-mehta, joneugster, mattrobball assignee:joneugster assignee:b-mehta assignee:mattrobball |
1-45316 1 day ago |
13-50015 13 days ago |
30-73081 30 days |
| 35532 |
mariainesdff author:mariainesdff |
feat(Ringtheory/DedekindDomain): add RingEquiv lemmas |
Co-authored by: @xgenereux.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
57/11 |
Mathlib/RingTheory/DedekindDomain/Basic.lean,Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/Ideal/Maps.lean |
3 |
4 |
['github-actions', 'mariainesdff', 'robin-carlier', 'tb65536'] |
nobody |
1-45160 1 day ago |
1-45225 1 day ago |
9-63064 9 days |
| 35989 |
chrisflav author:chrisflav |
feat(RingTheory): define finite split algebras |
From Pi1.
---
- [x] depends on: #36044
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
78/0 |
Mathlib.lean,Mathlib/RingTheory/Etale/Pi.lean,Mathlib/RingTheory/TotallySplit.lean |
3 |
2 |
['erdOne', 'github-actions', 'mathlib-dependent-issues'] |
nobody |
1-44319 1 day ago |
1-54140 1 day ago |
2-34801 2 days |
| 34784 |
tb65536 author:tb65536 |
refactor(GroupTheory/Commutator/Basic): to_additivize commutators |
This PR makes some progress on to_additivizing more of the group theory library.
I had to make the bracket instance scoped to avoid clashing with the Lie bracket.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-group-theory
label:t-algebra$ |
195/37 |
Mathlib/Algebra/Group/Commutator.lean,Mathlib/Algebra/Group/Conj.lean,Mathlib/Algebra/Group/Subgroup/Basic.lean,Mathlib/GroupTheory/Commutator/Basic.lean,Mathlib/GroupTheory/Focal.lean,Mathlib/GroupTheory/GroupAction/Quotient.lean,Mathlib/GroupTheory/GroupAction/SubMulAction/OfStabilizer.lean,Mathlib/GroupTheory/Solvable.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Topology/Algebra/Group/TopologicalAbelianization.lean,MathlibTest/Group.lean,MathlibTest/toAdditiveIrredDef.lean |
12 |
3 |
['github-actions', 'mathlib-merge-conflicts'] |
mattrobball assignee:mattrobball |
1-44263 1 day ago |
1-44689 1 day ago |
28-76057 28 days |
| 35331 |
SnirBroshi author:SnirBroshi |
feat(SimpleGraph/Subgraph): small things about `spanningCoe` and a small golf |
---
Three unrelated things in the same file, each too small to be its own PR.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
maintainer-merge
|
13/4 |
Mathlib/Combinatorics/SimpleGraph/Subgraph.lean |
1 |
3 |
['YaelDillies', 'github-actions'] |
YaelDillies assignee:YaelDillies |
1-36439 1 day ago |
1-36506 1 day ago |
18-15442 18 days |
| 33895 |
jessealama author:jessealama |
feat(Computability/Primrec): add list_take, list_drop, list_modify, and list_set |
This PR shows that several list operations from Lean core are primitive recursive:
- `list_drop`: [`List.drop`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/TakeDrop.lean), via iterating `List.tail` using `nat_iterate`
- `list_take`: [`List.take`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/TakeDrop.lean), via `list_drop` on the reversed list
- `list_modifyHead'`: [`List.modifyHead`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/Nat/Modify.lean) with external data
- `list_modify'`: [`List.modify`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/Nat/Modify.lean) with external data
- `list_modify`: [`List.modify`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/Nat/Modify.lean)
- `list_set`: [`List.set`](https://github.com/leanprover/lean4/blob/master/src/Init/Prelude.lean)
The primed versions (`list_modify'`, `list_modifyHead'`) take a function `g : β → α → α` that depends on external data of type `β`. This generalization enables deriving the other operations:
- `list_modify` specializes `list_modify'` with `β = Unit`
- `list_set` uses `list_modify'` via `List.set_eq_modify`
Also moves `list_length` earlier in the file (before `list_drop` and `list_take`, which depend on it). |
new-contributor
t-computability
|
47/4 |
Mathlib/Computability/Primrec/List.lean |
1 |
1 |
['github-actions'] |
nobody |
1-35876 1 day ago |
48-79559 48 days ago |
49-16398 49 days |
| 35778 |
kebekus author:kebekus |
feat: improve the mean value property of harmonic functions |
Improving existing results, establish a mean value property for functions harmonic on a disk and continuous on its closure.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
67/1 |
Mathlib/Analysis/Complex/Harmonic/MeanValue.lean,Mathlib/MeasureTheory/Integral/CircleAverage.lean |
2 |
7 |
['github-actions', 'hrmacbeth', 'kebekus'] |
j-loreaux assignee:j-loreaux |
1-35867 1 day ago |
1-43899 1 day ago |
6-72357 6 days |
| 35946 |
loefflerd author:loefflerd |
feat(NumberTheory/Modular): interior and closure of fundamental domain |
Show that the open and closed fundamental domains for the modular group are related by the interior / closure operations.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
184/7 |
Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean,Mathlib/NumberTheory/Modular.lean |
2 |
8 |
['CBirkbeck', 'github-actions'] |
nobody |
1-35572 1 day ago |
1-38735 1 day ago |
3-11976 3 days |
| 36078 |
tb65536 author:tb65536 |
feat(LinearAlgebra/Eigenspace/ContinuousLinearMap): eigenspaces of a continuous linear map are closed |
This PR proves that eigenspaces of a continuous linear map are closed. This is in a new file to avoid heavy topology imports in the existing eigenspace files.
---
[](https://gitpod.io/from-referrer/)
|
t-topology
t-algebra
label:t-algebra$ |
37/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Eigenspace/ContinuousLinearMap.lean,Mathlib/Tactic/Linter/DirectoryDependency.lean |
3 |
1 |
['github-actions'] |
nobody |
1-28463 1 day ago |
1-28463 1 day ago |
1-28355 1 day |
| 36088 |
pevogam author:pevogam |
feat: add a LE version of previous div_lt_div_iff_mul_lt_mul theorem |
The following is more useful due to the partial order application of LE in comparison to LT.
Additionally, add specialized cases of equal denominators as simpler syntactic sugar.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
16/0 |
Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean |
1 |
2 |
['github-actions'] |
nobody |
1-27524 1 day ago |
1-27588 1 day ago |
1-27585 1 day |
| 36083 |
gasparattila author:gasparattila |
feat: decomposition of `ContinuousAffineMap` as an `Equiv` |
This PR defines an equivalence `(V →ᴬ[R] Q) ≃ Q × (V →L[R] W)`, plus `LinearEquiv` and `AffineEquiv` variants. To match the names of the new equivalences, `ContinuousAffineMap.toConstProdLinearMap` is also renamed.
---
[](https://gitpod.io/from-referrer/)
|
|
154/13 |
Mathlib/Analysis/Normed/Affine/ContinuousAffineMap.lean,Mathlib/Topology/Algebra/ContinuousAffineMap.lean |
2 |
1 |
['github-actions'] |
nobody |
1-25877 1 day ago |
1-26062 1 day ago |
1-27906 1 day |
| 35518 |
kim-em author:kim-em |
chore: forbid prime (') in filenames, rename LinearCombination' |
This PR renames `Mathlib/Tactic/LinearCombination'.lean` to `LinearCombinationPrime.lean` (and the corresponding test file), and adds a lint check to `modulesOSForbidden` to prevent future files with prime/apostrophe characters in their names.
The `'` character in filenames causes shell escaping issues in scripts (any `find ... -name '*.lean'` or similar pattern needs careful quoting to handle these files correctly).
🤖 Prepared with Claude Code |
file-removed |
13/8 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/LinearCombinationPrime.lean,Mathlib/Tactic/Linter/TextBased.lean,Mathlib/Tactic/Linter/UnusedTactic.lean,MathlibTest/linear_combination_prime.lean |
6 |
6 |
['eric-wieser', 'euprunin', 'github-actions', 'kim-em'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
1-23133 1 day ago |
11-76768 11 days ago |
11-79845 11 days |
| 36093 |
tb65536 author:tb65536 |
feat(GroupTheory/Nilpotent): remove `[IsNilpotent]` assumption from some theorems |
This PR uses the junk value of `nilpotencyClass` to remove `[IsNilpotent]` assumption from some theorems.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-group-theory
label:t-algebra$ |
18/12 |
Mathlib/GroupTheory/Nilpotent.lean |
1 |
1 |
['github-actions'] |
nobody |
1-23102 1 day ago |
1-23102 1 day ago |
1-22994 1 day |
| 35209 |
kim-em author:kim-em |
chore: use @[to_dual] extensively in CompleteLattice |
This PR adds `@[to_dual]` and `@[to_dual existing]` annotations extensively in `CompleteLattice/Defs.lean` and `CompleteLattice/Basic.lean`, auto-generating many dual theorems and deleting the hand-written versions.
[Diff relative to previous PR](https://github.com/kim-em/mathlib4/compare/kim/to-dual-bounds-basic...kim/to-dual-complete-lattice)
- [x] depends on: #35208
🤖 Prepared with Claude Code |
|
182/483 |
Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean |
3 |
38 |
['github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
dupuisf assignee:dupuisf |
1-22920 1 day ago |
1-22944 1 day ago |
8-17984 8 days |
| 35753 |
Vilin97 author:Vilin97 |
feat(Topology/Algebra/Order): regular grid helpers and piecewise linear interpolation |
## Summary
- Add `Nat.floor_div_eq_of_mem_Ico`, `mem_Ico_Nat_floor_div`, `locallyFinite_Icc_grid`, and `ContinuousOn.of_Icc_grid` to `Topology/Algebra/Order/Floor.lean`.
- Add new file `Topology/Algebra/Order/PiecewiseLinear.lean` with `piecewiseLinear` and `piecewiseConst` definitions for interpolation on regular grids, along with evaluation lemmas, continuity, and right derivative.
- Grid helpers are generalized over `Field K` with `FloorSemiring` and `OrderTopology`.
- Piecewise definitions are generic over `Field α`; continuity/derivative results are for `ℝ`-normed spaces.
## Motivation
These are used in the [forward Euler convergence proof](https://github.com/Vilin97/forward_euler) to construct piecewise linear interpolations of Euler points and prove their continuity. They are general-purpose lemmas about regular grids and piecewise interpolation that should be useful beyond this application.
Follow-up PR: #35755 (forward Euler method convergence).
---
The initial proof was produced by [Aristotle](https://aristotle.harmonic.fun). The code was then iteratively refined (factoring out lemmas, golfing, simplifying proofs) using Claude Code (Claude Opus 4.6). |
t-topology
new-contributor
|
151/0 |
Mathlib.lean,Mathlib/Topology/Algebra/Order/Floor.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean |
3 |
6 |
['copilot-pull-request-reviewer', 'github-actions', 'wwylele'] |
dagurtomas assignee:dagurtomas |
1-22401 1 day ago |
1-30190 1 day ago |
7-80672 7 days |
| 36059 |
joelriou author:joelriou |
feat(CategoryTheory/Functor): exactness properties of conservative families of exact functors |
A morphism of homological complexes is a quasi-isomorphism iff it is so after applying a conservative family of exact functors.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
195/0 |
Mathlib.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Exact.lean,Mathlib/CategoryTheory/Functor/ReflectsIso/Limits.lean,Mathlib/CategoryTheory/Limits/Shapes/ZeroObjects.lean |
4 |
3 |
['github-actions', 'robin-carlier'] |
nobody |
1-21221 1 day ago |
1-21412 1 day ago |
1-34427 1 day |
| 36095 |
kim-em author:kim-em |
chore: remove stray comment about backward.isDefEq.respectTransparency |
This PR removes a stray comment in `lakefile.lean` that referred to the `backward.isDefEq.respectTransparency` option. The option itself was already removed, but the comment was left behind.
See https://leanprover.zulipchat.com/#narrow/channel/113488-general/topic/backward.2EisDefEq.2ErespectTransparency/near/576953838
🤖 Prepared with Claude Code |
|
0/3 |
lakefile.lean |
1 |
4 |
['Parcly-Taxel', 'github-actions', 'kim-em'] |
nobody |
1-21141 1 day ago |
1-22668 1 day ago |
1-22559 1 day |
| 35950 |
kim-em author:kim-em |
feat(Tactic): add inferInstanceAs% to fix type leakage |
This PR adds `inferInstanceAs%`, a drop-in replacement for `inferInstanceAs` that prevents "type leakage" in synthesized instances.
When `inferInstanceAs (SomeClass A)` is used to define `SomeClass B` (where `B` is a non-reducible alias for `A`), the synthesized instance may contain lambda binder domains (and other sub-expressions) referring to `A` or deeper unfoldings instead of `B`. This is invisible at `default` transparency but causes `isDefEq` failures at `reducibleAndInstances` transparency — which is the level used by `grind`'s `checkInst`.
`inferInstanceAs%` fixes this by recursively normalizing the constructor tree: it WHNFs to expose the constructor, patches carrier type parameters via `isDefEq` matching against the unfolding chain, recursively processes instance-implicit fields, and replaces lambda binder domains in function fields.
As a demonstration, this fixes the `grind` failure in `FiniteResidueField` that was worked around with `#adaptation_note` and a manual proof on `nightly-testing`.
🤖 Prepared with Claude Code |
|
428/12 |
Mathlib.lean,Mathlib/Algebra/Order/Ring/StandardPart.lean,Mathlib/Tactic.lean,Mathlib/Tactic/InferInstanceAsPercent.lean,MathlibTest/InferInstanceAsPercent.lean |
5 |
29 |
['JovanGerb', 'astrainfinita', 'github-actions', 'kim-em'] |
nobody |
1-20625 1 day ago |
2-5143 2 days ago |
2-5034 2 days |
| 35323 |
martinwintermath author:martinwintermath |
feat(Geometry/Convex/Cone): Add lemmas for PointedCone.dual |
Add several useful lemmas for `PointedCone.dual` in preparation for duality theory for FG cones.
Some other changes are:
* renamed `dual_le_dual` to `dual_anti` and added partner lemma `dual_antitone`
* removed TODO comment since the stated lemma is not sufficient to prove the claim, an also this has now been proven and will become a PR in the near future.
---
[](https://gitpod.io/from-referrer/)
|
t-convex-geometry |
29/6 |
Mathlib/Geometry/Convex/Cone/Dual.lean |
1 |
1 |
['github-actions'] |
YaelDillies assignee:YaelDillies |
1-20335 1 day ago |
17-56591 17 days ago |
17-56482 17 days |
| 35871 |
edegeltje author:edegeltje |
feat(CategoryTheory/Limits): `IsPullback.mono_fst_of_mono` and similar |
This lemma is more convenient than going through `MorphismProperty.IsStableUnderBasechange`.
We use `(inst : Mono f := by infer_instance)` instead of `[Mono f]` because on occasion, these proof arguments are not by `inferInstance`, and this design lets us more easily use the lemma in such cases.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
46/46 |
Mathlib/CategoryTheory/Limits/Shapes/Pullback/IsPullback/Basic.lean,Mathlib/CategoryTheory/MorphismProperty/Limits.lean |
2 |
1 |
['github-actions'] |
robin-carlier assignee:robin-carlier |
1-20332 1 day ago |
5-48195 5 days ago |
5-49461 5 days |
| 35882 |
Thmoas-Guan author:Thmoas-Guan |
feat(Algebra/ModuleCat): API on short complex in ModuleCat |
Adding some API on short complex in ModuleCat, for construction and exactness.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
19/0 |
Mathlib/Algebra/Homology/ShortComplex/ModuleCat.lean |
1 |
1 |
['github-actions'] |
dagurtomas assignee:dagurtomas |
1-20331 1 day ago |
5-152 5 days ago |
5-43 5 days |
| 35906 |
scp020 author:scp020 |
feat(Combinatorics/SimpleGraph/Walks): add Walk.IsChord and Walk.IsChordless |
Add `Walk.IsChord` and `Walk.IsChordless` predicates in a new file `SimpleGraph/Walks/Chords.lean`.
See "chord" in https://en.wikipedia.org/wiki/Glossary_of_graph_theory
Discussion on Zulip:
[Zulip link](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Walk.2EIsChordless.20live.20in.20mathlib.3F/with/575277309)
authored-by: Tianyi Zhao
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
68/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Chords.lean |
2 |
11 |
['SnirBroshi', 'github-actions', 'scp020'] |
nobody |
1-17116 1 day ago |
1-17423 1 day ago |
2-68065 2 days |
| 36091 |
JJYYY-JJY author:JJYYY-JJY |
feat(Analysis.LocallyConvex.Separation): add Eidelheit's separation theorem |
Adds `geometric_hahn_banach_of_interior_nonempty`, formalizing Eidelheit's separation theorem for disjoint convex sets where one has a nonempty interior.
This resolves the longstanding TODO in `Mathlib.Analysis.LocallyConvex.Separation`. The patch also removes the TODO for the topological property `Convex ℝ s → interior (closure s) ⊆ s`, as this is already handled by `Convex.closure_interior_eq_closure_of_nonempty_interior` (imported from `Mathlib.Analysis.Convex.Topology`).
Key implementation details:
* Uses `geometric_hahn_banach_open` to separate `interior A` and `B`.
* Requires `B.Nonempty` to guarantee the separating continuous linear functional is nontrivial (`f ≠ 0`), avoiding the triviality trap where `A` covers the entire space.
* Uses `closure_minimal` to extend the weak inequality from `interior A` to the entirety of `A`.
---
[](https://gitpod.io/from-referrer/)
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Interior.20of.20closure.20for.20convex.20sets/with/577060103 |
t-analysis
new-contributor
|
39/5 |
Mathlib/Analysis/LocallyConvex/Separation.lean |
1 |
7 |
['copilot-pull-request-reviewer', 'github-actions', 'wwylele'] |
nobody |
1-14316 1 day ago |
1-14378 1 day ago |
1-26687 1 day |
| 35951 |
parabamoghv author:parabamoghv |
feat(CategoryTheory/Monoidal): evaluation coevaluation isomorphisms |
This PR adds four features to rigid categories:
1. `coevaluation_evaluation` and `evaluation_coevaluation` as isomorphism equalities: Using `IsIso` instances for the `evaluation` and `coevaluation` morphisms, we promote the morphism equalities to isomorphism equalities.
2. `ExactPairing Y X` from `ExactPairing X Y`: Using an exact pairing and `IsIso` instances for both `evaluation` and `coevaluation`, we swap the exact pairing by inverting the evaluation and coevaluation morphisms. Any suggestions for the definition name are welcome. Right now it is `ExactPairing.Symm`. The second choice was `ExactPairing.Swap`.
3. `HasLeftDual X` from `HasRightDual X`: Using a `HasRightDual X` instance and relevant `IsIso` instances, we construct a left dual. Similar construction for the other way.
4. `LeftDual` isomorphic to `RightDual`: Using relevant `IsIso` instances, we provide the isomorphism from the left dual of an object to the right dual. This can be achieved in two ways: either by using `leftDualIso` or using `rightDualIso`. We will prove in a subsequent PR that both these isomorphisms are equal.
Motivation: This is part of an effort to formalize CategoricalGroups, which can be defined as right rigid groupoids. The approach is motivated by the discussion in [#34830](https://github.com/leanprover-community/mathlib4/pull/34830).
Any comments or suggestions are welcome, especially about the naming.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
new-contributor
|
65/0 |
Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean |
1 |
2 |
['github-actions'] |
nobody |
1-5644 1 day ago |
3-3281 3 days ago |
3-4172 3 days |
| 35627 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Finite): min/max degrees of top/bot |
And a couple of lemmas about `IsRegularOfDegree`, e.g. the empty graph is regular of any degree.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
28/1 |
Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean |
2 |
6 |
['SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
1-3456 1 day ago |
11-10205 11 days ago |
11-10096 11 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: #27416
[](https://gitpod.io/from-referrer/)
|
large-import
t-ring-theory
|
240/24 |
Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Regular/Category.lean,Mathlib/RingTheory/Regular/Depth.lean,Mathlib/RingTheory/Regular/RegularSequence.lean |
5 |
55 |
['Thmoas-Guan', 'alreadydone', 'chrisflav', 'dagurtomas', 'erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
chrisflav assignee:chrisflav |
1-2860 1 day ago |
12-84118 12 days ago |
84-70818 84 days |
| 34026 |
SnkXyx author:SnkXyx |
feat(Algebra/MvPolynomial): add mainVariable |
Add `mainVariable` of `MvPolynomial`, the largest variable index appearing in the polynomial.
Main Theorems:
* `mainVariable_eq_bot_iff_eq_C`
* `mainVariable_sum_le`
* `mainVariable_prod_le`
* `degreeOf_eq_zero_of_mainVariable_lt`
The PR is upstreamized from [github.com/WuProver/lean_characteristic_set](https://github.com/WuProver/lean_characteristic_set)
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
147/0 |
Mathlib.lean,Mathlib/Algebra/MvPolynomial/MainVariable.lean |
2 |
1 |
['github-actions'] |
mattrobball assignee:mattrobball |
1-646 1 day ago |
48-6072 48 days ago |
48-6966 48 days |
| 33348 |
AntoineChambert-Loir author:AntoineChambert-Loir |
feat(LinearAlgebra/Transvection): characterization of transvections among dilatransvections |
* `LinearEquiv.fixedReduce`. Pass a linear equivalence to the quotient by a fixed subspace.
* Characterize transvections among dilatransvections by the fact that their reduction is the identity.
---
- [x] depends on: #33347
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
322/8 |
Mathlib.lean,Mathlib/Algebra/Module/Submodule/Map.lean,Mathlib/LinearAlgebra/FiniteDimensional/Lemmas.lean,Mathlib/LinearAlgebra/FixedSubmodule.lean,Mathlib/LinearAlgebra/Transvection.lean |
5 |
23 |
['AntoineChambert-Loir', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'ocfnash'] |
ocfnash assignee:ocfnash |
0-80628 22 hours ago |
1-55640 1 day ago |
25-52086 25 days |
| 36106 |
nielsvoss author:nielsvoss |
chore(Analysis/InnerProductSpace): remove a hypothesis from LinearMap.IsSymmetric.card_filter_eigenvalues_eq |
Use proof by cases to remove an unnecessary hypothesis from `LinearMap.IsSymmetric.card_filter_eigenvalues_eq` and the related private `LinearMap.IsSymmetric.card_filter_unsortedEigenvalues_eq`. This required proving a statement similar to `LinearMap.IsSymmetric.hasEigenvalue_eigenvalues` but for `unsortedEigenvalues`.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
21/11 |
Mathlib/Analysis/InnerProductSpace/Spectrum.lean |
1 |
1 |
['github-actions'] |
nobody |
0-79842 22 hours ago |
0-80008 22 hours ago |
0-79899 22 hours |
| 35215 |
kim-em author:kim-em |
chore: use @[to_dual] in FixedPoints |
This PR adds `@[to_dual]` annotations to 14 theorems about `lfp` in `Order/FixedPoints.lean`, auto-generating their `gfp` duals and deleting the hand-written versions. Also registers `OrderHom.lfp` as the dual of `OrderHom.gfp` via `attribute [to_dual existing]`.
Auto-generated duals include: `le_gfp`, `gfp_le_fixed`, `gfp_le`, `gfp_le_map`, `map_gfp`, `isFixedPt_gfp`, `map_le_gfp`, `isGreatest_gfp_le`, `isGreatest_gfp`, `gfp_induction`, `map_gfp_comp`, `gfp_gfp`, `map_inf_fixedPoints_le`, `map_sInf_subset_fixedPoints_le`.
[Diff relative to #35208](https://github.com/kim-em/mathlib4/compare/kim/to-dual-bounds-basic...kim/to-dual-fixed-points)
- [x] depends on: #35208
🤖 Prepared with Claude Code |
|
249/548 |
Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean,Mathlib/Order/ConditionallyCompleteLattice/Defs.lean,Mathlib/Order/FixedPoints.lean,Mathlib/Order/GaloisConnection/Basic.lean,Mathlib/Order/Interval/Set/Disjoint.lean,Mathlib/Topology/Order.lean |
8 |
10 |
['JovanGerb', 'github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
nobody |
0-79093 21 hours ago |
1-23275 1 day ago |
8-68190 8 days |
| 35945 |
euprunin author:euprunin |
chore: replace uses of `aesop` with `simp` |
Since `aesop` runs `simp_all` by default, it is preferable to call `simp` directly when it suffices to close the goal. This makes the proof intent more explicit and is typically faster (sometimes significantly so in the cases below).
Trace profiling results (differences <30 ms considered measurement noise):
* `Polynomial.splits_mul_iff`: 998 ms before, 807 ms after 🎉
* `summable_condensed_iff_of_eventually_nonneg`: 927 ms before, 835 ms after 🎉
* `CategoryTheory.PreservesFiniteLimitsOfFlat.uniq`: 1476 ms before, 1327 ms after 🎉
* `IsCyclotomicExtension.union_of_isPrimitiveRoot`: 528 ms before, 306 ms after 🎉
* `Representation.FiniteCyclicGroup.coinvariantsKer_leftRegular_eq_ker`: 324 ms before, 292 ms after 🎉
* `of_adjoin_eq_top`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
16/16 |
Mathlib/Algebra/Polynomial/Splits.lean,Mathlib/AlgebraicGeometry/Noetherian.lean,Mathlib/AlgebraicTopology/SimplicialSet/StdSimplex.lean,Mathlib/Analysis/PSeries.lean,Mathlib/CategoryTheory/Functor/Flat.lean,Mathlib/LinearAlgebra/Multilinear/Curry.lean,Mathlib/NumberTheory/Cyclotomic/Basic.lean,Mathlib/NumberTheory/NumberField/CanonicalEmbedding/NormLeOne.lean,Mathlib/RepresentationTheory/Homological/FiniteCyclic.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/FiniteCyclic.lean,Mathlib/RepresentationTheory/Homological/GroupHomology/LowDegree.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangeHom.lean,Mathlib/RingTheory/ZariskisMainTheorem.lean |
13 |
4 |
['euprunin', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] |
nobody |
0-77970 21 hours ago |
0-77992 21 hours ago |
3-11543 3 days |
| 35533 |
mariainesdff author:mariainesdff |
feat(RingTheory/DedekindDomain/Ideal/Lemmas): add nontrivial_heightOneSpectrum |
Co-authored by: @xgenereux.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
12/0 |
Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean |
1 |
4 |
['erdOne', 'github-actions', 'mariainesdff', 'tb65536'] |
nobody |
0-77868 21 hours ago |
0-77936 21 hours ago |
7-18572 7 days |
| 35886 |
euprunin author:euprunin |
chore: exhaustively replace `measurability`/`continuity` → `fun_prop`, `simp_all` → `simp` where possible |
The goal of this PR is to exhaustively replace `measurability`/`continuity` and `simp_all` with the preferred `fun_prop` and `simp` where possible.
Trace profiling results (differences <30 ms considered measurement noise):
* `PeriodPair.weierstrassPExcept_add`: unchanged 🎉
* `PeriodPair.derivWeierstrassPExcept_sub`: unchanged 🎉
* `PeriodPair.coeff_weierstrassPExceptSeries`: 353 ms before, 320 ms after 🎉
* `Polynomial.Chebyshev.integral_measureT`: unchanged 🎉
* `Polynomial.Chebyshev.integrable_measureT`: 513 ms before, 338 ms after 🎉
* `LinearMap.fst_prodOfFinsuppNat`: unchanged 🎉
* `Representation.leftRegular_norm_apply`: unchanged 🎉
* `ValuativeRel.isDiscrete_trivialRel`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
11/11 |
Mathlib/Analysis/Fourier/Convolution.lean,Mathlib/Analysis/SpecialFunctions/Elliptic/Weierstrass.lean,Mathlib/Analysis/SpecialFunctions/Trigonometric/Chebyshev/Orthogonality.lean,Mathlib/LinearAlgebra/Finsupp/Pi.lean,Mathlib/RepresentationTheory/Basic.lean,Mathlib/RingTheory/Valuation/ValuativeRel/Trivial.lean |
6 |
6 |
['euprunin', 'github-actions', 'leanprover-radar', 'mathlib-merge-conflicts'] |
nobody |
0-77758 21 hours ago |
0-77781 21 hours ago |
4-37089 4 days |
| 36111 |
smmercuri author:smmercuri |
fix: non-defeq projections in `WithAbs` |
Previously the following fails
```lean
example (v : AbsoluteValue R ℝ) : (normedField v).toNormedCommRing.toNormedRing = (normedRing v) := by
with_reducible_and_instances rfl
```
Fix requires removing `fast_instance%` from `normedRing` and adding `@[implicit_reducible]` to `AbsoluteValue.toNormedField`.
Also remove out-of-date docstring.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
3/3 |
Mathlib/Analysis/Normed/Field/Basic.lean,Mathlib/Analysis/Normed/Field/WithAbs.lean,Mathlib/Analysis/Normed/Ring/Basic.lean,Mathlib/Analysis/Normed/Ring/WithAbs.lean |
4 |
1 |
['github-actions'] |
nobody |
0-75986 21 hours ago |
0-76232 21 hours ago |
0-76123 21 hours |
| 34881 |
CBirkbeck author:CBirkbeck |
feat(ModularForm/NumberTheory/Delta): Define the delta function |
We define the Delta function on the upper half plane and show how it transforms under the slash operator, this is in preparation to proving it is a modular form.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
maintainer-merge
|
251/0 |
Mathlib.lean,Mathlib/Analysis/Complex/SqrtDeriv.lean,Mathlib/Analysis/Complex/UpperHalfPlane/Basic.lean,Mathlib/Analysis/RCLike/Sqrt.lean,Mathlib/NumberTheory/ModularForms/Delta.lean,Mathlib/Topology/Algebra/InfiniteSum/Basic.lean |
6 |
50 |
['CBirkbeck', 'faenuccio', 'github-actions', 'joneugster', 'loefflerd'] |
faenuccio and loefflerd assignee:loefflerd assignee:faenuccio |
0-74347 20 hours ago |
0-74410 20 hours ago |
12-38460 12 days |
| 35867 |
edegeltje author:edegeltje |
feat(CategoryTheory/Topos): Define subobject classifier for sheaf of types |
This PR defines `Sheaf.classifier J : Classifier (Sheaf J (Type (max u v))`, which is the last ingredient missing to sheaf categories being elementary topoi.
adapted from:
https://github.com/edegeltje/CwFTT/blob/591d4505390172ae70e1bc97544d293a35cc0b3f/CwFTT/Classifier/Sheaf.lean
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
370/0 |
Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Pullback/IsPullback/Basic.lean,Mathlib/CategoryTheory/Sites/Sheaf.lean,Mathlib/CategoryTheory/Topos/Sheaf.lean |
4 |
15 |
['chrisflav', 'edegeltje', 'github-actions'] |
robin-carlier assignee:robin-carlier |
0-74215 20 hours ago |
4-31491 4 days ago |
4-59382 4 days |
| 36114 |
euprunin author:euprunin |
chore: golf proofs |
The goal of this PR is to decrease the number of times lemmas are called explicitly (replacing calls to lemmas with calls to tactics). Any decrease in compilation time is a welcome side effect, although it is not a primary objective.
Trace profiling results (differences <30 ms considered measurement noise):
* `Real.GammaIntegral_convergent`: unchanged 🎉
* `PartENat.lt_find`: unchanged 🎉
* `MvPFunctor.liftR_iff`: unchanged 🎉
* `LinearMap.ortho_smul_right`: unchanged 🎉
* `MeasureTheory.setToFun_nonneg`: unchanged 🎉
* `ProbabilityTheory.Kernel.measurable_lmarginalPartialTraj`: unchanged 🎉
Profiled using `set_option trace.profiler true in`.
This PR is batched under the following guidelines:
* Up to ~5 changed files per PR
* Up to ~25 changed declarations per PR
* Up to ~100 changed lines per PR
---
[](https://gitpod.io/from-referrer/)
|
|
6/32 |
Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean,Mathlib/Data/Nat/PartENat.lean,Mathlib/Data/PFunctor/Multivariate/Basic.lean,Mathlib/LinearAlgebra/SesquilinearForm/Basic.lean,Mathlib/MeasureTheory/Integral/SetToL1.lean,Mathlib/Probability/Kernel/IonescuTulcea/PartialTraj.lean |
6 |
1 |
['github-actions'] |
nobody |
0-73818 20 hours ago |
0-73887 20 hours ago |
0-73778 20 hours |
| 26743 |
grunweg author:grunweg |
feat: product rule for Lie bracket on manifolds |
On the path towards geodesics and the Levi-Civita connection.
---
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
206/27 |
Mathlib/Geometry/Manifold/MFDeriv/Atlas.lean,Mathlib/Geometry/Manifold/MFDeriv/NormedSpace.lean,Mathlib/Geometry/Manifold/VectorField/LieBracket.lean,Mathlib/Geometry/Manifold/VectorField/Pullback.lean |
4 |
7 |
['github-actions', 'grunweg', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
PatrickMassot assignee:PatrickMassot |
0-71588 19 hours ago |
2-34546 2 days ago |
14-71546 14 days |
| 35157 |
Multramate author:Multramate |
feat(RingTheory/AdjoinRoot): add IsFractionRing for AdjoinRoot |
Co-authored-by: Sriram Chinthalagiri Venkata @sriram3301
This contribution was created as part of the Heidelberg Lean workshop "Formalising algebraic geometry" in November 2025.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
t-algebra
label:t-algebra$ |
40/1 |
Mathlib/RingTheory/AdjoinRoot.lean |
1 |
6 |
['copilot-pull-request-reviewer', 'erdOne', 'github-actions'] |
mattrobball assignee:mattrobball |
0-71351 19 hours ago |
0-71351 19 hours ago |
17-42447 17 days |
| 36086 |
Multramate author:Multramate |
feat(Algebra): add liftEquiv for groups, rings, algebras, and adjoin roots |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
105/22 |
Mathlib/Algebra/Polynomial/AlgebraMap.lean,Mathlib/Algebra/Polynomial/Bivariate.lean,Mathlib/FieldTheory/Galois/Basic.lean,Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/FieldTheory/RatFunc/Luroth.lean,Mathlib/GroupTheory/GroupExtension/Basic.lean,Mathlib/GroupTheory/QuotientGroup/Defs.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/RingTheory/AdjoinRoot.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean,Mathlib/RingTheory/Invariant/Basic.lean,Mathlib/RingTheory/Valuation/ValuationSubring.lean |
12 |
2 |
['github-actions', 'mathlib-merge-conflicts'] |
nobody |
0-70448 19 hours ago |
0-70572 19 hours ago |
0-74486 20 hours |
| 36116 |
xgenereux author:xgenereux |
feat(Module/Torsion): P-primary component |
This PR adds the definition of the `P`-primary component of a module:
$$M(P) := \bigcup_{i : \mathbb{N}} \text{torsionBySet A M } P ^ i.$$
as well as some basic lemmas on how it behaves on `inf` and `sup`.
The main goal of this definition is to eventually have
$$M = \bigoplus_{P} M(P).$$
as well as showing that:
Given a surjective linear map `(φ : M₂ →ₗ[A] M₃)`, we have: `Surjective (primaryComponent.map P φ)`.
These will require #35539 and I will them PR separately. (Proof is quite small but they should be their own PR I think.)
Looking forward for feedback on this!
Co-authored-by: María Inés de Frutos Fernández <[mariaines.dff@gmail.com](mailto:mariaines.dff@gmail.com)>
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
138/0 |
Mathlib.lean,Mathlib/Algebra/Module/Torsion/Basic.lean,Mathlib/Algebra/Module/Torsion/PrimaryComponent.lean |
3 |
1 |
['github-actions'] |
nobody |
0-69617 19 hours ago |
0-69686 19 hours ago |
0-71815 19 hours |
| 36092 |
tb65536 author:tb65536 |
feat(CategoryTheory/Monoidal/Cartesian/Grp_): `Grp` has kernels |
This PR proves that `Grp` has kernels.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
large-import
|
33/0 |
Mathlib/CategoryTheory/Monoidal/Cartesian/Grp_.lean |
1 |
4 |
['github-actions', 'tb65536'] |
nobody |
0-68752 19 hours ago |
1-24337 1 day ago |
1-24228 1 day |
| 34138 |
pfaffelh author:pfaffelh |
feat(MeasureTheory): Introduce `MassFunction α` giving rise to a `Measure α ⊤` |
Define `MassFunction α := α → ℝ≥0∞`
Define `toMeasure (w : MassFunction α) : @Measure α ⊤` as a sum of diracs
Show properties of the resulting objects
This PR intends to start a more userfriendly interaction with probability mass functions (`PMF`). There are two main differences between `MassFunction` and `PMF`:
* `PMF` hast the additional property `HasSum 1`, making the resulting measure a probability measure. (For `MassFunction`, I intend to use the typeclass `IsProbabilityMeasure`in a later PR instead.)
* The `toMeasure` function of `MassFunction` directly defines the measure as a sum of diracs, which immediately makes computations possible.
Discussion thread on [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/PMF.20Refactor.3A.20FunLike.20vs.20Definition.20Change)
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
new-contributor
|
224/0 |
Mathlib.lean,Mathlib/Algebra/GroupWithZero/Indicator.lean,Mathlib/Data/Set/Pairwise/Basic.lean,Mathlib/MeasureTheory/Measure/MassFunction.lean |
4 |
10 |
['DavidLedvinka', 'github-actions', 'metakunt', 'pfaffelh'] |
kex-y and ocfnash assignee:ocfnash assignee:kex-y |
0-67502 18 hours ago |
2-31525 2 days ago |
44-37162 44 days |
| 36069 |
Equilibris author:Equilibris |
feat(Data/PFunctor): Universe generic W |
Previously `W.ind` was limited to `Prop`.
It can for free be changed to `Sort w` forall w.
---
When changing adding `elab_as_elim` it broke the usages in `Fix.lean`.
I had to change `apply ...`s to use `induction ... using ...` but this a minor change.
I added a `simp` lemma to the `w_ind_wMk` as: it is `rfl` and will almost certainly we used at reference site.
It might in the future be useful to add `simp` to `wRec_eq` as well.
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
42/32 |
Mathlib/Data/PFunctor/Multivariate/W.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean |
2 |
2 |
['github-actions'] |
nobody |
0-65525 18 hours ago |
0-65586 18 hours ago |
0-67161 18 hours |
| 26293 |
RemyDegenne author:RemyDegenne |
feat: tightness from convergence of characteristic functions |
If the characteristic functions of a sequence of measures `μ : ℕ → Measure E` on a finite dimensional inner product space converge pointwise to a function which is continuous at 0, then `{μ n | n}` is tight.
---
- [x] depends on: #24846
- [x] depends on: #26292
[](https://gitpod.io/from-referrer/)
---
*This PR continues the work from #24949.*
*Original PR: https://github.com/leanprover-community/mathlib4/pull/24949* |
t-measure-probability
maintainer-merge
|
164/0 |
Mathlib.lean,Mathlib/MeasureTheory/Measure/LevyConvergence.lean,Mathlib/MeasureTheory/Measure/TightNormed.lean |
3 |
15 |
['EtienneC30', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
nobody |
0-63200 17 hours ago |
1-73896 1 day ago |
2-1 2 days |
| 29996 |
vihdzp author:vihdzp |
chore(Order/Concept): `IsIntent` and `IsExtent` |
We define predicates for a set to be an intent/extent, and use them to define alternate constructors for a concept. Using these, we golf the complete lattice instances.
The fields `Concept.intent` and `Concept.extent` already existed, and these serve as unbundled versions of them.
---
- [x] depends on: #30484
[](https://gitpod.io/from-referrer/)
|
t-order
maintainer-merge
|
161/113 |
Mathlib/Order/Concept.lean |
1 |
52 |
['Vierkantor', 'YaelDillies', 'github-actions', 'linesthatinterlace', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
0-62049 17 hours ago |
13-27270 13 days ago |
34-7287 34 days |
| 36013 |
pfaffelh author:pfaffelh |
feat(Topology/Compactness/CompactSystem): introduce compact Systems |
A compact system is a set systems with the property that, whenever a countable intersections of sets in the set system is empty, there is a finite subset of sets with empty intersection. These are needed e.g. in measure theory if one wants to show sigma-additivity of a set function on a ring.
Main result: The set of sets which are either compact and closed, or univ, is a compact system.
Co-authored-by: Rémy Degenne [remydegenne@gmail.com](mailto:remydegenne@gmail.com)
---
Continues work from #25899
[](https://gitpod.io/from-referrer/)
|
t-topology
maintainer-merge
|
250/0 |
Mathlib.lean,Mathlib/Data/Set/Accumulate.lean,Mathlib/Data/Set/Dissipate.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/Topology/Compactness/CompactSystem.lean |
5 |
28 |
['EtienneC30', 'github-actions'] |
nobody |
0-61647 17 hours ago |
0-66704 18 hours ago |
2-16440 2 days |
| 36132 |
smmercuri author:smmercuri |
feat(NumberField/InfinitePlace/Ramification): add `placesOver` |
- This PR defines sets of infinite places of `L` that lie above a fixed infinite place `v` of `K`, as well as subsets of ramified/unramified such places.
- Also define analogous concepts for complex embeddings.
- Fix order of parameters in `ComplexEmbedding.LiesOver` to match the order of params in `AbsoluteValue.LiesOver` make it protected.
---
[](https://gitpod.io/from-referrer/)
|
FLT |
102/18 |
Mathlib/Analysis/Normed/Ring/WithAbs.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Completion.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Embeddings.lean,Mathlib/NumberTheory/NumberField/InfinitePlace/Ramification.lean |
4 |
3 |
['github-actions', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
0-61078 16 hours ago |
0-61141 16 hours ago |
0-61531 17 hours |
| 36068 |
justus-springer author:justus-springer |
feat(RingTheory/Polynomial/GaussLemma): `mem_lifts` lemma for primitive polynomials |
A lemma that's needed for the proof of Lüroth's theorem.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
maintainer-merge
|
24/0 |
Mathlib/RingTheory/Polynomial/GaussLemma.lean |
1 |
6 |
['erdOne', 'github-actions', 'robin-carlier'] |
nobody |
0-58889 16 hours ago |
0-58889 16 hours ago |
1-51118 1 day |
| 35327 |
SnirBroshi author:SnirBroshi |
feat(SimpleGraph/Acyclic): the union of two trees that share exactly one vertex is a tree |
---
A surprisingly painful proof for something that seems trivial when using a proof by drawing on the board.
To avoid any doubts: no AI was involved whatsoever.
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
95/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Operations.lean |
2 |
4 |
['SnirBroshi', 'github-actions', 'vbeffara', 'vlad902'] |
nobody |
0-57441 15 hours ago |
18-25095 18 days ago |
18-24986 18 days |
| 36137 |
smmercuri author:smmercuri |
feat: define pullbacks of `HeightOneSpectrum` |
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
7/0 |
Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean |
1 |
1 |
['github-actions'] |
nobody |
0-57202 15 hours ago |
0-60481 16 hours ago |
0-60372 16 hours |
| 34621 |
homeowmorphism author:homeowmorphism |
feat(GroupTheory/FreeGroup/Basic): deprecate `FreeGroup Empty ≃ Unit` using `Equiv.ofUnique`, add `Mul` suggestion using `MulEquiv.ofUnique` and add `FreeGroup α ≃* Multiplicative ℤ` |
feat(GroupTheory/FreeGroup/Basic): deprecate `FreeGroup Empty ≃ Unit` using `Equiv.ofUnique`, add `Mul` suggestion using `MulEquiv.ofUnique` and add `FreeGroup α ≃* Multiplicative ℤ`.
This is a dependency of a larger PR to formalize finitely presented groups https://github.com/leanprover-community/mathlib4/pull/34236.
---
Originally, the PR showed that `FreeGroup Empty ≃* Unit` and `FreeGroup α ≃* Multiplicative ℤ`. During the review process, I was asked to generalized `Unit` to any `Unique` type and `Empty` to `IsEmpty`. Through working on this, it has been realized that the pre-existing `FreeGroup Empty ≃ Unit` should be deprecated using `Equiv.ofUnique` and a multiplicative version `FreeGroup Empty ≃* Unit` can be obtained similarly using `MulEquiv.ofUnique` and there was no need to explicitly upgrade the equivalence. The title has been changed to reflect this.
[](https://gitpod.io/from-referrer/)
|
t-group-theory
new-contributor
|
45/6 |
Mathlib/GroupTheory/FreeGroup/Basic.lean |
1 |
40 |
['b-mehta', 'copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'kbuzzard', 'riccardobrasca', 'tb65536'] |
riccardobrasca assignee:riccardobrasca |
0-54337 15 hours ago |
16-44009 16 days ago |
23-60481 23 days |
| 36144 |
smmercuri author:smmercuri |
feat: relation between `emultiplicity` and `ramificationIdx` |
If `w` is an ideal of `S` lying above the ideal `v` of `R` then the multiplicity of the push-forward of some ideal `I` of `R` in `w` is given by multiplying the multiplicity of `I` in `v` with the ramification index.
---
[](https://gitpod.io/from-referrer/)
|
|
55/0 |
Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Multiplicity.lean |
2 |
1 |
['github-actions'] |
nobody |
0-53508 14 hours ago |
0-53586 14 hours ago |
0-53477 14 hours |
| 33355 |
0xTerencePrime author:0xTerencePrime |
feat(Combinatorics/SimpleGraph/Connectivity): define vertex connectivity |
This PR introduces the foundations of vertex connectivity for simple graphs, providing a counterpart to the edge connectivity theory in #32870.
### Main definitions
- `SimpleGraph.IsVertexReachable`: vertices remain reachable after removing strictly fewer than `k` other vertices.
- `SimpleGraph.IsVertexConnected`: a graph is `k`-vertex-connected if its order is strictly greater than `k` and any two distinct vertices are `k`-vertex-reachable.
Includes basic characterizations for $k=0$ and $k=1$, along with monotonicity lemmas (`anti` and `mono`). |
new-contributor
t-combinatorics
|
198/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean |
3 |
133 |
['0xTerencePrime', 'SnirBroshi', 'SproutSeeds', 'YaelDillies', 'github-actions', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
0-53343 14 hours ago |
7-13663 7 days ago |
28-46208 28 days |
| 32555 |
ksenono author:ksenono |
feat(Combinatorics/SimpleGraph/Matching): maximum and maximal matchings for Konig's theorem |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
127/0 |
Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean |
2 |
25 |
['SnirBroshi', 'SproutSeeds', 'github-actions', 'jcommelin', 'ksenono'] |
awainverse assignee:awainverse |
0-52603 14 hours ago |
29-28829 29 days ago |
82-1449 82 days |
| 32334 |
EtienneC30 author:EtienneC30 |
feat: independence of Gaussian processes |
Prove different versions of the following statement: if some stochastic processes are jointly Gaussian, then they are independent if their marginals are uncorrelated.
---
- [x] depends on: #32147
- [x] depends on: #32269
[](https://gitpod.io/from-referrer/)
|
brownian
t-measure-probability
|
169/0 |
Mathlib.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean |
2 |
14 |
['DavidLedvinka', 'EtienneC30', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] |
sgouezel assignee:sgouezel |
0-52221 14 hours ago |
0-76968 21 hours ago |
9-45325 9 days |
| 34435 |
huaizhangchu author:huaizhangchu |
feat(Probability): convolution of Poisson distributions |
This PR proves that the convolution of two Poisson distributions is again a Poisson distribution:
`Poisson(r₁) ∗ Poisson(r₂) = Poisson(r₁ + r₂)`
## Main results
- `poissonMeasureReal_charFun`: characteristic function of Poisson distribution is `exp(r(exp(it) - 1))`
- `poissonMeasureReal_conv_poissonMeasureReal`: convolution of Poisson distributions on ℝ
- `poissonMeasure_conv_poissonMeasure`: convolution of Poisson distributions on ℕ
- `poissonMeasure_add_poissonMeasure_of_indepFun`: sum of independent Poisson random variables
## Proof strategy
Uses characteristic functions: `φ(t) = exp(r(eⁱᵗ - 1))`, then pulls back from ℝ to ℕ.
---
- [ ] depends on: #34521 |
t-measure-probability
large-import
new-contributor
|
110/1 |
Mathlib/Probability/Distributions/Poisson.lean |
1 |
15 |
['CoolRmal', 'DavidLedvinka', 'github-actions', 'huaizhangchu', 'mathlib-dependent-issues'] |
RemyDegenne assignee:RemyDegenne |
0-51827 14 hours ago |
27-77984 27 days ago |
29-14982 29 days |
| 36133 |
justus-springer author:justus-springer |
feat(FieldTheory/RatFunc/Luroth): algEquivOfTranscendental |
This is the rational analogue of `Polynomial.algEquivOfTranscendental`. For this, I needed a simp lemma relating `AdjoinSimple.gen` and the `Algebra (Algebra.adjoin ..) (IntermediateField ..)` instance.
---
- [x] depends on: #36123
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
51/1 |
Mathlib/FieldTheory/IntermediateField/Adjoin/Algebra.lean,Mathlib/FieldTheory/RatFunc/AsPolynomial.lean,Mathlib/FieldTheory/RatFunc/Luroth.lean |
3 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
0-51826 14 hours ago |
0-62113 17 hours ago |
0-290 4 minutes |
| 34906 |
seewoo5 author:seewoo5 |
feat(NumberTheory/Bernoulli): von Staudt-Clausen theorem |
---
Rado's proof ("A New Proof of a Theorem of v. Staudt", JLMS 1935) of [von Staudt-Clausen theorem](https://en.wikipedia.org/wiki/Von_Staudt%E2%80%93Clausen_theorem). Initially written by AxiomProver (see commit 97a308e) with further golfs with Claude and Codex.
[](https://gitpod.io/from-referrer/)
|
t-number-theory
large-import
|
496/4 |
Mathlib/NumberTheory/Bernoulli.lean,docs/references.bib |
2 |
3 |
['github-actions', 'kckennylau', 'seewoo5'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
0-50637 14 hours ago |
18-31903 18 days ago |
18-42360 18 days |
| 35675 |
Thmoas-Guan author:Thmoas-Guan |
feat(RingTheory/Smooth): some lemma about formally smooth |
This PR mainly formalized the result [[Stacks 031L](https://stacks.math.columbia.edu/tag/031L)]
This is a preliminary of Cohen Structure Theorem.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
289/4 |
Mathlib.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/RingHom/Smooth.lean,Mathlib/RingTheory/Smooth/Quotient.lean,Mathlib/RingTheory/TensorProduct/Quotient.lean |
5 |
9 |
['Thmoas-Guan', 'github-actions', 'jcommelin'] |
jcommelin assignee:jcommelin |
0-50394 13 hours ago |
1-57479 1 day ago |
9-52182 9 days |
| 36101 |
wwylele author:wwylele |
feat(RingTheory): lemmas about power of maximal ideal |
This adds `IsMaximal.mul_mem_pow` that generalizes `Ideal.IsPrime.mul_mem_pow ` from (IsPrime + IsDedekindDomain) to IsMaximal (Except for the trivial bot case, which is why the prime version is kept)
Also added a related `Quotient.isUnit_mk_pow_{of/iff}_notMem` for determining units in a quotient by power
Disclosure of AI usage: this was produced when I chat with LLM for certain exercise problems, and I identified these small lemmas that can be implemented. Also asked LLM for some hints for idea. Code entirely written by me
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
59/6 |
Mathlib/RingTheory/DedekindDomain/Ideal/Lemmas.lean,Mathlib/RingTheory/Ideal/Operations.lean,Mathlib/RingTheory/Ideal/Quotient/Basic.lean,Mathlib/RingTheory/Ideal/Quotient/Operations.lean |
4 |
2 |
['copilot-pull-request-reviewer', 'github-actions'] |
nobody |
0-49722 13 hours ago |
1-5814 1 day ago |
1-5705 1 day |
| 35709 |
tb65536 author:tb65536 |
feat(AlgebraicGeometry/EllipticCurve/Reduction): define multiplicative and additive reduction |
This PR adds definitions of multiplicative and additive reduction.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-algebraic-geometry
t-number-theory
label:t-algebra$ |
86/5 |
Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean |
1 |
6 |
['Multramate', 'github-actions', 'tb65536'] |
nobody |
0-48326 13 hours ago |
8-80883 8 days ago |
8-80775 8 days |
| 30322 |
kckennylau author:kckennylau |
feat(RingTheory): base change of graded algebra |
In this file we show that if `𝒜` is a graded `R`-algebra, and `S` is any `R`-algebra, then `S ⊗[R] 𝒜` (which is actually `fun i ↦ (𝒜 i).baseChange S`) is a graded `S`-algebra with the same grading.
---
Split from #26061.
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
293/63 |
Mathlib.lean,Mathlib/Algebra/DirectSum/Basic.lean,Mathlib/Algebra/DirectSum/Decomposition.lean,Mathlib/Algebra/DirectSum/Module.lean,Mathlib/Algebra/Order/Module/HahnEmbedding.lean,Mathlib/LinearAlgebra/DirectSum/Finsupp.lean,Mathlib/LinearAlgebra/DirectSum/TensorProduct.lean,Mathlib/LinearAlgebra/TensorProduct/Decomposition.lean,Mathlib/LinearAlgebra/TensorProduct/Tower.lean,Mathlib/RingTheory/Flat/Basic.lean,Mathlib/RingTheory/GradedAlgebra/TensorProduct.lean,Mathlib/RingTheory/TensorProduct/IsBaseChangePi.lean |
12 |
19 |
['erdOne', 'github-actions', 'jcommelin', 'kckennylau', 'mathlib-bors', 'mathlib4-merge-conflict-bot'] |
nobody |
0-47813 13 hours ago |
0-47872 13 hours ago |
36-84408 36 days |
| 34442 |
JohnnyTeutonic author:JohnnyTeutonic |
feat(Algebra/Lie/Classical): add basis for sl(n) relative to chosen diagonal index |
Adds a standard basis for sl n R parametrized by a chosen diagonal index i₀:
Off-diagonal matrix units E_ij for i ≠ j
Diagonal differences E_ii - E_{i₀i₀} for i ≠ i₀
The entry at i₀ is determined by trace-zero.
Implements the approach suggested by @ocfnash in [#33818 (comment)](https://github.com/leanprover-community/mathlib4/pull/33818#issuecomment-3784786673). See also [Zulip discussion](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/lie.20algebra/near/516170116).
Closes the request from #33818.
Note: Developed with the assistance of Claude - the LinearEquiv machinery was beyond my current Lean expertise.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
507/0 |
Mathlib/Algebra/Lie/Classical.lean |
1 |
10 |
['JohnnyTeutonic', 'eric-wieser', 'github-actions', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
0-46967 13 hours ago |
20-85796 20 days ago |
21-62201 21 days |
| 35607 |
gasparattila author:gasparattila |
fix(Tactic): make `eta_expand` idempotent |
The docstring of `eta_expand` says that it puts terms into a normal form, implying that it is idempontent, however, this is not the case in some tricky cases. This PR changes `eta_expand` so that it gives the normal form in one step.
---
[](https://gitpod.io/from-referrer/)
|
t-meta |
57/16 |
Mathlib/Tactic/DefEqTransformations.lean,MathlibTest/DefEqTransformations.lean |
2 |
3 |
['Vierkantor', 'gasparattila', 'github-actions', 'mathlib-bors'] |
Vierkantor assignee:Vierkantor |
0-45207 12 hours ago |
11-31701 11 days ago |
11-33008 11 days |
| 36119 |
Ruizsolveall author:Ruizsolveall |
feat(Topology/Covering): fundamental group of the circle is ℤ |
## Summary
- Proves that the fundamental group of the circle `π₁(S¹, 0)` is isomorphic to `ℤ`, via covering space theory.
- Constructs the winding number map `nLoop : ℤ → Path 0 0` on `AddCircle 1`, and proves it is surjective (`surj_nLoop`), injective (`inj_nLoop`), and additive (`nLoop_add`).
- Assembles these into the group isomorphism `fundamentalGroupCircle : Multiplicative ℤ ≃* FundamentalGroup (AddCircle 1) 0`.
## Approach
Uses the covering map `ℝ → AddCircle 1` and unique path lifting to establish the bijection between homotopy classes of loops and integers (winding numbers). Homotopy invariance of lifted endpoints gives injectivity; surjectivity follows from lifting arbitrary loops. Additivity uses path concatenation of lifts in the simply connected total space `ℝ`.
## Test plan
- [x] `lake env lean Mathlib/Topology/Covering/FundamentalGroupCircle.lean` builds with 0 errors, 0 warnings |
t-topology
new-contributor
|
236/0 |
Mathlib.lean,Mathlib/Topology/Covering/FundamentalGroupCircle.lean |
2 |
22 |
['Ruizsolveall', 'SnirBroshi', 'b-mehta', 'github-actions', 'vihdzp'] |
nobody |
0-42874 11 hours ago |
0-70449 19 hours ago |
0-70340 19 hours |
| 34676 |
joneugster author:joneugster |
chore(Algebra/CharP/MixedCharZero): update file to make use of the module system |
- mark all declarations in the file as `private` or `public`
- remove `@[exposed] public section`
- reduce `public` imports
- fix some wording and drop a random `example` which shouldn't be there
---
I've used this file to better understand the module system and its future implications for mathlib. The file is IMO ideal since it's an old toy example of mine which is a leaf that isn't imported in mathlib anywhere else (yet).
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
32/28 |
Mathlib/Algebra/CharP/MixedCharZero.lean |
1 |
7 |
['github-actions', 'joneugster', 'mathlib-merge-conflicts', 'vihdzp'] |
eric-wieser assignee:eric-wieser |
0-42283 11 hours ago |
5-56695 5 days ago |
22-41056 22 days |
| 36150 |
marcelolynch author:marcelolynch |
ci: Move GitHub apps private keys to Azure Key Vault and mint tokens Key Vault signing |
This PR migrates most GitHub App token minting in mathlib4 workflows from `actions/create-github-app-token` (using private keys in repo secrets) to the new Azure Key Vault-backed action introduced in [mathlib-ci#6](https://github.com/leanprover-community/mathlib-ci/pull/6). Documentation on how to set this up can be found over there.
For an example run see https://github.com/leanprover-community/mathlib4/actions/runs/22678441098
Pending migrations because I didn't have access to the keys:
MATHLIB_LEAN_PR_TESTING_* (other org; still uses actions/create-github-app-token)
LPC_TEAM_CHECK_* in splice_bot_wf_run.yaml (still uses private key for now)
Changes:
- Migrated most workflow to Azure-minted tokens
- Added/adjusted workflow permissions for OIDC minting (added id-token: write where Azure minting is used)
Prepared with Codex |
CI |
188/59 |
.github/workflows/bors.yml,.github/workflows/build.yml,.github/workflows/build_fork.yml,.github/workflows/build_template.yml,.github/workflows/ci_dev.yml,.github/workflows/dependent-issues.yml,.github/workflows/maintainer_bors.yml,.github/workflows/maintainer_bors_wf_run.yml,.github/workflows/maintainer_merge.yml,.github/workflows/maintainer_merge_wf_run.yml,.github/workflows/merge_conflicts.yml,.github/workflows/nightly_bump_and_merge.yml,.github/workflows/nightly_detect_failure.yml,.github/workflows/nightly_merge_master.yml,.github/workflows/nolints.yml,.github/workflows/remove_deprecated_decls.yml,.github/workflows/splice_bot_wf_run.yaml,.github/workflows/update_dependencies.yml,.github/workflows/update_dependencies_zulip.yml,.gitignore |
20 |
2 |
['github-actions', 'marcelolynch'] |
marcelolynch assignee:marcelolynch |
0-41878 11 hours ago |
0-42088 11 hours ago |
0-41979 11 hours |
| 36152 |
urkud author:urkud |
chore(*): reduce defeq abuse about `Set` |
Also fix some `/-` <-> `/--` typos I've noticed while fixing defeq abuse.
---
[](https://gitpod.io/from-referrer/)
|
|
99/101 |
Mathlib/Analysis/Complex/CoveringMap.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/LocallyConvex/WeakDual.lean,Mathlib/Analysis/LocallyConvex/WeakOperatorTopology.lean,Mathlib/Combinatorics/Derangements/Finite.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/GroupTheory/Sylow.lean,Mathlib/LinearAlgebra/Dimension/Finite.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/Defs.lean,Mathlib/Order/CompleteLatticeIntervals.lean,Mathlib/Order/Interval/Set/OrdConnected.lean,Mathlib/Order/Interval/Set/OrderIso.lean,Mathlib/Order/OrderIsoNat.lean,Mathlib/RingTheory/AlgebraicIndependent/Basic.lean,Mathlib/RingTheory/FreeCommRing.lean,Mathlib/RingTheory/Ideal/AssociatedPrime/Basic.lean,Mathlib/RingTheory/Ideal/IsPrincipal.lean,Mathlib/RingTheory/Ideal/Maps.lean,Mathlib/RingTheory/LaurentSeries.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Finite.lean,Mathlib/SetTheory/Cardinal/Order.lean,Mathlib/Topology/Algebra/Module/Cardinality.lean,Mathlib/Topology/Category/TopCat/Limits/Products.lean,Mathlib/Topology/Compactness/Lindelof.lean,Mathlib/Topology/Constructions/SumProd.lean,Mathlib/Topology/ContinuousMap/Ideals.lean,Mathlib/Topology/DenseEmbedding.lean,Mathlib/Topology/IndicatorConstPointwise.lean,Mathlib/Topology/Instances/Complex.lean,Mathlib/Topology/Irreducible.lean,Mathlib/Topology/IsClosedRestrict.lean,Mathlib/Topology/LocalAtTarget.lean,Mathlib/Topology/MetricSpace/CantorScheme.lean,Mathlib/Topology/MetricSpace/GromovHausdorff.lean,Mathlib/Topology/MetricSpace/Pseudo/Defs.lean,Mathlib/Topology/MetricSpace/Thickening.lean,Mathlib/Topology/Metrizable/Urysohn.lean,Mathlib/Topology/Order.lean,Mathlib/Topology/Order/Basic.lean,Mathlib/Topology/Order/HullKernel.lean,Mathlib/Topology/Perfect.lean,Mathlib/Topology/UniformSpace/Ascoli.lean,Mathlib/Topology/UniformSpace/Basic.lean,Mathlib/Topology/UniformSpace/LocallyUniformConvergence.lean,Mathlib/Topology/UniformSpace/UniformEmbedding.lean |
45 |
1 |
['github-actions'] |
nobody |
0-39673 11 hours ago |
0-39770 11 hours ago |
0-39661 11 hours |
| 36113 |
tb65536 author:tb65536 |
feat(CategoryTheory/Monoidal/Grp_): add constructor for `Grp.mk A ⟶ Grp.mk B` |
This PR adds a constructor for `Grp.mk A ⟶ Grp.mk B`.
---
[](https://gitpod.io/from-referrer/)
|
t-algebraic-geometry
t-category-theory
|
5/0 |
Mathlib/CategoryTheory/Monoidal/Grp_.lean |
1 |
2 |
['github-actions', 'joelriou'] |
nobody |
0-38009 10 hours ago |
0-73893 20 hours ago |
0-73785 20 hours |
| 35100 |
stepan2698-cpu author:stepan2698-cpu |
feat: definition of a character of a representation |
This PR begins to transfer definitions and theorems about characters from `FDRep` to `Representation`. Once #34888 is merged, the theorems involving isomorphisms of representations will be appropriately restated.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
226/54 |
Mathlib/LinearAlgebra/Dimension/StrongRankCondition.lean,Mathlib/RepresentationTheory/Character.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RepresentationTheory/Invariants.lean,Mathlib/RepresentationTheory/Irreducible.lean |
5 |
16 |
['github-actions', 'ocfnash', 'stepan2698-cpu'] |
ocfnash assignee:ocfnash |
0-36095 10 hours ago |
0-36160 10 hours ago |
22-1919 22 days |
| 36029 |
joelriou author:joelriou |
feat(Algebra/Homology): exact sequences for `SpectralObject.E` |
---
A few typos from #35378 are fixed.
- [x] depends on: #35378
- [x] depends on: #35361
[](https://gitpod.io/from-referrer/)
|
t-algebra
t-category-theory
label:t-algebra$ |
324/14 |
Mathlib/Algebra/Homology/SpectralObject/Page.lean |
1 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-35731 9 hours ago |
0-52722 14 hours ago |
0-53336 14 hours |
| 36130 |
vbeffara author:vbeffara |
feat(Combinatorics/SimpleGraphs): generalize SimpleGraph.map to any function |
The point is to be able to use map to define graph contractions. Added the injectivity assumption where needed.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
easy
maintainer-merge
|
42/31 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Basic.lean |
4 |
14 |
['SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'vbeffara'] |
nobody |
0-34690 9 hours ago |
0-61236 16 hours ago |
0-62702 17 hours |
| 36155 |
grunweg author:grunweg |
feat: custom elaborators for TangentSpace, tangentMap and tangentMapW… |
…ithin
---
Might be best to land the other PRs using them first.
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
50/20 |
Mathlib/Geometry/Manifold/ContMDiffMFDeriv.lean,Mathlib/Geometry/Manifold/GroupLieAlgebra.lean,Mathlib/Geometry/Manifold/IntegralCurve/Basic.lean,Mathlib/Geometry/Manifold/MFDeriv/SpecificFunctions.lean,Mathlib/Geometry/Manifold/Notation.lean |
5 |
1 |
['github-actions'] |
nobody |
0-33216 9 hours ago |
0-33308 9 hours ago |
0-33199 9 hours |
| 36087 |
matthewjasper author:matthewjasper |
chore: fix diamonds for Real/Complex Algebra instances |
Unfold or make `implicit_reducible` some definitions used to define `Algebra ℝ ℂ` . This should allow reducing use of `set_option backward.isDefEq.respectTransparency false`.
---
[](https://gitpod.io/from-referrer/)
|
|
77/49 |
Mathlib/Algebra/Algebra/Defs.lean,Mathlib/Algebra/Algebra/Pi.lean,Mathlib/Algebra/Algebra/Prod.lean,Mathlib/Algebra/Algebra/RestrictScalars.lean,Mathlib/Algebra/Category/ModuleCat/Algebra.lean,Mathlib/Algebra/GroupWithZero/Action/Defs.lean,Mathlib/Analysis/Calculus/MeanValue.lean,Mathlib/Analysis/Complex/Basic.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/LocallyConvex/SeparatingDual.lean,Mathlib/Analysis/Normed/Module/Basic.lean,Mathlib/Analysis/Normed/Module/HahnBanach.lean,Mathlib/Analysis/RCLike/Lemmas.lean,Mathlib/Analysis/SpecialFunctions/ContinuousFunctionalCalculus/ExpLog/Basic.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/FieldTheory/PurelyInseparable/Basic.lean,Mathlib/FieldTheory/SeparableDegree.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/LocalRing/Quotient.lean,Mathlib/RingTheory/TensorProduct/Maps.lean,MathlibTest/instance_diamonds.lean |
23 |
4 |
['github-actions', 'matthewjasper'] |
nobody |
0-32650 9 hours ago |
1-23437 1 day ago |
1-25243 1 day |
| 36146 |
Multramate author:Multramate |
feat(AlgebraicGeometry/GammaSpecAdjunction): add equivalences for Spec morphisms that commute with algebra maps |
---
[](https://gitpod.io/from-referrer/)
|
t-algebraic-geometry
t-algebra
label:t-algebra$ |
57/1 |
Mathlib/Algebra/Category/CommAlgCat/Basic.lean,Mathlib/AlgebraicGeometry/GammaSpecAdjunction.lean |
2 |
8 |
['Multramate', 'erdOne', 'github-actions'] |
nobody |
0-30368 8 hours ago |
0-47517 13 hours ago |
0-47408 13 hours |
| 36097 |
matthewjasper author:matthewjasper |
chore: make psuedoparents of algebraic substructures reducible |
Make functions that take an algebraic substructure and return a sibling class reducible, this matches actual parents and resolves some usage of `set_option backward.isDefEq.respectTransparency false`. For example it ensures that the field instance on `IntermediateField` has a compatible `Semiring` instance to the one from it extending a `Subalgebra`.
Also remove @[simp] from `adjoin_toSubsemiring`, since it prevents other simp lemmas on `adjoin` from applying.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
23/16 |
Mathlib/Algebra/Algebra/NonUnitalSubalgebra.lean,Mathlib/Algebra/Algebra/Subalgebra/Basic.lean,Mathlib/Algebra/Algebra/Subalgebra/Lattice.lean,Mathlib/Algebra/Field/Subfield/Defs.lean,Mathlib/Algebra/Ring/Subring/Defs.lean,Mathlib/Algebra/Ring/Subsemiring/Defs.lean,Mathlib/Algebra/Star/NonUnitalSubalgebra.lean,Mathlib/Algebra/Star/Subalgebra.lean,Mathlib/FieldTheory/IntermediateField/Basic.lean,Mathlib/RingTheory/NonUnitalSubring/Defs.lean,Mathlib/RingTheory/TensorProduct/Basic.lean |
11 |
1 |
['github-actions'] |
nobody |
0-27234 7 hours ago |
0-27654 7 hours ago |
0-30894 8 hours |
| 35661 |
chrisflav author:chrisflav |
feat(Geometry/Manifold): a smooth map induces a morphism of locally ringed spaces |
---
I have put things in the `IsManifold` namespace, because `IsManifold.locallyRingedSpace` is in that namespace. It seems to me that this namespace is not very fitting, because `IsManifold` is not mentioned once. Since I am unfamiliar with this part of the library, I refrained from changing it, but I am happy to do so if preferred.
[](https://gitpod.io/from-referrer/)
|
t-algebraic-geometry
t-differential-geometry
|
152/1 |
Mathlib/Geometry/Manifold/ContMDiff/Basic.lean,Mathlib/Geometry/Manifold/LocalInvariantProperties.lean,Mathlib/Geometry/Manifold/Sheaf/LocallyRingedSpace.lean,Mathlib/Geometry/Manifold/Sheaf/Smooth.lean |
4 |
3 |
['chrisflav', 'github-actions', 'hrmacbeth'] |
ocfnash assignee:ocfnash |
0-27005 7 hours ago |
10-26952 10 days ago |
10-27420 10 days |
| 36084 |
emo916math author:emo916math |
feat(Analysis): Eliminate a hypothesis on IsTheta.rpow |
A strengthened version of `IsTheta.rpow`: if $f$ and $g$ are eventually nonnegative functions with $f = \Theta(g)$ and $r \in \mathbb{R}$, then $f^r = \Theta(g^r)$.
The previous version had a hypothesis that $r \geq 0$. The present version proves by splitting into two cases; in the case $r < 0$, the lower and upper bounds must be used in reverse order.
Since `IsTheta.rpow` is not used elsewhere in Mathlib, this should be an easy one to merge.
(Claude AI was used to help in the golfing.)
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
10/3 |
Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean |
1 |
3 |
['SnirBroshi', 'github-actions'] |
nobody |
0-26653 7 hours ago |
1-18643 1 day ago |
1-18534 1 day |
| 36159 |
gasparattila author:gasparattila |
chore(Order/Hom/Lattice): use `to_dual` |
---
[](https://gitpod.io/from-referrer/)
|
t-order |
80/242 |
Mathlib/Order/Hom/Lattice.lean |
1 |
1 |
['github-actions'] |
nobody |
0-26441 7 hours ago |
0-26520 7 hours ago |
0-26411 7 hours |
| 36043 |
robin-carlier author:robin-carlier |
feat: add `dsimp%` elaborator |
This PR adds a `dsimp%` elaborators that puts a given term in `dsimp`-normal form. This is useful as a way to avoid the
`have foo := …; dsimp at foo; rw [foo]` pattern.
From [SymmMonCoherence](https://github.com/robin-carlier/SymmMonCoherence)
---
~~The main possible extension for this (of which I would be grateful to have some level of help in doing) would be to also add a syntax for ~~`dsimp% […]`~~ to also specify some dsimprocs that should be dsimped in the ~~`dsimp`~~ call.~~ Now done, thanks a lot @JovanGerb !
[](https://gitpod.io/from-referrer/)
|
t-meta
maintainer-merge
|
105/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/Common.lean,Mathlib/Tactic/DSimpPercent.lean,MathlibTest/DSimpPercent.lean |
5 |
13 |
['JovanGerb', 'github-actions', 'robin-carlier'] |
nobody |
0-25691 7 hours ago |
0-25745 7 hours ago |
1-67549 1 day |
| 36163 |
mcdoll author:mcdoll |
feat(Analysis/SpecialFunctions): `rpow` is locally integrable |
Local integrability of real powers. This is only of interest at the origin, where `‖x‖ ^ (-α)` is not bounded.
Co-authored-by: Michael Douglas
---
From https://github.com/mrdouglasny/OSforGFF and made mathlib ready by me
[](https://gitpod.io/from-referrer/)
|
|
71/0 |
Mathlib/Analysis/SpecialFunctions/Pow/Integral.lean,Mathlib/MeasureTheory/Constructions/HaarToSphere.lean |
2 |
1 |
['github-actions'] |
nobody |
0-23783 6 hours ago |
0-23859 6 hours ago |
0-23750 6 hours |
| 35659 |
BryceT233 author:BryceT233 |
chore(Data/Finsupp): update pointwise module structure |
This is the 3rd PR split from #34936 to make the review process easier.
It updates the pointwise module structure `Module (ι → R) (ι →₀ M)` where `R` is a semiring and `M` is an `R`-module.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
26/18 |
Mathlib/Data/Finsupp/Pointwise.lean |
1 |
3 |
['github-actions', 'mathlib-merge-conflicts'] |
joneugster assignee:joneugster |
0-23675 6 hours ago |
0-23733 6 hours ago |
9-82565 9 days |
| 36100 |
plp127 author:plp127 |
feat(FieldTheory/KrullTopology): generalize theorems |
Simultaneously generalize `IntermediateField.fixingSubgroup_isClosed` and `InfiniteGalois.fixingSubgroup_isClosed` to algebraic extensions.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
22/29 |
Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/FieldTheory/KrullTopology.lean |
2 |
3 |
['github-actions', 'vihdzp'] |
nobody |
0-22416 6 hours ago |
1-9768 1 day ago |
1-9743 1 day |
| 30334 |
kckennylau author:kckennylau |
feat(RingTheory): define maps of homogeneous ideals |
In this file we define `HomogeneousIdeal.map` and `HomogeneousIdeal.comap`, similar to and based on the existing `Ideal.map` and `Ideal.comap`. More concretely, a graded ring homomorphism `𝒜 →+*ᵍ ℬ` induces a "Galois connection" between the homogeneous ideals in `𝒜` and the homogeneous ideals in `ℬ`.
---
Split from #26061.
- [ ] depends on: #30312
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
96/0 |
Mathlib.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Ideal.lean,Mathlib/RingTheory/GradedAlgebra/Homogeneous/Maps.lean |
3 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot'] |
nobody |
0-22349 6 hours ago |
0-22174 6 hours ago |
0-23397 6 hours |
| 35957 |
Scarlett-le author:Scarlett-le |
feat: add dist_center_midpoint_lt_radius for spheres |
Adds two results about chords of spheres in Euclidean affine spaces:
- `Sphere.inner_vsub_center_midpoint_vsub`: the vector from the center
of a sphere to the midpoint of a chord is orthogonal to the chord.
- `Sphere.dist_center_midpoint_lt_radius`: the distance from the center
to the midpoint of a chord with distinct endpoints is strictly less
than the radius. This follows by applying the Pythagorean theorem to
the right triangle formed by the center, the midpoint, and an endpoint,
using the orthogonality result above. |
t-euclidean-geometry
maintainer-merge
|
22/0 |
Mathlib/Geometry/Euclidean/Sphere/Basic.lean |
1 |
4 |
['github-actions', 'jsm28'] |
nobody |
0-21764 6 hours ago |
2-84554 2 days ago |
2-84445 2 days |
| 29030 |
b-mehta author:b-mehta |
feat(Combinatorics): prove the Rado selection lemma |
Prove the Rado selection lemma, a generic result useful to prove a variety of compactness results in combinatorics. This generalises Konig's infinity lemma, and the de Bruijn-Erdos theorem, and allows the former to be conveniently stated in the language of sets rather than categories.
We leave these generalisations of results in mathlib to later PRs.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
132/0 |
Mathlib.lean,Mathlib/Combinatorics/Compactness.lean |
2 |
1 |
['github-actions'] |
kmill assignee:kmill |
0-20331 5 hours ago |
23-48754 23 days ago |
0-4774 1 hour |
| 34938 |
peabrainiac author:peabrainiac |
feat(Geometry/Manifold): interior and boundary are preserved by (local) diffeomorphisms |
If `f` is a local diffeomorphism at `x`, `f x` is an interior point iff `x` is. We prove this and a bunch of corollaries, in particular that `BoundarylessManifold` is invariant under diffeomorphisms which we need for subsequent work.
---
- [x] depends on: #33189
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
133/5 |
Mathlib/Geometry/Manifold/IsManifold/ExtChartAt.lean,Mathlib/Geometry/Manifold/IsManifold/InteriorBoundary.lean |
2 |
8 |
['github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'peabrainiac'] |
ocfnash assignee:ocfnash |
0-20330 5 hours ago |
4-9436 4 days ago |
4-9589 4 days |
| 35665 |
BryceT233 author:BryceT233 |
feat(RingTheory/AdicCompletion): introduce AdicCompletion.finsuppSum |
This is split from #34936 to make the review process easier.
It introduces `AdicCompletion.finsuppSum`, which is a `Finsupp` version of `AdicCompletion.sum`.
---
- [x] depends on: #35595
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-ring-theory
|
93/0 |
Mathlib/LinearAlgebra/Finsupp/LSum.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean |
2 |
4 |
['github-actions', 'joneugster', 'mathlib-dependent-issues'] |
riccardobrasca assignee:riccardobrasca |
0-20329 5 hours ago |
4-1705 4 days ago |
9-14070 9 days |
| 35696 |
GrigorenkoPV author:GrigorenkoPV |
fix(Data/Rel): change what `image_eq_cod_of_dom_subset` states |
It used to be identical to its neighbor, `preimage_eq_dom_of_cod_subset`.
Both lemmas seem to have been introduced in #25587.
---
I think this is technically a breaking change? Not sure what has to be done here.
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
1/1 |
Mathlib/Data/Rel.lean |
1 |
2 |
['github-actions', 'vihdzp'] |
joneugster assignee:joneugster |
0-20328 5 hours ago |
9-30455 9 days ago |
9-30346 9 days |
| 35763 |
kim-em author:kim-em |
chore(scripts): make rm_set_option cache opt-in via --resume |
This PR changes `scripts/rm_set_option.py` so the progress cache is only used when explicitly requested via `--resume`, rather than being on by default (with `--no-resume` to disable).
The previous default was unsafe: the cache only checks that the target module's own SHA256 is unchanged, so edits to upstream modules between runs would be silently ignored, causing the script to skip modules that should be reprocessed.
🤖 Prepared with Claude Code |
|
4/4 |
scripts/README.md,scripts/rm_set_option.py |
2 |
1 |
['github-actions'] |
dupuisf assignee:dupuisf |
0-20327 5 hours ago |
7-66532 7 days ago |
7-66423 7 days |
| 35834 |
homeowmorphism author:homeowmorphism |
feat(Mathlib/GroupTheory/PresentedGroup): every group has a presentation |
We show that every group has a presentation defined by taking the free group with all of the group elements as the generators, and defining the relations as the kernel of the induced subjective homomorphism from that free group to the group itself.
Use of AI: This has been vibe-coded with GPT-Codex-5.3, was updated through review, and was double-checked by the author.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-group-theory
large-import
|
29/1 |
Mathlib/GroupTheory/PresentedGroup.lean |
1 |
12 |
['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'plp127', 'tb65536'] |
tb65536 assignee:tb65536 |
0-20326 5 hours ago |
3-63202 3 days ago |
3-63743 3 days |
| 35907 |
JJYYY-JJY author:JJYYY-JJY |
fix(Topology/Defs/Basic): preserve noncanonical topology instances in delaboration |
Preserve noncanonical topology instances in delaboration.
Restore local instances before checking whether topology arguments can be omitted during delaboration, and print `IsOpen[t]`, `IsClosed[t]`, `closure[t]`, and `Continuous[t₁, t₂]` when the topology instances are not canonical in the current local-instance context.
Previously, pretty-printing could silently drop noncanonical topology arguments, so declarations such as `LinearMap.mem_span_iff_continuous_of_finite` were rendered as if they used the default topology.
Closes #33238 |
t-topology
new-contributor
|
111/0 |
Mathlib/Topology/Defs/Basic.lean,MathlibTest/TopologyNonstandardNotation.lean |
2 |
4 |
['copilot-pull-request-reviewer', 'github-actions'] |
j-loreaux assignee:j-loreaux |
0-20326 5 hours ago |
4-11300 4 days ago |
4-11191 4 days |
| 35908 |
vihdzp author:vihdzp |
chore(FieldTheory/AbelRuffini): simpler definition of `solvableByRad` |
We redefine `solvableByRad F E` as the smallest intermediate field closed under n-th roots. This makes the predicate `IsSolvableByRad` redundant, and so we deprecate it.
We also private/remove various auxiliary results, and change the statement of the Abel-Ruffini theorem to be about an element of the field, rather than the subtype.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
134/164 |
Archive/Wiedijk100Theorems/AbelRuffini.lean,Mathlib/Algebra/Field/Subfield/Basic.lean,Mathlib/FieldTheory/AbelRuffini.lean,Mathlib/FieldTheory/IntermediateField/Adjoin/Defs.lean |
4 |
5 |
['github-actions', 'plp127', 'vihdzp'] |
riccardobrasca assignee:riccardobrasca |
0-20325 5 hours ago |
4-3976 4 days ago |
4-5036 4 days |
| 35910 |
LLaurance author:LLaurance |
chore(Probability): remove deprecated items, shorten proofs |
Remove deprecated items, shorten proofs, use dot notation where possible, style
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
63/129 |
Mathlib/Probability/Distributions/Exponential.lean,Mathlib/Probability/Distributions/Gamma.lean,Mathlib/Probability/Distributions/Geometric.lean,Mathlib/Probability/Distributions/Pareto.lean,Mathlib/Probability/Distributions/Poisson.lean,Mathlib/Probability/Distributions/Uniform.lean |
6 |
1 |
['github-actions'] |
EtienneC30 assignee:EtienneC30 |
0-20324 5 hours ago |
3-80032 3 days ago |
3-79923 3 days |
| 35916 |
themathqueen author:themathqueen |
feat(Analysis/CStarAlgebra): `IsIdempotentElem a ↔ spectrum R a ⊆ {0, 1}` |
... also adds a tfae for `IsStarProjection` in C*-algebras and that if `star x * x` is idempotent then so is `x * star x`.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
large-import
|
58/4 |
Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/Basic.lean,Mathlib/Analysis/CStarAlgebra/ContinuousFunctionalCalculus/NonUnital.lean,Mathlib/Analysis/CStarAlgebra/Projection.lean |
3 |
2 |
['github-actions', 'themathqueen'] |
j-loreaux assignee:j-loreaux |
0-20323 5 hours ago |
3-62759 3 days ago |
3-62842 3 days |
| 35944 |
euprunin author:euprunin |
chore: replace uses of `omega` with `lia` |
As [previously discussed](https://github.com/leanprover-community/mathlib4/pull/32666), the plan is to migrate from `omega` to `lia`, the linear integer arithmetic component of `grind`.
Trace profiling results (differences <30 ms considered measurement noise):
* `AnalyticAt.analyticOrderAt_sub_eq_one_of_deriv_ne_zero`: 1094 ms before, 979 ms after 🎉
* `CategoryTheory.Pretriangulated.shiftFunctorCompIsoId_op_inv_app`: unchanged 🎉
* `Lagrange.leadingCoeff_eq_sum`: unchanged 🎉
* `Finset.intervalGapsWithin_snd_of_lt`: unchanged 🎉
* `Finset.intervalGapsWithin_le_fst`: unchanged 🎉
* `Ideal.exists_radical_pow_le_of_fg`: unchanged 🎉
* `PowerSeries.coeff_X_mul_largeSchroderSeriesSeries_sq`: unchanged 🎉
---
[](https://gitpod.io/from-referrer/)
|
|
9/9 |
Mathlib/Analysis/Analytic/Order.lean,Mathlib/CategoryTheory/Triangulated/Opposite/Basic.lean,Mathlib/LinearAlgebra/Lagrange.lean,Mathlib/Order/Interval/Finset/Gaps.lean,Mathlib/RingTheory/Finiteness/Ideal.lean,Mathlib/RingTheory/PowerSeries/Schroder.lean |
6 |
1 |
['github-actions'] |
tb65536 assignee:tb65536 |
0-20322 5 hours ago |
3-29085 3 days ago |
3-28976 3 days |
| 36164 |
kim-em author:kim-em |
chore: remove set_option backward.isDefEq.respectTransparency false |
This PR removes some occurrences of `set_option backward.isDefEq.respectTransparency false` from Mathlib and related test files after moving to v4.29.0-rc4.
🤖 Prepared with Claude Code |
|
0/52 |
Archive/Imo/Imo2024Q6.lean,Mathlib/Algebra/Module/FinitePresentation.lean,Mathlib/Algebra/Order/Field/Rat.lean,Mathlib/Algebra/Order/Floor/Ring.lean,Mathlib/Algebra/Order/Ring/Abs.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Analysis/Calculus/FDeriv/Equiv.lean,Mathlib/Analysis/Distribution/SchwartzSpace/Fourier.lean,Mathlib/Analysis/MeanInequalities.lean,Mathlib/Analysis/RCLike/TangentCone.lean,Mathlib/Data/NNRat/Defs.lean,Mathlib/Data/Rat/Cast/Order.lean,Mathlib/FieldTheory/IntermediateField/Basic.lean,Mathlib/FieldTheory/PurelyInseparable/PerfectClosure.lean,Mathlib/GroupTheory/DivisibleHull.lean,Mathlib/LinearAlgebra/Alternating/Basic.lean,Mathlib/LinearAlgebra/Projectivization/Constructions.lean,Mathlib/LinearAlgebra/RootSystem/Base.lean,Mathlib/LinearAlgebra/RootSystem/GeckConstruction/Lemmas.lean,Mathlib/MeasureTheory/Integral/CurveIntegral/Basic.lean,Mathlib/MeasureTheory/Measure/CharacteristicFunction/TaylorExpansion.lean,Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic.lean,Mathlib/NumberTheory/Multiplicity.lean,Mathlib/NumberTheory/Niven.lean,Mathlib/NumberTheory/Padics/PadicIntegers.lean,Mathlib/NumberTheory/Pell.lean,Mathlib/NumberTheory/Rayleigh.lean,Mathlib/NumberTheory/Real/Irrational.lean,Mathlib/NumberTheory/SumFourSquares.lean,Mathlib/NumberTheory/Transcendental/Liouville/Measure.lean,Mathlib/RingTheory/NormalClosure.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean,Mathlib/RingTheory/PowerSeries/Exp.lean,Mathlib/RingTheory/Trace/Basic.lean,Mathlib/Topology/Algebra/Order/Field.lean |
35 |
2 |
['github-actions', 'kim-em'] |
nobody |
0-18413 5 hours ago |
0-18177 5 hours ago |
0-19099 5 hours |
| 33188 |
BryceT233 author:BryceT233 |
feat(RingTheory/MvPowerSeries): introduce rename |
This file establishes the `rename` operation on multivariate power series under a map with finite fibers,
which modifies the set of variables.
This file is patterned after `MvPolynomials/Rename.lean`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-ring-theory
large-import
|
415/1 |
Mathlib.lean,Mathlib/Data/Finsupp/Antidiagonal.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/Order/Filter/Cofinite.lean,Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Rename.lean |
8 |
45 |
['BryceT233', 'Komyyy', 'Ruben-VandeVelde', 'erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] |
erdOne and riccardobrasca assignee:riccardobrasca assignee:erdOne |
0-18337 5 hours ago |
0-33906 9 hours ago |
47-77773 47 days |
| 34513 |
urkud author:urkud |
feat(ContinuousAlternatingMap): generalize some definitions |
---
- [ ] depends on: #34491
[](https://gitpod.io/from-referrer/)
|
t-analysis |
126/72 |
Mathlib/Analysis/Normed/Module/Alternating/Basic.lean,Mathlib/Topology/Algebra/Module/Alternating/Topology.lean |
2 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-18229 5 hours ago |
0-18231 5 hours ago |
0-19940 5 hours |
| 35585 |
farmanb author:farmanb |
feat(CategoryTheory/Abelian/Preradical): add Stenström's colon construction for preradicals |
Given preradicals `Φ` and `Ψ` on an abelian category `C`, this file defines their **colon** `Φ : Ψ`
in the sense of Stenström. Categorically, `Φ : Ψ` is constructed objectwise as a pullback of the
canonical projection `Φ.π X : X ⟶ Φ.quotient.obj X` along the inclusion
`Functor.whiskerLeft Φ.quotient Ψ.ι`.
---
- [x] depends on: #35514
[](https://gitpod.io/from-referrer/)
|
t-category-theory
new-contributor
|
184/0 |
Mathlib.lean,Mathlib/CategoryTheory/Abelian/Preradical/Basic.lean,Mathlib/CategoryTheory/Abelian/Preradical/Colon.lean |
3 |
7 |
['farmanb', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-16898 4 hours ago |
0-16927 4 hours ago |
0-49922 13 hours |
| 36165 |
Parcly-Taxel author:Parcly-Taxel |
chore: deprecate `Nat.strongRec(On)'` |
In favour of Batteries's `Nat.strongRec` for definitions and `Nat.strong_induction_on` for proofs. |
|
34/66 |
Mathlib/Analysis/Analytic/Inverse.lean,Mathlib/Data/Int/GCD.lean,Mathlib/Data/Nat/Factorization/Induction.lean,Mathlib/Data/Nat/Init.lean,Mathlib/Data/Set/Finite/Basic.lean,Mathlib/Data/ZMod/Basic.lean,Mathlib/GroupTheory/SpecificGroups/Cyclic.lean,Mathlib/Topology/EMetricSpace/Paracompact.lean |
8 |
1 |
['github-actions'] |
nobody |
0-15829 4 hours ago |
0-15897 4 hours ago |
0-17903 4 hours |
| 34937 |
tannerduve author:tannerduve |
feat(Computability): semilattice instance on Turing degrees |
This PR equips `TuringDegree` with a `SemilatticeSup` structure by introducing the Turing join, proving usual least-upper-bound properties, and lifting these to degrees (quotients). In support of this, it extends the existing `RecursiveIn` API with some lemmas used in the degree theory.
The main contribution is the `SemilatticeSup` instance on `TuringDegree`. We define the Turing join as follows
```
turingJoin (f g) : ℕ → ℕ -- notation: f ⊕ g
```
and prove it is a least upper bound:
* `left_le_join`, `right_le_join`
* `join_le`
* monotonicity and congruence lemmas (`join_mono`, `join_congr`)
We lift this to degrees in `TuringDegree.sup`, `TuringDegree.le_sup_left`, `TuringDegree.le_sup_right`, and `TuringDegree.sup_le`
```
instance : SemilatticeSup TuringDegree
```
**New additions to `RecursiveIn.lean`:**
- `liftPrim`, `liftPrimrec`, `RecursiveIn'`, `ComputableIn`, `ComputableIn₂`: Encodes partial/total functions between `Primcodable` types as `ℕ →. ℕ`, analogous to `Partrec`/`Computable`.
- `of_eq`, `of_eq_tot`, `of_primrec`, `some`, `none`, `mono`, `subst`: Standard closure properties for `RecursiveIn`.
- `cond_const`, `cond_core_rfind`, `cond`, `ComputableIn.cond`: Shows `RecursiveIn` is closed under conditionals when the guard is absolutely computable
- `Nat.Partrec.recursiveIn`, `Computable.computableIn`: Every partrec/computable function is recursive in any oracle set.
Small addition to `Partrec`
we add to `Mathlib.Computability.Partrec` a small helper def (`Partrec.kronecker` and related `rfind` lemmas) representing the function that returns 1 if its two (unpaired) arguments are equal, and 0 otherwise, which is used in the proof of `cond`
## TODO
Some current `RecursiveIn` proofs such as `cond_core_rfind` still work directly with the inductive constructors and are thus very long. A follow up could add a combinator-style closure library by essentially relativizing all the results and lemmas in `Partrec`, and proofs could be golfed heavily as they are in `Partrec`
## Note: AI Usage
[Aleph prover](https://logicalintelligence.com/aleph-coding-ai/) was allowed to prove an earlier version of `cond_core_rfind`, which included stating and proving the lemma `cond_const` but the proofs have since been iterated on manually
Cursor was allowed to run git commands and edit docstrings/headers, and was used in setting up the module structure of the files |
t-computability
new-contributor
large-import
|
644/63 |
Mathlib/Computability/Partrec.lean,Mathlib/Computability/RecursiveIn.lean,Mathlib/Computability/TuringDegree.lean |
3 |
14 |
['eric-wieser', 'github-actions', 'plp127', 'tannerduve', 'vihdzp'] |
nobody |
0-15252 4 hours ago |
15-39419 15 days ago |
25-8970 25 days |
| 34119 |
themathqueen author:themathqueen |
feat(LinearAlgebra/Matrix/WithConv): `Matrix.toLin'` as a star-algebra equivalence between their convolutive rings |
`WithConv (Matrix m n α)` is ⋆-algebraically equivalent to `WithConv ((n → α) →ₗ m → α)`.
In particular, the convolutive product on linear maps corresponds to the Hadamard product on matrices and the intrinsic star on linear maps corresponds to taking the star of each element in the matrix.
---
- [x] depends on: #30880
- [x] depends on: #34111
- [x] depends on: #34312
- [x] depends on: #34600
- [x] depends on: #34601
- [x] depends on: #34945
- [x] depends on: #34997
[](https://gitpod.io/from-referrer/)
|
t-algebra
large-import
label:t-algebra$ |
91/2 |
Mathlib/Algebra/WithConv.lean,Mathlib/LinearAlgebra/Matrix/WithConv.lean,docs/references.bib |
3 |
63 |
['eric-wieser', 'github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'themathqueen'] |
ocfnash assignee:ocfnash |
0-14828 4 hours ago |
0-14889 4 hours ago |
7-85376 7 days |
| 35899 |
themathqueen author:themathqueen |
feat(Analysis): `extremePoints 𝕜 (closedBall 0 1) ⊆ sphere 0 1` |
... in a nontrivial normed space, with equality in a nontrivial strictly convex space.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
large-import
|
88/0 |
Mathlib.lean,Mathlib/Analysis/Convex/StrictConvex/Extreme.lean,Mathlib/Analysis/RCLike/Basic.lean |
3 |
4 |
['ADedecker', 'github-actions', 'themathqueen'] |
j-loreaux assignee:j-loreaux |
0-14704 4 hours ago |
0-44244 12 hours ago |
4-15722 4 days |
| 36121 |
LLaurance author:LLaurance |
chore(Analysis): shorten proofs |
Golf, shorten, etc.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
231/399 |
Mathlib/Analysis/Calculus/Deriv/Inv.lean,Mathlib/Analysis/Calculus/Deriv/Mul.lean,Mathlib/Analysis/Calculus/FDeriv/Add.lean,Mathlib/Analysis/Calculus/FDeriv/Analytic.lean,Mathlib/Analysis/Calculus/FDeriv/Basic.lean,Mathlib/Analysis/Calculus/FDeriv/Norm.lean,Mathlib/Analysis/Calculus/LHopital.lean,Mathlib/Analysis/Calculus/MeanValue.lean,Mathlib/Analysis/Calculus/Monotone.lean,Mathlib/Analysis/ODE/Gronwall.lean,Mathlib/Analysis/ODE/PicardLindelof.lean |
11 |
1 |
['github-actions'] |
nobody |
0-14639 4 hours ago |
unknown |
0-0 0 seconds |
| 36162 |
SnirBroshi author:SnirBroshi |
chore(Data/Finsupp/Defs): make `Finsupp.onFinset` computable |
Deleted the `noncomputable section` to let every `def` choose whether it's computable, and replaced the use of `Classical.decEq` in `onFinset_support` and `onFinset` with a `[DecidableEq M]` assumption.
---
[Zulip](https://leanprover.zulipchat.com/#narrow/channel/113489-new-members/topic/Finsupp.20noncomputability/with/576412101)
[](https://gitpod.io/from-referrer/)
|
t-data |
43/33 |
Mathlib/Algebra/BigOperators/Finsupp/Basic.lean,Mathlib/Algebra/Polynomial/Derivative.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/Defs.lean,Mathlib/Data/Finsupp/ToDFinsupp.lean,Mathlib/Data/Sym/Sym2/Finsupp.lean,Mathlib/FieldTheory/PurelyInseparable/Tower.lean,Mathlib/LinearAlgebra/Finsupp/LinearCombination.lean |
8 |
1 |
['github-actions'] |
nobody |
0-12318 3 hours ago |
0-22622 6 hours ago |
0-24256 6 hours |
| 36140 |
RemyDegenne author:RemyDegenne |
feat: `FiniteUnion` |
Add the property for a set of sets to be closed by finite unions. This is the analogue of the existing `FiniteInter` for unions. It will be used with compact systems in the proof of Kolmogorov's extension theorem.
- add the new definition
- rename some of the intersection lemmas
- golf a few existing proofs slightly
---
[](https://gitpod.io/from-referrer/)
|
|
89/25 |
Mathlib/Data/Set/Constructions.lean,Mathlib/Topology/Bases.lean,Mathlib/Topology/Category/Compactum.lean |
3 |
4 |
['SnirBroshi', 'gasparattila', 'github-actions'] |
nobody |
0-11936 3 hours ago |
0-58584 16 hours ago |
0-58475 16 hours |
| 36105 |
LLaurance author:LLaurance |
chore(Algebra): shorten proofs, style |
Golf, avoid terminal `simp only`, use namespaces where available, etc.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
119/165 |
Mathlib/Algebra/CubicDiscriminant.lean,Mathlib/Algebra/DualQuaternion.lean,Mathlib/Algebra/Exact.lean,Mathlib/Algebra/Free.lean,Mathlib/Algebra/FreeAlgebra.lean,Mathlib/Algebra/Star/Basic.lean,Mathlib/Algebra/Star/Center.lean,Mathlib/Algebra/Star/CentroidHom.lean |
8 |
1 |
['github-actions'] |
nobody |
0-11862 3 hours ago |
unknown |
0-0 0 seconds |
| 35646 |
BryceT233 author:BryceT233 |
feat(Algebra): add two lemmas about submodule smul |
This is the first PR split from the larger PR #34936 to make the review process easier.
It adds the following two lemmas regarding pointwise smul and restrictScalars: `Submodule.restrictScalars_image_smul_eq_smul_restrictScalars` and `Submodule.restrictScalars_map_smul_eq_smul_restrictScalars`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
label:t-algebra$ |
29/0 |
Mathlib/Algebra/Algebra/Operations.lean,Mathlib/RingTheory/Ideal/Maps.lean |
2 |
4 |
['github-actions', 'joneugster'] |
nobody |
0-11070 3 hours ago |
10-62656 10 days ago |
10-62547 10 days |
| 36019 |
stepan2698-cpu author:stepan2698-cpu |
chore: update undergrad.yaml |
Adds links to various algebraic subjects which are listed in undergrad.yaml as missing from mathlib.
---
[](https://gitpod.io/from-referrer/)
|
|
12/12 |
docs/undergrad.yaml |
1 |
2 |
['SnirBroshi', 'github-actions'] |
nobody |
0-10867 3 hours ago |
2-16753 2 days ago |
2-16644 2 days |
| 34507 |
metakunt author:metakunt |
feat(NumberTheory/AKSPrimality): Adds the AKS primality test |
Adds the completed proof for the AKS primality test.
Everything except the final theorem is marked private as it's only needed for the final proof.
Also everything except the final theorem is namespaced with AKS.
----
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Aks.20primality.20Theorem.206.2E1.20Claim.20.28i.29.20proven |
t-number-theory |
653/0 |
Mathlib.lean,Mathlib/NumberTheory/AKSPrimality.lean |
2 |
35 |
['github-actions', 'jcommelin', 'kim-em', 'metakunt', 'qawbecrdtey', 'vihdzp'] |
kim-em assignee:kim-em |
0-10519 2 hours ago |
6-4676 6 days ago |
9-78139 9 days |
| 35673 |
Parcly-Taxel author:Parcly-Taxel |
feat: radical lemmas for natural numbers and integers |
These are needed as part of a project I'm doing for my PhD under Frank Stephan. |
t-ring-theory
large-import
|
88/20 |
Mathlib.lean,Mathlib/RingTheory/Radical.lean,Mathlib/RingTheory/Radical/NatInt.lean |
3 |
32 |
['Parcly-Taxel', 'github-actions', 'mathlib-merge-conflicts', 'riccardobrasca', 'vihdzp'] |
nobody |
0-8424 2 hours ago |
0-8483 2 hours ago |
8-31042 8 days |
| 34099 |
mcdoll author:mcdoll |
feat(Analysis/Distribution): Fourier multiplier |
We define Fourier multiplier with temperate growth functions acting on Schwartz functions as well as tempered distributions.
We prove that the directional derivative and the Laplacian can be represented as Fourier multiplier.
---
- [x] depends on: #34100
- [x] depends on: #34285
- [x] depends on: #34294
[](https://gitpod.io/from-referrer/)
|
t-analysis |
217/0 |
Mathlib.lean,Mathlib/Analysis/Distribution/FourierMultiplier.lean |
2 |
4 |
['Parcly-Taxel', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
ADedecker assignee:ADedecker |
0-8353 2 hours ago |
31-2909 31 days ago |
31-3332 31 days |
| 36104 |
LarsenClose author:LarsenClose |
feat(CategoryTheory/Endofunctor/Algebra): add Adámek's initial algebra theorem |
Adds Adámek's initial algebra theorem for endofunctors on categories
with an initial object. Given `F : C ⥤ C` where `C` has an initial
object, if the initial chain `⊥ → F(⊥) → F²(⊥) → ⋯` has a colimit
preserved by `F`, then `F` has an initial algebra whose structure map
is an isomorphism.
New files:
- `InitialChain.lean`: defines `iterateObj F n`, `iterateMap F n`,
and `initialChain F : ℕ ⥤ C` via `Functor.ofSequence`.
- `ChainShift.lean`: constructs `shiftCocone` and `extendCocone`,
proves `shiftCoconeIsColimit` (shifted cocone inherits colimit).
- `Adamek.lean`: main result. Constructs the initial `F`-algebra
`adamek F c hc` and proves `adamek_isInitial`. Convenience API:
`adamekFromInitial`, `adamekStructureIso`, `adamekFixedPoint`.
0 sorry. References Adámek 1974.
--- |
t-category-theory
new-contributor
|
505/0 |
Mathlib.lean,Mathlib/CategoryTheory/Endofunctor/Algebra/Adamek.lean,Mathlib/CategoryTheory/Endofunctor/Algebra/ChainShift.lean,Mathlib/CategoryTheory/Endofunctor/Algebra/InitialChain.lean,docs/references.bib |
5 |
2 |
['github-actions'] |
nobody |
0-5832 1 hour ago |
0-5897 1 hour ago |
0-5902 1 hour |
| 36168 |
SnirBroshi author:SnirBroshi |
feat(Order/ConditionallyCompleteLattice/Indexed): `f i j ≤ ⨆ (i) (j), f i j` |
Add `le_ciSup₂`/`ciInf₂_le` to match `CompleteLattice`'s `le_iSup₂`/`iInf₂_le`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
28/0 |
Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
1 |
1 |
['github-actions'] |
nobody |
0-5820 1 hour ago |
0-5897 1 hour ago |
0-5788 1 hour |
| 35912 |
WenrongZou author:WenrongZou |
feat(RingTheory/FormalGroup): definition and examples of formal group |
---
Definition of one dimensional formal group law over commutative ring and some examples of formal group law.
[](https://gitpod.io/from-referrer/)
|
t-ring-theory |
204/0 |
Mathlib.lean,Mathlib/RingTheory/FormalGroup/Basic.lean,docs/references.bib |
3 |
8 |
['WenrongZou', 'github-actions', 'wwylele'] |
erdOne assignee:erdOne |
0-4864 1 hour ago |
0-4863 1 hour ago |
3-72924 3 days |
| 34742 |
Brian-Nugent author:Brian-Nugent |
feat(SheafCohomology): add API for Sheaf Cohomology |
Defines the long exact sequence on cohomology associated to a short exact sequence of sheaves `H.longSequence`. Also defines `H.equiv₀`, the additive equivalence between `H F 0` and `((sheafSections J AddCommGrpCat).obj (op T)).obj F` when the category has a terminal object `T`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
large-import
t-category-theory
|
118/2 |
Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean |
3 |
22 |
['Brian-Nugent', 'adamtopaz', 'dagurtomas', 'github-actions', 'joelriou', 'joneugster'] |
adamtopaz assignee:adamtopaz |
0-4816 1 hour ago |
0-21844 6 hours ago |
22-64954 22 days |
| 35943 |
SnirBroshi author:SnirBroshi |
feat(Analysis/Complex/Trigonometric): `cos(2x) = 1 - 2 * sin(x)^2` |
This is one of the 3 commonly used forms of the cosine double-angle formula.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
6/0 |
Mathlib/Analysis/Complex/Trigonometric.lean |
1 |
5 |
['SnirBroshi', 'github-actions', 'vihdzp'] |
nobody |
0-2767 46 minutes ago |
3-30469 3 days ago |
3-30360 3 days |
| 36166 |
wwylele author:wwylele |
feat(Data/Nat): formula for cardinal of finsuppAntidiag on Nat |
This is introduced in a new file because the proof uses lemma from `Mathlib.Data.Nat.Choose.Sum`, which imports `Field` and `Mathlib.Algebra.Order.Antidiag.Finsupp` forbids it. I tried attaching the lemma to `Mathlib.Algebra.Order.Antidiag.Finsupp` by shuffling imports, but it quickly blows up in many downstream files.
---
[](https://gitpod.io/from-referrer/)
|
|
65/0 |
Mathlib.lean,Mathlib/Data/Nat/Choose/Antidiag.lean |
2 |
4 |
['BryceT233', 'copilot-pull-request-reviewer', 'github-actions'] |
nobody |
0-2508 41 minutes ago |
0-16373 4 hours ago |
0-16547 4 hours |
| 36170 |
SproutSeeds author:SproutSeeds |
feat(ContMDiff): add smooth scalar-action typeclasses |
Closes #5617
Add `SmoothConstSMul` and `SmoothSMul` in `Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean`.
Add bridge instance `SmoothSMul.smoothConstSMul` to derive smooth constant scalar multiplication from smooth scalar multiplication.
Validation: targeted `lake build` and `lake exe runLinter --trace` passed, and local viability/overlap/naturality/local-gate/ready-to-draft checks passed.
Intelligent systems usage: tool=Codex; model=Codex 5.3; effort=extra high; workflow=ORP local-first gates (viability/overlap/naturality/targeted build+linter/draft CI); scope=drafting/refactoring/proof exploration including PR description drafting; final code choices and validation by me.
---
Happy to adjust naming, placement, or proof style based on maintainer preference.
|
t-differential-geometry
new-contributor
|
35/1 |
Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean |
1 |
2 |
['github-actions'] |
nobody |
0-2091 34 minutes ago |
unknown |
0-0 0 seconds |
| 35707 |
BryceT233 author:BryceT233 |
feat(RingTheory/MvPowerSeries): introduce `truncTotal` |
This PR introduces the total degree truncation of multivariate formal power series when the index is finite, and uses it to establish the algebraic equivalence between `MvPowerSeries` and the adic completion of `MvPolynomial` with respect to the ideal spanned by all variables `idealOfVars`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-ring-theory
|
214/2 |
Mathlib.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean |
4 |
6 |
['BryceT233', 'github-actions', 'joneugster', 'mathlib-bors', 'wwylele'] |
nobody |
0-1751 29 minutes ago |
0-14125 3 hours ago |
8-83307 8 days |
| 36169 |
SnirBroshi author:SnirBroshi |
feat(Order/ConditionallyCompleteLattice/Indexed): `iSup` of `sup`s vs `sup` of `iSup`s |
`ciSup_sup_eq`/`ciInf_inf_eq` match `CompleteLattice`'s `iSup_sup_eq`/`iInf_inf_eq`, and in a `ConditionallyCompleteLinearOrder` we get an inequality without any bounded assumptions.
`Finset.ciSup_union'` for `ConditionallyCompleteLinearOrderBot` matches `CompleteLattice`'s `Finset.iSup_union`.
---
[](https://gitpod.io/from-referrer/)
|
t-order |
39/0 |
Mathlib/Order/ConditionallyCompleteLattice/Finset.lean,Mathlib/Order/ConditionallyCompleteLattice/Indexed.lean |
2 |
1 |
['github-actions'] |
nobody |
0-1717 28 minutes ago |
0-1932 30 minutes ago |
0-3538 58 minutes |
| 35600 |
yisiox author:yisiox |
Add implementation of Kleene's algorithm to show each regular language has a regex matching it |
This PR adds a proof that every regular language has some regular expression matching it.
This was achieved by the following constructions and proofs of their correctness
- Define `toSingleεNFA` to transform any epsilon-NFA to an equivalent one with only a single start and accept state (and the type is `ExtendedState`)
- Define a bijection between `ExtendedState` and `Fin (FinEnum.card (ExtendedState σ))` to index the states
- Define `pathRegex` which implements Kleene's algorithm
- Define `toRegex` which takes an epsilon-NFA, applies `toSingleεNFA` on it, and computes the corresponding regex using `pathRegex`
The proofs of correctness chain together to yield `(toRegex M).matches' = M.accepts` which asserts the direction of Kleene's theorem required.
---
[](https://gitpod.io/from-referrer/)
|
t-computability
new-contributor
|
499/0 |
Mathlib/Computability/EpsilonNFA.lean |
1 |
2 |
['github-actions'] |
nobody |
0-890 14 minutes ago |
unknown |
0-0 0 seconds |
| 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 |
| 33817 |
FlAmmmmING author:FlAmmmmING |
fix(Combinatorics/Enumerative/Schroder.lean): Fix the definition and theorem of smallSchroder. |
In the previous definition, the small Schröder numbers were defined as
```LaTeX
s_0 = 1, s_1 = 1, s_2 = 1, s_3 = 3...
```
, which does not match the sequence listed in OEIS A006318. Moreover, this definition makes it difficult to correctly write the generating function for the small Schröder numbers. This PR fixes this issue.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-combinatorics
large-import
|
61/39 |
Mathlib/Combinatorics/Enumerative/Schroder.lean |
1 |
19 |
['FlAmmmmING', 'github-actions', 'vihdzp'] |
awainverse assignee:awainverse |
34-20235 1 month ago |
49-9511 49 days ago |
53-60859 53 days |
| 34227 |
stepan2698-cpu author:stepan2698-cpu |
feat: If sum of densities is at least one, the sumset covers the naturals |
Proves an outstanding TODO item from Mathlib.Combinatorics.Schnirelmann : shows that if the sum of two densities is at least one, the sumset covers the positive naturals.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
51/1 |
Mathlib/Combinatorics/Schnirelmann.lean |
1 |
3 |
['github-actions', 'grunweg', 'kbuzzard'] |
awainverse assignee:awainverse |
34-20232 1 month ago |
42-26607 42 days ago |
42-40601 42 days |
| 34028 |
floor-licker author:floor-licker |
feat(SimpleGraph): add max-flow/min-cut weak duality |
This PR introduces a basic s–t flow setup for undirected SimpleGraphs and proves the standard weak-duality
inequality: for any feasible flow f and any s–t cut S, value f ≤ cutCapacity S.
This is a small, self-contained lemma I extracted while working on larger graph-theoretic formalizations, in particular, results that will ultimately rely on a full max-flow/min-cut theorem. The full MFMC equality/existence statement is not included here. This is the weak-duality direction (∀ f S, value f ≤ cutCapacity S).
|
t-combinatorics
new-contributor
|
169/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/MaxFlowMinCut.lean |
2 |
13 |
['SnirBroshi', 'floor-licker', 'github-actions'] |
kmill assignee:kmill |
33-20242 1 month ago |
46-37931 46 days ago |
46-41033 46 days |
| 33520 |
NoneMore author:NoneMore |
feat(ModelTheory/ElementarySubstructures): add a variant of Tarski-Vaught test taking sets as input |
There should exist an `ElementarySubstructure.copy` such that we can directly bundle the set itself instaed of its closure as an elementary substructure.
The other direction depends on #33458.
---
[](https://gitpod.io/from-referrer/)
|
t-logic
new-contributor
|
55/0 |
Mathlib/ModelTheory/ElementarySubstructures.lean |
1 |
3 |
['Citronhat', 'NoneMore', 'github-actions'] |
awainverse assignee:awainverse |
32-20193 1 month ago |
60-69814 60 days ago |
60-69705 60 days |
| 34375 |
jvanwinden author:jvanwinden |
feat(MeasureTheory/Function/AEEqOfLIntegral): introduce lemmas for rewriting a.e. inequalities |
Introduce the following lemmas:
- ae_le_const_iff_forall_gt_imp_ae_lt,
- ae_const_le_iff_forall_lt_imp_ae_gt,
- ae_le_const_iff_forall_gt_imp_ae_le,
- ae_const_le_iff_forall_lt_imp_ae_ge,
which can be used get an epsilon of room in a.e. inequalities, with the epsilon being outside the a.e. quantifier. The 'le/ge' variants require a dense ordering.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
24/0 |
Mathlib/MeasureTheory/Function/AEEqOfLIntegral.lean |
1 |
4 |
['github-actions', 'jvanwinden', 'urkud'] |
kex-y assignee:kex-y |
29-54034 1 month ago |
39-56516 39 days ago |
39-56407 39 days |
| 32570 |
ksenono author:ksenono |
feat(Combinatorics/SimpleGraph): bipartite subgraphs and vertex-disjoint graphs for Konig's theorem |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
22/0 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/Subgraph.lean |
2 |
19 |
['SnirBroshi', 'github-actions', 'jcommelin', 'ksenono', 'vlad902'] |
kmill assignee:kmill |
29-30002 1 month ago |
29-30002 29 days ago |
81-66096 81 days |
| 34191 |
IlPreteRosso author:IlPreteRosso |
feat(Topology/Algebra/InfiniteSum): Discrete Convolution API 1st PR |
Defines the very basics of the discrete convolution API. In analogy with [MeasureTheory.Convolution](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Analysis/Convolution.html#MeasureTheory.convolution).
Main definitions include
- `mulFiber`, `convolution`, `ConvolutionExists`, `ConvolutionExists.add_distrib`, `ConvolutionExistsAt.smul_convolution`, `mulFiber_swapEquiv`, `convolution_comm`
RM:
- The main docstring is *as is*
- Next step is triple sum intrastrcutre + `assoc` theorems for convolution (long)
Continues the work from #33411 and #33410 (splitting into shorter PRs, carries over the modifications from previous reviews) |
t-topology
new-contributor
|
277/0 |
Mathlib.lean,Mathlib/Topology/Algebra/InfiniteSum/DiscreteConvolution.lean |
2 |
18 |
['IlPreteRosso', 'github-actions', 'j-loreaux'] |
PatrickMassot assignee:PatrickMassot |
28-49108 1 month ago |
28-49303 28 days ago |
37-50877 37 days |
| 34709 |
dennj author:dennj |
feat(Analysis/ODE): add discrete Grönwall inequality |
## Summary
Add discrete Grönwall inequality to `Mathlib/Analysis/ODE/DiscreteGronwall.lean`
Provides bounds for recurrence inequalities of the form `u(n+1) ≤ c(n) * u(n) + b(n)`
### Main results
- `discrete_gronwall_prod_general`: Product form working over any linearly ordered commutative ring
- `prod_one_add_Ico_mono`: Auxiliary lemma for product comparisons over subintervals
- `discrete_gronwall`: Classical exponential bound `u(n) ≤ (u(n₀) + ∑ b(k)) * exp(∑ c(i))` (ℝ-specific)
- `discrete_gronwall_Ico`: Uniform bound over a finite interval (ℝ-specific)
## Related work
Complements the continuous Grönwall inequality in `Mathlib.Analysis.ODE.Gronwall`
## References
* Grönwall, T. H. (1919). "Note on the derivatives with respect to a parameter of the solutions of a system of differential equations". *Annals of Mathematics*, 20(4), 292–296.
|
t-analysis
new-contributor
|
174/0 |
Mathlib.lean,Mathlib/Analysis/ODE/DiscreteGronwall.lean |
2 |
1 |
['github-actions'] |
ADedecker assignee:ADedecker |
27-20326 27 days ago |
31-9761 31 days ago |
31-9652 31 days |
| 34182 |
IlPreteRosso author:IlPreteRosso |
feat(Data/Finsupp/Single, Data/Finsupp/Indicator): Add set_indicator_singleton, indicator_singleton; golfed single_eq_set_indicator, single_eq_indicator |
[Mathlib.Data.Finsupp.Single](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finsupp/Single.html#Finsupp.single)
- Add `set_indicator_singleton`, golfed `single_eq_set_indicator`
[Mathlib.Data.Finsupp.Indicator](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Data/Finsupp/Indicator.html#Finsupp.indicator_apply)
- Add `indicator_singleton`, golfed `single_eq_indicator`
Continues the work from #34095 |
large-import
t-data
new-contributor
|
17/17 |
Mathlib/Data/Finsupp/Indicator.lean,Mathlib/Data/Finsupp/Single.lean |
2 |
29 |
['IlPreteRosso', 'eric-wieser', 'github-actions', 'mathlib-bors', 'urkud'] |
eric-wieser and urkud assignee:urkud assignee:eric-wieser |
26-50019 26 days ago |
43-8636 43 days ago |
43-16520 43 days |
| 34093 |
YellPika author:YellPika |
feat(Order/OmegaCompletePartialOrder): add `OmegaCompletePartialOrder` instance for `Option` with basic `ωScottContinuous` lemmas |
---
- [x] depends on: #33941
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
297/0 |
Mathlib.lean,Mathlib/Data/Option/Order.lean,Mathlib/Order/Monotone/Basic.lean,Mathlib/Order/OmegaCompletePartialOrder.lean |
4 |
5 |
['YellPika', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
pechersky assignee:pechersky |
24-20312 24 days ago |
29-2648 29 days ago |
29-5503 29 days |
| 26985 |
agjftucker author:agjftucker |
feat(Analysis/Calculus/ImplicitFunction): define implicitFunctionOfProdDomain |
This PR continues the work from #16743.
Original PR: https://github.com/leanprover-community/mathlib4/pull/16743
---
- [x] depends on: #28352
[](https://gitpod.io/from-referrer/) |
t-analysis
new-contributor
|
269/157 |
Mathlib.lean,Mathlib/Analysis/Calculus/Implicit.lean,Mathlib/Analysis/Calculus/ImplicitContDiff.lean,Mathlib/Analysis/Calculus/ImplicitFunction/ProdDomain.lean |
4 |
27 |
['agjftucker', 'github-actions', 'j-loreaux', 'mathlib-bors', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'winstonyin'] |
hrmacbeth assignee:hrmacbeth |
22-82171 22 days ago |
22-82171 22 days ago |
91-14114 91 days |
| 32744 |
NoneMore author:NoneMore |
feat(ModelTheory/Definablity): add `DefinableFun` definition and lemmas |
This PR adds two basic shapes of definable sets and `DefinableFun` definition with relevant lemmas.
The main result is `Set.Definable.preimage_of_map` asserting that the preimage of a definable set under a definable map is definable.
There are also some tool lemmas derived by the preimage lemma.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-logic
|
147/0 |
Mathlib/ModelTheory/Definability.lean |
1 |
59 |
['NoneMore', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator'] |
awainverse assignee:awainverse |
22-76207 22 days ago |
54-85927 54 days ago |
82-38082 82 days |
| 34481 |
DAE123456 author:DAE123456 |
feat: Ore's Theorem |
Ore Theorem : Let G be a graph of order n ≥ 3 that satisfies the Ore property. Then G has a Hamilton cycle. |
t-combinatorics
new-contributor
|
3372/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Ore.lean |
2 |
25 |
['DAE123456', 'LLaurance', 'Ruben-VandeVelde', 'YaelDillies', 'github-actions', 'kim-em', 'tb65536', 'vlad902'] |
b-mehta assignee:b-mehta |
22-20158 22 days ago |
30-75173 30 days ago |
34-40178 34 days |
| 34722 |
GrigorenkoPV author:GrigorenkoPV |
feat(Data/Finset/RangeDistance): add |
---
Rebase of https://github.com/leanprover-community/mathlib4/pull/26347
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-data
|
34/0 |
Mathlib.lean,Mathlib/Algebra/Order/Group/Unbundled/Abs.lean,Mathlib/Data/Finset/RangeDistance.lean |
3 |
4 |
['GrigorenkoPV', 'github-actions', 'joneugster', 'plp127'] |
TwoFX assignee:TwoFX |
22-20154 22 days ago |
30-60965 30 days ago |
30-62761 30 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 submersions.
|
t-differential-geometry
new-contributor
|
596/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Submersion.lean |
2 |
2 |
['github-actions'] |
grunweg assignee:grunweg |
21-56574 21 days ago |
21-58348 21 days ago |
21-59654 21 days |
| 32807 |
WilliamCoram author:WilliamCoram |
feat: Define the Gauss norm for MvPowerSeries |
We adjust the current definition for Gauss norm on power series to work for multivariate power series.
If this seems acceptable I can refactor the single variable case.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
new-contributor
|
124/0 |
Mathlib.lean,Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean |
2 |
25 |
['WilliamCoram', 'erdOne', 'fbarroero', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] |
alreadydone assignee:alreadydone |
19-60592 19 days ago |
19-60658 19 days ago |
32-68411 32 days |
| 35017 |
robo7179 author:robo7179 |
feat(Combinatorics/SimpleGraph/Acyclic): add every nontrivial tree has atleast two leaves |
Added two theorems to prove that every non trivial tree has atleast two leaves (one in Finite the other in Acyclic).
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
94/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Finite.lean |
2 |
24 |
['IvanRenison', 'SnirBroshi', 'github-actions', 'robo7179'] |
nobody |
16-34172 16 days ago |
16-36424 16 days ago |
22-44340 22 days |
| 34578 |
dennj author:dennj |
feat: define Boolean circuits over abstract gate families |
This PR introduces a foundation for Boolean circuits parameterized by abstract gate families.
## Main definitions
- `GateEval`: typeclass for gate families with Boolean semantics
- `GateHom`: arity-preserving maps between gate families
- `Circuit`: inductive type representing circuit syntax trees
- `AC0Gate`, `ACC0Gate`, `TC0Gate`: standard complexity-theoretic gate bases
## Design notes
The key design choice is to keep **syntax** (gate labels `G : Nat → Type`) separate from
**semantics** (`GateEval.eval`), allowing users to define custom gate families (e.g., MAJ, XOR,
arbitrary threshold gates) without modifying core definitions.
### Tree vs DAG representation
We evaluated two approaches for circuit representation:
1. **Tree-based** (this PR): Circuits as inductive syntax trees
2. **DAG-based**: Circuits as lists of gates with index-based references
We chose tree-based circuits because:
- **Compositionality**: Easy to build circuits via `gate g (fun i => subcircuit i)`
- **Type safety**: Arity-indexed gates (`G : Nat → Type`) catch errors at compile time
- **Manipulation**: Natural support for `mapGate`, `subst`, `mapInputs`
- **Mathlib philosophy**: Aligns with structural/compositional reasoning patterns
For use cases requiring explicit sharing (complexity analysis, evaluation efficiency),
a separate `DAG` type can be added later with proven equivalence via `Circuit.toDAG`.
The current representation serves as a minimal foundation for size/depth measures,
circuit families, and complexity classes (AC0, ACC0, TC0).
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-computability
|
919/0 |
Mathlib.lean,Mathlib/Computability/Circuit/Basic.lean,Mathlib/Computability/Formula/Basic.lean,Mathlib/Computability/Gate.lean |
4 |
18 |
['LLaurance', 'YuvalFilmus', 'dennj', 'github-actions'] |
nobody |
16-13776 16 days ago |
16-13776 16 days ago |
23-52894 23 days |
| 34851 |
dennj author:dennj |
feat(Data/Matrix/Mul): add diagonal and transpose lemmas for vector operations |
This adds three lemmas for matrix-vector operations that serve as foundational support for future ML formalization:
- `vecMul_diagonal_dotProduct`: weighted inner product `x ᵥ* diagonal d ⬝ᵥ y = ∑ i, d i * x i * y i`
- `dotProduct_transpose_mulVec`: bilinear form symmetry `x ⬝ᵥ Aᵀ *ᵥ y = y ⬝ᵥ A *ᵥ x`
- `mul_diagonal_mulVec`: column-weighted sum `(A * diagonal d) *ᵥ x = ∑ i, (d i * x i) • A.col i`
These are basic linear algebra identities involving diagonal matrices and vector operations that appear frequently in machine learning contexts (weighted inner products, attention mechanisms, feature scaling, diagonal preconditioning). |
t-data
new-contributor
|
22/0 |
Mathlib/Data/Matrix/Mul.lean |
1 |
5 |
['dennj', 'eric-wieser', 'github-actions', 'themathqueen'] |
pechersky assignee:pechersky |
15-26336 15 days ago |
28-35812 28 days ago |
28-35703 28 days |
| 28546 |
Sfgangloff author:Sfgangloff |
feat(SymbolicDynamics): basic setup of Zd, full shift, cylinders, pat… |
This PR adds a **group-generic** foundation for symbolic dynamics over an arbitrary group `G`, together with convenient specializations for `ℤ` and `ℤ^d`.
Summary of additions:
- **Full shift and shift action**
- `abbrev FullShift (A G) := G → A` (inherits product topology from the Π-type).
- Right shift `shift g x` with convention `(shift g x) h = x (h * g)`.
- **Cylinders and topology**
- `cylinder U x : Set (G → A)` for finite `U : Finset G`.
- Cylinders are open under `[DiscreteTopology A]`; with a finite alphabet they are also closed.
- Equality with dependent products:
`cylinder U x = Set.pi (↑U) (fun i => ({x i} : Set A))`, enabling use of the `Set.pi` API.
- **Patterns, occurrences, and subshifts**
- `Pattern A G` with finite `support : Finset G` and `data : support → A`.
- `Pattern.occursIn p x g` (occurrence at translate `g`) and the expected shift law.
- `forbids F` and `Subshift A G` (closed, shift-invariant subsets).
- `FixedSupport A G U` with an equivalence to `(U → A)` to obtain finiteness.
- **Language on finite shapes and counting**
- `languageOn X U`, `languageCardOn X U`, and `patternCountOn Y U`.
- **Entropy along a shape sequence**
- `limsupAtTop` (as an `sInf` of eventual upper bounds).
- `entropyAlong X F hF := limsup (log (patternCountOn X (F n) + 1) / |F n|)`
for any nonempty finite shapes `F : ℕ → Finset G` (the `+ 1` avoids `log 0`).
- **Specializations**
- `IntShapes`: segments `[-n,n]` on `Multiplicative ℤ`, with `entropy_Z`.
- `ZdShapes`: boxes `[-n,n]^d` on `ℤ^d` (as functions `Fin d → ℤ`), with `entropy_Zd`.
Mathematical remarks:
- The API is **shape-parametric**: entropy is defined along user-provided finite shapes.
- On **amenable** groups, using a **Følner** sequence yields a canonical value (Ornstein–Weiss).
This PR does not assume amenability; the family of shapes is an explicit input.
Motivation:
Provide a clean, reusable base for symbolic dynamics on groups in mathlib.
Future work:
- Add a Følner predicate and prove shape-independence / limit existence on amenable groups.
- Expand the `ℤ`/`ℤ^d` toolkit (alternative shapes, mixing, factors).
- Develop 1D theory and, longer-term, multidimensional SFT results (e.g. along the lines of Hochman–Meyerovitch).
|
t-dynamics
new-contributor
|
746/0 |
Mathlib.lean,Mathlib/Dynamics/SymbolicDynamics/Basic.lean,Mathlib/Tactic/Translate/ToAdditive.lean |
3 |
180 |
['Sfgangloff', 'botbaki-review', 'eric-wieser', 'github-actions', 'kckennylau', 'mathlib4-merge-conflict-bot', 'sgouezel'] |
sgouezel assignee:sgouezel |
15-21805 15 days ago |
16-21103 16 days ago |
119-66864 119 days |
| 34954 |
brianrabern author:brianrabern |
feat(Combinatorics/SimpleGraph/Acyclic): add colorable and chromaticN… |
…umber bridges for acyclic and tree graphs
Add thin bridge lemmas expressing that acyclic graphs (forests) and trees
are 2-colorable, and that their chromatic number is at most 2, directly
in terms of `Colorable` and `chromaticNumber`.
The existing `IsAcyclic.isBipartite` already proves this via the
definitional equality `IsBipartite = Colorable 2`, but these bridges
improve discoverability for users who reason about `Colorable` or
`chromaticNumber` without passing through `IsBipartite`.
This is a first step toward building out the graph coloring API.
New declarations:
- `IsAcyclic.colorable_two`
- `IsTree.colorable_two`
- `IsAcyclic.chromaticNumber_le_two`
- `IsTree.chromaticNumber_le_two`
All are one-line proofs reusing existing results; no new imports needed.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
16/0 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean |
1 |
1 |
['github-actions'] |
b-mehta assignee:b-mehta |
13-20331 13 days ago |
25-44276 25 days ago |
25-44167 25 days |
| 35451 |
samueloettl author:samueloettl |
feat(MeasureTheory.Function): compMeasurePreserving_iterate |
---
These are useful for dynamics/ergodic theory.
Possibly some of these could be simp lemmas but I'm not confident enough to say that they are so I didn't mark them as such.
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
32/0 |
Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean |
2 |
2 |
['github-actions'] |
RemyDegenne assignee:RemyDegenne |
12-20328 12 days ago |
15-49926 15 days ago |
15-49817 15 days |
| 34966 |
Deep0Thinking author:Deep0Thinking |
feat(MeasureTheory): add `continuousWithinAt_Ici/Iic_primitive_Ioi/Iio` and `continuousOn_Ici/Iic_primitive_Ioi/Iio/Ici/Iic` |
This PR proves:
- `continuousWithinAt_Ici/Iic_primitive_Ioi/Iio`
- `continuousOn_Ici/Iic_primitive_Ioi/Iio/Ici/Iic`
- `integral_Ioi_sub_Ioi`, `integral_Ioi_sub_Ioi'`, `integral_Iio_sub_Iio`, `integral_Iio_sub_Iio'`
- `Ioi_diff_Ioc`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
125/1 |
Mathlib/MeasureTheory/Integral/DominatedConvergence.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/Basic.lean,Mathlib/Order/Interval/Set/LinearOrder.lean |
3 |
14 |
['CoolRmal', 'Deep0Thinking', 'github-actions'] |
RemyDegenne assignee:RemyDegenne |
11-48783 11 days ago |
12-14305 12 days ago |
23-79195 23 days |
| 35504 |
JoaBjo author:JoaBjo |
feat(Probability/Distributions/Exponential): add MGF, moments, and memoryless property |
feat(Probability/Distributions/Exponential): add MGF, moments, and memoryless property
Add the main analytic results for the exponential distribution:
- moment-generating function `mgf id (expMeasure r) t = r / (r - t)` for `t < r`
- mean `∫ x, x ∂(expMeasure r) = r⁻¹`
- variance `Var[id; expMeasure r] = r⁻¹ ^ 2`
- `ℒp` membership for all `p`
- tail probability `P(X > x) = exp (-(r * x))`
- memoryless property `P(X > s + t | X > s) = P(X > t)`
The MGF is computed by reducing to the known improper integral `∫ exp(c * x)` on `Ioi`,
and integrability is deduced by contradiction from the positive closed-form value.
The mean and variance are computed via the Gamma function integral
`∫₀^∞ x^(n-1) exp(-r x) dx = Γ(n) / rⁿ`. The memoryless property follows from
the exponential identity `exp(-(r(s+t))) = exp(-rt) * exp(-rs)`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
200/0 |
Mathlib/Probability/Distributions/Exponential.lean |
1 |
6 |
['JoaBjo', 'Timeroot', 'github-actions'] |
kex-y assignee:kex-y |
10-20331 10 days ago |
14-41209 14 days ago |
14-41100 14 days |
| 35011 |
whocares-abt author:whocares-abt |
feat(Combinatorics/SimpleGraph/Copy): add degree of copy less than original |
add two theorems relating degree of a graph and it's copy |
t-combinatorics
new-contributor
|
17/0 |
Mathlib/Combinatorics/SimpleGraph/Copy.lean |
1 |
12 |
['SnirBroshi', 'github-actions', 'themathqueen', 'vihdzp'] |
nobody |
9-81143 9 days ago |
23-81382 23 days ago |
23-81273 23 days |
| 33257 |
NickAdfor author:NickAdfor |
feat(Combinatorics/SimpleGraph/Bipartite): Odd Cycle Theorem (A Solution to TODO) |
Prove bipartite iff all cycles are even
This PR formalizes the classical graph theory theorem: a graph is bipartite if and only if all its cycles have even length.
Co-authored-by: Nick Adfor
Co-authored-by: Yue Sun
Co-authored-by: Aristotle AI
---
## Main results
- `SimpleGraph.bipartite_iff_all_cycles_even` : the main equivalence theorem
## Key supporting lemmas
- `SimpleGraph.even_length_iff_same_color` : parity lemma for 2-colorings
- `SimpleGraph.even_length_iff_even_bypass_length` : bypass length parity
- `SimpleGraph.even_cycle_length_of_path` : cycle construction lemma
- `SimpleGraph.bypass_eq_nil_of_closed` : closed path properties
## Proof outline
1. For bipartite graphs: use the 2-coloring to show that in a 2-coloring, a walk has even length iff its endpoints have the same color.
2. For cycles (start = end), this forces even length.
3. For the converse: if all cycles are even, construct a 2-coloring using the `two_colorable_iff_forall_loop_even` characterization.
4. Show this coloring is valid using bypass operations and path properties.
## Technical notes
- Uses `SimpleGraph.Walk` for path/cycle representation
- Handles both `IsPath` and `IsCycle` predicates
- Uses bypass operations (`takeUntil`, `dropUntil`, `bypass`) to analyze walks
- Requires `DecidableEq V` for some lemmas
- Uses classical logic for case analysis
## Reviewer notes
- The proof uses induction on walks and case analysis on colorings
- Some lemmas (like `even_length_iff_same_color`) could be extracted to more general locations
- All theorems are in the `SimpleGraph` namespace
- The `bipartite_iff_all_cycles_even` theorem provides the complete characterization |
t-combinatorics
new-contributor
|
164/8 |
Mathlib/Combinatorics/SimpleGraph/Bipartite.lean,Mathlib/Combinatorics/SimpleGraph/ConcreteColorings.lean |
2 |
70 |
['IvanRenison', 'NickAdfor', 'Rida-Hamadani', 'SnirBroshi', 'github-actions', 'kmill', 'mitchell-horner', 'vihdzp', 'vlad902'] |
kmill assignee:kmill |
9-20330 9 days ago |
25-19264 25 days ago |
33-27101 33 days |
| 34599 |
cameronfreer author:cameronfreer |
feat(Logic/Equiv/Fintype): generalize toCompl and exists_extending_pair to finite source |
Generalize the Equiv subtype-extension API so it only needs finiteness of
the source subtype, then use that to drastically simplify
`Equiv.Perm.isMultiplyPretransitive`.
### Changes to `Logic/Equiv/Fintype.lean`
* **`Equiv.toCompl`**: generalize from `[Finite α]` to `[Finite {x | p x}]`.
New proof (due to tb65536) uses finset symmetric differences to avoid
needing finiteness of the ambient type.
* **`Equiv.extendSubtype`** and related lemmas: adapt to `[Finite {x | p x}]`.
* **`Equiv.Perm.exists_extending_pair`**: strengthen from `[Finite β]` to
`[Finite α]`. Given two injective functions `f, g : α → β` where `α` is
finite, there exists `σ : Perm β` with `σ ∘ f = g`. The target `β` can
now be infinite.
### Changes to `MultipleTransitivity.lean`
* **`Equiv.Perm.isMultiplyPretransitive`**: replace ~70-line manual
bijectivity construction with a two-line proof via
`exists_smul_eq_embedding`.
* **`exists_smul_eq_embedding`**: rewire to use `exists_extending_pair`
directly (removing the old cardinal-arithmetic proof
`exists_extending_pair_of_finite_source`).
### Application
Used in formalizing de Finetti's theorem (exchangeability ⇒ contractability):
https://github.com/cameronfreer/exchangeability/blob/03a854a2/Exchangeability/Contractability.lean#L459
Co-authored-by: tb65536 |
t-group-theory
new-contributor
|
49/77 |
Mathlib/GroupTheory/GroupAction/MultipleTransitivity.lean,Mathlib/Logic/Equiv/Fintype.lean |
2 |
24 |
['LLaurance', 'cameronfreer', 'github-actions', 'mathlib-merge-conflicts', 'tb65536'] |
mattrobball assignee:mattrobball |
9-20329 9 days ago |
9-26712 9 days ago |
18-68097 18 days |
| 33985 |
YellPika author:YellPika |
feat(Order/OmegaCompletePartialOrder): `OmegaCompletePartialOrder` instance for `Sum` with basic `ωScottContinuous` lemmas |
This PR adds an `OmegaCompletePartialOrder` instance for `Sum`, along with `ωScottContinuous` lemmas for basic operations (`inl`, `inr`, `elim`). Appropriate lemmas are marked with `@[fun_prop]` so that the `fun_prop` tactic can automatically deduce `ωScottContinuous` proofs for functions involving `Sum`s (e.g. see the proof of `Sum.ωScottContinuous_map`).
---
- [x] depends on: #33941
[](https://gitpod.io/from-referrer/)
|
new-contributor
large-import
t-order
|
191/1 |
Mathlib/Data/Sum/Basic.lean,Mathlib/Data/Sum/Order.lean,Mathlib/Order/OmegaCompletePartialOrder.lean,Mathlib/Order/ScottContinuity.lean |
4 |
20 |
['Vierkantor', 'YellPika', 'github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
bryangingechen assignee:bryangingechen |
8-20310 8 days ago |
19-48473 19 days ago |
29-10616 29 days |
| 35481 |
FrankieeW author:FrankieeW |
chore(NumberTheory/Zsqrtd): inline duplicated order lemmas into instances |
This PR follows reviewer feedback by removing duplicated order/additive wrapper theorems in `Zsqrtd` and inlining the proofs into the corresponding typeclass instances.
Changes include:
- remove redundant wrappers such as `Zsqrtd.le_total`, `Zsqrtd.add_le_add_left`, `Zsqrtd.le_of_add_le_add_left`, `Zsqrtd.add_lt_add_left`, and `Zsqrtd.le_antisymm`
- keep the canonical API through `LinearOrder` / ordered additive structure fields
- update downstream use in `PellMatiyasevic` to the canonical theorem (`_root_.le_antisymm`)
This reduces namespace-level duplicate APIs and keeps proofs aligned with standard typeclass lemmas.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-number-theory
|
26/10 |
Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean |
2 |
8 |
['FrankieeW', 'github-actions', 'vihdzp'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
8-20302 8 days ago |
13-15298 13 days ago |
14-57430 14 days |
| 35280 |
khwilson author:khwilson |
feat(Mathlib/Analysis/Polynomial/MahlerMeasure): Mahler Measure estimate in terms of supNorm |
The Mahler measure of a polynomial is bounded above by `√(p.natDegree + 1) * p.supNorm`. This is a tighter estimate than `(p.natDegree + 1) * p.supNorm`, which is implied by `mahlerMeasure_le_sum_norm_coeff`.
AI Usage: Claude Code (Opus 4.6) provided first drafts for several sorries in the main calc block. Gemini Pro was used for one-off looks ups of lemma names like `ae_restrict_iff'`. The final code was edited by me.
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
67/0 |
Mathlib/Analysis/Polynomial/MahlerMeasure.lean |
1 |
12 |
['github-actions', 'j-loreaux', 'khwilson', 'mathlib-merge-conflicts'] |
j-loreaux assignee:j-loreaux |
8-13726 8 days ago |
8-13779 8 days ago |
18-19898 18 days |
| 33662 |
Pjotr5 author:Pjotr5 |
feat(Algebra/Order/BigOperators/Expect): add lemmas and strict variants |
### Summary
- Combine `le_expect_nonempty_of_subadditive` and `le_expect_of_subadditive` into a single lemma `le_expect_of_subadditive`.
The extra assumptions `(hs : s.Nonempty)` and `(h_zero : m 0 = 0)` are unnecessary (since `m 0 = 0` follows from `h_div`).
This requires a small downstream update to `Mathlib/Analysis/RCLike/Basic.lean` (`norm_expect_le`).
- Add strict-inequality variants:
`expect_lt_expect`, `expect_lt`, `lt_expect`.
- Add existence lemmas:
`exists_le_of_expect_le_expect`, `exists_le_of_le_expect`, `exists_le_of_expect_le`,
and `exists_lt_of_expect_lt_expect`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
label:t-algebra$ |
46/16 |
Mathlib/Algebra/Order/BigOperators/Expect.lean,Mathlib/Analysis/RCLike/Basic.lean |
2 |
1 |
['github-actions'] |
thorimur assignee:thorimur |
7-58189 7 days ago |
57-76984 57 days ago |
57-76875 57 days |
| 35402 |
samueloettl author:samueloettl |
feat(Dynamics/BirkhoffSum): birkhoffAverage const |
---
I think this might be useful.
My feeling tells me that 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
|
22/0 |
Mathlib/Dynamics/BirkhoffSum/Average.lean |
1 |
2 |
['github-actions'] |
urkud assignee:urkud |
7-20332 7 days ago |
10-30006 10 days ago |
16-63185 16 days |
| 35652 |
dennj author:dennj |
feat(LinearAlgebra/Matrix): add `Matrix.mul_eq_smul_one_symm` |
## Summary
- Add `Matrix.mul_eq_smul_one_symm`: if `M * N = c • 1` and `det M ≠ 0`, then `N * M = c • 1`
- A scalar generalisation of `mul_eq_one_symm` (the `c = 1` case) to arbitrary scalars, requiring `IsDomain` and `det M ≠ 0`
- The proof uses the adjugate identity `adjugate M * M = det M • 1` to derive `det M • (N * M) = det M • (c • 1)`, then cancels `det M` via `mul_left_cancel₀`
Theorem imported from: https://github.com/Latinum-Agentic-Commerce/AlgebraicDesignTheory |
t-algebra
new-contributor
label:t-algebra$ |
28/0 |
Mathlib/LinearAlgebra/Matrix/NonsingularInverse.lean |
1 |
2 |
['eric-wieser', 'github-actions'] |
joelriou assignee:joelriou |
6-20340 6 days ago |
10-42846 10 days ago |
10-42737 10 days |
| 35662 |
FrankieeW author:FrankieeW |
feat(NumberTheory/Zsqrtd): add Archimedean instance via le_arch |
This PR follows a suggestion made in #35606 , #35481
- add `Zsqrtd.le_arch_smul` in `Mathlib/NumberTheory/Zsqrtd/Basic.lean`
- use it to provide `instance : Archimedean (ℤ√d)` in the `Nonsquare` section
- refactor the proof using symmetry to reduce duplication while keeping checks clean
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
|
43/2 |
Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean |
2 |
6 |
['FrankieeW', 'github-actions', 'tb65536'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
6-20337 6 days ago |
9-49100 9 days ago |
10-26870 10 days |
| 35573 |
antisubnoous author:antisubnoous |
feat(NumberTheory/Chebyshev): express the Chebyshev theta function in terms of the prime counting function |
This is a sibling theorem to Chebyshev.primeCounting_eq_theta_div_log_add_integral.
---
This is my first mathlib4 commit. I am working through some exercises and results in Apostol's ANT book as a means to practice Lean, and this result seemed like an opportunity to practice the mechanics of contributing to Mathlib because the new theorem mirrors closely the sibling theorem above (both appear in Apostol Theorem 4.3).
[](https://gitpod.io/from-referrer/) |
t-number-theory
new-contributor
|
36/1 |
Mathlib/NumberTheory/Chebyshev.lean |
1 |
2 |
['github-actions'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
6-15623 6 days ago |
12-52447 12 days ago |
12-52338 12 days |
| 33458 |
NoneMore author:NoneMore |
feat(ModelTheory): add lifting for embeddings to languages with constants |
Prepare for a generalized Tarski-Vaught test with a set as input instead of a substructure.
---
[](https://gitpod.io/from-referrer/)
|
t-logic
new-contributor
|
46/0 |
Mathlib/ModelTheory/ElementaryMaps.lean,Mathlib/ModelTheory/LanguageMap.lean |
2 |
7 |
['Citronhat', 'NoneMore', 'fpvandoorn', 'github-actions'] |
fpvandoorn assignee:fpvandoorn |
5-61481 5 days ago |
5-61699 5 days ago |
61-74169 61 days |
| 35465 |
MixedMatched author:MixedMatched |
feat(Data/Multiset/Powerset): show injectivity and monotonicity of powerset |
Add Injective, Monotone, and StrictMono proofs for `Multiset.powerset`. Also, add a theorem showing that the sizes of two powersets are bidirectionally related to the sizes of the underlying Multisets (`powerset_le_powerset_iff_le`), a couple of other small `Multiset.powerset` lemmas, and theorems for append and map for `List.Subperm`.
Also, thanks to Ruben Van de Velde for looking this over on the Zulip!
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
81/0 |
Mathlib/Data/List/Perm/Subperm.lean,Mathlib/Data/List/Sublists.lean,Mathlib/Data/Multiset/Powerset.lean |
3 |
28 |
['MixedMatched', 'eric-wieser', 'github-actions', 'joneugster', 'vihdzp'] |
joneugster assignee:joneugster |
5-55750 5 days ago |
12-36639 12 days ago |
12-59260 12 days |
| 34209 |
mike1729 author:mike1729 |
feat(Analysis/Normed): Schauder basis definition and characterization via projections |
A Schauder basis is a fundamental concept in functional analysis, providing a way to represent every element of a Banach space as a unique convergent series. This PR adds the core structures, some theorems necessary to work with these bases and a characterization of a Schauder basis using projections.
This PR is based on Chapter 1. from Albiac, F., & Kalton, N. J. (2016). Topics in Banach Space Theory.
This is a first PR in a series of three aiming for Eberlein-Smulyan Theorem. The next one will contain theory of basic sequences and the final one will contain a proof of Eberlein-Smulyan Theorem using basic sequences.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
524/0 |
Mathlib.lean,Mathlib/Analysis/Normed/Module/Bases.lean,docs/references.bib |
3 |
181 |
['Ruben-VandeVelde', 'faenuccio', 'github-actions', 'goliath-klein', 'j-loreaux', 'mike1729', 'sgouezel', 'themathqueen'] |
sgouezel assignee:sgouezel |
5-52771 5 days ago |
5-52778 5 days ago |
30-9201 30 days |
| 35653 |
pepamontero author:pepamontero |
feat: add ChartedSpace structure on orbit space |
feat: add ChartedSpace structure on orbit space
Add topological preliminaries for properly discontinuous group actions, and use them to equip the orbit space `orbitRel.Quotient G M` with a `ChartedSpace` structure.
In particular:
- Show that the quotient map `Quotient.mk _ : M → orbitRel.Quotient G M` is a covering map and hence a local homeomorphism.
- Construct chosen local inverses of the quotient map and establish properties over them.
- Define a `ChartedSpace` instance on the quotient by composing these local inverses with charts of M.
This started as an ItaLean2025 project; here is the [Zulip thread](https://leanprover.zulipchat.com/#narrow/channel/541885-ItaLean-2025/topic/Projects.3A.20Quotient.20Manifolds/with/575121158) dedicated to it.
---
|
new-contributor
t-differential-geometry
|
186/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Instances/OrbitSpace.lean,Mathlib/Topology/Algebra/OrbitSpace.lean |
3 |
2 |
['github-actions'] |
grunweg assignee:grunweg |
5-51630 5 days ago |
10-39375 10 days ago |
10-39941 10 days |
| 35857 |
AlexeyMilovanov author:AlexeyMilovanov |
feat(Logic.Equiv.BijectiveBase2): add bijective base-2 numeration |
This PR introduces a formalization of the bijective base-2 numeration system.
Unlike standard binary representation, bijective base-2 avoids the "leading zeros" problem, providing a strict mathematical bijection between natural numbers (`ℕ`) and lists of booleans (`List Bool`).
**Main additions:**
* `Equiv.BijectiveBase2.toBits`: Encodes `ℕ` to `List Bool`.
* `Equiv.BijectiveBase2.ofBits`: Decodes `List Bool` to `ℕ`.
* `equivBijectiveBase2`: The formal `ℕ ≃ List Bool` equivalence.
*(Note: This replaces my previously closed PR to avoid the terminology clash between "Dyadic" and dyadic rationals. The namespace and definitions have been updated accordingly).*
*(Note: Used AI to assist with standardizing proof structures).* |
t-logic
new-contributor
|
95/0 |
Mathlib.lean,Mathlib/Logic/Equiv/ListNatBijective.lean |
2 |
4 |
['AlexeyMilovanov', 'SnirBroshi', 'github-actions'] |
nobody |
5-32464 5 days ago |
5-41536 5 days ago |
5-41884 5 days |
| 35315 |
mkaratarakis author:mkaratarakis |
feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 3/5) |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
26/0 |
Mathlib/Analysis/Analytic/Order.lean |
1 |
6 |
['SnirBroshi', 'github-actions', 'j-loreaux', 'mkaratarakis'] |
j-loreaux assignee:j-loreaux |
4-41691 4 days ago |
8-12519 8 days ago |
18-6106 18 days |
| 35317 |
mkaratarakis author:mkaratarakis |
feat: lemmas for the analytic part of the proof of the Gelfond–Schneider theorem (Part 5/5) |
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
t-analysis
|
62/0 |
Mathlib/Analysis/Complex/CauchyIntegral.lean |
1 |
7 |
['MichaelStollBayreuth', 'github-actions', 'mkaratarakis'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
4-41672 4 days ago |
12-28767 12 days ago |
17-31765 17 days |
| 35272 |
jvanwinden author:jvanwinden |
feat(Topology/Instances/EReal): limsup of multiplication by a constant |
add an analogue of `limsup_const_mul_of_ne_top` which applies to `EReal` instead of `ENNReal`
---
[](https://gitpod.io/from-referrer/)
|
t-topology
new-contributor
|
28/0 |
Mathlib/Topology/Instances/EReal/Lemmas.lean |
1 |
13 |
['github-actions', 'j-loreaux', 'jvanwinden', 'mathlib-merge-conflicts', 'vihdzp'] |
j-loreaux assignee:j-loreaux |
4-35554 4 days ago |
4-35554 4 days ago |
8-73555 8 days |
| 35567 |
goliath-klein author:goliath-klein |
refactor(PiTensorProduct/{InjectiveNorm, ProjectiveNorm}): Golfs |
This PR cleans up the proofs in
Analysis/Normed/Module/PiTensorProduct/{InjectiveSeminorm.lean, ProjectiveSeminorm.lean}
In addition, it performs the following minor structural changes:
* Weaken assumptions from `NontriviallyNormedField 𝕜` to `NormedField 𝕜` where possible
* The proofs showing that `projectiveSeminorm` actually defines a `Seminorm` are split off into separate lemmas. This mimics the idiom used e.g. in `Analysis.Normed.Modula.Operator.Basic` to define the operator norm.
* Register a `Nonempty x.lifts` instance in PiTensorProduct.lean, to avoid creating a half-dozen local instances.
This is the first in a series of three PRs with the goal to [deprecate `PiTensorProuduct.injectiveSeminorm`](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/injectiveSeminorm/with/568798633).
---
Co-authored-by: Davood H. T. Tehrani
[](https://gitpod.io/from-referrer/)
|
maintainer-merge
new-contributor
|
101/158 |
Mathlib/Analysis/Normed/Module/PiTensorProduct/InjectiveSeminorm.lean,Mathlib/Analysis/Normed/Module/PiTensorProduct/ProjectiveSeminorm.lean,Mathlib/LinearAlgebra/PiTensorProduct.lean |
3 |
10 |
['github-actions', 'goliath-klein', 'leanprover-radar', 'tb65536'] |
sgouezel assignee:sgouezel |
4-20228 4 days ago |
12-58703 12 days ago |
12-60281 12 days |
| 35745 |
khwilson author:khwilson |
feat(Mathlib/Analysis/Asymptotics/Defs): congr lemmas for IsBigO* |
This PR primarily provides two calculational lemmas that are commonly used in bounding functions.
First, it provides `IsBigO*.sum_congr`. This theorem allows the user to bound each term of a (finite) sum individually. This is different than `IsBigO.sum` which requires all terms to be bound by the _same_ function.
Second, it provides `IsBigO*.sum_congr'`. This theorem allows the user to bound the terms of a sum individually _when the length of the sum changes with respect to the running variable_. This is a common setup with certain techniques such as the method of the hyperbola.
Note: This makes the overall length of this file go above 1500 lines. I'm happy to break it up at the request of reviewers, but that's a bigger change to the API.
AI Usage: Looking up various lemma names in Google Gemini.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
92/1 |
Mathlib/Analysis/Asymptotics/Defs.lean |
1 |
2 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
4-20221 4 days ago |
8-13562 8 days ago |
8-13453 8 days |
| 35705 |
jdhart81 author:jdhart81 |
feat(Data/ENNReal, Probability/Independence): division decomposition and self-independence |
Two general-purpose lemmas extracted from a formal verification of "The Intelligence Bound" (Hart 2025).
---
### New lemmas
- `ENNReal.div_eq_div_mul_div`: Division decomposition `a / c = a / b * (b / c)` when `b ≠ 0` and `b ≠ ⊤`. Added to `Mathlib.Data.ENNReal.Inv`.
- `IndepFun.of_self`: If `Y` is independent of itself under a probability measure, then `X` and `Y` are independent. Self-independence implies `Y` is a.e. constant. Added to `Mathlib.Probability.Independence.Basic`.
### Context
These lemmas arose in formalizing information-theoretic results where:
- The ENNReal division identity is needed for decomposing rate expressions (limsup of ratios)
- The self-independence result bridges entropy = 0 and measure-theoretic independence
### References
- Formal verification: https://github.com/jdhart81/intelligence-bound-lean
- Paper: "The Intelligence Bound" (Hart 2025) |
new-contributor
t-data
|
47/0 |
Mathlib/Data/ENNReal/Inv.lean,Mathlib/Probability/Independence/Basic.lean |
2 |
10 |
['SnirBroshi', 'github-actions', 'jdhart81', 'joneugster', 'kbuzzard'] |
nobody |
3-65188 3 days ago |
6-55224 6 days ago |
8-25117 8 days |
| 34477 |
spanning-tree author:spanning-tree |
refactor(Order): make CompletePartialOrder extend OrderBot |
Make `CompletePartialOrder` extend `OrderBot`, and add a constructor `completePartialOrderOfLubOfDirected`. Previously, `CompletePartialOrder` had an implicit bottom element but did not extend OrderBot explicitly.
Breaking change: `CompletePartialOrder` instances must provide `⊥` and `bot_le`, or use the constructor.
See discussion in [Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.3E.20complete.20partial.20order.20and.20domain.20theory.20formalization).
---
[](https://gitpod.io/from-referrer/)
|
t-order
new-contributor
|
15/1 |
Mathlib/Order/CompletePartialOrder.lean |
1 |
3 |
['Citronhat', 'github-actions', 'mathlib-merge-conflicts'] |
pechersky assignee:pechersky |
3-59623 3 days ago |
3-59646 3 days ago |
24-34694 24 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
|
680/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/ExistsRiemannianMetric.lean,Mathlib/Geometry/Manifold/PartitionOfUnity.lean |
3 |
200 |
['github-actions', 'grunweg', 'idontgetoutmuch'] |
grunweg assignee:grunweg |
3-52781 3 days ago |
3-52807 3 days ago |
17-82873 17 days |
| 34875 |
banrovegrie author:banrovegrie |
feat(LinearAlgebra/Matrix): add Sherman-Morrison formula |
Mathlib has the matrix determinant lemma (`det_add_replicateCol_mul_replicateRow` in SchurComplement.lean) but lacked the corresponding inverse formula. This PR fills that gap.
- Add `Matrix.inv_add_vecMulVec`: Sherman-Morrison formula for `(A + uv^T)^{-1}`
- Add `Matrix.inv_sub_vecMulVec`: subtraction variant
- Add `Matrix.isUnit_det_add_vecMulVec`: invertibility under the formula's hypotheses
## Test plan
- [x] `lake build` passes
- [x] Lines within 100 char limit
- [x] All declarations have docstrings |
t-algebra
new-contributor
label:t-algebra$ |
135/0 |
Mathlib.lean,Mathlib/LinearAlgebra/Matrix/ShermanMorrison.lean |
2 |
11 |
['Xxxjdjdid', 'banrovegrie', 'copilot-pull-request-reviewer', 'eric-wieser', 'github-actions', 'wwylele'] |
kim-em assignee:kim-em |
3-51227 3 days ago |
27-55044 27 days ago |
27-54935 27 days |
| 35058 |
GrigorenkoPV author:GrigorenkoPV |
chore: move tendsto_{floor,ceil}_at{Top,Bot} |
Moves:
- Topology.Algebra.Order.Floor.tendsto_floor_atTop -> Order.Filter.AtTopBot.Floor.tendsto_floor_atTop
- Topology.Algebra.Order.Floor.tendsto_floor_atBot -> Order.Filter.AtTopBot.Floor.tendsto_floor_atBot
- Topology.Algebra.Order.Floor.tendsto_ceil_atTop -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atTop
- Topology.Algebra.Order.Floor.tendsto_ceil_atBot -> Order.Filter.AtTopBot.Floor.tendsto_ceil_atBot
---
Tracked in #7987
[](https://gitpod.io/from-referrer/)
|
new-contributor
large-import
|
22/25 |
Mathlib/Order/Filter/AtTopBot/Floor.lean,Mathlib/Topology/Algebra/Order/Floor.lean |
2 |
1 |
['github-actions'] |
adamtopaz assignee:adamtopaz |
3-20336 3 days ago |
21-74647 21 days ago |
21-74538 21 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.
- [ ] depends on: #34598
---
|
new-contributor
t-euclidean-geometry
|
360/0 |
Mathlib.lean,Mathlib/Geometry/Polygon/Boundary.lean,Mathlib/Geometry/Polygon/Simple.lean,Mathlib/Logic/Equiv/Fin/Rotate.lean |
4 |
29 |
['A-M-Berns', 'eric-wieser', 'github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp', 'wwylele'] |
nobody |
3-5842 3 days ago |
7-46200 7 days ago |
9-80377 9 days |
| 35805 |
adrianmartir author:adrianmartir |
feat(NumberTheory/Divisors): Add `infinite_setOf_divisors_iff` |
This proves that the set of divisors `{ m | m | n }` of a natural number `n` is infinite if and only if `n` is zero. The first proof draft was by @Aristotle-Harmonic.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
|
10/0 |
Mathlib/NumberTheory/Divisors.lean |
1 |
5 |
['adrianmartir', 'alexjbest', 'github-actions'] |
alexjbest assignee:alexjbest |
2-75130 2 days ago |
6-73132 6 days ago |
6-73059 6 days |
| 35597 |
BryceT233 author:BryceT233 |
feat(AdicTopology): add lemmas about adic topology |
This PR adds APIs to transport topological and uniform properties of adic topologies across ring equivalences, By upgrading an ideal-preserving ring equivalence to a `UniformEquiv`, we provide natural congruence lemmas for adic completeness, precompleteness, and Hausdorffness, which serve as necessary topological preliminaries for the ongoing formalization of the Cohen Structure Theorem.
Co-authored-by: @Thmoas-Guan
---
[](https://gitpod.io/from-referrer/)
|
t-topology
new-contributor
|
55/2 |
Mathlib/RingTheory/AdicCompletion/Topology.lean,Mathlib/Topology/Algebra/Nonarchimedean/AdicTopology.lean |
2 |
7 |
['erdOne', 'github-actions'] |
urkud assignee:urkud |
2-54939 2 days ago |
9-11695 9 days ago |
11-85346 11 days |
| 35647 |
BryceT233 author:BryceT233 |
feat(RingTheory/Ideal/Quotient): add a canonical inclusion map |
This is the second PR split from the larger PR https://github.com/leanprover-community/mathlib4/pull/34936 to make the review process easier.
It introduces `Submodule.powSmulQuotInclusion`, which is the canonical inclusion from `I ^ a • N ⧸ I ^ b • (I ^ a • N)` to `M ⧸ I ^ c • N` where `c = b + a`, and provides auxiliary lemmas for it
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
new-contributor
|
37/0 |
Mathlib/RingTheory/Ideal/Quotient/PowTransition.lean |
1 |
9 |
['BryceT233', 'erdOne', 'github-actions', 'wwylele'] |
chrisflav assignee:chrisflav |
2-54818 2 days ago |
4-13783 4 days ago |
10-28461 10 days |
| 35724 |
matthewjasper author:matthewjasper |
feat(RingTheory/DedekindDomain/AdicValuation): v-adic integers of `K` are a localization at v^c |
Part of showing `R` is dense in `O_v`, which is used to show that `R / v` is isomorphic to the residue field of `O_v` and
to construct the base change isomorphism for finite adeles.
---
[](https://gitpod.io/from-referrer/)
|
t-ring-theory
new-contributor
large-import
FLT
|
59/0 |
Mathlib/RingTheory/DedekindDomain/AdicValuation.lean |
1 |
6 |
['github-actions', 'matthewjasper', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
2-28823 2 days ago |
8-44268 8 days ago |
8-44159 8 days |
| 35329 |
BryceT233 author:BryceT233 |
feat(Data/Finsupp): add computational lemmas for cons and single |
This PR introduces `cons_eq_single_zero_iff` and `cons_eq_single_succ_iff`, which are helper lemmas designed to facilitate calculations (or simplification) of equalities involving `Finsupp.cons` and `Finsupp.single`.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
25/0 |
Mathlib/Data/Finsupp/Fin.lean |
1 |
2 |
['github-actions'] |
TwoFX assignee:TwoFX |
2-26808 2 days ago |
2-26867 2 days ago |
17-82426 17 days |
| 35900 |
matthewjasper author:matthewjasper |
chore: Fix non-defeq diamonds on OrderDual |
This only makes changes to fix the diamonds, rather than the general defeq abuse with `OrderDual`.
---
- [ ] depends on: #35995
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-order
|
213/116 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/MonoidAlgebra/Degree.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Module/Defs.lean,Mathlib/Algebra/Order/Module/Synonym.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Algebra/Order/Ring/Synonym.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Normed/Group/Constructions.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Order/Lattice.lean |
13 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
2-21278 2 days ago |
2-21307 2 days ago |
4-7591 4 days |
| 35732 |
TJHeeringa author:TJHeeringa |
feat: Added reproducing kernels |
Develops the basic theory of reproducing kernels, which underlies the reproducing kernel
Hilbert spaces. It shows that the kernels form an ordered semiring and common ways of constructing
kernels from other kernels.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-analysis
|
1193/0 |
Mathlib.lean,Mathlib/KernelTheory/Kernel.lean |
2 |
5 |
['TJHeeringa', 'github-actions', 'joneugster', 'vihdzp'] |
j-loreaux assignee:j-loreaux |
2-20320 2 days ago |
7-76797 7 days ago |
7-78713 7 days |
| 35866 |
gad-wiseman author:gad-wiseman |
feat(Topology/Homotopy/Basic): maps homotopic rel S agree on S |
---
This adds an easy lemma showing maps that are `HomotopicRel` a set agree on it. |
t-topology
new-contributor
|
5/0 |
Mathlib/Topology/Homotopy/Basic.lean |
1 |
2 |
['github-actions'] |
dagurtomas assignee:dagurtomas |
2-20306 2 days ago |
5-62647 5 days ago |
5-62538 5 days |
| 35467 |
ZRTMRH author:ZRTMRH |
feat(Combinatorics): add Schreier graphs, Cayley graphs, and Cayley sum graphs |
## Summary
- Defines Schreier graphs and Cayley graphs as quivers with labeled edges, porting the approach from Lean 3 PR leanprover-community/mathlib3#18693 by @bottine, @YaelDillies, and @antoinelab01.
- Proves the labelling prefunctor is a covering for group actions, establishes reachability characterization, connectivity, and vertex-transitivity (right multiplication is a covering isomorphism).
- Provides concrete examples: cyclic groups ℤ/nℤ, symmetric groups S_n, and integers ℤ.
- Defines Cayley sum graphs as `SimpleGraph` where `Adj u v ↔ u ≠ v ∧ u + v ∈ s`, with translation properties and connection to circulant graphs.
## References
- Lean 3 PR: leanprover-community/mathlib3#18693 (Rémi Bottinelli, Yaël Dillies, Antoine Labelle)
- Lean 3 branch: https://github.com/leanprover-community/mathlib3/tree/geometric-group-theory
## New files
| File | Lines | Content |
|------|-------|---------|
| `Mathlib/Combinatorics/Quiver/Schreier.lean` | 770 | Core theory |
| `Mathlib/Combinatorics/Quiver/SchreierExamples.lean` | 183 | Examples |
| `Mathlib/Combinatorics/SimpleGraph/CayleySumGraph.lean` | 159 | Cayley sum graphs |
## Test plan
- [x] All three files build clean on latest master
- [x] No `sorry`
- [x] All public declarations have docstrings
- [x] `lake exe mk_all --check` passes
- [x] `lake exe runLinter` passes
## AI disclosure
This PR was developed with assistance from [Claude Code](https://claude.com/claude-code) (Anthropic's CLI tool). Claude Code was used for: writing proof scaffolding, debugging type errors, style cleanup (naming conventions, `fun ↦` syntax), rebasing onto upstream master, and PR preparation. All mathematical content, design decisions, and proof strategies were directed by the author. The code has been reviewed by the author and their advisor. |
t-combinatorics
new-contributor
|
1101/0 |
Mathlib.lean,Mathlib/Combinatorics/Quiver/CayleyExamples.lean,Mathlib/Combinatorics/Quiver/Schreier.lean,Mathlib/Combinatorics/SimpleGraph/CayleySumGraph.lean |
4 |
34 |
['SnirBroshi', 'ZRTMRH', 'github-actions', 'tb65536'] |
nobody |
2-6300 2 days ago |
8-38648 8 days ago |
15-19938 15 days |
| 35733 |
mkaratarakis author:mkaratarakis |
feat: Algebraic setup and matrix coefficients for Gelfond-Schneider theorem |
This PR introduces the foundational algebraic setup and coefficient bounds required for the proof of the Gelfond-Schneider Theorem (Hilbert's Seventh Problem), which establishes that for algebraic numbers $\alpha \neq 0, 1$ and irrational algebraic $\beta$, the number $\alpha^\beta$ is transcendental.
Following the contradiction argument presented in Loo-Keng Hua's "Introduction to Number Theory" (Chapter 17.9, 490 -493) Gelfond's Proof), this file constructs the common number field $K$ and sets up the scaled algebraic integers for the auxiliary linear system. This system will later be solved via Siegel's lemma (Lemma 8.2, 490, Hua).
This PR is essentially the first half of page 490 in the book.
The proof proceeds by assuming $\gamma = \alpha^\beta$ is algebraic, meaning $\alpha$, $\beta$, and $\gamma$ all lie in an algebraic field $K$ of degree $h$.
1. Bundles the common number field $K$, the complex embeddings, and the algebraic preimages $\alpha', \beta', \gamma'$, alongside the core hypotheses of the theorem.
2. Defines the field degree $h = [K : \mathbb{Q}]$, and bounds $m = 2h + 2$ and $n = q^2 / (2m)$ to control the dimensions of the linear system.
3. Defines $c_1$, a natural number chosen so that $c_1 \alpha$, $c_1 \beta$, and $c_1 \gamma$ are algebraic integers in $K$. We prove numerous bounding and integrality lemmas (`isIntegral_c₁α`, `isInt_β_bound`, etc.).
4. Formalizes the core algebraic coefficients $(a+b\beta)^k \alpha^{al} \gamma^{bl}$ which appear in the evaluation of the derivatives of the auxiliary function $R(x)$.
5. By scaling the system by $c_1^{n-1+2mq}$, we successfully restrict the entries of our linear system matrix `A` entirely to the ring of integers $\mathcal{O}_K$, preparing it for the application of Siegel's lemma.
6. House Bounds (`c₂`) : Establishes the foundational base integer $c_2$ to bound the absolute values of the conjugates (houses) of our coefficients.
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory
new-contributor
|
416/0 |
Mathlib.lean,Mathlib/NumberTheory/Transcendental/GelfondSchneider/MainAlg.lean |
2 |
2 |
['github-actions'] |
nobody |
2-6095 2 days ago |
8-37327 8 days ago |
8-37566 8 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
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
392/33 |
Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Convex/Body.lean,Mathlib/Analysis/Convex/Gauge.lean,Mathlib/LinearAlgebra/FiniteDimensional/Lemmas.lean,Mathlib/LinearAlgebra/LinearIndependent/Lemmas.lean,Mathlib/MeasureTheory/Group/GeometryOfNumbers.lean |
6 |
3 |
['github-actions', 'joneugster'] |
nobody |
1-82289 1 day ago |
6-9290 6 days ago |
6-12147 6 days |
| 26160 |
oliver-butterley author:oliver-butterley |
feat(MeasureTheory.VectorMeasure): add several lemmas which characterize variation |
Add the following lemmas concerning variation of a VectorMeasure:
* `norm_measure_le_variation`: `‖μ E‖ₑ ≤ variation μ E`.
* `variation_neg`: `(-μ).variation = μ.variation`.
* `variation_zero`: `(0 : VectorMeasure X V).variation = 0`.
* `absolutelyContinuous`
Co-authored-by: @yoh-tanimoto
- [x] depends on: #26156
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-measure-probability
|
248/15 |
Mathlib.lean,Mathlib/Data/Finset/Basic.lean,Mathlib/MeasureTheory/Measure/MeasureSpaceDef.lean,Mathlib/MeasureTheory/Measure/PreVariation.lean,Mathlib/MeasureTheory/OuterMeasure/Induced.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Basic.lean,Mathlib/MeasureTheory/VectorMeasure/Variation/Defs.lean,Mathlib/Order/Partition/Finpartition.lean |
8 |
18 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'sgouezel', 'yoh-tanimoto'] |
nobody |
1-74324 1 day ago |
1-74387 1 day ago |
35-19109 35 days |
| 27229 |
WilliamCoram author:WilliamCoram |
feat(GroupTheory/DoubleCoset): multiple lemmas |
From FLT
---
[](https://gitpod.io/from-referrer/)
|
FLT
t-group-theory
new-contributor
|
85/2 |
Mathlib/GroupTheory/DoubleCoset.lean |
1 |
41 |
['CBirkbeck', 'Ruben-VandeVelde', 'WilliamCoram', 'github-actions', 'kim-em', 'mariainesdff', 'mathlib4-merge-conflict-bot', 'tb65536'] |
mariainesdff assignee:mariainesdff |
1-65418 1 day ago |
15-75823 15 days ago |
105-20507 105 days |
| 36062 |
huaizhangchu author:huaizhangchu |
feat(Probability/PMF): add PMF.integrable_of_summable_norm |
Adds `PMF.integrable_of_summable_norm`: a function `f` is integrable with respect to `p.toMeasure` when the weighted norms `‖f a‖ * (p a).toReal` form a summable family.
This is useful for computing expectations of discrete distributions (Poisson, geometric, etc.) without manually expanding the `HasFiniteIntegral` definition each time. |
t-measure-probability
new-contributor
|
14/0 |
Mathlib/Probability/ProbabilityMassFunction/Integrals.lean |
1 |
2 |
['github-actions'] |
nobody |
1-56400 1 day ago |
1-56476 1 day ago |
1-56367 1 day |
| 35970 |
adrianmartir author:adrianmartir |
feat(CategoryTheory/Profunctor): Add profunctors and a basic API for them |
This adds a definition of a profunctor and the definition of a natural transformation between two profunctors. Profunctors are defined as a structure, as suggested by @adamtopaz [on Zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Operads.20Formalization/with/566160316).
Using this as a base, I wrote a basic API for profunctors. This will be needed for a future formalization of operads.
A lot of the API was first drafted by @Aristotle-Harmonic.
Co-authored-by: Aristotle (Harmonic)
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
new-contributor
|
185/0 |
Mathlib.lean,Mathlib/CategoryTheory/Profunctor.lean |
2 |
10 |
['adrianmartir', 'emilyriehl', 'github-actions'] |
nobody |
1-48456 1 day ago |
2-36712 2 days ago |
2-38104 2 days |
| 33895 |
jessealama author:jessealama |
feat(Computability/Primrec): add list_take, list_drop, list_modify, and list_set |
This PR shows that several list operations from Lean core are primitive recursive:
- `list_drop`: [`List.drop`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/TakeDrop.lean), via iterating `List.tail` using `nat_iterate`
- `list_take`: [`List.take`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/TakeDrop.lean), via `list_drop` on the reversed list
- `list_modifyHead'`: [`List.modifyHead`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/Nat/Modify.lean) with external data
- `list_modify'`: [`List.modify`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/Nat/Modify.lean) with external data
- `list_modify`: [`List.modify`](https://github.com/leanprover/lean4/blob/master/src/Init/Data/List/Nat/Modify.lean)
- `list_set`: [`List.set`](https://github.com/leanprover/lean4/blob/master/src/Init/Prelude.lean)
The primed versions (`list_modify'`, `list_modifyHead'`) take a function `g : β → α → α` that depends on external data of type `β`. This generalization enables deriving the other operations:
- `list_modify` specializes `list_modify'` with `β = Unit`
- `list_set` uses `list_modify'` via `List.set_eq_modify`
Also moves `list_length` earlier in the file (before `list_drop` and `list_take`, which depend on it). |
new-contributor
t-computability
|
47/4 |
Mathlib/Computability/Primrec/List.lean |
1 |
1 |
['github-actions'] |
nobody |
1-35876 1 day ago |
48-79559 48 days ago |
49-16398 49 days |
| 36088 |
pevogam author:pevogam |
feat: add a LE version of previous div_lt_div_iff_mul_lt_mul theorem |
The following is more useful due to the partial order application of LE in comparison to LT.
Additionally, add specialized cases of equal denominators as simpler syntactic sugar.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
16/0 |
Mathlib/Algebra/Order/Ring/Unbundled/Rat.lean |
1 |
2 |
['github-actions'] |
nobody |
1-27524 1 day ago |
1-27588 1 day ago |
1-27585 1 day |
| 35753 |
Vilin97 author:Vilin97 |
feat(Topology/Algebra/Order): regular grid helpers and piecewise linear interpolation |
## Summary
- Add `Nat.floor_div_eq_of_mem_Ico`, `mem_Ico_Nat_floor_div`, `locallyFinite_Icc_grid`, and `ContinuousOn.of_Icc_grid` to `Topology/Algebra/Order/Floor.lean`.
- Add new file `Topology/Algebra/Order/PiecewiseLinear.lean` with `piecewiseLinear` and `piecewiseConst` definitions for interpolation on regular grids, along with evaluation lemmas, continuity, and right derivative.
- Grid helpers are generalized over `Field K` with `FloorSemiring` and `OrderTopology`.
- Piecewise definitions are generic over `Field α`; continuity/derivative results are for `ℝ`-normed spaces.
## Motivation
These are used in the [forward Euler convergence proof](https://github.com/Vilin97/forward_euler) to construct piecewise linear interpolations of Euler points and prove their continuity. They are general-purpose lemmas about regular grids and piecewise interpolation that should be useful beyond this application.
Follow-up PR: #35755 (forward Euler method convergence).
---
The initial proof was produced by [Aristotle](https://aristotle.harmonic.fun). The code was then iteratively refined (factoring out lemmas, golfing, simplifying proofs) using Claude Code (Claude Opus 4.6). |
t-topology
new-contributor
|
151/0 |
Mathlib.lean,Mathlib/Topology/Algebra/Order/Floor.lean,Mathlib/Topology/Algebra/Order/PiecewiseLinear.lean |
3 |
6 |
['copilot-pull-request-reviewer', 'github-actions', 'wwylele'] |
dagurtomas assignee:dagurtomas |
1-22401 1 day ago |
1-30190 1 day ago |
7-80672 7 days |
| 35906 |
scp020 author:scp020 |
feat(Combinatorics/SimpleGraph/Walks): add Walk.IsChord and Walk.IsChordless |
Add `Walk.IsChord` and `Walk.IsChordless` predicates in a new file `SimpleGraph/Walks/Chords.lean`.
See "chord" in https://en.wikipedia.org/wiki/Glossary_of_graph_theory
Discussion on Zulip:
[Zulip link](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/Walk.2EIsChordless.20live.20in.20mathlib.3F/with/575277309)
authored-by: Tianyi Zhao
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
68/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Chords.lean |
2 |
11 |
['SnirBroshi', 'github-actions', 'scp020'] |
nobody |
1-17116 1 day ago |
1-17423 1 day ago |
2-68065 2 days |
| 36091 |
JJYYY-JJY author:JJYYY-JJY |
feat(Analysis.LocallyConvex.Separation): add Eidelheit's separation theorem |
Adds `geometric_hahn_banach_of_interior_nonempty`, formalizing Eidelheit's separation theorem for disjoint convex sets where one has a nonempty interior.
This resolves the longstanding TODO in `Mathlib.Analysis.LocallyConvex.Separation`. The patch also removes the TODO for the topological property `Convex ℝ s → interior (closure s) ⊆ s`, as this is already handled by `Convex.closure_interior_eq_closure_of_nonempty_interior` (imported from `Mathlib.Analysis.Convex.Topology`).
Key implementation details:
* Uses `geometric_hahn_banach_open` to separate `interior A` and `B`.
* Requires `B.Nonempty` to guarantee the separating continuous linear functional is nontrivial (`f ≠ 0`), avoiding the triviality trap where `A` covers the entire space.
* Uses `closure_minimal` to extend the weak inequality from `interior A` to the entirety of `A`.
---
[](https://gitpod.io/from-referrer/)
Zulip discussion: https://leanprover.zulipchat.com/#narrow/channel/116395-maths/topic/Interior.20of.20closure.20for.20convex.20sets/with/577060103 |
t-analysis
new-contributor
|
39/5 |
Mathlib/Analysis/LocallyConvex/Separation.lean |
1 |
7 |
['copilot-pull-request-reviewer', 'github-actions', 'wwylele'] |
nobody |
1-14316 1 day ago |
1-14378 1 day ago |
1-26687 1 day |
| 35951 |
parabamoghv author:parabamoghv |
feat(CategoryTheory/Monoidal): evaluation coevaluation isomorphisms |
This PR adds four features to rigid categories:
1. `coevaluation_evaluation` and `evaluation_coevaluation` as isomorphism equalities: Using `IsIso` instances for the `evaluation` and `coevaluation` morphisms, we promote the morphism equalities to isomorphism equalities.
2. `ExactPairing Y X` from `ExactPairing X Y`: Using an exact pairing and `IsIso` instances for both `evaluation` and `coevaluation`, we swap the exact pairing by inverting the evaluation and coevaluation morphisms. Any suggestions for the definition name are welcome. Right now it is `ExactPairing.Symm`. The second choice was `ExactPairing.Swap`.
3. `HasLeftDual X` from `HasRightDual X`: Using a `HasRightDual X` instance and relevant `IsIso` instances, we construct a left dual. Similar construction for the other way.
4. `LeftDual` isomorphic to `RightDual`: Using relevant `IsIso` instances, we provide the isomorphism from the left dual of an object to the right dual. This can be achieved in two ways: either by using `leftDualIso` or using `rightDualIso`. We will prove in a subsequent PR that both these isomorphisms are equal.
Motivation: This is part of an effort to formalize CategoricalGroups, which can be defined as right rigid groupoids. The approach is motivated by the discussion in [#34830](https://github.com/leanprover-community/mathlib4/pull/34830).
Any comments or suggestions are welcome, especially about the naming.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
new-contributor
|
65/0 |
Mathlib/CategoryTheory/Monoidal/Rigid/Basic.lean |
1 |
2 |
['github-actions'] |
nobody |
1-5644 1 day ago |
3-3281 3 days ago |
3-4172 3 days |
| 34026 |
SnkXyx author:SnkXyx |
feat(Algebra/MvPolynomial): add mainVariable |
Add `mainVariable` of `MvPolynomial`, the largest variable index appearing in the polynomial.
Main Theorems:
* `mainVariable_eq_bot_iff_eq_C`
* `mainVariable_sum_le`
* `mainVariable_prod_le`
* `degreeOf_eq_zero_of_mainVariable_lt`
The PR is upstreamized from [github.com/WuProver/lean_characteristic_set](https://github.com/WuProver/lean_characteristic_set)
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
147/0 |
Mathlib.lean,Mathlib/Algebra/MvPolynomial/MainVariable.lean |
2 |
1 |
['github-actions'] |
mattrobball assignee:mattrobball |
1-646 1 day ago |
48-6072 48 days ago |
48-6966 48 days |
| 34138 |
pfaffelh author:pfaffelh |
feat(MeasureTheory): Introduce `MassFunction α` giving rise to a `Measure α ⊤` |
Define `MassFunction α := α → ℝ≥0∞`
Define `toMeasure (w : MassFunction α) : @Measure α ⊤` as a sum of diracs
Show properties of the resulting objects
This PR intends to start a more userfriendly interaction with probability mass functions (`PMF`). There are two main differences between `MassFunction` and `PMF`:
* `PMF` hast the additional property `HasSum 1`, making the resulting measure a probability measure. (For `MassFunction`, I intend to use the typeclass `IsProbabilityMeasure`in a later PR instead.)
* The `toMeasure` function of `MassFunction` directly defines the measure as a sum of diracs, which immediately makes computations possible.
Discussion thread on [zulip](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/PMF.20Refactor.3A.20FunLike.20vs.20Definition.20Change)
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
new-contributor
|
224/0 |
Mathlib.lean,Mathlib/Algebra/GroupWithZero/Indicator.lean,Mathlib/Data/Set/Pairwise/Basic.lean,Mathlib/MeasureTheory/Measure/MassFunction.lean |
4 |
10 |
['DavidLedvinka', 'github-actions', 'metakunt', 'pfaffelh'] |
kex-y and ocfnash assignee:ocfnash assignee:kex-y |
0-67502 18 hours ago |
2-31525 2 days ago |
44-37162 44 days |
| 36069 |
Equilibris author:Equilibris |
feat(Data/PFunctor): Universe generic W |
Previously `W.ind` was limited to `Prop`.
It can for free be changed to `Sort w` forall w.
---
When changing adding `elab_as_elim` it broke the usages in `Fix.lean`.
I had to change `apply ...`s to use `induction ... using ...` but this a minor change.
I added a `simp` lemma to the `w_ind_wMk` as: it is `rfl` and will almost certainly we used at reference site.
It might in the future be useful to add `simp` to `wRec_eq` as well.
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
42/32 |
Mathlib/Data/PFunctor/Multivariate/W.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean |
2 |
2 |
['github-actions'] |
nobody |
0-65525 18 hours ago |
0-65586 18 hours ago |
0-67161 18 hours |
| 34621 |
homeowmorphism author:homeowmorphism |
feat(GroupTheory/FreeGroup/Basic): deprecate `FreeGroup Empty ≃ Unit` using `Equiv.ofUnique`, add `Mul` suggestion using `MulEquiv.ofUnique` and add `FreeGroup α ≃* Multiplicative ℤ` |
feat(GroupTheory/FreeGroup/Basic): deprecate `FreeGroup Empty ≃ Unit` using `Equiv.ofUnique`, add `Mul` suggestion using `MulEquiv.ofUnique` and add `FreeGroup α ≃* Multiplicative ℤ`.
This is a dependency of a larger PR to formalize finitely presented groups https://github.com/leanprover-community/mathlib4/pull/34236.
---
Originally, the PR showed that `FreeGroup Empty ≃* Unit` and `FreeGroup α ≃* Multiplicative ℤ`. During the review process, I was asked to generalized `Unit` to any `Unique` type and `Empty` to `IsEmpty`. Through working on this, it has been realized that the pre-existing `FreeGroup Empty ≃ Unit` should be deprecated using `Equiv.ofUnique` and a multiplicative version `FreeGroup Empty ≃* Unit` can be obtained similarly using `MulEquiv.ofUnique` and there was no need to explicitly upgrade the equivalence. The title has been changed to reflect this.
[](https://gitpod.io/from-referrer/)
|
t-group-theory
new-contributor
|
45/6 |
Mathlib/GroupTheory/FreeGroup/Basic.lean |
1 |
40 |
['b-mehta', 'copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'kbuzzard', 'riccardobrasca', 'tb65536'] |
riccardobrasca assignee:riccardobrasca |
0-54337 15 hours ago |
16-44009 16 days ago |
23-60481 23 days |
| 33355 |
0xTerencePrime author:0xTerencePrime |
feat(Combinatorics/SimpleGraph/Connectivity): define vertex connectivity |
This PR introduces the foundations of vertex connectivity for simple graphs, providing a counterpart to the edge connectivity theory in #32870.
### Main definitions
- `SimpleGraph.IsVertexReachable`: vertices remain reachable after removing strictly fewer than `k` other vertices.
- `SimpleGraph.IsVertexConnected`: a graph is `k`-vertex-connected if its order is strictly greater than `k` and any two distinct vertices are `k`-vertex-reachable.
Includes basic characterizations for $k=0$ and $k=1$, along with monotonicity lemmas (`anti` and `mono`). |
new-contributor
t-combinatorics
|
198/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean |
3 |
133 |
['0xTerencePrime', 'SnirBroshi', 'SproutSeeds', 'YaelDillies', 'github-actions', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
0-53343 14 hours ago |
7-13663 7 days ago |
28-46208 28 days |
| 32555 |
ksenono author:ksenono |
feat(Combinatorics/SimpleGraph/Matching): maximum and maximal matchings for Konig's theorem |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
|
127/0 |
Mathlib/Combinatorics/SimpleGraph/DegreeSum.lean,Mathlib/Combinatorics/SimpleGraph/Matching.lean |
2 |
25 |
['SnirBroshi', 'SproutSeeds', 'github-actions', 'jcommelin', 'ksenono'] |
awainverse assignee:awainverse |
0-52603 14 hours ago |
29-28829 29 days ago |
82-1449 82 days |
| 34435 |
huaizhangchu author:huaizhangchu |
feat(Probability): convolution of Poisson distributions |
This PR proves that the convolution of two Poisson distributions is again a Poisson distribution:
`Poisson(r₁) ∗ Poisson(r₂) = Poisson(r₁ + r₂)`
## Main results
- `poissonMeasureReal_charFun`: characteristic function of Poisson distribution is `exp(r(exp(it) - 1))`
- `poissonMeasureReal_conv_poissonMeasureReal`: convolution of Poisson distributions on ℝ
- `poissonMeasure_conv_poissonMeasure`: convolution of Poisson distributions on ℕ
- `poissonMeasure_add_poissonMeasure_of_indepFun`: sum of independent Poisson random variables
## Proof strategy
Uses characteristic functions: `φ(t) = exp(r(eⁱᵗ - 1))`, then pulls back from ℝ to ℕ.
---
- [ ] depends on: #34521 |
t-measure-probability
large-import
new-contributor
|
110/1 |
Mathlib/Probability/Distributions/Poisson.lean |
1 |
15 |
['CoolRmal', 'DavidLedvinka', 'github-actions', 'huaizhangchu', 'mathlib-dependent-issues'] |
RemyDegenne assignee:RemyDegenne |
0-51827 14 hours ago |
27-77984 27 days ago |
29-14982 29 days |
| 36119 |
Ruizsolveall author:Ruizsolveall |
feat(Topology/Covering): fundamental group of the circle is ℤ |
## Summary
- Proves that the fundamental group of the circle `π₁(S¹, 0)` is isomorphic to `ℤ`, via covering space theory.
- Constructs the winding number map `nLoop : ℤ → Path 0 0` on `AddCircle 1`, and proves it is surjective (`surj_nLoop`), injective (`inj_nLoop`), and additive (`nLoop_add`).
- Assembles these into the group isomorphism `fundamentalGroupCircle : Multiplicative ℤ ≃* FundamentalGroup (AddCircle 1) 0`.
## Approach
Uses the covering map `ℝ → AddCircle 1` and unique path lifting to establish the bijection between homotopy classes of loops and integers (winding numbers). Homotopy invariance of lifted endpoints gives injectivity; surjectivity follows from lifting arbitrary loops. Additivity uses path concatenation of lifts in the simply connected total space `ℝ`.
## Test plan
- [x] `lake env lean Mathlib/Topology/Covering/FundamentalGroupCircle.lean` builds with 0 errors, 0 warnings |
t-topology
new-contributor
|
236/0 |
Mathlib.lean,Mathlib/Topology/Covering/FundamentalGroupCircle.lean |
2 |
22 |
['Ruizsolveall', 'SnirBroshi', 'b-mehta', 'github-actions', 'vihdzp'] |
nobody |
0-42874 11 hours ago |
0-70449 19 hours ago |
0-70340 19 hours |
| 35100 |
stepan2698-cpu author:stepan2698-cpu |
feat: definition of a character of a representation |
This PR begins to transfer definitions and theorems about characters from `FDRep` to `Representation`. Once #34888 is merged, the theorems involving isomorphisms of representations will be appropriately restated.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
new-contributor
label:t-algebra$ |
226/54 |
Mathlib/LinearAlgebra/Dimension/StrongRankCondition.lean,Mathlib/RepresentationTheory/Character.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RepresentationTheory/Invariants.lean,Mathlib/RepresentationTheory/Irreducible.lean |
5 |
16 |
['github-actions', 'ocfnash', 'stepan2698-cpu'] |
ocfnash assignee:ocfnash |
0-36095 10 hours ago |
0-36160 10 hours ago |
22-1919 22 days |
| 36130 |
vbeffara author:vbeffara |
feat(Combinatorics/SimpleGraphs): generalize SimpleGraph.map to any function |
The point is to be able to use map to define graph contractions. Added the injectivity assumption where needed.
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
new-contributor
easy
maintainer-merge
|
42/31 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean,Mathlib/Combinatorics/SimpleGraph/Coloring.lean,Mathlib/Combinatorics/SimpleGraph/Maps.lean,Mathlib/Combinatorics/SimpleGraph/Triangle/Basic.lean |
4 |
14 |
['SnirBroshi', 'YaelDillies', 'b-mehta', 'github-actions', 'vbeffara'] |
nobody |
0-34690 9 hours ago |
0-61236 16 hours ago |
0-62702 17 hours |
| 36084 |
emo916math author:emo916math |
feat(Analysis): Eliminate a hypothesis on IsTheta.rpow |
A strengthened version of `IsTheta.rpow`: if $f$ and $g$ are eventually nonnegative functions with $f = \Theta(g)$ and $r \in \mathbb{R}$, then $f^r = \Theta(g^r)$.
The previous version had a hypothesis that $r \geq 0$. The present version proves by splitting into two cases; in the case $r < 0$, the lower and upper bounds must be used in reverse order.
Since `IsTheta.rpow` is not used elsewhere in Mathlib, this should be an easy one to merge.
(Claude AI was used to help in the golfing.)
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
new-contributor
|
10/3 |
Mathlib/Analysis/SpecialFunctions/Pow/Asymptotics.lean |
1 |
3 |
['SnirBroshi', 'github-actions'] |
nobody |
0-26653 7 hours ago |
1-18643 1 day ago |
1-18534 1 day |
| 35659 |
BryceT233 author:BryceT233 |
chore(Data/Finsupp): update pointwise module structure |
This is the 3rd PR split from #34936 to make the review process easier.
It updates the pointwise module structure `Module (ι → R) (ι →₀ M)` where `R` is a semiring and `M` is an `R`-module.
---
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
26/18 |
Mathlib/Data/Finsupp/Pointwise.lean |
1 |
3 |
['github-actions', 'mathlib-merge-conflicts'] |
joneugster assignee:joneugster |
0-23675 6 hours ago |
0-23733 6 hours ago |
9-82565 9 days |
| 35665 |
BryceT233 author:BryceT233 |
feat(RingTheory/AdicCompletion): introduce AdicCompletion.finsuppSum |
This is split from #34936 to make the review process easier.
It introduces `AdicCompletion.finsuppSum`, which is a `Finsupp` version of `AdicCompletion.sum`.
---
- [x] depends on: #35595
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-ring-theory
|
93/0 |
Mathlib/LinearAlgebra/Finsupp/LSum.lean,Mathlib/RingTheory/AdicCompletion/Functoriality.lean |
2 |
4 |
['github-actions', 'joneugster', 'mathlib-dependent-issues'] |
riccardobrasca assignee:riccardobrasca |
0-20329 5 hours ago |
4-1705 4 days ago |
9-14070 9 days |
| 35696 |
GrigorenkoPV author:GrigorenkoPV |
fix(Data/Rel): change what `image_eq_cod_of_dom_subset` states |
It used to be identical to its neighbor, `preimage_eq_dom_of_cod_subset`.
Both lemmas seem to have been introduced in #25587.
---
I think this is technically a breaking change? Not sure what has to be done here.
[](https://gitpod.io/from-referrer/)
|
t-data
new-contributor
|
1/1 |
Mathlib/Data/Rel.lean |
1 |
2 |
['github-actions', 'vihdzp'] |
joneugster assignee:joneugster |
0-20328 5 hours ago |
9-30455 9 days ago |
9-30346 9 days |
| 35834 |
homeowmorphism author:homeowmorphism |
feat(Mathlib/GroupTheory/PresentedGroup): every group has a presentation |
We show that every group has a presentation defined by taking the free group with all of the group elements as the generators, and defining the relations as the kernel of the induced subjective homomorphism from that free group to the group itself.
Use of AI: This has been vibe-coded with GPT-Codex-5.3, was updated through review, and was double-checked by the author.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-group-theory
large-import
|
29/1 |
Mathlib/GroupTheory/PresentedGroup.lean |
1 |
12 |
['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'plp127', 'tb65536'] |
tb65536 assignee:tb65536 |
0-20326 5 hours ago |
3-63202 3 days ago |
3-63743 3 days |
| 35907 |
JJYYY-JJY author:JJYYY-JJY |
fix(Topology/Defs/Basic): preserve noncanonical topology instances in delaboration |
Preserve noncanonical topology instances in delaboration.
Restore local instances before checking whether topology arguments can be omitted during delaboration, and print `IsOpen[t]`, `IsClosed[t]`, `closure[t]`, and `Continuous[t₁, t₂]` when the topology instances are not canonical in the current local-instance context.
Previously, pretty-printing could silently drop noncanonical topology arguments, so declarations such as `LinearMap.mem_span_iff_continuous_of_finite` were rendered as if they used the default topology.
Closes #33238 |
t-topology
new-contributor
|
111/0 |
Mathlib/Topology/Defs/Basic.lean,MathlibTest/TopologyNonstandardNotation.lean |
2 |
4 |
['copilot-pull-request-reviewer', 'github-actions'] |
j-loreaux assignee:j-loreaux |
0-20326 5 hours ago |
4-11300 4 days ago |
4-11191 4 days |
| 33188 |
BryceT233 author:BryceT233 |
feat(RingTheory/MvPowerSeries): introduce rename |
This file establishes the `rename` operation on multivariate power series under a map with finite fibers,
which modifies the set of variables.
This file is patterned after `MvPolynomials/Rename.lean`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-ring-theory
large-import
|
415/1 |
Mathlib.lean,Mathlib/Data/Finsupp/Antidiagonal.lean,Mathlib/Data/Finsupp/Basic.lean,Mathlib/Data/Finsupp/Order.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/Order/Filter/Cofinite.lean,Mathlib/RingTheory/MvPowerSeries/Basic.lean,Mathlib/RingTheory/MvPowerSeries/Rename.lean |
8 |
45 |
['BryceT233', 'Komyyy', 'Ruben-VandeVelde', 'erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] |
erdOne and riccardobrasca assignee:riccardobrasca assignee:erdOne |
0-18337 5 hours ago |
0-33906 9 hours ago |
47-77773 47 days |
| 35585 |
farmanb author:farmanb |
feat(CategoryTheory/Abelian/Preradical): add Stenström's colon construction for preradicals |
Given preradicals `Φ` and `Ψ` on an abelian category `C`, this file defines their **colon** `Φ : Ψ`
in the sense of Stenström. Categorically, `Φ : Ψ` is constructed objectwise as a pullback of the
canonical projection `Φ.π X : X ⟶ Φ.quotient.obj X` along the inclusion
`Functor.whiskerLeft Φ.quotient Ψ.ι`.
---
- [x] depends on: #35514
[](https://gitpod.io/from-referrer/)
|
t-category-theory
new-contributor
|
184/0 |
Mathlib.lean,Mathlib/CategoryTheory/Abelian/Preradical/Basic.lean,Mathlib/CategoryTheory/Abelian/Preradical/Colon.lean |
3 |
7 |
['farmanb', 'github-actions', 'joelriou', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
0-16898 4 hours ago |
0-16927 4 hours ago |
0-49922 13 hours |
| 34937 |
tannerduve author:tannerduve |
feat(Computability): semilattice instance on Turing degrees |
This PR equips `TuringDegree` with a `SemilatticeSup` structure by introducing the Turing join, proving usual least-upper-bound properties, and lifting these to degrees (quotients). In support of this, it extends the existing `RecursiveIn` API with some lemmas used in the degree theory.
The main contribution is the `SemilatticeSup` instance on `TuringDegree`. We define the Turing join as follows
```
turingJoin (f g) : ℕ → ℕ -- notation: f ⊕ g
```
and prove it is a least upper bound:
* `left_le_join`, `right_le_join`
* `join_le`
* monotonicity and congruence lemmas (`join_mono`, `join_congr`)
We lift this to degrees in `TuringDegree.sup`, `TuringDegree.le_sup_left`, `TuringDegree.le_sup_right`, and `TuringDegree.sup_le`
```
instance : SemilatticeSup TuringDegree
```
**New additions to `RecursiveIn.lean`:**
- `liftPrim`, `liftPrimrec`, `RecursiveIn'`, `ComputableIn`, `ComputableIn₂`: Encodes partial/total functions between `Primcodable` types as `ℕ →. ℕ`, analogous to `Partrec`/`Computable`.
- `of_eq`, `of_eq_tot`, `of_primrec`, `some`, `none`, `mono`, `subst`: Standard closure properties for `RecursiveIn`.
- `cond_const`, `cond_core_rfind`, `cond`, `ComputableIn.cond`: Shows `RecursiveIn` is closed under conditionals when the guard is absolutely computable
- `Nat.Partrec.recursiveIn`, `Computable.computableIn`: Every partrec/computable function is recursive in any oracle set.
Small addition to `Partrec`
we add to `Mathlib.Computability.Partrec` a small helper def (`Partrec.kronecker` and related `rfind` lemmas) representing the function that returns 1 if its two (unpaired) arguments are equal, and 0 otherwise, which is used in the proof of `cond`
## TODO
Some current `RecursiveIn` proofs such as `cond_core_rfind` still work directly with the inductive constructors and are thus very long. A follow up could add a combinator-style closure library by essentially relativizing all the results and lemmas in `Partrec`, and proofs could be golfed heavily as they are in `Partrec`
## Note: AI Usage
[Aleph prover](https://logicalintelligence.com/aleph-coding-ai/) was allowed to prove an earlier version of `cond_core_rfind`, which included stating and proving the lemma `cond_const` but the proofs have since been iterated on manually
Cursor was allowed to run git commands and edit docstrings/headers, and was used in setting up the module structure of the files |
t-computability
new-contributor
large-import
|
644/63 |
Mathlib/Computability/Partrec.lean,Mathlib/Computability/RecursiveIn.lean,Mathlib/Computability/TuringDegree.lean |
3 |
14 |
['eric-wieser', 'github-actions', 'plp127', 'tannerduve', 'vihdzp'] |
nobody |
0-15252 4 hours ago |
15-39419 15 days ago |
25-8970 25 days |
| 35646 |
BryceT233 author:BryceT233 |
feat(Algebra): add two lemmas about submodule smul |
This is the first PR split from the larger PR #34936 to make the review process easier.
It adds the following two lemmas regarding pointwise smul and restrictScalars: `Submodule.restrictScalars_image_smul_eq_smul_restrictScalars` and `Submodule.restrictScalars_map_smul_eq_smul_restrictScalars`
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-algebra
label:t-algebra$ |
29/0 |
Mathlib/Algebra/Algebra/Operations.lean,Mathlib/RingTheory/Ideal/Maps.lean |
2 |
4 |
['github-actions', 'joneugster'] |
nobody |
0-11070 3 hours ago |
10-62656 10 days ago |
10-62547 10 days |
| 36104 |
LarsenClose author:LarsenClose |
feat(CategoryTheory/Endofunctor/Algebra): add Adámek's initial algebra theorem |
Adds Adámek's initial algebra theorem for endofunctors on categories
with an initial object. Given `F : C ⥤ C` where `C` has an initial
object, if the initial chain `⊥ → F(⊥) → F²(⊥) → ⋯` has a colimit
preserved by `F`, then `F` has an initial algebra whose structure map
is an isomorphism.
New files:
- `InitialChain.lean`: defines `iterateObj F n`, `iterateMap F n`,
and `initialChain F : ℕ ⥤ C` via `Functor.ofSequence`.
- `ChainShift.lean`: constructs `shiftCocone` and `extendCocone`,
proves `shiftCoconeIsColimit` (shifted cocone inherits colimit).
- `Adamek.lean`: main result. Constructs the initial `F`-algebra
`adamek F c hc` and proves `adamek_isInitial`. Convenience API:
`adamekFromInitial`, `adamekStructureIso`, `adamekFixedPoint`.
0 sorry. References Adámek 1974.
--- |
t-category-theory
new-contributor
|
505/0 |
Mathlib.lean,Mathlib/CategoryTheory/Endofunctor/Algebra/Adamek.lean,Mathlib/CategoryTheory/Endofunctor/Algebra/ChainShift.lean,Mathlib/CategoryTheory/Endofunctor/Algebra/InitialChain.lean,docs/references.bib |
5 |
2 |
['github-actions'] |
nobody |
0-5832 1 hour ago |
0-5897 1 hour ago |
0-5902 1 hour |
| 34742 |
Brian-Nugent author:Brian-Nugent |
feat(SheafCohomology): add API for Sheaf Cohomology |
Defines the long exact sequence on cohomology associated to a short exact sequence of sheaves `H.longSequence`. Also defines `H.equiv₀`, the additive equivalence between `H F 0` and `((sheafSections J AddCommGrpCat).obj (op T)).obj F` when the category has a terminal object `T`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
large-import
t-category-theory
|
118/2 |
Mathlib/Algebra/Category/Grp/ForgetCorepresentable.lean,Mathlib/CategoryTheory/Sites/Abelian.lean,Mathlib/CategoryTheory/Sites/SheafCohomology/Basic.lean |
3 |
22 |
['Brian-Nugent', 'adamtopaz', 'dagurtomas', 'github-actions', 'joelriou', 'joneugster'] |
adamtopaz assignee:adamtopaz |
0-4816 1 hour ago |
0-21844 6 hours ago |
22-64954 22 days |
| 36170 |
SproutSeeds author:SproutSeeds |
feat(ContMDiff): add smooth scalar-action typeclasses |
Closes #5617
Add `SmoothConstSMul` and `SmoothSMul` in `Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean`.
Add bridge instance `SmoothSMul.smoothConstSMul` to derive smooth constant scalar multiplication from smooth scalar multiplication.
Validation: targeted `lake build` and `lake exe runLinter --trace` passed, and local viability/overlap/naturality/local-gate/ready-to-draft checks passed.
Intelligent systems usage: tool=Codex; model=Codex 5.3; effort=extra high; workflow=ORP local-first gates (viability/overlap/naturality/targeted build+linter/draft CI); scope=drafting/refactoring/proof exploration including PR description drafting; final code choices and validation by me.
---
Happy to adjust naming, placement, or proof style based on maintainer preference.
|
t-differential-geometry
new-contributor
|
35/1 |
Mathlib/Geometry/Manifold/ContMDiff/NormedSpace.lean |
1 |
2 |
['github-actions'] |
nobody |
0-2091 34 minutes ago |
unknown |
0-0 0 seconds |
| 35707 |
BryceT233 author:BryceT233 |
feat(RingTheory/MvPowerSeries): introduce `truncTotal` |
This PR introduces the total degree truncation of multivariate formal power series when the index is finite, and uses it to establish the algebraic equivalence between `MvPowerSeries` and the adic completion of `MvPolynomial` with respect to the ideal spanned by all variables `idealOfVars`.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-ring-theory
|
214/2 |
Mathlib.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean |
4 |
6 |
['BryceT233', 'github-actions', 'joneugster', 'mathlib-bors', 'wwylele'] |
nobody |
0-1751 29 minutes ago |
0-14125 3 hours ago |
8-83307 8 days |
| 35600 |
yisiox author:yisiox |
Add implementation of Kleene's algorithm to show each regular language has a regex matching it |
This PR adds a proof that every regular language has some regular expression matching it.
This was achieved by the following constructions and proofs of their correctness
- Define `toSingleεNFA` to transform any epsilon-NFA to an equivalent one with only a single start and accept state (and the type is `ExtendedState`)
- Define a bijection between `ExtendedState` and `Fin (FinEnum.card (ExtendedState σ))` to index the states
- Define `pathRegex` which implements Kleene's algorithm
- Define `toRegex` which takes an epsilon-NFA, applies `toSingleεNFA` on it, and computes the corresponding regex using `pathRegex`
The proofs of correctness chain together to yield `(toRegex M).matches' = M.accepts` which asserts the direction of Kleene's theorem required.
---
[](https://gitpod.io/from-referrer/)
|
t-computability
new-contributor
|
499/0 |
Mathlib/Computability/EpsilonNFA.lean |
1 |
2 |
['github-actions'] |
nobody |
0-890 14 minutes ago |
unknown |
0-0 0 seconds |