Write for the conjugate transpose. Taking determinants in gives . Since the Hermitian matrix is invertible, every such is invertible and . The identity belongs to ; if , then ; and multiplying by and gives . Associativity comes from matrix multiplication, so this is a group.
The Hermitian form obeys precisely when . Thus is the group of linear isometries of this nondegenerate Hermitian form; positivity of is unnecessary.
For , is a unitary matrix. Here is a direct diagonalization of a matrix proof. Over , its characteristic polynomial has a root, giving a unit eigenvector with . Preservation of the inner product gives . If , then , so is invariant. The restriction is again a unitary matrix. Induction on the dimension supplies an orthonormal basis of eigenvectors. In that basis, is diagonal, with diagonal entries on the unit circle.
Let be a Euclidean domain and a nonzero ideal. Choose minimizing the Euclidean size. For any , Euclidean division gives , where either or has smaller size than . But , so minimality forces . Consequently . The zero ideal is , proving that every Euclidean domain is a principal ideal domain.
A commutative ring is Noetherian if every ideal is finitely generated; equivalently, every ascending chain of ideals stabilizes. To see the equivalence, the union of an ascending chain is an ideal. Finitely many generators for that union already belong to one member of the chain, after which the chain is constant. Conversely, an ideal which is not finitely generated permits successive choices outside the ideals generated by previous choices, producing a strictly ascending chain.
Every principal ideal domain is therefore Noetherian. The given Euclidean domain property of the Gaussian integers yields
Both maxima exist by continuity on the compact set . Their sum is nonnegative and vanishes only for . The identities and the triangle inequality follow by applying the corresponding supremum norm facts to and . This proves that is a norm.
For , . Hence the first unit ball has image contained in : derivative evaluation is a bounded linear functional for this norm.
For the supremum norm alone, take . These smooth functions satisfy , but . Thus the second image is unbounded. The distinction is the unboundedness of derivative evaluation in the supremum norm, not a failure of differentiability of the individual functions.
True. In a discrete topology, the singletons form an open cover. If is compact, a finite subcover exists, so is finite. Conversely, any open cover of a finite set has a finite subcover: choose one member containing each point. This converse does not require the discrete topology.
False without a separation assumption. Give the indiscrete topology , and take . Both spaces are finite and hence compact, but is not a closed set because is not open. In a Hausdorff space, a compact subset would be closed; that hypothesis is absent here.
Parametrize the characteristics by , starting from . Their ordinary differential equations areThey give , and . Thus and , soIndeed, , give , and . The initial line is noncharacteristic, and its characteristics cover the half-plane . The data do not determine a solution on ; a smooth solution through the origin is impossible because the differential equation there would read .
Take the divergence of the Ampère-Maxwell equation, . Since the divergence of a curl is zero vanishes, and Gauss's law gives , the result isThis is the charge continuity equation.
At an internal point of a homogeneous Ohmic conductor, Ohm's law gives . Since is constant, the charge continuity equation becomes . ThereforeThis is charge relaxation. Here is the total charge appearing in the vacuum form of Gauss's law; in a homogeneous dielectric description of free charge the corresponding constant permittivity replaces .
For a finite isolated body, charge travels to the surface. The bulk formula applies at internal points, not across the interface where electrical conductivity jumps and surface charge density accumulates. Integrating the charge continuity equation over the body, including its surface charge, gives constant total electric charge because no electric current crosses the external boundary. Bulk decay and conservation of electric charge are therefore compatible.
The free surface is a material surface, so its kinematic boundary condition isWith constant atmospheric pressure and no surface tension, the dynamic boundary condition for an inviscid interface follows from Unsteady Bernoulli equation:Write , where and are small. Choose the time-dependent potential gauge so the undisturbed right-hand side is . Retaining first-order terms, evaluated at , givesThe incompressibility condition also gives Laplace's equation for .
Set . Substitution of the specified normal mode into the two linearized boundary conditions yields and . Eliminating gives the dispersion relationThe decay factor in a fluid extending to uses . With signed wavenumber the decaying factor is and the right-hand side is . The frequency shift is the advection of a deep-water gravity wave by the uniform current.
The Rao-Blackwell theorem says that if is a sufficient statistic and a finite-variance estimator, then is an estimator with the same expectation and no larger variance. Sufficiency ensures the conditional distribution, and hence this formula as a function of the data, does not involve the unknown parameter. The tower property of conditional expectation gives , while the law of total variance givesThis proves the theorem and shows that equality holds exactly when is already determined by , almost surely. In particular, unbiasedness is preserved.
Assume . Independence gives , so the proposed indicator is unbiased and has variance . The type counts are a sufficient statistic: conditional on them, every ordering of the labels is equally likely. Consequently,For example, the conditional probability of the ordered first three labels is . This is Rao-Blackwellization of a multinomial probability product.
If all three are positive, there is positive probability that all three counts are positive. On such an event the conditional indicator has probability strictly between zero and one, so its conditional variance is positive. Thus for interior parameter values. If any , then and both estimators have zero variance; the printed strict inequality is impossible at those boundary parameters. The valid unrestricted statement is the non-strict inequality.
An cut of a flow network partitions a flow network into , with source and sink . Its cut capacity is the sum of capacities of arcs directed from to ; a minimum cut minimizes this sum.
Use the suggested nodes. Give capacity , each capacity , and each capacity . By the max-flow min-cut theorem, a flow of value exists once every cut capacity is at least .
Consider a cut of a flow network containing no crossing arc of capacity , and let be the intersections on the sink side. Every street incident to must also be on that side, or its arc to an endpoint in would cross the cut of a flow network. Hence at least source-to-street arcs cross, as do the intersection-to-sink arcs from the other intersections. Therefore its cut capacity is at leastA cut of a flow network crossing a capacity- arc has still larger capacity. The cut of a flow network just before the sink has capacity , proving the maximum flow value is exactly .
The integral max-flow theorem supplies an integral maximum flow. Every intersection sends units to the sink; each street can supply at most one unit, assigned to one endpoint. Orient each assigned street away from its assigned endpoint. Orient unassigned streets arbitrarily. Then each vertex has at least outgoing streets. An Ford-Fulkerson algorithm with integer capacities constructs this flow and therefore the street directions. Notice that the condition also is necessary: outgoing streets from vertices in are distinct edges incident to , so . This is an outdegree orientation criterion.
A set is linearly dependent if some finite selection of distinct vectors admits a relation with coefficients not all zero. For a finite set this is just such a nontrivial relation using its vectors.
Prove dependence of vectors in by induction, starting with the zero-dimensional case. If all first coordinates vanish, select of the vectors and apply induction in . Otherwise relabel so the last vector has first coordinate . For , put . These vectors have zero first coordinate, so induction supplies , with some . Expanding gives a nontrivial linear dependence among the original vectors. The same proof works over any field.
Now express vectors of in coordinates relative to its given -element basis. Any other basis has at most elements: more would contain linearly dependent vectors. If it has elements, expressing the original basis in its coordinates makes the original vectors linearly dependent, a contradiction. Thus every basis has exactly elements.
Finally, the functions , , are bounded and continuous. Any finite relation among them can be multiplied by and integrated over . The orthogonality identityforces every coefficient to vanish. Arbitrarily large linearly independent finite sets exist, so the vector space of bounded continuous functions is infinite-dimensional.
The structure theorem for finitely generated modules over a principal ideal domain applies because a Euclidean domain is a principal ideal domain. For a finitely generated -module,where the are nonzero nonunits. The free rank and the invariant factors of a finitely generated module are unique, with each determined up to multiplication by a unit. Equivalently, the torsion submodule decomposes into cyclic modules for irreducible , with uniquely determined prime-power elementary factors.
The annihilating polynomial excludes any free -summand. In a cyclic primary decomposition summand , the same condition requires to divide . Thus , up to a scalar unit, and . The complex dimension of this summand is .
Write . The exponents must form a partition of an integer , giving exactlyThey are distinct module isomorphism types by uniqueness in the structure theorem for finitely generated modules over a principal ideal domain; equivalently they are the five possible Jordan block patterns for eigenvalue in dimension four.
Factor . These factors generate pairwise comaximal ideals, so the Chinese remainder theorem givesThe three copies of have different module structures: acts by , respectively. Thus acts on as , making a module homomorphism.
The inverse, obtained by Lagrange interpolation, isEvaluating at recovers . Conversely, a polynomial whose three evaluations vanish is divisible by , so these maps are mutual inverses on the quotient module. Three copies with identical trivial -action would not give the required isomorphism.
Fix and a sufficiently small rectangle inside . Its rectangular incrementcan be evaluated twice using the fundamental theorem of calculus, givingDivide by and let . Continuity of the mixed partial derivatives makes the two limits and . They are equal everywhere on .
Repeated interchange of adjacent partial derivatives reduces every order- derivative of a smooth function to , . Hence there are at most distinct functions. This maximum is attained by , whose listed partial derivatives are the distinct functions . The answer is , rather than the possible written orders.
For the supplied , for , whereas . It is not even continuous at the origin, so is neither differentiable nor infinitely differentiable there.
For , . Thus , proving Fréchet differentiability at the origin with derivative zero. However,including zero at the origin. Therefore and . is differentiable but not infinitely differentiable at the origin: it cannot have continuous second partial derivatives near that point.
The denominator vanishes when . For , only lies inside the rectangle. This is a simple pole, since the denominator derivative there is . Its residue isThe positive orientation and the residue theorem consequently give
On the top side put , with running from to . Since and , the reversed orientation cancels the minus sign. The two horizontal integrals therefore sum toIf the vertical contributions vanish, the previous residue theorem evaluation yields the Fresnel integralThis also is an ordinary oscillatory improper integral, not merely a symmetric principal value: integration by parts, using , bounds either tail beginning at by a constant times .
For , , the numerator modulus is and the denominator modulus is at least . Hence the magnitude of the right-side contour integral is at mostOn the corresponding bounds are and , giving exactly the same bound . Thus the total vertical contribution is and vanishes. This integral estimate handles the endpoints where a pointwise uniform-decay argument would fail.
First normalize the two circles by translation and rotation so their centres are and radii . If nothing further is needed. Otherwise choose real satisfyingThe discriminant of this quadratic issince two disjoint circle boundaries are either externally separated or strictly nested. Thus , and is a Möbius transformation. Direct expansion shows that on the first circle , and on the second . Both constants are positive; the pole is on neither circle. Their images are distinct concentric circles. This proves the concentric normalization of disjoint circles.
For a construction with , use inner radius , outer radiusand small circles of radius centred at . Each touches the two boundaries, and adjacent centre distances are . All other distances are at least , so there are no unwanted intersections. These are Steiner chains. For the literal requirement, take , , and two radius-one circles centred at . Their centre distance is , so this gives two distinct mutually tangent circles touching both boundaries. Existence holds for every , but the two-circle case has only one tangency between neighbours, repeated by the cyclic indexing.
For an annular circle touching radii , its radius and centre distance are and . Two neighbouring such circles have angular separation ; their tangency point is the midpoint of their centres. Its distance from the common centre isThus the tangency locus in concentric coordinates is a circle of radius . For , disjointness forces the constellation to use these annular circles. Indeed, the other family of circles touching both boundaries has radius and centre distance , enclosing the inner boundary. Two members of that larger family intersect. One such circle can be disjoint from an annular circle only at the two opposite centre directions where their boundaries are tangent; those two annular circles cannot be tangent to each other. Hence this family cannot occur in a constellation of three or more circles.
Under the inverse Möbius transformation, the tangency locus is a generalized circle, which can be an ordinary circle or a straight line. The printed claim that it is always an ordinary circle is false without this qualification. For an explicit counterexample, use the above construction, put , and apply . Its pole lies on the tangency locus but on none of the original boundary or chain circles. Consequently all the transformed individual circles remain ordinary circles. The three distinct tangency points transform to three points on the line , so they cannot lie on an ordinary circle.
The usual closure assertion is Steiner's porism, with two essential conventions: stay in the annular family and always choose the next tangent circle in the same angular direction. For a disjoint closed chain with , distinctness prevents reversing direction: a reversed step would return immediately to the preceding circle. Thus every step has the same sign and closure gives for an integer . If , the distinct centres have some angular gap , making two circles intersect. Hence and . Starting at any new angle produces centres , a rotation of the original chain, soMapping back proves the same porism on the corresponding branch of circles for the original pair.
The literal final request, with arbitrary tangent choices and included, is stronger and false. In the two-circle example above, the forward angular step is . Starting at angle , a next circle at and then one at satisfy every inductive tangency requirement, but . Even for , allowing backtracking lets the construction reverse instead of completing the chain. Thus the genuine geometric conclusion is the qualified porism, not unrestricted closure under the printed induction.
The Euler-Lagrange equation is . Since has no explicit dependence,Thus a stationary curve satisfies the Beltrami identity, .
By Fermat principle, the light ray makes the travel time stationary. Its Beltrami identity becomesWriting and integrating the resulting first-order equation gives . Both endpoints have height zero, so subtracting their equations gives , and then . The arc lying in isIts maximum height is . The ray rises into the faster region before returning to the boundary; its circle centre is . The prescribed boundary endpoints are understood by continuity from the open half-plane. This is the circular light ray in a linear speed profile.
For the Dirichlet Green's function, solve with zero endpoint values. Away from , is linear. Continuity at and the derivative jump giveFor nonzero Dirichlet boundary conditions, subtract their linear interpolant. The resulting boundary value problem has solutionIn the final heat equation, a steady state has zero time derivative. Here , , , . Integrating twice and imposing the endpoint values givesIts second derivative and both boundary conditions verify the answer directly.
The time-independent Schrodinger equation gives the even interior wavefunction , with . Outside, normalizability of a bound state requires , with .
Continuity of the wavefunction and its derivative at gives and . A nonzero solution cannot have , so division givesAt the formally allowed endpoint , the even interior solution is constant; derivative matching would force the exterior amplitude to vanish, leaving the zero solution. Nontrivial bound states therefore have . The matching formula is the even-state condition for a finite square well.
Put and . Integrating the Schrodinger equation across the delta potential gives continuity of andFor incidence from the left, write on and on . Matching gives and , henceThe incident and transmitted probability currents have the same velocity factor, so the reflection coefficient and transmission coefficient areFor , an even bound state has , . The derivative jump now gives , so andThere is exactly one positive value of , hence exactly one even bound state. Its normalized amplitude is . An odd decaying solution would have to vanish at zero and is therefore trivial.
In the shrinking finite square well, its integrated potential is , not : the full width is . With fixed and , . The matching condition then bounds by , so remains bounded. Consequently , and the previous matching condition givesUsing recovers the same bound-state energy. All other even levels disappear as the width shrinks.
For a thin wire carrying current , the given magnetic vector potential reduces to . Taking its curl and using gives the Biot-Savart lawThis is exactly the sign convention in the printed form using .
Let . Away from the wire, . The supplied divergence and curl of a cross product therefore gives . But , so the integrand is the total differential of along the source loop. Its closed-loop integral is zero. Thus at every point outside , as demanded by the current-free magnetostatic Ampère's law.
For , , and counterclockwise current, . At the origin, , soFor the ellipse expressed relative to a focus, . The cosine integrates to zero, givingHere is the semilatus rectum. Reversing the current reverses the field direction.
Convergence of a numerical method on means that its grid error obeys as , with consistent initial values.
First, the implicit step of Backward Euler method is well-defined for : the map is a contraction mapping on , so the Banach fixed-point theorem gives a unique solution. Let , finite under the stated smoothness. The exact solution's step defect isso . Subtract the exact and numerical step equations. The Lipschitz condition givesWith exact initial data, sum this geometric progression to obtainFor and , , so the bracket is at most . Thus the global error is , uniformly on , and Backward Euler method converges with order one. A vanishing initial error adds only .
Order one is sharp: for , and , .
For the Dahlquist test equation , the stability function is , . Therefore its linear stability domain isThe strict inequality gives decay; equality gives bounded amplification. The whole closed left half-plane lies in this region, so Backward Euler method is A-stable.
Let . By the Strong Markov property, the probability of hitting and subsequently returning to is . This event implies a return to , so . For , interpret the event as two successive returns.
Set and let be the th successive return. Repeated use of the Strong Markov property gives . The total number of visits, including time zero, is both and . By Tonelli theorem,The identity is valid with value . In particular, divergence of the return-probability sum is equivalent to Markov-chain recurrence.
For a planar simple symmetric random walk write its coordinates as and rotate to . Each step now has four equally likely values . Thus the two rotated coordinates are independent one-dimensional simple symmetric random walks.
A return is impossible at odd times, and at time its probability isFor , the supplied estimate gives . At the lower bound is actually equality, ; this harmless strict-endpoint typo does not affect the argument. The harmonic series diverges, so the criterion proved above shows that the origin is recurrent, in the terminology of a recurrent Markov chain. Translation invariance gives the same conclusion for every state. The Markov chain is irreducible, so from any starting point it hits any fixed state almost surely and revisits it infinitely often. One can see the hitting assertion directly: repeated returns to the starting point give repeated positive-probability opportunities to follow a finite path to the target.
For an active monster, independence givesBoth probabilities vanish before time and at odd times. By convolution and Cauchy-Schwarz, : indeed, write the -step probability as the inner product of two translates of the -step probability mass function. ThereforePositivity follows by prescribing simultaneous steps taking both walkers straight to the origin; that event has probability . An active monster thus leaves a positive escape probability.
For a sleepy monster, the origin capture by a sufficiently sleepy planar random walk can be proved using the printed schedule: during it occupies . For any , let be the first with . Markov-chain recurrence of makes finite almost surely, and it is independent of . By conditioning on and using the stated block bound,As , continuity of probability for decreasing events shows that the event of infinitely many simultaneous origin visits has probability at least . Regard the independent trajectories as continuing even after a possible first capture.
To turn this into probability one, use the eventual coupling of planar symmetric random walks; the block events need not be independent. Two planar simple symmetric random walks begun at sites of the same parity can be coupled to agree eventually. Run them independently until they meet. Their difference walk is irreducible on the even-parity sublattice, and its -step return probability is , by convolution and symmetry. The preceding divergent-series criterion makes this difference walk a recurrent Markov chain, so it hits zero almost surely. After that stopping time, use identical increments for both copies, preserving their marginal laws by the Strong Markov property.
Fix any finite calendar time and any two possible histories up to that time. Corresponding princess positions have the same parity, as do the corresponding monster positions at its internal walk time. Apply the eventual probabilistic coupling separately to the two princess futures and the two monster futures, keeping the princess and monster walks independent in each pair. Both the calendar clock and the monster's internal clock tend to infinity. Hence after a finite calendar time the two pairs of trajectories agree, so either both realize or neither does. The conditional probability of is therefore the same for every possible finite history.
Consequently for every . By the Martingale convergence theorem, these conditional expectations converge to as the histories exhaust the trajectories. Thus is zero or one. Since it is at least , it is one. In particular,This argument uses the supplied unconditional block probabilities; it does not silently strengthen them to conditional probabilities given past failures.
Articles by others on the same topic
There are currently no matching articles.

