Read the equation
State three receives the previous value of state two, and state four receives the previous value of state three. These equations create a two-stage delay with no numerical transformation. In-place sequential updates would change that delay and would be a different implementation.
Terms & definitions
| Term | Meaning in this source |
|---|---|
| s_2 | Upstream state |
| s_3 | Middle state |
| s_4 | Downstream state |
How it works
Read the definition from its right-hand expression to the quantity on the left. Its surrounding source records the intended input, state, or parameter context. Where the source leaves an operation unspecified, this page preserves that gap.
Assumptions & limits
Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.
Original context
Read the surrounding source passage
Consider seven independently stored scalar states updated synchronously: s1,t+1=s7,t+1, s2,t+1=s1,t−1. s3,t+1=s2,t, s4,t+1=s3,t. s5,t+1=1, s6,t+1=s5,t, s7,t+1=1/s6,t. At a valid equilibrium these equations give s1,s2,s3,s4,s5,s6,s7=2,1,1,1,1,1,1.
Exact original notation
{s}_{3,t+1}={s}_{2,t}, {s}_{4,t+1}={s}_{3,t}.Sources & provenance
{s}_{3,t+1}={s}_{2,t}, {s}_{4,t+1}={s}_{3,t}.
{s}_{3,t+1}={s}_{2,t}, {s}_{4,t+1}={s}_{3,t}.