Order, lattices, ordered algebraic structures Definition
Least fixed point
Builds on Partial orderLeast element
Definition
Let be a partially ordered set and let be a map. A fixed point of is an element with . A least fixed point of is a fixed point of such that for every fixed point of . In other words, it is the least element of the set .
Remarks
A least fixed point is unique when it exists, by antisymmetry of . It is written or . The greatest fixed point is defined dually and written or . Example: for , , the fixed points are the solutions of , namely and . Since , the least fixed point is . Non-example: for , , every real number is a fixed point, and has no least element, so has no least fixed point. The map on has no fixed point at all.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Least element concept
- Partial order concept
- Least fixed point definition
Further reading
About this page
| Tag | CH9B4RZPMW |
|---|---|
| URI | m2://CH9B4RZPMW |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06, 47H10 |
| Defines | Least fixed point |
| Uses | Partial order, Least element |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.