Geometric relations between the zeros of polynomials

We consider the classical theorem of Grace, which gives a condition for a geometric relation between two arbitrary algebraic polynomials of the same degree. This theorem is one of the basic instruments in the geometry of polynomials. In some applications of the Grace theorem, one of the two polynomials is fixed. In this case, the condition in the Grace theorem may be changed. We explore this opportunity and introduce a new notion of locus of a polynomial. Using the loci of polynomials, we may improve some theorems in the geometry of polynomials. In general, the loci of a polynomial are not easy to describe. We prove some statements concerning the properties of a point set on the extended complex plane that is a locus of a polynomial.     

On a refinement of a theorem of Landau on Koebe domains

We state and prove a refinement of a classical theorem due to Landau on the Koebe domains for certain families of holomorphic functions introduced by A. W. Goodman. Our geometric approach in this article enables us to derive several statements of interest, which would not be produced via the methods in Goodman's paper, as immediate corollaries of the proof of the main theorem.     

Quantum set theory: Transfer Principle and De Morgan's Laws

In quantum logic, introduced by Birkhoff and von Neumann, De Morgan's Laws play an important role in the projection-valued truth value assignment of observational propositions in quantum mechanics. Takeuti's quantum set theory extends this assignment to all the set-theoretical statements on the universe of quantum sets. However, Takeuti's quantum set theory has a problem in that De Morgan's Laws do not hold between universal and existential bounded quantifiers. Here, we solve this problem by introducing a new truth value assignment for bounded quantifiers that satisfies De Morgan's Laws. To justify the new assignment, we prove the Transfer Principle, showing that this assignment of a truth value to every bounded ZFC theorem has a lower bound determined by the commutator, a projection-valued degree of commutativity, of constants in the formula. We study the most general class of truth value assignments and obtain necessary and sufficient conditions for them to satisfy the Transfer Principle, to satisfy De Morgan's Laws, and to satisfy both. For the class of assignments with polynomially definable logical operations, we determine exactly 36 assignments that satisfy the Transfer Principle and exactly 6 assignments that satisfy both the Transfer Principle and De Morgan's Laws.     

Some Methods of Computing First Extensions Between Modules of Graded Hecke Algebras

In this paper, we establish connections between the first extensions of simple modules and certain filtrations of of standard modules in the setting of graded Hecke algebras. The filtrations involved are radical filtrations and Jantzen filtrations. Our approach involves the use of information from the Langlands classification as well as some deeper understanding on some structure of some modules. Such module arises from the image of a Knapp-Stein type intertwining operator and is a quotient of a generalized standard module. As an application, we compute the Ext-groups for irreducible modules in a block for the graded Hecke algebra of type C ₃, assuming the truth of a version of Jantzen conjecture.     

An epistemic model of an agent who does not reflect on reasoning processes

This paper introduces an epistemic model of a boundedly rational agent under the two assumptions that (i) the agent’s reasoning process is in accordance with the model but (ii) the agent does not reflect on these reasoning processes. For such a concept of bounded rationality a semantic interpretation by the possible world semantics of the Kripke (1963) type is no longer available because the definition of knowledge in these possible world semantics implies that the agent knows all valid statements of the model. The key to my alternative semantic approach is the extension of the method of truth tables, first introduced for the propositional logic by Wittgenstein (1922), to an epistemic logic so that I can determine the truth value of epistemic statements for all relevant truth conditions. In my syntactic approach I define an epistemic logic–consisting of the classical calculus of propositional logic plus two knowledge axioms–that does not include the inference rule of necessitation, which claims that an agent knows all theorems of the logic. As my main formal result I derive a determination theorem linking my semantic with my syntactic approach. The difference between my approach and existing knowledge models is illustrated in a game-theoretic application concerning the epistemic justification of iterative solution concepts.     

Generating the patterns of variation with GeoGebra: the case of polynomial approximations

In this paper, we report a teaching experiment regarding the theory of polynomial approximations at the university mathematics teaching in Sweden. The experiment was designed by applying Variation theory and by using the free dynamic mathematics software GeoGebra. The aim of this study was to investigate if the technology-assisted teaching of Taylor polynomials compared with traditional way of work at the university level can support the teaching and learning of mathematical concepts and ideas. An engineering student group (n = 19) was taught Taylor polynomials with the assistance of GeoGebra while a control group (n = 18) was taught in a traditional way. The data were gathered by video recording of the lectures, by doing a post-test concerning Taylor polynomials in both groups and by giving one question regarding Taylor polynomials at the final exam for the course in Real Analysis in one variable. In the analysis of the lectures, we found Variation theory combined with GeoGebra to be a potentially powerful tool for revealing some critical aspects of Taylor Polynomials. Furthermore, the research results indicated that applying Variation theory, when planning the technology-assisted teaching, supported and enriched students’ learning opportunities in the study group compared with the control group.     

Brouwer and Euclid

We explore the relationship between Brouwer’s intuitionistic mathematics and Euclidean geometry. Brouwer wrote a paper in 1949 called The contradictority of elementary geometry. In that paper, he showed that a certain classical consequence of the parallel postulate implies Markov’s principle, which he found intuitionistically unacceptable. But Euclid’s geometry, having served as a beacon of clear and correct reasoning for two millennia, is not so easily discarded.Brouwer started from a “theorem” that is not in Euclid, and requires Markov’s principle for its proof. That means that Brouwer’s paper did not address the question whether Euclid’s Elements really requires Markov’s principle. In this paper we show that there is a coherent theory of “non-Markovian Euclidean geometry”. We show in some detail that our theory is an adequate formal rendering of (at least) Euclid’s Book I, and suffices to define geometric arithmetic, thus refining the author’s previous investigations (which include Markov’s principle as an axiom).Philosophically, Brouwer’s proof that his version of the parallel postulate implies Markov’s principle could be read just as well as geometric evidence for the truth of Markov’s principle, if one thinks the geometrical “intersection theorem” with which Brouwer started is geometrically evident.     

L0-线性函数的Hahn-Banach扩张定理的几何形式与随机赋范模中的Goldstine-Weston定理

本文给出了关于L⁰- 线性函数的Hahn-Banach 扩张定理的几何形式并证明这个几何形式等价于它的代数形式. 进一步, 我们利用这个几何形式给出了随机局部凸模中熟知的基本分离定理的一个新的且简单的证明. 最后, 利用这个分离定理, 我们同时在两种拓扑 —(ε, λ)- 拓扑和局部L⁰- 凸拓扑下证明了随机赋范模中的Goldstine-Weston 稠密性定理, 并举出一个反例说明在局部L⁰- 凸拓扑下如果随机赋范模不具有可数连接性质, 则Goldstine-Weston 稠密性定理不一定成立.     

An epistemic model of an agent who does not reflect on reasoning processes

This paper introduces an epistemic model of a boundedly rational agent under the two assumptions that (i) the agent’s reasoning process is in accordance with the model but (ii) the agent does not reflect on these reasoning processes. For such a concept of bounded rationality a semantic interpretation by the possible world semantics of the Kripke (1963) type is no longer available because the definition of knowledge in these possible world semantics implies that the agent knows all valid statements of the model. The key to my alternative semantic approach is the extension of the method of truth tables, first introduced for the propositional logic by Wittgenstein (1922), to an epistemic logic so that I can determine the truth value of epistemic statements for all relevant truth conditions. In my syntactic approach I define an epistemic logic–consisting of the classical calculus of propositional logic plus two knowledge axioms–that does not include the inference rule of necessitation, which claims that an agent knows all theorems of the logic. As my main formal result I derive a determination theorem linking my semantic with my syntactic approach. The difference between my approach and existing knowledge models is illustrated in a game-theoretic application concerning the epistemic justification of iterative solution concepts.     

Dynamic investigation of loci with surprising outcomes and their mathematical explanations

The locus is a very important concept in Euclidean geometry since it serves as a tool for solving different problems, and allows geometric constructions to be carried out. The teaching of the subject of loci in various mathematics courses includes solution of different exercises in which the student is required to find the locus in accordance with the data of the question. The present paper offers a different view of the subject of loci, which brings about conceptual understanding of the subject with identification of conserved properties and suitable generalizations obtained through investigation that includes the use of dynamic geometric software (GeoGebra). General formulas were developed for the equation of the locus in two cases. In the article, there are links to geometric applets which allow one to demonstrate the loci formed in some cases.     

Concepts of curvatures in normed planes

The theory of classical types of curves in normed planes is not strongly developed. In particular, the knowledge on existing concepts of curvatures of planar curves is widespread and not systematized in the literature. Giving a comprehensive overview on geometric properties of and relations between all introduced curvature concepts, we try to fill this gap. To complete and clarify the whole picture, we show which known concepts are equivalent, and add also a new type of curvature. Certainly, this yields a basis for further research and also for possible extensions of the whole existing framework. In addition, we derive various new results referring in full broadness to the variety of known curvature types in normed planes. These new results involve characterizations of curves of constant curvature, new characterizations of Radon planes and the Euclidean subcase, and analogues to classical statements like the four vertex theorem and the fundamental theorem on planar curves. We also introduce a new curvature type, for which we verify corresponding properties. As applications of the little theory developed in our expository paper, we study the curvature behavior of curves of constant width and obtain also new results on notions like evolutes, involutes, and parallel curves.     

Relative arithmetic

In nonstandard mathematics, the predicate ‘x is standard’ is fundamental. Recently, ‘relative’ or ‘stratified’ nonstandard theories have been developed in which this predicate is replaced with ‘x is y ‐standard’. Thus, objects are not (non)standard in an absolute sense, but (non)standard relative to other objects and there is a whole stratified universe of ‘levels’ or ‘degrees’ of standardness. Here, we study stratified nonstandard arithmetic and the related transfer principle. Using the latter, we obtain the ‘reduction theorem’ which states that arithmetical formulas can be reduced to equivalent bounded formulas. Surprisingly, the reduction theorem is also equivalent to the transfer principle. As applications, we obtain a truth definition for arithmetical sentences and we formalize Nelson's notion of impredicativity (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the mean number of normals through a point in the interior of a convex body

Recently, Kathy Hann established bounds on the average number of normals through a point in a convex bodyK, in the cases whereK is either a polytope or sufficiently smooth. In addition, an Euler-type theorem was obtained for these particular classes of convex bodies. In the present work we show that all these statements are true for an arbitrary convex bodyK. For this purpose measure geometric tools and a general approximation technique will be essential.     

基于共形几何代数的几何分解及程序实现

本文主要讨论了利用共形几何代数来进行几何定理中的几何构型进行几何分解的算法以及它的程序实现问题.利用这个算法可以给出几何量之间的定量依赖关系.所实现的程序能够给出一些较为复杂的几何命题的自动分解的结果.     

Canonical Euler-Lagrange equations and Jacobi's theorem on regular surfaces

In this article we establish conditions under which canonical variables can be defined for a variational problem defined on a geometric (compact) surface. Also, we show the form the corresponding Euler-Lagrange equations assume once we rewrite them in terms of such canonical variables. Furthermore, we prove a version of Jacobi's theorem generalizing the univariate standard version of this theorem. The main results are applied to the conformal Gauss curvature functional.     

某些芬斯拉空间的对称性质

<正> E.嘉当在他的黎曼几何教程中系统地讨论了对称的黎曼空间,并给出了充要条件的分析形式及一系列有趣的性质.本文在芬斯拉空间中引进了嘉当在黎曼几何中所定义的“对称”概念后(第一节),对这类芬斯拉空间的对称性质作了详尽的讨论.得到的结果如下:(一)在 F_n 的一区域Ω内,把任一向量关于0点(O∈Ω)作对称推移和沿经过0的极值曲线作平行推移(以后在不引起混淆的情祝下,简称为“向量经过平行推移及对称推移”),为使这时所得结果之差为三阶小量,充要条件是:挠率张量的共变导数在Ω中等于零.E.Cartan 对这种空间巳作了一些几何说明,而这里给了一个新的几何特征.我们称这样的芬斯拉空间为亚对称的,黎曼空间即口为其中最常见的一个.     

FC-空间中的不动点定理定理及应用

在FC-空间中建立了一个不动点定理,推广了近期文献的一个相关结论利用这个结果,我们建立了一些广义型定理,推广了著名的截口定理到FC-空间中借助这个截口定理,在FC-空间得到一些新的广义向量均衡问题解的存在性定理.     

Clifford 代数,几何计算和几何推理

Clifford代数是一种深深根植于几何学之中的代数系统,被它的创始人称为几何代数．历史上,E．Cartan,R．Brauer,H．Weyl,C．Chevalley等数学大师都曾研究和应用过Clifford代数,对它的发展起了重要作用．近年来,Clifford代数在微分几何、理论物理、经典分析等方面取得了辉煌的成就,是现代理论数学和物理的一个核心工具,并在现代科技的各个领域,如机器人学、信号处理、计算机视觉、计算生物学、量子计算等方面有广泛的应用．本文主要介绍Clifford代数在几何计算和几何推理中的应用．作为一种优秀的描述和计算几何问题的代数语言,Clifford代数对于几何体,几何关系和几何变换有不依赖于坐标的、易于计算的多种表示,因而应用它进行几何自动推理,不仅使困难定理的证明往往变得极为简单,而且能够解决一些著名的公开问题,目前在国际上,几何自动推理已经成为Clifford代数的一个重要应用领域。     

关于有理模和余理想子代数的性质

In this paper, for some used conceptions and notations, we see ［1］ and ［2］.§1. Rational Module and Its Exact Sequence In ［1］, Cai Chuanreng and Cheng Huixiang have proved that relative Hopf modules and rational modules are one by one corresponding. In ［2］, Zhang Liangyun has given the dual relationship between relative Hopf modules. Naturally, we have a question to ask: is the dual module of a rational module still a rational module? This answer is affirmative. Let H be a Hopf …