Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A critical point of a smooth map is an input; a critical value is an output reached from at least one such input. For the fold , all inputs are critical points of a smooth map, and all outputs are critical values. The identical coordinate pairs live in different copies of . To classify an output , inspect its entire fiber of a function:For both inputs have matrix rank two, so the output is a regular value. For its input has matrix rank one, so the output is a critical value. For the fiber of a function is the empty set, and the output is a regular value despite being outside the image of a function.
In general, for a smooth map , write for its set of critical points of a smooth map. Its set of critical values is . Equivalently, is a critical value if some has a differential that is not surjective. A regular value requires a surjective differential at every input in that fiber of a function. The universal condition holds vacuously for an empty fiber of a function: every output outside is a regular value. These quantifiers are explicit in Loring W. Tu, An Introduction to Manifolds, Definition 8.22 and its two following remarks.
Regular circular fibers and a critical value reached from both critical and regular inputs
. Details. The distinction is useful when solving equations. For a smooth map between smooth manifolds without boundary and a regular value with nonempty fiber of a function, the regular level set theorem makes an embedded submanifold of dimension , with tangent spaceThe implicit function theorem explains the freedom count: locally, independent equations fix coordinates and leave free. The rank-nullity theorem gives the same count for the displayed kernel of a linear map. See Eckhard Meinrenken, Differentiable Manifolds, Theorems 1.11 and 1.15 for the local projection description and its consequence for level sets.
For example, , , has gradient and just one critical point, the origin, with critical value zero. For , its fiber of a function is the circle of radius , a one-dimensional embedded submanifold; negative are regular values with empty fibers. At , the fiber of a function is a single point instead of a circle. A critical value does not force its fiber of a function to be nonsmooth: that singleton is itself a zero-dimensional embedded submanifold, but the regular dimension conclusion does not apply.
Nor does a single regular input certify a regular value. The scalar smooth function has and derivative . The input zero is a critical point, while the input one is regular because . Their shared output zero is nevertheless a critical value. Conversely, different critical points of a smooth map can share one critical value: sends both critical inputs and to zero. Counting inputs and counting critical outputs are different tasks.
Finally, for , every output on the parabola is a critical value, and every output off it is a regular value with empty fiber of a function. There is no nonempty regular fiber of a function here, so the negative expression never becomes a claimed manifold dimension. Both diagrams show exact mathematical examples, not measured data.
On the augmented precedence graph, the linear programming problemhas dual , with a unit source-to-sink flow. Equivalently, the dual is the negative of the optimal uncapacitated minimum-cost flow value with arc costs . The flow selects a longest path, while the time variables provide a matching weak duality bound.
// Target: mathematical-optimization.bigb
Task float, also called total float or task slack, measures an activity's available start-time delay relative to its earliest start, while allowing a feasible schedule that meets the fixed project finish. For earliest start , latest start , and fixed duration , it isIn the six-activity project scheduling example with start zero and finish 10, B has task float 2 and E has task float 6. B can move from the interval to , and E from to , without changing D's or F's earliest starts. A, C, D, and F have zero task float. With the finish fixed to the optimal duration and the basic critical path method assumptions, zero task float identifies exactly the activities lying on at least one critical graph path. See Hendrickson, §10.4, Activity Float and Schedules.
Task float is not generally an independent allowance that can be spent separately on every activity. For a small example, let two duration-1 activities X then Y form one chain, running in parallel with a separate duration-4 activity. The optimal finish is 4. X has earliest/latest starts 0/2 and Y has earliest/latest starts 1/3, so each has task float 2. Delaying X to 2 forces Y to start at 3, using Y's allowance too. Choosing X at its latest start 2 and Y at its earliest start 1 violates precedence, although both chosen times lie inside their individual ranges. The optimization constraints still couple the decisions. Here B and E can both use their full task floats together because they lie on separate branches; that freedom must be checked from the directed acyclic graph.
// Target: mathematical-optimization.bigb
For a monotone inviscid parallel shear flow, let a regular neutral Rayleigh equation for inviscid shear flow mode have , , , and . A perturbation with resolves the singularity on the inner variable . The first outer correction has , with . The inner particular solution contains . Its complex logarithm has argument tending to zero at positive infinity and to at negative infinity, giving the displayed matching jump.
A credit rating is an ordinal assessment of an issuer's or obligation's creditworthiness. Agency scales group credits into broad investment-grade and speculative-grade classes, with default categories and rating transitions. A rating is not itself a calibrated default probability, and identical ratings do not establish independence or constant intensities of defaults.
A yield difference between a credit-risky instrument and a chosen benchmark, with maturity and other terms matched as appropriate. The benchmark and quotation convention must be specified. The spread may compensate for default losses, default-risk premiums, liquidity and other effects; it is not generally identical to a physical default probability or loss rate.
The risk that a trading counterparty defaults while owing a positive replacement value or settlement amount. It differs from the reference borrower's default exposure in a credit default swap. A credit hedge may fail precisely when its protection seller is distressed. Collateral, netting and margining change exposures and loss amounts; they do not turn every mismatched hedge into a risk-free claim.
In the basic structural model, the firm's asset value follows geometric Brownian motion with constant volatility and a single debt obligation of face value matures at . Default at maturity occurs when . Equity is a call on firm assets; debt is the risk-free face claim minus a put on those assets, since . This links debt valuation to asset value, volatility and capital structure. The basic model does not permit default before maturity; richer structural models add a default barrier or more detailed obligations.
Loss given default is the loss conditional on a default, measured as an amount or as a fraction of exposure under the chosen convention. In an independent marked default model the loss amounts are independent marks attached to the events of a Poisson process. Their raw second moment, not just their variance, controls the aggregate compound Poisson distribution variance.
Bayesian credibility estimates a risk's conditional expectation by its Bayesian posterior expected value under squared-error loss. When that posterior mean is an affine combination of exposure-weighted individual experience and a prior mean, the coefficient of the experience is its credibility factor. Exact Bayesian credibility is distinct from merely selecting the best affine estimator when the true posterior mean is nonlinear.
For a Hermitian fermion bilinear, an antiunitary operator implementing CPT conjugates numerical coefficients and exchanges particle and antiparticle fields at . Reordering the fermions then gives when . Thus scalar, pseudoscalar and tensor bilinears are even, while vector and axial-vector bilinears are odd. Each derivative contributes another minus sign. The graded reordering is essential; treating Dirac fields as commuting quantities gives the wrong transformation.
Under CPT, a Hermitian local tensor monomial picks up a minus sign for each Lorentz vector index, including derivative indices. A Lorentz scalar contracts all such indices, so the total sign is positive; charged terms are exchanged with their Hermitian conjugates. Therefore a local Hermitian Lagrangian density obeys , leaving its action invariant. This field-level argument illustrates the CPT theorem for ordinary scalar, spinor and vector theories; the axiomatic theorem also uses positive energy and microcausality.
In a CPT-invariant vacuum, a subatomic particle and its antiparticle have equal masses and total decay widths, equal spin magnitudes and opposite conserved additive charges. CPT exchanges initial and final states in a scattering experiment; it relates a process to the reversed process with antiparticles and reversed spins. It does not force equality of every pair of conjugate partial decay widths when CP violation is present.
A weak phase is a phase in a coupling or decay amplitude that reverses sign in the CP symmetry conjugate process. A physically relevant difference must survive allowed field rephasings; a complex coupling alone does not prove CP violation.
A direct CP asymmetry compares decay widths for a process and its CP symmetry conjugate. Let two decay amplitudes contribute with real nonnegative magnitudes , absorptive phases and weak phases . Then and . Expanding the absolute squares givesThus two nonzero contributions and both kinds of relative phase are required in this example. Equal total decay widths under CPT symmetry constrain the sum over channels and do not forbid individual channel asymmetries.
The vector current is odd and the axial current is even under charge conjugation. Under parity symmetry in quantum field theory, the first is a vector and the second a pseudovector. Thus their difference obeys under CP, with . If a neutral vector has under CP, the interaction transforms by the factor . It is invariant for . Being a real field restricts its intrinsic phases but does not alone fix this sign. The conventional C-odd neutral gauge-vector assignment makes real diagonal Z boson vector and axial couplings CP invariant, despite their separate C and P violations.
For a time step , choose the undiscounted stock multipliers and money-market multiplier asFor sufficiently small , and the risk-neutral up probability is . A one-step log-stock increment takes values ; expanding gives mean and variance . The Donsker invariance principle, in its triangular-array form, gives the risk-neutral log-price limitThus prices converge to the geometric Brownian motion used in the Black-Scholes model.[ref]
Option Pricing: A Simplified Approach by John C. Cox and others. Section5, manuscript pp.17 onward, small-step limits
The parent model's discounted multipliers are instead and . Their log-price drift loses the term, as required for the discounted price to be a martingale. Convergence of claim prices also needs the payoff functional to be continuous at almost every limiting path, together with Uniform integrability when payoffs are unbounded. A process limit alone does not justify taking expectations of every payoff.
A likelihood-based analogue of the coefficient of determination compares the fitted and intercept-only log-likelihoods and :For a Cox proportional-hazards model, these are maximized partial likelihood logarithms with and without the covariates. The expression measures improvement in fit, rather than the fraction of variation in event times explained. Its attainable maximum can be below one. It does not test the proportional hazards assumption or establish predictive calibration.
A homotopy into the base of a covering space has a unique continuous lift once its initial map is continuously lifted. Local inverse sheets construct the lift along each time interval, and compactness of that interval permits a finite subdivision locally around each point of the homotopy's parameter space. Uniqueness on overlapping intervals follows from path lifting theorem uniqueness. In a homotopy of paths with endpoints fixed, a chosen lifted endpoint remains fixed because it varies continuously in a discrete fiber.
An oriented coordinate neighborhood of a smooth manifold gives two sheets distinguished by the sign of its orientation. On an overlap, the sheets agree where the two local orientation forms differ by a positive function. These open agreement sets define a two-sheeted smooth covering space, whose projection is locally a diffeomorphism.
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






