AFTD Auto-Formalizing Theoretical Domains

weakly_consecutive_first_dvd

theoremverified

In a weakly consecutive sequence of length k, the first term divides k.

Statement

theorem weakly_consecutive_first_dvd {k : ℕ} (σ : Equiv.Perm (Fin k))
    (hσ : is_weakly_consecutive σ) (hk : 0 < k) : (σ ⟨0, hk⟩ : ℕ) + 1 ∣ k
Source
step towards weakly_consecutive_one_at_end_of_isPrimePow (Weakly Consecutive Sequences (2024), arXiv:2401.09497, Conjecture 5.2, prime-power case)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • is_weakly_consecutiveA permutation s of {1, ..., k} is weakly consecutive if for all positions i, j and every m, whenever m divides s(i) and m divides i - j, m…
  • dvd_of_div_ceil_leFor m > 0, if ceil(k/m) <= floor(k/m) then m divides k.
  • fin_card_filter_dvdFor m > 0, exactly (k + m - 1)/m of the positions 0, ..., k-1 are multiples of m.
  • perm_card_filter_dvd_succFor any permutation s of {0, ..., k-1} and any m, exactly floor(k/m) positions j have m dividing s(j) + 1 (the values s(j) + 1 run over 1,…
Used by 3

Lean source view module on GitHub

theorem weakly_consecutive_first_dvd {k : ℕ} (σ : Equiv.Perm (Fin k))    (hσ : is_weakly_consecutive σ) (hk : 0 < k) : (σ ⟨0, hk⟩ : ℕ) + 1 ∣ k := by  set m := (σ ⟨0, hk⟩ : ℕ) + 1 with hm_def  have hm : 0 < m := by omega  apply dvd_of_div_ceil_le m k hm  rw [← fin_card_filter_dvd m k hm, ← perm_card_filter_dvd_succ σ m]  apply Finset.card_le_card  intro j  simp only [Finset.mem_filter, Finset.mem_univ, true_and]  intro hj  apply hσ m ⟨0, hk⟩ j dvd_rfl  simp only [Nat.cast_zero, zero_sub]  exact (dvd_neg).2 (Int.natCast_dvd_natCast.2 hj)
See it in the graphDiscuss this resultChallenge it