Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.5) with (4.9), p. 10 — induction step g_{i+1} ≤ f_{i+1}

Proved
FulkersonPERT.Bounds.meanCPL_le_fNum_step

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

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

Let NNN be a project network with events 0,…,n0,\dots,n0,…,n and let bundle distributions be given, each a probability distribution on its finite support. Let ggg be the critical path lengths (3.13) for the mean arc lengths and fff the numbers (4.2). Let jjj be an event and suppose

gk≤fkfor every event k<j.g_k\le f_k\quad\text{for every event }k<j .gk​≤fk​for every event k<j.

Then gj≤fjg_j\le f_jgj​≤fj​.

This is the step (4.5), proved through (4.9) from (4.8) and the induction assumption; together with g0=f0=0g_0=f_0=0g0​=f0​=0 it yields the left inequality of (4.4).

Formalization Note Fulkerson's node i+1i+1i+1 is the event jjj, and "the induction assumption for 1,…,i1,\dots,i1,…,i" is the hypothesis for every event k<jk<jk<j. The case j=0j=0j=0 is included and is trivial.

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