# Exactly one of the following systems is solvable

1. $Ax\leq b$ and $x\geq 0$
2. $b^{T}y<0$, $A^{T}y\geq 0$ and $y\geq 0$

I can show easily that if (1) is true then (2) is not and converse too. That means both statements can not be true at same time. But I want to show that Exactly one of these is always true.

-

I presume $A$ and $b$ are given and the question concerns the existence of $x$ and $y$? And when you have one vector less than another, does that mean each component of the first is less than the corresponding component of the other? – Gerry Myerson Feb 21 at 23:43
Remains to prove that "neither is true" is impossible. – gt6989b Feb 21 at 23:49
– gt6989b Feb 22 at 0:00
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 9, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9499067068099976, "perplexity_flag": "head"}