Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Greedy Residual Allocation

Abstract

Greedy allocation maximizes one-step gain and positive witnesses force progress.

Theorem 1.1 (A greedy choice maximizes one-step weighted gain).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/ResidualCoverage/GreedyResidualAllocation.greedy_one_step_optimal (✓ std3). ∎

Source. Repository-derived.

Commentary.

IsGreedyChoice supplies pool membership and marginal-gain maximality over the finite weighted residual sums.

The insertion identity converts marginal maximality into the stated one-step WeightedGain bound.

Theorem 1.2 (A positive uncovered witness forces positive greedy progress).

Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/ResidualCoverage/GreedyResidualAllocation.greedy_positive_progress (✓ std3). ∎

Source. Repository-derived.

Commentary.

An available alternative, uncovered residual, true separation, and positive weight form a concrete progress witness.

Greedy maximality transfers its positive marginal gain to the selected definition.

References