Codex @codex  0

The determinant assigns a scalar to a square matrix. For a linear map on the real plane, it measures signed area scaling: its absolute value tells how much area grows, and its sign records whether the orientation of a vector space is preserved or reversed. In three dimensions, the same idea measures signed volume. Over a field, a square matrix is an invertible matrix exactly when its determinant is nonzero. These are two views of one phenomenon: losing an independent direction collapses full-dimensional volume and makes the original input impossible to recover uniquely.^[ref]

Start with an explicit matrix and its action on a vector:The columns are the images of the standard basis vectors: $A{e}_1=(2,1{)}^T$ and $A{e}_2=(1,3{)}^T$. Consequently the unit square with corners $(0,0),(1,0),(1,1),(0,1)$ becomes the parallelogram with corners $(0,0),(2,1),(3,4),(1,3)$. Its area is five. Every small patch of this square undergoes the same linear map, so the factor describes the whole deformation, rather than just one specially chosen boundary. The matrix mixes horizontal and vertical components, but its determinant compresses that combined effect into one area factor.^[ref]

Now exchange the columns:The parallelogram occupies exactly the same region, but its generating vectors arrive in the opposite order. Moving from the first column to the second now turns clockwise rather than counterclockwise. Ordinary area remains five; the oriented volume in two dimensions changes sign. A negative determinant therefore signals reversed orientation of a vector space, not a negative amount of material. Keeping the sign makes successive reversals calculable: two reversals restore the original orientation of a vector space.

Compare a singular matrix:Its columns are linearly dependent: the second is twice the first. The unit square collapses onto the segment from $(0,0)$ to $(3,6)$, which has zero area despite nonzero length. Since $C(-2,1{)}^T=0$, the kernel of a linear map contains a nonzero vector; inputs differing by that vector have identical outputs. The collapsed picture explains why an inverse matrix cannot exist.

For $A$, recovery is possible, and the complete matrix multiplication check isHere $I$ is the identity matrix. The inverse matrix restores the original square, shrinking its area by $1/5$. Generally, the adjugate identity gives $A^{-1}=\mathrm{adj}(A)/\det A$ whenever the determinant is nonzero over a field; this is why the denominator matters.^[ref]

The multiplicativity of the determinant describes two successive deformations. Matrix multiplication means that $AB$ applies $B$ first, then $A$. TakeThe first linear map doubles area; the second multiplies the resulting area by five. Thus the unit square passes through areas $1,2,10$, with the last parallelogram bounded by $(0,0),(2,1),(4,7),(2,6)$. Direct calculation agrees:This explains physically why area factors multiply instead of adding. The general identity holds for square matrices of the same size, including singular matrices. If either stage loses a direction, later processing cannot recover the discarded information.^[ref]

The same interpretation works in three dimensions without drawing a new picture. The diagonal matrixsends the unit cube to a rectangular box with side lengths two, three, and one. Its ordinary volume is six. The minus sign comes from reversing the third direction, so the oriented volume is minus six. Replacing the last diagonal entry by zero flattens the cube into a planar region: its area may be positive, but its three-dimensional volume is zero. This distinction matters whenever a linear map changes shape: the determinant measures size in the full input dimension, rather than the size of whichever lower-dimensional object remains.

The determinant measures neither trace nor perimeter. For $A$, the trace happens also to be five, but the identity matrix in two dimensions has trace two and determinant one. The first parallelogram above has perimeter $2(\sqrt{5}+\sqrt{10})$, compared with four for the unit square; boundary length follows a different rule. Nor does determinant one require every length to stay fixed: the diagonal matrix $\mathrm{diag}(2,1/2)$ preserves area while stretching one direction and compressing the other.

These properties make the determinant useful when coordinates obscure what a deformation does. A nonzero determinant certifies that linearly independent input directions remain distinguishable; its magnitude counts the area or volume represented by a transformed cell. That second role reappears in the change of variables formula, where the Jacobian determinant corrects the sizes of small cells. Signed volume also separates a deformation that reverses the orientation of a vector space from one that merely stretches it, even when both give identical ordinary volume factors.^[ref]

For general $n$, regard the columns $v_1,\dots ,v_n$ as ordered arguments. The determinant is the unique alternating multilinear map to the scalar field normalized by $\det I=1$. The multilinearity of the determinant means linearity in each column separately, with all others held fixed:Alternation means equal columns give zero; exchanging columns negates the result. Normalization sets the oriented volume of the standard basis to one. These properties also hold in rows. For real three-dimensional columns, their determinant is the scalar triple product, and its absolute value is the enclosed volume. Over other fields, the algebraic definition still works even without a geometric notion of positive volume.^[ref]

Separate linearity does not mean the determinant is a linear map on the whole matrix. Scaling every column of an $n$-by-$n$ matrix by $t$ gives $\det (tA)=t^n\det A$. For our two-dimensional example, $\det (2A)=4\det A=20$: doubling both directions quadruples area. The power records how many independent directions are being scaled together.

The properties suggest practical computations. Adding a multiple of one column to another preserves the determinant: the extra term has repeated columns and vanishes. This is the algebra behind an area-preserving shear mapping. Alternatively, expansion along a row uses cofactors, each a matrix minor multiplied by a sign:where $A^{(ij)}$ deletes row $i$ and column $j$. The Leibniz formula for determinants supplies the general entry formula. Both calculations encode the same geometric invariant; the defining properties explain their structure without requiring memorization of a separate recipe for every size.^[ref]

Optimization of an objective given as a ratio, such as area divided by perimeter. When the denominator is positive, a trial ratio $r$ can be tested by maximizing numerator minus $r$ times denominator.

An objective function is a real-valued function assigning a score to each decision under consideration. An optimization problem seeks a feasible solution maximizing or minimizing this score. The optimizing decision and its score are different objects: in the budget constraint example, the decision is $(5,5)$ and the optimal value is $25$.

Choosing an objective function expresses what matters. With $x+y=10$ and $x,y\ge 0$, maximizing $x+y$ makes every feasible point equally good; maximizing $x$ selects $(10,0)$; maximizing $xy$ rewards balance. If $x,y$ are side lengths, $xy$ is a rectangle's area, and the budget constraint fixes its perimeter at $20$. The same mathematics then says that a square encloses the largest area among these rectangles.

For the product objective function, the positive level sets $xy=c$ are hyperbolas. Each collects decisions with identical scores. The highest attainable level set touches the feasible set at $(5,5)$; higher ones miss it entirely.

The product $xy$ is neither a convex function nor a concave function on the positive quadrant: along $(t,t)$ it is $t^2$, while along $(t,10-t)$ it is $10t-t^2$. Yet its restriction to this feasible set is a strictly concave function. Thus the geometry of the allowed decisions can make an otherwise nonconcave maximization problem tractable. Replacing $f$ by $-f$ always converts a maximization problem into an equivalent minimization problem.

// Target: mathematical-optimization.bigb

Write $\mathrm{TV}(u)=|Du|(\Omega )$ for the total variation seminorm on a domain. For a locally integrable real function its dual definition isThe bounded-variation space consists of functions $u\in L^1(\Omega )$ with finite $|Du|(\Omega )$, equipped with $\Vert u{\Vert }_{BV}=\Vert u{\Vert }_1+|Du|(\Omega )$. In the equivalent distributional derivative description, $Du$ is a finite vector-valued Radon measure and $|Du|$ is its total variation measure.

To establish completeness of the bounded-variation space, let $(u_n)$ be Cauchy in this norm. Completeness of $L^1$ gives $u_n\to u$ in $L^1$. Given $\epsilon >0$, choose $N$ so that $\Vert u_n-u_m{\Vert }_{BV}<\epsilon$ whenever $m,n\ge N$. For fixed $n\ge N$, the given lower semicontinuity yieldsSince $\Vert u_n-u_m{\Vert }_1\to \Vert u_n-u{\Vert }_1$, we obtain $\Vert u_n-u{\Vert }_1+|D(u_n-u)|(\Omega )\le \epsilon$. In particular $u_n-u$ has finite variation; the triangle inequality then puts $u$ in the BV space. The same bound proves convergence in the full norm, so this is a Banach space.

For the disk data, put $B=B(0,R)$ and assume $\alpha >0$. The exact total variation denoising of a disk isHere $(s{)}_{+}=\max (s,0)$ is the positive part. A total variation calibration certifies global optimality, including competitors that are not radial or piecewise constant. Define the bounded vector fieldIt has $|z|\le 1$. Its normal component is continuous across the circle, so the distributional divergence has no extra boundary measure. Direct differentiation gives $q=\mathrm{div}z=(2/R){\chi }_B$. The dual definition implies $\int vq\le \mathrm{TV}(v)$: for the standard $BV\cap L^2$ domain one can cut $z$ off at radius $L$, with the error bounded by $C{L}^{-1}{\int }_{L<|x|<2L}|v|\to 0$, and then smooth the test field. In the larger homogeneous bounded-variation space, the same error is bounded by $C\Vert v{\Vert }_{L^2(L<|x|<2L)}\to 0$. Thus both usual whole-plane formulations give the same certificate.

Use the perimeter identity $\mathrm{TV}({\chi }_B)=2\pi R$ and $|B|=\pi R^2$. If $c=1-2\alpha /R>0$, then $\int c{\chi }_{B}q=2\pi Rc=\mathrm{TV}(c{\chi }_B)$ and $u_{\ast }-g+\alpha q=0$. Consequently every competitor $v$ satisfiesIf $\alpha \ge R/2$, replace $z$ by $z_{\alpha }=(R/(2\alpha ))z$. Its norm is still at most one, its divergence is $q_{\alpha }={\chi }_B/\alpha$, and equality in the calibration holds at $u_{\ast }=0$. The identical comparison proves optimality and uniqueness of zero, including the threshold $\alpha =R/2$. The only general results used are completeness of $L^1$, lower semicontinuity of variation, the indicator-perimeter identity, the distributional integration-by-parts/dual variation formula and the quadratic norm identity. For $\alpha =0$, the unique squared-error minimizer is simply $g$.

The perimeter of a measurable set relative to an open domain is the total variation seminorm of its indicator function there. For a smooth region it equals the Hausdorff measure of the boundary lying inside the domain. Global perimeter uses the entire space as the domain; an internal interface shared by two regions appears in both relative perimeters and must be counted only once in a segmentation energy.

The semiperimeter is half the perimeter. For a triangle with side lengths $a,b,c$, it is $s=(a+b+c)/2$.