AFTD Auto-Formalizing Theoretical Domains

redistribution_disk_to_halfplane_im_pos

theoremverified

For positive y, every point of the open unit disk has a disk-map image of strictly positive imaginary part.

Statement

theorem redistribution_disk_to_halfplane_im_pos
    (y : ℝ) (hy : 0 < y) (z : ℂ) (hz : ‖z‖ < 1) :
    0 < (redistribution_disk_to_halfplane y z).im
Source
Uniform helper for IN-251, the proof of arXiv:2610.10995 Lemmas4.2/4.3. The disk logarithmic mean theorem and logarithm series already exist in the installed Mathlib; the upper-half-plane boundary passage, singular cosine integral and main harmonic bound remain unresolved. No research advance.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

The proof, explained

The proof expresses the imaginary part of the disk-to-half-plane map as the quotient y * (1 - ‖z‖²) / ‖1 - z‖². Because z lies in the open unit disk (‖z‖ < 1), both y and 1 - ‖z‖² are strictly positive, making the numerator positive. Moreover, ‖z‖ < 1 implies z ≠ 1, so the denominator is the squared norm of a non-zero complex number and thus also strictly positive. The quotient of two strictly positive real numbers is strictly positive, concluding the proof.

  1. The imaginary part of the mapped point is expressed as the quotient y * (1 - Complex.normSq z) / Complex.normSq (1 - z).

    Rewriting with redistribution_disk_to_halfplane_im replaces the imaginary part of the map with the explicit formula y * (1 - Complex.normSq z) / Complex.normSq (1 - z).

    line 6

    uses redistribution_disk_to_halfplane_im

      rw [redistribution_disk_to_halfplane_im]
  2. z ≠ 1

    Assume for contradiction that z = 1. Then ‖z‖ = ‖1‖ = 1 by norm_one, which contradicts the hypothesis ‖z‖ < 1. Linear arithmetic detects this contradiction and closes the branch.

    lines 7–10

    uses norm_one

      have hz1 : z ≠ 1 := by
        intro he
        rw [he, norm_one] at hz
        linarith
  3. Complex.normSq z < 1

    By Complex.normSq_eq_norm_sq, Complex.normSq z = ‖z‖ ^ 2. Since 0 ≤ ‖z‖ by norm_nonneg and ‖z‖ < 1 by assumption, nonlinear arithmetic shows that ‖z‖ ^ 2 < 1.

    lines 11–13

    uses Complex.normSq_eq_norm_sq, norm_nonneg

      have hsq : Complex.normSq z < 1 := by
        rw [Complex.normSq_eq_norm_sq]
        nlinarith [norm_nonneg z]
  4. The quotient y * (1 - Complex.normSq z) / Complex.normSq (1 - z) is strictly positive, completing the proof.

    The numerator is strictly positive because y > 0 and 1 - Complex.normSq z > 0 (via sub_pos.mpr applied to Complex.normSq z < 1). The denominator Complex.normSq (1 - z) is strictly positive via Complex.normSq_pos.mpr because z ≠ 1 implies 1 - z ≠ 0. Finally, div_pos ensures that the ratio of two positive numbers is strictly positive.

    lines 14–15

    uses div_pos, mul_pos, sub_pos.mpr, Complex.normSq_pos.mpr, sub_ne_zero.mpr, Ne.symm

      apply div_pos (mul_pos hy (sub_pos.mpr hsq))
      exact Complex.normSq_pos.mpr (sub_ne_zero.mpr (Ne.symm hz1))
redistribution_disk_to_halfplane_im
The imaginary part of redistribution_disk_to_halfplane y z equals y * (1 - Complex.normSq z) / Complex.normSq (1 - z).
norm_one
The norm of 1 is 1.
Complex.normSq_eq_norm_sq
For any complex number z, its squared norm Complex.normSq z equals ‖z‖ ^ 2.
norm_nonneg
The norm of any element is non-negative: 0 ≤ ‖a‖.
div_pos
A quotient a / b is strictly positive if both a and b are strictly positive.
mul_pos
A product a * b is strictly positive if both a and b are strictly positive.
sub_pos.mpr
If b < a, then 0 < a - b.
Complex.normSq_pos.mpr
If a complex number is non-zero, its squared norm is strictly positive.
sub_ne_zero.mpr
If a ≠ b, then a - b ≠ 0.
Ne.symm
Inequality is symmetric: if a ≠ b, then b ≠ a.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

open Finset Real MeasureTheory Metric MeromorphicOntheorem redistribution_disk_to_halfplane_im_pos    (y : ℝ) (hy : 0 < y) (z : ℂ) (hz : ‖z‖ < 1) :    0 < (redistribution_disk_to_halfplane y z).im := by  rw [redistribution_disk_to_halfplane_im]  have hz1 : z ≠ 1 := by    intro he    rw [he, norm_one] at hz    linarith  have hsq : Complex.normSq z < 1 := by    rw [Complex.normSq_eq_norm_sq]    nlinarith [norm_nonneg z]  apply div_pos (mul_pos hy (sub_pos.mpr hsq))  exact Complex.normSq_pos.mpr (sub_ne_zero.mpr (Ne.symm hz1))
See it in the graphDiscuss this resultChallenge it