The Four Color Theorem originated in 1850 and was not solved in its entirety until 1976. This report details the history of the proof for the Four Color Theorem and multiple contributions to the proof of the Four Color Theorem by several mathematicians. Ideas such as Kempe Chains, reducibility, unavoidable sets, the method of discharging, and the Petersen Graph are all covered in this report. There is also a brief discussion over the importance of a mathematical proof and how the definition of a proof has changed with the contributions of Computer Science to the mathematical community. / text

No description available.

No description available.

No description available.

No description available.

Formal verification is required for systems that require high assurance. Formal verification can require large and complex proofs that can drastically affect the development life cycle. Through the use of a verification system, such proofs can be managed and completed in an efficient manner. A verification system consists of a specification language that can express formal logic, and an automated theorem tool that can be used to verify theorems and conjectures within the specifications. One example of a verification system is Specware. This thesis presents an analysis of Specware against a set of evaluation criteria in order to determine the level of usefulness Specware can have in the verification of high assurance systems. This analysis revealed that Specware contains a powerful specification language capable of representing higher order logic in a simple and expressive manner. Specware is able to represent multiple levels of abstraction and generate proof obligations regarding specification correctness and interlevel mapping. The theorem prover associated with Specware was found to be lacking in capability. Through this analysis we found that Specware has great potential to be an excellent verification system given improvement upon the theorem prover and strengthening of weaknesses regarding linguistic components. / Naval Postgraduate School author (civilian).

Nash's Theorem is a famous and widely used result in non-cooperative game theory which can be applied to games where each player's mixed strategy payoff function is defined as an expectation. Current proofs of this Theorem neither justify why this constraint is necessary or satisfactorily identifies its origins. In this Thesis we change this and prove Nash's Theorem for abstract games where, in particular, the payoff functions can be replaced by total orders. The result of this is a combinatoric proof of Nash's Theorem. We also construct a generalised simplicial complex model and demonstrate a more general form of Nash's Theorem holds in this setting. This leads to the realisation Nash's Theorem is not a consequence of a fixed-point theorem but rather a combinatoric phenomenon existing in a much more general mathematical model.

As ideias fundamentais sobre entropia de emaranhamento e fluxos de renormalização são expostas, assim como uma introdução a CFTs e sua ligacão com a estrutura do espaco de parâmetros. A anomalia de traço é calculada em uma abordagem semi-clássica usando o método de heat kernel\" e regularização por função zeta . Mostramos que os coeficientes de Seeley-DeWitt são responsáveis pela quebra de simetria conforme em um espaço-tempo curvo de dimensão par, com isso alcançamos uma definição geométrica para as cargas centrais. A inexistência de anomalias no caso de dimensões ímpares também e mostrado. O C-theorem\", que prova a monotonicidade das cargas centrais sob o fluxo de renormalização, é demonstrado como feito por Zamolodchikov por meio de uma abordagem euclideana assumindo unitariedade, positividade por reflexão e condições de renormalizabilidade. A análise feita por Cardy também e demonstrada, nela considera-se os mesmos ingredientes. Por fim, a prova tecida por Casini & Huerta é demonstrada com detalhes, essa prova utiliza das propriedades de strong subadditivity da entropia de emaranhamento, unitariedade e invariância sob o grupo de Poincaré. Com isso, uma conexão com informação quântica é feita naturalmente. No último capítulo generalizamos o conceito de carga central para dimensões ímpares as definindo como o termo universal na entropia de emarahamento de uma esfera. As considerações geométricas feitas para provar o C-theorem\" são estendidas para um espaço-tempo de Minkowski com três dimensões. Como consequência temos a prova do F-theorem\" que é o analogo em três dimensões do C-theorem\". / The fundamental ideas of entanglement entropy and RG flows are laid out, as well as the basics of CFTs and its connection to the framework of RG flows. The trace anomaly is calculated in a semi-classical fashion by using the heat kernel method and zeta-function regularization. It is shown that the Seeley-DeWitt coefficients are responsible for the breaking of conformal symmetry in a curved even-dimensional background, which also achieves a geometrical definition of a central charge. The absence of anomalies in odd space-time dimensions is also contemplated. The C-theorem, which proves the monotonicity of the two dimensional central charge under RG flows, is demonstrated as first done by Zamolodchikov in an euclidean approach assuming unitarity, reflection positivity, and renormalizability conditions. Cardy\'s analysis is also demonstrated by considering the same conditions as Zamolodchikovs . And at last the proof via entanglement entropy by Casini & Huerta which relies on the strong subadditivity property of EE, unitarity and Poincaré invariance is explained in detail, providing a quantum information approach to the problem. In the last chapter a generalization of central charges to odd dimensional space-times is given through the universal term of the EE of a sphere. We provide the extension of the geometrical setup considered in the proof of the C-theorem to a three dimensional Minkowski space-time, which ultimately yields the F-theorem, constituting the three dimensional analog of the C-theorem.

Let X be an affine algebraic variety with a transitive action of the algebraic automorphism group. Suppose that X is equipped with several fixed point free non-degenerate SL_2-actions satisfying some mild additional assumption. Then we prove that the Lie algebra generated by completely integrable algebraic vector fields on X coincides with the set of all algebraic vector fields. In particular, we show that apart from a few exceptions this fact is true for any homogeneous space of form G/R where G is a linear algebraic group and R is a proper reductive subgroup of G.

Automated reasoning, and in particular automated theorem proving, has become a very important research field within the world of mathematics. Besides being used to verify proofs of theorems, it has also been used to discover proofs of theorems which were previously open problems. In this thesis, an automated reasoning assistant based on Godel's class theory is used to deduce several theorems.