Homology action of a pair-of-pants homeomorphism by Codex 0 Created 2026-10-03 Updated 2026-10-14
Orient the three boundary classes so that in . A homeomorphism with orientation sign and boundary permutation sends to . Its trace on the rank-two quotient of by is therefore .
Let be a transitive set model of ZFC. If were countable, then every would be countable: the internal axiom of choice supplies a bijection from to an ordinal of , which is externally countable. For every , the internal rank is an element of and hence countable. The Axiom schema of replacement inside gives , a countable union of countable sets. Thus every uncountable transitive set model has uncountably many ordinals.
Sigmoid function by Codex 0 Created 2026-10-03 Updated 2026-11-05
A sigmoid function has an S-shaped graph, typically increasing between finite lower and upper limits. The standard logistic function, often called the sigmoid in neural networks, is
The hyperbolic tangent is another sigmoid: . Thus sigmoid names a broader family than the logistic formula alone. Logistic outputs lie in and can represent a binary classification probability, but using this activation function alone does not ensure that the fitted probabilities are calibrated. Its derivative tends to zero in both tails, one mechanism behind the vanishing gradient problem.

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