perm_inflection_set_trans_revPerm
Reversing the values of a permutation σ of Fin n (σ.trans Fin.revPerm) does not change its inflection set: perm_inflection_set (σ.trans Fin.revPerm) = perm_inflection_set σ.
Statement
theorem perm_inflection_set_trans_revPerm {n : ℕ} (σ : Equiv.Perm (Fin n)) :
perm_inflection_set (σ.trans Fin.revPerm) = perm_inflection_set σ- Source
- arXiv:2610.38237 (Inflection sets of permutations), Example 3.4: the value-reversal symmetry used as its WLOG step
- Verified
- 07 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- perm_inflection_setFor a permutation σ : Equiv.Perm (Fin n), the inflection set perm_inflection_set σ : Finset (ℕ × ℕ) is the filter of pairs (m, p) in…
- perm_second_derivative_trans_revPermReversing the values of a permutation σ of Fin n (composing with Fin.revPerm, v ↦ n-1-v) negates its discrete second derivative at every…
- perm_second_derivativeFor a permutation σ : Equiv.Perm (Fin n) and a natural number ℓ : ℕ, the discrete second derivative perm_second_derivative σ ℓ : ℤ is (σ…
The proof, explained
The inflection set of a permutation σ consists of index pairs (m, p) where the discrete second derivative changes sign across an interval where it vanishes. Reversing the values of σ negates its second derivative everywhere. Because negation preserves the zero condition and the product of two negated numbers is positive, the defining condition for the inflection set is unchanged.
The goal reduces to showing that the filtering predicate defining the inflection set is invariant under composing σ with Fin.revPerm.
Unfolding `perm_inflection_set` expresses both sides as the sub-finset of pairs (m, p) in [2, n - 1] × [2, n - 1] satisfying m < p, σ''(m) * σ''(p) < 0, and σ''(ℓ) = 0 for all ℓ in (m, p).
unfold perm_inflection_setThe inflection set of σ.trans Fin.revPerm equals the inflection set of σ.
Composing with Fin.revPerm negates the second derivative everywhere by `perm_second_derivative_trans_revPerm`. Under this substitution, the product of the second derivatives at m and p is unchanged since (-a) * (-b) = a * b (`neg_mul_neg`), and the zero condition for intermediate points is preserved since -a = 0 ↔ a = 0 (`neg_eq_zero`). Simplifying with these rules makes the predicates for both sets identical.
uses
perm_second_derivative_trans_revPerm,neg_mul_neg,neg_eq_zerosimp only [perm_second_derivative_trans_revPerm, neg_mul_neg, neg_eq_zero]
perm_second_derivative_trans_revPerm- The discrete second derivative of σ composed with value reversal is the negation of the second derivative of σ: (σ.trans Fin.revPerm)''(ℓ) = - σ''(ℓ).
neg_mul_neg- Multiplying two negated elements is equal to multiplying the elements themselves: (-a) * (-b) = a * b.
neg_eq_zero- An element's negation is zero if and only if the element itself is zero: -a = 0 ↔ a = 0.
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
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 perm_inflection_set_trans_revPerm {n : ℕ} (σ : Equiv.Perm (Fin n)) : perm_inflection_set (σ.trans Fin.revPerm) = perm_inflection_set σ := by unfold perm_inflection_set simp only [perm_second_derivative_trans_revPerm, neg_mul_neg, neg_eq_zero]