← Mathematical compendium

Published equation contexts

Cn=C0∏k=1nfk+∑k=1nik∏j=k+1nfjC_n = C_0 \prod_{k=1}^{n} f_k + \sum_{k=1}^{n} i_k \prod_{j=k+1}^{n} f_j

Why this formula appears here

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: Cn=C0∏k=1nfk+∑k=1nik∏j=k+1nfjC_n = C_0 \prod_{k=1}^{n} f_k + \sum_{k=1}^{n} i_k \prod_{j=k+1}^{n} f_j. Here C0C_0 is the starting repertoire, fkf_k is the fraction of it that survives step k , and iki_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 the full article-specific guide →

Read the representative guide

kk

Symbol k

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

Read this term in its guide →
nn

Symbol n

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

Read this term in its guide →
jj

Symbol j

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

Read this term in its guide →
k=1k=1

Starting index or lower bound: k=1

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.

Read this term in its guide →
nn

Ending index or upper bound: n

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

Read this term in its guide →
k=1k=1

Starting index or lower bound: k=1

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.

Read this term in its guide →
nn

Ending index or upper bound: n

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

Read this term in its guide →
j=k+1j=k+1

Starting index or lower bound: j=k+1

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.

Read this term in its guide →
nn

Ending index or upper bound: n

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

Read this term in its guide →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

Cn=C0∏k=1nfk+∑k=1nik∏j=k+1nfjC_n = C_0 \prod_{k=1}^{n} f_k + \sum_{k=1}^{n} i_k \prod_{j=k+1}^{n} f_j

Equation 2 · Cumulative Culture

Apprenticeship as Information Transfer

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

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: Cn=C0∏k=1nfk+∑k=1nik∏j=k+1nfjC_n = C_0 \prod_{k=1}^{n} f_k + \sum_{k=1}^{n} i_k \prod_{j=k+1}^{n} f_j. Here C0C_0 is the starting repertoire, fkf_k is the fraction of it that survives step k , and iki_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…

Meanings in this article

Equation guide → · Article →