The fractional cost of an indicator is the cover cost (assisting theorem)
ProvedPrimalDualOnline.SetCover.indicator_costA generalized assisting theorem, not a source-facing statement. For any cost function and any finite ,
Restricting the index range to and weighting the full range by the indicator of give the same value. There are no hypotheses at all: costs may be negative and need not cover anything. No set family is in scope, so there is no SetCoverInstance to take. Paired with the previous item, this is what makes the embedding of integral into fractional solutions cost-preserving.
import Definitions.Def_PrimalDualOnline_SetCover import Mathlib.Tactic
open PrimalDualOnline.SetCover
theorem PrimalDualOnline.SetCover.indicator_cost
{E S : Type*} [Fintype E] [Fintype S] [DecidableEq E] [DecidableEq S]
(cost : S → ℝ) (C : Finset S) :
fractionalCost cost (indicator C) = coverCost cost C := by sorryRead-back
What the Lean code literally says, in plain math · claude-opus-5
Notation shared by all four statements
Throughout, and are arbitrary types carrying the instance assumptions that each is a finite type (, finite) and that equality is decidable on each of them ( and both have decidable equality; the decidability on is what permits the constructions and below to be written at all). Elements of are thought of as points and elements of as indices.
A family of sets is a function , written , assigning to each index a finite subset . A cost function is , written ; its values are arbitrary real numbers unless a hypothesis restricts them.
The auxiliary notions used below are, spelled out:
- , the (finite) set of indices whose set contains the point .
- Coverable for : for every point there exists an index with . Equivalently, for every .
- NonnegCost for : for every .
- is a cover (for a finite ): for every there exists with .
- Cover cost: , a finite sum over the members of .
- is a fractional cover (for ): both
- Fractional cost: , a finite sum over all of .
- Indicator: , if and otherwise.
4. indicator_cost
Binders and hypotheses. Fix finite types with decidable equality on each. Explicit arguments: a cost function and a finite subset . There are no hypotheses at all: no coverability, no nonnegativity of , no assumption that is a cover, and indeed no family of sets appears in the statement — the type , its finiteness and its decidable equality enter only as unused binders/instances, while the finiteness of is what makes the left-hand sum over all of meaningful.
Conclusion. The two real numbers
are equal. On the left, the sum ranges over every index of , each term weighted by the indicator of : indices contribute and indices contribute . On the right, the sum ranges only over the members of . The claim is thus that restricting the index range to and multiplying by the indicator over the full index range give the same real value.
Nonnegativity. No sign condition on is assumed or needed for the statement to be well formed: both sides are finite sums of real numbers, always defined, so this is an exact equality of reals with entirely arbitrary — individual costs may be negative, zero, or positive, and either side may be negative. No cancellation, absolute value, or ordering is involved.
Degenerate cases silently included.
- : the right-hand side is the empty sum , and every term on the left is , so the asserted equality reads .
- : the left-hand side has all weights and the equality reads .
- empty: both sides are empty sums, .
- empty, or arbitrary: irrelevant to the claim, since occurs only in the binders.
- : both sides are .
- with negative values: permitted here, unlike in statements 1 and 2, since no nonnegativity hypothesis is carried.
- need not be a cover of anything, and no set family is even in scope.
What is NOT asserted. Nothing about covers, fractional covers, feasibility, or optimality; in particular this is not a claim that is a fractional cover (that is statement 3), and not a claim about optimal values. No inequality is asserted in either direction beyond the stated equality, no claim is made about sums over index sets other than and , and nothing is said about functions other than — in particular no analogous identity for general supported on .
Confirmed by the mission captain (proposal self-audit).