field_theory.laurent | 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

70fd9563

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

36938f77

bump to nightly-2024-04-07-08

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

b03b8656

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2022 Yakov Pechersky. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 -/
-import Data.Polynomial.Taylor
+import Algebra.Polynomial.Taylor
 import FieldTheory.RatFunc
 
 #align_import field_theory.laurent from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"

36938f77

bump to nightly-2024-04-06-08

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

e34029c9

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 -/
 import Data.Polynomial.Taylor
-import FieldTheory.Ratfunc
+import FieldTheory.RatFunc
 
 #align_import field_theory.laurent from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"

36938f77

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -47,7 +47,7 @@ theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰
   have : x = taylor (r - r) x := by simp
   rwa [this, sub_eq_add_neg, ← taylor_taylor, ← taylor_mul,
     LinearMap.map_eq_zero_iff _ (taylor_injective _), mul_right_mem_nonZeroDivisors_eq_zero_iff hp,
-    LinearMap.map_eq_zero_iff _ (taylor_injective _)] at hx 
+    LinearMap.map_eq_zero_iff _ (taylor_injective _)] at hx
 #align ratfunc.taylor_mem_non_zero_divisors RatFunc.taylor_mem_nonZeroDivisors
 -/

36938f77

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) 2022 Yakov Pechersky. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 -/
-import Mathbin.Data.Polynomial.Taylor
-import Mathbin.FieldTheory.Ratfunc
+import Data.Polynomial.Taylor
+import FieldTheory.Ratfunc
 
 #align_import field_theory.laurent from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"

36938f77

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) 2022 Yakov Pechersky. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
-
-! This file was ported from Lean 3 source module field_theory.laurent
-! leanprover-community/mathlib commit 36938f775671ff28bea1c0310f1608e4afbb22e0
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Polynomial.Taylor
 import Mathbin.FieldTheory.Ratfunc
 
+#align_import field_theory.laurent from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"
+
 /-!
 # Laurent expansions of rational functions

36938f77

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -42,6 +42,7 @@ open scoped Classical nonZeroDivisors Polynomial
 
 variable {R : Type u} [CommRing R] [hdomain : IsDomain R] (r s : R) (p q : R[X]) (f : RatFunc R)
 
+#print RatFunc.taylor_mem_nonZeroDivisors /-
 theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰ :=
   by
   rw [mem_nonZeroDivisors_iff]
@@ -51,7 +52,9 @@ theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰
     LinearMap.map_eq_zero_iff _ (taylor_injective _), mul_right_mem_nonZeroDivisors_eq_zero_iff hp,
     LinearMap.map_eq_zero_iff _ (taylor_injective _)] at hx 
 #align ratfunc.taylor_mem_non_zero_divisors RatFunc.taylor_mem_nonZeroDivisors
+-/
 
+#print RatFunc.laurentAux /-
 /-- The Laurent expansion of rational functions about a value.
 Auxiliary definition, usage when over integral domains should prefer `ratfunc.laurent`. -/
 def laurentAux : RatFunc R →+* RatFunc R :=
@@ -60,27 +63,33 @@ def laurentAux : RatFunc R →+* RatFunc R :=
       (LinearMap.map_add _))
     (taylor_mem_nonZeroDivisors _)
 #align ratfunc.laurent_aux RatFunc.laurentAux
+-/
 
+#print RatFunc.laurentAux_ofFractionRing_mk /-
 theorem laurentAux_ofFractionRing_mk (q : R[X]⁰) :
     laurentAux r (ofFractionRing (Localization.mk p q)) =
       ofFractionRing
         (Localization.mk (taylor r p) ⟨taylor r q, taylor_mem_nonZeroDivisors r q q.Prop⟩) :=
   map_apply_ofFractionRing_mk _ _ _ _
 #align ratfunc.laurent_aux_of_fraction_ring_mk RatFunc.laurentAux_ofFractionRing_mk
+-/
 
-include hdomain
-
+#print RatFunc.laurentAux_div /-
 theorem laurentAux_div :
     laurentAux r (algebraMap _ _ p / algebraMap _ _ q) =
       algebraMap _ _ (taylor r p) / algebraMap _ _ (taylor r q) :=
   map_apply_div _ _ _ _
 #align ratfunc.laurent_aux_div RatFunc.laurentAux_div
+-/
 
+#print RatFunc.laurentAux_algebraMap /-
 @[simp]
 theorem laurentAux_algebraMap : laurentAux r (algebraMap _ _ p) = algebraMap _ _ (taylor r p) := by
   rw [← mk_one, ← mk_one, mk_eq_div, laurent_aux_div, mk_eq_div, taylor_one, _root_.map_one]
 #align ratfunc.laurent_aux_algebra_map RatFunc.laurentAux_algebraMap
+-/
 
+#print RatFunc.laurent /-
 /-- The Laurent expansion of rational functions about a value. -/
 def laurent : RatFunc R →ₐ[R] RatFunc R :=
   RatFunc.mapAlgHom
@@ -88,41 +97,56 @@ def laurent : RatFunc R →ₐ[R] RatFunc R :=
       (by simp [Polynomial.algebraMap_apply]))
     (taylor_mem_nonZeroDivisors _)
 #align ratfunc.laurent RatFunc.laurent
+-/
 
+#print RatFunc.laurent_div /-
 theorem laurent_div :
     laurent r (algebraMap _ _ p / algebraMap _ _ q) =
       algebraMap _ _ (taylor r p) / algebraMap _ _ (taylor r q) :=
   laurentAux_div r p q
 #align ratfunc.laurent_div RatFunc.laurent_div
+-/
 
+#print RatFunc.laurent_algebraMap /-
 @[simp]
 theorem laurent_algebraMap : laurent r (algebraMap _ _ p) = algebraMap _ _ (taylor r p) :=
   laurentAux_algebraMap _ _
 #align ratfunc.laurent_algebra_map RatFunc.laurent_algebraMap
+-/
 
+#print RatFunc.laurent_X /-
 @[simp]
 theorem laurent_X : laurent r X = X + C r := by
   rw [← algebra_map_X, laurent_algebra_map, taylor_X, _root_.map_add, algebra_map_C]
 #align ratfunc.laurent_X RatFunc.laurent_X
+-/
 
+#print RatFunc.laurent_C /-
 @[simp]
 theorem laurent_C (x : R) : laurent r (C x) = C x := by
   rw [← algebra_map_C, laurent_algebra_map, taylor_C]
 #align ratfunc.laurent_C RatFunc.laurent_C
+-/
 
+#print RatFunc.laurent_at_zero /-
 @[simp]
 theorem laurent_at_zero : laurent 0 f = f := by induction f using RatFunc.induction_on; simp
 #align ratfunc.laurent_at_zero RatFunc.laurent_at_zero
+-/
 
+#print RatFunc.laurent_laurent /-
 theorem laurent_laurent : laurent r (laurent s f) = laurent (r + s) f :=
   by
   induction f using RatFunc.induction_on
   simp_rw [laurent_div, taylor_taylor]
 #align ratfunc.laurent_laurent RatFunc.laurent_laurent
+-/
 
+#print RatFunc.laurent_injective /-
 theorem laurent_injective : Function.Injective (laurent r) := fun _ _ h => by
   simpa [laurent_laurent] using congr_arg (laurent (-r)) h
 #align ratfunc.laurent_injective RatFunc.laurent_injective
+-/
 
 end RatFunc

36938f77

bump to nightly-2023-06-07-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/58a272265b5e05f258161260dd2c5d247213cbd3

831e78ce

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 
 ! This file was ported from Lean 3 source module field_theory.laurent
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
+! leanprover-community/mathlib commit 36938f775671ff28bea1c0310f1608e4afbb22e0
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.FieldTheory.Ratfunc
 /-!
 # Laurent expansions of rational functions
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 ## Main declarations
 
 * `ratfunc.laurent`: the Laurent expansion of the rational function `f` at `r`, as an `alg_hom`.

70fd9563

bump to nightly-2023-06-05-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/13361559d66b84f80b6d5a1c4a26aa5054766725

62cd60d3

Diff

@@ -98,14 +98,14 @@ theorem laurent_algebraMap : laurent r (algebraMap _ _ p) = algebraMap _ _ (tayl
 #align ratfunc.laurent_algebra_map RatFunc.laurent_algebraMap
 
 @[simp]
-theorem laurent_x : laurent r X = X + C r := by
+theorem laurent_X : laurent r X = X + C r := by
   rw [← algebra_map_X, laurent_algebra_map, taylor_X, _root_.map_add, algebra_map_C]
-#align ratfunc.laurent_X RatFunc.laurent_x
+#align ratfunc.laurent_X RatFunc.laurent_X
 
 @[simp]
-theorem laurent_c (x : R) : laurent r (C x) = C x := by
+theorem laurent_C (x : R) : laurent r (C x) = C x := by
   rw [← algebra_map_C, laurent_algebra_map, taylor_C]
-#align ratfunc.laurent_C RatFunc.laurent_c
+#align ratfunc.laurent_C RatFunc.laurent_C
 
 @[simp]
 theorem laurent_at_zero : laurent 0 f = f := by induction f using RatFunc.induction_on; simp

70fd9563

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -46,7 +46,7 @@ theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰
   have : x = taylor (r - r) x := by simp
   rwa [this, sub_eq_add_neg, ← taylor_taylor, ← taylor_mul,
     LinearMap.map_eq_zero_iff _ (taylor_injective _), mul_right_mem_nonZeroDivisors_eq_zero_iff hp,
-    LinearMap.map_eq_zero_iff _ (taylor_injective _)] at hx
+    LinearMap.map_eq_zero_iff _ (taylor_injective _)] at hx 
 #align ratfunc.taylor_mem_non_zero_divisors RatFunc.taylor_mem_nonZeroDivisors
 
 /-- The Laurent expansion of rational functions about a value.

70fd9563

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -35,7 +35,7 @@ noncomputable section
 
 open Polynomial
 
-open Classical nonZeroDivisors Polynomial
+open scoped Classical nonZeroDivisors Polynomial
 
 variable {R : Type u} [CommRing R] [hdomain : IsDomain R] (r s : R) (p q : R[X]) (f : RatFunc R)

70fd9563

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -108,10 +108,7 @@ theorem laurent_c (x : R) : laurent r (C x) = C x := by
 #align ratfunc.laurent_C RatFunc.laurent_c
 
 @[simp]
-theorem laurent_at_zero : laurent 0 f = f :=
-  by
-  induction f using RatFunc.induction_on
-  simp
+theorem laurent_at_zero : laurent 0 f = f := by induction f using RatFunc.induction_on; simp
 #align ratfunc.laurent_at_zero RatFunc.laurent_at_zero
 
 theorem laurent_laurent : laurent r (laurent s f) = laurent (r + s) f :=

70fd9563

bump to nightly-2023-05-26-00

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

6bc7c80e

Diff

@@ -29,7 +29,7 @@ An auxiliary definition is provided first to make the construction of the `alg_h
 
 universe u
 
-namespace Ratfunc
+namespace RatFunc
 
 noncomputable section
 
@@ -37,7 +37,7 @@ open Polynomial
 
 open Classical nonZeroDivisors Polynomial
 
-variable {R : Type u} [CommRing R] [hdomain : IsDomain R] (r s : R) (p q : R[X]) (f : Ratfunc R)
+variable {R : Type u} [CommRing R] [hdomain : IsDomain R] (r s : R) (p q : R[X]) (f : RatFunc R)
 
 theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰ :=
   by
@@ -47,23 +47,23 @@ theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰
   rwa [this, sub_eq_add_neg, ← taylor_taylor, ← taylor_mul,
     LinearMap.map_eq_zero_iff _ (taylor_injective _), mul_right_mem_nonZeroDivisors_eq_zero_iff hp,
     LinearMap.map_eq_zero_iff _ (taylor_injective _)] at hx
-#align ratfunc.taylor_mem_non_zero_divisors Ratfunc.taylor_mem_nonZeroDivisors
+#align ratfunc.taylor_mem_non_zero_divisors RatFunc.taylor_mem_nonZeroDivisors
 
 /-- The Laurent expansion of rational functions about a value.
 Auxiliary definition, usage when over integral domains should prefer `ratfunc.laurent`. -/
-def laurentAux : Ratfunc R →+* Ratfunc R :=
-  Ratfunc.mapRingHom
+def laurentAux : RatFunc R →+* RatFunc R :=
+  RatFunc.mapRingHom
     (RingHom.mk (taylor r) (taylor_one _) (taylor_mul _) (LinearMap.map_zero _)
       (LinearMap.map_add _))
     (taylor_mem_nonZeroDivisors _)
-#align ratfunc.laurent_aux Ratfunc.laurentAux
+#align ratfunc.laurent_aux RatFunc.laurentAux
 
-theorem laurentAux_of_fraction_ring_mk (q : R[X]⁰) :
-    laurentAux r (of_fraction_ring (Localization.mk p q)) =
-      of_fraction_ring
+theorem laurentAux_ofFractionRing_mk (q : R[X]⁰) :
+    laurentAux r (ofFractionRing (Localization.mk p q)) =
+      ofFractionRing
         (Localization.mk (taylor r p) ⟨taylor r q, taylor_mem_nonZeroDivisors r q q.Prop⟩) :=
-  map_apply_of_fraction_ring_mk _ _ _ _
-#align ratfunc.laurent_aux_of_fraction_ring_mk Ratfunc.laurentAux_of_fraction_ring_mk
+  map_apply_ofFractionRing_mk _ _ _ _
+#align ratfunc.laurent_aux_of_fraction_ring_mk RatFunc.laurentAux_ofFractionRing_mk
 
 include hdomain
 
@@ -71,58 +71,58 @@ theorem laurentAux_div :
     laurentAux r (algebraMap _ _ p / algebraMap _ _ q) =
       algebraMap _ _ (taylor r p) / algebraMap _ _ (taylor r q) :=
   map_apply_div _ _ _ _
-#align ratfunc.laurent_aux_div Ratfunc.laurentAux_div
+#align ratfunc.laurent_aux_div RatFunc.laurentAux_div
 
 @[simp]
 theorem laurentAux_algebraMap : laurentAux r (algebraMap _ _ p) = algebraMap _ _ (taylor r p) := by
   rw [← mk_one, ← mk_one, mk_eq_div, laurent_aux_div, mk_eq_div, taylor_one, _root_.map_one]
-#align ratfunc.laurent_aux_algebra_map Ratfunc.laurentAux_algebraMap
+#align ratfunc.laurent_aux_algebra_map RatFunc.laurentAux_algebraMap
 
 /-- The Laurent expansion of rational functions about a value. -/
-def laurent : Ratfunc R →ₐ[R] Ratfunc R :=
-  Ratfunc.mapAlgHom
+def laurent : RatFunc R →ₐ[R] RatFunc R :=
+  RatFunc.mapAlgHom
     (AlgHom.mk (taylor r) (taylor_one _) (taylor_mul _) (LinearMap.map_zero _) (LinearMap.map_add _)
       (by simp [Polynomial.algebraMap_apply]))
     (taylor_mem_nonZeroDivisors _)
-#align ratfunc.laurent Ratfunc.laurent
+#align ratfunc.laurent RatFunc.laurent
 
 theorem laurent_div :
     laurent r (algebraMap _ _ p / algebraMap _ _ q) =
       algebraMap _ _ (taylor r p) / algebraMap _ _ (taylor r q) :=
   laurentAux_div r p q
-#align ratfunc.laurent_div Ratfunc.laurent_div
+#align ratfunc.laurent_div RatFunc.laurent_div
 
 @[simp]
 theorem laurent_algebraMap : laurent r (algebraMap _ _ p) = algebraMap _ _ (taylor r p) :=
   laurentAux_algebraMap _ _
-#align ratfunc.laurent_algebra_map Ratfunc.laurent_algebraMap
+#align ratfunc.laurent_algebra_map RatFunc.laurent_algebraMap
 
 @[simp]
-theorem laurent_x : laurent r x = x + c r := by
+theorem laurent_x : laurent r X = X + C r := by
   rw [← algebra_map_X, laurent_algebra_map, taylor_X, _root_.map_add, algebra_map_C]
-#align ratfunc.laurent_X Ratfunc.laurent_x
+#align ratfunc.laurent_X RatFunc.laurent_x
 
 @[simp]
-theorem laurent_c (x : R) : laurent r (c x) = c x := by
+theorem laurent_c (x : R) : laurent r (C x) = C x := by
   rw [← algebra_map_C, laurent_algebra_map, taylor_C]
-#align ratfunc.laurent_C Ratfunc.laurent_c
+#align ratfunc.laurent_C RatFunc.laurent_c
 
 @[simp]
 theorem laurent_at_zero : laurent 0 f = f :=
   by
-  induction f using Ratfunc.induction_on
+  induction f using RatFunc.induction_on
   simp
-#align ratfunc.laurent_at_zero Ratfunc.laurent_at_zero
+#align ratfunc.laurent_at_zero RatFunc.laurent_at_zero
 
 theorem laurent_laurent : laurent r (laurent s f) = laurent (r + s) f :=
   by
-  induction f using Ratfunc.induction_on
+  induction f using RatFunc.induction_on
   simp_rw [laurent_div, taylor_taylor]
-#align ratfunc.laurent_laurent Ratfunc.laurent_laurent
+#align ratfunc.laurent_laurent RatFunc.laurent_laurent
 
 theorem laurent_injective : Function.Injective (laurent r) := fun _ _ h => by
   simpa [laurent_laurent] using congr_arg (laurent (-r)) h
-#align ratfunc.laurent_injective Ratfunc.laurent_injective
+#align ratfunc.laurent_injective RatFunc.laurent_injective
 
-end Ratfunc
+end RatFunc

70fd9563

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

70fd9563

move(Polynomial): Move out of Data (#11751)

Polynomial and MvPolynomial are algebraic objects, hence should be under Algebra (or at least not under Data)

56e439ec

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2022 Yakov Pechersky. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 -/
-import Mathlib.Data.Polynomial.Taylor
+import Mathlib.Algebra.Polynomial.Taylor
 import Mathlib.FieldTheory.RatFunc
 
 #align_import field_theory.laurent from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"

70fd9563

style: homogenise porting notes (#11145)

Homogenises porting notes via capitalisation and addition of whitespace.

It makes the following changes:

converts "--porting note" into "-- Porting note";
converts "porting note" into "Porting note".

8be0b69c

Diff

@@ -66,7 +66,7 @@ theorem laurentAux_ofFractionRing_mk (q : R[X]⁰) :
 theorem laurentAux_div :
     laurentAux r (algebraMap _ _ p / algebraMap _ _ q) =
       algebraMap _ _ (taylor r p) / algebraMap _ _ (taylor r q) :=
-  -- porting note: added `by exact taylor_mem_nonZeroDivisors r`
+  -- Porting note: added `by exact taylor_mem_nonZeroDivisors r`
   map_apply_div _ (by exact taylor_mem_nonZeroDivisors r) _ _
 #align ratfunc.laurent_aux_div RatFunc.laurentAux_div

70fd9563

perf(FunLike.Basic): beta reduce CoeFun.coe (#7905)

This eliminates (fun a ↦ β) α in the type when applying a FunLike.

Co-authored-by: Matthew Ballard <matt@mrb.email> Co-authored-by: Eric Wieser <wieser.eric@gmail.com>

e194c756

Diff

@@ -72,8 +72,7 @@ theorem laurentAux_div :
 
 @[simp]
 theorem laurentAux_algebraMap : laurentAux r (algebraMap _ _ p) = algebraMap _ _ (taylor r p) := by
-  rw [← mk_one, ← mk_one, mk_eq_div, laurentAux_div, mk_eq_div, taylor_one, map_one, map_one,
-    map_one]
+  rw [← mk_one, ← mk_one, mk_eq_div, laurentAux_div, mk_eq_div, taylor_one, map_one, map_one]
 #align ratfunc.laurent_aux_algebra_map RatFunc.laurentAux_algebraMap
 
 /-- The Laurent expansion of rational functions about a value. -/

70fd9563

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) 2022 Yakov Pechersky. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
-
-! This file was ported from Lean 3 source module field_theory.laurent
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Polynomial.Taylor
 import Mathlib.FieldTheory.RatFunc
 
+#align_import field_theory.laurent from "leanprover-community/mathlib"@"70fd9563a21e7b963887c9360bd29b2393e6225a"
+
 /-!
 # Laurent expansions of rational functions

70fd9563

chore: tidy various files (#5104)

62d90431

Diff

@@ -16,14 +16,14 @@ import Mathlib.FieldTheory.RatFunc
 
 ## Main declarations
 
-* `ratfunc.laurent`: the Laurent expansion of the rational function `f` at `r`, as an `alg_hom`.
-* `ratfunc.laurent_injective`: the Laurent expansion at `r` is unique
+* `RatFunc.laurent`: the Laurent expansion of the rational function `f` at `r`, as an `AlgHom`.
+* `RatFunc.laurent_injective`: the Laurent expansion at `r` is unique
 
 ## Implementation details
 
 Implemented as the quotient of two Taylor expansions, over domains.
-An auxiliary definition is provided first to make the construction of the `alg_hom` easier,
-  which works on `comm_ring` which are not necessarily domains.
+An auxiliary definition is provided first to make the construction of the `AlgHom` easier,
+  which works on `CommRing` which are not necessarily domains.
 -/
 
 
@@ -49,7 +49,7 @@ theorem taylor_mem_nonZeroDivisors (hp : p ∈ R[X]⁰) : taylor r p ∈ R[X]⁰
 #align ratfunc.taylor_mem_non_zero_divisors RatFunc.taylor_mem_nonZeroDivisors
 
 /-- The Laurent expansion of rational functions about a value.
-Auxiliary definition, usage when over integral domains should prefer `ratfunc.laurent`. -/
+Auxiliary definition, usage when over integral domains should prefer `RatFunc.laurent`. -/
 def laurentAux : RatFunc R →+* RatFunc R :=
   RatFunc.mapRingHom
     ( { toFun := taylor r

70fd9563

feat: port FieldTheory.Laurent (#4512)

Co-authored-by: adomani <adomani@gmail.com>

496e831e

`field_theory.laurent` ⟷ `Mathlib.FieldTheory.Laurent`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 568

field_theory.laurent ⟷ Mathlib.FieldTheory.Laurent

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 568

`field_theory.laurent` ⟷ `Mathlib.FieldTheory.Laurent`