Each factor of has modulus at most one
ProvedMartingale.norm_exp_div_one_add_I_mul_le_oneFor real and ,
Both halves are immediate. The numerator has modulus exactly , being the exponential of a purely imaginary number. The denominator has modulus at least , since — the real part is exactly and the imaginary part exactly . In particular the denominator never vanishes, so the quotient is always defined and no side condition is needed.
Where it is used. McLeish's proof decomposes and, after factorising, . The aggregation step — which converts per-factor estimates into a bound on the difference of two products — requires all factors to have modulus at most , since otherwise perturbations compound multiplicatively rather than adding. This lemma supplies that hypothesis for the factors of ; the comparison factors satisfy it trivially, being exponentials of nonpositive reals.
It also yields for the whole product, which together with the boundedness of after truncation is what makes the error term uniformly integrable.
import Mathlib.Analysis.SpecialFunctions.Complex.Circle
theorem Martingale.norm_exp_div_one_add_I_mul_le_one (θ z : ℝ) :
‖Complex.exp (Complex.I * θ * (z : ℂ)) / (1 + Complex.I * θ * (z : ℂ))‖ ≤ 1 := by sorry