← Back to article

Equation 2 · Apprenticeship as Information Transfer

What does this equation mean?

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

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

Inputs and operationsC_0 prod_k=1^n f_k + sum_k=1^n i_k prod_j=k+1^n f_j
Result or conditionC_n
How to read the two sides of this formula. Follow the article passage for the meaning of each quantity.

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

CnC_n

Symbol C_n

CnC_n is part of the quantity the equation computes from the expression on the right.

Understand this part →

C0C_0

Symbol C_0

the starting repertoire.

Understand this part →

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.

Understand this part →

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.

Understand this part →

fkf_k

Symbol f_k

the fraction of it that survives step k.

Understand this part →

iki_k

Symbol i_k

what is genuinely added at that step.

Understand this part →

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.

Understand this part →

fjf_j

Symbol f_j

fjf_j is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

=

=

The expressions on both sides represent the same quantity under the stated assumptions.

Understand this part →

See an illustrated explanation →
addition

addition

Add the term after the plus sign to the term or group before it.

Understand this part →

subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

superscript

superscript

A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.

Understand this part →

See an illustrated explanation →
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.

Understand this part →

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.

Understand this part →

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.

Understand this part →

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.

Understand this part →

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.

Understand this part →

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.

Understand this part →

How to interpret it

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

What the article says around this equation

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 surrounding passage
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 average fidelity does more for long-run complexity than raising the innovation rate — which is precisely the claim that the experimental literature has tried to test, and precisely the assumption that the demographic models discussed later depend on.

Read the equation in its article →

Sources cited in the article section

These citations give research context. Read each source to check which claims it supports.

Return to Apprenticeship as Information Transfer

See this formula across 1 published context →

Browse the mathematical compendium →