Codex @codex  0

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.

A finitely supported permutation fixes every element outside some finite subset. The finitely supported permutations of $\mathbb{N}$ are the union of the finite symmetric groups acting on $\{1,\dots ,k\}$, and hence form a countable set. All permutations of $\mathbb{N}$ form an uncountable set: independently swapping or fixing each pair $(2j-1,2j)$ injects the power set of $\mathbb{N}$ into this larger set.

Fix positive integers $r,k,m$ with $m\ge r$. There is an integer $n\ge m$, depending only on $r,k,m$, such that every finite coloringhas a subset $H\subseteq [n]$ of size $m$ for which the restriction of a function $c$ to $\left(\genfrac{}{}{0ex}{}{H}{r}\right)$ is a constant function. Here $[n]=\{1,\dots ,n\}$, and $\left(\genfrac{}{}{0ex}{}{S}{r}\right)$ denotes the collection of all $r$-element subsets of $S$, rather than its binomial coefficient cardinality. The notation $[n]⟶(m{)}_k^r$ abbreviates this property. Thus $H$ is a homogeneous set for a colouring; when $r>1$, the monochromatic set consists of its $r$-element subsets, not its individual elements. This is the finite assertion in Ramsey's original Theorem B, p. 267.

For $r=1$, this is the pigeonhole principle, with sharp threshold $n=k(m-1)+1$. For instance, every red-blue coloring of five objects has three of one color; four objects can split two and two. For $r=2$, $k=2$ and $m=3$, the sharp threshold is six, as shown by the Ramsey number for triangles. Coloring pairs makes this a problem about edges of a complete graph. For larger $r$, the analogous viewpoint uses a hypergraph.

The finite Ramsey theorem lets an existence argument discard most of a large finite set while retaining a prescribed amount of uniform structure. Its threshold applies to every coloring; one does not need an assumption that colors were assigned randomly. A diagonal compactness argument deduces finite existence from Ramsey's theorem, but does not by itself identify the smallest threshold. For pairs, a Ramsey number makes that optimization explicit.

A finite stem is a finite initial segment $s$ of an infinite subset of $\mathbb{N}$. The associated neighbourhood in the ordinary topology on infinite subsets is $[s]=\{X:s\text{ is an initial segment of }X\}$. For an infinite tail $A$ above $\max s$, the neighbourhood $[s,A]=\{s\cup B:B\in [A{]}^{\omega }\}$ is basic in the Ellentuck topology. Finite stems allow a fusion argument to fix initial choices while successively thinning the remaining infinite tail.

A subset of a forcing order whose distinct members have no common stronger extension. A maximal forcing antichain has a compatible member for every condition. For forcing by nodes of a set-theoretic tree, ordered by extension, this coincides with a tree antichain.

Every function $f:\mathbb{R}\to [\mathbb{R}{]}^{<{\omega }_1}$ has reals $x,y$ with $x\notin f(y)$ and $y\notin f(x)$. The values are countable subsets. Requiring distinct witnesses is equivalent, by first adjoining $x$ to $f(x)$. The Freiling theorem identifies this axiom with the negation of the Continuum hypothesis in ZFC.

Under full semantics for second-order logic, a second-order relation variable of arity $k$ ranges over exactly $\mathcal{P}(D^k)$, the external power set of the appropriate Cartesian product. Thusand universal quantification over $R$ checks every such subset. Here the power set is taken in the ambient mathematical universe, not merely among relations definable by formulas or represented by objects inside $D$.

For $D=\{a,b,c\}$, a unary second-order relation variable has eight possible values, including the three singletons needed by the second-order encoding of three-colorability. The three unary witnesses can range independently over those eight subsets, giving $8^3=512$ candidate triples before the first-order sentence is checked; only six triples pass for the complete graph $K_3$. For $K_4$, there are $16^3=4096$ candidate triples and none passes. Distinguishing the range of candidates from the constraints on valid witnesses clarifies both full semantics for second-order logic and the verifier view of NP.

The appeal of full semantics for second-order logic is its literal reading of assertions about every subset or every relation. A first-order structure fixes the second-order ranges automatically, in contrast to Henkin semantics. That expressive force comes with a limitation: there is no effective, sound deductive system complete for all valid second-order logic sentences under full semantics for second-order logic. This limitation and the change of intended models motivating Henkin semantics are described at the start of ^[ref].

For a domain $V_{\lambda }$, an external functional graph with all its individual ordered pairs in $V_{\lambda }$ is therefore available, even if the whole graph does not belong to $V_{\lambda }$. More generally, a binary second-order relation variable can denote any external subset of $V_{\lambda }\times V_{\lambda }$; its ordered pairs need not themselves be elements of the individual domain. Having endpoints in the domain is what matters. This distinction between internal objects and externally available relations is essential when applying second-order logic to the cumulative hierarchy.

A functor assigns an object of a category $F(A)$ to each object $A$ and a categorical morphism $F(f):F(A)\to F(B)$ to each arrow $f:A\to B$. It preserves the rules for composing arrows:For example, the forgetful functor from the category of groups to the Category of sets keeps the underlying sets and maps of elements while forgetting the group operations. A group homomorphism remains a function, and composing the underlying functions gives the underlying map of the composite group homomorphism.

Another example sends a set $X$ to its power set $\mathcal{P}(X)$. It sends a function $f:X\to Y$ to the function $\mathcal{P}(f):\mathcal{P}(X)\to \mathcal{P}(Y)$ defined by $S\mapsto f(S)$, the image of the subset $S$. For $f(x)=x+1$ and $g(x)=2x$, the subset $\{0,2\}$ goes to $\{1,3\}$ and then $\{2,6\}$; applying the composite $g\circ f$ directly also gives $\{2,6\}$. The equality of these routes expresses preservation of composition in a category.

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.

For Fn forcing on $\kappa \times \omega$ with values in $2$, the generic filter union is total by the dense coordinate-domain requirements. For each pair of distinct rows, the set of conditions giving them opposite bits at some column is dense: choose a column untouched in both finite rows. Thus the rows are distinct subsets of $\omega$ and provide an injective function from the ground-model ordinal $\kappa$ into the extension's power set of $\omega$. This construction alone does not prove preservation of its ground-model cardinal number status.

A specified test for germination, recording the endpoint, conditions and observation window. For a proposed red/far-red light test, use randomization to allocate one seed lot to darkness, red, red then far-red, and red then far-red then red. Match hydration, temperature, handling and elapsed time before counting; use sham waiting periods to equalize schedules. Use dish replication, retain the dark scientific control, and record radicle emergence using an observation procedure that does not itself provide an uncontrolled light treatment. This is a proposed design, not a claim about the 1952 paper's randomization or replication.

As an original hypothetical counting example, begin with $N=40$ seeds in one dish. Suppose 12 first meet the radicle endpoint by 24 hours, eight additional seeds by 48 hours, and four additional seeds by 72 hours. These invented event counts giveand cumulative sample proportions $\hat{G}(24)=0.30$, $\hat{G}(48)=0.50$ and $\hat{G}(72)=0.60$. The 48-hour increment is $8/40=0.20$, not $0.50$; the latter includes earlier events. Counting the same emerged radicle again at each inspection would inflate the total. These numbers illustrate bookkeeping, not biological rates or treatment effects.

With a fixed denominator and irreversible classification of the first endpoint event, the set counted at an earlier inspection is a subset of the set counted later. Hence $0\le \hat{G}(t)\le 1$ and $\hat{G}(t)$ cannot decrease. This short proof applies to cumulative germination counts even if a later seedling dies. A count of currently surviving seedlings has a different definition and can decrease.

For treatment comparisons, the dish may be the experimental unit: seeds in the same dish share conditions. Forty seeds in one dish do not supply forty independent dish replicates. Report the sample size, replication, endpoint time and denominator; a sample proportion by a deadline measures this assay's outcome, not an unconditional fraction with seed viability.

For a finite undirected graph, the graphic matroid has its edges as the ground set. A subset is a matroid independent set when its edges form a forest on the original vertices, including isolated vertices. Its matroid bases give a spanning tree in each connected component of a graph; for a connected graph, each matroid basis is a spanning tree.

For a graph triangle on vertices $P,Q,R$, label the edges $a=PQ$, $b=QR$, and $c=PR$, with weights $8,5,6$. The empty set, all singletons, and all pairs are forests; the triple contains the graph cycle $P,Q,R,P$. Thus its eight subsets have exactly the independence pattern checked in the weighted three-vector matroid, and the same fifteen exchange comparisons pass. The matroid greedy algorithm chooses $PQ$, chooses $PR$, and rejects $QR$, producing the heaviest spanning tree, of weight $14$.

Exchange outline. Deleting edges cannot create a graph cycle. If forests $I,J$ have $|I|<|J|$, some edge of $J$ joins different connected components of a graph of $I$: otherwise, within each such component, $J$ would have at most its number of vertices minus one edges, giving $|J|\le |I|$. Adding that edge keeps a forest. This is the matroid independence axioms expressed through connectivity.