|
Evolution in a nutshell an alternative outline on evoution and some consequences concerning valuations by Gregor Kjellström
|
|
Theorem 6.2.2. The theorem of Gaussian adaptation 1. The gradient of the mean fitness of a normal p. d. f. with respect to m is equal to gradmP(m) = P M-1 ( m* – m). The maximizing necessary condition for mean fitness is m* = m (at selective equilibrium). 2. The gradient of phenotypic disorder (entropy, average information, diversity) with respect to m – assuming P constant - points in same direction as gradmP(m). Proof: P(m) = ò s(x) N(m – x) dx. Since differentiation is here allowed to the right of the integral sign we get ¶P(m)/¶mj = ò s(x) { ¶ N(m – x) /¶mj } dx = - ò s(x) N(m – x) { ujT M-1(mj – xj) + (mj – xj)T M-1 uj } / 2 dx, where the components of the vector uj are = 0, except for the component number j which is = 1. Thus we have gradm P(m) = - ò s(x) N(m – x) M-1 (m – x) dx = - P M-1 { m - ò x s(x) N(m – x) dx / P } = P M-1 ( m* – m ) where we have introduced the mean of phenotypes of the set of selected parents m* = [mj*] = ò x s(x) N(m–x) dx / ò s(x) N(m–x) dx = = ò x s(x) N(m–x) dx / P which proves part 1 of the theorem. For the proof of part 2 see theorem 6.2.3. In contrast to Fisher's fundamental theorem, this result seems more reliable, because in a state of selective equilibrium, we have m* = m and consequently no increase in P, i. e. gradm P(m) = 0, but the phenotypic variance – displayed by M and H - must not be equal to zero. Instead, P has been maximized and - as will be shown by the next theorem - det(M) and H are simultaneously maximized with respect to variations in m, keeping P constant, even though this is only a sub-optimal solution as long as the condition M proportional to M* is not utilized. A correspondence to Fisher’s increase in mean fitness may now be derived from Gaussian adaptation. In this case the increase is defined from the offspring in one generation to the offspring in the next (it is assumed that M is fairly constant from one generation to the next). We haveDP = (¶P/¶m1) Dm1 + (¶P/¶m2) Dm2 + … + (¶P/¶mn) DmnIf the Gaussian is moved from m to m* we get the approximationDP = P (m* - m)T M-1 (m* - m);
|
|
|
|