# Theorems

Xem 1-20 trên 633 kết quả Theorems
• ### Logic For Computer Science Foundations of Automatic Theorem Proving

Logic for Computer Science" provides an introduction to mathematical logic, with emphasis on proof theory and procedures for constructing formal proofs of formulae algorithmically. It is designed primarily for students, computer scientists, and, more generally, for mathematically inclined readers interested in the formalization of proofs and the foundations of automatic theorem proving. Since the main emphasis of the text is on the study of proof systems and algorithmic methods for constructing proofs, it contains features rarely found in other texts on logic.

• ### Chapter 2 - Existence Theorems for Minimal Points

In this chapter we investigate a general optimization problem in a real normed space. For such a problem we present assumptions under which at least one minimal point exists. Moreover, we formulate simple statements on the set of minimal points. Finally the existence theorems obtained are applied to approximation and optimal control problems.

• ### Đề tài " Bertini theorems over finite fields "

Let X be a smooth quasiprojective subscheme of Pn of dimension m ≥ 0 over Fq . Then there exist homogeneous polynomials f over Fq for which the intersection of X and the hypersurface f = 0 is smooth. In fact, the set of such f has a positive density, equal to ζX (m + 1)−1 , where ζX (s) = ZX (q −s ) is the zeta function of X. An analogue for regular quasiprojective schemes over Z is proved, assuming the abc conjecture and another conjecture. 1. Introduction The classical Bertini theorems say that if a subscheme...

• ### Đề tài " A stable trace formula III. Proof of the main theorems"

The induction hypotheses Application to endoscopic and stable expansions Cancellation of p-adic singularities Separation by inﬁnitesimal character Elimination of restrictions on f Local trace formulas Local Theorem 1 Weak approximation Global Theorems 1 and 2 10. Concluding remarks Introduction This paper is the last of three articles designed to stabilize the trace formula. Our goal is to stabilize the global trace formula for a general connected group, subject to a condition on the fundamental lemma that has been established in some special cases.

• ### Đề tài " Index theorems for holomorphic self-maps "

The usual index theorems for holomorphic self-maps, like for instance the classical holomorphic Lefschetz theorem (see, e.g., [GH]), assume that the ﬁxed-points set contains only isolated points. The aim of this paper, on the contrary, is to prove index theorems for holomorphic self-maps having a positive dimensional ﬁxed-points set. The origin of our interest in this problem lies in holomorphic dynamics.

• ### Đề tài " A p-adic local monodromy theorem "

We produce a canonical ﬁltration for locally free sheaves on an open p-adic annulus equipped with a Frobenius structure. Using this ﬁltration, we deduce a conjecture of Crew on p-adic diﬀerential equations, analogous to Grothendieck’s local monodromy theorem (also a consequence of results of Andr´ and of Mebkhout). Namely, given a ﬁnite locally free sheaf on an open e p-adic annulus with a connection and a compatible Frobenius structure, the module admits a basis over a ﬁnite cover of the annulus on which the connection acts via a nilpotent matrix. ...

• ### Đề tài "A sharp form of Whitney’s extension theorem "

In this paper, we solve the following extension problem. Problem 1. Suppose we are given a function f : E → R, where E is a given subset of Rn. How can we decide whether f extends to a Cm−1,1 function F on Rn ? Here, m ≥ 1 is given. As usual, Cm−1,1 denotes the space of functions whose (m − 1)rst derivatives are Lipschitz 1. We make no assumption on the set E or the function f. This problem, with Cm in place of Cm−1,1, goes back to Whitney [15], [16], [17]. To answer it, we prove the following sharp form of the Whitney extension theorem....

• ### Báo cáo " GENERALIED MASON’S THEOREM "

The purpose of this paper is to give a generalization of Mason’s theorem by the Wronskian technique over ﬁelds of characteristic 0. Keywords: The Wronskian technicque, Marson’s theorem. 1. Introduction Let F be a ﬁxed algebraically closed ﬁeld of characteristic 0. Let f (z) be a polynomial non - constants which coeﬃcients in F and let n(1/f ) be the number of distinct zeros of f . Then we have the following. Marson’s theorem. ([2]). Let a(z), b(z), c(z) be relatively prime polynomials in F and not all constants such that a + b = c. Then max {deg(a), deg(b),...

• ### Real Functions of Several Variables - Examples of Applications of Gauβ’s and Stokes’s Theorems and Related Topics Calculus 2c-9

Tham khảo sách 'real functions of several variables - examples of applications of gauβ’s and stokes’s theorems and related topics calculus 2c-9', khoa học tự nhiên, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

• ### Báo cáo khoa học: "ALGORITHMS FOR GENERATION THEOREM PROVING IN LAMBEK"

We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore Lambek Theorem Proving is a natural candidate for a 'uniform' architecture for natural language parsing and generation.

• ### Báo cáo khoa học: "LAMBEK THEOREM PROVING AND FEATURE UNIFICATION"

it follows as a theorem from a set of axioms and inference rules. Especially by the work of Van Benthem (1986) and Moortgat (1988) this view, which we will name with Moortgat (1987a) Lambek Theorem Proving (LTP; Lambek, 1958), has become popular among a number of linguists. The descriptive power of LTP can be extended if unification (Shieber, 1986) is added. Several theories have been developed that combine categorial formalisms and unification based formalisms. Within Unification Categorial Grammar (UCG, Calder et al., 1988, Zeevat et al.

• ### Lecture Statistical techniques in business and economics - Chapter 8: Sampling methods and central limit theorem

Chapter 8 provides knowledge of sampling methods and central limit theorem. When you have completed this chapter, you will be able to: Explain under what conditions sampling is the proper way to learn something about a population, describe methods for selecting a sample, define and construct a sampling distribution of the sample mean,...

• ### Lecture Electric circuit theory: Circuit theorems - Nguyễn Công Phương

Lecture Electric circuit theory: Circuit theorems presents the following content: Source transformation, linearity and superposition, Thévenin Equivalent Subcircuits, Norton Equivalent Subcircuits, maximum power transfer.

• ### A Simple Proof for a Theorem of Nagel and Schenzel

Nagel-Schenzel’s isomorphism that has many applications was proved by using spectral sequence theory. In this short note, we present a simple proof for the theorem of Nagel and Schenzel.

• ### PROBLEMS AND THEOREMS IN LINEAR ALGEBRA

There are many books on linear algebra, in which many people are really great ones (see for example the list of recommended literature). One might think that one does no books on this subject. Choose a person's words more carefully, it can deduce that this book contains everything needed and the best possible, and so any new book, just repeat the old ones. This idea is evident wrong, but almost everywhere. New results in linear algebra and are constantly appearing so refreshing, simple and neater proof of the famous theorem.

• ### Entropy and Information Theory

This book is devoted to the theory of probabilistic information measures and their application to coding theorems for information sources and noisy chan- nels. The eventual goal is a general development of Shannon's mathematical theory of communication, but much of the space is devoted to the tools and methods required to prove the Shannon coding theorems. These tools form an area common to ergodic theory and information theory and comprise several quantitative notions of the information in random variables, random processes, and dynamical systems....

• ### PROBLEMS AND THEOREMS IN LINEAR ALGEBRA

This book contains the basics of linear algebra with an emphasis on nonstandard and neat proofs of known theorems. Many of the theorems of linear algebra obtained mainly during the past 30 years are usually ignored in text-books but are quite accessible for students majoring or minoring in mathematics. These theorems are given with complete proofs. There are about 230 problems with solutions.

• ### báo cáo hóa học: " Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasij-nonexpansive mappings Jong Kyu Kim"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasij-nonexpansive mappings Jong Kyu Kim

• ### Markov Processes, Gaussian Processes, and Local Times by Michael B. Marcus Jay Rosen

Written by two foremost researchers in the field, this book studies the local times of Markov processes by employing isomorphism theorems that relate them to certain associated Gaussian processes. It builds to this material through self-contained but harmonized 'mini-courses' on the relevant ingredients, which assume only knowledge of measure-theoretic probability. The streamlined selection of topics creates an easy entrance for students and for experts in related fields.