Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 1 — under the triangle inequality, d^min_i = d^max_i = δ_ab

Proved
RunwayCPS.DiscreteTime.remark_1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1runwayschedulingtriangle-inequality

Assume k≥1k\ge 1k≥1 and that the separations satisfy the triangle inequality, δac≤δab+δbc\delta_{ac}\le\delta_{ab}+\delta_{bc}δac​≤δab​+δbc​ for all a,b,ca,b,ca,b,c. Let iii be a node of GGG at a stage p≥2p\ge 2p≥2, with penultimate aircraft aaa and final aircraft bbb. Then

dimin⁡=dimax⁡=δab.d^{\min}_i=d^{\max}_i=\delta_{ab}.dimin​=dimax​=δab​.

So under the triangle inequality the third coordinate of each node is determined, and the modified network of §6.2 reduces to the discrete-time CPS network of §6.1.2.

Formalization Note Only the first sentence of Remark 1 is formalized here; the equivalence with the §6.1.2 network enters through Lemma 4.

Preamble
import Mathlib
import Definitions.Def_RunwayCPS_DiscreteTime_ModifiedNetwork
Formal statement
namespace RunwayCPS.DiscreteTime

/-- Remark 1, first sentence (p. 1660): if the separations satisfy the triangle inequality,
then for every node `i` of `G` at a stage `p ≥ 2`, with penultimate and final aircraft `a`
and `b`, `d^min_i = d^max_i = δ_ab`. -/
theorem remark_1 {n : ℕ} [NeZero n] (I : Instance n) (hk : 1 ≤ I.k)
    (htri : TriangleIneq I.δ) (p : ℕ) (hp : 2 ≤ p) (i : List (Fin n))
    (hi : IsGNode I p i) :
    dmin I i = (I.δ (penult i) (RunwayCPS.Makespan.final i) : ℤ) ∧
      dmax I p i = (I.δ (penult i) (RunwayCPS.Makespan.final i) : ℤ) := by sorry

end RunwayCPS.DiscreteTime
Source
Balakrishnan & Chandran, Algorithms for Scheduling Runway Operations Under Constrained Position Shifting, Oper. Res. 58(6) (2010), p. 1660, Remark 1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me