The regular level set theorem says that a regular level of a smooth map from an -manifold to an -manifold is an -manifold. The corresponding sublevel-set theorem says that is a manifold with boundary when is a regular value of a smooth real-valued function, with the interior .
Apply this to on . On its gradient is nonzero. Thus is an -manifold and is an -manifold with boundary . Locally the implicit function theorem supplies as one coordinate; the ball occupies its nonpositive side, which is a half-space after reversing that coordinate. This also covers : the sphere consists of two points and the ball is the interval with those endpoints.
A regular value of a smooth map is one for which the differential is surjective at every . A value outside the image is regular vacuously. The condition concerns all preimages, not just one.
An embedded smooth -dimensional manifold has, around every point, a parametrization by an open subset of which is a homeomorphism onto a relative neighbourhood, has rank , and has smooth coordinate changes. Equivalently, after smooth ambient coordinates it is locally a coordinate -plane. For a manifold with boundary use relatively open subsets of instead, with parametrizations and transitions smoothly extendible across the boundary. Points corresponding to form the boundary. Interior charts are ordinary manifold charts; a boundary point is not a corner.
A singular point would satisfy , and . Thus and or . But and , both nonzero. The curve is smooth everywhere.
The complex implicit function theorem says that near a zero of a holomorphic function with a nonzero partial derivative, the corresponding variable is a uniquely defined holomorphic function of the others. Where , use as a local coordinate with ; where , use with . On overlaps the coordinate transitions are holomorphic with nonzero derivatives. These charts give a Riemann surface structure, and both coordinate projections are holomorphic in them.
A ramification point of a nonconstant holomorphic map is a point where in local coordinates the map has the form with ; its ramification, or branching, order is . For , take . Here , so is a local coordinate. Differentiating gives and . Therefore
The nonzero quadratic coefficient gives local degree and branching order . If “branching order” denotes local degree rather than its excess in a different convention, the corresponding value is two.
A rational function is a quotient of polynomials with . Cancel common factors. It determines a map on the Riemann sphere by assigning infinity at poles and assigning at infinity the limit in the sphere. Equivalently homogenize to the same degree and set . They have no common projective zero: finite ones would contradict coprimality, and at infinity at least one has a nonzero leading coefficient. This also proves the map is holomorphic.
The degree of the nonconstant rational function is . The degree of a holomorphic map of compact Riemann surfaces is the number of preimages of any target point, counted with local mapping multiplicity. For target , the homogeneous equation is a nonzero homogeneous polynomial of degree . Over it factors into linear factors, with multiplicity, giving exactly projective zeros. Locally its zero order is precisely the map's multiplicity, since the other target-coordinate denominator is nonzero. The two degrees are equal.
There is a Möbius transformation sending any ordered triple of distinct points to . When all are finite one can use ; the formulas for infinity are its limits. Define in the same way. Then sends to and restricts to a biholomorphism .
Let be the linear subspace of polynomials of degree at most . It has finite dimension , is proper in , and . For any norm on , the restricted norm on is equivalent to its coefficient Euclidean norm: on the coefficient unit sphere the continuous norm has a positive minimum and a finite maximum. Thus is complete. A complete subspace of a metric space is closed, since any sequence converging to an ambient limit is Cauchy and has the same limit in the subspace.
Part (b) makes each a closed set with empty interior, hence nowhere dense. If were a Banach space, this countable union would contradict the Baire category theorem. No norm makes the space of all polynomials complete.
If a linear subspace of a normed space contains an open ball , then and subtraction gives . For any , choose a positive scalar with . Then and hence . Thus . Every proper linear subspace has empty interior.
The Baire category theorem states that a complete metric space is a Baire space: the intersection of countably many open dense sets is dense. Equivalently, a nonempty open subset cannot be a countable union of nowhere dense sets.
Let be open dense and any nonempty open set. Choose a closed ball of positive radius at most inside . Inductively choose inside the interior of intersected with , with positive radius at most . Density makes this intersection nonempty, and openness supplies a sufficiently small closed ball. The centres form a Cauchy sequence because all later centres lie in , whose diameter tends to zero. Completeness gives a limit . Since each ball is closed and contains all later centres, for every . Thus , proving density. Applying this to complements of the closures of nowhere dense sets gives the equivalent formulation.
Write and . Since their common square-free discriminant is congruent to zero or one modulo four, it must be one modulo four; thus are odd. It is not a rational square because a square-free integer square is only zero or one. Both polynomials are irreducible over , and their roots generate the same quadratic extension . Their integral roots are and , respectively. Each generated order is
the usual ring of integers for square-free . This identifies both quotients with the same ring. Explicitly, if denotes the image of modulo , send the image of modulo to . Equal discriminants give , and the opposite translation gives its inverse. The two quotient rings are isomorphic.
The cubic has no rational root: its only possible integer roots are , and neither works. It is therefore irreducible. Let be its image in ; it is an algebraic integer, so . The power-basis discriminant is
The index-discriminant formula from part (i) says that the square of divides 59. It must be one. Hence , with integral basis and field discriminant .
For a basis of a module of the full-rank module , define its discriminant of elements of a number field by
The field discriminant is this determinant for an integral basis of . A change of integral basis with determinant does not change it. Write in an integral basis and let . The two trace matrices satisfy . The index of the lattice is , as follows for example from Smith normal form. Therefore
Multiplicative closure makes an order when it contains one, but the determinant argument itself requires only full finite index, so it also covers the stated module hypothesis without that extra condition.
Take a maximal matching in a graph with edges and let be its endpoints. Maximality makes its complement an independent set, since an edge wholly outside could be added. Every vertex outside therefore sends all its edges into , giving crossing edges. Every vertex in already uses at least one incident edge inside , its matched edge, so it sends at most outside. Hence
The maximum matching in a graph is at least this large. For , take any disjoint union of triangles. It is 2-regular, has vertices and matching number , since each triangle contributes exactly one edge. As varies this gives infinitely many equality examples.
Let be the two parts of the bipartite graph. Counting edges gives , hence . For , the edges incident to all end in , whose vertices have total capacity . Thus . Hall's marriage theorem gives a perfect matching, and no matching in a graph can have more than edges. The matching number is .
Hall's marriage theorem states that a finite bipartite graph with parts has a matching in a graph saturating exactly when for every . Necessity follows because the matched neighbours of are distinct.
For sufficiency use induction on . The empty case is immediate. If a nonempty proper subset has , the induced graph on satisfies Hall's condition and has a saturating matching in a graph by induction. The remaining graph on also satisfies it: for ,
Apply induction again and unite the two matchings in a graph. If there is no such tight proper subset, every nonempty proper has . Choose a vertex and a neighbour , which exists by Hall's condition. Delete both. Every remaining subset loses at most one neighbour and still satisfies Hall's condition. Induction supplies a matching in a graph of the remainder; add . For this last step directly proves the assertion.
For constant equation-of-state parameter , the cosmological continuity equation integrates to using today's normalization. In conformal time, , so the Friedmann equation becomes
Since , the Friedmann acceleration equation gives
For , put . When , integration gives . Integrating then yields the closed constant-equation-of-state Friedmann scale factor
Choose a connected interval with positive sine; the origin of conformal time can absorb . For this is the expansion and recollapse branch between consecutive zeros of the sine. Negative instead gives the corresponding minimum-radius branch on its positive-sine interval. The printed power formula excludes : in that exceptional case is constant and , with . A real solution requires the latter constant to be at least one; equality permits a static solution.
For pressure-free matter, , so . Set the big-bang origins to zero. The closed matter-dominated Friedmann solution follows by and integrating :
The entire cycle is ; maximum expansion has at , and the big crunch occurs at .
Multiply the Friedmann equation by and differentiate:
Insert the cosmological continuity equation to obtain
On a nonstatic branch divide by ; continuity extends the result across isolated turning points. The resulting Friedmann acceleration equation is
An everywhere static branch needs the independent spatial Einstein field equations: the two differentiated constraints alone cannot determine the pressure when . This is the qualification to deriving the acceleration equation solely by division.
By Gibbs inequality,
with equality exactly when . Put , a probability distribution. The optimal log-optimal multiplicative betting rate is
For this is strictly positive by Gibbs inequality; taking in the preceding strong law of large numbers bound proves growth with probability tending to one.
For the casino can set . Every optimal return multiplier is then exactly , so the fortune decreases deterministically as . More generally for that choice. An arbitrary choice with need not cause decline. For example, take , , . Then but . For any fixed positive , making one sufficiently small while preserving also makes the optimal rate positive.
Let be independent rolls with the specified probability distribution, and let be the fortune after games. Its multiplicative evolution gives
by the strong law of large numbers. The summands have finitely many finite values, so its hypotheses hold. For any , the probability that tends to one. Thus maximizing maximizes the typical exponential growth rate, the objective of log-optimal multiplicative betting. Maximizing expected fortune would be a different objective and would not control the typical repeated-game outcome.
For probability distributions with positive entries, Gibbs inequality is
with equality exactly when . Indeed, , with equality only at , gives
This also proves the equality condition. With zero entries the same Kullback-Leibler divergence statement holds using and for , or by restricting to the support and taking limits.
The applied pressure changes the dynamic condition to . For its specified spatial mode, the two amplitude equations become
When , the corresponding particular oscillation is
Free oscillations with amplitudes may be added. If the mode starts from rest at , its total amplitude instead is
Near resonance, the response grows too large for the linearization. At exact resonance the rest-start limit is , with secular growth. Dissipation or nonlinear effects would be required to limit it.

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