Jump to content

Talk:Fixed point (mathematics)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Pre- and postfixed points switched

[edit]

Davey/Priestley are simply wrong™ on this. The earlier, better reference is Cousot&Cousot, 1979, http://www.di.ens.fr/~cousot/COUSOTpapers/publications.www/CousotCousot-PacJMath-82-1-1979.pdf , where the the prefixed and postfixed points are defined correctly™. Changed.

Pre- and postfixed points switched back

[edit]

I think the Smyth-Plotkin 1982 usage is more common than the Cousot-Cousot 1979 usage. They seem equally natural to me. — Preceding unsigned comment added by 147.188.201.12 (talk) 21:44, 21 July 2022 (UTC)[reply]

Well there is also Shamir's 1976 thesis which says a prefixedpoint is p ≤ f(p), and accompanying 1977 paper "The convergence of functions to fixedpoints of recursive definitions". The Cousot 1979 paper cites Shamir's paper so this is probably why they agree. There are still people using Shamir's definition, e.g. [1] (cites Cousot) and [2] (probably copied from Wikipedia). In [3] Pitcher uses Shamir's definition and remarks "Warning: in [Gun92], [the post-fixed-point] is the definition of a pre-fixed-point." This implies that Pitcher considered both definitions and decided to use Shamir's definition, but unfortunately he doesn't explain why.
I guess I agree, overall prefixedpoint as f(p) ≤ p does indeed seem more common. But it would be nice to have a source which thoroughly compares the two definitions, however briefly, and comes to a conclusion. But Pitcher is not that source. --Mathnerd314159 (talk) 02:10, 22 July 2022 (UTC)[reply]
I should also mention Shamir's justification for his definition: a prefixedpoint is a function which is "almost" a fixedpoint, but is less defined. This "less defined" is similar to the meaning "before" of pre-. It is also similar to the use in preorder, which is almost a partial order but is not antisymmetric. In contrast the Smyth-Plotkin definition has no justification in that paper or in Davey-Priestley. Mathnerd314159 (talk) 03:31, 22 July 2022 (UTC)[reply]
Per [4] the justification for the "modern" definition is that the location of the symbol f is before the inequality sign in the term “f (x) ≤ x”. Mathnerd314159 (talk) 05:11, 22 July 2022 (UTC)[reply]
The analogy to "preorder" is not helpful, as it works equally well for each usage of "prefixpoint". 147.188.201.13 (talk) 20:51, 23 July 2022 (UTC)[reply]
But well done for finding all these sources. 147.188.201.13 (talk) 20:52, 23 July 2022 (UTC)[reply]

Requested move 4 October 2022

[edit]
The following is a closed discussion of a requested move. Please do not modify it. Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a move review after discussing it on the closer's talk page. No further edits should be made to this discussion.

The result of the move request was: no consensus. (closed by non-admin page mover)Ceso femmuin mbolgaig mbung, mellohi! (投稿) 20:04, 23 October 2022 (UTC)[reply]


– After my edits this article is about the usage of fixed points in a range of areas, such as math, computer science, and logic, with a brief mention of the physics definition, so it is not just about mathematics anymore and is more suited to be at Fixed point. Looking at the dab stats it seems that it is 50-50 fixed point (mathematics) and fixed-point arithmetic, so no help there in determining a primary topic. As argued in the previous RM though, the primary topic of the term "fixed point" is the sense described on this page. "Fixed-point" uses a dash, for one thing - looking at a dictionary they are clearly separate. Also, in terms of long-term significance, the usage in computers is relatively recent and niche, and the usage as a point that is fixed has been around for centuries and is still going strong in every high school math classroom. Also the close last time as no consensus seems pretty suspicious by my count - the only actual oppositions were No such user and BarrelProof who preferred moving to invariant point, and they were rebutted by eviolite and also opposed by Felix QW. So if this page doesn't become the primary topic then Wikipedia's RM process is just broken. Mathnerd314159 (talk) 04:09, 4 October 2022 (UTC) — Relisted. P.I. Ellsworth , ed. put'r there 10:32, 14 October 2022 (UTC)[reply]

~Kvng (talk) 16:09, 22 October 2022 (UTC)[reply]
The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.

"Transformation" inconsistency in current article

[edit]

The current article defines a fixed point in the first sentence as an element sent to itself by a transformation function. The article on transformation functions declares that these are functions sending a set to itself, i.e., that the domain and codomain are the same set, i.e., the picture of transformations relevant to the transformation monoid. The text of this article and recent edits, however, stated that the domain and codomain may be different. This has been an inconsistency that seems to need correction one way or another.

It is absolutely true that the image of a transformation function need not be identical with its domain, and also that there are mathematical conventions defining fixed points for functions that are not transformations. But there are also mathematical conventions for fixed points of non-functions! Partial functions (very simple by restriction) and morphisms (less trivial), for example. I edited to over-restrict the notion of fixed point in my last copyedit for consistency with the lead sentence, but I see that didn't go over well with other active editors of the page; I'll edit to expand the notion next time, which will mean redefining mathematical fixed points as something broader than specifically fixed points of transformation functions. RowanElder (talk) 13:52, 31 August 2024 (UTC)[reply]

The transformations article also has the more general definition: "When such a narrow notion of transformation is generalized to partial functions, then a partial transformation is a function f: A → B, where both A and B are subsets of some set X." There is no need to change anything. Mathnerd314159 (talk) 15:51, 31 August 2024 (UTC)[reply]
(1) That more general definition does not address all of my concerns, which were not about partial functions alone and specifically.
(2) The generalized claim in the transformation (function) article about partial functions is a contentious simplification that probably needs editing itself; it is not the case that a partial function "just is" a function f: A → B, where both A and B are subsets even though that's good enough to build shared intuition in informal use and conversation. There are exact correspondences between the partial functions and those functions of subsets but they have differences.
(3) Both this and the transformation article are start class articles and have been for a long time. They both need a lot of work that's not getting done. There is a lot to change. RowanElder (talk) 19:32, 31 August 2024 (UTC)[reply]
Thanks for your observations - I wasn't aware of the different definition in transformation (function). Apologies for any confusion that I may have caused.
We could start by defining fixed points only for functions with identical domain and codomain, which is easiest to understand and which (I guess) covers the vast majority of all applications. Lateron, we could mention the more general definition as a generalization. I thought of a sentence like As a generalization, the fixed points of an arbitrary function f:X → Y can be defined as those of f|X∩Y: X∩Y → Y, but this restriction needn't map into X. My second thought was to restrict as f|X∩f-1[X]: X∩f-1[X] → X , but this needn't map into f-1[X]. We could restrict to , but this is hard to read, let alone understand. So, it is best not to define by restriction, but just reuse the current definition instead: c is a fixed point of a function f if c belongs to both the domain and the codomain of f, and f(c) = c.
Anyway, starting with a narrow definition, and mentioning the more general definition(s) lateron would nicely match the structure of transformation (function), too.
I suggest to avoid mathematical point (which is a disambiguation page, anyway). Just "value" (without a link) should be sufficient in the lead, or, maybe, mathematical object. As for partial functions, I'd move them down to the generalization section. - Jochen Burghardt (talk) 16:24, 31 August 2024 (UTC)[reply]
Thank you, too, and sounds good. Introducing the most essential prototype definition in the lead and later discussing generalizations makes good sense to me. RowanElder (talk) 19:35, 31 August 2024 (UTC)[reply]