ose_boolean_cube_geometry
theoremverified
The standard Boolean cube in Euclidean space lies on the sphere about its center of squared radius n/4, and distinct vertices are separated by squared distance at least one.
Statement
theorem ose_boolean_cube_geometry (n : ℕ) : (∀ x : Fin n → Bool, ‖(WithLp.toLp 2 (fun i : Fin n => if x i then (1 : ℝ) else 0) : EuclideanSpace ℝ (Fin n)) - (WithLp.toLp 2 (fun _ : Fin n => (1 : ℝ) / 2) : EuclideanSpace ℝ (Fin n))‖ ^ 2 = (n : ℝ) / 4) ∧ (∀ x y : Fin n → Bool, x ≠ y → 1 ≤ dist (WithLp.toLp 2 (fun i : Fin n => if x i then (1 : ℝ) else 0) : EuclideanSpace ℝ (Fin n)) (WithLp.toLp 2 (fun i : Fin n => if y i then (1 : ℝ) else 0)) ^ 2)
- Source
- arXiv:2611.08546, Section 6.1, Boolean cube geometry
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- ose_boolean_cube_dist_sq_hammingThe squared Euclidean distance between two standard Boolean-cube vertices equals their Hamming distance.
- Used by 2
- ose_two_layer_cube_exact_extension_thresholdLet n be a natural number at least one, and let r and s be positive real numbers with s²+2rs=1. Consider any metric on pairs (b,x), where…
- ose_two_layer_cube_exact_hilbert_distortionLet n be a natural number at least two, let r and s be positive reals with s²+2rs=1, and consider any metric on pairs (b,x) with a Boolean…
Lean source view module on GitHub
theorem ose_boolean_cube_geometry (n : ℕ) : (∀ x : Fin n → Bool, ‖(WithLp.toLp 2 (fun i : Fin n => if x i then (1 : ℝ) else 0) : EuclideanSpace ℝ (Fin n)) - (WithLp.toLp 2 (fun _ : Fin n => (1 : ℝ) / 2) : EuclideanSpace ℝ (Fin n))‖ ^ 2 = (n : ℝ) / 4) ∧ (∀ x y : Fin n → Bool, x ≠ y → 1 ≤ dist (WithLp.toLp 2 (fun i : Fin n => if x i then (1 : ℝ) else 0) : EuclideanSpace ℝ (Fin n)) (WithLp.toLp 2 (fun i : Fin n => if y i then (1 : ℝ) else 0)) ^ 2) := by classical constructor · intro x rw [EuclideanSpace.norm_sq_eq] simp only [WithLp.ofLp_sub, WithLp.ofLp_toLp, Pi.sub_apply, Real.norm_eq_abs, sq_abs] have h (i : Fin n) : ((if x i then (1 : ℝ) else 0) - 1/2)^2 = 1/4 := by cases hx : x i <;> norm_num [hx] simp_rw [h] simp [div_eq_mul_inv] · intro x y hxy rw [ose_boolean_cube_dist_sq_hamming] have h : 1 ≤ hammingDist x y := Nat.one_le_iff_ne_zero.mpr (hammingDist_ne_zero.mpr hxy) exact_mod_cast h