Fourier–Motzkin elimination

Fourier–Motzkin elimination, also known as the FME method, is a mathematical algorithm for eliminating variables from a system of linear inequalities. It can output real solutions.

The algorithm is named after Joseph Fourier and Theodore Motzkin who independently discovered the method in 1827 and in 1936, respectively.

Elimination

The elimination of a set of variables, say V, from a system of relations (here linear inequalities) refers to the creation of another system of the same sort, but without the variables in V, such that both systems have the same solutions over the remaining variables.

If all variables are eliminated from a system of linear inequalities, then one obtains a system of constant inequalities. It is then trivial to decide whether the resulting system is true or false. It is true if and only if the original system has solutions. As a consequence, elimination of all variables can be used to detect whether a system of inequalities has solutions or not.

Consider a system $S$ of $n$ inequalities with $r$ variables $x_{1}$ to $x_{r}$, with $x_{r}$ the variable to be eliminated. The linear inequalities in the system can be grouped into three classes depending on the sign (positive, negative or null) of the coefficient for $x_{r}$.

• those inequalities that are of the form $x_{r}\geq b_{i}-\sum _{k=1}^{r-1}a_{ik}x_{k}$; denote these by $x_{r}\geq A_{j}(x_{1},\dots ,x_{r-1})$, for $j$ ranging from 1 to $n_{A}$ where $n_{A}$ is the number of such inequalities;
• those inequalities that are of the form $x_{r}\leq b_{i}-\sum _{k=1}^{r-1}a_{ik}x_{k}$; denote these by $x_{r}\leq B_{j}(x_{1},\dots ,x_{r-1})$, for $j$ ranging from 1 to $n_{B}$ where $n_{B}$ is the number of such inequalities;
• those inequalities in which $x_{r}$ plays no role, grouped into a single conjunction $\phi$.

The original system is thus equivalent to

$\max(A_{1}(x_{1},\dots ,x_{r-1}),\dots ,A_{n_{A}}(x_{1},\dots ,x_{r-1}))\leq x_{r}\leq \min(B_{1}(x_{1},\dots ,x_{r-1}),\dots ,B_{n_{B}}(x_{1},\dots ,x_{r-1}))\wedge \phi$.

Elimination consists in producing a system equivalent to $\exists x_{r}~S$. Obviously, this formula is equivalent to

$\max(A_{1}(x_{1},\dots ,x_{r-1}),\dots ,A_{n_{A}}(x_{1},\dots ,x_{r-1}))\leq \min(B_{1}(x_{1},\dots ,x_{r-1}),\dots ,B_{n_{B}}(x_{1},\dots ,x_{r-1}))\wedge \phi$.

The inequality

$\max(A_{1}(x_{1},\dots ,x_{r-1}),\dots ,A_{n_{A}}(x_{1},\dots ,x_{r-1}))\leq \min(B_{1}(x_{1},\dots ,x_{r-1}),\dots ,B_{n_{B}}(x_{1},\dots ,x_{r-1}))$

is equivalent to $n_{A}n_{B}$ inequalities $A_{i}(x_{1},\dots ,x_{r-1})\leq B_{j}(x_{1},\dots ,x_{r-1})$, for $1\leq i\leq n_{A}$ and $1\leq j\leq n_{B}$.

We have therefore transformed the original system into another system where $x_{r}$ is eliminated. Note that the output system has $(n-n_{A}-n_{B})+n_{A}n_{B}$ inequalities. In particular, if $n_{A}=n_{B}=n/2$, then the number of output inequalities is $n^{2}/4$.

Example

Consider the following system of inequalities:

2x − 5y + 4z ≤ 10

3x − 6y + 3z ≤ 9

−x + 5y − 2z ≤ −7

−3x + 2y + 6z ≤ 12

To eliminate x, we can write the inequalities in terms of x:

x ≤ (10 + 5y − 4z)/2

x ≤ (9 + 6y − 3z)/3

x ≥ 7 + 5y − 2z

x ≥ (−12 + 2y + 6z)/3

We have two inequalities with "≤" and two with "≥"; the system has a solution iff the right-hand side of each "≤" inequality is at least the right-hand side of each "≥" inequality. We have 2*2 such combinations:

7 + 5y − 2z ≤ (10 + 5y − 4z)/2

7 + 5y − 2z ≤ (9 + 6y − 3z)/3

(−12 + 2y + 6z)/3 ≤ (10 + 5y − 4z)/2

(−12 + 2y + 6z)/3 ≤ (9 + 6y − 3z)/3

We now have a new system of inequalities, with one fewer variable.

Complexity

Running an elimination step over $n$ inequalities can result in at most $n^{2}/4$ inequalities in the output, thus running $d$ successive steps can result in at most $4(n/4)^{2^{d}}$, a double exponential complexity. This is due to the algorithm producing many unnecessary constraints (constraints that are implied by other constraints). The number of necessary constraints grows as a single exponential. Unnecessary constraints may be detected using linear programming.

Imbert's acceleration theorems

Two "acceleration" theorems due to Imbert permit the elimination of redundant inequalities based solely on syntactic properties of the formula derivation tree, thus curtailing the need to solve linear programs or compute matrix ranks.

Define the history $H_{i}$ of an inequality $i$ as the set of indexes of inequalities from the initial system $S$ used to produce $i$. Thus, $H_{i}=\{i\}$ for inequalities $i\in S$ of the initial system. When adding a new inequality $k:A_{i}(x_{1},\dots ,x_{r-1})\leq B_{j}(x_{1},\dots ,x_{r-1})$ (by eliminating $x_{r}$), the new history $H_{k}$ is constructed as $H_{k}=H_{i}\cup H_{j}$.

Suppose that the variables $O_{k}=\{x_{r},\ldots ,x_{r-k+1}\}$ have been officially eliminated. Each inequality $i$ partitions the set $O_{k}$ into $E_{i}\cup I_{i}\cup R_{i}$:

• $E_{i}$, the set of effectively eliminated variables, i.e. on purpose. A variable $x_{j}$ is in the set as soon as at least one inequality in the history $H_{i}$ of $i$ results from the elimination of $x_{j}$.
• $I_{i}$, the set of implicitly eliminated variables, i.e. by accident. A variable is implicitly eliminated when it appears in at least one inequality of $H_{i}$, but appears neither in inequality $i$ nor in $E_{i}$
• $R_{i}$, all remaining variables.

A non-redundant inequality has the property that its history is minimal.

Theorem (Imbert's first acceleration theorem). If the history $H_{i}$ of an inequality $i$ is minimal, then $1+|E_{i}|\ \leq \ |H_{i}|\ \leq 1+\left|E_{i}\cup (I_{i}\cap O_{k})\right|$.

An inequality that does not satisfy these bounds is necessarily redundant, and can be removed from the system without changing its solution set.

The second acceleration theorem detects minimal history sets:

Theorem (Imbert's second acceleration theorem). If the inequality $i$ is such that $1+|E_{i}|=|H_{i}|$, then $H_{i}$ is minimal.

This theorem provides a quick detection criterion and is used in practice to avoid more costly checks, such as those based on matrix ranks. See the reference for implementation details.

Applications in information theory

Information-theoretic achievability proofs result in conditions under which the existence of a well-performing coding scheme is guaranteed. These conditions are often described by linear system of inequalities. The variables of the system include both the transmission rates (that are part of the problem's formulation) and additional auxiliary rates used for the design of the scheme. Commonly, one aims to describe the fundamental limits of communication in terms of the problem's parameters only. This gives rise to the need of eliminating the aforementioned auxiliary rates, which is executed via Fourier–Motzkin elimination. However, the elimination process results in a new system that possibly contains more inequalities than the original. Yet, often some of the inequalities in the reduced system are redundant. Redundancy may be implied by other inequalities or by inequalities in information theory (a.k.a. Shannon type inequalities). A recently developed open-source software for MATLAB performs the elimination, while identifying and removing redundant inequalities. Consequently, the software's outputs a simplified system (without redundancies) that involves the communication rates only.

Redundant constraint can be identified by solving a linear program as follows. Given a linear constraints system, if the $i$-th inequality is satisfied for any solution of all other inequalities, then it is redundant. Similarly, STIs refers to inequalities that are implied by the non-negativity of information theoretic measures and basic identities they satisfy. For instance, the STI $I(X_{1};X_{2})\leq H(X_{1})$ is a consequence of the identity $I(X_{1};X_{2})=H(X_{1})-H(X_{1}|X_{2})$ and the non-negativity of conditional entropy, i.e., $H(X_{1}|X_{2})\geq 0$. Shannon-type inequalities define a cone in $\mathbb {R} ^{2^{n}-1}$, where $n$ is the number of random variables appearing in the involved information measures. Consequently, any STI can be proven via linear programming by checking if it is implied by the basic identities and non-negativity constraints. The described algorithm first performs Fourier–Motzkin elimination to remove the auxiliary rates. Then, it imposes the information theoretic non-negativity constraints on the reduced output system and removes redundant inequalities.

See also

• Farkas' lemma – can be proved using FM elimination.
• Real closed field – the cylindrical algebraic decomposition algorithm performs quantifier elimination over polynomial inequalities, not just linear.

Further reading

• Schrijver, Alexander (1998). Theory of Linear and Integer Programming. John Wiley & sons. pp. 155–156. ISBN 978-0-471-98232-6.
• Keßler, Christoph W. "Parallel Fourier–Motzkin Elimination". Universität Trier. CiteSeerX 10.1.1.54.657. {{cite web}}: Missing or empty |url= (help)
• Williams, H. P. (1986). "Fourier's Method of Linear Programming and its Dual". American Mathematical Monthly. 93 (9): 681–695. doi:10.2307/2322281. JSTOR 2322281.

External links

• Chapter 1 of Undergraduate Convexity, textbook by Niels Lauritzen at Aarhus University.
• FME software for Information theory, open-source code in MATLAB by Ido B. Gattegno, Ziv Goldfeld and Haim H. Permuter.