Hartogs' Theorem states: If $X$ is a set, then there is an ordinal $\alpha$ such that there is no injection from $\alpha$ to $X$. The proof I am familiar with uses unique representation of wellorders by ordinals, which in turn requires the Axiom Scheme of Replacement. How do you prove the following without using Replacement or the Axiom of Choice?     For every set there is a wellorder such that there is no injection from the wellorder to the set.   I had the idea to separate from $\{X\}\times \mathcal P(X \times X)$ the set of all wellorders on $X$ and then to extend this wellorder, but as far as I understand, without the Axiom of Choice we do not know whether there even exists a wellorder on $X$.
I want to build an uncountable well-ordered set within the theory $Z^\textbf-$. So, I take $A=\omega$ (exists by infinity axiom) and define $$W:=\{(X,R)\in\mathcal{P}(A)\times\mathcal{P}(A\times A):\langle X,R\rangle\ \text{is a well-ordered set}\}$$  With this I consider the set $T:=W/\cong$ (where $\cong$ is isomorphism relation). Note that $W$ and $T$ are sets by power set axiom. So I define for each equivalence class $[x],[y]\in T$ the order  $$ [x]\leq_T[y]\Leftrightarrow \text{type}(x, R_x)\leq \text{type}(y,R_y) $$  Here, $R_x$ means the order of $x$ that make it belongs to $[x]$.   So, $T$ is well ordered by $\leq_T$ and it is uncountable.  Question: I don't pretty sure if I can build $\leq_ T$ without replacement axiom. Another doubt is, Can I take the $R_x$ without AC?
I used the prcomp() function to perform a PCA (principal component analysis) in R. However, there's a bug in that function such that the na.action parameter does not work. ; two users there offered two different ways of dealing with NA values. However, the problem with both solutions is that when there is an NA value, that row is dropped and not considered in the PCA analysis. My real data set is a matrix of 100 x 100 and I do not want to lose a whole row just because it contains a single NA value.  The following example shows that the prcomp() function does not return any principal components for row 5 as it contains a NA value.  d       &lt;- data.frame(V1 = sample(1:100, 10), V2 = sample(1:100, 10),                        V3 = sample(1:100, 10)) result  &lt;- prcomp(d, center = TRUE, scale = TRUE, na.action = na.omit) result$x                                # $ d$V1[5] &lt;- NA                           # $ result  &lt;- prcomp(~V1+V2, data=d, center = TRUE, scale = TRUE, na.action = na.omit) result$x   I was wondering if I can set the NA values to a specific numerical value when center and scale are set to TRUE so that the prcomp() function works and does not remove rows containing NA's, but also does not influence the outcome of the PCA analysis.  I thought about replacing NA values with the median value across a single column, or with a value very close to 0. However, I am not sure how that influences the PCA analysis.  Can anybody think of a good way of solving that problem? I want to run a daily incremental backup and append the day of the week to the file name so I end up with:  backup_mon.bak backup_tue.bak  etc.  Not really bothered about what exactly is appended - 0 - 6 is fine.  How do I go about this? When getting a new credit card, what is the policy in regards to signing the strip on the back? Should I sign it? Should I write "See ID"? Should I leave it blank? Should I sign it AND write "See ID"?   I see all sorts of different advice but it seems like it's all based on urban legends, hearsay, or self interest (merchants and banks seem to advise you to do what's best for them, not what's best for the customer).  My question: For an average everyday consumer who uses a card fairly frequently, what is the best practice? What practice is most secure? Does commutativity imply associativity? I'm asking this because I was trying to think of structures that are commutative but non-associative but couldn't come up with any. Are there any such examples?  NOTE: I wasn't sure how to tag this so feel free to retag it. Allowing line break at ',' in inline math mode? In the inline math mode ($...$), if the formula is too long, LaTeX will try to break it on operators, e.g.  very long text followed by a very long equation like $a+b+c+d+e+f+g+h+i+j+k+l$ etc   may be rendered as  very long text followed by a very long equation like a+b+c+d+e+f+g+h+i+ j+k+l etc   However, the break won't happen if they are separated by commas, e.g.  very long text followed by a very long equation like $a,b,c,d,e,f,g,h,i,j,k,l$ etc   will overflow the page like  very long text followed by a very long equation like a,b,c,d,e,f,g,h,i,j,k,l etc   How to make LaTeX able to insert line breaks after a comma too? Getting always extra button on display .. 1 button dont have any ID I am having problem while looping.  I am always getting an extra button. Please help.   {this.state.items.map(myitems1 =&gt; {     return (        &lt;div key={myitems1.Id}&gt;            &lt;span&gt;{myitems1.Item_x0020_Name}&lt;/span&gt;            &lt;button onClick={e =&gt; this.dosometing(myitems1.Id)}&gt;Offline&lt;/button&gt;        &lt;/div&gt;     ); })}   I can see the collection has only three (3) values, But I am getting 4 buttons on screen.   Getting always extra Fighting Spam - What can I do as an: Email Administrator, Domain Owner, or User? This is a  about Fighting Spam.   Also related:                    There are so many techniques and so much to know about fighting SPAM. What widely used techniques and technologies are available to Administrator, Domain Owners, and End Users to help keep the junk out of our inboxes?  We're looking for an answer that covers different tech from various angles. The accepted answer should include a variety of technologies (eg SPF/SenderID, DomainKeys/DKIM, Graylisting, DNS RBLs, Reputation Services, Filtering Software [SpamAssassin, etc]); best practices (eg mail on Port 25 should never be allowed to relay, Port 587 should be used; etc), terminology (eg, Open Relay, Backscatter, MSA/MTA/MUA, Spam/Ham), and possibly other techniques. $\\$   A normal subgroup $N$ is a subgroup where the left cosets are the same as the right cosets. $N$ is normal $\iff $ $xnx^{-1} \in N,  \forall x\in G$.   5.) Why is it that if $[G:H]=2 \implies $ $H$ is normal subgroup?  6.) Can we say that a factor group is just a group that has left cosets of $N$ (being a normal subgroup) as its elements? So if $N$ is a normal subgroup, then the left cosets of $N$ forms a group under coset multiplication given by $aNbN = abN$.   7.) The group of left cosets of $N$ in $G$ is called the factor group, why do we denote this by $G/N$? These are the same things as the integers modulo $n$ groups? How can I relate those exactly? I am trying to filter items with a stored procedure using like. The column is a varchar(15). The items I am trying to filter have square brackets in the name.  For example:  WC[R]S123456.  If I do a LIKE 'WC[R]S123456' it will not return anything.  I found some information on using the ESCAPE keyword with LIKE but I do not understand how to use it to treat the square brackets as a regular string. How to remove Apple System Apps How can I delete Apple OS X application such as Photos, iPhoto, and others that I never use? Is it worth cleaning the registry? I have heard that you should keep the registry clean on Windows. Is this actually important or is it just myth? Source shell script automatically in terminal How can I automatically source a particular shell script when I open a terminal window by right clicking somewhere and choosing "open in terminal"?  For example, every time I open a terminal I need to run the following command line:  source myscript   How can I make it so that I don't have to type this automatically?  My script is written in tsch:  #!/bin/tcsh setenv DISPLAY 127.0.0.1:10.0 cd /ast/dcm/data   I'm using CentOS 7. Understanding hard drive space How to start Ubuntu in Console mode I want to know if there is a way to switch to console mode from the boot menu.  I have an NVIDIA 1070 and every time there is an update, the GUI stops working. All I need to do is re-install the drivers; however, to do that I need to be in console mode. EDIT: I should have added more information to this question but I'll comment on all answers. In short: I've tried text instead of quiet splash I do see booting activity in text mode; however, I don't get a login screen and ctrl + Alt + F1 doesn't help because GDM keeps trying to restart. Previously I managed to kill GDM through multiple tries but is not working since the latest update. EDIT: After searching for runlevel, I've found  but I think it required me to have a running system to make changes -- please correct me if I'm wrong. I am a little bit confused by early stopping and in particular by how it can be inserted inside a CV framework. As far as I understand, I can fix the optimal number of epochs (for NN, or number of trees for XGB) by early stopping, that is:   pick a validation set, train with increasing number of epochs until a predefined metric evaluated on the validation set starts worsening that is the optimal number of epochs to prevent overfitting   and that's fine. But then I would like to insert this early stopping framework inside a CV framework: Suppose I have a model with 10 hyperparameters I want to fix via CV. And suppose that there is an eleventh hyperparameter, the number of epochs. My feeling is that one can do like this:   create the K resampled folds, for each of which you have a training and validation set choose a suitable grid for your 10 hyperparameters for each point on the grid train your model in each fold with early stopping, that is use the validation set of the fold to keep track of the preferred metric and stop when it gets worse take the mean of the K validation metric choose the point of the grid (i.e. the set of hyperparameters) that gives the best metric   Questions:   What number of epochs should I choose as optimal? in each of the K folds I have, in general, a different number of stopping epochs.  seems to suggest they take the mean of the K stopping epochs. Is this right? Is it actually a "fair" practice to use the validation metric coming from the early stopping as a proxy of the out-of-sample metric? As  in section 3.4.5, maybe the best thing to do would be:     ...if you want to do early stopping, then in each fold you should take your training set and split it again, holding out a small early-stopping-set to guide the early stopping, and then evaluate the model on the validation set of that fold.   But this seems to me a really intricate process...   Unfortunately, I wasn't able to find references where this issue is presented in a clear and transparent form. Why is the amount of photos that fit on one card dependent on ISO? WSOD after migrating to another site? Troubleshooting a site migration How can I attach a file to a post? I want to attach some files to a post on one of Stack Exchange sites. What is the best way to do this? A local IP address (RFC 1918) on my network that is not … local I've noticed an IP address today on my network (192.168.15.1) which when visited actually goes to a page that has a router webconfig page (Not my router)  The puzzling thing is that i tried traceroute 192.168.15.1 which said that the distance between me and that host is 9 hops, whereas the distance between me and any other computer on my home network is 2 hops away (My computer --> Router --> Host)   Can someone please explain what's going on here ?  tracert output:  Tracing route to 192.168.15.1 over a maximum of 30 hops    1    &lt;1 ms    &lt;1 ms    &lt;1 ms  192.168.1.1   2    47 ms    51 ms    49 ms  [163.121.171.123]   3     *        *        *     Request timed out.   4   128 ms     *        *     163.121.211.134.dnet.net [163.121.211.134 ]   5     *      134 ms   126 ms  10.37.242.18   6    94 ms    90 ms    95 ms  10.35.2.157   7   178 ms   254 ms   206 ms  10.32.8.107   8    85 ms    57 ms   318 ms  10.35.0.186   9   215 ms   241 ms   230 ms  192.168.15.1  Trace complete. How to extract the n-th elements from a list of tuples?