Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 6 — ℓ_i(t) does not depend on the arcs of the bundles B_{i+1}, …, B_n

Proved
FulkersonPERT.Bounds.earliest_eq_of_eqOn_bundles

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

critical-pathp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pert

Let NNN be a project network with events 0,…,n0,\dots,n0,…,n, let iii be an event, and let yyy and y′y'y′ be two assignments of real lengths to the arcs. Suppose yab=yab′y_{ab}=y'_{ab}yab​=yab′​ for every arc (a,b)(a,b)(a,b) with b≤ib\le ib≤i, that is, on the bundles B0,…,BiB_0,\dots,B_iB0​,…,Bi​. Then the critical path lengths to iii agree:

ℓi(y)=ℓi(y′).\ell_i(y)=\ell_i(y').ℓi​(y)=ℓi​(y′).

This is Fulkerson's observation on p. 6 that ℓi(t)\ell_i(t)ℓi​(t) "does not depend on the values assigned to arcs of the bundles Bi+1,…,BnB_{i+1},\dots,B_nBi+1​,…,Bn​", which lets the expected length eie_iei​ be written as the sum (3.9) over the arcs of B1∪⋯∪BiB_1\cup\dots\cup B_iB1​∪⋯∪Bi​ only.

Formalization Note Fulkerson's node iii is event i−1i-1i−1; ℓi\ell_iℓi​ is the earliest-event-time recursion of the referenced network definitions.

Preamble
import Mathlib
import Definitions.Def_CriticalPath_Events_ProjectNetwork
import Definitions.Def_CriticalPath_Events_EventTimes
import Definitions.Def_FulkersonPERT_Bounds_Model
Formal statement
namespace FulkersonPERT.Bounds
open CriticalPath.Events
theorem earliest_eq_of_eqOn_bundles {n : ℕ} (N : ProjectNetwork n)
    (y y' : Fin (n + 1) → Fin (n + 1) → ℝ) (i : Fin (n + 1))
    (h : ∀ a b, (a, b) ∈ N.P → b ≤ i → y a b = y' a b) :
    earliest N y i = earliest N y' i := by sorry
end FulkersonPERT.Bounds
Source
Fulkerson, Expected Critical Path Lengths in PERT Networks, RAND Memorandum RM-3075-PR (1962), p. 6, §3, observation before (3.8)–(3.11)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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