Theory Wirtinger
section ‹Part 1: The Wirtinger inequality›
theory Wirtinger
imports "HOL-Analysis.Rectifiable_Path" "Fourier.Square_Integrable"
begin
text ‹Convex curve lemmas: Switching between views of a convex simple closed curve.›
lemma convex_hull_eq_closure_inside:
fixes g :: "real ⇒ complex"
assumes g: "simple_path g" "pathfinish g = pathstart g"
and conv: "convex (inside (path_image g))"
shows "convex hull (path_image g) = closure (inside (path_image g))"
proof (rule equalityI)
have bounded_inside: "bounded (inside (path_image g))"
and frontier_inside: "frontier (inside (path_image g)) = path_image g"
using Jordan_inside_outside g by blast+
show "convex hull (path_image g) ⊆ closure (inside (path_image g))"
by (metis Diff_subset conv convex_closure frontier_def frontier_inside hull_minimal)
have "compact (closure (inside (path_image g)))"
using compact_closure local.bounded_inside by blast
then show "closure (inside (path_image g)) ⊆ convex hull (path_image g)"
by (metis (no_types, lifting) Krein_Milman_frontier conv closure_closure convex_closure
convex_interior_closure frontier_def frontier_inside order.refl)
qed
lemma frontier_convex_hull_eq_path_image:
fixes g :: "real ⇒ complex"
assumes "simple_path g" "pathfinish g = pathstart g" "convex (inside (path_image g))"
shows "frontier (convex hull (path_image g)) = path_image g"
using Jordan_inside_outside
by (simp add: assms convex_hull_eq_closure_inside convex_interior_closure frontier_def)
lemma frontier_convex_hull_subset_path_image:
fixes g :: "real ⇒ complex"
assumes "simple_path g" "pathfinish g = pathstart g"
"path_image g ⊆ frontier (convex hull (path_image g))"
shows "frontier (convex hull path_image g) ⊆ path_image g"
proof -
have "interior (convex hull (path_image g)) ∩ path_image g = {}"
using assms(3) frontier_def by auto
moreover have "connected (interior (convex hull (path_image g)))"
by (simp add: convex_connected)
moreover have "inside (path_image g) ⊆ convex hull path_image g"
by (metis Un_subset_iff compl_le_swap2 convex_convex_hull hull_subset
outside_subset_convex union_with_inside)
ultimately have int_inside: "interior (convex hull (path_image g)) ⊆ inside (path_image g)"
using Jordan_inside_outside[OF ‹simple_path g›] assms
by (smt (verit) connected_Int_frontier diff_shunt inf.commute interior_Int
interior_eq le_iff_inf)
have "- (convex hull (path_image g)) ⊆ outside (path_image g)"
by (simp add: hull_subset outside_subset_convex)
hence inside_sub: "inside (path_image g) ⊆ convex hull (path_image g)"
by (metis Un_subset_iff compl_le_swap2 union_with_inside)
have "inside (path_image g) ⊆ interior (convex hull (path_image g))"
by (simp add: Jordan_inside_outside assms inside_sub interior_maximal)
with assms show ?thesis
using frontier_convex_hull_eq_path_image int_inside by auto
qed
locale W =
fixes f f' :: "real ⇒ real" and a::real
assumes f'hsd: "⋀x. x ∈ {0..2*pi} ⟹ (f' has_integral (f x - f 0)) {0..x}"
and feq: "f (2*pi) = f 0"
and f0: "(f has_integral 0) {0..2*pi}"
and f'2: "(λx. (f' x)⇧2) integrable_on {0..2*pi}"
and a: "0 ≤ a" "a < pi" "f (a + pi) = f a"
begin
definition g where "g ≡ λx. (f x - f a)⇧2 / tan (x - a)"
definition g' where "g' ≡ λx. (f' x)⇧2 - (f x - f a)⇧2 - (f' x - (f x - f a) / tan (x - a))⇧2"
lemma f': ‹f' integrable_on {0..2*pi}›
using f'hsd [of ‹2*pi›] by fastforce
lemma f'abs: ‹f' absolutely_integrable_on {0..2*pi}›
proof (intro f' absolutely_integrable_integrable_bound)
show ‹norm (f' x) ≤ 1 + (f' x)⇧2› for x
proof -
have ‹0 ≤ (1 - f' x)⇧2› and ‹0 ≤ (1 + f' x)⇧2›
by (auto simp: power2_eq_square)
then show ?thesis
by (auto simp: power2_eq_square abs_le_iff algebra_simps)
qed
show ‹(λx. 1 + (f' x)⇧2) integrable_on {0..2*pi}›
using integrable_add [OF integrable_const_ivl f'2] by simp
qed
lemma contf: ‹continuous_on {0..2*pi} f›
proof (rule continuous_on_eq)
show ‹continuous_on {0..2*pi} (λx. integral {0..x} f' + f 0)›
by (intro continuous_on_add indefinite_integral_continuous_1 [OF f'] continuous_on_const)
show ‹⋀x. x ∈ {0..2*pi} ⟹ integral {0..x} f' + f 0 = f x›
using f'hsd by (auto simp: has_integral_integrable_integral)
qed
text ‹The integral over completely trouble-free intervals.›
lemma trouble_free: "(g' has_integral g d - g c) {c..d}"
if "c ≤ d"
and sub_cd: "{c..d} ⊆ {0..2*pi}"
and sin_nz: "⋀x. x ∈ {c..d} ⟹ sin (x - a) ≠ 0"
for c d
proof -
have f'_int: "((λt. 2 * (f t - f a) * f' t) has_integral
((f x - f a)⇧2 - (f c - f a)⇧2)) {c..x}"
if xcd: "x ∈ {c..d}" for x
proof -
have "c ≤ x" and xd: "x ≤ d" and sub_cx: "{c..x} ⊆ {0..2*pi}"
using xcd ‹c ≤ d› sub_cd by auto
have ac_f: "absolutely_continuous_on {0..2*pi} f"
using absolute_integral_absolutely_continuous_derivative_eq f'abs f'hsd by blast
have ac_sq: "absolutely_continuous_on {c..x} (λt. (f t - f a)⇧2)"
unfolding power2_eq_square using absolutely_continuous_on_subset ac_f sub_cx
by(intro continuous_intros) fastforce+
obtain k where negk: "negligible k"
and derivf: "⋀t. t ∈ {0..2*pi} - k ⟹
((λu. integral {0..u} f') has_vector_derivative f' t) (at t within {0..2*pi})"
using f' has_vector_derivative_indefinite_integral by blast
have deriv_sq: "((λt. (f t - f a)⇧2) has_vector_derivative 2 * (f t - f a) * f' t) (at t within {c..x})"
if "t ∈ {c..x} - k" for t
proof -
have hvd_int: "((λu. integral {0..u} f') has_vector_derivative f' t) (at t within {0..2*pi})"
using derivf that sub_cx by auto
have "((λu. f u - f 0) has_vector_derivative f' t) (at t within {0..2*pi})"
proof (rule has_vector_derivative_transform_within[OF hvd_int])
fix u assume "u ∈ {0..2*pi}" "dist u t < 1"
then show "integral {0..u} f' = f u - f 0"
using f'hsd by blast
qed (use that sub_cx in auto)
then have fderiv: "(f has_vector_derivative f' t) (at t within {c..x})"
using has_vector_derivative_diff_const has_vector_derivative_within_subset sub_cx by blast
then show ?thesis
unfolding power2_eq_square has_vector_derivative_def
by - (rule derivative_eq_intros | simp add: algebra_simps)+
qed
show ?thesis
using fundamental_theorem_of_calculus_absolutely_continuous [OF negk ‹c ≤ x› ac_sq deriv_sq] by simp
qed
text ‹Apply integration by parts with
▪ ‹λx. (f x - f a)²› and its derivative ‹λx. 2 * (f x - f a) * f' x›
▪ ‹λx. inverse (tan (x - a))› and its derivative ‹λx. - inverse (sin (x - a))²››
have ibp_int: "((λx. (f x - f a)⇧2 * (- inverse ((sin (x - a))⇧2)) +
2 * (f x - f a) * f' x * inverse (tan (x - a)))
has_integral ((f y - f a)⇧2 * inverse (tan (y - a)) -
(f c - f a)⇧2 * inverse (tan (c - a)))) {c..y}"
if "y ∈ {c..d}" for y
proof (intro f'_int absolute_real_integration_by_parts_sum(2))
have f'_abs_cd: "f' absolutely_integrable_on {c..d}"
using absolutely_integrable_on_subinterval[OF f'abs sub_cd] .
have cont_ffa: "continuous_on {c..d} (λx. 2 * (f x - f a))"
using sub_cd by (intro continuous_intros continuous_on_subset [OF contf]) auto
have meas: "(λx. 2 * (f x - f a)) ∈ borel_measurable (lebesgue_on {c..d})"
using cont_ffa by (intro continuous_imp_measurable_on_sets_lebesgue) auto
have bdd: "bounded ((λx. 2 * (f x - f a)) ` {c..d})"
using cont_ffa compact_Icc compact_continuous_image compact_imp_bounded by blast
show "(λx. 2 * (f x - f a) * f' x) absolutely_integrable_on {c..d}"
using absolutely_integrable_bounded_measurable_product_real bdd f'_abs_cd meas by auto
show "(λx. - inverse ((sin (x - a))⇧2)) absolutely_integrable_on {c..d}"
by (intro absolutely_integrable_continuous_real continuous_intros) (use sin_nz in auto)
show "((λt. - inverse ((sin (t-a))⇧2)) has_integral
(inverse (tan (x - a)) - inverse (tan (c - a)))) {c..x}"
if "x ∈ {c..d}" for x
proof -
have "c ≤ x" and sub_cx: "{c..x} ⊆ {c..d}"
using that by auto
have inv_tan_eq: "inverse (tan (t-a)) = cos (t-a) / sin (t-a)"
if "t ∈ {c..x}" for t
by (simp add: Multiseries_Expansion.tan_conv_sin_cos)
have deriv: "((λt. cos (t-a) / sin (t-a)) has_vector_derivative
- inverse ((sin (t-a))⇧2)) (at t within {c..x})"
if "t ∈ {c..x}" for t
proof -
have sin_nz_t: "sin (t-a) ≠ 0" using sin_nz that sub_cx by auto
have "((λt. cos (t-a) / sin (t-a)) has_real_derivative
(- sin (t-a) * sin (t-a) - cos (t-a) * cos (t-a)) / (sin (t-a) * sin (t-a)))
(at t within {c..x})"
by (intro derivative_eq_intros | simp add: sin_nz_t)+
also have "(- sin (t-a) * sin (t-a) - cos (t-a) * cos (t-a)) / (sin (t-a) * sin (t-a))
= - inverse ((sin (t-a))⇧2)"
using sin_cos_squared_add3 [of "t-a"]
by (simp (no_asm_simp) add: divide_simps power2_eq_square)
finally show ?thesis
by (simp add: has_real_derivative_iff_has_vector_derivative)
qed
show ?thesis
using fundamental_theorem_of_calculus[OF _ deriv] inv_tan_eq inv_tan_eq ‹c ≤ x›
by simp
qed
show "y ∈ {c..d}" using that .
qed (use ‹c ≤ d› in auto)
have integrand_eq: "(f x - f a)⇧2 * (- inverse ((sin (x - a))⇧2)) +
2 * (f x - f a) * f' x * inverse (tan (x - a)) = g' x"
if "x ∈ {c..d}" for x
proof -
have snz: "sin (x - a) ≠ 0" "(sin (x - a))⇧2 ≠ 0" using sin_nz that by auto
let ?F = "f x - f a"
let ?s = "sin (x - a)"
let ?c = "cos (x - a)"
have sc1: "?s⇧2 + ?c⇧2 = 1"
using sin_cos_squared_add[of "x - a"] by simp
have "((f x - f a)⇧2 * (- inverse (?s⇧2)) + 2 * (f x - f a) * f' x * inverse (tan (x - a))) * ?s⇧2
= - ?F⇧2 + 2 * ?F * f' x * ?c * ?s"
using snz by (simp add: tan_def field_simps power2_eq_square)
moreover have "g' x * ?s⇧2 = ((f' x)⇧2 - ?F⇧2) * ?s⇧2 - (f' x * ?s - ?F * ?c)⇧2"
using snz by (simp add: g'_def tan_def field_simps)
moreover have "… = - ?F⇧2 + 2 * ?F * f' x * ?c * ?s"
using sc1 by algebra
ultimately show ?thesis using snz
by (metis mult_right_cancel)
qed
show ?thesis
using has_integral_eq ibp_int integrand_eq unfolding g_def divide_inverse
by (metis (no_types, lifting) atLeastAtMost_iff order.refl that(1))
qed
text ‹Continuity of @{term g}.›
lemma g_cont: "continuous_on {0..2*pi} g"
unfolding continuous_on_eq_continuous_within
proof
fix c assume c_in: "c ∈ {0..2*pi}"
show "continuous (at c within {0..2*pi}) g"
proof (cases "sin (c - a) = 0")
case False
have g_eq: "g x = (f x - f a)⇧2 * cos (x - a) / sin (x - a)" for x
unfolding g_def tan_def by (simp add: field_simps)
have "continuous (at c within {0..2*pi}) f"
using contf c_in continuous_on_eq_continuous_within by blast
then show ?thesis unfolding g_eq
using False by (auto simp: continuous_intros)
next
case True
then obtain n :: int where npi: "c - a = of_int n * pi"
using sin_zero_iff_int2 by auto
have "of_int n ≥ -a / pi" "of_int n ≤ (2 * pi - a) / pi"
using a npi c_in pi_gt_zero by (simp_all add: field_simps)
moreover have "-a / pi > -1" using a pi_gt_zero by (simp add: field_simps)
moreover have "(2 * pi - a) / pi < 3"
using a pi_gt_zero by (auto simp: divide_simps)
ultimately have "n = 0 ∨ n = 1 ∨ n = 2"
by linarith
then have fca: "f c = f a"
proof (elim disjE)
assume "n = 2"
then have "c = a + 2 * pi" using npi by (simp add: algebra_simps)
with c_in a pi_gt_zero have "a = 0" by auto
thus "f c = f a" using ‹c = a + 2 * pi› feq by simp
qed (use npi a in ‹auto simp: algebra_simps›)
have gc0: "g c = 0"
unfolding g_def using fca by simp
from True obtain n :: int where npi: "c - a = of_int n * pi"
using sin_zero_iff_int2 by auto
have tan_eq: "tan (x - a) = tan (x - c)" for x
by (metis npi diff_add_cancel diff_diff_eq2 tan_periodic_int)
have g_eq2: "g x = (f x - f c)⇧2 * cos (x - c) / sin (x - c)" for x
unfolding g_def by (metis fca divide_divide_eq_right local.tan_eq tan_def)
have cs_bound: "(f x - f c)⇧2 ≤ ¦x - c¦ * integral {min c x..max c x} (λt. (f' t)⇧2)"
if xin: "x ∈ {0..2*pi}" for x
proof -
have f'_int_sub: "f' integrable_on {a..b}" if "{a..b} ⊆ {0..2*pi}" for a b
using integrable_subinterval_real[OF set_lebesgue_integral_eq_integral(1)[OF f'abs] that] .
have f'2_int_sub: "(λt. (f' t)⇧2) integrable_on {a..b}" if "{a..b} ⊆ {0..2*pi}" for a b
using integrable_subinterval_real[OF f'2 that] .
have ftc_sub: "f b - f a = integral {a..b} f'"
if "a ∈ {0..2*pi}" "b ∈ {0..2*pi}" "a ≤ b" for a b
proof -
have "integral {0..a} f' + integral {a..b} f' = integral {0..b} f'"
by (meson Henstock_Kurzweil_Integration.integral_combine atLeastAtMost_iff f'hsd
has_integral_integrable that)
moreover have "integral {0..a} f' = f a - f 0" and "integral {0..b} f' = f b - f 0"
using f'hsd that by (auto simp: has_integral_integrable_integral)
ultimately show ?thesis by linarith
qed
have cs_sub: "(integral {a..b} f')⇧2 ≤ (b-a) * integral {a..b} (λt. (f' t)⇧2)"
if sub: "{a..b} ⊆ {0..2*pi}" and ab: "a < b" for a b
proof -
define μ where "μ ≡ integral {a..b} f' / (b-a)"
have f'2I: "(λt. (f' t)⇧2) integrable_on {a..b}" by (rule f'2_int_sub[OF sub])
have int1: "(λt. - (2 * μ) * f' t) integrable_on {a..b}"
using f'_int_sub integrable_on_mult_right sub by blast
have "0 ≤ integral {a..b} (λt. (f' t - μ)⇧2)"
by (metis eq_integralD has_integral_nonneg order_refl zero_le_power2)
also have "integral {a..b} (λt. (f' t - μ)⇧2) =
integral {a..b} (λt. (f' t)⇧2) + (- (2 * μ) * integral {a..b} f' + μ⇧2 * (b-a))"
proof -
have "integral {a..b} (λt. (f' t - μ)⇧2) =
integral {a..b} (λt. (f' t)⇧2 + (- (2 * μ) * f' t + μ⇧2))"
by (simp add: power2_eq_square algebra_simps)
also have "… = integral {a..b} (λt. (f' t)⇧2) + integral {a..b} (λt. - (2 * μ) * f' t + μ⇧2)"
by (rule integral_add[OF f'2I integrable_add[OF int1 integrable_const_ivl]])
also have "integral {a..b} (λt. - (2 * μ) * f' t + μ⇧2) =
integral {a..b} (λt. - (2 * μ) * f' t) + integral {a..b} (λt. μ⇧2)"
by (rule integral_add[OF int1 integrable_const_ivl])
finally show ?thesis using ab by simp
qed
also have "- (2 * μ) * integral {a..b} f' + μ⇧2 * (b-a) = - (integral {a..b} f')⇧2 / (b-a)"
using ab unfolding μ_def by (simp add: power2_eq_square divide_simps)
finally show ?thesis using ab by (simp add: pos_divide_le_eq mult.commute)
qed
show ?thesis
proof (cases "c ≤ x")
case True
show ?thesis using cs_sub ‹c ≤ x› c_in xin ftc_sub by fastforce
next
case False
hence §: "x < c" "{x..c} ⊆ {0..2*pi}" using c_in xin by auto
then show ?thesis
by (simp add: cs_sub ftc_sub power2_commute)
qed
qed
define F where "F ≡ λx. integral {0..x} (λt. (f' t)⇧2)"
have F_cont: "continuous_on {0..2*pi} F"
unfolding F_def by (rule indefinite_integral_continuous_1[OF f'2])
have F_eq: "integral {min c x..max c x} (λt. (f' t)⇧2) = ¦F x - F c¦"
if "x ∈ {0..2*pi}" for x
proof (cases "c ≤ x")
case True
have sub: "{c..x} ⊆ {0..2*pi}" using c_in that True by auto
have "integral {0..c} (λt. (f' t)⇧2) + integral {c..x} (λt. (f' t)⇧2) =
integral {0..x} (λt. (f' t)⇧2)"
by (metis Henstock_Kurzweil_Integration.integral_combine True atLeastatMost_subset_iff f'2
integrable_on_subinterval order_refl sub)
hence "integral {c..x} (λt. (f' t)⇧2) = F x - F c"
unfolding F_def by linarith
moreover have "0 ≤ integral {c..x} (λt. (f' t)⇧2)"
by (metis integral_nonneg not_integrable_integral order.refl zero_le_power2)
ultimately show ?thesis using True by (simp add: min_def max_def)
next
case False
hence xc: "x ≤ c" by simp
have sub: "{x..c} ⊆ {0..2*pi}" using c_in that xc by auto
have "integral {0..x} (λt. (f' t)⇧2) + integral {x..c} (λt. (f' t)⇧2)
= integral {0..c} (λt. (f' t)⇧2)"
by (metis Henstock_Kurzweil_Integration.integral_combine atLeastatMost_subset_iff f'2
integrable_subinterval_real order.refl sub xc)
moreover have "0 ≤ integral {x..c} (λt. (f' t)⇧2)"
by (metis integral_nonneg not_integrable_integral order.refl zero_le_power2)
ultimately show ?thesis using xc by (simp add: F_def min_def max_def)
qed
have "((λx. ¦F x - F c¦) ⤏ 0) (at c within {0..2*pi})"
by (metis F_cont LIM_zero_iff c_in continuous_on_def tendsto_rabs_zero)
then have f'2_int_tends_0: "((λx. integral {min c x..max c x} (λt. (f' t)⇧2)) ⤏ 0) (at c within {0..2*pi})"
by (smt (verit, best) F_eq Lim_cong_within)
have "∀⇩F x in at c. ¦x - c¦ / ¦sin (x - c)¦ < 2"
by real_asymp
then have sinc_ratio_bounded:
"∀⇩F x in at c within {0..2*pi}. ¦x - c¦ / ¦sin (x - c)¦ ≤ 2"
by (metis (no_types, lifting) UNIV_I eventually_at_topological less_imp_le)
show ?thesis
unfolding continuous_within gc0
proof (rule Lim_null_comparison[where g = "λx. 2 * integral {min c x..max c x} (λt. (f' t)⇧2)"])
have mem: "∀⇩F x in at c within {0..2*pi}. x ∈ {0..2*pi}"
unfolding at_within_def eventually_inf_principal by simp
show "∀⇩F x in at c within {0..2*pi}. norm (g x) ≤ 2 * integral {min c x..max c x} (λt. (f' t)⇧2)"
proof (rule eventually_mono[OF eventually_conj[OF sinc_ratio_bounded mem]])
fix x assume H: "¦x - c¦ / ¦sin (x - c)¦ ≤ 2 ∧ x ∈ {0..2*pi}"
have "¦g x¦ = (f x - f c)⇧2 * ¦cos (x - c)¦ / ¦sin (x - c)¦"
using g_eq2 by (simp add: abs_mult)
also have "… ≤ (f x - f c)⇧2 * 1 / ¦sin (x - c)¦"
by (meson abs_cos_le_one abs_ge_zero divide_right_mono
ordered_comm_semiring_class.comm_mult_left_mono zero_le_power2)
also have "… = (f x - f c)⇧2 / ¦sin (x - c)¦" by simp
also have "… ≤ 2 * integral {min c x..max c x} (λt. (f' t)⇧2)"
proof -
have sub: "{min c x..max c x} ⊆ {0..2*pi}" using c_in H by auto
have f'2I: "(λt. (f' t)⇧2) integrable_on {min c x..max c x}"
by (rule integrable_subinterval_real[OF f'2 sub])
show ?thesis
proof (cases "sin (x - c) = 0")
case False
define I where "I = integral {min c x..max c x} (λt. (f' t)⇧2)"
have Ige: "I ≥ 0"
unfolding I_def by (rule integral_nonneg[OF f'2I]) auto
have "(f x - f c)⇧2 / ¦sin (x - c)¦ ≤ ¦x - c¦ * I / ¦sin (x - c)¦"
using H by (simp add: I_def cs_bound divide_right_mono)
also have "… = (¦x - c¦ / ¦sin (x - c)¦) * I"
by (simp add: field_simps)
also have "… ≤ 2 * I"
by (meson H Ige mult_mono order.refl zero_le_numeral)
finally show ?thesis unfolding I_def .
qed (use integral_nonneg[OF f'2I] in auto)
qed
finally show "norm (g x) ≤ 2 * integral {min c x..max c x} (λt. (f' t)⇧2)" by simp
qed
show "((λx. 2 * integral {min c x..max c x} (λt. (f' t)⇧2)) ⤏ 0) (at c within {0..2*pi})"
using tendsto_mult_right_zero[OF f'2_int_tends_0] by simp
qed
qed
qed
text ‹The integral over mainly trouble-free intervals:
we only need ‹sin(x - a) ≠ 0› on the open interior, allowing zeros at the endpoints.›
lemma mainly_trouble_free:
assumes "c ≤ d" and cd_sub: "{c..d} ⊆ {0..2*pi}" and sin_nz: "⋀x. x ∈ {c<..<d} ⟹ sin (x - a) ≠ 0"
shows "(g' has_integral g d - g c) {c..d}"
proof -
have "g' absolutely_integrable_on {c..d}"
proof -
have f'2_abs: "(λx. (f' x)⇧2) absolutely_integrable_on {0..2*pi}"
by (simp add: absolutely_integrable_on_def f'2)
have g'_int_sub: "g' integrable_on {u..v}" if "{u..v} ⊆ {c<..<d}" for u v
proof (cases "u ≤ v")
case True
show ?thesis
using has_integral_integrable[OF trouble_free[OF True]] sin_nz that cd_sub by force
qed (simp add: not_le integrable_on_empty)
have g'_int: "g' integrable_on {c'..d'}" if "{c'..d'} ⊆ {c<..<d}" for c' d'
using ‹{c'..d'} ⊆ {c<..<d}› g'_int_sub by blast
have abs_g_cont: ‹continuous_on {0..2 * pi} (λx. ¦g x¦)›
by (intro continuous_intros g_cont)
obtain h where h_abs: "h absolutely_integrable_on {c..d}"
and h_bounded: "(∀x∈{c..d}. g' x ≤ h x) ∨ (∀x∈{c..d}. h x ≤ g' x)"
using absolutely_integrable_on_subinterval[OF f'2_abs cd_sub] by (simp add: g'_def)
show ?thesis
proof (intro g'_int absolutely_integrable_improper [of c d , unfolded box_real])
obtain w where "0 ≤ w" "w ≤ 2*pi" and w: "∀y. 0≤y ⟶ y ≤ 2*pi ⟶ ¦g y¦ ≤ ¦g w¦"
using continuous_attains_sup [of ‹{0..2*pi}› ‹λx. ¦g x¦›]
by (metis Arg2pi abs_g_cont atLeastAtMost_iff compact_Icc empty_iff less_eq_real_def)
show "bounded {integral {c'..d'} g' |c' d'. {c'..d'} ⊆ {c<..<d}}"
proof (rule boundedI)
fix x assume "x ∈ {integral {c'..d'} g' |c' d'. {c'..d'} ⊆ {c<..<d}}"
then obtain c' d' where cd': "{c'..d'} ⊆ {c<..<d}" and xeq: "x = integral {c'..d'} g'"
by auto
show "norm x ≤ 2 * ¦g w¦"
proof (cases "c' ≤ d'")
case True
have sub_2pi: "{c'..d'} ⊆ {0..2*pi}"
using cd' cd_sub greaterThanLessThan_subseteq_atLeastAtMost_iff by blast
have "sin (t-a) ≠ 0" if "t ∈ {c'..d'}" for t
using that cd' sin_nz by (meson greaterThanLessThan_subseteq_atLeastAtMost_iff subsetD)
then have "integral {c'..d'} g' = g d' - g c'"
using True sub_2pi trouble_free by blast
then have "¦x¦ ≤ ¦g d'¦ + ¦g c'¦"
using xeq by linarith
also have "… ≤ ¦g w¦ + ¦g w¦"
by (metis True w add_mono atLeastatMost_subset_iff order_trans sub_2pi)
also have "… = 2 * ¦g w¦" by algebra
finally show ?thesis by (simp add: xeq)
qed (simp add: xeq)
qed
qed (use h_abs h_bounded in auto)
qed
have g'_int: "g' integrable_on {c..d}"
using ‹g' absolutely_integrable_on {c..d}› set_lebesgue_integral_eq_integral by blast
have g_cont_cd: "continuous_on {c..d} g"
using continuous_on_subset[OF g_cont cd_sub] .
have "integral {c..d} g' = g d - g c"
proof (cases "c < d")
case False with ‹c ≤ d› show ?thesis by simp
next
case True
define c_n where "c_n ≡ λn. c + (d - c) / (real n + 2)"
define d_n where "d_n ≡ λn. d - (d - c) / (real n + 2)"
have pos: "0 < (d - c) / (real n + 2)" for n
using True by auto
have lt_dc: "(d - c) / (real n + 2) < d - c" for n
using True by (simp add: divide_less_eq)
have c_n_le_d_n: "c_n n ≤ d_n n" for n
proof -
have "c * real n ≤ d * real n"
using True by (intro mult_right_mono) auto
then have "2 * ((d - c) / (real n + 2)) ≤ d - c"
using True by (simp add: field_simps)
then show ?thesis unfolding c_n_def d_n_def by linarith
qed
have frac_lim: "(λn. (d - c) / (real n + 2)) ⇢ 0"
proof (rule real_tendsto_sandwich)
show "∀⇩F n in sequentially. 0 ≤ (d - c) / (real n + 2)"
using True by (intro always_eventually allI) (auto simp: field_simps)
show "∀⇩F n in sequentially. (d - c) / (real n + 2) ≤ (d - c) * (1 / real n)"
using True by (intro eventually_sequentiallyI[of 1]) (auto simp: field_simps)
show "(λ_. (0::real)) ⇢ 0" by simp
show "(λn. (d - c) * (1 / real n)) ⇢ 0"
using tendsto_mult_right_zero[OF lim_inverse_n'] by simp
qed
have c_n_lim: "c_n ⇢ c"
unfolding c_n_def using tendsto_add[OF tendsto_const frac_lim] by simp
have d_n_lim: "d_n ⇢ d"
unfolding d_n_def using tendsto_diff[OF tendsto_const frac_lim] by simp
have c_n_in: "c_n n ∈ {c<..<d}" and d_n_in: "d_n n ∈ {c<..<d}" for n
using pos[of n] lt_dc[of n] unfolding c_n_def d_n_def by auto
have sub_n: "{c_n n..d_n n} ⊆ {c<..<d}" for n
using c_n_in[of n] d_n_in[of n] c_n_le_d_n[of n] by auto
have sub_2pi_n: "{c_n n..d_n n} ⊆ {0..2*pi}" for n
using sub_n[of n] cd_sub greaterThanLessThan_subseteq_atLeastAtMost_iff by blast
have sin_nz_n: "sin (x - a) ≠ 0" if "x ∈ {c_n n..d_n n}" for n x
using that sub_n[of n] sin_nz
by (meson greaterThanLessThan_subseteq_atLeastAtMost_iff subsetD)
have tf_n: "(g' has_integral g (d_n n) - g (c_n n)) {c_n n..d_n n}" for n
using trouble_free[OF c_n_le_d_n sub_2pi_n sin_nz_n] .
have int_n: "integral {c_n n..d_n n} g' = g (d_n n) - g (c_n n)" for n
using tf_n[of n] by (rule integral_unique)
have int_lim: "(λn. integral {c_n n..d_n n} g') ⇢ integral {c..d} g'"
proof -
have indef_cont: "continuous_on {c..d} (λx. integral {c..x} g')"
by (rule indefinite_integral_continuous_1[OF g'_int])
have c_n_cd: "c_n n ∈ {c..d}" for n
using c_n_in[of n] by (meson atLeastAtMost_iff greaterThanLessThan_iff less_imp_le)
have d_n_cd: "d_n n ∈ {c..d}" for n
using d_n_in[of n] by (meson atLeastAtMost_iff greaterThanLessThan_iff less_imp_le)
have split: "integral {c_n n..d_n n} g' = integral {c..d_n n} g' - integral {c..c_n n} g'" for n
proof -
have cn_le: "c ≤ c_n n" using c_n_in[of n] by auto
have int_cdn: "g' integrable_on {c..d_n n}"
by (rule integrable_subinterval_real[OF g'_int]) (use d_n_cd[of n] ‹c ≤ d› in auto)
have "integral {c..c_n n} g' + integral {c_n n..d_n n} g' = integral {c..d_n n} g'"
by (rule Henstock_Kurzweil_Integration.integral_combine[OF cn_le c_n_le_d_n int_cdn])
then show ?thesis by linarith
qed
have "(λn. integral {c..d_n n} g') ⇢ integral {c..d} g'"
by (rule continuous_on_tendsto_compose[OF indef_cont d_n_lim])
(use d_n_cd ‹c ≤ d› in ‹auto intro: always_eventually›)
moreover have "(λn. integral {c..c_n n} g') ⇢ integral {c..c} g'"
by (rule continuous_on_tendsto_compose[OF indef_cont c_n_lim])
(use c_n_cd ‹c ≤ d› in ‹auto intro: always_eventually›)
moreover have "integral {c..c} g' = 0" by simp
ultimately have "(λn. integral {c..d_n n} g' - integral {c..c_n n} g') ⇢ integral {c..d} g' - 0"
by (intro tendsto_diff) simp_all
then show ?thesis using split by simp
qed
moreover have "(λn. g (d_n n) - g (c_n n)) ⇢ g d - g c"
proof (intro tendsto_diff)
obtain d_n_cd: "d_n n ∈ {c..d}" and c_n_cd: "c_n n ∈ {c..d}" for n
using c_n_in d_n_in less_eq_real_def by force
show "(λn. g (d_n n)) ⇢ g d"
by (rule continuous_on_tendsto_compose[OF g_cont_cd d_n_lim])
(use d_n_cd ‹c ≤ d› in ‹auto intro: always_eventually›)
show "(λn. g (c_n n)) ⇢ g c"
by (rule continuous_on_tendsto_compose[OF g_cont_cd c_n_lim])
(use c_n_cd ‹c ≤ d› in ‹auto intro: always_eventually›)
qed
ultimately show ?thesis
using int_n LIMSEQ_unique by auto
qed
then show ?thesis
using integrable_integral[OF g'_int] by auto
qed
end
theorem Wirtinger_inequality:
fixes f f' :: "real ⇒ real"
assumes f'hsd: "⋀x. x ∈ {0..2*pi} ⟹ (f' has_integral (f x - f 0)) {0..x}"
and feq: "f (2*pi) = f 0"
and f0: "(f has_integral 0) {0..2*pi}"
and f'2: "(λx. (f' x)⇧2) integrable_on {0..2*pi}"
shows "(λx. (f x)⇧2) integrable_on {0..2*pi}"
and "integral {0..2*pi} (λx. (f x)⇧2) ≤ integral {0..2*pi} (λx. (f' x)⇧2)"
and "integral {0..2*pi} (λx. (f x)⇧2) = integral {0..2*pi} (λx. (f' x)⇧2) ⟹
∃c a. ∀x ∈ {0..2*pi}. f x = c * sin (x - a)"
proof -
obtain a where a: "0 ≤ a" "a < pi" "f (a + pi) = f a"
proof -
have contf: ‹continuous_on {0..2*pi} f›
proof (rule continuous_on_eq)
show ‹continuous_on {0..2*pi} (λx. integral {0..x} f' + f 0)›
using f'hsd [of ‹2*pi›]
by (intro continuous_on_add indefinite_integral_continuous_1 continuous_on_const) auto
show ‹⋀x. x ∈ {0..2*pi} ⟹ integral {0..x} f' + f 0 = f x›
using f'hsd by (auto simp: has_integral_integrable_integral)
qed
define h where "h ≡ λx. f (x + pi) - f x"
have hcont: "continuous_on {0..pi} h"
unfolding h_def
by (intro continuous_intros continuous_on_compose2 [OF contf]) auto
have heq: "h 0 + h pi = 0"
unfolding h_def using feq by simp
have iv: "is_interval (h ` {0..pi})"
using is_interval_connected_1 connected_continuous_image [OF hcont connected_Icc]
by blast
have"h 0 ∈ h ` {0..pi}" "h pi ∈ h ` {0..pi}"
using pi_gt_zero by auto
with heq obtain a where "a ∈ {0..pi}" "h a = 0"
by (smt (verit, best) imageE is_interval_1 iv)
show thesis
proof (cases "a = pi")
case True
then have "h 0 = 0" using heq ‹h a = 0› by auto
then show thesis using that [of 0] pi_gt_zero by (auto simp: h_def)
next
case False
then show thesis using that [of a] ‹a ∈ {0..pi}› ‹h a = 0›
by (auto simp: h_def)
qed
qed
interpret W f f' a
using W.intro a assms by blast
show "(λx. (f x)⇧2) integrable_on {0..2*pi}"
by (intro integrable_continuous_interval continuous_on_power contf)
have sin_nz_1: "sin (x - a) ≠ 0" if "a + pi < x" "x < 2*pi" for x
by (smt (verit) ‹0 ≤ a› sin_lt_zero that)
have sin_nz_2: "sin (x - a) ≠ 0" if "a < x" "x < a + pi" for x
by (smt (verit, ccfv_threshold) sin_gt_zero that)
have sin_nz_3: "sin (x - a) ≠ 0" if "0 < x" "x < a" for x
using ‹a < pi› sin_zero_pi_iff that by auto
have int1: "(g' has_integral g (2*pi) - g (a + pi)) {a + pi..2*pi}"
by (rule mainly_trouble_free) (use ‹0 ≤ a› ‹a < pi› sin_nz_1 in auto)
have int2: "(g' has_integral g (a + pi) - g a) {a..a + pi}"
by (rule mainly_trouble_free) (use ‹0 ≤ a› ‹a < pi› sin_nz_2 in auto)
have int3: "(g' has_integral g a - g 0) {0..a}"
by (rule mainly_trouble_free) (use ‹0 ≤ a› ‹a < pi› sin_nz_3 in auto)
have api_le: "a ≤ a + pi" and api_le2: "a + pi ≤ 2*pi"
using ‹0 ≤ a› ‹a < pi› by auto
have a_le_2pi: "a ≤ 2*pi" using ‹0 ≤ a› ‹a < pi› by auto
have int12: "(g' has_integral (g (a + pi) - g a) + (g (2*pi) - g (a + pi))) {a..2*pi}"
by (rule has_integral_combine[OF api_le api_le2 int2 int1])
have "g (2*pi) = g 0"
unfolding g_def using feq by (simp add: tan_def)
hence g'_zero: "(g' has_integral 0) {0..2*pi}"
using has_integral_combine[OF ‹0 ≤ a› a_le_2pi int3 int12] by (simp add: algebra_simps)
have ffa_int: "(λx. (f x - f a)⇧2) integrable_on {0..2*pi}"
by (intro integrable_continuous_interval continuous_intros contf)
have diff_int: "((λx. (f' x)⇧2 - g' x) has_integral integral {0..2*pi} (λx. (f' x)⇧2) - 0) {0..2*pi}"
by (rule has_integral_diff[OF integrable_integral[OF f'2] g'_zero])
have diff_ge: "(f' x)⇧2 - g' x ≥ (f x - f a)⇧2" for x
by (simp add: g'_def zero_le_power2)
have "integral {0..2*pi} (λx. (f x - f a)⇧2) ≤ integral {0..2*pi} (λx. (f' x)⇧2 - g' x)"
by (rule integral_le[OF ffa_int]) (use diff_int has_integral_integrable_integral in ‹auto intro: diff_ge›)
also have int_eq: "… = integral {0..2*pi} (λx. (f' x)⇧2)"
using diff_int has_integral_integrable_integral by auto
finally have ineq_ffa: "integral {0..2*pi} (λx. (f x - f a)⇧2) ≤ integral {0..2*pi} (λx. (f' x)⇧2)" .
have "(f x)⇧2 ≤ (f x - f a)⇧2 + 2 * f a * f x - (f a)⇧2" for x
by (simp add: power2_eq_square algebra_simps)
have fx2_int: "(λx. (f x)⇧2) integrable_on {0..2*pi}"
by (intro integrable_continuous_interval continuous_intros contf)
have ffa_2fa_int: "(λx. 2 * f a * f x) integrable_on {0..2*pi}"
using integrable_continuous_interval[OF contf] integrable_on_mult_right by blast
have "integral {0..2*pi} (λx. (f x - f a)⇧2) = integral {0..2*pi} (λx. (f x)⇧2 - 2 * f a * f x + (f a)⇧2)"
by (simp add: power2_eq_square algebra_simps)
also have "… = integral {0..2*pi} (λx. (f x)⇧2 - 2 * f a * f x) + integral {0..2*pi} (λx. (f a)⇧2)"
by (rule Henstock_Kurzweil_Integration.integral_add)
(auto intro: integrable_diff fx2_int ffa_2fa_int)
also have "integral {0..2*pi} (λx. (f x)⇧2 - 2 * f a * f x) =
integral {0..2*pi} (λx. (f x)⇧2) - integral {0..2*pi} (λx. 2 * f a * f x)"
by (rule Henstock_Kurzweil_Integration.integral_diff[OF fx2_int ffa_2fa_int])
also have "integral {0..2*pi} (λx. 2 * f a * f x) = 0"
using integral_cmul f0 by (simp add: has_integral_integrable_integral)
also have "integral {0..2*pi} (λx. (f a)⇧2) = (f a)⇧2 * (2*pi)"
by simp
finally have ffa_eq: "integral {0..2*pi} (λx. (f x - f a)⇧2)
= integral {0..2*pi} (λx. (f x)⇧2) + (f a)⇧2 * (2*pi)"
by linarith
then have ffa_ineq': "integral {0..2*pi} (λx. (f x)⇧2) ≤ integral {0..2*pi} (λx. (f x - f a)⇧2)"
by auto
thus "integral {0..2*pi} (λx. (f x)⇧2) ≤ integral {0..2*pi} (λx. (f' x)⇧2)"
using ineq_ffa by linarith
show "∃c a. ∀x ∈ {0..2*pi}. f x = c * sin (x - a)"
if "integral {0..2*pi} (λx. (f x)⇧2) = integral {0..2*pi} (λx. (f' x)⇧2)"
proof -
have fa0: "f a = 0"
by (smt (verit, best) ffa_ineq' a ffa_eq ineq_ffa mult_eq_0_iff power_eq_0_iff that)
define rest where "rest ≡ λx. f' x - (f x - f a) / tan (x - a)"
have diff_int: "(λx. (f' x)⇧2 - g' x) integrable_on {0..2*pi}"
using has_integral_diff[OF integrable_integral[OF f'2] g'_zero]
has_integral_integrable by blast
have rest_sq_int: "(λx. (rest x)⇧2) integrable_on {0..2*pi}"
using integrable_diff[OF diff_int ffa_int]
by (simp add: g'_def rest_def)
have rest_sq_zero: "integral {0..2*pi} (λx. (rest x)⇧2) = 0"
using integral_add[OF ffa_int rest_sq_int] that g'_def int_eq
by (fastforce simp: rest_def fa0)
have csin_integral: "integral {u..v} (λx. c * sin (x - a)) =
c * (cos (u - a) - cos (v - a))" if "u ≤ v" for u v c
proof -
have "((λx. - (c * cos (x - a))) has_real_derivative c * sin (x - a)) (at x)" for x
by (auto intro!: derivative_eq_intros simp: algebra_simps)
hence hvd: "((λx. - (c * cos (x - a))) has_vector_derivative c * sin (x - a))
(at x within {u..v})" for x
by (meson has_real_derivative_iff_has_vector_derivative has_vector_derivative_at_within)
hence "((λx. c * sin (x - a)) has_integral
(- (c * cos (v - a)) - (- (c * cos (u - a))))) {u..v}"
using that by (intro fundamental_theorem_of_calculus) auto
thus ?thesis
by (simp add: has_integral_integrable_integral algebra_simps)
qed
have key_fact: "∃c. ∀x∈{u..v}. f x = c * sin (x - a)"
if huv: "0 ≤ u" "u < v" "v ≤ 2*pi"
and hsin: "⋀x. x ∈ {u<..<v} ⟹ sin (x - a) ≠ 0"
for u v
proof -
have rest_sq_sub: "(λx. (rest x)⇧2) integrable_on {u..v}"
using integrable_on_subinterval rest_sq_int that by fastforce
have "integral {u..v} (λx. (rest x)⇧2) ≤ integral {0..2*pi} (λx. (rest x)⇧2)"
by (simp add: huv integral_subset_le rest_sq_int rest_sq_sub)
moreover have "0 ≤ integral {u..v} (λx. (rest x)⇧2)"
by (simp add: Henstock_Kurzweil_Integration.integral_nonneg rest_sq_sub)
ultimately have rest_sq_sub_zero: "integral {u..v} (λx. (rest x)⇧2) = 0"
using rest_sq_zero by linarith
have rest_sq_abs: "(λx. (rest x)⇧2) absolutely_integrable_on {u..v}"
by (simp add: absolutely_integrable_on_iff_nonneg rest_sq_sub)
have rest_sq_leb: "integrable (lebesgue_on {u..v}) (λx. (rest x)⇧2)"
by (simp add: absolutely_integrable_imp_integrable rest_sq_abs)
have "integral⇧L (lebesgue_on {u..v}) (λx. (rest x)⇧2) = integral {u..v} (λx. (rest x)⇧2)"
using lebesgue_integral_eq_integral lmeasurable_interval(1) rest_sq_leb by blast
hence "integral⇧L (lebesgue_on {u..v}) (λx. (rest x)⇧2) = 0"
using rest_sq_sub_zero by simp
hence rest_ae_zero: "AE x in lebesgue_on {u..v}. rest x = 0"
using integral_nonneg_eq_0_iff_AE[OF rest_sq_leb] by simp
have h_const: "f s / sin (s - a) = f t / sin (t-a)"
if hst: "s ∈ {u<..<v}" "t ∈ {u<..<v}" for s t
proof (cases "s = t")
case True thus ?thesis by simp
next
case False
define s' where "s' = min s t"
define t' where "t' = max s t"
have st': "u < s'" "t' < v" "s' < t'"
using hst False unfolding s'_def t'_def by auto
have st'_sub: "{s'..t'} ⊆ {u<..<v}" and st'_sub2: "{s'..t'} ⊆ {0..2*pi}"
using st' huv by auto
have sin_nz_st: "sin (x - a) ≠ 0" if "x ∈ {s'..t'}" for x
using hsin st'_sub that by auto
define h where "h ≡ λx. f x / sin (x - a)"
have ac_f: "absolutely_continuous_on {0..2*pi} f"
using absolute_integral_absolutely_continuous_derivative_eq f'abs f'hsd by blast
have ac_f_st: "absolutely_continuous_on {s'..t'} f"
using absolutely_continuous_on_subset[OF ac_f st'_sub2] .
define deriv where "deriv ≡ λx::real. - cos (x - a) / (sin (x - a))⇧2"
have cont_deriv: "continuous_on {s'..t'} deriv"
unfolding deriv_def
by (intro continuous_intros) (use sin_nz_st in auto)
have bdd: "bounded (deriv ` {s'..t'})"
using compact_continuous_image compact_imp_bounded cont_deriv by blast
then obtain B where B: "⋀x. x ∈ {s'..t'} ⟹ ¦deriv x¦ ≤ B"
by (meson bounded_real imageI)
have lipschitz: "¦inverse (sin (x - a)) - inverse (sin (y - a))¦ ≤ B * ¦x - y¦"
if hx: "s' ≤ x" "x ≤ t'" and hy: "s' ≤ y" "y ≤ t'" for x y
proof -
have deriv_at: "((λx. inverse (sin (x - a))) has_real_derivative deriv z)
(at z within {s'..t'})"
if hz: "z ∈ {s'..t'}" for z
proof -
have "((λx. sin (x - a)) has_real_derivative cos (z - a)) (at z within {s'..t'})"
by (intro derivative_eq_intros | simp)+
moreover have "- (cos (z - a) * inverse (sin (z - a) ^ Suc (Suc 0))) = deriv z"
unfolding deriv_def power2_eq_square
by (simp add: field_simps)
ultimately show ?thesis
by (metis DERIV_inverse_fun sin_nz_st[OF hz])
qed
have "norm (inverse (sin (x - a)) - inverse (sin (y - a))) ≤ B * norm (x - y)"
using hx hy B deriv_at
by (intro field_differentiable_bound[OF convex_real_interval(5)]) auto
then show ?thesis by (simp add: real_norm_def)
qed
then have ac_inv_sin: "absolutely_continuous_on {s'..t'} (λx. inverse (sin (x - a)))"
by (intro Lipschitz_imp_absolutely_continuous strip; auto)
have ac_h: "absolutely_continuous_on {s'..t'} h"
using absolutely_continuous_on_mul[OF ac_f_st ac_inv_sin]
by (simp add: divide_real_def h_def)
obtain k where negk: "negligible k"
and derivf: "⋀t. t ∈ {0..2*pi} - k ⟹
((λu. integral {0..u} f') has_vector_derivative f' t)
(at t within {0..2*pi})"
using f' has_vector_derivative_indefinite_integral by blast
have f_eq: "f t = f 0 + integral {0..t} f'" if "t ∈ {0..2*pi}" for t
using f'hsd[OF that] by (auto simp: has_integral_integrable_integral)
have fderiv: "(f has_vector_derivative f' t) (at t within {s'..t'})"
if "t ∈ {s'..t'} - k" for t
proof -
have t02: "t ∈ {0..2*pi}" and "t ∈ {0..2*pi} - k"
using that st'_sub2 by auto
then have "((λu. f u - f 0) has_vector_derivative f' t)
(at t within {0..2*pi})"
using derivf has_vector_derivative_transform_within t02
by (smt (verit, best) f_eq has_vector_derivative_transform)
then have "(f has_vector_derivative f' t) (at t within {0..2*pi})"
using has_vector_derivative_diff_const by blast
then show ?thesis
by (rule has_vector_derivative_within_subset) (use st'_sub2 in auto)
qed
have hderiv: "(h has_vector_derivative (f' t * sin (t-a) - f t * cos (t-a)) / (sin (t-a))⇧2)
(at t within {s'..t'})"
if "t ∈ {s'..t'} - k" for t
proof -
have fd: "(f has_real_derivative f' t) (at t within {s'..t'})"
using fderiv that by (simp add: has_real_derivative_iff_has_vector_derivative)
have sd: "((λx. sin (x - a)) has_real_derivative cos (t-a))
(at t within {s'..t'})"
by (auto intro!: derivative_eq_intros)
have "((λx. f x / sin (x - a)) has_real_derivative
(f' t * sin (t-a) - f t * cos (t-a)) / (sin (t-a))⇧2)
(at t within {s'..t'})"
using DERIV_quotient[OF fd sd] sin_nz_st that
by (simp add: power2_eq_square algebra_simps)
then show ?thesis unfolding h_def
by (simp add: has_real_derivative_iff_has_vector_derivative)
qed
have hderiv_eq: "(f' t * sin (t-a) - f t * cos (t-a)) / (sin (t-a))⇧2
= rest t / sin (t-a)"
if "t ∈ {s'..t'}" for t
using that unfolding rest_def fa0
by (simp add: power2_eq_square divide_simps Multiseries_Expansion.tan_conv_sin_cos)
have hderiv': "(h has_vector_derivative rest t / sin (t-a)) (at t within {s'..t'})"
if "t ∈ {s'..t'} - k" for t
using hderiv[OF that] hderiv_eq[of t] that by auto
obtain N where negN: "negligible N" and restN: "⋀x. x ∈ {u..v} - N ⟹ rest x = 0"
proof -
from rest_ae_zero[unfolded eventually_ae_filter[of _ "lebesgue_on {u..v}"]]
obtain N0 where N0: "N0 ∈ null_sets (lebesgue_on {u..v})"
and sub: "{x ∈ space (lebesgue_on {u..v}). rest x ≠ 0} ⊆ N0"
by auto
have "negligible N0"
using null_sets_restrict_space[of "{u..v}"] N0 negligible_iff_null_sets
by auto
moreover have "rest x = 0" if "x ∈ {u..v} - N0" for x
using sub that by (auto simp: space_lebesgue_on)
ultimately show ?thesis using that by blast
qed
have hderiv_zero: "(h has_vector_derivative 0) (at t within {s'..t'})"
if "t ∈ {s'..t'} - (k ∪ N)" for t
using restN[of t] that st'_sub hderiv' using st'(2) by fastforce
have neg_kN: "negligible (k ∪ N)"
using negk negN by (rule negligible_Un)
have "h t' - h s' = integral {s'..t'} (λx. 0::real)"
using fundamental_theorem_of_calculus_absolutely_continuous [OF neg_kN _ ac_h hderiv_zero]
using st' by auto
then have "h s' = h t'" by simp
then show ?thesis
unfolding h_def s'_def t'_def by (auto split: if_splits)
qed
obtain x where "x ∈ {u<..<v}"
using huv(2) dense by (metis greaterThanLessThan_iff)
with eq_divide_eq hsin h_const that have open_ver: "∃c. ∀x∈{u<..<v}. f x = c * sin (x - a)"
by metis
then obtain c where hc: "∀x∈{u<..<v}. f x = c * sin (x - a)"
by auto
have "f x = c * sin (x - a)" if "x ∈ {u..v}" for x
proof -
have "f x - c * sin (x - a) = 0"
proof (rule continuous_constant_on_closure[of "{u<..<v}" "λx. f x - c * sin (x - a)" 0])
show "continuous_on (closure {u<..<v}) (λx. f x - c * sin (x - a))"
unfolding closure_greaterThanLessThan[OF huv(2)]
by (intro continuous_intros continuous_on_subset[OF contf])
(use huv in auto)
show "⋀y. y ∈ {u<..<v} ⟹ f y - c * sin (y - a) = 0"
using hc by simp
show "x ∈ closure {u<..<v}"
unfolding closure_greaterThanLessThan[OF huv(2)] using that by auto
qed
thus ?thesis by simp
qed
thus ?thesis by auto
qed
show ?thesis
proof (cases "a=0")
case True
obtain c1 where c1: "∀x∈{0..pi}. f x = c1 * sin (x - a)"
using key_fact[of 0 pi] sin_nz_2 True pi_gt_zero by auto
obtain c2 where c2: "∀x∈{pi..2*pi}. f x = c2 * sin (x - a)"
using key_fact[of pi "2*pi"] sin_nz_1 True pi_gt_zero by auto
have eq1: "integral {0..pi} f = c1 * (cos (0 - a) - cos (pi - a))"
by (metis (lifting) integral_cong True add_0 api_le c1 csin_integral)
have eq2: "integral {pi..2*pi} f = c2 * (cos (pi - a) - cos (2*pi - a))"
by (metis (lifting) integral_cong True add_0 api_le2 c2 csin_integral)
have int_split: "integral {0..2*pi} f = integral {0..pi} f + integral {pi..2*pi} f"
using Henstock_Kurzweil_Integration.integral_combine[OF pi_ge_zero]
by (metis True add_cancel_left_left api_le2 assms(3) integrable_on_def)
have "integral {0..2*pi} f = 0"
using f0 by (simp add: has_integral_integrable_integral)
hence "c1 * (cos (0 - a) - cos (pi - a)) + c2 * (cos (pi - a) - cos (2*pi - a)) = 0"
using int_split eq1 eq2 by linarith
hence "c1 = c2" using True
by (simp add: cos_two_pi cos_pi)
then show ?thesis
by (metis atLeastAtMost_iff c1 c2 nle_le)
next
case False
with ‹0 ≤ a› have a_pos: "0 < a" by auto
obtain c1 where c1: "∀x∈{0..a}. f x = c1 * sin (x - a)"
using key_fact[of 0 a] sin_nz_3 a_pos ‹a < pi› by auto
obtain c2 where c2: "∀x∈{a..a+pi}. f x = c2 * sin (x - a)"
using key_fact[of a "a+pi"] sin_nz_2 a_pos ‹0 ≤ a› ‹a < pi› by auto
obtain c3 where c3: "∀x∈{a+pi..2*pi}. f x = c3 * sin (x - a)"
using key_fact[of "a+pi" "2*pi"] sin_nz_1 ‹0 ≤ a› ‹a < pi› by auto
have sin_a_nz: "sin a ≠ 0"
using sin_gt_zero[OF a_pos ‹a < pi›] by (simp add: less_imp_le)
have f0_eq: "f 0 = c1 * sin (0 - a)"
using c1 ‹0 ≤ a› by auto
have f2pi_eq: "f (2*pi) = c3 * sin (2*pi - a)"
using c3 ‹0 ≤ a› ‹a < pi› by auto
have eq1: "integral {0..a} f = c1 * (cos (0 - a) - cos (a - a))"
by (metis (no_types, lifting) integral_cong ‹0 ≤ a› c1 csin_integral)
have eq2: "integral {a..a+pi} f = c2 * (cos (a - a) - cos ((a+pi) - a))"
by (metis (no_types, lifting) api_le integral_cong c2 csin_integral)
have eq3: "integral {a+pi..2*pi} f = c3 * (cos ((a+pi) - a) - cos (2*pi - a))"
by (metis (mono_tags, lifting) integral_cong api_le2 c3 csin_integral)
have f_int: "f integrable_on {0..2*pi}"
using f0 has_integral_integrable by blast
have a_le: "a ≤ a + pi" using pi_gt_zero by linarith
have api_le: "a + pi ≤ 2 * pi" using ‹a < pi› by linarith
have int_split: "integral {0..2*pi} f =
integral {0..a} f + integral {a..a+pi} f + integral {a+pi..2*pi} f"
proof -
have "integral {0..2*pi} f = integral {0..a+pi} f + integral {a+pi..2*pi} f"
using Henstock_Kurzweil_Integration.integral_combine [OF _ api_le f_int]
a_pos pi_gt_zero by auto
moreover have "f integrable_on {0..a+pi}"
using integrable_subinterval_real[OF f_int] a_pos api_le by auto
ultimately show ?thesis
by (metis Henstock_Kurzweil_Integration.integral_combine ‹0 ≤ a› a_le)
qed
have "integral {0..2*pi} f = 0"
using f0 by (simp add: has_integral_integrable_integral)
hence sum_eq: "c1 * (cos (0 - a) - cos (a - a)) + c2 * (cos (a - a) - cos ((a+pi) - a)) +
c3 * (cos ((a+pi) - a) - cos (2*pi - a)) = 0"
using int_split eq1 eq2 eq3 by linarith
have "c1 * (cos a - 1) + 2 * c2 + c1 * (- 1 - cos a) = 0"
using f0_eq f2pi_eq feq sin_a_nz sum_eq by fastforce
hence c12_eq: "c1 = c2"
by (simp add: algebra_simps)
show ?thesis
using f0_eq feq sin_a_nz c1 c2 c3 c12_eq by fastforce
qed
qed
qed
theorem scaled_Wirtinger_inequality:
fixes f f' :: "real ⇒ real"
assumes f': "⋀x. x ∈ {0..1} ⟹ (f' has_integral (f x - f 0)) {0..x}"
and "f 1 = f 0"
and f_int: "(f has_integral 0) {0..1}"
and f'_int: "(λx. (f' x)⇧2) integrable_on {0..1}"
shows "(λx. (f x)⇧2) integrable_on {0..1}"
and "integral {0..1} (λx. (2*pi * f x)⇧2) ≤ integral {0..1} (λx. (f' x)⇧2)"
and "integral {0..1} (λx. (2*pi * f x)⇧2) = integral {0..1} (λx. (f' x)⇧2) ⟹
∃c a. ∀x ∈ {0..1}. f x = c * sin (2*pi*x - a)"
proof -
define g where "g ≡ λx. f (x / (2*pi))"
define g' where "g' ≡ λx. (1/(2*pi)) * f' (x / (2*pi))"
have twopi_pos: "2 * pi > 0" and twopi_nz: "2 * pi ≠ 0"
and inv_twopi_pos: "1/(2*pi) > 0" and inv_twopi_nz: "1/(2*pi) ≠ (0::real)"
using pi_gt_zero by auto
have img: "(λx. x / (1/(2*pi))) ` {0..1} = {0..2*pi}"
using image_divide_atLeastAtMost[OF inv_twopi_pos] by simp
have prec1: "(g' has_integral (g x - g 0)) {0..x}" if x: "x ∈ {0..2*pi}" for x
proof -
have *: "((λs. f' (1/(2*pi) * s)) has_integral (2*pi) *⇩R (f (x/(2*pi)) - f 0))
((λs. s / (1/(2*pi))) ` {0..x/(2*pi)})"
using x has_integral_stretch_real[OF f' inv_twopi_nz] inv_twopi_pos by simp
have **: "((λs. f' (s/(2*pi))) has_integral (2*pi) * (f (x/(2*pi)) - f 0)) {0..x}"
using * image_divide_atLeastAtMost[OF inv_twopi_pos, of 0 "x/(2*pi)"]
using twopi_pos by (simp add: field_simps)
have val: "1/(2*pi) * ((2*pi) * (f (x/(2*pi)) - f 0)) = f (x/(2*pi)) - f 0"
using twopi_nz by simp
show ?thesis
using has_integral_mult_right[OF **, of "1/(2*pi)"] twopi_nz
unfolding g'_def g_def val by (simp add: field_simps)
qed
have prec2: "g (2*pi) = g 0"
unfolding g_def using assms(2) by simp
have prec3: "(g has_integral 0) {0..2*pi}"
using has_integral_stretch_real_iff[OF inv_twopi_nz, of f 0 0 1] f_int g_def img by auto
have int: "(λx. (f' (x/(2*pi)))⇧2) integrable_on {0..2*pi}"
using f'_int integrable_stretch_real[OF _ inv_twopi_nz, of "λx. (f' x)⇧2" 0 1] img
by (simp add: field_simps)
then have prec4: "(λx. (g' x)⇧2) integrable_on {0..2*pi}"
unfolding g'_def power_mult_distrib
using integrable_on_cmult_left[OF int, of "(1/(2*pi))⇧2"] by (simp add: algebra_simps)
text ‹Apply unscaled Wirtinger inequality›
have W1: "(λx. (g x)⇧2) integrable_on {0..2*pi}"
and W2: "integral {0..2*pi} (λx. (g x)⇧2) ≤ integral {0..2*pi} (λx. (g' x)⇧2)"
and W3: "integral {0..2*pi} (λx. (g x)⇧2) = integral {0..2*pi} (λx. (g' x)⇧2) ⟹
∃c a. ∀x ∈ {0..2*pi}. g x = c * sin (x - a)"
using Wirtinger_inequality[OF prec1 prec2 prec3 prec4] by auto
text ‹Transfer conclusions back to scaled domain›
have g_unfold: "⋀x. (g x)⇧2 = (f (1/(2*pi) * x))⇧2"
unfolding g_def by (simp add: field_simps)
have g'_unfold: "⋀x. (g' x)⇧2 = (1/(2*pi))⇧2 * (f' (1/(2*pi) * x))⇧2"
unfolding g'_def by (simp add: power_mult_distrib field_simps)
text ‹Show 1: integrability of $f(x)^2$ on $\{0..1\}$›
show int_f2: "(λx. (f x)⇧2) integrable_on {0..1}"
using integrable_stretch_real_iff[OF inv_twopi_nz, of "λx. (f x)⇧2" 0 1] W1 g_def img by force
text ‹Show 2: the scaled inequality›
show "integral {0..1} (λx. (2*pi * f x)⇧2) ≤ integral {0..1} (λx. (f' x)⇧2)"
proof -
have lhs_stretch: "integral ((λx. x / (1/(2*pi))) ` {0..1}) (λx. (f (1/(2*pi) * x))⇧2)
= (1 / ¦1/(2*pi)¦) *⇩R integral {0..1} (λx. (f x)⇧2)"
using integral_stretch_real[OF inv_twopi_nz, of 0 1 "λx. (f x)⇧2"] by simp
have lhs_val: "integral {0..2*pi} (λx. (g x)⇧2) = 2*pi * integral {0..1} (λx. (f x)⇧2)"
using lhs_stretch img inv_twopi_pos by (simp add: g_unfold)
have rhs_stretch: "integral ((λx. x / (1/(2*pi))) ` {0..1}) (λx. (1/(2*pi))⇧2 * (f' (1/(2*pi) * x))⇧2)
= (1 / ¦1/(2*pi)¦) *⇩R integral {0..1} (λx. (1/(2*pi))⇧2 * (f' x)⇧2)"
using integral_stretch_real[OF inv_twopi_nz, of 0 1 "λx. (1/(2*pi))⇧2 * (f' x)⇧2"] by simp
have factor_out: "integral {0..1} (λx. (1/(2*pi))⇧2 * (f' x)⇧2) = (1/(2*pi))⇧2 * integral {0..1} (λx. (f' x)⇧2)"
by (simp add: integral_mult_right)
have "integral {0..2*pi} (λx. (g' x)⇧2) = (1 / ¦1/(2*pi)¦) *⇩R integral {0..1} (λx. (1/(2*pi))⇧2 * (f' x)⇧2)"
using img rhs_stretch by (simp add: g'_unfold)
also have "… = 2*pi * ((1/(2*pi))⇧2 * integral {0..1} (λx. (f' x)⇧2))"
using inv_twopi_pos factor_out by simp
finally have "integral {0..2*pi} (λx. (g' x)⇧2) = 2*pi * ((1/(2*pi))⇧2 * integral {0..1} (λx. (f' x)⇧2))" .
with W2 lhs_val
have "2*pi * integral {0..1} (λx. (f x)⇧2) ≤ (1/(2*pi)) * integral {0..1} (λx. (f' x)⇧2)"
by (simp add: power2_eq_square)
then have "(2*pi)⇧2 * integral {0..1} (λx. (f x)⇧2) ≤ integral {0..1} (λx. (f' x)⇧2)"
using twopi_pos by (simp add: power2_eq_square field_simps)
then show ?thesis
by (simp add: power_mult_distrib)
qed
text ‹Show 3: the equality case›
show "integral {0..1} (λx. (2*pi * f x)⇧2) = integral {0..1} (λx. (f' x)⇧2) ⟹
∃c a. ∀x ∈ {0..1}. f x = c * sin (2*pi*x - a)"
proof -
assume eq: "integral {0..1} (λx. (2*pi * f x)⇧2) = integral {0..1} (λx. (f' x)⇧2)"
have "integral {0..2*pi} (λx. (g x)⇧2) = (1 / ¦1/(2*pi)¦) *⇩R integral {0..1} (λx. (f x)⇧2)"
using img integral_stretch_real[OF inv_twopi_nz, of 0 1 "λx. (f x)⇧2"] by (simp add: g_unfold)
also have "… = 2*pi * integral {0..1} (λx. (f x)⇧2)"
using inv_twopi_pos by simp
finally have lhs: "integral {0..2*pi} (λx. (g x)⇧2) = 2*pi * integral {0..1} (λx. (f x)⇧2)" .
have rhs: "integral {0..2*pi} (λx. (g' x)⇧2)
= (1/(2*pi)) * integral {0..1} (λx. (f' x)⇧2)"
proof -
have "integral {0..2*pi} (λx. (g' x)⇧2)
= (1 / ¦1/(2*pi)¦) *⇩R integral {0..1} (λx. (1/(2*pi))⇧2 * (f' x)⇧2)"
using integral_stretch_real[OF inv_twopi_nz, of 0 1 "λx. (1/(2*pi))⇧2 * (f' x)⇧2"] img
by (simp add: g'_unfold)
also have "… = (1/(2*pi)) * integral {0..1} (λx. (f' x)⇧2)"
using twopi_pos by (simp add: power2_eq_square field_simps)
finally show ?thesis .
qed
have "(2*pi)⇧2 * integral {0..1} (λx. (f x)⇧2) = integral {0..1} (λx. (f' x)⇧2)"
using eq by (simp add: power_mult_distrib)
then have "2*pi * integral {0..1} (λx. (f x)⇧2) = (1/(2*pi)) * integral {0..1} (λx. (f' x)⇧2)"
using twopi_pos by (simp add: power2_eq_square field_simps)
then have weq: "integral {0..2*pi} (λx. (g x)⇧2) = integral {0..2*pi} (λx. (g' x)⇧2)"
using lhs rhs by linarith
from W3[OF weq] obtain c a where ca: "∀x ∈ {0..2*pi}. g x = c * sin (x - a)" by auto
have "f x = c * sin (2*pi*x - a)" if "x ∈ {0..1}" for x
proof -
have "2*pi*x ∈ {0..2*pi}" using twopi_pos
using that by auto
with ca show "f x = c * sin (2*pi*x - a)"
by (metis g_def nonzero_mult_div_cancel_left twopi_nz)
qed
then show "∃c a. ∀x ∈ {0..1}. f x = c * sin (2*pi*x - a)" by auto
qed
qed
end