Up-and-in claim Created 2026-10-14 Updated 2026-10-25
An up-and-in claim activates when the stock reaches an upper barrier during its lifetime. After activation its terminal payoff is the prescribed function ; without activation it pays zero. Under continuous stock paths the barrier event is described by the displayed running maximum.
On a nonradial zero-energy Kepler orbit, conserved specific angular momentum gives periapsis and . Integrating with yields . Squaring gives the displayed version of the Barker equation, valid on both incoming and outgoing branches. The time origin is passage through periapsis, not an arbitrary point on the orbit.
Suppose continuous functions converge pointwise to . For each , some nonempty open interval and integer satisfy for every and . Indeed the closed sets cover . The Baire category theorem gives an interval inside one , and passing proves the assertion. The interval may depend on ; this does not assert uniform convergence on one fixed interval.
Every proper affine hyperplane in is closed and has empty interior: a small displacement along its nonzero normal vector leaves it. The Baire category theorem therefore makes the complement of a countable collection of such hyperplanes dense. In particular, avoiding the hyperplanes for nonzero integer tuples yields a vector for which are linearly independent over . Tuples with all the first entries zero define an empty forbidden set.
For and standard Brownian motion , the drift in Itô formula for vanishes exactly when the displayed equation holds for every spatial point and every . Necessity follows because a zero finite-variation integral has continuous integrand equal to zero, and at every positive time the normal distribution of has full support. Continuity extends the equation to time zero. There is no condition at negative times except compatibility with the global smoothness of .
For strictly increasing spline knots, is a nonnegative integral-normalized B-spline. Integrating the truncated power function over its support replaces its spline knot value by . The order- divided difference of this degree- polynomial is its leading coefficient . Multiplying by the prefactor in gives integral one. The corresponding partition-normalized B-spline is .
De Boor's algorithm 2026-10-14
For degree , knots and span , initialize for . At level , update by , where . The point is . This evaluates a B-spline by local affine combinations.
// Target: analysis.bigb
Knot insertion 2026-10-14
Knot insertion refines the spline knot sequence and changes the control points without changing the represented B-spline. Repeated insertion exposes local Bézier curves and provides subdivision-based evaluation.
// Target: analysis.bigb
A non-uniform rational B-spline surface is
Here the and are B-spline basis functions for possibly nonuniform spline knot sequences, and the are weights. Positive weights make each evaluated point a convex combination of the active control points, supplying bounding volumes for geometric searches. The denominator must remain nonzero for the parametrization to be defined.
For a uniform quadratic B-spline with interior control points , label its th span . A quartic B-spline with interior spline knot sequence represents the identical curve when
To verify this, raise each quadratic Bézier curve span twice by degree elevation of Bernstein coefficients. The three interior quartic controls are the displayed points. One additional knot insertion at each interior knot supplies the shared endpoint as the mean of its two neighboring controls, recovering all five quartic Bézier curve controls. Thus the knot multiplicity is three, giving joins rather than imposing unwanted extra smoothness.
Let the real spline have distinct knots, order , nonzero endpoint coefficients, and no identically zero knot cell in its support. It and its first derivatives vanish at both support endpoints. If is its number of interior distinct zeros, there are initially zero components. Each differentiation through order increases this count by at least one: a nonzero gap between zero components has an interior extremum, and the two endpoint zeros remain separate. The final derivative is continuous piecewise linear on cells, and each cell can meet at most one zero component unless it is identically zero, in which case all its zeros belong to the same component. It therefore has at most zero components. Thus , proving the bound.
The order- B-splines active on a simple-knot cell form a basis of its degree- polynomials. To see this from Marsden's identity, use the dual polynomials . On the identity is . Evaluation of the dual polynomials at gives a triangular coefficient matrix with nonzero diagonal. They are independent, and comparison of coefficients of in the identity gives independence of the active splines. Consequently a spline vanishes on a whole open cell exactly when all its active coefficients vanish.
B-spline differentiation formula Created 2026-10-14 Updated 2026-10-31
For the partition-of-unity normalization, the derivative of a degree- B-spline is the displayed difference of two overlapping degree- B-splines. A zero denominator denotes a term with collapsed support, assigned zero. For simple knots the divided-difference representation has the required support, smoothness and integral normalization. Differentiate the truncated power and apply the last-step divided difference recursion to obtain the formula. Repeated-knot versions follow by confluent limits, with one-sided interpretation where necessary.
Assume zero toroidal loop voltage in smooth steady ideal magnetohydrodynamics, so the poloidal flow aligns with the poloidal magnetic field. Write . The continuity equation makes constant along a magnetic line. The induction equation gives the conserved field-line angular velocity . The azimuthal momentum equation is ; hence is also constant along the line.
With , eliminating gives
For and nonsingular invariants, and matter approximately corotates along a field line. With exactly zero poloidal flow, induction directly gives Ferraro's law of isorotation. The approximation requires the correction to be small on the segment in question.
Cold radial magnetohydrodynamic wind integral Created 2026-10-14 Updated 2026-11-05
For a cold equatorial axisymmetric magnetohydrodynamic wind with in the gravity of a point mass , smooth crossing of the Alfvén surface gives and . Put , , and . The corotating energy, scaled by , is
The azimuthal velocity relative to field-line rotation is and the poloidal speed is . The apparent singularity at is interpreted through a smooth limiting slope. A nondegenerate magnetosonic crossing on a constant- curve requires and a real admissible tangent slope.
Complex axial isotropy subgroup Created 2026-10-14 Updated 2026-11-05
For the spatial group combined with the temporal phase circle in an equivariant Hopf problem, a complex axial isotropy subgroup is an actual stabilizer whose fixed-point space is one complex line. Its real dimension is two. One must include the kernel of the combined action when writing the full stabilizer, not just a generator having the right fixed space.
// Target: dynamical-systems.bigb
For , iterating an AR(1) from a fixed value gives the displayed finite sum. With centered white noise of variance and ,
For , its covariance is , which depends on . Even setting leaves a changing variance. At , , and , the variances at times zero through three are , approaching ; this finite initialized record is not weakly stationary.
To initialize in weak stationarity, give mean , variance , and zero covariance with every future driving noise value. The full stationary construction sets . For discrete Gaussian white noise, equivalently draw from independently of future noise. This gives exact strict stationarity from the first plotted point; it is the initialization used in the figure in time series. Matching these first two moments alone does not guarantee strict stationarity for non-Gaussian inputs. See also stationary initialization of a scalar linear state-space model.
For the stationary causal AR(1) with , matching terms in its infinite moving-average representation gives, for ,
Symmetry of the autocovariance extends this to negative lags. Dividing by gives the autocorrelation . The geometric series explains both the enlarged stationary variance and the diminishing memory: all past disturbances contribute to the present, but their squared weights have a finite sum. At , the process reduces to shifted white noise and all nonzero-lag autocorrelations vanish. See Bartlett, lecture 4: AR(1) representation and mean-square convergence.
Autoregressive operator 2026-10-14
The autoregressive operator acts as . Its coefficients are encoded by the autoregressive polynomial. An ARMA equation equates this filtered observation to the noise filtered by the moving-average operator.
A permutation of order two is a product of disjoint transpositions. Its conjugacy class has the displayed size. For , equality with the transposition class requires . The left side grows strictly with . At , its ratio to the right side is one only for ; at it jumps from below to above one between and , and for it is already greater than one. Thus degree six is the only possible exceptional degree for an group automorphism not preserving transpositions.

There are unlisted articles, also show them or only show them.