- 82
- 550 935
TheGrayCuber
Приєднався 19 тра 2012
Building with infinite polygons
This is a follow-up to my previous video about building points using regular polygons: ua-cam.com/video/-7UehYt2GnM/v-deo.htmlsi=vneHefALhBsIlCek
Переглядів: 1 969
Відео
What can be built using polygons?
Переглядів 31 тис.Місяць тому
This is a discussion of building sets of points using regular polygons, which applies cyclotomic polynomials to show what can be built. Follow-up about builds with infinite steps: ua-cam.com/video/r8ps4PDnPdw/v-deo.htmlsi=3ZfDNc48yVSh5bk4 A prior related video: ua-cam.com/video/b3G5Gi4suHs/v-deo.htmlsi=DrBFcIpVoTCYs_8d
Amusing Algebraic Animations
Переглядів 461Місяць тому
My prior video about these sets of points: ua-cam.com/video/UGDg9NdC5hM/v-deo.htmlsi=bhjA80wY01LB-7YD
Modifiers of Cyclotomic Polynomials
Переглядів 1,4 тис.2 місяці тому
Visualizing Cyclotomics: ua-cam.com/video/b3G5Gi4suHs/v-deo.htmlsi=dnHwLiLygN89ajM9 Visualizing Cyclotomics Part 2: ua-cam.com/video/D3KYA8wVWw0/v-deo.htmlsi=FfsHWXA6nP6XNt7M
Book-Themed Tableau Dashboard
Переглядів 1652 місяці тому
Link to the dashboard: public.tableau.com/app/profile/asher.gray/viz/DashboardofaNerdyGuy/FrontCover
Visualizing Cyclotomics Part 2 - Any Two Primes
Переглядів 6157 місяців тому
Previous video: ua-cam.com/video/b3G5Gi4suHs/v-deo.htmlsi=G0iis06rZNE1LTJO Follow-up video: ua-cam.com/video/UGDg9NdC5hM/v-deo.htmlsi=eezReqS-fd5AFnen
Visualizing Cyclotomic Polynomials
Переглядів 2,5 тис.7 місяців тому
This is about Cyclotomic Polynomials and an interesting way to view them visually. Part 2: ua-cam.com/video/D3KYA8wVWw0/v-deo.htmlsi=oeRoMLaKa7CuBhdx Another Follow-up: ua-cam.com/video/UGDg9NdC5hM/v-deo.htmlsi=eezReqS-fd5AFnen There are some unjustified jumps in logic within the video. I did that to keep the length down - a video that covers every detail would be less entertaining - but I do h...
Making Polyrhythms with Advanced Math
Переглядів 9457 місяців тому
This is an interesting method I found to create mathematical polyrhythms! For more about the math: ua-cam.com/video/b3G5Gi4suHs/v-deo.html
The Natural Logarithm of Novenonagintanongentillion
Переглядів 2,4 тис.9 місяців тому
Previous video: ua-cam.com/video/MjL1nOy7oFI/v-deo.html
Counting in a Complex Base
Переглядів 877Рік тому
Interactive Tool (Desktop Only): public.tableau.com/app/profile/asher.gray/viz/CountinginaComplexBase/Title Combo Class Video: ua-cam.com/video/MM0Sbfvf2Hw/v-deo.html
What is the Best Language for Math?
Переглядів 723Рік тому
hi :) Source for most languages: www.omniglot.com/index.htm Source for large Yoruba numbers: yorubanumeral.com.ng/ Previous Video: ua-cam.com/video/MjL1nOy7oFI/v-deo.html Google Sheet: docs.google.com/spreadsheets/d/1BCX70Xe_aVbxlK5_sbHPdVzT3f8RpqkyMP-qEqou-A0/edit?usp=sharing
Tetris Blindfolded 49 Line Clears
Переглядів 1,9 тис.Рік тому
Hi :) Below is a link with more information about major system. major-system.info/en/
Bro stopped the timer that many times to muscle memory the place of the stop button?!!
Wow, i just realized now that youre the really big blind solver, this is such a cool channel pivot, love this math/geometry stuff
15:18 the profile picture
Nice video. It's related to Centrifuge problem (Numberphile has a video with Hannah Fry explaining it).
I hit the like button too early in the video because now we're talking about building polynomials and I'm even more excited then before but don't have any way to easily express it; and thus have been forced to use the treacherous comment function.
tip: set playback speed to 1.5x
7:10 off center day ruined 😔 literally unwatch able. (Great video actually❤)
Go hyperlegible!!
en soweli sitelen!
1:16 You mean digon.
0:01 My guess: the points are evenly spaced in the sense that they consist of several sets of points, each of which is rotationally symmetrical. This also means that if these points had mass, the center of mass would be in the middle of the circle. I'm assuming this based on a video about balancing 7 tubes in a 12 slot centrifuge
Just to nitpick (or because I like edge cases) I think Phi_1(z) = z - 1 should be interpreted as the empty collection, i.e. not having any points at all. Since in this case z = 1, so so it's a positive and a negative point at position 1 cancelling each other out. (Btw, Phi_1 doesn't actually matter for the proof, since we're only building collections of ≥2 points. Really, the base case could just be the primes.)
Well y₀ for the final answer seems to only be because the process as defined is only countable. But that does not seem necessary. Suppose I say that for every time t, in [0, 1), I will add a digon at angle πt. This builds the whole uncountable circle. We need to update our definitions of convergence, though, to account for multiple infinities. It seems easy enough if we just want to change it into positive and negative cardinalities for the weights, disallowing when a point appears in the same cardinality of positive and negative steps. But if we want something more complicated like measure theory, I don’t know enough to design definitions for it.
i take issue with the 1-point build, its like saying the sine of infinity is 0 because thats where it starts
That build does not start with 1 point, nor does it have just the 1 point at any finite step. It results from that point being the only point with a coefficient that doesn't converge to 0
Another commenter stated "A buildable set must always have all points be partnered up with others such that the partner is a rational distance from the original." Why impose this arbitrary limit? If we allow non-rational rotation of polygon's points, and allow the removal of balanced, polygon-based subsets of points, wouldn't all centered sets of points be buildable using a potentially infinite number of shapes and point nullification?
i now notice the thumbnail in the top right of my screen stating "anything is buildable". lol
What's the name of your cat? 😺
His name is Tog!
This is so underrated
It seems like it would be possible to generalize this construction to uncountably-buildable sets by allowing uncountably many steps. Since the convergence of a point does not depend on the order of the steps, just the cardinality of the sets of positive and negative steps the point occurs in, this should not cause problems. Using this definition, I believe every set of points where each point has at most countable multiplicity (positive or negative) is uncountably-buildable (which I will use here in a sense that includes finitely- and countably-buildable). By partitioning the set into rational subcollections as in the previous video, you can use the technique from this video to build each one and take the union of their sets of steps, which cannot overlap on any points. This result cannot be extended to the case where points can have uncountable multiplicities. For instance, the point set that contains just 1 with uncountable multiplicity is not uncountably-buildable since by the pigeonhole principle, at least one other point a rational angle away from 1 would also need uncountable multiplicity.
Vigintillion un- dou- tre- quad- quin- sext- sep- oct- non- dec- btw ten douvigintillion is googol
No ten Doutrigintillion is googol
There are still irrational numbers that when summed they can be rational. Does that change how you define the I_p collection?
I heard the cat. Meow.
10:33 and maybe an 11-gon (shows 12-gon)
shhhhh my software didn’t have an 11-gon option and I didn’t want to manually make one
24:06 I think Answer is 3 points, because we can distribute points in such way that them will be in one half of circle
I dont think the reasoning at 6:42 works generally, because we could have more points at every step so it would not converge. For example for every point expect first make the negative version of it and 2 new points this way number points is strictly increasing so it cant converge to the first point.
I think that just depends on how convergence of the build is defined. If you require convergence of the number of points, then sure it doesn’t work. But if you just use convergence of each point itself, then it does. I used the second definition since the results are more interesting.
I did some study of base 1+i last fall. If you allow for p-adic values, the "infinite repeating ones" (...1111111) is equivalent to "i" and you can start from there and get a second interlocking spiral, rotated by 90 degrees, that completes the plane.
That is really cool! How does one demonstrate that …111 = i? Something like -1 = (…111)*(1+i) - (…111) ?
@@TheGrayCuber I worked out some carry rules of addition and subtraction i.e. how to move a '2' or '-1' upwards in the digits. Then you can show that ...222 is equal to 100 which is equal to 2i. It's similar to how ...999+1 equals 0 in normal 10-adics. The same carry rules can also show that 'any' integer can be written in base 1+i, thus proving completeness. Intrigued to learn that i-1 does not have that "bijection" problem though, maybe this will solve something for me
Keep in mind that Lego is *not* a term for a a type of product, that would be Klemmbausteine, and since are not using the product Lego you must not to refer to it as such, otherwise Lego will sue you. If you want more information on legal protection and Klemmbausteine you should check out the Held der Steine Inh. Thomas Panke
I don’t think I understand how it’s possible that an infinite sequence of steps that don’t change the average of all the points can result in something that has a different average. If I have an average score of 0 and (don’t) turn in infinite tests that each scored 0 points, how does my grade go up? I just don’t get how you can construct the single point even after infinitely many steps. If there are infinitely many steps than you’ve never actually completed the construction, and if we assume you’re at the end of the infinite construction after a series of infinite steps that all increased the number of points while maintaining a zero average, then there are infinitely many points spread around the circle. Just because one of those points was there the whole time doesn’t mean any of the following points don’t exist. Also why can’t you just define the empty collection of points as being centered? Logically speaking if there are no points on the circle then the average is at the center. I know mathematically there are divide by zero issues when calculating the average of nothing but if a finitely buildable construction is centered then adding and removing a polygon as a 2 step construction must be centered…
This is a complication that comes up any time you want to do an infinite number of steps of some process. With normal inductive reasoning, you can say, "It's centered if you do one step, and whenever it's centered, it'll remain centered after one more step, so it'll be centered after any finite number of steps." But with infinite sequences, you need an additional base case "at infinity", because induction can never reach infinity. Consider intersections of open intervals. For any open interval (a,b), its intersection with another open interval, will also be an open interval. But if you take the intersection of the infinite collection {(-1/n, 1/n) for all natural numbers n}, you'll find that the only point in all of them is 0, and so the total intersection is just the singleton set containing 0--distinctly no longer an open interval!
To more directly answer your question: the way the infinite constructions are defined was carefully chosen such that it "looks finite up close". That is, if you zoom in on any point, you will only ever see that point being affected finitely many times. So although naively you would never actually complete the construction, you can pick any point on the entire circle and see that point completed after only finitely many steps. What the result then ends up being, is the collection of whatever coefficients the individual points settle at. Under the given construction, we see infinitely many points added and infinitely many points removed, yes, but since every point but the one is either not affected at all, or added exactly once and removed exactly once, we have that the final collection is just the single point; everything else cancels.
I do consider the empty set to be centered. Yes, there is divide by 0 problems, but I usually think of centeredness as summing to the center, not averaging to the center. I just decided to use averaging for the video since it is a little more straightforward and the empty case was uninteresting enough to leave out.
10:31 I don’t think there’s any need to check whether you’d hit a point you’ve already used in this way. You could probably just get away with using the next prime every step.
That may work in some cases, but it can cause problems in others. Let p(n) be the nth prime, and t(n) be the nth triangle number. Set each a_i to be 1/(p(t(i-1)+1)) of the circumfernce. Always picking the next prime with this set of points will result in a conditional point at 0 of the circumference.
N=5 is the Minimum number of Points for a non buildable collection brause N=1 does Not Work AS Seen in the Video N=2 call the Points A=(1,0) (roate if requierd) given It is centerd B has to bee (-1,0) thus it is constructeble N=3 Let A =(1,0 ) -> B=(bx.by) C=(cx cy) With by+cy=0 and bx +by=1 -> by= -cy =y Given B,C are on the circle WE get that bx= +-sqrt(1-y^2) =x and the Same for cx Obviusly cx hav to have the Same sign in oder to add Not add to Zero and x=-1/2 else they would Not add to one -> B=(-1/2, sqrt(3/4)) similar for C Thus all cases are perfekt triangels this buildable. N=4 similar results in only perfekt rectangels. All of them are buildable As a Set of two balanced points. And N=5 is possible as shown by the example in the Video.
Alright, here's my reasoning as to why uncountable collections are not infinitely-buildable: 1. an uncountable set cannot be mapped to a countable set 2. For any infinitely-buildable collection, we can map each point to the step it was first added 3. There are always a countable number of steps since they are integers and the integers are countable 4. Since an uncountable set cannot be mapped to a countable set, and we can map all infinetly-buildable collections to a countable set, all infinitely-buildable collections must be countable
This is great! There is one extra step we should take though: we want the mapping to be one-to-one, but if two points were introduced in the same step then they’ll be mapped to the same integer. But this is a short fix using the fact that there are only countably many ordered pairs of integers
I love this idea, it's nice to see you decided to make a second part going more in depth on it!
The reason they're not symmetrical is because you're not using all of the points.
That is correct. I made these to look at the behavior of specific subsets of points.
Yes. There's a non-bailable centered collection. Consider putting two vertical lines πr/4 from the centre where r is the radius. The dots from intersection are centered, but not buildable
That collection will form a rectangle, so we can build it using two pairs of opposite points.
@@TheGrayCuber but how one could go about getting those non-algebraic coordinates?
Oh I am so eager to investigate centered collections on the surface of a sphere! Trivially all of the properties of centered collection in 2D generalize to 3D, but I don't have any intuition about what more interesting configurations might exist!
This channel is gold
galois theory, done in a way a highschooler can understand. amazingly well done!
So we have seen that the roots of cyclotomic polynomials can get you any rational/buildable collection. if we allow ourselves to use the roots of any (integer) polynomial can we then make any centered collection? Or are there even transcendental collections??
I love this ! Allowing for negative points seems like it makes this a vector space over R/2piR ? or R/4piR ? idk
I'm having trouble with "remove the triangle of points". Removing is not the same as adding, and can skew the results.
If you begin with a collection of points that sum to 0, and remove points that also sum to 0, the sum of the result must be 0 - 0 = 0. In order to do this, we either need to require that the removed points already existed in the beginning set, or otherwise allow ‘negative’ points, but either of these conditions will allow subtraction as a valid operation
@@TheGrayCuber I went back and looked at your example. The issue that was bothering me was the line was no longer centered. None of the polygons are individually centered anymore, but the collection as a whole is. It just messes with your brain visually.
nice song
This is so amazing, it let me wondering if there is such a way to make all the contructible shapes instead of regular polygons, maybe that could give some insight into transcendental numbers.
It's all about how to balance a centrifuge.
3 points can only be balanced im almost sure. as for 4, i suspect not, and it probably has something to do with not being able to find an equation for a polynomial of degree 5. you need to be able to "split" the points of either a line or a triangle in a way that i dont think you can do
3 points can easiely not be balanced. Place all 3 near the top of the circle and it doesn’t work for example
Those collections you chose study are neat, the questions you posed quite interesting, and your investigation intellectually satisfying.
I'll wait and watch this channel boom in 2 years
as a programmer it kinda stuck out to me that the "negative" points or polygons could be nicely replaced by a XOR (addition modulo 2) operation, so when two points match, 1 XOR 1 = 0
That would handle a negative meeting a positive, but it only allows one point at each location. I intentionally called these ‘collections’ instead of sets to allow for duplicate points. There doesn’t technically need to be negative points - they could just be rotated 180 degrees to become positive, but I found it easier for visualization to have a negative and positive point at the same spot cancel as opposed to having two opposite positive points which get removed by subtracting a 2-gon
@@TheGrayCuber oh yeah, getting rid of a point that, for example, a 2gon and a 3gon would share would uncenter the resulting collection
@@TheGrayCuber The formal term you are looking for to describe the concept is a multiset. But yes, describing them vaguely as "collections" is perfectly fine for the purposes of this video.
Thank you, that is great to know!
There’s actually many irrational collections that are buildable. For instance, two lines, one rotated 1/sqrt(5) of the circle away from the other, form a clearly buildable, yet irrational collection. This works because for any p and I sub p you can pick, its average contains the opposite point, and so works out to be the center.
Yes, this is a great point! I think ‘most’ buildable collections are irrational. Assuming finite points and equivalence up to rotation, there is a countable amount of rational buildable collections. But even just considering 4-points irrational buildables as you pointed out - there are an uncountable amount.
What was proved around 7-8 minutes in is that it's impossible to have a buildable set of points with a point that has no other point a rational portion away from it. A buildable set must always have all points be partnered up with others such that the partner is a rational distance from the original. However, there can absolutely be sets of points that are buildable where there are points an irrational distance apart. The simplest example is the two opposite-point pairs which are irrational distances apart. I believe that a buildable set must have all rational closures (sets of points that are all rational distances apart) are centered, although arbitrary unions are possible from there. The converse (edit: watched more of the video) can also be proven (that all such sets are centered).
@@minamagdy4126 true, though that’s not what was said. I’m just clarifying.
1 isn't possible cause it's not centred 2 isn't possible because any deviation from the opposite positions isn't centred 3 isnt' possible because any deviation from the equilateral triangle isn't centred 4 may have the necessary degrees of freedom, but I cannot produce a counter-example, starting from an arbitrary 3 point collection that doesn't contain a pair in opposition generates a balancing point off the circle. I don't believe 4 points is possible either but I can't prove it. There may be a pathological singular counter example I cannot think of. 5 is the first arrangement where there is definitively the necessary degrees of freedom and you can generate an infinite number of counter examples. Start with a point at (0,1) and then for every point (x,y) there's another point (-x,y) for every point (p,q) where q<0 along with (-p,q) there exists a pair of points (r,s), (-r,s) that balances out the collection, x is always balanced by virtue of each point having it's mirror in the y axis (or lying on the y axis) while y can be balanced because of the degrees of freedom offered to the pair of points (r,s), (-r,s)
i think 4 is always 2 pairs of opposite points
For the problem of 4 points, it helps to fix one of the points as some p. This reduces the problem to finding three points that sum to -p with none of them being -p, or otherwise showing that this is impossible.
1st point can be fixed at 1 without loss of generality
@@TheGrayCuber Draw a circle centred at O with unit radius, point A at (1,0), for point B on the circle (not A') move point C around the circle and plot the possible locations for D (as the result of O-(a+b+c) where a, b, c are the vectors to A, B, C). The result is a ghost circle which intersects the unit circle at A' and B', when D is at A' then C is at B' and vice versa. I can show this result through trial and error I just have difficulty proving it (I last did proofs 15 years ago) and this doesn't fully prove no pathological cases exist.
4 has to be a rectangle, which is obviously buildable: Choose 2 of the points arbitrarily. Assume WLOG that they are not opposites (if no such pair exists, it is clearly buildable). Rotate the circle (with center at 0) in the complex plane, so one point is the complex conjugate of the other. Now, for it to be centered, the two remaining points must also form a conjugate pair (otherwise, the average would not have a 0i component). Furthermore, their real part must be negative the real part of the first pair (since both pairs are conjugate pairs, and the average of their real parts must be 0 to be centered). Since the second pair must lie on the circle, they only have one valid pair of positions with this real value, which forms a rectangle with the first pair.
Wait a second ... THIS IS VERY COOL!!!
bless this channel, did you find this yourself?
Yeah! The division property and indentity formulas of cyclotomics are well known, but this problem of building collections of points is something I thought of
Thank you for sharing your research
This is so interesting!