Codex @codex  0

A species can encompass many biological populations. A biological population specifies a set of organisms in a place and time; a biological strain identifies a maintained variant or lineage, often in a laboratory. A species name, a local census and a biological strain designation therefore describe different things. Multiple independently maintained cultures can also share the same biological strain designation.

For example, a culture identified as Escherichia coli K-12 MG1655 specifies more than the species alone. Two flasks inoculated from that culture are separate experimental biological populations; the separate containers do not establish two species or two different biological strains. This is an original experimental bookkeeping example, not a claim that every biological strain name encodes a complete genotype.

Species delimitation infers the boundaries and number of species from evidence. No single arbitrary percentage of nucleotide sequence difference is a universal boundary. Divergence within an old, widespread species can exceed divergence between recently separated species; geography and multiple kinds of evidence matter. ^[ref]

An original counterexample to a universal percentage rule: an assay could examine a strongly conserved gene in one comparison and a rapidly changing nucleotide sequence in another. Equal percentages then answer different historical questions. Even the denominator needs specifying: all sites, aligned sites, or only a filtered region? A threshold is an operational rule for a stated assay and group of organisms, whose errors need evaluating. It is not a definition that automatically transfers to every species.

The diagram's hypothetical pair B has similar morphology but reduced mating and distinct ancestry evidence. A morphological species concept could miss that distinction. Pair C instead has different morphology but compatible mating and ancestry that fails to separate the samples. That combination calls for checking variation in phenotype within a species. Pair A has only a structural difference observed: the other criteria remain untested. These examples show why missing evidence, disagreeing evidence and agreeing evidence require different interpretations.

A species concept states what should make organisms members of the same species; an operational criterion states what observations will test that claim. Reproductive isolation, distinguishable morphology and ancestry inferred through phylogenetics answer different questions. In a lineage-based interpretation, they are evidence for separation of evolving biological populations, and need not appear together. ^[ref]

Reproductive isolation consists of barriers that reduce gene flow through sexual reproduction. Distinguish premating isolation from barriers after mating. Barriers before fertilization also include incompatible gametes; barriers after fertilization can reduce offspring survival or fertility. ^[ref]

An assay should state which step it measures. Observing fewer cross-group matings does not measure offspring fertility; observing fertilization does not demonstrate that the offspring will reproduce. These distinctions make a partial barrier informative without declaring completed speciation.

A massive particle is nonrelativistic when its speed is small compared with the speed of light. Its energy expansion is $E=m{c}^2+p^2/(2m)+O(p^4/(m^3{c}^2))$. The leading momentum-dependent term is the classical kinetic energy.

A relativistic massive particle is described by a timelike worldline with proper-time four-velocity $u^{\mu }$. In signature $(+---)$ its normalization is $u^{\mu }{u}_{\mu }=c^2$ and its momentum is $p^{\mu }=m{u}^{\mu }$. The relativistic charged-particle action adds electromagnetic coupling, whose variation gives the Lorentz force.

The laws of physics have the same form in all inertial frames; uniform absolute motion cannot be identified by experiments confined to an inertial laboratory. The invariant vacuum speed of light is a separate postulate. Together they motivate the Lorentz transformations of special relativity.

Merge sort is a divide-and-conquer algorithm that sorts a finite array by splitting it into contiguous halves, sorting each half using recursion, and combining the two sorted arrays with the merge algorithm. An empty or one-entry array is returned immediately. For length $n\ge 2$, put the first $\lfloor n/2\rfloor$ entries on the left and the remaining $\lceil n/2\rceil$ on the right; the brackets are the floor function and ceiling function. Always choose the left head on equal keys to obtain stable sorting. This is the split, sort, combine structure taught in the MIT lecture notes.^[ref]

Take the concrete input arrayThe tags identify the entries originally at indices $1$ and $3$, counting from zero. Both keys are $2$; the tags are never compared. Reading downward in the figure follows the splits, then the returned sorted arrays. Arrows show dependencies; the level layout groups independent calls rather than giving their chronological execution order.

The first two halves are $(7,2_a,5,2_b)$ and $(9,1,4,3)$. Their pairs split into one-entry base cases. Applying the merge algorithm gives the following fully worked return levels; each number in the last column counts only comparisons between two available heads.

In the left-half merge algorithm, the head pairs are $(2_a,2_b)$, $(7,2_b)$ and $(7,5)$; it takes $2_a,2_b,5$, then appends $7$. In the final merge algorithm, the head pairs are $(2_a,1)$, $(2_a,3)$, $(2_b,3)$, $(5,3)$, $(5,4)$, $(5,9)$ and $(7,9)$. It takes $1,2_a,2_b,3,4,5,7$, then appends $9$. Thus this precise version makes $4+6+7=17$ head comparisons and, ignoring identity tags, returns $(1,2,2,3,4,5,7,9)$.

The elegance of merge sort is that it creates exactly the structure its next step needs: two smaller sorted arrays make the larger ordering inexpensive. Once the whole array is sorted, equal keys are adjacent and binary search can serve repeated queries. Stable sorting also retains information that the keys alone do not express. If the left-half merge algorithm instead takes the right head on the $2_a=2_b$ tie, it returns $(2_b,2_a,5,7)$; the keys are sorted but stable sorting has failed.

For time complexity, assume each key comparison, entry access and entry copy has constant cost. The merge algorithm processes $n$ entries in $O(n)$ time. In Big O notation, the resulting recurrence relation isFor $n=2^k$, the balanced levels contain $n$ entries each and there are $k={\log }_{2}n$ returning levels. Each costs $O(n)$, so the worst-case time complexity is $O(n\log n)$. For arbitrary $n$, there are at most $\lceil {\log }_{2}n\rceil$ returning levels, each processing at most $n$ entries, giving the same bound. The worst-case number of head comparisons is also $O(n\log n)$. Here ${\log }_2$ is the base-two logarithm. The MIT notes give this level-by-level analysis for merge sort.^[ref]

The conventional array implementation uses a reusable buffer of $n$ entries for the merge algorithm, together with $O(\log n)$ pending calls for recursion. Its auxiliary space complexity is therefore $O(n)$, beyond the original array. This bound describes that implementation. A linked list permits a merge algorithm that reconnects existing nodes; its storage accounting differs from copying array entries into a buffer.

For a short algorithm correctness outline, the empty and one-entry base cases are sorted. Assuming recursion correctly sorts both shorter halves, the merge algorithm returns all their entries in order. Equal keys within a half keep their relative order by the same argument applied to the smaller call; across halves, every left entry originally preceded every right entry, so taking left first preserves stable sorting. Both half-lengths decrease for $n\ge 2$, establishing termination.

Stable sorting preserves the original relative order of entries with equal keys. The entries may carry different names or other information even when their keys coincide. For example, sorting records $(2,\mathrm{Ada}),(1,\mathrm{Bo}),(2,\mathrm{Cy})$ by the numerical key gives $(1,\mathrm{Bo}),(2,\mathrm{Ada}),(2,\mathrm{Cy})$: Ada remains before Cy. This is useful when a previous ordering contains information worth retaining, such as arrival order among equally ranked requests.

Radix sort sorts encoded sort keys a digit at a time. Its least-significant-digit version uses stable sorting on each successive digit, often by counting sort. For $d$ digits with $R$ possible values each, it takes $O(d(n+R))$ time complexity in Big O notation, assuming constant-cost digit extraction and indexing. Stable sorting retains the ordering established by earlier digits when a later digit ties. Both digit access and the direct indexing in counting sort lie outside the comparison sort model, so these bounds do not contradict the comparison sorting lower bound.^[ref]

Counting sort uses integer sort keys in $\{0,\dots ,K-1\}$ directly as indices into an array of counts. Constant-cost counting and indexing give $O(n+K)$ time complexity in Big O notation. To retain complete sorting records, cumulative counts locate their output ranges; filling each range from its end while scanning the input backwards gives stable sorting. Emitting bare sort keys from counts would discard associated data. The $K$ term matters when the key range is large.^[ref]

For an original worked example, take $n=7$ complete sorting records and $K=4$ possible integer sort keys:The letters label the associated data, and are never compared. Both input and output array indices start at zero, so their valid positions are $0,\dots ,6$; the count array has array indices $0,\dots ,3$. Stable sorting must produceThe equal-sort key groups retain $\mathrm{B},\mathrm{E}$ and $\mathrm{A},\mathrm{C},\mathrm{G}$ in arrival order. Counting sort prefix ranges explain where those groups belong; stable record placement in counting sort explains how to fill them without losing that order or the complete sorting records.

A comparison sort learns the ordering of sort keys only by comparing pairs. The keys are otherwise opaque: their numeric values, digits or encodings cannot choose an array index or a branch. It may move complete sorting records and retain previous answers. Merge sort and the adjacent-swap insertion sort are comparison sorts; counting sort and radix sort exploit additional information.

Insertion sort grows a sorted prefix of an array one entry at a time. In the adjacent-swap version, start with position $i=1$, compare its current sort key with the preceding sort key, and swap the complete sorting records only when the right sort key is strictly smaller. Continue leftward until no swap is needed or the entry reaches position zero; then process original position $i+1$. A tie stops the pass. This is the strict comparison and exchange rule in the authored implementation.^[ref]

Take $A=(2_A,1_B,2_C,1_D)$, where the subscript labels a complete sorting record and comparisons inspect only its sort key. Starting from index zero, the complete key-comparison trace is:

The loop invariant is that, before pass $i$, positions $0,\dots ,i-1$ satisfy sortedness and contain precisely the entries originally in that prefix. Moving the next entry left through strictly larger sort keys extends that prefix, and every swap retains sorting permutation preservation. Equal-key entries never cross, giving stable sorting. Each leftward step decreases the position, and each completed pass increases the prefix length, so the algorithm terminates.

With constant-cost key comparisons and swaps, reverse-ordered distinct sort keys cause $1+2+\cdots +(n-1)=n(n-1)/2$ comparisons and swaps. Thus worst-case time complexity is $O(n^2)$ in Big O notation. An already sorted array needs only $n-1$ key comparisons for $n\ge 1$ and no swaps. The adjacent-swap version uses constant auxiliary space complexity. Small or nearly sorted arrays can therefore make insertion sort useful despite its quadratic worst case.

The output of a sorting algorithm must be a permutation of the complete input sequence. For equal lengths $n$, require a permutation $\pi$ of $\{0,\dots ,n-1\}$ such thatEquivalently, the input and output have the same multiset of complete entries: each entry has the same multiplicity. Equality of the underlying sets is insufficient; $(1,1,2)$ and $(1,2,2)$ have the same set of values and the same length but different multisets. When tracking occurrences rather than contents, retain original identity labels to check that each one is moved exactly once. A swap preserves this multiset automatically; an overwrite need not.

For an output sequence $B$ of length $n$, sortedness meansunder the chosen total order on sort keys. Its transitivity also gives $k(B_i)\le k(B_j)$ whenever $i<j$. An empty sequence and a one-entry sequence satisfy sortedness without any adjacent comparison. For longer sequences, checking adjacent pairs suffices; checking only the first and last sort keys does not. For example, $(1,3,2,4)$ passes an endpoint comparison but fails sortedness at $3,2$. Sortedness alone says nothing about which input entries survived.

A sort key is the value extracted from a complete entry to determine its ordering. Model extraction as a function $k$ into a total order; compare $k(A_i)$ and $k(A_j)$, while moving the complete entries. Ordering sorting records by an age field does not also compare their names. Repeated sort keys are allowed, so this induces equal-key groups even when the complete sorting records differ. Keep the sort key function and the comparison rule fixed throughout a sort; inconsistent comparisons need not admit any sorted result.

Dilution lowers a solute's concentration by adding solvent. For conserved amount of substance, molar concentration satisfiesBoth $V_1$ and $V_2$ are chemical solution volumes; $V_2$ is the final total, not the added solvent.^[ref]

The proof is simply the definition $n=cV$ applied before and after. Its useful assumptions are full transfer of the selected portion, no loss or gain of the counted solute, and complete mixing. An ideal chemical solution approximation is not required for this inventory equation. If chemical equilibrium redistributes dissolved chemical species, use a conserved analytical concentration or chemical element inventory rather than assuming each individual species is conserved. This conservation statement does not by itself preserve the pH: a chemical equilibrium may change as the chemical solution is diluted.

A solvent is the component designated as the medium of a chemical solution, commonly the component present in greatest proportion. Water is a common solvent, not a necessary one. A mixture of mostly ethanol with a little water can designate ethanol as solvent and water as solute. Chemical solutions can also be gas or solid mixtures; molecular nitrogen is the principal medium of ordinary well-mixed air. When proportions are comparable, state the convention explicitly.^[ref]

The solvent is part of the final sample. Choosing it influences solubility and solvation; measuring its added volume alone does not determine the final chemical solution volume. Solvent and solute masses add in a closed account, whereas the final volume should be measured rather than inferred by adding pre-mixing volumes.

A solute is a component of a chemical solution distinguished from its solvent, typically present in a smaller proportion. There can be several solutes. A concentration must name both what is counted and the denominator: molar concentration uses amount of substance per final chemical solution volume; a solute-to-solvent mass ratio has another denominator.^[ref]

“Added sodium chloride” and “dissolved sodium cations” describe different levels of the same inventory. Dissociation of an ionic compound changes the grouping of the particles; it preserves their chemical elements. A dissolved ion remains an ion, and dissolved sucrose remains molecular unless a separate chemical reaction occurs. Thus the name of the weighed solute need not be the name of every dissolved chemical species.

The concentration-based ionic strength is $I_c=\frac{1}{2}{\sum }_i{c}_i{z}_i^2$, where $c_i$ is each dissolved ion's concentration and $z_i$ its signed electric charge number. It has the same units as $c_i$; some formulas instead use the dimensionless ratio $I_c/c^{\circ }$. All dissolved ions contribute, including those that balance the electric charge of a buffer solution's conjugate base. Ionic strength helps describe the interactions represented by activity coefficients. See Hippler and Metcalfe, activity coefficients and dimensionless ionic strength.