Short coordinates from subset majorization
ProvedLX.Core.AffineLift.short_coordinatescayley-graphscombinatoricsglushkov-lxgroup-theory
Write , with cyclic arithmetic modulo and integer representatives for inequalities; denotes the least nonnegative residue when . A board is majorized if for every subset . Let and satisfy and be majorized. Every coordinate satisfies
The doubled integer form retains the parity slack in the half-circle bound. For , the coordinate assertion is vacuous.
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_AffineLift namespace Int end Int namespace LX end LX namespace LX.Core end LX.Core namespace LX.Core.AffineLift end LX.Core.AffineLift namespace List end List namespace LX.Core.AffineLift end LX.Core.AffineLift open LX open LX.Core open LX.Core.AffineLift open scoped BigOperators
Formal statement
theorem LX.Core.AffineLift.short_coordinates {n : ℕ} {d : Fin n → ℤ}
(hd : ∑ i, d i = 0) (hm : Majorized d) (i : Fin n) :
2 * d i ≤ (n : ℤ) - 1 ∧ -((n : ℤ) - 1) ≤ 2 * d i := by sorrySource