Ordered comparisons and forward sweep prefixes
DefinitionLX_ForwardCarriercayley-graphscombinatoricsglushkov-lxgroup-theory
For an integer sequence indexed by natural numbers, comparison at replaces its values at by their minimum and maximum, respectively, and leaves other entries unchanged. A sweep prefix of length zero is the original sequence. Its successor applies comparison at the next index to the preceding prefix. Thus a length prefix compares adjacent pairs starting at zero through . These operations specify the linear comparison process before a cyclic seam is reached.
Definition code
/- 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 namespace Int end Int namespace LX end LX namespace LX.ForwardCarrier end LX.ForwardCarrier namespace List end List namespace LX.ForwardCarrier /-- Physical target values during a forward sweep before the seam is reached. -/ def compareAt (F : ℕ → ℤ) (k j : ℕ) : ℤ := if j = k then min (F k) (F (k+1)) else if j = k+1 then max (F k) (F (k+1)) else F j def sweepPrefix (F : ℕ → ℤ) : ℕ → ℕ → ℤ | 0 => F | k+1 => compareAt (sweepPrefix F k) k end LX.ForwardCarrier
Source