For symmetric negative semidefinite matrices , each factor has norm at most one, since its eigenvalues are with . The same holds for , so their ordered product is a contraction for every , whether or not commute. This proves unconditional discrete L2 norm stability of the split Crank-Nicolson method for directional diffusion. Its splitting error remains first order in general, because the product's quadratic defect is .
Toric irrelevant ideal Created 2026-10-14 Updated 2026-11-05
For the polynomial Cox ring of a normal split toric variety whose toric rays span the ambient real toric lattice space, the toric irrelevant ideal isThe Cox construction uses the open set . For the projective line, the two maximal toric cones give generators , so the excluded locus is the origin. For affine space, one maximal toric cone contains every toric ray; the empty product is one, hence and nothing is excluded.
The ray-span/no-torus-factor hypothesis belongs to this polynomial presentation. A pure algebraic torus has no toric rays and requires its algebraic torus coordinates in addition to the displayed polynomial data.[ref]
The Homogeneous Coordinate Ring of a Toric Variety by David A. Cox. section1, irrelevant monomial ideal and ray-span hypothesis
// Target: geometry-and-topology.bigb
For a normalized spherical harmonic of degree , write and . Integration of the radial Poisson equation gives , where . Cauchy-Schwarz inequality and give the displayed bound on . For bounded density amplitudes with fixed radial support this decays as , giving a quantitative angular short-scale justification of the Cowling approximation.
Plane-parallel Cowling displacement-pressure equations Created 2026-10-14 Updated 2026-11-05
Take depth positive downward, vertical fluid displacement positive upward, and Lagrangian pressure perturbation . In a plane-parallel atmosphere with , the Cowling approximation and adiabatic relation giveIndeed the Eulerian perturbations are and . Horizontal momentum gives ; combine this with mass conservation and vertical momentum to eliminate the horizontal displacement. Reversing the sign convention for vertical displacement reverses both displacement-pressure coupling signs.
Unravelling of a game payoff 2026-10-14
A covering of an infinite game unravels a payoff when its inverse image is a clopen subset of the new infinite-play space. A closed payoff can be unravelled by letting Player I announce a subset of the first exit positions, and letting Player II accept that announcement or challenge one announced position. Accepted plays stop at exit positions, while challenged plays are forced through the challenged exit. Strategy-transfer maps make this more than an ordinary continuous representation of the payoff. Depth-stabilizing inverse limits of coverings handle countable unions in a transfinite induction.
In a sequence of game coverings whose unchanged initial depths tend to infinity, each finite game-tree level eventually stabilizes. These stable levels form a limit game. Compositions of prefix projections and depth-local strategy maps give limit projections and strategy maps. Lift a compatible play coherently through successive coverings. If no premature loss occurs, stabilization of its finite prefixes supplies a compatible limit play. If a premature loss occurs, subsequent lift lengths cannot increase and eventually stabilize, supplying a losing terminal limit play. This proves the lifting condition for the limit covering. It makes countably many pulled-back payoffs clopen simultaneously in the covering proof of Borel determinacy theorem.
Core of a coverage game 2026-10-14
A coverage coalitional game has a nonempty core of a cooperative game exactly when all resource sets are pairwise disjoint. Singleton coalition constraints require , while efficiency requires . Any overlap makes these inequalities inconsistent. When there is no overlap, the allocation is the unique core allocation and gives every coalition its value exactly.
Shapley value of a coverage game 2026-10-14
Decompose a coverage coalitional game into one-resource games and use additivity of the Shapley value. A player contributes a resource precisely when it is the earliest player in a random ordering among those holding that resource. Each holder has probability the reciprocal of the number of holders of being earliest. Summing these contributions proves the formula, regardless of overlaps or emptiness of the core.
Use and . The Faddeev-Popov gauge-orbit identity with Lorenz gauge function , followed by Gaussian averaging of , supplies the quadratic gauge-fixing term. Represent the determinant of using a Grassmann Gaussian integral over a Faddeev-Popov ghost field and antighost field to obtain the ghost term. The minus sign in this operator differs by a field-independent determinant factor from the direct gauge-condition Jacobian; it is a consistent antighost convention.
The ghost term equals up to a boundary term. Thus it contains a ghost-gluon vertex with the sign matching this kinetic convention. An equivalent auxiliary-field form replaces the gauge-fixing term by . The Nakanishi-Lautrup field equation gives and recovers the displayed Lagrangian. With left-acting BRST transformations , , , and , the gauge-fixing and ghost terms together are .
Landau gauge (quantum field theory) 2026-10-14
The limit of covariant gauge fixing by . It imposes the divergence condition sharply and gives a transverse photon propagator. This is distinct from the vector-potential choice called Landau gauge for a uniform magnetic field when computing Landau levels.
Gauge-fixed Maxwell kinetic operator 2026-10-14
The Fourier-space quadratic Maxwell kernel after adding . For nonzero and non-null four-momentum, its transverse and longitudinal momentum projectors give and its inverse is . The inversion of the gauge-fixed Maxwell kinetic operator supplies the photon propagator with its vacuum boundary prescription.
Monotone coupling from the past 2026-10-14
If update maps preserve a finite partial order with a bottom and top state, it suffices to run those two extremal states from the same backward horizon. Equality of their time-zero images forces equality of all initial states by the order sandwich. For ferromagnetic Ising heat-bath updates, use the same updated vertex and uniform variable in every chain; the conditional probability of increases with every neighbour's spin. A block visiting all vertices once with all uniforms below the least conditional probability of maps every state to all plus, proving almost-sure termination.
Polynomial construction of hydrogen S states Created 2026-10-14 Updated 2026-11-05
For a spherically symmetric bound state, write . The radial Coulomb equation gives the displayed recurrence. Choosing terminates it after degree , producing a nonzero continuous polynomial times an exponentially decaying function. Its three-dimensional norm is finite and can be normalized. The energy is . Continuity at the origin is compatible with the Coulomb cusp; no differentiability as a Cartesian radial function at the origin is asserted.
Cotype 2 2026-10-14
This is cotype of a Banach space with . The Lp space has cotype 2 with constant at most : the triangle inequality for the Euclidean norm gives , and the sharp Rademacher second-moment inequality, followed by Fubini theorem, bounds this by .
In a symmetric equal mixture of two ordered pure thermodynamic phases with magnetizations , the mean spin vanishes but the large-distance two-spin expectation tends to . Thus the connected correlation function of the mixture has a nondecaying part. The correlation-function susceptibility sum rule gives an extensive contribution to susceptibility per spin. This is phase-switching response, not the connected susceptibility within one pure phase. The latter uses the thermodynamic limit followed by a one-sided zero-field limit, and subtracts the nonzero pure-phase mean before defining the correlation length.
Interval exactness of a tent-map core 2026-10-14
If , every nondegenerate subinterval of eventually maps onto . Away from the critical point, lengths multiply by ; one fold loses at most a factor of two. If an interval and its image both contain zero, its second image is . Otherwise every two steps increase length by at least , which cannot continue inside bounded . Applying the intermediate value theorem to an interval that covers itself then gives a periodic point in every subinterval.
// Target: dynamical-systems.bigb
Core of the miners game Created 2026-10-14 Updated 2026-10-25
For , the core is zero when , the nonnegative unit simplex when , the single allocation when is divisible by , and empty for all other . To prove the obstruction, every -person coalition requires payoff at least one. Summing these constraints counts each player times and gives , impossible when . For a divisible , all such coalition sums must equal one. Comparing coalitions with the same members makes all individual payoffs equal when . The uniform allocation satisfies every coalition constraint because . At all proper coalition values are zero, giving the whole simplex instead.
FFT butterfly 2026-10-14
An FFT butterfly combines corresponding outputs of two half-sized transforms using a twiddle factor . Sharing the product costs one complex multiplication and two additions. For the unnormalized positive-exponent inverse discrete Fourier transform of length , use at index .
Taxi distance convolution on a rectangular road cycle Created 2026-10-14 Updated 2026-11-05
For a taxi starting at any vertex of a rectangle with side lengths , a uniform pickup vertex gives approach-distance law uniform on . Conditional on that pickup, a uniform distinct destination gives passenger-distance law uniform on , independent of the pickup vertex. Hence the two distance variables are independent despite sharing that vertex. Their convolution has twelve equally likely pairs. Its mean is and its variance is . Repeated numerical sums combine their multiplicities when some distances coincide.
Shapley population monotonicity in a convex game Created 2026-10-14 Updated 2026-10-25
Choose a uniform random ordering of and restrict it to . The restriction is uniform, and each player's predecessor set in is contained in their predecessor set in . Increasing marginal contributions in a convex cooperative game make the full-population contribution at least the restricted contribution. Averaging proves the displayed Shapley value inequality. Summing over and using efficiency in the restricted game proves every core inequality.
There are unlisted articles, also show them or only show them.