How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The conic phase-I margin separates strict feasibility but may leave weak infeasibility undecided
Statement
Let be a proper cone, let , and consider the conic feasibility system , . Define its Phase-I margin value with if the set is empty. If , the original system has a strictly feasible point. If or , the original system is infeasible. If and the infimum is attained, the original system is feasible but not strictly feasible; if and the infimum is not attained, the original system is infeasible. Thus a zero value without an attainment check decides neither. A finite-budget Phase-I computation certifies a negative sign from a verified feasible margin point with , or a positive sign from a verified positive lower bound; failure to find strict feasibility is not an infeasibility certificate.
Facts & Assumptions
Given: The conic feasibility model and proper-cone convention of Conic, LP, and convex QP primal-dual models.
A proper cone is closed, convex, closed under addition and positive scaling, and has nonempty interior (Conic, LP, and convex QP primal-dual models).
Proof
If , then by the definition of an infimum some feasible pair has . Write . Then . An open ball around lies in ; translating that ball by keeps it in . Hence , so and .
If the original system has a feasible , then is feasible for the Phase-I set, hence . This proves infeasibility when or the Phase-I set is empty. If is attained, the attaining pair cannot have , since that would force ; hence it has and its is originally feasible. Strict feasibility at some would give . Because is open and , there is small enough that , making feasible and contradicting . If is not attained, original feasibility would itself provide an attaining pair at , a contradiction. Thus zero is inconclusive until attainment is checked.
Depends on
Used by
Dependency tree · two levels
3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization (standard reference, not scraped)