algebra.homology.complex_shape | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

c4658a64

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

448144f7

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -118,12 +118,12 @@ def trans (c₁ c₂ : ComplexShape ι) : ComplexShape ι
   next_eq i j j' w w' := by
     obtain ⟨k, w₁, w₂⟩ := w
     obtain ⟨k', w₁', w₂'⟩ := w'
-    rw [c₁.next_eq w₁ w₁'] at w₂ 
+    rw [c₁.next_eq w₁ w₁'] at w₂
     exact c₂.next_eq w₂ w₂'
   prev_eq i i' j w w' := by
     obtain ⟨k, w₁, w₂⟩ := w
     obtain ⟨k', w₁', w₂'⟩ := w'
-    rw [c₂.prev_eq w₂ w₂'] at w₁ 
+    rw [c₂.prev_eq w₂ w₂'] at w₁
     exact c₁.prev_eq w₁ w₁'
 #align complex_shape.trans ComplexShape.trans
 -/

448144f7

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Scott Morrison
 -/
-import Mathbin.Algebra.Group.Defs
-import Mathbin.Logic.Relation
+import Algebra.Group.Defs
+import Logic.Relation
 
 #align_import algebra.homology.complex_shape from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"

448144f7

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Scott Morrison
-
-! This file was ported from Lean 3 source module algebra.homology.complex_shape
-! leanprover-community/mathlib commit 448144f7ae193a8990cb7473c9e9a01990f64ac7
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.Group.Defs
 import Mathbin.Logic.Relation
 
+#align_import algebra.homology.complex_shape from "leanprover-community/mathlib"@"448144f7ae193a8990cb7473c9e9a01990f64ac7"
+
 /-!
 # Shapes of homological complexes

448144f7

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -207,10 +207,12 @@ def down' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α
 #align complex_shape.down' ComplexShape.down'
 -/
 
+#print ComplexShape.down'_mk /-
 theorem down'_mk {α : Type _} [AddRightCancelSemigroup α] (a : α) (i j : α) (h : j + a = i) :
     (down' a).Rel i j :=
   h
 #align complex_shape.down'_mk ComplexShape.down'_mk
+-/
 
 #print ComplexShape.up /-
 /-- The `complex_shape` appropriate for cohomology, so `d : X i ⟶ X j` only when `j = i + 1`.
@@ -230,10 +232,12 @@ def down (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :
 #align complex_shape.down ComplexShape.down
 -/
 
+#print ComplexShape.down_mk /-
 theorem down_mk {α : Type _} [AddRightCancelSemigroup α] [One α] (i j : α) (h : j + 1 = i) :
     (down α).Rel i j :=
   down'_mk (1 : α) i j h
 #align complex_shape.down_mk ComplexShape.down_mk
+-/
 
 end ComplexShape

448144f7

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -121,12 +121,12 @@ def trans (c₁ c₂ : ComplexShape ι) : ComplexShape ι
   next_eq i j j' w w' := by
     obtain ⟨k, w₁, w₂⟩ := w
     obtain ⟨k', w₁', w₂'⟩ := w'
-    rw [c₁.next_eq w₁ w₁'] at w₂
+    rw [c₁.next_eq w₁ w₁'] at w₂ 
     exact c₂.next_eq w₂ w₂'
   prev_eq i i' j w w' := by
     obtain ⟨k, w₁, w₂⟩ := w
     obtain ⟨k', w₁', w₂'⟩ := w'
-    rw [c₂.prev_eq w₂ w₂'] at w₁
+    rw [c₂.prev_eq w₂ w₂'] at w₁ 
     exact c₁.prev_eq w₁ w₁'
 #align complex_shape.trans ComplexShape.trans
 -/

448144f7

bump to nightly-2023-05-28-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

8d353152

Diff

@@ -48,7 +48,7 @@ so `d : X i ⟶ X j` is nonzero only when `i = j + 1`.
 -/
 
 
-open Classical
+open scoped Classical
 
 noncomputable section

448144f7

bump to nightly-2023-05-28-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

ba5d8b97

Diff

@@ -207,12 +207,6 @@ def down' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α
 #align complex_shape.down' ComplexShape.down'
 -/
 
-/- warning: complex_shape.down'_mk -> ComplexShape.down'_mk is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : AddRightCancelSemigroup.{u1} α] (a : α) (i : α) (j : α), (Eq.{succ u1} α (HAdd.hAdd.{u1, u1, u1} α α α (instHAdd.{u1} α (AddSemigroup.toHasAdd.{u1} α (AddRightCancelSemigroup.toAddSemigroup.{u1} α _inst_1))) j a) i) -> (ComplexShape.Rel.{u1} α (ComplexShape.down'.{u1} α _inst_1 a) i j)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : AddRightCancelSemigroup.{u1} α] (a : α) (i : α) (j : α), (Eq.{succ u1} α (HAdd.hAdd.{u1, u1, u1} α α α (instHAdd.{u1} α (AddSemigroup.toAdd.{u1} α (AddRightCancelSemigroup.toAddSemigroup.{u1} α _inst_1))) j a) i) -> (ComplexShape.Rel.{u1} α (ComplexShape.down'.{u1} α _inst_1 a) i j)
-Case conversion may be inaccurate. Consider using '#align complex_shape.down'_mk ComplexShape.down'_mkₓ'. -/
 theorem down'_mk {α : Type _} [AddRightCancelSemigroup α] (a : α) (i j : α) (h : j + a = i) :
     (down' a).Rel i j :=
   h
@@ -236,12 +230,6 @@ def down (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :
 #align complex_shape.down ComplexShape.down
 -/
 
-/- warning: complex_shape.down_mk -> ComplexShape.down_mk is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} [_inst_1 : AddRightCancelSemigroup.{u1} α] [_inst_2 : One.{u1} α] (i : α) (j : α), (Eq.{succ u1} α (HAdd.hAdd.{u1, u1, u1} α α α (instHAdd.{u1} α (AddSemigroup.toHasAdd.{u1} α (AddRightCancelSemigroup.toAddSemigroup.{u1} α _inst_1))) j (OfNat.ofNat.{u1} α 1 (OfNat.mk.{u1} α 1 (One.one.{u1} α _inst_2)))) i) -> (ComplexShape.Rel.{u1} α (ComplexShape.down.{u1} α _inst_1 _inst_2) i j)
-but is expected to have type
-  forall {α : Type.{u1}} [_inst_1 : AddRightCancelSemigroup.{u1} α] [_inst_2 : One.{u1} α] (i : α) (j : α), (Eq.{succ u1} α (HAdd.hAdd.{u1, u1, u1} α α α (instHAdd.{u1} α (AddSemigroup.toAdd.{u1} α (AddRightCancelSemigroup.toAddSemigroup.{u1} α _inst_1))) j (OfNat.ofNat.{u1} α 1 (One.toOfNat1.{u1} α _inst_2))) i) -> (ComplexShape.Rel.{u1} α (ComplexShape.down.{u1} α _inst_1 _inst_2) i j)
-Case conversion may be inaccurate. Consider using '#align complex_shape.down_mk ComplexShape.down_mkₓ'. -/
 theorem down_mk {α : Type _} [AddRightCancelSemigroup α] [One α] (i j : α) (h : j + 1 = i) :
     (down α).Rel i j :=
   down'_mk (1 : α) i j h

448144f7

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -105,10 +105,7 @@ def symm (c : ComplexShape ι) : ComplexShape ι
 
 #print ComplexShape.symm_symm /-
 @[simp]
-theorem symm_symm (c : ComplexShape ι) : c.symm.symm = c :=
-  by
-  ext
-  simp
+theorem symm_symm (c : ComplexShape ι) : c.symm.symm = c := by ext; simp
 #align complex_shape.symm_symm ComplexShape.symm_symm
 -/
 
@@ -173,22 +170,14 @@ def prev (c : ComplexShape ι) (j : ι) : ι :=
 -/
 
 #print ComplexShape.next_eq' /-
-theorem next_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.next i = j :=
-  by
-  apply c.next_eq _ h
-  dsimp only [next]
-  rw [dif_pos]
-  exact Exists.choose_spec ⟨j, h⟩
+theorem next_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.next i = j := by
+  apply c.next_eq _ h; dsimp only [next]; rw [dif_pos]; exact Exists.choose_spec ⟨j, h⟩
 #align complex_shape.next_eq' ComplexShape.next_eq'
 -/
 
 #print ComplexShape.prev_eq' /-
-theorem prev_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.prev j = i :=
-  by
-  apply c.prev_eq _ h
-  dsimp only [prev]
-  rw [dif_pos]
-  exact Exists.choose_spec ⟨i, h⟩
+theorem prev_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.prev j = i := by
+  apply c.prev_eq _ h; dsimp only [prev]; rw [dif_pos]; exact Exists.choose_spec ⟨i, h⟩
 #align complex_shape.prev_eq' ComplexShape.prev_eq'
 -/

448144f7

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

c4658a64

chore: scope open Classical (#11199)

We remove all but one open Classicals, instead preferring to use open scoped Classical. The only real side-effect this led to is moving a couple declarations to use Exists.choose instead of Classical.choose.

The first few commits are explicitly labelled regex replaces for ease of review.

c747be0a

Diff

@@ -43,7 +43,7 @@ so `d : X i ⟶ X j` is nonzero only when `i = j + 1`.
 
 noncomputable section
 
-open Classical
+open scoped Classical
 
 /-- A `c : ComplexShape ι` describes the shape of a chain complex,
 with chain groups indexed by `ι`.

c4658a64

feat(Algebra/Homology): definition of the mapping cone (#9508)

This PR defines the mapping cone of a morphism between cochain complexes.

Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>

ac9e42ea

Diff

@@ -41,10 +41,10 @@ so `d : X i ⟶ X j` is nonzero only when `i = j + 1`.
 `HomologicalComplex` with one of these shapes baked in.)
 -/
 
-open Classical
-
 noncomputable section
 
+open Classical
+
 /-- A `c : ComplexShape ι` describes the shape of a chain complex,
 with chain groups indexed by `ι`.
 Typically `ι` will be `ℕ`, `ℤ`, or `Fin n`.
@@ -212,3 +212,25 @@ theorem down_mk {α : Type*} [AddRightCancelSemigroup α] [One α] (i j : α) (h
 #align complex_shape.down_mk ComplexShape.down_mk
 
 end ComplexShape
+
+end
+
+namespace ComplexShape
+
+variable (α : Type*) [AddRightCancelSemigroup α] [DecidableEq α]
+
+instance (a : α) : DecidableRel (ComplexShape.up' a).Rel :=
+  fun _ _ => by dsimp; infer_instance
+
+instance (a : α) : DecidableRel (ComplexShape.down' a).Rel :=
+  fun _ _ => by dsimp; infer_instance
+
+variable [One α]
+
+instance : DecidableRel (ComplexShape.up α).Rel := by
+  dsimp [ComplexShape.up]; infer_instance
+
+instance : DecidableRel (ComplexShape.down α).Rel := by
+  dsimp [ComplexShape.down]; infer_instance
+
+end ComplexShape

c4658a64

feat(/Equiv/): Add symm_bijective lemmas next to symm_symms (#8444)

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: lines <34025592+linesthatinterlace@users.noreply.github.com>

e368f2a5

Diff

@@ -102,6 +102,10 @@ theorem symm_symm (c : ComplexShape ι) : c.symm.symm = c := by
   simp
 #align complex_shape.symm_symm ComplexShape.symm_symm
 
+theorem symm_bijective :
+    Function.Bijective (ComplexShape.symm : ComplexShape ι → ComplexShape ι) :=
+  Function.bijective_iff_has_inverse.mpr ⟨_, symm_symm, symm_symm⟩
+
 /-- The "composition" of two `ComplexShape`s.
 
 We need this to define "related in k steps" later.

c4658a64

chore: only four spaces for subsequent lines (#7286)

Co-authored-by: Moritz Firsching <firsching@google.com>

0c7d6fa5

Diff

@@ -183,7 +183,7 @@ def down' {α : Type*} [AddRightCancelSemigroup α] (a : α) : ComplexShape α w
 #align complex_shape.down'_rel ComplexShape.down'_Rel
 
 theorem down'_mk {α : Type*} [AddRightCancelSemigroup α] (a : α) (i j : α) (h : j + a = i) :
-  (down' a).Rel i j := h
+    (down' a).Rel i j := h
 #align complex_shape.down'_mk ComplexShape.down'_mk
 
 /-- The `ComplexShape` appropriate for cohomology, so `d : X i ⟶ X j` only when `j = i + 1`.
@@ -203,7 +203,7 @@ def down (α : Type*) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
 #align complex_shape.down_rel ComplexShape.down_Rel
 
 theorem down_mk {α : Type*} [AddRightCancelSemigroup α] [One α] (i j : α) (h : j + 1 = i) :
-  (down α).Rel i j :=
+    (down α).Rel i j :=
   down'_mk (1 : α) i j h
 #align complex_shape.down_mk ComplexShape.down_mk

c4658a64

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -58,7 +58,7 @@ This means that the shape consists of some union of lines, rays, intervals, and
 Below we define `c.next` and `c.prev` which provide these related elements.
 -/
 @[ext]
-structure ComplexShape (ι : Type _) where
+structure ComplexShape (ι : Type*) where
   /-- Nonzero differentials `X i ⟶ X j` shall be allowed
     on homological complexes when `Rel i j` holds. -/
   Rel : ι → ι → Prop
@@ -72,14 +72,14 @@ structure ComplexShape (ι : Type _) where
 
 namespace ComplexShape
 
-variable {ι : Type _}
+variable {ι : Type*}
 
 /-- The complex shape where only differentials from each `X.i` to itself are allowed.
 
 This is mostly only useful so we can describe the relation of "related in `k` steps" below.
 -/
 @[simps]
-def refl (ι : Type _) : ComplexShape ι where
+def refl (ι : Type*) : ComplexShape ι where
   Rel i j := i = j
   next_eq w w' := w.symm.trans w'
   prev_eq w w' := w.trans w'.symm
@@ -164,7 +164,7 @@ theorem prev_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.prev j = i
 (For example when `a = 1`, a cohomology theory indexed by `ℕ` or `ℤ`)
 -/
 @[simps]
-def up' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α where
+def up' {α : Type*} [AddRightCancelSemigroup α] (a : α) : ComplexShape α where
   Rel i j := i + a = j
   next_eq hi hj := hi.symm.trans hj
   prev_eq hi hj := add_right_cancel (hi.trans hj.symm)
@@ -175,21 +175,21 @@ def up' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α wh
 (For example when `a = 1`, a homology theory indexed by `ℕ` or `ℤ`)
 -/
 @[simps]
-def down' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α where
+def down' {α : Type*} [AddRightCancelSemigroup α] (a : α) : ComplexShape α where
   Rel i j := j + a = i
   next_eq hi hj := add_right_cancel (hi.trans hj.symm)
   prev_eq hi hj := hi.symm.trans hj
 #align complex_shape.down' ComplexShape.down'
 #align complex_shape.down'_rel ComplexShape.down'_Rel
 
-theorem down'_mk {α : Type _} [AddRightCancelSemigroup α] (a : α) (i j : α) (h : j + a = i) :
+theorem down'_mk {α : Type*} [AddRightCancelSemigroup α] (a : α) (i j : α) (h : j + a = i) :
   (down' a).Rel i j := h
 #align complex_shape.down'_mk ComplexShape.down'_mk
 
 /-- The `ComplexShape` appropriate for cohomology, so `d : X i ⟶ X j` only when `j = i + 1`.
 -/
 @[simps!]
-def up (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
+def up (α : Type*) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
   up' 1
 #align complex_shape.up ComplexShape.up
 #align complex_shape.up_rel ComplexShape.up_Rel
@@ -197,12 +197,12 @@ def up (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
 /-- The `ComplexShape` appropriate for homology, so `d : X i ⟶ X j` only when `i = j + 1`.
 -/
 @[simps!]
-def down (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
+def down (α : Type*) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
   down' 1
 #align complex_shape.down ComplexShape.down
 #align complex_shape.down_rel ComplexShape.down_Rel
 
-theorem down_mk {α : Type _} [AddRightCancelSemigroup α] [One α] (i j : α) (h : j + 1 = i) :
+theorem down_mk {α : Type*} [AddRightCancelSemigroup α] [One α] (i j : α) (h : j + 1 = i) :
   (down α).Rel i j :=
   down'_mk (1 : α) i j h
 #align complex_shape.down_mk ComplexShape.down_mk

c4658a64

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Scott Morrison
-
-! This file was ported from Lean 3 source module algebra.homology.complex_shape
-! leanprover-community/mathlib commit c4658a649d216f57e99621708b09dcb3dcccbd23
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.Group.Defs
 import Mathlib.Logic.Relation
 
+#align_import algebra.homology.complex_shape from "leanprover-community/mathlib"@"c4658a649d216f57e99621708b09dcb3dcccbd23"
+
 /-!
 # Shapes of homological complexes

c4658a64

chore: fix typos (#4518)

I ran codespell Mathlib and got tired halfway through the suggestions.

92beef58

Diff

@@ -136,14 +136,14 @@ instance subsingleton_prev (c : ComplexShape ι) (j : ι) : Subsingleton { i //
   congr
   exact c.prev_eq rik rjk
 
-/-- An arbitary choice of index `j` such that `Rel i j`, if such exists.
+/-- An arbitrary choice of index `j` such that `Rel i j`, if such exists.
 Returns `i` otherwise.
 -/
 def next (c : ComplexShape ι) (i : ι) : ι :=
   if h : ∃ j, c.Rel i j then h.choose else i
 #align complex_shape.next ComplexShape.next
 
-/-- An arbitary choice of index `i` such that `Rel i j`, if such exists.
+/-- An arbitrary choice of index `i` such that `Rel i j`, if such exists.
 Returns `j` otherwise.
 -/
 def prev (c : ComplexShape ι) (j : ι) : ι :=

c4658a64

feat: add Mathlib.Tactic.Common, and import (#4056)

This makes a mathlib4 version of mathlib3's tactic.basic, now called Mathlib.Tactic.Common, which imports all tactics which do not have significant theory requirements, and then is imported all across the base of the hierarchy.

This ensures that all common tactics are available nearly everywhere in the library, rather than having to be imported one-by-one as you need them.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

a4eaf1c4

Diff

@@ -10,7 +10,6 @@ Authors: Johan Commelin, Scott Morrison
 -/
 import Mathlib.Algebra.Group.Defs
 import Mathlib.Logic.Relation
-import Mathlib.Tactic.Simps.Basic
 
 /-!
 # Shapes of homological complexes

c4658a64

feat: require @[simps!] if simps runs in expensive mode (#1885)

This does not change the behavior of simps, just raises a linter error if you run simps in a more expensive mode without writing !.
Fixed some incorrect occurrences of to_additive, simps. Will do that systematically in future PR.
Fix port of OmegaCompletePartialOrder.ContinuousHom.ofMono a bit

Co-authored-by: Yury G. Kudryashov <urkud@urkud.name>

52c04a34

Diff

@@ -192,7 +192,7 @@ theorem down'_mk {α : Type _} [AddRightCancelSemigroup α] (a : α) (i j : α)
 
 /-- The `ComplexShape` appropriate for cohomology, so `d : X i ⟶ X j` only when `j = i + 1`.
 -/
-@[simps]
+@[simps!]
 def up (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
   up' 1
 #align complex_shape.up ComplexShape.up
@@ -200,7 +200,7 @@ def up (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
 
 /-- The `ComplexShape` appropriate for homology, so `d : X i ⟶ X j` only when `i = j + 1`.
 -/
-@[simps]
+@[simps!]
 def down (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
   down' 1
 #align complex_shape.down ComplexShape.down

c4658a64

chore: add missing #align statements (#1902)

This PR is the result of a slight variant on the following "algorithm"

take all mathlib 3 names, remove _ and make all uppercase letters into lowercase
take all mathlib 4 names, remove _ and make all uppercase letters into lowercase
look for matches, and create pairs (original_lean3_name, OriginalLean4Name)
for pairs that do not have an align statement:
- use Lean 4 to lookup the file + position of the Lean 4 name
- add an #align statement just before the next empty line
manually fix some tiny mistakes (e.g., empty lines in proofs might cause the #align statement to have been inserted too early)

b72bb858

Diff

@@ -70,6 +70,9 @@ structure ComplexShape (ι : Type _) where
   next_eq : ∀ {i j j'}, Rel i j → Rel i j' → j = j'
   /-- There is at most one nonzero differential to `X j`. -/
   prev_eq : ∀ {i i' j}, Rel i j → Rel i' j → i = i'
+#align complex_shape ComplexShape
+#align complex_shape.ext ComplexShape.ext
+#align complex_shape.ext_iff ComplexShape.ext_iff
 
 namespace ComplexShape
 
@@ -84,6 +87,8 @@ def refl (ι : Type _) : ComplexShape ι where
   Rel i j := i = j
   next_eq w w' := w.symm.trans w'
   prev_eq w w' := w.trans w'.symm
+#align complex_shape.refl ComplexShape.refl
+#align complex_shape.refl_rel ComplexShape.refl_Rel
 
 /-- The reverse of a `ComplexShape`.
 -/
@@ -92,11 +97,14 @@ def symm (c : ComplexShape ι) : ComplexShape ι where
   Rel i j := c.Rel j i
   next_eq w w' := c.prev_eq w w'
   prev_eq w w' := c.next_eq w w'
+#align complex_shape.symm ComplexShape.symm
+#align complex_shape.symm_rel ComplexShape.symm_Rel
 
 @[simp]
 theorem symm_symm (c : ComplexShape ι) : c.symm.symm = c := by
   ext
   simp
+#align complex_shape.symm_symm ComplexShape.symm_symm
 
 /-- The "composition" of two `ComplexShape`s.
 
@@ -115,6 +123,7 @@ def trans (c₁ c₂ : ComplexShape ι) : ComplexShape ι where
     obtain ⟨k', w₁', w₂'⟩ := w'
     rw [c₂.prev_eq w₂ w₂'] at w₁
     exact c₁.prev_eq w₁ w₁'
+#align complex_shape.trans ComplexShape.trans
 
 instance subsingleton_next (c : ComplexShape ι) (i : ι) : Subsingleton { j // c.Rel i j } := by
   constructor
@@ -133,23 +142,27 @@ Returns `i` otherwise.
 -/
 def next (c : ComplexShape ι) (i : ι) : ι :=
   if h : ∃ j, c.Rel i j then h.choose else i
+#align complex_shape.next ComplexShape.next
 
 /-- An arbitary choice of index `i` such that `Rel i j`, if such exists.
 Returns `j` otherwise.
 -/
 def prev (c : ComplexShape ι) (j : ι) : ι :=
   if h : ∃ i, c.Rel i j then h.choose else j
+#align complex_shape.prev ComplexShape.prev
 
 theorem next_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.next i = j := by
   apply c.next_eq _ h
   rw [next]
   rw [dif_pos]
   exact Exists.choose_spec ⟨j, h⟩
+#align complex_shape.next_eq' ComplexShape.next_eq'
 
 theorem prev_eq' (c : ComplexShape ι) {i j : ι} (h : c.Rel i j) : c.prev j = i := by
   apply c.prev_eq _ h
   rw [prev, dif_pos]
   exact Exists.choose_spec (⟨i, h⟩ : ∃ k, c.Rel k j)
+#align complex_shape.prev_eq' ComplexShape.prev_eq'
 
 /-- The `ComplexShape` allowing differentials from `X i` to `X (i+a)`.
 (For example when `a = 1`, a cohomology theory indexed by `ℕ` or `ℤ`)
@@ -159,6 +172,8 @@ def up' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α wh
   Rel i j := i + a = j
   next_eq hi hj := hi.symm.trans hj
   prev_eq hi hj := add_right_cancel (hi.trans hj.symm)
+#align complex_shape.up' ComplexShape.up'
+#align complex_shape.up'_rel ComplexShape.up'_Rel
 
 /-- The `ComplexShape` allowing differentials from `X (j+a)` to `X j`.
 (For example when `a = 1`, a homology theory indexed by `ℕ` or `ℤ`)
@@ -168,24 +183,32 @@ def down' {α : Type _} [AddRightCancelSemigroup α] (a : α) : ComplexShape α
   Rel i j := j + a = i
   next_eq hi hj := add_right_cancel (hi.trans hj.symm)
   prev_eq hi hj := hi.symm.trans hj
+#align complex_shape.down' ComplexShape.down'
+#align complex_shape.down'_rel ComplexShape.down'_Rel
 
 theorem down'_mk {α : Type _} [AddRightCancelSemigroup α] (a : α) (i j : α) (h : j + a = i) :
   (down' a).Rel i j := h
+#align complex_shape.down'_mk ComplexShape.down'_mk
 
 /-- The `ComplexShape` appropriate for cohomology, so `d : X i ⟶ X j` only when `j = i + 1`.
 -/
 @[simps]
 def up (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
   up' 1
+#align complex_shape.up ComplexShape.up
+#align complex_shape.up_rel ComplexShape.up_Rel
 
 /-- The `ComplexShape` appropriate for homology, so `d : X i ⟶ X j` only when `i = j + 1`.
 -/
 @[simps]
 def down (α : Type _) [AddRightCancelSemigroup α] [One α] : ComplexShape α :=
   down' 1
+#align complex_shape.down ComplexShape.down
+#align complex_shape.down_rel ComplexShape.down_Rel
 
 theorem down_mk {α : Type _} [AddRightCancelSemigroup α] [One α] (i j : α) (h : j + 1 = i) :
   (down α).Rel i j :=
   down'_mk (1 : α) i j h
+#align complex_shape.down_mk ComplexShape.down_mk
 
 end ComplexShape

c4658a64

chore: fix more casing errors per naming scheme (#1232)

I've avoided anything under Tactic or test.

In correcting the names, I found Option.isNone_iff_eq_none duplicated between Std and Mathlib, so the Mathlib one has been removed.

Co-authored-by: Reid Barton <rwbarton@gmail.com>

31a56f75

Diff

@@ -51,7 +51,7 @@ noncomputable section
 
 /-- A `c : ComplexShape ι` describes the shape of a chain complex,
 with chain groups indexed by `ι`.
-Typically `ι` will be `ℕ`, `ℤ`, or `fin n`.
+Typically `ι` will be `ℕ`, `ℤ`, or `Fin n`.
 
 There is a relation `Rel : ι → ι → Prop`,
 and we will only allow a non-zero differential from `i` to `j` when `Rel i j`.

c4658a64

chore: add source headers to ported theory files (#1094)

The script used to do this is included. The yaml file was obtained from https://raw.githubusercontent.com/wiki/leanprover-community/mathlib/mathlib4-port-status.md

f168625e

Diff

@@ -2,6 +2,11 @@
 Copyright (c) 2021 Scott Morrison. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Johan Commelin, Scott Morrison
+
+! This file was ported from Lean 3 source module algebra.homology.complex_shape
+! leanprover-community/mathlib commit c4658a649d216f57e99621708b09dcb3dcccbd23
+! Please do not edit these lines, except to modify the commit id
+! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.Group.Defs
 import Mathlib.Logic.Relation

`algebra.homology.complex_shape` ⟷ `Mathlib.Algebra.Homology.ComplexShape`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2

algebra.homology.complex_shape ⟷ Mathlib.Algebra.Homology.ComplexShape

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2

`algebra.homology.complex_shape` ⟷ `Mathlib.Algebra.Homology.ComplexShape`