(Translated by https://www.hiragana.jp/)
Wikipedia:Reference desk/Mathematics: Difference between revisions - Wikipedia Jump to content

Wikipedia:Reference desk/Mathematics: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
→‎What is special about Cartesian coordinates?: thanks, and testing my understanding
Line 99: Line 99:


:In ''any'' [[vector space]] with a [[basis (linear algebra)|basis]] one can add vectors by component-wise addition of their representations as [[coordinate vector]]s. The basis does not have to be formed by Cartesian-coordinate unit vectors (an [[orthonormal basis]]) or even be [[Orthogonal basis|orthogonal]]. For a coordinate system based on ''any'' basis of a Euclidean space viewed as a vector space, not necessarily Cartesian, the coordinate hypersurfaces are again Euclidean spaces. The [[hyperbolic paraboloid]] is a non-Euclidean doubly [[ruled surface]]. One can impose a coordinate system in which the "rules" are the coordinate lines. So the implication <coordinate vector system describes Euclidean space> → <coordinate hypersurfaces are Euclidean> is one-way only. &nbsp;--[[User talk:Lambiam|Lambiam]] 07:57, 5 January 2022 (UTC)
:In ''any'' [[vector space]] with a [[basis (linear algebra)|basis]] one can add vectors by component-wise addition of their representations as [[coordinate vector]]s. The basis does not have to be formed by Cartesian-coordinate unit vectors (an [[orthonormal basis]]) or even be [[Orthogonal basis|orthogonal]]. For a coordinate system based on ''any'' basis of a Euclidean space viewed as a vector space, not necessarily Cartesian, the coordinate hypersurfaces are again Euclidean spaces. The [[hyperbolic paraboloid]] is a non-Euclidean doubly [[ruled surface]]. One can impose a coordinate system in which the "rules" are the coordinate lines. So the implication <coordinate vector system describes Euclidean space> → <coordinate hypersurfaces are Euclidean> is one-way only. &nbsp;--[[User talk:Lambiam|Lambiam]] 07:57, 5 January 2022 (UTC)

::Thank you! I might understand. So are Cartesian coordinates the intersection of orthogonal coordinates and basis vector representations? -[[User:Amcbride|Amcbride]] ([[User talk:Amcbride|talk]]) 15:48, 5 January 2022 (UTC)

Revision as of 15:49, 5 January 2022

Welcome to the mathematics section
of the Wikipedia reference desk.
Select a section:
Want a faster answer?

Main page: Help searching Wikipedia

   

How can I get my question answered?

  • Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
  • Post your question to only one section, providing a short header that gives the topic of your question.
  • Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
  • Don't post personal contact information – it will be removed. Any answers will be provided here.
  • Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
  • Note:
    • We don't answer (and may remove) questions that require medical diagnosis or legal advice.
    • We don't answer requests for opinions, predictions or debate.
    • We don't do your homework for you, though we'll help you past the stuck point.
    • We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.



How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

  • The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
See also:

December 30

Real unit disc

The complex unit disc is very important in analysis, and similarly the real unit interval (0,1). What about the real unit disc (-1,1)? Is that as ubiquitous? Does it have a name other than (-1,1) or real unit disc? Thanks. I I want to parametrize something to for expository purposes and am wondering if that seems a little weird compared to the more conventional (0,1). 2601:648:8202:350:0:0:0:9435 (talk) 10:31, 30 December 2021 (UTC)[reply]

It is the (open) unit 1-ball. I can't think of a snappier term.  --Lambiam 11:00, 30 December 2021 (UTC)[reply]

certain restricted permutations

Is there a name for the set of permutations of { 1, 2, .., n } such that the difference between adjacent items in the sequence is no more than k?

If we call the count S,

  • S(n,0) = 0 (no solution)
  • S(n,1) = 1 (the identity permutation)
  • S(n,k≥n-1) = n!

but 1<k<n-1 may be more interesting. —Tamfang (talk) 18:50, 30 December 2021 (UTC)[reply]

I don't know if this concept has a name. For n ≥ 2, S(n, 1) = 2 (there is also the reverse permutation). S(n, n-2) = (n-2)(n-1)! (subtract off the ones where 1 and n touch). Aside from that I suspect there will not be nice formulas. Danstronger (talk) 19:42, 30 December 2021 (UTC)[reply]
Thanks for the correction. So S(n,k) is always even. —Tamfang (talk) 22:46, 30 December 2021 (UTC)[reply]
S(n,2) is OEIS sequence A003274. Assuming the g.f. has been proven (it's not entirely clear), there is a linear recursive formula. --RDBury (talk) 01:44, 31 December 2021 (UTC)[reply]
PS. S(n,3) is OEIS sequence A174700. It lists an "empirical" g.f. which, if true, would imply it also has a linear recursive formula. It appears S(n,4), and S(n,k) with fixed k>4, are not in the OEIS. It's perhaps not too much of a leap to conjecture that S(n,k) has a linear recursive formula for any fixed k, though the formulas increase in complexity as k increases. Anyone need a topic for a Master's Thesis? --RDBury (talk) 02:29, 31 December 2021 (UTC)[reply]

December 31

Number theory

Except these 47 numbers:

{1, 3, 4, 6, 10, 17, 20, 26, 62, 68, 74, 116, 122, 137, 170, 182, 227, 254, 260, 428, 452, 740, 758, 878, 977, 1052, 1142, 1187, 1412, 1460, 1493, 1542, 1658, 1982, 2510, 2702, 2828, 3098, 3812, 5777, 5972, 5993, 6638, 7352, 15098, 19268, 43358}

Do all positive integers which are not twice a square number can be written as (twice a positive square number) + (odd prime or twice an odd prime)?

Except these 8 numbers:

{1, 3, 4, 10, 14, 122, 422, 432}

Do all positive integers which are not twice a triangular number can be written as (twice a positive triangular number) + (odd prime or twice an odd prime)?

——114.41.123.50 (talk) 09:31, 31 December 2021 (UTC)[reply]

The first part - it seems likely that this is all of them. A quick and dirty program shows no more under 391,000,000 109. Bubba73 You talkin' to me? 06:48, 1 January 2022 (UTC)[reply]
Like Goldbach's conjecture, these conjectures have a heuristic justification. They may also share resistance to proof attempts with Goldbach's conjecture, although the alleged proof of a weaker version inspires some hope.  --Lambiam 12:48, 1 January 2022 (UTC)[reply]
And the second part, there are no others less than 185,000,000 109. Bubba73 You talkin' to me? 06:41, 2 January 2022 (UTC)[reply]

Sum of reciprocals

The sum of reciprocals for “triangular numbers * k + 1” (where k is positive integer) is (see Centered_polygonal_number#Sum_of_Reciprocals)

, if k ≠ 8
, if k = 8

But what is the formula of the sum of reciprocals for “generalized pentagonal numbers * k + 1” (where k is positive integer)? (generalized pentagonal number is OEISA001318)

——114.41.123.50 (talk) 09:35, 31 December 2021 (UTC)[reply]

An observation. Just like the case is special for the case of triangular numbers, the case is special for pentagonal numbers:  --Lambiam 00:32, 1 January 2022 (UTC)[reply]

January 2

Most notable mathematical discovery by an amateur since WWII

After noticing a quick addition (and then appropriate reversion and comment about Original Research) to the Collatz Problem, I was wondering what the most significant mathematical discovery since WWII by an amateur mathematician. The only one that comes to mind is Marjorie Rice and the Pentagonal tilings. Are there others at this level (geometrical constructions) or beyond? I understand that amateur mathematician is a nebulous term, I'm particularly excluding whoever happened to have the computer that found specific entries for GIMPS.Naraht (talk) 00:42, 2 January 2022 (UTC)[reply]

We have List of amateur mathematicians with notable contributions. Greg Egan probably also deserves to be on the list; see the Quanta article on superpermutations. --{{u|Mark viking}} {Talk} 00:54, 2 January 2022 (UTC)[reply]
There is an MO thread[1] about this too. 2601:648:8202:350:0:0:0:9435 (talk) 00:51, 4 January 2022 (UTC)[reply]
Don't really know how notable it is but "A lower bound on the length of the shortest superpattern" coauthored by an anonymous 4chan user is a nice story. 2A01:E34:EF5E:4640:6D7C:A7E:28B7:1036 (talk) 19:13, 4 January 2022 (UTC)[reply]

Notation

Does have two solutions? For example, for , I could just , extract the root and end up with . Or, I could cancel the square root with the exponent, and end up with --Bumptump (talk) 01:44, 2 January 2022 (UTC)[reply]

The term "solution" does not apply, since there is no equation. There is a connection between square roots and equations: is a solution of the equation in the unknown . When , there are two solutions, but only one is (by definition) the square root of : the positive one. It follows that the absolute value of . So then There is no ambiguity of any kind. This assumes we are working in the world of real numbers. Some mathematicians treat the complex logarithm as a "multivalued function", which (depending on how one defines everything) may rub off on the square root function. Others find this unnecessarily confusing.  --Lambiam 02:32, 2 January 2022 (UTC)[reply]
So, if I have and , no one will see in general? Would any restriction, like make the composed functions equivalent? --Bumptump (talk) 14:13, 2 January 2022 (UTC)[reply]
If we're talking about real valued functions, then for all x, and for x ≥ 0 and undefined for x < 0. The functions agree for x ≥ 0, but the domains are different so they are different functions. If you want do as Lambiam suggested for complex valued functions, and talk about multivalued functions and branch cuts then it depends on what conventions you're using. But if you're using multivalued functions then and ; one is single valued and one is multi(two)valued so again, they are different functions. In general, composition of functions does not commute, but you can demonstrate that with much simpler functions. (I've used the convention that composition follows the reverse of the order the functions are evaluated. I've always thought that was somewhat counterintuitive but it seems to be the prevailing, but perhaps not the universal standard.) --RDBury (talk) 17:07, 2 January 2022 (UTC)[reply]
I too dislike function composition order, but we're stuck with it because of Path dependence.  Card Zero  (talk) 01:36, 3 January 2022 (UTC)[reply]
The ordering of the function operands is the same as they appear in stepwise application: So the "backwardness" starts already with the ordering in function application, which may derive from the grammatical ordering in Germanic languages. Leibniz used "eine Function von ", which Euler notated as If they had spoken Turkish and Gottfried Bey had used "'in bir fonksiyonu", Leonhard Bey might have used the notation and function composition could have been defined by  --Lambiam
I thought you might say that. :) I reserve the right to dislike it the other way round, also. Actually I hadn't anticipated as far as that comparison to the grammar of spoken languages. I wonder what the grammar would be in Polish?  Card Zero  (talk) 03:37, 3 January 2022 (UTC)[reply]
The same as in Łukasiewicz notation, "funkcją zmiennej ". So with Polish genitors we might have dropped some of the brackets but still be stuck with There is a reason why the reverse notation is called "reverse" (which is not that it is the notation in Reverse Polish). I could not use more generally "Indo-European grammar", though, because in Latin and Ancient Greek, for example, the order of possessor and possessee can freely vary.  --Lambiam 10:48, 3 January 2022 (UTC)[reply]

January 5

What is special about Cartesian coordinates?

In the context of Euclidean space, the Cartesian coordinate system seems special, even among orthogonal coordinate systems. For example, one can sum vectors by separately summing each component. My intuition is that this specialness is due to the Cartesian coordinate hypersurfaces being linear subspaces of Eulcidean space. Am I right? If so, is there a name for this property? -Amcbride (talk) 02:17, 5 January 2022 (UTC)[reply]

In any vector space with a basis one can add vectors by component-wise addition of their representations as coordinate vectors. The basis does not have to be formed by Cartesian-coordinate unit vectors (an orthonormal basis) or even be orthogonal. For a coordinate system based on any basis of a Euclidean space viewed as a vector space, not necessarily Cartesian, the coordinate hypersurfaces are again Euclidean spaces. The hyperbolic paraboloid is a non-Euclidean doubly ruled surface. One can impose a coordinate system in which the "rules" are the coordinate lines. So the implication <coordinate vector system describes Euclidean space> → <coordinate hypersurfaces are Euclidean> is one-way only.  --Lambiam 07:57, 5 January 2022 (UTC)[reply]
Thank you! I might understand. So are Cartesian coordinates the intersection of orthogonal coordinates and basis vector representations? -Amcbride (talk) 15:48, 5 January 2022 (UTC)[reply]