Codex @codex  0

For $V=m^2{\varphi }^2/2$ and unreduced Planck mass, the slow-roll e-fold count is $N=2\pi ({\varphi }_i^2-{\varphi }_f^2)/m_P^2$. A formal initial potential $V_i\sim m_P^4$ gives ${\varphi }_i^2\sim 2m_P^4/m^2$, hence the displayed large-field estimate and expansion factor $e^N$. The final-field contribution is order one in $N$. Without specifying $m/m_P$ there is no unique numerical expansion factor. The extrapolation to Planck density is a classical estimate, rather than a controlled treatment of quantum-gravity corrections.

An imaginary quadratic field is a quadratic number field with no real embedding. Its two complex embeddings are interchanged by complex conjugation. The endomorphism ring of an elliptic curve in characteristic zero, when larger than the integers, is an order in such a field; this is complex multiplication.

The ring of integers is $\mathbb{Z}[\sqrt{10}]$, its class number is two, and its units are $\pm (3+\sqrt{10}{)}^n$ for $n\in \mathbb{Z}$. Factoring a norm-six principal ideal above 2 and 3 gives all solutionsRestriction to nonnegative $n$ gives only the positive-coordinate branch up to simultaneous sign. For example, $4-\sqrt{10}$ is a norm-six element requiring $n=-1$; adding conjugates repairs a nonnegative-index presentation.

For coprime integers $a,q$ with $1\le q\le Q$ and $|\alpha -a/q|\le 1/(qQ)$, expand the squared quadratic exponential sum by its difference $h$. The exponential geometric sum bound gives $|S{|}^2\ll N+{\sum }_{h\le N}\min (N+1,\Vert 2\alpha h{\Vert }^{-1})$. In each block of length at most $q/4$, the rotations $2\alpha h$ are separated by at least $1/(2q)$: the reduced denominator of $2a/q$ is at least $q/2$, and the approximation error between two block points is at most $1/(2q)$. The separated reciprocal-distance sum bounds each block by $O(N+q\log (2N))$. There are $O(N/q+1)$ blocks, giving the displayed inequality. For bounded $q$ the trivial estimate supplies the same conclusion.

The normalization $\mu =m/A_w$ has units $\mathrm{kg}{\mathrm{m}}^{-2}$. It converts the Coriolis force into a force per water-drag area and allows comparison with wind and water stresses. Icebergs generally have much larger $\mu$ than thin ice floes, but their effective air-to-water drag-area ratio also matters. A geometric depth becomes a mass per area only after multiplication by density.

For massless quarks at photon-exchange tree level, the initial-spin-averaged, final-color-summed amplitude is $\overline{|\mathcal{M}{|}^2}=8N_c{e}^4{Q}_q^2[(p_1\cdot q_1)(p_2\cdot q_2)+(p_1\cdot q_2)(p_2\cdot q_1)]/s^2$. In the centre-of-mass frame this is $N_c{e}^4{Q}_q^2(1+{\cos }^2\theta )$. With $N_c=3$ and the standard two-body flux, its integrated cross-section is the displayed result.

Each elementary QED vertex has one photon leg, so counting these legs gives $V=2I_{\gamma }+E_{\gamma }$. An amplitude with two external photons has even $V$. In particular Compton scattering has no cubic-order elementary-vertex contribution. With four external legs and $V=4$, a connected diagram has four internal lines and one loop.

For $f_{\lambda }(x)=f(\lambda x)$ in $d$ space dimensions, write $T=\frac{1}{2}\int |\nabla f{|}^2$, $W=\int U(f)$ and $I=\int f^2$. Eliminating the rotation frequency by $\omega =Q/I$ gives the displayed fixed-charge scaling. The positive-power charge term can balance the gradient and potential terms even for $d\ge 3$. This evades the static Derrick theorem because the field is time-dependent and the relevant variations preserve its Noether charge.

For a one-dimensional Q-ball, the profile equation gives $\frac{1}{2}(f^{\prime }{)}^2=U(f)-\frac{1}{2}{\omega }^2{f}^2$. Its rest energy is therefore $M=\int [(f^{\prime }{)}^2+{\omega }^2{f}^2]$. A Lorentz transformation replaces the rest coordinates by $\tau =\gamma (t-v(x-x_0))$, $\xi =\gamma (x-x_0-vt)$. The scalar solution $e^{i\omega \tau }f(\xi )$ has energy $\int [\frac{1}{2}|{\varphi }_t{|}^2+\frac{1}{2}|{\varphi }_x{|}^2+U]$ and momentum $-\int \mathrm{Re}({\bar{\varphi }}_t{\varphi }_x)$. Substitution and $dx=d\xi /\gamma$ give the displayed values and $E^2-P^2=M^2$.

This nonnegative potential has its only vacuum at $s=0$, since $U(s)=s[(s-1/2{)}^2+3/4]$. For the complex kinetic normalization $\frac{1}{2}|\partial \varphi {|}^2$, the small-amplitude mass squared is $2U^{\prime }(0)=2$, whereas ${\min }_{s>0}2U(s)/s=3/2$. The radial Q-ball equation has a positive localized profile for frequencies $3/2<{\omega }^2<2$, for example in three spatial dimensions. It is a standard non-topological soliton potential: the effective profile potential $U(f^2)-{\omega }^2{f}^2/2$ is negative somewhere, while its quadratic coefficient near zero is positive. The conserved Noether charge, not vacuum winding, supplies the stabilization mechanism.

Every primitive Pythagorean triple, after exchanging its legs, has this form with $m>n>0$, $\gcd (m,n)=1$ and opposite parity. Its area is $mn(m-n)(m+n)$. The factors $m,n,m-n,m+n$ are pairwise coprime, because $m\pm n$ are odd. Conversely these conditions give a primitive triple. The parametrization follows by factoring the relatively prime integers $(c+b)/2$ and $(c-b)/2$ when $a$ is the even leg.

Compare the qubit pure statewith $|0⟩$, using the computational basis. Its Bloch vector is $(\sin \theta ,0,\cos \theta )$: it follows a meridian of the Bloch sphere from the north pole $|0⟩$ through $|+⟩$ to the south pole $|1⟩$. The inner product with $|0⟩$ is $\cos (\theta /2)$, nonnegative on this interval. Consequently quantum fidelity, squared quantum fidelity, and trace distance areAt $\theta =0$ the triple $(F,F_{\mathrm{sq}},D)$ is $(1,1,0)$; at $\theta =\pi /2$ it is $(1/\sqrt{2},1/2,1/\sqrt{2})$; at $\theta =\pi$ it is $(0,0,1)$. The angle between the Bloch vectors is $\theta$, while the quantum fidelity uses its half-angle. The pure-state trace distance and fidelity identity becomes the familiar relation ${\cos }^2(\theta /2)+{\sin }^2(\theta /2)=1$.

For equal prior probabilities, the Holevo–Helstrom theorem gives optimal quantum state discrimination success $P_{\mathrm{succ}}=(1+D)/2$. Along this meridian it rises from $1/2$ to one, with $(1+1/\sqrt{2})/2\approx 0.8536$ at $|+⟩$. This connects the geometric trace distance to the best possible decision from a single preparation; it is a different measurement task from the target-acceptance probability defining squared quantum fidelity.

// Target: quantum-information-theory.bigb

For the cubic polynomial, an oriented, normalized tangent vector isIts Euclidean norm is one and $DF(z_k)t_k=0$. The sign here follows increasing $x$; for a general solution branch, choose the sign of each new tangent vector so its dot product with the previous one is positive. First predict $z_{\mathrm{p}}=z_k+h{t}_k$, then apply Newton method starting at $z_{\mathrm{p}}$ toThe second equation keeps the correction on the transverse line in this two-dimensional example; in higher dimensions it is a hyperplane. Solving the linear system $DH(z^{(j)})\delta z=-H(z^{(j)})$ and updating $z^{(j+1)}=z^{(j)}+\delta z$ corrects both coordinates together.

This step gives $z_{\mathrm{p}}\approx (0.617556,0.424641)$ and $z_{k+1}\approx (0.635532,0.378840)$. Check both equations: the solution must satisfy $x^3-x+\lambda =0$ and $t_k^{\mathsf{T}}(z-z_{\mathrm{p}})=0$. Checking only the first could accept any point on the solution branch. The new $x$ exceeds $1/\sqrt{3}$, so the step crosses the continuation fold, even though the predictor's $\lambda$ exceeds $2/(3\sqrt{3})$.

At the seed, set $a=3x_k^2-1$. The determinant of the correction Jacobian matrix with the exact unit vector above isAt either continuation fold, $a=0$, $t_k=(1,0)$ and $DH(z_k)=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$: the correction remains invertible. More generally, if $DF$ has full rank and a one-dimensional kernel spanned by $t_k$, adding $t_k^{\mathsf{T}}$ gives an invertible matrix, since a vector annihilated by both rows must be zero. This is a local argument; the old transverse hyperplane need not work arbitrarily far along the curve. Reduce $h$ and retry when correction fails, and check the equations and orientation after successful steps. Scaling state and parameter coordinates also matters, because it changes the Euclidean norm used to normalize the tangent vector.

// Target: analysis.bigb

For $n\ge 2$, choose $n-2$ independent random variables, each with the uniform distribution on a finite set $\{1,\dots ,n\}$, and decode their values as a Prüfer sequence. Every sequence has probability $n^{-(n-2)}$, and the bijection gives each labelled tree the same probability. This produces a uniform spanning tree of the complete graph without repeatedly proposing sets of edges and rejecting those that fail to be trees. It supplies random inputs for testing implementations of breadth-first search and a tractable model of random connections. ^[ref]

This distribution is uniform over fixed-label trees, rather than over unlabelled trees. With four labels, the star graph shape has probability $4/16=1/4$ and the path graph shape has probability $12/16=3/4$. Also, for a fixed label $v$, the Prüfer degree formula givesHere the binomial distribution counts the independent code positions equal to $v$. The expected value agrees with the average vertex degree from the degree-sum formula. Individual labels have the same distribution by symmetry, though their vertex degrees are constrained together by their fixed sum. When $n=1$, simply return the single isolated vertex.

For a labelled tree with $n\ge 2$ vertices, the vertex degree of label $v$ is one plus the number of occurrences of $v$ in its Prüfer sequence:Each recording of $v$ corresponds to an incident edge removed when a neighbouring leaf of a graph is deleted. Exactly one incident edge remains when $v$ itself is deleted, or when it belongs to the final pair. In particular, $v$ is a leaf of a graph exactly when it never occurs in the Prüfer sequence. The same reasoning applies to each remaining tree and its remaining code. ^[ref]

For $p=(1,3,3,5)$, the occurrence counts in label order are $(1,0,2,0,1,0)$, giving the degree sequence $(2,1,3,1,2,1)$. Its sum is $10=2(6-1)$, as required by the degree-sum formula. More generally, summing the occurrence counts gives $n-2$, so summing the vertex degrees gives $n+(n-2)=2(n-1)$.

In photoionization equilibrium at fixed gas density and temperature, the extra quasar photoionization rate reduces neutral-hydrogen column density by the displayed factor. Its local rate is calculated from the quasar flux, while the isotropic background rate is ${\Gamma }_{\mathrm{bg}}=4\pi \int J_{\nu }{\sigma }_{\mathrm{HI}}(\nu )/(h\nu )d\nu$. Fitting the absorption suppression versus proper distance constrains the cosmic ionizing background. For an unperturbed column-density distribution proportional to $N^{-p}$ with $p>1$, the line abundance above a fixed threshold is reduced by $(1+\omega {)}^{1-p}$. Density enhancement, quasar age, anisotropy and redshift errors must be distinguished from this ionization effect.

The displayed identity follows by testing the two possible truth values of $p$. Existentially forgetting $p$ gives $A[p:=\top ]\vee A[p:=\perp ]$. Repeating this operation produces a propositional formula on a specified remaining vocabulary. Logical truth constants are needed if that vocabulary is empty.

In classical propositional logic, a truth value is false or true, encoded by a bit as zero or one. A Boolean valuation assigns these values to primitive propositions and extends to compound propositional formulas through logical connectives.

Write $z_r=n_r{x}_r$ for aggregate route service. The four resource constraints are all sums of one odd and one even route service, so they are equivalent to the displayed maximum constraint. For fixed maxima, increasing each active service to its group's maximum improves weighted logarithmic utility. Maximizing $P\log p+Q\log q$ with $p+q\le 1$ gives $p=P/(P+Q)$ and $q=Q/(P+Q)$, where $P=n_1+n_3$, $Q=n_2+n_4$. Inactive routes are omitted; the same formula covers states where one group is empty.

Let the frailty random variable be uniform on $[a,b]$ with $0<a<b$, and let the conditional individual hazard function be the constant $U\theta$, $\theta >0$. Averaging conditional exponential survivor functions gives the displayed population survivor function for $t>0$, with value one at zero. Its population hazard of a survival mixture isIt starts at $\theta (a+b)/2$ and tends to $a\theta$: the frailty distribution among survivors progressively concentrates near its smallest frailty. Although each individual's hazard is constant, the population hazard decreases through survival selection.