M=13 case of FUNC: Difference between revisions

From Polymath Wiki
Jump to navigationJump to search
Tomtom2357 (talk | contribs)
No edit summary
Tomtom2357 (talk | contribs)
Split proof up into lemmas rather than cases
Line 1: Line 1:
On this page, we attempt a proof of the m=13 case of Frankl's conjecture. This will probably end up being a long case analysis, with the cases being tackled out of order, so bear with me while the page is in progress. In all results below, we will try to prove that the set <math>\mathcal{A}</math> is Frankl's (satisfies the conjecture), but will assume the opposite. We will use the terminology defined in the paper "The 11 element case of Frankl's Conjecture" by Ivica Bosnjak and Petar Markovic.
On this page, we attempt a proof of the m=13 case of Frankl's conjecture. This will probably end up being a long case analysis, with the cases being tackled out of order, so bear with me while the page is in progress. In all results below, we will try to prove that the set <math>\mathcal{A}</math> is Frankl's (satisfies the conjecture), but will assume the opposite. We will use the terminology defined in the paper "The 11 element case of Frankl's Conjecture" by Ivica Bosnjak and Petar Markovic.


The smallest size of a non-empty set must be 3, 4, 5, or 6, as if there were a set of size 1 or 2 in <math>\mathcal{A}</math>, it would be Frankl's. Also, if all the nonempty sets have size 7 or larger, then the average set size is greater than 13/2=6.5, so <math>\mathcal{A}</math> is Frankl's (to prove this more rigorously, use the uniform weight function over all the elements in X (the ground set).
==Lemmas==


==Lemmas==
Note that the lemmas will get moved around in the process of proof. Right now this is an outline of the different things to prove.
 
[[Lemma 1]]: If <math>\mathcal{A}</math> contains 2 three element sets with a two element intersection, then <math>\mathcal{A}</math> is Frankl's.
 
[[Lemma 2]]: If <math>\mathcal{A}</math> contains 2 intersecting 3 element sets, then <math>\mathcal{A}</math> is Frankl's.
 
[[Lemma 3]]: If <math>\mathcal{A}</math> contains 2 three element sets, then <math>\mathcal{A}</math> is Frankl's.


[[Lemma 1]]: If <math>\mathcal{A}</math> contains 2 size 3 sets with a two element intersection, then <math>\mathcal{A}</math> is Frankl's.
[[Lemma 4]]: If <math>\mathcal{A}</math> contains a four element set and a three element subset, then <math>\mathcal{A}</math> is Frankl's.


==Case 1: The smallest set has size 3==
[[Lemma 5]]: If <math>\mathcal{A}</math> contains a 3 element set, then <math>\mathcal{A}</math> is Frankl's.


==Case 2: The smallest set has size 4==
[[Lemma 6]]: If <math>\mathcal{A}</math> contains a 4 element set, then <math>\mathcal{A}</math> is Frankl's.


==Case 3: The smallest set has size 5==
[[Lemma 7]]: If <math>\mathcal{A}</math> contains a 5 element set, then <math>\mathcal{A}</math> is Frankl's.


==Case 4: The smallest set has size 6==
[[Lemma 8]]: If m=13, then <math>\mathcal{A}</math> is Frankl's.

Revision as of 12:56, 28 October 2016

On this page, we attempt a proof of the m=13 case of Frankl's conjecture. This will probably end up being a long case analysis, with the cases being tackled out of order, so bear with me while the page is in progress. In all results below, we will try to prove that the set [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's (satisfies the conjecture), but will assume the opposite. We will use the terminology defined in the paper "The 11 element case of Frankl's Conjecture" by Ivica Bosnjak and Petar Markovic.

Lemmas

Note that the lemmas will get moved around in the process of proof. Right now this is an outline of the different things to prove.

Lemma 1: If [math]\displaystyle{ \mathcal{A} }[/math] contains 2 three element sets with a two element intersection, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 2: If [math]\displaystyle{ \mathcal{A} }[/math] contains 2 intersecting 3 element sets, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 3: If [math]\displaystyle{ \mathcal{A} }[/math] contains 2 three element sets, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 4: If [math]\displaystyle{ \mathcal{A} }[/math] contains a four element set and a three element subset, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 5: If [math]\displaystyle{ \mathcal{A} }[/math] contains a 3 element set, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 6: If [math]\displaystyle{ \mathcal{A} }[/math] contains a 4 element set, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 7: If [math]\displaystyle{ \mathcal{A} }[/math] contains a 5 element set, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.

Lemma 8: If m=13, then [math]\displaystyle{ \mathcal{A} }[/math] is Frankl's.