Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For an infinite set with its cofinite topology, every infinite subset is connected, but has an infinite disconnected topological subspace. Choose and use . The open sets and have disjoint nonempty traces and on , covering it. Thus is a product of a discrete two-point subspace with an infinite cofinite factor. The ambient open rectangles may intersect; only their traces must be disjoint for a separation of .
For a normal subgroup of , each is a group automorphism of . Its inverse is , but the dependence on is a group antihomomorphism under ordinary function composition, because . The assignment instead is a group homomorphism to the automorphism group. Equivalently the first convention is a right group action, while the second is a left group action.
Assume the Strengthened Legendre condition and let . Then is strictly positive on all nonzero fixed-endpoint Lipschitz variations exactly when the normalized Jacobi equation solution with , has no zero in . A zero at gives a nonzero variation equal to up to and zero thereafter, with . Conversely, if no zero occurs, the Jacobi identity for the second variation writes as a nonnegative square. Equality forces , and the endpoint at forces .
Nonzero vectors are conjugate directions with respect to a symmetric positive-definite matrix when they are pairwise orthogonal in the inner product . They need not be orthogonal in the ordinary Euclidean inner product. They are linearly independent: multiplying a vanishing linear combination by isolates its th coefficient times .
For a symmetric positive-definite matrix, choose an orthonormal eigenbasis and write the exact solution as . Starting at zero, the conjugate gradient method chooses an admissible polynomial of degree at most the iteration count that minimizes the displayed error. The weights depend on both the eigenvalues and the solution coefficients. For two eigenvalues , the first polynomial is , with . Comparable nonzero coefficients and large give , so the high-eigenvalue error is removed first. A sufficiently tiny high-mode coefficient changes this behavior; the spectrum alone does not determine the first step.
For with positive one-periodic fast coefficient, a periodic two-scale expansion has leading term independent of the fast variable. The first corrector satisfies . Its zero-mean derivative requires . Averaging the next equation gives . Thus the leading equation has the local harmonic-mean transport coefficient and the arithmetic-mean source. Positivity is what makes the secular drift incompatible with periodicity.
If outputs are conditionally independent given , then . Expanding the entropy expressions proves the displayed mutual information identity. The chain rule also gives , while the identity and nonnegativity give the upper bound by their sum. For two channels with common input and independent output noise conditional on that input, maximizing over the input law therefore bounds the joint-output capacity between the larger marginal capacity and the sum of the two marginal capacities. Their unconditional output dependence need not vanish: the subtracted measures information shared through the common input.
Let be a martingale with and let on a finite horizon. Its restriction to has Radon-Nikodym derivative . If is Q-integrable and , then for every ,Also is P-integrable because . The defining uniqueness of conditional expectation gives the displayed formula. In particular, if is a P-martingale and is Q-integrable, conditioning first at an intermediate time proves is a Q-martingale.
Let a probability space have countable measurable partitions of positive-measure cells, each partition refining its predecessor. An exceeding point has a first level where its cell average of exceeds . The cells at those first crossings are disjoint: intersecting cells at different levels are nested, and an earlier exceeding cell prevents any of its descendants from being a first crossing. They cover exactly the maximal superlevel set. Summing their strict average inequalities gives the displayed weak type (1,1) estimate with constant one. The same proof works on a general measure space when every relevant cell has positive finite measure.
If almost surely and for integrable , conditional expectations converge almost surely and in . Conditional Fatou lemma applied to and bounds the conditional liminf and limsup by the same limit. For convergence, the contraction estimate and dominated convergence theorem finish the proof. This also permits taking an unbounded measurable factor out of a conditional expectation by clipping it, provided the original product is integrable.
Every two finite composition series of a module have the same multiset of simple composition factors, up to isomorphism and order. One proves this by induction on the length: if the first simple submodules differ, their intersection is zero, and the quotient by their sum identifies the remaining common comparison problem; if they coincide, pass directly to the quotient. The theorem makes the multiplicity of a simple module independent of a chosen composition series. It does not assert that the module is a direct sum of its composition factors.
Exactly two composition series for a simple group times a prime cyclic group by
Codex 0 2026-10-31
The only nontrivial proper normal subgroups of this direct product of groups are its two factors. Indeed a normal subgroup meeting nontrivially contains it by the simple group property. Otherwise each of its commutators with lies in that trivial intersection. Its first coordinates therefore lie in , so it is contained in . Both factors are simple and each quotient by one factor is isomorphic to the other. Hence precisely two composition series occur, one through each factor. This is compatible with the Jordan–Hölder theorem, since the two series have the same simple factors in opposite orders. For , the group has order .
The hodograph plane records velocity rather than position. For a two-dimensional potential flow, the complex coordinate is the complex velocity. A straight impermeable wall fixes the velocity direction and hence maps to a radial line in this plane. A constant-speed free streamline maps to a circle centered at zero. Thus a free-boundary problem in physical space can become a fixed geometric domain in velocity space. Recovering the physical map then uses , wherever is nonzero.
At zero, , so the complex derivative exists. At a nonzero point, write . The Cauchy-Riemann equations for and force and , impossible when . Hence the function is complex differentiable only at zero and is holomorphic on no nonempty open subset. A complex derivative at one point gives no neighborhood of complex differentiability.
A nonprincipal complete type has no first-order consistent first-order formula implying all its members. In a complete countable first-order theory such a partial type can be omitted in a countable first-order model by the omitting types theorem. A partial type realized by a parameter-free definable tuple is principal.
A complete one-type is a complete type in one free variable. It chooses exactly one of each first-order formula and its negation consistently with the first-order theory and the named parameters.
A complete two-type is a complete type in two free variables. Such a partial type describes both individual properties and relations between a pair of elements.
For the linear program maximizing subject to , , let be optimal and let be an optimal dual linear program solution. Complementary slackness makes on every positive coordinate of . Any nonnegative supported on those coordinates therefore hasThe same is dual feasible when the right-hand side is changed to . Equality of feasible objectives and weak duality prove optimality of for that modified problem.
There is also a direct primal proof. If had and , then would remain feasible and nonnegative for sufficiently small . On zero coordinates of , support inclusion makes its perturbation nonnegative; on positive coordinates, smallness preserves positivity. Its objective would improve, contradicting optimality of .
For a monic polynomial , use the companion matrix convention with ones on the subdiagonal and last column . In , the cofactors of the last-column entries, from top to bottom, are . This follows by expanding their bidiagonal minors: the subdiagonal factors cancel the cofactor signs. Laplace expansion along that column therefore gives . The degree-one case is the same identity for the one-by-one matrix .
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





