We use the left internal-hom convention in which is right adjoint to , so its evaluation morphism has domain . For a Hopf algebra over the commutative ring , take the full -module
and give it the internal hom for modules over a Hopf algebra
The antipode is an antihomomorphism, , so
The unit acts identically. Thus this is a left -module.
The evaluation morphism is -linear. Using the diagonal bialgebra action and the antipode identity,
Now let be -linear and define its ordinary curried map . To see that it too is -linear, compute
Conversely, any -linear map uncurries to an -linear map by the already established linearity of evaluation. The ordinary tensor–hom adjunction therefore restricts to a natural bijection
Postcomposition by an -linear map makes a functor. This proves that the category of left -modules is a left closed monoidal category. All modules are allowed; no inverse antipode or finite-dimensional dual is required. Stating the tensor–hom convention explicitly avoids confusing this construction with the closure on the opposite side.
On the monoidal category of modules over the commutative ring , consider the monad coming from the unit and multiplication of the bialgebra . Its opmonoidal functor structure has comparison maps
Here and below Sweedler notation abbreviates the comultiplication . The opmonoidal associativity and unit axioms are the coassociativity and counit laws of the coalgebra. The unit and multiplication of a monad are opmonoidal natural transformations because the bialgebra axioms say
The Eilenberg-Moore category of this opmonoidal monad is the category of left -modules: a monad-algebra map is exactly a unital associative action.
Applying the preceding construction gives the diagonal bialgebra action and the unit action
The usual associators and unitors for the tensor product of modules are -linear, and the underlying tensor product is exactly . The forgetful functor into -modules is strict monoidal. The base need not be a field; the modules need be neither flat modules nor finitely generated modules.
An opmonoidal monad on a monoidal category is a monad whose endofunctor is an opmonoidal functor and whose unit and multiplication of a monad are opmonoidal natural transformations. Suppress only the canonical parentheses. Explicitly,
The composite opmonoidal functor has tensor comparison and unit comparison , explaining the last two equations.
For two algebras for a monad and , define
Let . The unit law for a monad algebra follows at once from the opmonoidality of :
For the multiplication law, naturality of , the algebra laws, and the opmonoidality of give
The two unit-comparison equations above similarly make a algebra for a monad. If are morphisms of algebras for a monad, naturality of shows that is an algebra morphism.
For a third algebra , the base associator is also an algebra morphism: its intertwining equation is precisely the opmonoidal associativity axiom, followed by . The two base unitors are algebra morphisms by the opmonoidal unit axioms. Their pentagon and triangle commute because they commute after the faithful forgetful functor, and the lifted maps have exactly the same underlying morphisms.
The Eilenberg-Moore category is therefore monoidal, with these lifted constraints. Its forgetful functor preserves the tensor product, unit object and constraints exactly, so it is a strict monoidal functor.
An opmonoidal functor consists of a functor, a natural transformation
and a morphism . These maps need not be invertible. If are the respective associators and unitors, its axioms are
The first equation has domain and codomain , which fixes the direction of every arrow. This is also called a colax monoidal functor.
An opmonoidal natural transformation between opmonoidal functors is a natural transformation satisfying
It respects both the tensor and unit comparison maps. These are commutative diagrams and a unit commutative diagram; the arrow directions are opposite to those for a lax monoidal functor.
Define the length of a formal tensor expression recursively by
The canonical strict monoidal functor sends to , sends every associator and unitor to an identity braid, and sends to the block braiding . The pentagon and triangle become identity equations; the braiding axioms become the corresponding block-braid equations. Thus the assignment respects the defining relations, and
on the nose. It is a braided monoidal functor with identity comparison maps.
To prove that is an equivalence of categories, choose a standard parenthesization of copies of , with . On , define the image of by canonically exposing the th and st factors, applying there, and restoring the chosen parentheses. The monoidal coherence theorem makes this independent of the structural rebracketing. Crossings on disjoint pairs commute by the tensor interchange law. The adjacent braid group relations follows from the hexagon laws and naturality of the braiding, as in the Yang–Baxter calculation below. Hence these assignments give group homomorphisms and a functor .
Equip with the canonical rebracketing maps . Their monoidal functor axioms follow from the monoidal coherence theorem; the block-braiding compatibility follows by iterating the two hexagon laws. Therefore is a strong monoidal functor compatible with the braiding.
We have , including its comparison maps. For every formal expression , there is a canonical structural isomorphism
obtained by rebracketing and inserting the units appearing in . These maps form a natural isomorphism . To check naturality, it suffices to check the generating morphisms: for associators and unitors it is exactly monoidal coherence; for it follows from the hexagon expansion into the elementary crossings defining . Composition and tensor product then preserve the equation. The same structural coherence shows that is monoidal.
Thus has a specified quasi-inverse and is the required equivalence:
Only ordinary monoidal coherence, together with the defining braiding axioms, has been used; a separate braided coherence theorem is unnecessary.
Let denote the generating object, the image of the unique object of the terminal category. The free braided monoidal category on one object can be described syntactically. Its objects are all fully parenthesized expressions built from , the monoidal unit object , and a binary monoidal tensor product. Thus and are distinct objects, though canonically isomorphic. Its morphisms are generated by the associators, unitors, braidings and their inverses, closed under composition and tensor product, subject to the pentagon, triangle, naturality and hexagon axioms. No symmetry relation is imposed on the braiding. The embedding of the terminal category selects .
The braid category has objects the nonnegative integers, with
where is the braid group on strands and are trivial. Composition is stacking braids, with the first morphism followed by the second. The monoidal tensor product is addition on objects and side-by-side juxtaposition of braids; its monoidal unit object is . The associators and unitors are identities, so it is a strict monoidal category.
Choose the positive crossing convention once and for all. Its braiding is the block braid moving the first strands over the next strands while retaining the order within each block. In particular . The usual braid group relations express the naturality and hexagon laws for these block braids. The generating functor selects .
The distinction is parenthesized tensor expressions versus strand counts: the first construction keeps the structural isomorphisms visible, while has strict tensor arithmetic. These descriptions give the two requested free constructions without needing to establish their universal properties.
Closure preserves the ground-model cardinal . We use the stronger fact that closed forcing adds no short ordinal sequences. Fix an ordinal in and a forcing name that a condition forces to be an ordinal-valued function with domain .
Inside , recursively strengthen to decide each value , for . At a limit stage take a lower bound of the previously chosen descending sequence; its length is below , so -closure supplies one. After all values have been decided, closure supplies a common lower bound . The decided values form a function by the Axiom schema of replacement, and
The recursion is carried out within using the definable forcing theorem and a ground-model choice of deciding extensions, so every sequence to which closure is applied belongs to . Repeating the construction below any stronger condition shows that such full-decision conditions are dense below a forcing condition . The dense-below generic meeting lemma ensures that a generic filter containing meets them. Thus the interpreted function is in .
If ceased to be a cardinal number in , there would be a surjection for some ordinal . The forcing theorem gives a name and a condition in forcing this. The argument above makes its interpretation a ground-model function, but regards as a cardinal number and admits no such surjection. Therefore
No regularity of is required; every recursion used has length strictly below . Finite cardinals are preserved automatically. This is cardinal preservation by closed forcing.
With the condition-first name convention used here, evaluation of a forcing name is
Since a generic filter is nonempty, there is a condition in . In the given paired forcing name, every condition is paired with both and , and there are no other lower-rank names. Therefore
This is the unordered pair of the two interpreted sets. If the interpretations coincide, it is a singleton. It is neither an ordered pair nor the set union of those interpretations. Reversing the two components in the name-pair convention changes only the syntax of the same recursive evaluation.
False as printed: separativity alone does not guarantee a new generic filter. A separative forcing order means that if , some is incompatible with . The one-point order is separative vacuously. Its only generic filter is , and this belongs to . Thus no exists in this example.
The natural missing hypothesis is that the nonempty order is an atomless forcing order. Under that hypothesis the intended argument works. Since is a countable transitive model, enumerate externally its dense subsets as . Choose with . Then
is a directed upward-closed filter in an ordered set and meets every . This is the Rasiowa–Sikorski lemma, giving a generic filter over .
If , the set difference would belong to . It is dense: a condition outside is already in ; a condition in has two incompatible stronger conditions, at least one of which cannot be in the directed filter . Genericity would require , a contradiction. Thus
This uses generic filter for an atomless order is new. A forcing atom is precisely the obstruction illustrated by the counterexample; separativity does not remove it.
Use standard notation for forcing: means that is stronger than . A closed forcing order is -closed when every decreasing sequence with has a common lower bound:
The chain condition for forcing is
An antichain in a forcing order consists of pairwise incompatible forcing conditions; incompatibility means having no common stronger extension. In particular, the -chain condition is the countable chain condition for forcing. These properties and their sequences or antichains are computed inside the ground model .
Let be ZFC together with the assertion of unboundedly many inaccessible cardinals. Given a model of , if it has no inaccessible limit of inaccessibles, it already witnesses the required nonimplication. Otherwise let be its least inaccessible limit of inaccessibles and pass to its rank segment .
Because is an inaccessible cardinal, satisfies ZFC. Its ordinals are precisely those below , and below the inaccessible cardinals are unbounded by the choice of . Inaccessibility of any smaller ordinal is absolute to this segment: it has the same subsets and functions on all smaller ordinals, as in strong-inaccessibility absoluteness from rank agreement. Thus satisfies the unbounded-inaccessibles assertion.
No smaller ordinal can be an inaccessible limit of inaccessibles, by minimality of and the same absoluteness. Also is not an ordinal of itself. Consequently
This rank cutoff at the first inaccessible limit of inaccessibles proves . The soundness theorem for first-order logic then gives if is consistent. This is a model-theoretic relative-consistency argument, and does not infer external transitivity from mere consistency.
A witness to failure of the Axiom of power set is . Every subset belongs to , since its transitive closure has cardinality at most . If some were the internal power set of , transitivity and bounded subsethood would force to contain every ambient subset of , and only those subsets. Thus it would be the full .
By the Cantor theorem,
Its transitive closure contains all its members, so . This contradicts . Therefore
The power-set failure in hereditarily small sets needs no assumption about the Continuum hypothesis.
One can take . Finite induction gives for every finite : every subset of a finite level is definable using its finitely many elements as parameters. Hence , the set of hereditarily finite sets.
Now reason inside the constructible universe , a model of ZFC. The set is countable there, and there are countably many first-order formulas and finite parameter tuples. Thus is countable in . But the constructible power set is uncountable in by the Cantor theorem. Choose
This is constructible and a subset of , so and . Therefore
All comparisons were made inside ; this avoids assuming that the constructible reals are uncountable in the ambient universe. The witness remains valid externally because the two structures use the same , the same , and the same constructible level. Thus constructible sets of low rank can appear at later stages.
The Von Neumann hierarchy and the constructible hierarchy are defined by transfinite recursion:
The union clauses apply to nonzero limit ordinals. The definable power set consists of subsets definable over by a first-order formula with finitely many parameters from . Definability over that structure is essential; it is not unrestricted definability in the ambient universe. The full constructible universe is .
For an infinite cardinal number , the hereditarily small set collection is
where is transitive closure. Using instead gives the same size criterion for infinite . This bounds the whole membership ancestry, not just .
Take the least omega-measurable cardinal , with a countably complete ultrafilter on that is nonprincipal. We prove that is -complete. This will give .
Suppose , for , and . Then belongs to . For let be the least with . The pushforward ultrafilter
is a countably complete ultrafilter on ; this uses , so restricts to an ultrafilter on . For each , the fibre is contained in , hence is not in . Thus is nonprincipal. If is finite or countable, countable completeness already rules this out. Otherwise would be an omega-measurable cardinal, contradicting minimality of .
Therefore every intersection of fewer than members of lies in . Since is uncountable, it is a measurable cardinal. This proves that the least omega-measurable cardinal is measurable, even if the originally supplied cardinal carried only a countably complete ultrafilter.
Weakly inaccessible cardinals are unbounded below the given cardinal. In fact, they form a stationary set there. Let be the weakly Mahlo cardinal, so it is a regular uncountable limit cardinal and the set is stationary.
The set of uncountable limit cardinals below is a club set. For unboundedness, above any starting point choose a strictly increasing countable sequence of cardinal numbers below ; its supremum remains below by regularity and is an uncountable limit cardinal. For closure, a limit of such limit cardinals is again a limit cardinal.
Every is an uncountable regular cardinal and a limit cardinal, hence a weakly inaccessible cardinal. The intersection of a stationary set with a club set is stationary, because its intersection with any further club is nonempty. Therefore
This proves the stronger form of the requested conclusion.

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