@@ -16,17 +16,17 @@ In this file we present a proof of Hadamard's three-lines Theorem.
1616## Main result
1717
1818- `norm_le_interp_of_mem_verticalClosedStrip` :
19- Hadamard three-line theorem: If `f` is a bounded function, continuous on
20- `re ⁻¹' [l, u]` and differentiable on `re ⁻¹' (l, u)`, then for
21- `M(x) := sup ((norm ∘ f) '' (re ⁻¹' {x}))`, that is `M(x)` is the supremum of the absolute value of
22- `f` along the vertical lines `re z = x`, we have that `∀ z ∈ re ⁻¹' [l, u]` the inequality
23- `‖f(z)‖ ≤ M(0) ^ (1 - ((z.re - l) / (u - l))) * M(1) ^ ((z.re - l) / (u - l))` holds.
24- This can be seen to be equivalent to the statement
25- that `log M(re z)` is a convex function on `[0, 1]`.
19+ Hadamard three-line theorem: If `f` is a bounded function, continuous on
20+ `re ⁻¹' [l, u]` and differentiable on `re ⁻¹' (l, u)`, then for
21+ `M(x) := sup ((norm ∘ f) '' (re ⁻¹' {x}))`, that is `M(x)` is the supremum of the absolute value
22+ of `f` along the vertical lines `re z = x`, we have that `∀ z ∈ re ⁻¹' [l, u]` the inequality
23+ `‖f(z)‖ ≤ M(0) ^ (1 - ((z.re - l) / (u - l))) * M(1) ^ ((z.re - l) / (u - l))` holds.
24+ This can be seen to be equivalent to the statement
25+ that `log M(re z)` is a convex function on `[0, 1]`.
2626
2727- `norm_le_interp_of_mem_verticalClosedStrip'` :
28- Variant of the above lemma in simpler terms. In particular, it makes no mention of the helper
29- functions defined in this file.
28+ Variant of the above lemma in simpler terms. In particular, it makes no mention of the helper
29+ functions defined in this file.
3030
3131 ## Main definitions
3232
0 commit comments