Let $X\_1,X\_2,\ldots,X\_n $ be indeterminates. Denote by $S$ the set of all linear inequalities of the form
$X\_{i\_1}+X\_{i\_2}+\ldots+X\_{i\_k} \geq k,$
with $k \in \{ 1,2,\ldots,n \}$ and $1 \leq i\_1< i\_2 < \ldots < i\_k \leq n $. 


Consider the following illustrative example. We are given constraints 
$$
D=\{X\_1+X\_2+X\_3\geq 3, X\_1+X\_3+X\_4 \geq 3, X\_1+X\_2 + X\_4 \geq 3, X\_2+X\_3+X\_4 \geq 3\} \subset S.
$$
We can infer that the inequality 
$$
X\_1+X\_2+X\_3+X\_4 \geq 4,
$$
 another member of $S$, also holds via a "complicated" nonintegral linear combination:
$$
 \frac{1}{3}(X\_1+X\_2+X\_3)+\frac{1}{3}(X\_1+X\_3+X\_4)+\frac{1}{3}(X\_2+X\_3+X\_4)+\frac{1}{3}(X\_1+X\_3+X\_4) \geq 4
$$


In general, it is conceivable that we can be given some set of constraints $D$ and can only infer an inequality in $S$ via a very complicated and nonobvious $\mathbb{R}\_+$-linear combination. Indeed, deducing an inequality is much like solving an LP. I am interested in a simpler algorithm for deducing all inequalities in $S$ from those given in $D$.


One idea I had for such an algorithm is as follows. Notice that 
$$
X\_i+X\_j+X\_k \geq 3 \implies (X\_i \geq 1) \vee (X\_j \geq 1) \vee (X\_k \geq 1).
$$
 For instance, in our case, we know that 
$$
X\_1+X\_2+X\_3 \geq 3 \implies (X\_1 \geq 1) \vee (X\_2 \geq 1) \vee (X\_3 \geq 1)
$$
Therefore we know that the following logical expression is true
$$
((X\_1 \geq 1) \vee (X\_2 \geq 1) \vee (X\_3 \geq 1)) \wedge (X\_2+X\_3+X\_4 \geq 3) \wedge (X\_1+X\_3+X\_4 \geq 3) \wedge (X\_1+X\_3+X\_4 \geq 3).
$$
Expanding, and using 
$$
(X\_a \geq 1) \wedge (X\_b+X\_c+X\_d \geq 3) \implies (X\_a+X\_b+X\_c+X\_d \geq 4),
$$
which amounts to taking an ordinary (having coefficients $+1$) sum, this implies that
$$
 X\_1+X\_2+X\_3+X\_4 \geq 4.
$$
More generally, we can infer from 
$$
X\_{i\_1}+X\_{i\_2}+\ldots+X\_{i\_k} \geq k
$$
 that 
$$
(X\_{i\_2}+\ldots+X\_{i\_k} \geq k-1) \vee (X\_{i\_1}+X\_{i\_3}+\ldots+X\_{i\_k} \geq k-1) \vee \ldots
$$
and we can continue on inductively. One would like to show that no matter which selection of these inequalities we make, assuming everything is consistent, we can sum them to obtain any inequality that can be deduced via a general linear combination. So the question is


${\bf Question}$: Can every inequality that holds be deduced by adding such "simple" inequalities obtained via the procedure above? 


${\bf Remark}$: there are many ways to interpret this question, which leads me to think that something of the sort ought to be known. E.g, in terms of average, in terms of the $n$-hypercube, and in terms of (0,1) matrices.


${\bf Clarification}$: any of the inequalities from $D$ can be used in the disjoint union.



Deducing Linear Inequalities
Consider the inequalities:


$X\_1+X\_2+X\_3 \geq 0$


$X\_3 + X\_4 + X\_5 \geq 0$


$X\_2+X\_4+X\_6 \geq 0$


$X\_1 + X\_5+X\_6 \geq 0$


By adding all and dividing by $2$, we can deduce $X\_1+X\_2+X\_3+X\_4+X\_5+X\_6\geq 0$.


But I don't think you can get it by this sort of logic:


These inequalities are very symmetric - if the $X\_i$ correspond to the edges of the tetrahedron, then the four inequalities correspond to the four faces. Suppose you try to break up one of the inequalities into smaller inequalities in this manner. Without loss of generality,it's $X\_1+X\_2+X\_3 \geq 0$. Suppose it breaks into the smaller inequality $X\_1+X\_2\geq 0$. You will no longer be able to deduce that $X\_1+X\_2+X\_3+X\_4+X\_5+X\_6\geq 0$, because there is now the counterexample $X\_1=0$, $X\_2=0$, $X\_3=-2$, $X\_4=1$, $X\_5=1$, $X\_6=-1$.


We can produce counterexamples of this type using block designs, where the variables correspond to blocks and the inequalities correspond to points. Because each inequality will share variables with each other inequality, combining inequalities through disjoint union will be very difficult. But since each variable shows up in the same number of inequalities, combining them through weighted sum will be very easy.


