The constructible hierarchy is , and at limits; . Definability allows parameters from the current level. Satisfaction for a set-sized level is recursively definable, so this is a definable class construction in ZF. Induction shows its levels are sets, increasing and transitive, and contain every ordinal below their height.
We give the necessary reflection argument to check its full axiom schemes. For any finite collection of formulas, close it under subformulas and negation. Starting at any level containing the desired parameters, for every existential subformula and parameter tuple in that level for which a witness in exists, take the least constructibility stage containing such a witness. These least stages are uniquely definable ordinals; ambient replacement bounds all of them. Enlarge to a level beyond the bound, repeat countably many times, and take the union stage . Every existential witness required by a tuple in is then already in , because the tuple appeared at a previous stage. Induction on the finitely many formulas gives
This uses a truth definition for each fixed finite list, not a truth predicate for the entire ambient universe.
Extensionality and foundation hold in by transitivity. Pairs and unions of elements of a level are definable subsets of a sufficiently large transitive level. The hereditarily finite sets appear in , and the set of its finite ordinals is definable there, so and infinity holds. For separation on with parameters in , reflect the relevant formula into a level containing them and . The desired subset of is then definable over , so belongs to .
For replacement, suppose says defines a unique value in for each . The relativization is an ambient formula. Ambient replacement collects its values, and replacement applied to their least constructibility stages bounds them all in some . Reflect the formula in a still larger level containing , the parameters and those values. The range is now a definable subset of that level, so lies in . For power set, the ambient set exists by separation. Its members' constructibility stages are bounded, say all members lie in with . Then
is definable over ; transitivity makes the displayed bounded subset condition absolute. Thus this internal power set also belongs to . We have proved .
Finally define its canonical well-order recursively. At a successor stage, code a definition by its formula number and its finite tuple of parameters, ordered by the already constructed well-order of the previous level. Order new elements by their least definition codes, preserving earlier elements first. At a limit take the coherent union, with first-appearance stages providing the primary comparison. Induction makes every level well-ordered and gives a definable class well-order of . Its restriction to any set in belongs to by separation, so every such set is internally well-orderable. Hence
The implication is a relative consistency argument, not a proof by ZF of its own consistency.
Now Shepherdson's wall explains the limitation of this method. If is a transitive inner model containing all ordinals, its constructible levels agree with the ambient ones. At successors both compute definable subsets of the same set-sized structure, with the same finite formulas and parameters; at limits both take the same union. Thus . In an ambient universe satisfying , this forces . Therefore a uniform inner-model construction valid in every model of ZF cannot always yield an inner model with , nor one failing choice or CH: apply the proposed construction in a model of ZF with . The construction of removes nonconstructible sets and proves positive choice consistency; it cannot manufacture the nonconstructible sets needed for those negative results.
Here is the first incompleteness theorem in its modern consistency form: every consistent computably enumerable theory extending Robinson arithmetic is incomplete. The original Gödel sentence proof assumes omega-consistency to obtain both unprovabilities; we give that proof and the strengthening that removes this assumption. We also give the second incompleteness conclusion for theories extending Peano arithmetic.
First arithmetize syntax. Code strings and finite derivations by natural numbers. If the axioms of are merely computably enumerable, include the finite enumeration certificate for each nonlogical axiom used in a proof. The resulting proof-checking relation is primitive recursive. Finite strings and computation histories are coded by finite sequences, with bounded local verification of every step; these give arithmetic formulas representing the coding operations. In Robinson arithmetic every true or false instance with fixed numeral inputs is provable with the appropriate sign. Set
The diagonal lemma gives, for any formula , a sentence with . To see the construction, let be the computable syntactic operation substituting the numeral for into the formula coded by . Form the formula , interpreting the displayed coding function through its arithmetic representation, and let . Then , and . The representation proves that fixed computation, giving the asserted equivalence.
Apply the diagonal lemma to , obtaining
If , an actual finite proof has code , so proves its proof-checking instance and proves . The fixed-point equivalence gives its negation, contradicting consistency. Hence . For each standard numeral , proves because there is no such proof. If , the equivalence gives , contrary to omega-consistency. Thus the original proof gives two unprovabilities under that hypothesis. It also shows that is true in the standard natural numbers when is consistent.
For consistency alone use the Rosser sentence
If with code , consistency excludes every proof of . In particular the finitely many codes all fail their primitive recursive proof tests. Robinson arithmetic verifies those finitely many failures and the actual proof at , and hence proves , a contradiction. If with code , consistency excludes every proof of . For , Robinson arithmetic verifies all the finitely many failed proof tests. For , it verifies that is a proof of with . The elementary arithmetic dichotomy between and therefore proves the entire displayed condition, hence , again a contradiction. Thus
For the Gödel second incompleteness theorem, now assume and use its ordinary certified proof predicate. PA formalizes proof concatenation and the verification of a coded proof, giving the derivability conditions: if then ; and inside ,
The first internal implication is certified by combining two proofs; the second is certified by producing the arithmetic proof that a given finite proof passes its check, with existential introduction. Apply them to . From , the two internal implications yield provability of both and its negation, and hence provability of . Consequently
A proof of this consistency sentence in a consistent would prove , which the first argument excludes. Therefore . This concerns the standard arithmetic consistency sentence and the stated effective, arithmetic hypotheses; it is not a prohibition on proving consistency in a stronger theory.
For nonempty first-order structures and an ultrafilter on , define the ultraproduct by quotienting the product domain by
Functions are interpreted coordinatewise; a relation holds when its coordinate truth set belongs to the ultrafilter. Closure under finite intersections makes these interpretations independent of representatives. The Łoś theorem asserts, for every formula ,
Prove it by structural induction. A term evaluates coordinatewise, by induction on its construction, so atomic equality and relations are exactly their defining truth sets. Conjunction uses intersection; negation uses the ultrafilter property that exactly one of a set and its complement belongs to . These establish all Boolean connectives.
For the existential step put . If an ultraproduct witness exists, induction says , and this set is contained in , so . Conversely if , choose a witness at every and any domain element at the other coordinates. Induction makes a witness. This coordinatewise selection uses choice in the metatheory; nonemptiness of the factors is essential. Universal quantification follows from negation and existence, completing the proof.
For the requested compactness theorem, let . For each finite , choose . For each sentence , its cone is nonempty, and intersections of finitely many cones contain the finite union of their requirements. These cones generate a proper filter. The ultrafilter lemma extends it to . The coordinate models satisfying include , so the Łoś theorem makes their ultraproduct satisfy . Since this holds for each , the ultraproduct is a model of . No completeness theorem is needed in this second compactness proof.
The Godel completeness theorem is strong completeness: for any first-order theory and sentence ,
Equivalently every syntactically consistent theory has a model. Work in the ordinary classical metatheory with choice; the language need not be countable. Soundness is induction on a derivation: logical axioms hold under every assignment, modus ponens preserves truth, and the quantifier rule preserves truth when its variable is not free in the assumptions. We prove the nontrivial converse by a Henkin construction.
Start with a consistent and add a constant if the language has no closed term. Let be this language. At stage , for every existential sentence of , add a fresh constant and the witness axiom
An axiom of this form is conservative for consistency: if a contradiction followed after adding it, the old theory would prove its negation, hence both and . Since the constant is fresh, replace it by a fresh variable and generalize, obtaining , a contradiction. Every finite set of new witness axioms can be handled one at a time, so each stage remains consistent. Their union is consistent because a finite proof uses only finitely many stages.
Well-order the sentences of . Successively add a sentence if doing so is consistent, and otherwise add its negation. At least one of those two choices preserves consistency: otherwise the deduction theorem would give both its negation and its double negation in the previous theory. At limits take unions. The deductive closure of the resulting union is complete and consistent and retains all witness axioms. Every sentence of uses finitely many symbols and belongs to some , so its existential witness was added at the next stage. Thus has the Henkin witness property even for formulas using the new constants.
Build its term model. The domain consists of closed terms modulo iff . Equality axioms make this an equivalence relation and a congruence. Interpret functions by forming their corresponding terms, and interpret a relation by iff . Congruence makes this independent of representatives.
The truth lemma for a Henkin term model is proved by induction on formulas after substituting closed terms for their free variables. Atomic formulas are the definition. Completeness and consistency of give the Boolean steps. For existence, if , a witness axiom yields a constant with , and induction supplies a model witness. Conversely every domain element is a term class, so a model witness gives an instance in , and existential introduction gives the existential sentence. Universality follows by negation and existence. The model therefore satisfies , hence .
Finally, if , then is consistent by the deduction theorem and classical logic. Its constructed model is a countermodel to . This proves completeness, with an actual witness model rather than merely a finite-satisfiability assertion.
Assume is left exact for every additive right exact . For with projective, left exactness makes a monomorphism. Hence . Dimension shifting then gives . As are arbitrary, (iii)(ii), completing
The argument also recovers projectivity of every such kernel in a category directly from the universal first-derived-functor criterion.
Assume for every additive right exact functor into an abelian category. Given a subobject of a projective, let be its cokernel in a category. The sequence is exact, and dimension shifting gives for every . The projectivity criterion proved in the root solution makes projective. This gives (ii)(i).
For any short exact sequence , the long exact sequence now starts at the relevant place with
It is exact because the preceding term vanishes. This is precisely left exactness of , proving .
Assume subobjects of projectives are projective. For any object , choose with projective. The kernel in a category is projective by the assumption. The derived long exact sequence gives a dimension-shifting isomorphism
because . The right side is zero because is projective. Since and the right exact functor were arbitrary, .
Assume is full and faithful and its image is closed under regular quotients. Its unit is invertible, hence monic. Factor the counit using the hypothesis on :
with regular epic and monic. Closure gives for some . A right adjoint preserves monomorphisms: postcomposition with on corresponds under adjunction to postcomposition with on , which is injective. Thus is monic.
The triangle identity and invertibility of give , so is invertible. A monomorphism whose composite with another arrow is an isomorphism is itself split epic and hence an isomorphism; therefore both and are isomorphisms. The arrow is between objects in the essential image of the full and faithful . After choosing , write it as . Naturality of the invertible unit identifies with , so invertible implies and hence invertible. Now is monic. This proves .
Assume both unit and counit are monic. The unit criterion makes faithful. The triangle identity is . Since is monic, this split epimorphism is an isomorphism: cancelling it in gives . Thus is invertible. As is balanced, the reflection result in the root solution makes invertible. Hence is full and faithful.
Let be a regular epimorphism. Its adjunct factorization is for . A regular epimorphism is extremal: if a coequalizer factors through a monomorphism , its other factor also coequalizes the defining pair, descends through , and gives a right inverse for ; monicity then makes invertible. Apply this to the monic . More explicitly, if coequalizes , monicity gives , so there is with . Then implies , and monicity gives . Therefore . The image is closed under regular quotients, proving .
Every covariant representable functor preserves categorical limits: arrows from its representing object into a limiting object are exactly compatible cones of arrows into the diagram. Apply the density formula proved in the root solution. For any finite diagram ,
The middle isomorphism uses exactly the permitted theorem that filtered colimits commute with finite limits in sets; it applies because is filtered. All maps are the natural comparison maps, so preserves finite limits, including the terminal object. This proves and completes the equivalence.
Take . By assumption has finite limits, so has finite colimits. A filtered category is nonempty, admits a cocone over every pair of objects, and admits a coequalizing arrow for every parallel pair. The initial object of gives nonemptiness, its binary coproducts give the required two-object cocones, and its coequalizers equalize parallel arrows. Consequently . These statements also handle the otherwise possible empty category of elements.
Assume preserves finite limits. Fix any set and a finite diagram of objects in . Let be the categorical limit of its underlying diagram in , with projections . Preservation gives . The maps form a compatible cone, so determine a unique with .
The object is the categorical limit in the comma category. Indeed a cone from gives a unique underlying , and the identities for all force by the categorical limit's uniqueness. For the empty diagram, is terminal and is a one-element set, giving the unique map from . Thus has all finite limits. This proves .
The Noether–Lefschetz theorem says that a very general smooth degree- surface in , for , has Picard group freely generated by its hyperplane class . Here very general means outside a countable union of proper closed loci in the parameter space of surfaces.
If such a surface contained a smooth rational curve , its divisor class would be for an integer . Since , one has and therefore . Part (a), however, gives , a contradiction. Thus a very general surface of degree at least four has no smooth rational curve. The statement concerns smooth embedded curves; a singular curve can still have rational normalization.
The adjunction formula on the degree- projective hypersurface gives . Since is a smooth rational curve, adjunction on gives . Its degree is , so the smooth rational-curve self-intersection on a projective hypersurface formula is
Apply a projective transformation to put the cuspidal cubic in the form . Since meets at only one smooth point , the Bézout theorem forces intersection multiplicity three there. Hence is the tangent line at a flex.
The homogeneous Hessian matrix has determinant
By the Hessian criterion for a flex, every smooth flex lies in . These intersections are , the cusp, and , which is smooth. Thus the unique smooth flex of a cuspidal cubic is , with tangent line . Conversely the pair in part (b) has exactly the required properties. Therefore there is one projective-equivalence class, represented by
Figure 1.
Cuspidal cubic in two projective charts: the cusp and its unique smooth flex
. Details.
Take , and . This projective cuspidal cubic is irreducible and meets only at . At , the derivative with respect to is , so is smooth. In the affine chart , it is , and is , so . Multiplicity is linear in the divisor , giving
The divisors have no common irreducible component, since a common curve would give infinitely many intersection points. The Bézout theorem therefore gives total intersection multiplicity . As all intersection is supported at ,
Let have degree and hyperplane class . The adjunction formula gives . For a line , the same formula on the smooth rational curve yields , hence
Thus all lines are negative curves, and part (b) makes their set countable. The Fano scheme of lines is a closed projective scheme of . A positive-dimensional complex algebraic component would have uncountably many points, so this scheme is zero-dimensional. A projective scheme of finite type has only finitely many zero-dimensional points. This proves the finiteness of lines on a smooth surface of degree at least three.
Use countability of negative curves. A smooth projective surface over is a compact smooth manifold homotopy equivalent to a finite CW complex, so its integral cohomology group is finitely generated and therefore countable. Distinct irreducible curves with cannot have the same cohomology class: that would give , while distinct effective curves have nonnegative intersection multiplicities. Assigning a negative curve its cohomology class is thus injective, proving there are at most countably many negative curves.
For zero self-intersection, uncountable families do occur. On the product of two projective lines , every fiber has self-intersection zero, since a different fiber is disjoint and has the same numerical equivalence of divisors class. The parameter varies over an uncountable set. Thus yes, there can be uncountably many such curves.
Let be an effective divisor linearly equivalent to . If were not a component of , all intersection multiplicities between its components and would be nonnegative, contradicting . Hence with effective and linearly equivalent to zero. For an ample divisor , this gives . Positivity of on every irreducible component of a nonzero effective divisor forces . Therefore , illustrating the rigidity of a negative curve.

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