Presentation is loading. Please wait.

Presentation is loading. Please wait.

Switching Lemmas and Proof Complexity

Published byDarren Mills Modified over 5 years ago

Similar presentations

Presentation on theme: "Switching Lemmas and Proof Complexity"β€” Presentation transcript:

1 Switching Lemmas and Proof Complexity
Paul Beame University of Washington

2 AC0 circuits and restrictions
Unbounded fan-in AND, OR gates, NOT gates Constant depth Restrictions Partial assignment ρ on X : π†βˆˆ 𝟎,𝟏,βˆ— 𝑿 𝝆 = 𝝆 βˆ’πŸ 𝟎,𝟏 Vars(𝝆) = 𝝆 βˆ’πŸ βˆ— Given 𝑭:𝑿→{𝟎,𝟏} define 𝑭 ​ 𝝆 : Vars(𝝆) β†’{𝟎,𝟏} by 𝑭 ​ 𝝆 𝒙′ =𝑭 𝒙 where 𝒙 π’Š = 𝒙 π’Š β€² π’ŠβˆˆVars(𝝆) 𝝆 π’Š π’Šβˆ‰Vars(𝝆)

3 Circuit lower bounds via restrictions
To show lower bound for function 𝑭 choose family/distribution on restrictions 𝑹 𝑭 and show that: For any small, shallow circuit π‘ͺ, Pr π†βˆΌ 𝑹 𝑭 π‘ͺ ​ 𝝆 is not π‘ π‘–π‘šπ‘π‘™π‘’ is small P r π†βˆΌ 𝑹 𝑭 𝑭 ​ 𝝆 is not π‘ π‘–π‘šπ‘π‘™π‘’ is large π‘ π‘–π‘šπ‘π‘™π‘’ = computed by small height decision tree Write 𝑫 𝑭 for the smallest height of any decision tree computing 𝐹.

4 Decision Tree for π‘·π’‚π’“π’Šπ’•π’š(π’™πŸ, π’™πŸ, π’™πŸ‘, π’™πŸ’)
1 𝒙 𝟏 𝟎 𝟏 𝒙 𝟐 𝒙 πŸ‘ 𝒙 πŸ’

5 Lower bound for Parity For every restriction 𝝆, 𝑫 𝐏𝐚𝐫𝐒𝐭𝐲 ​ 𝝆 =|Vars 𝝆 | Let 𝑹 𝒏 β„“ be the set of restrictions on 𝟎,𝟏 𝒏 with Vars 𝝆 =β„“. Theorem (HΓ₯stad): If π‘ͺ is an AC0 circuit of size 𝑺 and depth 𝒅 then for β„“=𝒏/ (πŸπŸ” log 𝑺) π’…βˆ’πŸ there is a π†βˆˆ 𝑹 𝒏 β„“ s.t. 𝑫 π‘ͺ ​ 𝝆 β‰€πŸπŸ” log 𝑺 Corollary: Depth d Parity circuits require 𝟐 𝒏 𝟏/𝒅 πŸπŸ” size.

6 HΓ₯stad’s Switching Lemma
Lemma (HΓ₯stad): Let 𝑭 be a 𝒓-DNF formula on 𝟎,𝟏 𝒏 . For β„“=𝒑𝒏 we have 𝐏𝐫 π†βˆΌ 𝑹 𝒏 β„“ 𝑫 𝑭 ​ 𝝆 β‰₯𝒔 ≀ πŸ–π’‘π’“ 𝒔 Note: If 𝑭′ has a decision tree 𝑻 of height 𝒉 then both 𝑭’ and 𝑭 β€² are expressible as 𝒉-DNF formulas Circuit lower bound follows by repeatedly setting 𝒓= log 𝑺 , 𝒑= 𝟏 πŸπŸ” log 𝑺 , and 𝒔=𝒓+𝟏.

7 HΓ₯stad’s Switching Lemma
Lemma (HΓ₯stad): Let 𝑭 be a 𝒓-DNF formula on 𝟎,𝟏 𝒏 . For β„“=𝒑𝒏 we have 𝐏𝐫 π†βˆΌ 𝑹 𝒏 β„“ 𝑫 𝑭 ​ 𝝆 β‰₯𝒔 ≀ πŸ–π’‘π’“ 𝒔 Proof idea (Razborov): Consider a canonical way of converting 𝑭 ​ 𝝆 to a decision tree. Use existence of a path of length β‰₯𝒔 in canonical decision tree for 𝑭 (plus knowledge of 𝑭) to find a more efficient description of ρ. Conclude that restrictions with this property are rare.

8 Applying a restriction to a DNF
For a DNF 𝑭 and restriction 𝝆, 𝑭 ​ 𝝆 is a DNF that contains a reduced form of each term of 𝑭 not falsifed 𝝆 by removing all literals set to 1, keeps the same order among all the terms that survive, and has no other terms.

9 Canonical decision tree for a DNF
Given an ordered set of variables 𝑽= 𝒙 𝟏 , 𝒙 𝟐 ,…, 𝒙 π’Œ the full tree on 𝑽 is: A full binary tree of height π’Œ that queries the π’Šth variable in 𝑽 at every node on the π’Šth level. with a branch for each total assignment 𝝅 to 𝑽. 𝒙 𝟏 𝒙 𝟐 𝒙 πŸ‘ 𝟎 𝟏

10 Canonical decision tree for a DNF
Let DNF 𝑭=π‘»βˆ¨π‘­β€² where 𝑻 is the first term of 𝑭. The canonical decision tree for 𝑭 consists of: the full tree 𝑫 𝑻 for Vars(𝑻) at the root. for the unique assignment 𝝈 to Vars(𝑻) that sets 𝑻 to 1, the branch of 𝑫 𝑻 labelled 𝝈 has leaf label 1 for every other assignment 𝝅 to Vars 𝑻 , the branch of 𝑫 𝑻 labelled 𝝅 has the canonical decision tree for 𝑭′ ​ 𝝅 at its leaf.

11 Switching Lemma Proof Suppose βˆƒ a path of length 𝒔 in canonical decision tree for 𝑭 ​ 𝝆 Pick leftmost such path 𝝅= 𝝅 𝟏 𝝅 𝟐 … 𝝅 𝒕 Say that 1st term of 𝑭 that survives in 𝑭 ​ 𝝆 is 𝑻 π’Š 𝟏 𝝅 𝟏 assigns to Vars( 𝑻 π’Š 𝟏 ​ 𝝆 ) 𝝈 𝟏 sets (𝑻 π’Š 𝟏 ​ 𝝆 ) ​ 𝝈 𝟏 =𝟏 Repeat for 𝒋=𝟐,…,𝒕 Canonical decision tree for 𝑭 ​ 𝝆 𝝅 𝟏 𝝅 𝟐 𝝅 πŸ‘ 𝝅 πŸ’ 𝝅 πŸ“ 𝝈 𝟏 𝝈 𝟐 𝝈 πŸ‘ 𝝈 πŸ’ 𝝈 πŸ“ 1

12 Switching Lemma Proof Say that 1st term of 𝑭 that survives in 𝑭 ​ 𝝆 𝝅 𝟏 is 𝑻 π’Š 𝟐 𝝅 𝟐 assigns to Vars( 𝑻 π’Š 𝟐 ​ 𝝆 𝝅 𝟏 ) 𝝈 𝟐 sets (𝑻 π’Š 𝟐 ​ 𝝆 𝝅 𝟏 ) ​ 𝝈 𝟐 =𝟏 … Obtain 𝝈 𝟏 ,𝝈 𝟐 ,…, 𝝈 𝒕 and indices of the terms in 𝑭, 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 𝝈 𝟏 𝝅 𝟏 1 𝝈 𝟐 𝝅 𝟐 𝝅 πŸ‘ 1 𝝈 πŸ‘ 𝝅 πŸ’ 1 𝝈 πŸ’ 𝝅 πŸ“ 1 𝝈 πŸ“ 1 Canonical decision tree for 𝑭 ​ 𝝆

13 Switching Lemma Proof Obtain 𝝈 𝟏 ,𝝈 𝟐 ,…, 𝝈 𝒕 and indices of the terms in 𝑭, 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒕 Specify where the 𝒔 vars set by 𝝅, 𝝈 are in 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify values set by 𝝅 Claim: 𝑭 plus 1, 2, & let us reconstruct 𝝆 Canonical decision tree for 𝑭 ​ 𝝆 𝝅 𝟏 𝝅 𝟐 𝝅 πŸ‘ 𝝅 πŸ’ 𝝅 πŸ“ 𝝈 𝟏 𝝈 𝟐 𝝈 πŸ‘ 𝝈 πŸ’ 𝝈 πŸ“ 1

14 Switching Lemma Proof Specify 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒕
Specify where the 𝒔 vars set by 𝝈, 𝝅 are in 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify values set by 𝝅 Claim: 𝑭 plus 1, 2, & 3 let us reconstruct 𝝆 1. 𝝆 β€² ∈ 𝑹 𝒏 β„“βˆ’π’” so | 𝑹 𝒏 β„“βˆ’π’” | possibilities Bit vector of length π’”βˆ’πŸ for partition of [𝒔] into 𝝈 𝟏 , 𝝈 𝟐 ,…, 𝝈 𝒕 plus elt of [𝒓] 𝒔 to indicate positions of each var in its term. Total 𝟐 π’”βˆ’πŸ 𝒓 𝒔 Bit vector of length 𝒔. Total 𝟐 𝒔 So: less than πŸ’π’“ 𝒔 | 𝑹 𝒏 β„“βˆ’π’” | of the 𝝆 have such a bad path

15 Switching Lemma Proof So: 𝐏𝐫 π†βˆΌ 𝑹 𝒏 β„“ 𝑫 𝑭 ​ 𝝆 β‰₯𝒔 ≀ πŸ’π’“ 𝒔 𝑹 𝒏 β„“βˆ’π’” 𝑹 𝒏 β„“ = πŸ’π’“ 𝒔 𝒏 β„“βˆ’π’” 𝟐 π’βˆ’β„“+𝒔 𝒏 β„“ 𝟐 π’βˆ’β„“ = πŸ–π’“ 𝒔 ℓ…(β„“βˆ’π’”+𝟏) π’βˆ’β„“+𝒔 …(π’βˆ’β„“+𝟏) ≀ πŸ–π’“ 𝒔 𝒑 πŸβˆ’π’‘ 𝒔 Can do better with a sharper analysis since β„“=𝒑𝒏

16 Switching Lemma Proof Specify 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒕
Specify where the 𝒔 vars set by 𝝈, 𝝅 are in 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify values set by 𝝅 Claim: 𝑭 plus 1, 2, & 3 let us reconstruct 𝝆 Define 𝝆 π’Œ =𝝆 𝝅 𝟏 … 𝝅 π’Œβˆ’πŸ 𝝈 π’Œ … 𝝈 𝒕 𝝆 𝟏 = 𝝆 β€² 𝑻 π’Š π’Œ is 1st term of 𝑭 surviving in 𝑭 ​ 𝝆 𝝅 𝟏 … 𝝅 π’Œβˆ’πŸ and 𝑻 π’Š π’Œ ​ 𝝆 π’Œ =𝟏 Can build 𝝆 π’Œ+𝟏 from π’Š π’Œ and 𝑭 plus 𝝆 π’Œ , 2, & 3 Once all 𝝈 𝟏 … 𝝈 𝒕 are known they can be removed to get 𝝆 from 𝝆′

17 Proof Complexity Switching Lemmas

18 Pigeonhole formulas and matchings
For PH P 𝒏 : variables 𝒙 π’Šπ’‹ for π’Šβˆˆ 𝒏+𝟏 , π’‹βˆˆ 𝒏 Β¬( 𝒙 π’ŠπŸ βˆ¨β€¦βˆ¨ 𝒙 π’Šπ’ ) for π’Šβˆˆ[𝒏+𝟏] Β¬( 𝒙 π’Šπ’Œ ∨ 𝒙 π’‹π’Œ ) for π’Š,π’‹βˆˆ 𝒏+𝟏 , π’Œβˆˆ[𝒏] Take disjunction, add dual terms, get bijective PHP tautology Restrictions that do not simplify PH P 𝒏 too much are matching restrictions. For 𝝆 βˆƒ partial bipartite matching 𝑴(𝝆) s.t.: 𝝆 sets 𝒙 π’Šπ’‹ to 1 for all π’Š,𝒋 βˆˆπ‘΄(𝝆) 𝝆 sets 𝒙 π’Šπ’‹ to 0 for all π’Š,𝒋 matched in 𝑴(𝝆) but not to each other 𝝆 leaves all other variables unset Define 𝝆 = 𝑴 𝝆 Vars 𝝆 ={ 𝒙 π’Šπ’‹ :π’Š,𝒋 both not matched in 𝑴(𝝆)} For matching restriction 𝝆, PH P 𝒏 ​ 𝝆 ≑PH P π’βˆ’ 𝝆

19 Matching decision trees
Each path or branch 𝝅 is a matching restriction. Each node queries a currently unmatched vertex on the left or right and asks which vertex it is matched to One child node for each possible match Queried vertex will always be matched Leaf labels 0 or 1 Unlike Boolean decision trees, not all assignments have branches consistent with them

20 A matching decision tree on 4 Γ—[3]
?𝟐 𝟐? 𝟐𝟐 πŸπŸ‘ 𝟏𝟐 πŸ‘πŸ 1 ?𝟏 𝟏𝟏 πŸ’πŸ 𝟐𝟏 πŸ‘πŸ πŸ’πŸ 𝟏? πŸπŸ‘ πŸ’? πŸ’πŸ‘ ?πŸ‘ πŸ‘πŸ‘ Associated DNF (𝒙 𝟏𝟏 𝒙 𝟐𝟐 ∨ 𝒙 𝟏𝟏 𝒙 πŸ‘πŸ 𝒙 πŸ’πŸ‘ ∨ 𝒙 𝟏𝟏 𝒙 πŸ’πŸ ∨ 𝒙 𝟐𝟏 𝒙 πŸπŸ‘ ∨ 𝒙 πŸ‘πŸ 𝒙 𝟐𝟐 ∨ 𝒙 πŸ‘πŸ 𝒙 πŸπŸ‘ ∨ 𝒙 πŸ’πŸ 𝒙 𝟏𝟐 ∨ 𝒙 πŸ’πŸ 𝒙 𝟐𝟐 𝒙 πŸπŸ‘ )

21 Matching disjunctions
A π’Œ-matching disjunction is a monotone π’Œ-DNF each of whose terms is a (bipartite) matching For 𝑻 a matching decision tree Let B r 𝒃 𝑻 = set of branches of 𝑻 with leaf label 𝒃. Let 𝐷𝑁𝐹 𝑻 = π…βˆˆB r 𝟏 (𝑻) π’Š,𝒋 βˆˆπ‘΄(𝝅) 𝒙 π’Šπ’‹ If 𝑻 has height π’Œ then 𝐷𝑁𝐹(𝑻) is a π’Œ-matching disjunction Let 𝑻 𝒄 be the same decision tree as 𝑻 but with leaf labels 𝟎 and 𝟏 swapped. A matching decision tree 𝑻 represents a matching disjunction 𝑭 iff every branch 𝝅 in 𝑻 has 𝑭 ​ 𝝅 =𝒃 iff 𝝅 has leaf label 𝒃

22 Full matching decision trees
Suppose that 𝑫 and 𝑹 are ordered sets. For a subset π‘½βŠ‚π‘«βˆͺ𝑹, the full matching tree 𝑻 𝑽 for 𝑽 on 𝑫×𝑹 is given by the following: If 𝑽=βˆ… then 𝑻 𝑽 consists of a single root node. If π‘½βˆ©π‘«β‰ βˆ…, let π’Š be 1st node of 𝑫 in 𝑽; 𝑻 𝑽 has root with query π’Š? and edges for all possible π’‹βˆˆπ‘Ή; edge labelled π’Šπ’‹ leads to root of 𝑻 π‘½βˆ’ π’Š,𝒋 . Else π‘½βˆ©π‘Ήβ‰ βˆ… so let 𝒋 be 1st node of 𝑹 in 𝑽; then 𝑻 𝑽 has root with query ?𝒋 and edges for all possible π’Šβˆˆπ‘«; edge labelled π’Šπ’‹ leads to root of 𝑻 π‘½βˆ’ π’Š,𝒋 If 𝑴 is a matching, write 𝑻 𝑴 for full matching tree for set 𝑽 of nodes matched by 𝑴

23 Full matching tree on 1,2 βŠ‚ 4 Γ—[3]
1? 𝟏𝟏 πŸπŸ‘ 𝟏𝟐 ?𝟐 ?𝟐 𝟐𝟐 πŸ’πŸ πŸ‘πŸ 𝟐𝟐 πŸ’πŸ πŸ‘πŸ

24 Full matching tree on 1,2 ,(2,1) βŠ‚ 4 Γ—[3]
1? 𝟏𝟏 πŸπŸ‘ 𝟏𝟐 𝟐? 𝟐𝟐 πŸπŸ‘ 𝟐? 𝟐𝟏 πŸπŸ‘ 𝟐? 𝟐𝟏 𝟐𝟐 ?𝟏 πŸ’πŸ πŸ‘πŸ πŸ’πŸ πŸ‘πŸ ?𝟐 πŸ’πŸ πŸ‘πŸ ?𝟏 ?𝟐 πŸ’πŸ πŸ‘πŸ

25 Canonical matching decision tree
Given a matching disjunction 𝑭=π‘»βˆ¨π‘­β€² where 𝑻= π’Š,𝒋 βˆˆπ‘΄ 𝒙 π’Šπ’‹ is the 1st term of 𝑭, the canonical matching decision tree for 𝑭 consists of: the full matching tree 𝑻 𝑴 for matching 𝑴 at the root for the matching restriction 𝝈 with 𝑴 𝝆 =𝑴, the branch of 𝑻 𝑴 labelled 𝝈 has leaf label 1 for every other matching restriction 𝝅 labelling a branch of 𝑻 𝑴 , the branch labelled 𝝅 has the canonical matching decision tree for 𝑭′ ​ 𝝅 at its leaf. Note: The canonical matching decision tree for 𝑭 represents 𝑭

26 Intuition for PH P 𝒏 lower bound
Assume wlog proof connectives are unbounded ∨,Β¬ Associate a height π’Œ matching decision tree 𝑻 𝑨 for each subformula 𝑨 appearing in the proof s.t.: 𝑻 𝟎 = 𝑻 𝟏 = 𝑻 𝒙 π’Šπ’‹ is the full matching tree on π’Š,𝒋 with leaf label 1 at level 1 (π’Šπ’‹) and leaf label 0 at level 2. 𝑻 ¬𝑨 = 𝑻 𝑨 𝒄 If 𝑨= β„“ 𝑨 β„“ and each 𝑨 β„“ does not have an ∨ at its root then represents β„“ 𝐷𝑁𝐹( 𝑻 𝑨 β„“ ) β€œπ’Œ-evaluation”. Any tree with all leaves labelled 1 approximates true; all leaves labelled 0 β‰ˆ false If inference rule size ≀𝒄 and π’Œ< 𝒏/𝒄 then all lines are β‰ˆ true but PH P 𝒏 is β‰ˆ false 1

27 Matching Switching Lemma
Let 𝑴 𝒏 β„“ denote the set of matching restrictions 𝝆 on 𝒏+𝟏 Γ— 𝒏 with 𝝆 =π’βˆ’β„“. i.e., Vars 𝝆 =𝑫×𝑹 where 𝑹 =β„“ For any matching disjunction 𝑭, let 𝑫 𝑴 (𝑭) be the minimum height of any matching decision tree representing 𝑭. Lemma (BIKPPW): Let 𝑭 be any 𝒓-matching disjunction on [𝒏+𝟏]Γ—[𝒏]. Then for πŸ’π’“β„“ β„“+𝟏 β‰€π’βˆ’β„“ Pr π†βˆΌ 𝑴 𝒏 β„“ 𝑫 𝑴 𝑭 ​ 𝝆 β‰₯𝒔 ≀ πŸπ’“ β„“ πŸ‘ (β„“+𝟏) π’βˆ’β„“ 𝒔/𝟐

28 Matching Switching Lemma Proof
Suppose βˆƒ a path of length 𝒔 in canonical matching decision tree for 𝑭 ​ 𝝆 Pick leftmost such path 𝝅= 𝝅 𝟏 𝝅 𝟐 … 𝝅 𝒕 Say that 1st term of 𝑭 that survives in 𝑭 ​ 𝝆 is 𝑻 π’Š 𝟏 𝝅 𝟏 assigns to all vertices of matching in 𝑻 π’Š 𝟏 ​ 𝝆 𝝈 𝟏 sets (𝑻 π’Š 𝟏 ​ 𝝆 ) ​ 𝝈 𝟏 =𝟏 Repeat for 𝒋=𝟐,…,𝒕 𝝈 𝟏 𝝅 𝟏 1 𝝈 𝟐 𝝅 𝟐 𝝅 πŸ‘ 1 𝝈 πŸ‘ 𝝅 πŸ’ 1 𝝈 πŸ’ 𝝅 πŸ“ 1 𝝈 πŸ“ 1 Canonical matching decision tree for 𝑭 ​ 𝝆

29 Matching Switching Lemma Proof
Obtain 𝝈 𝟏 ,𝝈 𝟐 ,…, 𝝈 𝒕 and indices of the terms in 𝑭, 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒕 Specify where the ≀𝒔 vars set by 𝝈 are in 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify values set by 𝝅 Claim: 𝑭 plus 1, 2, & let us reconstruct 𝝆 Canonical matching decision tree for 𝑭 ​ 𝝆 𝝅 𝟏 𝝅 𝟐 𝝅 πŸ‘ 𝝅 πŸ’ 𝝅 πŸ“ 𝝈 𝟏 𝝈 𝟐 𝝈 πŸ‘ 𝝈 πŸ’ 𝝈 πŸ“ 1

30 Matching Switching Lemma Proof
Specify 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒕 Specify where the ≀𝒔 vars set by 𝝈 are in 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify values set by 𝝅 Claim: 𝑭 plus 1, 2, & 3 let us reconstruct 𝝆 Define 𝝆 π’Œ =𝝆 𝝅 𝟏 … 𝝅 π’Œβˆ’πŸ 𝝈 π’Œ … 𝝈 𝒕 𝝆 𝟏 = 𝝆 β€² 𝑻 π’Š π’Œ is 1st term of 𝑭 surviving in 𝑭 ​ 𝝆 𝝅 𝟏 … 𝝅 π’Œβˆ’πŸ and 𝑻 π’Š π’Œ ​ 𝝆 π’Œ =𝟏 Can build 𝝆 π’Œ+𝟏 from π’Š π’Œ and 𝑭 plus 𝝆 π’Œ , 2, & 3 Once all 𝝈 𝟏 … 𝝈 𝒕 are known they can be removed to get 𝝆 from 𝝆′

31 Matching Switching Lemma Proof
Specify 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒕 Specify where the 𝒔′≀𝒔 vars set by 𝝈 are in 𝑻 π’Š 𝟏 ,𝑻 π’Š 𝟐 ,…, 𝑻 π’Š 𝒕 Specify values set by 𝝅 Claim: 𝑭 plus 1, 2, & 3 let us reconstruct 𝝆 1. # of vars 𝒔 β€² set by 𝝈 satisfies 𝒔 𝟐 ≀ 𝒔 β€² ≀𝒔 and 𝝆 β€² ∈ 𝑴 𝒏 β„“βˆ’ 𝒔 β€² so 𝒔/πŸβ‰€ 𝒔 β€² ≀𝒔 | 𝑴 𝒏 β„“βˆ’ 𝒔 β€² | possibilities Bit vector of length π’”β€²βˆ’πŸ for partition of [𝒔′] into 𝝈 𝟏 , 𝝈 𝟐 ,…, 𝝈 𝒕 plus elt of [𝒓] 𝒔 β€² to indicate positions of each var in its term. Total β‰€πŸ 𝒔 β€² βˆ’πŸ 𝒓 𝒔 β€² Matching of length 𝒔 touching all vertices of 𝝈. Total β„“ 𝒔 So: less than 𝟐 βˆ’πŸ β„“ 𝒔 𝒔/πŸβ‰€ 𝒔 β€² ≀𝒔 (πŸπ’“) 𝒔 β€² | 𝑴 𝒏 β„“βˆ’ 𝒔 β€² | of the 𝝆 have such a bad path

32 Matching Switching Lemma Proof
| 𝑴 𝒏 β„“ |= 𝒏 β„“ 𝒏+𝟏 …(β„“+𝟐) 𝑴 𝒏 β„“βˆ’ 𝒔 β€² 𝑴 𝒏 β„“ = ℓ… β„“βˆ’ 𝒔 β€² +𝟏 π’βˆ’β„“+ 𝒔 β€² … π’βˆ’β„“+𝟏 β„“+𝟏 …(β„“βˆ’ 𝒔 β€² +𝟐) ≀ β„“(β„“+𝟏) π’βˆ’β„“ 𝒔 β€² So since πŸ’π’“β„“ β„“+𝟏 β‰€π’βˆ’β„“ the probability of height at least 𝒔 is at most 𝟐 βˆ’πŸ β„“ 𝒔 𝒔/πŸβ‰€ 𝒔 β€² ≀𝒔 πŸπ’“ 𝒔 β€² | 𝑴 𝒏 β„“βˆ’ 𝒔 β€² | 𝑴 𝒏 β„“ ≀ β„“ 𝒔 πŸπ’“β„“(β„“+𝟏) π’βˆ’β„“ 𝒔/𝟐 ≀ πŸπ’“ β„“ πŸ‘ (β„“+𝟏) π’βˆ’β„“ 𝒔/𝟐

33 Beyond Bipartite Matching
Similar switching lemmas for Matching restrictions on the variables of the complete graph 𝑲 πŸπ’+𝟏 [B-Pitassi 1996] π’Œ-hypergraph matching restrictions on complete π’Œ-regular hypergraphs over [π’Œπ’+𝒋] for πŸβ‰€π’‹<π’Œ [B-Riis 1998] Switching lemmas for 𝑹𝒆𝒔(π’Œ): [Buss, Impagliazzo, Segerlind 2004] Set a polynomially-small fraction of inputs. [Razborov 2017] Switching lemmas for Tseitin formulas: [Pitassi, Rossman, Servedio, Tan 2016] [HΓ₯stad 2017]

34 Multi-Switching Lemma

35 Using Hastad’s Switching Lemma
Lemma (HΓ₯stad): Let 𝑭 be a 𝒓-DNF formula on 𝟎,𝟏 𝒏 . For β„“=𝒑𝒏 we have 𝐏𝐫 π†βˆΌ 𝑹 𝒏 β„“ 𝑫 𝑭 ​ 𝝆 β‰₯𝒔 ≀ πŸ–π’‘π’“ 𝒔 Use it for π’Œ different 𝒓-DNFs at once by setting 𝒑=𝟏/(πŸπŸ”π’“) and 𝒔=logβ‘π’Œ+𝟏 to get failure probability at most π’Œ πŸ–π’‘π’“ 𝒔 β‰€πŸ/𝟐. To get better failure probability need larger 𝒔. Alternative: A multiswitching lemma.

36 What multiswitching produces
A single decision tree 𝑻 of height 𝒕 is a common 𝒔-partial decision tree for 𝒓-DNF formulas 𝑭 𝟏 , 𝑭 𝟐 ,…, 𝑭 π’Œ iff for every branch 𝝉 of 𝑻, for every π’Šβˆˆ π’Œ , 𝑫 𝑭 π’Š ​ 𝝉 <𝒔. Define 𝑷( 𝑭 𝟏 ,…, 𝑭 π’Œ , 𝒕,𝒔) to be the property that no such tree exists. Multiswitching Lemma (HΓ₯stad 2014*): Let 𝑭 𝟏 , 𝑭 𝟐 ,…, 𝑭 π’Œ be 𝒓-DNF formulas on 𝟎,𝟏 𝒏 . For β„“=𝒑𝒏, integer 𝒕, and 𝒔β‰₯ π₯𝐨𝐠 π’Œ we have 𝐏𝐫 π†βˆΌ 𝑹 𝒏 β„“ [ 𝑷(𝑭 𝟏 ​ 𝝆 , …, 𝑭 π’Œ ​ 𝝆 ,𝒕,𝒔)]β‰€π’Œ (πŸπŸ’π’‘π’“) 𝒕 . *related lemma shown in [Impagliazzo, Matthews, Paturi 2012]

37 What multiswitching produces
Multiswitching Lemma (HΓ₯stad 2014): Let 𝑭 𝟏 , 𝑭 𝟐 ,…, 𝑭 π’Œ be 𝒓-DNF formulas on 𝟎,𝟏 𝒏 . For β„“=𝒑𝒏, integer 𝒕, and 𝒔β‰₯ π₯𝐨𝐠 π’Œ we have 𝐏𝐫 π†βˆΌ 𝑹 𝒏 β„“ [ 𝑷(𝑭 𝟏 ​ 𝝆 , …, 𝑭 π’Œ ​ 𝝆 ,𝒕,𝒔)]β‰€π’Œ (πŸπŸ’π’‘π’“) 𝒕 . Corollary: Let 𝑭 𝟏 , 𝑭 𝟐 ,…, 𝑭 π’Œ be 𝒓-DNF formulas on 𝟎,𝟏 𝒏 . For β„“=𝒑𝒏 and 𝒔β‰₯ π₯𝐨𝐠 π’Œ there is a distribution on restrictions π’Ÿ depending on 𝑭 𝟏 , 𝑭 𝟐 ,…, 𝑭 π’Œ such that: βˆ€π†βˆˆπ’Ÿ. |Vars(𝝆)|=β„“ 𝐏𝐫 π†βˆΌπ’Ÿ βˆƒπ’Šβˆˆ π’Œ .𝑫(𝑭 π’Š ​ 𝝆 β‰₯𝒔]β‰€π’Œ (πŸ’πŸ–π’‘π’“) β„“ .

38 Proof Multiswitching Lemma
The original proof used conditional probability using arbitrary downward-closed conditions and random restrictions with independent probabilities over the bits. We give a bit simpler proof using similar ideas to the proof of the basic lemma. Suppose that 𝑷(𝑭 𝟏 ​ 𝝆 , …, 𝑭 π’Œ ​ 𝝆 ,𝒕,𝒔) holds. We will give a specific construction for a decision tree 𝑻 and bound that probability that it fails to be a height-𝒕 𝒔-partial decision tree for 𝑭 𝟏 ​ 𝝆 , …, 𝑭 π’Œ ​ 𝝆 .

39 Multiswitching Lemma Proof
Given 𝝆,𝑭 𝟏 , …, 𝑭 π’Œ let 𝒋 𝟏 be the first index such that |𝑫 𝑻 𝑭 𝒋 𝟏 ​ 𝝆 |β‰₯𝒔 Let 𝝅 𝟏 be the lexicographically first path in the canonical decision tree for 𝑭 𝒋 𝟏 ​ 𝝆 of length 𝒔. Define 𝝈 𝟏 = 𝝈 𝟏 𝟏 … 𝝈 𝒖 𝟏 as before, except make sure that 𝝈 𝒖 𝟏 reaches the 1-leaf. Then 𝒔 β€² = 𝝈 𝟏 β‰₯𝒔 and 𝒔 β€² <𝒔+𝒓. 𝝅 𝟏 is enough to determine 𝝈 𝟏 . Begin building tree 𝑻 by with complete tree of height 𝒔′ on the variables set by 𝝈 𝟏 For every path 𝝉 𝟏 path of length 𝒔’ in 𝑻 continue as follows:

40 Multiswitching Lemma Proof
Given 𝝆, 𝝉 𝟏 ,𝑭 𝟏 , …, 𝑭 π’Œ let 𝒋 𝟐 be the first index such that |𝑫 𝑻 𝑭 𝒋 𝟐 ​ 𝝆 𝝉 𝟏 |β‰₯𝒔 We have 𝒋 𝟐 β‰₯ 𝒋 𝟏 Let 𝝅 𝟐 be the lexicographically first path in the canonical decision tree for 𝑭 𝒋 𝟐 ​ 𝝆 𝝉 𝟏 of length 𝒔. Define 𝝈 𝟐 = 𝝈 𝟏 𝟐 … 𝝈 𝒖 β€² 𝟐 as before, except make sure that 𝝈 𝒖 β€² 𝟐 reaches the 1-leaf. Then 𝒔 β€²β€² = 𝝈 𝟐 β‰₯𝒔 and 𝒔 β€²β€² <𝒔+𝒓. 𝝅 𝟐 is enough to determine 𝝈 𝟐 . Continue tree 𝑻 at leaf 𝝉 𝟏 with complete tree of height 𝒔′′ on the variables set by 𝝈 𝟐 For every path 𝝉 𝟏 𝝉 𝟐 in 𝑻 continue and repeat until no more indices.

41 Multiswitching Lemma Proof
Failure occurs iff there is a path of length β‰₯𝒕 in 𝑻 Let 𝝉 be lex first such path Let 𝝈 𝟏 ,…, 𝝈 𝒗 correspond to 𝝉 𝟏 ,…, 𝝉 𝒗 . Define 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒗 ∈ 𝑹 𝒏 β„“βˆ’π’• As before we include info to decode 𝝆 from 𝝆′: 𝒋 𝟏 ,…, 𝒋 𝒗 𝒔 vars within terms of 𝑭 𝒋 π’Š set by 𝝅 π’Š for each π’Šβˆˆ[𝒗] Bit vector of values set by 𝝅 𝟏 … 𝝅 𝒗 Bit vector of values set by 𝝉 𝟏 … 𝝉 𝒗 𝝈 𝟏 𝝉 𝟏 𝝈 𝟐 𝝉 𝟐 𝝉 πŸ‘ 𝝈 πŸ‘ 𝝉 πŸ’ 𝝈 πŸ’ 𝝉 πŸ“ 𝝈 πŸ“ Tree 𝑻

42 Multiswitching Lemma Proof
Define 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒗 ∈ 𝑹 𝒏 β„“βˆ’π’• . Info to decode 𝝆 from 𝝆′: 𝒋 𝟏 ,…, 𝒋 𝒗 ∈[π’Œ] 𝒔 vars within terms of 𝑭 𝒋 π’Š set by 𝝅 π’Š for each π’Šβˆˆ[𝒗] Bit vector of values set by 𝝅 𝟏 … 𝝅 𝒗 Bit vector of values set by 𝝉 𝟏 … 𝝉 𝒗 Claim: this is enough to decode given 𝑭 𝟏 ,…, 𝑭 π’Œ ,𝒔,𝒕: Look at first term 𝑻 π’Š 𝟏 set to 1 in 𝑭 𝒋 𝟏 ​ 𝝆 β€² (previous terms will be set to 0). This yields 𝝈 𝟏 𝟏 . Use the information from 2 to determine which vars of 𝑻 π’Š 𝟏 are unset by 𝝆 and hence set by 𝝅 𝟏 𝟏 . Use 3 to determine 𝝅 𝟏 𝟏 . Continue as in the ordinary switching lemma decoding by replacing 𝝈 𝟏 𝟏 by 𝝅 𝟏 𝟏 in 𝝆 β€² to get 𝝆 β€²β€² . Then look at 1st term 𝑻 π’Š 𝟐 set to 1 in 𝑭 𝒋 𝟏 ​ 𝝆 β€²β€² etc. Continue replacing until get all of 𝝈 𝟏 . Now go back and replace 𝝈 𝟏 by 𝝉 𝟏 in 𝝆′ to get 𝝆 𝝉 𝟏 𝝈 𝟐 … 𝝈 𝒗 , using 4.

43 Multiswitching Lemma Proof
Define 𝝆 β€² =𝝆 𝝈 𝟏 … 𝝈 𝒗 ∈ 𝑹 𝒏 β„“βˆ’π’• . Info to decode 𝝆 from 𝝆′: 𝒋 𝟏 ,…, 𝒋 𝒗 ∈[π’Œ] 𝒔 vars within terms of 𝑭 𝒋 π’Š set by 𝝅 π’Š for each π’Šβˆˆ[𝒗] Bit vector of values set by 𝝅 𝟏 … 𝝅 𝒗 Bit vector of values set by 𝝉 𝟏 … 𝝉 𝒗 Counts: π’Œ 𝒗 ≀ 𝟐 π’—βˆ’πŸ 𝒔 π’Œβ‰€π’Œβ‹… 𝟐 𝒕 since 𝒔β‰₯ π₯𝐨𝐠 π’Œ and 𝒔 π’—βˆ’πŸ ≀𝒕 𝟐 𝒕 β€² βˆ’πŸ 𝒓 𝒕 β€² where 𝒕 β€² ≀𝒕 is the total length of 𝝅 𝟏 … 𝝅 𝒗 Total ≀ 𝟐 𝒕 𝒓 𝒕 𝟐 𝒕 β€² 𝟐 𝒕 Total fraction of restrictions where 𝑷( 𝑭 𝟏 ,…, 𝑭 π’Œ , 𝒕,𝒔) holds is at most: πŸπŸ”π’“ 𝒕 |𝑹 𝒏 β„“βˆ’π’• | 𝑹 𝒏 β„“ =π’Œ πŸπŸ”π’“ 𝒕 𝒏 β„“βˆ’π’• 𝟐 π’βˆ’β„“+𝒕 𝒏 β„“ 𝟐 π’βˆ’β„“ = π’Œ πŸ‘πŸπ’“ 𝒕 ℓ…(β„“βˆ’π’•+𝟏) π’βˆ’β„“+𝒕 …(π’βˆ’β„“+𝟏) β‰€π’Œ πŸ‘πŸπ’‘π’“ πŸβˆ’π’‘ 𝒕

Download ppt "Switching Lemmas and Proof Complexity"

Similar presentations

Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.

Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
Chapter 5: Tree Constructions

Chapter 5: Tree Constructions
Inapproximability of Hypergraph Vertex-Cover. A k-uniform hypergraph H= : V – a set of vertices E - a collection of k-element subsets of V Example: k=3.

Inapproximability of Hypergraph Vertex-Cover. A k-uniform hypergraph H= : V – a set of vertices E - a collection of k-element subsets of V Example: k=3.
Trees Chapter 11.

Trees Chapter 11.
Circuit and Communication Complexity. Karchmer – Wigderson Games Given The communication game G f : Alice getss.t. f(x)=1 Bob getss.t. f(y)=0 Goal: Find.

Circuit and Communication Complexity. Karchmer – Wigderson Games Given The communication game G f : Alice getss.t. f(x)=1 Bob getss.t. f(y)=0 Goal: Find.
WSPD Applications.

WSPD Applications.
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.

Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Huffman code and ID3 Prof. Sin-Min Lee Department of Computer Science.

Huffman code and ID3 Prof. Sin-Min Lee Department of Computer Science.
Approximation, Chance and Networks Lecture Notes BISS 2005, Bertinoro March 7-13 2005 Alessandro Panconesi University La Sapienza of Rome.

Approximation, Chance and Networks Lecture Notes BISS 2005, Bertinoro March Alessandro Panconesi University La Sapienza of Rome.
Recursive Definitions and Structural Induction

Recursive Definitions and Structural Induction
Parallel Scheduling of Complex DAGs under Uncertainty Grzegorz Malewicz.

Parallel Scheduling of Complex DAGs under Uncertainty Grzegorz Malewicz.
1 The Monte Carlo method. 2 (0,0) (1,1) (-1,-1) (-1,1) (1,-1) 1 Z= 1 If οƒ– X 2 +Y 2 ο‚£ 1 0 o/w (X,Y) is a point chosen uniformly at random in a 2 ο‚΄ 2 square.

1 The Monte Carlo method. 2 (0,0) (1,1) (-1,-1) (-1,1) (1,-1) 1 Z= 1 If οƒ– X 2 +Y 2 ο‚£ 1 0 o/w (X,Y) is a point chosen uniformly at random in a 2 ο‚΄ 2 square.
CPSC 668Set 10: Consensus with Byzantine Failures1 CPSC 668 Distributed Algorithms and Systems Fall 2009 Prof. Jennifer Welch.

CPSC 668Set 10: Consensus with Byzantine Failures1 CPSC 668 Distributed Algorithms and Systems Fall 2009 Prof. Jennifer Welch.
Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.

Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.
1 Polynomial Church-Turing thesis A decision problem can be solved in polynomial time by using a reasonable sequential model of computation if and only.

1 Polynomial Church-Turing thesis A decision problem can be solved in polynomial time by using a reasonable sequential model of computation if and only.
CPSC 668Set 10: Consensus with Byzantine Failures1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.

CPSC 668Set 10: Consensus with Byzantine Failures1 CPSC 668 Distributed Algorithms and Systems Fall 2006 Prof. Jennifer Welch.
Submitted by : Estrella Eisenberg Yair Kaufman Ohad Lipsky Riva Gonen Shalom.

Submitted by : Estrella Eisenberg Yair Kaufman Ohad Lipsky Riva Gonen Shalom.
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.

Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
03/01/2005Tucker, Sec. 3.11 Applied Combinatorics, 4th Ed. Alan Tucker Section 3.1 Properties of Trees Prepared by Joshua Schoenly and Kathleen McNamara.

03/01/2005Tucker, Sec Applied Combinatorics, 4th Ed. Alan Tucker Section 3.1 Properties of Trees Prepared by Joshua Schoenly and Kathleen McNamara.
Induction and recursion

Induction and recursion

Similar presentations

Ads by Google