Simultaneous Linear Inequalities:
Yesterday and Today

1  Agenda

Linear inequality implies linearity and order. When combined, the two produce an ordered vector space. Each linear inequality in the simplest environment of the sort is some half-space. Simultaneity implies many instances and so yields intersections of half-spaces. This yields polyhedra as well as arbitrary convex sets, identifying the theory of linear inequalities with convexity.

Convexity stems from the remote ages and reigns in the federation of geometry, optimization, and functional analysis. Convexity feeds generation, separation, calculus, and approximation. Generation appears as duality; separation, as optimality; calculus, as representation; and approximation, as stability.

This talk addresses the origin and the state of the art of the relevant areas with a particular emphasis on the Farkas Lemma. Our aim is to demonstrate how Boolean valued analysis may be applied to simultaneous linear inequalities with operators. This particular theme is another illustration of the deep and powerful technique of “stratified validity” which is characteristic of Boolean valued analysis.

2  Environment

Assume that X is a real vector space, Y is a Kantorovich space also known as a complete vector lattice or a Dedekind complete Riesz space. Let B:= B(Y) be the base of Y, i.e., the complete Boolean algebras of positive projections in Y; and let m(Y) be the universal completion of Y. Denote by L(X,Y) the space of linear operators from X to Y. In case X is furnished with some Y-seminorm on X, by L(m)(X,Y) we mean the space of dominated operators from X to Y. As usual, {T ≤ 0}:={x ∈X : Tx ≤ 0}; ker(T)=T-1(0) for T ∈ L(X,Y).

3  Kantorovich's Theorem

If W is ordered by W+ and A(X) – W+= W+ – A(X)=W, then
(∃κ≥ 0) 𝔛A=B ↔ {A ≤ 0}⊂ {B ≤ 0}.

4  The Alternative

 Let X be a Y-seminormed real vector space, with Y a Kantorovich space. Assume that A1,...,AN and B belong to  L(m)(X,Y).

Then one and only one of the following holds:

(1) There are x ∈ X and b, b' ∈ B such that b'≤ b and
b'Bx > 0, bA1 x ≤ 0,..., bAN x ≤ 0.

(2) There are α1,..., αN ∈ Orth(m(Y))+ such that B=∑k=1Nαk Ak.

5  Inhomogeneous Inequalities

Let X be a Y-seminormed real vector space, with Y a Kantorovich space. Assume given some dominated operators A1,...,AN, B ∈ L(m)(X,Y) and elements u1,..., uN,v ∈ Y. The following are equivalent:

(1) For all b∈ B the inhomogeneous operator inequality bBx ≤ bv is a consequence of the consistent simultaneous inhomogeneous operator inequalities bA1 x ≤ bu1,..., bAN x ≤buN, i.e.,
{bB ≤ bv} ⊃ {bA1 ≤ bu1}∩... ∩{bAN ≤ buN}.

(2) There are positive orthomorphisms α1,..., αN ∈ Orth(m(Y)) satisfying
B= N

αk Ak;    v ≥ N

αk uk.

6  Freedom and Inequality

Abstraction is the freedom of generalization. Freedom is the loftiest ideal and idea of man, but it is demanding, limited, and vexing. So is abstraction. So are its instances in convexity, hence, in simultaneous inequalities.

The freedom of set theory empowered us with the Boolean-valued models yielding a lot of surprising and unforeseen visualizations of the ingredients of mathematics. Many promising opportunities are open to modeling the powerful habits of reasoning and verification. Convexity, the theory of simultaneous linear inequalities in disguise, is a topical illustration of the wisdom and strength of mathematics, the ever fresh art and science of calculus.

Freedom presumes liberty and equality. Inequality paves way to freedom.

S. Kutateladze

Sobolev Institute of Mathematics
Novosibirsk, Russia
June 28, 2010

This talk was delivered on July 20, 2010 at the opening session of the International Scientific Conference “Order Analysis and Related Problems of Mathematical Modeling” (Vladikavkaz, 19–24 July 2010).

Slides in PDF.
Preprint No. 245, Sobolev Institute, Novosibirsk (2010).

Vladikavkaz, July 19,2010 A talk at Khetagurov North-Ossetian State University on July 20, 2010.
A video-report on the visit to Vladikavkaz.

At the Town of the Dead At the Town of the Dead.
English Page
Russian Page

File translated from TEX by TTH, version 3.86.
On 28 Jun 2010, 19:27.