The dual linear program is the minimization problem
Indeed, for the optimization Lagrangian bounds the primal objective above on its feasible points. Its supremum over is finite precisely when , and then equals . The two labelled parts below establish the relevant weak duality and strong duality conclusions.
For the subsequent infeasibility argument, introduce nonnegative slack variables and the convex cone
This is generated by the columns of and the coordinate vectors. Here is why this finitely generated cone is closed. Any representation with a minimal number of positive coefficients uses linearly independent generators: otherwise subtract a suitable multiple of a dependence until one positive coefficient vanishes, preserving nonnegativity. For each fixed independent selection of generators, its nonnegative combinations form a closed set, because the inverse coordinate map on its span is continuous. There are finitely many selections, so their union is closed. This is the closedness of finitely generated cones used in Farkas' lemma.
When the primal linear program is infeasible, . Let be the nearest point of to , and set . The minimizing property gives for every . Taking gives . Consequently
In particular and . Rescaling by the positive number produces the requested Farkas' lemma certificate:
Now a feasible point of the relaxed inequalities would satisfy
Since , the sum of the nonnegative is positive. Thus robust infeasibility under uniform constraint relaxation gives
The ellipsoid method makes progress by reducing the volume of a containing ellipsoid. A nonempty linear polyhedron may have empty interior, so small volume alone cannot certify that the original system is infeasible. Relaxing the inequalities remedies this difficulty, but must not make an infeasible system appear feasible. The displayed positive gap proves exactly that sufficiently small relaxations preserve infeasibility. For rational input, determinant bounds give a Farkas' lemma certificate of polynomial encoding length, so a sufficiently small rational relaxation can be chosen from the input encoding length. Together with a bounding box and bounds on the volume of a relaxed feasible system, this lets the ellipsoid method distinguish infeasibility from a feasible system of very small or zero original volume in polynomial time. The certificate argument alone does not assert a polynomial precision bound for arbitrary unencoded real coefficients.
An abelian category is an additive category with kernels in a category and cokernels in a category in which the canonical comparison from coimage to image of every morphism is an isomorphism. This is the standard image-coimage form of the definition, equivalently expressed by normality of every monomorphism and epimorphism. Additivity means abelian-group hom-sets with bilinear composition, a zero object and finite biproducts. A sequence is exact at an object when the image of the incoming morphism is the kernel in a category of the outgoing one.
For , construct and . The universal properties give : first kills its kernel in a category and factors through ; then the resulting map is killed by because is epic, so it factors through . The comparison is invertible by the abelian axiom. Cokernels in a category are epic and kernels in a category monic, directly by uniqueness in their universal properties, so is epic and monic. Thus .
In a short exact sequence , we have and , up to the canonical isomorphisms. If retracts , the map kills and factors as for some . Composing with gives , so epicity gives . Conversely if , then is killed by and factors as . Composing with gives , so monicity gives . Consequently
In that case .
For the derived-functor requests, use additive right exact functors, as customary in abelian homological algebra. An abelian category with enough projectives permits an augmented projective resolution , obtained by repeatedly taking an epimorphism from a projective onto the previous kernel in a category. Apply and define
Projective lifts construct maps of resolutions; the comparison and chain-homotopy results make the construction independent of choices and functorial. For a short exact sequence, the horseshoe construction produces a degreewise split short exact sequence of resolutions, hence of their images under additive . Its homology objects give the long exact sequence
This supplies the requested sketch; detailed comparison and functoriality proofs are not needed here.
A projective object has a resolution concentrated in degree zero, so for every such . Conversely choose with projective, and take with target . Precomposition makes this covariant to the opposite category. The usual left exactness of contravariant Hom, which follows directly from the cokernel in a category universal property, says exactly that this is right exact in that opposite target. If , the long exact sequence and make monic in . Equivalently,
is epic, hence surjective, in abelian groups. The identity of has a preimage, giving a retraction of . The sequence splits, and is a direct summand of , hence projective: a lifting problem for extends along the projection , is solved for , and restricts along the summand inclusion. Therefore
This is projectivity detected by all first left derived functors. The following parts prove the three requested equivalent formulations of a hereditary abelian category with enough projectives.
A balanced category is one in which every morphism that is both monic and epic is an isomorphism. If a faithful functor sends to an isomorphism, then is monic: equality becomes , cancellation gives , and faithfulness gives . The same argument on the other side makes epic. Balance therefore makes an isomorphism. Thus a faithful functor out of a balanced category reflects isomorphisms.
Under the adjunction, the transpose of is . Hence if is faithful, forces and then , making every monic. Conversely, if the unit is pointwise monic and , naturality gives , whence . Therefore
We also use the standard adjunction fact with its justification: is full and faithful exactly when is invertible. Indeed the composite hom-set map is postcomposition by . If is full and faithful these maps are bijective; taking produces a right inverse, and taking gives injectivity and therefore a left inverse. Conversely an invertible unit makes these hom-set maps bijective.
For the final example, view the two-element ordered set as a category , and let have one object and only its identity. The unique is left adjoint to the functor selecting , since every is a singleton. Every arrow in an ordered-set category is monic, so the unit arrows and the identity counit are monic. But is not full: is empty whereas is a singleton. The example does not contradict the upcoming equivalence because is not balanced; its arrow is both monic and epic but not invertible.
The comma category has objects with and a set map. A morphism is an arrow such that . Composition and identities are those of . For , this is the category of elements of : objects are with and arrows satisfy .
Associate to the covariant representable functor . An arrow of gives, by precomposition, . Thus this is a diagram . There is a compatible natural map sending to .
Colimits in this functor category are pointwise. At an object , the induced map from the colimit sends a class represented by to . It is surjective because is represented by . It is injective because every representative with value is identified with that same canonical representative: the arrow in becomes an arrow of the indexing diagram sending to . These bijections are natural in , proving
Smallness of and set-valuedness of ensure that is small, so the displayed colimit is defined. This proves the introductory density request before the three equivalent conditions.
The Higman embedding theorem says that a finitely generated group embeds in a finitely presented group if and only if it has a recursive presentation of a group, that is, a presentation on finitely many generators with a recursively enumerable set of relators. We use its embedding direction as an assumed theorem. The reverse direction follows by expressing subgroup generators as words in the larger group and enumerating finite products of conjugates of its relators and their inverses; comparison after free reduction enumerates all null words in the subgroup. This is the enumerable identities of finitely generated subgroups argument. The theorem does not assume that the recursively presented group's word problem for a group is decidable.
Use the Riemannian curvature two-form convention
and define its four-covariant Riemann curvature tensor by . This makes positive on an orthonormal two-plane of the unit sphere. The full algebraic symmetries are
Together with multilinearity, these are antisymmetry in each pair, interchange of pairs, and the first Bianchi identity.
Define the Ricci tensor by the basis-independent contraction
for any orthonormal basis . The trace is invariant under change of basis, and contraction of the smooth curvature tensor gives a smooth covariant two-tensor. Pair interchange gives , so . Thus the Ricci tensor is a symmetric covariant 2-tensor.
The sectional curvature of the two-plane is
Both numerator and denominator multiply by the square of the determinant under a change of basis of , so this is a plane invariant. The directional Ricci curvature of is . For an orthonormal basis beginning with , it equals the sum of the sectional curvatures of the planes containing that basis vector.
In dimension three, suppose this directional value is at the point under consideration. For any orthonormal triple , put . Then
so all three are . Every two-plane can be the span of the first two members of such a triple. Consequently
This is a pointwise conclusion, as required; it uses sectional curvatures from Ricci curvature in dimension three and asserts no spatial constancy.
For the product, the canonical identification defines the product Riemannian metric
It is smooth in product charts and positive definite, since a nonzero vector has a nonzero component in at least one factor. Those components are orthogonal. The coordinate connection computation in the subparts below gives
Taking the trace in orthonormal bases of the two factors therefore gives .
For the final example choose the two round unit spheres. Each has sectional curvature one and Ricci tensor equal to its metric. Hence the product has , so every directional Ricci curvature is one. A two-plane tangent to one factor has sectional curvature one, whereas a mixed two-plane has sectional curvature zero by (iii). This gives constant Ricci curvature without constant sectional curvature:
Both kinds of plane occur at every point, so the sectional curvatures fail to be constant even at a single point.
For closed connected oriented -manifolds, the degree of a map between oriented manifolds is the integer defined by in . If has finite fiber , choose disjoint small neighbourhoods containing no other points of that fiber. The map of local relative homology groups
sends the local orientation generator at to times the one at . This integer is its local degree of a continuous map, independent of the small neighbourhood by excision. Excision also identifies with the direct sum of the local groups, and the global fundamental class restricts to their orientation generators. Naturality of the maps to relative homology therefore proves the degree as a sum of local degrees:
The empty fiber gives degree zero. For smooth maps at a regular value, a local degree is the sign of the derivative determinant, but general continuous maps can have larger local multiplicities.
For the unrestricted zero sequence, introduce the Weierstrass elementary factors
For , cancellation of the first terms of the logarithm power series gives a holomorphic logarithm of the factor:
Define the canonical product
Fix any compact disc . Since , eventually uniformly on this disc. The tail logarithms are then bounded by , a summable bound independent of . Their sum is holomorphic by locally uniform convergence of holomorphic functions, and its exponential is nowhere zero. Multiplication by the finite initial product therefore gives an entire function. Each factor has a simple zero exactly at its specified , the exponential factor has none, and a tail beginning beyond any given compact disc is nonvanishing there. Thus has precisely the prescribed zeros and no others, each simple, and . This proves the required existence without an assumption on .
For the final, unheaded product request, suppose now that . On , all sufficiently late factors have , so part (a) bounds their principal complex logarithms by . The logarithms converge absolutely and uniformly; infinite product convergence from logarithmic tails proves that
is entire and again has exactly the prescribed simple zeros. For its finite partial products,
Passing to the limit proves
In particular is an entire function of exponential type. This argument uses a valid modulus estimate and does not require the false logarithm assertion in part (c).
Choose , and . On this smaller closed polydisc, the holomorphic function and its -derivative are bounded; write and . Choose with and , replacing a zero bound by any positive upper bound if necessary, and choose .
Consider functions continuous on , jointly holomorphic in the interior, with and . This is a closed subset of a Banach space in the supremum norm. The integral operator
is well defined on the straight segment and is jointly holomorphic. Indeed, it equals , an integral of jointly holomorphic functions locally uniformly bounded in both variables. Convexity of the -disc and the derivative bound give
Thus the Banach fixed-point theorem gives a fixed point . More explicitly, the successive integral iterates starting from zero converge uniformly, and locally uniform convergence of holomorphic functions makes their limit jointly holomorphic. Differentiating the integral equation gives the required complex ordinary differential equation and initial value. This proves local existence, uniqueness and joint holomorphic dependence on . Uniqueness among arbitrary local solutions follows first on a small disc where their values stay within , by the same contraction mapping estimate, and then throughout their common connected domain by the identity theorem.
For holomorphic dependence of ordinary differential equations on parameters in the initial value, fix an admissible initial value and put . The equation becomes
Its right-hand side is jointly holomorphic in near . The preceding construction supplies a common disc and a jointly holomorphic solution for near . Consequently is jointly holomorphic in and its initial value .
Take a nonzero complex unital Banach algebra, with identity . The spectrum of an element is
The standard Banach algebra spectrum theorem states that it is a nonempty compact subset of , contained in the disk . Conversely, every nonempty compact set occurs: in the Banach algebra , the coordinate function has Banach algebra spectrum exactly , since has a continuous reciprocal precisely when . Thus the possible Banach algebra spectra are exactly the nonempty compact subsets of the complex plane.
For a nonconstant polynomial , factor over . Substitution gives
These factors commute. A finite commuting product is invertible exactly when every factor is invertible: if is invertible, its inverse commutes with each , and is a two-sided inverse. Hence belongs to the Banach algebra spectrum of exactly when some root belongs to , which is equivalent to . Constant polynomials give the same result directly, since . This proves the polynomial spectral mapping theorem:
For a closed unital Banach subalgebra , use the common identity . An inverse in is an inverse in , so . Let . Choose tending to . Then , and . If were outside , continuity of inversion in would give
where membership follows from closedness. This would make , contrary to the closed Banach algebra spectrum having its boundary inside it. Therefore and is approached by points outside that Banach algebra spectrum, proving
Continuity of inversion here follows, for example, by writing a nearby element as an invertible element times a norm-small perturbation and using the Neumann series. This is spectrum in a closed unital subalgebra.
To retain the original Banach algebra spectrum in a commutative subalgebra, take the resolvent-generated commutative algebra
Every generator commutes with and with every other generator: commuting invertible elements have commuting inverses, and their inverses commute with all elements commuting with them. commutativity persists on the algebra they generate and on its norm closure. For every , the required inverse is in by construction, so . The inclusion for unital subalgebras gives the reverse containment. Hence .
Finally, the Banach subalgebra generated by one element is , and it is commutative. Put and suppose its complement has a bounded connected component . The boundary of lies in . For , the maximum modulus principle on a bounded domain applied to any polynomial gives
Here is the spectral radius, and the equality uses the already proved polynomial spectral mapping theorem. Define . The displayed bound makes this well defined, even when two polynomials represent the same algebra element, and bounded on the dense polynomial algebra. Its continuous extension to remains linear and multiplicative, with and , so it is a character of an algebra. If were invertible in , applying to its inverse equation would give . Thus , contradicting .
There are therefore no bounded complementary components. A compact subset of the plane has exactly one unbounded complementary component: everything outside a sufficiently large disk is connected, and every unbounded component meets it. Consequently
Let and choose with . The parallelogram identity gives
Completeness and closedness give , attaining the distance. Put . For and real , minimality gives , so . In a complex Hilbert space, also replace with to get the imaginary part zero. Therefore
The decomposition is unique since . This proves the required orthogonal projection result rather than assuming it before the averaging argument.
If never vanishes on , integration by parts gives , hence for smooth . Endpoint terms usually attain this order; special cancellation can give faster decay.
For the final integral, take the imaginary part of . Its sole stationary point is , with and . The stationary phase formula in part (a) therefore gives
An irreducible continuous-time Markov chain is positive recurrent when the mean return time to a state is finite, and null recurrent when return occurs almost surely but the mean return time is infinite. For the nonexplosive chain here, whose rates are bounded, positive recurrence is equivalent to existence of a normalized stationary distribution. All rates are understood to be positive.
For a positively oriented simple closed curve on which the vector field is nonzero, its Poincaré index is the total rotation of the vector field along that curve divided by , equivalently the winding number of its normalized direction. The Poincaré index of an isolated fixed point is that of a sufficiently small enclosing curve containing no other fixed point. The index of a planar periodic orbit is .
Let be the constant function and define . Positivity gives . Fix any and any continuous . The function vanishes at , so the zero-preserving assumption gives . By linearity this is . Since was arbitrary,
This proves the zero-preserving linear operator on continuous functions representation. Zero preservation and linearity determine the multiplication operator; positivity is needed only for the multiplier's sign. The three numbered conditions in the source are hypotheses of this one request, rather than three separate subquestions.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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