Norm from a bounded symmetric convex neighbourhood Created 2026-10-14 Updated 2026-11-05
Let be a real Hausdorff topological vector space, and let be a bounded, convex, open neighbourhood of zero with . Its Minkowski functionalis a norm and . Convexity and symmetry give a real balanced set, so the gauge is a seminorm. Openness gives the displayed unit-ball identity.
To prove definiteness, suppose . For any zero neighbourhood , boundedness of gives for a sufficiently small . Since , it belongs to every zero neighbourhood. The Hausdorff property forces . The same boundedness comparison shows that the norm topology agrees with the original topology.
For a complex vector space, require to be balanced under complex scalars; symmetry under minus one alone only supplies the real homogeneity. The argument is independent of finite dimension and requires no Euclidean inner or outer balls.[ref]
Split independent observational blocks into two folds. Use one fold to estimate the combination weight for the two sample means in the other fold, and conversely. Each held-out combination is an unbiased estimator conditionally on its training fold because its two held-out sample means have the same expectation. A deterministic average of the two combinations remains unbiased. Under consistency of the moment estimates and balanced fold sizes, the weights approach those of the minimum-variance combination of unbiased sample means. Paired observations must stay together when splitting or bootstrapping so their covariance is preserved.
On , give an adjacent edge capacity equal to the larger endpoint distance from the diagonal. The set has outgoing edges: two at each interior diagonal vertex and one at each endpoint. Every such edge has capacity one. Thus any flow from above to below the diagonal is at most ; a feasible path decomposition attaining this value certifies optimality by weak duality.
Let the first columns of a matrix be the first dependent prefix, with no zero column. Their relation space has dimension one, and every nonzero relation has at least two nonzero coordinates. If both and , one-dimensionality gives for all . Two nonzero coordinates would force two of the distinct weights to agree, a contradiction.
Bernstein theorem for minimal graphs Created 2026-10-14 Updated 2026-10-31
Stable minimal surface 2026-10-14
A stable minimal surface has nonnegative second variation of surface area for every admissible normal variation fixing the boundary. For a two-sided minimal surface in three-dimensional Euclidean space, the quadratic form isHere is the gradient for the induced Riemannian metric. The gradient term penalizes rapid changes in the displacement; the principal curvature term can make the second variation negative. A plane has only the nonnegative gradient term. Nonnegativity alone, especially with zero modes, does not prove a strict local minimum or a global minimum.
For a finite catenoid between fixed rings, the answer depends on the ring separation, waist radius, and allowed variations. The axisymmetric second variation of a catenoid tests a specified restricted class. Comparing with two disconnected disks tests a different class of competitors, including a change in topology. Consequently, a stationary catenoid can have greater surface area than two disks without immediately collapsing under every small perturbation.
First variation of area formula 2026-10-14
Let a boundaryless minimal surface be closed in , and let its distance to a plane tend to infinity along every sequence escaping bounded sets. If it has no planar point, it must meet the plane. Otherwise absolute signed height has a positive attained minimum by properness. Its Hessian there is semidefinite and equals the second fundamental form up to sign because the plane is tangent. Minimality makes its trace zero, so the entire form vanishes, contradicting the absence of planar points. This argument uses curvature and attained extrema, rather than an unproved contact comparison for Gaussian curvature.
Similarity of squared matrix products with one diagonalizable product Created 2026-10-14 Updated 2026-11-05
The identity gives . If is diagonalizable, its minimal polynomial has simple roots. Hence all nonzero Jordan blocks of have size one and its zero blocks have size at most two. Squaring kills these nilpotent blocks, making both squared products diagonalizable. Their eigenvalue multisets agree by Characteristic polynomials of AB and BA, so the squared products are similar matrices.
Mid-edge facet centroid invariance 2026-10-14
The descendant of a face with cyclic vertices has vertices . Their arithmetic mean is unchanged. On the cyclic Fourier basis, a mode of frequency is multiplied by . Every nonconstant mode has modulus less than one, so the descendant face shrinks to the original vertex centroid. This puts that centroid on the subdivision limit, without requiring the original face to be planar.
For rigid walls , a nonzero vertical wavenumber and radial Lagrangian fluid displacement , set and . Axisymmetric modes satisfyThe operator on the left is a positive self-adjoint operator. Its Rayleigh quotient is . All mode squares are real; a growing mode exists exactly when the continuous coefficient is negative somewhere. Sufficiency follows by a test function supported in that negative interval and the compact operator and self-adjoint operator eigenproblem obtained by conjugating the multiplication operator with the inverse square root of the positive differential operator.
// Target: astrophysical-fluid-dynamics.bigb
For , constant density and Keplerian , the Michael criterion for axisymmetric toroidal-field interchange becomes . Instability therefore requires and . For a field varying on the radial scale , this is an orbital-speed field, much stronger than a gas-pressure-scale field with in a thin disk. Steep radial field gradients require the exact derivative criterion rather than this scale estimate. The instability is powered by the toroidal field distribution and is distinct from weak vertical-field magnetorotational instability.
// Target: fluid-mechanics.bigb
Metropolis-within-Gibbs algorithm Created 2026-10-14 Updated 2026-10-25
A Metropolis-within-Gibbs sweep updates one coordinate or block at a time by a Metropolis–Hastings algorithm transition whose invariant law is that block's full conditional distribution. For a proposal changing only block , the acceptance ratio uses the full joint target with the other coordinates fixed, together with the reverse/forward proposal ratio. Each block kernel preserves the joint posterior, so their composition does as well. Conjugate blocks can instead use exact Gibbs sampling draws. Systematic composition need not be reversible, even when every block kernel is reversible.
Entropy of a smooth periodic function ball 2026-10-14
For the unit ball of measured in the uniform metric, . The lower bound uses disjoint bump functions of spatial scale , height proportional to and independently chosen zero/one coefficients: there are functions separated at scale . For the upper bound, Multivariable Jackson approximation gives a trigonometric polynomial of degree . Its coefficients are bounded and can be rounded with coefficient accuracy proportional to divided by the coefficient count. Counting those rounded coefficient arrays supplies the logarithmic factor. The continuous-function unit ball without derivative bounds has infinite entropy for , by an infinite sequence of disjoint height-one bumps.
Entropy of Lipschitz compositions 2026-10-14
Suppose outer functions in a family obey , and compose them with inner functions drawn from . Approximate the outer function within and each inner function within . The triangle inequality bounds the composed error by . Multiplying the numbers of possible net choices and taking logarithms gives the stated inequality. A uniform bound on first partial derivatives supplies for the unit ball, so the exponent of a common entropy bound for the outer and inner classes is retained under function composition.
Resonant exponential particular solution Created 2026-10-14 Updated 2026-10-25
For a constant-coefficient linear differential equation , where denotes differentiation, a simple root forces a resonant trial. Factor ; since , commuting the differential operators gives . Thus the displayed expression is a particular solution. More generally, if the root has multiplicity , the same factorization gives , so . This is the extra polynomial factor required by resonance in a differential equation.
For , the method of multiple scales gives no first-order phase drift. If is odd, the amplitude obeys the displayed damping law with . If is even, the average is zero and the amplitude is unchanged on the first slow time . The odd case dissipates mechanical energy, whereas the even case is reversible and its force is not damping of both velocity signs.
For and with leading oscillation , , averaging the auxiliary equation gives . Cancellation of resonant forcing in the oscillator gives . With and , and the displayed amplitude follows. Bounded oscillatory corrections repair the instantaneous auxiliary equation; secular terms in a fixed-time expansion show why the slow scale is needed.
For homogeneous Dirichlet endpoints, the centered first-difference matrix is skew-Hermitian and the centered second-difference matrix is negative definite. Thus is contractive in the discrete L2 norm for every real and every mesh width. The displayed identity follows by summation by parts. Nonnegative off-diagonal entries additionally require ; that maximum-principle condition is not necessary for the L2 energy estimate. numerical consistency and Duhamel's formula then give second-order numerical convergence for smooth solutions and compatible initial approximations.
For periodic indexing let be the unitary forward shift. The operator is . A discrete Fourier transform diagonalizes it with eigenvalue and real part . Consequently for every , uniformly in the grid. Equivalently , proving decay of the discrete energy directly. The result is semidiscrete stability; a further time discretization must also have adequate absolute stability.
There are unlisted articles, also show them or only show them.