algebra.continued_fractions.translations ⟷ Mathlib.Algebra.ContinuedFractions.Translations

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

@@ -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.Basic
+import Algebra.ContinuedFractions.Basic
 
 #align_import algebra.continued_fractions.translations from "leanprover-community/mathlib"@"b5ad141426bb005414324f89719c77c0aa3ec612"
 

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

@@ -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.translations
-! 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.Basic
 
+#align_import algebra.continued_fractions.translations from "leanprover-community/mathlib"@"b5ad141426bb005414324f89719c77c0aa3ec612"
+
 /-!
 # Basic Translation Lemmas Between Functions Defined for Continued Fractions
 

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

@@ -131,14 +131,18 @@ theorem denom_eq_conts_b : g.denominators n = (g.continuants n).b :=
 #align generalized_continued_fraction.denom_eq_conts_b GeneralizedContinuedFraction.denom_eq_conts_b
 -/
 
+#print GeneralizedContinuedFraction.convergent_eq_num_div_denom /-
 theorem convergent_eq_num_div_denom : g.convergents n = g.numerators n / g.denominators n :=
   rfl
 #align generalized_continued_fraction.convergent_eq_num_div_denom GeneralizedContinuedFraction.convergent_eq_num_div_denom
+-/
 
+#print GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_b /-
 theorem convergent_eq_conts_a_div_conts_b :
     g.convergents n = (g.continuants n).a / (g.continuants n).b :=
   rfl
 #align generalized_continued_fraction.convergent_eq_conts_a_div_conts_b GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_b
+-/
 
 #print GeneralizedContinuedFraction.exists_conts_a_of_num /-
 theorem exists_conts_a_of_num {A : K} (nth_num_eq : g.numerators n = A) :
@@ -152,20 +156,26 @@ theorem exists_conts_b_of_denom {B : K} (nth_denom_eq : g.denominators n = B) :
 #align generalized_continued_fraction.exists_conts_b_of_denom GeneralizedContinuedFraction.exists_conts_b_of_denom
 -/
 
+#print GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zero /-
 @[simp]
 theorem zeroth_continuant_aux_eq_one_zero : g.continuantsAux 0 = ⟨1, 0⟩ :=
   rfl
 #align generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zero
+-/
 
+#print GeneralizedContinuedFraction.first_continuant_aux_eq_h_one /-
 @[simp]
 theorem first_continuant_aux_eq_h_one : g.continuantsAux 1 = ⟨g.h, 1⟩ :=
   rfl
 #align generalized_continued_fraction.first_continuant_aux_eq_h_one GeneralizedContinuedFraction.first_continuant_aux_eq_h_one
+-/
 
+#print GeneralizedContinuedFraction.zeroth_continuant_eq_h_one /-
 @[simp]
 theorem zeroth_continuant_eq_h_one : g.continuants 0 = ⟨g.h, 1⟩ :=
   rfl
 #align generalized_continued_fraction.zeroth_continuant_eq_h_one GeneralizedContinuedFraction.zeroth_continuant_eq_h_one
+-/
 
 #print GeneralizedContinuedFraction.zeroth_numerator_eq_h /-
 @[simp]
@@ -174,10 +184,12 @@ theorem zeroth_numerator_eq_h : g.numerators 0 = g.h :=
 #align generalized_continued_fraction.zeroth_numerator_eq_h GeneralizedContinuedFraction.zeroth_numerator_eq_h
 -/
 
+#print GeneralizedContinuedFraction.zeroth_denominator_eq_one /-
 @[simp]
 theorem zeroth_denominator_eq_one : g.denominators 0 = 1 :=
   rfl
 #align generalized_continued_fraction.zeroth_denominator_eq_one GeneralizedContinuedFraction.zeroth_denominator_eq_one
+-/
 
 #print GeneralizedContinuedFraction.zeroth_convergent_eq_h /-
 @[simp]
@@ -186,19 +198,25 @@ theorem zeroth_convergent_eq_h : g.convergents 0 = g.h := by
 #align generalized_continued_fraction.zeroth_convergent_eq_h GeneralizedContinuedFraction.zeroth_convergent_eq_h
 -/
 
+#print GeneralizedContinuedFraction.second_continuant_aux_eq /-
 theorem second_continuant_aux_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuantsAux 2 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [zeroth_s_eq, continuants_aux, next_continuants, next_denominator, next_numerator]
 #align generalized_continued_fraction.second_continuant_aux_eq GeneralizedContinuedFraction.second_continuant_aux_eq
+-/
 
+#print GeneralizedContinuedFraction.first_continuant_eq /-
 theorem first_continuant_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuants 1 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [nth_cont_eq_succ_nth_cont_aux, second_continuant_aux_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_continuant_eq GeneralizedContinuedFraction.first_continuant_eq
+-/
 
+#print GeneralizedContinuedFraction.first_numerator_eq /-
 theorem first_numerator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.numerators 1 = gp.b * g.h + gp.a := by simp [num_eq_conts_a, first_continuant_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_numerator_eq GeneralizedContinuedFraction.first_numerator_eq
+-/
 
 #print GeneralizedContinuedFraction.first_denominator_eq /-
 theorem first_denominator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
@@ -206,10 +224,12 @@ theorem first_denominator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp)
 #align generalized_continued_fraction.first_denominator_eq GeneralizedContinuedFraction.first_denominator_eq
 -/
 
+#print GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zero /-
 @[simp]
 theorem zeroth_convergent'_aux_eq_zero {s : Seq <| Pair K} : convergents'Aux s 0 = 0 :=
   rfl
 #align generalized_continued_fraction.zeroth_convergent'_aux_eq_zero GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zero
+-/
 
 #print GeneralizedContinuedFraction.zeroth_convergent'_eq_h /-
 @[simp]
@@ -217,14 +237,18 @@ theorem zeroth_convergent'_eq_h : g.convergents' 0 = g.h := by simp [convergents
 #align generalized_continued_fraction.zeroth_convergent'_eq_h GeneralizedContinuedFraction.zeroth_convergent'_eq_h
 -/
 
+#print GeneralizedContinuedFraction.convergents'Aux_succ_none /-
 theorem convergents'Aux_succ_none {s : Seq (Pair K)} (h : s.headI = none) (n : ℕ) :
     convergents'Aux s (n + 1) = 0 := by rw [convergents'_aux, h, convergents'_aux._match_1]
 #align generalized_continued_fraction.convergents'_aux_succ_none GeneralizedContinuedFraction.convergents'Aux_succ_none
+-/
 
+#print GeneralizedContinuedFraction.convergents'Aux_succ_some /-
 theorem convergents'Aux_succ_some {s : Seq (Pair K)} {p : Pair K} (h : s.headI = some p) (n : ℕ) :
     convergents'Aux s (n + 1) = p.a / (p.b + convergents'Aux s.tail n) := by
   rw [convergents'_aux, h, convergents'_aux._match_1]
 #align generalized_continued_fraction.convergents'_aux_succ_some GeneralizedContinuedFraction.convergents'Aux_succ_some
+-/
 
 end WithDivisionRing
 

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

@@ -25,7 +25,7 @@ Some simple translation lemmas between the different definitions of functions de
 
 namespace GeneralizedContinuedFraction
 
-/- ./././Mathport/Syntax/Translate/Command.lean:229:11: unsupported: unusual advanced open style -/
+/- ./././Mathport/Syntax/Translate/Command.lean:230:11: unsupported: unusual advanced open style -/
 section General
 
 /-!

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

@@ -131,22 +131,10 @@ theorem denom_eq_conts_b : g.denominators n = (g.continuants n).b :=
 #align generalized_continued_fraction.denom_eq_conts_b GeneralizedContinuedFraction.denom_eq_conts_b
 -/
 
-/- warning: generalized_continued_fraction.convergent_eq_num_div_denom -> GeneralizedContinuedFraction.convergent_eq_num_div_denom is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivInvMonoid.toHasDiv.{u1} K (DivisionRing.toDivInvMonoid.{u1} K _inst_1))) (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivisionRing.toDiv.{u1} K _inst_1)) (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergent_eq_num_div_denom GeneralizedContinuedFraction.convergent_eq_num_div_denomₓ'. -/
 theorem convergent_eq_num_div_denom : g.convergents n = g.numerators n / g.denominators n :=
   rfl
 #align generalized_continued_fraction.convergent_eq_num_div_denom GeneralizedContinuedFraction.convergent_eq_num_div_denom
 
-/- warning: generalized_continued_fraction.convergent_eq_conts_a_div_conts_b -> GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_b is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivInvMonoid.toHasDiv.{u1} K (DivisionRing.toDivInvMonoid.{u1} K _inst_1))) (GeneralizedContinuedFraction.Pair.a.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)) (GeneralizedContinuedFraction.Pair.b.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivisionRing.toDiv.{u1} K _inst_1)) (GeneralizedContinuedFraction.Pair.a.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)) (GeneralizedContinuedFraction.Pair.b.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergent_eq_conts_a_div_conts_b GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_bₓ'. -/
 theorem convergent_eq_conts_a_div_conts_b :
     g.convergents n = (g.continuants n).a / (g.continuants n).b :=
   rfl
@@ -164,34 +152,16 @@ theorem exists_conts_b_of_denom {B : K} (nth_denom_eq : g.denominators n = B) :
 #align generalized_continued_fraction.exists_conts_b_of_denom GeneralizedContinuedFraction.exists_conts_b_of_denom
 -/
 
-/- warning: generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero -> GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zero is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zeroₓ'. -/
 @[simp]
 theorem zeroth_continuant_aux_eq_one_zero : g.continuantsAux 0 = ⟨1, 0⟩ :=
   rfl
 #align generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zero
 
-/- warning: generalized_continued_fraction.first_continuant_aux_eq_h_one -> GeneralizedContinuedFraction.first_continuant_aux_eq_h_one is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_continuant_aux_eq_h_one GeneralizedContinuedFraction.first_continuant_aux_eq_h_oneₓ'. -/
 @[simp]
 theorem first_continuant_aux_eq_h_one : g.continuantsAux 1 = ⟨g.h, 1⟩ :=
   rfl
 #align generalized_continued_fraction.first_continuant_aux_eq_h_one GeneralizedContinuedFraction.first_continuant_aux_eq_h_one
 
-/- warning: generalized_continued_fraction.zeroth_continuant_eq_h_one -> GeneralizedContinuedFraction.zeroth_continuant_eq_h_one is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_continuant_eq_h_one GeneralizedContinuedFraction.zeroth_continuant_eq_h_oneₓ'. -/
 @[simp]
 theorem zeroth_continuant_eq_h_one : g.continuants 0 = ⟨g.h, 1⟩ :=
   rfl
@@ -204,12 +174,6 @@ theorem zeroth_numerator_eq_h : g.numerators 0 = g.h :=
 #align generalized_continued_fraction.zeroth_numerator_eq_h GeneralizedContinuedFraction.zeroth_numerator_eq_h
 -/
 
-/- warning: generalized_continued_fraction.zeroth_denominator_eq_one -> GeneralizedContinuedFraction.zeroth_denominator_eq_one is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_denominator_eq_one GeneralizedContinuedFraction.zeroth_denominator_eq_oneₓ'. -/
 @[simp]
 theorem zeroth_denominator_eq_one : g.denominators 0 = 1 :=
   rfl
@@ -222,34 +186,16 @@ theorem zeroth_convergent_eq_h : g.convergents 0 = g.h := by
 #align generalized_continued_fraction.zeroth_convergent_eq_h GeneralizedContinuedFraction.zeroth_convergent_eq_h
 -/
 
-/- warning: generalized_continued_fraction.second_continuant_aux_eq -> GeneralizedContinuedFraction.second_continuant_aux_eq is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.second_continuant_aux_eq GeneralizedContinuedFraction.second_continuant_aux_eqₓ'. -/
 theorem second_continuant_aux_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuantsAux 2 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [zeroth_s_eq, continuants_aux, next_continuants, next_denominator, next_numerator]
 #align generalized_continued_fraction.second_continuant_aux_eq GeneralizedContinuedFraction.second_continuant_aux_eq
 
-/- warning: generalized_continued_fraction.first_continuant_eq -> GeneralizedContinuedFraction.first_continuant_eq is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_continuant_eq GeneralizedContinuedFraction.first_continuant_eqₓ'. -/
 theorem first_continuant_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuants 1 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [nth_cont_eq_succ_nth_cont_aux, second_continuant_aux_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_continuant_eq GeneralizedContinuedFraction.first_continuant_eq
 
-/- warning: generalized_continued_fraction.first_numerator_eq -> GeneralizedContinuedFraction.first_numerator_eq is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (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) (GeneralizedContinuedFraction.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)))
-but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1))) (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_numerator_eq GeneralizedContinuedFraction.first_numerator_eqₓ'. -/
 theorem first_numerator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.numerators 1 = gp.b * g.h + gp.a := by simp [num_eq_conts_a, first_continuant_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_numerator_eq GeneralizedContinuedFraction.first_numerator_eq
@@ -260,12 +206,6 @@ theorem first_denominator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp)
 #align generalized_continued_fraction.first_denominator_eq GeneralizedContinuedFraction.first_denominator_eq
 -/
 
-/- warning: generalized_continued_fraction.zeroth_convergent'_aux_eq_zero -> GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zero is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
-but is expected to have type
-  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_convergent'_aux_eq_zero GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zeroₓ'. -/
 @[simp]
 theorem zeroth_convergent'_aux_eq_zero {s : Seq <| Pair K} : convergents'Aux s 0 = 0 :=
   rfl
@@ -277,22 +217,10 @@ theorem zeroth_convergent'_eq_h : g.convergents' 0 = g.h := by simp [convergents
 #align generalized_continued_fraction.zeroth_convergent'_eq_h GeneralizedContinuedFraction.zeroth_convergent'_eq_h
 -/
 
-/- warning: generalized_continued_fraction.convergents'_aux_succ_none -> GeneralizedContinuedFraction.convergents'Aux_succ_none is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.none.{u1} (GeneralizedContinuedFraction.Pair.{u1} K))) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (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))))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))))
-but is expected to have type
-  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.none.{u1} (GeneralizedContinuedFraction.Pair.{u1} K))) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergents'_aux_succ_none GeneralizedContinuedFraction.convergents'Aux_succ_noneₓ'. -/
 theorem convergents'Aux_succ_none {s : Seq (Pair K)} (h : s.headI = none) (n : ℕ) :
     convergents'Aux s (n + 1) = 0 := by rw [convergents'_aux, h, convergents'_aux._match_1]
 #align generalized_continued_fraction.convergents'_aux_succ_none GeneralizedContinuedFraction.convergents'Aux_succ_none
 
-/- warning: generalized_continued_fraction.convergents'_aux_succ_some -> GeneralizedContinuedFraction.convergents'Aux_succ_some is a dubious translation:
-lean 3 declaration is
-  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)} {p : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) p)) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (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))))) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivInvMonoid.toHasDiv.{u1} K (DivisionRing.toDivInvMonoid.{u1} K _inst_1))) (GeneralizedContinuedFraction.Pair.a.{u1} K p) (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)))) (GeneralizedContinuedFraction.Pair.b.{u1} K p) (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 (Stream'.Seq.tail.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) n))))
-but is expected to have type
-  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)} {p : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) p)) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivisionRing.toDiv.{u1} K _inst_1)) (GeneralizedContinuedFraction.Pair.a.{u1} K p) (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))))))) (GeneralizedContinuedFraction.Pair.b.{u1} K p) (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 (Stream'.Seq.tail.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) n))))
-Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergents'_aux_succ_some GeneralizedContinuedFraction.convergents'Aux_succ_someₓ'. -/
 theorem convergents'Aux_succ_some {s : Seq (Pair K)} {p : Pair K} (h : s.headI = some p) (n : ℕ) :
     convergents'Aux s (n + 1) = p.a / (p.b + convergents'Aux s.tail n) := by
   rw [convergents'_aux, h, convergents'_aux._match_1]

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

@@ -168,7 +168,7 @@ theorem exists_conts_b_of_denom {B : K} (nth_denom_eq : g.denominators n = B) :
 lean 3 declaration is
   forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))))
 but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))))
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))))
 Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zeroₓ'. -/
 @[simp]
 theorem zeroth_continuant_aux_eq_one_zero : g.continuantsAux 0 = ⟨1, 0⟩ :=
@@ -179,7 +179,7 @@ theorem zeroth_continuant_aux_eq_one_zero : g.continuantsAux 0 = ⟨1, 0⟩ :=
 lean 3 declaration is
   forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
 but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))))
 Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_continuant_aux_eq_h_one GeneralizedContinuedFraction.first_continuant_aux_eq_h_oneₓ'. -/
 @[simp]
 theorem first_continuant_aux_eq_h_one : g.continuantsAux 1 = ⟨g.h, 1⟩ :=
@@ -190,7 +190,7 @@ theorem first_continuant_aux_eq_h_one : g.continuantsAux 1 = ⟨g.h, 1⟩ :=
 lean 3 declaration is
   forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
 but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))))
 Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_continuant_eq_h_one GeneralizedContinuedFraction.zeroth_continuant_eq_h_oneₓ'. -/
 @[simp]
 theorem zeroth_continuant_eq_h_one : g.continuants 0 = ⟨g.h, 1⟩ :=
@@ -208,7 +208,7 @@ theorem zeroth_numerator_eq_h : g.numerators 0 = g.h :=
 lean 3 declaration is
   forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))
 but is expected to have type
-  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (Semiring.toOne.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))
 Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_denominator_eq_one GeneralizedContinuedFraction.zeroth_denominator_eq_oneₓ'. -/
 @[simp]
 theorem zeroth_denominator_eq_one : g.denominators 0 = 1 :=

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

@@ -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.translations
-! leanprover-community/mathlib commit a7e36e48519ab281320c4d192da6a7b348ce40ad
+! 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.Basic
 /-!
 # Basic Translation Lemmas Between Functions Defined for Continued Fractions
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 ## Summary
 
 Some simple translation lemmas between the different definitions of functions defined in

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

@@ -35,46 +35,66 @@ us to access the numerators and denominators of a continued fraction.
 
 variable {α : Type _} {g : GeneralizedContinuedFraction α} {n : ℕ}
 
+#print GeneralizedContinuedFraction.terminatedAt_iff_s_terminatedAt /-
 theorem terminatedAt_iff_s_terminatedAt : g.TerminatedAt n ↔ g.s.TerminatedAt n := by rfl
 #align generalized_continued_fraction.terminated_at_iff_s_terminated_at GeneralizedContinuedFraction.terminatedAt_iff_s_terminatedAt
+-/
 
+#print GeneralizedContinuedFraction.terminatedAt_iff_s_none /-
 theorem terminatedAt_iff_s_none : g.TerminatedAt n ↔ g.s.get? n = none := by rfl
 #align generalized_continued_fraction.terminated_at_iff_s_none GeneralizedContinuedFraction.terminatedAt_iff_s_none
+-/
 
+#print GeneralizedContinuedFraction.part_num_none_iff_s_none /-
 theorem part_num_none_iff_s_none : g.partialNumerators.get? n = none ↔ g.s.get? n = none := by
   cases s_nth_eq : g.s.nth n <;> simp [partial_numerators, s_nth_eq]
 #align generalized_continued_fraction.part_num_none_iff_s_none GeneralizedContinuedFraction.part_num_none_iff_s_none
+-/
 
+#print GeneralizedContinuedFraction.terminatedAt_iff_part_num_none /-
 theorem terminatedAt_iff_part_num_none : g.TerminatedAt n ↔ g.partialNumerators.get? n = none := by
   rw [terminated_at_iff_s_none, part_num_none_iff_s_none]
 #align generalized_continued_fraction.terminated_at_iff_part_num_none GeneralizedContinuedFraction.terminatedAt_iff_part_num_none
+-/
 
+#print GeneralizedContinuedFraction.part_denom_none_iff_s_none /-
 theorem part_denom_none_iff_s_none : g.partialDenominators.get? n = none ↔ g.s.get? n = none := by
   cases s_nth_eq : g.s.nth n <;> simp [partial_denominators, s_nth_eq]
 #align generalized_continued_fraction.part_denom_none_iff_s_none GeneralizedContinuedFraction.part_denom_none_iff_s_none
+-/
 
+#print GeneralizedContinuedFraction.terminatedAt_iff_part_denom_none /-
 theorem terminatedAt_iff_part_denom_none : g.TerminatedAt n ↔ g.partialDenominators.get? n = none :=
   by rw [terminated_at_iff_s_none, part_denom_none_iff_s_none]
 #align generalized_continued_fraction.terminated_at_iff_part_denom_none GeneralizedContinuedFraction.terminatedAt_iff_part_denom_none
+-/
 
+#print GeneralizedContinuedFraction.part_num_eq_s_a /-
 theorem part_num_eq_s_a {gp : Pair α} (s_nth_eq : g.s.get? n = some gp) :
     g.partialNumerators.get? n = some gp.a := by simp [partial_numerators, s_nth_eq]
 #align generalized_continued_fraction.part_num_eq_s_a GeneralizedContinuedFraction.part_num_eq_s_a
+-/
 
+#print GeneralizedContinuedFraction.part_denom_eq_s_b /-
 theorem part_denom_eq_s_b {gp : Pair α} (s_nth_eq : g.s.get? n = some gp) :
     g.partialDenominators.get? n = some gp.b := by simp [partial_denominators, s_nth_eq]
 #align generalized_continued_fraction.part_denom_eq_s_b GeneralizedContinuedFraction.part_denom_eq_s_b
+-/
 
+#print GeneralizedContinuedFraction.exists_s_a_of_part_num /-
 theorem exists_s_a_of_part_num {a : α} (nth_part_num_eq : g.partialNumerators.get? n = some a) :
     ∃ gp, g.s.get? n = some gp ∧ gp.a = a := by
   simpa [partial_numerators, seq.map_nth] using nth_part_num_eq
 #align generalized_continued_fraction.exists_s_a_of_part_num GeneralizedContinuedFraction.exists_s_a_of_part_num
+-/
 
+#print GeneralizedContinuedFraction.exists_s_b_of_part_denom /-
 theorem exists_s_b_of_part_denom {b : α}
     (nth_part_denom_eq : g.partialDenominators.get? n = some b) :
     ∃ gp, g.s.get? n = some gp ∧ gp.b = b := by
   simpa [partial_denominators, seq.map_nth] using nth_part_denom_eq
 #align generalized_continued_fraction.exists_s_b_of_part_denom GeneralizedContinuedFraction.exists_s_b_of_part_denom
+-/
 
 end General
 
@@ -90,96 +110,186 @@ continued fraction.
 
 variable {K : Type _} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
 
+#print GeneralizedContinuedFraction.nth_cont_eq_succ_nth_cont_aux /-
 theorem nth_cont_eq_succ_nth_cont_aux : g.continuants n = g.continuantsAux (n + 1) :=
   rfl
 #align generalized_continued_fraction.nth_cont_eq_succ_nth_cont_aux GeneralizedContinuedFraction.nth_cont_eq_succ_nth_cont_aux
+-/
 
+#print GeneralizedContinuedFraction.num_eq_conts_a /-
 theorem num_eq_conts_a : g.numerators n = (g.continuants n).a :=
   rfl
 #align generalized_continued_fraction.num_eq_conts_a GeneralizedContinuedFraction.num_eq_conts_a
+-/
 
+#print GeneralizedContinuedFraction.denom_eq_conts_b /-
 theorem denom_eq_conts_b : g.denominators n = (g.continuants n).b :=
   rfl
 #align generalized_continued_fraction.denom_eq_conts_b GeneralizedContinuedFraction.denom_eq_conts_b
+-/
 
+/- warning: generalized_continued_fraction.convergent_eq_num_div_denom -> GeneralizedContinuedFraction.convergent_eq_num_div_denom is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivInvMonoid.toHasDiv.{u1} K (DivisionRing.toDivInvMonoid.{u1} K _inst_1))) (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivisionRing.toDiv.{u1} K _inst_1)) (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g n) (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g n))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergent_eq_num_div_denom GeneralizedContinuedFraction.convergent_eq_num_div_denomₓ'. -/
 theorem convergent_eq_num_div_denom : g.convergents n = g.numerators n / g.denominators n :=
   rfl
 #align generalized_continued_fraction.convergent_eq_num_div_denom GeneralizedContinuedFraction.convergent_eq_num_div_denom
 
+/- warning: generalized_continued_fraction.convergent_eq_conts_a_div_conts_b -> GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_b is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivInvMonoid.toHasDiv.{u1} K (DivisionRing.toDivInvMonoid.{u1} K _inst_1))) (GeneralizedContinuedFraction.Pair.a.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)) (GeneralizedContinuedFraction.Pair.b.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} {n : Nat} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.convergents.{u1} K _inst_1 g n) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivisionRing.toDiv.{u1} K _inst_1)) (GeneralizedContinuedFraction.Pair.a.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)) (GeneralizedContinuedFraction.Pair.b.{u1} K (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g n)))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergent_eq_conts_a_div_conts_b GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_bₓ'. -/
 theorem convergent_eq_conts_a_div_conts_b :
     g.convergents n = (g.continuants n).a / (g.continuants n).b :=
   rfl
 #align generalized_continued_fraction.convergent_eq_conts_a_div_conts_b GeneralizedContinuedFraction.convergent_eq_conts_a_div_conts_b
 
+#print GeneralizedContinuedFraction.exists_conts_a_of_num /-
 theorem exists_conts_a_of_num {A : K} (nth_num_eq : g.numerators n = A) :
     ∃ conts, g.continuants n = conts ∧ conts.a = A := by simpa
 #align generalized_continued_fraction.exists_conts_a_of_num GeneralizedContinuedFraction.exists_conts_a_of_num
+-/
 
+#print GeneralizedContinuedFraction.exists_conts_b_of_denom /-
 theorem exists_conts_b_of_denom {B : K} (nth_denom_eq : g.denominators n = B) :
     ∃ conts, g.continuants n = conts ∧ conts.b = B := by simpa
 #align generalized_continued_fraction.exists_conts_b_of_denom GeneralizedContinuedFraction.exists_conts_b_of_denom
+-/
 
+/- warning: generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero -> GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zero is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zeroₓ'. -/
 @[simp]
 theorem zeroth_continuant_aux_eq_one_zero : g.continuantsAux 0 = ⟨1, 0⟩ :=
   rfl
 #align generalized_continued_fraction.zeroth_continuant_aux_eq_one_zero GeneralizedContinuedFraction.zeroth_continuant_aux_eq_one_zero
 
+/- warning: generalized_continued_fraction.first_continuant_aux_eq_h_one -> GeneralizedContinuedFraction.first_continuant_aux_eq_h_one is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (One.one.{0} Nat Nat.hasOne)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_continuant_aux_eq_h_one GeneralizedContinuedFraction.first_continuant_aux_eq_h_oneₓ'. -/
 @[simp]
 theorem first_continuant_aux_eq_h_one : g.continuantsAux 1 = ⟨g.h, 1⟩ :=
   rfl
 #align generalized_continued_fraction.first_continuant_aux_eq_h_one GeneralizedContinuedFraction.first_continuant_aux_eq_h_one
 
+/- warning: generalized_continued_fraction.zeroth_continuant_eq_h_one -> GeneralizedContinuedFraction.zeroth_continuant_eq_h_one is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (GeneralizedContinuedFraction.Pair.mk.{u1} K (GeneralizedContinuedFraction.h.{u1} K g) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_continuant_eq_h_one GeneralizedContinuedFraction.zeroth_continuant_eq_h_oneₓ'. -/
 @[simp]
 theorem zeroth_continuant_eq_h_one : g.continuants 0 = ⟨g.h, 1⟩ :=
   rfl
 #align generalized_continued_fraction.zeroth_continuant_eq_h_one GeneralizedContinuedFraction.zeroth_continuant_eq_h_one
 
+#print GeneralizedContinuedFraction.zeroth_numerator_eq_h /-
 @[simp]
 theorem zeroth_numerator_eq_h : g.numerators 0 = g.h :=
   rfl
 #align generalized_continued_fraction.zeroth_numerator_eq_h GeneralizedContinuedFraction.zeroth_numerator_eq_h
+-/
 
+/- warning: generalized_continued_fraction.zeroth_denominator_eq_one -> GeneralizedContinuedFraction.zeroth_denominator_eq_one is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (OfNat.ofNat.{u1} K 1 (OfNat.mk.{u1} K 1 (One.one.{u1} K (AddMonoidWithOne.toOne.{u1} K (AddGroupWithOne.toAddMonoidWithOne.{u1} K (AddCommGroupWithOne.toAddGroupWithOne.{u1} K (Ring.toAddCommGroupWithOne.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K], Eq.{succ u1} K (GeneralizedContinuedFraction.denominators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (OfNat.ofNat.{u1} K 1 (One.toOfNat1.{u1} K (NonAssocRing.toOne.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_denominator_eq_one GeneralizedContinuedFraction.zeroth_denominator_eq_oneₓ'. -/
 @[simp]
 theorem zeroth_denominator_eq_one : g.denominators 0 = 1 :=
   rfl
 #align generalized_continued_fraction.zeroth_denominator_eq_one GeneralizedContinuedFraction.zeroth_denominator_eq_one
 
+#print GeneralizedContinuedFraction.zeroth_convergent_eq_h /-
 @[simp]
 theorem zeroth_convergent_eq_h : g.convergents 0 = g.h := by
   simp [convergent_eq_num_div_denom, num_eq_conts_a, denom_eq_conts_b, div_one]
 #align generalized_continued_fraction.zeroth_convergent_eq_h GeneralizedContinuedFraction.zeroth_convergent_eq_h
+-/
 
+/- warning: generalized_continued_fraction.second_continuant_aux_eq -> GeneralizedContinuedFraction.second_continuant_aux_eq is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuantsAux.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.second_continuant_aux_eq GeneralizedContinuedFraction.second_continuant_aux_eqₓ'. -/
 theorem second_continuant_aux_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuantsAux 2 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [zeroth_s_eq, continuants_aux, next_continuants, next_denominator, next_numerator]
 #align generalized_continued_fraction.second_continuant_aux_eq GeneralizedContinuedFraction.second_continuant_aux_eq
 
+/- warning: generalized_continued_fraction.first_continuant_eq -> GeneralizedContinuedFraction.first_continuant_eq is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} (GeneralizedContinuedFraction.Pair.{u1} K) (GeneralizedContinuedFraction.continuants.{u1} K _inst_1 g (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)) (GeneralizedContinuedFraction.Pair.b.{u1} K gp)))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_continuant_eq GeneralizedContinuedFraction.first_continuant_eqₓ'. -/
 theorem first_continuant_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuants 1 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [nth_cont_eq_succ_nth_cont_aux, second_continuant_aux_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_continuant_eq GeneralizedContinuedFraction.first_continuant_eq
 
+/- warning: generalized_continued_fraction.first_numerator_eq -> GeneralizedContinuedFraction.first_numerator_eq is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (OfNat.mk.{0} Nat 1 (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) (GeneralizedContinuedFraction.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)))
+but is expected to have type
+  forall {K : Type.{u1}} {g : GeneralizedContinuedFraction.{u1} K} [_inst_1 : DivisionRing.{u1} K] {gp : 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) (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) gp)) -> (Eq.{succ u1} K (GeneralizedContinuedFraction.numerators.{u1} K _inst_1 g (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1))) (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.h.{u1} K g)) (GeneralizedContinuedFraction.Pair.a.{u1} K gp)))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.first_numerator_eq GeneralizedContinuedFraction.first_numerator_eqₓ'. -/
 theorem first_numerator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.numerators 1 = gp.b * g.h + gp.a := by simp [num_eq_conts_a, first_continuant_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_numerator_eq GeneralizedContinuedFraction.first_numerator_eq
 
+#print GeneralizedContinuedFraction.first_denominator_eq /-
 theorem first_denominator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.denominators 1 = gp.b := by simp [denom_eq_conts_b, first_continuant_eq zeroth_s_eq]
 #align generalized_continued_fraction.first_denominator_eq GeneralizedContinuedFraction.first_denominator_eq
+-/
 
+/- warning: generalized_continued_fraction.zeroth_convergent'_aux_eq_zero -> GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zero is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (OfNat.ofNat.{0} Nat 0 (OfNat.mk.{0} Nat 0 (Zero.zero.{0} Nat Nat.hasZero)))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1)))))))))
+but is expected to have type
+  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (OfNat.ofNat.{0} Nat 0 (instOfNatNat 0))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1))))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.zeroth_convergent'_aux_eq_zero GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zeroₓ'. -/
 @[simp]
 theorem zeroth_convergent'_aux_eq_zero {s : Seq <| Pair K} : convergents'Aux s 0 = 0 :=
   rfl
 #align generalized_continued_fraction.zeroth_convergent'_aux_eq_zero GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zero
 
+#print GeneralizedContinuedFraction.zeroth_convergent'_eq_h /-
 @[simp]
 theorem zeroth_convergent'_eq_h : g.convergents' 0 = g.h := by simp [convergents']
 #align generalized_continued_fraction.zeroth_convergent'_eq_h GeneralizedContinuedFraction.zeroth_convergent'_eq_h
+-/
 
+/- warning: generalized_continued_fraction.convergents'_aux_succ_none -> GeneralizedContinuedFraction.convergents'Aux_succ_none is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.none.{u1} (GeneralizedContinuedFraction.Pair.{u1} K))) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (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))))) (OfNat.ofNat.{u1} K 0 (OfNat.mk.{u1} K 0 (Zero.zero.{u1} K (MulZeroClass.toHasZero.{u1} K (NonUnitalNonAssocSemiring.toMulZeroClass.{u1} K (NonUnitalNonAssocRing.toNonUnitalNonAssocSemiring.{u1} K (NonAssocRing.toNonUnitalNonAssocRing.{u1} K (Ring.toNonAssocRing.{u1} K (DivisionRing.toRing.{u1} K _inst_1))))))))))
+but is expected to have type
+  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.none.{u1} (GeneralizedContinuedFraction.Pair.{u1} K))) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (OfNat.ofNat.{u1} K 0 (Zero.toOfNat0.{u1} K (MonoidWithZero.toZero.{u1} K (Semiring.toMonoidWithZero.{u1} K (DivisionSemiring.toSemiring.{u1} K (DivisionRing.toDivisionSemiring.{u1} K _inst_1)))))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergents'_aux_succ_none GeneralizedContinuedFraction.convergents'Aux_succ_noneₓ'. -/
 theorem convergents'Aux_succ_none {s : Seq (Pair K)} (h : s.headI = none) (n : ℕ) :
     convergents'Aux s (n + 1) = 0 := by rw [convergents'_aux, h, convergents'_aux._match_1]
 #align generalized_continued_fraction.convergents'_aux_succ_none GeneralizedContinuedFraction.convergents'Aux_succ_none
 
+/- warning: generalized_continued_fraction.convergents'_aux_succ_some -> GeneralizedContinuedFraction.convergents'Aux_succ_some is a dubious translation:
+lean 3 declaration is
+  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)} {p : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) p)) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (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))))) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivInvMonoid.toHasDiv.{u1} K (DivisionRing.toDivInvMonoid.{u1} K _inst_1))) (GeneralizedContinuedFraction.Pair.a.{u1} K p) (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)))) (GeneralizedContinuedFraction.Pair.b.{u1} K p) (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 (Stream'.Seq.tail.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) n))))
+but is expected to have type
+  forall {K : Type.{u1}} [_inst_1 : DivisionRing.{u1} K] {s : Stream'.Seq.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)} {p : GeneralizedContinuedFraction.Pair.{u1} K}, (Eq.{succ u1} (Option.{u1} (GeneralizedContinuedFraction.Pair.{u1} K)) (Stream'.Seq.head.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) (Option.some.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) p)) -> (forall (n : Nat), Eq.{succ u1} K (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 s (HAdd.hAdd.{0, 0, 0} Nat Nat Nat (instHAdd.{0} Nat instAddNat) n (OfNat.ofNat.{0} Nat 1 (instOfNatNat 1)))) (HDiv.hDiv.{u1, u1, u1} K K K (instHDiv.{u1} K (DivisionRing.toDiv.{u1} K _inst_1)) (GeneralizedContinuedFraction.Pair.a.{u1} K p) (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))))))) (GeneralizedContinuedFraction.Pair.b.{u1} K p) (GeneralizedContinuedFraction.convergents'Aux.{u1} K _inst_1 (Stream'.Seq.tail.{u1} (GeneralizedContinuedFraction.Pair.{u1} K) s) n))))
+Case conversion may be inaccurate. Consider using '#align generalized_continued_fraction.convergents'_aux_succ_some GeneralizedContinuedFraction.convergents'Aux_succ_someₓ'. -/
 theorem convergents'Aux_succ_some {s : Seq (Pair K)} {p : Pair K} (h : s.headI = some p) (n : ℕ) :
     convergents'Aux s (n + 1) = p.a / (p.b + convergents'Aux s.tail n) := by
   rw [convergents'_aux, h, convergents'_aux._match_1]

mathlib commit https://github.com/leanprover-community/mathlib/commit/09079525fd01b3dda35e96adaa08d2f943e1648c

@@ -22,7 +22,7 @@ Some simple translation lemmas between the different definitions of functions de
 
 namespace GeneralizedContinuedFraction
 
-/- ./././Mathport/Syntax/Translate/Command.lean:224:11: unsupported: unusual advanced open style -/
+/- ./././Mathport/Syntax/Translate/Command.lean:229:11: unsupported: unusual advanced open style -/
 section General
 
 /-!

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

@@ -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.translations
-! leanprover-community/mathlib commit 10d887272d1a72b99da88bcb301d1da9d9d33696
+! leanprover-community/mathlib commit a7e36e48519ab281320c4d192da6a7b348ce40ad
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -22,6 +22,7 @@ Some simple translation lemmas between the different definitions of functions de
 
 namespace GeneralizedContinuedFraction
 
+/- ./././Mathport/Syntax/Translate/Command.lean:224:11: unsupported: unusual advanced open style -/
 section General
 
 /-!
@@ -66,13 +67,13 @@ theorem part_denom_eq_s_b {gp : Pair α} (s_nth_eq : g.s.get? n = some gp) :
 
 theorem exists_s_a_of_part_num {a : α} (nth_part_num_eq : g.partialNumerators.get? n = some a) :
     ∃ gp, g.s.get? n = some gp ∧ gp.a = a := by
-  simpa [partial_numerators, SeqCat.map_nth] using nth_part_num_eq
+  simpa [partial_numerators, seq.map_nth] using nth_part_num_eq
 #align generalized_continued_fraction.exists_s_a_of_part_num GeneralizedContinuedFraction.exists_s_a_of_part_num
 
 theorem exists_s_b_of_part_denom {b : α}
     (nth_part_denom_eq : g.partialDenominators.get? n = some b) :
     ∃ gp, g.s.get? n = some gp ∧ gp.b = b := by
-  simpa [partial_denominators, SeqCat.map_nth] using nth_part_denom_eq
+  simpa [partial_denominators, seq.map_nth] using nth_part_denom_eq
 #align generalized_continued_fraction.exists_s_b_of_part_denom GeneralizedContinuedFraction.exists_s_b_of_part_denom
 
 end General
@@ -167,7 +168,7 @@ theorem first_denominator_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp)
 #align generalized_continued_fraction.first_denominator_eq GeneralizedContinuedFraction.first_denominator_eq
 
 @[simp]
-theorem zeroth_convergent'_aux_eq_zero {s : SeqCat <| Pair K} : convergents'Aux s 0 = 0 :=
+theorem zeroth_convergent'_aux_eq_zero {s : Seq <| Pair K} : convergents'Aux s 0 = 0 :=
   rfl
 #align generalized_continued_fraction.zeroth_convergent'_aux_eq_zero GeneralizedContinuedFraction.zeroth_convergent'_aux_eq_zero
 
@@ -175,12 +176,12 @@ theorem zeroth_convergent'_aux_eq_zero {s : SeqCat <| Pair K} : convergents'Aux
 theorem zeroth_convergent'_eq_h : g.convergents' 0 = g.h := by simp [convergents']
 #align generalized_continued_fraction.zeroth_convergent'_eq_h GeneralizedContinuedFraction.zeroth_convergent'_eq_h
 
-theorem convergents'Aux_succ_none {s : SeqCat (Pair K)} (h : s.headI = none) (n : ℕ) :
+theorem convergents'Aux_succ_none {s : Seq (Pair K)} (h : s.headI = none) (n : ℕ) :
     convergents'Aux s (n + 1) = 0 := by rw [convergents'_aux, h, convergents'_aux._match_1]
 #align generalized_continued_fraction.convergents'_aux_succ_none GeneralizedContinuedFraction.convergents'Aux_succ_none
 
-theorem convergents'Aux_succ_some {s : SeqCat (Pair K)} {p : Pair K} (h : s.headI = some p)
-    (n : ℕ) : convergents'Aux s (n + 1) = p.a / (p.b + convergents'Aux s.tail n) := by
+theorem convergents'Aux_succ_some {s : Seq (Pair K)} {p : Pair K} (h : s.headI = some p) (n : ℕ) :
+    convergents'Aux s (n + 1) = p.a / (p.b + convergents'Aux s.tail n) := by
   rw [convergents'_aux, h, convergents'_aux._match_1]
 #align generalized_continued_fraction.convergents'_aux_succ_some GeneralizedContinuedFraction.convergents'Aux_succ_some
 

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

Classifies by adding issue number #10959 porting notes claiming anything semantically equivalent to:

• "simp cannot prove this"
• "simp used to be able to close this goal"
• "simp can't handle this"
• "simp used to work here"

@@ -154,7 +154,7 @@ theorem second_continuant_aux_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some
 theorem first_continuant_eq {gp : Pair K} (zeroth_s_eq : g.s.get? 0 = some gp) :
     g.continuants 1 = ⟨gp.b * g.h + gp.a, gp.b⟩ := by
   simp [nth_cont_eq_succ_nth_cont_aux]
-  -- porting note: simp used to work here, but now it can't figure out that 1 + 1 = 2
+  -- Porting note (#10959): simp used to work here, but now it can't figure out that 1 + 1 = 2
   convert second_continuant_aux_eq zeroth_s_eq
 #align generalized_continued_fraction.first_continuant_eq GeneralizedContinuedFraction.first_continuant_eq
 

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

@@ -80,7 +80,7 @@ section WithDivisionRing
 /-!
 ### Translations Between Computational Functions
 
-Here we  give some basic translations that hold by definition for the computational methods of a
+Here we give some basic translations that hold by definition for the computational methods of a
 continued fraction.
 -/
 

Slightly delay the import of Mathlib.Algebra.Group.Basic, to reduce imports for tactics.

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

@@ -4,6 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Kevin Kappelmann
 -/
 import Mathlib.Algebra.ContinuedFractions.Basic
+import Mathlib.Algebra.GroupWithZero.Basic
 
 #align_import algebra.continued_fractions.translations from "leanprover-community/mathlib"@"a7e36e48519ab281320c4d192da6a7b348ce40ad"
 

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

This has nice performance benefits.

@@ -29,7 +29,7 @@ us to access the numerators and denominators of a continued fraction.
 -/
 
 
-variable {α : Type _} {g : GeneralizedContinuedFraction α} {n : ℕ}
+variable {α : Type*} {g : GeneralizedContinuedFraction α} {n : ℕ}
 
 theorem terminatedAt_iff_s_terminatedAt : g.TerminatedAt n ↔ g.s.TerminatedAt n := by rfl
 #align generalized_continued_fraction.terminated_at_iff_s_terminated_at GeneralizedContinuedFraction.terminatedAt_iff_s_terminatedAt
@@ -84,7 +84,7 @@ continued fraction.
 -/
 
 
-variable {K : Type _} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
+variable {K : Type*} {g : GeneralizedContinuedFraction K} {n : ℕ} [DivisionRing K]
 
 theorem nth_cont_eq_succ_nth_cont_aux : g.continuants n = g.continuantsAux (n + 1) :=
   rfl

• depends on: #5966

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

@@ -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.translations
-! leanprover-community/mathlib commit a7e36e48519ab281320c4d192da6a7b348ce40ad
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.ContinuedFractions.Basic
 
+#align_import algebra.continued_fractions.translations from "leanprover-community/mathlib"@"a7e36e48519ab281320c4d192da6a7b348ce40ad"
+
 /-!
 # Basic Translation Lemmas Between Functions Defined for Continued Fractions
 

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