Repository navigation
chore: downstream-lean4 adaptations for nightly-2026-10-21 - #45142
downstream-lean4[bot] wants to merge 1 commit into
Conversation
Welcome new contributor!Thank you for contributing to Mathlib! If you haven't done so already, please review our contribution guidelines, as well as the style guide and naming conventions. In particular, we kindly remind contributors that we have guidelines regarding the use of AI when making pull requests. We use a review queue to manage reviews. If your PR does not appear there, it is probably because it is not successfully building (i.e., it doesn't have a green checkmark), has the If you haven't already done so, please come to Zulip and join the Lean community. |
PR summary 8bc0022b90Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
| Current number | Change | Type (strong) |
|---|---|---|
| 391 | 5 | adaptation notes |
| 26 | 1 | disabled simpNF lints |
| 11 | 2 | disabled deprecation lints |
Current commit 8bc0022b90
Reference commit d88814353f
This script lives in the mathlib-ci repository. To run it locally, from your mathlib4 directory:
git clone https://github.com/leanprover-community/mathlib-ci.git ../mathlib-ci
../mathlib-ci/scripts/reporting/technical-debt-metrics.py 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).
18c3e78 to
e08fc13
Compare
d542bba to
8fe54d9
Compare
| simp only [Equiv.toFun_as_coe, Equiv.prodCongr_apply, EquivLike.coe_coe, | ||
| Prod.map, map_mul, Prod.mk_mul_mk] | ||
| simp only [Equiv.toFun_as_coe, Equiv.prodCongr_apply, Prod.map, EquivLike.coe_coe, map_mul, | ||
| Prod.mk_mul_mk] |
There was a problem hiding this comment.
I don't think we should merge these changes, since the two versions do the same thing and will just cause merge conflicts down the line.
Vierkantor
left a comment
There was a problem hiding this comment.
I need to run for a bit, but when I come back I plan to revert a lot of these changes since they appear unnecessary.
| rw [AlgHom.comp_apply, | ||
| map_eq_zero_iff _ (rename_injective _ (fun _ _ _ ↦ rfl (α := PUnit.{u + 1})))] at this |
There was a problem hiding this comment.
This change seems to be unnecessary too.
| theorem continuous_re : Continuous fun q : ℍ => q.re := | ||
| (PiLp.continuous_apply 2 _ 0).comp linearIsometryEquivTuple.continuous | ||
| theorem continuous_re : Continuous fun q : ℍ => q.re := by | ||
| convert! (PiLp.continuous_apply 2 _ 0).comp linearIsometryEquivTuple.continuous |
There was a problem hiding this comment.
Also seems to be unnecessary...
| let ⟨_,b,_⟩ := f | ||
| let ⟨_,e,_⟩ := g | ||
| congr | ||
| simp only [eq_iff_true_of_subsingleton] |
There was a problem hiding this comment.
This is indeed a positive change!
| def commMonToLaxBraidedObj (A : CommMon C) : | ||
| Discrete PUnit.{u + 1} ⥤ C := (Functor.const _).obj A.X | ||
|
|
||
| attribute [nolint simpNF] commMonToLaxBraidedObj_map |
There was a problem hiding this comment.
This needs an adaptation note at least. We might even get away with removing the lemma altogether since both versions reduce to "this map is the identity":
@[simps! obj] -- `map` can already be proven.
def commMonToLaxBraidedObj (A : CommMon C) :
Discrete PUnit.{u + 1} ⥤ C := (Functor.const _).obj A.X| attribute [nolint simpNF] equivLaxMonoidalFunctorPUnit_inverse_obj_map | ||
| AddMon.equivLaxMonoidalFunctorPUnit_inverse_obj_map |
There was a problem hiding this comment.
| attribute [nolint simpNF] equivLaxMonoidalFunctorPUnit_inverse_obj_map | |
| AddMon.equivLaxMonoidalFunctorPUnit_inverse_obj_map | |
| attribute [nolint simpNF] equivLaxMonoidalFunctorPUnit_inverse_obj_map | |
| AddMon.equivLaxMonoidalFunctorPUnit_inverse_obj_map | |
| (trNat_natEnd _) ⟨rfl, by simp⟩)) | ||
| (TransGen.head rfl (TransGen.head rfl ?_)) | ||
| simp only [TM2.step, Option.mem_def, trList, List.append_assoc, | ||
| List.cons_append, elim_update_stack, elim_rev, elim_update_rev, Function.update_self, |
| · simp only [Nat.one_mod, Nat.mod_add_mod] | ||
| rw [← Nat.mod_eq_of_lt h, Nat.mod_mod] | ||
| · rw [Fin.val_mk, not_lt] at h | ||
| simp only [Nat.mod_add_mod, |
| rw [← MonoidHom.mem_range, S.range_inl_eq_ker_rightHom, MonoidHom.mem_ker, map_mul, map_inv, | ||
| rightHom_splitting, mul_inv_cancel] | ||
| map_mul' := fun ⟨n₁, g₁⟩ ⟨n₂, g₂⟩ ↦ by | ||
| simp only [conjAct, MonoidHom.comp_apply, map_mul, inl_conjAct_comm, MonoidHom.coe_ofClass] |
| simp only [funMap_quotient_mk', Quotient.eq] | ||
| obtain ⟨k, ik, jk⟩ := | ||
| directed_of (· ≤ ·) i (Classical.choose (Finite.bddAbove_range fun _ : Fin n => i)) | ||
| refine ⟨k, jk, ik, ?_⟩ |
| right_inv := by | ||
| rintro ⟨m, hm₀, hm⟩ | ||
| rw [Subtype.mk.injEq, ← primeFactorsList_count_eq, ← prod_replicate, ← prod_append] | ||
| simp_rw [Subtype.mk.injEq, ← primeFactorsList_count_eq, ← prod_replicate, ← prod_append] |
44646e6 to
470fa82
Compare
downstream-sha: 9b8dac4990f3ae8539a2b30942a7afc37f8a118f
470fa82 to
8bc0022
Compare
|
Closing this PR so it is recreated by downstream-lean4. @Vierkantor I'm not sure if all your review comments were covered by the fixes you pushed to downstream-lean4, so you may want to keep this PR in mind when reviewing the next one. |
|
The new PR is at #45327 |
This PR contains automatically exported adaptations up until leanprover/downstream-lean4@8fdad89.
If any dependencies have open export PRs themselves, you may need to merge them first and then run
lake updatein this PR. If this PR becomes outdated, just close it and a new one will be opened soon. No new export PRs will be opened while one is already open.downstream-sha: 8fdad89b8cbf3659ca3427c419f0a5b982b7a0c5