Use relative constructible level recognition. The finite coding conditions matter here: merely writing “every set is relatively constructible” inside an arbitrary transitive set does not ensure that its computations are correct.
Let be a single finite conjunction expressing finite relation closure for set-theoretic coding. Concretely require the empty set, pairing, set union, set difference, Cartesian products, and the following uniform relation operations: for each finite ordinal and each set , the set of finite tuples exists; relations on these tuple domains can be complemented, intersected, projected along a coordinate and pulled back along finite coordinate maps; the equality and membership relations restricted to exist. These are finitely many first-order closure assertions with quantified, not an axiom schema. Each operation is specified by its usual elementwise membership equivalence. Transitivity makes the operations correct externally. Finite tuple domains are also correct: every individual finite tuple is already present by pairing and union.
These conditions make satisfaction for a set structure absolute. For a fixed coded first-order formula, compute its truth relations on by induction: equality and membership give the atomic cases, relative complement gives negation, intersection gives logical conjunction, and projection gives existential quantification. All required truth tables exist by and agree with the actual ones. Thus the first-order assertion is absolute whenever belong to a transitive structure satisfying : require that each member of has such a finite formula-and-parameter definition, and that each coded definition contributes a member of . Codes are finite objects; no truth predicate for the ambient universe is being used.
Write for the coded relative constructible stage assertion: is an ordinal and there is a function with domain , with , , at nonzero limit ordinals, and . Under , any such internal code is correct by transfinite induction. Restrictions of a code to shorter domains exist by the relation operations. Define the one-free-variable first-order formula
All displayed abbreviations expand into first-order formulas of the membership language.
Suppose is transitive, , and . Let be the externally defined set of indices of stage codes in . It contains , is downward closed by restricting codes, and has no largest member by the last conjunct. Thus is a nonzero limit ordinal . Correctness of stage codes gives for , hence by transitivity. Conversely the exhaustion conjunct puts every in some such level. Therefore
For the converse, every with nonzero limit satisfies : each listed operation on parameters from one level is definable at finitely many later levels, still below . Moreover stage histories appear below every limit constructible level. Here is the essential limit step of that lemma. If the histories for are available in , the correct predicate defines their graph of endpoints as a subset of . No endpoint with can belong to , because would then give , contradicting Axiom of foundation. The defined graph therefore has domain exactly . Adjoining its final pair takes finitely many more stages. Together with finite successor extensions, this proves by transfinite induction that every belongs to for some finite .
Thus all histories for belong to . Exhaustion follows from continuity, and supplies a larger represented stage. Hence , proving both directions without assuming ZF for the arbitrary input structure .
Fix the base convention . For a transitive set , the relative constructible hierarchy is
Here the definable power set is
The satisfaction for a set structure in this definition is a definable set-theoretic relation, obtained by finite syntax coding and recursion on a first-order formula. The transfinite recursion therefore defines a class in ZF.
Each level is a transitive set. For transitive , every is a subset of definable using the parameter , so ; also using the always-true first-order formula. Thus the levels increase and . Starting instead with is another common indexing convention, but it is not the convention used here. The relative universe need not satisfy axiom of choice: arbitrary need not have an internally available well-order.
A definable continuous hierarchy is a definable class function on the ordinals, with set-valued levels, such that for and
for nonzero limit ordinals. Its union is a definable class in set theory . Often the definition additionally requires every level to be a transitive set; the following statement also works without that requirement.
The reflection theorem for definable hierarchies says that for any finite collection of first-order formulas, there is a closed unbounded class of ordinals such that, for every and every parameter tuple from ,
A useful justification is the witness-closure proof. Close under subformulas. At each level and for each existential subformula, bound the least level containing a witness for each parameter tuple for which a witness exists in . Axiom schema of replacement bounds these indices. Iterating the finitely many bounds through produces a limit level containing all required witnesses. Induction on the first-order formulas, equivalently the finite-formula version of the Tarski-Vaught test, yields agreement. Continuity gives closedness of the reflecting class, and starting above any prescribed ordinal gives unboundedness. This is finite reflection, not a claim that all first-order formulas reflect simultaneously in an arbitrary hierarchy.
Use the standard convention that a strongly inaccessible cardinal is uncountable, regular and strong limit. The printed explanatory definition omits uncountability: literally it also admits , for which no finite cardinal is a worldly cardinal. Thus that omission makes the requested conclusion false under the literal abbreviated definition. The proof below applies to the usual, intended strongly inaccessible cardinal convention .
First for every . At successor stages this follows from the strong limit cardinal property, and at limits from the regular cardinal property. Consequently . In particular, for Axiom schema of replacement, a domain has size less than , so its functional image has fewer than elements, so the supremum of the rank of a set over its elements is below by regular cardinal structure. All other axioms, including axiom of choice, have their witnesses at bounded ranks below ; uncountability supplies axiom of infinity.
Enumerate the first-order formulas as . For each finite collection, reflection inside the set structure gives a closed unbounded subset of of agreeing ranks. To see why the witness bounds stay below , there are fewer than parameter tuples at each , and the supremum of their least witness ranks remains below by regular cardinal structure. Closing under these bounds and taking increasing countable limits gives the usual reflection theorem for definable hierarchies argument. The countable intersection of these closed unbounded subsets is still closed unbounded because is regular and uncountable. At each resulting ,
The infinite cardinal numbers below also form a closed unbounded subset: they are unbounded because for infinite , and a supremum of increasing cardinal numbers is a cardinal number. Intersect the two closed unbounded subsets. Every member of the intersection is a worldly cardinal, and an unbounded subset of a regular cardinal has size . Hence
In fact this proves the stronger worldly cardinals below an inaccessible cardinal result that these worldly cardinals contain a closed unbounded subset of .
The essential fact is absoluteness of cardinalhood in limit ranks. Let be limit ordinals and . Being an ordinal is absolute between these transitive sets, so a non-ordinal is a cardinal number in neither structure. For an ordinal , we have .
If is not an ambient cardinal number, there is an ordinal and a bijection . With Kuratowski ordered pairs, its graph has rank of a set at most . Since is a limit ordinal, , so . The assertion that is such a bijection is a bounded formula in set theory and is therefore evaluated correctly by each rank. Conversely, any internal bijection witnessing failure of cardinal number status is an actual one by the same set-theoretic absoluteness. Consequently
Unlike arbitrary transitive models, these rank-initial structures contain every sufficiently low-rank witness. That witness availability is what upgrades the usual downward absoluteness of cardinalhood to agreement in both directions.
First prove set-theoretic absoluteness for syntactically bounded formulas in set theory by induction on their construction. Atomic equality and membership use the actual equality and membership relations in both transitive classes. Boolean operations preserve agreement.
For the bounded existential step, take and suppose . Its witness is an actual member of . Since is a transitive class, ; the induction hypothesis then gives . The converse uses the same witness in . The bounded universal step follows similarly because both structures quantify over exactly the actual members of , or follows by negation from the existential step. Hence
No ZF axioms are needed for this syntactic statement beyond the ambient meaning of a transitive class. For a ZF-equivalent bounded formula , choose a bounded equivalent . The assumption that both structures model ZF gives and . Combining these with the displayed equivalence proves the asserted set-theoretic absoluteness of .
The Von Neumann hierarchy is the following transfinite recursion on the ordinals:
Here denotes the full power set. The levels are increasing transitive sets, and the construction is continuous at limit ordinals. Transfinite induction proves these properties: transitivity at a successor follows because a member of a subset of already belongs to ; at a limit it follows from the set union of increasing transitive sets. In ZF, Axiom of foundation and Axiom schema of replacement ensure that every set belongs to some . In terms of the rank of a set, exactly when .
A syntactically bounded formula in set theory is built from the atomic first-order formulas and using Boolean operations and bounded quantifiers and . These abbreviate and , with different from the bounding variable .
The superscript in the question allows provable equivalence: a ZF-equivalent bounded formula is any first-order formula for which some syntactically bounded formula in set theory satisfies
Thus is the class of first-order formulas equivalent over ZF to a syntactic first-order formula. If a convention uses just for syntactically bounded set-theoretic first-order formulas, it is the smaller syntactic class; the subsequent set-theoretic absoluteness proof works for both conventions.
For parameters , set-theoretic absoluteness means agreement of the two membership first-order structures:
This must hold for every such parameter tuple. Equivalently, formula relativization to a class produces two formulas and whose truth values agree on tuples from . Agreement for parameters only in is not part of the definition. For a proper class in set theory, this notation is understood separately for each fixed first-order formula, rather than as an unrestricted truth predicate for the entire universe.
Assume is a full and faithful functor and its essential image is closed under strong quotients. First its unit is invertible. To prove this directly, fullness gives with . The triangle identity and faithfulness give . Naturality of at and the other triangle identity give
Thus is an isomorphism, and is also an isomorphism.
Factor as a strong epimorphism followed by a monomorphism. By closure under strong quotients, the intermediate object can, after transport along an isomorphism, be written as :
Fullness gives for . Taking the transpose of under the adjunction, whose transpose is , gives
Hence is a split monomorphism, so is a monomorphism. A strong epimorphism which is monic is invertible: apply its lifting property to the square with that same map on both sides and identity top and bottom edges. Thus is invertible and is monic. We have proved the pointwise-monic unit-and-counit criterion:
For a counterexample without the balanced hypothesis, use the pointwise-monic adjunction over a non-balanced poset. Let and let have one object and only its identity. The unique is left adjoint to selecting , since both and are singletons. All morphisms in a poset viewed as a category are monomorphisms, so the unit and counit are monic. However is not full: the identity has no preimage . The arrow is both monic and epic but not invertible, so is not a balanced category. The balanced hypothesis cannot be dropped.
A balanced category is one in which every morphism that is both a monomorphism and an epimorphism is an isomorphism. A faithful functor reflects both of these cancellation properties: for instance, implies , so monicity of and faithfulness imply ; the dual argument applies to epimorphisms. If is invertible, it is both monic and epic. Thus a faithful functor from a balanced category reflects isomorphisms.
For the adjunction , the unit and counit of an adjunction satisfy
If is a faithful functor and , applying and composing with gives , hence . Thus each is a monomorphism. Conversely, if every is monic and for , naturality gives
so . This proves the faithful left adjoint criterion.
Now assume both and are pointwise monic. The first triangle identity makes a split epimorphism; since it is also a monomorphism, it is invertible and is its inverse. The faithful left adjoint criterion says that is faithful, and the balanced category argument above then reflects the invertibility of to that of .
For completeness, an invertible unit makes a full and faithful functor. For , set . The triangle identity gives , so naturality of yields
Faithfulness was already proved.
Let be a strong epimorphism, and put
Then naturality gives . The square with left edge , right edge the monomorphism , top edge , and bottom edge has a diagonal by the defining lifting property of a strong epimorphism. Thus . A monic split epimorphism is invertible, so . The essential image of is therefore closed under strong quotients.
At , choose neighborhoods on which the two factors admit local isometries to open subsets of Euclidean space. Their product is a local isometry of the product Riemannian metric to the standard Euclidean metric on . In these product coordinates the metric matrix is constant, so every Christoffel symbol of the Levi-Civita connection is zero. Its Riemann curvature tensor therefore vanishes at every point of that neighborhood. Curvature has tensoriality, so this is independent of the chosen coordinates; the neighborhoods cover the product.
The splitting provides another useful direct check. Expanding the definition on lifted fields, using zero mixed derivatives and commuting opposite-factor fields, gives the curvature splitting for a product connection
Tensoriality extends this identity from lifts to arbitrary tangent vectors at a point. Each factor curvature is zero under the stated local-isometry hypothesis. Consequently
This is a local conclusion about the connection; no global identification of either factor or their product with Euclidean space is required.
The product Riemannian metric is
It is smooth and symmetric. If , at least one component is nonzero and contributes a strictly positive squared norm; the other contributes a nonnegative term. Thus is positive definite.
Let the factor connections be Levi-Civita connections. The torsion form of the product affine connection vanishes on two lifted fields from one factor because it equals the factor torsion; on opposite-factor fields it vanishes because both covariant derivatives and the Lie bracket of vector fields vanish. By tensoriality, torsion vanishes for all fields.
Check metric compatibility on lifted fields as well. When the two paired fields are from one factor, their metric pairing depends only on that factor. Differentiation along that factor gives the usual factor compatibility identity, and differentiation along the other factor gives zero on both sides. When the paired fields are from different factors, their pairing is identically zero and their derivatives stay in their original summands, so both sides are again zero. Since has tensoriality, these checks imply globally.
The existence and uniqueness of the Levi-Civita connection therefore gives
Equivalently, applying the Christoffel symbol formula to the block metric gives the factor coefficients and zero mixed coefficients, because each factor metric is independent of the other coordinates.
Let be the projections. The derivative of the two projections identifies the tangent bundle with
Take the direct sum of the two pullback connections. This is the product affine connection. In product coordinates , its only nonzero Christoffel symbols are the two blocks inherited from the factors; all mixed coefficients are zero.
To make the connection on arbitrary fields explicit, write and , allowing all coefficients to depend on both variables. Then
The terms and include derivatives in both factors. Omitting these cross derivatives for fields with variable coefficients would not define a connection.
The formula is real-bilinear, linear over smooth functions in , and obeys the Leibniz rule in . Under a change of product coordinates each block has the factor's connection transformation law, so the local formulas agree; equivalently the pullback connection construction already guarantees this gluing.
A field on one factor has a canonical lift to the product. Opposite-factor lifts commute, and their mixed covariant derivatives vanish. For such lifted fields the coefficient derivatives reduce to their factor derivatives, giving
These values determine the connection uniquely: lifted coordinate frames span locally, and the connection's product rules determine its action on all their smooth linear combinations.
An affine connection on is an operation on smooth vector fields that is real-bilinear, linear over in the differentiating field, and satisfies
It is a connection on a vector bundle for the bundle , also called a linear connection on the manifold. Its curvature form of a connection has the operator form
This convention fixes its sign. Expanding the two connection product rules shows that the extra derivatives of a scalar cancel, so is linear over smooth functions in all three fields. For a Levi-Civita connection, this is the Riemann curvature tensor.
The torsion form is . For a Riemannian metric , its Levi-Civita connection is the unique torsion-free connection satisfying metric compatibility
Existence and uniqueness follow from the Koszul formula. In coordinates its coefficients are
Symmetry in gives zero torsion, and substitution verifies metric compatibility.
Use the double covering map and its deck involution, the antipodal map . The given sphere cohomology vanishes outside degrees , so only those degrees can survive as invariant classes. The degree-zero action is the identity because the sphere is connected for .
For the top degree, orient as the boundary of the unit ball. A positive tangent basis at means that has positive determinant in . Under the antipodal map every one of these vectors changes sign, so the orientation sign is . Equivalently, the sphere volume form is
Its cohomology class is nonzero by the integral argument and therefore generates the one-dimensional top de Rham cohomology. Thus the top class is invariant precisely when is an odd integer. Applying the quotient result yields
In particular has one copy of in each of degrees zero and one. These are real cohomology groups; integral torsion is not detected by de Rham cohomology.
First work at the level of differential forms. The fiber description implies , so every pullback is -invariant. Since is a surjective local diffeomorphism, its pullback on forms is injective: at any , choose a lift and use the inverse of to evaluate the form on arbitrary tangent vectors at .
Conversely let be an -invariant form on . For a local inverse of , define . If two inverses select the same lift they agree locally; if they select different lifts, the fiber condition identifies the second with composed with the first. Locally these alternatives are stable, using disjoint inverse neighborhoods at distinct lifts. The equality therefore makes the local definitions agree. They glue to a unique smooth form on with . Thus
is an isomorphism of complexes, with the exterior derivative on both sides.
It remains to compare the cohomology of the invariant complex with invariant de Rham cohomology classes. Put on forms. If and , then is invariant, closed and represents the same class, because its class is the average of two equal classes. If an invariant form is exact, , then with an invariant primitive. This proves both surjectivity and injectivity on cohomology. For there are no negative-degree primitives, and the same conclusion follows directly from closed functions.
Combining the two steps gives
This is the de Rham cohomology of a finite quotient argument specialized to an involution. It does not require orientation. The hypotheses do not explicitly exclude ; then all fibers are singletons, is a bijective local diffeomorphism and the conclusion is the ordinary diffeomorphism invariance. If has one fixed point, local injectivity of makes its fixed set open as well as closed; connectedness of forces this identity case. Otherwise the fibers have two points and is the usual double covering.
Pullback of a differential form commutes with the exterior derivative, so gives a linear map on de Rham cohomology. Functoriality and imply . Over the real numbers, define the complementary projections
They obey , and . Every cohomology class therefore decomposes as
The first term is fixed and the second negated by . Their intersection is zero, since a class in both equals its own negative. Consequently
This is the eigenspace decomposition of a linear involution. The factor uses the real coefficient field; a corresponding argument over characteristic two would fail. At the level of differential forms, the same averaging projections give representatives of either parity whenever the class has that parity.
An orientation of a smooth -dimensional manifold can be specified by a nowhere-vanishing smooth -form : an ordered tangent basis is positive precisely when evaluates positively on it. Multiplication by a positive smooth function preserves the orientation. This is the differential-form formulation of the equivalent formulations of orientability of a smooth manifold.
Use the standard convention that the compact connected manifold is nonempty and has no boundary. Choose a positive volume form for its orientation. It is a closed differential form, because there are no nonzero -forms. For , compactness makes its integral finite, and positivity on a coordinate neighborhood together with nonnegativity elsewhere gives
If , the Generalized Stokes theorem would give , a contradiction. Therefore
For , a nonempty connected manifold is a point, and directly. The boundary hypothesis matters: a closed interval is an oriented compact connected manifold with boundary with . Thus the result is about ordinary boundaryless manifolds, not an unrestricted version including boundary.
The tensor denoted acts as the rank-one endomorphism . In the paper's covector-first ordering it is written , using the canonical interchange of tensor factors; this is the same endomorphism.
On any smooth function ,
On a vector field , the Lie bracket of vector fields gives
so
Multiplication by preserves the tensor-product Leibniz rule and commutation with tensor contractions, since the latter are linear over smooth functions. Hence the difference is a real-linear contraction-compatible tensor derivation whose scalar operator is zero. Its agreement with on functions and vector fields determines its action on every tensor by uniqueness:
For example, on a differential one-form this gives . Equivalently , which checks the sign independently. This is the scaled Lie derivative defect identity.

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