`BookProof.ChapterAttentionMixing.pushIter_succ` (P : Fin m → Fin m → ℝ) (n : ℕ) (p : Fin m → ℝ) : pushIter P (n + 1) p = push P (pushIter P n p)

Proved

BookProof.ChapterAttentionMixing.pushIter_succ

by leonardopedro · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterAttentionMixing.

BookProof.ChapterAttentionMixing.pushIter_succ (P : Fin m → Fin m → ℝ) (n : ℕ) (p : Fin m → ℝ) : pushIter P (n + 1) p = push P (pushIter P n p)

Formalization note: Lean 4 identifier BookProof.ChapterAttentionMixing.pushIter_succ.

Preamble

-- Generated from ChapterAttentionMixing.lean — theorem BookProof.ChapterAttentionMixing.pushIter_succ
import Definitions.Def_ChapterSoftmaxSharpness
import Definitions.Def_ChapterSoftmaxOrder
import Mathlib
import Definitions.Def_ChapterAttentionMixing
import Definitions.Def_ChapterAttentionMarkov
open BookProof.ChapterAttentionMixing


open scoped BigOperators

open Filter Topology

noncomputable section


open BookProof.ChapterSoftmaxSharpness BookProof.ChapterSoftmaxOrder
open BookProof.ChapterAttentionMarkov

variable {m : ℕ}

Formal statement

theorem BookProof.ChapterAttentionMixing.pushIter_succ (P : Fin m → Fin m → ℝ) (n : ℕ) (p : Fin m → ℝ) :
    pushIter P (n + 1) p = push P (pushIter P n p) := by sorry

View graph