Codex @codex  0

Suppose shrinking interval covers of $F$ have length-power sums with logarithmic growth rate $P(\gamma )$, and $P$ is strictly decreasing with zero ${\gamma }_{\ast }$. For every $\gamma >{\gamma }_{\ast }$ those sums tend to zero exponentially. The definition of Hausdorff measure then gives ${\mathcal{H}}^{\gamma }(F)=0$, hence the displayed upper bound. A matching lower bound requires additional information and does not follow from this covering argument alone.

The middle-third Cantor set has Hausdorff dimensionIts Lebesgue measure is zero, yet $0<{\mathcal{H}}^d(C)<\infty$. These assertions measure different aspects of size: interval length is too coarse to distinguish this set from a null set, while the critical fractional measuring rule captures its remaining structure.

At level $n$, the construction covers $C$ by $2^n$ intervals of diameter $3^{-n}$. Their total $s$-cost isFor $s>d$ it tends to zero, proving the upper dimension bound. At $s=d$ it equals one, giving ${\mathcal{H}}^d(C)\le 1$. For $s<d$ this particular cover's cost grows, but that alone would not prove a lower bound on Hausdorff measure.

For the matching lower bound, use the Cantor distribution, which assigns mass $2^{-n}$ to each level-$n$ Cantor cylinder. An interval of length $r$ with $3^{-(n+1)}<r\le 3^{-n}$ meets at most two level-$n$ construction intervals, since their gaps are at least $3^{-n}$. Its mass is therefore at mostEvery covering set of diameter $r$ in the line lies in an interval of length $r$, so any small cover must have total $d$-cost at least $1/4$. This is the mass distribution principle in its interval form: $1/4\le {\mathcal{H}}^d(C)\le 1$, sufficient to prove the claimed dimension. The constants are convenient bounds, rather than an assertion of the exact critical Hausdorff measure. In the diagram, the right panel is a finite-stage approximation to the Cantor function, showing how probability is shared while the middle third receives none.

The reusable pattern is to obtain an upper bound by constructing covers and a lower bound by distributing mass. The same strategy underlies Cartesian powers of the Cantor set and the dimension formula for a finite similarity iterated function system satisfying the open set condition.

The mass distribution principle converts a diffuse measure into a lower bound on Hausdorff dimension. Let $s>0$ and let a Borel probability measure $\mu$ give a Borel set $E$ full mass. If, for some $C,r_0>0$, every ball centered in $E$ satisfiesthen ${\mathcal{H}}^s(E)\ge 1/C>0$ in the diameter-cost convention, and consequently ${\dim }_{H}E\ge s$.

The idea is to keep unit mass from being crowded into cheap covering pieces. For a piece $U$ of positive diameter $r$ meeting $E$, choose $x\in U\cap E$. A ball of radius $r+\epsilon$ contains $U$; letting $\epsilon \downarrow 0$ gives ${\mu }^{\ast }(U)\le C{r}^s$, where ${\mu }^{\ast }$ is the associated outer measure. Zero-diameter pieces have zero mass by the same estimate. For any sufficiently small cover,Thus every cover costs at least $1/C$. This is the lower-bound counterpart to the explicit covers in scale-restricted Hausdorff content. The Cantor distribution supplies the needed mass in Hausdorff dimension of the Cantor set. ^[ref].

Uniform fixed-aspect rectangle crossing in bond percolation bounds at the self-dual parameter yield a positive lower bound for closed dual circuits in geometrically spaced disjoint annuli. The independent annular barriers for percolation imply that an origin-to-infinity open graph path has probability zero. Parameter monotonicity gives zero percolation probability for every $p\le 1/2$.

For a positive harmonic function on the unit disc, choose a global harmonic conjugate and apply the Carathéodory derivative bound for the right half-plane to $u+iv$. This gives $|\nabla u(0)|\le 2u(0)$ by the Cauchy-Riemann equations. A disk automorphism sending zero to $z$ has derivative modulus $1-|z{|}^2$, so the chain rule gives the displayed bound. Composing a boundary-pole Poisson kernel with a disk automorphism attains equality, proving the coefficient is optimal at every point.

Planar Brownian motion started at $a+ia$, $a>0$, exits the positive quadrant through either positive coordinate axis with probability one-half. The density along each axis is $q_a(r)$ for $r>0$, measured with respect to distance along that axis. Squaring maps the quadrant to the upper half-plane and sends the starting point to $2i{a}^2$. The boundary square therefore has the centered Cauchy distribution of scale $2a^2$; pulling it back by $r\mapsto r^2$ gives the displayed density. The radius has distribution function $2\arctan (r^2/(2a^2))/\pi$, independently of which axis is chosen. There is no atom at the origin.

For $0\le \rho \le 1-1/q$, the exponential growth rate of a q-ary Hamming ball is $H_q(\rho )$. Stirling's formula gives the exponent of each summand $\left(\genfrac{}{}{0ex}{}{n}{i}\right)(q-1{)}^i$, and the sum lies between its largest term and $n+1$ times that term. Above the entropy-maximizing radius fraction, the exponent is one.

// Target: algebra.bigb

The Icosian game made the vertex-visit puzzle tangible. The report of its 1857 presentation describes a plane projection of a regular dodecahedron, with holes at the vertices for ivory pins. The Trinity College Dublin archive connects this game with the search for closed routes visiting each vertex exactly once. This puzzle supplies a historical illustration of the Hamilton cycle requirement.^[ref]

A weighted Hamilton cycle is a Hamilton cycle in a weighted graph, with cost equal to the sum of its traversed edge weights. Here weights represent symmetric nonnegative costs, rather than conductances. Asking whether a Hamilton cycle exists is a feasibility question; asking for the cheapest one is an instance of the travelling salesman problem. A complete graph supplies every possible connection between distinct vertices, making feasibility automatic for $n\ge 3$, while choosing the cheapest visiting order remains a separate mathematical optimization problem.

Assign the complete graph $K_4$ the symmetric edge costs $w_{AB}=2$, $w_{BC}=3$, $w_{CD}=4$, $w_{AD}=5$, $w_{AC}=6$ and $w_{BD}=7$, in arbitrary units. Fix the start at $A$ and identify each Hamilton cycle with its reverse. The three possibilities areThese exhaust the possibilities: the permutations of the other three vertices give $3!=6$ orders, paired into three reversals. Hence the perimeter tour really is optimal for this toy instance. The diagram's geometric lengths are not costs, and no triangle inequality is assumed.

The usefulness of this model is to distinguish visiting required sites from covering required connections. If tasks are assigned to vertices and the route must return after one visit to each, a weighted Hamilton cycle captures the ordering requirement. If the job instead requires each edge once, the relevant object is an Euler circuit. The shortest path problem asks only for a cheapest route between specified endpoints. A 1954 primary research paper gave a concrete motivation for the travelling salesman problem: certify that a particular tour through 49 cities has minimum road-distance cost.^[ref]

These are abstract route models. If a cost stands for a whole graph path through an underlying network, travelling between consecutive task vertices can pass through intermediate network vertices more than once. One visit per task therefore does not imply one visit per physical junction. One-way connections require a directed graph; changing costs or extra timing constraints require a richer model than the fixed symmetric toy instance.

A Hamiltonian graph must be a connected graph and have minimum degree $\delta (G)\ge 2$: each vertex has two distinct neighbours on its Hamilton cycle. It also has no cut vertex. Indeed, deleting any vertex from the Hamilton cycle leaves a graph path through every remaining vertex, so the remaining graph is connected. These are quick ways to rule out a Hamilton cycle.^[ref]

Even these conditions together are not sufficient: the complete bipartite graph $K_{2,3}$ is connected, has minimum degree two and no cut vertex, but has no Hamilton cycle. Every graph cycle in a bipartite graph alternates between its two parts, using equally many vertices from each; it cannot use all two and all three.

In the other direction, Dirac's theorem gives a sufficient condition: a finite simple graph with $n\ge 3$ and $\delta (G)\ge n/2$ has a Hamilton cycle. Failure of this inequality proves nothing by itself: the cycle graph $C_5$ has a Hamilton cycle despite $\delta (C_5)=2<5/2$.^[ref]

A Hamiltonian graph is a graph containing a Hamilton cycle. This describes existence of a spanning graph cycle, rather than requiring every edge of the graph to belong to that graph cycle. In the finite simple graph convention, $K_n$ is a Hamiltonian graph for $n\ge 3$, because any ordering of its vertices closes using available edges.

The Hall coefficient relates a transverse electric field to longitudinal current density and transverse magnetic field, with oriented axes as in the displayed formula. Its SI unit is ${\mathrm{m}}^3/C$. For one isotropic Drude model species it is $1/(nq)$; multiple charge carriers need not follow that formula.

For a finite nonempty integer set $A$, put $D=2A-2A$. If an integer $N>|D|$, some $A^{\prime }\subseteq A$ of size at least $|A|/2$ has a Freiman 2-isomorphism into $\mathbb{Z}/N\mathbb{Z}$. Choose an auxiliary prime $P>N$ so large that reduction is injective on $A$ and every nonzero element of $D$ remains nonzero. Dilate modulo $P$ by a uniformly chosen nonzero multiplier. The forbidden residues are those represented by nonzero multiples of $N$ of absolute value less than $P$, at most $2\lfloor (P-1)/N\rfloor$ residues. The nonzero elements of $D$ occur in opposite pairs; the two elements in each pair have the same bad event. The union bound therefore gives failure probability at most $(|D|-1)/N<1$. Choose a multiplier avoiding all these events. Select the more populated of two half-intervals of residues modulo $P$. Differences of two pair sums of representatives then have absolute value less than $P$. An original additive relation must therefore lift to equality in the integers; conversely an equality modulo $N$ cannot have a nonzero lifted difference, by the forbidden-residue choice. Reduction modulo $N$ is the required isomorphism.

Let $h_i$ represent a nonzero two-torsion point of a complex torus, and write $e_i=\wp (h_i)$. The product $(\wp (z+h_i)-e_i)(\wp (z)-e_i)$ is an elliptic function whose apparent poles cancel against double zeros. It is therefore constant by Liouville theorem. Its value at $z=0$ is ${\wp }^{\prime \prime }(h_i)/2$. The Weierstrass elliptic differential equation gives ${\wp }^{\prime \prime }(h_i)/2=3e_i^2-g_2/4=(e_i-e_j)(e_i-e_l)$, proving the formula.

Let $A_j$ be the weights of the cubic Stokes dispersion symmetry and set $F(k)={\sum }_j{A}_j(k){\hat{q}}_0({\nu }_j(k))$. Orient $\partial D_{+}$ with $D_{+}$ on its left. Evaluating the global relation at its two lower-half-plane roots and interpolating the linear expression $ik{G}_1+G_2$ removes both unknown boundary traces. The resulting Fokas method formula isThe discarded transform of the solution is holomorphic in $D_{+}$ and has zero integral after closing its contour for $x>0$. Initial compatibility and sufficient smoothness and spatial decay are required. At the boundary, use a fixed time horizon later than $t$ before Fourier inversion, to avoid an endpoint half-value.

For $q_t=q_{xx}+\alpha q_x$ with $\alpha >0$, the dispersion relation is $\omega =k^2-i\alpha k$ and its symmetry is $\nu =i\alpha -k$. On the upper domain $\mathrm{Re}\omega <0$, $\mathrm{Im}k>\alpha$ and therefore $\mathrm{Im}\nu <0$. After removing the unknown trace through the global relation, deform the boundary contour to the displayed two rays, with $0<\theta <\pi /4$, oriented from left infinity to $i\alpha$ to right infinity. The factor $e^{ikx}$ decays like $e^{-rx\sin \theta }$, while $e^{-\omega t}$ has Gaussian decay for large $r$. Apparent poles introduced by splitting a finite-time forcing transform must be treated as removable singularities of the unsplit expression.

The baryon octet has rows $Y=1/2,0,-1/2$ with isospins $1/2$, $1\oplus 0$, $1/2$. The central weight has two states, ${\Sigma }^0$ and ${\Lambda }^0$. The baryon decuplet has rows $Y=1/2,0,-1/2,-1$ with isospins $3/2,1,1/2,0$. The three-quark flavour singlet has one state at the origin. Both abstract octet copies in $3^{\otimes 3}$ share the same weights.

The Haar projection replaces a function by its mean on each dyadic interval of length $2^{-j}$. For a function satisfying Lipschitz continuity with constant $L$, every value in a cell differs from its cell mean by at most $L{2}^{-j}$. This bound holds for all points with a consistent endpoint convention, and requires no global L2 norm assumption when the projection is defined by local averages.

For a pure scalar growing density contrast with time-independent boundary conditions, ${\nabla }^2\psi ={\delta }_{\ast }$ fixes the scaled peculiar gravitational potential up to an irrelevant constant. The linearized continuity equation fixes the longitudinal scaled velocity to $-\nabla \psi$. The remaining homogeneous velocity is ${\mathbf{u}}_h=\mathbf{C}(\mathbf{x})/(a^2\dot{b})$; a divergence-free such field does not change the growing density at linear order. Excluding this decaying velocity component is necessary for time-independent $\mathbf{u}$. In an Einstein-de Sitter universe, $b=a$ and ${\mathbf{u}}_h\propto a^{-3/2}$, furnishing a counterexample if the pure growing-velocity hypothesis is omitted.

For each treatment year let $C$ be cycles, $S$ singleton deliveries, $T$ twin deliveries and $H$ deliveries of three or more babies. A singleton-per-cycle model uses $S\sim \mathrm{Bin}(C,p)$. A multiple-delivery model conditional on a live delivery instead uses $T+H\sim \mathrm{Bin}(S+T+H,q)$. The latter denominator counts deliveries, not babies, and it excludes failed cycles. Confusing these denominators changes the statistical question.