/-
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 643
References:
[Fu84] F"uredi, Z., Hypergraphs in which all disjoint pairs have distinct unions. Combinatorica (1984), 161--168.
[PiVe09] Pikhurko, Oleg and Verstra"{e}te, Jacques, The maximum size of hypergraphs without generalized 4-cycles. J. Combin. Theory Ser. A (2009), 637--649.
[HMY26] Huang, Hao, Ma, Jie, and Yang, Tianchi, Extremal hypergraphs without generalized 4-cycles. arXiv:2609.37744 (2026), Theorem 1.2.
@[expose] public sectionnamespace Erdos643open Filter AsymptoticsThe least number of edges forcing two distinct disjoint pairs with the same union. It is one more than the maximum size of an avoiding family.
noncomputable def forcingThreshold (n t : ℕ) : ℕ :=
Hypergraph.extremalNumber n t (fun H ↦ ¬ H.HasRepeatedDisjointUnion) + 1def erdos_643.parts.i.answer : ℕ → ℕ → ℝ := sorryLet $f(n;t)$ be minimal such that if a $t$-uniform hypergraph on $n$ vertices contains at least $f(n;t)$ edges then there must be four edges $A,B,C,D$ such that $$A\cup B= C\cup D$$ and $$A\cap B=C\cap D=\emptyset.$$ Estimate $f(n;t)$ - in particular, is it true that for $t\geq 3$ $$f(n;t)=(1+o(1))\binom{n}{t-1}?$$
@[category research open, question value, AMS 5]
theorem erdos_643.parts.i :
∀ t : ℕ, 1 ≤ t →
(fun n ↦ (forcingThreshold n t : ℝ)) ~[atTop] erdos_643.parts.i.answer t := ⊢ ∀ (t : ℕ), 1 ≤ t → (fun n ↦ ↑(forcingThreshold n t)) ~[atTop] i.answer t
All goals completed! 🐙Is it true that $f(n;t)=(1+o(1))\binom{n}{t-1}$ for $t\geq 3$?
For $t\geq4$, Huang, Ma, and Yang [HMY26] prove the exact extremal formula below. The case $t=3$ remains open.
@[category research open, question, AMS 5]
theorem erdos_643.parts.ii :
∀ t : ℕ, 3 ≤ t →
(fun n ↦ (forcingThreshold n t : ℝ)) ~[atTop]
(fun n ↦ (n.choose (t - 1) : ℝ)) := ⊢ ∀ (t : ℕ), 3 ≤ t → (fun n ↦ ↑(forcingThreshold n t)) ~[atTop] fun n ↦ ↑(n.choose (t - 1))
All goals completed! 🐙Huang, Ma, and Yang [HMY26, Theorem 1.2] determine the maximum size of an avoiding family for each fixed $t\geq4$ and all sufficiently large $n$: $$\binom{n-1}{t-1}+\left\lfloor\frac{n-1}{t}\right\rfloor.$$ The forcing threshold is one larger.
@[category research solved, AMS 5]
theorem erdos_643.variants.exact_t_ge_four :
∀ t : ℕ, 4 ≤ t → ∀ᶠ n : ℕ in atTop,
Hypergraph.extremalNumber n t (fun H ↦ ¬ H.HasRepeatedDisjointUnion) =
(n - 1).choose (t - 1) + (n - 1) / t := ⊢ ∀ (t : ℕ),
4 ≤ t →
∀ᶠ (n : ℕ) in atTop,
(Hypergraph.extremalNumber n t fun H ↦ ¬H.HasRepeatedDisjointUnion) = (n - 1).choose (t - 1) + (n - 1) / t
All goals completed! 🐙The largest avoiding family attains the value one below the forcing threshold.
n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.Nonempty⊢ ∃ H, H.IsUniform t ∧ ¬H.HasRepeatedDisjointUnion ∧ H.card + 1 = forcingThreshold n t
obtain ⟨H, hH, hmax⟩ := Finset.exists_mem_eq_sup S hne Finset.card n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.card⊢ ∃ H, H.IsUniform t ∧ ¬H.HasRepeatedDisjointUnion ∧ H.card + 1 = forcingThreshold n t
have hmem := Finset.mem_filter.1 hH n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ ∃ H, H.IsUniform t ∧ ¬H.HasRepeatedDisjointUnion ∧ H.card + 1 = forcingThreshold n t
refine ⟨H, ?_, hmem.2, ?_⟩ refine_1 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ H.IsUniform trefine_2 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ H.card + 1 = forcingThreshold n t
· refine_1 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ H.IsUniform t intro e he refine_1 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnione:Finset (Fin n)he:e ∈ H⊢ e.card = t
exact (Finset.mem_powersetCard.1 (Finset.mem_powerset.1 hmem.1 he)).2 All goals completed! 🐙
· refine_2 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ H.card + 1 = forcingThreshold n t unfold forcingThreshold refine_2 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ H.card + 1 = (Hypergraph.extremalNumber n t fun H ↦ ¬H.HasRepeatedDisjointUnion) + 1
apply congrArg (fun k : ℕ ↦ k + 1) refine_2 n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ H.card = Hypergraph.extremalNumber n t fun H ↦ ¬H.HasRepeatedDisjointUnion
calc
H.card = S.sup Finset.card := hmax.symm
_ = Hypergraph.extremalNumber n t (fun H ↦ ¬ H.HasRepeatedDisjointUnion) := by n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ S.sup Finset.card = Hypergraph.extremalNumber n t fun H ↦ ¬H.HasRepeatedDisjointUnion
unfold Hypergraph.extremalNumber n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ S.sup Finset.card = {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}.sup Finset.card
congr 1 e_s n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnion⊢ S = {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}
ext K e_s n:ℕt:ℕS:Finset (Finset (Finset (Fin n))) := {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hne:S.NonemptyH:Finset (Finset (Fin n))hH:H ∈ Shmax:S.sup Finset.card = H.cardhmem:H ∈ (Finset.powersetCard t Finset.univ).powerset ∧ ¬H.HasRepeatedDisjointUnionK:Finset (Finset (Fin n))⊢ K ∈ S ↔ K ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}
simp [S] All goals completed! 🐙A bound is at least the forcing threshold exactly when every uniform family with that many edges contains the forbidden four-edge configuration.
@[category API, AMS 5]
theorem forcingThreshold_le_iff (n t m : ℕ) :
forcingThreshold n t ≤ m ↔
∀ H : Finset (Finset (Fin n)), H.IsUniform t →
m ≤ H.card → H.HasRepeatedDisjointUnion := by n:ℕt:ℕm:ℕ⊢ forcingThreshold n t ≤ m ↔ ∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion
classical
constructor mp n:ℕt:ℕm:ℕ⊢ forcingThreshold n t ≤ m → ∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnionmpr n:ℕt:ℕm:ℕ⊢ (∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion) → forcingThreshold n t ≤ m
· mp n:ℕt:ℕm:ℕ⊢ forcingThreshold n t ≤ m → ∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion intro hm H hHt hcard mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.card⊢ H.HasRepeatedDisjointUnion
by_contra hfree mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnion⊢ False
have hmem : H ∈ ((Finset.univ : Finset (Fin n)).powersetCard t).powerset.filter
(fun H ↦ ¬ H.HasRepeatedDisjointUnion) := by n:ℕt:ℕm:ℕ⊢ forcingThreshold n t ≤ m ↔ ∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ False
refine Finset.mem_filter.2 ⟨Finset.mem_powerset.2 ?_, hfree⟩ n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnion⊢ H ⊆ Finset.powersetCard t Finset.univ mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ False
intro e he n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnione:Finset (Fin n)he:e ∈ H⊢ e ∈ Finset.powersetCard t Finset.univmp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ False
exact Finset.mem_powersetCard.2 ⟨Finset.subset_univ _, hHt e he⟩mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ Falsemp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ False
have hmax : H.card < forcingThreshold n t := by n:ℕt:ℕm:ℕ⊢ forcingThreshold n t ≤ m ↔ ∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ False
unfold forcingThreshold n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ H.card < (Hypergraph.extremalNumber n t fun H ↦ ¬H.HasRepeatedDisjointUnion) + 1mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ False
apply Nat.lt_succ_of_le n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ H.card ≤ Hypergraph.extremalNumber n t fun H ↦ ¬H.HasRepeatedDisjointUnionmp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ False
unfold Hypergraph.extremalNumber n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ H.card ≤ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}.sup Finset.cardmp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ False
apply Finset.le_sup n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}⊢ H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}mp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ False
simpa using hmemmp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ Falsemp n:ℕt:ℕm:ℕhm:forcingThreshold n t ≤ mH:Finset (Finset (Fin n))hHt:H.IsUniform thcard:m ≤ H.cardhfree:¬H.HasRepeatedDisjointUnionhmem:H ∈ {H ∈ (Finset.powersetCard t Finset.univ).powerset | ¬H.HasRepeatedDisjointUnion}hmax:H.card < forcingThreshold n t⊢ False
omega All goals completed! 🐙
· mpr n:ℕt:ℕm:ℕ⊢ (∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion) → forcingThreshold n t ≤ m intro hm mpr n:ℕt:ℕm:ℕhm:∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnion⊢ forcingThreshold n t ≤ m
obtain ⟨H, hHt, hfree, hmax⟩ := exists_avoiding_maximizer n t mpr n:ℕt:ℕm:ℕhm:∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnionH:Finset (Finset (Fin n))hHt:H.IsUniform thfree:¬H.HasRepeatedDisjointUnionhmax:H.card + 1 = forcingThreshold n t⊢ forcingThreshold n t ≤ m
by_contra hlt mpr n:ℕt:ℕm:ℕhm:∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnionH:Finset (Finset (Fin n))hHt:H.IsUniform thfree:¬H.HasRepeatedDisjointUnionhmax:H.card + 1 = forcingThreshold n thlt:¬forcingThreshold n t ≤ m⊢ False
exact hfree (hm H hHt (by n:ℕt:ℕm:ℕhm:∀ (H : Finset (Finset (Fin n))), H.IsUniform t → m ≤ H.card → H.HasRepeatedDisjointUnionH:Finset (Finset (Fin n))hHt:H.IsUniform thfree:¬H.HasRepeatedDisjointUnionhmax:H.card + 1 = forcingThreshold n thlt:¬forcingThreshold n t ≤ m⊢ m ≤ H.card omega All goals completed! 🐙))When no edge of size $t$ fits in the ground set, the threshold is one.
@[category test, AMS 5]
theorem forcingThreshold_eq_one_of_lt {n t : ℕ} (h : n < t) :
forcingThreshold n t = 1 := by n:ℕt:ℕh:n < t⊢ forcingThreshold n t = 1
classical
have hempty : (Finset.univ : Finset (Fin n)).powersetCard t = ∅ :=
Finset.powersetCard_eq_empty.2 (by n:ℕt:ℕh:n < t⊢ Finset.univ.card < t n:ℕt:ℕh:n < thempty:Finset.powersetCard t Finset.univ = ∅⊢ forcingThreshold n t = 1 simpa using h All goals completed! 🐙 n:ℕt:ℕh:n < thempty:Finset.powersetCard t Finset.univ = ∅⊢ forcingThreshold n t = 1) n:ℕt:ℕh:n < thempty:Finset.powersetCard t Finset.univ = ∅⊢ forcingThreshold n t = 1
simp [forcingThreshold, Hypergraph.extremalNumber, hempty, Finset.HasRepeatedDisjointUnion] All goals completed! 🐙end Erdos643