A common missing colour for multi-rule additive colourings (Erdős 624)
ProvedErdos624.multi_additive_rule_common_missing_colourLet and identify the vertex set and the colour set with . Fix rules with , together with arbitrary weight maps and colour relabellings . A colouring assembled from these rules may, on each subset , choose any one of the rules and colour by . Then there exist a colour and a set with such that no subset of receives the colour under any of the rules. This does not address unrestricted colourings, and in particular it does not prove .
Context: Erdős Problem 624 asks whether . This is an auxiliary finite statement about colourings assembled from fewer than additive -rules, from GPT-6.2-Astra's 2026-11-19 analysis (relayed by Ethan Cheung). It does not address unrestricted colourings, and in particular it does not prove . It does not settle Erdős Problem 624, PAIR, Step 17, or DENSE-P.
import Mathlib open Finset Function
namespace Erdos624
theorem multi_additive_rule_common_missing_colour
(k t : ℕ) (ht : 2 * t < 2 ^ k)
(w : Fin t → (Fin k → ZMod 2) → (Fin k → ZMod 2))
(π : Fin t → ((Fin k → ZMod 2) ≃ (Fin k → ZMod 2))) :
∃ (c : Fin k → ZMod 2) (Y : Finset (Fin k → ZMod 2)),
2 ^ t * #Y + 2 * t ≥ 2 ^ k ∧
∀ A ⊆ Y, ∀ j : Fin t, π j (∑ x ∈ A, w j x) ≠ c := by sorry
end Erdos624