Equation 2 · Part 13 · Apprenticeship as Information Transfer

Starting index or lower bound: k=1

C_n = C_0 \prod_{k=1}^{n} f_k + \sum_{k=1}^{n} i_k \prod_{j=k+1}^{n} f_j

k=1

What this part means

This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.

Its job in the formula

k=1 appears in the bound of this product. The bound states where the repeated operation starts, ends, or which values it includes.

Full expressionStarting index or lower bound: k=1Article meaning

The passage around this formula

A useful way to make the retention condition inspectable is to write the accumulated complexity after n transmission steps as a product of per-step fidelities plus whatever is added along the way: $C_n = C_0 \prod_{k=1}^{n} f_k + \sum_{k=1}^{n} i_k \prod_{j=k+1}^{n} f_j$ . Here $C_0$ is the starting repertoire, $f_k$ is the fraction of it that survives step k , and $i_k$ is what is genuinely added at that step. This expression is illustrative rather than a result from any of the studies cited here, and it should not be mistaken for one. Its only job is to expose an assumption: because fidelities multiply, a small shortfall per step compounds, and later innovations are discounted by every fidelity term that follows them. Under this framing, raising…

Read this part in the article →

Learn the underlying idea

Σ adds a collection of terms. Π multiplies them. The lower and upper labels tell you which terms belong to the collection.

Open the illustrated sums and products: repeat an operation over an index guide →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.