Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.4), p. 10 — g_i ≤ f_i ≤ e_i for every node of a PERT network with bundle-independent arc lengths

Proved
FulkersonPERT.Bounds.expected_critical_path_bounds

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

critical-pathexpected-valuejensenp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pert

Let NNN be a PERT network with events 0,…,n0,\dots,n0,…,n: origin 000, terminal nnn, every arc (i,j)(i,j)(i,j) with i<ji<ji<j, and every event on a path from origin to terminal. For every event jjj let the lengths of the arcs entering jjj (the bundle BjB_jBj​) have a finite joint distribution pjp_jpj​ on a finite set SjS_jSj​ of bundle vectors, the distributions of distinct bundles being independent. Let

  1. ei=∑tp(t) ℓi(t)e_i=\sum_t p(t)\,\ell_i(t)ei​=∑t​p(t)ℓi​(t) be the expected length of a critical path to iii, where p(t)=∏jpj(tBj)p(t)=\prod_j p_j(t_{B_j})p(t)=∏j​pj​(tBj​​) and ℓi(t)\ell_i(t)ℓi​(t) is the longest-path length from the origin to iii under the arc lengths ttt (3.7);
  2. gig_igi​ be the critical path length to iii when every arc has its expected length tˉij=∑v∈Sjpj(v)vi\bar t_{ij}=\sum_{v\in S_j}p_j(v)v_itˉij​=∑v∈Sj​​pj​(v)vi​ (3.13);
  3. f0=0f_0=0f0​=0 and fj=∑v∈Sjpj(v)max⁡(i,j)∈N(fi+vi)f_j=\sum_{v\in S_j}p_j(v)\max_{(i,j)\in N}(f_i+v_i)fj​=∑v∈Sj​​pj​(v)max(i,j)∈N​(fi​+vi​) for j≠0j\neq0j=0 (4.2).

Then for every event iii,

gi  ≤  fi  ≤  ei.g_i\;\le\;f_i\;\le\;e_i .gi​≤fi​≤ei​.

The mean-length estimate gig_igi​, the classical PERT figure, is thus a lower bound for the expected project duration, and Fulkerson's numbers fif_ifi​, computable bundle by bundle, are a lower bound that is at least as good.

Formalization Note Fulkerson's node iii is event i−1i-1i−1, so his i=1,…,ni=1,\dots,ni=1,…,n ranges over all events. The maximum over missing arcs is ignored (Finset.sup' over the arcs that exist). There is one arc per ordered pair of events. Arc lengths may be negative: the page assumes nonnegativity but its footnote on p. 4 says this is not essential in §3–§4, so the statement is the more general one. The referenced project network requires origin and terminal to be distinct (n≥1n\ge1n≥1).

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 expected_critical_path_bounds {n : ℕ} (N : ProjectNetwork n) (D : BundleDist n)
    (hD : D.IsProb) :
    ∀ i : Fin (n + 1), meanCPL N D i ≤ fNum N D i ∧ fNum N D i ≤ expectedLength N D i := by sorry
end FulkersonPERT.Bounds
Source
Fulkerson, Expected Critical Path Lengths in PERT Networks, RAND Memorandum RM-3075-PR (1962), p. 10, (4.4)
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