Dual Basis In A Field Extension
In mathematics, the linear algebra concept of dual basis can be applied in the context of a finite extension ''L''/''K'', by using the field trace. This requires the property that the field trace ''Tr''''L''/''K'' provides a non-degenerate quadratic form over ''K''. This can be guaranteed if the extension is separable extension, separable; it is automatically true if ''K'' is a perfect field, and hence in the cases where ''K'' is finite, or of characteristic zero. A dual basis () is not a concrete basis (linear algebra), basis like the polynomial basis or the normal basis; rather it provides a way of using a second basis for computations. Consider two bases for elements in a finite field, GF(''p''''m''): :B_1 = and :B_2 = then ''B''2 can be considered a dual basis of ''B''1 provided :\operatorname(\alpha_i\cdot \gamma_j) = \left\{\begin{matrix} 0, & \operatorname{if}\ i \neq j\\ 1, & \operatorname{otherwise} \end{matrix}\right. Here the field trace, trace of a value in GF ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting poin ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Linear Algebra
Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions. Linear algebra is also used in most sciences and fields of engineering, because it allows modeling many natural phenomena, and computing efficiently with such models. For nonlinear systems, which cannot be modeled with linear algebra, it is often used for dealing with first-order approximations, using the fact that the differential of a multivariate function at a point is the line ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Dual Basis
In linear algebra, given a vector space ''V'' with a basis ''B'' of vectors indexed by an index set ''I'' (the cardinality of ''I'' is the dimension of ''V''), the dual set of ''B'' is a set ''B''∗ of vectors in the dual space ''V''∗ with the same index set ''I'' such that ''B'' and ''B''∗ form a biorthogonal system. The dual set is always linearly independent but does not necessarily span ''V''∗. If it does span ''V''∗, then ''B''∗ is called the dual basis or reciprocal basis for the basis ''B''. Denoting the indexed vector sets as B = \_ and B^ = \_, being biorthogonal means that the elements pair to have an inner product equal to 1 if the indexes are equal, and equal to 0 otherwise. Symbolically, evaluating a dual vector in ''V''∗ on a vector in the original space ''V'': : v^i\cdot v_j = \delta^i_j = \begin 1 & \text i = j\\ 0 & \text i \ne j\text \end where \delta^i_j is the Kronecker delta symbol. Introduction To perform operations with a vector, we ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Finite Extension
In mathematics, more specifically field theory, the degree of a field extension is a rough measure of the "size" of the field extension. The concept plays an important role in many parts of mathematics, including algebra and number theory — indeed in any area where fields appear prominently. Definition and notation Suppose that ''E''/''F'' is a field extension. Then ''E'' may be considered as a vector space over ''F'' (the field of scalars). The dimension of this vector space is called the degree of the field extension, and it is denoted by :F The degree may be finite or infinite, the field being called a finite extension or infinite extension accordingly. An extension ''E''/''F'' is also sometimes said to be simply finite if it is a finite extension; this should not be confused with the fields themselves being finite fields (fields with finitely many elements). The degree should not be confused with the transcendence degree of a field; for example, the field Q(''X'' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Field Trace
In mathematics, the field trace is a particular function defined with respect to a finite field extension ''L''/''K'', which is a ''K''-linear map from ''L'' onto ''K''. Definition Let ''K'' be a field and ''L'' a finite extension (and hence an algebraic extension) of ''K''. ''L'' can be viewed as a vector space over ''K''. Multiplication by ''α'', an element of ''L'', :m_\alpha:L\to L \text m_\alpha (x) = \alpha x, is a ''K''-linear transformation of this vector space into itself. The ''trace'', Tr''L''/''K''(''α''), is defined as the trace (in the linear algebra sense) of this linear transformation. For ''α'' in ''L'', let ''σ''(''α''), ..., ''σ''(''α'') be the roots (counted with multiplicity) of the minimal polynomial of ''α'' over ''K'' (in some extension field of ''K''). Then :\operatorname_(\alpha) = :K(\alpha)sum_^n\sigma_j(\alpha). If ''L''/''K'' is separable then each root appears only once (however this does not mean the coefficient above is one; for ex ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Non-degenerate
In mathematics, specifically linear algebra, a degenerate bilinear form on a vector space ''V'' is a bilinear form such that the map from ''V'' to ''V''∗ (the dual space of ''V'' ) given by is not an isomorphism. An equivalent definition when ''V'' is finite-dimensional is that it has a non-trivial kernel: there exist some non-zero ''x'' in ''V'' such that :f(x,y)=0\, for all \,y \in V. Nondegenerate forms A nondegenerate or nonsingular form is a bilinear form that is not degenerate, meaning that v \mapsto (x \mapsto f(x,v)) is an isomorphism, or equivalently in finite dimensions, if and only if :f(x,y)=0 for all y \in V implies that x = 0. The most important examples of nondegenerate forms are inner products and symplectic forms. Symmetric nondegenerate forms are important generalizations of inner products, in that often all that is required is that the map V \to V^* be an isomorphism, not positivity. For example, a manifold with an inner product structure on its t ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Quadratic Form
In mathematics, a quadratic form is a polynomial with terms all of degree two ("form" is another name for a homogeneous polynomial). For example, :4x^2 + 2xy - 3y^2 is a quadratic form in the variables and . The coefficients usually belong to a fixed field , such as the real or complex numbers, and one speaks of a quadratic form over . If K=\mathbb R, and the quadratic form takes zero only when all variables are simultaneously zero, then it is a definite quadratic form, otherwise it is an isotropic quadratic form. Quadratic forms occupy a central place in various branches of mathematics, including number theory, linear algebra, group theory (orthogonal group), differential geometry ( Riemannian metric, second fundamental form), differential topology ( intersection forms of four-manifolds), and Lie theory (the Killing form). Quadratic forms are not to be confused with a quadratic equation, which has only one variable and includes terms of degree two or less. A quadra ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Separable Extension
In field theory, a branch of algebra, an algebraic field extension E/F is called a separable extension if for every \alpha\in E, the minimal polynomial of \alpha over is a separable polynomial (i.e., its formal derivative is not the zero polynomial, or equivalently it has no repeated roots in any extension field).Isaacs, p. 281 There is also a more general definition that applies when is not necessarily algebraic over . An extension that is not separable is said to be ''inseparable''. Every algebraic extension of a field of characteristic zero is separable, and every algebraic extension of a finite field is separable.Isaacs, Theorem 18.11, p. 281 It follows that most extensions that are considered in mathematics are separable. Nevertheless, the concept of separability is important, as the existence of inseparable extensions is the main obstacle for extending many theorems proved in characteristic zero to non-zero characteristic. For example, the fundamental theorem of Galo ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Perfect Field
In algebra, a field ''k'' is perfect if any one of the following equivalent conditions holds: * Every irreducible polynomial over ''k'' has distinct roots. * Every irreducible polynomial over ''k'' is separable. * Every finite extension of ''k'' is separable. * Every algebraic extension of ''k'' is separable. * Either ''k'' has characteristic 0, or, when ''k'' has characteristic , every element of ''k'' is a ''p''th power. * Either ''k'' has characteristic 0, or, when ''k'' has characteristic , the Frobenius endomorphism is an automorphism of ''k''. * The separable closure of ''k'' is algebraically closed. * Every reduced commutative ''k''-algebra ''A'' is a separable algebra; i.e., A \otimes_k F is reduced for every field extension ''F''/''k''. (see below) Otherwise, ''k'' is called imperfect. In particular, all fields of characteristic zero and all finite fields are perfect. Perfect fields are significant because Galois theory over these fields becomes simpler, s ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Basis (linear Algebra)
In mathematics, a set of vectors in a vector space is called a basis if every element of may be written in a unique way as a finite linear combination of elements of . The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to . The elements of a basis are called . Equivalently, a set is a basis if its elements are linearly independent and every element of is a linear combination of elements of . In other words, a basis is a linearly independent spanning set. A vector space can have several bases; however all the bases have the same number of elements, called the ''dimension'' of the vector space. This article deals mainly with finite-dimensional vector spaces. However, many of the principles are also valid for infinite-dimensional vector spaces. Definition A basis of a vector space over a field (such as the real numbers or the complex numbers ) is a linearly independent subset of that spans . Th ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Polynomial Basis
In mathematics the monomial basis of a polynomial ring is its basis (as a vector space or free module over the field or ring of coefficients) that consists of all monomials. The monomials form a basis because every polynomial may be uniquely written as a finite linear combination of monomials (this is an immediate consequence of the definition of a polynomial). One indeterminate The polynomial ring of univariate polynomials over a field is a -vector space, which has 1, x, x^2, x^3, \ldots as an (infinite) basis. More generally, if is a ring then is a free module which has the same basis. The polynomials of degree at most form also a vector space (or a free module in the case of a ring of coefficients), which has 1, x, x^2, \ldots as a basis. The canonical form of a polynomial is its expression on this basis: a_0 + a_1 x + a_2 x^2 + \dots + a_d x^d, or, using the shorter sigma notation: \sum_^d a_ix^i. The monomial basis is naturally totally ordered, either by increasing ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Normal Basis
In mathematics, specifically the algebraic theory of fields, a normal basis is a special kind of basis for Galois extensions of finite degree, characterised as forming a single orbit for the Galois group. The normal basis theorem states that any finite Galois extension of fields has a normal basis. In algebraic number theory, the study of the more refined question of the existence of a normal integral basis is part of Galois module theory. Normal basis theorem Let F\subset K be a Galois extension with Galois group G. The classical normal basis theorem states that there is an element \beta\in K such that \ forms a basis of ''K'', considered as a vector space over ''F''. That is, any element \alpha \in K can be written uniquely as \alpha = \sum_ a_g\, g(\beta) for some elements a_g\in F. A normal basis contrasts with a primitive element basis of the form \, where \beta\in K is an element whose minimal polynomial has degree n= :F/math>. Group representation point of view A fie ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |