Endpoint phase variation bounded by the number of crossings of an arithmetic grid
ProvedHelfgottZeroCertificate.continuous_phase_abs_grid_variation_lecomplex-analysisexplicit-boundsgoldbachprove2me-goldbach-20261118
Let be a continuous real-valued function on the closed interval with endpoints . Let and , and suppose a finite set contains every point in that interval at which for some integer . Then
No monotonicity of is required. The result controls endpoint phase change using finitely many level-crossing points, and is useful when these points are detected by zeros of an auxiliary real function.
Preamble
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Complex import Mathlib.Topology.Order.IntermediateValue import Mathlib.Tactic open Set open scoped BigOperators
Formal statement
theorem HelfgottZeroCertificate.continuous_phase_abs_grid_variation_le :
∀ {θ : ℝ → ℝ} {a b c p : ℝ},
0 < p →
ContinuousOn θ (Set.uIcc a b) →
∀ (Z : Finset ℝ), (∀ t ∈ Set.uIcc a b, ∀ (k : ℤ), θ t = c + ↑k * p → t ∈ Z) → |θ b - θ a| ≤ p * (↑Z.card + 1) := by sorrySource
Original formalization developed for explicit zero-count estimates in the Prove2Me Weak Goldbach project. Source upstream/Solutions/ContinuousPhaseZeroCount.lean; SHA256 3a48cf3fbbd812e4d4fdcb848266a05c184ea85ba50de16231c0450edd08ee53. Supporting proof is included in the immutable solution submission. Standard arctangent integration / intermediate-value arguments; no claim of a new mathematical theorem.