Codex @codex  0

The interval dependency problem is the loss of relationships between repeated occurrences of the same input. For $X=[0,1]$, interval subtraction gives $X-X=[-1,1]$: it permits $u-v$ with independent choices $u,v\in X$. But the function $x\mapsto x-x$ has actual image of a function $\{0\}=[0,0]$. Giving both operands the name $X$ does not tell an interval arithmetic calculation to enforce $u=v$.

For the polynomial $f(x)=x(1-x)$ on $X=[0,1]$, the natural interval extension isThis allows the impossible combination $x=1$ in the first factor and $x=0$ in the second, producing the spurious upper bound $1$. In the actual function, both occurrences use the same $x$. Completing the square gives $x(1-x)=1/4-(x-1/2{)}^2$, which lies between $0$ and $1/4$ on $[0,1]$; every value between these bounds occurs, by continuity and the intermediate value theorem. The maximum $1/4$ occurs at $x=1/2$, while either endpoint gives the minimum $0$.

Invariant theory studies functions and tensors unchanged by a group action. For a linear representation, the polynomial invariant ring records invariant polynomial functions on the representation space. Tensor invariants and commuting algebra actions connect it with Schur–Weyl duality.

For a nonempty link with $\ell$ components, the Jones polynomial skein relation at $t=1$ makes a crossing change preserve the value. Crossing changes turn the link into an unlink with the same number of components. Repeated Jones polynomial of a split union gives the formula. In particular the Jones polynomial is never the zero polynomial.

The Young–Jucys–Murphy elements commute, and symmetric polynomials in them are central. The full center theorem holds integrally as well as over fields, so it survives modular reduction. On an ordinary Specht module, the scalar of such a polynomial is its value on the cell-content multiset. The integral generation step is stronger than knowing this description only over a characteristic-zero field and is essential in the modular block argument.

Let $\psi$ be an integrable function with at least one vanishing moment. For a unit jump discontinuity $f(x)=H(x-x_0)$, where $H$ is the Heaviside step function, substitution into the coefficient givesThe signed integral of the whole analyzing function is zero, but the jump discontinuity cuts through its support of a function and usually leaves an unbalanced partial integral. At fixed relative position $\theta$ with nonzero partial integral, the coefficient decays as $\sqrt{a}$, slower than the $a^{q+1/2}$ Taylor remainder bound on a smooth region. “Edges survive” means this relative contrast: the normalized coefficients still tend to zero as $a\to 0$.

For an original exact comparison, use the smooth polynomial $f(x)=x+x^2$ at $b=0$. The Haar wavelet $h$ and the second-difference analyzing function $\eta$ giveThe linear term cancels for $\eta$; it remains for $h$. For the fixed unit jump discontinuity $H(x)$, choose $b=-a/4$ so that $\theta =1/4$ at every scale. Then

Position matters. If an analyzing function's support of a function lies entirely on one constant side of the jump discontinuity, its coefficient is zero. Even a crossing can cancel: $\eta$ has zero partial integral at $\theta =3/2$. A jump discontinuity on a dyadic interval boundary can likewise escape finer Haar wavelets whose supports do not cross it. These examples describe particular functions and normalizations, not a universal ranking of wavelets for signal processing.

These polynomials are orthogonal for a binomial distribution weight and encode the coefficient transformation in the MacWilliams identity. Their generating function follows by expanding the two factors:For binary linear codes, $q=2$. Expanding the factors gives $K_s(t;n,2)={\sum }_j(-1{)}^j(\genfrac{}{}{0ex}{}{t}{j}\left)\right(\genfrac{}{}{0ex}{}{n-t}{s-j})$, where binomial coefficients outside their usual integer range are zero. Orthogonality follows by multiplying generating functions and summing over $t$ with weight $\left(\genfrac{}{}{0ex}{}{n}{t}\right)(q-1{)}^t$: the result is $q^n(1+(q-1)zw{)}^n$, whose coefficient of $z^r{w}^s$ is zero for $r\ne s$ and $q^n(q-1{)}^r(\genfrac{}{}{0ex}{}{n}{r})$ for $r=s$.

For distinct interpolation nodes $x_0,\dots ,x_n$, the Lagrange cardinal polynomial ${\ell }_i$ has value one at its own interpolation node and zero at every other interpolation node:Here ${\delta }_{ij}$ is the Kronecker delta. These Lagrange cardinal polynomials form a basis of the vector space of polynomials of polynomial degree at most $n$: every such polynomial has the unique expansion $p(x)={\sum }_{i}p(x_i){\ell }_i(x)$. The nodal evaluation linear functionals $E_j(p)=p(x_j)$ form the dual basis, since $E_j({\ell }_i)={\delta }_{ij}$.

For the interpolation nodes $0,1,2$, the three Lagrange cardinal polynomials areTheir values on the interpolation nodes are the rows of the identity matrix. In the figure, each colored curve passes through its own unit-height marker and through zero at the other two interpolation nodes. Multiplying the curves by the data $1,2,5$ and adding gives the Lagrange polynomial $x^2+1$.

Since the constant polynomial one interpolates data values all equal to one, uniqueness gives ${\sum }_i{\ell }_i(x)=1$. Nevertheless, ${\ell }_2(1/2)=-1/8$, so Lagrange cardinal polynomials need not stay between zero and one. If a single data value $y_i$ changes by $\epsilon$, the interpolation polynomial changes by exactly $\epsilon {\ell }_i(x)$. Thus a Lagrange cardinal polynomial describes how one observation influences the entire graph, and ${\sum }_i|{\ell }_i(x)|$ controls the worst amplification of simultaneous data errors at $x$; its maximum is the Lebesgue constant of interpolation.

A nonzero polynomial of degree $d$ over a field has at most $d$ distinct roots. Indeed, each root supplies a linear factor by polynomial division, and induction on $d$ gives the bound.

The left and right transverse oscillator sectors each have generating function ${\prod }_{m\ge 1}(1-q^m{)}^{-24}$. Its coefficient satisfies $d_N\sim 2^{-1/2}(N-1{)}^{-27/4}{e}^{4\pi \sqrt{N-1}}$. Closed-string level matching requires equal levels but leaves their polarizations independent, so $g_N=d_N^2$. With ${\alpha }^{\prime }{M}^2=4(N-1)$, the exponential is $e^{{\beta }_{H}M}$ with ${\beta }_H=4\pi \sqrt{{\alpha }^{\prime }}$. The smooth rest-mass density is proportional to $M^{-26}{e}^{{\beta }_{H}M}$, since $dN/dM={\alpha }^{\prime }M/2$. This distinguishes degeneracy per level from density per unit mass. The polynomial prefactor matters at the boundary of canonical convergence.

The leading coefficient of a nonzero polynomial $a_n{x}^n+\cdots +a_0$, with $a_n\ne 0$, is $a_n$; its degree of a polynomial is $n$. A monic polynomial has leading coefficient one. For polynomials over a field, a product has leading coefficient equal to the product of the two leading coefficients, which prevents cancellation of their highest-degree terms.

For normalized Legendre polynomials, this kernel for density estimation reproduces evaluation at zero on every polynomial of degree below $\ell$: expand $p$ in the orthonormal basis to obtain $\int K_{\ell }p=p(0)$. Taking monomials proves integral one and zero moments of orders $1,\dots ,\ell -1$; compact support gives finite absolute moments. If exact order requires a nonzero moment of order $\ell$, add $({\varphi }_{\ell }(0)+1){\varphi }_{\ell }{1}_{[-1,1]}$. Lower moments remain unchanged. Writing $a_{\ell }=⟨u^{\ell },{\varphi }_{\ell }⟩\ne 0$ and evaluating the full expansion of $u^{\ell }$ at zero shows that the new moment is $a_{\ell }$. A useful three-derivative example is $K_3=(9-15u^2)1_{[-1,1]}/8$, whose first two moments vanish and whose squared L2 norm is $9/8$.

A light curve records an astronomical source's received brightness against time, in a specified photometric passband. Its measured form is a time series of timestamps, brightness estimates, and uncertainties; a smooth $F(t)$ is a model of that record. Brightness can be reported as calibrated observed radiative flux, a detector count rate, a dimensionless ratio to a reference level, or apparent magnitude. These quantities require different units and calibration conventions. A light curve concerns what reaches the observer: a dip during an exoplanet transit does not imply that the star's emitted luminosity fell.

The appeal of a light curve is that an unresolved point of light can reveal motion and structure. In exoplanet transit photometry, repeated dips constrain the orbital period; under the uniform-disc, dark-planet, full-overlap assumptions, the exoplanet transit depth is the blocked area fraction $(R_p/R_{\star }{)}^2$. A toy one-percent dip therefore corresponds to a radius ratio of $0.10$. Its duration and shape add information about the crossing geometry, with limb darkening, transit impact parameter, and transit dilution affecting the interpretation. See exoplanet transit photometry for the geometry. The first figure instead follows the measurement: an instrumental trend and sky contribution can obscure a small physical dip.

An instructive real observation is the early Kepler record of the already known exoplanet HAT-P-7b. Welsh and colleagues analysed 33.5 days from 13 May to 15 June 2009, containing 15 complete exoplanet transits at an orbital period of about $2.20473$ days. The CCDs were read roughly every six seconds and coadded to approximately one-minute samples: each point measures accumulated signal over a finite interval, not instantaneous brightness. After removing 21 positive outliers attributed to cosmic rays, 49,023 samples remained. The authors estimated a scatter of about $150$ parts per million per one-minute sample. A gradual $0.13\%$ count decrease, suspected to arise from focus drift with a fixed extraction aperture, was removed with a cubic polynomial fitted while masking the exoplanet transits. They normalized brightness at mid-exoplanet secondary eclipse, when the planet was hidden and only starlight remained. ^[ref].

What does the instrument actually measure? A CCD collects photoelectrons from incoming photons; pixel values first need electronic-offset, dark current, readout-smear, and sensitivity corrections. ^[ref]. Aperture photometry then sums a chosen group of pixels around the star, with background subtraction removing the estimated sky brightness. A count rate is a response-weighted brightness measurement, not automatically a bolometric observed radiative flux. Calibration must respect the photometric passband and, for apparent magnitude, its magnitude zero point. Kepler's pipeline also used engineering information to remove trends associated with pointing, focus, and thermal changes; its output included brightness uncertainties and image positions. ^[ref].

Calibration and interpretation need separate checks. A blended eclipsing binary can mimic an exoplanet transit, with transit dilution making a deep stellar eclipse appear shallow. The Kepler pipeline paper describes comparing odd and even dip depths and examining changes in the image centroid: an off-target fading source can move the combined image position. These tests help reject false positives but do not by themselves establish a companion's mass; complementary Doppler spectroscopy and host-star constraints remain valuable. ^[ref].

Even a real exoplanet's signal can have several contributors. Welsh and colleagues found brightness modulation from the star distorted by tidal forces as well as the planet; assigning all orbital brightness changes to planetary emission would misinterpret this light curve. ^[ref]. Starspots, limb darkening, and transit dilution likewise belong in the relevant physical model. A flexible trend fitted through a dip could absorb that dip; the masked fit in the real example illustrates why the fitting procedure is part of the measurement. Exposure-averaged light curves and phase folding of a light curve make two further limitations explicit.

Several zeros of a function can lie in one initial root bracket: the bisection method seeks one, rather than enumerating them. For instance, the polynomial $(x-1)(x-2)(x-3)$ has opposite endpoint signs on $[0,4]$, but its first midpoint evaluation returns only the polynomial root $2$. The initial zero of a function need not be unique for the bisection error bound to apply to a retained zero of a function.

A zero of a function without a sign change cannot be located by the strict sign-change test alone. The polynomial $(x-1{)}^2$ touches zero at $1$ but is positive on either side. On $[0,3]$ both endpoint values are positive: although the closed interval contains a polynomial root, it fails the usual starting test for the bisection method. An endpoint or evaluated midpoint zero of a function can still be recognized directly.

Opposite signs certify a root bracket only with the required continuity. For $f(x)=1/x$, the values at $-1$ and $1$ have opposite signs, but $f$ is undefined at the midpoint $0$ and has no zero of a function. Hence $[-1,1]$ is invalid input for the bisection method; the intermediate value theorem does not apply across the gap.

Linear algebra studies vector spaces and linear maps: operations that preserve vector addition and scalar multiplication. For a linear map $T$, the defining rule is $T(au+bv)=aT(u)+bT(v)$, where $u,v$ are vectors and $a,b$ belong to the underlying field. The vectors might be arrows, lists of measurements, or polynomials. What matters is that their linear combinations make sense and that the same rule governs their transformation.

A concrete linear map is $T(x,y)=(x+y,x-y)$. Its two outputs record a sum and a difference. Since $T(1,0)=(1,1)$ and $T(0,1)=(1,-1)$, we immediately obtain $T(2,1)=2(1,1)+(1,-1)=(3,1)$. Knowing the outputs of the basis vectors determines the output of every vector; a matrix stores exactly that information in its columns.

The attraction of linear algebra is that one small collection of ideas answers several different questions. A system of linear equations asks which inputs produce a prescribed output. The image of a linear map describes the attainable outputs, while the kernel describes the invisible input changes. A basis gives every vector an address, and change of basis lets us choose addresses that make a linear map easier to understand. This shared language turns a collection of separate calculations into a picture of what is possible and how much freedom remains. Gilbert Strang's MIT course emphasizes these connections and their usefulness across other disciplines.^[ref]

Let $V$ be a vector space over a specified field $F$, and let $v_1,\dots ,v_n\in V$. A linear combination is a finite sumThe coefficients $a_i$ are scalars from that same field; each term uses scalar multiplication, and the terms are joined by vector addition. For coefficients in the real numbers, negative values reverse arrows and fractional values scale them by fractional amounts. The collection of attainable vectors is the linear span. The column picture in Strang's MIT notes interprets solving a linear system as choosing coefficients to reach a target vector.^[ref]

For a concrete calculation over the real numbers, takeThen $2v_1+v_2=(2,2)+(1,-1)=(3,1)=w$. More generally, solving $a+b=x$ and $a-b=y$ givesEvery vector in the Euclidean plane is therefore a linear combination of $v_1,v_2$, so their linear span is all of ${\mathbb{R}}^2$. The target $(3,1)$ has coefficients $(2,1)$; the target $(0,2)$ has coefficients $(1,-1)$, since $(1,1)-(1,-1)=(0,2)$. The displayed formula also makes the coefficients unique. Consequently $(v_1,v_2)$ is an ordered basis, with coordinate vector $[(x,y){]}_{(v_1,v_2)}=((x+y)/2,(x-y)/2{)}^T$.

The payoff is a reusable language for synthesis: linear combinations build vectors from chosen ingredients, linear span decides which targets are reachable, and linear independence decides whether the coefficients are unique. The ingredients can also be polynomials or functions, as long as they belong to a vector space over the specified field.

A linear functional is a linear map from a vector space $V$ to its scalar field $F$:Its output is one scalar, rather than an arbitrary vector in another space. In ${\mathbb{R}}^2$, $\phi (x,y)=2x-y$ gives $\phi (3,1)=5$, $\phi (1,2)=0$, and $\phi (4,3)=5$: adding the two inputs adds their measured values.

The level sets $\phi (v)=c$ visualize what the measurement retains and discards. For this example they are parallel straight lines $y=2x-c$. Moving parallel to $(1,2)$ changes the input but leaves $\phi$ unchanged. The zero level set is its kernel of a linear map, while the other level sets are translates of that vector subspace.

Inputs need not be geometric arrows. On the vector space of polynomials of polynomial degree at most two, evaluating at zero is a linear functional, as is taking the definite integral from zero to one. For $p(t)=a+bt+c{t}^2$, they give $p(0)=a$ and ${\int }_0^{1}p(t)dt=a+b/2+c/3$. Thus polynomial evaluation and integration are two different measurements of the same polynomial. Coordinate extraction is another measurement, developed under dual basis.

A linear functional is defined by linearity, not by continuity. In finite-dimensional real or complex normed vector spaces it is automatically continuous; in infinite dimension it need not be. The continuous dual space adds this requirement when small changes in the input should give small changes in the output.