algebra.continued_fractions.continuants_recurrence

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

5f11361a

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

b5ad1414

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -51,7 +51,7 @@ theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get
     (nth_conts_eq : g.continuants n = ppred) (succ_nth_conts_eq : g.continuants (n + 1) = pred) :
     g.continuants (n + 2) = ⟨gp.b * pred.a + gp.a * ppred.a, gp.b * pred.b + gp.a * ppred.b⟩ :=
   by
-  rw [nth_cont_eq_succ_nth_cont_aux] at nth_conts_eq succ_nth_conts_eq 
+  rw [nth_cont_eq_succ_nth_cont_aux] at nth_conts_eq succ_nth_conts_eq
   exact continuants_recurrence_aux succ_nth_s_eq nth_conts_eq succ_nth_conts_eq
 #align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrence
 -/

b5ad1414

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kevin Kappelmann
 -/
-import Mathbin.Algebra.ContinuedFractions.Translations
+import Algebra.ContinuedFractions.Translations
 
 #align_import algebra.continued_fractions.continuants_recurrence from "leanprover-community/mathlib"@"b5ad141426bb005414324f89719c77c0aa3ec612"

b5ad1414

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,14 +2,11 @@
 Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kevin Kappelmann
-
-! This file was ported from Lean 3 source module algebra.continued_fractions.continuants_recurrence
-! leanprover-community/mathlib commit b5ad141426bb005414324f89719c77c0aa3ec612
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.ContinuedFractions.Translations
 
+#align_import algebra.continued_fractions.continuants_recurrence from "leanprover-community/mathlib"@"b5ad141426bb005414324f89719c77c0aa3ec612"
+
 /-!
 # Recurrence Lemmas for the `continuants` Function of Continued Fractions.

b5ad1414

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -29,13 +29,16 @@ namespace GeneralizedContinuedFraction
 
 variable {K : Type _} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
 
+#print GeneralizedContinuedFraction.continuantsAux_recurrence /-
 theorem continuantsAux_recurrence {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)
     (succ_nth_conts_aux_eq : g.continuantsAux (n + 1) = pred) :
     g.continuantsAux (n + 2) = ⟨gp.b * pred.a + gp.a * ppred.a, gp.b * pred.b + gp.a * ppred.b⟩ :=
   by simp [*, continuants_aux, next_continuants, next_denominator, next_numerator]
 #align generalized_continued_fraction.continuants_aux_recurrence GeneralizedContinuedFraction.continuantsAux_recurrence
+-/
 
+#print GeneralizedContinuedFraction.continuants_recurrenceAux /-
 theorem continuants_recurrenceAux {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)
     (succ_nth_conts_aux_eq : g.continuantsAux (n + 1) = pred) :
@@ -43,7 +46,9 @@ theorem continuants_recurrenceAux {gp ppred pred : Pair K} (nth_s_eq : g.s.get?
   simp [nth_cont_eq_succ_nth_cont_aux,
     continuants_aux_recurrence nth_s_eq nth_conts_aux_eq succ_nth_conts_aux_eq]
 #align generalized_continued_fraction.continuants_recurrence_aux GeneralizedContinuedFraction.continuants_recurrenceAux
+-/
 
+#print GeneralizedContinuedFraction.continuants_recurrence /-
 /-- Shows that `Aₙ = bₙ * Aₙ₋₁ + aₙ * Aₙ₋₂` and `Bₙ = bₙ * Bₙ₋₁ + aₙ * Bₙ₋₂`. -/
 theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get? (n + 1) = some gp)
     (nth_conts_eq : g.continuants n = ppred) (succ_nth_conts_eq : g.continuants (n + 1) = pred) :
@@ -52,7 +57,9 @@ theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get
   rw [nth_cont_eq_succ_nth_cont_aux] at nth_conts_eq succ_nth_conts_eq 
   exact continuants_recurrence_aux succ_nth_s_eq nth_conts_eq succ_nth_conts_eq
 #align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrence
+-/
 
+#print GeneralizedContinuedFraction.numerators_recurrence /-
 /-- Shows that `Aₙ = bₙ * Aₙ₋₁ + aₙ * Aₙ₋₂`. -/
 theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_num_eq : g.numerators n = ppredA)
@@ -66,7 +73,9 @@ theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
   exact exists_conts_a_of_num succ_nth_num_eq
   rw [num_eq_conts_a, continuants_recurrence succ_nth_s_eq nth_conts_eq succ_nth_conts_eq]
 #align generalized_continued_fraction.numerators_recurrence GeneralizedContinuedFraction.numerators_recurrence
+-/
 
+#print GeneralizedContinuedFraction.denominators_recurrence /-
 /-- Shows that `Bₙ = bₙ * Bₙ₋₁ + aₙ * Bₙ₋₂`. -/
 theorem denominators_recurrence {gp : Pair K} {ppredB predB : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_denom_eq : g.denominators n = ppredB)
@@ -80,6 +89,7 @@ theorem denominators_recurrence {gp : Pair K} {ppredB predB : K}
   exact exists_conts_b_of_denom succ_nth_denom_eq
   rw [denom_eq_conts_b, continuants_recurrence succ_nth_s_eq nth_conts_eq succ_nth_conts_eq]
 #align generalized_continued_fraction.denominators_recurrence GeneralizedContinuedFraction.denominators_recurrence
+-/
 
 end GeneralizedContinuedFraction

b5ad1414

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -49,7 +49,7 @@ theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get
     (nth_conts_eq : g.continuants n = ppred) (succ_nth_conts_eq : g.continuants (n + 1) = pred) :
     g.continuants (n + 2) = ⟨gp.b * pred.a + gp.a * ppred.a, gp.b * pred.b + gp.a * ppred.b⟩ :=
   by
-  rw [nth_cont_eq_succ_nth_cont_aux] at nth_conts_eq succ_nth_conts_eq
+  rw [nth_cont_eq_succ_nth_cont_aux] at nth_conts_eq succ_nth_conts_eq 
   exact continuants_recurrence_aux succ_nth_s_eq nth_conts_eq succ_nth_conts_eq
 #align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrence

b5ad1414

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -29,12 +29,6 @@ namespace GeneralizedContinuedFraction
 
 variable {K : Type _} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
 
-/- warning: generalized_continued_fraction.continuants_aux_recurrence -> GeneralizedContinuedFraction.continuantsAux_recurrence is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.continuants_aux_recurrence GeneralizedContinuedFraction.continuantsAux_recurrenceₓ'. -/
 theorem continuantsAux_recurrence {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)
     (succ_nth_conts_aux_eq : g.continuantsAux (n + 1) = pred) :
@@ -42,12 +36,6 @@ theorem continuantsAux_recurrence {gp ppred pred : Pair K} (nth_s_eq : g.s.get?
   by simp [*, continuants_aux, next_continuants, next_denominator, next_numerator]
 #align generalized_continued_fraction.continuants_aux_recurrence GeneralizedContinuedFraction.continuantsAux_recurrence
 
-/- warning: generalized_continued_fraction.continuants_recurrence_aux -> GeneralizedContinuedFraction.continuants_recurrenceAux is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.continuants_recurrence_aux GeneralizedContinuedFraction.continuants_recurrenceAuxₓ'. -/
 theorem continuants_recurrenceAux {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)
     (succ_nth_conts_aux_eq : g.continuantsAux (n + 1) = pred) :
@@ -56,12 +44,6 @@ theorem continuants_recurrenceAux {gp ppred pred : Pair K} (nth_s_eq : g.s.get?
     continuants_aux_recurrence nth_s_eq nth_conts_aux_eq succ_nth_conts_aux_eq]
 #align generalized_continued_fraction.continuants_recurrence_aux GeneralizedContinuedFraction.continuants_recurrenceAux
 
-/- warning: generalized_continued_fraction.continuants_recurrence -> GeneralizedContinuedFraction.continuants_recurrence is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrenceₓ'. -/
 /-- Shows that `Aₙ = bₙ * Aₙ₋₁ + aₙ * Aₙ₋₂` and `Bₙ = bₙ * Bₙ₋₁ + aₙ * Bₙ₋₂`. -/
 theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get? (n + 1) = some gp)
     (nth_conts_eq : g.continuants n = ppred) (succ_nth_conts_eq : g.continuants (n + 1) = pred) :
@@ -71,12 +53,6 @@ theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get
   exact continuants_recurrence_aux succ_nth_s_eq nth_conts_eq succ_nth_conts_eq
 #align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrence
 
-/- warning: generalized_continued_fraction.numerators_recurrence -> GeneralizedContinuedFraction.numerators_recurrence is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredA : K} {predA : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) ppredA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) predA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predA) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredA)))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredA : K} {predA : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) ppredA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) predA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predA) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredA)))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.numerators_recurrence GeneralizedContinuedFraction.numerators_recurrenceₓ'. -/
 /-- Shows that `Aₙ = bₙ * Aₙ₋₁ + aₙ * Aₙ₋₂`. -/
 theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_num_eq : g.numerators n = ppredA)
@@ -91,12 +67,6 @@ theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
   rw [num_eq_conts_a, continuants_recurrence succ_nth_s_eq nth_conts_eq succ_nth_conts_eq]
 #align generalized_continued_fraction.numerators_recurrence GeneralizedContinuedFraction.numerators_recurrence
 
-/- warning: generalized_continued_fraction.denominators_recurrence -> GeneralizedContinuedFraction.denominators_recurrence is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredB : K} {predB : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n) ppredB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) predB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predB) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredB)))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredB : K} {predB : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n) ppredB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) predB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predB) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredB)))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.denominators_recurrence GeneralizedContinuedFraction.denominators_recurrenceₓ'. -/
 /-- Shows that `Bₙ = bₙ * Bₙ₋₁ + aₙ * Bₙ₋₂`. -/
 theorem denominators_recurrence {gp : Pair K} {ppredB predB : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_denom_eq : g.denominators n = ppredB)

b5ad1414

bump to nightly-2023-05-08-02

mathlib commit https://github.com/leanprover-community/mathlib/commit/08e1d8d4d989df3a6df86f385e9053ec8a372cc1

508651e1

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kevin Kappelmann
 
 ! This file was ported from Lean 3 source module algebra.continued_fractions.continuants_recurrence
-! leanprover-community/mathlib commit 5f11361a98ae4acd77f5c1837686f6f0102cdc25
+! leanprover-community/mathlib commit b5ad141426bb005414324f89719c77c0aa3ec612
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.Algebra.ContinuedFractions.Translations
 /-!
 # Recurrence Lemmas for the `continuants` Function of Continued Fractions.
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 ## Summary
 
 Given a generalized continued fraction `g`, for all `n ≥ 1`, we prove that the `continuants`

5f11361a

bump to nightly-2023-05-04-10

mathlib commit https://github.com/leanprover-community/mathlib/commit/92c69b77c5a7dc0f7eeddb552508633305157caa

3d8894bd

Diff

@@ -26,6 +26,12 @@ namespace GeneralizedContinuedFraction
 
 variable {K : Type _} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
 
+/- warning: generalized_continued_fraction.continuants_aux_recurrence -> GeneralizedContinuedFraction.continuantsAux_recurrence is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.continuants_aux_recurrence GeneralizedContinuedFraction.continuantsAux_recurrenceₓ'. -/
 theorem continuantsAux_recurrence {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)
     (succ_nth_conts_aux_eq : g.continuantsAux (n + 1) = pred) :
@@ -33,14 +39,26 @@ theorem continuantsAux_recurrence {gp ppred pred : Pair K} (nth_s_eq : g.s.get?
   by simp [*, continuants_aux, next_continuants, next_denominator, next_numerator]
 #align generalized_continued_fraction.continuants_aux_recurrence GeneralizedContinuedFraction.continuantsAux_recurrence
 
-theorem continuants_recurrence_aux {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
+/- warning: generalized_continued_fraction.continuants_recurrence_aux -> GeneralizedContinuedFraction.continuants_recurrenceAux is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) n) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.continuants_recurrence_aux GeneralizedContinuedFraction.continuants_recurrenceAuxₓ'. -/
+theorem continuants_recurrenceAux {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)
     (succ_nth_conts_aux_eq : g.continuantsAux (n + 1) = pred) :
     g.continuants (n + 1) = ⟨gp.b * pred.a + gp.a * ppred.a, gp.b * pred.b + gp.a * ppred.b⟩ := by
   simp [nth_cont_eq_succ_nth_cont_aux,
     continuants_aux_recurrence nth_s_eq nth_conts_aux_eq succ_nth_conts_aux_eq]
-#align generalized_continued_fraction.continuants_recurrence_aux GeneralizedContinuedFraction.continuants_recurrence_aux
+#align generalized_continued_fraction.continuants_recurrence_aux GeneralizedContinuedFraction.continuants_recurrenceAux
 
+/- warning: generalized_continued_fraction.continuants_recurrence -> GeneralizedContinuedFraction.continuants_recurrence is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppred : GeneralizedContinuedFraction.Pair.{u1} K} {pred : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n) ppred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) pred) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.a.{u1} K ppred))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K pred)) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) (GeneralizedContinuedFraction.Pair.b.{u1} K ppred)))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrenceₓ'. -/
 /-- Shows that `Aₙ = bₙ * Aₙ₋₁ + aₙ * Aₙ₋₂` and `Bₙ = bₙ * Bₙ₋₁ + aₙ * Bₙ₋₂`. -/
 theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get? (n + 1) = some gp)
     (nth_conts_eq : g.continuants n = ppred) (succ_nth_conts_eq : g.continuants (n + 1) = pred) :
@@ -50,6 +68,12 @@ theorem continuants_recurrence {gp ppred pred : Pair K} (succ_nth_s_eq : g.s.get
   exact continuants_recurrence_aux succ_nth_s_eq nth_conts_eq succ_nth_conts_eq
 #align generalized_continued_fraction.continuants_recurrence GeneralizedContinuedFraction.continuants_recurrence
 
+/- warning: generalized_continued_fraction.numerators_recurrence -> GeneralizedContinuedFraction.numerators_recurrence is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredA : K} {predA : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) ppredA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) predA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predA) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredA)))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredA : K} {predA : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) ppredA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) predA) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predA) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredA)))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.numerators_recurrence GeneralizedContinuedFraction.numerators_recurrenceₓ'. -/
 /-- Shows that `Aₙ = bₙ * Aₙ₋₁ + aₙ * Aₙ₋₂`. -/
 theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_num_eq : g.numerators n = ppredA)
@@ -64,6 +88,12 @@ theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
   rw [num_eq_conts_a, continuants_recurrence succ_nth_s_eq nth_conts_eq succ_nth_conts_eq]
 #align generalized_continued_fraction.numerators_recurrence GeneralizedContinuedFraction.numerators_recurrence
 
+/- warning: generalized_continued_fraction.denominators_recurrence -> GeneralizedContinuedFraction.denominators_recurrence is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredB : K} {predB : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n) ppredB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne))))) predB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat Nat.hasAdd) n (OfNat.ofNat.{0} Nat 2 (OfNat.mk.{0} Nat 2 (bit0.{0} Nat Nat.hasAdd (One.one.{0} Nat Nat.hasOne)))))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toHasAdd.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predB) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (Distrib.toHasMul.{u1} K (Ring.toDistrib.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredB)))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K] {gp : GeneralizedContinuedFraction.Pair.{u1} K} {ppredB : K} {predB : K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.get?.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.s.{u1} K g) (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n) ppredB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) predB) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 2 (instOfNatNat 2)))) (HAdd.hAdd.{u1, u1, u1} K K K (instHAdd.{u1} K (Distrib.toAdd.{u1} K (NonUnitalNonAssocSemiring.toDistrib.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.b.{u1} K gp) predB) (HMul.hMul.{u1, u1, u1} K K K (instHMul.{u1} K (NonUnitalNonAssocRing.toMul.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (GeneralizedContinuedFraction.Pair.a.{u1} K gp) ppredB)))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.denominators_recurrence GeneralizedContinuedFraction.denominators_recurrenceₓ'. -/
 /-- Shows that `Bₙ = bₙ * Bₙ₋₁ + aₙ * Bₙ₋₂`. -/
 theorem denominators_recurrence {gp : Pair K} {ppredB predB : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_denom_eq : g.denominators n = ppredB)

5f11361a

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

5f11361a

chore: remove stream-of-conciousness syntax for obtain (#11045)

This covers many instances, but is not exhaustive.

Independently of whether that syntax should be avoided (similar to #10534), I think all these changes are small improvements.

cd23c669

Diff

@@ -51,11 +51,11 @@ theorem numerators_recurrence {gp : Pair K} {ppredA predA : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_num_eq : g.numerators n = ppredA)
     (succ_nth_num_eq : g.numerators (n + 1) = predA) :
     g.numerators (n + 2) = gp.b * predA + gp.a * ppredA := by
-  obtain ⟨ppredConts, nth_conts_eq, ⟨rfl⟩⟩ : ∃ conts, g.continuants n = conts ∧ conts.a = ppredA
-  exact exists_conts_a_of_num nth_num_eq
+  obtain ⟨ppredConts, nth_conts_eq, ⟨rfl⟩⟩ : ∃ conts, g.continuants n = conts ∧ conts.a = ppredA :=
+    exists_conts_a_of_num nth_num_eq
   obtain ⟨predConts, succ_nth_conts_eq, ⟨rfl⟩⟩ :
-    ∃ conts, g.continuants (n + 1) = conts ∧ conts.a = predA
-  exact exists_conts_a_of_num succ_nth_num_eq
+      ∃ conts, g.continuants (n + 1) = conts ∧ conts.a = predA :=
+    exists_conts_a_of_num succ_nth_num_eq
   rw [num_eq_conts_a, continuants_recurrence succ_nth_s_eq nth_conts_eq succ_nth_conts_eq]
 #align generalized_continued_fraction.numerators_recurrence GeneralizedContinuedFraction.numerators_recurrence
 
@@ -64,11 +64,11 @@ theorem denominators_recurrence {gp : Pair K} {ppredB predB : K}
     (succ_nth_s_eq : g.s.get? (n + 1) = some gp) (nth_denom_eq : g.denominators n = ppredB)
     (succ_nth_denom_eq : g.denominators (n + 1) = predB) :
     g.denominators (n + 2) = gp.b * predB + gp.a * ppredB := by
-  obtain ⟨ppredConts, nth_conts_eq, ⟨rfl⟩⟩ : ∃ conts, g.continuants n = conts ∧ conts.b = ppredB
-  exact exists_conts_b_of_denom nth_denom_eq
+  obtain ⟨ppredConts, nth_conts_eq, ⟨rfl⟩⟩ : ∃ conts, g.continuants n = conts ∧ conts.b = ppredB :=
+    exists_conts_b_of_denom nth_denom_eq
   obtain ⟨predConts, succ_nth_conts_eq, ⟨rfl⟩⟩ :
-    ∃ conts, g.continuants (n + 1) = conts ∧ conts.b = predB
-  exact exists_conts_b_of_denom succ_nth_denom_eq
+      ∃ conts, g.continuants (n + 1) = conts ∧ conts.b = predB :=
+    exists_conts_b_of_denom succ_nth_denom_eq
   rw [denom_eq_conts_b, continuants_recurrence succ_nth_s_eq nth_conts_eq succ_nth_conts_eq]
 #align generalized_continued_fraction.denominators_recurrence GeneralizedContinuedFraction.denominators_recurrence

5f11361a

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

@@ -21,7 +21,7 @@ function indeed satisfies the following recurrences:
 
 namespace GeneralizedContinuedFraction
 
-variable {K : Type _} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
+variable {K : Type*} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
 
 theorem continuantsAux_recurrence {gp ppred pred : Pair K} (nth_s_eq : g.s.get? n = some gp)
     (nth_conts_aux_eq : g.continuantsAux n = ppred)

5f11361a

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,14 +2,11 @@
 Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kevin Kappelmann
-
-! This file was ported from Lean 3 source module algebra.continued_fractions.continuants_recurrence
-! leanprover-community/mathlib commit 5f11361a98ae4acd77f5c1837686f6f0102cdc25
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.ContinuedFractions.Translations
 
+#align_import algebra.continued_fractions.continuants_recurrence from "leanprover-community/mathlib"@"5f11361a98ae4acd77f5c1837686f6f0102cdc25"
+
 /-!
 # Recurrence Lemmas for the `continuants` Function of Continued Fractions.

5f11361a

feat: port Algebra.ContinuedFractions.ContinuantsRecurrence (#3791)

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

96a2d911

`algebra.continued_fractions.continuants_recurrence` ⟷ `Mathlib.Algebra.ContinuedFractions.ContinuantsRecurrence`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 80

algebra.continued_fractions.continuants_recurrence ⟷ Mathlib.Algebra.ContinuedFractions.ContinuantsRecurrence

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 2 + 80

`algebra.continued_fractions.continuants_recurrence` ⟷ `Mathlib.Algebra.ContinuedFractions.ContinuantsRecurrence`