Lemma 3 — A positive-routing path to unused capacity
ProvedMatchingWhileLearning.DEEM.lemma_3Fix the continuum market of §§3.1–3.5: finite nonempty type sets, positive normalized worker proportions, positive finite real-job capacities, an unlimited empty job, and a known distinct-row reward matrix in . Assume generalized imbalance. For any feasible row-stochastic routing and any saturated job, there is a finite alternating job/worker path starting at that job and ending at an under-utilized job, possibly the empty job. All job vertices are distinct, all jobs before the terminal one are saturated, and every incident routing probability along the path is positive. This is the full path used in the source proof.
Differences from the source:
- encoding: arbitrary finite type sets with probability vectors and a dummy job of infinite capacity → finite Lean types, published finite probability distributions, and no capacity constraint at the dummy job; reason: the same markets are represented and no expression zero times infinity is introduced
- reading: the displayed formula reverses the first edge indices, omits the final edge, and the row-sum parenthesis uses a fixed job index → worker-first routing indices, both edges at every step including the final one, and row-stochastic distributions; reason: the prose says every consecutive pair and the graph proof uses positive x(i,j) on the entire shortest path; see insight I2
- encoding: an alternating finite sequence indexed from zero for jobs and one for workers → jobs indexed by Fin (ell+1), workers by Fin ell, with ell positive; reason: a saturated starting job cannot also be the under-utilized terminal job
import Definitions.Def_MatchingWhileLearning_DEEM_Stopping open scoped BigOperators ENNReal open Filter MeasureTheory ProbabilityTheory open MatchingWhileLearning.DEEM
namespace MatchingWhileLearning.DEEM
theorem lemma_3 {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]
[Nonempty I] (M : MatchingWhileLearning.DEEM.Model I J) (hM : Imbalance M) (x : Routing I J)
(hx : CapacityFeasible M (fun i => (x i).prob)) (j : J)
(hj : j ≠ M.kappa) (hfull : load M (fun i => (x i).prob) j = M.capacity j) :
∃ (ell : ℕ) (jobs : Fin (ell + 1) → J) (workers : Fin ell → I),
0 < ell ∧ jobs 0 = j ∧ Function.Injective jobs ∧
(jobs (Fin.last ell) = M.kappa ∨
load M (fun i => (x i).prob) (jobs (Fin.last ell)) < M.capacity (jobs (Fin.last ell))) ∧
(∀ k : Fin ell, jobs k.castSucc ≠ M.kappa ∧
load M (fun i => (x i).prob) (jobs k.castSucc) = M.capacity (jobs k.castSucc)) ∧
(∀ k : Fin ell, 0 < (x (workers k)).prob (jobs k.castSucc) ∧
0 < (x (workers k)).prob (jobs k.succ)) := by sorry
end MatchingWhileLearning.DEEM
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting.
- is a nonempty finite set and a finite set.
- is a model: summing to ; ; for ; with and distinct rows.
Hypotheses.
- Imbalance. For every nonempty and every , .
- Routing. assigns each a probability distribution on .
- Capacity feasibility. With , we have for every .
- A full job. with and .
Conclusion. There exist an integer , jobs , and workers such that:
- , and are pairwise distinct;
- , or ;
- for each : and ;
- for each : and .
Not required. The workers need not be distinct.
Degenerate cases. The hypotheses are satisfiable only if some exists, so . Nothing else is degenerate here.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.