Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 K be a proper cone, let e∈int⁡K, and consider the conic feasibility system Ax=b, h−Gx∈K. Define its Phase-I margin value ρ∗=inf⁡{τ∈R:Ax=b, h−Gx+τe∈K}, with ρ∗=+∞ if the set is empty. If ρ∗<0, the original system has a strictly feasible point. If ρ∗>0 or ρ∗=+∞, the original system is infeasible. If ρ∗=0 and the infimum is attained, the original system is feasible but not strictly feasible; if ρ∗=0 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 τ<0, 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.

[F1]

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

1.1givenF1algebra

If ρ∗<0, then by the definition of an infimum some feasible pair (x,τ) has τ<0. Write h−Gx+τe=k∈K. Then h−Gx=k+(−τ)e. An open ball around (−τ)e∈int⁡K lies in K; translating that ball by k∈K keeps it in K+K⊆K. Hence k+(−τ)e∈int⁡K, so Ax=b and h−Gx∈int⁡K.

2.1F1step 1.1algebra∎

If the original system has a feasible x, then τ=0 is feasible for the Phase-I set, hence ρ∗≤0. This proves infeasibility when ρ∗>0 or the Phase-I set is empty. If ρ∗=0 is attained, the attaining pair cannot have τ<0, since that would force ρ∗<0; hence it has τ=0 and its x is originally feasible. Strict feasibility at some x would give s=h−Gx∈int⁡K. Because int⁡K is open and e∈int⁡K, there is δ>0 small enough that s−δe∈K, making τ=−δ feasible and contradicting ρ∗=0. If ρ∗=0 is not attained, original feasibility would itself provide an attaining pair at τ=0, 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