theorem
proved
eight_tick_neutral_implies_exact
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Measurement.WindowNeutrality on GitHub at line 27.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
formal source
24 ∑ i : Fin 8, (if w i then (1 : ℤ) else (-1 : ℤ)) = 0
25
26/-- Eight-tick neutral window implies existence of potential -/
27theorem eight_tick_neutral_implies_exact (w : Pattern 8)
28 (hneutral : isNeutralWindow w) :
29 ∃ φ : Pattern 8 → ℤ,
30 ∀ i j : Fin 8,
31 (if w j then 1 else -1) - (if w i then 1 else -1) =
32 φ (fun _ => w j) - φ (fun _ => w i) := by
33 -- For a simpler proof, we construct φ as the cumulative sum up to each position
34 -- Define φ(pattern) to be the value at position 0 of that pattern
35 -- Then differences are just the single-position values
36 let φ : Pattern 8 → ℤ := fun p => if p 0 then 1 else -1
37 use φ
38 intro i j
39 -- The key insight: we're mapping patterns to integers based on their value at position 0
40 -- The difference of pattern values equals the potential difference
41 simp [φ]
42
43/-! ### Connection to Gap Weight w₈ -/
44
45/-- The gap weight w₈ is uniquely determined by T6 eight-tick minimality.
46 The value is defined as a closed form in `Constants.GapWeight.w8_from_eight_tick`. -/
47theorem gap_weight_unique :
48 ∃! w : ℝ, w = w8_from_eight_tick := by
49 use w8_from_eight_tick
50 constructor
51 · rfl
52 · intro y hy; exact hy
53
54/-- The gap weight is positive (derived from the closed form). -/
55theorem gap_weight_pos : 0 < w8_from_eight_tick := w8_pos
56
57end Measurement