AFTD Auto-Formalizing Theoretical Domains

cycle_power_rooted_reflect_parent

theoremverified

Reflection preserves both parent implications at every even rank2q, interchanging the lower and upper branches.

Statement

theorem cycle_power_rooted_reflect_parent
    (D q : ℕ) (hq : 0 < q) (hD : 2*q ≤ D) (x : ℤ → ℕ → Bool)
    (hparent : ∀ p a, a < 2*q →
      (a < q → x p (a+D-2*q) = true → x p a = true) ∧
      (q ≤ a → x p a = true → x p (a+D-2*q) = true)) :
    ∀ p a, a < 2*q →
      (a < q → cycle_power_rooted_reflect D x p (a+D-2*q) = true →
        cycle_power_rooted_reflect D x p a = true) ∧
      (q ≤ a → cycle_power_rooted_reflect D x p a = true →
        cycle_power_rooted_reflect D x p (a+D-2*q) = true)
Source
Uniform structural route for OP-205 / RT-1, following arXiv:2610.15635. These are helper reductions, not a proof of the open covering value and not a research advance. The upper-vertical core remains an explicit unproved hypothesis.
Verified
29 Oct 2026
Axioms
Quot.soundpropext
Built on 1
  • cycle_power_rooted_reflectReflects the offsets of a rooted Boolean profile in its arc of length D and changes its integer root so that physical lattice points are…
Used by 1

The proof, explained

The proof shows that reflection preserves the parent implications while swapping the roles of the lower branch (a < q) and upper branch (q ≤ a). Under the reflection index transformation a' = 2q - 1 - a, the index a + D - 2q reflects to a', while a reflects to a' + D - 2q. Consequently, the assumption a < q reflects to q ≤ a', so the lower branch for the reflected configuration is deduced from the upper branch of the original configuration, and vice versa.

  1. Fix an arbitrary position p and index a < 2q, and let r = -p - (D - 1) be the reflected position.

    We introduce the arbitrary position p, the index a, and the bound ha : a < 2*q, then define r = -p - (D - 1) as the spatial position under reflection.

    lines 14–15

      intro p a ha
      let r := -p-((D-1 : ℕ) : ℤ)
  2. The index reflection identities D - 1 - (a + D - 2q) = 2q - 1 - a and (2q - 1 - a) + D - 2q = D - 1 - a hold.

    These two identities describe how reflection by D - 1 interacts with the shift by D - 2q. Both follow by linear natural number arithmetic via omega, since a < 2q ≤ D ensures no arithmetic underflow occurs.

    lines 16–17

      have hi₁ : D-1-(a+D-2*q)=2*q-1-a := by omega
      have hi₂ : (2*q-1-a)+D-2*q=D-1-a := by omega
  3. It suffices to prove the lower branch implication (a < q) and the upper branch implication (q ≤ a) separately.

    Applying constructor splits the conjunction into the two independent subgoals corresponding to the lower and upper branch cases.

    line 18

      constructor
  4. The lower branch implication holds: if a < q and the reflected configuration is true at a + D - 2q, then it is true at a.

    Assume a < q and that cycle_power_rooted_reflect D x p (a + D - 2q) = true. Expanding the definition of reflection and rewriting with the first index identity expresses this as x r (2q - 1 - a) = true. Since a < q, the reflected index a' = 2q - 1 - a satisfies q ≤ a' and a' < 2q. We then apply the second branch of the hypothesis hparent at (r, a'), which deduces x r (a' + D - 2q) = true. Rewriting with the second index identity converts this into x r (D - 1 - a) = true, which by definition means cycle_power_rooted_reflect D x p a = true.

    lines 19–23

    uses cycle_power_rooted_reflect

      · intro haq hb
        have hb' : x r (2*q-1-a) = true := by
          simpa only [cycle_power_rooted_reflect,hi₁,r] using hb
        have hh := (hparent r (2*q-1-a) (by omega)).2 (by omega) hb'
        simpa only [cycle_power_rooted_reflect,hi₂,r] using hh
  5. The upper branch implication holds: if q ≤ a and the reflected configuration is true at a, then it is true at a + D - 2q.

    Assume q ≤ a and that cycle_power_rooted_reflect D x p a = true. Expanding the definition of reflection and rewriting with the second index identity gives x r ((2q - 1 - a) + D - 2q) = true. Since q ≤ a, the reflected index a' = 2q - 1 - a satisfies a' < q and a' < 2q. Applying the first branch of the hypothesis hparent at (r, a') yields x r (2q - 1 - a) = true. Rewriting with the first index identity yields x r (D - 1 - (a + D - 2q)) = true, which simplifies to cycle_power_rooted_reflect D x p (a + D - 2q) = true.

    lines 24–28

    uses cycle_power_rooted_reflect

      · intro haq hb
        have hb' : x r ((2*q-1-a)+D-2*q) = true := by
          simpa only [cycle_power_rooted_reflect,hi₂,r] using hb
        have hh := (hparent r (2*q-1-a) (by omega)).1 (by omega) hb'
        simpa only [cycle_power_rooted_reflect,hi₁,r] using hh
cycle_power_rooted_reflect
The spatial reflection of configuration x at scale D, evaluating to x (-p - (D - 1)) (D - 1 - a) at position p and index a.

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

set_option maxHeartbeats 2000000set_option maxRecDepth 10000theorem cycle_power_rooted_reflect_parent    (D q : ℕ) (hq : 0 < q) (hD : 2*q ≤ D) (x : ℤ → ℕ → Bool)    (hparent : ∀ p a, a < 2*q →      (a < q → x p (a+D-2*q) = true → x p a = true) ∧      (q ≤ a → x p a = true → x p (a+D-2*q) = true)) :    ∀ p a, a < 2*q →      (a < q → cycle_power_rooted_reflect D x p (a+D-2*q) = true →        cycle_power_rooted_reflect D x p a = true) ∧      (q ≤ a → cycle_power_rooted_reflect D x p a = true →        cycle_power_rooted_reflect D x p (a+D-2*q) = true) := by  intro p a ha  let r := -p-((D-1 : ℕ) : ℤ)  have hi₁ : D-1-(a+D-2*q)=2*q-1-a := by omega  have hi₂ : (2*q-1-a)+D-2*q=D-1-a := by omega  constructor  · intro haq hb    have hb' : x r (2*q-1-a) = true := by      simpa only [cycle_power_rooted_reflect,hi₁,r] using hb    have hh := (hparent r (2*q-1-a) (by omega)).2 (by omega) hb'    simpa only [cycle_power_rooted_reflect,hi₂,r] using hh  · intro haq hb    have hb' : x r ((2*q-1-a)+D-2*q) = true := by      simpa only [cycle_power_rooted_reflect,hi₂,r] using hb    have hh := (hparent r (2*q-1-a) (by omega)).1 (by omega) hb'    simpa only [cycle_power_rooted_reflect,hi₁,r] using hh
See it in the graphDiscuss this resultChallenge it