-
Notifications
You must be signed in to change notification settings - Fork 231
Expand file tree
/
Copy path602.lean
More file actions
47 lines (34 loc) · 1.33 KB
/
602.lean
File metadata and controls
47 lines (34 loc) · 1.33 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
import FormalConjectures.Util.ProblemImports
/-!
# Erdős Problem 602
*Reference:* [erdosproblems.com/602](https://www.erdosproblems.com/602)
-/
namespace Erdos602
open Cardinal
universe u v
variable (ι : Type u) (α : Type v) (A : ι → Set α) (h : ∀ i, #(A i) = ℵ₀)
variable (hij : Pairwise fun i j ↦ (A i ∩ A j).Finite)
/--
**Erdős Problem 602:**
Let $(A_i)$ be a family of sets with $|A_i| = \aleph_0$ for all $i$, such that for any $i \neq j$ we have
$|A_i \cap A_j|$ finite and $\neq 1$.
Is there a $2$-colouring of $\bigcup_i A_i$ such that no $A_i$ is monochromatic?
-/
@[category research open, AMS 03 05]
theorem erdos_602 :
(∃ (c : α → Fin 2),
∀ i, #(c '' {x : α | x ∈ A i}) ≠ 1) ↔ answer(sorry) := by
sorry
end Erdos602