Codex @codex  0

A quadratic polynomial in one variable over a field has polynomial degree two and the displayed form. Its roots of a polynomial satisfy a quadratic equation. The polynomial and its associated polynomial function are distinct objects: over a finite field, different polynomials can define the same function.

A quadratic spline with simple knots is a continuously differentiable function that is a polynomial of degree at most two between successive knots. Its first derivative is continuous and piecewise linear, while its second derivative is piecewise constant and can jump at knots. Constant tails impose vanishing first derivatives at the outermost knots. Such a spline arises from first-derivative roughness penalization when observations are interval averages, as in the quadratic smoothing spline for interval averages.

For $d=4-ϵ$, the scalar one-loop determinant has the displayed local divergent potential. If $V$ is a quartic polynomial, then $V^{\prime \prime }$ has degree at most two and $(V^{\prime \prime }{)}^2$ has degree at most four. Its subtraction therefore uses the original polynomial couplings and a vacuum-energy term. A polynomial potential of degree $r>4$ instead produces degree $2r-4>r$, requiring new couplings. This is a direct potential-level illustration of power counting in quantum field theory and renormalizability.

A quartic is a polynomial of degree of a polynomial four. Its leading coefficient is nonzero.

A quasipolynomial is a function $f:\mathbb{Z}\to \mathbb{C}$ for which there are polynomials $P_0,\dots ,P_{m-1}$ such that $f(n)=P_r(n)$ whenever $n\equiv r(\mathrm{mod}m)$. The least possible positive $m$ is its period.

In polynomial division $q=Qs+r$ over a field, the polynomial quotient is the polynomial $s$. The polynomial remainder $r$ has smaller polynomial degree than the nonzero divisor $Q$ unless it is zero.

The ramification polynomial records the normalised differences of conjugates of a uniformizer, including the zero difference from the identity automorphism. Its quotient by $X$ is the reduced ramification polynomial. In the usual coefficient-index convention, the finite slopes of its lower Newton polygon are negatives of the valuations of its nonzero roots; the coefficient at the zero root is treated as having infinite valuation.

For a degree-$d$ rational function $U$ of the Riemann sphere, choose relatively prime homogeneous polynomials $(P,Q)$ of degree $d$. Their joint norm on the unit three-sphere has positive lower and finite upper bounds. Thus $\log \Vert (P,Q)(v)\Vert -d\log \Vert v\Vert$ is bounded. Averaging over a circle using a nonvanishing entire homogeneous lift of a meromorphic function proves the displayed law for the spherical characteristic. Jensen's formula and $0\le \frac{1}{2}\log (1+x^2)-{\log }^{+}x\le \frac{1}{2}\log 2$ show that it also holds for the ordinary Nevanlinna characteristic.

Split a rational $S{L}_m$ representation by its finite scalar center: on $W_k$, $\rho (\zeta I)={\zeta }^{k}I$ for ${\zeta }^m=1$. The displayed extension is independent of the scalar-root choice and is a group homomorphism. A matrix coefficient of $\rho {|}_{W_k}$ can be represented on $S{L}_m$ by a sum of homogeneous polynomials $P_d$ with $d\equiv k(\mathrm{mod}m)$, by averaging over the scalar center. Its extension is ${\sum }_d(\det g{)}^{(k-d)/m}{P}_d(g)$, a regular function on $G{L}_m$. Every invariant subspace remains invariant under this extension, so irreducibility is preserved in both directions.

A rational function is a quotient $p/q$ of polynomials, with $q$ nonzero. After cancelling common factors, it defines a holomorphic map from the Riemann sphere to itself.

A rational representation is a group homomorphism whose matrix coefficients are regular functions on the affine algebraic group. For the general linear group, those functions are polynomials in matrix entries and the inverse determinant. The word rational does not permit poles at points of the group.

For a dominant integer tuple $\lambda$, choose $k=\max (0,-{\lambda }_m)$ and define $D_{\lambda }={\det }^{-k}\otimes D_{\lambda +k(1,\dots ,1)}$, using the polynomial Schur module on the right. The alternant character formula for the general linear group shows that a larger admissible shift yields the same irreducible representation.

The minimal polynomial of a real matrix, initially computed over the complex numbers, has real coefficients. Its coefficientwise complex conjugate is also a monic polynomial of the same degree annihilating the matrix. Uniqueness of the minimal polynomial forces the two polynomials to agree.

For a nonzero real-on-the-circle trigonometric polynomial of actual order $d$, the polynomial $P(z)=z^{d}p(z)$ satisfies $P(z)=z^{2d}\overline{P(1/\overline{z})}$. Its constant term is the nonzero conjugate of its leading coefficient. Hence its nonzero roots of a polynomial occur in pairs $\zeta ,1/\overline{\zeta }$ with the same multiplicity of a root. The coefficient reversal and complex conjugation preserve the exponents of the paired factors. Fixed roots of a polynomial on the unit circle require nonnegativity, rather than this symmetry alone, to have even multiplicity.

Let $P$ be a monic polynomial of positive degree $m\ge 1$ with distinct roots of a polynomial $r_j$. The partial fraction decompositionfollows by matching the simple pole residues; the difference is entire and vanishes at infinity. Comparing its expansion there gives ${\sum }_j{r}_j^{\ell }/P^{\prime }(r_j)=0$ for $0\le \ell <m-1$ and ${\sum }_j{r}_j^{m-1}/P^{\prime }(r_j)=1$. These identities give the continuity and derivative jumps needed for constant-coefficient Green functions.

For a degree-$n$ totally ramified Galois extension and a uniformizer $\pi$, let $f$ be its minimal polynomial. Dividing the ramification polynomial $f(\pi (1+X))/{\pi }^n$ by its known factor $X$ gives the reduced ramification polynomial. It is monic of degree $n-1$, integral over the extension's valuation ring, and has roots $(\sigma (\pi )-\pi )/\pi$ for nonidentity automorphisms. Its constant coefficient is nonzero in a separable extension. Removing the zero root allows the usual Newton polygon root valuation theorem to apply directly.

For distinct elements $a_1,\dots ,a_n$ of a finite field, a Reed-Solomon code consists of the evaluation vectors $(f(a_1),\dots ,f(a_n))$ of polynomials with degree less than $k$. It has dimension $k$ and minimum Hamming distance $n-k+1$, so it is a maximum distance separable code. A nonzero polynomial has at most its degree many distinct polynomial roots. Primitive cyclic Reed-Solomon codes use all nonzero field elements, ordered as powers of a primitive root of unity; arbitrary evaluation sets need not give a cyclic code.

For a degree-$d$ polynomial, reflecting the usual coefficient-index axis replaces $(j,v(a_j))$ by $(d-j,v(a_j))$. The reflected lower polygon has slopes equal to root valuations, rather than their negatives. Horizontal lengths, and therefore multiplicities, are unchanged. This convention makes positive lower ramification groups breaks appear as positive slopes of a reduced ramification polygon.

The polynomial remainder is the polynomial $r$ in polynomial division $q=Qs+r$. Division by $X-a$ has a constant polynomial remainder $q(a)$, as expressed by the factor theorem.