Duality (mathematics) in the context of Observability


Duality (mathematics) in the context of Observability

Duality (mathematics) Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Duality (mathematics) in the context of "Observability"


⭐ Core Definition: Duality (mathematics)

In mathematics, a duality translates concepts, theorems or mathematical structures into other concepts, theorems or structures in a one-to-one fashion, often (but not always) by means of an involution operation: if the dual of A is B, then the dual of B is A. In other cases the dual of the dual – the double dual or bidual – is not necessarily identical to the original (also called primal). Such involutions sometimes have fixed points, so that the dual of A is A itself. For example, Desargues' theorem is self-dual in this sense under the standard duality in projective geometry.

In mathematical contexts, duality has numerous meanings. It has been described as "a very pervasive and important concept in (modern) mathematics" and "an important general theme that has manifestations in almost every area of mathematics".

↓ Menu
HINT:

👉 Duality (mathematics) in the context of Observability

Observability is a measure of how well internal states of a system can be inferred from knowledge of its external outputs.In control theory, the observability and controllability of a linear system are mathematical duals.

The concept of observability was introduced by the Hungarian-American engineer Rudolf E. Kálmán for linear dynamic systems. A dynamical system designed to estimate the state of a system from measurements of the outputs is called a state observer for that system, such as Kalman filters.

↓ Explore More Topics
In this Dossier

Duality (mathematics) in the context of Category theory

Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the mid-20th century in their foundational work on algebraic topology. Category theory is used in most areas of mathematics. In particular, many constructions of new mathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality.

Many areas of computer science also rely on category theory, such as functional programming and semantics.

View the full Wikipedia page for Category theory
↑ Return to Menu

Duality (mathematics) in the context of Interior (topology)

In mathematics, specifically in topology,the interior of a subset S of a topological space X is the union of all subsets of S that are open in X.A point that is in the interior of S is an interior point of S.The interior of S is the complement of the closure of the complement of S.In this sense interior and closure are dual notions.

The exterior of a set S is the complement of the closure of S; it consists of the points that are in neither the set nor its boundary.The interior, boundary, and exterior of a subset together partition the whole space into three blocks (or fewer when one or more of these is empty).

View the full Wikipedia page for Interior (topology)
↑ Return to Menu

Duality (mathematics) in the context of Inscribed sphere

In geometry, the inscribed sphere or insphere of a convex polyhedron is a sphere that is contained within the polyhedron and tangent to each of the polyhedron's faces. It is the largest sphere that is contained wholly within the polyhedron, and is dual to the dual polyhedron's circumsphere.

The radius of the sphere inscribed in a polyhedron P is called the inradius of P.

View the full Wikipedia page for Inscribed sphere
↑ Return to Menu

Duality (mathematics) in the context of Generic property

In mathematics, properties that hold for "typical" examples are called generic properties. For instance, a generic property of a class of functions is one that is true of "almost all" of those functions, as in the statements, "A generic polynomial does not have a root at zero," or "A generic square matrix is invertible." As another example, a generic property of a space is a property that holds at "almost all" points of the space, as in the statement, "If f : MN is a smooth function between smooth manifolds, then a generic point of N is not a critical value of f." (This is by Sard's theorem.)

There are many different notions of "generic" (what is meant by "almost all") in mathematics, with corresponding dual notions of "almost none" (negligible set); the two main classes are:

View the full Wikipedia page for Generic property
↑ Return to Menu

Duality (mathematics) in the context of Linear logic

Linear logic is a substructural logic proposed by French logician Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the dualities of the former with many of the constructive properties of the latter. Although the logic has also been studied for its own sake, more broadly, ideas from linear logic have been influential in fields such as programming languages, game semantics, and quantum physics (because linear logic can be seen as the logic of quantum information theory), as well as linguistics, particularly because of its emphasis on resource-boundedness, duality, and interaction.

Linear logic lends itself to many different presentations, explanations, and intuitions.Proof-theoretically, it derives from an analysis of classical sequent calculus in which uses of (the structural rules) contraction and weakening are carefully controlled. Operationally, this means that logical deduction is no longer merely about an ever-expanding collection of persistent "truths", but also a way of manipulating resources that cannot always be duplicated or thrown away at will. In terms of simple denotational models, linear logic may be seen as refining the interpretation of intuitionistic logic by replacing cartesian (closed) categories by symmetric monoidal (closed) categories, or the interpretation of classical logic by replacing Boolean algebras by C*-algebras.

View the full Wikipedia page for Linear logic
↑ Return to Menu

Duality (mathematics) in the context of Geometric algebra

In mathematics, a geometric algebra (also known as a Clifford algebra) is an algebra that can represent and manipulate geometrical objects such as vectors. Geometric algebra is built out of two fundamental operations, addition and the geometric product. Multiplication of vectors results in higher-dimensional objects called multivectors. Compared to other formalisms for manipulating geometric objects, geometric algebra is noteworthy for supporting vector division (though generally not by all elements) and addition of objects of different dimensions.

The geometric product was first briefly mentioned by Hermann Grassmann, who was chiefly interested in developing the closely related exterior algebra. In 1878, William Kingdon Clifford greatly expanded on Grassmann's work to form what are now usually called Clifford algebras in his honor (although Clifford himself chose to call them "geometric algebras"). Clifford defined the Clifford algebra and its product as a unification of the Grassmann algebra and Hamilton's quaternion algebra. Adding the dual of the Grassmann exterior product allows the use of the Grassmann–Cayley algebra. In the late 1990s, plane-based geometric algebra and conformal geometric algebra (CGA) respectively provided a framework for euclidean geometry and classical geometries. In practice, these and several derived operations allow a correspondence of elements, subspaces and operations of the algebra with geometric interpretations. For several decades, geometric algebras went somewhat ignored, greatly eclipsed by the vector calculus then newly developed to describe electromagnetism. The term "geometric algebra" was repopularized in the 1960s by David Hestenes, who advocated its importance to relativistic physics.

View the full Wikipedia page for Geometric algebra
↑ Return to Menu

Duality (mathematics) in the context of Closure (topology)

In topology, the closure of a subset S of points in a topological space consists of all points in S together with all limit points of S. The closure of S may equivalently be defined as the union of S and its boundary, and also as the intersection of all closed sets containing S. Intuitively, the closure can be thought of as all the points that are either in S or "very near" S. A point which is in the closure of S is a point of closure of S. The notion of closure is in many ways dual to the notion of interior.

View the full Wikipedia page for Closure (topology)
↑ Return to Menu

Duality (mathematics) in the context of Voronoi cell

In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. It can be classified also as a tessellation. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region, called a Voronoi cell, consisting of all points of the plane closer to that seed than to any other. The Voronoi diagram of a set of points is dual to that set's Delaunay triangulation.

The Voronoi diagram is named after mathematician Georgy Voronoy, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet). Voronoi cells are also known as Thiessen polygons, after Alfred H. Thiessen. Voronoi diagrams have practical and theoretical applications in many fields, mainly in science and technology, but also in visual art.

View the full Wikipedia page for Voronoi cell
↑ Return to Menu

Duality (mathematics) in the context of Controllability

Controllability is an important property of a control system and plays a crucial role in many regulation problems, such as the stabilization of unstable systems using feedback, tracking problems, obtaining optimal control strategies, or, simply prescribing an input that has a desired effect on the state.

Controllability and observability are dual notions. Controllability pertains to regulating the state by a choice of a suitable input, while observability pertains to being able to know the state by observing the output (assuming that the input is also being observed).

View the full Wikipedia page for Controllability
↑ Return to Menu

Duality (mathematics) in the context of Simple encoder

An encoder (or "simple encoder") in digital electronics is a one-hot to binary converter. That is, if there are 2 input lines, and at most only one of them will ever be high, the binary code of this 'hot' line is produced on the n-bit output lines. A binary encoder is the dual of a binary decoder.

If the input circuit can guarantee at most a single-active input, a simple encoder is a better choice than a priority encoder, since it requires less logic to implement. However, a simple encoder can generate an incorrect output when more than a single input is active, so a priority encoder is required in such cases.

View the full Wikipedia page for Simple encoder
↑ Return to Menu