Codex @codex  0

Consider the original pair of polynomial equationsTreat them as polynomials in $y$ with coefficients in $\mathbb{R}[x]$. Their Sylvester matrix and resultant areEvery common solution must therefore have $x=-1$ or $x=1$. Back-substitution into $F=0$ gives $y=x^2=1$, and both pairs also satisfy $G=0$. The complete real solution set isHere elimination and direct substitution agree: subtracting $F$ from $G$ gives $2x^2-2$, exactly the same condition.

In general, first solve the one-variable resultant equation, then recover and check the other coordinate in both original polynomial equations. A real coordinate candidate can correspond only to nonreal values of the eliminated variable. Also, vanishing leading coefficients require the separate check in degree drop in a specialized resultant. The general elimination-and-back-substitution method is described in the lecture's §3.1.^[ref]

For the four wavevectors $(2,1),(2,-1),(1,2),(1,-2)$ and their negatives, use invariant phases ${\chi }_1=2{\theta }_1-2{\theta }_2-{\theta }_3+{\theta }_4$, ${\chi }_2={\theta }_1+{\theta }_2-2{\theta }_3-2{\theta }_4$. Add to the cubic normal form of a dynamical system the two quintic terms $e{\overline{A}}_2{A}_3^2{A}_4^2$ and $f{\overline{A}}_1{A}_2^2{A}_3{\overline{A}}_4$ in the first equation, together with their square-symmetry partners; $e,f$ are real. For equal positive magnitudes, steadiness forces $\sin {\chi }_1=\sin {\chi }_2=0$ unless $e=f=0$. Equality of radial equations further gives $(e-f)(\cos {\chi }_1-\cos {\chi }_2)=0$. Consequently the generic phase types are $(0,0)$ and $(\pi ,\pi )$. When $e=f\ne 0$, the mixed type $(0,\pi )$, equivalent by square symmetry to $(\pi ,0)$, also exists. When both quintic coefficients vanish, every phase pair is allowed. Amplitude existence must still be checked from the remaining scalar equation.

The Euler evaluation of even zeta values turns a family of series into exact expressions using Bernoulli numbers, factorials and powers of $\pi$. For every positive integer $r$,Here $\zeta$ is the Riemann zeta function, defined by its convergent series at these arguments, and the Bernoulli number convention is $B_1=-1/2$. The alternating sign combines with the sign of $B_{2r}$ to give a positive sum.^[ref]

Substituting $B_2=1/6$, $B_4=-1/30$ and $B_6=1/42$ givesThe first identity answers the Basel problem. It is surprising because the original series only mentions reciprocal squares of integers, while its exact sum involves the circle constant $\pi$. The cotangent partial-fraction expansion supplies a connection between the two: trigonometric functions encode equally spaced integer poles, whose expansion brings the reciprocal powers into view.

For an original numerical comparison, the first ten terms give ${\sum }_{n=1}^{10}{n}^{-2}\approx 1.549767731$, while ${\pi }^2/6\approx 1.644934067$. The omitted positive terms still contribute approximately $0.095166336$. For fourth powers, the ten-term partial sum is approximately $1.082036583$, only $0.000286650$ below ${\pi }^4/90\approx 1.082323234$. Both are convergent series, but the second approaches its limit much faster.

Exact evaluation is useful beyond obtaining more digits. It supplies an independent check on a numerical summation, exposes how Bernoulli numbers organize infinitely many identities, and makes the remaining series truncation error measurable without knowing any omitted terms individually. The even integer condition is essential to this formula: putting $r=3/2$ into it is not a way to evaluate $\zeta (3)$, since the required Bernoulli number index and factorial expression here are indexed by positive integers.

Historically, Leonhard Euler announced reciprocal-square and reciprocal-fourth-power evaluations in §2 of On the sums of series of reciprocals by Leonhard Euler. That paper was presented on 5 December 1735 and published in 1740, as the English translation's first-page note records. His §§3–8 develop a route through the sine power series and relationships between roots and coefficients. The cotangent calculation below is a concise modern presentation of the connection.^[ref]

An exponential generating function encodes a sequence using $A(z)={\sum }_{n\ge 0}{a}_n{z}^n/n!$. For labelled counting, $a_n$ is the number of structures on a fixed set of $n$ distinct labels. Labels distinguish otherwise similar objects: changing which person belongs to a group can change the structure. Recover the count by coefficient extraction as $a_n=n![z^n]A(z)$. The raw coefficient is $a_n/n!$, not $a_n$.

The factorial makes multiplication account automatically for distributing labels. To combine an $A$-structure on $k$ labels and a $B$-structure on the remaining $n-k$, choose the first label subset in $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$ ways, then choose the two structures. The binomial coefficient counts how the two groups of labels interleave within the full label set. ThusThe normalization works because $1/(k!(n-k)!)=\left(\genfrac{}{}{0ex}{}{n}{k}\right)/n!$. This explains the usefulness of exponential generating functions for labelled counting: an ordinary Cauchy product would omit the choices of labels. See Peter Magyar, Math 482, notes for 2/7, labelled product principle.

For a concrete example, there is one undecorated set on any given collection of labels. Its exponential generating function is the exponential function $E(z)=e^z={\sum }_{n\ge 0}{z}^n/n!$. Combine a red set and a blue set, allowing either to be empty:Every label independently receives one of two colours, giving $2^n$ assignments by the rule of product. With three labels, the counts by number of red labels are $1,3,3,1$, totalling eight. Choosing only the two group sizes would give the four possibilities $(0,3),(1,2),(2,1),(3,0)$; it would forget which labels are red.

Indeed, the ordinary generating function for the constant sequence $a_n=1$ is the geometric series $1/(1-z)$. Its square has coefficient $[z^n](1-z{)}^{-2}=n+1$, counting pairs of nonnegative sizes. Both encodings are correct for their respective questions. The decision is whether identity matters when objects are combined.

For unordered sets of labelled components of positive size, an exponential generating function $B(z)$ becomes $e^{B(z)}$: the term $B(z{)}^m/m!$ forgets the ordering of $m$ components. The existing rooted-tree generating function develops the richer example $T=z{e}^T$. A labelled rooted tree consists of its root of a tree and an unordered set of smaller labelled rooted trees, connecting the same label-distribution mechanism to recursive counting.

A mathematical expression combines symbols according to formation rules, such as $2x+1$, $(x+1{)}^2$, or $\sqrt{x}$. With values for its variables and meanings for its algebraic operations, it can be evaluated. An equation relates two mathematical expressions; an expression alone need not assert anything.

For example, $2x+3$ evaluates to seven at $x=2$ and nine at $x=3$. Neither value solves anything until a condition is imposed: the equation $2x+3=9$ selects $x=3$ from the real numbers. This distinction is useful when moving from a formula to a question about which inputs satisfy it. Evaluation by replacing the variables with assigned values is described in College Algebra 2e, §1.1: Evaluating Algebraic Expressions.

Different written mathematical expressions can have the same value for every input in a common domain of a function. The distributive property expands $(x+1{)}^2$ to $x^2+2x+1$, while factorizing reverses that change of form. The mathematical identity between them lets one choose the form suited to the next task: the factored form exposes a multiple root at $x=-1$, and the expanded form exposes its coefficients. Simplifying should preserve values on the stated domain, rather than silently enlarging it.

The exterior algebra of a vector space $V$ combines scalars, vectors, and higher-dimensional oriented elements in one graded algebra. In a finite-dimensional vector space it iswith multiplication given by the exterior product. Degree zero is the scalar field, degree one is $V$, and degree two is the space of bivectors. Multiplication adds degrees: combining two vectors produces a bivector, rather than another ordinary vector.^[ref]

The essential rule is $v\wedge v=0$. Repeating the same direction cannot produce a nonzero oriented area. Bilinearity then gives $u\wedge v=-v\wedge u$: expand $(u+v)\wedge (u+v)=0$ and remove the two zero self-products. The alternating rule remains part of the definition in characteristic two, where sign reversal alone would not force a self-product to vanish.

If $V={\mathbb{R}}^2$ with standard basis $e_1,e_2$, every element of its exterior algebra has the formThere are four independent coefficients: one scalar, two vector components, and one area component. In ${\mathbb{R}}^3$, the respective degree dimensions are $1,3,3,1$, giving eight components in total. More generally, the exterior power basis gives total dimension ${\sum }_{k=0}^n\left(\genfrac{}{}{0ex}{}{n}{k}\right)=2^n$.

This language is useful when direction and orientation matter together. Determinants measure the action on top-degree exterior powers; differential forms use exterior powers of a dual space to describe quantities integrated along paths, surfaces, and higher-dimensional regions. The Grassmann algebra viewpoint also makes the sign changes in anticommuting generators systematic. A single multiplication rule connects geometry and algebra.

The exterior product, also called the wedge product, combines oriented elements through the multiplicationFor two vectors, it is bilinear and alternating:These rules imply $v\wedge u=-u\wedge v$. They distinguish the exterior product from both the symmetric dot product and the unconstrained tensor product.^[ref]

In an oriented orthonormal plane, write $u=(a,b)$ and $v=(c,d)$. Expanding in its standard basis givesThe determinant $ad-bc$ is the signed area of the parallelogram formed by the two inputs. Its absolute value is the ordinary area. Reversing the input order reverses the sign; parallel inputs produce zero.

For the original example $u=(3,1)$ and $v=(1,2)$,Replacing $v$ by $v+u=(4,3)$ changes the shape but preserves the product: $3\cdot 3-1\cdot 4=5$. Both parallelograms have the same oriented area element. If $v=2u$, the exterior product is zero, since $u\wedge (2u)=2(u\wedge u)=0$.

The same rule adds directions in higher dimensions. With $w=(2,-1,1)$ and the three-dimensional inputs under bivector,Its coefficient is the oriented volume of the three-dimensional parallelepiped. Repeating or linearly depending on earlier inputs collapses the volume, giving zero.

For homogeneous elements of a graded algebra of degrees $p,q$, the general commutation rule isSwapping a bivector with another bivector therefore produces a positive sign, since $pq=4$. It is the number of individual vector swaps that controls the sign, not a rule that every pair of objects must anticommute.

A polynomial factorization expresses a polynomial as a product of other polynomials. The allowed coefficients matter: $X^2-2$ has no nonconstant factorization over the rational numbers, but factors as $(X-\sqrt{2})(X+\sqrt{2})$ over the real numbers. Difference of squares gives $X^2-Y^2=(X-Y)(X+Y)$ over any commutative ring.

For a real matrix $A\in {\mathbb{R}}^{m\times n}$ and a vector $b\in {\mathbb{R}}^m$, exactly one of the following systems has a solution:The linear inequalities here are componentwise. In the first system $z$ is nonnegative; in the second system $y$ is unrestricted in sign. The second system is a certificate that the first has no feasible point. This nonnegative-equations alternative is developed in Boyd and Vandenberghe, Convex Optimization slides, §5.34.

Build the target, or separate it. Write the columns of $A$ as $a_1,\dots ,a_n$. Then $Az={\sum }_j{z}_j{a}_j$ is a conic combination: its coefficients must be nonnegative, but need not sum to one. The obtainable targets form the finitely generated coneA solution $z$ explains how to build $b$ from those columns. A certificate $y$ instead defines a linear functional $v\mapsto y^{T}v$. The condition $A^{T}y\ge 0$ says that its dot product with every generating column is nonnegative, and hence with every point of $K$. But $y^{T}b<0$ places the target strictly on the other side of the hyperplane $y^{T}v=0$. Thus $y$ belongs to the dual cone of $K$ and rules out every allowed conic combination at once.

A certificate that can be checked by eye. Take the identity matrixHere $K$ is the nonnegative orthant. The equation $Az=b$ forces $z=(-1,1{)}^T$, violating $z\ge 0$. The certificate $y=(1,0{)}^T$ givesThe linear functional simply reads the first coordinate: all allowed column combinations have a nonnegative first coordinate, while $b$ has first coordinate $-1$. For comparison, the target $(1,1{)}^T$ is obtained with $z=(1,1{)}^T$.

Why this is useful and striking. A successful search can exhibit one feasible point; an unsuccessful search alone cannot explain why every candidate fails. Farkas' lemma guarantees an equally concrete witness of impossibility for this finite linear problem. Once $y$ is supplied, verification needs only matrix multiplication, sign tests and one dot product. The same idea gives a Farkas certificate for linear inequalities and underlies linear programming duality.

Brief geometric proof. The two systems cannot both hold, because they would implyFor existence of a certificate when $b\notin K$, closedness of finitely generated cones makes $K$ a closed convex cone, so separation from a closed convex cone supplies $y^{T}b<0$ and $y^{T}v\ge 0$ for every $v\in K$. Testing each column gives $A^{T}y\ge 0$. Concretely, let $p$ be the Euclidean projection onto a convex set of $b$ onto $K$ and set $y=p-b$. The projection inequality gives $y^T(v-p)\ge 0$ for $v\in K$. Testing $v=0$ and $v=2p$ gives $y^{T}p=0$, whence $y^{T}b=-\Vert p-b{\Vert }_2^2<0$. In the example, $p=(0,1{)}^T$ and $y=(1,0{)}^T$. Alternatively, the Fenchel-Moreau theorem applied to the cone's indicator functional proves the same separation through its polar cone.

An original historical source is Julius Farkas's ^[ref]. The linked archival record verifies the author, title and publication details.

A Fast Fourier transform is an efficient algorithm for computing the discrete Fourier transform or inverse discrete Fourier transform. The discrete Fourier transform specifies the mathematical result; a Fast Fourier transform specifies how to compute it. Different Fast Fourier transform algorithms reorganize the same finite sums, with the selected sign and normalization. The Cooley-Tukey FFT algorithm is one important family of Fast Fourier transforms, using factorization of the record length.^[ref]

For a power-of-two length, the radix-two Cooley-Tukey FFT algorithm has time complexity $O(N\log N)$ in arithmetic operations, compared with $O(N^2)$ for evaluating every sum independently; these are Big O notation growth rates rather than machine timings. It returns the same eight coefficients $(8,4,-2i,0,0,0,2i,4)$ in the example. In exact arithmetic this reorganization introduces no approximation; actual implementations still incur roundoff error.

Build this finite field by taking a quotient ring of a polynomial ring:The polynomial $f(t)=t^2+t+1$ has $f(0)=f(1)=1$ in the prime field ${\mathbb{F}}_2$. A polynomial of polynomial degree two is an irreducible polynomial exactly when it has no polynomial root in the coefficient field. Thus the quotient by an irreducible polynomial is a field construction applies. Its elements have unique representatives $a+b\alpha$, with $a,b\in {\mathbb{F}}_2$: precisely $0,1,\alpha ,\alpha +1$.

The defining relation is ${\alpha }^2+\alpha +1=0$. Since this finite field has characteristic two, every element equals its additive inverse, and the relation becomes ${\alpha }^2=\alpha +1$. Addition acts separately on the two coefficients:All coefficient calculations use modular arithmetic modulo two. For example, $(\alpha +1)+\alpha =1$ and $(\alpha +1)+(\alpha +1)=0$. Encoding $a+b\alpha$ as the pair of bits $(b,a)$ gives $0\leftrightarrow 00$, $1\leftrightarrow 01$, $\alpha \leftrightarrow 10$, and $\alpha +1\leftrightarrow 11$; addition is bitwise exclusive or. These are coordinates in the basis $1,\alpha$, so the label $10$ does not make $\alpha$ the element $1+1$.

For multiplication, expand using the distributive property and replace every ${\alpha }^2$ by $\alpha +1$:For example, $\alpha (\alpha +1)={\alpha }^2+\alpha =1$, while $(\alpha +1{)}^2={\alpha }^2+1=\alpha$. The following complete tables are computed from the coefficient rules. Colors identify results, rather than their numerical sizes. Every row of the addition table lists all four elements, and every nonzero row of the multiplication table does too: adding an element, or multiplying by a nonzero element, can be undone.

The nonzero multiplicative inverses are $1^{-1}=1$, ${\alpha }^{-1}=\alpha +1$, and $(\alpha +1{)}^{-1}=\alpha$. Consequently the equation $\alpha x=\alpha +1$ has the unique solution $x=(\alpha +1{)}^2=\alpha$. Repeated multiplication gives ${\alpha }^0=1$, ${\alpha }^1=\alpha$, ${\alpha }^2=\alpha +1$, and ${\alpha }^3=1$. They cycle through every element of the multiplicative group of a finite field.

Compare the ring $\mathbb{Z}/4\mathbb{Z}$, also with four elements. Its addition satisfies $1+1=2\ne 0$, and its multiplication satisfies $2^2=0$. Thus $2$ is a zero divisor, with no multiplicative inverse, and this ring is not a field. Multiplying by $2$ collapses different inputs to the same output: both $0$ and $2$ give $0$, while both $1$ and $3$ give $2$. In the field with four elements, multiplying by $\alpha$ instead rotates the three nonzero elements, preserving their distinctness. The figure makes visible why counting four elements alone does not specify their arithmetic.

Consider the Poisson equation on an interval with homogeneous Dirichlet boundary conditions:Two integrations and the endpoint conditions give the exact solution $u(x)=x(1-x)/2$. To approximate it, multiply by a test function $v$ that vanishes at both endpoints. Integration by parts givesThe boundary term is zero. Thus the weak formulation is to find $u\in V=H_0^1(0,1)$ such thatThe zero-trace Sobolev space $H_0^1(0,1)$ consists of square-integrable functions with square-integrable weak derivatives and zero endpoint values in their continuous representatives; it does not require a classical second derivative. This is why continuous piecewise linear functions are admissible despite corners. The Poincaré inequality makes $a$ a coercive bilinear form on $V$. Strang derives this one-dimensional weak formulation, the piecewise-linear hat functions, and their load and derivative-product integrals in the cited lecture; its endpoint example uses a free left endpoint, while both endpoints here are fixed.^[ref]

Take the uniform finite element mesh $x_j=jh$, $j=0,\dots ,n$, with $h=1/n$. The continuous $P_1$ trial space isHere $P_1$ means polynomials of degree at most one on each interval. This is a conforming finite element space in $V$, with $n-1$ interior piecewise-linear hat functions ${\varphi }_i$ as a basis. Their endpoint values enforce the Dirichlet boundary conditions automatically. Set $u_h={\sum }_{i=1}^{n-1}{c}_i{\varphi }_i$ and test the weak formulation against each ${\varphi }_i$:Each interior hat has two slopes $1/h$ and $-1/h$, each over a length $h$. Its squared derivative therefore integrates to $2/h$. Adjacent hats have opposite slopes on their one shared interval, giving $-1/h$. All other derivative products vanish. The stiffness matrix is the tridiagonal matrixThe load $F_i=h$ is the area of a triangle of base $2h$ and height one, including hats next to the boundary. Boundary hats are omitted because the boundary values are prescribed. The piecewise-linear hat function article explains how the same entries arise by adding local two-node contributions.

With four mesh intervals, $h=1/4$, there are three unknowns:For example, the first row gives $8(3/32)-4(1/8)=1/4$ and the middle gives $-4(3/32)+8(1/8)-4(3/32)=1/4$. The coefficients are the nodal values $u_h(x_i)=c_i$. At $x=3/8$, linear interpolation gives $u_h(3/8)=7/64=0.109375$, whereas $u(3/8)=15/128=0.1171875$: exactness at the nodes still leaves a visible error between them.

In this model the Galerkin method solution equals the nodal approximation $I_{h}u$ obtained by linear interpolation on any finite element mesh. Indeed, on each interval $[a,b]$, $(I_{h}u{)}^{\prime }$ is the average of $u^{\prime }$ and $v_h^{\prime }$ is constant. Therefore ${\int }_a^b(u^{\prime }-(I_{h}u{)}^{\prime })v_h^{\prime }dx=0$. Summing proves Galerkin orthogonality for $I_{h}u$, and uniqueness gives $u_h=I_{h}u$. This argument relies on the constant diffusion coefficient, conformity and exact integration; nodal exactness is not a general promise for finite element methods with other operators or integration rules.

On a uniform mesh, direct subtraction of the chord from the parabola gives, on every element $[a,b]$ of length $h$,The largest value error is at an element midpoint. Its size and the energy norm error are exactlyThus $h=1/4$ gives $\Vert e{\Vert }_{\infty }=1/128=0.0078125$ and $\Vert e{\Vert }_a=1/(4\sqrt{12})\approx 0.0721688$. With eight elements, $h=1/8$, these become $1/512=0.001953125$ and $1/(8\sqrt{12})\approx 0.0360844$. Halving the mesh spacing quarters the maximum value error but only halves the energy norm error: values and slopes converge at different rates. The figure shows the small value error at its own scale, where the four-to-one reduction becomes clear.

A finite field is a field with finitely many elements: addition, subtraction, multiplication, and division by a nonzero element all stay inside a finite collection. Write ${\mathbb{F}}_q$, or $\mathrm{GF}(q)$, for a finite field with $q$ elements. The subscript counts elements; it does not prescribe modular arithmetic modulo $q$. The field with four elements is the smallest example where that distinction matters.

Every finite field has size $q=p^n$, where $p$ is a prime number and $n$ is a positive integer. To see the counting mechanism, use its prime field ${\mathbb{F}}_p$: the finite field is a finite-dimensional vector space over ${\mathbb{F}}_p$. For a basis $e_1,\dots ,e_n$, every element has exactly one expressionEach coefficient has $p$ choices, so there are $p^n$ expressions. Here $p$ is the characteristic of a field and $n$ is the dimension of a vector space. Thus sizes $4,8,9,16,25$ are possible, whereas $6,10,12$ are not prime powers and cannot be finite field sizes.

Conversely, every prime power occurs, and any two finite fields of the same size admit a field isomorphism. These are classification statements, beyond the counting argument. See Conrad's Theorems 1.5, 2.2, and 2.7.^[ref] Uniqueness means the arithmetic agrees after relabeling; it does not choose a basis, an irreducible polynomial for a quotient ring representation, or a particular field isomorphism. Even for the field with four elements, exchanging $\alpha$ and $\alpha +1$ preserves the arithmetic.

The appeal for coding theory is exact, finite arithmetic with reliable division: polynomial interpolation and linear algebra work over a finite alphabet. A Reed-Solomon code represents messages by polynomials and adds redundancy by evaluating them at several distinct finite field elements. Forney's MIT notes develop this arithmetic as preparation for such error-correcting codes.^[ref] In cryptography, finite fields likewise supply exact arithmetic on finitely many symbols, with operations that can be implemented using bits.

Historically, Évariste Galois published work on finite fields beyond prime fields in 1830, constructing them by adjoining elements satisfying irreducible polynomials over prime fields. Conrad's historical account also records E. H. Moore's 1893 terminology, from which the name Galois field and notation $\mathrm{GF}(q)$ descend.^[ref]

The generalized Leibniz rule extends composition of differential operators to all integer $n$. Define $\left(\genfrac{}{}{0ex}{}{n}{r}\right)=n(n-1)\cdots (n-r+1)/r!$. For nonnegative $n$ the sum stops at $r=n$. For $n=-s<0$, its coefficients are $(-1{)}^r(\genfrac{}{}{0ex}{}{s+r-1}{r})$; in particular ${\partial }^{-1}f=f{\partial }^{-1}-f^{\prime }{\partial }^{-2}+f^{\prime \prime }{\partial }^{-3}-\cdots$. Applying $\partial$ on the left cancels consecutive derivative terms and recovers multiplication by $f$, which explains the inverse expansion.

A formal pseudodifferential operator is a series in integer powers of $\partial =d/dx$, bounded above but possibly infinite towards negative powers. Its coefficients are smooth functions. Multiplication uses the formal pseudodifferential composition rule. Negative powers are formal inverses, not globally defined integration operators on all smooth functions. Every coefficient in a product is a finite sum, so multiplication is defined without analytic convergence.

The formal residue is the coefficient of ${\partial }^{-1}$ after coefficients have been moved to the left by the formal pseudodifferential composition rule. It is not an analytic residue at a point. For scalar coefficients, the residue of a commutator is a total derivative; integrating it with vanishing boundary terms produces the cyclic Adler trace.

Treat $k$ as a formal spectral parameter near infinity. If $P={\sum }_{j\ge 0}{g}_j{\partial }^{\alpha -j}$, the formal pseudodifferential composition rule gives $Pw=k^{\alpha +\beta }{e}^{kx}{\sum }_{s\ge 0}{k}^{-s}{\sum }_{i+j+r=s}{g}_j\left(\genfrac{}{}{0ex}{}{\alpha -j}{r}\right)w_i^{(r)}$. Each coefficient contains finitely many terms. This describes a formal module action, not a claim that the infinite series converges at finite $k$.

François Viète worked on algebraic notation and relations between polynomial roots and coefficients.^[ref]

A Gaussian binomial coefficient refines an ordinary binomial coefficient into a polynomial that remembers a size statistic. For nonnegative integers $n$ and $0\le k\le n$, writeThe product represents a polynomial; it is not an instruction to divide by zero when $t=1$ or a denominator vanishes. The Gaussian binomial coefficient recurrence gives a way to compute it with only addition and multiplication. The empty product for $k=0$ is one, and $G_{n,n}(t)=1$ as well. Setting $t=1$ after obtaining the polynomial recovers $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$.

For example,At $t=1$ this gives six objects, but its coefficients reveal how those six objects are distributed across sizes $0,1,2,3,4$: there are two of size two and one of each other size. The lattice-path interpretation of Gaussian binomial coefficients makes that information visible. Take unit steps north or east from $(0,0)$ to $(2,2)$. A north step at horizontal coordinate $x$ contributes $x$ shaded cells to its left. The six step words have total shaded areas $0,1,2,2,3,4$.

This is useful because an aggregate count can hide the feature one actually wants. A generating function retains the distribution of a statistic, so coefficient extraction answers questions such as “how many allowed diagrams contain exactly two cells?” The partition interpretation of Gaussian binomial coefficients makes every coefficient a nonnegative integer without relying on cancellation in the product formula.

An unexpected second use comes from linear algebra. If $q$ is a prime power, the value $G_{n,k}(q)$ counts the $k$-dimensional vector subspaces of ${\mathbb{F}}_q^n$. Thus the same expression that counts six paths at $t=1$ counts 35 two-dimensional subspaces of ${\mathbb{F}}_2^4$ at $t=2$. The Gaussian binomial coefficient counts finite-field subspaces article explains why selecting a vector subspace differs from selecting a subset of coordinates. ^[ref]

This relationship illustrates a q-analogue: the parameter can encode a statistic in one interpretation and the size of a finite field in another. Here $t$ denotes the formal variable, while $q$ denotes a finite field's cardinality when we evaluate the polynomial. The interpretation using a finite field requires $q$ to be a prime power; evaluating the polynomial at an arbitrary number does not construct a field of that size.

For $n\ge 1$ and $1\le k\le n$, the displayed recurrence relation uses $G_{n,0}(t)=1$ and $G_{n,k}(t)=0$ when $k<0$ or $k>n$. At $t=1$ it becomes Pascal's identity.

An exact weighted-subset formula isThe exponent measures how far the selected positions lie beyond the earliest possible choices $0,\dots ,k-1$. Split the subsets according to whether they contain $n-1$. Those without it give $G_{n-1,k}(t)$; deleting it from those with it removes exactly $n-k$ from their exponent. This gives the displayed recurrence relation, explaining why it builds polynomials with nonnegative integer coefficients.