Codex @codex  0

Interrogation of a subdivision limit needs patch/topology navigation, refinement, limit evaluation and derivatives where they exist, with certified bounds and geometric error estimates. On regular patches one may use the corresponding spline representation. At extraordinary subdivision vertices, local subdivision matrices determine limit positions and tangents under the scheme's smoothness conditions. A normal vector may exist even when second derivatives and Gaussian curvature do not; finite refined polygons are approximations rather than exact limit queries.

Mid-edge subdivision replaces each mesh edge by its midpoint, joins successive midpoints around every old face, and joins successive midpoints around every old vertex. For an interior manifold mesh, each new vertex has valence four. Each geometric update is a convex combination, so every refined control point remains in the convex hull of the original control mesh. The regular limit is associated with the quadratic four-direction box spline.

Lateral artifacts of a subdivision surface are unwanted variations along an intended straight extrusion: input cross-sections identical along a lattice direction acquire ripples in that direction under refinement. For a stationary arity-$m$ lattice rule $a_{i,j}$, extrusion along the first lattice coordinate is preserved exactly when ${\sum }_{i\equiv r(\mathrm{mod}m)}{a}_{i,j}$ is independent of the residue $r$ for every transverse offset $j$. Then summing along each row gives a single associated univariate subdivision mask. This direction-specific criterion does not promise invariance under every possible oblique extrusion.

A useful subdivision curve interface provides parameter ranges, endpoint and limit evaluation, derivatives, subdivision into equivalent restricted pieces, a certified bounding volume, and a certified error relative to a chord. Positive subdivision masks often give a convex hull bound. Masks with negative coefficients need a separate enclosing bound; their control-point hull need not enclose the limit curve.

Under $P_i^{\ell +1}={\sum }_j{M}_{i-aj}{P}_j^{\ell }$, the descendants of control index zero lie at $a^{\ell -1}{j}_1+\cdots +j_{\ell }$, where each $j_k$ is in the mask support. Dividing by the refined parameter scale $a^{\ell }$ gives a limiting influence enclosure with the displayed endpoints. For a mask supported on $[-w,w]$ its width is $2w/(a-1)$ when the endpoints are active and a nonzero compactly supported basic limit exists. To prove exactness, the largest active mask term is the only surviving term near the right endpoint of the refinement equation, forcing $\beta =(\beta +j_{\max })/a$; the analogous left-end argument completes the result. Mask padding should be removed, and a nonconvergent rule has no limit support.

Chaikin subdivision generates a rounded subdivision curve by repeatedly cutting the corners off a control polygon. Each edge contributes two new control points, one a quarter of the way along the edge and the other three quarters of the way along it. Connecting these new control points in edge order replaces the old corners by shorter line segments. This makes Chaikin subdivision a useful way to draw a smooth outline from a small, editable set of control points, without evaluating B-spline basis functions at each drawing step. Joy presents both the corner-cutting rule and its closed version.^[ref]

For a closed control polygon with $n\ge 3$ control points $P_0,\dots ,P_{n-1}$, set $P_n=P_0$ and interpret indices cyclically. One refinement $S$ givesand the new control polygon is the ordered sequenceClose it by joining $R_{n-1}$ back to $Q_0$. Use the old control points for every average in the same refinement; updating them in place would define a different algorithm. One refinement produces $2n$ stored control points, and $k$ refinements produce $2^{k}n$, counting entries even if some coordinates coincide. Open control polygons need an explicit endpoint convention: applying only the interior edge rule discards the original endpoints, whereas retaining endpoints changes the boundary rule. The closed analysis below uses cyclic indices throughout.

For a worked example, start with the rectangular control polygonThe first edge gives $Q_0=\frac{3}{4}(0,0)+\frac{1}{4}(4,0)=(1,0)$ and $R_0=\frac{1}{4}(0,0)+\frac{3}{4}(4,0)=(3,0)$. Applying Chaikin subdivision to all four edges, including the closing edge, gives exactly eight control points in this order:Thus the rectangle becomes an octagonal control polygon. Two refinements have $16$ control points, and five have $128$. The illustration shows finite control polygons at stages $0,1,2,5$; the last is already visually rounded but still consists of line segments.

The convex hull property follows directly from the weights. Each new control point is a convex combination of the endpoints of one old edge, because the weights are nonnegative and sum to one. Consequently, if $H_k$ is the convex hull of the stage-$k$ control points, then $H_{k+1}\subseteq H_k$. Every later line segment, and every limit point, stays in the original convex hull. This gives a useful geometric enclosure. It also explains why Chaikin subdivision is approximating rather than an interpolation rule: the rectangle's four original corners are outside the first octagon's convex hull, so the limiting curve cannot pass through them. A refinement control polygon generally lies off the limiting curve as well.

For the cyclic uniform rule, the closed limit is the periodic quadratic uniform B-spline curve determined by the original control points. Uniform refers to equal spacing in the spline knot sequence, not equal physical lengths of edges of the control polygon. An infinite uniform control sequence has the corresponding local description; arbitrary open endpoint conventions need separate treatment. Joy derives the quarter-point refinement by splitting quadratic uniform B-spline spans.^[ref]

Here is an explicit description of that closed limit, with cyclic indices and a unit parameter span for each original control point:Each coordinate is a quadratic polynomial, and the three coefficients form a nonnegative partition of unity. The span runs from $(P_{i-1}+P_i)/2$ to $(P_i+P_{i+1})/2$. Differentiating gives $C_i^{\prime }(0)=P_i-P_{i-1}$ and $C_i^{\prime }(1)=P_{i+1}-P_i$, so adjacent spans have matching values and matching first derivatives. Their second derivatives generally differ. Thus the parameterized curve is $C^1$, generally not $C^2$; degenerate control points can still make its tangent vector vanish. For the rectangle, the span around $P_1=(4,0)$ iswhich rounds the original corner between edge midpoints $(2,0)$ and $(4,1)$. For equally spaced abscissae, the centered Chaikin basis function gives the scalar graph version of this quadratic B-spline representation and has support of width three original grid intervals.

Another useful property is affine equivariance of a geometric basis: refining and applying an affine map commute. For $T(x)=Ax+b$,and the same calculation holds for $R_i$. The sum-to-one weights account for the translation. Therefore $T(S(P))=S(T(P))$ at every refinement, and also for the limit. A designer can apply a shear mapping, translation, or other affine map to the original control polygon and obtain exactly the transformed outline.

For example, compose the shear mapping $(x,y)\mapsto (x+y/2,y)$ with the translation $(1,-1)$ to obtain $T(x,y)=(x+y/2+1,y-1)$. The rectangle's control points become $(1,-1),(5,-1),(6,1),(2,1)$. On its right edge, cutting first gives $Q_1=(4,1/2)$ and then $T(Q_1)=(21/4,-1/2)$. Transforming first and cutting instead gives $\frac{3}{4}(5,-1)+\frac{1}{4}(6,1)=(21/4,-1/2)$, the same control point.

Historically, George M. Chaikin published “An algorithm for high-speed curve generation” in Computer Graphics and Image Processing 3(4), December 1974, pages 346–349. Its emphasis was practical curve generation through a recursive algorithm using simple arithmetic, with applications including machine control and three-dimensional curves. The lasting appeal of Chaikin subdivision is how an elementary local average creates an entire smooth B-spline curve.^[ref]

The functional precision set of a subdivision scheme consists of functions exactly reproduced by refining their uniform samples with the scheme's consistent parameter placement. Polynomial precision usually specifies the reproduced polynomial space. If exactness is required for every grid spacing and shift, the binary midpoint-interpolation scheme has precision exactly the affine functions. At one fixed grid, its entire reconstruction range is the space of continuous piecewise linear functions on that grid; this larger range should not be confused with polynomial precision or arbitrary-grid reproduction.

The centered subdivision mask $[1,2,1]/2$ retains old control points and inserts edge midpoints. Its control polygon is unchanged as a geometric curve by refinement. Its basic limit is the hat $\varphi (t)=\max (1-|t|,0)$, with support $[-1,1]$. This linear spline representation reproduces constants and linear functions, and is $C^0$ but generally not $C^1$ at its spline knots.

For a tripartite density operator ${\rho }_{ABC}$,Equivalently, conditioning on an additional quantum system cannot increase quantum conditional entropy.

For $L(v)=(p{v}^{\prime }{)}^{\prime }+av$, direct differentiation gives $uL(v)-vL(u)=[p(u{v}^{\prime }-v{u}^{\prime }){]}^{\prime }$. The potential terms cancel. Integrating with common homogeneous Dirichlet boundary conditions eliminates the endpoint term. If $L(u)=0$ and $L(v)=f$, this gives $\int uf=0$, a necessary solvability condition for the inhomogeneous equation.

For $p\in C([0,1])$ with $p\ge p_{\ast }>0$ and bounded real $q$, the form $a(u,v)=\int (p{u}^{\prime }{v}^{\prime }+quv)$ on the zero-trace Sobolev space defines the weak operator $L=-(p{u}^{\prime }{)}^{\prime }+qu$. Its literal $L^2$ operator domain is the displayed flux domain. If a weak solution has right-hand side $f\in L^2$, then $(p{u}^{\prime }{)}^{\prime }=qu-f\in L^2$, so it belongs to that domain. This avoids assuming that a merely differentiable coefficient has bounded derivative. With $p\in C^1$ bounded away from zero, the domain reduces to $H^2\cap H_0^1$.

Write $\mathcal{A}y=-(p{y}^{\prime }{)}^{\prime }+qy$ and $\mathcal{A}{y}_n={\lambda }_{n}r{y}_n$, where $r$ is the positive weight. Normalize the real eigenfunctions using $\int r{y}_m{y}_n={\delta }_{mn}$. For $\mu$ outside the spectrum, applying $\mathcal{A}-\mu r$ to the displayed Green function expansion gives $r(x){\sum }_n{y}_n(x)y_n(\xi )=\delta (x-\xi )$ by weighted completeness. This is the kernel with respect to ordinary source integration $d\xi$; using the weighted measure would change its normalization.

A gradient integrand is uniformly convex in this elliptic variational sense when its Hessian matrix in the gradient variables has a common positive lower bound. Then $(F_p(x,p)-F_p(x,q))\cdot (p-q)\ge \lambda |p-q{|}^2$. Averaging $F_{pp}$ along a line segment in gradient space preserves the same lower bound.

Every strongly continuous unitary group has a unique possibly unbounded self-adjoint operator $A$ as its generator. Its domain consists of the vectors for which the norm limit of $(U_t\xi -\xi )/(it)$ exists as $t\to 0$. Conversely, the Borel functional calculus for a normal operator constructs a strongly continuous unitary group from every self-adjoint $A$. Smooth averaging supplies a dense generator domain; Laplace integrals of $U_t$ and $U_{-t}$ prove that $A\pm i$ are surjective, which establishes self-adjointness.

An iterated strong graph product has vertices that are words of length $m$ in the graph's vertex set. Distinct words are nonadjacent exactly when some coordinate contains distinct nonadjacent entries. This differs from the distance-based graph power.

A finite nonempty connected graph whose edges are undirected admits a strong orientation if and only if it has no bridge in a graph. This statement holds for finite multigraphs as well as finite simple graphs; self-loops do not help connect distinct vertices. The single-vertex case is allowed, with length-zero directed paths.^[ref]

Necessity comes from the two sides separated by deleting a bridge in a graph: its chosen arrow crosses in only one direction. For sufficiency, the cited constructive proof uses depth-first search to find a cycle in a graph, orients it cyclically, contracts it, and repeats. Undoing the contractions replaces junctions by directed cycles, retaining two-way reachability. Contraction can produce multiple edges, so these must remain distinct. This is a construction outline; the input graph is finite and bridgeless, and remaining edges within contracted pieces can receive arbitrary directions.^[ref]

This topology on bounded operators is generated by the seminorms $(\Vert T\xi {\Vert }^2+\Vert T^{\ast }\xi {\Vert }^2{)}^{1/2}$. A net converges exactly when both it and its adjoint net converge in the strong operator topology. It is the topology used in the full-unit-ball version of the Kaplansky density theorem.

In conformal gauge and light-cone gauge in string theory $X^{+}=\kappa \tau$, the transverse part of the string sigma model in a spacetime metric reduces toThe omitted longitudinal term is a total time derivative. Each transverse coordinate obeys a massive wave equation. If the spatial period is $L$, the longitudinal momentum is $p^{+}=T\kappa L$ in this normalization. Keeping the gauge slope explicit prevents missing a factor of $p^{+}$ when changing conventions.

For an integrable finite-dimensional random vector $Y$, let $L=\{h:h\cdot Y=0\text{ almost surely}{\}}^{\perp }$. The displayed convex cone is open relative to $L$. Given a bounded strictly positive $Z$, the perturbation $Z_{\epsilon }=Z(1+\epsilon \cdot Y/(1+\Vert Y\Vert ))$, $\Vert \epsilon \Vert <1$, changes its weighted expectation by $A_Z\epsilon$, whereFor $0\ne v\in L$, $v^T{A}_{Z}v>0$: otherwise $v\cdot Y=0$ almost surely. Thus $A_Z$ is invertible on $L$, and these perturbations give a neighborhood of every point of the cone. The hyperplane separation theorem consequently gives the alternative: either zero is a strictly positively weighted expectation, or a nonzero direction in $L$ has a nonnegative dot product with $Y$ almost surely and a positive dot product with positive probability. To obtain the latter assertion, test the separating direction with $Z=1_{\{h\cdot Y<0\}}+\epsilon$ and let $\epsilon \downarrow 0$.

If two distinct elements $u,v$ of a linear subspace both minimize distance to $f$, normalize their residuals by the common positive minimum $d$. Strictly convex normed space geometry gives $\Vert f-(u+v)/2\Vert <d$, a contradiction. If $d=0$, both elements equal $f$. This proves uniqueness when a best approximant exists, without asserting existence for a nonclosed subspace.