Three-drop bound for a nonempty finite permutation
ProvedLX.FiniteDropBudget.three_drops_boundcayley-graphscombinatoricsglushkov-lxgroup-theory
Write , with cyclic arithmetic modulo and integer representatives for inequalities; denotes the least nonnegative residue when . For a permutation , write , , , and ; all comparisons use integer representatives. Let and let permute . Then, as an integer inequality,
The drop budget relates descending arrows to displacement and inversion savings.
Preamble
/- Adapted from https://github.com/snow-ghost/glushkov-lx-lean at 8cddcd222b591673dc63475d9d45b9ed5c6eb92c. MIT License Copyright (c) 2026 S. Uskov Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -/ import Mathlib import Definitions.Def_LX_FiniteCutLoad import Definitions.Def_LX_FiniteDescentRank import Definitions.Def_LX_FiniteDropBudget import Definitions.Def_LX_FiniteWindowInversions import Definitions.Def_LX_Graph namespace Int end Int namespace LX end LX namespace LX.Core end LX.Core namespace LX.Core.AffineLift end LX.Core.AffineLift namespace LX.Core.BufferProgram end LX.Core.BufferProgram namespace LX.Core.FiniteCuts end LX.Core.FiniteCuts namespace LX.Core.FiniteGaps end LX.Core.FiniteGaps namespace LX.Core.FiniteWindow end LX.Core.FiniteWindow namespace LX.Core.LiftedModel end LX.Core.LiftedModel namespace LX.Core.PeriodicBuffer end LX.Core.PeriodicBuffer namespace LX.Core.PhysicalModel end LX.Core.PhysicalModel namespace LX.Core.RotationWords end LX.Core.RotationWords namespace LX.Core.ZeroGap end LX.Core.ZeroGap namespace LX.FiniteDropBudget end LX.FiniteDropBudget namespace List end List namespace LX.FiniteDropBudget end LX.FiniteDropBudget open LX open LX.FiniteDropBudget open scoped BigOperators open LX.Core.FiniteCuts
Formal statement
theorem LX.FiniteDropBudget.three_drops_bound {k : ℕ} (p : LX.Core.State (k+1)) :
3*((descendingPositions p).card : ℤ) ≤ (k+1 : ℤ)+
(∑ i, |_root_.LX.Core.FiniteCuts.displacement p i|)-(inversionNumber p : ℤ)+
(backwardUnits p).card-1 := by sorrySource