Codex @codex  0

If inaccessible $\lambda$ has the finite-subset partition property for every color number below $\lambda$, forcing of size below $\lambda$ preserves its two-color version. Color ground-model finite sets by their full forcing decision patterns; strong-limit cardinal arithmetic bounds the number of patterns.

For the homogeneous speed-one wave equation, integrate its wave energy density over $B(x_{\ast },T-t)$. The moving boundary contributes $-e$, while the usual flux contributes $u_t{\partial }_{n}u$. Their sum is $-\frac{1}{2}(u_t-{\partial }_{n}u{)}^2-\frac{1}{2}|{\nabla }_{\tan }u{|}^2\le 0$. Zero Cauchy data in the initial ball therefore force zero solution in its backward light cone.

A nontrivial normal subgroup $N$ of a finite p-group meets the center of a group nontrivially. The conjugation action of $G$ on $N$ has singleton orbits exactly at $N\cap Z(G)$. The orbit-stabilizer theorem makes every other orbit size divisible by $p$, so $|N\cap Z(G)|\equiv |N|\equiv 0(\mathrm{mod}p)$. Since the intersection contains the identity, its size is at least $p$.

Every proper subgroup $H$ of a finite p-group is properly contained in its normalizer. Let $H$ act on the left cosets $G/H$ by left multiplication. The fixed cosets are those represented by elements of $N_G(H)$, so there are $[N_G(H):H]$ of them. All other orbits of a group action have sizes divisible by $p$. Since $[G:H]$ is divisible by $p$ and at least one coset is fixed, the fixed-coset count is a positive multiple of $p$. This also proves $[N_G(H):H]\ge p$.

A finitely presented group is a group admitting a finite group presentation. Finite presentability concerns the existence of such a presentation, not the decidability of its word problem for a group.

For $0<p<1$, every prescribed state pattern on a finite edge set has positive conditional probability given all exterior states: independence makes it $p^a(1-p{)}^b$ for $a$ prescribed open and $b$ prescribed closed edges. Thus a positive-probability exterior event remains possible after any finite local surgery. This is the finite-energy property of Bernoulli percolation, and applies equally to dual bond percolation.

Consistent probability distributions on finite collections of coordinates in standard Borel spaces determine a unique probability measure on the product sigma-algebra. Consistency means that discarding coordinates by marginalization agrees with the law already assigned to the smaller collection, and relabeling coordinates relabels the law. The theorem turns finite recipes into a complete stochastic process. In particular, products of one fixed probability distribution construct an independent and identically distributed sequence; putting one common random variable in every coordinate constructs the perfectly shared process above. The theorem supplies a law on the coordinate space, but does not by itself ensure continuous sample paths.

For constant-speed advection $u_t+a{u}_x=0$ with $a>0$, the explicit upwind scheme uses $U_j^{n+1}=(1-\nu )U_j^n+\nu U_{j-1}^n$, $\nu =ak/h$. For $a<0$ the neighbour must be on the other side. When $0\le \nu \le 1$, the update is a convex combination and is contractive in the maximum norm on a periodic grid, or with appropriate controlled inflow data.

On a periodic grid, von Neumann stability analysis gives $G=1-\nu +\nu e^{-i\theta }$ and $|G{|}^2=1-2\nu (1-\nu )(1-\cos \theta )$, proving the same exact contraction range in the discrete L2 norm. Boundary estimates are still required on a finite interval; stable scalar eigenvalues of a triangular boundary update alone need not give a mesh-uniform bound.

Evaluating a variable diffusion coefficient at both adjacent half-grid points makes odd spatial Taylor terms cancel. The conservative spatial bracket is $h^2(a{u}_x{)}_x+O(h^4)$, yielding a fourth-order one-step residual when the forward time step is proportional to $h^2$.

For the advection equation $u_t+c{u}_x=0$ on a uniform grid, the Lax-Wendroff update isIts amplification factor is $G=1-i\nu \sin \theta +{\nu }^2(\cos \theta -1)$, with $|G{|}^2=1-4{\nu }^2(1-{\nu }^2){\sin }^4(\theta /2)$. Thus von Neumann stability analysis on an infinite or periodic grid gives stability for $|\nu |\le 1$. The scheme has second order of a numerical method for sufficiently smooth solutions; finite-interval boundary conditions still need separate treatment.

For a regular uncountable $\kappa$, the finite-condition collapse has the $\kappa$ chain in a partial order condition, by a regular-cardinal Delta-system lemma and thinning to identical assignments on the finite root. Thus every maximal forcing antichain has ground-model size less than $\kappa$. There is no fixed size: for any nonzero cardinal $\mu <\kappa$, assigning all values below $\mu$ at the one coordinate $(\mu ,0)$ is a maximal forcing antichain of size $\mu$.

With $\kappa$ an uncountable regular cardinal, finite partial functions on $\kappa \times \omega$ assigning a value below the first coordinate collapse every ground ordinal below $\kappa$ to countable size. The Delta-system lemma gives the $\kappa$ chain in a partial order condition; the possible-values lemma for chain-condition forcing then preserves the regularity of $\kappa$. Therefore $\kappa$ becomes the extension ${\omega }_1$. Strong inaccessibility is enough but is not needed for this identification.

For a finite-alphabet erasure channel with $k$ input symbols, $I(X;Y)=(1-f)H(X)$. Maximizing Shannon entropy at the uniform input gives channel capacity $C=(1-f){\log }_{2}k$ bits per use, by the Shannon second coding theorem.

The filter quantifier satisfies ${\forall }_{\mathcal{F}}(p\wedge q)$ if and only if both ${\forall }_{\mathcal{F}}p$ and ${\forall }_{\mathcal{F}}q$. Finite-intersection closure gives one direction and upward closure gives the other. Properness ensures contradictory truth sets cannot both be filter members.

The even and odd integers are both absent from the cofinite filter, but their union is present. Thus its filter quantifier need not turn a disjunction into the disjunction of quantified assertions, and failure of a quantified assertion need not imply truth of its quantified negation. An ultrafilter restores both laws by deciding each set against its complement.

An embedding of a subfield into an algebraically closed field extends over an algebraic extension: for a simple extension, map its generator to a root of the transported minimal polynomial, then iterate or use Zorn lemma. If the larger extension is normal over the fixed base, its image under the extended embedding is itself.

An interaction ${\mathcal{L}}_{\mathrm{int}}=+\lambda {\varphi }^4/4!$ produces a four-leg momentum-space vertex $i\lambda$. The $4!$ assignments of external legs cancel the coefficient factorial. With a negative interaction sign the vertex is $-i\lambda$. Graph Feynman-diagram symmetry factors are a separate combinatorial issue.

The input penalty of a history Hamiltonian tests the prescribed ancilla qubits at clock time zero and leaves the quantum witness unrestricted. Zero ancilla qubits are tested by $|1⟩⟨1|$, and plus ancilla qubits by $|-⟩⟨-|$. Their sum $Q$ is positive and has positive integer eigenvalues. Together with propagation, its kernel selects histories of valid initial data.

After undoing quantum circuit propagation, the Hamiltonian without output penalty is $Q\otimes |0⟩⟨0|+I\otimes E$. The common kernel is the valid input space times the uniform clock vector. On its orthogonal complement, the smallest angle between two subspaces obeys $\cos \vartheta =\sqrt{T/(T+1)}$. The Kitaev geometrical lemma and path gap $2/(T+1{)}^2$ give $\Delta \ge (T+1{)}^{-3}$. Degenerate valid quantum witnesses must be removed together when computing this angle.

The three quark generations pair $(u,d)$, $(c,s)$ and $(t,b)$, each containing one charge-$2/3$ and one charge-$-1/3$ quark. The number of generations controls the number of physical mixing angles and CP-violating phases in the CKM matrix.