The forward carrier is the prefix maximum
ProvedLX.ForwardCarrier.carrier_le_iffcayley-graphscombinatoricsglushkov-lxgroup-theory
Let . Starting with the values , compare neighboring entries successively at , leaving their larger value on the right. Let be the resulting value at position . Then, for ,
This identifies the upper-bound behavior of the carrier used in forward scan arguments.
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_ForwardCarrier namespace Int end Int namespace LX end LX namespace LX.ForwardCarrier end LX.ForwardCarrier namespace List end List namespace LX.ForwardCarrier end LX.ForwardCarrier open LX open LX.ForwardCarrier
Formal statement
theorem LX.ForwardCarrier.carrier_le_iff (F : ℕ → ℤ) (k : ℕ) (x : ℤ) :
sweepPrefix F k k ≤ x ↔ ∀ j ≤ k, F j ≤ x := by sorrySource