AFTD Auto-Formalizing Theoretical Domains

linear_comb_cos_sin_roots_separation

theoremverified

Let c, d be real numbers not both zero. If t₁ < t₂ and t₂ - t₁ < π, then c * cos t + d * sin t cannot vanish at both t₁ and t₂.

Statement

theorem linear_comb_cos_sin_roots_separation (c d t₁ t₂ : ℝ)
    (hcd : c ≠ 0 ∨ d ≠ 0) (hlt : t₁ < t₂) (hdist : t₂ - t₁ < Real.pi)
    (hzero₁ : c * Real.cos t₁ + d * Real.sin t₁ = 0)
    (hzero₂ : c * Real.cos t₂ + d * Real.sin t₂ = 0) : False
Source
arXiv:2610.38368 Lemma 2.1
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

Read back from the Lean

For all real numbers $c, d, t₁, t₂$, the following hypotheses cannot simultaneously hold (they imply False): 1. $c \ne 0$ or $d \ne 0$, 2. $t₁ < t₂$, 3. $t₂ - t₁ < \pi$, 4. $c \cos t₁ + d \sin t₁ = 0$, and 5. $c \cos t₂ + d \sin t₂ = 0$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof works by viewing the vanishing of c * cos t + d * sin t at t₁ and t₂ as a homogeneous linear system in c and d. Eliminating d and c via the sine subtraction formula shows that both c * sin(t₂ - t₁) = 0 and d * sin(t₂ - t₁) = 0. Since c and d are not both zero, this forces sin(t₂ - t₁) = 0. However, the separation condition 0 < t₂ - t₁ < π guarantees that sin(t₂ - t₁) > 0, producing a contradiction.

  1. sin(t₂ - t₁) > 0

    Since t₁ < t₂, the difference t₂ - t₁ is strictly positive. Together with the assumption that t₂ - t₁ < π, this places t₂ - t₁ in the interval (0, π), where the sine function is strictly positive.

    lines 6–8

    uses sub_pos.mpr, Real.sin_pos_of_mem_Ioo

      have hpos : 0 < t₂ - t₁ := sub_pos.mpr hlt
      have hsin_pos : 0 < Real.sin (t₂ - t₁) :=
        Real.sin_pos_of_mem_Ioo ⟨hpos, hdist⟩
  2. c * sin(t₂ - t₁) = 0

    Using the sine subtraction formula, we expand sin(t₂ - t₁) and rewrite c * sin(t₂ - t₁) as (c * cos t₁ + d * sin t₁) * sin t₂ - (c * cos t₂ + d * sin t₂) * sin t₁. Since both parenthesized terms vanish by hypothesis, the whole expression is equal to 0.

    lines 9–14

    uses Real.sin_sub

      have h1 : c * Real.sin (t₂ - t₁) = 0 := by
        calc c * Real.sin (t₂ - t₁)
          _ = (c * Real.cos t₁ + d * Real.sin t₁) * Real.sin t₂ -
              (c * Real.cos t₂ + d * Real.sin t₂) * Real.sin t₁ := by
            rw [Real.sin_sub]; ring
          _ = 0 := by rw [hzero₁, hzero₂]; ring
  3. d * sin(t₂ - t₁) = 0

    Analogously, eliminating c yields d * sin(t₂ - t₁) = (c * cos t₂ + d * sin t₂) * cos t₁ - (c * cos t₁ + d * sin t₁) * cos t₂. Since both terms in parentheses are zero, this product is also zero.

    lines 15–20

    uses Real.sin_sub

      have h2 : d * Real.sin (t₂ - t₁) = 0 := by
        calc d * Real.sin (t₂ - t₁)
          _ = (c * Real.cos t₂ + d * Real.sin t₂) * Real.cos t₁ -
              (c * Real.cos t₁ + d * Real.sin t₁) * Real.cos t₂ := by
            rw [Real.sin_sub]; ring
          _ = 0 := by rw [hzero₁, hzero₂]; ring
  4. sin(t₂ - t₁) = 0

    By assumption, at least one of c or d is nonzero. If c ≠ 0, then from c * sin(t₂ - t₁) = 0 we conclude sin(t₂ - t₁) = 0. If instead d ≠ 0, then from d * sin(t₂ - t₁) = 0 we likewise obtain sin(t₂ - t₁) = 0.

    lines 21–24

    uses mul_eq_zero.mp

      have hsin_zero : Real.sin (t₂ - t₁) = 0 := by
        rcases hcd with hc | hd
        · exact (mul_eq_zero.mp h1).resolve_left hc
        · exact (mul_eq_zero.mp h2).resolve_left hd
  5. Contradiction (False)

    The statements sin(t₂ - t₁) > 0 and sin(t₂ - t₁) = 0 are mutually contradictory. Linear arithmetic detects this contradiction and closes the proof.

    line 25

      linarith
sub_pos.mpr
A difference y - x is strictly positive if x < y.
Real.sin_pos_of_mem_Ioo
The sine function is strictly positive on the open interval (0, π).
Real.sin_sub
The sine angle subtraction formula: sin(x - y) = sin x * cos y - cos x * sin y.
mul_eq_zero.mp
If a product of two numbers is zero, at least one of the factors must be zero.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- A nonzero linear combination of cosine and sine cannot have two roots whose distance is less than π. -/theorem linear_comb_cos_sin_roots_separation (c d t₁ t₂ : ℝ)    (hcd : c ≠ 0 ∨ d ≠ 0) (hlt : t₁ < t₂) (hdist : t₂ - t₁ < Real.pi)    (hzero₁ : c * Real.cos t₁ + d * Real.sin t₁ = 0)    (hzero₂ : c * Real.cos t₂ + d * Real.sin t₂ = 0) : False := by  have hpos : 0 < t₂ - t₁ := sub_pos.mpr hlt  have hsin_pos : 0 < Real.sin (t₂ - t₁) :=    Real.sin_pos_of_mem_Ioo ⟨hpos, hdist⟩  have h1 : c * Real.sin (t₂ - t₁) = 0 := by    calc c * Real.sin (t₂ - t₁)      _ = (c * Real.cos t₁ + d * Real.sin t₁) * Real.sin t₂ -          (c * Real.cos t₂ + d * Real.sin t₂) * Real.sin t₁ := by        rw [Real.sin_sub]; ring      _ = 0 := by rw [hzero₁, hzero₂]; ring  have h2 : d * Real.sin (t₂ - t₁) = 0 := by    calc d * Real.sin (t₂ - t₁)      _ = (c * Real.cos t₂ + d * Real.sin t₂) * Real.cos t₁ -          (c * Real.cos t₁ + d * Real.sin t₁) * Real.cos t₂ := by        rw [Real.sin_sub]; ring      _ = 0 := by rw [hzero₁, hzero₂]; ring  have hsin_zero : Real.sin (t₂ - t₁) = 0 := by    rcases hcd with hc | hd    · exact (mul_eq_zero.mp h1).resolve_left hc    · exact (mul_eq_zero.mp h2).resolve_left hd  linarith
See it in the graphDiscuss this resultChallenge it