The completeness theorem for propositional logic, together with soundness, states if and only if . In particular, an inconsistent set of formulae has a finite formal proof of contradiction. Such a proof uses only finitely many assumptions, yielding the propositional compactness theorem: if every finite subset of is satisfiable, then is satisfiable.
The decidability theorem for propositional logic concerns theoremhood of a formula, or entailment from a finite list of premises. Formulae involve finitely many variables, so their valuations can be tested by a finite truth table; completeness identifies semantic validity with provability. Equivalently, dovetail effective proof enumeration with the finite search for a countervaluation: completeness ensures that one succeeds. This is not a decidability claim for consequences of an arbitrary noncomputable infinite theory.
An infinite collection of distinct tautologies is a finitary set of formulae, since its deductive closure equals that of the empty set. By contrast, the set of independent variables is not finitary. If a finite set had the same closure, it would mention only finitely many variables. It is satisfiable because it is a consequence of the all-true model of the ; changing an unmentioned to false preserves and contradicts .
Under the final hypothesis, has no model. The propositional compactness theorem gives finite , with inconsistent. Any valuation satisfying cannot satisfy , because it would then satisfy ; by the exactly-one hypothesis it must satisfy . The reverse implication holds by inclusion. Thus and have identical models, and similarly and . Completeness gives identical deductive closures, proving
A splitting field of a nonzero polynomial over is an extension in which splits into linear factors and which is generated over by all its roots. For a constant nonzero polynomial the splitting field is ; the zero polynomial does not have a root-generated splitting field in this standard definition.
Given two splitting fields , enumerate the roots generating and extend a -embedding one root at a time. If an embedding is defined on , the minimal polynomial of the next root divides over that field. Its image under the embedding therefore divides over the corresponding subfield of , and has a root in . The quotient construction extends the embedding to that root. The polynomial need not be a separable polynomial.
At the end this gives a -embedding . It sends the distinct roots of injectively to its roots, hence permutes the finite set of distinct roots and contains every root in its image. Since these generate , the embedding is onto. Thus the splitting field is unique up to a (K)-isomorphism.
We prove the conjugate product of a quadratic ideal identity , which applies to the given two-generator ideal without assuming its displayed generators form an integral basis.
The quadratic ring of integers of a number field has a basis over : the vector 1 is primitive, since a rational algebraic integer must be an integer, and extends to an integral basis. Write , with . Let be the least positive integer in and let generate the set of coefficients of in elements of . Its lattice basis can be chosen as , with . Since , comparison of coefficients shows and . Write , and . Then
The scaled ideal remains an -ideal. From we get , so . The product is generated as an ideal by and is contained in .
Moreover . If a prime divided all three, then and , so would satisfy the monic integer polynomial . It would lie in , impossible because its coefficient in the integral basis is . Bezout identity now expresses one as an integer combination of . Multiplying by , the terms are , , and , all in the product. Hence belongs to it, proving .
The determinant of the lattice basis gives the ideal norm . Consequently
In particular is principal. This does not require the original to be nonzero or the ideal itself to be principal.
The pointwise limit is a measurable function, since it can be expressed as . Thus each set is a countable intersection of measurable sets within . Deleting the condition at index weakens the requirements, whereas replacing by strengthens them. Hence
These are inclusions, not necessarily strict inclusions. The displayed sets describe eventual uniform error tolerances at an individual point.
Fix and . By pointwise convergence, there is an such that for every . This is exactly , proving
Together with monotonicity in and finite measure of , continuity from below of a measure gives . Consequently
This quantitative form is what allows a single large-measure set to work for every tolerance, rather than choosing a different exceptional set for each point.
For each , choose with and set . Countable subadditivity gives . For any tolerance , choose with . For all and every , , proving uniform convergence on .
If the functions are Borel measurable, itself is Borel and we can take . If “measurable” is interpreted in the completed Lebesgue sense, use regularity of Lebesgue measure to choose a Borel subset differing from by a null set; the same measure bound and uniform convergence hold. Thus the requested Borel conclusion is valid under either convention. This proves the finite-measure Egorov theorem.
For an infinite-measure counterexample take and . It converges pointwise to zero. Any subset of with complement of finite measure intersects every infinite tail , so the supremum of there is one for every . Hence finite measure is essential to the conclusion.
For , apply Fatou lemma to the nonnegative sequence , which converges pointwise to :
For , each inequality fails pointwise only on a null set. Outside the union of these countably many null sets, for every , so the pointwise limit also satisfies . Therefore in both cases
Let be conjugate to , so , including for . Hölder's inequality implies, for every measurable finite-measure set ,
This proves integrability on and gives uniform integrability there. Choose a set with on which convergence is uniform, using Egorov theorem. Then
First take and then . Thus even the local difference tends to zero, and in particular
For , simple functions supported on finite-measure Borel sets are dense in . The displayed convergence proves pairing convergence for such functions. Approximate any by a simple and use
By the duality of Lp spaces, these are all continuous linear functionals on , so converges weakly to . It need not converge strongly: converges pointwise to zero but has norm one. For the pairing argument gives weak-star convergence against , rather than asserting weak convergence against every functional in the much larger full dual.
A morphism of algebraic varieties is a map regular in local affine coordinates: for each point of the source, choose affine charts containing it and its image, and require each target coordinate to pull back locally to a quotient of polynomials with a denominator nonzero at that point. The map is continuous in the Zariski topology and pulls back regular functions on every target open set to regular functions on its inverse image.
Equivalently, one can take Zariski continuity and this local regular-function pullback property as the definition. In particular, a morphism between affine varieties is specified by globally regular coordinate functions, with values satisfying the defining equations of the target. Being an arbitrary set-theoretic function, or being merely Zariski continuous, is not sufficient.
An embedded smooth -dimensional manifold is locally carried by a smooth ambient coordinate change to . A map between such manifolds is a smooth map between manifolds if its coordinate representatives are smooth. Its differential sends the tangent vector represented by a curve to ; equivalently it is the derivative in charts.
A regular value is one for which is surjective at every , including vacuous regularity when the fibre is empty. For example zero is not a regular value of , , because .
For an invertible matrix , the derivative of the determinant is
At a determinant-one matrix it is nonzero, since taking gives value one. The regular level set theorem therefore makes an embedded manifold of dimension , also for when it is a single point. Matrix multiplication has polynomial ambient coordinates and restricts to the group, so it is smooth. At the identity,
Finally suppose the singular-matrix set were an embedded smooth manifold near zero for . Every curve lies in it, since its rank is at most one. Thus every matrix unit belongs to its tangent space at zero. These span , forcing its local dimension to be . An embedded manifold of full ambient dimension is locally open, but arbitrarily small scalar multiples of the identity are invertible. This contradiction proves the singular-matrix set is not an embedded smooth manifold. The argument addresses the subset-manifold convention specified at the start.
The Borel sigma-algebra is the smallest sigma-algebra containing all open subsets of . A real-valued Borel measurable function on is a map with for every . It suffices to test the sets for rational , because these generate the Borel sigma-algebra.
Here “Borel function” describes measurability into the Borel structure of the target; the domain need not itself be a topological space.