Wikipedia talk:WikiProject Mathematics

(Redirected from Wikipedia talk:WPM)
Latest comment: 2 days ago by Gumshoe2 in topic Accessibility of Newton's method
Main pageDiscussionContentAssessmentParticipantsResources
WikiProject iconMathematics Project‑class
WikiProject iconThis page is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
ProjectThis page does not require a rating on Wikipedia's content assessment scale.
Note icon
Shortcut: WT:WPM

Original research on Wikipedia edit

Hello, I am a mathematician from the German Wikipedia. There we had recently a user that basically "misused" the German Wikipedia to publish his own "research" (if you can call it even that...). Basically the user computed a LOT of things with Wolfram Alpha and published all his computations in the German Wikipedia to a point where the articles became unreadable. He even invented his own names for functions and the user - according to his own words - does not have a formal degree in mathematics. In my opinion most of the stuff was not even relevant for an encylopedia. In the end a lot of his entries were deleted and after a heated discussion the user got banned. Long story short the user was/is also active in the English Wikipedia (see Special:Contributions/Reformbenediktiner). I am not so familliar with the English Wikipedia policies but I know that original research is also not allowed, so I thought I should maybe notify people here and they could at least have a look at some of the affected articles like for example Theta function, Rogers–Ramanujan continued fraction, Fubini's theorem#Example Application, Jacobi elliptic functions, Rogers–Ramanujan identities etc. If you see some math in color, that was probably done by this user. In the German Wikipedia the user did not use any source material and just computed things with Wolfram Alpha. Whether it all was correct or not, I am not even sure. It would be good if people would have a look at the affected English articles as well and give their judgement.--Tensorproduct (talk) 19:42, 22 February 2024 (UTC)Reply

FYI: User:Reformbenediktiner. PatrickR2 (talk) 19:48, 22 February 2024 (UTC)Reply
Thanks for this report. I just removed a lot of this from Poisson summation formula (two long and almost entirely unsourced sections). Probably the others listed above and the contributions of this user need similar scrutiny. —David Eppstein (talk) 20:28, 22 February 2024 (UTC)Reply
Yes, unfortunately every post by him needs scrutiny. In the German Wikipedia eventually almost all of his math edits were removed. Many users asked him many times to provide sources but he kept on editing without providing any source. It seems to be the same here as Jacobolus' example below shows--Tensorproduct (talk) 21:18, 22 February 2024 (UTC)Reply
Example discussion: Talk:Lemniscate_elliptic_functions#Sources?jacobolus (t) 20:49, 22 February 2024 (UTC)Reply
Thanks for letting us know. Bubba73 You talkin' to me? 21:03, 22 February 2024 (UTC)Reply
Here was another recent discussion: Wikipedia_talk:WikiProject_Mathematics/Archive/2023/Jul#Theta_function. --JBL (talk) 18:58, 2 March 2024 (UTC)Reply
Huh. I spotted the stuff at theta function, and scratched my head a bit about it. I would be happier if much or most of this was removed, or maybe moved to a distinct article. Many of the relations are cool-looking! Yes, it is not uncommon for stuff similar to this to be published in journals. However, the cutting edge academic journals & books will say things similar this in the intro: In 1837, Kummer listed three identities for hypergeometric functions; this was extended to 50 by 1880, and 240 in 1920 and a general algorithm to generate a countable number of such identities was given in 1960. However, it did not list all of them, and neither did algorithms x,y,z proposed in 1980 and in this paper we explore the structure of algorithmic generators ... and so you realize these guys are talking about a kind-of fractal splattered all through this landscape of inter-related identities, and how to best understand/describe that fractal. (As far as I know, there aren't any articles on WP that even scratch the surface of this topic, and it would be cool if there were... but, whatever.) The problem is that the enthusiastic amateur is unaware that he's dong the algebraic equivalent of publishing cool-looking zooms of the Mandelbrot set. Yes, its still cool looking. But is not where the action is, and it is a clutter and distracting, if you were reading the article to find something else, e.g. look up some factoid about riemann surfaces, and that factoid is now buried in reams of wild identities. 67.198.37.16 (talk) 08:13, 4 March 2024 (UTC)Reply
It's up to you guys if you want to check every edit of him, whether it is legit or not (like we did in the German Wikipedia), or you want to save time and just remove them. For me is "computing stuff with Wolfram Alpha and not adding to the mathematical theory" not mathematics and hence not relevant for an encylopedia.--Tensorproduct (talk) 22:05, 8 March 2024 (UTC)Reply
I literally just came across a few edits by that user at the article Jacobi elliptic functions while looking for articles to translate into Spanish. Unfortunately that user's article edits go back to 2022, and I can't justify reverting that far back since I can't integrate other people's edits while deleting that user's edits. I can confirm that a good chunk of their vocabulary is gibberish from at least 19 March 2024, but because the topic is somewhat beyond me, I can't even confirm the tremendous amount of notational modifications that user also made since 2022. I do suspect that reverting all of that user's edits is the right move. JuanTutors (talk) 00:21, 26 March 2024 (UTC)Reply
Wow, yeah. Vast stretches of Jacobi elliptic functions and Theta function are garish, under- or unreliably sourced, and basically impenetrable. There's no way to tell what is important and what is just a formula included for the sake of having a formula. XOR'easter (talk) 01:35, 2 April 2024 (UTC)Reply
I'd go so far as to say that Theta function should be reverted to the version of 14 April 2022. XOR'easter (talk) 22:34, 3 April 2024 (UTC)Reply
I agree with this. It seems that there were some intervening good edits, but it seems like the simpler approach would be to merge those in manually. Tito Omburo (talk) 10:45, 4 April 2024 (UTC)Reply
I can hit revert myself, but I'd have to clear time/gather energy to do manual merging of any intervening good edits. Perhaps some of the additions to these various pages could be saved in a List of identities for the such-and-such function kind of article (like Exact trigonometric values and List of trigonometric identities). But we'd need better grounds for preserving such material than "Wolfram Alpha says so" or "one random preprint on ResearchGate includes it". XOR'easter (talk) 18:11, 4 April 2024 (UTC)Reply

I've removed a section of geometric series by this editor that was obvious offtopic original research. I looked at their edits to Fubini's theorem, which I consolidated into Fubini's theorem#Calculation examples and I don't feel very strongly about it (although it badly needs edits for style). Tito Omburo (talk) 10:39, 4 April 2024 (UTC)Reply

Note: It seems like @A1E6: has had a lot of interactions with this editor in the past, and presumably could weigh in. Tito Omburo (talk) 10:55, 4 April 2024 (UTC)Reply

Some of his work exceeds the limits of what WolframAlpha can do. But what matters is that he often harms the Wikipedia project by adding his original research that is clearly beyond WP:CALC and not only that; the research is sometimes hardly notable/interesting from a mathematical standpoint. I've had a conversation with him on several occasions; you can check out my Talk page if you want.
When I first started editing Wikipedia, I had a similar mindset like Reformbenediktiner – but that changed (a long time ago) when I understood what this project is about.
I'm not active on Wikipedia anymore though; otherwise I would have already done all the "dirty work" myself – like deleting some of his contributions (or adding warnings about original reseach for readers) and discussing on the Talk pages – I'm familiar with all the mathematical articles that he edits.
But don't get me wrong – some of his contributions are good... A1E6 (talk) 12:44, 5 April 2024 (UTC)Reply
This is an area that I also have some familiarity with, but I am not a great expert. If I have time, I will try to clean up some of these articles and keep you posted. Tito Omburo (talk) 19:11, 6 April 2024 (UTC)Reply

Hodge conjecture edit

Hello, I think there was some vandalism on the Hodge conjecture. I tried to revert to what looked to be last good version of the article. However, I am not sure given the maths in the article. If someone can take a look at the diffs and content of the article that would be much appreciated! Classicwiki (talk) If you reply here, please ping me. 22:03, 3 April 2024 (UTC)Reply

Current version looks OK. It's identical to [1] Tito Omburo (talk) 22:12, 3 April 2024 (UTC)Reply
@Tito Omburo, thanks for reviewing! Classicwiki (talk) If you reply here, please ping me. 22:13, 3 April 2024 (UTC)Reply
@Classicwiki and Tito Omburo: I notice that the article was edited heavily by Darcourse in 2023 and 2022; this editor is singularly incompetent in my opinion (though not a vandal), so if you're checking what the last good revision is, you might inspect their edits, too. (The I looked a little bit and wasn't convinced one way or the other.) --JBL (talk) 18:20, 4 April 2024 (UTC)Reply
I'm not really qualified to judge most of the article for mathematical accuracy, but I would say that on a cursory reading it seems ok. Tito Omburo (talk) 19:01, 4 April 2024 (UTC)Reply
@JayBeeEll - unfortunately I am in the same boat and can not judge the mathematical accuracy, so it is tough for me to determine if the edits are appropriate. Classicwiki (talk) If you reply here, please ping me. 22:09, 4 April 2024 (UTC)Reply
Ok, no worries -- thanks both. --JBL (talk) 17:45, 12 April 2024 (UTC)Reply

Copy-pasting proofs in articles edit

I just deleted some technical proofs in the Coppersmith's attack article, because they were pretty much copy-pasted from some of the sources with a few words changed. Given the article is not about most of the proofs, they're probably better deleted anyways, but I was wondering what the policy was on proofs in articles and how similar they're allowed to be, because obviously Wikipedia can't have its own proof of every subject, but I think it's a copyright violation if you copy-paste (even with a few words changed) the exact wording. Does anyone know if that's correct? I looked for any policy pages but could not find them. Mrfoogles (talk) 00:56, 11 April 2024 (UTC)Reply

Sounds about right. Review Wikipedia:COPYVIO. Perhaps if you spent a lot of time and determined that the sources were CC-by-SA, and so they could be copied, the question still remains if mathematical proofs in articles adds any value. Usually, they don't. See Category:Article proofs and Category:Articles containing proofs and Wikipedia:WikiProject Mathematics/Proofs. My knee-jerk reaction is you're dealing with a form of spam from a novice editor with good intentions but lacking experience. On closer inspection, that article was created whole, including the proofs, in 2011, by an editor who created two WP articles in two days, and never-ever edited WP ever again. The intricacy of detail suggests that the author is copying directly from their own thesis, i.e. they are probably copying their own work. Probably. But since they're anon, can't quite tell, and since they're not active, can't ask them.
One more comment about proofs. If they are added by a clear subject-matter expert (as is the case here) then they're OK (because likelihood of correctness is high, and the maintenance burden is low.) When they are added by a college sophomore studying for a mid-term exam, then they must be exterminated with prejudice. If they clutter the article, they can be wrapped with one of the auto-expander click-thru box templates, so that they don't take up space when not expanded. 67.198.37.16 (talk) 02:46, 11 April 2024 (UTC)Reply
Please see Wikipedia:Expert editors:
  • "Wikipedia does not grant additional powers or respect to subject-matter experts."
Who added content or under what circumstances is not relevant. Johnjbarton (talk) 16:22, 11 April 2024 (UTC)Reply
True. And it is also the case that a contribution from a subject-matter expert is more likely to be correct than one from a "college sophomore studying for a midterm exam". :-) PatrickR2 (talk) 23:19, 11 April 2024 (UTC)Reply

Featured article review for 0.999... edit

I have nominated 0.999... for a featured article review here. Please join the discussion on whether this article meets the featured article criteria. Articles are typically reviewed for two weeks. If substantial concerns are not addressed during the review period, the article will be moved to the Featured Article Removal Candidates list for a further period, where editors may declare "Keep" or "Delist" in regards to the article's featured status. The instructions for the review process are here. voorts (talk/contributions) 20:58, 11 April 2024 (UTC)Reply

On the subject of FAR, would anyone like to try fixing the mild under-citation at Emmy Noether? XOR'easter (talk) 14:14, 13 April 2024 (UTC)Reply

Emmy Noether FAR final citations and checks edit

The Emmy Noether article has been at featured article review for a couple months now. If anyone wants to take a look, most of the issues seem to have been fixed but the contributions to mathematics and physics section would likely benefit from a couple more citations and a quick survey (including of the typsetting) by someone more qualified than I am. Sgubaldo (talk) 15:20, 16 April 2024 (UTC)Reply

Possible duplicate logic articles edit

Does it really make sense for "Logical connective", "Boolean function", and "Truth function" to all be separate articles? If I were more sure, I wouldn't be asking. I get how "Logic gate" is a separate article, but the other ones seem to cover the same territory, although I'm not sure which one(s) should be merged into which. Thiagovscoelho (talk) 12:21, 17 April 2024 (UTC)Reply

Hi @Thiagovscoelho: These are distinct topics. Logical connectives are used to connect (logical) expressions in first-order logic, second-order logic and set theory in general, to express axioms, theorems, inference rules, etc. By contrast, Boolean functions are functions (things having input and output) that operate on elements of a boolean algebra. These may be finite, countable or uncountable sets. See Stone representation theorem for details. Note that the elements of a boolean algebra are NOT logical expressions! The truth function article deals with the most limited, narrow case, where "truth" is taken to be a single value T or F. A single letter, a single bit. This is distinct from elements of a boolean algebra, which can be large complex things, and it is also distinct from logical connectives, which apply to the text strings of a term algebra or a model theory. So, very distinct concepts which magically happen to have the same notation. Which, yes, can lead to confusion. Perhaps the ledes of these articles should be amended to clarify this, state this up front. 67.198.37.16 (talk) 20:46, 19 April 2024 (UTC)Reply
(p.s. The word "magic" is fun. Formally, it is called the semantic/syntactic distinction, and there are a collection of theorems from the 1930's that clarify this relationship. Turing's incompleteness theorem is perhaps the most famous; there are others. e.g. Skolem-Lowenheim upward/downward, the completeness theorem, and the assorted variants of it from Godel, Post, Gentzen, Bernays, Kleene.) — Preceding unsigned comment added by 67.198.37.16 (talk) 21:03, 19 April 2024 (UTC)Reply
Hi @Thiagovscoelho: I noticed that you just went through a major, massive rewrite of the very long article on propositional calculus. Are you sure that this is a good idea, given the confusion you expressed above? The old version of the article seemed to get to the point, right after the first two introductory paragraphs; the new version seems to take some tortuous detour, before starting to explain what it is half-way into the article. I cannot help reviewing this, but perhaps more wisdom and fewer facts would help. 67.198.37.16 (talk) 22:27, 19 April 2024 (UTC)Reply
I've replaced disorganized sections that did not cite sources with organized sections that do cite sources, and I'm doing this by reading all the sources. The sources are naturally textbooks on logic, and they mostly only mention connectives, which, semantically, are only defined by means of their associated truth functions, whereas syntactically they are of course not properly "defined" at all, but may have their behavior described by inference rules prescribing their introduction or elimination. As it stands, the Logical connective article has no coverage of introduction/elimination inference rules, so its coverage overlaps a lot with what Truth function ought to cover. As to Propositional calculus, the old version "got to the point" by failing to define terms that are defined in all the sources, introducing notation without explaining what it means, failing to keep syntax and semantics clearly distinct, failing to distinguish between a formal language and the proof system used with it, and, most of all, not citing any sources at all and therefore not describing any of the variation between authors on the topics. You are welcome to edit it and improve it, but there is no Wikipedia standard by which the old article was better. Thiagovscoelho (talk) 23:05, 19 April 2024 (UTC)Reply
Yes, the current version of Boolean function actually specifies "truth function" as an alternative name for it. If you are sure that there is such a sharp distinction, it would be good for you to edit the article and cite the Reliable Sources that you are familiar with for this statement. I have not read any of the literature that specifically refers to "Boolean functions", but the idea of such a sharp division surprises me, since George Boole was a logician, after all, and I mean, just look at the article, it features all the normal connectives from logic. Thiagovscoelho (talk) 23:27, 19 April 2024 (UTC)Reply
My experience is that at least in computer science "Boolean function" is usually, but not invariably, used to mean functions that take values in the two-element Boolean Algebra. This is how the textbooks I currently have access to use the term.[1][2][3] I don't currently have access to Rudeanu's classic on the subject, but I could check his terminology in the library next week if needed.[4] At least Steinbach and Posthoff do also explicitly mention truth function as a common synonym. Felix QW (talk) 08:15, 20 April 2024 (UTC)Reply

References

  1. ^ Rosen, Kenneth H. (1995). Discrete mathematics and its applications (3. ed.). New York: McGraw-Hill. ISBN 978-0-07-053965-5.
  2. ^ Steinbach, Bernd; Posthoff, Christian (2022). Logic Functions and Equations: Fundamentals and Applications using the XBOOLE-Monitor (Third ed.). Cham: Springer International Publishing. ISBN 978-3-030-88945-6.
  3. ^ Clote, Peter; Kranakis, Evangelos (2002). Boolean Functions and Computation Models. Texts in Theoretical Computer Science. An EATCS Series. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-662-04943-3. ISBN 978-3-642-08217-7.
  4. ^ Rudeanu, Sergiu (1974). Boolean functions and equations. Amsterdam: North-Holland Publ. [u.a.] ISBN 978-0-7204-2082-1.

Accessibility of Newton's method edit

Can someone here take a look at the recent changes at Newton's method and discussion at talk:Newton's method, and maybe help resolve the edit war there? user:Fangong00 insists on a substantial rewrite, especially of the first few sections, which I think makes the article significantly worse, most importantly rendering it, in my opinion, almost completely illegible to most of the intended audience. They don't seem too interested in having a discussion about the trade-offs involved in of various possible choices of scope/focus for the article or its early sections, but I don't really want to spend all day revert warring. Maybe someone else can phrase concerns about this in a way that gets through? –jacobolus (t) 02:23, 21 April 2024 (UTC)Reply

The previous page for Newton's method is outdated. That version only presents Newton-Raphson method. In today's numerical analysis, Newton's method most often means Simpson's extension and also include the Gauss-Newton iteration and the newly discovered the rank-r Newton's iteration. Furthermore, the crucial convergence theorems such as Kantorovich Theorem and alpha theory were not included.
Why does jacobolus insists on keeping the outdated version? When someone tries to look up Newton's method, he or she is entitled to see the what Newton's iteration is today. Fangong00 (talk) 02:35, 21 April 2024 (UTC)Reply
@Fangong00 the basic real-function version of Newton's method is not "outdated", but is used ubiquitously, and anyone working with computer software involving numerical calculations is likely to come across it sooner or later. It is taught to early undergraduate students and frequently encountered by people with relatively limited pure math background. It is essential that a Wikipedia article about such a basic and widely used tool start out in its first few sections with explanation which is legible and accessible to the broadest possible audience. If you want to include detailed technical discussions of advanced niche generalizations, then that is fine, but it must be done much further down the page and clearly contextualized so that readers can figure out what is being discussed and why.
As a simple example, a computer game programmer with a high school level math background might plausibly read fast inverse square root and come across a wikilink there to Newton's method; if they click through they must not be confronted with a wall of jargon expecting several years of preparation they don't have. –jacobolus (t) 02:48, 21 April 2024 (UTC)Reply
Raphson's method is not out dated, it is now a special case of what we call "Newton's method" in numerical analysis. The most widely used Newton's iteration is not Raphson's but Simpson's and Gauss-Newton. To make the page a useful reference for the broadest possible audience.
Why do you not want a vistor to see the most widely used Newton's method? Fangong00 (talk) 12:56, 21 April 2024 (UTC)Reply
Fangong00, you are incorrect. The page in its previous state does have a section for systems of equations and for Banach spaces, where the Gauss-Newton iteration and (what you call in a nonstandard way) "Simpson's extension" belong. The rank-r Newton iteration seems to be from a 2023 paper and it is not at all clear that it is notable enough for mention. The Kantorovich theorem is also already mentioned there.
Smale's theorem is certainly appropriate for inclusion, and could go for example in the Analysis section. Gumshoe2 (talk) 02:54, 21 April 2024 (UTC)Reply
I know the page mentioned Simpson's version serveral pages later. Users visiting the page is unlikely to see it when they thought only Raphson's method is Newton's iteration. Fangong00 (talk) 12:58, 21 April 2024 (UTC)Reply
The Gauss-Newton method and the Banach space Newton method are also already mentioned further down the page in the previous version. I don't think there would be any objection to expanding the text in that context.
I also don't think there would be any objection to drawing attention to this by mentioning, perhaps in a couple sentences, in the lead section that there are important multidimensional extensions of Newton's method. The lead section, after all, is meant to be a brief summary of the article. (See Wikipedia:Manual of Style/Lead section; I think neither version of the article has a satisfactory lead section.) Gumshoe2 (talk) 13:17, 21 April 2024 (UTC)Reply
I think this content should be restored. I have commented at Talk:Newton's method. Tito Omburo (talk) 12:18, 21 April 2024 (UTC)Reply