Documentation

LeanPool.PointwiseComposition.Foundation.FirstOrder.Arithmetic.Exponential.Log

Supporting results for pointwise provable equality.

Logarithmic function #

theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.log_exists_unique {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] (y : V) :
∃! x : V, (y = 0 → x = 0) ∧ (0 < y → x < y ∧ ∃ y' ≤ y, Exponential x y' ∧ y < 2 * y')

The log construction in FFL.FirstOrder.Arithmetic.

Equations
Instances For
    theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.log_pos {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {y : V} (pos : 0 < y) :
    ∃ y' ≤ y, Exponential (log y) y' ∧ y < 2 * y'
    theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.log_graph {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {x y : V} :
    x = log y ↔ (y = 0 → x = 0) ∧ (0 < y → x < y ∧ ∃ y' ≤ y, Exponential x y' ∧ y < 2 * y')

    The log Def construction in FFL.FirstOrder.Arithmetic.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.log_eq_of_pos {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {x y : V} (pos : 0 < y) {y' : V} (H : Exponential x y') (hy' : y' ≤ y) (hy : y < 2 * y') :
      log y = x
      theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.log_mul_pow2_add_of_lt {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {a p b : V} (pos : 0 < a) (pp : Pow2 p) (hb : b < p) :
      log (a * p + b) = log a + log p
      @[instance_reducible]

      The inst Length construction in FFL.FirstOrder.Arithmetic.

      Equations
      Instances For
        theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.length_graph {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {i a : V} :
        i = ‖a‖ ↔ (0 < a → ∃ k ≤ a, k = log a ∧ i = k + 1) ∧ (a = 0 → i = 0)

        The length Def construction in FFL.FirstOrder.Arithmetic.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.bexp_graph {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {y a x : V} :
          y = bexp a x ↔ ∃ l ≤ a, l = ‖a‖ ∧ (x < l → Exponential x y) ∧ (l ≤ x → y = 0)

          The bexp Def construction in FFL.FirstOrder.Arithmetic.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.bexp_monotone {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {a₁ x₁ a₂ x₂ : V} (h₁ : x₁ < ‖a₁‖) (h₂ : x₂ < ‖a₂‖) :
            bexp a₁ x₁ < bexp a₂ x₂ ↔ x₁ < x₂
            theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.bexp_monotone_le {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {a₁ x₁ a₂ x₂ : V} (h₁ : x₁ < ‖a₁‖) (h₂ : x₂ < ‖a₂‖) :
            bexp a₁ x₁ ≤ bexp a₂ x₂ ↔ x₁ ≤ x₂
            theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.bexp_add {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {x₁ x₂ a : V} (h : x₁ + x₂ < ‖a‖) :
            bexp a (x₁ + x₂) = bexp a x₁ * bexp a x₂
            theorem PointwiseComposition.FFL.FirstOrder.Arithmetic.bexp_two_mul {V : Type u_1} [ORingStructure V] [V↓[ℒₒᵣ] ⊧* 𝐈Σ₀] {a a' x : V} (hx : 2 * x < ‖a‖) (hx' : x < ‖a'‖) :
            bexp a (2 * x) = bexp a' x ^ 2

            The fbit construction in FFL.FirstOrder.Arithmetic.

            Equations
            Instances For

              The fbit Def construction in FFL.FirstOrder.Arithmetic.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For