Loogle!
Result
Found 29 declarations mentioning GenContFract.IntFractPair.stream.
- GenContFract.IntFractPair.stream ๐ Mathlib.Algebra.ContinuedFractions.Computation.Basic
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] (v : K) : Stream' (Option (GenContFract.IntFractPair K)) - GenContFract.IntFractPair.stream_isSeq ๐ Mathlib.Algebra.ContinuedFractions.Computation.Basic
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] (v : K) : (GenContFract.IntFractPair.stream v).IsSeq - GenContFract.IntFractPair.stream_zero ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] (v : K) : GenContFract.IntFractPair.stream v 0 = some (GenContFract.IntFractPair.of v) - GenContFract.of_terminatedAt_n_iff_succ_nth_intFractPair_stream_eq_none ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} : (GenContFract.of v).TerminatedAt n โ GenContFract.IntFractPair.stream v (n + 1) = none - GenContFract.IntFractPair.get?_seq1_eq_succ_get?_stream ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} : (GenContFract.IntFractPair.seq1 v).2.get? n = GenContFract.IntFractPair.stream v (n + 1) - GenContFract.IntFractPair.stream_succ_of_int ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] [IsStrictOrderedRing K] (a : โค) (n : โ) : GenContFract.IntFractPair.stream (โa) (n + 1) = none - GenContFract.IntFractPair.stream_eq_none_of_fr_eq_zero ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {ifp_n : GenContFract.IntFractPair K} (stream_nth_eq : GenContFract.IntFractPair.stream v n = some ifp_n) (nth_fr_eq_zero : ifp_n.fr = 0) : GenContFract.IntFractPair.stream v (n + 1) = none - GenContFract.IntFractPair.exists_succ_get?_stream_of_gcf_of_get?_eq_some ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {gp_n : GenContFract.Pair K} (s_nth_eq : (GenContFract.of v).s.get? n = some gp_n) : โ ifp, GenContFract.IntFractPair.stream v (n + 1) = some ifp โง โifp.b = gp_n.b - GenContFract.get?_of_eq_some_of_succ_get?_intFractPair_stream ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {ifp_succ_n : GenContFract.IntFractPair K} (stream_succ_nth_eq : GenContFract.IntFractPair.stream v (n + 1) = some ifp_succ_n) : (GenContFract.of v).s.get? n = some { a := 1, b := โifp_succ_n.b } - GenContFract.of_s_head_aux ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] (v : K) : (GenContFract.of v).s.get? 0 = (GenContFract.IntFractPair.stream v 1).bind (some โ fun p => { a := 1, b := โp.b }) - GenContFract.IntFractPair.stream_succ ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} (h : Int.fract v โ 0) (n : โ) : GenContFract.IntFractPair.stream v (n + 1) = GenContFract.IntFractPair.stream (Int.fract v)โปยน n - GenContFract.IntFractPair.succ_nth_stream_eq_none_iff ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} : GenContFract.IntFractPair.stream v (n + 1) = none โ GenContFract.IntFractPair.stream v n = none โจ โ ifp, GenContFract.IntFractPair.stream v n = some ifp โง ifp.fr = 0 - GenContFract.IntFractPair.stream_succ_of_some ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {p : GenContFract.IntFractPair K} (h : GenContFract.IntFractPair.stream v n = some p) (h' : p.fr โ 0) : GenContFract.IntFractPair.stream v (n + 1) = some (GenContFract.IntFractPair.of p.frโปยน) - GenContFract.IntFractPair.succ_nth_stream_eq_some_iff ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {ifp_succ_n : GenContFract.IntFractPair K} : GenContFract.IntFractPair.stream v (n + 1) = some ifp_succ_n โ โ ifp_n, GenContFract.IntFractPair.stream v n = some ifp_n โง ifp_n.fr โ 0 โง GenContFract.IntFractPair.of ifp_n.frโปยน = ifp_succ_n - GenContFract.get?_of_eq_some_of_get?_intFractPair_stream_fr_ne_zero ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {ifp_n : GenContFract.IntFractPair K} (stream_nth_eq : GenContFract.IntFractPair.stream v n = some ifp_n) (nth_fr_ne_zero : ifp_n.fr โ 0) : (GenContFract.of v).s.get? n = some { a := 1, b := โ(GenContFract.IntFractPair.of ifp_n.frโปยน).b } - GenContFract.IntFractPair.exists_succ_nth_stream_of_fr_zero ๐ Mathlib.Algebra.ContinuedFractions.Computation.Translations
{K : Type u_1} [DivisionRing K] [LinearOrder K] [FloorRing K] {v : K} {n : โ} {ifp_succ_n : GenContFract.IntFractPair K} (stream_succ_nth_eq : GenContFract.IntFractPair.stream v (n + 1) = some ifp_succ_n) (succ_nth_fr_eq_zero : ifp_succ_n.fr = 0) : โ ifp_n, GenContFract.IntFractPair.stream v n = some ifp_n โง ifp_n.frโปยน = โโifp_n.frโปยนโ - GenContFract.of_correctness_of_nth_stream_eq_none ๐ Mathlib.Algebra.ContinuedFractions.Computation.CorrectnessTerminating
{K : Type u_1} [Field K] [LinearOrder K] {v : K} {n : โ} [FloorRing K] (nth_stream_eq_none : GenContFract.IntFractPair.stream v n = none) : v = (GenContFract.of v).convs (n - 1) - GenContFract.compExactValue_correctness_of_stream_eq_some ๐ Mathlib.Algebra.ContinuedFractions.Computation.CorrectnessTerminating
{K : Type u_1} [Field K] [LinearOrder K] {v : K} {n : โ} [FloorRing K] {ifp_n : GenContFract.IntFractPair K} : GenContFract.IntFractPair.stream v n = some ifp_n โ v = GenContFract.compExactValue ((GenContFract.of v).contsAux n) ((GenContFract.of v).contsAux (n + 1)) ifp_n.fr - GenContFract.IntFractPair.one_le_succ_nth_stream_b ๐ Mathlib.Algebra.ContinuedFractions.Computation.Approximations
{K : Type u_1} {v : K} {n : โ} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [FloorRing K] {ifp_succ_n : GenContFract.IntFractPair K} (succ_nth_stream_eq : GenContFract.IntFractPair.stream v (n + 1) = some ifp_succ_n) : 1 โค ifp_succ_n.b - GenContFract.IntFractPair.nth_stream_fr_lt_one ๐ Mathlib.Algebra.ContinuedFractions.Computation.Approximations
{K : Type u_1} {v : K} {n : โ} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [FloorRing K] {ifp_n : GenContFract.IntFractPair K} (nth_stream_eq : GenContFract.IntFractPair.stream v n = some ifp_n) : ifp_n.fr < 1 - GenContFract.IntFractPair.nth_stream_fr_nonneg ๐ Mathlib.Algebra.ContinuedFractions.Computation.Approximations
{K : Type u_1} {v : K} {n : โ} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [FloorRing K] {ifp_n : GenContFract.IntFractPair K} (nth_stream_eq : GenContFract.IntFractPair.stream v n = some ifp_n) : 0 โค ifp_n.fr - GenContFract.IntFractPair.succ_nth_stream_b_le_nth_stream_fr_inv ๐ Mathlib.Algebra.ContinuedFractions.Computation.Approximations
{K : Type u_1} {v : K} {n : โ} [Field K] [LinearOrder K] [FloorRing K] {ifp_n ifp_succ_n : GenContFract.IntFractPair K} (nth_stream_eq : GenContFract.IntFractPair.stream v n = some ifp_n) (succ_nth_stream_eq : GenContFract.IntFractPair.stream v (n + 1) = some ifp_succ_n) : โifp_succ_n.b โค ifp_n.frโปยน - GenContFract.IntFractPair.nth_stream_fr_nonneg_lt_one ๐ Mathlib.Algebra.ContinuedFractions.Computation.Approximations
{K : Type u_1} {v : K} {n : โ} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [FloorRing K] {ifp_n : GenContFract.IntFractPair K} (nth_stream_eq : GenContFract.IntFractPair.stream v n = some ifp_n) : 0 โค ifp_n.fr โง ifp_n.fr < 1 - GenContFract.sub_convs_eq ๐ Mathlib.Algebra.ContinuedFractions.Computation.Approximations
{K : Type u_1} {v : K} {n : โ} [Field K] [LinearOrder K] [IsStrictOrderedRing K] [FloorRing K] {ifp : GenContFract.IntFractPair K} (stream_nth_eq : GenContFract.IntFractPair.stream v n = some ifp) : have g := GenContFract.of v; have B := (g.contsAux (n + 1)).b; have pB := (g.contsAux n).b; v - g.convs n = if ifp.fr = 0 then 0 else (-1) ^ n / (B * (ifp.frโปยน * B + pB)) - GenContFract.IntFractPair.exists_nth_stream_eq_none_of_rat ๐ Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat
(q : โ) : โ n, GenContFract.IntFractPair.stream q n = none - GenContFract.IntFractPair.stream_nth_fr_num_le_fr_num_sub_n_rat ๐ Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat
{q : โ} {n : โ} {ifp_n : GenContFract.IntFractPair โ} : GenContFract.IntFractPair.stream q n = some ifp_n โ ifp_n.fr.num โค (GenContFract.IntFractPair.of q).fr.num - โn - GenContFract.IntFractPair.stream_succ_nth_fr_num_lt_nth_fr_num_rat ๐ Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat
{q : โ} {n : โ} {ifp_n ifp_succ_n : GenContFract.IntFractPair โ} (stream_nth_eq : GenContFract.IntFractPair.stream q n = some ifp_n) (stream_succ_nth_eq : GenContFract.IntFractPair.stream q (n + 1) = some ifp_succ_n) : ifp_succ_n.fr.num < ifp_n.fr.num - GenContFract.IntFractPair.coe_stream_nth_rat_eq ๐ Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat
{K : Type u_1} [Field K] [LinearOrder K] [FloorRing K] [IsStrictOrderedRing K] {v : K} {q : โ} (v_eq_q : v = โq) (n : โ) : Option.map (GenContFract.IntFractPair.mapFr Rat.cast) (GenContFract.IntFractPair.stream q n) = GenContFract.IntFractPair.stream v n - GenContFract.IntFractPair.coe_stream'_rat_eq ๐ Mathlib.Algebra.ContinuedFractions.Computation.TerminatesIffRat
{K : Type u_1} [Field K] [LinearOrder K] [FloorRing K] [IsStrictOrderedRing K] {v : K} {q : โ} (v_eq_q : v = โq) : Stream'.map (Option.map (GenContFract.IntFractPair.mapFr Rat.cast)) (GenContFract.IntFractPair.stream q) = GenContFract.IntFractPair.stream v
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
๐Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
๐"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
๐_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
๐Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
๐(?a -> ?b) -> List ?a -> List ?b
๐List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
๐|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allโandโ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
๐|- _ < _ โ tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
โข (_ : Type _)finds all definitions which provide data whileโข (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
๐ Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ โ _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c