Let S be a non-empty closed, convex set in Rn and y∉S. Then, there exists a non zero vector p and scalar β such that pTy>β and pTx<β for each x∈S
Since S is non empty closed convex set and y∉S thus by closest point theorem, there exists a unique minimizing point ˆx∈S such that
(x−ˆx)T(y−ˆx)≤0∀x∈S
Let p=(y−ˆx)≠0 and β=ˆxT(y−ˆx)=pTˆx.
Then (x−ˆx)T(y−ˆx)≤0
⇒(y−ˆx)T(x−ˆx)≤0
⇒(y−ˆx)Tx≤(y−ˆx)Tˆx=ˆxT(y−ˆx) i,e., pTx≤β
Also, pTy−β=(y−ˆx)Ty−ˆxT(y−ˆx)
=(y−ˆx)T(y−x)=‖y−ˆx‖2>0
⇒pTy>β
This theorem results in separating hyperplanes. The hyperplanes based on the above theorem can be defined as follows −
Let S1 and S2 are be non-empty subsets of R and H={X:ATX=b} be a hyperplane.
The hyperplane H is said to separate S1 and S2 if ATX≤b∀X∈S1 and ATX≥b∀X∈S2
The hyperplane H is said to strictly separate S1 and S2 if ATX<b∀X∈S1 and ATX>b∀X∈S2
The hyperplane H is said to strongly separate S1 and S2 if ATX≤b∀X∈S1 and ATX≥b+ε∀X∈S2, where ε is a positive scalar.