scholarly journals Lattice of ℤ-module

2016 ◽  
Vol 24 (1) ◽  
pp. 49-68 ◽  
Author(s):  
Yuichi Futa ◽  
Yasunari Shidama
Keyword(s):  
Coding Theory ◽  
Positive Definite ◽  
Bilinear Forms ◽  
Reduction Algorithm ◽  
Real Numbers ◽  
Scalar Products ◽  
Definition Of

Summary In this article, we formalize the definition of lattice of ℤ-module and its properties in the Mizar system [5].We formally prove that scalar products in lattices are bilinear forms over the field of real numbers ℝ. We also formalize the definitions of positive definite and integral lattices and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm [14], and cryptographic systems with lattices [15] and coding theory [9].

scholarly journals Divisible ℤ-modules

2016 ◽  
Vol 24 (1) ◽  
pp. 37-47 ◽  
Author(s):  
Yuichi Futa ◽  
Yasunari Shidama
Keyword(s):  
Vector Space ◽  
Coding Theory ◽  
Reduction Algorithm ◽  
Definition Of ◽  
Coefficient Ring ◽  
Torsion Free

Summary In this article, we formalize the definition of divisible ℤ-module and its properties in the Mizar system [3]. We formally prove that any non-trivial divisible ℤ-modules are not finitely-generated.We introduce a divisible ℤ-module, equivalent to a vector space of a torsion-free ℤ-module with a coefficient ring ℚ. ℤ-modules are important for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm [15], cryptographic systems with lattices [16] and coding theory [8].

scholarly journals The Linearity of Riemann Integral on Functions from ℝ into Real Banach Space

2013 ◽  
Vol 21 (3) ◽  
pp. 185-191
Author(s):  
Keiko Narita ◽  
Noboru Endou ◽  
Yasunari Shidama
Keyword(s):  
Banach Space ◽  
Integral Operator ◽  
Real Banach Space ◽  
Closed Interval ◽  
Continuous Functions ◽  
Real Numbers ◽  
Riemann Integral ◽  
Basic Properties ◽  
Bounded Functions ◽  
Definition Of

Summary In this article, we described basic properties of Riemann integral on functions from R into Real Banach Space. We proved mainly the linearity of integral operator about the integral of continuous functions on closed interval of the set of real numbers. These theorems were based on the article [10] and we referred to the former articles about Riemann integral. We applied definitions and theorems introduced in the article [9] and the article [11] to the proof. Using the definition of the article [10], we also proved some theorems on bounded functions.

Optimization Analysis on Dynamic Reduction Algorithm

2018 ◽  
Vol 6 (5) ◽  
pp. 447-458
Author(s):  
Yizhou Chen ◽  
Jiayang Wang
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Reduction Process ◽  
New Method ◽  
Reduction Algorithm ◽  
Optimization Analysis ◽  
Sampling Process ◽  
Dynamic Methods ◽  
Definition Of

Abstract On the basis of rough set theory, the strengths of dynamic reduction are elaborated compared with traditional non-dynamic methods. A systematic concept of dynamic reduction from sampling process to the generation of the reduct set is presented. A new method of sampling is created to avoid the defects of being too subjective. And in order to deal with the over-sized time consuming problem in traditional dynamic reduction process, a quick algorithm is proposed within the constraint conditions. We have also proved that dynamic core possesses the essential characteristics of a reduction core on the basis of the formalized definition of the multi-layered dynamic core.

The EXPRESS-I Language

1994 ◽  
Author(s):  
Douglas Schenck ◽  
Peter Wilson
Keyword(s):  
Information Modeling ◽  
Real Numbers ◽  
Geometric Point ◽  
Computer Automation ◽  
Definition Of ◽  
Data Elements ◽  
Specific Implementation ◽  
And Behavior ◽  
Specification Techniques ◽  
Test Suites

Now we turn to the question: ‘Once I have created an abstract declaration in EXPRESS, what would an instance of that thing look like?’ EXPRESS-I allows you to create instances of EXPRESS things that have values in place of references to datatypes. The main reason for doing this is to study some realistic examples of things that otherwise might be difficult to understand. After all, it is one thing to describe a tree and quite another to actually see one. Some of the design goals of EXPRESS-I are based on these requirements: • Major information modeling projects are large and complex. Managing them without appropriate tools based on formal languages and methods is a risky proposition. Informal specification techniques eliminate the possibility of employing computer automation in checking for inconsistencies in presentation or specification. • The language should focus on the display of the realization of the properties of entities, which are the things of interest. The definition of entities is in terms of data and behavior. Data represents the properties by which an entity is realized and behavior is represented by constraints. • The language should seek to avoid, as far as possible, specific implementation views. That is, EXPRESS-I models do not suggest the structure of databases, object bases, or of information bases in general. • The language should provide a means for displaying small populated models of EXPRESS schemas as examples for design reviews. • The language should provide a means for supporting the specification of test suites for information model processors. EXPRESS-I represents entity instances in terms of the values of its attributes (attributes are the traits or characteristics considered important for use and understanding). These values have a representation which might be considered simple (an integer value) or something more complex (an entity value). A geometric point might be defined in terms of three real numbers named x, y and z, and the actual values associated with those attributes might be 1.0, 2.5 and 7.9. The EXPRESS-I instance language provides a means of displaying instantiations of EXPRESS data elements. The language is designed principally for human readability and for ease of generating EXPRESS-I element instances from definitions in an EXPRESS schema.

Unbounded Positive Definite Functions

1969 ◽  
Vol 21 ◽  
pp. 1309-1318 ◽  
Author(s):  
James Stewart
Keyword(s):  
Abelian Group ◽  
Positive Measure ◽  
Positive Definite Function ◽  
Positive Definite ◽  
Locally Compact Abelian Group ◽  
Definite Function ◽  
Complex Numbers ◽  
Stieltjes Transform ◽  
Real Numbers ◽  
Image Position

Let G be an abelian group, written additively. A complexvalued function ƒ, defined on G, is said to be positive definite if the inequality1holds for every choice of complex numbers C1, …, cn and S1, …, sn in G. It follows directly from (1) that every positive definite function is bounded. Weil (9, p. 122) and Raïkov (5) proved that every continuous positive definite function on a locally compact abelian group is the Fourier-Stieltjes transform of a bounded positive measure, thus generalizing theorems of Herglotz (4) (G = Z, the integers) and Bochner (1) (G = R, the real numbers).If ƒ is a continuous function, then condition (1) is equivalent to the condition that2

Decomposition of Witt Rings

1982 ◽  
Vol 34 (6) ◽  
pp. 1276-1302 ◽  
Author(s):  
Andrew B. Carson ◽  
Murray A. Marshall
Keyword(s):  
Quadratic Forms ◽  
Classification Problem ◽  
Bilinear Forms ◽  
Interesting Problem ◽  
Witt Ring ◽  
Witt Rings ◽  
Finite Case ◽  
Characteristic 2 ◽  
Definition Of

We take the definition of a Witt ring to be that given in [13], i.e., it is what is called a strongly representational Witt ring in [8]. The classical example is obtained by considering quadratic forms over a field of characteristic ≠ 2 [17], but Witt rings also arise in studying quadratic forms or symmetric bilinear forms over more general types of rings [5,7, 8, 9]. An interesting problem in the theory is that of classifying Witt rings in case the associated group G is finite. The reduced case, i.e., the case where the nilradical is trivial, is better understood. In particular, the above classification problem is completely solved in this case [4, 12, or 13, Corollary 6.25]. Thus, the emphasis here is on the non-reduced case. Although some of the results given here do not require |G| < ∞, they do require some finiteness assumption. Certainly, the main goal here is to understand the finite case, and in this sense this paper is a continuation of work started by the second author in [13, Chapter 5].

scholarly journals An extended Hamburger moment problem

1985 ◽  
Vol 28 (2) ◽  
pp. 167-183 ◽  
Author(s):  
Olav Njåstad
Keyword(s):  
Distribution Function ◽  
Moment Problem ◽  
Sufficient Conditions ◽  
Positive Definite ◽  
Moment Problems ◽  
Real Numbers ◽  
Orthogonal Functions ◽  
Hamburger Moment Problem ◽  
Hankel Determinants ◽  
Necessary And Sufficient

The classical Hamburger moment problem can be formulated as follows: Given a sequence {cn:n=0,1,2,…} of real numbers, find necessary and sufficient conditions for the existence of a distribution function ψ (i.e. a bounded, real-valued, non-decreasing function) on (– ∞,∞) with infinitely many points of increase, such that , n = 0,1,2, … This problem was posed and solved by Hamburger [5] in 1921. The corresponding problem for functions ψ on the interval [0,∞) had already been treated by Stieltjes [15] in 1894. The characterizations were in terms of positivity of Hankel determinants associated with the sequence {cn}, and the original proofs rested on the theory of continued fractions. Much work has since been done on questions connected with these problems, using orthogonal functions and extension of positive definite functionals associated with the sequence. Accounts of the classical moment problems with later developments can be found in [1,4,14]. Good modern accounts of the theory of orthogonal polynomials can be found in [2,3].

The arithmetic of certain semigroups of positive operators

1968 ◽  
Vol 64 (1) ◽  
pp. 161-166 ◽  
Author(s):  
John Lamperti
Keyword(s):  
Finite Number ◽  
Positive Definite ◽  
Positive Operators ◽  
Linear Operators ◽  
Real Numbers ◽  
Ultraspherical Polynomials ◽  
Real Polynomials ◽  
Fixed Parameter ◽  
Summation Sign ◽  
Image Position

Some time ago, S. Bochner gave an interesting analysis of certain positive operators which are associated with the ultraspherical polynomials (1,2). Let {Pn(x)} denote these polynomials, which are orthogonal on [ − 1, 1 ] with respect to the measureand which are normalized by settigng Pn(1) = 1. (The fixed parameter γ will not be explicitly shown.) A sequence t = {tn} of real numbers is said to be ‘positive definite’, which we will indicate by writing , provided thatHere the coefficients an are real, and the prime on the summation sign means that only a finite number of terms are different from 0. This condition can be rephrased by considering the set of linear operators on the space of real polynomials which have diagonal matrices with respect to the basis {Pn(x)}, and noting that

Relative Stability Via the Direct Method of Lyapunov

1964 ◽  
Vol 86 (1) ◽  
pp. 87-90 ◽  
Author(s):  
W. G. Vogt
Keyword(s):  
Nonlinear Systems ◽  
Lyapunov Function ◽  
Control Theory ◽  
Linear Approximation ◽  
Relative Stability ◽  
Direct Method ◽  
Positive Definite ◽  
Error Criterion ◽  
Definition Of ◽  
Classical Control

A mathematically rigorous concept of relative stability based on the v-functions of the direct method of Lyapunov is introduced. Two systems of the type representable by x˙ = f(x) are considered, where under the proper restrictions on f(x), a Lyapunov function, v(x) is uniquely determined by a positive definite error criterion r(x) and the equation v˙(x) = −r(x). The definition of the relative stability proposed, eventually leads to conditions on the linear approximation systems which are sufficient to assure the relative stability of the nonlinear systems. This leads to conditions on the eigenvalues of the linear approximation system which are necessary but not sufficient for relative stability. Additional conditions on the choice of the error criteria are needed. The present definition permits the gap between concepts of stability in classical control theory and that due to the direct method of Lyapunov to be at least partially bridged.

Sign in / Sign up

Export Citation Format

Share Document