Let be the event that candidate succeeds. The countable additivity axiom adds probabilities only for mutually disjoint events. Successes of different candidates are not mutually exclusive, so replacing the probability of their union by misuses that axiom. Without disjointness one obtains only the union bound, not certainty. The same sum is the expected value of the number of successes, which also need not imply at least one.
If the ten outcomes are mutually independent events, with each success probability , all fail with probability . Hence
The independence assumption is essential. The marginal probabilities alone allow any union probability from up to ; perfectly overlapping success events give the lower endpoint and disjoint successes give the upper endpoint.
Use the optimization Lagrangian
Symmetry gives the gradient equations and . The positive-definite matrices are invertible, so define
The affine constraint gives , hence
For a global certificate, write any other feasible point as . Feasibility implies . Expansion cancels the cross terms and leaves
By positive definiteness this is positive unless . Thus the solution is the unique global minimum, not merely a stationary point. This is a two-block instance of positive quadratic minimization under one affine constraint.
The objective is continuous on the compact disk, so a global maximum exists. Its gradient is , which is never zero, so a maximum cannot lie in the interior. It must have .
Both coordinates of a maximizing point are positive. Reflecting a negative coordinate to its positive counterpart strictly increases the objective without changing the constraint; at an endpoint with one coordinate zero, a small move along the circle into the positive quadrant also increases the objective to first order. Thus it suffices to consider .
The boundary Lagrange multiplier equations are and . Eliminate to obtain the two-dimensional nonlinear system of equations
Keeping this quadrant restriction excludes the boundary minimum that an unconstrained elimination could also produce. Under the stated uniqueness assumption for the admissible solution, the global maximum must be that solution. Approximate it with multivariable Newton iteration, solving and setting , with a suitable safeguard if needed. For example its explicit Jacobian matrix is
No numerical solution of the system is required.
Complete the square to write the objective as
Let and , so while feasibility requires . The reverse triangle inequality gives
The objective is therefore at least zero. Equality is attained by , which lies on the boundary. Equality requires the vectors to have the same direction and , so this minimizer is unique. Hence
It also satisfies the Karush-Kuhn-Tucker conditions with . The direct distance argument proves global optimality even though the exterior of a disk is not a convex set; this is nearest-point minimization outside a Euclidean ball.

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