67.252.103.23 at 16:20, 15 March 2014

2014-03-15T16:20:14Z

← Older revision		Revision as of 18:20, 15 March 2014
Line 1:		Line 1:
	In [[mathematics]], a '''filtration''' is an [[indexed set]] ''S<sub>i</sub>'' of [[subobject]]s of a given [[algebraic structure]] ''S'', with the index ''i'' running over some [[index set]] ''I'' that is a [[totally ordered set]], subject to the condition that if ''i'' ≤ ''j'' in ''I'' then ''S<sub>i</sub>'' ⊆ ''S<sub>j</sub>''. The concept [[Dual (category theory)\|dual]] to a filtration is called a ''cofiltration''.		My name is Mervin and I am studying American Politics and Playwriting at Peiting / Germany.<br><br>Look at my website - [http://th-resort.com/print.php?ID=194 resort phu tho]

	Sometimes, as in a [[filtered algebra]], there is instead the requirement that the <math>S_i</math> be [[Subalgebra#Subalgebras in universal algebra\|subalgebras]] with respect to certain operations (say, vector addition), but with respect to other operations (say, multiplication), they instead satisfy <math>S_i \cdot S_j \subset S_{i+j}</math>, where here the index set is the natural numbers; this is by analogy with a [[graded algebra]].

	Sometimes, filtrations are supposed to satisfy the additional requirement that the union of the <math>S_i</math> be the whole <math>S</math>, or (in more general cases, when the notion of union does not make sense) that the canonical homomorphism from the direct limit of the <math>S_i</math> to <math>S</math> is an isomorphism. Whether this requirement is ~~assumed or not usually depends on the author of the text~~ and ~~is often explicitly stated. We are ''not'' going to impose this requirement in this article.~~

	There is also the notion of a '''descending filtration''', which is required to satisfy <math>S_i \supseteq S_j</math> in lieu of <math>S_i \subseteq S_j</math> (and, occasionally, <math>\bigcap_{i\in I} S_i=0</math> instead of <math>\bigcup_{i\in I} S_i=S</math>). Again, it depends on the context how exactly the word "filtration" is to be understood. Descending filtrations are not to be confused with cofiltrations (which consist of [[quotient]] objects rather than subobjects).

	~~Filtrations are widely used in [[abstract algebra]], [[homological algebra]] (where they are related in an important way to [[spectral sequence]]s),~~ and in [[measure theory]] and [[probability theory]] for nested sequences of [[sigma algebra\|σ-algebras]]. In [[functional analysis]] and [[numerical analysis]], other terminology is usually used, such as [[scale of spaces]] or [[nested spaces]].

	~~==Examples==~~

	~~===Algebra===~~
	~~{{See also\|Filtered algebra}}~~

	~~====Groups====~~
	~~{{See also\|Length function}}~~

	In algebra, filtrations are ordinarily indexed by '''N''', the set of natural numbers. A ''filtration'' of a group ''G'', is then a nested sequence ''G''<sub>''n''</sub> of [[normal subgroup]]s of ''G'' (that is, for any ''n'' we have ''G''<sub>''n''+1</sub> ⊆ ''G''<sub>''n''</sub>). Note that this use of the word "filtration" corresponds to our "descending filtration".

	Given a group ''G'' and a filtration ''G''<sub>''n''</sub>, there is a natural way to define a topology on ''G'', said to be ''associated'' to the filtration. A basis for this topology is the set of all translates of subgroups appearing in the filtration, that is, a subset of ''G'' is defined to be open if it is a union of sets of the form ''aG''<sub>''n''</sub>, where ''a''∈''G'' and ''n'' is a natural number.

	~~The topology associated to a filtration on a group ''G'' makes ''G'' into a [[topological group]].~~

	~~The topology associated to a filtration ''G''<sub>''n''</sub> on a group ''G'' is [[Hausdorff space\|Hausdorff]] if and only if ∩''G''<sub>''n''<~~/~~sub> = {1}~~.

	If two filtrations ''G''<sub>''n''</sub> and ''G′''<sub>''n''</sub> are defined on a group ''G'', then the identity map from ''G'' to ''G'', where the first copy of ''G'' is given the ''G''<sub>''n''</sub>-topology and the second the ''G′''<~~sub~~>~~''n''~~<~~/sub~~>~~-topology, is continuous if and only if for any ''n'' there is an ''m'' such that ''G''<sub>''m''</sub> ⊆''G′''<sub>''n''</sub>, that is, if and only if the identity map is continuous~~ at ~~1. In particular, the two filtrations define the same topology if and only if for any subgroup appearing in one there is a smaller or equal one appearing in the other.~~

	~~====Rings and modules: descending filtrations====~~

	Given a ring ''R'' and an ''R''-module ''M'', a ''descending filtration'' of ''M'' is a decreasing sequence of submodules ''M''<sub>''n''</sub>. This is therefore a special case of the notion for groups, with the additional condition that the subgroups be submodules. The associated topology is defined as for groups.

	~~An important special case is known as the ''I''-adic topology (or ''J''-adic, etc.). Let ''R'' be a commutative ring, and ''I'' an ideal of ''R''.~~

	Given an ''R''-module ''M'', the sequence ''I<sup>n</sup>M'' of submodules of ''M'' forms a filtration of ''M''. The ''I-adic topology'' on ''M'' is then the topology associated to this filtration. If ''M'' is just the ring ''R'' itself, we have defined the ''I-adic topology'' on ''R''.

	When ''R'' is given the ''I''-adic topology, ''R'' becomes a [[topological ring]]. If an ''R''-module ''M'' is then given the ''I''-adic topology, it becomes a [[topological module\|topological ''R''-module]], relative to the topology given on ''R''.

	~~====Rings and modules: ascending filtrations====~~

	Given a ring ''R'' and an ''R''-module ''M'', an ''ascending filtration'' of ''M'' is an increasing sequence of submodules ''M''<sub>''n''</sub>. In particular, if ''R'' is a field, then an ascending filtration of the ''R''-vector space ''M'' is an increasing sequence of vector subspaces of ''M''. [[Flag (linear algebra)\|Flags]] are one important class of such filtrations.

	~~====Sets====~~
	A maximal filtration of a set is equivalent to an ordering (a [[permutation]]) of the set. For instance, the filtration <math>\{0\} \subset \{0,1\} \subset \{0,1,2\}</math> corresponds to the ordering <math>(0,1,2)</math>. From the point of view of the [[field with one element]], an ordering on a set corresponds to a maximal [[Flag (linear algebra)\|flag]] (a filtration on a vector space), considering a set to be a vector space over the field with one element.

	~~===Measure theory===~~
	In [[measure theory]], in particular in [[martingale theory]] and the theory of [[stochastic process]]es, a filtration is an increasing [[sequence (mathematics)\|sequence]] of [[sigma algebra\|''σ''-algebras]] on a [[measurable space]]. That is, given a measurable space <math>(\Omega, \mathcal{F})</math>, a filtration is a sequence of ''σ''-algebras <math>\{ \mathcal{F}_{t} \}_{t \geq 0}</math> with <math>\mathcal{F}_{t} \subseteq \mathcal{F}</math> for each ''t'' and

	~~:<math>t_{1} \leq t_{2} \implies \mathcal{F}_{t_{1}} \subseteq \mathcal{F}_{t_{2}}.</math>~~

	~~The exact range of the "times" ''t'' will usually depend on context: the set of values for ''t'' might be [[discrete set\|discrete]] or continuous, [[bounded set\|bounded]] or unbounded. For example,~~

	~~:<math>t \in \{ 0, 1, \dots, N \}, \mathbb{N}_{0}, [0, T] \mbox{ or } [0, + \infty).</math>~~

	Similarly, a '''filtered probability space''' (also known as a '''stochastic basis''') <math>\left(\Omega, \mathcal{F}, \left\{\mathcal{F}_{t}\right\}_{t\geq 0}, \mathbb{P}\right)</math>, is a [[probability space]] equipped with the filtration <math>\left\{\mathcal{F}_t\right\}_{t\geq 0}</math> of its σ-~~algebra <math>\mathcal{F}</math>. A filtered probability space is said to satisfy the ''usual conditions'' if it is~~ [[complete measure\|complete]] (i.e. <math>\mathcal{F}_0</math> contains all <math>\mathbb{P}</math>-[[null set]]s) and [[right-continuous]] (i.e. <math>\mathcal{F}_t = \mathcal{F}_{t+} := \bigcap_{s > t} \mathcal{F}_s</math> for all times <math>t</math>).<ref>{{cite web\|title=Stochastic Processes: A very simple introduction\|author=Péter Medvegyev\|date=January 2009\|url=http://~~medvegyev.uni~~-corvinus.hu/St1.pdf\|format=pdf\|accessdate=June 25, 2012}}</ref><ref>{{cite book\|title=Probabilities and Potential\|author=Claude Dellacherie\|publisher=Elsevier\|year=1979\|isbn=9780720407013}}</ref><ref>{{cite web\|title=Filtrations and Adapted Processes\|author=George Lowther\|url=http://almostsure.wordpress.com/~~2009/11/08/filtrations-and-adapted-processes/\|date=November 8, 2009\|accessdate=June 25, 2012}}</ref>~~

	It is also useful (in the case of an unbounded index set) to define <math>\mathcal{F}_{\infty}</math> as the ''σ''-algebra generated by the infinite union of the <math>\mathcal{F}_{t}</math>'s, which is contained in <math>\mathcal{F}</math>:

	~~:<math>\mathcal{F}_{\infty} = \sigma\left(\bigcup_{t \geq 0} \mathcal{F}_{t}\right) \subseteq \mathcal{F}.</math>~~

	A ''σ''-algebra defines the set of events that can be measured, which in a [[probability]] context is equivalent to events that can be discriminated, or "questions that can be answered at time ''t''". Therefore a filtration is often used to represent the change in the set of events that can be measured, through gain or loss of [[information]]. A typical example is in [[mathematical finance]], where a filtration represents the information available up to and including each time ''t'', and is more and more precise (the set of measurable events is staying the same or increasing) as more information from the evolution of the stock price becomes available.

	~~====Relation to stopping times====~~
	Let <math>\left(\Omega, \mathcal{F}, \left\{\mathcal{F}_{t}\right\}_{t\geq 0}, \mathbb{P}\right)</math> be a filtered probability space. A random variable <math>\tau : \Omega \rightarrow [0, \infty]</math> is said to be a [[stopping time]] with respect to filtration <math>\left\{\mathcal{F}_{t}\right\}_{t\geq 0}</math>, provided the event <math>\{\tau \leq t\} \in \mathcal{F}_t</math> for all <math>t\geq 0</math>. ~~We may also define the ''stopping time'' <math>\sigma</math>-algebra,~~
	~~:<math>\mathcal{F}_{\tau} :~~= ~~\left\{A\in\mathcal{F}:A\cap\{\tau \leq t\}\in\mathcal{F}_t, \ \forall t\geq 0\right\} </math>~~
	~~In other words, <math>\mathcal{F}_{\tau}\subseteq\mathcal{F}</math> encodes information up to the ''random'' time <math>\tau</math>.~~

	It can be shown that <math>\tau</math> is <math>\mathcal{F}_{\tau}</math>-measurable. Furthermore, if <math>\tau_ 1</math> and <math>\tau_ 2</math> are [[stopping time]]s on <math>\left(\Omega, \mathcal{F}, \left\{\mathcal{F}_{t}\right\}_{t\geq 0}, \mathbb{P}\right)</math>, and <math>\tau_1 \leq \tau_2</math> [[almost surely]], then <math>\mathcal{F}_{\tau_1} \subseteq \mathcal{F}_{\tau_2}</math>.

	~~==See also==~~
	*[[Natural filtration]]

	~~==References==~~
	~~{{Reflist}}~~
	* {{cite book \| author=Øksendal, Bernt K. \| authorlink=Bernt Øksendal \| title=Stochastic Differential Equations: An Introduction with Applications \| publisher=Springer\| location=Berlin \| year=2003 \| isbn=3-540-04758-1}}

	~~[[Category:Algebra]]~~
	~~[[Category:Measure theory]]~~
	~~[[Category:Stochastic processes]~~]

93.36.122.39: /* Existence and uniqueness theorems */

2014-01-10T15:59:31Z

Existence and uniqueness theorems

Show changes

128.59.193.134: /* Differential structures on topological manifolds */

2012-08-13T18:11:27Z

Differential structures on topological manifolds

New page

We may find simple methods to speed up computer by making the many from the built inside tools inside the Windows in addition to downloading the Service Pack updates-speed up the PC and fix error. Simply follow a few regulations to instantly create the computer quick than ever. Many of the reliable companies may provide a full cash back guarantee. This signifies which we have the chance to get the cash back in the event you find the registry cleaning has not delivered what we expected. Windows is extremely dumb. It only knows how to follow commands plus instructions, meaning that whenever you install a program, which program has to tell Windows what to do. This really is done by storing an "training file" inside the registry of the system. All your computer programs put these "manuals" into the registry, allowing a computer to run a wide array of programs. When you load up 1 of those programs, Windows simply looks up the system file in the registry, plus carries out its instructions. Paid registry cleaners found on the other hand, I have found, are frequently inexpensive. They provide standard, free changes or at least cheap changes. This follows because the software manufacturer must guarantee their product is best inside staying before its competitors. If you are lookin for the greatest [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities] system, make sure to look for one that defragments the registry. It should also scan for assorted points, such as invalid paths and invalid shortcuts and programs. It must also identify invalid fonts, check for device driver problems plus repair files. Also, make sure that it has a scheduler. That technique, you are able to set it to scan your system at certain times on certain days. It sounds like a lot, yet it really is absolutely vital. The principal reason why I couldn't make my PC run faster was the program registry and it being fragmented. So software to defragment or clean the registry are needed. Such software are called registry cleaners. Like all additional software, there are paid ones plus free ones with their advantages plus disadvantages. To choose between your 2 is the user's choice. Reboot PC - Just reboot a PC to find if the error is gone. Often, rebooting the PC readjusts the internal settings and software plus therefore fixes the issue. If it doesn't then move on to follow the instructions below. Ally Wood is a specialist software reviewer and has worked inside CNET. Now she is functioning for her own review software organization to provide feedback to the software creator plus has performed deep test inside registry cleaner software. After reviewing the top registry cleaner, she has written complete review on a review site for you that is accessed for free.

Differential structure - Revision history

67.252.103.23 at 16:20, 15 March 2014

93.36.122.39: /* Existence and uniqueness theorems */

128.59.193.134: /* Differential structures on topological manifolds */