Write an integral binary quadratic form as . It is positive definite when and its discriminant is negative. Two forms are properly equivalent when one is obtained from the other by a change of variables in . A reduced positive definite binary quadratic form satisfies
with when or .
To prove reduction, choose in a proper equivalence class a form whose positive leading coefficient is minimal. Replacing by changes by , so choose to arrange . If the resulting , the determinant-one substitution would put in the leading position, contradicting minimality. Thus . Sign changes on the boundary give the stated convention. Hence every positive definite form is properly equivalent to a reduced one.
A unimodular integral substitution is a bijection of , so properly equivalent forms represent exactly the same integers.
Both given forms have discriminant . Reduction gives
The two reduced forms represent the same integers because
an integral change of variables of determinant . They are not properly equivalent: the uniqueness theorem for reduced positive definite forms says that each proper class has one reduced representative, and . Therefore the original forms represent the same integers but are not equivalent in the required proper sense.
A set is of first Baire category, or meagre, when it is a countable union of nowhere dense sets. The statement is true: a countable union of countable unions of nowhere dense sets is again a countable union of nowhere dense sets.
The relevant Baire category theorem says that a nonempty complete metric space is not meagre in itself.
False. Fix and take
This closed set has empty interior in , so it is nowhere dense and hence meagre. Its section at is , which is not meagre in itself by the Baire category theorem.
True. Write with every nowhere dense in . Then
The closure of is
, which has empty interior because has empty interior. Each product is therefore nowhere dense, so is meagre in .
False. The coordinate axes
are both closed nowhere dense subsets of , but every is , so
which is not meagre by the Baire category theorem.
A discrete memoryless channel has finite input alphabet , finite output alphabet , and transition probabilities ; successive outputs are conditionally independent given the corresponding inputs. The Shannon second coding theorem states that rates below
admit block codes with error probability tending to zero, whereas rates above cannot have vanishing error.
For any joint input law of , conditional independence of the product channel gives
Choose and independently with capacity-achieving input laws for their respective channels. Then the inequality becomes equality, so the product-channel capacity is
The pumping lemma for regular languages states that if is regular, then some has the following property: every with can be written with , , and for every . Indeed, while a deterministic finite automaton with states reads the first symbols, two of the first visited states coincide; the intervening nonempty loop may be traversed any number of times.
The language is not regular. If its pumping length were , apply the lemma to . The pumped block is for some . Pumping once more gives zeros, but
so their number is not a square.
The language is not regular. For pumping length , take . Any permitted pumped block lies entirely among the initial zeros. Pumping it down changes the number of zeros without changing the number of ones, producing a word outside the language and contradicting the pumping lemma.
This language is not regular. If it were regular, its intersection with the regular language would be regular because regular languages are closed under intersection. That intersection is exactly
which part (ii) proved nonregular.
A one-parameter exponential family has densities
with support independent of the natural parameter . In the present canonical setting the natural statistic is .
Independence gives the joint density
By the factorization criterion, its dependence on the sample relevant to is only through , equivalently through . Thus is a sufficient statistic for .
The log-likelihood has derivative
Differentiating the normalizing identity for the family gives
Hence an interior maximum satisfies, and under nondegeneracy uniquely satisfies,
Set
Then
The steady states are
where the coexistence state is biologically relevant exactly when .
The Jacobian is
For , the origin has eigenvalues and is an unstable node. At the eigenvalues are and , so it is a stable node. At the coexistence state,
so it is a saddle.
The nullclines are , , , and . The stable manifold of the coexistence saddle separates trajectories tending to from trajectories on which and grows without bound. The coordinate axes are invariant.
There is no stable positive coexistence state: the only one is a saddle for every when . Moreover, the Bendixson-Dulac criterion with Dulac function applies in the positive quadrant, since
Thus no periodic orbit can support long-term coexistence. Except on the saddle's stable manifold, one species is excluded: species 2 becomes extinct for initial data in the basin of , ecologically when species 1 is sufficiently abundant and species 2 sufficiently scarce. On the other side, species 1 becomes extinct and the unregulated second species grows.
Choose paths from to in the cut plane and deform them continuously with the endpoint, never crossing the specified cut. With , use the sheet reached from the positive real axis; when an endpoint is moved into the left half-plane, the path passes around the upper endpoint of the cut. The cut makes all such admissible paths homotopic with fixed endpoints, so the integral is single valued and its endpoint derivative is ; hence it is analytic.
For , continue the endpoint counterclockwise from the positive real axis through the upper half-plane. In
the continued square root equals at . The logarithm is reached with argument , and therefore
The identities
show directly why continuation without an argument restriction is multivalued. The complete set of values of the multivalued inverse hyperbolic sine at is
Order the phase-space coordinates as
Then Hamilton's equations are
The Poisson bracket is
For with Jacobian , the chain rule gives
This has Hamiltonian form with the same canonical matrix for every exactly when
Taking determinants gives ; the symplectic condition fixes the orientation, so . Hence the change-of-variables formula shows that the phase-space volume element is invariant. This is Liouville theorem in Hamiltonian mechanics.
By the shell theorem, only the mass inside the particle's radius contributes:
The conserved Newtonian energy per unit particle mass is
Writing and using conservation of enclosed mass, so that is constant, gives
This is the first Friedmann equation without a cosmological constant.
The derivation has two central defects. It uses instantaneous Newtonian gravity and omits the relativistic gravitational effect of pressure, so it is not valid for general cosmological matter. It also starts from a finite ball with a preferred centre and boundary, contrary to exact homogeneity and isotropy; the assumption only hides that defect locally.
In the BB84 protocol, Alice independently chooses random bits and, for each bit, a random computational or Hadamard basis. She sends the corresponding states through the noiseless quantum channel. Bob independently chooses one of the two bases for each qubit and measures. Over the public classical channel they reveal only their basis choices and retain positions where the choices agree. Each position survives with probability , so the expected secret-key length is . In the ideal no-eavesdropper setting their retained bits agree exactly.
The controlled-NOT leaves computational-basis signals unentangled:
For the two Hadamard-basis choices it gives
Both outputs are maximally entangled Bell states.
Conditioned on a sifted-key position, Alice and Bob used the computational basis with probability and the Hadamard basis with probability . Eve causes no error in the computational basis. In the Hadamard basis Bob's reduced state is maximally mixed, so his bit is wrong with probability . The final bit-error rate is therefore
Let and be independent. The displayed Bernstein polynomial is
Given , uniform continuity of supplies such that changing both coordinates by less than changes by less than . If , then Chebyshev inequality and
give, uniformly in ,
Thus uniformly.
Each is a polynomial, whose iterated integrals may be interchanged term by term. Uniform convergence permits passage to the limit in both iterated integrals, proving the asserted continuous-function form of Fubini's theorem.
Now suppose every monomial moment of vanishes. By linearity,
for every two-variable polynomial . The just-proved Bernstein approximation gives polynomials uniformly. Therefore
so . Statement (i) is true.
True. An affine change of variables carries to . Equivalently, polynomials in are uniformly dense on by the rescaled Bernstein construction. The moment assumptions annihilate every polynomial, so approximating itself again gives and hence .
False. Take . Then is odd in , so every stated integral over vanishes, although is not zero.
True. The map is a homeomorphism of . Hence every continuous can be written as for continuous
. Bernstein polynomials approximate uniformly, so polynomials in approximate uniformly. The assumed even moments annihilate all such polynomials; approximating and passing to proves .
In the Rabin cryptosystem, the public key is and encryption sends an encoded message to
Knowing , the receiver finds the two square roots modulo each prime and combines them with the Chinese remainder theorem to obtain four roots modulo ; prescribed redundancy identifies the intended one.
Omicron has
The Chinese remainder theorem determines uniquely modulo (assuming the independently generated moduli are coprime; a nontrivial gcd would itself factor them). Since , one has , so this residue is the ordinary integer . Taking its positive integer square root recovers .
This does not normally decrypt another ciphertext sent under only one modulus. The recovered pair reveals no nontrivial square root collision modulo that modulus and hence supplies no factorization; breaking a single Rabin instance remains equivalent to factoring its modulus.
The discrete logarithm problem asks, given and , to recover modulo . In the Diffie-Hellman key exchange, Alice sends , Bob sends , and both compute . An enemy able to compute discrete logarithms recovers or from the public messages and hence obtains the key.
For three participants with private exponents , circulate three tokens around a directed ring. Start with ; whenever a participant receives a token, they raise it to their private exponent and pass it on. Arrange the three cyclic routes so that after two transmissions each participant receives one token to which all three exponents have been applied. Every participant then has
while the public transcript contains only proper subproducts.
For participants, start token at participant and pass it successively through the other participants in cyclic order, each raising it to their exponent. Choose the cyclic starts so that one completed token ends at each participant. Every final token equals
There are tokens and transmissions per token, for exactly
communications. Security rests on the corresponding generalized Diffie--Hellman problem.
Substitution of
and integration by parts give
Thus take
and require the endpoint term to vanish. Infinite contour ends must lie in sectors where , namely sectors centred on the positive and negative real and imaginary axes, each of angular width .
Let the common final segment be the positive real ray from to , and choose the initial rays from , , and to . Call the resulting contours . Put
Since , for the three rows are
Consequently
Using the Gamma function reflection identity,
The initial-data vectors are therefore linearly independent, so the three contour integrals are linearly independent solutions.
Scale the unit ball by . Symmetry makes all products of inertia vanish, while the unit-ball averages satisfy
. The inertia tensor about the centre is therefore
For torque-free motion, the inertial angular momentum and energy
are constant. Consider the energy ellipsoid
which is fixed in the body. At its point , its normal is
, and its tangent plane is
This plane has fixed normal and fixed distance from the origin, so it is the invariable plane. The material velocity of the contact vector is
. Thus the contact point is instantaneously at rest and the ellipsoid rolls without slipping on the plane. This is the Poinsot construction.
When , the ellipsoid is an axisymmetric rigid body with
The angle between its symmetry axis and the fixed angular momentum is constant. In an inertial frame the symmetry axis precesses uniformly around , while the body simultaneously spins about that axis. The angular-velocity vector also traces a circular cone about . The limiting cases are pure rotation about the symmetry axis and pure rotation about a perpendicular principal axis.
A Bell measurement is the projective measurement of two qubits in the orthonormal Bell state basis
Its four classical outcomes identify the corresponding rank-one projector.
Alice holds the unknown input and one qubit of a shared pair; Bob holds the other. Alice performs a Bell measurement on her two qubits and sends its two-bit outcome to Bob. For outcomes
, Bob's qubit is respectively
up to global phase. Bob applies respectively and obtains . This is quantum teleportation.
Replacing the resource by applies to Bob's uncorrected output. If labels the Bell outcome, the uncorrected state is , and the unchanged correction produces
Thus the four outputs are , , , and , up to global phases.
For two nonorthogonal input states , preservation of inner products by gives
Hence the two output-program states agree up to phase. Any two qubit states can be joined through a state nonorthogonal to both, so after absorbing phases
is independent of the input.
Inner-product preservation between programs for and gives
for all . If , this identity forces every matrix element of to be the same scalar multiple of the corresponding identity matrix element. Hence , contrary to physical distinctness. Therefore
There are uncountably many physically distinct one-qubit unitaries. Part (ii) would require an orthogonal program state for every one, whereas a -qubit register has dimension only . This contradiction is the no-programming theorem, so no deterministic gate satisfying (PROG) exists.
Yes. Store in the two-qubit program
Apply the teleportation Bell measurement to the input and the first program qubit. On the outcome, which has probability independently of and , the remaining qubit is exactly . Accept that heralded outcome and declare failure otherwise. This gives a probabilistic universal programmable gate with constant success probability .
The inductive definition of ordinal addition is
for a limit ordinal .
The synthetic definition takes the order type of the disjoint union of a copy of followed by a copy of : every point of the first copy precedes every point of the second, and each copy retains its original total order.
Fix and use transfinite induction on . The synthetic sum with the empty order is . Appending a greatest element produces the successor ordinal rule. At a limit ordinal , the second copy is the union of its initial segments of types , so the whole order has type
. Thus the synthetic operation satisfies the inductive recursion; uniqueness in transfinite recursion proves the definitions equivalent.
False. With and ,
True. Left distributivity over a sum in the right argument,
follows by transfinite induction on from the recursive definition of ordinal multiplication; the successor and limit steps are exactly its defining clauses.
False. The ordinal is a limit ordinal, but
True. Every is a countable ordinal, and
Writing any as and using associativity gives
Articles were limited to the first 100 out of 275 total.

Articles by others on the same topic (0)

There are currently no matching articles.