{'fraction_non_alphanumeric': 0.027175802526364586, 'fraction_numerical': 0.008981341986325183, 'mean_word_length': 4.3934375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Replication Error and Time Evolution of a Self-Replicating System

A self-replicating system where the elements belonging to a solution category can replicate themselves by copying their own informations, is considered. The information carried by each element is defined by an element of all the n multiple tensor product of a base space that consists of m different base elements. We assume that in the replication the processes of copying each base information are the same and independent from one another and that the copying error distribution in each process is characterized by a small variation with a quite small mean value. Concentrating on the number fluctuation of the informations in the copying process, we analyze the time evolution of the system. We illustrate the change of averaged number of informations carried by system objects and the variation of the number distribution as a function of time. Especially, it is shown that the averaged number of information grows in general after large number of generations.


Introduction
One of the essential features of the life system is that most of its element do possess an ability to replicate themselves by copying their own informations. The copying mechanisms in each element are mostly the same but its effectiveness is not perfect due to chemical and quantum fluctuations. If it were perfect, there should not be any change of the species of the system in its time evolution. The random fluctuation involved in this copying process is, hence, another important ingredient of the system in understanding its time evolution.
The natural consequences of the replication with random fluctuation are of great interest since they may explain main characteristics of our life system. Admitting the complication in treating the real life system, one may introduce a simplified version of the system that, however, comprises the essential features of our life system on the aspect of the replication and the distribution of the information numbers.
In this note, we shall consider the following simplified version. The system consists of objects that carry a characteristic information defined as an element belonging to all the n multiple tensor products of a base space for all the nonnegative integer n.
We shall then define the information number of an object by N when it belongs to N-multiple tensor product space. The elements in the base space are fixed and their total number, m, is finite. In the real life system, for example, these base elements correspond to the four base acids. Namely, they are adenine, guanine, cytosine, and thymine. The information ensemble space is the place where the dynamics of interest occurs. A solution (moduli) space is defined as a subset of the information ensemble space with a restriction to the objects carrying the information element that may replicate themselves. We assume that the replication mechanism of a base element is mostly the same and the unit processes copying base information are independent events. Due to the chemical and quantum mechanical fluctuations, there might be copying errors that maps one specific element of the base space to an element in the ensemble space. Of course, the errors are quite small but still to be a main source of the dynamical flow of the system after generations. The errors include the change of the original base element into another base element, omission of the original base element and mapping the base element into more than a base element. The probability of mapping the base element to more than two base units is quite small compared to the total probability of errors and, hence, the mean of the fluctuation is very close to the case of no errors. The mean of the errors is more or less inclined to the direction of growing of average numbers after one copy event because of the asymmetry reflected in the fact that there are no counterparts of mapping a base element to more than two base elements about the symmetry point of the mapping to just one element.
The unit time between subsequent generations will be set all the same and time flow will be measured by the number of generations. This implies that all the objects in the system at certain time have exactly the same numbers of ancestors born after an initial time. The next generation will be defined by the set of two identical descendents from each object of the original system which belongs to the solution category. The solution space is determined as a function of environment and the system itself. The properties of the solution space are not known mostly for realistic life systems. We shall introduce a minimal assumption that the density of solutions over the total ensemble space can be defined as a smooth function. This means that the solutions are densely distributed over the whole information configuration space.
Basic features of the time evolution of the system are as follows. Because of the copying errors, the consequence of all the replications of the objects of the original generation belonging to the solution space will be the next generation set whose elements may or may not belong to the solution space. After a unit time, the next generation again replicate its elements once they belong to the solution space. Repeating this process from generations to generations, the generations will flow in the information configuration space quite as the time flies, but the flow will be restricted to regions of near solution space. The errors propagate and the initial set diffuses into the new arena in the configuration space. What are the properties of the dynamics of the system as the number of generations grows?
In this note, we shall concentrate on the information number fluctuation of the system objects as a result of the replication. Especially, we will consider the averaged information number and their variation as a function of time. In this way, we will demonstrate that there is a finite probability of the appearance of objects carrying a large number of information compared to that of an initial ancestor.

Self replicating system and its evolution
As mentioned in the introduction, the self-replicating system consists of objects that carry an information element belonging to the information configuration space. To define the configuration space, we first introduce a base space B with a finite number of elements: The information configuration space is then the direct sum of all n-multiple tensor product, where B n denotes the n multiple tensor product of the base space B. For each element of the information configuration space, we specify its number of information by the order of the tensor product where it belongs. As a subset of the ensemble space, the solution space S k is composed of the information elements, whose objects have an ability to replicate themselves from the k-th generation to the (k + 1)-th generation.
As remarked earlier, we will assume that the solution space elements are densely distributed over the information ensemble space, so that one may define the density of the solutions ρ(n, k) as a smooth function of n where N(A) is the number of elements in a set A and Z ρ is a normalization constant. The number fluctuation involved in the replication event of a base element takes the a distribution d(1 + µ 0 , σ 0 ) with a mean 1 + µ 0 and a standard deviation σ 0 . If one denotes the probability of l base elements resulted from a unit base by p l for a copy, one may infer that p 0 ∼ p 2 = p (p 2 − p 0 ≪ p), p 3 ≪ p and the contribution of all the higher mode may be ignored as explained earlier. By an explicit computation, one finds that σ 2 0 ∼ 2p and µ 0 ∼ 2p 3 + p 2 − p 0 ≪ σ 2 0 . Here, the variation σ 2 0 is much smaller than one, and we use an approximation that one is describing the distribution as if n is a continuous parameter. When one replicates an object carrying n information, the number fluctuation associated with this is described by owing to the independence of all the replication events as well as the central limit theorem. The informations of the system is also given as a subset A k of the configuration space at the k-th generation. The distribution of the system informations over the ensemble space at the k-th generation is then described by where φ(n, 0) represents the initial distribution of the informations and Z φ denotes a normalization factor. With help of the distribution function in (2.4), one finds the density distribution of the system in the next generation is determined by the diffusion process from the set A k ∩ S k at the k-th generation. Namely, all the element in A k ∩S k are doubled by replications and the number distribution of each descendent is described by (2.4). This is summarized in terms of the density description by where G(n, n ′ ) is the propagator of the distribution In (2.6), the factor two by the doubling as a result of replication is absorbed into the normalization factor of the density function. By the mathematical induction, the density of the system information at arbitrary generation is obtained from the initial data by where the propagator is defined as with n k = n and n 0 = n ′ . The propergator in (2.6) can be represented in a differential form for small µ 0 and σ 2 0 . To measure the smallness of the mean and the variation, we introduce new parameters µ and σ by such that the new parameter σ 2 is O(1). To obtain the differential form of the propagation, we define the infinitesimal time evolution by where one measures the time by ǫ multiplied by the number of generations k. Introducing a variable ξ by one may rewrite the above integral as Integrating over the ξ-variable, one may obtain the following differential equation, where the definition r 2 = s = x 2 1 + x 2 2 + x 2 3 + x 2 4 and the four dimensional gradient ∇ ≡ ip are introduced. Although the Hamiltonian is not a Hermitian operator, the time evolution of the system is well defined.
Inclusion of the density contribution to the time evolution is a complicated problem. Some speculations on the dynamics with some generic density function will be relegated to the conclusion. Here, let us consider the case that it is possible to write the density function in a form where the function U(s, t) satisfies the requirement Note that the overall factor ρ 0 will be absorbed into the normalization of the distribution function φ without changing the probability amplitude. Thus the time evolution of the system function φ(s, t) for this case can be easily identified as from the combination of (2.6) (2.14) and (2.17). Hence the differential equation describing the time evolution with the density function (2.17) is As discussed in the introduction, the form of the potential U(s, t) may depend upon the system function φ(s, t) because the system itself works as an environmental element. However, we won't further discuss this possibility in the following for the simplicity.

Solution and statistics of self-replicating system
In the preceding section, we discuss the time evolution process and the differential equation governing the system dynamics. For the case that one may characterize the system by the potential U for the solution density contribution, the time evolution of the system follows the differential equation (2.20). Let us first consider the case U = 0, which implies that the density function is constant in its argument. Namely, the solution space distribution is uniform over the information configuration space.
To find the dynamics, it is convenient to construct the kernel K(r 2 , r ′ 2 ; t) that is defined as a solution of the equation (2.20) with the initial condition φ 0 (r 2 ) = δ(r 2 − r ′ 2 ). (3.1) With help of the kernel, the solution for a general initial condition φ(r 2 , 0) is obtained In order to find the kernel, we first introduce the functionφ(r 2 , t) by φ(r 2 , t) = e µr 2 /σ 2φ (r 2 , t), (3.3) and insert this into the equation (2.20). One finds that the equation forφ now reads with a new HamiltonianH It is interesting to note that this is the Hamiltonian that describes a simple harmonic oscillator in four dimensional flat Euclidean space. The kernel for the equation (3.4) is simply a product of the propagator for one dimensional simple harmonic oscillator [1]: with the solution of the differential equation (3.4) for an arbitrary initial condition g(x, 0). The kernel for our system is then obtained by taking g(x ′ , 0) = e −µr ′2 /σ 2 δ(r ′ 2 −r 0 2 ) in (3.7) and multiplying the factor e µr 2 /σ 2 . Using the integral representation of the Bessel function [2], one finds that the expression for the kernel reads where I 1 (x) is the first-kind Bessel function of imaginary argument. For the consistency of the equation (3.2), the kernel must satisfy the relation Following the standard rule, the mean M(t) and V (t) variation of the number of information are defined by (3.10) (3.11) For the case of the initial condition φ 0 (s) = δ(s − s 0 ), one may compute explicitly the mean and variation noting that φ(s, t) is given by K(s, s 0 ; t). For this initial condition, we first compute the total amplitude P (t); the resulting expression reads As a function of t, µ and σ, the mean and variation for the initial condition are explicitly M(t) = s 0 e 2µt P −1 (t) (3.13) 2µs 0 e µt σ 2 sinh µt } P −2 (t). (3.14) By taking the limit that µ goes to zero from these expressions, one may obtain the mean and variation of the system with µ = 0 and they are where λ = 2s 0 /σ 2 . For t ≪ λ, one finds that the mean and variation are which agree with those computed from the initial condition φ(s, 0) = δ(s − s 0 ). On the other hand, for t ≫ λ, we have (3.18) Hence the mean and variation are independent of the initial parameter s 0 and grow in a power law of time as the time gets larger. With the nonvanishing µ, one finds that as far as |µt| ≪ 1, the mean and the variation behave in the same way as the case with µ = 0. On the other hand, for the case µt ≫ 1, the mean and variation are approximated by For the case that U is much larger than U 0 = µ 2 s/2σ 2 , the growth of the mean and variation are relatively suppressed. The other limiting case, −U/U 0 ≫ 1, the mean and variation grow much faster in time compared to the case U = 0.
What happens to the case that the influence of the density cannot be presented in terms of the potential description? In this case, the amplification by the density multiplication in each generation are O(1) and become huge after a large number of generations are passed. The distribution function of the system will be sharply peaked at the maximum of the density after a large number of generations. This is characterized by the mean M(t) → Max(ρ(s, t)) with V (t) → 0. Thus, in this case one may conclude that there is no evolution of the system at all after a large time as far as the probability distribution of the system is concerned.
One may speculate that the real life system presides in between the two limiting cases of the O(1) variation of the density function and U = 0.

Outlook
As a simplified version of the real life system, we have modeled the self-replicating system whose dynamics can be projected onto the space of information configurations.
Each object in the system carries an information element in the configuration space.
The unit copying process for the replication of the base information is characterized by the number fluctuation with the mean µ 0 and the standard deviation σ 0 , and each of unit copying is assumed to be an independent event. We define the solution space by the condition that its element has an enough information to replicate itself to the next generation. To characterize the properties of the solution space, we define the density function of the solution space over the information configuration space. We have shown that the dynamics of the system is described with help of the time evolution kernel and may be mapped into the evolution of the four dimensional harmonic oscillator for the case of uniform density of the solution space. In addition, we have discussed the system dynamics for the various case of nonuniform density.
Especially, we have proved that the time evolution of the mean and variation of the information numbers over the system configuration are growing with time with a few exceptions. This exception compiles the case of the negative µ, which is improbable in the realistic system.
In our model, some details of the real life system are not included for simplicity.
For example, the unit time intervals between generations are not all the same but depend upon the generations and the information number variable in the real life system. The number of descendents from a system object after a generation is also dependent on the time and the number variable. Moreover, there are two kinds of the replication processes, which are nothing but asexual and sexual reproductions.
There may be also a probability to fail to produce something else rather than base elements in the unit copying process, though it is expected to be extremely small.
As mentioned earlier, it may be the case that the density of the solution space is a functional of the system distribution φ(s, t). In this case, the equation