[Merged by Bors] - feat(Data/Matroid/Rank/Cardinal): Cardinality-valued rank function#20921
[Merged by Bors] - feat(Data/Matroid/Rank/Cardinal): Cardinality-valued rank function#20921
Conversation
PR summary 74c464f94a
|
| File | Base Count | Head Count | Change |
|---|---|---|---|
| Mathlib.Data.Matroid.Rank.Cardinal | 713 | 719 | +6 (+0.84%) |
Import changes for all files
| Files | Import difference |
|---|---|
Mathlib.Data.Matroid.Rank.Cardinal |
6 |
Declarations diff
+ Base.cardinalMk_diff_comm
+ Base.cardinalMk_eq
+ Base.cardinalMk_eq_cRank
+ Base.cardinalMk_le_cRank
+ Basis'.cardinalMk_diff_comm
+ Basis'.cardinalMk_eq
+ Basis'.cardinalMk_eq_cRk
+ Basis'.cardinalMk_le_cRk
+ Basis.cardinalMk_diff_comm
+ Basis.cardinalMk_eq
+ Basis.cardinalMk_eq_cRk
+ Basis.cardinalMk_le_cRk
+ Indep.cRk_eq_cardinalMk
+ Indep.cardinalMk_le_base
+ Indep.cardinalMk_le_basis
+ Indep.cardinalMk_le_basis'
+ Indep.cardinalMk_le_cRk_of_subset
+ InvariantCardinalRank
+ cRank
+ cRank_le_iff
+ cRank_restrict
+ cRk
+ cRk_closure
+ cRk_closure_congr
+ cRk_comap
+ cRk_comap_lift
+ cRk_ground
+ cRk_insert_closure_eq
+ cRk_inter_add_cRk_union_le
+ cRk_inter_ground
+ cRk_le_cardinalMk
+ cRk_le_iff
+ cRk_le_of_subset
+ cRk_map_eq
+ cRk_map_image
+ cRk_map_image_lift
+ cRk_mono
+ cRk_restrict
+ cRk_restrict_subset
+ cRk_union_closure_eq
+ cRk_union_closure_left_eq
+ cRk_union_closure_right_eq
+ instance (M : Matroid α) : Nonempty {B // M.Base B}
+ invariantCardinalRank_comap
+ invariantCardinalRank_map
+ invariantCardinalRank_of_finitary
+ invariantCardinalRank_restrict
- Base.cardinalMk_diff_comm_of_finitary
- Base.cardinalMk_eq_of_finitary
- Basis'.cardinalMk_diff_comm_of_finitary
- Basis'.cardinalMk_eq_of_finitary
- Basis.cardinalMk_diff_comm_of_finitary
- Basis.cardinalMk_eq_of_finitary
- Indep.cardinalMk_le_base_of_finitary
- Indep.cardinalMk_le_basis'_of_finitary
- Indep.cardinalMk_le_basis_of_finitary
You can run this locally as follows
## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>
## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>The doc-module for script/declarations_diff.sh contains some details about this script.
No changes to technical debt.
You can run this locally as
./scripts/technical-debt-metrics.sh pr_summary
- The
relativevalue is the weighted sum of the differences with weight given by the inverse of the current value of the statistic. - The
absolutevalue is therelativevalue divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).
|
LGTM bors d=alreadydone |
|
✌️ alreadydone can now approve this pull request. To approve and merge a pull request, simply reply with |
alreadydone
left a comment
There was a problem hiding this comment.
Thanks 🎉
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by alreadydone. |
|
✌️ apnelson1 can now approve this pull request. To approve and merge a pull request, simply reply with |
|
bors r+ |
…20921) We abstract out the matroid property of 'having a well-defined `Cardinality`-valued rank function' as a typeclass `Matroid.CardinalRank`, and use it to define a rank function `Matroid.cardRk` and prove basic properties. The fact that `Finitary` matroids have such a rank function is now provided as an instance.
|
Pull request successfully merged into master. Build succeeded: |
* origin/master: (294 commits) feat: equalizers and coequalizers in the category of ind-objects (#21139) doc: turn more links to Stacks into `@[stacks]` tags (#21135) feat(Asymptotics): prove `IsLittleOTVS.add` (#20578) feat(Algebra/Polynomial): `Polynomial.aeval` for product algebras (#21062) chore: import Std in Mathlib.lean (#21126) feat(Data/Matroid/Circuit): fundamental circuits and extensionality (#21145) feat(CategoryTheory/Endofunctor): prove the dual form of Lambek's Lemma on terminal coalgebra (#21140) feat(SetTheory/Game/PGame): rewrite left moves of `-x` as right moves of `x` under binders (#21109) feat(RingTheory/Localization/Pi): localization of a finite direct product is a product of localizations (#19042) doc: fixed notation error in customizing category composition (#21132) feat(Matrix): more lemmas for `PEquiv.toMatrix` (#21143) chore(SupIndep): speedup the `Decidable` instance (#21114) fix(CI): use `Elab.async=false` for late importers workflow (#21147) feat(Topology/Algebra/Indicator): indicator of a clopen is continuous (#20687) feat(Data/Matroid/Rank/Cardinal): Cardinality-valued rank function (#20921) feat(Algebra): `Pi.single_induction` (#21141) chore(BigOperators/Fin): golf a proof (#21131) feat: generalize tangent cone lemmas to TVS (#20859) feat(CategoryTheory): `Comma.snd L R` is final if `R` is final and domains are filtered (#21136) refactor: unapply matrix lemmas (#21091) chore(Algebra/Category): `erw` -> `rw` (#21130) feat(CategoryTheory): filteredness of Comma catgories given finality of one of the functors (#21128) feat(Algebra/Category): `ConcreteCategory` instance for `ModuleCat` (#21125) feat: PSum of finite sorts is finite (#20285) feat: inequality on the integral of a convex function of a RN derivative (#21093) feat: `(v +ᵥ s) -ᵥ (v +ᵥ t) = s -ᵥ t` (#21058) chore: rename the fact that `(∀ a < a₁, a ≤ a₂) ↔ a₁ ≤ a₂` in a dense order (#20317) feat: a `RelHom` preserves directedness (#20080) feat(Combinatorics/SimpleGraph): add definitions and theorems about the coloring of sum graphs (#18677) chore(Data/Matrix/PEquiv): clean up names (#21108) feat(Algebra/Category): `ConcreteCategory` instances for rings (#20815) feat: define Descriptive.Tree (#18763) chore(Data/Complex/Exponential): split trig functions to new file (#21075) feat(Logic/IsEmpty/Relator): empty on sides (#20319) feat(Algebra/Category): `ConcreteCategory` instance for `AlgebraCat` (#21121) feat(NumberTheory/LSeries): results involving partial sums of coefficients (part 1) (#20661) feat(RingTheory/LaurentSeries): add algebraEquiv (#21004) chore(SetTheory/Game/Impartial): golf two proofs (#21074) feat(CategoryTheory/Subpresheaf): preimage/image/range of subpresheaves (#21047) feat(RingTheory/IntegralClosure): `Algebra.IsIntegral` transfers via surjective homomorphisms (#21023) feat(`InformationTheory/Hamming`): Add AddGroup instances (#20994) feat(RingTheory/IntegralClosure): prove `Module.Finite R (adjoin R S)` for finite set `S` of integral elements (#20970) feat(RingTheory/Artinian): `IsUnit a` iff `a ∈ R⁰` for an artinian ring `R` (#21084) feat: separating set in the category of ind-objects (#21082) feat: derivWithin lemmas (#21092) chore(Fintype): golf a proof (#21113) chore: golf using `funext₂` (#21106) chore(Algebra/Group/Submonoid/Operations): move instances to new file (#21067) doc(Algebra/BigOperators/Fin): change 'product' to 'sum' in doc-string of additivised declarations (#21101) doc(ComputeDegree): typos (#21095) ...
* polynomial-sequences: (308 commits) Use the lemma we already added. Minor reordering. This is true even for the trivial ring. Also add the lt versions and the other inj lemma. Also add the basis ne versions. This seems also like it should be simp. Back to sorry free. And the natDegree version. feat: equalizers and coequalizers in the category of ind-objects (#21139) doc: turn more links to Stacks into `@[stacks]` tags (#21135) feat(Asymptotics): prove `IsLittleOTVS.add` (#20578) feat(Algebra/Polynomial): `Polynomial.aeval` for product algebras (#21062) chore: import Std in Mathlib.lean (#21126) feat(Data/Matroid/Circuit): fundamental circuits and extensionality (#21145) feat(CategoryTheory/Endofunctor): prove the dual form of Lambek's Lemma on terminal coalgebra (#21140) feat(SetTheory/Game/PGame): rewrite left moves of `-x` as right moves of `x` under binders (#21109) feat(RingTheory/Localization/Pi): localization of a finite direct product is a product of localizations (#19042) doc: fixed notation error in customizing category composition (#21132) feat(Matrix): more lemmas for `PEquiv.toMatrix` (#21143) chore(SupIndep): speedup the `Decidable` instance (#21114) fix(CI): use `Elab.async=false` for late importers workflow (#21147) feat(Topology/Algebra/Indicator): indicator of a clopen is continuous (#20687) feat(Data/Matroid/Rank/Cardinal): Cardinality-valued rank function (#20921) feat(Algebra): `Pi.single_induction` (#21141) chore(BigOperators/Fin): golf a proof (#21131) feat: generalize tangent cone lemmas to TVS (#20859) feat(CategoryTheory): `Comma.snd L R` is final if `R` is final and domains are filtered (#21136) refactor: unapply matrix lemmas (#21091) chore(Algebra/Category): `erw` -> `rw` (#21130) feat(CategoryTheory): filteredness of Comma catgories given finality of one of the functors (#21128) feat(Algebra/Category): `ConcreteCategory` instance for `ModuleCat` (#21125) feat: PSum of finite sorts is finite (#20285) feat: inequality on the integral of a convex function of a RN derivative (#21093) feat: `(v +ᵥ s) -ᵥ (v +ᵥ t) = s -ᵥ t` (#21058) chore: rename the fact that `(∀ a < a₁, a ≤ a₂) ↔ a₁ ≤ a₂` in a dense order (#20317) feat: a `RelHom` preserves directedness (#20080) feat(Combinatorics/SimpleGraph): add definitions and theorems about the coloring of sum graphs (#18677) chore(Data/Matrix/PEquiv): clean up names (#21108) feat(Algebra/Category): `ConcreteCategory` instances for rings (#20815) feat: define Descriptive.Tree (#18763) chore(Data/Complex/Exponential): split trig functions to new file (#21075) feat(Logic/IsEmpty/Relator): empty on sides (#20319) feat(Algebra/Category): `ConcreteCategory` instance for `AlgebraCat` (#21121) feat(NumberTheory/LSeries): results involving partial sums of coefficients (part 1) (#20661) feat(RingTheory/LaurentSeries): add algebraEquiv (#21004) chore(SetTheory/Game/Impartial): golf two proofs (#21074) feat(CategoryTheory/Subpresheaf): preimage/image/range of subpresheaves (#21047) feat(RingTheory/IntegralClosure): `Algebra.IsIntegral` transfers via surjective homomorphisms (#21023) feat(`InformationTheory/Hamming`): Add AddGroup instances (#20994) feat(RingTheory/IntegralClosure): prove `Module.Finite R (adjoin R S)` for finite set `S` of integral elements (#20970) ...
We abstract out the matroid property of 'having a well-defined
Cardinality-valued rank function' as a typeclassMatroid.CardinalRank, and use it to define a rank functionMatroid.cardRkand prove basic properties. The fact thatFinitarymatroids have such a rank function is now provided as an instance.