Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 11 with (3.6) — the earliest-time recursion is the length of a longest path from the origin

Proved
FulkersonPERT.Bounds.earliest_isGreatest_pathLength

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

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

Let NNN be a project network with events 0,…,n0,\dots,n0,…,n and let yab∈Ry_{ab}\in\mathbb Ryab​∈R be arbitrary arc lengths. For an event iii, let ℓi\ell_iℓi​ be given by the recursion ℓ0=0\ell_0=0ℓ0​=0 and

ℓj=max⁡(i,j)∈N(ℓi+yij)(j≠0).\ell_j=\max_{(i,j)\in N}\bigl(\ell_i+y_{ij}\bigr)\qquad(j\ne 0).ℓj​=(i,j)∈Nmax​(ℓi​+yij​)(j=0).

Then ℓi\ell_iℓi​ is the greatest length of a path from the origin to iii: it is the length of some path from 000 to iii, and every path from 000 to iii has length at most ℓi\ell_iℓi​.

Fulkerson defines ℓi(t)\ell_i(t)ℓi​(t) in (3.6) as "the length of a longest or critical path from node 1 to node i", and uses the recursion ℓi+1(tC)=max⁡[ℓ1(tA)+t1,…,ℓi(tA)+ti]\ell_{i+1}(t_C)=\max[\ell_1(t_A)+t_1,\dots,\ell_i(t_A)+t_i]ℓi+1​(tC​)=max[ℓ1​(tA​)+t1​,…,ℓi​(tA​)+ti​] in the proof of (4.4) on p. 11. This statement identifies the two.

Formalization Note Fulkerson's node iii is event i−1i-1i−1. Paths are lists of events starting at 000 and ending at iii, consecutive events joined by arcs; the path consisting of the origin alone has length 000. Arc lengths may be negative.

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_isGreatest_pathLength {n : ℕ} (N : ProjectNetwork n)
    (y : Fin (n + 1) → Fin (n + 1) → ℝ) (i : Fin (n + 1)) :
    IsGreatest {L : ℝ | ∃ p : List (Fin (n + 1)), IsPathTo N p i ∧ L = pathLength y p}
      (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. 5, (3.6); p. 11, §4, proof of (4.4), display before (4.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