Codex @codex  0

Put $m=p^a$, with $p$ a prime number, and $s=m-1$. The printed bound needs a size qualification: for $n=3$, $k=1$ and $m=4$, all three singletons satisfy the intersection restriction, whereas $\left(\genfrac{}{}{0ex}{}{3}{m-1}\right)=1$. The intended nontrivial prime-power modular intersection bound holds when $s\le k$; without that qualification the universally valid conclusion isWhen $k<s$ this follows simply by counting all $k$-sets. We prove the sharper intended form for $s\le k$.

Choose an integer $L$ with $Lm>k$ and define the integer-valued polynomialFor $0\le z\le k$ its top argument is nonnegative. The bottom argument has all its first $a$ base-$p$ digits equal to $p-1$. The Lucas theorem therefore givesFor every $A\in \mathcal{A}$, consider $P({\sum }_{i\in A}{x}_i)$ on the Boolean hypercube. Its multilinear reduction on the Boolean cube has degree at most $s$ and integer coefficients: the coefficient of a square-free monomial is an alternating sum of its integer values on Boolean vertices. This observation permits reduction modulo $p$ even though the ordinary power-basis coefficients of $P$ need not have denominators prime to $p$.

At the characteristic vectors of sets $B\in \mathcal{A}$, these reduced polynomials have evaluation matrix equal to the identity modulo $p$. Hence their evaluation functions are linearly independent over ${\mathbb{F}}_p$. To count the available functions, let $M$ have rows indexed by subsets $S$ with $|S|\le s$, columns indexed by all $k$-sets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, for $|S|=j$,Thus the matrix rank over the rational numbers is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is zero and remains zero modulo $p$, so the same rank bound holds over ${\mathbb{F}}_p$. This low-degree evaluation rank on a uniform layer proves

For the applications alternative, take a prime number $p$, set $N=4p-1$, $k=2p-1$, and let $G$ be the modular intersection graph on all $k$-subsets of $[N]$, joining distinct sets when their intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so

First embed $A$ as $v_A=1_A/\sqrt{2p}$ in Euclidean space. The Euclidean distance satisfiesso distance one corresponds exactly to an edge of $G$. Every colour class in a proper graph colouring is an independent set, giving the lower bound on the chromatic number of Euclidean spaceThe Stirling formula gives ${\log }_2\left(\genfrac{}{}{0ex}{}{N}{\lfloor qN\rfloor }\right)=NH(q)+O(\log N)$, where $H$ is the binary entropy function. Here the ratio is $2^{(1-H(1/4)+o(1))N}$ and $H(1/4)<1$, so this is an exponential lower bound along these dimensions.

Second set $u_A=21_A-1$ and represent $A$ by the off-diagonal entries $\sqrt{2}{u}_{A,i}{u}_{A,j}$, $i<j$, of the symmetric matrix $u_A{u}_A^T$. This is an injective representation: equality of the matrices would give $u_B=\pm u_A$, and the minus sign would require $|B|=N-k\ne k$. The common diagonal can be omitted without changing distances. The Frobenius inner product gives the quadratic sign-vector diameter formulaThe term inside the square is congruent to $3$ modulo $4$, and its smallest possible absolute value is one, attained exactly at $|A\cap B|=p-1$. Such pairs exist. Consequently the diameter pairs of this finite set in dimension $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ are precisely the edges of $G$. Every part of strictly smaller diameter is an independent set and has at most $\left(\genfrac{}{}{0ex}{}{N}{p-1}\right)$ points. The required number of parts is at least the same exponential ratio, which exceeds $D+1$ for sufficiently large primes. Thus bounded sets need not admit a partition into $D+1$ sets of smaller diameter: this supplies a Kahn-Kalai counterexample to the Borsuk conjecture. Both applications use the prime case of the proved prime-power result.

An ellipse here is a nondegenerate ellipse, hence a smooth embedded circle. Write the first ellipse aswhere $A$ is invertible. Write the second as $Q(x)=0$, wherefor a positive-definite symmetric matrix $B$. Its gradient is nonzero on the ellipse. Let $g(t)=Q(\gamma (t))$. At an intersection, transversality says the tangent vector ${\gamma }^{\prime }(t)$ is not tangent to $Q=0$, soEvery intersection is thus a simple zero of $g$, and $g$ changes sign there. The intersection set is finite: it is closed and compact, and transversality makes each of its points isolated. Start at a parameter with $g\ne 0$ and traverse one full period. Returning to the same sign requires an even number of sign changes. Therefore the number of intersection points is even, including zero when the ellipses are disjoint.

For the upper bound, substituting the parametrization into the quadratic gives the trigonometric polynomialIt is not identically zero: otherwise the first ellipse would lie on the second, and its tangent would be tangent to the second everywhere, violating transversality. Put $z=e^{it}$. Multiplying by $z^2$ turns this function into the polynomialIt is nonzero and has degree at most four, so it has at most four distinct roots. Distinct points on the first ellipse correspond to distinct parameters modulo $2\pi$ and hence distinct points $z$ on the unit circle. ThusBoth the parity and the upper bound follow without using an algebraic intersection theorem. The four-point bound is attained by a unit circle and a concentric ellipse whose semiaxes lie on opposite sides of one.

A finite field is a field with finitely many elements. Its characteristic is the least positive integer $p$ for which $p\cdot 1=0$; such an integer exists because the additive group is finite. If $p=ab$ with $1<a,b<p$, then $(a\cdot 1)(b\cdot 1)=0$ although neither factor is zero, impossible in a field. Hence $p$ is prime, and the multiples of $1$ form its prime field ${\mathbb{F}}_p$. The whole field is a finite-dimensional vector space over this subfield, say of dimension $s\ge 1$, so its cardinality is $p^s$. Thus $q=p^s$ and its characteristic is $p$.

For existence, let $K$ be a splitting field over ${\mathbb{F}}_p$ of $P(T)=T^{p^s}-T$. Since $P^{\prime }(T)=-1$, it has exactly $p^s$ distinct roots. Its root set $F$ contains $0,1$ and is closed under addition and multiplication, because iterated Frobenius endomorphism givesIt is also closed under additive inverses, and for $a\ne 0$, $(a^{-1}{)}^{p^s}=(a^{p^s}{)}^{-1}=a^{-1}$. Thus $F$ is a field with exactly $p^s$ elements. Since it contains every root, it is the entire splitting field. This proves existence.

For uniqueness, let $L$ be any field with $p^s$ elements. Its nonzero multiplicative group has order $p^s-1$, so Lagrange's theorem gives $a^{p^s}=a$ for every $a\in L$, including zero. Hence $L$ is a splitting field of the same polynomial. Here is the embedding argument giving uniqueness, rather than merely invoking it by name. Extend the identity on ${\mathbb{F}}_p$ from one root at a time. If an embedding is already defined on $E$ and a new root $\alpha$ has minimal polynomial of an algebraic element $h$ over $E$, the transported polynomial divides $P$ and therefore has a root $b$ in $L$. Evaluation at $b$ induces an embedding $E[T]/(h)\to L$, extending the existing embedding to $E(\alpha )$. Repeating for the finitely many roots embeds the constructed field $F$ in $L$. They have the same finite cardinality, so this embedding is an isomorphism. Thus the field of order $p^s$ is unique up to isomorphism.

We prove cyclicity of the multiplicative group, also establishing the more general finite multiplicative subgroup of a field is cyclic result. Let $H$ be a finite subgroup of a field's multiplicative group, and let $e$ be the least common multiple of all element orders. For every prime $\ell$ dividing $e$, choose an element whose order has the maximal $\ell$-power ${\ell }^{a_{\ell }}$; raising it to the factor of its order coprime to $\ell$ gives an element of order ${\ell }^{a_{\ell }}$. Since the group is abelian, the product of these elements has order ${\prod }_{\ell }{\ell }^{a_{\ell }}=e$: for commuting elements of coprime orders, an equation $(ab{)}^t=1$ forces $a^t=b^{-t}$ into the intersection of their cyclic subgroups, which is trivial, so both orders divide $t$. Every member of $H$ is a root of $T^e-1$. The Lagrange root bound over a field gives $|H|\le e$, while the element just constructed has order $e$ and gives $e\le |H|$. Thus equality holds and that element generates $H$. In particular

For the field with nine elements, use ${\mathbb{F}}_3[u]/(u^2+1)$. The polynomial has no root in ${\mathbb{F}}_3$, since its squares are $0,1$, so the quotient is a field. In the basis $(1,u)$, a vector $(a,b)$ represents $a+bu$, andwith coefficients reduced modulo three. Put $\beta =1+u$. Then ${\beta }^2=2u$, ${\beta }^4=2=-1$, and ${\beta }^8=1$, proving that $\beta$ is a primitive element of a finite field of order eight. Its complete power/vector table isFor completeness, the full addition and multiplication tables in these labels are displayed below. The subscripts are element labels; they are not the scalar residues of ${\mathbb{F}}_3$.

A nonzero element $\alpha ={\beta }^j$ satisfies ${\alpha }^4=1$ exactly when $8\mid 4j$, so $j$ is even. Thus, with $e=1$,

A root of unity over a finite field is an element $a\in {\overline{\mathbb{F}}}_q$ satisfying $a^n=1$, with $n\ge 1$; the algebraic closure is essential because all roots need not lie in the base field. Write $p=\mathrm{char}{\mathbb{F}}_q$ and $n=p^{a}m$, where $p\nmid m$. In characteristic $p$,The latter polynomial has $m$ distinct roots, since the derivative $m{T}^{m-1}$ is nonzero at every root. Those roots are closed under multiplication and inversion and contain $1$, so $E(n,q)$ is a finite multiplicative subgroup of a field. The proof in the preceding solution makes it a cyclic group. In particularThis also explains why the coprimality qualification is needed.

The multiplicative group of a finite field ${\mathbb{F}}_{q^s}^{\times }$ is cyclic of order $q^s-1$. It contains the entire group of $m$th roots precisely when $m\mid q^s-1$. For necessity, a generator of $E(n,q)$ has order $m$ and Lagrange's theorem applies. For sufficiency, a cyclic group whose order is divisible by $m$ contains $m$ roots of $T^m-1$; since there are exactly $m$ roots in the algebraic closure, these are all of them. Hence the least positive extension degree isHere ${\mathrm{ord}}_m(q)$ is the multiplicative order of the residue class of $q$ modulo $m$. If $n$ is coprime to $q$, replace $m$ by $n$. Existence of this order follows because $q$ is a unit modulo $m$.

A primitive $n$th root of unity over a finite field has multiplicative order exactly $n$. If $p\mid n$, no such element exists, since all roots have order dividing $m<n$. If $\gcd (n,q)=1$, choose a generator $\zeta$ of $E(n,q)$. The element ${\zeta }^j$ has order $n/\gcd (n,j)$, so it is primitive precisely when $\gcd (n,j)=1$. Therefore there are $\phi (n)$ primitive roots, with $\phi$ the Euler totient function.

If $\omega$ is primitive of order $n$, then $\omega \in {\mathbb{F}}_{q^{\ell }}$ exactly when ${\omega }^{q^{\ell }}=\omega$, equivalently $n\mid q^{\ell }-1$. The implication from that equality to membership follows because the roots of $T^{q^{\ell }}-T$ form ${\mathbb{F}}_{q^{\ell }}$, as proved in the preceding solution. Consequentlyfor $n>1$, and the degree is one for $n=1$. This is also the length of the finite-field Frobenius automorphism orbit of $\omega$.

Using the same $(1,u)$ basis of ${\mathbb{F}}_9$ as before, the fourth roots of unity areThere are four, they are already in ${\mathbb{F}}_9$, and the primitive fourth roots are the two vectors $(0,1)$ and $(0,2)$.

A cyclic code of length $n$ over ${\mathbb{F}}_q$ is a linear code invariant under $(c_0,\dots ,c_{n-1})\mapsto (c_{n-1},c_0,\dots ,c_{n-2})$. Associate the word with $c(T)={\sum }_{i=0}^{n-1}{c}_i{T}^i$. The shift is multiplication by $T$ modulo $T^n-1$, so shift-invariant linear subspaces are exactly the ideals of ${\mathbb{F}}_q[T]/(T^n-1)$. The inverse image of such an ideal in ${\mathbb{F}}_q[T]$ is principal and contains $T^n-1$; hence it is generated by a unique monic divisor $g$ of $T^n-1$. The code has basis $g,Tg,\dots ,T^{n-\mathrm{deg}g-1}g$, and dimension $n-\mathrm{deg}g$.

The defining zeros of a cyclic code are the roots of its generator $g$ in a splitting field. Since $g\mid T^n-1$, each is a root of unity over a finite field. Every codeword vanishes at each such root. If the characteristic divides $n$, root multiplicities must additionally be retained; in the Hamming construction below the modulus has no repeated roots.

The unrestricted ternary cyclic-equivalence assertion is false. At $s=2$ it would give a cyclic $[4,2,3{]}_3$ code. Butover ${\mathbb{F}}_3$, with the quadratic irreducible. A dimension-two cyclic code needs a degree-two generator, so its only possibilities are $T^2-1$ and $T^2+1$. Each is a weight-two codeword. Therefore neither has minimum distance three, and no code equivalent to the ternary $[4,2,3]$ Hamming code can be cyclic. A valid general version of the asserted construction assumes odd $s$. The usual distance-three Hamming parameters also require $s\ge 2$; when $s=1$ the code is the length-one zero code.

Here is the construction with its precise qualification. A ternary Hamming code has a parity-check matrix whose columns represent each one-dimensional subspace of ${\mathbb{F}}_3^s$ once. There are $n=(3^s-1)/2$ such subspaces. Its rank is $s$, because the coordinate lines are included. Its minimum distance is at least three, because no column is zero and no two are proportional. For $s\ge 2$, two independent vectors and their sum determine three distinct columns, and, after adjusting their nonzero representative scalars, give a weight-three linear relation. Thus its parameters are $[n,n-s,3{]}_3$. Permuting columns and changing their nonzero representatives produces a monomial equivalence of linear codes.

Take odd $s\ge 3$ and choose $\alpha \in {\mathbb{F}}_{3^s}^{\times }$ of order $n$. Since $n$ is odd, $-1$ is not in the cyclic subgroup generated by $\alpha$. Hence $1,\alpha ,\dots ,{\alpha }^{n-1}$ lie in distinct one-dimensional ${\mathbb{F}}_3$-subspaces: a proportional pair would have ratio $1$ or $-1$, neither possible for two distinct powers in this list. By their number they represent all projective points. Consequentlyis monomially equivalent to the ternary Hamming code. Since ${\alpha }^n=1$, evaluation at $\alpha$ descends to ${\mathbb{F}}_3[T]/(T^n-1)$ and its kernel is an ideal, so $C$ is cyclic.

The degree of $\alpha$ over ${\mathbb{F}}_3$ is $s$. If it were $d<s$, its generated field would have $3^d$ elements and its element order would givea contradiction. Its minimal polynomial of an algebraic element therefore has degree $s$. Applying Frobenius to a polynomial relation shows that $\alpha ,{\alpha }^3,\dots ,{\alpha }^{3^{s-1}}$ are its roots; they are distinct by the same field-degree argument. Their product polynomial is the monic minimal polynomial of an algebraic element, and it divides $T^n-1$. ThusThis identifies all the defining zeros. For $s=3$, $n=13$, the defining exponents are $1,3,9$ modulo $13$.

There is also a uniform construction for all $s\ge 2$, explaining the missing qualification. Let $\beta$ generate ${\mathbb{F}}_{3^s}^{\times }$, which has order $2n$. The powers $1,\beta ,\dots ,{\beta }^{n-1}$ represent all projective points, since proportional powers differ by exponent $0$ or $n$ modulo $2n$. But ${\beta }^n=-1$, so the kernel of $c\mapsto c(\beta )$ is an ideal modulo $T^n+1$, a negacyclic code. Multiplication by $T$ gives $(-c_{n-1},c_0,\dots ,c_{n-2})$, preserving its kernel. This code is always equivalent to the ternary Hamming code. If $s$ is odd, $n$ is odd too, and the substitution $T\mapsto -T$, or coordinate scaling $c_i\mapsto (-1{)}^i{c}_i$, changes this negacyclic construction into the cyclic one. In fact $\alpha =-\beta$ then has order $n$. These explicit constructions prove the qualified assertion rather than relying on a theorem name.

For decoding, use the printed $13\times 3$ matrix $H$ with received words as row vectors; the conventional $3\times 13$ parity-check matrix is $H^T$. The received word's syndrome isA single-symbol error of value $a$ at position $i$ has syndrome $a{h}_i$, where $h_i$ is row $i$ of the printed matrix. HereTherefore subtract $2$ at the sixth coordinate, changing its received value $1$ to $2$ modulo three. The decoded codeword isIts syndrome is zero. The thirteen projective rows and the two nonzero scalars give all $26$ nonzero syndromes exactly once, so this is the unique codeword at distance one. It is the transmitted word under the usual assumption of at most one symbol error. If positions $1,2,5$ are designated check positions, their independent unit rows make the other ten symbols systematic data, namely $(2,0,2,0,0,2,1,1,2,0)$.

Write $s=R^2$. A steady complex amplitude obeys $(\mu -s+i\Lambda )A=-1$, soThus every positive intensity root gives exactly one steady phase, and $s=0$ is impossible. The cubic intensity polynomial is $F(s,\mu )=s^3-2\mu s^2+({\mu }^2+{\Lambda }^2)s-1$. Its positive steady branch can be parameterized completely asThe two formulae join smoothly as a single curve at the maximum radius $R={\Lambda }^{-1}$; this joining point is not a saddle-node bifurcation. A turning point with respect to $\mu$ satisfies $F_s=0$. Subtracting the equilibrium and derivative conditions givesThese points lie on ${\mu }_{+}$. Since $f^{\prime }(s)=(1-s^3)/s^5$, its maximum is $f(1)=3/4$. Therefore there is exactly one distinct steady state for every $\mu$ when $\Lambda \ge \sqrt{3}/2$. One can also see uniqueness directly: ${\mu }_{-}$ is increasing and ${\mu }_{+}$ is decreasing when no turning points exist, and their respective ranges meet only at their common endpoint. At the equality there is a cusp bifurcation with a triple intensity root at $s=1,\mu =3/2$.

When $0<\Lambda <\sqrt{3}/2$, the two turning intensities satisfy $s_{-}<1<s_{+}$. Define ${\mu }_L=s_{-}+1/(2s_{-}^2)$ and ${\mu }_U=s_{+}+1/(2s_{+}^2)$; the curve has a local minimum at the former and a local maximum at the latter, with ${\mu }_L<{\mu }_U$. There are three distinct steady intensities for ${\mu }_L<\mu <{\mu }_U$, two distinct ones at an endpoint, and one otherwise. The bifurcation diagrams below show the folded small-$\Lambda$ curves and the unfurled large-$\Lambda$ curve, together with the linear stability calculated next. Both ends of the full branch have $R\to 0$ as $|\mu |\to \infty$, while its middle reaches the finite maximum ${\Lambda }^{-1}$.

Because $⟨B⟩=0$, a periodic primitive $H$ exists. Fix its additive constant by $⟨H⟩=0$. Integrating the conserved-field equation once in space gives $H_T=\sigma (H_X+\delta A^2{)}_X$: the possible integration constant vanishes on taking the spatial mean. Treat the spatial average as the inner product defining functional derivatives. Integration by parts, with no boundary terms under periodic boundary conditions, givesThus the conserved-field real amplitude equation is a gradient flow ascending $V$, or descending $-V$, with positive diagonal mobilities. Along a classical solution,For the mixed term put $P=⟨A^4{⟩}^{1/2}$ and $Q=⟨H_X^2{⟩}^{1/2}$. The Cauchy-Schwarz inequality and a completed square giveConsequently, for $\beta =1-\delta >0$,The negative leading quartic coefficient proves the upper bound. The stronger pointwise square completionis also useful: a superlevel set $V\ge V(0)$ bounds the amplitude in $L^4$, its spatial derivative in $L^2$, and $B=H_X$ in $L^2$, because a quartic polynomial with negative leading coefficient dominates its lower-order terms.

The dynamics dissipates toward the steady-state set rather than sustaining nonconstant periodic motion. Indeed $V$ increases to a finite limit, and the time integral of $⟨A_T^2+H_T^2/(2\delta \sigma )⟩$ is finite. For global regular trajectories with the usual parabolic precompactness, every limit point is stationary, by the LaSalle invariance principle. A nonconstant periodic or recurrent orbit would force a strictly increasing $V$ to return to its original value and is impossible. Boundedness of a monotone functional alone does not prove convergence to one particular equilibrium; isolation of the limiting equilibrium or an additional convergence theorem supplies that stronger claim.

In a convenient cardinal parameter normalization, take the unit $m$-cube and project by the sum of its coordinates. Its pushforward density is the unit-direction univariate box splineEquivalently, with $B_1=1_{[0,1)}$ at its discontinuity points,Here there are $m$ convolution factors; some conventions instead index the spline by its degree $m-1$. The half-open convention for $m=1$ assigns knot values consistently and does not change the pushforward measure.

Support and positivity. A sum of $m$ numbers in $[0,1]$ lies in $[0,m]$, so the closed support is finite. For $0<x<m$, the interval of $u\in (0,1)$ with $0<x-u<m-1$ has positive length. Induction in the convolution recurrence therefore gives $B_m(x)>0$ in the interior. For $m\ge 2$, $B_m(0)=B_m(m)=0$: strict positivity includes the open support interval, not its endpoints.

Partition of unity. The translates of $B_1$ cover the line exactly once under the half-open convention. Nonnegativity permits interchange of sum and integral, and induction givesThus $\boxed{\sum _j{B}_m(x-j)=1}$, a locally finite sum. Each $B_m$ also has integral one, although partition of unity does not mean its maximum value is one.

For $m\ge 2$, repeated integration gives the explicit truncated-power formOn each unit knot interval this is a polynomial of degree at most $m-1$, and on $(0,1)$ it is $x^{m-1}/(m-1)!$, so the degree is attained. Each truncated power has $m-2$ continuous derivatives; the derivative of order $m-1$ jumps at the first knot. Therefore the dependence on the projected box dimension isFor $m=1$ the pieces are constants and the function is discontinuous at the knots. If geometric width is measured under orthogonal projection onto the unit diagonal instead, the projected coordinate is $x/\sqrt{m}$, so the physical support width is $\sqrt{m}$; its unit-mass density is $\sqrt{m}{B}_m(\sqrt{m}x)$. These are different scalings of the same cardinal spline, not different continuity or degree claims.

For a bivariate box spline, choose a spanning direction matrix $\Xi =({\xi }_1,\dots ,{\xi }_m)$ in the plane and project the unit cube by $u\mapsto \Xi u$. Define its normalization byThe support is the zonotope ${\sum }_r[0,1]{\xi }_r$, and the polynomial pieces generally have total degree $m-2$. The grid comes from the chosen direction families and their lattice translates. Two independent directions, with repetitions, give tensor-product B-splines on a parallelogram grid. Three families such as $e_1,e_2,e_1+e_2$ give a three-direction triangular grid; an affine change of basis can make it the usual equilateral triangular grid. The four families $e_1,e_2,e_1+e_2,e_1-e_2$ give the criss-cross square grid and the quadratic four-direction box spline. Changing the direction matrix and repeating directions therefore changes the grid, support and smoothness while retaining the box-projection construction.

This is mid-edge subdivision, rather than a vertex-retaining refinement. Use the usual closed two-manifold mesh setting: each edge has two incident facets and each vertex has a cyclic fan. For boundary meshes, a boundary refinement rule has to be specified separately. The relevant generic-position condition excludes collapsed local tangent directions and singular regular patches.

Topology and the manifold property. Regard the abstract mesh as a cell decomposition of a surface. Join the edge midpoints in each facet. The inner polygon is the new face associated with that facet; the corner regions around an old vertex assemble into the face associated with that vertex. At an old edge midpoint, the four adjacent corner connections form a cyclic link. Thus every new interior vertex has valence four, every new edge has two incident faces, and the refined cell complex is homeomorphic to the original surface. If the original counts are $V,E,F$, the new counts are $E,2E,V+F$, preserving $V-E+F$. The cyclic-link argument, rather than Euler characteristic alone, verifies the local manifold condition. Convergence and local regularity, justified below, transfer this abstract surface structure to the limit.

Convex hull. Each newly created point is an average of two previous points. By induction it is a convex combination of original vertices. The same is true of points of any triangulation of the refined facets, and taking limits keeps them in the closed convex hull. Hence the entire limit stays in that hull, not necessarily inside the original nonconvex enclosed solid.

Facet centroids. Follow the descendant inner face of an original $n$-sided facet, with cyclic vertices $p_i$. Its vertices satisfy $p_i^{(r+1)}=(p_i^{(r)}+p_{i+1}^{(r)})/2$. Summing proves mid-edge facet centroid invariance:For a cyclic Fourier mode $e^{2\pi iji/n}$ the multiplier is $(1+e^{2\pi ij/n})/2$, whose modulus is $|\cos (\pi j/n)|<1$ for $j\ne 0$. Every mean-zero mode therefore decays, so all descendant face vertices converge to $\overline{p}$. Consequently the original vertex centroid belongs to the limit surface. No planarity assumption is needed.

Quadratic triangular pieces. On a regular quadrilateral mesh, apply two midpoint steps. Each new point combines three old neighboring controls with weights $1/2,1/4,1/4$. For example, around a face with cyclic corners $p_{00},p_{10},p_{11},p_{01}$, the four new points areThis is the binary refinement mask obtained by expandingwith the translation chosen to place the refined grid at quarter offsets. The limit is therefore represented by shifts of the quadratic four-direction box spline with directions $e_1,e_2,e_1+e_2,e_1-e_2$. Projection of a four-cube onto the plane has piecewise total degree $4-2=2$, and its knot grid is triangular. Coordinatewise linear combinations preserve that degree, giving parametric quadratic triangle patches. Around a nonregular center there are infinitely many shrinking rings of such patches; the isolated center is their limit, not generally part of a finite polynomial patch representation.

Only finitely many initially possible smoothness exceptions. Every vertex has valence four after the first step. Only the descendants of original facets and the faces created around original vertices can remain nonquadrilateral. All subsequently created faces around four-valent vertices are quadrilaterals. Thus every point except the limiting centers of those persistent nonquadrilateral faces eventually lies in a regular patch neighborhood. The number of possible exceptional centers is at most $V+F$. For the regular box spline, any three distinct directions still span the plane, so three directions must be removed to make the remainder nonspanning. The box spline continuity criterion gives $C^{3-2}=C^1$ across its triangle boundaries. This proves $C^1$ continuity away from at most those finitely many centers.

Removing the apparent exceptions. Center a finite neighborhood of an $n$-sided exceptional face, and analyze a full two-step subdivision matrix so the mesh orientation is restored. Cyclic Fourier basis modes diagonalize its sector symmetry. The face mode has eigenvalueThe local ring blocks also contribute eigenvalues $1/4$ and zero. For $n>3$, the constant mode is the single eigenvalue one, and the two first-frequency tangent modes dominate all nonconstant remaining modes. Construct their characteristic map of a subdivision surface; its quadratic derivative pieces must have a nonzero consistently oriented Jacobian, and its fundamental sector must be injective. These checks, not the eigenvalue ordering alone, give a regular chart and a continuously limiting tangent plane for generic data.

The case $n=3$ needs a separate Jordan analysis: $\lambda =1/4$ is eightfold, so the usual semisimple double-eigenvalue test does not apply. Its first-frequency Jordan chains supply the leading tangent behavior, while the other contributions become relatively negligible. Regularity and injectivity of that generalized characteristic map complete the argument. These concrete spectral and characteristic-map checks are established for this scheme in Peters and Reif, Sections 3 and Appendix. Thus the generic limit is geometrically $C^1$ also at the exceptional centers; compatible local charts need not preserve the original uniform refinement parameterization.

The manifold statement concerns the abstract limit surface and its regular local parametrizations. It does not, from combinatorics and generic tangent data alone, prove global injectivity of the image in three-dimensional space. A particular model may require an additional global self-intersection test before claiming that its image is an embedded manifold.

At a sampling point $j/n$, the given polynomial has value $f_{nm}(j/n)=n^{-m}{j}^{\underline{m}}$, where $j^{\underline{m}}=j(j-1)\cdots (j-m+1)$ is a falling factorial. It vanishes when $j<m$. The binomial coefficient identity $j^{\underline{m}}\left(\genfrac{}{}{0ex}{}{n}{j}\right)=n^{\underline{m}}\left(\genfrac{}{}{0ex}{}{n-m}{j-m}\right)$ therefore givesThe last step is the binomial theorem, and $n^{\underline{m}}/n^m={\prod }_{r=0}^{m-1}(1-r/n)=f_{nm}(1)$. For $m=0$ the empty product is one and the identity is simply $B_{n}1=1$. This is the Bernstein falling-factorial identity.