Write , and . The law of total probability gives , a convex combination of the two fixed conditional values. Hence
These are the closed sharp bounds in the usual mixture-model interpretation, obtained by allowing to range from zero to one. The joint masses realize every such mixture.
There is an endpoint qualification if both conditionals must literally be defined by ratios: then . If , the marginal lies strictly between them, so the stated endpoints are an infimum and supremum rather than achieved extrema. If , every allowed mixture has exactly that common value. This is the second case of sharp bounds from binary conditional probabilities.
Put and . Decompose the marginal as , where . It follows that
Both bounds are attainable: choose none or all of the mass outside to belong to . More explicitly, the four joint cell masses can be , all nonnegative. This is the first case of sharp bounds from binary conditional probabilities.
For the usual conditional-probability ratio, the given requires . If , the two bounds coincide at . If , the conditional is undefined as a ratio, although its formal joint-model bounds reduce to .
The law of total probability weights each jar's red fraction by its selection probability:
The large difference in jar sizes does not change their equal selection probabilities; pooling their contents would describe a different experiment.
The inverse appearing in the assumption requires . Taking determinants of gives
where the minus sign comes from the odd matrix order. Multiplying by gives . Since is real, the second factor is positive. Thus and is a singular matrix. This is the singularity forced by an odd-dimensional transpose-inverse identity, with the roles of the two matrix letters exchanged.
The transpose rule gives . If is orthogonal, , and the identity becomes
Multiplying on the left by yields . This is precisely the defining condition for an antisymmetric matrix.
The three columns of are , , and . Each has squared Euclidean norm eight. Their pairwise dot products are
Hence , so . Thus is an orthogonal matrix, with . The determinant from (i) places it in the determinant-one component.
Let be the unscaled matrix. Expansion along its third row gives
Scaling a three-by-three matrix by scales its determinant by . Therefore
Near zero, and , so . Replacing by similarly gives . Therefore
For all sufficiently small nonzero , both cosines are positive and the denominator logarithm is nonzero, so this quotient and its two-sided real limit are well-defined.
The cosine-difference identity gives . Hence
Each sine ratio tends to one, so
Equivalently, the quadratic terms of the two cosine expansions differ by .
Here , so grows exponentially rather than decaying. The positive terms do not tend to zero; indeed they tend to . Therefore the series diverges by the necessary condition that the terms of a convergent series tend to zero.
The ratio test gives the same conclusion: .
Let . The ratio test gives , so the series converges absolutely. In fact the exponential series identifies its value as
with the term subtracted.
At fixed , the argument is linear in , with . Each differentiation therefore contributes this same constant factor, while the outside factor remains unchanged. Thus
Here denotes the third derivative of the single-variable profile, not a partial derivative of .
Put and write for differentiation with respect to . Work on a real branch where the powers are defined and differentiable; , suffices for arbitrary real , and the parameter choice below has . At fixed , . The product rule and chain rule therefore give
Integer powers of repeat with period four. Thus , and
This negative integer power is single-valued and does not require a logarithm branch.
The logarithm's argument is , with complex modulus one. The principal complex logarithm is therefore , giving
If denotes all logarithm values rather than the principal branch, they are for : the real part remains zero and the imaginary part changes by integer multiples of . The principal value is the conventional single-valued answer.
The adjugate matrix formula gives
Multiplication by the right-side column yields
Multiplying the inverse by checks the identity matrix, and substitution of this solution into the three original rows gives respectively.
Write the linear system as with
Expansion along the first row gives . Since , is an invertible matrix, and is the unique solution for this right side.

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