For a linear map , its rank is and its nullity is . The rank-nullity theorem states that, when is finite-dimensional,To prove it, take a basis of and extend it to a basisof . The vectors span . They are also linearly independent: if , then , and independence of the chosen basis forces every to vanish. Thus the rank is and the nullity is .
For the given subspace, row reduction of the coefficient matrix givesTaking and therefore givesHenceis a basis of .
Solved by gpt-5.6-sol high.
After the sides are identified in pairs, the polygonal-schema Euler count gives one face, edges and some number of vertices. The Euler characteristic of a closed orientable genus- surface is , so
For genus two, take a regular octagon in the Poincare disc model and identify each side with its opposite side, with the orientation reversed along the boundary. One cyclic labelling isThe quotient has , , and , hence Euler characteristic and genus two. All eight vertices become one point, so smoothness requires their angles to sum to . Each interior angle is consequentlyEquivalently, the hyperbolic polygon area formula shows that the regular hyperbolic octagon fundamental polygon has areaas required by the Gauss-Bonnet theorem for a genus-two surface of curvature .
Solved by gpt-5.6-sol high.
Sincethe critical points are exactlyThe holomorphic inverse function theorem shows that is conformal locally everywhere else.
For ,Its imaginary part is positive throughout . On the three boundary pieces,These intervals traverse the boundary of the upper half-plane. The inverse branchexists for , proving that the image is preciselyThis is the hyperbolic-cosine half-strip map.
Solved by gpt-5.6-sol high.
At a regular constrained extremum of on , the tangent derivatives of vanish. Since is normal to the constraint surface, the Lagrange multiplier condition isOne solves these equations and then compares the resulting candidates, including any boundary or singular cases.
Let the base have dimensions and , and let the height be . Measure cardboard relative to the thickness of the front and back. The weighted amount used isbecause the bottom has triple thickness, the two front and back faces have ordinary thickness, and the two side faces have double thickness. The constraint is .
The multiplier equations areThey implyThus and ; imposing gives . ThereforeThis is the global minimum: by the arithmetic-geometric mean inequality,and equality holds at these dimensions. This is an instance of weighted open-box minimization.
Solved by gpt-5.6-sol high.
For distinct nodes, define the divided difference byThis is the coefficient of in the Lagrange interpolation polynomial through the first data points.
Let denote that interpolating polynomial. The difference vanishes at , soThe Lagrange formula shows that the leading coefficient of is , whereas has degree at most . Hence . Starting with and iterating gives the Newton interpolation polynomial
The divided-difference recurrence isFor three nodes, the triangular table iswhere each entry in a new column uses the two adjacent entries to its left. There are first differences, second differences, and so on, each requiring one division. The exact total is
Solved by gpt-5.6-sol high.
A statistic is sufficient for a parameter when the conditional distribution of the full sample given does not depend on . For a dominated model, the Fisher-Neyman factorization theorem says this is equivalent to a factorizationwhere is independent of .
Solved by gpt-5.6-sol high.
A sufficient statistic is minimal sufficient if it is a function of every other sufficient statistic: whenever is sufficient, there is a function such that almost surely, up to the usual null-set qualification. Thus its level sets give the coarsest sufficient partition of the sample space. In a dominated family with positive densities, the likelihood-ratio criterion for minimal sufficiency says that is minimal sufficient when
Solved by gpt-5.6-sol high.
Moreover,is independent of exactly when , equivalently . The likelihood-ratio criterion for minimal sufficiency therefore proves that
Solved by gpt-5.6-sol high.
The joint density depends on the sample throughnot merely through . For example, after padding with zeros when , takeBoth samples have sum of absolute values , butwhich depends on . The likelihood-ratio necessary condition for sufficiency fails, so
Solved by gpt-5.6-sol high.
Introduce nonnegative dual variables and for the two constraints. The dual of a minimization linear program in inequality form isIndeed, if and are feasible, thenwhich is weak duality.
Solved by gpt-5.6-sol high.
The dual from part (a) isThe point is dual feasible and has value . The primal pointis feasible and also has objective valueBy weak duality, neither point can be improved, soThe strict dual inequalities for and , together with complementary slackness, force at any optimum; the two tight primal constraints then force and . Thus the displayed minimizer is unique.
Solved by gpt-5.6-sol high.
The dual space isthe vector space of linear functionals on . If is a basis of a finite-dimensional , define . Every has the unique expansionso the dual basis proves
For , its annihilator of a vector subspace isIf is a basis of and is extended to a basis of , thenConsequentlyIf , this dimension is positive, giving a nonzero functional that vanishes on .
For a linear map , the dual map isNowsoEvery vanishes on , henceThe two spaces have the same dimension, sinceThus
Let be the quotient map. Since is onto, is injective, and the preceding identity givesThereforeFor the inclusion , the map is restriction to . It is onto and has kernelThe first isomorphism theorem now gives the other duals of a subspace and its quotient:
Solved by gpt-5.6-sol high.
Suppose that were not surjective. Its image would be a proper subspace of , so there would be a nonzero functionalvanishing on . Thenfor every , contradicting the linear independence of the . Hence the surjectivity of independent linear functionals gives
Let and suppose . DefineThis is well-defined: if , then , so . It is linear, and surjectivity of means it is defined on all of . Thus there are scalars such that . Thereforeand hence
Solved by gpt-5.6-sol high.
- has a subgroup of order ;
- every -subgroup of is contained in a Sylow -subgroup;
- all Sylow -subgroups are conjugate;
- their number satisfies and .
Solved by gpt-5.6-sol high.
Since , its Sylow -subgroups have order two and its Sylow -subgroups have order three. They areandrespectively. The latter is the unique Sylow -subgroup.
Solved by gpt-5.6-sol high.
A Sylow -subgroup of has order . For example,It is the normalizer of . The six -cycles form three inverse pairs, and a dihedral group of order eight has a unique cyclic subgroup of order four. Hence the three Sylow -subgroups are
Solved by gpt-5.6-sol high.
A Sylow -subgroup of has order four. Since has no element of order four, each is a Klein four-group. For every , take the identity and the three double transpositions fixing . For instance, the subgroup fixing isThese five point stabilizers are precisely the Sylow -subgroups. Indeed, the double transpositions occur three to each such subgroup, so there areof them. Together with the previous parts, this gives the Sylow subgroups of S3, S4 and A5.
Solved by gpt-5.6-sol high.
Let act by left multiplication on the coset set . Composing the resulting homomorphismwith the sign homomorphism gives a homomorphism . If it were nontrivial, its kernel would have index two, contrary to the hypothesis. Thus every element of , and in particular , induces an even permutation.
Since is a Sylow -subgroup, is odd. ThereforeAn involution acts as disjoint transpositions and fixed points. If fixed no coset, it would be a product of transpositions, an odd number, contradicting evenness. HenceThis is the even-involution coset fixed-point lemma.
Solved by gpt-5.6-sol high.
Solved by gpt-5.6-sol high.
A metric space is complete when every Cauchy sequence in it converges to a point of the space. Let be Cauchy in a closed subspace of a complete metric space . It is also Cauchy in , so for some . Since is closed and every lies in , one has . Thus the closed-subspace completeness theorem proves that is complete.
Solved by gpt-5.6-sol high.
For a point and a nonempty set, write . The given Hausdorff distance is equivalentlyIt is nonnegative and symmetric. If , then every has , so because is closed; hence , and symmetry gives .
For the triangle inequality, the ordinary triangle inequality givesTaking suprema over , and then repeating with and interchanged, yieldsThus is a metric on . Closedness is essential: if it is omitted, then the distinct bounded sets and have Hausdorff distance zero.
For singleton sets,so is an isometry. Its image is closed. Indeed, if converges in Hausdorff distance to , then for every and all sufficiently large ,Hence any satisfy . Letting gives , so the nonempty set is a singleton. This is the closed singleton embedding in a Hausdorff hyperspace.
If is complete, its closed subspace is complete. Since is an isometry, is complete. Hence completeness is reflected by the Hausdorff hyperspace.
Solved by gpt-5.6-sol high.
A regularly parametrized curve on an embedded surface is a geodesic when its covariant acceleration vanishes. Equivalently, in the ambient Euclidean space,for an affine geodesic parameter. A complete geodesic is one whose maximal affine parameter interval is all of .
Solved by gpt-5.6-sol high.
Tangency along meansfor every . Consequently is perpendicular to the first tangent plane exactly when it is perpendicular to the second. The ambient characterization of a geodesic therefore proves the tangency invariance of an ambient-surface geodesic:
Solved by gpt-5.6-sol high.
For fixed , varying traces a unit circle in the radial-vertical plane centred atThus is a unit tube whose centre winds helically around the -axis. Sincethe given curve is its inner helix.
Take to be the circular cylinder . Along ,so their span is the tangent plane of that cylinder. The two surfaces are therefore tangent along . Moreover,which is normal to the cylinder, so is a geodesic of . Part (ii) now proves that it is a geodesic of . This is the cylindrical-helix tangency construction.
Solved by gpt-5.6-sol high.
SetAlong ,whose span is the tangent plane of the cylinder . Alsois normal to that cylinder. The same tangency argument proves that is a geodesic of . It is defined for every , hence complete, and it is disjoint from because their distances from the -axis are respectively and .
Solved by gpt-5.6-sol high.
- The singularity is removable when extends holomorphically to , equivalently when every negative-power Laurent coefficient is zero.
- It is a pole of order when extends holomorphically to a function nonzero at . Equivalently, the Laurent series starts with a nonzero term and has no more negative power.
- It is essential when it is neither removable nor a pole, equivalently when infinitely many negative-power coefficients are nonzero.
Solved by gpt-5.6-sol high.
Write the Laurent expansion on the punctured disc asFor every integer , the Laurent coefficient formula and the Cauchy-Schwarz inequality giveLetting shows that . Every coefficient in the principal part vanishes, so the uniform L2 circle bound for a removable singularity proves that
Solved by gpt-5.6-sol high.
Since , its singularities occur at the simple zeros of the denominator,At each one, and , so all are simple poles. There are no other finite singularities:
Solved by gpt-5.6-sol high.
PutNear , writing givesButand hence, exactly,Since , the first two Laurent terms areEquivalently, substitute in this expression.
Solved by gpt-5.6-sol high.
At every , the function has a simple pole. The exponential of a pole is an essential singularity, soare essential singularities of .
These points accumulate at . Therefore no punctured neighbourhood of zero is a domain of holomorphy for the function: zero is a non-isolated singularity, specifically an accumulation point of essential singularities, rather than an isolated essential singularity. There are no other singularities in .
Solved by gpt-5.6-sol high.
Continuity at is automatic in the proposed expression. Integrating the differential equation through gives the derivative jumpThusIn terms of the Wronskianone hasThe boundary conditions hold because and .
The Abel identity gives . If , the Wronskian and hence are constant. The two branches of the displayed formula are then interchanged by , provingThis is the symmetry of the Neumann Green function for a second-order ordinary differential equation in the self-adjoint case.
For , chooseTheir Wronskian isWriting and givesThe solution of the inhomogeneous problem is . Equivalently, solving directly givesThe two Neumann conditions yield andTherefore
Solved by gpt-5.6-sol high.
The anti-muon has the same charge as a proton, so the Coulomb potential seen by the electron is the same as in the hydrogen atom. The main difference is the source mass. Separating the centre-of-mass motion replaces by the Coulomb two-body reduced massSince , this is close to , though less close than the electron-proton reduced mass. The smaller reduced mass gives a slightly larger Bohr radius and energies of slightly smaller magnitude. Under the assumptions in the question, the Coulomb form, angular eigenfunctions and quantum numbers are otherwise unchanged; anti-muon decay and spin effects are being neglected.
Solved by gpt-5.6-sol high.
For fixed , the radial equation isSubstituteCancellation of the coefficient of requiresthe reduced-mass Bohr radius. The remaining constant term givesEach such no-radial-node state is a circular Coulomb bound state with principal quantum number .
Solved by gpt-5.6-sol high.
Comparing the prepared energy with the formula in part (ii),so and . The radial probability density, apart from normalization, isUsing the given factorial integral, its mean is the ratioFor this gives the mean radius of a circular Coulomb bound state
Solved by gpt-5.6-sol high.
The energy fixes , irrespective of the magnetic quantum number . Therefore every prepared state is an eigenstate of withAn immediate measurement of the total orbital-angular-momentum magnitude cannot yield , so the requested probability is
Solved by gpt-5.6-sol high.
Differentiate under the integral and use :The omitted boundary term vanishes if the current is localized sufficiently rapidly. A steady current obeys charge conservation , hence
For much larger than the source size,Localization and imply . They also implyby integrating . Thus the first nonzero moment is antisymmetric and can be written using the magnetic dipole momentConsequently the Coulomb-gauge vector potential of a localized steady current has far fieldThe dimensions are
Solved by gpt-5.6-sol high.
The total hoop charge is . One revolution takes , so the current isMultiplying by the enclosed area gives
Solved by gpt-5.6-sol high.
An annulus of radius and width has charge , currentand dipole moment . Therefore the magnetic dipole moment of a rigidly rotating charge distribution is
Solved by gpt-5.6-sol high.
Let point downslope and point normally away from the plane, with . Write the parallel velocity as and take to be the magnitude of the air's upslope stress. The steady equations arewith boundary conditionsThe free-surface condition makes , and integration gives
The surface velocity, downslope shear exerted by the fluid on the plane, and volume flux per unit width areThus the inclined viscous film with opposing surface shear reverses in the three senses whenThe order of increasing required air stress is therefore
Solved by gpt-5.6-sol high.
A Givens rotation is the identity except in rows and columns , where it has the blockFor and , choosewhen . ThenIf both entries vanish, any angle works.
For the given matrix, first useIt givesThen useThus isAll leading row entries are positive. The resulting QR decomposition by Givens rotations iswhereand is the matrix above. Since it is a product of transposed rotations, is orthogonal.
Solved by gpt-5.6-sol high.
Write , where the are independent variables. Convolution gives the sum of two independent uniform variables:Its plot is a triangle with vertices
Solved by gpt-5.6-sol high.
For Test 1, the rejection probability is increasing in , so its size over is attained at and equalsTest 2 is also monotone under shifts in , so its size is . For , the triangular upper tail isEquating this to gives
Solved by gpt-5.6-sol high.
The power function of a statistical test for Test 1 is
Put . Test 2 rejects whenUsing the two branches of the triangular distribution givesBoth functions equal at the least favourable null value .
Solved by gpt-5.6-sol high.
The two tests have the same size, but their powers cross. At ,At ,Thus Test 2 is a same-size test that beats Test 1 at one alternative, while Test 1 beats Test 2 at another. By the crossing-power obstruction to a uniformly most powerful test,
Solved by gpt-5.6-sol high.
Starting from , the probability of reaching before returning to is . Conditional on reaching , each visit to is followed by a hit on before the next return to with probability , by symmetry and the Strong Markov property. For , the number of visits after entry is therefore geometric on with mean . Hence the two-state excursion visit law givesIn the degenerate case , the chain never reaches before its return to , so almost surely and .
Solved by gpt-5.6-sol high.
There are no visits when the initial excursion returns to before hitting , soFor , the chain must first hit , return to before exactly times, and then hit before another return to . The Strong Markov property givesThe formula also covers the boundary cases and .
Solved by gpt-5.6-sol high.
For the converse as well as the stated symmetric case, setIrreducibility and the existence of an invariant probability distribution make the chain positive recurrent, so . During one return cycle from to , the chain enters with probability and, after entry, makes a geometric number of visits to with success parameter . ThereforeOn the other hand, the stationary cycle occupation formula givesConsequentlyIt follows thatwhich is precisely the claimed equivalence between symmetry of and equality of their invariant masses.
Solved by gpt-5.6-sol high.
Codex Wiki