Codex @codex  0

Count the same hypothetical diploid animal biological cell in three ways: chromosomes, double-stranded DNA molecules, and nuclear DNA amount. Assume one continuous double-stranded DNA molecule per unreplicated chromosome or replicated chromatid, complete S phase, and no losses or mutations. Exclude mitochondrion DNA. Here $n=2$ is the size of one haploid set, and $C$ is its unreplicated nuclear DNA amount, as defined in cell-cycle DNA content. A double-stranded DNA molecule counts as one, despite containing two strands.

The allocation can be checked copy by copy. DNA replication turns $A$ into $A_1,A_2$, $a$ into $a_1,a_2$, and similarly for $B,b$. One daughter receives $A_1,a_1,B_1,b_1$ and the other $A_2,a_2,B_2,b_2$. Each therefore inherits the same four chromosome identities and the same gene and allele content as the unreplicated parent, under the stated assumptions. Across both daughters there are $4+4=8$ DNA molecules and $2C+2C=4C$: partition conserves the material present after S phase.

The transient whole-cell count of eight does not mean that each daughter's ploidy has doubled. Each completed daughter is diploid, containing both homologues of each homologous chromosome pair. This differs from separating homologous chromosomes during meiosis I. Faithful mitosis preserves a nuclear genome through growth and renewal; equal inherited genes need not imply equal gene expression or equal cell fate. Mutations or chromosome segregation errors can break the ideal inheritance pattern.

In open mitosis, telophase includes reassembly of nuclear envelopes around the separated chromosome groups and relaxation of their condensation.^[ref]

In metaphase, replicated chromosomes align near the spindle apparatus equator, with their two sister chromatids connected through kinetochores toward opposite poles.

In open mitosis, nuclear envelope breakdown permits spindle apparatus microtubules to reach kinetochores at centromere regions.

In prophase, replicated chromosomes condense and the spindle apparatus begins to organize.

Condensation helps organize replicated chromosomes for later separation, while spindle microtubules begin to establish the division apparatus. Prophase precedes the stage at which all chromosomes are aligned; condensation alone is therefore not evidence of correct spindle attachment. ^[ref]

Consider the diagonal matrix $D=2I_2$ and a Jordan blockBoth have characteristic polynomial $(t-2{)}^2$, trace $4$, determinant $4$, and eigenvalue $2$ with algebraic multiplicity two. But $\ker (D-2I)$ is the whole plane, whereas $(J-2I)(a,b{)}^T=(b,0{)}^T$ vanishes only when $b=0$. Their eigenspaces have different dimensions, so eigenvectors under similarity rules out matrix similarity. There is an even shorter proof: $S^{-1}(2I)S=2I$ for every invertible matrix $S$.

The missing information is how the linear operator acts beyond its eigenvectors. Here $D-2I=0$, while $J-2I\ne 0$ but $(J-2I{)}^2=0$. Their minimal polynomials are respectively $t-2$ and $(t-2{)}^2$. Over a field where the characteristic polynomial splits, the full sizes of the Jordan blocks, encoded by the Jordan normal form, determine the matrix similarity class.

Under $B=S^{-1}AS$, an eigenvector in old coordinates becomes $S^{-1}v$ in new coordinates. Indeed,Since $S^{-1}$ is an invertible matrix, the new coordinate vector is nonzero. The inverse conversion $S$ proves that the two eigenspaces have the same dimension, hence the same geometric multiplicity.

For $A=\mathrm{diag}(2,5)$, the eigenvector $e_2=(0,1{)}^T$ has eigenvalue $5$. In the oblique basis of the opening example, its coordinate vector isThe tuple changes from $(0,1)$ to $(-1,1)$, but reconstruction gives $-b_1+b_2=e_2$: the physical vertical direction is unchanged. Calling the eigenvectors unchanged is accurate only for the underlying vectors, not for their coordinate vectors.

Matrix similarity invariants are quantities unchanged by replacing $A$ with $S^{-1}AS$. Important examples are the characteristic polynomial, trace, determinant, matrix rank, and eigenvalues with their algebraic multiplicities. The characteristic polynomial convention here is ${\chi }_A(t)=\det (tI-A)$, where $I$ is the identity matrix.^[ref]

The short determinant proof works over any field: because $tI-B=S^{-1}(tI-A)S$, multiplicativity of the determinant givesThus its roots, the eigenvalues, retain their algebraic multiplicities in any field extension where the polynomial splits. Also $\det B=\det A$. The cyclic property of the trace gives $\mathrm{tr}(S^{-1}AS)=\mathrm{tr}(AS{S}^{-1})=\mathrm{tr}A$; equivalently, the trace is determined by the coefficient of $t^{n-1}$ in the characteristic polynomial for an $n$-by-$n$ matrix.^[ref]

For the two matrices in the opening example,Their entries differ, yet these quantities agree. Agreement is a useful necessary test for matrix similarity; it is not sufficient in general, as same eigenvalues do not imply similarity illustrates.

The relation also preserves repeated application. Adjacent factors $S{S}^{-1}$ cancel to giveFor the opening example, matrix powers therefore have the explicit formAt $k=2$, this is $\left(\begin{array}{cc}4& -21\\ 0& 25\end{array}\right)$. Acting on $y=(1,1{)}^T$ gives $(-17,25{)}^T$, which reconstructs as $S(-17,25{)}^T=(8,25{)}^T=A^{2}x$. More generally $q(B)=S^{-1}q(A)S$ for every polynomial $q$, so the minimal polynomial is also unchanged. Multiplication by invertible matrices preserves matrix rank, giving another invariant without finding eigenvalues.

Assign each edge $e$ a real benefit $w_e$. A maximum-weight matching maximizes ${\sum }_{e\in M}{w}_e$ over all matchings in a graph $M$; the empty matching in a graph is allowed. Setting every $w_e=1$ recovers a maximum cardinality matching, but otherwise the objectives can disagree.

On the same path graph $P_4$, give the middle edge benefit $3$ and each outer edge benefit $1$. The matching in a graph $\{(2,3)\}$ has total benefit $3$, while the two-edge matching in a graph $\{(1,2),(3,4)\}$ has total benefit $2$. Thus the smaller choice is the unique maximum-weight matching. If instead the requirement is to find a maximum cardinality matching and then maximize benefit among those, the outer edges must be chosen. Requiring a perfect matching before optimizing cost is another distinct problem, covered by minimum-weight perfect matching. With negative benefits a maximum-weight matching can even be empty, so it need not be a maximal matching.

A maximum cardinality matching is a matching in a graph with as many edges as any matching in a graph of the same graph. It has cardinality $\nu (G)$, the matching number, and need not be unique or be a perfect matching. For example, any single edge of a triangle in a graph is a maximum cardinality matching, but leaves one vertex unmatched. Berge's theorem characterizes these optima by the absence of an augmenting path in a matching.

An alternating path in a matching $M$ is a graph path whose successive edges alternate between membership in $M$ and membership outside $M$. Here graph paths have no repeated vertices. Alternation alone does not make a graph path an augmenting path in a matching: its endpoints must both be unmatched vertices in a matching. For example, relative to $M=\{(2,3),(4,5)\}$ in the six-vertex path graph, $2,3,4,5$ alternates but has matched endpoints; toggling just those three edges loses one selected edge.

A matching in a graph saturates a specified vertex set $X$ when every vertex of $X$ is incident to one selected edge. Exactly one selected edge meets each such vertex, since matching edges have disjoint endpoints. Vertices outside $X$ may remain unmatched. A perfect matching saturates the entire vertex set; Hall's marriage theorem tests matching saturation of a specified side in a finite bipartite graph.

A vertex is an unmatched vertex in a matching $M$ if no edge of $M$ is incident to it. It is also called free or exposed, always relative to the specified matching in a graph: changing $M$ can change which vertices are free. The endpoints of an augmenting path in a matching must be distinct unmatched vertices in a matching before the change.

Mei-Sywe Hwang is identified as a statistician at the Center for Measurement Standards in Hsinchu, Taiwan, in a 1993 conference paper reprinted by NIST in 1994. The coauthored report examines electronic balances for gravimetric measurements, including solid and liquid density, pycnometer calibration and mass. Its examples connect a physical instrument's readings with corrections and uncertainty in an inferred quantity.^[ref]

The byline establishes her participation and historical affiliation; it does not identify an individual contribution to each experiment or establish later positions. The technical setting illustrates why measurement error and calibration are substantive parts of applied statistical work.

Shalabh works on statistical models whose assumptions reflect complications in observed data. His IIT Kanpur research page lists linear regression, econometrics, measurement-error models, missing-data models, panel-data models, restricted regression, spatial models and sampling theory.^[ref]

These subjects meet in a practical distinction: an observed variable need not equal the scientific quantity intended by the model. An errors-in-variables model describes noisy predictors, a missing-data model describes unobserved measurements, and a panel-data model represents repeated observations from the same units. Explicitly modelling those features separates uncertainty about the measurement process from uncertainty about regression parameters.

Identity and homepage: Shalabh's institutional homepage.