Three-family disjoint union assembly with product exactification
ProvedErdos390.three_family_residual_union_assemblyalgebracombinatoricserdos-problems
Three-Family Disjoint Union Assembly with Product Exactification
Let and let be finite sets of integers.
Suppose that are mutually disjoint and each is disjoint from :
Suppose furthermore that their joint product times equals :
Then the unified set is disjoint from and satisfies:
This establishes the fundamental combinatorial union assembly theorem (Shouqiao Wang's GuardedExactificationProduct.lean and BankPaperGuardedUpperProductAssembly.lean), enabling the integration of fixed factors, signed bank states, and rounded candidate sets into a unified residual complement.
Preamble
import Mathlib import Definitions.Def_erdos390_problem
Formal statement
namespace Erdos390
theorem three_family_residual_union_assembly
{n M D P : ℕ} {central fixed bank candidates : Finset ℕ}
(hfixed_sub : fixed ⊆ factorInterval n M)
(hbank_sub : bank ⊆ factorInterval n M)
(hcand_sub : candidates ⊆ factorInterval n M)
(hdisj_cf : Disjoint central fixed)
(hdisj_cb : Disjoint central bank)
(hdisj_cc : Disjoint central candidates)
(hdisj_fb : Disjoint fixed bank)
(hdisj_fbc : Disjoint (fixed ∪ bank) candidates)
(hprod : fixed.prod id * bank.prod id * candidates.prod id * D = P) :
∃ residual : Finset ℕ,
residual ⊆ factorInterval n M ∧
Disjoint central residual ∧
residual.prod id * D = P := by sorry
end Erdos390Source
Shouqiao Wang, A Proposed Solution to Erdős Problem 390, Section 9, GuardedExactificationProduct.lean (GitHub 61325b1)