/-
Copyright 2026 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.
-/
module
public import FormalConjecturesUtilErdős Problem 148
References:
[ElPl21] Elsholtz, Christian and Planitzer, Stefan, Sums of four and more unit fractions and approximate parametrizations. Bull. Lond. Math. Soc. (2021), 695-709.
[Ko14] Konyagin, S. V., Double exponential lower bound for the number of representations of unity by Egyptian fractions. Math. Notes (2014), 277-281.
@[expose] public sectionopen Filter Realnamespace Erdos148
F k is the number of solutions to $1 = \frac{1}{n_1} + \cdots + \frac{1}{n_k}$ with
$1 \leq n_1 < \cdots < n_k$, that is, the number of $k$-element sets of positive integers whose
reciprocals sum to $1$.
noncomputable def F (k : ℕ) : ℕ :=
{S : Finset ℕ | S.card = k ∧ 0 ∉ S ∧ ∑ n ∈ S, (1 : ℚ) / n = 1}.ncard
The sequence $u_0 = 1$, $u_{n+1} = u_n(u_n + 1)$ of [ElPl21, Corollary 3]:
$1, 2, 6, 42, 1806, \ldots$, a shifted copy of Sylvester's sequence. This is the sequence
Erdos315.u of Erdős Problem 315.
def u : ℕ → ℕ
| 0 => 1
| n + 1 => u n * (u n + 1)
The constant $c_0 = \lim_{n \to \infty} u_n^{2^{-n}} = 1.5979102\ldots$ of
[ElPl21, Corollary 3]. The sequence $u_n^{2^{-n}}$ is increasing and bounded by $2$
[ElPl21, Remark 3], so the limit is its supremum. This constant is the square of the Vardi
constant $1.26408\ldots$, which is Erdos315.c₀.
noncomputable def c₀ : ℝ := ⨆ n : ℕ, (u n : ℝ) ^ ((1 : ℝ) / 2 ^ n)The only representation of $1$ as a single unit fraction is $1 = \frac{1}{1}$.
All goals completed! 🐙$1$ is not a sum of two distinct unit fractions.
@[category test, AMS 11]
theorem F_two : F 2 = 0 := by ⊢ F 2 = 0
have h : {S : Finset ℕ | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, (1 : ℚ) / n = 1} = ∅ := by
ext S S:Finset ℕ⊢ S ∈ {S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} ↔ S ∈ ∅ h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
simp only [Set.mem_ofPred_eq, Set.mem_empty_iff_false, iff_false, not_and] S:Finset ℕ⊢ S.card = 2 → 0 ∉ S → ¬∑ n ∈ S, 1 / ↑n = 1 h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
intro hS h0 hsum S:Finset ℕhS:S.card = 2h0:0 ∉ Shsum:∑ n ∈ S, 1 / ↑n = 1⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
obtain ⟨x, y, hxy, rfl⟩ := Finset.card_eq_two.mp hS x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2h0:0 ∉ {x, y}hsum:∑ n ∈ {x, y}, 1 / ↑n = 1⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
simp only [Finset.mem_insert, Finset.mem_singleton, not_or] at h0 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:∑ n ∈ {x, y}, 1 / ↑n = 1h0:¬0 = x ∧ ¬0 = y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
rw [Finset.sum_pair hxy x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = y⊢ False x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0] at hsum x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
have hx : (x : ℚ) ≠ 0 := by ⊢ F 2 = 0 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 exact_mod_cast Ne.symm h0.1 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
have hy : (y : ℚ) ≠ 0 := by ⊢ F 2 = 0 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 exact_mod_cast Ne.symm h0.2 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 / ↑x + 1 / ↑y = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
rw [div_add_div _ _ hx hy, x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:(1 * ↑y + ↑x * 1) / (↑x * ↑y) = 1h0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 div_eq_one_iff_eq (mul_ne_zero hx hy) x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0] at hsum x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
have e : y + x = x * y := by ⊢ F 2 = 0 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
exact_mod_cast (by x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0⊢ ↑y + ↑x = ↑x * ↑y x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 linear_combination hsum All goals completed! 🐙 x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 : (y : ℚ) + x = x * y) x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * y⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
rcases Nat.lt_or_ge x 3 with hx3 | hx3 inl x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * yhx3:x < 3⊢ Falseinr x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * yhx3:x ≥ 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
· inl x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * yhx3:x < 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 interval_cases x inl.«0» x:ℕy:ℕhy:↑y ≠ 0hxy:0 ≠ yhS:{0, y}.card = 2hsum:1 * ↑y + ↑0 * 1 = ↑0 * ↑yh0:¬0 = 0 ∧ ¬0 = yhx:↑0 ≠ 0e:y + 0 = 0 * yhx3:0 < 3⊢ Falseinl.«1» x:ℕy:ℕhy:↑y ≠ 0hxy:1 ≠ yhS:{1, y}.card = 2hsum:1 * ↑y + ↑1 * 1 = ↑1 * ↑yh0:¬0 = 1 ∧ ¬0 = yhx:↑1 ≠ 0e:y + 1 = 1 * yhx3:1 < 3⊢ Falseinl.«2» x:ℕy:ℕhy:↑y ≠ 0hxy:2 ≠ yhS:{2, y}.card = 2hsum:1 * ↑y + ↑2 * 1 = ↑2 * ↑yh0:¬0 = 2 ∧ ¬0 = yhx:↑2 ≠ 0e:y + 2 = 2 * yhx3:2 < 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 <;> inl.«0» x:ℕy:ℕhy:↑y ≠ 0hxy:0 ≠ yhS:{0, y}.card = 2hsum:1 * ↑y + ↑0 * 1 = ↑0 * ↑yh0:¬0 = 0 ∧ ¬0 = yhx:↑0 ≠ 0e:y + 0 = 0 * yhx3:0 < 3⊢ Falseinl.«1» x:ℕy:ℕhy:↑y ≠ 0hxy:1 ≠ yhS:{1, y}.card = 2hsum:1 * ↑y + ↑1 * 1 = ↑1 * ↑yh0:¬0 = 1 ∧ ¬0 = yhx:↑1 ≠ 0e:y + 1 = 1 * yhx3:1 < 3⊢ Falseinl.«2» x:ℕy:ℕhy:↑y ≠ 0hxy:2 ≠ yhS:{2, y}.card = 2hsum:1 * ↑y + ↑2 * 1 = ↑2 * ↑yh0:¬0 = 2 ∧ ¬0 = yhx:↑2 ≠ 0e:y + 2 = 2 * yhx3:2 < 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 omega All goals completed! 🐙 h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
rcases Nat.lt_or_ge y 3 with hy3 | hy3 inr.inl x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * yhx3:x ≥ 3hy3:y < 3⊢ Falseinr.inr x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * yhx3:x ≥ 3hy3:y ≥ 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
· inr.inl x:ℕy:ℕhxy:x ≠ yhS:{x, y}.card = 2hsum:1 * ↑y + ↑x * 1 = ↑x * ↑yh0:¬0 = x ∧ ¬0 = yhx:↑x ≠ 0hy:↑y ≠ 0e:y + x = x * yhx3:x ≥ 3hy3:y < 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 interval_cases y inr.inl.«0» x:ℕy:ℕhx:↑x ≠ 0hx3:x ≥ 3hxy:x ≠ 0hS:{x, 0}.card = 2hsum:1 * ↑0 + ↑x * 1 = ↑x * ↑0h0:¬0 = x ∧ ¬0 = 0hy:↑0 ≠ 0e:0 + x = x * 0hy3:0 < 3⊢ Falseinr.inl.«1» x:ℕy:ℕhx:↑x ≠ 0hx3:x ≥ 3hxy:x ≠ 1hS:{x, 1}.card = 2hsum:1 * ↑1 + ↑x * 1 = ↑x * ↑1h0:¬0 = x ∧ ¬0 = 1hy:↑1 ≠ 0e:1 + x = x * 1hy3:1 < 3⊢ Falseinr.inl.«2» x:ℕy:ℕhx:↑x ≠ 0hx3:x ≥ 3hxy:x ≠ 2hS:{x, 2}.card = 2hsum:1 * ↑2 + ↑x * 1 = ↑x * ↑2h0:¬0 = x ∧ ¬0 = 2hy:↑2 ≠ 0e:2 + x = x * 2hy3:2 < 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 <;> inr.inl.«0» x:ℕy:ℕhx:↑x ≠ 0hx3:x ≥ 3hxy:x ≠ 0hS:{x, 0}.card = 2hsum:1 * ↑0 + ↑x * 1 = ↑x * ↑0h0:¬0 = x ∧ ¬0 = 0hy:↑0 ≠ 0e:0 + x = x * 0hy3:0 < 3⊢ Falseinr.inl.«1» x:ℕy:ℕhx:↑x ≠ 0hx3:x ≥ 3hxy:x ≠ 1hS:{x, 1}.card = 2hsum:1 * ↑1 + ↑x * 1 = ↑x * ↑1h0:¬0 = x ∧ ¬0 = 1hy:↑1 ≠ 0e:1 + x = x * 1hy3:1 < 3⊢ Falseinr.inl.«2» x:ℕy:ℕhx:↑x ≠ 0hx3:x ≥ 3hxy:x ≠ 2hS:{x, 2}.card = 2hsum:1 * ↑2 + ↑x * 1 = ↑x * ↑2h0:¬0 = x ∧ ¬0 = 2hy:↑2 ≠ 0e:2 + x = x * 2hy3:2 < 3⊢ False h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 omega All goals completed! 🐙 h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
nlinarith h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0 h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ F 2 = 0
rw [F, h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ {S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1}.ncard = 0 All goals completed! 🐙 h, h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ ∅.ncard = 0 All goals completed! 🐙 Set.ncard_empty h:{S | S.card = 2 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = ∅⊢ 0 = 0 All goals completed! 🐙] All goals completed! 🐙If $0 < x < y < z$ and $1 = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$, then $(x, y, z) = (2, 3, 6)$.
@[category API, AMS 11]
private lemma eq_two_three_six {x y z : ℕ} (hx : 0 < x) (hxy : x < y) (hyz : y < z)
(h : (1 : ℚ) / x + 1 / y + 1 / z = 1) : x = 2 ∧ y = 3 ∧ z = 6 := by x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1⊢ x = 2 ∧ y = 3 ∧ z = 6
have hx' : (x : ℚ) ≠ 0 := by exact_mod_cast hx.ne' x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6
have hy' : (y : ℚ) ≠ 0 := by exact_mod_cast (by x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0⊢ y ≠ 0 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 omega All goals completed! 🐙 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 : y ≠ 0) x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6
have hz' : (z : ℚ) ≠ 0 := by exact_mod_cast (by x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0⊢ z ≠ 0 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 omega All goals completed! 🐙 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 : z ≠ 0) x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:1 / ↑x + 1 / ↑y + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6
rw [div_add_div _ _ hx' hy', x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) / (↑x * ↑y) + 1 / ↑z = 1hx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 div_add_div _ _ (mul_ne_zero hx' hy') hz', x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:((1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1) / (↑x * ↑y * ↑z) = 1hx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6
div_eq_one_iff_eq (mul_ne_zero (mul_ne_zero hx' hy') hz') x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6] at h x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ x = 2 ∧ y = 3 ∧ z = 6
have e : y * z + x * z + x * y = x * y * z := by
exact_mod_cast (by x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0⊢ ↑y * ↑z + ↑x * ↑z + ↑x * ↑y = ↑x * ↑y * ↑z x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * z⊢ x = 2 ∧ y = 3 ∧ z = 6 linear_combination h All goals completed! 🐙 x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * z⊢ x = 2 ∧ y = 3 ∧ z = 6 : (y * z + x * z + x * y : ℚ) = x * y * z) x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * z⊢ x = 2 ∧ y = 3 ∧ z = 6
rcases Nat.lt_or_ge x 3 with hx3 | hx3 inl x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x < 3⊢ x = 2 ∧ y = 3 ∧ z = 6inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3⊢ x = 2 ∧ y = 3 ∧ z = 6
· inl x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x < 3⊢ x = 2 ∧ y = 3 ∧ z = 6 interval_cases x inl.«1» x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 1hxy:1 < yh:(1 * ↑y + ↑1 * 1) * ↑z + ↑1 * ↑y * 1 = ↑1 * ↑y * ↑zhx':↑1 ≠ 0e:y * z + 1 * z + 1 * y = 1 * y * zhx3:1 < 3⊢ 1 = 2 ∧ y = 3 ∧ z = 6inl.«2» x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 2hxy:2 < yh:(1 * ↑y + ↑2 * 1) * ↑z + ↑2 * ↑y * 1 = ↑2 * ↑y * ↑zhx':↑2 ≠ 0e:y * z + 2 * z + 2 * y = 2 * y * zhx3:2 < 3⊢ 2 = 2 ∧ y = 3 ∧ z = 6
· inl.«1» x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 1hxy:1 < yh:(1 * ↑y + ↑1 * 1) * ↑z + ↑1 * ↑y * 1 = ↑1 * ↑y * ↑zhx':↑1 ≠ 0e:y * z + 1 * z + 1 * y = 1 * y * zhx3:1 < 3⊢ 1 = 2 ∧ y = 3 ∧ z = 6 nlinarith All goals completed! 🐙
· inl.«2» x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 2hxy:2 < yh:(1 * ↑y + ↑2 * 1) * ↑z + ↑2 * ↑y * 1 = ↑2 * ↑y * ↑zhx':↑2 ≠ 0e:y * z + 2 * z + 2 * y = 2 * y * zhx3:2 < 3⊢ 2 = 2 ∧ y = 3 ∧ z = 6 rcases Nat.lt_or_ge y 4 with hy4 | hy4 inl.«2».inl x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 2hxy:2 < yh:(1 * ↑y + ↑2 * 1) * ↑z + ↑2 * ↑y * 1 = ↑2 * ↑y * ↑zhx':↑2 ≠ 0e:y * z + 2 * z + 2 * y = 2 * y * zhx3:2 < 3hy4:y < 4⊢ 2 = 2 ∧ y = 3 ∧ z = 6inl.«2».inr x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 2hxy:2 < yh:(1 * ↑y + ↑2 * 1) * ↑z + ↑2 * ↑y * 1 = ↑2 * ↑y * ↑zhx':↑2 ≠ 0e:y * z + 2 * z + 2 * y = 2 * y * zhx3:2 < 3hy4:y ≥ 4⊢ 2 = 2 ∧ y = 3 ∧ z = 6
· inl.«2».inl x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 2hxy:2 < yh:(1 * ↑y + ↑2 * 1) * ↑z + ↑2 * ↑y * 1 = ↑2 * ↑y * ↑zhx':↑2 ≠ 0e:y * z + 2 * z + 2 * y = 2 * y * zhx3:2 < 3hy4:y < 4⊢ 2 = 2 ∧ y = 3 ∧ z = 6 interval_cases y inl.«2».inl.«3» x:ℕy:ℕz:ℕhz':↑z ≠ 0hx:0 < 2hx':↑2 ≠ 0hx3:2 < 3hyz:3 < zhy':↑3 ≠ 0hxy:2 < 3h:(1 * ↑3 + ↑2 * 1) * ↑z + ↑2 * ↑3 * 1 = ↑2 * ↑3 * ↑ze:3 * z + 2 * z + 2 * 3 = 2 * 3 * zhy4:3 < 4⊢ 2 = 2 ∧ 3 = 3 ∧ z = 6
exact ⟨rfl, rfl, by x:ℕy:ℕz:ℕhz':↑z ≠ 0hx:0 < 2hx':↑2 ≠ 0hx3:2 < 3hyz:3 < zhy':↑3 ≠ 0hxy:2 < 3h:(1 * ↑3 + ↑2 * 1) * ↑z + ↑2 * ↑3 * 1 = ↑2 * ↑3 * ↑ze:3 * z + 2 * z + 2 * 3 = 2 * 3 * zhy4:3 < 4⊢ z = 6 omega All goals completed! 🐙⟩
· inl.«2».inr x:ℕy:ℕz:ℕhyz:y < zhy':↑y ≠ 0hz':↑z ≠ 0hx:0 < 2hxy:2 < yh:(1 * ↑y + ↑2 * 1) * ↑z + ↑2 * ↑y * 1 = ↑2 * ↑y * ↑zhx':↑2 ≠ 0e:y * z + 2 * z + 2 * y = 2 * y * zhx3:2 < 3hy4:y ≥ 4⊢ 2 = 2 ∧ y = 3 ∧ z = 6 nlinarith All goals completed! 🐙
· inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3⊢ x = 2 ∧ y = 3 ∧ z = 6 have h1 : x * z < y * z := Nat.mul_lt_mul_of_pos_right hxy (by x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3⊢ z > 0 inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3h1:x * z < y * z⊢ x = 2 ∧ y = 3 ∧ z = 6 omega All goals completed! 🐙inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3h1:x * z < y * z⊢ x = 2 ∧ y = 3 ∧ z = 6)inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3h1:x * z < y * z⊢ x = 2 ∧ y = 3 ∧ z = 6
have h2 : x * y < y * z := by nlinarith inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3h1:x * z < y * zh2:x * y < y * z⊢ x = 2 ∧ y = 3 ∧ z = 6inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3h1:x * z < y * zh2:x * y < y * z⊢ x = 2 ∧ y = 3 ∧ z = 6
have h3 : 3 * (y * z) ≤ x * (y * z) := Nat.mul_le_mul_right _ hx3 inr x:ℕy:ℕz:ℕhx:0 < xhxy:x < yhyz:y < zh:(1 * ↑y + ↑x * 1) * ↑z + ↑x * ↑y * 1 = ↑x * ↑y * ↑zhx':↑x ≠ 0hy':↑y ≠ 0hz':↑z ≠ 0e:y * z + x * z + x * y = x * y * zhx3:x ≥ 3h1:x * z < y * zh2:x * y < y * zh3:3 * (y * z) ≤ x * (y * z)⊢ x = 2 ∧ y = 3 ∧ z = 6
nlinarith All goals completed! 🐙The only representation of $1$ as a sum of three distinct unit fractions is $1 = \frac{1}{2} + \frac{1}{3} + \frac{1}{6}$.
@[category test, AMS 11]
theorem F_three : F 3 = 1 := by ⊢ F 3 = 1
have h : {S : Finset ℕ | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, (1 : ℚ) / n = 1} =
{{2, 3, 6}} := by
ext S S:Finset ℕ⊢ S ∈ {S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} ↔ S ∈ {{2, 3, 6}} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
simp only [Set.mem_ofPred_eq, Set.mem_singleton_iff] S:Finset ℕ⊢ S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1 ↔ S = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
constructor mp S:Finset ℕ⊢ S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1 → S = {2, 3, 6}mpr S:Finset ℕ⊢ S = {2, 3, 6} → S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp S:Finset ℕ⊢ S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1 → S = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 rintro ⟨hS, h0, hsum⟩ mp S:Finset ℕhS:S.card = 3h0:0 ∉ Shsum:∑ n ∈ S, 1 / ↑n = 1⊢ S = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
obtain ⟨x, y, z, hxy, hxz, hyz, rfl⟩ := Finset.card_eq_three.mp hS mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3h0:0 ∉ {x, y, z}hsum:∑ n ∈ {x, y, z}, 1 / ↑n = 1⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
simp only [Finset.mem_insert, Finset.mem_singleton, not_or] at h0 mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:∑ n ∈ {x, y, z}, 1 / ↑n = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
rw [Finset.sum_insert (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:∑ n ∈ {x, y, z}, 1 / ↑n = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ x ∉ {y, z} mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 simp [hxy, hxz] All goals completed! 🐙mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1), Finset.sum_pair hyz mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ {x, y, z} = {2, 3, 6}mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1] at hsummp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
have hx : 0 < x := by ⊢ F 3 = 1 mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 omegamp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
have hy : 0 < y := by ⊢ F 3 = 1 mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 omegamp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
have hz : 0 < z := by ⊢ F 3 = 1 mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 omegamp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1mp x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
rcases lt_or_gt_of_ne hxy with h1 | h1 mp.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < y⊢ {x, y, z} = {2, 3, 6}mp.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 <;> mp.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < y⊢ {x, y, z} = {2, 3, 6}mp.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 rcases lt_or_gt_of_ne hxz with h2 | h2 mp.inr.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:x < z⊢ {x, y, z} = {2, 3, 6}mp.inr.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 <;> mp.inl.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:x < z⊢ {x, y, z} = {2, 3, 6}mp.inl.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:z < x⊢ {x, y, z} = {2, 3, 6}mp.inr.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:x < z⊢ {x, y, z} = {2, 3, 6}mp.inr.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < x⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
rcases lt_or_gt_of_ne hyz with h3 | h3 mp.inr.inr.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < xh3:y < z⊢ {x, y, z} = {2, 3, 6}mp.inr.inr.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < xh3:z < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inl.inl.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:x < zh3:y < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 obtain ⟨rfl, rfl, rfl⟩ := eq_two_three_six hx h1 h3 (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:x < zh3:y < z⊢ 1 / ↑x + 1 / ↑y + 1 / ↑z = 1 mp.inl.inl.inl hx:0 < 2hy:0 < 3hxy:2 ≠ 3h1:2 < 3hz:0 < 6hxz:2 ≠ 6h2:2 < 6hyz:3 ≠ 6h3:3 < 6hS:{2, 3, 6}.card = 3hsum:1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1h0:¬0 = 2 ∧ ¬0 = 3 ∧ ¬0 = 6⊢ {2, 3, 6} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 linarith All goals completed! 🐙mp.inl.inl.inl hx:0 < 2hy:0 < 3hxy:2 ≠ 3h1:2 < 3hz:0 < 6hxz:2 ≠ 6h2:2 < 6hyz:3 ≠ 6h3:3 < 6hS:{2, 3, 6}.card = 3hsum:1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1h0:¬0 = 2 ∧ ¬0 = 3 ∧ ¬0 = 6⊢ {2, 3, 6} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)mp.inl.inl.inl hx:0 < 2hy:0 < 3hxy:2 ≠ 3h1:2 < 3hz:0 < 6hxz:2 ≠ 6h2:2 < 6hyz:3 ≠ 6h3:3 < 6hS:{2, 3, 6}.card = 3hsum:1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1h0:¬0 = 2 ∧ ¬0 = 3 ∧ ¬0 = 6⊢ {2, 3, 6} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1; decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inl.inl.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:x < zh3:z < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 obtain ⟨rfl, rfl, rfl⟩ := eq_two_three_six hx h2 h3 (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:x < zh3:z < y⊢ 1 / ↑x + 1 / ↑z + 1 / ↑y = 1 mp.inl.inl.inr hx:0 < 2hz:0 < 3hxz:2 ≠ 3h2:2 < 3hy:0 < 6hxy:2 ≠ 6h1:2 < 6hyz:6 ≠ 3h3:3 < 6hS:{2, 6, 3}.card = 3hsum:1 / ↑2 + (1 / ↑6 + 1 / ↑3) = 1h0:¬0 = 2 ∧ ¬0 = 6 ∧ ¬0 = 3⊢ {2, 6, 3} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 linarith All goals completed! 🐙mp.inl.inl.inr hx:0 < 2hz:0 < 3hxz:2 ≠ 3h2:2 < 3hy:0 < 6hxy:2 ≠ 6h1:2 < 6hyz:6 ≠ 3h3:3 < 6hS:{2, 6, 3}.card = 3hsum:1 / ↑2 + (1 / ↑6 + 1 / ↑3) = 1h0:¬0 = 2 ∧ ¬0 = 6 ∧ ¬0 = 3⊢ {2, 6, 3} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)mp.inl.inl.inr hx:0 < 2hz:0 < 3hxz:2 ≠ 3h2:2 < 3hy:0 < 6hxy:2 ≠ 6h1:2 < 6hyz:6 ≠ 3h3:3 < 6hS:{2, 6, 3}.card = 3hsum:1 / ↑2 + (1 / ↑6 + 1 / ↑3) = 1h0:¬0 = 2 ∧ ¬0 = 6 ∧ ¬0 = 3⊢ {2, 6, 3} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1; decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inl.inr.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:z < xh3:y < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 omega All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inl.inr.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:z < xh3:z < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 obtain ⟨rfl, rfl, rfl⟩ := eq_two_three_six hz h2 h1 (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:x < yh2:z < xh3:z < y⊢ 1 / ↑z + 1 / ↑x + 1 / ↑y = 1 mp.inl.inr.inr hz:0 < 2hx:0 < 3hxz:3 ≠ 2h2:2 < 3hy:0 < 6hyz:6 ≠ 2h3:2 < 6hxy:3 ≠ 6h1:3 < 6hS:{3, 6, 2}.card = 3hsum:1 / ↑3 + (1 / ↑6 + 1 / ↑2) = 1h0:¬0 = 3 ∧ ¬0 = 6 ∧ ¬0 = 2⊢ {3, 6, 2} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 linarith All goals completed! 🐙mp.inl.inr.inr hz:0 < 2hx:0 < 3hxz:3 ≠ 2h2:2 < 3hy:0 < 6hyz:6 ≠ 2h3:2 < 6hxy:3 ≠ 6h1:3 < 6hS:{3, 6, 2}.card = 3hsum:1 / ↑3 + (1 / ↑6 + 1 / ↑2) = 1h0:¬0 = 3 ∧ ¬0 = 6 ∧ ¬0 = 2⊢ {3, 6, 2} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)mp.inl.inr.inr hz:0 < 2hx:0 < 3hxz:3 ≠ 2h2:2 < 3hy:0 < 6hyz:6 ≠ 2h3:2 < 6hxy:3 ≠ 6h1:3 < 6hS:{3, 6, 2}.card = 3hsum:1 / ↑3 + (1 / ↑6 + 1 / ↑2) = 1h0:¬0 = 3 ∧ ¬0 = 6 ∧ ¬0 = 2⊢ {3, 6, 2} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1; decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inr.inl.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:x < zh3:y < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 obtain ⟨rfl, rfl, rfl⟩ := eq_two_three_six hy h1 h2 (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:x < zh3:y < z⊢ 1 / ↑y + 1 / ↑x + 1 / ↑z = 1 mp.inr.inl.inl hy:0 < 2hx:0 < 3hxy:3 ≠ 2h1:2 < 3hz:0 < 6hyz:2 ≠ 6h3:2 < 6hxz:3 ≠ 6h2:3 < 6hS:{3, 2, 6}.card = 3hsum:1 / ↑3 + (1 / ↑2 + 1 / ↑6) = 1h0:¬0 = 3 ∧ ¬0 = 2 ∧ ¬0 = 6⊢ {3, 2, 6} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 linarith All goals completed! 🐙mp.inr.inl.inl hy:0 < 2hx:0 < 3hxy:3 ≠ 2h1:2 < 3hz:0 < 6hyz:2 ≠ 6h3:2 < 6hxz:3 ≠ 6h2:3 < 6hS:{3, 2, 6}.card = 3hsum:1 / ↑3 + (1 / ↑2 + 1 / ↑6) = 1h0:¬0 = 3 ∧ ¬0 = 2 ∧ ¬0 = 6⊢ {3, 2, 6} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)mp.inr.inl.inl hy:0 < 2hx:0 < 3hxy:3 ≠ 2h1:2 < 3hz:0 < 6hyz:2 ≠ 6h3:2 < 6hxz:3 ≠ 6h2:3 < 6hS:{3, 2, 6}.card = 3hsum:1 / ↑3 + (1 / ↑2 + 1 / ↑6) = 1h0:¬0 = 3 ∧ ¬0 = 2 ∧ ¬0 = 6⊢ {3, 2, 6} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1; decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inr.inl.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:x < zh3:z < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 omega All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inr.inr.inl x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < xh3:y < z⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 obtain ⟨rfl, rfl, rfl⟩ := eq_two_three_six hy h3 h2 (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < xh3:y < z⊢ 1 / ↑y + 1 / ↑z + 1 / ↑x = 1 mp.inr.inr.inl hy:0 < 2hz:0 < 3hyz:2 ≠ 3h3:2 < 3hx:0 < 6hxy:6 ≠ 2h1:2 < 6hxz:6 ≠ 3h2:3 < 6hS:{6, 2, 3}.card = 3hsum:1 / ↑6 + (1 / ↑2 + 1 / ↑3) = 1h0:¬0 = 6 ∧ ¬0 = 2 ∧ ¬0 = 3⊢ {6, 2, 3} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 linarith All goals completed! 🐙mp.inr.inr.inl hy:0 < 2hz:0 < 3hyz:2 ≠ 3h3:2 < 3hx:0 < 6hxy:6 ≠ 2h1:2 < 6hxz:6 ≠ 3h2:3 < 6hS:{6, 2, 3}.card = 3hsum:1 / ↑6 + (1 / ↑2 + 1 / ↑3) = 1h0:¬0 = 6 ∧ ¬0 = 2 ∧ ¬0 = 3⊢ {6, 2, 3} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)mp.inr.inr.inl hy:0 < 2hz:0 < 3hyz:2 ≠ 3h3:2 < 3hx:0 < 6hxy:6 ≠ 2h1:2 < 6hxz:6 ≠ 3h2:3 < 6hS:{6, 2, 3}.card = 3hsum:1 / ↑6 + (1 / ↑2 + 1 / ↑3) = 1h0:¬0 = 6 ∧ ¬0 = 2 ∧ ¬0 = 3⊢ {6, 2, 3} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1; decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mp.inr.inr.inr x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < xh3:z < y⊢ {x, y, z} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 obtain ⟨rfl, rfl, rfl⟩ := eq_two_three_six hz h3 h1 (by x:ℕy:ℕz:ℕhxy:x ≠ yhxz:x ≠ zhyz:y ≠ zhS:{x, y, z}.card = 3hsum:1 / ↑x + (1 / ↑y + 1 / ↑z) = 1h0:¬0 = x ∧ ¬0 = y ∧ ¬0 = zhx:0 < xhy:0 < yhz:0 < zh1:y < xh2:z < xh3:z < y⊢ 1 / ↑z + 1 / ↑y + 1 / ↑x = 1 mp.inr.inr.inr hz:0 < 2hy:0 < 3hyz:3 ≠ 2h3:2 < 3hx:0 < 6hxz:6 ≠ 2h2:2 < 6hxy:6 ≠ 3h1:3 < 6hS:{6, 3, 2}.card = 3hsum:1 / ↑6 + (1 / ↑3 + 1 / ↑2) = 1h0:¬0 = 6 ∧ ¬0 = 3 ∧ ¬0 = 2⊢ {6, 3, 2} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 linarith All goals completed! 🐙mp.inr.inr.inr hz:0 < 2hy:0 < 3hyz:3 ≠ 2h3:2 < 3hx:0 < 6hxz:6 ≠ 2h2:2 < 6hxy:6 ≠ 3h1:3 < 6hS:{6, 3, 2}.card = 3hsum:1 / ↑6 + (1 / ↑3 + 1 / ↑2) = 1h0:¬0 = 6 ∧ ¬0 = 3 ∧ ¬0 = 2⊢ {6, 3, 2} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)mp.inr.inr.inr hz:0 < 2hy:0 < 3hyz:3 ≠ 2h3:2 < 3hx:0 < 6hxz:6 ≠ 2h2:2 < 6hxy:6 ≠ 3h1:3 < 6hS:{6, 3, 2}.card = 3hsum:1 / ↑6 + (1 / ↑3 + 1 / ↑2) = 1h0:¬0 = 6 ∧ ¬0 = 3 ∧ ¬0 = 2⊢ {6, 3, 2} = {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1; decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
· mpr S:Finset ℕ⊢ S = {2, 3, 6} → S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 rintro rfl mpr ⊢ {2, 3, 6}.card = 3 ∧ 0 ∉ {2, 3, 6} ∧ ∑ n ∈ {2, 3, 6}, 1 / ↑n = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
refine ⟨by ⊢ {2, 3, 6}.card = 3 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1, by ⊢ 0 ∉ {2, 3, 6} h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 decide All goals completed! 🐙 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1, ?_⟩
rw [Finset.sum_insert (by ⊢ 2 ∉ {3, 6} mpr ⊢ 1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 decide All goals completed! 🐙mpr ⊢ 1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1), Finset.sum_pair (by ⊢ 3 ≠ 6mpr ⊢ 1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 decide All goals completed! 🐙mpr ⊢ 1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1)]mpr ⊢ 1 / ↑2 + (1 / ↑3 + 1 / ↑6) = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
norm_num h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1 h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ F 3 = 1
rw [F, h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ {S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1}.ncard = 1 All goals completed! 🐙 h, h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ {{2, 3, 6}}.ncard = 1 All goals completed! 🐙 Set.ncard_singleton h:{S | S.card = 3 ∧ 0 ∉ S ∧ ∑ n ∈ S, 1 / ↑n = 1} = {{2, 3, 6}}⊢ 1 = 1 All goals completed! 🐙] All goals completed! 🐙The values $F(1), \ldots, F(8)$ are $1, 0, 1, 6, 72, 2320, 245765, 151182379$ (OEIS A006585). $F(8)$ is due to John Dethridge (2004). It was recomputed independently in the erdosproblems.com forum.
@[category test, AMS 11]
theorem F_first_values :
F 1 = 1 ∧ F 2 = 0 ∧ F 3 = 1 ∧ F 4 = 6 ∧ F 5 = 72 ∧ F 6 = 2320 ∧ F 7 = 245765 ∧
F 8 = 151182379 := by ⊢ F 1 = 1 ∧ F 2 = 0 ∧ F 3 = 1 ∧ F 4 = 6 ∧ F 5 = 72 ∧ F 6 = 2320 ∧ F 7 = 245765 ∧ F 8 = 151182379
refine ⟨F_one, F_two, F_three, ?_⟩ ⊢ F 4 = 6 ∧ F 5 = 72 ∧ F 6 = 2320 ∧ F 7 = 245765 ∧ F 8 = 151182379
sorry All goals completed! 🐙The first values of the sequence are $1, 2, 6, 42, 1806$.
@[category test, AMS 11]
theorem u_first_values : u 0 = 1 ∧ u 1 = 2 ∧ u 2 = 6 ∧ u 3 = 42 ∧ u 4 = 1806 := by ⊢ u 0 = 1 ∧ u 1 = 2 ∧ u 2 = 6 ∧ u 3 = 42 ∧ u 4 = 1806
decide All goals completed! 🐙def erdos_148.answer : ℕ → ℝ := sorryLet $F(k)$ be the number of solutions to $$ 1= \frac{1}{n_1}+\cdots+\frac{1}{n_k},$$ where $1\leq n_1<\cdots<n_k$ are distinct integers. Find good estimates for $F(k)$.
@[category research open, question value, AMS 11]
theorem erdos_148 : (fun k ↦ (F k : ℝ)) =Θ[atTop] erdos_148.answer := by ⊢ (fun k ↦ ↑(F k)) =Θ[atTop] erdos_148.answer
sorry All goals completed! 🐙The current best bounds known are $$2^{c^{\frac{k}{\log k}}}\leq F(k) \leq c_0^{(\frac{1}{5}+o(1))2^k},$$ where $c>0$ is some absolute constant and $c_0=1.5979102\ldots$ is the square of the 'Vardi constant' $1.26408\cdots$. The lower bound is due to Konyagin [Ko14] and the upper bound to Elsholtz and Planitzer [ElPl21]. (erdosproblems.com gives $c_0=1.26408\cdots$; [ElPl21, Remark 3] gives $c_0=1.5979102\ldots$.)
[Ko14, Theorem 1] states the lower bound in the explicit form $$F(k) \geq \exp\left(\exp\left(\left(\frac{(\log 2)(\log 3)}{3}+o(1)\right) \frac{k}{\log k}\right)\right) \quad (k \to \infty),$$ which is the statement formalised here.
@[category research solved, AMS 11]
theorem erdos_148.variants.lower_bound :
∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ᶠ k : ℕ in atTop,
exp (exp ((log 2 * log 3 / 3 + o k) * ((k : ℝ) / log k))) ≤ F k := by ⊢ ∃ o, o =o[atTop] 1 ∧ ∀ᶠ (k : ℕ) in atTop, rexp (rexp ((log 2 * log 3 / 3 + o k) * (↑k / log ↑k))) ≤ ↑(F k)
sorry All goals completed! 🐙The current best bounds known are $$2^{c^{\frac{k}{\log k}}}\leq F(k) \leq c_0^{(\frac{1}{5}+o(1))2^k},$$ where $c>0$ is some absolute constant and $c_0=1.5979102\ldots$ is the square of the 'Vardi constant' $1.26408\cdots$. The lower bound is due to Konyagin [Ko14] and the upper bound to Elsholtz and Planitzer [ElPl21]. (erdosproblems.com gives $c_0=1.26408\cdots$; [ElPl21, Remark 3] gives $c_0=1.5979102\ldots$.)
[ElPl21, Corollary 3(2)] shows that for every $\varepsilon > 0$ and all $k \geq k(\varepsilon)$, the number $f_k(1,1) \geq F(k)$ of solutions with $n_1 \leq \cdots \leq n_k$ is less than $c_0^{(\frac{2}{5}+\varepsilon)2^{k-1}} = c_0^{(\frac{1}{5}+\frac{\varepsilon}{2})2^k}$.
@[category research solved, AMS 11]
theorem erdos_148.variants.upper_bound :
∃ o : ℕ → ℝ, o =o[atTop] (1 : ℕ → ℝ) ∧ ∀ᶠ k : ℕ in atTop,
(F k : ℝ) ≤ c₀ ^ ((1 / 5 + o k) * 2 ^ k) := by ⊢ ∃ o, o =o[atTop] 1 ∧ ∀ᶠ (k : ℕ) in atTop, ↑(F k) ≤ c₀ ^ ((1 / 5 + o k) * 2 ^ k)
sorry All goals completed! 🐙end Erdos148