weakly_consecutive_rev
theoremverified
Reading a weakly consecutive sequence backwards gives a weakly consecutive sequence.
Statement
theorem weakly_consecutive_rev {k : ℕ} (σ : Equiv.Perm (Fin k))
(hσ : is_weakly_consecutive σ) : is_weakly_consecutive (Fin.revPerm.trans σ)- 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
Quot.soundpropext- Built on 1
- 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…
- Used by 1
- weakly_consecutive_last_dvdIn a weakly consecutive sequence of length k, the last term divides k.
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_rev {k : ℕ} (σ : Equiv.Perm (Fin k)) (hσ : is_weakly_consecutive σ) : is_weakly_consecutive (Fin.revPerm.trans σ) := by intro m i j h hij simp only [Equiv.trans_apply, Fin.revPerm_apply] at h ⊢ apply hσ m (Fin.rev i) (Fin.rev j) h have hi := i.isLt have hj := j.isLt have e : ((Fin.rev i : ℕ) : ℤ) - ((Fin.rev j : ℕ) : ℤ) = -((i : ℤ) - (j : ℤ)) := by simp only [Fin.val_rev] omega rw [e] exact (dvd_neg).2 hij