Translate one vertex of the tetrahedron to the origin and denote the other vertex vectors by . Translation preserves edge vectors and their dot products. We may label the two known perpendicular pairs of opposite edges of a tetrahedron as the pairs represented by and . Their orthogonality gives
Hence all three pairwise dot products have the same value . The third pair satisfies
so the third pair of opposite edges is also perpendicular.
Expanding squared lengths using the dot product gives
Thus the sums of squared opposite-edge lengths are equal. These two conclusions are the basic identities for orthogonal opposite edges of a tetrahedron.
Set . The sum condition then gives and , and their dot product is
Therefore . Since , this is a strictly positive squared radius. The complete solution is
Every choice of unit vector satisfies both conditions, and every solution has this form. The endpoints lie on the sphere with center and radius , and their midpoint is . They are therefore opposite ends of one diameter of that sphere.
To construct a potential for the exact differential, first integrate its coefficient with respect to :
Matching the coefficient gives , hence . The remaining partial derivative is then
Matching the coefficient forces . Therefore a potential, valid throughout , is
Differentiating this expression recovers all three coefficients, proving that the differential form really is an exact differential.
For an exact differential , equality of mixed partial derivatives requires . Here the two partial derivatives are
They are not identically equal, so the differential form is not a closed differential form and hence is not an exact differential. Equality along special lines such as does not supply a potential on a two-dimensional open neighborhood, because every such neighborhood contains points where the two partial derivatives differ.
Yes: every finite group of rotations about the origin in the plane is cyclic. A planar rotation is determined by an angle modulo , and composition adds those angles. If consists only of the identity, it is a cyclic group. Otherwise, finiteness allows us to choose the smallest positive representative angle occurring in .
Take any planar rotation in with representative angle . Write , where is an integer and . The composition belongs to and has angle . Minimality of forces , so every element of is a power of .
Similarly, write with . If , the planar rotation has representative angle , a contradiction. Thus and
This proves finite groups of planar rotations are cyclic by an elementary angle argument.
A group is a cyclic group if some element generates it:
For a finite cyclic group, the order of a group element of a generator equals the number of elements of the group.
An example of a finite abelian group that is not a cyclic group is the Klein four-group, realized as
with componentwise addition modulo two. Addition commutes, so this is an abelian group of four elements. Each of its three nonzero elements satisfies , so the cyclic subgroup it generates has just two elements; the identity generates only itself. No element generates all four elements.
Assume is an interior point and choose small enough that its closed ball lies inside . Apply Green's second identity to the punctured region , where the potential is smooth and satisfies Laplace equation. Since , this gives
The crucial orientation is the outward unit normal vector of the punctured region: on the inner sphere, it is , pointing toward . Consequently and . The inner boundary term becomes
Writing and , its first part tends to by continuity. The second part is because the gradient of is bounded near , and hence tends to zero.
The omitted volume term also tends to zero: for bounded near , its absolute value is bounded by a constant times . Thus the limiting integral exists, and rearranging the outer boundary terms gives
This is Green's third identity for the Poisson equation with the stated sign convention. It retains both boundary terms; no homogeneous boundary condition has been assumed. The punctured-domain calculation accounts for the singular source without incorrectly applying the regular divergence theorem through .
Use the product rule for the divergence of the vector field :
The two dot products cancel. Apply the divergence theorem with outward unit normal vector to obtain Green's second identity:
Smoothness of the functions and boundary supplies the regularity needed for the divergence theorem.
In Cartesian coordinates, put . Away from the origin the partial derivatives of are
Summing the three second partial derivatives yields
Thus is a harmonic function on the punctured space and solves Laplace equation there. The origin is excluded: the singularity cannot be treated as an ordinary harmonic point.
The 36 ordered outcomes are equiprobable. For , let count outcomes with sum . Then and for . Their joint probability is if , and zero otherwise.
If the joint probability is zero, independence is impossible in these ranges because both marginal probabilities are positive. If it is , the independent events condition requires , or . This happens only for , and then all six values of allow the partner . Therefore within the possible sums and faces
If arbitrary integer labels outside these ranges are included, an impossible sum or face defines an empty event, which is trivially independent of every event.
Two independent events satisfy . If , this is equivalent to : learning that occurred does not change the probability of . The product definition also covers zero-probability events without dividing by zero.
Every urn contains balls. Let be its number of blue balls; choosing an urn uniformly makes uniform on . Conditional on that urn, the probability of a blue first draw is , so the law of total probability gives
Drawing twice without replacement requires . Given , the probability that both draws are blue is , and hence
Taking the ratio defining conditional probability gives the second requested probability
Although a blue first draw removes a blue ball from its urn, it also makes an urn rich in blue balls more likely. Averaging with this changed conditional distribution is essential.
For , the conditional probability is . Since the events partition the sample space, their intersections with are disjoint and exhaust . The law of total probability therefore gives . Substituting this and into the definition proves Bayes' theorem:
The denominator is positive by the given hypothesis on .
Evaluation of the probability generating function at zero selects the constant coefficient, so
To identify this limit with ultimate extinction, let . The absorbing-zero property of the branching process gives . Ultimate extinction means that some finite generation is empty, namely . Continuity of probability on increasing events therefore gives
This set argument is essential: it uses absorption, rather than inferring extinction merely from a numerical limit of generation probabilities.
The binomial series gives
Thus and, for ,
with the factors after omitted for . The signs follow from . As , the series has nonnegative terms and its sum increases to , so monotone convergence gives . These are therefore genuine probabilities on the nonnegative integers, proving that is a probability generating function. Its expected value is infinite, since ; finiteness of the mean is not required for this branching process.
Write . The composition formula gives , with . Consequently , and summing the geometric series yields the explicit generation generating function
This is the fractional-power offspring generating function and its iterates.
Given , the next size is a sum of independent reproduction counts. Multiplication of their probability generating functions gives . Averaging this conditional expectation proves
With one initial individual, and , so is the -fold composition of with itself.
A branching process models reproduction through successive generations. In the Galton-Watson process used here, every individual independently produces a nonnegative integer number of offspring with a common offspring distribution; these reproduction counts are independent across individuals and generations. If is the generation size, then
where the have that distribution and the empty sum is zero. Thus zero is absorbing: once a generation is empty, every subsequent generation is empty.
Another convolution of probability densities gives, for ,
Only this part of the density is needed because the fourth length is at most one.
Four positive lengths can form a nondegenerate quadrilateral if and only if every length is less than the sum of the other three. Necessity follows by following the other three sides between the endpoints of the longest side and applying the triangle inequality. For sufficiency, select a diagonal length in the intersection
Both intervals are nonempty, and their intersection is nonempty exactly when and . These are precisely the four strict length inequalities. Construct triangles with sides and on opposite sides of their common diagonal. Their union has the required simple, nondegenerate quadrilateral as boundary.
The failure events, in which one length is at least the sum of the others, are disjoint except on sets of probability zero. For the specified length , independence and the density above give
There are four symmetric choices of the overly long side, so the probability is
This is the four-sided case of the polygon probability for independent uniform rods.
Three positive lengths form a nondegenerate triangle precisely when each is less than the sum of the other two. Necessity is the triangle inequality. For sufficiency, two circles centered at the ends of one side intersect off that side whenever the remaining lengths satisfy these strict inequalities, giving the third vertex.
Failure thus occurs when , , or . Two such inequalities cannot hold together for strictly positive lengths. Zero lengths and equality cases have probability zero because the variables have continuous probability density functions. By symmetry each failure event has the probability just calculated. Hence the probability of forming a triangle is
Conditioning on , independence of gives for and zero for . Using the preceding probability density function,

There are unlisted articles, also show them or only show them.