The LX diameter equals the maximum of all pairwise word distances
ProvedLX.diameter_eq_max_distThe LX diameter equals the maximum of all pairwise word distances.
Let and write , represented by . The symbol takes a residue to its nonnegative representative and leaves ordinary integers unchanged. Residue sums and differences are cyclic; inequalities use representatives. is the permutation group. denotes finite subsets and a subscript denotes cardinality. Function symbols are written in curried notation. is the maximum shortest word length over permutations, using forward rotation and adjacent exchange. is the shortest length of a word carrying to by right multiplication. All maxima range over the indicated finite permutation groups.
The precise quantified assertion, with all its hypotheses, is
This result is used to constrain the remaining phases or to construct a sorting word with the stated cost.
/- 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_WordMetric namespace Int end Int namespace LX end LX namespace LX.AffineScan end LX.AffineScan namespace LX.AnchoredPhases end LX.AnchoredPhases namespace LX.Antipode end LX.Antipode namespace LX.CenteredLift end LX.CenteredLift 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.FiniteCoordinates end LX.Core.FiniteCoordinates 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.PrunedLift end LX.Core.PrunedLift namespace LX.Core.RotationWords end LX.Core.RotationWords namespace LX.Core.WordReflection end LX.Core.WordReflection namespace LX.Core.ZeroGap end LX.Core.ZeroGap namespace LX.CycleGeometry end LX.CycleGeometry namespace LX.DirectedTokenLower end LX.DirectedTokenLower namespace LX.EventGeometry end LX.EventGeometry namespace LX.FiniteDropBudget end LX.FiniteDropBudget namespace LX.FiniteJoin end LX.FiniteJoin namespace LX.FinitePairReduction end LX.FinitePairReduction namespace LX.ForwardCarrier end LX.ForwardCarrier namespace LX.LiftedScan end LX.LiftedScan namespace LX.MatchingGeometry end LX.MatchingGeometry namespace LX.PairCore end LX.PairCore namespace LX.Small4 end LX.Small4 namespace LX.Small5 end LX.Small5 namespace LX.Small6 end LX.Small6 namespace List end List namespace LX end LX open LX
theorem LX.diameter_eq_max_dist (n : ℕ) [NeZero n] :
diameter n=Finset.univ.sup (fun a : State n =>
Finset.univ.sup (fun b : State n => _root_.LX.dist a b)) := by sorryConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.