Theorems · Theorem · number theory

GenContFract.conts_recurrenceAux

∀ {K : Type u_1} {g : GenContFract K} {n : ℕ} [inst : DivisionRing K] {gp ppred pred : GenContFract.Pair K},
  g.s.get? n = some gp →
    g.contsAux n = ppred →
      g.contsAux (n + 1) = pred →
        g.conts (n + 1) = { a := gp.b * pred.a + gp.a * ppred.a, b := gp.b * pred.b + gp.a * ppred.b }

Defined in

Mathlib.Algebra.ContinuedFractions.ContinuantsRecurrence

Cited by

1 results in Mathlib

Foundations

Depth 51 from the axioms · uses propext, Quot.sound

Assumes

DivisionRing