Upstreaming dashboard
Files ready to upstream
The following files are sorry-free and do not depend on any other file, meaning they can be readily PRed to Mathlib.
PRs are grouped as 'relevant' if they contain the following label: carleson
6 open pull requests (1 with relevant labels)
Relevant
Other
2 open pull requests (0 with relevant labels)
No open pull requests.
No open pull requests.
1 open pull request (0 with relevant labels)
11 open pull requests (2 with relevant labels)
Relevant
Other
- chore: make `finiteness` a default tactic #26090
- refactor: unbundle algebra from `ENormed*` #28803
- feat(MeasureTheory): add `MemLp.Const` class and instances to unify `p = ∞` and `μ.IsFiniteMeasure` cases #30030
- feat: define Sobolev Spaces #32305
- perf: unbundle algebra from `ENormed*`, April 2026 version #38032
- refactor(Order): make completeness typeclasses mixins #38537
- feat: fun_prop for integrability #39323
- feat(FunProp): tag integrableOn #39325
- feat(MeasureTheory): generalize rpow·exp and scalar-multiplication integrability lemmas #40587
8 open pull requests (0 with relevant labels)
Other
- chore: attribute [induction_eliminator] #12605
- chore(MeasureTheory): use `0` instead of `const _ 0` #24060
- feat(Tactic/Push): add basic tags and tests #29000
- feat(Topology/Algebra/InfiniteSum): Deprecate generalized ENNReal lemmas #38193
- wip, chore: rename Directed -> Predirected [please-adopt] #38792
- feat(MeasureTheory): use `IsApply` for `SimpleFunc` #40918
- feat(MeasureTheory): use `IsApply` for `Measure` #41177
- chore: remove redudant haveI/letI in defs #41680
1 open pull request (0 with relevant labels)
9 open pull requests (0 with relevant labels)
Other
- refactor: unbundle algebra from `ENormed*` #28803
- chore: rename `continuous{,On,At,Within}_const` to `ContinuousFoo.const` #31607
- feat(Topology/Compactness/CompactSystem): set system of countable intersections of sets in a compact system is again a compact system #36225
- perf: unbundle algebra from `ENormed*`, April 2026 version #38032
- refactor(Order): make completeness typeclasses mixins #38537
- feat(IntervalIntegrable): add `fun_prop` support #38822
- feat: define contour integrals #39254
- feat(MeasureTheory): generalize rpow·exp and scalar-multiplication integrability lemmas #40587
- chore: remove redudant `nonrec`'s #41259
1 open pull request (0 with relevant labels)
3 open pull requests (0 with relevant labels)
4 open pull requests (0 with relevant labels)
Other
No open pull requests.
14 open pull requests (0 with relevant labels)
Other
- feat: map a seminorm along a surjective linear map #34106
- refactor: use `OrderSupInfSet` #35263
- refactor: use `OrderSupSet` in `ConditionallyCompleteLattice` #35674
- feat(Order/ConditionallyCompleteLattice): ConditionallyCompleteSemiLatticeInf #38192
- refactor(Order/(Conditionally)CompletePartialOrder): extends `OrderSupSet` #38444
- refactor(Order): make completeness typeclasses mixins #38537
- chore(ConditionallyCompleteLattice/Indexed): dualize #38938
- chore: remove @[expose] from def-free public sections #39388
- feat(Topology/Order): convergence of suprema and infima #40578
- chore(Order): add to_dual tags in Mathlib/Order/ConditionallyCompleteLattice/Indexed #40584
- feat: holder continuity of suprema and infima #40585
- feat(Order/ConditionallyCompleteLattice): antitone versions of `sSup (f '' s)` lemmas #41273
- chore(order/ConditionallyCompleteLattice): use `to_dual` more #41558
- chore: unexpose public sections with no defs #41564
12 open pull requests (1 with relevant labels)
Relevant
Other
- refactor: use `OrderSupInfSet` #35263
- refactor: use `OrderSupSet` in `ConditionallyCompleteLattice` #35674
- feat(Tactic/Linter): lint against `simpa ... using by tactic` #36496
- refactor(Order/(Conditionally)CompletePartialOrder): extends `OrderSupSet` #38444
- refactor(Order): make completeness typeclasses mixins #38537
- feat(Order/ConditionallyCompleteLattice/Indexed): `≤` version of `ciSup_or'` for `ConditionallyCompleteLattice` #38855
- feat(Order/CompleteLattice/Basic): tag `iSup_of_empty'` with `@[simp]` #38859
- chore(ConditionallyCompleteLattice/Indexed): dualize #38938
- feat(Topology/Order): convergence of suprema and infima #40578
- chore(Order): add to_dual tags in Mathlib/Order/ConditionallyCompleteLattice/Indexed #40584
- feat: holder continuity of suprema and infima #40585
No open pull requests.
No open pull requests.
1 open pull request (1 with relevant labels)
Files easy to unlock
The following files do not depend on any other file but still contain sorry, usually indicating that working on eliminating those sorries might unblock some part of the project.
1 sorry