Ncfavier
Hello, Ncfavier, and welcome to Wikipedia! Thank you for your contributions. I hope you like this place and decide to stay.
- Please sign your name on talk pages, by using four tildes (~~~~). This will automatically produce your username and the date, and helps to identify who said what and when. Please do not sign any edit that is not on a talk page.
- Check out some of these pages:
- If you have a question that is not one of the frequently asked questions below, check out the Teahouse, ask me on my talk page, or click the button below. Happy editing and again, welcome! Rasnaboy (talk) 07:55, 9 October 2022 (UTC)
- Do a search on Google or your preferred search engine for the subject of the Wikipedia article that you want to create a citation for.
- Find a website that supports the claim you are trying to find a citation for.
- In a new tab/window, go to the citation generator, click on the 'An arbitrary website' bubble, and fill out as many fields as you can about the website you just found.
- Click the 'Get reference wiki text' button.
- Highlight, and then copy (Ctrl+C or Apple+C), the resulting text (it will be something like
<ref> {{cite web | .... }}</ref>
, copy the whole thing). - In the Wikipedia article, after the claim you found a citation for, paste (Ctrl+V or Apple+V) the text you copied.
- If the article does not have a References or Notes section (or the like), add this to the bottom of the page, but above the External Links section and the categories:
==References== {{Reflist}}
Ordered pair - Kuratowski, Function
editYou wrote in [comment]: "not being a function isn't something you can prove; you'd need to define functions first, which is usually done using ordered pairs, so this is circular. "
I don't agree that we have a vicious circle here. We have two commonly accepted definitions of functions: Bourbaki (a function is a triplet f=(X,Y,G) where X is the domain, Y is the codomain, and G is a graph, i.e. a set of argument-value pairs) and the second definition, probably Peano's, earlier, reducing Bourbaki's definition only to a graph, i.e. f=G (it is often added that it is also a certain binary relation at the same time).
The definition of G is based on the Cartesian product, i.e. a set of pairs (G is some subset of XxY). The way we define a pair does not matter for G.
Since we are considering the Kuratowski case, if we assume a pair as (a,b)={{a},{a,b}} we must consistently use this definition in the definition of G. Kamil Kielczewski (talk) 12:53, 30 July 2024 (UTC)
- Even so, the statement is bogus because is not of the right type to even consider whether or not it's a function in the set-of-pairs sense: it is not even a set. What you wrote looks like a formal proof but really isn't one, and a short sentence conveys the same information without needlessly confusing the reader. — ncfavier 13:22, 30 July 2024 (UTC)
- @Ncfavier What I wrote shows that if the function pi existed (as a regular function within ZFC) it would lead to a contradiction. Which does not mean that I insist that this proof should remain - your correction in the article is also ok and clarifies the situation. Kamil Kielczewski (talk) 18:40, 30 July 2024 (UTC)