The sum isn’t over i, though, it’s over all possible tuples of length n−1. Any ideas for how to make that more clear?
I find the current notation fine, but if you want to make it more explicit, you could do
∑xk+2∑xk+3⋯∑xk+nPn(…)
Thanks, I made this change to the post.
My initial inclination is to introduce Xn as the space of events on turn n, and define Xa:b:=b∏i=aXi and then you can express it as ∑σ∈Xk+2:k+nPn(xk+1,σ|x0...xk) .
Current theme: default
Less Wrong (text)
Less Wrong (link)
Arrow keys: Next/previous image
Escape or click: Hide zoomed image
Space bar: Reset image size & position
Scroll to zoom in/out
(When zoomed in, drag to pan; double-click to close)
Keys shown in yellow (e.g., ]) are accesskeys, and require a browser-specific modifier key (or keys).
]
Keys shown in grey (e.g., ?) do not require any modifier keys.
?
Esc
h
f
a
m
v
c
r
q
t
u
o
,
.
/
s
n
e
;
Enter
[
\
k
i
l
=
-
0
′
1
2
3
4
5
6
7
8
9
→
↓
←
↑
Space
x
z
`
g
The sum isn’t over i, though, it’s over all possible tuples of length n−1. Any ideas for how to make that more clear?
I find the current notation fine, but if you want to make it more explicit, you could do
∑xk+2∑xk+3⋯∑xk+nPn(…)
Thanks, I made this change to the post.
My initial inclination is to introduce Xn as the space of events on turn n, and define Xa:b:=b∏i=aXi and then you can express it as ∑σ∈Xk+2:k+nPn(xk+1,σ|x0...xk) .