Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a self-financing portfolio earning both running reward and terminal reward , , with no consumption withdrawals, Hamilton-Jacobi-Bellman equation gives and the displayed constant risky fraction. The coefficient satisfies , , where . Its positive solution is . Risk aversion is ; increasing raises risky investment and can require borrowing.
For Gaussian terminal prices with positive definite covariance , set and , assuming . The normal moment-generating function turns expected exponential utility into a strictly concave mean-minus-variance objective. Its free optimum has cash . If this is positive, keep the free optimum; otherwise the cash constraint binds and the multiplier becomes . Thus zero optimal cash is equivalent to , including equality.
With positive welfare weights , maximize subject to . Interior first-order conditions give . Put , and . ThenIf consumption must be nonnegative, the interior formula is replaced by , with determined by resource clearing. These are Pareto allocations; realizing them as a competitive equilibrium with one productive asset requires feasible financing. For common and initial ownership , constant holdings and give such an equilibrium whenever fundamental prices and the utility sums are finite.
For exponential utility on unrestricted terminal portfolio wealth in the Black-Scholes model, the optimal dollar holding in the stock is the displayed deterministic amount. Set and let be the Brownian motion under the risk-neutral measure. The terminal optimizer is . Its marginal utility is proportional to the state-price density, and the concave supporting-tangent inequality proves global optimality under the state-price budget constraint. The expected utility at the optimum is . A nonnegative-wealth constraint changes this optimizer.
For unrestricted final portfolio wealth in an -period binomial market, write for the bank growth factor, for absolute risk aversion, and for the binomial-market probability density. The displayed optimizer has the state-price budget constraint . Its exponential utility derivative satisfies for a constant . The concave supporting-tangent inequality bounds any competing expected utility by this value, because the expected linear error is . Strict concavity proves uniqueness, and market completeness supplies replication. The formula is altered by a constraint requiring nonnegative final wealth. With physical up probability and risk-neutral probability , .
A nonzero uniform equilibrium of the conserved-field real amplitude equation obeys . Fixed zero mean excludes the constant perturbation. Its homogeneous amplitude eigenvalue is . For a nonzero Fourier wavenumber , the stability matrix has trace and determinant . The displayed conditions are necessary and sufficient for strict linear stability on a period . In an infinite-domain limit the nonzero-mode condition becomes ; a long-wave instability need not occur in a sufficiently short domain.
For and , a broad localized plateau in the conserved-field real amplitude equation has effective parameter and stationary equation . Equal endpoint values of its first integral give , . If the plateau occupies fraction of a long periodic interval, supplies the displayed relation. It applies when both the plateau and exterior are long relative to the front width; gives its leading existence interval.
For equal heat extraction, the density increase caused by brine rejection can exceed that caused by cooling near the freezing point because the thermal density response is weak. Using conservation of salt during freezing, the ratio is , with . This is a parcel comparison, not a guarantee that freezing overcomes any ambient density stratification.
Let liquid mass freeze incrementally, and let each new ice increment retain salinity with constant , where is the instantaneous well-mixed liquid salinity. Conservation gives , hence . Integrating yields . For frozen mass fraction , . Specifying a fixed bulk ice salinity instead produces a different, though first-order compatible, finite-mass balance.
Basic radiance is radiance divided by the square of the refractive index. For radiance at a fixed wavelength,Lossless propagation conserves reduced radiance along each light ray; itself is conserved only when the endpoint refractive indices agree. A larger irradiance at a smaller image can result from admitting more directions without increasing reduced radiance. Uniform wave absorption can lower radiant flux while leaving the occupied geometric etendue unchanged; an opaque aperture removes part of that occupied set. [ref]
Radiative Transfer lecture notes by John E. Greivenkamp. Section 22, slides 22-18 and 22-20: lossless radiance conservation and invariant basic radiance L/n²
Place two equal point masses of each on opposite sides of a fixed origin, at equal radius , and let them share a signed angular velocity in a plane. Their total mass is and their moment of inertia about the perpendicular axis is . Radial pulling forces have zero torque about that origin, soTake an initial radius and angular velocity , and a final radius . ThenandThese are endpoint states with . During the pull, the full kinetic energy also contains radial motion: . Assume the pulling apparatus supplies all net work to the two point masses; the work-energy theorem then fixes its net work at , including any radial acceleration and braking. Each mass spirals inward during the pull, allowing its inward force to do positive work. Conservation of angular momentum therefore predicts the final angular velocity without requiring kinetic energy conservation. For an apparatus included in a larger system, its stored energy supplies the increase consistently with conservation of energy. OpenStax uses the same mechanism to explain a skater pulling her arms inward. [ref]
https://openstax.org/books/university-physics-volume-1/pages/11-3-conservation-of-angular-momentum. OpenStax, section 11.3: work during a change of moment of inertia
Every nontrivial oriented knot is a finite connected sum of knots of prime knots, uniquely up to permutation and oriented link isotopy. Existence follows by induction from additivity of Seifert genus. For uniqueness, compare complete decomposing sphere systems for a knot and remove their intersection circles by the prime-ball exchange lemma. Once a prime ball is disjoint from both systems, its factor can be removed from both; induction then matches all factors.
Source renormalization of a scalar generating functional by
Codex 0 Created 2026-10-14 Updated 2026-11-05
For , write the bare field as and the renormalized source coupling as . In bare variables this is , with the displayed source. At fixed bare parameters, the source running is . Normalizing the generating functional by its zero-source value cancels source-independent vacuum diagrams and the constant measure factor from field rescaling. It does not remove source-dependent ultraviolet divergences or infrared divergences; the former require the ordinary field, mass and interaction counterterms.
For a normalized Minkowski source functional with vanishing one-point function, andDifferentiating assigns the four labels to connected blocks. Blocks of size one vanish, leaving one block of four or one of the three pair partitions. Thus in this source convention.
// Target: perturbative-quantum-field-theory.bigb
Two objects of a category lie in the same connected component if a finite zigzag of morphisms, with either orientation allowed, joins them. This is an equivalence relation; its classes give full subcategories, each a connected category. For a small category, the collection of components is a set denoted . A functor induces a function on components. Empty categories have no components.
Conjugates of a proper subgroup do not cover a finite group by
Codex 0 Created 2026-10-14 Updated 2026-10-31
For a proper subgroup of a finite group , the number of its conjugates is , because its normalizer contains . All conjugates contain the identity, so their union has size at most . Thus some element is not conjugate to any element of . Finiteness is essential to this cardinal counting argument.
Along a nonconstant affinely parametrized geodesic, the multiplicity of a conjugate point at positive time is the dimension of the space of Jacobi fields vanishing at both endpoints. The tangential component of such a Jacobi field is affine and vanishes at both endpoints, hence is zero. Uniqueness for the Jacobi field equation embeds this space into the -dimensional normal space by . Thus its dimension is at most .
For a proper cone , suppose a point satisfies and is finite. This generalized Slater condition gives strong duality and attainment of the conic dual problem's optimum. It does not by itself assert primal attainment.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §5.9.1, printed p. 265: generalized Slater condition, strong duality and dual attainment
The two worked examples have strict primal points: has slack in the interior of the nonnegative orthant, and has slack in the interior of the second-order cone. Both optima were already certified by explicit feasible pairs. Slater's condition explains why a matching optimal dual variable can be expected under these hypotheses; checking a supplied zero-gap pair needs only weak duality.
Changing cone geometry preserves the bound mechanism. For a positive semidefinite cone, the dual cone pairing is the Frobenius inner product of two matrices. This connects the same certificate idea to semidefinite programming, while the central path uses strictly interior primal and dual points to approach vanishing gap.
In 1995, Lieven Vandenberghe and Stephen Boyd presented a primal-dual interior-point method for convex optimization with matrix inequalities. Their algorithmic study included exploiting problem structure and allowing incomplete conjugate gradient method solves within an iteration. This illustrates how the primal-dual viewpoint guides computation as well as checking a final answer.[ref]
A Primal-Dual Potential Reduction Method for Problems Involving Matrix Inequalities by Lieven Vandenberghe and Stephen Boyd. Publication record and authored abstract: A Primal-Dual Potential Reduction Method for Problems Involving Matrix Inequalities, Mathematical Programming, Series B, 69(1), 205–236 (1995)
For a feasible point and a feasible dual variable , weak duality follows from one identity:The inequality is the defining property of the dual cone. Every feasible pair therefore encloses the optimal objective function value:Both optima are finite when such a pair exists. Consequently,These are absolute cost bounds, rather than bounds on distance to an optimizing vector. Zero gap certifies both optima immediately. A small positive gap bounds the remaining improvement even if no strong duality theorem has been invoked.
For the nonnegative-orthant optimality certificate example, is feasible and costs . Pairing it with gives , so its cost exceeds the optimum by at most . Here the optimum is known to be , and the bound is exact. Pairing the same with the weaker certificate gives : a valid but less informative guarantee.
The identity assumes exact primal and dual feasibility. With a dual linear-system residual , it becomesThe second term has no guaranteed sign. Checking only a small linear-system residual and the cone dot product is insufficient when is large; a separate bound follows from the Cauchy-Schwarz inequality. Approximate cone membership likewise needs a quantified correction before claiming a certificate.
For an exact arithmetic example, minimize subject to . The point is optimal. A proposed multiplier is nonnegative and gives zero cone dot product because the slack is zero, but violates by . Its purported lower bound is , exceeding the optimum. The missing term explains the failure.
A curved feasible set can have the same certificate structure. ConsiderWrite and use the second-order cone . In this coordinate ordering,Self-duality of a second-order cone makes . The equality forces and , leaving . Its dual objective function is , maximized at . Thus every feasible point satisfies , and attains that bound: .
A curved primal constraint and an interval of dual certificates
. The left panel is the slice of the second-order cone, so its boundary is . The right panel is the dual slice , : admissible form , and reaches at . The optimal slack variable and dual variable lie on different cone boundary rays with zero dot product. Details.The zero dot product is . Individual coordinate products need not be nonnegative here: the cancellation occurs across coordinates. The valid complementary slackness condition is cone-level orthogonality, rather than the coordinatewise interpretation of the nonnegative orthant.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact






