Theorems · Inductive type · number theory
GenContFract
Type u_1 → Type u_1
A generalised continued fraction (gcf) is a potentially infinite expression of the form
$$
h + \dfrac{a_0}
{b_0 + \dfrac{a_1}
{b_1 + \dfrac{a_2}
{b_2 + \dfrac{a_3}
{b_3 + \dots}}}}
$$
where h is called the head term or integer part, the aᵢ are called the
partial numerators and the bᵢ the partial denominators of the gcf.
We store the sequence of partial numerators and denominators in a sequence of GenContFract.Pairs
s.
For convenience, one often writes [h; (a₀, b₀), (a₁, b₁), (a₂, b₂),...].
- Defined in
- Mathlib.Algebra.ContinuedFractions.Basic
- Cited by
- 68 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by92
Results whose statement or proof uses this declaration.
- GenContFract.sstatement and proof · cited by 57
- GenContFract.ofstatement and proof · cited by 53
- GenContFract.TerminatedAtstatement and proof · cited by 30
- GenContFract.hstatement and proof · cited by 23
- GenContFract.convsstatement and proof · cited by 22
- GenContFract.contsAuxstatement and proof · cited by 20
- GenContFract.densstatement and proof · cited by 19
- GenContFract.contsstatement and proof · cited by 18
- GenContFract.partDensstatement and proof · cited by 13
- GenContFract.numsstatement and proof · cited by 12
- GenContFract.convs'statement and proof · cited by 9
- GenContFract.contsAux_recurrencestatement and proof · cited by 8