AFTD Auto-Formalizing Theoretical Domains

radial_coloring_trivial_witnesses

theoremverified

Sanity witnesses for the radial colouring: with S = Set.univ every point is coloured true, and with S = ∅ every point is coloured false. So the construction is not vacuous and both colours occur.

Statement

theorem radial_coloring_trivial_witnesses {n : ℕ} (x : EuclideanSpace ℝ (Fin n)) :
    radial_coloring Set.univ x = true ∧ radial_coloring (∅ : Set ℝ) x = false
Source
step towards op_1481_avoidance_three_twenty_one_exceptional_spacings
Verified
13 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • radial_coloringThe radial two-colouring of Euclidean space attached to a set S ⊆ ℝ: a point x is coloured true exactly when its squared norm ‖x‖² lies in…
  • radial_coloring_apply_eq_trueA point is coloured true by the radial colouring S exactly when its squared norm lies in S.

The proof, explained

To show that the radial colouring can attain both boolean values, we evaluate it at an arbitrary point x with the parameter set S chosen to be the universal set and the empty set, respectively. Unfolding the definition of radial colouring reveals that the colour depends on whether ‖x‖² belongs to S. Since every point belongs to the universal set and no point belongs to the empty set, both conjuncts evaluate directly to the desired boolean constants.

  1. radial_coloring Set.univ x = true ∧ radial_coloring ∅ x = false

    We unfold the definition of `radial_coloring` across the goal using `simp only [radial_coloring] at *`, which rewrites each term into a conditional statement: `(if ‖x‖ ^ 2 ∈ Set.univ then true else false) = true ∧ (if ‖x‖ ^ 2 ∈ ∅ then true else false) = false`. The automated simplifier `simpa` then evaluates `‖x‖ ^ 2 ∈ Set.univ` to true (since the universal set contains every element) and `‖x‖ ^ 2 ∈ ∅` to false (since the empty set contains no elements). The resulting conditional expressions reduce to `true = true ∧ false = false`, which is trivially true.

    line 3

    uses radial_coloring_apply_eq_true

        radial_coloring Set.univ x = true ∧ radial_coloring (∅ : Set ℝ) x = false := by first | exact radial_coloring_apply_eq_true | (apply radial_coloring_apply_eq_true <;> assumption) | (apply radial_coloring_apply_eq_true <;> simp_all) | simpa using radial_coloring_apply_eq_true | (simp only [radial_coloring] at *; first | exact radial_coloring_apply_eq_true | (apply radial_coloring_apply_eq_true <;> assumption) | (apply radial_coloring_apply_eq_true <;> simp_all) | simpa using radial_coloring_apply_eq_true)
radial_coloring_apply_eq_true
For any set S ⊆ ℝ and point x, the radial colouring assigns true to x if and only if ‖x‖² ∈ S.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Witness that the radial colouring actually takes both values (`S = univ` is everywhere true, `S = ∅` everywhere false). -/theorem radial_coloring_trivial_witnesses {n : ℕ} (x : EuclideanSpace ℝ (Fin n)) :    radial_coloring Set.univ x = true ∧ radial_coloring (∅ : Set ℝ) x = false := by first | exact radial_coloring_apply_eq_true | (apply radial_coloring_apply_eq_true <;> assumption) | (apply radial_coloring_apply_eq_true <;> simp_all) | simpa using radial_coloring_apply_eq_true | (simp only [radial_coloring] at *; first | exact radial_coloring_apply_eq_true | (apply radial_coloring_apply_eq_true <;> assumption) | (apply radial_coloring_apply_eq_true <;> simp_all) | simpa using radial_coloring_apply_eq_true)
See it in the graphDiscuss this resultChallenge it