Professional Documents
Culture Documents
Atserias Oberwolfach2017
Atserias Oberwolfach2017
SEMI-ALGEBRAIC
PROOF COMPLEXITY
1 2
2X + 12 Y 2 − XY = 21 (X − Y )2
Albert Atserias
Universitat Politècnica de Catalunya
Barcelona
Subsets of {0, 1}n defined by polynomial inequalities
Variables:
X1 , . . . , Xn and X 1 , . . . , X n
P1 ≥ 0, . . . , Pm ≥ 0
Axioms:
Xi ≥ 0 Xi2 − Xi = 0
1 − Xi ≥ 0 1 − Xi − X i = 0
Obviously positive polynomials
Squares:
Q2
Squares:
Q2
given
P1 ≥ 0, . . . , Pm ≥ 0
and
infer
P ≥ 0.
max{deg(Q0 ), deg(Pi Qi ) : i = 1, . . . , m}
Proof systems for this talk
Proofs:
P1 ≥ 0, . . . , Pt ≥ 0
where each Pi ≥ 0 is
a) an axiom, or
b) a given inequality, or
c) is derived by an inference.
Proof systems for this talk
Proofs:
P1 ≥ 0, . . . , Pt ≥ 0
where each Pi ≥ 0 is
a) an axiom, or
b) a given inequality, or
c) is derived by an inference.
Refutations:
P1 ≥ 0, . . . , Pt ≥ 0
P1 ≥ 0, . . . , Pt ≥ 0
Measures:
P1 ≥ 0, . . . , Pt ≥ 0
Measures:
Notation:
P1 ≥ 0, . . . , Pm ≥ 0 `H
D P ≥0
Notes
Sherali-Adams ≡ star-like LS
Sherali-Adams ≡ star-like LS
A `H 1
D B =⇒ A `HD B
Dual view of inferences
Degree-d pseudoexpectations for LS:
Theorem:
Theorem:
Corollary:
Theorem:
Theorem:
Corollary:
From
X1 + · · · + Xn ≤ 1
in size-O(n3 ) degree-2 height-2n LS
Basic counting (from 2 to 3)
From
X +Y ≤1
Y +Z ≤1
X +Z ≤1
it is possible to derive
X +Y +Z ≤1
in size-O(1) degree-2 height-2 LS.
[exercise]
Basic counting (from k to k + 1)
From
Xi + Xi+1 + · · · + Xi+k−1 ≤1
Xi+1 + · · · + Xi+k−1 + Xi+k ≤ 1
Xi + Xi+k ≤ 1
it is possible to derive
From
it is possible to derive
−1 ≥ 0
Pigeonhole principle
From
it is possible to derive
−1 ≥ 0
From
it is possible to derive
−1 ≥ 0
From
it is possible to derive
−1 ≥ 0
Theorem:
d
Y
E Xic``,j` := ?
`=1
Lower bound for PHPnn−1
d
Y
E Xic``,j` := ?
`=1
d
Y
E Xic``,j` := ?
`=1
d
Y
E Xic``,j` := ?
`=1
X X X 2
(1 − Xi − Xj )Xj + (n − 2) (Xi2 − Xi ) + 1 − Xi
i6=j i i
=
X
1− Xi
i
Basic counting in LS+
Lemma:
X X X 2
(1 − Xi − Xj )Xj + (n − 2) (Xi2 − Xi ) + 1 − Xi
i6=j i i
=
X
1− Xi
i
Corollary:
V := {+1, −1}m
Edge-weights:
W (a, b) := Pr u = a and v = b
u∼V
v∼Nδ (u)
Advanced counting: SSE of δ -noisy hypercube
Vertices:
V := {+1, −1}m
Edge-weights:
W (a, b) := Pr u = a and v = b
u∼V
v∼Nδ (u)
Note:
|A|
W (A, B) = E A(u)B(v) ] and W (A, V ) =
u∼V
v∼Nδ (u)
2m
Advanced counting: SSE of δ -noisy hypercube
Vertices:
V := {+1, −1}m
Edge-weights:
W (a, b) := Pr u = a and v = b
u∼V
v∼Nδ (u)
Note:
|A|
W (A, B) = E A(u)B(v) ] and W (A, V ) =
u∼V
v∼Nδ (u)
2m
Theorem: r !
|A| 1+δ |A|
W (A, A) ≥ m 1−
2 2m
Motivation
Small-Set Expansion (SSE(,δ ) Problem):
SSE Hypothesis:
SSE Hypothesis:
Question:
We’ll prove:
|A| 3 1 |A|
W (A, A) ≤ m + 3 m for all > 0
2 4 4 2
Version to be proved in SOS
We’ll prove:
|A| 3 1 |A|
W (A, A) ≤ m + 3 m for all > 0
2 4 4 2
p
which, by choosing = 4
|A|/2m , implies:
r !
|A| 4 |A|
W (A, A) ≥ m 1−
2 2m
Statement of small-set expansion
XX |A| X 1
W (A, A) = W (a, b)Xa Xb and = Xa
2m 2m
a∈V b∈V a∈V
Statement of small-set expansion
XX |A| X 1
W (A, A) = W (a, b)Xa Xb and = Xa
2m 2m
a∈V b∈V a∈V
by induction on m
and Cauchy-Schwartz
(and, believe it or not, that’s it)
XY ≤ 12 X 2 + 21 Y 2
or
1 2
2X + 21 Y 2 − XY = 12 (X − Y )2
How is it proved?
by induction on m
and Cauchy-Schwartz
(and, believe it or not, that’s it)
XY ≤ 12 X 2 + 21 Y 2
or
1 2
2X + 21 Y 2 − XY = 12 (X − Y )2
X 3 Y ≤ 34 X 4 + 14 Y 4
or
3 4
4X + 41 Y 4 − X 3 Y = 12 X 2 (X − Y )2 + 14 (X 2 − Y 2 )2
Human-readable proof
W (A, A) = E A(u)A(v) ]
u∼V
v∼Nδ (u)
Human-readable proof
W (A, A) = E A(u)A(v) ] = E A(u)Tδ A(u) ]
u∼V u∼V
v∼Nδ (u)
Human-readable proof
W (A, A) = E A(u)A(v) ] = E A(u)Tδ A(u) ]
u∼V u∼V
v∼Nδ (u)
3 1
E A(u)2 + 3 E (Tδ A(u))4
≤
4 u∼V 4 u∼V
Human-readable proof
W (A, A) = E A(u)A(v) ] = E A(u)Tδ A(u) ]
u∼V u∼V
v∼Nδ (u)
3 1
E A(u)2 + 3 E (Tδ A(u))4
≤
4 u∼V 4 u∼V
3 1 2
E A(u)2 + 3 E A(u)2
≤
4 u∼V 4 u∼V
Human-readable proof
W (A, A) = E A(u)A(v) ] = E A(u)Tδ A(u) ]
u∼V u∼V
v∼Nδ (u)
3 1
E A(u)2 + 3 E (Tδ A(u))4
≤
4 u∼V 4 u∼V
3 1 2
E A(u)2 + 3 E A(u)2
≤
4 u∼V 4 u∼V
2
3 1 2
= E A(u) + 3 E A(u)
u∼V 4 4 u∼V
Human-readable proof
W (A, A) = E A(u)A(v) ] = E A(u)Tδ A(u) ]
u∼V u∼V
v∼Nδ (u)
3 1
E A(u)2 + 3 E (Tδ A(u))4
≤
4 u∼V 4 u∼V
3 1 2
E A(u)2 + 3 E A(u)2
≤
4 u∼V 4 u∼V
2
3 1 2
= E A(u) + 3 E A(u)
u∼V 4 4 u∼V
h i
(Tδ F (u))2 (Tδ G(u))2 F (u)2 G(u)2
E ≤ E E
u∼V u∼V u∼V
Roadmap for rest of the talk
1. size-degree trade-offs
2. expanding systems of parity equations
3. interpolation
4. some open problems
5. credit
Trade-offs
p 2
D = O( N log(S)) or S = 2Ω(D /N )
Trade-offs
p 2
D = O( N log(S)) or S = 2Ω(D /N )
for Resolution:
p 2
D = O( N log(S)) or S = 2Ω(D /N )
for Resolution:
for PC:
where
Check 1:
S of EPHPnn−1 is O(n4 )
D of EPHPnn−1 is n
BUT
N of EPHPnn−1 is ≥ n2 .
Sanity checks
Check 1:
S of EPHPnn−1 is O(n4 )
D of EPHPnn−1 is n
BUT
N of EPHPnn−1 is ≥ n2 .
Check 2:
S of G-PHPnn−1 is O(n4 )
N of G-PHPnn−1 is ≤ n · maxdeg(G)
BUT
D of G-PHPnn−1 is O(maxdeg(G)) [exercise]
Proof of size-degree trade-off
Proof strategy:
Proof strategy:
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Proof by induction on N :
Combination lemma:
Combination lemma
Combination lemma:
Combination lemma:
Combination lemma:
F ` XX ≥ X degree-D, height-1
F ` X ≤ (1 − δ) degree-D, height-1
Combination lemma
Combination lemma:
F ` XX ≥ X degree-D, height-1
F ` X ≤ (1 − δ) degree-D, height-1
F ` XX ≥ δ degree-D, height-1
Combination lemma
Combination lemma:
F ` XX ≥ X degree-D, height-1
F ` X ≤ (1 − δ) degree-D, height-1
F ` XX ≥ δ degree-D, height-1
F ` 0 ≥ δ degree-D, height-1
Unrestricting lemma
Unrestricting lemma:
F |X=0 `1D −1 ≥ 0
⇓
F ∪ {X ≤ 0} `1D −1 ≥ 0
⇓
min{E(X) : E ∈ ED (F )} > 0
⇓
max{c : F `1D X ≥ c} > 0
Unrestricting lemma
Unrestricting lemma:
we have
√ 2 /N )
D = O( N log L) or L = 2Ω(D
Feasible interpolation
Problem statement:
Feasible interpolation
Problem statement:
Given a refutation of
A0 (a, y0 ) ∧ A1 (a, y1 )
Ai (a, yi ) is unsatisfiable.
Feasible interpolation for degree-2 LS
The goal is to convert
K1 (y) + L1 (z) + c1 ≥ 0
K2 (y) + L2 (z) + c2 ≥ 0
..
.
cm ≥ 0
into
K1 (y) + a1 ≥ 0 L1 (z) + b1 ≥ 0
K2 (y) + a2 ≥ 0 L2 (z) + b2 ≥ 0
.. ..
. .
am ≥ 0 bm ≥ 0
where
ci = ai + bi for all i = 1, . . . , m.
One inference step:
P 1
c · (Ki (y) + Li (z) + ci ) · y j +
Pi,j 2i
c · (Ki (y) + Li (z) + ci ) · ȳ j +
Pi,j i3
c · (Ki (y) + Li (z) + ci ) · z j +
Pi,j 4i
c · (Ki (y) + Li (z) + ci ) · z̄ j +
Pi,j 5 i
Pi i6 · (K2i (y) + Li (z) + ci )
c +
c · (y j − y j ) +
Pj i7 2
j ci · (z j − z j )
=
Kt (y) + Lt (z) + ct
Inductively ci = ai + bi , so also:
P 1 P 1
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · y j +
Pi,j 2i Pi,j 2i
c · (Ki (y) + ai ) · ȳ j + c · (Li (z) + bi ) · ȳ j +
Pi,j 3i Pi,j 3i
c · (Ki (y) + ai ) · z j + c · (Li (z) + bi ) · z j +
Pi,j 4i Pi,j 4i
c · (Ki (y) + ai ) · z̄ j + c · (Li (z) + bi ) · z̄ j +
Pi,j 5 i Pi,j 5 i
Pi i6 · (K2i (y) + ai )
c + i i · (Li (z) + bi )
c +
c · (y j − y j ) +
Pj 7i 2
j i · (z j − z j )
c
=
Kt (y) + Lt (z) + ct
P 1 P 3
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · z j +
Pi,j 2i Pi,j i4
c · (Ki (y) + ai ) · ȳ j + c · (Li (z) + bi ) · z̄ j +
Pi,j 5 i Pi,j 5 i
Pi i6 · (K2i (y) + ai )+
c Pi i7 · (L2i (z) + bi )+
c
j ci · (y j − y j ) j ci · (z j − z j )
= =
Kt0 (y) + a0 L0t (z) + b0
P 1
c · (Li (z) + bi ) · y j +
Pi,j i2
c · (Li (z) + bi ) · ȳ j +
Pi,j i3
c · (Ki (y) + ai ) · z j +
Pi,j i4
i,j ci · (Ki (y) + ai ) · z̄ j
=
Kt00 (y) + L00t (z) + c00
P 1 P 3
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · z j +
Pi,j 2i Pi,j i4
c · (Ki (y) + ai ) · ȳ j + c · (Li (z) + bi ) · z̄ j +
Pi,j 5 i Pi,j 5 i
Pi ci6 · (K2i (y) + ai )+ Pi ci7 · (L2i (z) + bi )+
j ci · (y j − y j ) j ci · (z j − z j )
= =
Kt0 (y) + a0 L0t (z) + b0
{Ki (y) + ai ≥ 0}
{Li (z) + bi ≥ 0}
|=R Kt00 (y) + L00t (z) + c00 ≥ 0
{0 ≤ y j ≤ 1}
{0 ≤ z j ≤ 1}
P 1 P 3
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · z j +
Pi,j 2i Pi,j i4
c · (Ki (y) + ai ) · ȳ j + c · (Li (z) + bi ) · z̄ j +
Pi,j 5 i Pi,j 5 i
Pi ci6 · (K2i (y) + ai )+ Pi ci7 · (L2i (z) + bi )+
j ci · (y j − y j ) j ci · (z j − z j )
= =
Kt0 (y) + a0 L0t (z) + b0
{Ki (y) + ai ≥ 0}
{Li (z) + bi ≥ 0}
|=R Kt00 (y) + L00t (z) + c00 ≥ 0
{0 ≤ y j ≤ 1}
{0 ≤ z j ≤ 1}
P 8
Pi ci9 · (Ki (y) + ai )+
i ci · (Li (z) + bi )
=
Kt00 (y) + L00t (z) + c00
P 1 P 3
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · z j +
Pi,j 2i Pi,j i4
c · (Ki (y) + ai ) · ȳ j + c · (Li (z) + bi ) · z̄ j +
Pi,j 5 i Pi,j 5 i
Pi ci6 · (K2i (y) + ai )+ Pi ci7 · (L2i (z) + bi )+
j ci · (y j − y j ) j ci · (z j − z j )
= =
Kt0 (y) + a0 L0t (z) + b0
P 8
Pi ci9 · (Ki (y) + ai )+
i ci · (Li (z) + bi )
=
Kt00 (y) + L00t (z) + c00
Split!
P 1 P 3
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · z j +
Pi,j 2i Pi,j i4
c · (Ki (y) + ai ) · ȳ j + c · (Li (z) + bi ) · z̄ j +
Pi,j 5 i Pi,j 5 i
Pi ci6 · (K2i (y) + ai )+ Pi ci7 · (L2i (z) + bi )+
j ci · (y j − y j ) j ci · (z j − z j )
= =
Kt0 (y) + a0 L0t (z) + b0
P 1 P 3
c · (Ki (y) + ai ) · y j + c · (Li (z) + bi ) · z j +
Pi,j 8 i Pi,j 9 i
i ci · (Ki (y) + ai ) i ci · (Li (z) + bi )
= =
Kt00 (y) + a00 L00t (z) + b00
Corollary:
Corollary:
(F (Y ) = X ∧ Yi = 0) ∧ (F (Z) = X ∧ Zi = 1)
Open problems
Open problems