Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (19) — at the critical gain k = (1−K)/(1+K), a > 0, h has no zero iη with η ≠ 0

Proved
DatkoDelayWave.BoundaryDelay.eq19_no_imaginary_zeros_at_threshold

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

control-theorydelay-systemsexponential-polynomialp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a>0a > 0a>0, K=e−2aK = e^{-2a}K=e−2a, k=(1−K)/(1+K)k = (1-K)/(1+K)k=(1−K)/(1+K) and ε>0\varepsilon > 0ε>0. Then for every real η≠0\eta \neq 0η=0,

h(ε,iη)≠0.h(\varepsilon, i\eta) \neq 0 .h(ε,iη)=0.

The paper derives this from (19), 1+a/(iη)=ke−iεη(Ke−2iη−1)/(Ke−2iη+1)1 + a/(i\eta) = k e^{-i\varepsilon\eta}(Ke^{-2i\eta} - 1)/(Ke^{-2i\eta} + 1)1+a/(iη)=ke−iεη(Ke−2iη−1)/(Ke−2iη+1), by comparing moduli. With Eqs. (17)–(18) it places the spectrum at the critical gain in the open left half-plane.

Formalization Note The hypothesis a>0a > 0a>0 is the paper's standing "k>0k > 0k>0" (p. 152) at the critical gain; at a=0a = 0a=0 the critical gain is k=0k = 0k=0 and h(ε,ω)=ω(1+e−2ω)h(\varepsilon,\omega) = \omega(1 + e^{-2\omega})h(ε,ω)=ω(1+e−2ω) vanishes at ω=(n+12)πi\omega = (n + \tfrac12)\pi iω=(n+21​)πi.

Preamble
import Mathlib
import Definitions.Def_DatkoDelayWave_BoundaryDelay_DelayedWave
Formal statement
namespace DatkoDelayWave.BoundaryDelay

theorem eq19_no_imaginary_zeros_at_threshold (a k ε : ℝ) (ha : 0 < a)
    (hkK : k = (1 - K a) / (1 + K a)) (hε : 0 < ε) (η : ℝ) (hη : η ≠ 0) :
    h a k ε ((η : ℂ) * Complex.I) ≠ 0 := by sorry

end DatkoDelayWave.BoundaryDelay
Source
Datko, Lagnese, Polis, An example on the effect of time delays in boundary feedback stabilization of wave equations, SIAM J. Control Optim. 24 (1986), p. 155, proof of the Theorem, part (ii), Eq. (19) and the display after it
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me