Direct Proof 直接证明
A direct proof establishes a conclusion by justified deductions from the stated assumptions.
150 original explanations and 60 external reading guides. Choose a learning direction · Contribute
No matching entries. Clear filters or try another keyword.
A direct proof establishes a conclusion by justified deductions from the stated assumptions.
A Dirichlet character is a multiplicative character of the unit group modulo an integer, extended by zero to nonunits.
A Dirichlet L-function weights integers by a Dirichlet character, refining zeta's prime product to detect residue classes and encode abelian arithmetic over the rationals.
The signature of a number field determines the rank of its unit group. Compare real and imaginary quadratic fields, then follow the logarithmic embedding used to prove finite generation.
A distribution is a continuous linear functional on smooth compactly supported test functions.
An integrable bound independent of the index upgrades almost-everywhere convergence to convergence in L1.
For independent identically distributed increments with mean zero and variance one, rescaled interpolated partial-sum paths converge in distribution to Brownian motion. The path-space statement also controls continuous functionals such as maxima.
A flow is a continuous real-time action whose maps compose by addition of time and are invertible.
Equivalent categories have the same objects up to isomorphism and the same morphism structure, without requiring literal inverse functors.
An equivalence relation partitions a set into classes of mutually equivalent elements.
An ergodic probability-preserving transformation has no invariant measurable event of intermediate probability.
Étale cohomology applies sheaf cohomology to coverings by étale morphisms, providing invariants suited to algebraic geometry over general fields. Begin with the topology and its sheaf condition, then use Mayer–Vietoris as a first structural calculation.
The étale fundamental group encodes finite étale covers through automorphisms of a geometric fibre functor. Read the classification theorem alongside the spectrum-of-a-field example to connect geometric covering theory with Galois theory.
Repeated division with remainder computes a greatest common divisor without prime factorization.
Euler's totient counts invertible residue classes and connects factorization with modular exponentiation.
Ext groups are derived Hom groups whose first degree classifies extensions of modules with fixed end terms.
Extremal graph theory studies the largest or smallest graph parameters compatible with specified structural restrictions.
For a prime modulus, every nonzero residue raised to the power one less than the prime equals one.
Finite correspondences enlarge the maps between smooth schemes to include suitable algebraic cycles in their products. Read the graph example and the composition construction as preparation for transfers and motives.
A finite simple graph records an undirected adjacency relation without loops or repeated edges.
Formal completion isolates the infinitesimal geometry supported on a chosen closed subset. Read its description by a functor of points and compare it with the affine construction from quotients of the coordinate ring.
A Fourier series represents a periodic function through its coefficients against exponential frequencies.
The Fourier transform represents a function by continuous frequencies and converts differentiation into multiplication.
Faithfully flat coverings let quasi-coherent sheaves be reconstructed from compatible local data. Follow the affine case first, then the passage to an arbitrary fpqc covering, keeping track of both gluing objects and descending their maps.
Nonzero fractional ideals extend integral ideals by allowing bounded denominators, forming a group whose quotient by principal ideals is the ideal class group.