Probabilistic Method 概率方法
The probabilistic method proves existence by placing candidate combinatorial objects in a probability space and showing that a desired property has positive probability.
150 original explanations and 60 external reading guides. Choose a learning direction · Contribute
No matching entries. Clear filters or try another keyword.
The probabilistic method proves existence by placing candidate combinatorial objects in a probability space and showing that a desired property has positive probability.
A probability space specifies outcomes, measurable events, and a countably additive law of total mass one.
Classical proof by contradiction establishes a statement by deriving an impossibility from its negation.
Pseudodifferential operators extend differential operators through kernels conormal to the diagonal. Follow the bundle-valued kernel construction into ellipticity to connect symbol information with approximate inverses.
Quadratic reciprocity relates whether one odd prime is a square modulo another to the reversed question. The Legendre symbol and Gauss's lemma turn the sign rule into a method for reducing computations.
A quotient stack records the orbit data of a group action together with the isomorphisms between representatives. Follow the action groupoid into its stackification and track the natural map from the original space to the quotient.
A quotient topology describes a space formed by identifying points.
Absolute continuity lets one sigma-finite measure be expressed by integrating a density against another. Read the accompanying Lebesgue decomposition to distinguish this density from the mutually singular part.
A two-color Ramsey number is the smallest complete-graph size forcing a red clique of one prescribed size or a blue clique of another.
A random variable is a measurable numerical observation of an outcome, distinct from its value and distribution.
On a bounded open domain, bounded families in the zero-boundary-value Sobolev space gain strong subsequential convergence below the critical exponent. Follow the translation estimates that turn derivative control into compactness.
A representable set-valued functor describes maps to or from one object through natural bijections.
The residue is the coefficient of the inverse first power in a local Laurent expansion.
A Riemann surface is a connected complex manifold of complex dimension one, specified by holomorphic changes of local coordinates.
The Riemann zeta function connects a Dirichlet series over integers with an Euler product over primes and a meromorphic continuation governed by a functional equation.
A Riemannian geodesic is an affinely parametrized curve with zero covariant acceleration for the Levi–Civita connection.
A Riemannian metric equips each tangent space with an inner product varying smoothly from point to point.
A scheme is a locally ringed space locally isomorphic to the prime spectrum of a commutative ring equipped with its structure sheaf.
Lifting homotopies from disks relates the homotopy groups of a fiber, total space, and base. The long exact sequence extends the lifting viewpoint already familiar from covering spaces.
A set is an extensional object determined by its members, with legitimate constructions controlled by the background axioms.
A sheaf assigns data to open sets with restriction maps so that compatible local sections glue uniquely.
A short exact sequence identifies one module as a submodule and another as its quotient.
A simplicial set is a contravariant functor from the simplex category to sets. Read the order-preserving maps as operations on simplices, keeping degenerate simplices as part of the data.
Singular homology associates abelian groups to a space by comparing cycles with boundaries.
A smooth manifold is a space on which multivariable calculus works through compatible local coordinate systems.