Proof of `The bounded projected round-or-cut search`
groundedproofs/Lax263307Proofs/ProjectedOracle.lean · lax-263307
What this proof establishes
- thm✓
Lax263307.AlgorithmParameters - thm✓
Lax263307.CoordinateCatalog - thm✓
Lax263307.DistanceProjection - thm✓
Lax263307.MomentLP - thm✓
Lax263307.NearOracle - thm✓
Lax263307.RationalCutBuffer - thm✓
Lax263307.RationalProjection - thm✓
Lax263307.RegisteredLP - thm✓
Lax263307.RelaxationFeasibility - thm✓
Lax263307.RoundedOracleSearch
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
A fixed pair of registered solvers supplies projection certificates and flow cuts. The protected-cube argument proves completeness of the bounded search; a size-k subset of any larger independent set excludes false rejection.