Is there a simple geometric proof that there exists a continuous bijective function between a square and its side?    And is there some explicit continuous function or formula $f^1(z)\mapsto (x,y)$ and $f(x,y)\mapsto z$, with $(x,y) \in [0,1]\times[0,1]$ and $z \in [0,1]$?  And is there a constructive proof that two sets of the same cardinality have a bijective function?
Is there a continuous bijection from $[0,1]$ onto $[0,1] \times [0,1]$? That is with $I=[0,1]$ and $S=[0,1] \times [0,1]$, is there a continuous bijection $$ f: I \to S? $$  I know there is a continuous bijection $g:C \to I$ from the Cantor set $C$ to $[0,1]$. The square $S$ is compact so there is a continuous function  $$ h: C \to S. $$ But this leads nowhere. Is there a way to construct such an $f$?  I ask because I have a continuous functional $F:S \to \mathbb R$. For numerical reason, I would like to convert it into the functional $$ G: I \to \mathbb R, \\ G = F \circ f , $$ so that $G$ is continuous.
How to number and cross-reference \subsubsection-level headers Why do we care about eigenvalues of graphs?  Of course, any novel question in mathematics is interesting, but there is an entire discipline of mathematics devoted to studying these eigenvalues, so they must be important.  I always assumed that spectral graph theory extends graph theory by providing tools to prove things we couldn't otherwise, somewhat like how representation theory extends finite group theory.  But most results I see in spectral graph theory seem to concern eigenvalues  not as means to an end, but as objects of interest in their own right.  I also considered practical value as motivation, e.g. using a given set of eigenvalues to put bounds on essential properties of graphs, such as maximum vertex degree.  But I can't imagine a situation in which I would have access to a graph's eigenvalues before I would know much more elementary information like maximum vertex degree.  (EDIT: for example, dtldarek points out that $\lambda_2$ is related to diameter, but then why would we need $\lambda_2$ when we already have diameter?  Is this somehow conceptually beneficial?)     So, what is the meaning of graph spectra intuitively?  And for what practical purposes are they used?  Why is finding the eigenvalues of a graph's adjacency/Laplacian matrices more than just a novel problem? Problems with \pgfplotstableread and relative paths How do I set environment variables from Java? Is there a way to preserve a weapon in Magicka within a saved multiplayer game Can I install Kali tools on Ubuntu? I've been through the Windows 10 upgrade, and am experiencing a recurring "INTERNAL_POWER_ERROR", which is stopping me from logging in.  I'd like to be able to try to boot to safe mode, but it appears that pressing F8 during boot is no longer enough, so how can I boot in safe mode (or any of the other recovery options) on a Windows 10 PC that doesn't let me log on? Why are my SVG imports so small? I'm definitely a newbie with blender still, as I've dipped my toe in a bit being a video editor.  My issue is importing .svg saved from illustrator.  Just simple vectors with not too many paths.  Just a thick text company logo.  I want to bring in and extrude, light, etc.  I've done it before in older versions of blender with no problem.  Am I not doing something right? Can someone tell me how to get an eps saved as an svg from illustrator to size correctly? One of the biggest issue with cluster analysis is that we may happen to have to derive different conclusion when base on different clustering methods used  (including different linkage methods in hierarchical clustering).  I would like to know your opinion on this - which method will you select, and how. One might say "the best method of clustering is which gives you the right answer"; but I may question in response that cluster analysis is supposed to be an unsupervised technique - so how do I know which method or linkage is the right answer?  In general: is a clustering alone robust enough to rely on? Or we need a second method and get a shared result to be based on both?  My question is not only about possible ways to validate / evaluate clustering performance, but is broader - on what basis do we select/prefer one clustering method/algorithm over another one. Also, is there common warnings that we should look around when we are selecting a method to cluster our data?  I know that it is very general question and very difficult to answer. I only would like to know if you have any comment or any advise or any suggestion for me to learn more about this. As mentioned on :     For something that can be done so   easily by accident, there should be   the ability to undo mistakes.   I know that I have clicked several times on a comment up-vote without actually wanting to.  I would suggest being able to cancel the up-vote (maybe only for a couple of minutes or even less than a minute, no problem, as long as I can undo a miss-click). Custom pagebreak in align equation Worldwide Dissertation Database? or French, German, Italian ones? Is there a global/worldwide database of dissertations? If not, how can I access French, German, Italian, etc. dissertations online? How can we sum up $\sin$ and $\cos$ series when the angles are in arithmetic progression? For example here is the sum of $\cos$ series:  $$\sum_{k=0}^{n-1}\cos (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \cos \biggl( \frac{ 2 a + (n-1)\cdot d}{2}\biggr)$$  There is a slight difference in case of $\sin$, which is: $$\sum_{k=0}^{n-1}\sin (a+k \cdot d) =\frac{\sin(n \times \frac{d}{2})}{\sin ( \frac{d}{2} )} \times \sin\biggl( \frac{2  a + (n-1)\cdot d}{2}\biggr)$$   How do we prove the above two identities? Convert generic List/Enumerable to DataTable? I have few methods that returns different Generic Lists.   Exists in .net any class static method or whatever to convert any list into a datatable? The only thing that i can imagine is use Reflection to do this.  IF i have this:  List&lt;Whatever&gt; whatever = new List&lt;Whatever&gt;();   (This next code doesn't work of course, but i would like to have the possibility of:  DataTable dt = (DataTable) whatever; It looks as if the 10k-tools flagged post list is b0rken.  Next to the review link in the toolbar there is a flag counter showing there are 10 flags to be reviewed:    Clicking on that flag counter leads to an empty page:        The moment I visit that page (through clicking on the flags counter, or by going to the review queue first then clicking on Tools, selecting the flags tab if not already selected), the flags counter disappears from the toolbar:    but after a while (half an hour, an hour?) the flag count re-appears in the toolbar.  Either the counter is wrong (presumably taken from a Redis cache somewhere) or the 10k flag review page is falling over every time someone tries to load it.  This at first appeared to happen only on Meta, on Stack Overflow the flags page has plenty to review. However, there are now  on Stack Overflow. Let $\Omega=\mathbb{N}$. For each $E\subset\Omega$ let $N_n(E)$ be the cardinality of the set $E\cap \{1,2,\ldots,n\}$. Define $C=\left\{E: \lim_{n\rightarrow \infty} \frac{N_n(E)}{n} \text{ exists}\right\}$. Show that $C$ isn't a field.  I already know that it isn't closed to finite union of non-disjoint set but I can't see why. I saw a post that somebody said &quot;the set of natural numbers whose first digit is 1 doesn't have this limit&quot;. I'm in trouble to see why this limit wouldn't exists in finite unions. Thanks in advance. Let $x_1,...,x_n$ be distinct integers. Prove that  $$\prod_{i&lt;j} \frac{x_i-x_j}{i-j}\in \mathbb Z$$   I know there is a solution using determinant of a matrix, but I can't remember it now. Any help will be appreciated. "going to do" vs. "going to be doing" Note: this post is different to , which just cites part from somewhere else, without any further analysis and thinking. Furthermore, none of the answers to that post answers my question - the situations where &quot;will (going to) be doing&quot; is more appropriate.   I will be participating in IELTS test next Tuesday afternoon.  In an online class, the teacher says the following at the beginning of the lesson.  I will be using NotePod (pointed out by red rectangle) to write relevant points we talk about today.   I guess &quot;will be using&quot; is more appropriate than &quot;will use&quot; there, right?  A  explains  This &quot;tense&quot; is used for reporting a scheduled activity with special focus on its timing— as if one is standing in the future and experiencing the flow of the time. The focus is on the temporary, ongoing, or repetitive nature of the activity.   I understand the grammar rules of those verb tenses and the difference between this group  I am going to drive home tomorrow.   I am going to be driving home tomorrow.  The former is just convey my activity in the near future while the latter probably makes an implication that &quot;don't disturb me as I am driving in that time&quot; However, in the following situations, I don't see the difference between 2 verb tenses.  Welcome back to this class. Today's lesson is for the IELTS students who are going to be taking the IELTS test. it's for everybody to be honest with you. this lesson is useful for anybody who needs to do some writing.   who are going to take the IELTS test ... So I tried a few different answers that I found here, and I feel that this is possibly a duplicate question, but everything I have tried from the other solutions hasn't worked.  Basically I am trying to bake a material to a texture that will be used in Unity, but every test gives me a black background image.  In the image below, the top image texture is the mask (black and white, white being the leaves), and the bottom image texture is the colour. "Baggage" versus "luggage" I have the feeling that luggage is more closely associated with vacation travel, whereas baggage is for general transportation.  Or... are they just exact synonyms?