Documentation

Mathlib.Analysis.SpecialFunctions.Complex.CircleMap

circleMap #

This file defines the circle map $θ ↦ c + R e^{θi}$, a parametrization of a circle.

Main definitions #

Tags #

noncomputable def circleMap (c : ℂ) (R : ℝ) :
ℝ → ℂ

The exponential map $θ ↦ c + R e^{θi}$. The range of this map is the circle in ℂ with center c and radius |R|.

Equations
Instances For
    @[simp]
    theorem circleMap_sub_center (c : ℂ) (R θ : ℝ) :
    circleMap c R θ - c = circleMap 0 R θ
    theorem circleMap_zero (R θ : ℝ) :
    circleMap 0 R θ = ↑R * Complex.exp (↑θ * Complex.I)
    @[simp]
    theorem norm_circleMap_zero (R θ : ℝ) :
    theorem circleMap_notMem_ball (c : ℂ) (R θ : ℝ) :
    circleMap c R θ ∉ Metric.ball c R
    theorem circleMap_ne_mem_ball {c : ℂ} {R : ℝ} {w : ℂ} (hw : w ∈ Metric.ball c R) (θ : ℝ) :
    circleMap c R θ ≠ w
    theorem circleMap_mem_sphere' (c : ℂ) (R θ : ℝ) :
    theorem circleMap_mem_sphere (c : ℂ) {R : ℝ} (hR : 0 ≤ R) (θ : ℝ) :
    theorem circleMap_mem_closedBall (c : ℂ) {R : ℝ} (hR : 0 ≤ R) (θ : ℝ) :
    @[simp]
    theorem circleMap_eq_center_iff {c : ℂ} {R θ : ℝ} :
    circleMap c R θ = c ↔ R = 0
    theorem circleMap_ne_center {c : ℂ} {R : ℝ} (hR : R ≠ 0) {θ : ℝ} :
    circleMap c R θ ≠ c
    theorem circleMap_zero_mul (R₁ R₂ θ₁ θ₂ : ℝ) :
    circleMap 0 R₁ θ₁ * circleMap 0 R₂ θ₂ = circleMap 0 (R₁ * R₂) (θ₁ + θ₂)
    theorem circleMap_zero_div (R₁ R₂ θ₁ θ₂ : ℝ) :
    circleMap 0 R₁ θ₁ / circleMap 0 R₂ θ₂ = circleMap 0 (R₁ / R₂) (θ₁ - θ₂)
    theorem circleMap_zero_inv (R θ : ℝ) :
    (circleMap 0 R θ)⁻¹ = circleMap 0 R⁻¹ (-θ)
    theorem circleMap_zero_pow (n : ℕ) (R θ : ℝ) :
    circleMap 0 R θ ^ n = circleMap 0 (R ^ n) (↑n * θ)
    theorem circleMap_zero_zpow (n : ℤ) (R θ : ℝ) :
    circleMap 0 R θ ^ n = circleMap 0 (R ^ n) (↑n * θ)
    theorem circleMap_pi_div_two (c : ℂ) (R : ℝ) :
    circleMap c R (Real.pi / 2) = c + ↑R * Complex.I
    theorem circleMap_neg_pi_div_two (c : ℂ) (R : ℝ) :
    circleMap c R (-Real.pi / 2) = c - ↑R * Complex.I

    circleMap is 2π-periodic.

    theorem Set.Countable.preimage_circleMap {s : Set ℂ} (hs : s.Countable) (c : ℂ) {R : ℝ} (hR : R ≠ 0) :
    theorem circleMap_eq_circleMap_iff {a b R : ℝ} (c : ℂ) (h_R : R ≠ 0) :
    circleMap c R a = circleMap c R b ↔ ∃ (n : ℤ), ↑a * Complex.I = ↑b * Complex.I + ↑n * (2 * ↑Real.pi * Complex.I)
    theorem eq_of_circleMap_eq {a b R : ℝ} {c : ℂ} (h_R : R ≠ 0) (h_dist : |a - b| < 2 * Real.pi) (h : circleMap c R a = circleMap c R b) :
    a = b
    theorem injOn_circleMap_of_abs_sub_le {a b R : ℝ} {c : ℂ} (h_R : R ≠ 0) :
    |a - b| ≤ 2 * Real.pi → Set.InjOn (circleMap c R) (Set.uIoc a b)

    circleMap is injective on Ι a b if the distance between a and b is at most 2π.

    theorem injOn_circleMap_of_abs_sub_le' {a b R : ℝ} {c : ℂ} (h_R : R ≠ 0) :
    b - a ≤ 2 * Real.pi → Set.InjOn (circleMap c R) (Set.Ico a b)

    circleMap is injective on Ico a b if the distance between a and b is at most 2π.