weakly_consecutive_last_dvd
theoremverified
In a weakly consecutive sequence of length k, the last term divides k.
Statement
theorem weakly_consecutive_last_dvd {k : ℕ} (σ : Equiv.Perm (Fin k)) (hσ : is_weakly_consecutive σ) (hk : 0 < k) : (σ ⟨k - 1, by omega⟩ : ℕ) + 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 3
- 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…
- weakly_consecutive_first_dvdIn a weakly consecutive sequence of length k, the first term divides k.
- weakly_consecutive_revReading a weakly consecutive sequence backwards gives a weakly consecutive sequence.
- Used by 1
- weakly_consecutive_one_at_end_of_isPrimePowConjecture 5.2 of arXiv:2401.09497 holds when the length k is a prime power: a weakly consecutive sequence of length p^n begins or ends…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem weakly_consecutive_last_dvd {k : ℕ} (σ : Equiv.Perm (Fin k)) (hσ : is_weakly_consecutive σ) (hk : 0 < k) : (σ ⟨k - 1, by omega⟩ : ℕ) + 1 ∣ k := by have h := weakly_consecutive_first_dvd _ (weakly_consecutive_rev σ hσ) hk have e : Fin.rev (⟨0, hk⟩ : Fin k) = ⟨k - 1, by omega⟩ := by ext; simp [Fin.val_rev] simpa [Equiv.trans_apply, Fin.revPerm_apply, e] using h