Evolutionary game theory studies how a population's composition changes when the success of a pure strategy depends on which other pure strategies it encounters. The central feedback is a frequency-dependent payoff: becoming common changes the opponents a strategy meets, which can change whether it does well. In a coordination game, common behaviour can reinforce itself; in the coexistence example below, being rare is an advantage. This makes evolutionary game theory useful for asking which behaviours can persist and which initial compositions lead to different outcomes, without assuming that each participant solves an optimization problem.

In the basic model, a large, well-mixed population has finitely many inherited pure strategies; interactions sample opponents according to their population frequencies. Assume that a strategy's expected payoff determines its per capita net reproductive growth rate, with a common baseline allowed. These are modelling assumptions: reproduction must transmit the strategy, encounters must match the proposed sampling rule, and the conversion from payoff to growth must be justified for an application. The replicator equation below describes the resulting continuous-time frequencies. Taylor and Jonker's ^[ref] explicitly derive this growth model.

For learned behaviour, reproduction can instead be replaced by an assumed copying rule: an individual samples another individual uniformly and copies a better-performing pure strategy at a rate proportional to the positive payoff difference. At frequencies $x_i,x_j$, the net flow from $j$ to $i$ is $x_i{x}_j(f_i-f_j)$, because the two directional positive parts subtract to $f_i-f_j$. Summing over $j$ gives $x_i(f_i-\bar{f})$, the replicator equation. This derivation states a particular mechanism; an arbitrary rule for learning or imitation need not give the same dynamical system.

Three questions must be distinguished. A symmetric Nash equilibrium tests whether an individual can improve its expected payoff against the resident composition. An evolutionarily stable strategy tests whether each distinct rare mutant is outperformed after it is introduced. Dynamical stability tests the response of an actual dynamical system to small changes of composition, and asymptotic stability additionally requires nearby trajectories to converge. For a finite symmetric bimatrix game under the continuous-time replicator equation, every evolutionarily stable strategy is a symmetric Nash equilibrium and a locally asymptotically stable rest point; the converse from asymptotic stability to an evolutionarily stable strategy fails in general. See Ross Cressman and Yi Tao, The replicator equation and other game dynamics (2014), Theorems 1–2 and Example 1. These statements refer to stability on the full probability simplex, including perturbations introducing currently absent pure strategies.

A concrete experiment makes the frequency feedback visible. In 2009, Gore, Youk and van Oudenaarden competed two yeast strains: a producer of the enzyme invertase, which enables sucrose hydrolysis, and a mutant lacking the corresponding SUC2 gene. Released sugars can feed neighbours, so avoiding production can be advantageous. They used shaken 5 mL cultures with 5% sucrose at $30{}^{\circ }\mathrm{C}$, diluted daily after 23 hours of growth. Different labelled proteins allowed the two strains to be counted separately by flow cytometry; selective plating periodically checked the counts. The cooperator required externally supplied histidine, so restricting that amino acid imposed an adjustable growth disadvantage. See Snowdrift game dynamics and facultative cheating in yeast, pp. 253 and 255–256, Methods Summary.

Starting with rare producers and, separately, rare nonproducers tested both invasion directions. Under the reported coexistence conditions each rare strain increased; changing histidine or added glucose shifted the eventual composition. Their explanation used nonlinear growth benefits, rather than a fixed pairwise payoff matrix. This motivates testing both rarity regimes before inferring an evolutionarily stable strategy or fitting a replicator equation; it does not identify the illustrative tables below with measured payoffs. See Gore, Youk and van Oudenaarden, Figures 1–3.

An early motivation was understanding why animal contests can involve restraint even when escalation might win an individual encounter. Maynard Smith and Price's ^[ref] introduced the evolutionarily stable strategy in this setting. Taylor and Jonker's ^[ref] then studied explicit continuous and discrete dynamics. Static resistance to invasion and the paths populations follow are related questions, but they require separate definitions.

Two people can each have a clear incentive to choose an outcome that leaves both worse off. The prisoner's dilemma isolates this tension between individual best responses and Pareto efficiency. For example, two partners can each save effort by withholding a promised contribution, yet both would prefer a successful joint project to mutual withholding. The model applies when each person's payoffs really have the ordering below; the names “cooperate” and “defect” alone do not establish a prisoner's dilemma.

In the symmetric two-player normal-form game, each player chooses cooperation $C$ or defection $D$ simultaneously, without observing the other's current choice. The four payoffs are the mutual-cooperation reward $R$, mutual-defection punishment $P$, sole-defector temptation $T$, and sole-cooperator payoff $S$, with $T>R>P>S$. Defection is a strictly dominant strategy: it beats cooperation against either opposing pure strategy. This definition and the resulting one-shot Nash equilibrium are discussed in Steven Kuhn, Prisoner's Dilemma, Stanford Encyclopedia of Philosophy, section 1.

Take the concrete payoffs $T=5$, $R=3$, $P=1$, $S=0$. Each entry below gives the row player's payoff followed by the column player's payoff:

For the row player, switching from $C$ to $D$ improves the payoff from $3$ to $5$ against $C$, and from $0$ to $1$ against $D$. The column player has the same comparisons, so $D$ is a strictly dominant strategy for each. Even against a mixed strategy choosing $C$ with probability $q$, the expected payoff advantage is $2q+(1-q)=1+q>0$. Thus cooperation cannot appear with positive probability in a best response, and $(D,D)$ is the unique one-shot Nash equilibrium, including mixed strategies.

At $(D,D)$, a unilateral deviation to $C$ lowers the deviator's payoff from $1$ to $0$. A joint change to $(C,C)$ instead raises both payoffs from $1$ to $3$: mutual cooperation Pareto dominates mutual defection, making the Nash equilibrium fail Pareto efficiency. A Nash equilibrium tests unilateral deviations, so it need not maximize shared gains. This is the useful lesson: improving the available outcome may require changing incentives, rather than telling each participant to choose a better best response.

The additional inequality $2R\ge T+S$ says that mutual cooperation gives each player at least as much average payoff as equal-time alternation between the two asymmetric outcomes. It is a further assumption, not a consequence of $T>R>P>S$. Here it holds strictly: $6>5$, and alternating exploitation gives each player average payoff $5/2<3$. This comparison concerns equal-time averages, not every discounted sequence. See Kuhn, section 3, on the additional cardinal-payoff condition.

A resolvent is an auxiliary polynomial built from expressions in the roots of a polynomial. The action of its Galois group on those expressions gives information about solvability and intermediate field extensions. A Lagrange resolvent for a cubic uses Fourier combinations of the three roots.

An algebraic extension in characteristic $p>0$ is purely inseparable when every one of its elements is purely inseparable over the base field.

An algebraic extension is separable when every element has a minimal polynomial with distinct roots.

An algebraic extension $L/K$ is normal when every irreducible polynomial over $K$ with a root in $L$ splits in $L$. For finite extensions, equivalently every $K$-embedding into an algebraic closure has image $L$.

The inverse Galois problem asks which finite groups occur as Galois groups over a given field, with the classical problem taking the base field to be $\mathbb{Q}$. A regular realization over $K(T)$ and Galois-preserving Hilbert specialization solve an instance over a Hilbertian field. Realization over an algebraically closed constant field's rational function field alone does not supply descent to $\mathbb{Q}$.

A spiral galaxy has a galactic disk with spiral structure, commonly cold interstellar gas and ongoing star formation as well as an older stellar population.

An irregular galaxy lacks a regular spiral or elliptical outline. Many contain substantial gas and recent star formation; irregular appearance alone does not determine a stellar population's age.

A star-forming galaxy is a galaxy with ongoing star formation. Its hot young stars can supply hydrogen-ionizing radiation to the intergalactic medium, with the contribution controlled by the ionizing photon escape fraction.

A stellar halo is the extended, approximately spheroidal stellar population surrounding a galaxy. It differs from the total dark matter halo. If its outer luminosity density is $r^{-p}$, its projected light follows the projection of a spherical power-law emissivity and scales as $R^{1-p}$ away from breaks and outer truncation.

A galactic bulge is a centrally concentrated stellar population in a galaxy, usually thicker than its disk. Its origin, rotation and random stellar motions can differ from those of the disk; bulge light is often described by a Sérsic profile.

Yeasts are fungi whose growth is predominantly unicellular, commonly through budding or division into two cells. The word describes a growth form across different fungal lineages, rather than one species or an exclusive clade; some fungi can switch between unicellular and filamentous growth. Thus Saccharomyces cerevisiae is a yeast, but yeast is not another name for that one species. See Kurtzman, Fell and Boekhout, The Yeasts, chapter 1 (2011): definition and classification.

A yeast cell has eukaryotic organization, including a cell nucleus, mitochondria and a cell wall. Small size and a unicellular lifestyle do not make it a member of bacteria. These compartments let an experimentally accessible biological cell retain much of the organization shared with other eukaryotes. See Clark, Douglas and Choi, Biology 2e, 24.1: fungal cells and yeast growth.

A motivating experiment: can fermentation continue without intact yeast cells? In 1897, Eduard Buchner ground brewers' yeast with quartz sand and diatomite, added water, and pressed out a liquid extract. Adding concentrated cane sugar produced carbon dioxide after 15–60 minutes. A cell-retaining filter still yielded an active filtrate: with sterilized cane sugar in an icebox, fermentation began after about a day. Saturated lactose gave no observed fermentation. These are reported observations, not invented control results. See Buchner, Alcoholic fermentation without yeast cells (1897), translated excerpt hosted by Carmen Giunta.

The filtration comparison addresses the objection that surviving intact yeast cells caused the activity. The lactose comparison tests substrate dependence; it is not a no-sugar blank, nor a comparison at matched sugar concentrations. A proposed modern follow-up would also compare the same extract with and without added sugar, accounting for material already in the extract. That is an experimental suggestion, not a result attributed to Buchner. His report specifies brewers' yeast; it does not identify the preparation here as a pure Saccharomyces cerevisiae strain.

Heat treatment asks a different question: does destroying activity in the extract stop fermentation? Buchner's preliminary report described weak or absent activity after heating and filtration, rather than one clean universal threshold. Harden's 1914 account of the subsequent work summarized loss of activity on heating the juice to $50{}^{\circ }\mathrm{C}$. Harden also described requirements for both enzymes and coenzymes. Cell-free therefore means neither chemical-free nor a preparation containing one purified enzyme. See Arthur Harden, Alcoholic Fermentation (1914), chapters II and VI: cell-free activity and the fermenting complex.

The inference is that extracted cellular machinery can sustain these chemical reactions without an intact living biological cell. This does not show that the extract reproduces, grows or maintains itself like a yeast. Moreover, gas evolution alone does not identify ethanol: cellular respiration can also release carbon dioxide. Product identification is a separate measurement; Harden's account describes both ethanol and carbon dioxide as products of cell-free alcoholic fermentation. The beautiful separation is between the organism that produces and maintains the machinery and the machinery that catalyzes a particular transformation.

A glucan is a polysaccharide built from glucose units. Different linkages produce different structures; some glucans contribute to a fungal cell wall.

Chitin is a structural polysaccharide built from modified sugar units. It contributes reinforcement to a fungal cell wall.

If a nonconstant complex polynomial $P$ had no zeros, its reciprocal $g=1/P$ would be an entire holomorphic function, bounded and tending to zero at infinity. Its real and imaginary parts are harmonic functions. Thus $g(z+B_t)$, for planar Brownian motion started at zero, is a bounded complex martingale with expectation $g(z)$. For fixed $R$, the Gaussian density bounds $\mathbb{P}(|z+B_t|\le R)$ by $R^2/(2t)$. Outside a sufficiently large disk, $|g|\le \epsilon$. Hence $|g(z)|\le \epsilon +\Vert g{\Vert }_{\infty }{R}^2/(2t)$. Let $t\to \infty$ and then $\epsilon \downarrow 0$ to obtain $g(z)=0$, a contradiction. This proves the fundamental theorem of algebra without the maximum modulus principle.

A continuous real function satisfying $g(x+y)=g(x)g(y)$ is either identically zero or $g(x)=e^{cx}$ for a real constant $c$. If it is nonzero somewhere, $g(0)=1$ and $g(x)g(-x)=1$, so it never vanishes. The identity $g(x)=g(x/2{)}^2$ then makes it everywhere positive. Its real logarithm is a continuous additive function, hence linear by additive function continuous at one point is linear. Exponentiating proves the classification, and each listed function satisfies the equation.

A real-valued functional $p$ is sublinear when
$p(x+y)\le p(x)+p(y)$ and $p(tx)=tp(x)$ for every $t\ge 0$.

A locally convex topological vector space is reflexive when its canonical evaluation map to its continuous bidual is an isomorphism with the specified strong dual topologies. For a Banach space, this reduces to surjectivity of the canonical map and gives a reflexive Banach space.

A nonnegative function-valued operator $S$ is sublinear if $S(f+g)\le S(f)+S(g)$ and $S(cf)=|c|S(f)$ almost everywhere. This pointwise domination notion includes maximal one-sided interval averaging operators and differs from requiring an ordinary linear map.