Include zero when forming this set, even though a period of a function is normally required to be nonzero. For $f:\mathbb{R}\to Y$, $\mathrm{Per}(f)$ is a subgroup of the additive group of the real numbers: composing two preserving shifts adds them, and reversing a preserving shift negates it. A constant function has period group $\mathbb{R}$. A nonconstant continuous real-valued function that is periodic has period group $T_0\mathbb{Z}$, where $T_0$ is its fundamental period.

The fundamental period is the least positive period of a function, when one exists. For $f(x)=\sin (2\pi x)$ it is one; for $f(x)={\sin }^2(2\pi x)$ it is $1/2$. A periodic function need not have a fundamental period: a constant function has every positive period, and periodic function without a least positive period is a nonconstant exception. Every nonconstant real-valued function that is continuous and periodic on the real line does have a least positive period.

For a generic quadratic period-doubling cascade, the Feigenbaum constants are the limiting parameter ratio $\delta$ and spatial ratio $\alpha$. With $s_n$ the successive superstable period-$2^n$ parameters and $d_n=f_{s_n}^{2^{n-1}}(0)$ the signed central-orbit spacing,The positive convention gives $\delta \simeq 4.669201609$ and $\alpha \simeq 2.502907875$. The orientation-reversing spatial scale at the Feigenbaum renormalization fixed point is $a=-1/\alpha$.

// Target: dynamical-systems.bigb

With a fixed reference $|0⟩$, exact overlap readout on Bob's remotely prepared state distinguishes the computational basis from the diagonal basis in one use, by the displayed disjoint squared-overlap sets. This would reveal Alice's spacelike basis choice. The argument rules out even deterministic exact overlap magnitude, avoiding the additional unphysical global-phase dependence of a raw complex inner product.

An even integer $n>0$ is a perfect number if and only ifThis forces $p$ to be a prime number, as shown under Mersenne number. It does not say that every prime exponent works, nor classify possible odd integers.^[ref]

For the forward direction, put $q=2^p-1$ and use coprimality of $q$ and $2^{p-1}$. Multiplicativity of the sum-of-divisors function and the finite geometric series giveThe prime number hypothesis makes $\sigma (q)=q+1$; replacing it with a composite number changes this factor.

For a short converse outline, write $n=2^{a}m$ with $a\ge 1$ and $m$ an odd integer. The condition $\sigma (n)=2n$ givesHere $t$ is a positive integer and a proper divisor of $m$. If $t>1$, the distinct divisors $1,t,m$ alone exceed the required sum $m+t$. Thus $t=1$ and $\sigma (m)=m+1$, forcing $m$ to be prime and $m=2^{a+1}-1$.

A vertex on one side of a balanced bipartite graph is flexible if every incident edge lies in a perfect matching. The strict Hall marriage theorem inequalities for nonempty proper subsets imply flexibility of every vertex: after forcing an edge, removal of its ends loses at most one neighbour from each remaining set. If a perfect matching exists without the strict condition, choose a minimal nonempty tight set. Its induced balanced graph has the strict condition internally, and each internal matching extends using the original matching outside that set. Thus at least one flexible vertex always exists.

For dimension at least three, $[I+a{E}_{ik},I+E_{kj}]=I+a{E}_{ij}$ for distinct $i,j,k$, with $[x,y]=x^{-1}{y}^{-1}xy$. In dimension two over a field with more than three elements, choose $s$ with $s^2\ne 1$ and commute an elementary matrix with $\mathrm{diag}(s,s^{-1})$. In both cases all generating transvections lie in the commutator subgroup, so the special linear group over a finite field is perfect outside ${\mathrm{SL}}_2({\mathbb{F}}_2)$ and ${\mathrm{SL}}_2({\mathbb{F}}_3)$.

// Target: algebra.bigb

Maximum cardinality search is a graph search in which an unselected vertex's score counts its already selected graph neighbours. Repeatedly select a vertex of maximum score, breaking ties arbitrarily, and update its unselected graph neighbours. On a chordal graph, the reverse selection order is a perfect elimination ordering. On $C_4$, selecting $(a,b,c,d)$ instead yields candidate deletion order $(d,c,b,a)$; $d$'s later graph neighbours $a,c$ are not adjacent, so the clique check fails.^[ref]

A simplicial vertex is a graph vertex whose graph neighbourhood is a clique. Every isolated vertex and every leaf of a graph qualifies. In the three-triangle chordal graph, initially $a,e$ qualify, but $b$ only becomes a simplicial vertex after deleting $a$. This is a property of adjacency in a graph; a vertex of a simplicial complex is an element of a different kind of structure.

If a metal surface is $z=h(x)$ and the incident field is independent of $y$, Maxwell's equations separate into TE polarization and TM polarization. The metal condition that the tangential electric field vanish sets $E_y=0$ in the TE sector. In the TM sector $\mathbf{E}=i\nabla \times (H_y\hat{\mathbf{y}})/(\omega ϵ)$, so the same condition gives $({\partial }_z-h^{\prime }{\partial }_x)H_y=0$. This explains why the TE problem agrees with scalar Dirichlet acoustics while the TM problem has different rough-surface boundary forcing.

A bundle trivial on a twistor line has a global holomorphic bundle frame there. Comparing it with the given two patch bundle frames produces invertible matrices $H,\tilde{H}$, holomorphic on their respective affine patches, with $F=\tilde{H}{H}^{-1}$. The obstruction to varying such a bundle frame locally with space-time is $H^1({\mathbb{CP}}^1,\mathcal{O}{)}^{n^2}=0$, so the splitting factors can be chosen holomorphically in a neighbourhood. If two splittings differ by $H\mapsto Hg$ and $\tilde{H}\mapsto \tilde{H}g$, then $g$ is holomorphic on the compact complex projective line and hence independent of its projective coordinate. It is the space-time gauge freedom.

On a twistor domain containing the lines $L_x$ for $x$ in a space-time domain $U$, the Ward construction uses a holomorphic vector bundle $E$ with $E{|}_{L_x}\cong {\mathcal{O}}^{\oplus r}$ for every $x\in U$. A degree-zero restriction is not sufficient: $\mathcal{O}(1)\oplus \mathcal{O}(-1)$ has degree zero but is not holomorphically trivial. A trivial restriction has $r$ independent global holomorphic sections; their evaluations give a linewise bundle frame and hence a factorization of its patching matrix. Nearby factors can be chosen holomorphically because $H^1({\mathbb{CP}}^1,\mathcal{O}{)}^{r^2}=0$. Lines on which the splitting type is nontrivial are called jumping lines and obstruct this regular reconstruction there. For a globally regular field on affine complexified Minkowski space the condition is needed on all its incidence lines; on a smaller domain only those lines are required.

On a twistor line use ${\pi }_{0^{\prime }}=\zeta ,{\pi }_{1^{\prime }}=1$ and ${\omega }^A=x^{A{0}^{\prime }}\zeta +x^{A{1}^{\prime }}$. For a degree-zero holomorphic patching logarithm, its Laurent series splits as $h_0=-{\sum }_{n\ge 0}{f}_n{\zeta }^n$, $h_1={\sum }_{n<0}{f}_n{\zeta }^n$. The twistor incidence relation implies ${\partial }_{A{0}^{\prime }}{f}_n={\partial }_{A{1}^{\prime }}{f}_{n-1}$. Hence $(-{\partial }_{A{0}^{\prime }}+\zeta {\partial }_{A{1}^{\prime }})h_{\alpha }={\partial }_{A{1}^{\prime }}{f}_{-1}$ on both patches. The gauge potential is $A_{A{0}^{\prime }}=-{\partial }_{A{1}^{\prime }}{f}_{-1}$, $A_{A{1}^{\prime }}=0$. Exponentiating the two additive factors produces the linewise holomorphic splitting of $e^f$.

With $\delta (\mathbf{x})=\int {\delta }_k{e}^{-i\mathbf{k}\cdot \mathbf{x}}{d}^{3}k/(2\pi {)}^3$ and logarithmic growing-mode rate $f=d\log D_{+}/d\log a$, the linearized cosmological continuity equation gives ${\mathbf{v}}_k=-iaHf{\delta }_k\mathbf{k}/k^2$. Apply the Rayleigh plane-wave expansion to its velocity potential and differentiate radially to obtain the displayed expression. The factor $aH$ supplies the velocity dimensions. At the present epoch $U/H_0$ has the same formula with $aH$ removed; the commonly used $f\simeq {\Omega }_m^{0.6}$ is an approximation, not an exact general growth law.

For $L(f)=-5f(0)/3+4f(1/2)/3+f(1)/3-f^{\prime }(1/3)$ on $C^3[0,1]$, quadratic polynomials are annihilated. Taylor's formula with integral remainder gives $L(f)={\int }_0^{1}K(t)f^{\prime \prime \prime }(t)dt$ with $K(t)=2(1/2-t{)}_{+}^2/3+(1-t{)}^2/6-(1/3-t{)}_{+}$. This Peano kernel is nonnegative throughout the interval and integrates to $1/36$, giving the sharp bound; $f(x)=x^3/6$ attains equality. The derivative is at an interior point, so this is distinct from an endpoint differentiation formula.

For $L(f)=f^{\prime \prime }(0)-f(-1)+2f(0)-f(1)$ on $C^3[-1,1]$, quadratic polynomials are annihilated. The Peano kernel theorem gives $L(f)={\int }_{-1}^{1}K(t)f^{\prime \prime \prime }(t)dt$, with the displayed kernel; its value at zero does not affect the integral. Its absolute integral is $1/3$, proving $|L(f)|\le \Vert f^{\prime \prime \prime }{\Vert }_{\infty }/3$. The kernel changes sign, consistent with exactness also on cubic polynomials despite the estimate using only three derivatives.

This initial value problem uses a square root and absolute value to define a continuous function on all of ${\mathbb{R}}^2$. For every finite waiting time $c\ge 0$, a forward solution of a differential equation on $t\ge 0$ isThe constant solution of a differential equation $y_{\infty }(t)=0$ is another choice. For example, at $t=3$, waits $c=0,1,2,3$ give values $9,4,1,0$. These are dimensionless mathematical trajectories; no measured physical waiting time is being supplied.

Verification uses the original ordinary differential equation, including the join. Before departure, both $y_c^{\prime }$ and $2\sqrt{|y_c|}$ vanish. For $t>c$, their common value is $2(t-c)$. For $c>0$, the difference quotient at the join isThus the derivative exists at $c$, equals the rate law there, and is continuous across the join. For $c=0$ the same computation gives the right derivative at the starting endpoint. For $c>0$, the left and right second derivatives at departure are $0$ and $2$: these forward solutions of a differential equation are continuously differentiable functions, without being twice differentiable at departure. The local two-sided statement of the Peano existence theorem is separate from this explicitly forward family.

The rate law tends to zero as $y\to 0$, but its secant slopes from zero are unbounded:No finite local Lipschitz constant exists at zero. At $\epsilon =10^{-2},10^{-4},10^{-6}$ the quotient is $20,200,2000$, even though the rates are shrinking to zero. Continuity controls the rate itself; Lipschitz continuity would control its change relative to the state displacement.

There is also a numerical lesson. The forward Euler method starting exactly at zero gives $Y_{k+1}=Y_k+2\Delta t\sqrt{|Y_k|}=0$ at every step. It reproduces the constant solution of a differential equation for every positive step size, while the moving trajectories remain equally valid. A computation producing one trajectory cannot establish uniqueness. Likewise, the separable differential equation calculation that divides by $\sqrt{|y|}$ only describes the moving pieces: checking the original equation recovers the zero pieces and their joins.

The tensor products of single-qubit Pauli matrices form an orthogonal basis of the operator space on $n$ qubits, so every linear error operator has a Pauli expansion. Using $X^a{Z}^b$, with scalar phases absorbed into the coefficients, its computational basis action is $E|x⟩={\sum }_{a,b}{c}_{a,b}(-1{)}^{b\cdot x}|x+a⟩$, with binary arithmetic. This describes coherent errors as well as individual Pauli errors; it does not assume that the noise is a probabilistic Pauli channel. A physical noise map has Kraus operators of this form when the usual quantum channel description applies, for instance when the initial system and environment are uncorrelated.

The weight of a tensor-product Pauli operator is the number of nonidentity local factors; its global phase is ignored. Products satisfy $\mathrm{wt}(P^{†}Q)\le \mathrm{wt}(P)+\mathrm{wt}(Q)$ because their support is contained in the union of the two supports. The quantum code distance uses this weight to measure the smallest undetectable nontrivial action on logical information.

Every linear map from a qubit into the tensor product of that qubit and an environment can be expanded in the Pauli matrix orthonormal basis of operators. If $V|0⟩=|0⟩|e_{00}⟩+|1⟩|e_{01}⟩$ and $V|1⟩=|0⟩|e_{10}⟩+|1⟩|e_{11}⟩$, then the four coefficient vectors areThese environment vectors need not be orthogonal, so this is an operator expansion rather than a claim that the quantum channel is a classical Pauli channel. Physical isometries additionally preserve the inner products of the two input basis states.