Documentation

Mathlib.Analysis.Normed.Field.WithAbs

WithAbs for fields #

This extends the WithAbs mechanism to fields, providing a type synonym for a field which depends on an absolute value. This is useful when dealing with several absolute values on the same field.

In particular this allows us to define the completion of a field at a given absolute value.

@[instance_reducible]
instance WithAbs.instField {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] (v : AbsoluteValue R S) :
Equations
  • One or more equations did not get rendered due to their size.
@[instance_reducible]
noncomputable instance WithAbs.normedField {R : Type u_1} [Field R] (v : AbsoluteValue R ℝ) :
Equations
instance WithAbs.instFiniteDimensional {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] {T : Type u_3} [Field T] (v : AbsoluteValue R S) [Module R T] [FiniteDimensional R T] :
instance WithAbs.instFiniteDimensional_1 {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] {T : Type u_3} [Field T] (v : AbsoluteValue R S) [Module T R] [FiniteDimensional T R] :
instance WithAbs.instIsSeparable {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] {T : Type u_3} [Field T] (v : AbsoluteValue R S) [Algebra R T] [Algebra.IsSeparable R T] :
instance WithAbs.instIsSeparable_1 {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] {T : Type u_3} [Field T] (v : AbsoluteValue R S) [Algebra T R] [Algebra.IsSeparable T R] :
@[simp]
theorem WithAbs.toAbs_div {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] (v : AbsoluteValue R S) (x y : R) :
toAbs v (x / y) = toAbs v x / toAbs v y
@[simp]
theorem WithAbs.ofAbs_div {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] (v : AbsoluteValue R S) (x y : WithAbs v) :
(x / y).ofAbs = x.ofAbs / y.ofAbs
@[simp]
theorem WithAbs.toAbs_inv {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] (v : AbsoluteValue R S) (x : R) :
@[simp]
theorem WithAbs.ofAbs_inv {R : Type u_1} {S : Type u_2} [Semiring S] [PartialOrder S] [Field R] (v : AbsoluteValue R S) (x : WithAbs v) :
theorem WithAbs.tendsto_one_div_one_add_pow_nhds_one {R : Type u_1} [Field R] {v : AbsoluteValue R ℝ} {a : R} (ha : v a < 1) :
Filter.Tendsto (fun (n : ℕ) => (equiv v).symm (1 / (1 + a ^ n))) Filter.atTop (nhds 1)
theorem WithAbs.isometry_map {K : Type u_3} {L : Type u_4} [Field K] [Field L] [Algebra K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] :
Isometry ⇑(map v w (algebraMap K L))

The completion of a field at an absolute value. #

structure AbsoluteValue.Completion {K : Type u_2} [Field K] (v : AbsoluteValue K ℝ) :
Type u_2

The completion of a field with respect to a real absolute value, as a one-field structure wrapping the uniform-space completion of WithAbs v.

Instances For

    Auxiliary equivalence used to transport instances to v.Completion. Use equiv instead.

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

      Completion.toCompletion and Completion.ofCompletion as an equivalence.

      Equations
      Instances For

        Completion.toCompletion as an isometry equivalence onto the underlying completion.

        Equations
        Instances For
          @[instance_reducible]
          Equations
          noncomputable def AbsoluteValue.Completion.coe {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} (x : WithAbs v) :

          The coercion from WithAbs v to v.Completion.

          Equations
          Instances For
            @[instance_reducible]
            noncomputable instance AbsoluteValue.Completion.instCoeWithAbsReal {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} :

            Coercion of an element of WithAbs v into the completion.

            Equations
            @[simp]
            @[simp]
            @[simp]
            theorem AbsoluteValue.Completion.coe_zero {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} :
            ↑0 = 0
            @[simp]
            theorem AbsoluteValue.Completion.coe_one {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} :
            ↑1 = 1
            @[simp]
            theorem AbsoluteValue.Completion.coe_add {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} (x y : WithAbs v) :
            ↑(x + y) = ↑x + ↑y
            @[simp]
            theorem AbsoluteValue.Completion.coe_mul {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} (x y : WithAbs v) :
            ↑(x * y) = ↑x * ↑y
            @[simp]
            theorem AbsoluteValue.Completion.coe_neg {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} (x : WithAbs v) :
            ↑(-x) = -↑x
            @[simp]
            theorem AbsoluteValue.Completion.coe_sub {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} (x y : WithAbs v) :
            ↑(x - y) = ↑x - ↑y
            @[simp]
            theorem AbsoluteValue.Completion.coe_inv {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} (x : WithAbs v) :
            ↑x⁻¹ = (↑x)⁻¹
            theorem AbsoluteValue.Completion.induction_on {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} {p : v.Completion → Prop} (x : v.Completion) (hp : IsClosed {x : v.Completion | p x}) (ih : ∀ (a : WithAbs v), p ↑a) :
            p x

            Induction on the completion of a field at an absolute value: a closed property that holds on the image of K holds everywhere.

            theorem AbsoluteValue.Completion.ext {K : Type u_2} [Field K] {v : AbsoluteValue K ℝ} {Y : Type u_4} [TopologicalSpace Y] [T2Space Y] {f g : v.Completion → Y} (hf : Continuous f) (hg : Continuous g) (h : ∀ (a : WithAbs v), f ↑a = g ↑a) :
            f = g

            Two continuous functions out of v.Completion into a Hausdorff space that agree on K are equal.

            @[instance_reducible]
            Equations
            • One or more equations did not get rendered due to their size.
            noncomputable def AbsoluteValue.Completion.map {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] :

            If w lies over v, then the ring homomorphism v.Completion →+* w.Completion induced by algebraMap K L.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              theorem AbsoluteValue.Completion.isometry_map {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] :
              Isometry ⇑(map v w)
              theorem AbsoluteValue.Completion.continuous_map {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] :
              Continuous ⇑(map v w)
              @[simp]
              theorem AbsoluteValue.Completion.map_coe {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] (x : WithAbs v) :
              (map v w) ↑x = ↑((WithAbs.map v w (algebraMap K L)) x)
              @[simp]
              theorem AbsoluteValue.Completion.map_comp_map {J : Type u_1} {K : Type u_2} {L : Type u_3} [Field J] [Field K] [Field L] [Algebra J K] [Algebra J L] [Algebra K L] [IsScalarTower J K L] (u : AbsoluteValue J ℝ) (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [v.LiesOver u] [w.LiesOver u] [w.LiesOver v] :
              (map v w).comp (map u v) = map u w
              @[simp]
              theorem AbsoluteValue.Completion.map_map {J : Type u_1} {K : Type u_2} {L : Type u_3} [Field J] [Field K] [Field L] [Algebra J K] [Algebra J L] [Algebra K L] [IsScalarTower J K L] (u : AbsoluteValue J ℝ) (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [v.LiesOver u] [w.LiesOver u] [w.LiesOver v] (x : u.Completion) :
              (map v w) ((map u v) x) = (map u w) x
              @[instance_reducible]
              noncomputable def AbsoluteValue.Completion.algebraOfLiesOver {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] :

              If w lies over v with completions K_v and L_w, then there is a unique K_v-algebra structure on L_w satisfying both IsScalarTower K K_v L_w and ContinuousSMul K_v L_w, see AbsoluteValue.Completion.algebraMap_eq_of_liesOver and AbsoluteValue.Completion.algebra_eq_of_liesOver.

              Equations
              Instances For
                @[deprecated AbsoluteValue.Completion.algebraMap_eq_of_liesOver (since := "2026-10-28")]

                Alias of AbsoluteValue.Completion.algebraMap_eq_of_liesOver.

                @[deprecated AbsoluteValue.Completion.algebraMap_apply_of_liesOver (since := "2026-10-28")]

                Alias of AbsoluteValue.Completion.algebraMap_apply_of_liesOver.

                @[deprecated AbsoluteValue.Completion.algebra_eq_of_liesOver (since := "2026-10-28")]

                Alias of AbsoluteValue.Completion.algebra_eq_of_liesOver.

                If the absolute value of a normed field factors through an embedding into another normed field that is locally compact, then the completion of the first normed field is also locally compact.

                noncomputable def AbsoluteValue.degree (K : Type u_2) {L : Type u_3} [Field K] [Field L] [Algebra K L] (w : AbsoluteValue L ℝ) :

                The degree of an extension of absolute values is the degree of their completions.

                Equations
                Instances For
                  theorem AbsoluteValue.degree_mul_degree {J : Type u_1} {K : Type u_2} {L : Type u_3} [Field J] [Field K] [Field L] [Algebra J K] [Algebra J L] [Algebra K L] [IsScalarTower J K L] (v : AbsoluteValue K ℝ) (w : AbsoluteValue L ℝ) [w.LiesOver v] :
                  degree J v * degree K w = degree J w