proofs
Provedattentionfinite-probabilityreview-v7

Direct entry indices preserve every finite acceptance-dependent history statistic

For all n,d∈N\htmlData{mx=1}{n, d \in \htmlData{mx=0}{\mathbb{N}}}, E:Type⁡⋅\htmlData{mx=2}{E : \htmlData{mx=1}{\htmlData{mx=0}{\operatorname{Type}} \cdot }}, A,q∈Key⁡ d\htmlData{mx=3}{A, q \in \htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Key}}\,\htmlData{mx=1}{d}}}, w∈R\htmlData{mx=1}{w \in \htmlData{mx=0}{\mathbb{R}}}, k:Fin⁡ n→Key⁡ d\htmlData{mx=7}{k : \htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Fin}}\,\htmlData{mx=1}{n}} \mathrel{\htmlData{mx=6}{\to}} \htmlData{mx=5}{\htmlData{mx=3}{\operatorname{Key}}\,\htmlData{mx=4}{d}}}, v:Fin⁡ n→E\htmlData{mx=5}{v : \htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Fin}}\,\htmlData{mx=1}{n}} \mathrel{\htmlData{mx=4}{\to}} \htmlData{mx=3}{E}}, accept:Row⁡ d E→R\htmlData{mx=6}{\mathit{accept} : \htmlData{mx=3}{\htmlData{mx=0}{\operatorname{Row}}\,\htmlData{mx=1}{d}\,\htmlData{mx=2}{E}} \mathrel{\htmlData{mx=5}{\to}} \htmlData{mx=4}{\mathbb{R}}}, m∈N\htmlData{mx=1}{m \in \htmlData{mx=0}{\mathbb{N}}} and f:(Fin⁡ m→Row⁡ d E×Bool⁡)→R\htmlData{mx=12}{f : (\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{Fin}}\,\htmlData{mx=1}{m}} \mathrel{\htmlData{mx=9}{\to}} \htmlData{mx=8}{\htmlData{mx=6}{\htmlData{mx=3}{\operatorname{Row}}\,\htmlData{mx=4}{d}\,\htmlData{mx=5}{E}} \times \htmlData{mx=7}{\operatorname{Bool}}}) \mathrel{\htmlData{mx=11}{\to}} \htmlData{mx=10}{\mathbb{R}}}, if 0<n0 \mathrel{\htmlData{mx=1}{<}} \htmlData{mx=0}{n} (given NormedAddCommGroup⁡ E\htmlData{mx=2}{\htmlData{mx=0}{\operatorname{NormedAddCommGroup}}\,\htmlData{mx=1}{E}} and InnerProductSpace⁡ R E\htmlData{mx=3}{\htmlData{mx=0}{\operatorname{InnerProductSpace}}\,\htmlData{mx=1}{\mathbb{R}}\,\htmlData{mx=2}{E}}), then

((sum⁡(univ⁡,z↦rejectionWeight⁡(indexedWeight⁡(A,q,w,k,v),j↦accept(indexedRow⁡(A,w,k,v,j)),m,z)⋅f(i↦(indexedRow⁡(A,w,k,v,z(i))1,z(i)2))))=sum⁡(univ⁡,z↦rejectionWeight⁡(reference⁡(A,q,w,k,v),j↦accept(⟨k(j),v(j)⟩),m,z)⋅f(i↦(⟨k(z(i))1,v(z(i))1⟩,z(i)2))))\begin{aligned} & \left(\right. (\htmlData{mx=53}{\htmlData{mx=1}{\operatorname{sum}}(\htmlData{mx=2}{\operatorname{univ}}, \htmlData{mx=52}{z \mapsto \htmlData{mx=42}{\htmlData{mx=23}{\htmlData{mx=3}{\operatorname{rejectionWeight}}(\htmlData{mx=10}{\htmlData{mx=4}{\operatorname{indexedWeight}}(\htmlData{mx=5}{A}, \htmlData{mx=6}{q}, \htmlData{mx=7}{w}, \htmlData{mx=8}{k}, \htmlData{mx=9}{v})}, \htmlData{mx=20}{j \mapsto \htmlData{mx=19}{\htmlData{mx=11}{\mathit{accept}}(\htmlData{mx=18}{\htmlData{mx=12}{\operatorname{indexedRow}}(\htmlData{mx=13}{A}, \htmlData{mx=14}{w}, \htmlData{mx=15}{k}, \htmlData{mx=16}{v}, \htmlData{mx=17}{j})})}}, \htmlData{mx=21}{m}, \htmlData{mx=22}{z})} \cdot \htmlData{mx=41}{\htmlData{mx=24}{f}(\htmlData{mx=40}{i \mapsto \htmlData{mx=39}{\left( \htmlData{mx=34}{\htmlData{mx=33}{\htmlData{mx=25}{\operatorname{indexedRow}}(\htmlData{mx=26}{A}, \htmlData{mx=27}{w}, \htmlData{mx=28}{k}, \htmlData{mx=29}{v}, \htmlData{mx=32}{\htmlData{mx=30}{z}(\htmlData{mx=31}{i})})}_{1}}, \htmlData{mx=38}{\htmlData{mx=37}{\htmlData{mx=35}{z}(\htmlData{mx=36}{i})}_{2}} \right)}})}}})}) \\ & \quad \htmlData{mx=0}{=} \htmlData{mx=107}{\htmlData{mx=54}{\operatorname{sum}}(\htmlData{mx=55}{\operatorname{univ}}, \htmlData{mx=106}{z \mapsto \htmlData{mx=99}{\htmlData{mx=77}{\htmlData{mx=56}{\operatorname{rejectionWeight}}(\htmlData{mx=63}{\htmlData{mx=57}{\operatorname{reference}}(\htmlData{mx=58}{A}, \htmlData{mx=59}{q}, \htmlData{mx=60}{w}, \htmlData{mx=61}{k}, \htmlData{mx=62}{v})}, \htmlData{mx=74}{j \mapsto \htmlData{mx=73}{\htmlData{mx=64}{\mathit{accept}}(\htmlData{mx=72}{\htmlData{mx=71}{\left\langle \htmlData{mx=67}{\htmlData{mx=65}{k}(\htmlData{mx=66}{j})}, \htmlData{mx=70}{\htmlData{mx=68}{v}(\htmlData{mx=69}{j})} \right\rangle}})}}, \htmlData{mx=75}{m}, \htmlData{mx=76}{z})} \cdot \htmlData{mx=98}{\htmlData{mx=78}{f}(\htmlData{mx=97}{i \mapsto \htmlData{mx=96}{\left( \htmlData{mx=91}{\left\langle \htmlData{mx=84}{\htmlData{mx=83}{\htmlData{mx=79}{k}(\htmlData{mx=82}{\htmlData{mx=80}{z}(\htmlData{mx=81}{i})})}_{1}}, \htmlData{mx=90}{\htmlData{mx=89}{\htmlData{mx=85}{v}(\htmlData{mx=88}{\htmlData{mx=86}{z}(\htmlData{mx=87}{i})})}_{1}} \right\rangle}, \htmlData{mx=95}{\htmlData{mx=94}{\htmlData{mx=92}{z}(\htmlData{mx=93}{i})}_{2}} \right)}})}}})} \left.\right) \end{aligned}
What the notation means · or point at any symbol
NNatural numbers
The natural numbers 0, 1, 2, …. In Lean they start at 0. (ℕ)
x ∈ TVariables
n, d range over natural numbers: the statement must hold for every choice. ((n d : ℕ))
Type
Type: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Type)
·Multiplication
Type times . (Type*)
NormedAddCommGroup
NormedAddCommGroup: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (NormedAddCommGroup)
f(x)Function application
NormedAddCommGroup applied to E. Lean writes f x; papers write f(x). (NormedAddCommGroup E)
InnerProductSpace
InnerProductSpace: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (InnerProductSpace)
Key
Key: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Key)
Fin
Fin: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Fin)
⟹Implies
If Fin(n), then Key(d). (Between types, A → B is the type of functions from A to B.) (Fin n → Key d)
<Less than
0 is strictly smaller than n. (0<n)
Row
Row: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Row)
=Equality
sum(univ, z ↦ rejectionWeight(indexedWeight(A, q, w, k, v)… and sum(univ, z ↦ rejectionWeight(reference(A, q, w, k, v), j … are the same. ((Finset.sum Finset.univ (fun z : Path (…)
sum
Finset.sum: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Finset.sum)
×Product
Pairs of an element of Row(d, E) and an element of Bool. (Row d E × Bool)
univ
Finset.univ: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Finset.univ)
RReal numbers
The real numbers: every point on the number line. (ℝ)
Bool
Bool: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Bool)
Path
Path: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (Path)
IndexedDraw
IndexedDraw: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (IndexedDraw)
rejectionWeight
rejectionWeight: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (rejectionWeight)
indexedWeight
indexedWeight: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (indexedWeight)
x ↦ f(x)Function (λ-abstraction)
The function sending j to accept(indexedRow(A, w, k, v, j)). Lean writes fun x => …; papers write x ↦ …. (fun j => accept (indexedRow A w k v j))
indexedRow
indexedRow: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (indexedRow)
(a, b)Tuple
The ordered pair (or tuple) of indexedRow(A, w, k, v, z(i)).1, z(i).2. ((indexedRow A w k v (z i).1,(z i).2))
p₁Component
Component 1 of indexedRow(A, w, k, v, z(i)) (the first). (indexedRow A w k v (z i).1)
reference
reference: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (reference)
(x : T)Type ascription
⟨k(j), v(j)⟩ read as a Row(d, E). Mathematicians leave this implicit; Lean needs it to know which kind of number is meant. ((⟨k j,v j⟩ : Row d E))
⟨a, b⟩Anonymous constructor
Builds a structure (a pair, a subtype element, …) from k(j), v(j). (⟨k j,v j⟩)

Exact finite formal target reconstructed from the supplied version-7 review. Proof resides in the pinned additive library. Standard Lean axioms only. Does not certify floating-point implementation, full RAM runtime, weighted adaptive frontier, or unrestricted attention hardness.

How it was proved

Proved
6 October 2026
By
Ajax
Checked by
Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
Axioms
Classical.choice, Quot.sound, propext
Proof
17 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.

More proved statements