Skip to content

Commit 460ff68

Browse files
smmercuriPaul-Lez
andauthored
fix(ErdosProblems): 274 (#2390)
Use existential quantifier instead of universal. This is false if `G` has prime order, since the only exact coverings of size `> 1` are `p`-copies of `{1}`, which all have the same size. --------- Co-authored-by: Paul Lezeau <lezeau@google.com>
1 parent a2cc6ef commit 460ff68

File tree

1 file changed

+4
-3
lines changed

1 file changed

+4
-3
lines changed

FormalConjectures/ErdosProblems/274.lean

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -47,12 +47,13 @@ structure Group.ExactCovering (G : Type*) [Group G] (ι : Type*) [Fintype ι] wh
4747

4848
/--
4949
If `G` is a group then can there exist an exact covering of `G` by more than one cosets of
50+
Does there exist a group `G` with an exact covering by more than one cosets of
5051
different sizes? (i.e. each element is contained in exactly one of the cosets.)
5152
-/
5253
@[category research open, AMS 20]
53-
theorem erdos_274 : answer(sorry) ↔ ∀ᵉ (G : Type*) (h : Group G) (hG : 1 < ENat.card G),
54-
(∃ (ι : Type*) (_ : Fintype ι) (P : Group.ExactCovering G ι),
55-
1 < Fintype.card ι ∧ (Set.range P.parts).Pairwise fun A B ↦ #A ≠ #B) := by
54+
theorem erdos_274 : answer(sorry) ↔ (G : Type*) (h : Group G) (hG : 1 < ENat.card G)
55+
(ι : Type*) (_ : Fintype ι) (P : Group.ExactCovering G ι),
56+
1 < Fintype.card ι ∧ (Set.range P.parts).Pairwise fun A B ↦ #A ≠ #B := by
5657
sorry
5758

5859
/--

0 commit comments

Comments
 (0)