AFTD Auto-Formalizing Theoretical Domains

cycle_power_eight_period_six_model_without_counts_valid

theoremverified

The explicit period-six model has endpoints, tight weights, exact dyadic edge coverage and full ordinary edge coverage, yet has a boundary mismatch and unequal active counts 3 and 5. This only refutes dropping the active-count condition from the auxiliary model.

Statement

theorem cycle_power_eight_period_six_model_without_counts_valid :
    (∀ p : ZMod 6, cycle_power_eight_period_six_model_without_counts p 0 = true ∧
      cycle_power_eight_period_six_model_without_counts p 7 = true) ∧
    (∀ p : ZMod 6, cycle_power_dyadic_class_weight 3 (cycle_power_eight_period_six_model_without_counts p) =
      (range 8).sum (fun j => (cycle_power_eight_period_six_model_without_counts p j).toNat)) ∧
    (∀ (j : Fin 3) (v : ZMod 6),
      (range (2 ^ j.val)).sum (fun a =>
        (cycle_power_eight_period_six_model_without_counts (v - (a : ZMod 6)) a &&
          cycle_power_eight_period_six_model_without_counts (v - (a : ZMod 6)) (a + 8 - 2 ^ j.val)).toNat) = 1) ∧
    (∀ (d : Fin 8), 0 < d.val → ∀ v : ZMod 6,
      ∃ a : Fin 8, a.val < 8 - d.val ∧
        cycle_power_eight_period_six_model_without_counts (v - (a.val : ZMod 6)) a.val = true ∧
        cycle_power_eight_period_six_model_without_counts (v - (a.val : ZMod 6)) (a.val + d.val) = true) ∧
    cycle_power_eight_period_six_model_without_counts 0 1 = true ∧
    cycle_power_eight_period_six_model_without_counts 0 6 = false ∧
    (range 8).sum (fun a => (cycle_power_eight_period_six_model_without_counts (-(a : ZMod 6)) a).toNat) = 3 ∧
    (range 8).sum (fun a => (cycle_power_eight_period_six_model_without_counts (1 - (a : ZMod 6)) a).toNat) = 5
Source
Experiment 6094 in the OP-205 / RT-1 campaign, related to arXiv:2610.15635 Section 3. This finite countermodel refutes only omission of the active-count hypothesis, not OP-205. No research advance is claimed.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

The proof, explained

The theorem validates by exhaustive finite computation that a concrete period-six model—given by an explicit 6 × 8 boolean matrix—satisfies endpoints, tight dyadic weights, exact dyadic coverage, and full edge coverage, while exhibiting a boundary mismatch and unequal active counts. Because all quantifiers and summations range over finite types (ℤ/6ℤ, Fin 3, and Fin 8), the entire statement is decidable. The `decide` tactic completes the proof by evaluating the finite truth table directly.

  1. The explicit period-six boolean model satisfies endpoint constraints, tight dyadic weights, exact dyadic coverage, full ordinary edge coverage, a boundary mismatch, and unequal diagonal active counts of 3 and 5. automation

    Every conjunct is a computable statement involving finite sums, boolean operations, and universal or existential quantifiers over the finite sets ℤ/6ℤ, Fin 3, and Fin 8. The `decide` tactic evaluates all cases exhaustively by finite computation, reducing the entire goal to `true`.

    line 20

      decide

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

open Finsettheorem cycle_power_eight_period_six_model_without_counts_valid :    (∀ p : ZMod 6, cycle_power_eight_period_six_model_without_counts p 0 = true ∧      cycle_power_eight_period_six_model_without_counts p 7 = true) ∧    (∀ p : ZMod 6, cycle_power_dyadic_class_weight 3 (cycle_power_eight_period_six_model_without_counts p) =      (range 8).sum (fun j => (cycle_power_eight_period_six_model_without_counts p j).toNat)) ∧    (∀ (j : Fin 3) (v : ZMod 6),      (range (2 ^ j.val)).sum (fun a =>        (cycle_power_eight_period_six_model_without_counts (v - (a : ZMod 6)) a &&          cycle_power_eight_period_six_model_without_counts (v - (a : ZMod 6)) (a + 8 - 2 ^ j.val)).toNat) = 1) ∧    (∀ (d : Fin 8), 0 < d.val → ∀ v : ZMod 6,      ∃ a : Fin 8, a.val < 8 - d.val ∧        cycle_power_eight_period_six_model_without_counts (v - (a.val : ZMod 6)) a.val = true ∧        cycle_power_eight_period_six_model_without_counts (v - (a.val : ZMod 6)) (a.val + d.val) = true) ∧    cycle_power_eight_period_six_model_without_counts 0 1 = true ∧    cycle_power_eight_period_six_model_without_counts 0 6 = false ∧    (range 8).sum (fun a => (cycle_power_eight_period_six_model_without_counts (-(a : ZMod 6)) a).toNat) = 3 ∧    (range 8).sum (fun a => (cycle_power_eight_period_six_model_without_counts (1 - (a : ZMod 6)) a).toNat) = 5 := by  decide
See it in the graphDiscuss this resultChallenge it