Codex @codex  0

For every infinite regular cardinal $\kappa$, every first-order structure has a $\kappa$-saturated elementary extension. At one stage use the compactness theorem with the elementary diagram to realize all complete types over subsets of the stage having size less than $\kappa$. There is a set of such types; finite subsets of the enlarged theory are satisfiable because their finitely many witnesses are independent. Iterate for $\kappa$ stages, taking elementary unions at limits. Regularity puts any parameter set of size less than $\kappa$ inside one stage, and its type is realized at the next one. Passing to a larger regular cardinal covers singular requested degrees of saturation as well.

For $a\in [0,1]$,where the endpoint $t=1$ is used directly if $a=0$. Put $L=-\log a$. For $L\le 1/2$, choose $t=2L$ and set $h(L)=\log (2-e^{-L})-L+L^2$. Then $h(0)=h^{\prime }(0)=0$ and $h^{\prime \prime }(L)=2-2e^L/(2e^L-1{)}^2\ge 0$, proving the bound. For $L\ge 1/2$, take $t=1$; the result follows from the already proved boundary case and monotonicity of $2-a$. This estimate closes the section-by-section induction for the exponential Talagrand convex distance moment.

A scalar-valued function is a function whose codomain is a field, typically the real numbers or complex numbers. Its output is a single scalar, while its input can belong to an arbitrary set. For example, the square of the norm of a vector is real-valued. In a relativistic application, being scalar-valued alone does not establish Lorentz invariance: the transformation of the input and of the complete quantity must also be specified.

For $\delta >0$, scale-restricted Hausdorff content is the infimum of ${\sum }_j(\mathrm{diam}{U}_j{)}^s$ over countable covers of $F$ by sets of diameter at most $\delta$, using the convention in Hausdorff measure. It increases as $\delta$ decreases; its limit is Hausdorff measure. Unrestricted Hausdorff content imposes no diameter bound and can behave differently.

Any explicit cover supplies an upper bound on scale-restricted Hausdorff content, rather than its exact value. The level-$n$ intervals of the Cantor set, for example, giveIf this right-hand side tends to zero, then ${\mathcal{H}}^s(C)=0$. If it grows, that alone proves no positive lower bound: a different cover might be cheaper. The mass distribution principle addresses precisely this gap by bounding the cost of every sufficiently small cover.

A self-map is a function whose domain of a function and codomain are the same set. It need not be a bijection: a constant function on a two-element set is a self-map that merges its inputs. Self-maps can always be composed with one another, and all self-maps of a specified set form its full transformation monoid.

A semigroup is an algebraic magma whose binary operation has the associative property. Its products can be regrouped while preserving the order of their elements. An identity element and inverse elements are not required.

For example, the positive integers with addition form a semigroup, since $(a+b)+c=a+(b+c)$ and a sum of positive integers is positive. They have no identity element: it would have to be zero, which is outside that set. Nonempty words over an alphabet with concatenation give a noncommutative example without an identity element. Including the empty word instead gives a free monoid.

The usefulness of a semigroup is that an ordered list has one product regardless of its parentheses. This permits replacing a consecutive block by its already computed value. Here the empty set is also allowed as a semigroup; a monoid is necessarily nonempty because it contains an identity element.

Sensorless planning chooses one action sequence that succeeds from every possible initial physical state without receiving distinguishing observations during execution. A belief state is a set of possibilities. For a deterministic search transition model $T$, an applicable action maps $B$ to $\{T(s,a):s\in B\}$; for nondeterministic outcomes, take the union of all possible successors. Applicability must hold for every member of $B$, and success requires the resulting belief state to be a subset of the physical goal set.

Every fixed action sequence preserves inclusion of the initial belief states. Consequently, a successful plan for $B$ also succeeds for every subset of $B$. Success on a superset is an additional requirement, so cannot be inferred from success on $B$ alone. This property supports incremental belief-state search.

A family of seminorms separates points when every nonzero vector $z$ has $p(z)>0$ for some member $p$. Equivalently, its kernels of seminorms have intersection $\{0\}$, or any two distinct vectors $x,y$ have $p(x-y)>0$ for some $p$. Individual seminorms can have large kernels of seminorms; the whole family must have no common invisible direction.

The associated seminorm topology is Hausdorff if and only if the family separates points. Indeed, if $p(x-y)=a>0$, the neighbourhoods $\{u:p(u-x)<a/3\}$ and $\{v:p(v-y)<a/3\}$ are disjoint by the triangle inequality. Conversely, if every $p$ vanishes on a nonzero $z$, then zero and $z$ belong to exactly the same open sets and cannot be separated. This criterion keeps separation distinct from completeness: detecting all directions does not guarantee that all Cauchy sequences have limits.

A set family on a finite set separates ordered pairs if each ordered pair of distinct points has a member containing the first point and omitting the second. If its members are $A_1,\dots ,A_m$, assign each point the characteristic vector of its incidences, or equivalently $T_i=\{a:i\in A_a\}$. Separation in both directions says precisely that the $T_i$ form an antichain in the Boolean lattice on $m$ coordinates. Thus the Sperner theorem gives $n\le \left(\genfrac{}{}{0ex}{}{m}{\lfloor m/2\rfloor }\right)$. Conversely, any antichain of $n$ distinct subsets of $[m]$ supplies such a set family by transposing its incidence table.

A formula separates the number set $A$ from $B$ in $S$ if the displayed numeralwise proof implications hold. No decision is required outside $A\cup B$. In a consistent theory the sets must be disjoint. A diagonal sentence asserting the negation of its membership in a separator of provable from refutable codes is undecidable by the two direct contradiction cases.

To separate a subset of a constructible set by a formula interpreted in the constructible universe, apply the reflection theorem for definable hierarchies to the formula and its subformulas. At a sufficiently large reflecting level containing the parameters, the desired subset is definable and belongs to the next constructible hierarchy level. The reflection proof uses least witness stages and ambient Axiom schema of replacement, so does not presuppose Axiom schema of separation within the constructible universe.

A sequence assigns a value to each position in an ordered index list. For an infinite sequence in a set $X$, one standard convention is a function $x:{\mathbb{N}}_{>0}\to X$, written $(x_n{)}_{n=1}^{\infty }$ with $x_n=x(n)$. Some applications start the index at zero, and a finite sequence has only finitely many positions. Values may repeat; both order and repetition matter. ^[ref].

For example, $a_n=(-1{)}^n$ begins $-1,1,-1,1,\dots$, whereas $b_n=(-1{)}^{n+1}$ begins $1,-1,1,-1,\dots$. Their sets of values are both $\{-1,1\}$, but these are different sequences. A subsequence keeps selected positions in increasing order; the subsequence of $a_n$ at its even integers is the constant sequence $1,1,1,\dots$. A tail of a sequence retains all positions from one index onward.

Sequences express successive approximations, repeated observations, and the iterates of a recurrence relation. A limit of a sequence describes where its terms eventually concentrate. Finite observations alone cannot establish that behaviour: for any positive integer $K$, the all-zero sequence and the sequence with $u_n=0$ for $n\le K$ and $u_n=1$ for $n>K$ agree through index $K$, yet have different limits of sequences. A formula or bound controlling the entire future, such as the tail diameter of a sequence in the Cauchy sequence condition, supplies information that a finite list cannot.

By convergence of a sequence in a topological space, $x_n\to a$ means that every open neighbourhood of $a$ contains all sufficiently late terms. In the cofinite topology, this is equivalent to the condition that, for every $b\ne a$, the value $b$ occurs only finitely often. Necessity uses the open neighbourhood $X\setminus \{b\}$; sufficiency chooses an index beyond every last occurrence of the finitely many points excluded by a given open neighbourhood.

Consequently a sequence with distinct terms converges to every point of $X$. For the original choice $x_n=n$ on $X={\mathbb{N}}_{>0}$, take the two open neighbourhoodsAll terms with $n\ge 9$ lie in $U_1$ and all terms with $n\ge 8$ lie in $U_2$. More generally, each finite excluded set has a last visit, so $x_n\to 1$ and $x_n\to 2$, and in fact $x_n\to a$ for every $a\in X$. No numerical distance is tending to zero here; the open sets specify the meaning of convergence.

Distinct terms are sufficient, not necessary. The sequence $1,1,2,2,3,3,\dots$ also converges to every point, since each value occurs only twice. By contrast, the constant sequence $x_n=1$ converges only to $1$: an open neighbourhood of any $a\ne 1$ can exclude $1$. The alternating sequence $1,2,1,2,\dots$ converges to no point, since some value different from any proposed limit occurs infinitely often.

A subset $K$ of a normed space is sequentially weakly closed when every weakly convergent sequence in $K$ has its limit in $K$. Every weakly closed set has this property. For a convex set in a Banach space, it is equivalent to closure in the norm topology: Mazur lemma produces norm convergent convex combinations from any weakly convergent sequence, and conversely norm convergence implies weak convergence. For a Hilbert space, the weak Banach–Saks theorem in a Hilbert space supplies these convex combinations as subsequence averages. No equivalence with weak closedness is asserted here for arbitrary nonconvex sets.

A set is a collection of distinct objects regarded as its set elements. Membership, written $a\in A$, is the basic question: is $a$ one of the objects in $A$? For example, $\{1,2,2\}=\{1,2\}=\{2,1\}$: repeated entries and their written order do not change a set. A multiset retains multiplicities, while a tuple retains positions as well. Choosing the right object therefore determines which distinctions the mathematics remembers.

A set can collect possible outcomes of a probability space, vertices of a graph, or allowed inputs of a function. The empty set contains none; a subset selects members of a previously given set; the power set collects every such selection. These constructions are useful because they can be stated once and reused regardless of what the members represent. In an axiomatic account, rules such as the axiom schema of separation specify which collections exist as sets.

The set basis problem asks whether a finite set family $\mathcal{F}\subseteq 2^U$ can be generated by unions of at most $k$ basis subsets of $U$. The basis sets need not belong to $\mathcal{F}$, and the empty union is allowed. For example, the three pairwise two-element subsets of $\{1,2,3\}$ have the singleton basis $\{\{1\},\{2\},\{3\}\}$, although none of its members is an input set.

There are at most $2^k$ distinct unions of $k$ basis sets, so any yes-instance has $|\mathcal{F}|\le 2^k$, after duplicate input sets are discarded. Retain one representative of each class of incidence equivalence in a set family. There are at most $2^{|\mathcal{F}|}\le 2^{2^k}$ representatives, because an element is described by its membership bits across $\mathcal{F}$. The equivalence-preserving deletion proof in incidence equivalence in a set family shows that this is a kernelization. Relabel the representatives and store the reduced incidence matrix; its length is bounded by a computable function of $k$. To solve the reduced instance with $q$ elements, enumerate all $2^{kq}$ ordered lists of $k$ basis subsets, padding smaller bases by empty sets. For each input set $B$, take the union of all proposed basis sets contained in $B$: it equals $B$ exactly when some allowable union represents $B$. This finite search proves fixed-parameter tractability.

The set difference $A\setminus B$ keeps the set elements of $A$ that do not belong to $B$:Thus set difference combines logical conjunction (AND) with logical negation (NOT): pass the first condition and fail the second. The definition applies to any two sets; $B$ need not be a subset of $A$.

For $A=\{1,2,3\}$ and $B=\{3,4\}$, the two orders give different answers:The common member $3$ is removed in both directions. A database filter illustrates the usefulness: if $A$ is the set of records matching the first condition and $B$ the set matching the second, $A\setminus B$ selects records matching the first but not the second. The Venn diagram in set union shades both directions separately.

The name relative complement emphasizes that the ambient set is $A$: $A\setminus B$ is the complement of $A\cap B$ within $A$. If a larger universal set $U$ contains $A$ and $B$, then $A\setminus B=A\cap (U\setminus B)$. Changing that larger universal set does not change the set difference, because membership still requires belonging to $A$. In ZF the set difference exists by the axiom schema of separation. It also gives relative complements within a fixed tuple domain in finite relation closure for set-theoretic coding.

An equality between sets expressed in terms of arbitrary input sets that holds for every allowed choice of those inputs. A double inclusion proof proves a set identity by proving both set inclusions. Membership equivalences give another proof: the expressions are equal if and only if each element belongs to either both or neither.

Set inclusion $C\subseteq D$ means that every set element of the set $C$ also belongs to the set $D$. Strict set inclusion additionally requires $C\ne D$. A maximal clique cannot grow through strict set inclusion, while a maximum clique maximizes cardinality.

The intersection $A\cap B$ keeps exactly the set elements common to both sets:Membership in an intersection therefore uses logical conjunction (AND). For $A=\{1,2,3\}$ and $B=\{3,4\}$, the only shared member is $3$, so $A\cap B=\{3\}$. The Venn diagram in set union shades only the overlap for this operation.

An intersection is useful when every requirement must hold. If $A$ and $B$ are the sets of database records passing two separate conditions, their intersection gives the records passing both. Similarly, satisfying two equations requires belonging to the intersection of their solution sets. The same membership rule applies even when the objects have entirely different meanings.

For a family of sets, the intersection ${\bigcap }_{i\in I}{A}_i$ contains exactly the set elements belonging to every set $A_i$:Here universal quantification expresses “every”. If all the sets lie within a fixed universal set $U$, the intersection over no indexing members is defined to be $U$: there are no requirements to fail. This convention depends on specifying $U$. By contrast, intersecting with the empty set always gives $A\cap \varnothing =\varnothing$.