The Lagrange theorem for polynomial congruences says that if is prime and has degree with at least one coefficient not divisible by , thenhas at most incongruent solutions modulo .
The Chinese remainder theorem states that for pairwise coprime , every systemhas exactly one solution modulo . For two moduli, choose with by Bezout identity. Thenis congruent to modulo and to modulo . If are two solutions, both and divide ; coprimality makes divide . This proves existence and uniqueness for two factors, and induction proves the general statement.
Nowand , so is a solution. For , one has , so no such positive integer can satisfy the congruence. Hence the smallest isModulo , the roots are respectivelyEach list has three elements, and the Chinese remainder theorem combines the choices independently. Therefore the number of solutions with is
Because is compact, attains a maximum. If a maximizer lay in , its Hessian matrix would be negative semidefinite, so its trace would satisfy , contradicting . Hence every strictly subharmonic function under the stated hypotheses attains a maximum on .
Statement (i) is true. For , the functionhas , soLetting givesThis is the maximum principle for harmonic functions.
Statement (iii) is false. On the unit disc, takeThe function is continuous on the closed disc, but has its strict maximum at the interior point and equals zero on the boundary.
For binary length- linear codes , their bar product of binary linear codes isIt is a binary linear code of length and dimension .
The code is the binary repetition code of length , whileis the full binary code. For , the Reed-Muller bar-product recursion isThus its rank satisfies Pascal's recursionwith the stated boundary values. Therefore
A square-free monomial in variables of degree evaluates to one at exactly points of , an even number. Since parity of Hamming weight is a linear functional over , every sum of such evaluation words also has even weight. Hence every word in has even weight.
If and have degrees at most and , then has degree at most . The binary inner product of their evaluation words is the parity of the weight of the evaluation of , and is therefore zero. ThusFinally, binomial symmetry givesso the inclusion has equal dimensions andThis is the Dual of a Reed-Muller code.
A context-free grammar is a quadruple consisting of finite nonterminal and terminal alphabets, a set of productions with one nonterminal on the left, and a start symbol . A context-free language is a language generated by such a grammar.
The pumping lemma for context-free languages says that there is a pumping length such that every in the language with can be writtenwith , , and in the language for every integer .
The language in (i) is not context-free. If it were, pumpThe substring , having length at most , cannot meet both the - and -blocks. If pumping changes the number of 's or 's, those two counts cease to agree. If it changes neither, it changes the number of 's while the outer counts remain , so the middle count ceases to be . Every permitted decomposition therefore fails, contradicting the pumping lemma.
The language in (ii) is context-free. The grammargenerates exactlyThe recursive uses of the first rule match the numbers of 's and 's, while independently generates any even number of 's.
The log density isIts kink occurs at the unknown location , so its parameter dependence cannot be separated into a fixed finite-dimensional statistic of and the smooth canonical form required of an exponential dispersion family. Thus the two-parameter location-scale Laplace distribution is not such a family.
For independent observations, the log-likelihood isFor every fixed , maximizing this expression in is equivalent to minimizing . Hencethe least absolute deviations estimator. At this value,so, in the nondegenerate case ,
Probability enters state through a birth from or a pair-death event from , and leaves through either event at state . Thus the Kramers-Moyal master equation iswith probabilities and impossible transition rates taken as zero outside the nonnegative states.
A birth changes by , while a death event changes it by . Applying these increments to the first moment givesConsequently every steady state must satisfy
Taylor-expand the gain terms:and, writing ,After cancellation of the loss terms, the second-order Kramers-Moyal expansion isHence the constant-birth pair-annihilation process has
The deterministic drift vanishes at the positive stable pointWhen is large, fluctuations sample only a narrow range around it, so the linear noise approximation replacesThe resulting Ornstein-Uhlenbeck stationary density is the stated normal distribution withand
For the Gaussian approximation,The extra term reflects the subleading error made by centring the linear approximation at the deterministic fixed point. It is smaller than by relative order , so the exact steady-state condition from part (a) is recovered at leading order. A higher-order expansion shifts the mean and restores the moment balance more accurately.
The approximation is reliable whenThus one needs : births must support a large typical population, with jumps of one or two individuals small compared with the population scale.
Taking the Laplace transform in and using the zero initial condition givesThe solution bounded as isThe transformed boundary condition isso this is the sinusoidally forced heat equation on a half-line. Integrating in gives
Use the principal square root, with a branch cut along the negative real axis. The Bromwich contour is a vertical line to the right of and the branch point . For , close it in the left half-plane, indent around the cut, and let the large semicircle recede. The simple poles at contributeHence
On the upper and lower sides of the cut, put ; the two values of are and . Their jump and the opposite contour orientations combine to giveThis is precisely Bromwich inversion with a square-root branch cut: the residues produce the permanent periodic response, while the cut integral is the transient that decays with time.
The generalized momenta conjugate to the two ignorable coordinates areandSince the Lagrangian contains neither nor , both momenta are constant in time.
Eliminating the two angular velocities givesConservation of energy then yields the heavy symmetric top reductionwhere
As , the first term diverges unlessWriting their common value as , the small-angle expansion isBy the effective potential stability criterion, the vertical state is stable exactly whenAt the vertical state , so this is the gyroscopic stabilization of an inverted symmetric top by sufficiently rapid spin.
Differentiate the Friedmann equationand use the cosmological perfect-fluid continuity equationAfter dividing by ,Since , eliminating the curvature term gives the Friedmann acceleration equation
If , integrating the inequality backward shows that reaches zero no later than . Thus and at a finite time in the past. If , the same argument forward in time makes and at a finite future time. The sign of distinguishes an expanding universe with a past Big Bang from a contracting universe ending in a Big Crunch. Hence a Friedmann universe obeying the strong energy condition cannot remain nonsingular for unlimited proper time in both directions.
Use the available unitaries to preparein the first register andin the answer qubit. The quantum phase kickback identity givesChoose a unitary with , apply to the first register, and measure it. Its amplitude at isThis equals or for a constant string and zero for a balanced string. Thus outcome means constant, while every other outcome means balanced, with certainty after one oracle query. This is the Deutsch-Jozsa test with an arbitrary uniform-state unitary.
With the restricted operations, begin in and apply to the first register:Now applyFor every basis state this compute-phase-uncompute construction acts asThe first register is therefore the same phase state used in part (a). Apply and measure. Again, outcome occurs with probability one for a constant string and probability zero for a balanced string. The construction uses exactly two queries to and only the permitted operations.
An integer is a primitive root modulo when it is coprime to and its residue class generates the multiplicative group of integers modulo n. Equivalently,
We prove that (i) implies (ii). Since is primitive modulo , writeBeing primitive modulo is equivalent to . The binomial theorem then gives inductivelyIt follows that the order modulo is exactlyso is primitive modulo every . This is lifting a primitive root to odd prime powers. The implication (ii)(i) is immediate by taking .
This implication is already contained in part (i): being primitive modulo every plainly includes being primitive modulo , while primitivity modulo lifts to every higher power by the valuation calculation there.
Suppose first that is not primitive modulo . Since it is primitive modulo , its order modulo is then , soBecause divides , the composite number satisfiesit is a Fermat pseudoprime to base and is divisible by . Thus (iii) fails.
Conversely, suppose is primitive modulo and a base- pseudoprime is divisible by with . By part (i),The pseudoprime congruence forces this order to divide , so in particular . But , a contradiction. Hence no such pseudoprime exists. This proves (i)(iii), and all three statements are equivalent.
By lifting a primitive root to odd prime powers, it is enough to test primitivity modulo . The positive integers below eight either fail to be units or have orderswhereasTherefore the three smallest required integers are
By the primitive-root modulus classification, only forwith an odd prime, and thenFix . The finite fibres of the Euler totient function imply that there are only finitely many possible values satisfying . For each such , the same result gives only finitely many satisfying . The union of these finitely many finite sets is finite, proving the claim.
A state is accessible whenfor some word . States and are equivalent, or indistinguishable, whenfor every continuation .
This equivalence is preserved by transitions: if , then . Hence define with states , initial state , transitionand accepting classes with . Induction on word length givesso and its quotient deterministic finite automaton by indistinguishable states accept the same language. If two quotient states were equivalent, their representatives would be equivalent in , so the classes would be equal. Thus no two distinct quotient states are equivalent.
For the unary alphabet, accessibility means that all states occur on the orbitFiniteness makes this orbit a directed tail entering a directed cycle. The quotient retains exactly one accepting state and merges precisely those positions having the same future acceptance pattern.
More explicitly, if the unique accepting state lies before the cycle, every state after it can never reach acceptance and these states collapse to one rejecting sink. The minimal diagram is then a directed chain from the initial state through the unique accepting state and onward to that sink, which has a self-loop.
If the accepting state lies on the cycle, all cycle states are distinct because their next visits to the accepting state occur in different residue classes modulo the cycle length. Any remaining tail is a chain feeding the cycle. In a minimal diagram with a nonempty tail, the accepting state is the cycle vertex immediately preceding the entry vertex; otherwise the final tail state has the same future acceptance sequence as a cycle state and would be merged. A pure cycle with one accepting vertex is also possible. These are exactly the minimal accessible unary DFAs with one accepting state.
For , conservation of the deposited amount requiresThe dimensions satisfy and . Thus has dimension , so the similarity length is . Requiring the concentration scale to have dimension givesHence
In polar coordinates, substitution into
givesMultiplying by and integrating once, with regularity and zero radial flux at the origin, yieldsWhere , this reduces to , soNonnegativity and zero flux at the moving front give the compactly supported profileThe normalization givesand hence and . This is the Two-dimensional Barenblatt solution with diffusivity proportional to concentration, and its support radius isso .
givesMultiplying by and integrating once, with regularity and zero radial flux at the origin, yieldsWhere , this reduces to , soNonnegativity and zero flux at the moving front give the compactly supported profileThe normalization givesand hence and . This is the Two-dimensional Barenblatt solution with diffusivity proportional to concentration, and its support radius isso .
Now add the linear reaction term and writeSubstitution cancels the terms and leavesChoosingproduces , as in the linear-reaction time change for quadratic nonlinear diffusion. Therefore
For , the front grows like while the central concentration decays like . For , , so the front grows like and the central concentration like . For , : the front approaches a finite limiting radius while the concentration decays exponentially to zero.
The Flatness problem is that grows during ordinary decelerating expansion, so its small present value requires the early density to have been extraordinarily close to critical. The Horizon problem is the near uniformity of regions whose past light cones do not meet in a noninflationary hot Big Bang model.
Inflation requires accelerated expansion,For a constant equation of state , this means ; representative scale factors are with and . Equivalently, the comoving Hubble radius decreases. Sincemany e-folds drive the universe toward spatial flatness. A small region that was initially in causal contact is stretched to a size far larger than the later Hubble radius, allowing the observed universe to originate from one equilibrated patch.
For the inflaton,The continuity equation therefore becomesAway from an isolated turning point division by gives, and continuity extends through such points,
The Friedmann acceleration equation givesFor the scalar field,and henceAn inflationary phase occurs precisely when potential energy dominates enough that
The slow-roll approximation assumesThe first condition makes the energy density potential dominated, and the second neglects inertial acceleration relative to Hubble friction. The scalar and Friedmann equations reduce to
For and positive , the slow-roll Friedmann equation givesThe scalar equation then reduces toWith ,Furthermore,Thus the quartic-potential slow-roll solution is
Start two registers in . Apply to the first and then reversibly evaluate into the second, obtainingThe evaluation can be implemented by repeated squaring and reversible modular multiplication using a number of elementary arithmetic operations polynomial in .
Measure the second register. Because is injective within one period and , the first register becomes a uniformly weighted periodic cosetThe quantum Fourier transform of a periodic coset state followed by measurement returnsReduce the rational number to lowest terms. Sinceits denominator is . Test whether by repeated squaring. The promised injectivity means that is the least positive period, and , so this congruence holds exactly when . The test therefore certifies whether the run succeeded; this is heralded exact quantum period finding when the period divides the register size.
One run succeeds with probabilitybecause success is equivalent to being coprime to . A standard estimate for the Euler totient function gives for all sufficiently large , with the finitely many smaller cases absorbed by changing the positive constant . Repeating independently times therefore makes the probability that every run fails at most . Every step, including the repetitions and the classical verification, takes time polynomial in .
Use the conventionChanging the summation variable from to givesThus the Fourier-basis states are eigenvectors of the cyclic shift, with respective eigenvalues , and the cyclic shift diagonalization by the quantum Fourier transform is
For , write with . ThensoHence the required quantum circuit applies, from input to output,The first phase gate acts on the most significant qubit and the second on the least significant qubit .
The compactness theorem says that a set of first-order sentences has a model if and only if every finite subset of has a model. One implication follows by taking the same model. Conversely, if had no model, then by the Godel completeness theorem it would prove a contradiction. A formal proof uses only finitely many assumptions, so some finite subset of would already have no model. This contradiction proves compactness.
The Upward Lowenheim-Skolem theorem says that if an -theory has an infinite model, then it has models of arbitrarily large cardinality; more precisely, it has a model of cardinality at least for every cardinal . Add new constants for and the sentencesEvery finite subset of the enlarged theory can be interpreted in the given infinite model, since it mentions only finitely many constants. Compactness supplies a model of the whole enlarged theory, in which the are pairwise distinct. Its reduct to is a model of having at least elements. If , the Downward Lowenheim-Skolem theorem gives a model of cardinality exactly .
This class is not axiomatisable. Suppose that a theory axiomatized it. Add constants , require each to be a maximal element, and require for . Every finite part of this enlarged theory has a model: choose a finite partially ordered set with enough maximal elements. By the compactness theorem the whole theory has a model, but its reduct is a model of with infinitely many maximal elements, a contradiction. This is the compactness obstruction to axiomatizing finitely many maximal elements.
This class is axiomatisable when an uncountable set of constants is allowed. Add constants and the axiomsalong with the partially ordered set axioms. Every reduct of a model has at least maximal elements. Conversely, in every poset with uncountably many maximal elements the constants can be interpreted as distinct maximal elements. Thus the expanded theory axiomatizes precisely the desired reducts.
This class is axiomatisable in the original language. For every positive integer , let sayBoth clauses are first-order. If one of the two sets is infinite, every holds. Conversely, if both sets were finite, choosing larger than both cardinalities would make false. Hence the first-order theory consisting of the poset axioms and all the has exactly the required models.
This class is not axiomatisable. If axiomatized it, add constants and for , requiring the to be distinct maximal elements and the to be distinct minimal elements. Every finite fragment has a model of : make one of the two sets infinite and make the other finite but large enough to interpret the finitely many constants mentioned. Compactness would then give a model of having both infinitely many maximal and infinitely many minimal elements, contrary to the exclusive condition. This is the compactness obstruction to an exclusive disjunction of infinitude.
This class is not axiomatisable. It contains an infinite model, for example the total order . If a theory in any fixed expanded language axiomatized it, choose a cardinalThe Upward Lowenheim-Skolem theorem would give a model of of cardinality at least . Its underlying order cannot be isomorphic to a subset of , because every such subset has cardinality at most . This contradiction proves the claim.
Colour every vertex of a graph independently and uniformly with three colours, and retain precisely the edges whose endpoints have different colours. Each edge is retained with probability , so linearity of expectation gives expected retained edge countSome colouring therefore retains at least edges. Its retained subgraph is three-colourable, and deleting edges if necessary leaves exactlyedges without increasing its chromatic number. This is the three-colourable two-thirds subgraph lemma.
To prove sharpness, take . If is three-colourable and its colour classes have sizes , then they are independent sets, sowhere the final inequality follows from Cauchy-Schwarz inequality. Since ,Given , choose with . Then every three-colourable subgraph has at most edges.
Choose a partition that maximizes the number of edges crossing between its two parts. If some hadmoving to would replace the former crossing edges incident with by the latter and strictly increase the cut size. This contradicts maximality. The same argument applies to every . Hence every vertex has at least as many neighbours in the opposite part as in its own part, so the maximum cut is an unfriendly partition of a graph.
Enumerate the vertices as . Since every vertex has finite degree, choose increasing finite vertex sets whose union is and such that the closed neighbourhood of lies in whenever . By part (b), each finite induced graph has an unfriendly two-colouring.
There are only two colours. Pass successively to an infinite subsequence on which the colour of is constant, then one on which the colour of is constant, and so on. The diagonal argument gives a limiting colouring in which, for every fixed finite set of vertices, all its colours agree with those in infinitely many of the finite colourings.
Fix . Its entire finite neighbourhood lies in every sufficiently large , and along the diagonal subsequence the colours of and all its neighbours eventually stabilize. The unfriendly inequality for in therefore passes unchanged to the limit. This holds for every vertex, proving the unfriendly partition theorem for a countable locally finite graph.
Colour every vertex independently red or blue with probability . Fix a vertex and enumerate infinitely many distinct neighbours . The probability that all neighbours after are red isTaking the countable union over , the probability that has only finitely many blue neighbours is zero. The same argument with the colours exchanged shows that the probability of only finitely many red neighbours is zero.
The vertex set is countable, so the union of these two null events over all vertices still has probability zero. Thus with probability one every vertex has infinitely many neighbours of each colour. Taking and to be the two colour classes gives an unfriendly partition. This is the random unfriendly partition of a countable infinite-degree graph.
Articles were limited to the first 100 out of 255 total.
Articles by others on the same topic
There are currently no matching articles.