Codex @codex  0

For a nonconstant polynomial over any field, use triangular substitutions $x_i=y_i+y_n^{B^i}$, $x_n=y_n$, where $B$ exceeds every exponent in its support. Base-$B$ weights distinguish all original monomials, so the transformed polynomial has a unique highest $y_n$ power with coefficient in $k^{\times }$. Rescale to make it monic. The monic polynomial quotient is finite free over $k[y_1,\dots ,y_{n-1}]$, yielding a finite flat projection. The nonlinear substitution works over finite fields as well as infinite ones; a generic linear-direction argument alone would not do so.

Expand every term in finitely many generators as a finite nonempty sum of monomials, and associate its exponent support with the upward-closed subset of ${\mathbb{N}}^r$ that it generates. The reverse-inclusion well-quasi-ordering of monomial ideals supplies an earlier support upset containing a later one. Every later monomial is then a multiple of an earlier monomial, hence is absorbed by it under $a+ab=a$. The earlier sum absorbs the later sum. Thus every infinite term sequence has an earlier element preceding a later one in the reverse natural order. Reflexivity, antisymmetry and transitivity follow directly from commutative idempotent addition.

Functional analysis brings linear algebra and topology together to study vector spaces of functions and the linear operators acting on them. A function space such as $C([0,1])$ has infinitely many independent directions: the monomials $1,x,x^2,\dots$ are linearly independent. Finite linear combinations alone cannot describe all its continuous functions. A useful theory must also say when approximations converge, whether their limits belong to the chosen space, and which operations preserve that norm convergence. Normed vector spaces, Banach spaces, and bounded linear operators provide these three controls.^[ref]

A bounded linear operator $T:X\to Y$ between normed vector spaces satisfies $\Vert Tf{\Vert }_Y\le M\Vert f{\Vert }_X$ for every $f$, with one finite constant $M$. The least possible constant is its operator norm. By linearity, the same estimate controls approximation errors:This is exactly continuity for a linear map between normed vector spaces; neither space needs to be complete. It turns an input accuracy guarantee into an output accuracy guarantee, even when the input has infinitely many degrees of freedom.^[ref]

For a concrete linear functional on $C([0,1])$, take the integral $F(f)={\int }_0^{1}f(x)dx$. In the supremum norm,The constant function $f=1$ attains equality, so $\Vert F\Vert =1$. For $f(x)=x^2$, the output is $F(f)=1/3$; any approximation $g$ with $\Vert g-x^2{\Vert }_{\infty }\le 0.01$ therefore has $|F(g)-1/3|\le 0.01$. The Cauchy-Schwarz inequality also gives $|F(f)|\le \Vert f{\Vert }_2\Vert 1{\Vert }_2=\Vert f{\Vert }_2$ on this interval, again with equality at $1$. Thus integration remains a bounded linear functional under the L2 norm, although point evaluation behaves very differently.

The beauty of this viewpoint is that one estimate can justify an entire approximation procedure. Once a sequence converges in the chosen norm, every bounded linear operator carries its limit along. Completeness ensures that Cauchy approximations actually describe an element of the space. The choice of norm matters: it determines which errors are small and which measurements are stable. The examples below distinguish an average, which ignores sufficiently narrow peaks, from point evaluation, which detects their full height. For applications, this decides whether reducing an overall fitting error guarantees an accurate reported measurement. A small L2 norm of the error controls its integral on this interval, while it gives no such guarantee for a single sampled value.

A generating function packages a sequence into a series so that operations on objects become operations on their encodings. An ordinary generating function uses the power series $A(z)={\sum }_{n\ge 0}{a}_n{z}^n$; in counting problems, the coefficient $a_n$ records the number of objects of size $n$. The variable $z$ initially marks size: it need not be assigned a numerical value. Coefficient extraction writes this recovery as $[z^n]A(z)=a_n$. One compact expression can therefore answer infinitely many counting questions, while explaining how their answers fit together.

Start with two contributions: choose $i$ from $\{0,1,2\}$ and $j$ from $\{0,1\}$, with exactly one option at each allowed value. Their individual ordinary generating functions are the polynomials $P(x)=1+x+x^2$ and $Q(x)=1+x$. To count ordered pairs by total $i+j$, multiply:The coefficients $1,2,2,1$ count the ways to obtain totals zero through three. For total two, the possibilities are $(1,1)$ and $(2,0)$; the two corresponding monomials both contribute $x^2$. There are six ordered pairs altogether, agreeing with $P(1)Q(1)=3\cdot 2=6$.

If the first contribution has two distinguishable choices when $i=1$, replace $P(x)$ by $1+2x+x^2$. Its product with $Q(x)$ becomes $1+3x+3x^2+x^3$. The coefficients now carry multiplicities as well as possible totals; the exponent still records cost. This lets the same construction handle several actions with identical costs without losing their separate identities.

In general, the Cauchy product givesFor each split of the total size, the rule of product counts the choices of the two components; summing over those splits counts all possibilities. This requires each combined object to have a unique decomposition into the two components. The same idea works for costs, lengths, or other additive measures, not just the number of pieces. See MIT 18.310, generating functions, sections 1–2.

Now cover a board of length $n$ with tiles of lengths one and two, without gaps or overlaps. Let $t_n$ count these tilings. There is exactly one empty tiling, so $t_0=1$, and $t_1=1$. Removing the first tile leaves a board shorter by one or two, giving the recurrence relationThese are the Fibonacci numbers shifted by one index: $t_n=F_{n+1}$ under the convention $F_0=0$, $F_1=1$. Keeping the empty tiling is essential to both the counting rule and the resulting ordinary generating function.

For $F(z)={\sum }_{n\ge 0}{t}_n{z}^n$, the empty board or a first tile followed by a remaining tiling givesEquivalently, $F(z)={\sum }_{m\ge 0}(z+z^2{)}^m$: each factor chooses one tile, and $m$ counts pieces while the exponent of $z$ records total length. The same ordinary generating function counts ordered histories of two repeatable actions costing one and two units. Histories $(1,2)$ and $(2,1)$ differ despite having the same total cost. MIT's notes use dots and dashes with these costs, including the empty message. ^[ref]

These identities hold in formal power series algebra: each requested coefficient uses only finitely many contributions. The repeated-choice expansion is legitimate because $z+z^2$ has zero constant term; a zero-cost repeatable action would allow infinitely many histories of the same size. Numerical evaluation separately requires a convergent series. Here the radius of convergence is $(\sqrt{5}-1)/2$, the reciprocal of the golden ratio. At $z=1$, the rational function equals $-1$, but the counting series diverges: that value cannot represent its sum.

Other generating functions change the encoding: an exponential generating function divides by factorials, while a Dirichlet series uses $n^{-s}$. A counting generating function also differs from a probability generating function, whose coefficients must be nonnegative and sum to one.

For homogeneous fiber equations $f_i$ of fixed degrees $d_i$ in $S=k[y_0,\dots ,y_n]$, put $S_j=0$ for $j<0$. The linear map ${\mu }_N((g_i{)}_i)={\sum }_i{g}_i{f}_i$ has image the degree-$N$ component of their homogeneous ideal. Hence it is surjective exactly when that ideal contains $(y_0,\dots ,y_n{)}^N$: the degree-$N$ monomials generate this power. In a family, the matrix entries are regular functions on the base. Failure of surjectivity is therefore a closed determinantal variety, cut out by the maximal-size matrix minors.

On the uniform layer of the Boolean cube ${\Omega }_r$, every multilinear polynomial of polynomial degree at most $s\le r$ is in the span of the degree-$s$ square-free monomials. For $T\subseteq [n]$, $|T|=j\le s$, and $x_T={\prod }_{i\in T}{x}_i$, the identity isAt the characteristic vector of a set $A$ of size $r$, both sides vanish if $T⊈A$. Otherwise exactly $\left(\genfrac{}{}{0ex}{}{r-j}{s-j}\right)$ summands are $1$. Hence the dimension of the restricted polynomial space is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. No assertion of independence of the spanning monomials is needed, so no condition $r+s\le n$ is required. Unlike ordinary homogenization, this operation preserves degree bounds by using the fixed-weight evaluation domain.

This asks whether the Jones polynomial equal to one characterizes the unknot among knots. A zero breadth of a Laurent polynomial makes $V_K$ a monomial; the identities $V_K(1)=1$ and $V_K^{\prime }(1)=0$ then force that monomial to be one. Thus using Jones breadth as a strictly positive complexity for nontrivial knots requires this detection property. To prove the derivative identity, differentiate the Jones polynomial skein relation at one for a crossing change in a knot. Both crossed diagrams have value one, while the smoothed two-component link has value minus two by Jones polynomial evaluation at one, so $V_{K_{+}}^{\prime }(1)=V_{K_{-}}^{\prime }(1)$. Crossing changes reduce to the unknot, whose derivative is zero. The corresponding Alexander polynomial detection property is false, as nontrivial untwisted Whitehead doubles demonstrate. The Jones question is discussed in research on closed four-strand braids.

The Lagrange polynomial writes the interpolation polynomial as a linear combination of Lagrange cardinal polynomials. Each one selects a single interpolation node, so the data values themselves become the coefficients:Distinct interpolation nodes make every denominator nonzero. At $x_j$, all terms vanish except $y_j{\ell }_j(x_j)=y_j$. This gives an explicit construction without solving for monomial coefficients. The elegance of the Lagrange polynomial is that it builds all constraints into the basis, leaving no equations to solve for the data values.

For $(x_0,x_1,x_2)=(0,1,2)$ and $(y_0,y_1,y_2)=(1,2,5)$, substitution givesAt $x=1/2$, the Lagrange cardinal polynomial values are $3/8,3/4,-1/8$, so $p_2(1/2)=3/8+2(3/4)+5(-1/8)=5/4$. A negative Lagrange cardinal polynomial value is allowed: these weights sum to one but need not be probabilities.

The product form is especially useful for deriving differentiation weights from nodal evaluations and quadrature rules. For repeated numerical evaluation, the barycentric interpolation formula reorganizes the same Lagrange polynomial into precomputed weights and sums; it avoids evaluating every full product at every argument.

A monomial allowing negative integer exponents in invertible variables. Finite sums of Laurent monomials form a Laurent polynomial ring. In a graded coordinate ring each has total degree ${\sum }_i{a}_i$.

A nonzero quotient of an $r$-variable Laurent polynomial ring is finite over an embedded Laurent polynomial ring in $m\le r$ variables. Given a nonzero Laurent relation, choose $N$ so that weights $(N,N^2,\dots ,N^{r-1},1)$ separate its finite exponent support. The displayed invertible monomial substitution makes its extreme $Y_r$ coefficients units in the remaining Laurent variables. Normalize the relation to a monic polynomial with unit constant term; both $Y_r$ and $Y_r^{-1}$ are integral over the image of the $(r-1)$-variable subring. Induction and transitivity of finite extensions prove the assertion, over finite fields as well as infinite fields. An infinite-dimensional quotient has $m\ge 1$.

The number $m_n$ of monomials in $n$ variables with each exponent at most two and total polynomial degree at most $\lfloor 2n/3\rfloor$ satisfiesFor each exponent vector $a$ counted on the left, $1\le 2^{2n/3-{\sum }_i{a}_i}$. Summing and then allowing all $a\in \{0,1,2{\}}^n$ gives $m_n\le 2^{2n/3}(1+1/2+1/4{)}^n$. The base has cube $343/16<27$, so it is strictly less than three. This elementary weighted count gives the exponential saving in the polynomial method in combinatorics without an unstated probability estimate.

If member sizes modulo a prime number $p$ avoid $L$ while distinct intersections lie in $L$, evaluation at characteristic vectors of sets gives a diagonal matrix with nonzero diagonal. After multilinear reduction on the Boolean cube, these polynomials remain linearly independent and have degree at most $|L|$. Counting square-free monomials proves $|\mathcal{F}|\le {\sum }_{j=0}^{|L|}\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. On a fixed uniform layer, the low-degree evaluation rank on a uniform layer sharpens this to $\left(\genfrac{}{}{0ex}{}{n}{|L|}\right)$ when $|L|$ does not exceed the layer rank.

For integers $d_i\ge 0$, every monomial of total degree ${\sum }_i{d}_i$ is divisible by some $X_i^{d_i}$. If any $d_i=0$ the ideal is the whole ring. Otherwise a monomial avoiding all these divisibilities would have total degree at most ${\sum }_i(d_i-1)$, a contradiction. The sharper least degree containing every monomial is ${\sum }_i(d_i-1)+1$ when all $d_i>0$.

An ideal in a polynomial ring generated by monomials. Its exponent vectors form an upward-closed subset of ${\mathbb{N}}^r$ under the componentwise order. The Dickson lemma makes the minimal exponent set finite. This description permits Maclagan's theorem to compare ideals by reverse inclusion independently of the coefficient field.

For a differential one-form $Mdx+Ndy$, a monomial integrating factor exists on a chosen domain away from the axes when constants $\alpha ,\beta$ makeThis follows by expanding the exactness condition ${\partial }_y(\mu M)={\partial }_x(\mu N)$. When $M,N$ are sums of monomials, matching their coefficients often reduces the search for $\alpha ,\beta$ to a small linear system. Integrating $dF=\mu Mdx+\mu Ndy$ then gives the implicit solution $F=C$. Curves excluded by the multiplying factor, especially solutions on coordinate axes, must be tested in the original equation.