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-5338 1 month ago |
35-5356 1 month ago |
45-81790 45 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-4679 1 month ago |
35-4697 1 month ago |
40-62506 40 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-4187 1 month ago |
35-4206 1 month ago |
40-61649 40 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 |
34-45502 1 month ago |
43-35791 1 month ago |
44-6812 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 |
33-67476 1 month ago |
33-67862 1 month ago |
45-26933 45 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/)
|
t-combinatorics
new-contributor
large-import
|
61/39 |
Mathlib/Combinatorics/Enumerative/Schroder.lean |
1 |
19 |
['FlAmmmmING', 'github-actions', 'vihdzp'] |
awainverse assignee:awainverse |
33-45518 1 month ago |
53-6230 1 month ago |
53-6276 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 |
33-45515 1 month ago |
41-65929 1 month ago |
41-65974 41 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 |
32-45525 1 month ago |
47-38617 1 month ago |
47-38657 47 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 |
31-45476 1 month ago |
60-8637 2 months ago |
60-8670 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 |
30-74815 1 month ago |
49-62733 1 month ago |
49-62709 49 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 |
30-26974 1 month ago |
42-84152 1 month ago |
42-84198 42 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/)
|
t-measure-probability
new-contributor
|
24/0 |
Mathlib/MeasureTheory/Function/AEEqOfLIntegral.lean |
1 |
4 |
['github-actions', 'jvanwinden', 'urkud'] |
kex-y assignee:kex-y |
28-79317 1 month ago |
28-79317 1 month ago |
38-81773 38 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 |
28-55285 1 month ago |
28-55285 1 month ago |
81-5060 81 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 |
24 |
['SnirBroshi', 'github-actions', 'jcommelin', 'ksenono'] |
awainverse assignee:awainverse |
28-54112 1 month ago |
28-54112 1 month ago |
81-26813 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 |
28-45501 1 month ago |
31-57490 1 month ago |
32-12181 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 |
27-74391 27 days ago |
27-74586 27 days ago |
36-76243 36 days |
| 34427 |
CoolRmal author:CoolRmal |
feat(MeasureTheory): Strong measurability is preserved under division in a group with zero |
I proved that if `f,g` are two strongly measurable functions taking values in a group with zero, then `f/g` is still strongly measurable.
As mentioned over here [#Is there code for X? > StronglyMeaurable.div₀](https://leanprover.zulipchat.com/#narrow/channel/217875-Is-there-code-for-X.3F/topic/StronglyMeaurable.2Ediv.E2.82.80/with/569988425), I probably should also change the name of [MeasureTheory.StronglyMeasurable.div](https://leanprover-community.github.io/mathlib4_docs/Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.html#MeasureTheory.StronglyMeasurable.div) into `StronglyMeasurable.div'` according to the docstring of [ContinuousDiv](https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Algebra/Group/Defs.html#ContinuousDiv). If I do this, then @to_additive will generate a theorem named `StronglyMeasurable.sub'`, which is a bit weird, so I am unsure whether I should change these names.
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
37/8 |
Mathlib/MeasureTheory/Function/StronglyMeasurable/AEStronglyMeasurable.lean,Mathlib/MeasureTheory/Function/StronglyMeasurable/Basic.lean,Mathlib/Probability/Process/Adapted.lean |
3 |
3 |
['CoolRmal', 'EtienneC30', 'github-actions'] |
kex-y assignee:kex-y |
27-16734 27 days ago |
27-20504 27 days ago |
35-64068 35 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 |
26-45609 26 days ago |
30-34980 1 month ago |
30-35018 30 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 |
26-45608 26 days ago |
29-75394 1 month ago |
29-75513 29 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 |
new-contributor
t-data
large-import
|
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 |
25-75302 25 days ago |
41-81629 1 month ago |
42-41886 42 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 |
25-69512 25 days ago |
43-65618 1 month ago |
43-65659 43 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 |
['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
ADedecker assignee:ADedecker |
25-45603 25 days ago |
30-57477 1 month ago |
30-57451 30 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 |
23-45595 23 days ago |
28-29705 1 month ago |
28-30940 28 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 |
23-45593 23 days ago |
35-5130 1 month ago |
40-68002 40 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 |
22-45328 22 days ago |
26-45718 26 days ago |
28-85662 28 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 |
22-45323 22 days ago |
28-60408 1 month ago |
28-60452 28 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-21054 22 days ago |
22-21054 22 days ago |
90-40268 90 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/)
|
t-logic
new-contributor
|
147/0 |
Mathlib/ModelTheory/Definability.lean |
1 |
59 |
['NoneMore', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator'] |
awainverse assignee:awainverse |
22-15090 22 days ago |
54-24810 1 month ago |
82-24012 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 |
21-45442 21 days ago |
25-19898 25 days ago |
25-21399 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 |
21-45441 21 days ago |
33-76042 1 month ago |
34-21429 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 |
21-45437 21 days ago |
25-2630 25 days ago |
30-3894 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 |
21-45433 21 days ago |
28-60181 1 month ago |
28-60221 28 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 |
20-81857 20 days ago |
21-12310 21 days ago |
21-12367 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 |
20-45592 20 days ago |
23-71602 23 days ago |
23-71650 23 days |
| 34994 |
bwangpj author:bwangpj |
feat: Countable.of_module_finite |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
FLT
large-import
label:t-algebra$ |
7/0 |
Mathlib/LinearAlgebra/Countable.lean |
1 |
3 |
['bwangpj', 'eric-wieser', 'github-actions'] |
eric-wieser assignee:eric-wieser |
20-38836 20 days ago |
23-61866 23 days ago |
23-63674 23 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 |
19-45575 19 days ago |
23-35825 23 days ago |
23-35800 23 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/)
|
new-contributor
t-ring-theory
|
124/0 |
Mathlib.lean,Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean |
2 |
25 |
['WilliamCoram', 'erdOne', 'fbarroero', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] |
alreadydone assignee:alreadydone |
18-85875 18 days ago |
22-76904 22 days ago |
50-72284 50 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 |
18-58470 18 days ago |
18-58470 18 days ago |
80-15670 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 |
18-52603 18 days ago |
27-40346 27 days ago |
29-73922 29 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 |
18-52586 18 days ago |
45-65782 1 month ago |
46-51590 46 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/)
|
t-data
large-import
|
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 |
18-45609 18 days ago |
24-83140 24 days ago |
29-62544 29 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 |
18-45608 18 days ago |
21-50191 21 days ago |
28-9696 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 |
17-45602 17 days ago |
21-50959 21 days ago |
21-53348 21 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 |
17-45321 17 days ago |
17-45341 17 days ago |
18-58436 18 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 |
17-42920 17 days ago |
17-42995 17 days ago |
17-43167 17 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 |
9 |
['JohnnyTeutonic', 'eric-wieser', 'github-actions'] |
riccardobrasca assignee:riccardobrasca |
16-45600 16 days ago |
37-7977 1 month ago |
37-8010 37 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 |
16-45594 16 days ago |
20-55631 20 days ago |
20-55678 20 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-4686 16 days ago |
16-5848 16 days ago |
16-5904 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 |
t-meta
CI
|
74/31 |
Cache/IO.lean,Cache/Main.lean |
2 |
2 |
['github-actions', 'joneugster'] |
eric-wieser assignee:eric-wieser |
15-74366 15 days ago |
15-74366 15 days ago |
15-75165 15 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 |
15-73448 15 days ago |
15-75187 15 days ago |
15-75237 15 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 |
15-65411 15 days ago |
26-16144 26 days ago |
26-16195 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 |
15-64721 15 days ago |
31-9752 1 month ago |
40-10550 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 |
15-64654 15 days ago |
35-60462 1 month ago |
35-67162 35 days |
| 34601 |
themathqueen author:themathqueen |
feat(Combinatorics/SimpleGraph/AdjMatrix): adjacency matrix API |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics
large-import
|
117/19 |
Mathlib/Combinatorics/SimpleGraph/AdjMatrix.lean |
1 |
21 |
['b-mehta', 'eric-wieser', 'github-actions', 'mathlib-merge-conflicts', 'themathqueen'] |
kmill assignee:kmill |
15-62809 15 days ago |
15-62869 15 days ago |
33-16633 33 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 |
15-59455 15 days ago |
21-71133 21 days ago |
23-5403 23 days |
| 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 |
3 |
['SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
15-47969 15 days ago |
17-50300 17 days ago |
17-50353 17 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 |
15-39059 15 days ago |
15-39059 15 days ago |
23-16459 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-17558 15 days ago |
15-20837 15 days ago |
15-59772 15 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 |
14-84830 14 days ago |
22-1170 22 days ago |
51-33491 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 |
14-80643 14 days ago |
100-24092 3 months ago |
100-54980 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 |
14-60705 14 days ago |
16-4658 16 days ago |
16-4708 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). |
new-contributor
t-data
|
22/0 |
Mathlib/Data/Matrix/Mul.lean |
1 |
5 |
['dennj', 'eric-wieser', 'github-actions', 'themathqueen'] |
pechersky assignee:pechersky |
14-51619 14 days ago |
27-61027 27 days ago |
27-61070 27 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 |
14-47088 14 days ago |
15-46386 15 days ago |
125-81735 125 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 |
13-78636 13 days ago |
16-78606 16 days ago |
16-78654 16 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 |
13-45606 13 days ago |
25-49392 25 days ago |
38-2700 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
maintainer-merge
FLT
|
25/0 |
Mathlib/Topology/Algebra/Ring/Basic.lean |
1 |
10 |
['bwangpj', 'dagurtomas', 'eric-wieser', 'github-actions', 'riccardobrasca'] |
dagurtomas assignee:dagurtomas |
13-21056 13 days ago |
19-72178 19 days ago |
42-23204 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 |
12-45614 12 days ago |
24-69485 24 days ago |
24-69534 24 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 |
n/a |
['github-actions', 'lauramonk', 'mcdoll', 'urkud'] |
ADedecker assignee:ADedecker |
12-31825 12 days ago |
unknown |
unknown |
| 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 |
12-28884 12 days ago |
12-28884 12 days ago |
40-30316 40 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 |
11-45625 11 days ago |
29-69907 1 month ago |
29-70626 29 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 |
11-45613 11 days ago |
15-4212 15 days ago |
15-4262 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 |
11-45611 11 days ago |
14-80387 14 days ago |
14-80436 14 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/)
|
t-measure-probability
new-contributor
|
32/0 |
Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean |
2 |
2 |
['github-actions'] |
RemyDegenne assignee:RemyDegenne |
11-45611 11 days ago |
14-75099 14 days ago |
14-75184 14 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 |
11-45609 11 days ago |
14-60535 14 days ago |
14-60593 14 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 |
11-42480 11 days ago |
11-42499 11 days ago |
70-65082 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 |
11-38551 11 days ago |
27-44841 27 days ago |
27-44900 27 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/)
|
t-combinatorics
large-import
|
45/4 |
Mathlib/Combinatorics/SimpleGraph/LineGraph.lean,Mathlib/Data/Sym/Sym2.lean |
2 |
6 |
['SnirBroshi', 'github-actions', 'tb65536'] |
b-mehta assignee:b-mehta |
11-37949 11 days ago |
11-39303 11 days ago |
65-13022 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-4282 11 days ago |
18-33886 18 days ago |
18-33944 18 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-1157 11 days ago |
37-5807 1 month ago |
38-3730 38 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/)
|
t-measure-probability
new-contributor
|
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 |
10-74066 10 days ago |
11-39588 11 days ago |
23-18162 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 |
10-62654 10 days ago |
10-62691 10 days ago |
38-85448 38 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 |
10-50117 10 days ago |
10-50121 10 days ago |
10-50169 10 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 |
10-49249 10 days ago |
10-49249 10 days ago |
10-49303 10 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 |
10-49143 10 days ago |
10-54858 10 days ago |
10-54903 10 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 |
10-46980 10 days ago |
10-47006 10 days ago |
10-47048 10 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 |
10-46390 10 days ago |
10-70689 10 days ago |
40-58148 40 days |
| 35312 |
Komyyy author:Komyyy |
feat(Order/Filter/Pointwise): `((∀ᶠ|∃ᶠ) x in op f, p x) ↔ ((∀ᶠ|∃ᶠ) x in f, p (op x))` |
This lemma is required when I prove that $z \mapsto \sin^{-1} z^{-1}$ is not meromorphic at $0$:
```lean4
@[simp]
lemma Filter.frequently_inv {α : Type*} [Inv α] {f : Filter α} {p : α → Prop} :
(∃ᶠ a in f⁻¹, p a) ↔ (∃ᶠ a in f, p a⁻¹) :=
frequently_map
example : ¬(∀ᶠ z in 𝓝[≠] (0 : ℂ), sin⁻¹ z⁻¹ = 0) ↔ (∃ᶠ z in cobounded ℂ, sin z ≠ 0) := by
simp [← inv_cobounded₀]
```
So I added the simp lemmas of `(∀ᶠ|∃ᶠ) x in op f, p x` for unary operations `op` (`-f`, `f⁻¹` & `a • f`).
While I was at it, I also added the simp lemmas of `∃ᶠ x in pure a, p x` & `∃ᶠ x in (0|1), p x`, which previously existed only for the `∀ᶠ` versions.
Binary operation versions will be added if necessary.
Appendix: Full proof of that $z \mapsto \sin^{-1} z^{-1}$ is not meromorphic at $0$
```lean4
module
import Mathlib.Analysis.Meromorphic.Basic
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv
import Mathlib.Analysis.SpecificLimits.RCLike
open Complex Filter Bornology
open scoped Real Topology Pointwise
@[simp]
lemma Filter.frequently_inv {α : Type*} [Inv α] {f : Filter α} {p : α → Prop} :
(∃ᶠ a in f⁻¹, p a) ↔ (∃ᶠ a in f, p a⁻¹) :=
frequently_map
example : ¬MeromorphicAt (fun z => sin⁻¹ z⁻¹) 0 := by
apply mt MeromorphicAt.eventually_eq_zero_or_eventually_ne_zero
conv => equals (∃ᶠ z in cobounded ℂ, sin z ≠ 0) ∧ (∃ᶠ z in cobounded ℂ, sin z = 0) =>
simp [← inv_cobounded₀]
constructor
case left =>
have ht : Tendsto (fun x : ℝ ↦ ↑x * I) (cobounded ℝ) (cobounded ℂ) := by
have ht₁ : Tendsto ((↑) : ℝ → ℂ) (cobounded ℝ) (cobounded ℂ) :=
RCLike.tendsto_ofReal_cobounded_cobounded ℂ
have ht₂ : Tendsto (fun z : ℂ ↦ z * I) (cobounded ℂ) (cobounded ℂ) :=
tendsto_mul_right_cobounded (by simp)
exact ht₂.comp ht₁
refine ht.frequently_map _ (fun x ↦ mt ?_) (eventually_ne_cobounded 0).frequently
rw [sin_eq_zero_iff]
rintro ⟨n, hn⟩
simpa using congr_arg im hn
case right =>
suffices ht : Tendsto (fun n : ℤ ↦ (↑n * ↑π : ℂ)) atTop (cobounded ℂ) by
apply ht.frequently; simp [sin_int_mul_pi, atTop_neBot]
have ht₁ : Tendsto ((↑) : ℤ → ℝ) atTop (cobounded ℝ) := tendsto_intCast_atTop_cobounded
have ht₂ : Tendsto ((↑) : ℝ → ℂ) (cobounded ℝ) (cobounded ℂ) :=
RCLike.tendsto_ofReal_cobounded_cobounded ℂ
have ht₃ : Tendsto (fun z : ℂ ↦ z * ↑π) (cobounded ℂ) (cobounded ℂ) :=
tendsto_mul_right_cobounded (by simp)
exact ht₃.comp <| ht₂.comp ht₁
```
---
[](https://gitpod.io/from-referrer/)
|
t-order |
24/0 |
Mathlib/Order/Filter/Map.lean,Mathlib/Order/Filter/Pointwise.lean |
2 |
1 |
['github-actions'] |
Vierkantor assignee:Vierkantor |
10-45589 10 days ago |
17-76693 17 days ago |
17-76730 17 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-9830 10 days ago |
10-44087 10 days ago |
10-44140 10 days |
| 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 |
new-contributor
t-computability
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 |
9-61624 9 days ago |
14-64707 14 days ago |
25-28179 25 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 |
9-57023 9 days ago |
10-45033 10 days ago |
11-31917 11 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/)
|
t-measure-probability
new-contributor
|
200/0 |
Mathlib/Probability/Distributions/Exponential.lean |
1 |
6 |
['JoaBjo', 'Timeroot', 'github-actions'] |
kex-y assignee:kex-y |
9-45614 9 days ago |
13-66413 13 days ago |
13-66467 13 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-20026 9 days ago |
23-20202 23 days ago |
23-20240 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 |
8-53834 8 days ago |
8-56496 8 days ago |
8-76442 8 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 |
8-52226 8 days ago |
31-57668 1 month ago |
67-40040 67 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 |
8-45613 8 days ago |
24-44547 24 days ago |
32-63631 32 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 |
new-contributor
t-group-theory
|
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 |
8-45612 8 days ago |
8-51995 8 days ago |
18-7063 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 |
8-45605 8 days ago |
15-4680 15 days ago |
15-4734 15 days |
| 35549 |
JovanGerb author:JovanGerb |
fix(Translate): don't look in arguments of free variables in `shouldTranslate` |
This PR addresses a `to_additive` limitation reported at [#mathlib4 > #35179 breaks to_additive call in FLT](https://leanprover.zulipchat.com/#narrow/channel/287929-mathlib4/topic/.2335179.20breaks.20to_additive.20call.20in.20FLT/with/574823087) by making sure `shouldTranslate` doesn't looks at the arguments of free variable applications
This PR refactors `shouldTranslate` in a few ways
- The monad is changed from `OptionT` to `ExceptT`, with the underlying type changing from `Option Expr` to `ExceptT Expr Unit`. Although this is technically a bit less efficient, it makes the program shorter and more intuitive, because a failure now actually corresponds to a monadic failure instead of a monadic success.
- When visiting a `Expr.app` node, we now loop through the whole application at once, instead of doing this step by step and checking the cache at each step. This allows us to detect when the head is a free variable, and skip its arguments. It also lets us deal with `ignoreArgsAttr` more naturally.
- This change removes the need for the `inApp : Bool` argument that used to be passed around in order to tell whether a constant was in an application.
---
[](https://gitpod.io/from-referrer/)
|
t-meta |
44/39 |
Mathlib/Tactic/Translate/Core.lean,Mathlib/Tactic/Translate/ToAdditive.lean,Mathlib/Tactic/Translate/ToDual.lean,MathlibTest/toAdditive.lean |
4 |
5 |
['JovanGerb', 'github-actions', 'leanprover-radar'] |
dwrensha assignee:dwrensha |
8-45600 8 days ago |
12-45476 12 days ago |
12-48363 12 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 |
278/0 |
Mathlib.lean,Mathlib/Geometry/Euclidean/Angle/Incenter.lean |
2 |
4 |
['github-actions', 'jsm28', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'wwylele'] |
JovanGerb assignee:JovanGerb |
18-45611 18 days ago |
21-85621 21 days ago |
22-1670 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-13375 8 days ago |
10-10189 10 days ago |
10-10238 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-3291 8 days ago |
8-3291 8 days ago |
20-39024 20 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/)
|
t-order
large-import
|
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 |
7-85131 7 days ago |
17-12718 17 days ago |
20-56284 20 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 |
7-82887 7 days ago |
10-31639 10 days ago |
10-31687 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 |
7-73684 7 days ago |
13-18107 13 days ago |
13-80732 13 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 |
7-67576 7 days ago |
9-48375 9 days ago |
9-48427 9 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 |
7-49982 7 days ago |
18-9798 18 days ago |
18-9851 18 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/)
|
new-contributor
t-data
|
1/1 |
Mathlib/Data/Rel.lean |
1 |
2 |
['github-actions', 'vihdzp'] |
nobody |
7-48084 7 days ago |
8-55643 8 days ago |
8-55713 8 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 |
7-46278 7 days ago |
15-84823 15 days ago |
93-39984 93 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/)
|
t-order
new-contributor
large-import
|
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 |
7-45593 7 days ago |
18-73756 18 days ago |
28-41213 28 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 |
7-45592 7 days ago |
30-3344 1 month ago |
30-58814 30 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 |
7-45589 7 days ago |
12-82683 12 days ago |
22-27068 22 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 |
7-45588 7 days ago |
14-15526 14 days ago |
15-29346 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/)
|
t-number-theory
new-contributor
|
26/10 |
Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean |
2 |
8 |
['FrankieeW', 'github-actions', 'vihdzp'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
7-45585 7 days ago |
12-40581 12 days ago |
14-994 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 |
7-45583 7 days ago |
12-8295 12 days ago |
12-8345 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 |
7-45578 7 days ago |
11-51187 11 days ago |
11-51164 11 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 |
7-39009 7 days ago |
7-39085 7 days ago |
17-45280 17 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
maintainer-merge
t-algebraic-topology
|
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 |
7-33160 7 days ago |
7-77823 7 days ago |
19-38234 19 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-13318 7 days ago |
7-13380 7 days ago |
38-55819 38 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/)
|
t-analysis
large-import
|
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 |
6-85782 6 days ago |
6-85805 6 days ago |
23-28510 23 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/)
|
t-algebra
new-contributor
label:t-algebra$ |
46/16 |
Mathlib/Algebra/Order/BigOperators/Expect.lean,Mathlib/Analysis/RCLike/Basic.lean |
2 |
1 |
['github-actions'] |
thorimur assignee:thorimur |
6-83472 6 days ago |
31-9730 1 month ago |
57-15840 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-number-theory
t-algebra
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 |
6-79816 6 days ago |
6-79816 6 days ago |
9-34796 9 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 |
6-71946 6 days ago |
7-6343 7 days ago |
41-21612 41 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 |
6-53890 6 days ago |
6-54151 6 days ago |
6-54126 6 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 |
6-47252 6 days ago |
6-47252 6 days ago |
16-67581 16 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 |
6-45615 6 days ago |
13-63863 13 days ago |
16-2163 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 |
6-34504 6 days ago |
6-43928 6 days ago |
35-16281 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-17260 6 days ago |
9-84804 9 days ago |
12-82936 12 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-13565 6 days ago |
6-13565 6 days ago |
43-23004 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-4974 6 days ago |
44-50261 1 month ago |
54-31023 54 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 |
5-81606 5 days ago |
16-76708 16 days ago |
16-76755 16 days |
| 33449 |
yuanyi-350 author:yuanyi-350 |
feat(ProbabilityTheory): Add Poisson limit theorem |
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
maintainer-merge
file-removed
|
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 |
5-74834 5 days ago |
5-75942 5 days ago |
62-4383 62 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 |
5-74686 5 days ago |
5-74690 5 days ago |
5-74736 5 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 |
5-63918 5 days ago |
5-63919 5 days ago |
22-4055 22 days |
| 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$ |
170/6 |
Mathlib/RepresentationTheory/Character.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RepresentationTheory/Invariants.lean,Mathlib/RepresentationTheory/Irreducible.lean |
4 |
8 |
['github-actions', 'ocfnash', 'stepan2698-cpu'] |
ocfnash assignee:ocfnash |
5-60751 5 days ago |
5-60751 5 days ago |
21-43966 21 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 |
5-45623 5 days ago |
9-68055 9 days ago |
9-68104 9 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 |
5-45622 5 days ago |
9-64295 9 days ago |
9-64270 9 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 |
5-45620 5 days ago |
9-52762 9 days ago |
9-52812 9 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 |
5-45618 5 days ago |
8-59709 8 days ago |
8-59684 8 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 |
5-40906 5 days ago |
11-77730 11 days ago |
11-77705 11 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 |
28 |
['github-actions', 'jcommelin', 'kim-em', 'metakunt', 'vihdzp'] |
kim-em assignee:kim-em |
5-28358 5 days ago |
5-32026 5 days ago |
9-18200 9 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 |
5-27302 5 days ago |
5-31171 5 days ago |
8-10990 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 |
5-25289 5 days ago |
9-57724 9 days ago |
9-57769 9 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-25181 5 days ago |
9-20290 9 days ago |
9-20342 9 days |
| 35552 |
vihdzp author:vihdzp |
chore(SetTheory/Ordinal/Basic): remove `backward.privateInPublic` |
---
[](https://gitpod.io/from-referrer/)
|
tech debt
t-set-theory
|
7/27 |
Mathlib/SetTheory/Ordinal/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
5-18179 5 days ago |
5-18292 5 days ago |
12-48719 12 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-12344 5 days ago |
5-12519 5 days ago |
5-13487 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-4697 5 days ago |
22-2351 22 days ago |
22-2391 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-2776 5 days ago |
5-2776 5 days ago |
5-2823 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-364 5 days ago |
61-76473 2 months ago |
61-76510 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 |
4-86359 4 days ago |
15-21152 15 days ago |
15-21202 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/)
|
t-meta
CI
|
34/15 |
Cache/Hashing.lean,Cache/IO.lean,Cache/Main.lean |
3 |
3 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
4-82746 4 days ago |
4-82768 4 days ago |
7-34838 7 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/)
|
new-contributor
t-data
|
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 |
4-81033 4 days ago |
11-61922 11 days ago |
11-84627 11 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 |
4-78870 4 days ago |
6-3362 6 days ago |
20-73924 20 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 |
4-78650 4 days ago |
4-78650 4 days ago |
18-6673 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 |
4-78054 4 days ago |
4-78061 4 days ago |
29-67392 29 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.
---
|
t-differential-geometry
new-contributor
|
186/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Instances/OrbitSpace.lean,Mathlib/Topology/Algebra/OrbitSpace.lean |
3 |
2 |
['github-actions'] |
grunweg assignee:grunweg |
4-76913 4 days ago |
6-14915 6 days ago |
9-65969 9 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 |
4-67432 4 days ago |
4-67455 4 days ago |
10-29879 10 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 |
4-60356 4 days ago |
4-67565 4 days ago |
10-15088 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 |
4-58169 4 days ago |
5-53416 5 days ago |
5-53475 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 |
4-57747 4 days ago |
5-14182 5 days ago |
5-14233 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 |
4-55827 4 days ago |
4-55827 4 days ago |
4-55802 4 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 |
4-52161 4 days ago |
5-73992 5 days ago |
5-74042 5 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 |
4-51382 4 days ago |
4-51382 4 days ago |
15-49195 15 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 |
4-45639 4 days ago |
19-1459 19 days ago |
19-1507 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 |
4-45637 4 days ago |
12-64833 12 days ago |
12-64809 12 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 |
4-45635 4 days ago |
11-39365 11 days ago |
11-45846 11 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 |
4-45633 4 days ago |
10-62977 10 days ago |
10-63285 10 days |
| 35672 |
dennj author:dennj |
feat(RingTheory/Polynomial/Cyclotomic): vanishing sums and fiber equidistribution at primitive roots |
## Summary
Building on `sum_eq_zero_iff_forall_eq` from #34592, this PR adds:
- `cyclotomic_prime_coeff_eq_one`: for prime `p`, all coefficients of `cyclotomic p R` equal `1`.
- `eq_nsmul_cyclotomic_of_nonneg_coeff`: a nonneg-coefficient polynomial vanishing at a primitive root is a positive scalar multiple of the cyclotomic polynomial.
- `card_fiber_eq_card_div`: if a function `d : A → ZMod p` satisfies `∑ ζ^(d a) = 0`, then every fiber has cardinality `|A| / p`.
These results are useful for combinatorial applications involving exponential sums and equidistribution over cyclic groups.
Theorems imported from: https://github.com/Latinum-Agentic-Commerce/AlgebraicDesignTheory |
new-contributor
t-ring-theory
|
101/1 |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean |
2 |
2 |
['github-actions'] |
chrisflav assignee:chrisflav |
4-45631 4 days ago |
9-32761 9 days ago |
9-32786 9 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 |
4-45629 4 days ago |
7-79808 7 days ago |
7-80024 7 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 |
4-45628 4 days ago |
7-76228 7 days ago |
7-76205 7 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 |
4-32477 4 days ago |
10-34139 10 days ago |
10-34196 10 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 |
4-30264 4 days ago |
4-30296 4 days ago |
4-30310 4 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 |
4-28964 4 days ago |
4-31614 4 days ago |
4-62610 4 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 |
4-26231 4 days ago |
4-76566 4 days ago |
156-67375 156 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 |
4-26099 4 days ago |
4-26166 4 days ago |
4-26149 4 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-13523 4 days ago |
4-13523 4 days ago |
36-80283 36 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-13431 4 days ago |
5-35254 5 days ago |
5-35303 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-5854 4 days ago |
7-85426 7 days ago |
7-85475 7 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-5712 4 days ago |
4-55911 4 days ago |
5-36838 5 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/)
|
t-number-theory
large-import
|
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 |
3-84014 3 days ago |
5-20661 5 days ago |
13-6522 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 |
3-83684 3 days ago |
3-83708 3 days ago |
15-18790 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 |
3-82284 3 days ago |
6-71333 6 days ago |
6-71338 6 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 |
3-75956 3 days ago |
6-78044 6 days ago |
6-78195 6 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 |
3-73434 3 days ago |
3-73434 3 days ago |
24-39813 24 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 |
3-68998 3 days ago |
3-68998 3 days ago |
33-56082 33 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 |
3-68099 3 days ago |
3-68100 3 days ago |
3-69623 3 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 |
3-66974 3 days ago |
7-38012 7 days ago |
17-31555 17 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
t-analysis
new-contributor
|
62/0 |
Mathlib/Analysis/Complex/CauchyIntegral.lean |
1 |
7 |
['MichaelStollBayreuth', 'github-actions', 'mkaratarakis'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
3-66955 3 days ago |
11-54050 11 days ago |
16-60253 16 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 |
3-61291 3 days ago |
3-61291 3 days ago |
14-68732 14 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 |
3-60837 3 days ago |
3-60837 3 days ago |
8-12522 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 |
3-53406 3 days ago |
3-75787 3 days ago |
3-75845 3 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
large-import
t-ring-theory
|
414/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 |
36 |
['BryceT233', 'Komyyy', 'erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] |
erdOne and riccardobrasca assignee:riccardobrasca assignee:erdOne |
3-48459 3 days ago |
29-47275 1 month ago |
48-8117 48 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 |
3-45515 3 days ago |
9-70386 9 days ago |
9-71260 9 days |
| 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 ℤ`.
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.
This is a dependency of a larger PR to formalize finitely presented groups https://github.com/leanprover-community/mathlib4/pull/34236.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-group-theory
|
45/6 |
Mathlib/GroupTheory/FreeGroup/Basic.lean |
1 |
39 |
['b-mehta', 'copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'kbuzzard', 'tb65536'] |
riccardobrasca assignee:riccardobrasca |
3-45514 3 days ago |
15-70281 15 days ago |
23-13390 23 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 |
3-45512 3 days ago |
13-16380 13 days ago |
13-16355 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/)
|
new-contributor
maintainer-merge
|
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 |
3-45511 3 days ago |
11-81587 11 days ago |
11-85935 11 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 |
3-45504 3 days ago |
7-38765 7 days ago |
7-38820 7 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 |
3-45499 3 days ago |
6-75176 6 days ago |
6-75151 6 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'] |
nobody |
3-45052 3 days ago |
7-5415 7 days ago |
0-0 0 seconds |
| 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 |
3-42784 3 days ago |
3-42808 3 days ago |
4-49558 4 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 |
3-38169 3 days ago |
3-45525 3 days ago |
3-45580 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'] |
nobody |
3-36304 3 days ago |
3-36507 3 days ago |
3-36558 3 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'] |
nobody |
3-29317 3 days ago |
3-30477 3 days ago |
3-30470 3 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'] |
nobody |
3-26921 3 days ago |
4-51153 4 days ago |
8-67118 8 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'] |
nobody |
3-18824 3 days ago |
3-18915 3 days ago |
3-18890 3 days |
| 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 |
192/0 |
Mathlib.lean,Mathlib/RingTheory/FormalGroup/Basic.lean |
2 |
1 |
['github-actions'] |
nobody |
3-10822 3 days ago |
3-15885 3 days ago |
3-15934 3 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-9269 3 days ago |
3-10097 3 days ago |
12-22635 12 days |
| 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'] |
nobody |
3-7303 3 days ago |
3-34719 3 days ago |
3-34956 3 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-4071 3 days ago |
4-51138 4 days ago |
8-37199 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 |
2-84906 2 days ago |
2-84929 2 days ago |
23-60487 23 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 |
2-78064 2 days ago |
2-78090 2 days ago |
17-22699 17 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'] |
nobody |
2-71376 2 days ago |
3-1807 3 days ago |
3-1862 3 days |
| 30339 |
grunweg author:grunweg |
feat: extend a tangent vector for a locally smooth vector field |
Given a vector bundle `V` over `M` and a vector `X` in the fibre `E x` some point `x`,
construct a section of `V` which is smooth near `x` and has value `X` at `x`.
This will be used to prove the tensoriality of covariant derivatives.
From the path towards geodesics and the Levi-Civita connection.
Co-authored-by: Patrick Massot [patrickmassot@free.fr](mailto:patrickmassot@free.fr)
---
Open questions I'd like a second opinion on:
- should this definition be generalised to any local frame (on some set `U ∋ x`)? this would be easy; at the moment, I don't see how we would need that
- should the new definition be namespaced, e.g. in the Trivialization namespace?
- order of the explicit arguments: first e then b, or the other way around? might be resolved by the previous point
- [x] depends on: #30083
[](https://gitpod.io/from-referrer/)
|
t-differential-geometry |
95/3 |
Mathlib/Geometry/Manifold/VectorBundle/LocalFrame.lean |
1 |
8 |
['github-actions', 'grunweg', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot', 'ocfnash'] |
ocfnash assignee:ocfnash |
2-69923 2 days ago |
2-69975 2 days ago |
2-72975 2 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/)
|
t-meta
large-import
|
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 |
2-65788 2 days ago |
2-65788 2 days ago |
52-29826 52 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
large-import
t-group-theory
|
29/1 |
Mathlib/GroupTheory/PresentedGroup.lean |
1 |
12 |
['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'plp127', 'tb65536'] |
nobody |
2-57193 2 days ago |
3-2522 3 days ago |
3-2761 3 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 |
2-54630 2 days ago |
2-54630 2 days ago |
9-83966 9 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'] |
nobody |
2-54264 2 days ago |
2-54368 2 days ago |
2-54344 2 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 |
2-53290 2 days ago |
11-43508 11 days ago |
17-22316 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 |
2-47608 2 days ago |
6-73134 6 days ago |
6-73109 6 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 |
2-45620 2 days ago |
7-15794 7 days ago |
7-63279 7 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 |
2-45619 2 days ago |
21-13530 21 days ago |
21-13505 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 |
2-45619 2 days ago |
19-75759 19 days ago |
19-75734 19 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 |
2-45617 2 days ago |
7-12111 7 days ago |
0-0 0 seconds |
| 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 |
2-45616 2 days ago |
7-3932 7 days ago |
7-3987 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 |
2-45610 2 days ago |
6-12360 6 days ago |
0-0 0 seconds |
| 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 |
2-45609 2 days ago |
6-5444 6 days ago |
6-5502 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 |
2-45605 2 days ago |
5-76185 5 days ago |
5-76161 5 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 |
2-45458 2 days ago |
14-1956 14 days ago |
102-23948 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 |
2-45441 2 days ago |
4-18024 4 days ago |
4-18005 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 |
2-33987 2 days ago |
2-33987 2 days ago |
2-34049 2 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 |
2-33272 2 days ago |
32-40307 1 month ago |
32-40345 32 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
---
|
t-euclidean-geometry
new-contributor
|
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 |
2-31125 2 days ago |
4-51177 4 days ago |
9-65558 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/)
|
t-algebra
large-import
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 |
2-26962 2 days ago |
2-26962 2 days ago |
7-15002 7 days |
| 35851 |
vihdzp author:vihdzp |
chore(SetTheory/Ordinal/Arithmetic): remove `backward.privateInPublic` |
---
[](https://gitpod.io/from-referrer/)
|
tech debt
t-set-theory
|
12/17 |
Mathlib/SetTheory/Ordinal/Arithmetic.lean |
1 |
5 |
['github-actions', 'plp127', 'vihdzp'] |
nobody |
2-26811 2 days ago |
5-18312 5 days ago |
5-18333 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 |
2-25803 2 days ago |
2-25846 2 days ago |
2-25896 2 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-25104 2 days ago |
2-25104 2 days ago |
2-25119 2 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-19299 2 days ago |
10-31170 10 days ago |
10-31216 10 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-18391 2 days ago |
2-18465 2 days ago |
2-18441 2 days |
| 35960 |
vihdzp author:vihdzp |
chore(Order/ConditionallyCompleteLattice/Basic): remove `backward.isDefEq.respectTransparency` |
---
[](https://gitpod.io/from-referrer/)
|
easy
t-order
|
0/8 |
Mathlib/Order/ConditionallyCompleteLattice/Basic.lean |
1 |
1 |
['github-actions'] |
nobody |
2-17182 2 days ago |
2-17182 2 days ago |
2-17172 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-16697 2 days ago |
2-16753 2 days ago |
21-23994 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-16036 2 days ago |
3-59119 3 days ago |
3-59094 3 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-15297 2 days ago |
2-15297 2 days ago |
2-55226 2 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-14013 2 days ago |
6-11982 6 days ago |
6-12033 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-10178 2 days ago |
2-10190 2 days ago |
2-10231 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-6828 2 days ago |
2-11421 2 days ago |
2-16063 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-5895 2 days ago |
2-5895 2 days ago |
10-25904 10 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-5884 2 days ago |
2-5884 2 days ago |
24-46728 24 days |
| 34624 |
homeowmorphism author:homeowmorphism |
feat(GroupTheory/FreeGroup/Basic): surjection between types induces surjection between free groups on those types |
feat(GroupTheory/FreeGroup/Basic): adds the theorem that if `α` and `β` are arbitrary types and there is a surjection between them, then the induced FreeGroup.map is also surjective.
This is a dependency of a larger PR to formalize finitely presented groups https://github.com/leanprover-community/mathlib4/pull/34236.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-group-theory
|
14/3 |
Mathlib/GroupTheory/FreeGroup/Basic.lean |
1 |
24 |
['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-merge-conflicts', 'tb65536', 'vlad902'] |
riccardobrasca assignee:riccardobrasca |
2-4836 2 days ago |
15-69762 15 days ago |
26-65983 26 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 |
1-85767 1 day ago |
48-58850 1 month ago |
71-84949 71 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 |
1-81386 1 day ago |
1-81386 1 day ago |
1-81436 1 day |
| 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 |
1-80222 1 day ago |
11-24402 11 days ago |
11-24459 11 days |
| 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
|
207/2 |
Mathlib.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean |
4 |
4 |
['github-actions', 'joneugster', 'mathlib-bors'] |
nobody |
1-80193 1 day ago |
4-51145 4 days ago |
8-28513 8 days |
| 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/)
|
new-contributor
t-data
|
25/18 |
Mathlib/Data/Finsupp/Pointwise.lean |
1 |
2 |
['github-actions'] |
joneugster assignee:joneugster |
1-80128 1 day ago |
9-55746 9 days ago |
9-55798 9 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/)
|
new-contributor
t-ring-theory
|
37/0 |
Mathlib/RingTheory/Ideal/Quotient/PowTransition.lean |
1 |
9 |
['BryceT233', 'erdOne', 'github-actions', 'wwylele'] |
chrisflav assignee:chrisflav |
1-80101 1 day ago |
3-39066 3 days ago |
9-53828 9 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/)
|
t-algebra
new-contributor
label:t-algebra$ |
29/0 |
Mathlib/Algebra/Algebra/Operations.lean,Mathlib/RingTheory/Ideal/Maps.lean |
2 |
4 |
['github-actions', 'joneugster'] |
nobody |
1-80038 1 day ago |
4-51195 4 days ago |
10-1514 10 days |
| 35987 |
grunweg author:grunweg |
chore(Tactic/FunProp): document that config options must come before … |
…the discharger
This being undocumented just bit me: let's make the documentation clearer
---
[](https://gitpod.io/from-referrer/)
|
t-meta |
1/0 |
Mathlib/Tactic/FunProp/Elab.lean |
1 |
1 |
['github-actions'] |
nobody |
1-78796 1 day ago |
1-78845 1 day ago |
1-78852 1 day |
| 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 |
1-76386 1 day ago |
1-76386 1 day ago |
2-3885 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 |
1-72821 1 day ago |
2-16515 2 days ago |
2-16500 2 days |
| 35974 |
justus-springer author:justus-springer |
feat(Algebra/Polynomial/Bivariate): more API for swap |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra
maintainer-merge
label:t-algebra$ |
10/0 |
Mathlib/Algebra/Polynomial/Bivariate.lean |
1 |
2 |
['github-actions', 'robin-carlier'] |
nobody |
1-71843 1 day ago |
1-71843 1 day ago |
2-3839 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 |
1-64937 1 day ago |
1-65360 1 day ago |
12-16099 12 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-differential-geometry
t-analysis
t-dynamics
|
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 |
1-62242 1 day ago |
1-62281 1 day ago |
133-68927 133 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 |
1-57837 1 day ago |
1-66815 1 day ago |
1-66864 1 day |
| 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 |
1-55615 1 day ago |
1-55615 1 day ago |
1-55666 1 day |
| 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 |
1-55540 1 day ago |
1-55610 1 day ago |
1-55588 1 day |
| 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 |
1-55518 1 day ago |
1-55591 1 day ago |
1-55568 1 day |
| 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/)
|
new-contributor
FLT
large-import
t-ring-theory
|
59/0 |
Mathlib/RingTheory/DedekindDomain/AdicValuation.lean |
1 |
6 |
['github-actions', 'matthewjasper', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
1-54106 1 day ago |
7-68718 7 days ago |
7-69526 7 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 |
1-53315 1 day ago |
1-53339 1 day ago |
18-58999 18 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-order
maintainer-merge
t-set-theory
|
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 |
1-53207 1 day ago |
7-10166 7 days ago |
8-29140 8 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 |
1-52324 1 day ago |
1-52393 1 day ago |
1-52369 1 day |
| 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/)
|
new-contributor
t-data
|
25/0 |
Mathlib/Data/Finsupp/Fin.lean |
1 |
2 |
['github-actions'] |
TwoFX assignee:TwoFX |
1-52091 1 day ago |
17-47904 17 days ago |
17-47956 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 |
1-51614 1 day ago |
1-52010 1 day ago |
1-52057 1 day |
| 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 |
1-50895 1 day ago |
1-50895 1 day ago |
4-43840 4 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/)
|
merge-conflict
t-order
new-contributor
|
99/82 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Module/OrderedSMul.lean,Mathlib/Algebra/Order/Module/Synonym.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Normed/Group/Constructions.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Order/Defs/PartialOrder.lean,Mathlib/Order/Hom/WithTopBot.lean,Mathlib/Order/Lattice.lean |
14 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
1-60057 1 day ago |
1-60060 1 day ago |
1-72793 1 day |
| 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 |
2 |
['github-actions', 'kckennylau'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
1-45612 1 day ago |
17-57998 17 days ago |
18-12309 18 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 |
1-45611 1 day ago |
9-38161 9 days ago |
9-40648 9 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 |
1-45609 1 day ago |
4-67251 4 days ago |
4-67227 4 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 |
2 |
['github-actions', 'mathlib-bors'] |
nobody |
5-44271 5 days ago |
10-56984 10 days ago |
10-58375 10 days |
| 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-differential-geometry
t-algebraic-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 |
2 |
['chrisflav', 'github-actions'] |
ocfnash assignee:ocfnash |
1-45606 1 day ago |
9-52856 9 days ago |
9-52832 9 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 |
1-45605 1 day ago |
8-61380 8 days ago |
8-61355 8 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 |
1-45604 1 day ago |
4-80795 4 days ago |
4-83750 4 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 |
1-45603 1 day ago |
7-66164 7 days ago |
7-66139 7 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/)
|
t-analysis
new-contributor
|
1193/0 |
Mathlib.lean,Mathlib/KernelTheory/Kernel.lean |
2 |
5 |
['TJHeeringa', 'github-actions', 'joneugster', 'vihdzp'] |
nobody |
4-51103 4 days ago |
4-51103 4 days ago |
7-66115 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 |
1-45600 1 day ago |
7-8652 7 days ago |
7-8639 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/)
|
WIP
merge-conflict
t-differential-geometry
|
154/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 |
202-50673 6 months ago |
202-50674 6 months ago |
0-70 1 minute |
| 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 |
1-45599 1 day ago |
6-70392 6 days ago |
6-70480 6 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 |
1-45598 1 day ago |
6-50702 6 days ago |
6-50762 6 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 |
1-45594 1 day ago |
5-75357 5 days ago |
5-75416 5 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'] |
nobody |
4-51085 4 days ago |
4-51085 4 days ago |
5-56092 5 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 |
1-45592 1 day ago |
5-33844 5 days ago |
5-33894 5 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 |
1-45589 1 day ago |
5-1455 5 days ago |
5-1505 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 |
1-43433 1 day ago |
1-43459 1 day ago |
21-67731 21 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 |
1-43142 1 day ago |
1-47683 1 day ago |
1-48067 1 day |
| 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 |
1 |
['github-actions'] |
nobody |
1-41969 1 day ago |
1-42036 1 day ago |
1-42012 1 day |
| 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 |
1-40007 1 day ago |
1-40060 1 day ago |
13-21532 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 |
19 |
['SnirBroshi', 'github-actions', 'tb65536'] |
nobody |
7-62428 7 days ago |
14-46970 14 days ago |
14-47024 14 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 |
4-63684 4 days ago |
7-64079 7 days ago |
7-64128 7 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 |
1-29762 1 day ago |
1-29783 1 day ago |
6-56334 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.
This will eventually be split 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
- [ ] depends on: #34861
- [x] depends on: #34862
---
[](https://gitpod.io/from-referrer/)
|
blocked-by-other-PR
t-analysis
|
977/6 |
Mathlib.lean,Mathlib/Analysis/Calculus/ImplicitContDiff.lean,Mathlib/Analysis/Normed/Module/Convex.lean,Mathlib/Analysis/ODE/PicardLindelof.lean,Mathlib/Analysis/ODE/SmoothFlow.lean,Mathlib/Data/Set/Function.lean,Mathlib/Topology/CompactOpen.lean,Mathlib/Topology/EMetricSpace/Lipschitz.lean,Mathlib/Topology/MetricSpace/Pseudo/Lemmas.lean |
9 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
11-61285 11 days ago |
27-39583 27 days ago |
0-283 4 minutes |
| 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
---
|
merge-conflict
large-import
t-ring-theory
|
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 |
14-50537 14 days ago |
14-50538 14 days ago |
45-25630 45 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/)
|
t-analysis
large-import
|
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-22749 1 day ago |
1-25405 1 day ago |
26-45774 26 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/)
|
t-measure-probability
new-contributor
|
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-21172 1 day ago |
4-51067 4 days ago |
6-708 6 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`). |
t-combinatorics
new-contributor
|
198/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean |
3 |
132 |
['0xTerencePrime', 'SnirBroshi', 'YaelDillies', 'github-actions', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
1-20180 1 day ago |
6-38946 6 days ago |
28-26574 28 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-19564 1 day ago |
1-19586 1 day ago |
1-57398 1 day |
| 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 |
4 |
['SnirBroshi', 'github-actions', 'vihdzp'] |
nobody |
1-18865 1 day ago |
2-55677 2 days ago |
2-55728 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-18017 1 day ago |
2-9230 2 days ago |
2-9206 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-14771 1 day ago |
1-55566 1 day ago |
1-55543 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-14719 1 day ago |
1-55636 1 day ago |
1-55620 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-13952 1 day ago |
1-13976 1 day ago |
1-76629 1 day |
| 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
|
85/0 |
Mathlib/Probability/Process/Stopping.lean |
1 |
4 |
['github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
RemyDegenne assignee:RemyDegenne |
13-80552 13 days ago |
14-3341 14 days ago |
58-66023 58 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/)
|
t-measure-probability
new-contributor
|
246/14 |
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 |
17 |
['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'sgouezel', 'yoh-tanimoto'] |
nobody |
1-82486 1 day ago |
1-83367 1 day ago |
36-72204 36 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-13039 1 day ago |
24-73969 24 days ago |
32-38192 32 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-12836 1 day ago |
2-233 2 days ago |
2-209 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-11729 1 day ago |
2-65052 2 days ago |
2-65028 2 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-11533 1 day ago |
1-11533 1 day ago |
1-58352 1 day |
| 36041 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/Matching): add maximal and maximum matching defs |
Closes #34957.
This is a focused pass on the issue request:
- add `Subgraph.IsMaximalMatching` as `Maximal IsMatching`
- add `Subgraph.IsMaximumMatching` as `MaximalFor IsMatching (fun M ↦ Cardinal.mk M.edgeSet)`
- add small wrapper lemmas:
- `Subgraph.isMaximalMatching_iff`
- `Subgraph.isMaximumMatching_iff`
Build:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Matching.lean`
- `~/.elan/bin/lake build`
Context:
- There is already broader work in #32555; this PR intentionally keeps scope narrow to land the core defs/API from this issue.
|
t-combinatorics
new-contributor
|
27/0 |
Mathlib/Combinatorics/SimpleGraph/Matching.lean |
1 |
2 |
['github-actions'] |
nobody |
1-10881 1 day ago |
1-10881 1 day ago |
1-10936 1 day |
| 36042 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/VertexCover): add minimal/minimum cover defs |
Closes #34958.
This PR adds the requested core definitions/API for vertex covers:
- `SimpleGraph.IsMinimalCover`
- `SimpleGraph.IsMinimumCover`
- `SimpleGraph.isMinimalCover_iff`
- `SimpleGraph.isMinimumCover_iff`
`IsMinimumCover` is defined via `MinimalFor` with `Cardinal.mk` cardinality.
Build:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/VertexCover.lean`
- `~/.elan/bin/lake build`
Context:
- #33032 contains broader vertex-cover/Kőnig development; this PR is intentionally scoped to landing the focused defs/API from #34958.
|
t-combinatorics
new-contributor
|
22/0 |
Mathlib/Combinatorics/SimpleGraph/VertexCover.lean |
1 |
2 |
['github-actions'] |
nobody |
1-10473 1 day ago |
1-10473 1 day ago |
1-10528 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-number-theory
t-algebraic-geometry
t-algebra
label:t-algebra$ |
76/0 |
Mathlib/AlgebraicGeometry/EllipticCurve/Reduction.lean |
1 |
1 |
['github-actions'] |
nobody |
1-10294 1 day ago |
8-19766 8 days ago |
8-19742 8 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 |
459/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 |
55 |
['AntoineChambert-Loir', 'Ruben-VandeVelde', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'tb65536'] |
mattrobball assignee:mattrobball |
10-67034 10 days ago |
10-67057 10 days ago |
60-7233 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-meta
t-differential-geometry
|
46/4 |
Mathlib/Geometry/Manifold/Notation.lean,MathlibTest/DifferentialGeometry/Notation/Basic.lean |
2 |
2 |
['github-actions'] |
nobody |
1-10022 1 day ago |
1-10140 1 day ago |
1-11126 1 day |
| 36022 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph): redefine `IsBridge` via `deleteEdges` |
Closes #31690
## Summary
This PR changes `SimpleGraph.IsBridge` to the deletion-only notion requested in #31690:
an edge is a bridge when deleting it disconnects its endpoints, without requiring
`e ∈ G.edgeSet` inside the definition.
## Main changes
- Redefine `IsBridge` in `Connectivity/Connected.lean`.
- Update `isBridge_iff` to the new statement.
- Refactor bridge lemmas to carry adjacency/edge-membership assumptions explicitly where needed.
- Add/update helper lemmas used by downstream files.
- Fix dependent proofs in:
- `Connectivity/EdgeConnectivity.lean`
- `Acyclic.lean`
- `Hamiltonian.lean`
## Validation
- `lake build Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity Mathlib.Combinatorics.SimpleGraph.Acyclic Mathlib.Combinatorics.SimpleGraph.Hamiltonian`
- `lake build` (full)
## AI use disclosure
I used Codex as an assistant for drafting/refactoring and proof iteration, and manually verified the final result with local Lean builds.
|
t-combinatorics
new-contributor
|
68/52 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean |
4 |
3 |
['SproutSeeds', 'github-actions'] |
nobody |
1-9963 1 day ago |
1-9971 1 day ago |
1-9947 1 day |
| 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.
[](https://gitpod.io/from-referrer/)
|
t-meta |
74/0 |
Mathlib.lean,Mathlib/Tactic.lean,Mathlib/Tactic/DsimpPercent.lean,MathlibTest/DsimpPercent.lean |
4 |
1 |
['github-actions'] |
nobody |
1-9183 1 day ago |
1-9688 1 day ago |
1-9682 1 day |
| 36048 |
kim-em author:kim-em |
feat(Tactic/DefEqAbuse): disambiguate identical-sides isDefEq failures |
This PR adds automatic disambiguation for `#defeq_abuse` failures where
both sides render identically at default pp settings (e.g. `⊤ =?= ⊤`
or `Quiver C =?= Quiver C`). These arise from instance diamonds where
the difference is only in hidden instance arguments or universe levels.
When detected, the `MessageData` is re-rendered with escalated pp
options (`pp.universes`, then `pp.explicit`) to reveal the hidden
difference. For example, `⊤ =?= ⊤` becomes
`@Top.top T inst₁ =?= @Top.top T inst₂`.
🤖 Prepared with Claude Code |
t-meta |
106/2 |
Mathlib/Tactic/DefEqAbuse.lean,MathlibTest/DefEqAbuse.lean |
2 |
1 |
['github-actions'] |
nobody |
1-8635 1 day ago |
1-8635 1 day ago |
0-0 0 seconds |
| 36023 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph): add maximal clique/indep-set defs and use MaximalFor |
Closes #34962.
This PR:
- defines `SimpleGraph.IsMaximalClique` and `SimpleGraph.IsMaximalIndepSet` as aliases of `Maximal`
- redefines `SimpleGraph.IsMaximumClique` and `SimpleGraph.IsMaximumIndepSet` using `MaximalFor` over cardinality
- keeps the existing `..._iff`, complement, existence, and cardinality lemmas by adapting proofs to the new definitions
Build:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Clique.lean`
- `~/.elan/bin/lake build`
|
t-combinatorics
new-contributor
|
46/31 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean |
1 |
6 |
['SproutSeeds', 'b-mehta', 'github-actions'] |
nobody |
1-8585 1 day ago |
1-8585 1 day ago |
1-17739 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-7566 1 day ago |
1-8841 1 day ago |
1-8817 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-6510 1 day ago |
10-8330 10 days ago |
10-8306 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-6151 1 day ago |
1-6216 1 day ago |
1-6192 1 day |
| 27229 |
WilliamCoram author:WilliamCoram |
feat(GroupTheory/DoubleCoset): multiple lemmas |
From FLT
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
FLT
t-group-theory
|
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-4301 1 day ago |
1-4451 1 day ago |
179-11601 179 days |
| 34045 |
smmercuri author:smmercuri |
feat: `algebraMap K L` is uniform continuous with respect to adic topologies, when the ideal `w` of `L` lies above `v` |
- `A` is a Dedekind domain with field of fractions `K`.
- `B` is a Dedekind domain with field of fractions `L`.
- `L` is a field extension of `K`.
- `v` is a height one prime ideal of `A`.
- `w` is a height one prime ideal of `B` lying over `v`.
Then respective valuations are related via the ramification index, and `algebraMap (WithVal (v.valuation K)) (WithVal (w.valuation L))` is uniform continuous.
---
- [x] depends on: #34049
- [x] depends on: #35972
[](https://gitpod.io/from-referrer/)
|
t-algebra
FLT
label:t-algebra$ |
142/0 |
Mathlib.lean,Mathlib/NumberTheory/RamificationInertia/Basic.lean,Mathlib/NumberTheory/RamificationInertia/Valuation.lean,Mathlib/RingTheory/DedekindDomain/AdicValuation.lean,Mathlib/RingTheory/UniqueFactorizationDomain/Multiplicity.lean |
5 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
1-23677 1 day ago |
1-24983 1 day ago |
1-33781 1 day |
| 36053 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/Matching): add graph-level IsMatching predicate |
This draft introduces a graph-level matching predicate:
- `SimpleGraph.IsMatching` for graphs on any vertex type
It also updates module docs so that:
- `SimpleGraph.IsMatching` is the general definition
- `SimpleGraph.Subgraph.IsMatching` is the specialized subgraph version
Verification:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Matching.lean`
- `~/.elan/bin/lake exe runLinter --trace Mathlib.Combinatorics.SimpleGraph.Matching`
Addresses #11911.
|
t-combinatorics
new-contributor
|
8/2 |
Mathlib/Combinatorics/SimpleGraph/Matching.lean |
1 |
2 |
['github-actions'] |
nobody |
0-84451 23 hours ago |
0-84450 23 hours ago |
0-84426 23 hours |
| 36056 |
SproutSeeds author:SproutSeeds |
chore: rename ordered-cancel add monoid counterexample file |
Renames the counterexample module to match the current class naming around `IsOrderedCancelAddMonoid`.
Also updates the module docstring so it no longer references the removed class `OrderedCancelAddCommMonoid`.
Issue: #27812
Validation:
- ~/.elan/bin/lake build Counterexamples/IsOrderedCancelAddMonoidWithBounds.lean Counterexamples.lean
- ~/.elan/bin/lake exe runLinter --trace Counterexamples.IsOrderedCancelAddMonoidWithBounds |
new-contributor
file-removed
|
5/4 |
Counterexamples.lean,Counterexamples/IsOrderedCancelAddMonoidWithBounds.lean |
2 |
2 |
['github-actions'] |
nobody |
0-84451 23 hours ago |
0-84451 23 hours ago |
0-84427 23 hours |
| 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 |
0-81683 22 hours ago |
0-81683 22 hours ago |
0-81735 22 hours |
| 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 |
0-81601 22 hours ago |
0-81782 22 hours ago |
0-81758 22 hours |
| 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
|
merge-conflict
t-analysis
|
244/0 |
Mathlib.lean,Mathlib/Analysis/Normed/Operator/Banach.lean,Mathlib/Analysis/Normed/Operator/FredholmAlternative.lean |
3 |
11 |
['b-mehta', 'github-actions', 'loefflerd', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'tb65536'] |
nobody |
14-26714 14 days ago |
14-26715 14 days ago |
4-60198 4 days |
| 29550 |
Raph-DG author:Raph-DG |
feat(RingTheory): Order of vanishing in a discrete valuation ring |
In this PR we develop some API for working with the order of vanishing in a discrete valuation ring.
---
[](https://gitpod.io/from-referrer/)
|
file-removed
t-ring-theory
|
510/3 |
Mathlib.lean,Mathlib/Algebra/Algebra/Tower.lean,Mathlib/Algebra/GroupWithZero/Action/Basic.lean,Mathlib/RingTheory/DiscreteValuationRing/Basic.lean,Mathlib/RingTheory/OrderOfVanishing/Basic.lean,Mathlib/RingTheory/OrderOfVanishing/Noetherian.lean,Mathlib/RingTheory/SimpleModule/Basic.lean |
7 |
44 |
['Raph-DG', 'erdOne', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-merge-conflict-bot'] |
erdOne assignee:erdOne |
1-69332 1 day ago |
6-17880 6 days ago |
41-77090 41 days |
| 26231 |
chrisflav author:chrisflav |
feat(CategoryTheory/Sites): sheaf condition and coproducts |
We show that under suitable conditions, checking that a presheaf is a sheaf for a covering is equivalent to checking it on the single object covering by the coproduct.
---
- [x] depends on: #32578
- [x] depends on: #35901
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
156/1 |
Mathlib.lean,Mathlib/CategoryTheory/Limits/Shapes/Products.lean,Mathlib/CategoryTheory/Sites/CoproductSheafCondition.lean,Mathlib/CategoryTheory/Sites/Hypercover/SheafOfTypes.lean,Mathlib/CategoryTheory/Sites/Hypercover/Zero.lean |
5 |
6 |
['chrisflav', 'github-actions', 'joelriou', 'mathlib-dependent-issues'] |
nobody |
0-75752 21 hours ago |
0-83738 23 hours ago |
2-59760 2 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 |
0-75693 21 hours ago |
0-77974 21 hours ago |
0-77950 21 hours |
| 36063 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/Connectivity): add vertex reachability and connectivity numbers |
### Summary
Adds a first-pass vertex connectivity API for simple graphs.
- define `SimpleGraph.isolateVerts`
- define `SimpleGraph.IsVertexReachable` and `SimpleGraph.IsVertexConnected`
- define `SimpleGraph.vertexReachability` and `SimpleGraph.vertexConnectivity`
- add basic lemmas for reflexivity, symmetry, monotonicity, antitonicity, and the `k = 0` and `k = 1` characterizations
Closes #34960.
### Local checks
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean`
- `~/.elan/bin/lake exe lint-style Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean`
- `bash scripts/mathlib-issue-local-gate.sh --repo /Users/codymitchell/Documents/code/mathlib4 --issue 34960 --build-target Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean --lint-module Mathlib.Combinatorics.SimpleGraph.Connectivity.VertexConnectivity --skip-mk-all`
|
t-combinatorics
new-contributor
|
140/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean |
2 |
2 |
['github-actions'] |
nobody |
0-75061 20 hours ago |
0-75061 20 hours ago |
0-75037 20 hours |
| 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 |
0-74932 20 hours ago |
0-76620 21 hours ago |
0-76597 21 hours |
| 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 |
0-73739 20 hours ago |
2-6627 2 days ago |
2-6679 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/)
|
t-category-theory
file-removed
|
26/24 |
Mathlib.lean,Mathlib/CategoryTheory/Subobject/Classifier/Defs.lean |
2 |
2 |
['edegeltje', 'github-actions'] |
nobody |
0-72260 20 hours ago |
0-83962 23 hours ago |
0-84016 23 hours |
| 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-meta
maintainer-merge
toric
t-ring-theory
|
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 |
0-70599 19 hours ago |
5-1271 5 days ago |
36-52613 36 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 |
0-70443 19 hours ago |
0-76153 21 hours ago |
0-0 0 seconds |
| 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 |
28/0 |
Mathlib/RingTheory/Polynomial/GaussLemma.lean |
1 |
2 |
['erdOne', 'github-actions'] |
nobody |
0-69442 19 hours ago |
0-77104 21 hours ago |
0-77157 21 hours |
| 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 |
0-61722 17 hours ago |
0-80606 22 hours ago |
17-43702 17 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 |
0-61159 16 hours ago |
50-19872 1 month ago |
50-19846 50 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 |
0-61150 16 hours ago |
6-31164 6 days ago |
6-32769 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/)
|
|
204/7 |
Mathlib/Analysis/Complex/UpperHalfPlane/Topology.lean,Mathlib/NumberTheory/Modular.lean |
2 |
1 |
['github-actions'] |
nobody |
2-49555 2 days ago |
2-49627 2 days ago |
2-49603 2 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 |
0-53746 14 hours ago |
0-53746 14 hours ago |
0-53723 14 hours |
| 35904 |
chrisflav author:chrisflav |
feat(CategoryTheory/Sites): the maximal `1`-hypercover containing a `0`-hypercover |
---
- [x] depends on: #35902
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
139/0 |
Mathlib.lean,Mathlib/CategoryTheory/Sites/Hypercover/Saturate.lean |
2 |
2 |
['github-actions', 'mathlib-dependent-issues'] |
nobody |
0-51228 14 hours ago |
0-84277 23 hours ago |
1-139 1 day |
| 35797 |
xroblot author:xroblot |
feat(IsGaloisGroup): if `B/A` and `B/A'` are Galois with the same Galois group, then `A ≃+* A'` |
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
42/1 |
Mathlib/FieldTheory/Galois/IsGaloisGroup.lean |
1 |
5 |
['github-actions', 'tb65536', 'xroblot'] |
dagurtomas assignee:dagurtomas |
2-45612 2 days ago |
6-20505 6 days ago |
6-20561 6 days |
| 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 |
0-48416 13 hours ago |
13-34685 13 days ago |
0-0 0 seconds |
| 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 |
0-48385 13 hours ago |
0-48385 13 hours ago |
0-48362 13 hours |
| 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 |
awaiting-author
merge-conflict
|
180/485 |
Mathlib/Order/Bounds/Basic.lean,Mathlib/Order/CompleteLattice/Basic.lean,Mathlib/Order/CompleteLattice/Defs.lean |
3 |
21 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
dupuisf assignee:dupuisf |
2-50071 2 days ago |
2-50072 2 days ago |
6-81549 6 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 |
0-47684 13 hours ago |
7-20318 7 days ago |
7-20378 7 days |
| 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 |
0-46424 12 hours ago |
0-47951 13 hours ago |
0-0 0 seconds |
| 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'] |
nobody |
16-81874 16 days ago |
16-81874 16 days ago |
16-81849 16 days |
| 35429 |
CoolRmal author:CoolRmal |
feat: a convex, lower-semicontinuous, and positively homogeneous function is the supremum of a family of linear functions |
This PR adds more results related to the #31411. The motivation of this PR is explained over here: #35431.
The main theorems proved in this PR are
- `convexCone_sSup_linear_eq`: A function `φ : E → ℝ` that is convex, lower-semicontinuous, and positively homogeneous on a closed, convex, and pointed cone `c` is the supremum of a family of functions that are the
restrictions to `s` of continuous linear forms in `E`. I actually prove this theorem under the assumption
`∀ x ∈ c, ∀ᶠ μ in atTop, φ (μ • x) = μ * φ x`, which is weaker than positive homogeneity.
- We then apply the theorem above to prove `univ_sSup_linear_eq`, which says that a function that is convex, lower-semicontinuous, and positively homogeneous on the entire space is the supremum of a family of continuous linear forms in `E`.
- Similar to what I have done in #31411, I also proved the countable/sequential version of these theorems, under the assumption that the underlying space `E` is hereditarily Lindelof.
---
- [ ] depends on #27953
[](https://gitpod.io/from-referrer/)
|
t-analysis |
351/24 |
Mathlib.lean,Mathlib/Analysis/Convex/Approximation.lean,Mathlib/MeasureTheory/Function/ConditionalExpectation/CondJensen.lean,Mathlib/MeasureTheory/MeasurableSpace/Constructions.lean |
4 |
2 |
['github-actions', 'joneugster'] |
j-loreaux assignee:j-loreaux |
0-45617 12 hours ago |
4-51318 4 days ago |
15-30786 15 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 |
0-45615 12 hours ago |
4-75387 4 days ago |
4-75383 4 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 |
0-45614 12 hours ago |
4-25359 4 days ago |
4-25410 4 days |
| 35899 |
themathqueen author:themathqueen |
feat(Analysis): `extremePoints 𝕜 (closedBall 0 1) ⊆ sphere 0 1` |
... in a nontrivial normed space, with equality in a nontrivial Hilbert space.
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
84/0 |
Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Analysis/RCLike/Basic.lean |
2 |
1 |
['github-actions'] |
j-loreaux assignee:j-loreaux |
0-45612 12 hours ago |
3-54697 3 days ago |
3-54745 3 days |
| 35906 |
scp020 author:scp020 |
feat(Combinatorics/SimpleGraph/Walks): add Walk.IsChord and Walk.IsChordless |
This PR adds a new file:
- `Mathlib/Combinatorics/SimpleGraph/Walks/Chords`
and introduces two definitions for closed walks in simple graphs:
- `SimpleGraph.Walk.IsChord`
- `SimpleGraph.Walk.IsChordless`
Motivation:
These notions are standard in graph theory and are useful for reasoning about induced cycles (that is, chordless cycles). In particular, they provide a clean interface for structural arguments where one chooses a chordless cycle and then studies how the rest of the graph interacts with it.
Design:
- `Walk.IsChord` says that `v` and `w` are vertices of a closed walk `p`, that they are adjacent in the ambient graph, and that this ambient edge is not an edge of `p`.
- `Walk.IsChordless` says that `p` is a cycle and that every ambient edge between two vertices of `p` already appears in `p`.
This PR also includes a small API for these definitions:
- `SimpleGraph.Walk.IsChord.symm`
- `SimpleGraph.Walk.isChord_iff`
- `SimpleGraph.Walk.IsChordless.isCycle`
- `SimpleGraph.Walk.IsChordless.mem_edges`
- `SimpleGraph.Walk.IsChordless.not_isChord`
- `SimpleGraph.Walk.isChordless_iff_forall_not_isChord`
The file is placed in `namespace SimpleGraph.Walk` to match the existing `Walk`-based predicates and lemmas in the simple graph library.
This PR is intentionally small: it adds the core definitions together with basic non-mechanical API that supports direct mathematical use.
Validation:
- `lake build Mathlib.Combinatorics.SimpleGraph.Walks.Chords`
- `lake exe lint-style Mathlib/Combinatorics/SimpleGraph/Walks/Chords.lean`
- `#lint`
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
|
82/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Chords.lean |
2 |
2 |
['github-actions'] |
nobody |
1-35537 1 day ago |
1-46089 1 day ago |
2-7473 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 |
0-39599 10 hours ago |
0-52155 14 hours ago |
0-52203 14 hours |
| 36020 |
SproutSeeds author:SproutSeeds |
feat(Combinatorics/Enumerative/DoubleCounting): add weighted bipartite lower bound |
## Summary
This PR adds a weighted bipartite double-counting lower bound in
`Mathlib/Combinatorics/Enumerative/DoubleCounting.lean`:
- `Finset.sum_mul_le_sum_sum_bipartiteBelow_of_le_card_bipartiteAbove`
## New theorem
```lean
theorem sum_mul_le_sum_sum_bipartiteBelow_of_le_card_bipartiteAbove
[∀ a b, Decidable (r a b)] (w m : α → ℕ)
(hm : ∀ a ∈ s, m a ≤ #(t.bipartiteAbove r a)) :
(∑ a ∈ s, m a * w a) ≤ ∑ b ∈ t, ∑ a ∈ s.bipartiteBelow r b, w a
```
## Motivation
Existing double-counting lemmas in this file are cardinality-based with constant bounds.
This theorem provides the weighted/inhomogeneous variant: each left vertex `a` can carry
its own multiplicity lower bound `m a` and weight `w a`.
This packages a reusable pattern for incidence arguments where lower bounds vary across
vertices.
## Use cases
1. Weighted incidence counting in bipartite relations with non-uniform degree guarantees.
2. Charging arguments where each object contributes weight and has an object-dependent
minimum witness multiplicity.
## API / compatibility
- No existing theorem names changed.
- No imports added.
- Additive change only.
## Verification
```bash
~/.elan/bin/lake build Mathlib.Combinatorics.Enumerative.DoubleCounting
~/.elan/bin/lake env lean Mathlib/Combinatorics/Enumerative/DoubleCounting.lean
```
## AI usage
I used AI tools for exploration/drafting, then manually selected the statement,
edited the Lean code, and ran local checks.
|
t-combinatorics
new-contributor
|
15/0 |
Mathlib/Combinatorics/Enumerative/DoubleCounting.lean |
1 |
6 |
['Rida-Hamadani', 'SproutSeeds', 'github-actions'] |
nobody |
0-35298 9 hours ago |
1-39206 1 day ago |
1-39258 1 day |
| 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
---
[](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 |
1 |
['github-actions'] |
nobody |
0-31007 8 hours ago |
0-31007 8 hours ago |
0-31073 8 hours |
| 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-61954 1 day ago |
2-36276 2 days ago |
2-36329 2 days |
| 35627 |
SnirBroshi author:SnirBroshi |
feat(Combinatorics/SimpleGraph/Finite): min/max degrees of top/bot |
---
[](https://gitpod.io/from-referrer/)
|
t-combinatorics |
24/1 |
Mathlib/Combinatorics/SimpleGraph/Finite.lean,Mathlib/Combinatorics/SimpleGraph/StronglyRegular.lean |
2 |
6 |
['SnirBroshi', 'github-actions', 'vlad902'] |
nobody |
7-82051 7 days ago |
10-35416 10 days ago |
10-35463 10 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 |
n/a |
['Thmoas-Guan', 'alreadydone', 'chrisflav', 'dagurtomas', 'erdOne', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
chrisflav assignee:chrisflav |
0-28143 7 hours ago |
unknown |
unknown |
| 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 |
0-25929 7 hours ago |
47-40583 1 month ago |
47-40621 47 days |
| 35559 |
mike1729 author:mike1729 |
feat(Analysis/Normed): weak-topology embedding into weak-star bidual and compactenss transfer theorem |
This PR refactors the double dual material and adds new results connecting the weak topology on a normed space to the weak-star topology on its bidual.
## Changes
### New file: `Analysis.Normed.Module.DoubleDual`
Extracts the canonical embedding `inclusionInDoubleDual` and the bidual isometry `inclusionInDoubleDualLi` from `Analysis.Normed.Module.Dual` into a dedicated file, and adds:
- `inclusionInDoubleDualWeak`: the canonical map from `WeakSpace 𝕜 X` into `WeakDual 𝕜 (StrongDual 𝕜 X)`.
- `inclusionInDoubleDualWeak_isEmbedding`: this map is a topological embedding.
- `inclusionInDoubleDualWeak_homeomorph`: the map as a homeomorphism onto its range.
- `isCompact_closure_of_isBounded`: bounded sets whose bidual image has weak-star closure in range have weakly compact closure, via Banach–Alaoglu.
### New file: `Analysis.Normed.Module.WeakSpace`
- `WeakSpace.instBornology`: norm bornology on `WeakSpace 𝕜 E`, inherited from `E`.
- `WeakSpace.instT2Space`: the weak topology over `RCLike` is Hausdorff (via Hahn–Banach).
### Modified: `Analysis.Normed.Module.Dual`
The double dual inclusion material is moved out; polar set results remain. References to `inclusionInDoubleDual` in `polar_closure` are replaced by `ContinuousLinearMap.apply` to avoid a dependency on the new file.
---
CC: @faenuccio this may be relevant for your Goldstine formalization.
|
t-analysis
new-contributor
|
285/99 |
Mathlib.lean,Mathlib/Analysis/LocallyConvex/SeparatingDual.lean,Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Normed/Module/DoubleDual.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Analysis/Normed/Module/WeakSpace.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,Mathlib/MeasureTheory/Measure/CharacteristicFunction/Basic.lean,Mathlib/Probability/Distributions/Gaussian/CharFun.lean |
10 |
16 |
['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'mike1729'] |
ADedecker assignee:ADedecker |
0-24380 6 hours ago |
0-28576 7 hours ago |
11-55994 11 days |
| 35785 |
Brian-Nugent author:Brian-Nugent |
feat(CategoryTheory/Topology): Add Flasque Sheaves |
This PR defines flasque sheaves on a topological space as sheaves where all restriction morphisms are epimorphisms. The main result of this PR is `TopCat.Sheaf.IsFlasque.epi_of_shortExact` which says a short exact sequence where the first sheaf is flasque remains exact on sections.
---
- [x] depends on: #34267
[](https://gitpod.io/from-referrer/)
|
merge-conflict
t-category-theory
new-contributor
|
384/1 |
Mathlib.lean,Mathlib/Algebra/Category/Grp/AB.lean,Mathlib/Topology/Sheaves/Abelian.lean,Mathlib/Topology/Sheaves/AddCommGrpCat.lean,Mathlib/Topology/Sheaves/Flasque.lean,Mathlib/Topology/Sheaves/Presheaf.lean,Mathlib/Topology/Sheaves/SheafCondition/UniqueGluing.lean,Mathlib/Topology/Sheaves/Skyscraper.lean |
8 |
11 |
['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smorel394'] |
dagurtomas assignee:dagurtomas |
1-61318 1 day ago |
1-61319 1 day ago |
0-34126 9 hours |
| 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$ |
274/6 |
Mathlib/LinearAlgebra/Transvection.lean |
1 |
n/a |
['AntoineChambert-Loir', 'dagurtomas', 'github-actions', 'mathlib-merge-conflicts', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'ocfnash'] |
ocfnash assignee:ocfnash |
2-15058 2 days ago |
unknown |
unknown |
| 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-18725 5 hours ago |
0-18814 5 hours ago |
0-18867 5 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 |
9 |
['JovanGerb', 'github-actions', 'kim-em', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'vihdzp'] |
nobody |
0-48787 13 hours ago |
0-50158 13 hours ago |
8-25431 8 days |
| 36105 |
LLaurance author:LLaurance |
chore(Algebra): shorten, 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-17432 4 hours ago |
0-18789 5 hours ago |
0-18765 5 hours |
| 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/)
|
|
15/15 |
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 |
3 |
['euprunin', 'github-actions', 'leanprover-radar'] |
nobody |
2-50838 2 days ago |
2-52155 2 days ago |
2-52131 2 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-16751 4 hours ago |
0-69779 19 hours ago |
0-0 0 seconds |
| 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-16641 4 hours ago |
0-16664 4 hours ago |
3-62456 3 days |
| 36108 |
justus-springer author:justus-springer |
feat(Algebra/Polynomial/Eval/Subring): not_mem_map_range |
A "not" version of `mem_map_range`.
---
[](https://gitpod.io/from-referrer/)
|
t-algebra label:t-algebra$ |
7/0 |
Mathlib/Algebra/Polynomial/Eval/Subring.lean |
1 |
1 |
['github-actions'] |
nobody |
0-16469 4 hours ago |
0-16470 4 hours ago |
0-16518 4 hours |
| 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/)
|
t-measure-probability
brownian
|
167/0 |
Mathlib.lean,Mathlib/Probability/Distributions/Gaussian/IsGaussianProcess/Independence.lean |
2 |
n/a |
['DavidLedvinka', 'EtienneC30', 'github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot', 'sgouezel'] |
sgouezel assignee:sgouezel |
0-15851 4 hours ago |
unknown |
unknown |
| 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$ |
17/25 |
Mathlib/FieldTheory/Galois/Infinite.lean,Mathlib/FieldTheory/KrullTopology.lean |
2 |
1 |
['github-actions'] |
nobody |
0-35001 9 hours ago |
0-35072 9 hours ago |
0-35123 9 hours |
| 28582 |
Thmoas-Guan author:Thmoas-Guan |
feat(Data): some lemmas about WithBot ENat |
Add some lemma about withBot ENat discovered when dealing with `ringKrullDim`
---
[](https://gitpod.io/from-referrer/)
|
awaiting-author
t-data
|
58/10 |
Mathlib/Algebra/Order/Monoid/Unbundled/WithTop.lean,Mathlib/Data/ENat/Basic.lean |
2 |
37 |
['Ruben-VandeVelde', 'Thmoas-Guan', 'YaelDillies', 'alreadydone', 'erdOne', 'github-actions', 'pechersky', 'urkud'] |
pechersky assignee:pechersky |
14-4066 14 days ago |
25-8347 25 days ago |
68-1211 68 days |
| 36112 |
tb65536 author:tb65536 |
feat(CategoryTheory/Monoidal/Cartesian/Grp_): conjugation as a morphism |
This PR adds conjugation as a morphism.
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory
t-algebraic-geometry
t-algebra
t-group-theory
label:t-algebra$ |
10/0 |
Mathlib/CategoryTheory/Monoidal/Cartesian/Grp_.lean |
1 |
1 |
['github-actions'] |
nobody |
0-13127 3 hours ago |
0-13127 3 hours ago |
0-13104 3 hours |
| 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'] |
nobody |
3-56705 3 days ago |
3-59280 3 days ago |
4-327 4 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/)
|
awaiting-author
merge-conflict
t-ring-theory
|
272/47 |
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/Flat/FaithfullyFlat/Basic.lean,Mathlib/RingTheory/GradedAlgebra/TensorProduct.lean |
12 |
11 |
['erdOne', 'github-actions', 'mathlib4-merge-conflict-bot'] |
nobody |
107-72900 3 months ago |
107-72901 3 months ago |
36-68500 36 days |
| 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 |
199/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 |
1-59805 1 day ago |
1-59829 1 day ago |
14-10553 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/)
|
awaiting-author
t-algebra
t-ring-theory
label:t-algebra$ |
36/0 |
Mathlib/RingTheory/AdjoinRoot.lean |
1 |
6 |
['copilot-pull-request-reviewer', 'erdOne', 'github-actions'] |
mattrobball assignee:mattrobball |
3-77293 3 days ago |
3-77293 3 days ago |
16-57605 16 days |
| 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/)
|
|
46/20 |
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/Complex/Basic.lean,Mathlib/Analysis/InnerProductSpace/Basic.lean,Mathlib/Data/Complex/Basic.lean,Mathlib/LinearAlgebra/Complex/Module.lean,Mathlib/NumberTheory/ModularForms/JacobiTheta/TwoVariable.lean,Mathlib/RingTheory/IsTensorProduct.lean,Mathlib/RingTheory/TensorProduct/Maps.lean |
13 |
2 |
['github-actions', 'matthewjasper'] |
nobody |
0-41439 11 hours ago |
0-55576 15 hours ago |
0-55552 15 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 |
3 |
['github-actions', 'tb65536'] |
nobody |
0-11270 3 hours ago |
0-49620 13 hours ago |
0-49596 13 hours |
| 30112 |
gaetanserre author:gaetanserre |
feat(Probability.Kernel): add representation of kernel as a map of a uniform measure |
Add results about isolation of kernels randomness. In particular, it shows that one
can write a Markov kernel as the map by a deterministic of a uniform measure on `[0, 1]`.
It corresponds to Lemma 4.22 in "[Foundations of Modern Probability](https://link.springer.com/book/10.1007/978-3-030-61871-1)" by Olav Kallenberg, 2021.
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability |
172/0 |
Mathlib.lean,Mathlib/MeasureTheory/Constructions/UnitInterval.lean,Mathlib/Probability/Kernel/Representation.lean |
3 |
15 |
['DavidLedvinka', 'RemyDegenne', 'gaetanserre', 'github-actions', 'mathlib4-merge-conflict-bot'] |
RemyDegenne assignee:RemyDegenne |
0-68835 19 hours ago |
86-6543 2 months ago |
86-6831 86 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 assignee:kex-y |
1-57087 1 day ago |
41-85883 1 month ago* |
44-1078 44 days* |
| 35819 |
CBirkbeck author:CBirkbeck |
feat(NumberTheory/ModularForm/EisensteinSeries/E2): Prove E2 is MDifferentiable |
Proof that E2 is MDifferentiable. This proof comes from the Sphere packing project where it was produced by Gauss.
Co-authored-by: Math.inc's Gauss
---
[](https://gitpod.io/from-referrer/)
|
t-number-theory |
40/0 |
Mathlib.lean,Mathlib/NumberTheory/ModularForms/EisensteinSeries/E2/MDifferentiable.lean |
2 |
3 |
['github-actions', 'joneugster', 'seewoo5'] |
tb65536 assignee:tb65536 |
1-45595 1 day ago |
4-51094 4 days ago |
5-75371 5 days |
| 35535 |
mariainesdff author:mariainesdff |
feat(RingTheory/ClassGroup): prove mulEquiv |
We prove that isomorphic rings have isomorphic class groups.
Co-authored by: @xgenereux.
---
[](https://gitpod.io/from-referrer/)
|
awaiting-author
t-ring-theory
|
257/8 |
Mathlib/Algebra/Ring/CompTypeclasses.lean,Mathlib/RingTheory/ClassGroup.lean,Mathlib/RingTheory/FractionalIdeal/Operations.lean,Mathlib/RingTheory/IntegralClosure/IsIntegral/Basic.lean,Mathlib/RingTheory/LocalProperties/Basic.lean,Mathlib/RingTheory/Localization/FractionRing.lean |
6 |
25 |
['erdOne', 'eric-wieser', 'github-actions', 'mariainesdff', 'mathlib-merge-conflicts', 'tb65536'] |
nobody |
3-73221 3 days ago |
3-73221 3 days ago |
0-0 0 seconds |
| 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 |
269/4 |
Mathlib.lean,Mathlib/RingTheory/RingHom/Smooth.lean,Mathlib/RingTheory/Smooth/Quotient.lean |
3 |
5 |
['Thmoas-Guan', 'github-actions', 'jcommelin'] |
jcommelin assignee:jcommelin |
0-16627 4 hours ago |
0-82762 22 hours ago |
8-77549 8 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/)
|
new-contributor
t-data
|
42/32 |
Mathlib/Data/PFunctor/Multivariate/W.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean |
2 |
2 |
['github-actions'] |
nobody |
0-4408 1 hour ago |
0-76957 21 hours ago |
0-77009 21 hours |
| 35673 |
Parcly-Taxel author:Parcly-Taxel |
feat: radical lemmas for natural numbers and integers |
Add lemmas relating to the radical on `Nat` and `Int` in `RingTheory.Radical.NatInt`. The existing file is moved to `RingTheory.Radical.Basic`, whose module docstring is updated.
These are needed as part of a project I'm doing for my PhD under Frank Stephan. |
awaiting-author
file-removed
t-ring-theory
|
162/88 |
Mathlib.lean,Mathlib/RingTheory/Polynomial/Radical.lean,Mathlib/RingTheory/Radical/Basic.lean,Mathlib/RingTheory/Radical/NatInt.lean |
4 |
24 |
['Parcly-Taxel', 'github-actions', 'mathlib-merge-conflicts', 'riccardobrasca', 'vihdzp'] |
riccardobrasca assignee:riccardobrasca |
2-7039 2 days ago |
2-7039 2 days ago |
7-10554 7 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
|
276/0 |
Mathlib.lean,Mathlib/Topology/Covering/FundamentalGroupCircle.lean |
2 |
20 |
['Ruizsolveall', 'b-mehta', 'github-actions', 'vihdzp'] |
nobody |
0-2397 39 minutes ago |
0-9253 2 hours ago |
0-9308 2 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
- [ ] 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* |
blocked-by-other-PR
t-measure-probability
|
352/2 |
Mathlib.lean,Mathlib/MeasureTheory/Measure/TightCharFun.lean,Mathlib/MeasureTheory/Measure/TightNormed.lean |
3 |
3 |
['github-actions', 'mathlib4-dependent-issues-bot', 'mathlib4-merge-conflict-bot'] |
nobody |
23-16125 23 days ago |
23-17141 23 days ago |
0-2 2 seconds |
| 35895 |
edegeltje author:edegeltje |
feat(CategoryTheory/Topos/Classifier): subobject classifiers, isos and equivalences |
this PR adds `Classifier.ofEquivalence`, `Classifier.ofIso` and `Classifier.uniqueUpToIso`, as well as accompanying lemmas
---
[](https://gitpod.io/from-referrer/)
|
t-category-theory |
106/3 |
Mathlib/CategoryTheory/Topos/Classifier.lean |
1 |
1 |
['github-actions'] |
nobody |
3-61056 3 days ago |
3-63156 3 days ago |
3-63211 3 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/114 |
Mathlib/Order/Concept.lean |
1 |
50 |
['Vierkantor', 'YaelDillies', 'github-actions', 'linesthatinterlace', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'plp127', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
11-66810 11 days ago |
12-25487 12 days ago |
33-33013 33 days |
| 34528 |
Maldooor author:Maldooor |
feat: Reproducing Kernel Hilbert Spaces and Moore's theorem |
We define vector-valued reproducing Kernel Hilbert spaces, which are Hilbert spaces of
functions, as well as characterize these spaces in terms of infinite-dimensional
positive semidefinite matrices.
Co-authored-by: Yaël Dillies
---
[](https://gitpod.io/from-referrer/)
|
t-analysis
maintainer-merge
|
326/5 |
Mathlib.lean,Mathlib/Analysis/InnerProductSpace/Continuous.lean,Mathlib/Analysis/InnerProductSpace/Reproducing.lean,docs/references.bib |
4 |
17 |
['Maldooor', 'YaelDillies', 'faenuccio', 'github-actions'] |
j-loreaux assignee:j-loreaux |
0-3504 58 minutes ago |
0-85719 23 hours ago |
6-76842 6 days |
| 35098 |
b-mehta author:b-mehta |
feat(Analysis/Normed): relate compactness of operators to locally compact spaces |
---
[](https://gitpod.io/from-referrer/)
|
t-analysis |
16/1 |
Mathlib/Analysis/Normed/Module/FiniteDimension.lean |
1 |
8 |
['b-mehta', 'github-actions', 'j-loreaux', 'mathlib-merge-conflicts'] |
j-loreaux assignee:j-loreaux |
3-80640 3 days ago |
5-3106 5 days ago |
9-70127 9 days |
| 36118 |
jjdishere author:jjdishere |
fix(NumberTheory/Padics): remove diamond normed instance on C_p |
In this PR, we refactor the normed instance on $\mathbb{C}_p$ to the norm extended along completion, and show that this is compatible with valuation.
Also added NontriviallyNormedField and CharZero instances.
---
[](https://gitpod.io/from-referrer/)
|
|
78/28 |
Mathlib/Analysis/Normed/Unbundled/SpectralNorm.lean,Mathlib/NumberTheory/Padics/Complex.lean |
2 |
4 |
['github-actions', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
0-535 8 minutes ago |
0-10943 3 hours ago |
0-10919 3 hours |
| 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/)
|
|
238/0 |
Mathlib.lean,Mathlib/Data/Set/Dissipate.lean,Mathlib/MeasureTheory/PiSystem.lean,Mathlib/Topology/Compactness/CompactSystem.lean |
4 |
1 |
['github-actions'] |
nobody |
0-14471 4 hours ago |
1-12912 1 day ago |
1-48651 1 day |
| Number |
Author |
Title |
Description |
Labels |
+/- |
Modified files (first 100) |
📝 |
💬 |
All users who commented or reviewed |
Assignee(s) |
Updated |
Last status change |
total time in review |
| 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/)
|
t-combinatorics
new-contributor
large-import
|
61/39 |
Mathlib/Combinatorics/Enumerative/Schroder.lean |
1 |
19 |
['FlAmmmmING', 'github-actions', 'vihdzp'] |
awainverse assignee:awainverse |
33-45518 1 month ago |
53-6230 1 month ago |
53-6276 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 |
33-45515 1 month ago |
41-65929 1 month ago |
41-65974 41 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 |
32-45525 1 month ago |
47-38617 1 month ago |
47-38657 47 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 |
31-45476 1 month ago |
60-8637 2 months ago |
60-8670 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/)
|
t-measure-probability
new-contributor
|
24/0 |
Mathlib/MeasureTheory/Function/AEEqOfLIntegral.lean |
1 |
4 |
['github-actions', 'jvanwinden', 'urkud'] |
kex-y assignee:kex-y |
28-79317 1 month ago |
28-79317 1 month ago |
38-81773 38 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 |
28-55285 1 month ago |
28-55285 1 month ago |
81-5060 81 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 |
24 |
['SnirBroshi', 'github-actions', 'jcommelin', 'ksenono'] |
awainverse assignee:awainverse |
28-54112 1 month ago |
28-54112 1 month ago |
81-26813 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 |
27-74391 27 days ago |
27-74586 27 days ago |
36-76243 36 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 |
26-45609 26 days ago |
30-34980 1 month ago |
30-35018 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 |
new-contributor
t-data
large-import
|
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 |
25-75302 25 days ago |
41-81629 1 month ago |
42-41886 42 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 |
23-45595 23 days ago |
28-29705 1 month ago |
28-30940 28 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-21054 22 days ago |
22-21054 22 days ago |
90-40268 90 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/)
|
t-logic
new-contributor
|
147/0 |
Mathlib/ModelTheory/Definability.lean |
1 |
59 |
['NoneMore', 'github-actions', 'mathlib4-merge-conflict-bot', 'staroperator'] |
awainverse assignee:awainverse |
22-15090 22 days ago |
54-24810 1 month ago |
82-24012 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 |
21-45441 21 days ago |
33-76042 1 month ago |
34-21429 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 |
21-45437 21 days ago |
25-2630 25 days ago |
30-3894 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 |
20-81857 20 days ago |
21-12310 21 days ago |
21-12367 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/)
|
new-contributor
t-ring-theory
|
124/0 |
Mathlib.lean,Mathlib/RingTheory/MvPowerSeries/GaussNorm.lean |
2 |
25 |
['WilliamCoram', 'erdOne', 'fbarroero', 'github-actions', 'mathlib4-merge-conflict-bot', 'vihdzp'] |
alreadydone assignee:alreadydone |
18-85875 18 days ago |
22-76904 22 days ago |
50-72284 50 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 |
15-59455 15 days ago |
21-71133 21 days ago |
23-5403 23 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 |
15-39059 15 days ago |
15-39059 15 days ago |
23-16459 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). |
new-contributor
t-data
|
22/0 |
Mathlib/Data/Matrix/Mul.lean |
1 |
5 |
['dennj', 'eric-wieser', 'github-actions', 'themathqueen'] |
pechersky assignee:pechersky |
14-51619 14 days ago |
27-61027 27 days ago |
27-61070 27 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 |
14-47088 14 days ago |
15-46386 15 days ago |
125-81735 125 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 |
12-45614 12 days ago |
24-69485 24 days ago |
24-69534 24 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/)
|
t-measure-probability
new-contributor
|
32/0 |
Mathlib/MeasureTheory/Function/AEEqFun.lean,Mathlib/MeasureTheory/Function/LpSpace/Basic.lean |
2 |
2 |
['github-actions'] |
RemyDegenne assignee:RemyDegenne |
11-45611 11 days ago |
14-75099 14 days ago |
14-75184 14 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/)
|
t-measure-probability
new-contributor
|
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 |
10-74066 10 days ago |
11-39588 11 days ago |
23-18162 23 days |
| 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 |
new-contributor
t-computability
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 |
9-61624 9 days ago |
14-64707 14 days ago |
25-28179 25 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/)
|
t-measure-probability
new-contributor
|
200/0 |
Mathlib/Probability/Distributions/Exponential.lean |
1 |
6 |
['JoaBjo', 'Timeroot', 'github-actions'] |
kex-y assignee:kex-y |
9-45614 9 days ago |
13-66413 13 days ago |
13-66467 13 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-20026 9 days ago |
23-20202 23 days ago |
23-20240 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 |
8-45613 8 days ago |
24-44547 24 days ago |
32-63631 32 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 |
new-contributor
t-group-theory
|
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 |
8-45612 8 days ago |
8-51995 8 days ago |
18-7063 18 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/)
|
new-contributor
t-data
|
1/1 |
Mathlib/Data/Rel.lean |
1 |
2 |
['github-actions', 'vihdzp'] |
nobody |
7-48084 7 days ago |
8-55643 8 days ago |
8-55713 8 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/)
|
t-order
new-contributor
large-import
|
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 |
7-45593 7 days ago |
18-73756 18 days ago |
28-41213 28 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/)
|
t-number-theory
new-contributor
|
26/10 |
Mathlib/NumberTheory/PellMatiyasevic.lean,Mathlib/NumberTheory/Zsqrtd/Basic.lean |
2 |
8 |
['FrankieeW', 'github-actions', 'vihdzp'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
7-45585 7 days ago |
12-40581 12 days ago |
14-994 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 |
7-39009 7 days ago |
7-39085 7 days ago |
17-45280 17 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/)
|
t-algebra
new-contributor
label:t-algebra$ |
46/16 |
Mathlib/Algebra/Order/BigOperators/Expect.lean,Mathlib/Analysis/RCLike/Basic.lean |
2 |
1 |
['github-actions'] |
thorimur assignee:thorimur |
6-83472 6 days ago |
31-9730 1 month ago |
57-15840 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 |
6-45615 6 days ago |
13-63863 13 days ago |
16-2163 16 days |
| 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$ |
170/6 |
Mathlib/RepresentationTheory/Character.lean,Mathlib/RepresentationTheory/Intertwining.lean,Mathlib/RepresentationTheory/Invariants.lean,Mathlib/RepresentationTheory/Irreducible.lean |
4 |
8 |
['github-actions', 'ocfnash', 'stepan2698-cpu'] |
ocfnash assignee:ocfnash |
5-60751 5 days ago |
5-60751 5 days ago |
21-43966 21 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 |
5-45623 5 days ago |
9-68055 9 days ago |
9-68104 9 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 |
5-45620 5 days ago |
9-52762 9 days ago |
9-52812 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 |
5-40906 5 days ago |
11-77730 11 days ago |
11-77705 11 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-364 5 days ago |
61-76473 2 months ago |
61-76510 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/)
|
new-contributor
t-data
|
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 |
4-81033 4 days ago |
11-61922 11 days ago |
11-84627 11 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 |
4-78054 4 days ago |
4-78061 4 days ago |
29-67392 29 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.
---
|
t-differential-geometry
new-contributor
|
186/0 |
Mathlib.lean,Mathlib/Geometry/Manifold/Instances/OrbitSpace.lean,Mathlib/Topology/Algebra/OrbitSpace.lean |
3 |
2 |
['github-actions'] |
grunweg assignee:grunweg |
4-76913 4 days ago |
6-14915 6 days ago |
9-65969 9 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 |
4-57747 4 days ago |
5-14182 5 days ago |
5-14233 5 days |
| 35672 |
dennj author:dennj |
feat(RingTheory/Polynomial/Cyclotomic): vanishing sums and fiber equidistribution at primitive roots |
## Summary
Building on `sum_eq_zero_iff_forall_eq` from #34592, this PR adds:
- `cyclotomic_prime_coeff_eq_one`: for prime `p`, all coefficients of `cyclotomic p R` equal `1`.
- `eq_nsmul_cyclotomic_of_nonneg_coeff`: a nonneg-coefficient polynomial vanishing at a primitive root is a positive scalar multiple of the cyclotomic polynomial.
- `card_fiber_eq_card_div`: if a function `d : A → ZMod p` satisfies `∑ ζ^(d a) = 0`, then every fiber has cardinality `|A| / p`.
These results are useful for combinatorial applications involving exponential sums and equidistribution over cyclic groups.
Theorems imported from: https://github.com/Latinum-Agentic-Commerce/AlgebraicDesignTheory |
new-contributor
t-ring-theory
|
101/1 |
Mathlib/RingTheory/Polynomial/Cyclotomic/Basic.lean,Mathlib/RingTheory/Polynomial/Cyclotomic/Roots.lean |
2 |
2 |
['github-actions'] |
chrisflav assignee:chrisflav |
4-45631 4 days ago |
9-32761 9 days ago |
9-32786 9 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 |
3-66974 3 days ago |
7-38012 7 days ago |
17-31555 17 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
t-analysis
new-contributor
|
62/0 |
Mathlib/Analysis/Complex/CauchyIntegral.lean |
1 |
7 |
['MichaelStollBayreuth', 'github-actions', 'mkaratarakis'] |
MichaelStollBayreuth assignee:MichaelStollBayreuth |
3-66955 3 days ago |
11-54050 11 days ago |
16-60253 16 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 |
3-60837 3 days ago |
3-60837 3 days ago |
8-12522 8 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
large-import
t-ring-theory
|
414/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 |
36 |
['BryceT233', 'Komyyy', 'erdOne', 'github-actions', 'mathlib4-merge-conflict-bot', 'riccardobrasca'] |
erdOne and riccardobrasca assignee:riccardobrasca assignee:erdOne |
3-48459 3 days ago |
29-47275 1 month ago |
48-8117 48 days |
| 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 ℤ`.
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.
This is a dependency of a larger PR to formalize finitely presented groups https://github.com/leanprover-community/mathlib4/pull/34236.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-group-theory
|
45/6 |
Mathlib/GroupTheory/FreeGroup/Basic.lean |
1 |
39 |
['b-mehta', 'copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'kbuzzard', 'tb65536'] |
riccardobrasca assignee:riccardobrasca |
3-45514 3 days ago |
15-70281 15 days ago |
23-13390 23 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/)
|
new-contributor
maintainer-merge
|
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 |
3-45511 3 days ago |
11-81587 11 days ago |
11-85935 11 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 |
3-45504 3 days ago |
7-38765 7 days ago |
7-38820 7 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'] |
nobody |
3-36304 3 days ago |
3-36507 3 days ago |
3-36558 3 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'] |
nobody |
3-26921 3 days ago |
4-51153 4 days ago |
8-67118 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-4071 3 days ago |
4-51138 4 days ago |
8-37199 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 |
2-84906 2 days ago |
2-84929 2 days ago |
23-60487 23 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 |
2-78064 2 days ago |
2-78090 2 days ago |
17-22699 17 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
large-import
t-group-theory
|
29/1 |
Mathlib/GroupTheory/PresentedGroup.lean |
1 |
12 |
['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-bors', 'plp127', 'tb65536'] |
nobody |
2-57193 2 days ago |
3-2522 3 days ago |
3-2761 3 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 |
2-45619 2 days ago |
21-13530 21 days ago |
21-13505 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
---
|
t-euclidean-geometry
new-contributor
|
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 |
2-31125 2 days ago |
4-51177 4 days ago |
9-65558 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-14013 2 days ago |
6-11982 6 days ago |
6-12033 6 days |
| 34624 |
homeowmorphism author:homeowmorphism |
feat(GroupTheory/FreeGroup/Basic): surjection between types induces surjection between free groups on those types |
feat(GroupTheory/FreeGroup/Basic): adds the theorem that if `α` and `β` are arbitrary types and there is a surjection between them, then the induced FreeGroup.map is also surjective.
This is a dependency of a larger PR to formalize finitely presented groups https://github.com/leanprover-community/mathlib4/pull/34236.
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
t-group-theory
|
14/3 |
Mathlib/GroupTheory/FreeGroup/Basic.lean |
1 |
24 |
['copilot-pull-request-reviewer', 'github-actions', 'homeowmorphism', 'mathlib-merge-conflicts', 'tb65536', 'vlad902'] |
riccardobrasca assignee:riccardobrasca |
2-4836 2 days ago |
15-69762 15 days ago |
26-65983 26 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 |
1-80222 1 day ago |
11-24402 11 days ago |
11-24459 11 days |
| 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
|
207/2 |
Mathlib.lean,Mathlib/Data/Finsupp/Weight.lean,Mathlib/RingTheory/MvPowerSeries/Equiv.lean,Mathlib/RingTheory/MvPowerSeries/Trunc.lean |
4 |
4 |
['github-actions', 'joneugster', 'mathlib-bors'] |
nobody |
1-80193 1 day ago |
4-51145 4 days ago |
8-28513 8 days |
| 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/)
|
new-contributor
t-data
|
25/18 |
Mathlib/Data/Finsupp/Pointwise.lean |
1 |
2 |
['github-actions'] |
joneugster assignee:joneugster |
1-80128 1 day ago |
9-55746 9 days ago |
9-55798 9 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/)
|
new-contributor
t-ring-theory
|
37/0 |
Mathlib/RingTheory/Ideal/Quotient/PowTransition.lean |
1 |
9 |
['BryceT233', 'erdOne', 'github-actions', 'wwylele'] |
chrisflav assignee:chrisflav |
1-80101 1 day ago |
3-39066 3 days ago |
9-53828 9 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/)
|
t-algebra
new-contributor
label:t-algebra$ |
29/0 |
Mathlib/Algebra/Algebra/Operations.lean,Mathlib/RingTheory/Ideal/Maps.lean |
2 |
4 |
['github-actions', 'joneugster'] |
nobody |
1-80038 1 day ago |
4-51195 4 days ago |
10-1514 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/)
|
new-contributor
FLT
large-import
t-ring-theory
|
59/0 |
Mathlib/RingTheory/DedekindDomain/AdicValuation.lean |
1 |
6 |
['github-actions', 'matthewjasper', 'riccardobrasca'] |
riccardobrasca assignee:riccardobrasca |
1-54106 1 day ago |
7-68718 7 days ago |
7-69526 7 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/)
|
new-contributor
t-data
|
25/0 |
Mathlib/Data/Finsupp/Fin.lean |
1 |
2 |
['github-actions'] |
TwoFX assignee:TwoFX |
1-52091 1 day ago |
17-47904 17 days ago |
17-47956 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/)
|
merge-conflict
t-order
new-contributor
|
99/82 |
Mathlib/Algebra/Field/Basic.lean,Mathlib/Algebra/Order/Archimedean/Basic.lean,Mathlib/Algebra/Order/Group/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Action/Synonym.lean,Mathlib/Algebra/Order/GroupWithZero/Synonym.lean,Mathlib/Algebra/Order/Module/OrderedSMul.lean,Mathlib/Algebra/Order/Module/Synonym.lean,Mathlib/Algebra/Order/Ring/Cast.lean,Mathlib/Analysis/Convex/Basic.lean,Mathlib/Analysis/Normed/Group/Constructions.lean,Mathlib/Data/Nat/Cast/Synonym.lean,Mathlib/Order/Defs/PartialOrder.lean,Mathlib/Order/Hom/WithTopBot.lean,Mathlib/Order/Lattice.lean |
14 |
4 |
['github-actions', 'mathlib-dependent-issues', 'mathlib-merge-conflicts'] |
nobody |
1-60057 1 day ago |
1-60060 1 day ago |
1-72793 1 day |
| 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/)
|
t-analysis
new-contributor
|
1193/0 |
Mathlib.lean,Mathlib/KernelTheory/Kernel.lean |
2 |
5 |
['TJHeeringa', 'github-actions', 'joneugster', 'vihdzp'] |
nobody |
4-51103 4 days ago |
4-51103 4 days ago |
7-66115 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 |
1-45589 1 day ago |
5-1455 5 days ago |
5-1505 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 |
19 |
['SnirBroshi', 'github-actions', 'tb65536'] |
nobody |
7-62428 7 days ago |
14-46970 14 days ago |
14-47024 14 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 |
4-63684 4 days ago |
7-64079 7 days ago |
7-64128 7 days |
| 35812 |
khwilson author:khwilson |
feat(MeasureTheory/Group/GeometryOfNumbers): successive minima and existence of a directional basis |
Define the successive minima of a discrete subgroup of a real vector space with respect to a convex set. These invariants show up throughout the geometry of numbers and are the focus of Minkowski's Second Theorem (whose statement is left here with a `proof_wanted`).
Note: The key lemma is that the "gauge set" of the convex set is closed. I took the approach of showing that it is sequentially closed. There's an alternative approach via showing it's the union of a finite number of closed sets. I personally thought this approach was more intuitive, but the union approach may result in a slightly shorter proof.
Co-authored-by: Yaël Dillies
---
[](https://gitpod.io/from-referrer/)
|
t-measure-probability
new-contributor
|
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-21172 1 day ago |
4-51067 4 days ago |
6-708 6 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`). |
t-combinatorics
new-contributor
|
198/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/IsolateVerts.lean |
3 |
132 |
['0xTerencePrime', 'SnirBroshi', 'YaelDillies', 'github-actions', 'vihdzp'] |
YaelDillies assignee:YaelDillies |
1-20180 1 day ago |
6-38946 6 days ago |
28-26574 28 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/)
|
t-measure-probability
new-contributor
|
246/14 |
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 |
17 |
['github-actions', 'mathlib-dependent-issues', 'mathlib4-merge-conflict-bot', 'sgouezel', 'yoh-tanimoto'] |
nobody |
1-82486 1 day ago |
1-83367 1 day ago |
36-72204 36 days |
| 36041 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/Matching): add maximal and maximum matching defs |
Closes #34957.
This is a focused pass on the issue request:
- add `Subgraph.IsMaximalMatching` as `Maximal IsMatching`
- add `Subgraph.IsMaximumMatching` as `MaximalFor IsMatching (fun M ↦ Cardinal.mk M.edgeSet)`
- add small wrapper lemmas:
- `Subgraph.isMaximalMatching_iff`
- `Subgraph.isMaximumMatching_iff`
Build:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Matching.lean`
- `~/.elan/bin/lake build`
Context:
- There is already broader work in #32555; this PR intentionally keeps scope narrow to land the core defs/API from this issue.
|
t-combinatorics
new-contributor
|
27/0 |
Mathlib/Combinatorics/SimpleGraph/Matching.lean |
1 |
2 |
['github-actions'] |
nobody |
1-10881 1 day ago |
1-10881 1 day ago |
1-10936 1 day |
| 36042 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/VertexCover): add minimal/minimum cover defs |
Closes #34958.
This PR adds the requested core definitions/API for vertex covers:
- `SimpleGraph.IsMinimalCover`
- `SimpleGraph.IsMinimumCover`
- `SimpleGraph.isMinimalCover_iff`
- `SimpleGraph.isMinimumCover_iff`
`IsMinimumCover` is defined via `MinimalFor` with `Cardinal.mk` cardinality.
Build:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/VertexCover.lean`
- `~/.elan/bin/lake build`
Context:
- #33032 contains broader vertex-cover/Kőnig development; this PR is intentionally scoped to landing the focused defs/API from #34958.
|
t-combinatorics
new-contributor
|
22/0 |
Mathlib/Combinatorics/SimpleGraph/VertexCover.lean |
1 |
2 |
['github-actions'] |
nobody |
1-10473 1 day ago |
1-10473 1 day ago |
1-10528 1 day |
| 36022 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph): redefine `IsBridge` via `deleteEdges` |
Closes #31690
## Summary
This PR changes `SimpleGraph.IsBridge` to the deletion-only notion requested in #31690:
an edge is a bridge when deleting it disconnects its endpoints, without requiring
`e ∈ G.edgeSet` inside the definition.
## Main changes
- Redefine `IsBridge` in `Connectivity/Connected.lean`.
- Update `isBridge_iff` to the new statement.
- Refactor bridge lemmas to carry adjacency/edge-membership assumptions explicitly where needed.
- Add/update helper lemmas used by downstream files.
- Fix dependent proofs in:
- `Connectivity/EdgeConnectivity.lean`
- `Acyclic.lean`
- `Hamiltonian.lean`
## Validation
- `lake build Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected Mathlib.Combinatorics.SimpleGraph.Connectivity.EdgeConnectivity Mathlib.Combinatorics.SimpleGraph.Acyclic Mathlib.Combinatorics.SimpleGraph.Hamiltonian`
- `lake build` (full)
## AI use disclosure
I used Codex as an assistant for drafting/refactoring and proof iteration, and manually verified the final result with local Lean builds.
|
t-combinatorics
new-contributor
|
68/52 |
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/EdgeConnectivity.lean,Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean |
4 |
3 |
['SproutSeeds', 'github-actions'] |
nobody |
1-9963 1 day ago |
1-9971 1 day ago |
1-9947 1 day |
| 36023 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph): add maximal clique/indep-set defs and use MaximalFor |
Closes #34962.
This PR:
- defines `SimpleGraph.IsMaximalClique` and `SimpleGraph.IsMaximalIndepSet` as aliases of `Maximal`
- redefines `SimpleGraph.IsMaximumClique` and `SimpleGraph.IsMaximumIndepSet` using `MaximalFor` over cardinality
- keeps the existing `..._iff`, complement, existence, and cardinality lemmas by adapting proofs to the new definitions
Build:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Clique.lean`
- `~/.elan/bin/lake build`
|
t-combinatorics
new-contributor
|
46/31 |
Mathlib/Combinatorics/SimpleGraph/Clique.lean |
1 |
6 |
['SproutSeeds', 'b-mehta', 'github-actions'] |
nobody |
1-8585 1 day ago |
1-8585 1 day ago |
1-17739 1 day |
| 27229 |
WilliamCoram author:WilliamCoram |
feat(GroupTheory/DoubleCoset): multiple lemmas |
From FLT
---
[](https://gitpod.io/from-referrer/)
|
new-contributor
FLT
t-group-theory
|
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-4301 1 day ago |
1-4451 1 day ago |
179-11601 179 days |
| 36053 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/Matching): add graph-level IsMatching predicate |
This draft introduces a graph-level matching predicate:
- `SimpleGraph.IsMatching` for graphs on any vertex type
It also updates module docs so that:
- `SimpleGraph.IsMatching` is the general definition
- `SimpleGraph.Subgraph.IsMatching` is the specialized subgraph version
Verification:
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Matching.lean`
- `~/.elan/bin/lake exe runLinter --trace Mathlib.Combinatorics.SimpleGraph.Matching`
Addresses #11911.
|
t-combinatorics
new-contributor
|
8/2 |
Mathlib/Combinatorics/SimpleGraph/Matching.lean |
1 |
2 |
['github-actions'] |
nobody |
0-84451 23 hours ago |
0-84450 23 hours ago |
0-84426 23 hours |
| 36056 |
SproutSeeds author:SproutSeeds |
chore: rename ordered-cancel add monoid counterexample file |
Renames the counterexample module to match the current class naming around `IsOrderedCancelAddMonoid`.
Also updates the module docstring so it no longer references the removed class `OrderedCancelAddCommMonoid`.
Issue: #27812
Validation:
- ~/.elan/bin/lake build Counterexamples/IsOrderedCancelAddMonoidWithBounds.lean Counterexamples.lean
- ~/.elan/bin/lake exe runLinter --trace Counterexamples.IsOrderedCancelAddMonoidWithBounds |
new-contributor
file-removed
|
5/4 |
Counterexamples.lean,Counterexamples/IsOrderedCancelAddMonoidWithBounds.lean |
2 |
2 |
['github-actions'] |
nobody |
0-84451 23 hours ago |
0-84451 23 hours ago |
0-84427 23 hours |
| 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 |
0-81683 22 hours ago |
0-81683 22 hours ago |
0-81735 22 hours |
| 36063 |
SproutSeeds author:SproutSeeds |
feat(SimpleGraph/Connectivity): add vertex reachability and connectivity numbers |
### Summary
Adds a first-pass vertex connectivity API for simple graphs.
- define `SimpleGraph.isolateVerts`
- define `SimpleGraph.IsVertexReachable` and `SimpleGraph.IsVertexConnected`
- define `SimpleGraph.vertexReachability` and `SimpleGraph.vertexConnectivity`
- add basic lemmas for reflexivity, symmetry, monotonicity, antitonicity, and the `k = 0` and `k = 1` characterizations
Closes #34960.
### Local checks
- `~/.elan/bin/lake build Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean`
- `~/.elan/bin/lake exe lint-style Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean`
- `bash scripts/mathlib-issue-local-gate.sh --repo /Users/codymitchell/Documents/code/mathlib4 --issue 34960 --build-target Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean --lint-module Mathlib.Combinatorics.SimpleGraph.Connectivity.VertexConnectivity --skip-mk-all`
|
t-combinatorics
new-contributor
|
140/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Connectivity/VertexConnectivity.lean |
2 |
2 |
['github-actions'] |
nobody |
0-75061 20 hours ago |
0-75061 20 hours ago |
0-75037 20 hours |
| 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 |
0-73739 20 hours ago |
2-6627 2 days ago |
2-6679 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 |
0-61159 16 hours ago |
50-19872 1 month ago |
50-19846 50 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 |
0-47684 13 hours ago |
7-20318 7 days ago |
7-20378 7 days |
| 35906 |
scp020 author:scp020 |
feat(Combinatorics/SimpleGraph/Walks): add Walk.IsChord and Walk.IsChordless |
This PR adds a new file:
- `Mathlib/Combinatorics/SimpleGraph/Walks/Chords`
and introduces two definitions for closed walks in simple graphs:
- `SimpleGraph.Walk.IsChord`
- `SimpleGraph.Walk.IsChordless`
Motivation:
These notions are standard in graph theory and are useful for reasoning about induced cycles (that is, chordless cycles). In particular, they provide a clean interface for structural arguments where one chooses a chordless cycle and then studies how the rest of the graph interacts with it.
Design:
- `Walk.IsChord` says that `v` and `w` are vertices of a closed walk `p`, that they are adjacent in the ambient graph, and that this ambient edge is not an edge of `p`.
- `Walk.IsChordless` says that `p` is a cycle and that every ambient edge between two vertices of `p` already appears in `p`.
This PR also includes a small API for these definitions:
- `SimpleGraph.Walk.IsChord.symm`
- `SimpleGraph.Walk.isChord_iff`
- `SimpleGraph.Walk.IsChordless.isCycle`
- `SimpleGraph.Walk.IsChordless.mem_edges`
- `SimpleGraph.Walk.IsChordless.not_isChord`
- `SimpleGraph.Walk.isChordless_iff_forall_not_isChord`
The file is placed in `namespace SimpleGraph.Walk` to match the existing `Walk`-based predicates and lemmas in the simple graph library.
This PR is intentionally small: it adds the core definitions together with basic non-mechanical API that supports direct mathematical use.
Validation:
- `lake build Mathlib.Combinatorics.SimpleGraph.Walks.Chords`
- `lake exe lint-style Mathlib/Combinatorics/SimpleGraph/Walks/Chords.lean`
- `#lint`
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
|
82/0 |
Mathlib.lean,Mathlib/Combinatorics/SimpleGraph/Walks/Chords.lean |
2 |
2 |
['github-actions'] |
nobody |
1-35537 1 day ago |
1-46089 1 day ago |
2-7473 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 |
0-39599 10 hours ago |
0-52155 14 hours ago |
0-52203 14 hours |
| 36020 |
SproutSeeds author:SproutSeeds |
feat(Combinatorics/Enumerative/DoubleCounting): add weighted bipartite lower bound |
## Summary
This PR adds a weighted bipartite double-counting lower bound in
`Mathlib/Combinatorics/Enumerative/DoubleCounting.lean`:
- `Finset.sum_mul_le_sum_sum_bipartiteBelow_of_le_card_bipartiteAbove`
## New theorem
```lean
theorem sum_mul_le_sum_sum_bipartiteBelow_of_le_card_bipartiteAbove
[∀ a b, Decidable (r a b)] (w m : α → ℕ)
(hm : ∀ a ∈ s, m a ≤ #(t.bipartiteAbove r a)) :
(∑ a ∈ s, m a * w a) ≤ ∑ b ∈ t, ∑ a ∈ s.bipartiteBelow r b, w a
```
## Motivation
Existing double-counting lemmas in this file are cardinality-based with constant bounds.
This theorem provides the weighted/inhomogeneous variant: each left vertex `a` can carry
its own multiplicity lower bound `m a` and weight `w a`.
This packages a reusable pattern for incidence arguments where lower bounds vary across
vertices.
## Use cases
1. Weighted incidence counting in bipartite relations with non-uniform degree guarantees.
2. Charging arguments where each object contributes weight and has an object-dependent
minimum witness multiplicity.
## API / compatibility
- No existing theorem names changed.
- No imports added.
- Additive change only.
## Verification
```bash
~/.elan/bin/lake build Mathlib.Combinatorics.Enumerative.DoubleCounting
~/.elan/bin/lake env lean Mathlib/Combinatorics/Enumerative/DoubleCounting.lean
```
## AI usage
I used AI tools for exploration/drafting, then manually selected the statement,
edited the Lean code, and ran local checks.
|
t-combinatorics
new-contributor
|
15/0 |
Mathlib/Combinatorics/Enumerative/DoubleCounting.lean |
1 |
6 |
['Rida-Hamadani', 'SproutSeeds', 'github-actions'] |
nobody |
0-35298 9 hours ago |
1-39206 1 day ago |
1-39258 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-61954 1 day ago |
2-36276 2 days ago |
2-36329 2 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 |
0-25929 7 hours ago |
47-40583 1 month ago |
47-40621 47 days |
| 35559 |
mike1729 author:mike1729 |
feat(Analysis/Normed): weak-topology embedding into weak-star bidual and compactenss transfer theorem |
This PR refactors the double dual material and adds new results connecting the weak topology on a normed space to the weak-star topology on its bidual.
## Changes
### New file: `Analysis.Normed.Module.DoubleDual`
Extracts the canonical embedding `inclusionInDoubleDual` and the bidual isometry `inclusionInDoubleDualLi` from `Analysis.Normed.Module.Dual` into a dedicated file, and adds:
- `inclusionInDoubleDualWeak`: the canonical map from `WeakSpace 𝕜 X` into `WeakDual 𝕜 (StrongDual 𝕜 X)`.
- `inclusionInDoubleDualWeak_isEmbedding`: this map is a topological embedding.
- `inclusionInDoubleDualWeak_homeomorph`: the map as a homeomorphism onto its range.
- `isCompact_closure_of_isBounded`: bounded sets whose bidual image has weak-star closure in range have weakly compact closure, via Banach–Alaoglu.
### New file: `Analysis.Normed.Module.WeakSpace`
- `WeakSpace.instBornology`: norm bornology on `WeakSpace 𝕜 E`, inherited from `E`.
- `WeakSpace.instT2Space`: the weak topology over `RCLike` is Hausdorff (via Hahn–Banach).
### Modified: `Analysis.Normed.Module.Dual`
The double dual inclusion material is moved out; polar set results remain. References to `inclusionInDoubleDual` in `polar_closure` are replaced by `ContinuousLinearMap.apply` to avoid a dependency on the new file.
---
CC: @faenuccio this may be relevant for your Goldstine formalization.
|
t-analysis
new-contributor
|
285/99 |
Mathlib.lean,Mathlib/Analysis/LocallyConvex/SeparatingDual.lean,Mathlib/Analysis/LocallyConvex/Separation.lean,Mathlib/Analysis/Normed/Module/DoubleDual.lean,Mathlib/Analysis/Normed/Module/Dual.lean,Mathlib/Analysis/Normed/Module/WeakDual.lean,Mathlib/Analysis/Normed/Module/WeakSpace.lean,Mathlib/MeasureTheory/Integral/IntervalIntegral/FundThmCalculus.lean,Mathlib/MeasureTheory/Measure/CharacteristicFunction/Basic.lean,Mathlib/Probability/Distributions/Gaussian/CharFun.lean |
10 |
16 |
['github-actions', 'j-loreaux', 'mathlib-merge-conflicts', 'mike1729'] |
ADedecker assignee:ADedecker |
0-24380 6 hours ago |
0-28576 7 hours ago |
11-55994 11 days |
| 35785 |
Brian-Nugent author:Brian-Nugent |
feat(CategoryTheory/Topology): Add Flasque Sheaves |
This PR defines flasque sheaves on a topological space as sheaves where all restriction morphisms are epimorphisms. The main result of this PR is `TopCat.Sheaf.IsFlasque.epi_of_shortExact` which says a short exact sequence where the first sheaf is flasque remains exact on sections.
---
- [x] depends on: #34267
[](https://gitpod.io/from-referrer/)
|
merge-conflict
t-category-theory
new-contributor
|
384/1 |
Mathlib.lean,Mathlib/Algebra/Category/Grp/AB.lean,Mathlib/Topology/Sheaves/Abelian.lean,Mathlib/Topology/Sheaves/AddCommGrpCat.lean,Mathlib/Topology/Sheaves/Flasque.lean,Mathlib/Topology/Sheaves/Presheaf.lean,Mathlib/Topology/Sheaves/SheafCondition/UniqueGluing.lean,Mathlib/Topology/Sheaves/Skyscraper.lean |
8 |
11 |
['github-actions', 'joneugster', 'mathlib-dependent-issues', 'mathlib-merge-conflicts', 'smorel394'] |
dagurtomas assignee:dagurtomas |
1-61318 1 day ago |
1-61319 1 day ago |
0-34126 9 hours |
| 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 assignee:kex-y |
1-57087 1 day ago |
41-85883 1 month ago* |
44-1078 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/)
|
new-contributor
t-data
|
42/32 |
Mathlib/Data/PFunctor/Multivariate/W.lean,Mathlib/Data/QPF/Multivariate/Constructions/Fix.lean |
2 |
2 |
['github-actions'] |
nobody |
0-4408 1 hour ago |
0-76957 21 hours ago |
0-77009 21 hours |
| 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
|
276/0 |
Mathlib.lean,Mathlib/Topology/Covering/FundamentalGroupCircle.lean |
2 |
20 |
['Ruizsolveall', 'b-mehta', 'github-actions', 'vihdzp'] |
nobody |
0-2397 39 minutes ago |
0-9253 2 hours ago |
0-9308 2 hours |