# Sandbox for drafts of long, complex posts

This sandbox is intended for saving drafts of long, complex posts, especially posts whose composition takes a long time. It serves to localize to one thread the front-page "bumps" caused by edits to drafts of such posts, so that they may be easily ignored. Also, it helps to guard against losing longly-composed posts due to system crashes.

When you are happy with your draft here, you may simply copy the code and paste it to the desired location.

## Proper Use of the Sandbox

1. Do not post a new answer! We wish all the answers on this page to be owned by the Community user (so that only a non-sentient bot is informed of edits to these answers). Posting a new answer will make you the owner, meaning that you will be notified whenever another user makes an edit to that answer.

The sandbox has been "wiki locked" to prevent the creation of new answers. There are more than enough existing answers for users to edit over, and this will greatly reduce the frequency at which we request that the answers be disassociated from specific users.

2. Do not delete answers! Deleting seems like a reasonable option, but there are no "hard deletions" on Stack Exchange, and users with sufficient privileges will still see your supposedly deleted postings. Deleted answers will be undeleted and cleared for the use of others.

3. Do look for an answer which indicates that it is free and then edit it to your heart's content. If none appears available, take over the one that has been left unchanged the longest (which will appear at the bottom of the page if you order answers by "activity").

4. Do not expect your draft to remain untouched for days. There are no guarantees that your draft will be the latest revision if you return days later. While users will try not to step over others' toes, it may happen that an unfinished draft is edited out. Your draft will, however, still exist as a revision of the answer it was made in. If your drafting is expected to take place over a longer period of time, either

• take note of the URL of the answer provided by clicking the share button, or
• save a copy of your draft locally (or even "in the cloud").
5. Do clear your draft when you are finished. This includes removing all $\LaTeX$ from your answers. Replacing all code with a simple statement like

This answer is free for anyone to use

is sufficient. Periodically users may go through and free up answer slots that have not been edited in, say, over one month. But you can aid in the smooth running of this sandbox by clearing away your drafts when you are finished with them.

6. Do not "claim" multiple answers concurrently. Since this post is closed, the answers are a limited resource. If you really must compose several long, complex posts at the same time, you can still use a single answer, separating the different drafts using Markup: horizontal rules (---) and/or headings (# Header 1 #) are natural choices.

7. Do not create new such sandboxes. The point of having a unique such sandbox is that it minimizes the noise on the front page when the sandbox is edited. If there were multiple sandboxes they will frequently occupy numerous front page slots, pushing other topics off the front page, and increasing noise.

• I have added a [sandbox] tag to allow people ignore it more easily (via software support of ignoring tags), and since it seems that we have two sandboxes now, a tag may seem a bit more in place here.
– Asaf Karagila Mod
Jul 18, 2012 at 8:35
• (+1) For thinking outside the (sand)box. Jul 18, 2012 at 19:40
• At the suggestion of the moderators, I have gone and changed the associated owners of all the answers here to the Community user. This way, the original owners will not receive excess pings for each time another user uses the draft space for their work. Enjoy!
– Grace Note StaffMod
Oct 5, 2012 at 14:45
• To prevent crashes I've found the "Bookmarks to disable/enable MathJax", provided in here, pretty useful.
– leo
Dec 17, 2012 at 18:03
• PSA: Between the creation of this sandbox (in July 2012) and today (December 2015), technology has advanced. Something like StackEdit (or others, it's simply the only one I know) essentially solves all the limitations of this sandbox. You can have multiple concurrent drafts, you don't have to worry about polluting meta's front page, you can leave your draft untouched for days and expect it to still be there, you don't have to explicitly clear up your draft when you're done... Maybe someday we can get rid of this outdated crutch. Dec 2, 2015 at 14:07

This answer is free for anyone to use.

As @CyclotomicField said in his/her comment, there is a lot of nice structures and patterns, which makes the problem so sweet ;-) You might see the problem when following the idea of your table a bit further. However, while you count the number of "odd steps + even steps" First, I include negative numbers as well, and for your "number of steps" I use "exponent of 2" ($$=A_{1,r}$$ where $$r$$ idexes the row-number) such that $$w_{1,r} = 3 \cdot a_{1,r} + 1$$, then $$a_{2,r} = w_{1,k}/2^{A_{1,r}}$$ where $$A_{1,r}$$ is such that the next step becomes odd. And so on. A short image from an Excel sheet, where I've colored the $$A_{c,r}$$ for $$a_{1,r} = -21 \ldots +21$$ looks like this

1. $$x(g):(0,1)\mapsto[0,1]$$
2. $$x(1^-)=\sqrt{b^2+2b}-b>0$$
3. $$x'(1^-)=b\frac{\sqrt{b^2+2b}-b}{\sqrt{b^2+2b}+a}>0$$
4. $$x''(1^-)=-\frac{(x'(1^-)+2b)x'(1^-)}{\sqrt{b^2+2b}+2a}<0$$
5. $$a(1-g)x'=0.5x^2+bg(x-1)$$
6. $$2a(1-g)x'=(x-bg)^2-(bg+1)^2+1$$
7. $$x=-bg+\sqrt{(bg)^2+2bg+2a(1-g)x'}$$
8. $$-\frac{bg}{a(1-g)}\leq x'\leq\frac1{2a(1-g)}$$
9. $$x((x')^{-1}(0))=\sqrt{(bg)^2+2bg}-bg\in(0,1)$$
10. $$a(1-g)x''=(x+a+bg)x'+b(x-1)$$
11. $$a(1-g)x'''=(x+2a+bg)x''+(x'+2b)x'$$
12. $$x''((x')^{-1}(0))=b\frac{\sqrt{(bg)^2+2bg}-bg-1}{a(1-g)}<0$$
13. $$x'((x'')^{-1}(0))=b\frac{1-x((x'')^{-1}(0))}{x((x'')^{-1}(0))+a+b(x'')^{-1}(0)}>0$$
14. $$x'(x^{-1}(1))=\frac1{2a(1-x^{-1}(1))}>0$$ $$\begin{eqnarray} x'(x^{-1}(1))>0&\quad x^{-1}(1)\;\text{DNE even if}\\ x'((x'')^{-1}(0))>0&\quad\text{we assume an}\\ 1\text{ is a maximum of }x&\quad\text{inflexion point DNE} \end{eqnarray}$$

(in T.Tao's Blog )

You can use Ellison’s estimate, $$|2^x-3^y| \geq 2^x e^{-x/10}\qquad ,$$ $$\hspace{ 150 pt}$$ which holds for $$x \geq 12$$ with $$x \neq 13, 14, 16, 19, 27$$ and all $$y$$.

This is based on results by Pillai and Baker.

Reference: “WJ Ellison, On a theorem of S. Sivasankaranarayana Pillai, S´eminaire de th´eorie des nombres de Bordeaux, 1970 (1971), pp. 1–10.”

I don't have a proof, but you may observe the following sparsity of $$y$$ for increasing $$x$$.

Rewrite your equation into $$3^x = { p^y-1 \over 2 }$$ Then, in the rhs to have $$3^x$$ as a factor, for most $$p$$ we must have $$y=2 \cdot 3^{x-1} \cdot u$$ where $$u$$ is assumed to have no additional factor $$3$$. But with such a large exponent as $$2 \cdot 3^{x-1} \cdot u$$ -even when $$u=1$$ - you'll have a lot "compagnon"-primefactors in the numerator of the rhs so that you could write correctly $$w \cdot 3^x = { p^{2 \cdot 3^{x-1} \cdot u}-1\over 2}$$ .

The "compagnon"-primefactors would be collected in $$w$$ - and your problem is solved if you find some $$p,x,y$$ such that $$w=1$$. This is likely only possible with small $$x$$ say $$x=1$$ or $$x=2$$ (the latter for a "generalized Wieferich"-case for instance) .

Now you have $$x>=2$$ so let's assume the smallest: $$x=2$$ . Then the previous formula is $$w \cdot 3^2 = { p^{2 \cdot 3 \cdot u}-1\over 2}$$

The equation looks like a much common expression and I would think this has already been analyzed and can be answered from common results elsewhere. For instance, the Zsigmondy-theorem (see WP) is surely of relevance here. This answer is free for anyone to use

this answer is available for anyone to use

This answer is free to use!!!!

One more idea; echoing your observations (3), focusing more properties of your variable $$b$$ and following the equations downto (4).

I've sometimes tried to formalize this, but today I took the patience to go through it. We find -just another- viewpoint frome where it is much suggestive that the non-trivial 1-cycle cannot exist; but I could not yet relate the critical observation to some lower or upper bounds... .

Let's see. We put the focus on the first unnumbered eq. after (3). We find $$2^B = { 3^n b -1\over 2^n b-1 } \tag1$$ Here we restrict $$B$$ as derived from $$B=m-n$$ and hope, there is some positive integer $$b$$ such that the equation is satisfied. The idea which I foolowed today is to look, which $$b$$ make, for a given $$n$$ the expression in the numerator $$3^n b -1$$ such that it contains the factor $$2$$ to the power $$B$$.
We know, that -for any given $$e$$- $$2^e || 3^f-1$$ periodically with increasing $$f$$. Here, if $$f$$ is odd, $$e$$ can only assume the value $$e=1$$, but if $$f=2^{e-2}x$$ (with any $$x$$ odd, let's assume here $$x=1$$) then $$e$$ can assume all values $$e \ge 3$$ and we'll have $$2^B || 3^{2^{B-2}} - 1 \tag {2.1}$$ Now, $$n$$ is not equal to $$2^{B-2}$$ so we could rewrite $$2^B = { 3^{n+(2^{B-2}-n)} -1\over 2^n b-1 }= { 3^n \cdot 3^{2^{B-2}-n} -1\over 2^n b-1 } \tag {2.2}$$ and have sure, that for $$B \ge 3$$ the rhs has the factor $$2^B$$, and we could set the variable $$b$$ to the provisorcal value $$b=3^{2^{B-2}-n}$$ But that (extremely high) value is not needed - it is enough that $$b \equiv 3^{2^{B-2}-n} \pmod {2 \cdot 2^B}$$ Here is a short table to show this: $$\small \begin{array} {rr|rrr} n & b & \hat b=\log_2(b) & B & d=\hat b - B \\ \hline 5 & 3 & 1.584962501 & 3 & 1.415037499 \\ 6 & 25 & 4.643856190 & 4 & -0.6438561898 \\ 7 & 3 & 1.584962501 & 5 & 3.415037499 \\ 8 & 1 & 0.0 & 5 & 5.000000000 \\ 9 & 11 & 3.459431619 & 6 & 2.540568381 \\ 10 & 89 & 6.475733431 & 6 & -0.4757334310 \\ 11 & 179 & 7.483815777 & 7 & -0.4838157773 \\ 12 & 17 & 4.087462841 & 8 & 3.912537159 \\ 13 & 347 & 8.438791853 & 8 & -0.4387918526 \\ 14 & 201 & 7.651051691 & 9 & 1.348948309 \\ 15 & 67 & 6.066089190 & 9 & 2.933910810 \\ 16 & 1217 & 10.24911345 & 10 & -0.2491134527 \\ 17 & 1771 & 10.79034850 & 10 & -0.7903484968 \\ 18 & 2297 & 11.16553514 & 11 & -0.1655351414 \\ 19 & 83 & 6.375039431 & 12 & 5.624960569 \\ 20 & 5489 & 12.42232762 & 12 & -0.4223276240 \\ \end{array}$$ For example, we use $$n=9$$, then $$B=m-n=6$$ and by the table $$b=11$$ (we can use all $$b_k=11+ k \cdot 2 \cdot 2^B$$ as well). Of course no one gives an integer solution for the rhs in eq (1), and increasing $$k$$ in $$b_k$$ means only that the whole expression in the rhs goes towards the fractional value $$1.5^n$$

Let $$p \in \mathbb P$$ denote the chosen problem-parameter for some analysis.
Let $$q \in \mathbb P$$ denote the largest prime below $$p$$.
Let $$\text{ql}$$ denote the list of primes below $$p$$ : $$\text{ql}=\{2,3,...,q\}$$
Then let's write one transformation from $$a_1 \to a_2$$ as $$a_2 = {a_1 \cdot p +1 \over 2^{A_1} 3^{B_1} \cdots q^{H_1}} \tag 1$$ $$\qquad \qquad$$ where we assume, that the $$a_1$$ and $$a_2$$ are free from all factors from the primes-list $$\text{ql}$$.

• So far we can already discuss a little interesting thing: does (for any $$p$$) exist a one-step cycle $$a_0 \to a_0$$ ?
We rewrite (eq 1): $$a_1 = {a_1 \cdot p +1 \over 2^{A_1} 3^{B_1} \cdots q^{H_1}}$$ and then $$a_1 \cdot (2^{A_1} 3^{B_1} \cdots q^{H_1} - p) = 1 \\ a_1 = { 1 \over 2^{A_1} 3^{B_1} \cdots q^{H_1} - p }$$ Then we ask: can a combination of exponents $$[A_1,B_1,...,H_1]$$ lead to $$2^{A_1} 3^{B_1} \cdots q^{H_1} = p+1$$.
The answer is positive, and for all $$p$$: since in $$1 \cdot p+1$$ we can only have primefactors smaller than $$p$$ and in $$2^{A_1} 3^{B_1} \cdots q^{H_1}$$ we have

$$a_2 = T(a_1,[A_1,B_1,...,H_1])$$

$$\hat s = (p+{ 1\over a_\mu})^N \\ \hat s^{1/N} - p = {1\over a_\mu} \\ a_\mu = {1 \over \hat s^{1/N} - p}$$ and as a consequence $$a_1 < a_\mu = {1 \over \hat s^{1/N} - p}$$

This answer is free for anyone to use

\begin{align} -a^2+b^2+c^2 &= \color{blue}{p^2}\\ a^2-b^2+c^2 &= \color{blue}{(nq)^2}\\ a^2+b^2-c^2 &=q^2 \\ \hline -c^2+d^2+e^2 &= (np)^2\\ c^2-d^2+e^2 &= \color{blue}{p^2}\\ c^2+d^2-e^2 &= \color{blue}{(nq)^2} \end{align} \begin{align} a^2+b^2+c^2 &= p^2+2m^2q^2 \\ c^2+d^2+e^2 & = 2(mp)^2+(nq)^2 \end{align} $$\begin{array}{} 2c^2 &=p^2+(nq)^2 &=...\\ 2b^2 &=p^2+q^2 &=\\ 2a^2 &=(nq)^2+q^2 &=q^2(n^2+1)\\ \hline 2c^2&=p^2+(nq)^2 & &\text{ repeated } \\ 2d^2&=(np)^2+(nq)^2 &=n^2(p^2+q^2)\\ 2e^2&=(np)^2 + p^2 &=p^2(n^2+1) \end{array}$$

$$\begin{array}{} 2a^2+2e^2 & = (p^2+q^2)(n^2+1)&=2m^2(p^2+q^2)&=2m^2\cdot 2b^2 \\ a^2+e^2 & = 2 (mb)^2 \\ 2d^2 &= 2(nb)^2 \end{array}$$

$$\begin{array}{} a^2+e^2 & = 2 (mb)^2 \\ 2d^2 &= 2(nb)^2 \end{array}$$

assume $$(n,m)=(239,169)$$ \begin{align} a &= 169 q\\ 2b^2 &=p^2+q^2\\ 2c^2 &=p^2+(239q)^2\\ d &= 239b\\ e &= 169p \end{align}

\begin{align} a &= mq\\ b &=\sqrt{\frac{p^2+q^2}2}\\ c &=\sqrt{\frac{p^2+n^2q^2}2}\\ d &= nb\\ e &= mp \end{align} This space is available for use.

$$2^n<2^{\lceil n \log_23\rceil}-3^n<3^n-2^n \\ -( 3^n/2-2^n) <2^{\lceil n \log_23\rceil}-3/2 \cdot 3^n< 3^n/2-2^n \\ -( 3^n/2-2^n) <3^n (2^{1-\{nß\} }-3/2 )< 3^n/2-2^n \\ -( 1/2-(2/3)^n) <2^{1-\{nß\} }-3/2 < 1/2-(2/3)^n \\ |2^{1-\{nß\} }-3/2 |< 1/2-(2/3)^n \\$$

Perhaps even improved, with $$\rho_n = \log(2) \cdot (1-\{nß\})$$ $$(2/3)^n< 2^{1 - \{nß\}}-1<1 -(2/3)^n \\ (2/3)^n< \rho_n + \rho_n^2/2! + ... <1 -(2/3)^n \\$$ Waring (unproved) $$(9/8)^n (2/3)^n< (9/8)^n (2^{1 - \{nß\}}-1) <(9/8)^n(1 -(2/3)^n) \\ (3/4)^n < (9/8)^n (2^{1 - \{nß\}}-1) <(9/8)^n -(3/4)^n)$$

Waring $$( 3/ 4)^n \lt \{(3/2)^n\} \lt 1-( 3/ 4)^n \\$$
================================================================

$$2^n<2^{\lceil n \log_23\rceil}-3^n<3^n-2^n$$ Add rhs: $$3^n<2^{\lceil n \log_23\rceil}-2^n<2(3^n-2^n)$$ In the middle, separate factor $$3^n$$: $$3^n<2^{1+ nß - \{nß\}}-2^n<2(3^n-2^n) \\ 3^n<3^n \cdot 2^{1 - \{nß\}}-2^n<2(3^n-2^n) \\$$ $$3^n+2^n<3^n \cdot 2^{1 - \{nß\}}<2 \cdot 3^n-2^n$$ if $$\{nb\}=1$$ were possible, we could have $$3^n+2^n \color{red}<3^n <2 \cdot 3^n-2^n$$ which would not possible because of the left inequality and if $$\{nb\}=0$$ were possible, we could have $$3^n+2^n <3^n \cdot 2 \color{red}<2 \cdot 3^n-2^n$$ where the right inequality were wrong. So perhaps $$3^n+2^n<3^n \cdot 2^{1 - \{nß\}}<2 \cdot 3^n-2^n$$ or even better $$1+(2/3)^n< 2^{1 - \{nß\}}<2 -(2/3)^n$$ were some "canonical" form.

Perhaps even improved, with $$\rho_n = \log(2) \cdot (1-\{nß\})$$ $$(2/3)^n< 2^{1 - \{nß\}}-1<1 -(2/3)^n \\ (2/3)^n< \rho_n + \rho_n^2/2! + ... <1 -(2/3)^n \\$$

$$3^n<2^n (2^{1 - \{nß\} +n(ß-1) }-1)<2(3^n-2^n) \\ (3/2)^n+1< (3/2)^n 2^{1 - \{nß\} } <2 (3/2)^n-1 \\ 1+(2/3)^n< 2^{1 - \{nß\} } <2 -(2/3)^n \\$$ 1+(2/3)^nThis box is free for everyone to use

$$a = { 3^N-2^N \over 2^S-3^N } \\ a = 2^N { 2^{A-1} -1 \over 2^S-3^N } - 1\\ {a +1 \over 2^N }= { 2^{A-1} -1 \over 2^S-3^N }$$ From the previous formulae is clear, that the rhs must still be integer. So $$a+1$$ must be an integral multiple of $$2^N$$ so that we can say, with some positive integer $$k$$, $$a = 2^N \cdot k -1$$
So we equal the rhs to the unknown positive integer $$k$$: $$k = { 2^{A-1} -1 \over 2^S-3^N }$$ ... and develop ... $$k(2^S-3^N) = 2^{A-1} -1 \\ 2^S k - 2^{A-1} = 3^Nk - 1\\ 2^{A-1} (2^N k - 1) = 3^Nk - 1$$ ... to arrive at ... $$2^{A-1} = { 3^Nk - 1 \over 2^N k - 1 }$$ Here we can now prove three properties of $$k$$.

1. $$k$$ must be odd - otherwise the numerator could not be even and have a power of $$2$$ as factor
2. $$k$$ cannot equal $$1$$.
3. that $$k$$ must be large That follows from Fermat's little and Euler's totient theorems, and finally from the LTE-lemma

Suppose I have a module $$M$$ being acted on by a group $$G$$.

• $$0 + a = a$$
• $$a + 0 = a$$
• $$--a = a$$
• $$a - a = 0$$
• $$a + (b + c) = (a + b) + c$$
• $$a + b = b + a$$
• $$r(a+b) = ra + rb$$
• $$(r+s)(a) = ra + sa$$
• $$(-r)(a) = -ra$$
• $$(rs)(a) = rsa$$
• $$rsa = sra$$
• $$g(ra + sb) = gra + gsb$$
• $$(gh)(ra) = g(hra)$$

Let $$M$$ be $$\mathbb{H}$$ as a real module. Let $$G$$ be $$\mathbb{H} \setminus \{0\}$$ as a group.

modal formula: $$\lozenge^{(n+1)}p \to \lozenge^n p$$ enforces a maximum path length of $$n$$.

modal formula: $$\left(\bigwedge_{1 \le i \le (n+1)}\lozenge p_i\right) \to \lozenge \left( \bigvee_{1 \le i \neq j \le (n+1)} p_i \land p_j \right)$$

The above enforces a maximum degree of $$n$$

Let $$M$$ be a simple $$R$$-module. Let $$\Lambda$$ be the lattice of submodules of $$M$$.

We can define a function $$f : \Lambda \to \Lambda$$ as:

$$f(N) = \{x_1 : x \in N\} \times \{x_2 : x \in N\} \times \cdots \times \{x_n : x \in N \}$$

I.e. $$f$$ takes an ideal and sends it to the product of its components.

What are the ideals of non-associative rings?

I'm looking for an example of a non-UFD GCD besides the algebraic integers and the ring of entire functions on $$\mathbb{C}$$ or the monoid ring $$(k, \mathbb{Q}_{\ge 0})$$.

I'm curious whether this example works.

Consider the ring $$R = \mathbb{Z}[a,b,c]/(b^2-a, c^2-a)$$. The idea being that $$a$$ is a propertyless element with two square roots, $$b$$ and $$c$$.

$$R$$ is not a UFD. $$a$$ factors as $$b \cdot b$$ and as $$c \cdot c$$ and $$b$$ and $$c$$ are not equal.

Acting on a complex number:

$$k$$ is a real number. $$i$$ is $$\sqrt{-1}$$. $$T_z$$ is a shift operator. $$I_z$$ is a shift by $$iz$$. $$F$$ is conjugation.

• $$k \triangleright (a+ib) = ka + ikb$$
• $$i \triangleright (a+ib) = -b + ia$$
• $$T_{k} \triangleright (a+ib) = (k+a)+ib$$
• $$I_{k} \triangleright (a+ib) = a + i(b+k)$$
• $$F \triangleright (a+ib) = a - ib$$
• $$g - h \triangleright (a+ib) = (g \triangleright a+ib) - (h \triangleright a+ib)$$
• $$gh \triangleright (a+ib) = g \triangleright h \triangleright (a+ib)$$

Definition of higher-level operators, rotations and reflections.

• $$R_{p, \theta}$$ is $$T_{p} R_\theta T_{-p}$$.
• $$X_{0, 0}$$ is $$F$$.
• $$X_{p, 0}$$ is $$T_p F T_{-p}$$
• $$X_{p, \theta}$$ is $$T_p R_{\theta} F R_{-\theta} T_{-p}$$

Let a matrix $$M$$ be quasisymmetric if there exists permutation matries $$U$$ and $$V$$ such that $$UMV = (UMV)^T$$.

If I look at character tables of finite cyclic groups, it appears that the character table, considered as a matrix, if quasisymmetric when the group has prime order.

Some groups like $$\mathbb{Z}_2 \times \mathbb{Z}_2$$ are also quasisymmetric, but they are not cyclic and I'm only interested in cyclic groups at the moment.

Consider noncommutative, nonunital rings $$R$$ where the underlying group $$(R, +)$$ is cyclic.

If $$n$$ is finite, there is one isomorphism class of ring $$R$$ with a cycligc additive grouop for each divisor of $$n$$.

How do you characterize the rings with exactly one cool ideal.

Let's define a cool ideal $$I \subset R$$ as a prime ideal that is not principal and is generated by two elements.

So, in the ring $$\mathbb{C}[x, y]$$, $$(x, y)$$ is a cool ideal. However, it is not the only one, since $$(x, y+1)$$ is also a cool ideal.

The ring $$\mathbb{C}[x, y]/S$$, where $$S$$ is the set of all elements $$j(x, y)$$ such that $$x \not \mid j(x, y)$$ and $$y \not \mid j(x, y)$$, does have exactly one cool ideal. (I think this construction is $$\mathbb{C}[x, y]$$ localized at $$(x, y)$$?)

I'm wondering if there's a nice characterization of all rings with exactly one cool ideal.

What follows is what I've done so far to try to solve this question on my own. It consists of:

• A proof that $$\mathbb{C}[x, y]$$ contains the cool ideal $$(x, y)$$ .
• A proof that $$\mathbb{C}[x, y]$$ contains the additional cool ideal $$(x, y+1)$$ .
• A proof that $$\mathbb{C}[x, y]/S$$ contains exactly one cool ideal.

#### Definition 31: polynomial with no constant term

A polynomial $$p(\vec{x})$$ has no constant term if and only if it is $$0$$ or has at least one term, but none of the terms are constant.

This definition says very little, I'm just emphasizing that $$0$$ is considered to have no terms at all instead of having a constant term which is zero.

#### Lemma 41: $$p(x, y)$$ is in $$(x, y)$$ if and only if $$p$$ has no constant term.

RTL: Suppose $$p(x, y)$$ has no constant term. We can collect all the terms with at least one $$x$$ into $$f(x)x$$ and all the remaining terms into $$g(y)y$$.

For example, $$x^2 + xy + 3y^2 = (x+y)x + (3y)y$$.

Thus, $$p(x, y)$$ is in $$(x, y)$$. Note that when $$p(x, y)$$ is $$0$$, we choose $$f(x) = 0$$ and $$g(y) = 0$$.

LTR: Suppose $$p(x, y)$$ is in $$(x, y)$$.

Thus, $$p(x, y)$$ has the form $$f(x, y)x + g(x, y)y$$. There are no constant terms in $$f(x, y)x$$ and there are no constant terms in $$g(x, y)y$$. Therefore $$p(x, y)$$ has no constant terms, as desired.

End of proof of Lemma 41.

#### Lemma 51: $$(x, y)$$ is a cool ideal of $$\mathbb{C}[x, y]$$.

$$(x, y)$$ is an ideal.

$$(x, y)$$ is generated by two elements.

Let's prove that $$(x, y)$$ is a prime ideal by noting that its complement is multiplicatively closed. Suppose we have not necessarily distinct elements of the complement of $$(x, y)$$; call them $$f(x, y)$$ and $$g(x, y)$$. By Lemma 41, $$f(x, y)$$ and $$g(x, y)$$ each have no constant term.

If $$a(x, y)$$ is a term of $$f(x, y)$$ and $$b(x, y)$$ is a term of $$g(x, y)$$, then $$(ab)(x, y)$$ is nonconstant because it is a product of two nonconstant terms.

Therefore $$(fg)(x, y)$$ has no nonconstant terms and, by Lemma 41, is an element of the complement of $$(x, y)$$.

Thus the complement of $$(x, y)$$ is multiplicatively closed and $$(x, y)$$ is a prime ideal.

Suppose for contradiction that $$(x, y)$$ is principal and generated by $$h(x, y)$$. If $$h(x, y)$$ contains a term that contains $$x$$, then $$h(x, y) \not\mid y$$. If $$h(x, y)$$ contains a term that contains $$y$$, then $$h(x, y) \not\mid x$$. If $$h(x,y)$$ has a constant term, then $$(h) = (1) = \mathbb{C}[x, y]$$. If $$h$$ has no terms at all, then $$h=0$$ which is a contradiction since $$(0) \neq (x, y)$$.

#### Lemma 71: $$\varphi$$ which sends $$x$$ to $$p(x, y)$$ and $$y$$ to $$q(x, y)$$ is a ring homomorphism.

Every element of $$\mathbb{C}[x, y]$$ is equivalent to a sum of the form $$\sum_{m, n}a_{m,n}x^m y^n$$, and, as usual, all but finitely many values of $$a_{m,n}$$ are zero.

Here is the definition of $$\varphi$$, based on how it acts on the monomials $$x$$ and $$y$$.

$$\varphi(\sum_{m,n}a_{m,n}x^m y^n) = \sum_{m,n}a_{m,n} \varphi(x)^m \varphi(y)^n$$

$$\varphi$$ respects $$-$$.

$$\varphi((\sum_{m,n}a_{m,n}x^m y^n) - (\sum_{m,n}b_{m,n}x^my^n)) = \varphi(\sum_{m,n}(a-b)_{m,n}x^my^n) = \sum_{m,n} (a-b)_{m,n} \varphi(x)^m \varphi(y)^n = \varphi(\sum_{m,n} a_{m,n} x^m)$$

$$\varphi$$ respects multiplication.

$$\varphi((\sum_{m,n}a_{m,n}x^m y^n)(\sum_{k,l} b_{k,l}x^k y^l))$$

#### Lemma 81: $$\varphi$$ preserves ideals when $$\varphi$$ is a surjective ring homomorphism.

like $$I$$ be an ideal. I want to show that $$\varphi I$$ is an ideal.

Suppose $$a$$ and $$b$$ are in $$I$$, then $$\varphi(a) + \varphi(b) = \varphi(a + b)$$, therefore $$\varphi I$$ is additively closed.

By hypothesis, $$I$$ is an ideal. Thus is satisfies $$ra \in I$$ for each $$r$$ in $$R$$ and each $$a$$ in $$I$$. Therefore, $$\varphi(ra) \in \varphi I$$ for each $$r$$ in $$R$$ and $$i$$ and $$I$$. $$\varphi(r)$$ hits every element of $$S$$ by surjectivity of $$\varphi$$, thus $$\varphi I$$ is an ideal of $$S$$.

End of proof of Lemma 81.

#### Lemma 91: $$\varphi$$ preserves cool ideals when $$\varphi$$ is a surjective homomorphism.

TBD.

End of proof of Lemma 91.

#### Lemma 61: $$(x, y+1)$$ is a cool ideal of $$\mathbb{C}[x, y]$$.

The map $$\varphi : \mathbb{C}[x, y] \to \mathbb{C}[x, y]$$ that sends $$x$$ to $$x$$ and $$y$$ to $$y+1$$ is surjective.

$$\varphi((x, y)) = (\varphi(x), \varphi(y)) = (x, y+1)$$

Therefore $$(x, y+1)$$ is a cool ideal.

End of proof of Lemma 61.

#### Lemma 101: the elements of $$\mathbb{C}[x, y] / S$$ has the form $$ux^m y^n$$ where $$u$$ is a unit.

Let $$p(x, y)$$ be a polynomial in $$\mathbb{C}[x, y]$$ such that $$x \not\mid p(x, y)$$ and $$y \not\mid p(x, y)$$ . By construction of $$S$$, $$p(x, y)$$ is in $$S$$. Therefore $$\frac{1}{p(x, y)}$$ is in $$\mathbb{C}[x, y] / S$$.

Again by construction of $$S$$, $$x$$ and $$y$$ do not have inverses.

$$0$$ doesn't have an inverse and isn't expected to. Nonzero constants in $$\mathbb{C}$$ do have inverses.

Every element of $$\mathbb{C}[x, y]/S$$ thus has the form $$\frac{p(x, y)x^n y^m}{q(x, y)}$$ where $$p(x, y)$$ and $$q(x, y)$$ are in $$S$$.

$$\frac{p(x, y)}{q(x, y)}$$ is also in $$S$$, therefore an arbitrary element of $$\mathbb{C}[x, y]$$ has the form $$ux^n y^m$$.

How do you characterize the rings with exactly one cool ideal.

Let's define a cool ideal $$I \subset R$$ as a prime ideal that is not principal and is generated by two elements.

So, in the ring $$\mathbb{C}[x, y]$$, $$(x, y)$$ is a cool ideal. However, it is not the only one, since $$(x, y+1)$$ is also a cool ideal.

The ring $$\mathbb{C}[x, y]/S$$, where $$S$$ is the set of all elements $$j(x, y)$$ such that $$x \not \mid j(x, y)$$ and $$y \not \mid j(x, y)$$, does have exactly one cool ideal. (I think this construction is $$\mathbb{C}[x, y]$$ localized at $$(x, y)$$?)

I'm wondering if there's a nice characterization of all rings with exactly one cool ideal.

What follows is what I've done so far to try to solve this question on my own. It consists of:

• A proof that $$\mathbb{C}[x, y]$$ contains the cool ideal $$(x, y)$$ .
• A proof that $$\mathbb{C}[x, y]$$ contains the additional cool ideal $$(x, y+1)$$ .
• A proof that $$\mathbb{C}[x, y]/S$$ contains exactly one cool ideal.

#### Definition 31: polynomial with no constant term

A polynomial $$p(\vec{x})$$ has no constant term if and only if it is $$0$$ or has at least one term, but none of the terms are constant.

This definition says very little, I'm just emphasizing that $$0$$ is considered to have no terms at all instead of having a constant term which is zero.

#### Lemma 41: $$p(x, y)$$ is in $$(x, y)$$ if and only if $$p$$ has no constant term.

RTL: Suppose $$p(x, y)$$ has no constant term. We can collect all the terms with at least one $$x$$ into $$f(x)x$$ and all the remaining terms into $$g(y)y$$.

For example, $$x^2 + xy + 3y^2 = (x+y)x + (3y)y$$.

Thus, $$p(x, y)$$ is in $$(x, y)$$. Note that when $$p(x, y)$$ is $$0$$, we choose $$f(x) = 0$$ and $$g(y) = 0$$.

LTR: Suppose $$p(x, y)$$ is in $$(x, y)$$.

Thus, $$p(x, y)$$ has the form $$f(x, y)x + g(x, y)y$$. There are no constant terms in $$f(x, y)x$$ and there are no constant terms in $$g(x, y)y$$. Therefore $$p(x, y)$$ has no constant terms, as desired.

End of proof of Lemma 41.

#### Lemma 51: $$(x, y)$$ is a cool ideal of $$\mathbb{C}[x, y]$$.

$$(x, y)$$ is an ideal.

$$(x, y)$$ is generated by two elements.

Let's prove that $$(x, y)$$ is a prime ideal by noting that its complement is multiplicatively closed. Suppose we have not necessarily distinct elements of the complement of $$(x, y)$$; call them $$f(x, y)$$ and $$g(x, y)$$. By Lemma 41, $$f(x, y)$$ and $$g(x, y)$$ each have no constant term.

If $$a(x, y)$$ is a term of $$f(x, y)$$ and $$b(x, y)$$ is a term of $$g(x, y)$$, then $$(ab)(x, y)$$ is nonconstant because it is a product of two nonconstant terms.

Therefore $$(fg)(x, y)$$ has no nonconstant terms and, by Lemma 41, is an element of the complement of $$(x, y)$$.

Thus the complement of $$(x, y)$$ is multiplicatively closed and $$(x, y)$$ is a prime ideal.

Suppose for contradiction that $$(x, y)$$ is principal and generated by $$h(x, y)$$. If $$h(x, y)$$ contains a term that contains $$x$$, then $$h(x, y) \not\mid y$$. If $$h(x, y)$$ contains a term that contains $$y$$, then $$h(x, y) \not\mid x$$. If $$h(x,y)$$ has a constant term, then $$(h) = (1) = \mathbb{C}[x, y]$$. If $$h$$ has no terms at all, then $$h=0$$ which is a contradiction since $$(0) \neq (x, y)$$.

#### Lemma 71: $$\varphi$$ which sends $$x$$ to $$p(x, y)$$ and $$y$$ to $$q(x, y)$$ is a ring homomorphism.

Every element of $$\mathbb{C}[x, y]$$ is equivalent to a sum of the form $$\sum_{m, n}a_{m,n}x^m y^n$$, and, as usual, all but finitely many values of $$a_{m,n}$$ are zero.

Here is the definition of $$\varphi$$, based on how it acts on the monomials $$x$$ and $$y$$.

$$\varphi(\sum_{m,n}a_{m,n}x^m y^n) = \sum_{m,n}a_{m,n} \varphi(x)^m \varphi(y)^n$$

$$\varphi$$ respects $$-$$.

$$\varphi((\sum_{m,n}a_{m,n}x^m y^n) - (\sum_{m,n}b_{m,n}x^my^n)) = \varphi(\sum_{m,n}(a-b)_{m,n}x^my^n) = \sum_{m,n} (a-b)_{m,n} \varphi(x)^m \varphi(y)^n = \varphi(\sum_{m,n} a_{m,n} x^m)$$

$$\varphi$$ respects multiplication.

$$\varphi((\sum_{m,n}a_{m,n}x^m y^n)(\sum_{k,l} b_{k,l}x^k y^l))$$

#### Lemma 81: $$\varphi$$ preserves ideals when $$\varphi$$ is a surjective ring homomorphism.

like $$I$$ be an ideal. I want to show that $$\varphi I$$ is an ideal.

Suppose $$a$$ and $$b$$ are in $$I$$, then $$\varphi(a) + \varphi(b) = \varphi(a + b)$$, therefore $$\varphi I$$ is additively closed.

By hypothesis, $$I$$ is an ideal. Thus is satisfies $$ra \in I$$ for each $$r$$ in $$R$$ and each $$a$$ in $$I$$. Therefore, $$\varphi(ra) \in \varphi I$$ for each $$r$$ in $$R$$ and $$i$$ and $$I$$. $$\varphi(r)$$ hits every element of $$S$$ by surjectivity of $$\varphi$$, thus $$\varphi I$$ is an ideal of $$S$$.

End of proof of Lemma 81.

#### Lemma 91: $$\varphi$$ preserves cool ideals when $$\varphi$$ is a surjective homomorphism.

TBD.

End of proof of Lemma 91.

#### Lemma 61: $$(x, y+1)$$ is a cool ideal of $$\mathbb{C}[x, y]$$.

The map $$\varphi : \mathbb{C}[x, y] \to \mathbb{C}[x, y]$$ that sends $$x$$ to $$x$$ and $$y$$ to $$y+1$$ is surjective.

$$\varphi((x, y)) = (\varphi(x), \varphi(y)) = (x, y+1)$$

Therefore $$(x, y+1)$$ is a cool ideal.

End of proof of Lemma 61.

#### Lemma 101: the elements of $$\mathbb{C}[x, y] / S$$ has the form $$\sum ux^m y^n$$ where the elements $$u$$ are units.

Let $$p(x, y)$$ be a polynomial in $$\mathbb{C}[x, y]$$ such that $$x \not\mid p(x, y)$$ and $$y \not\mid p(x, y)$$ . By construction of $$S$$, $$p(x, y)$$ is in $$S$$. Therefore $$\frac{1}{p(x, y)}$$ is in $$\mathbb{C}[x, y] / S$$.

Again by construction of $$S$$, $$x$$ and $$y$$ do not have inverses.

$$0$$ doesn't have an inverse and isn't expected to. Nonzero constants in $$\mathbb{C}$$ do have inverses.

Every element of $$\mathbb{C}[x, y]/S$$ thus has the form $$\frac{p(x, y)x^n y^m}{q(x, y)}$$ where $$p(x, y)$$ and $$q(x, y)$$ are in $$S$$.

$$\frac{p(x, y)}{q(x, y)}$$ is also in $$S$$, therefore an arbitrary element of $$\mathbb{C}[x, y]$$ has the form $$ux^n y^m$$.

#### Lemma 111: $$\mathbb{C}[x, y]/S$$ has exactly one cool ideal $$(x, y)$$.

$$(x, y)$$ is a prime ideal.

$$(x, y)$$ is not principal.

Suppose $$I$$ is a cool ideal. It is generated by $$(ux^my^n, vx^ky^l)$$.

$$u$$ and $$v$$ are both units and don't affect the ideal.

It can't be the case that $$m = n = 0$$ or likewise for $$k = l = 0$$ because then the ideal generated would be $$(1)$$.

Let $$F$$ be an algebraic signature and $$T$$ be an equational $$F$$-theory. Let $$A$$ be an $$F$$-structure such that $$A \models T$$.

Let's call the relation $$=$$ on $$A$$ equality and define a proper congruence as one that is not equality.

I want to show that $$A$$ has a maximal proper congruence.

Let $$(\Gamma)$$ where $$\Gamma$$ is a set of pairs be the congruence generated by the pairs $$\Gamma$$ defined as:

$$(\Gamma) = \bigcap \{R : R \in \Lambda \;\;\text{and}\;\; \Gamma \subset \Lambda \}$$

The full relation exists and is a congruence so $$\{R: \cdots\}$$ is never empty.

Let $$\alpha$$ be an ordinal such that $$A_\alpha$$ is the elements of $$A$$ indexed by $$\alpha$$.

How do you prove that $$\sin(1)$$ is not algebraic?

Name for extending a propositional logic to a first-order logic with constant and relation symbols.

We need the rules making $$=$$ an equivalence relation:

$$\vdash a = a$$ $$a = b \vdash b = a$$ $$a = b, b = c \vdash a = c$$

And the following rule making $$=$$ a congruence.

$$\vec{x} = \vec{y}, R(\vec{x}) \vdash R(\vec{y})$$

Determinant algorithm.

$$\begin{vmatrix} 1 & b & c \\ d & e & f \\ g & h & i \end{vmatrix} \mapsto \begin{vmatrix} \begin{vmatrix} 1 & b \\ d & e \end{vmatrix} & \begin{vmatrix} 1 & c \\ d & f \end{vmatrix} \\ \begin{vmatrix} 1 & b \\ g & h \end{vmatrix} & \begin{vmatrix} 1 & c \\ g & i \end{vmatrix} \end{vmatrix}$$

Every representation besides the identity representation is reducible.

As proof, all permutations of dimension $$n$$ fix a subspace generated by $$\begin{bmatrix} 1 \\ \vdots \\ 1 \end{bmatrix}$$.

I'm wondering whether it is the case that any irreducible representation of a finite group can be extended to a representation with dimension one greater. Conversely, I'm also wondering whether I can hit all the irreducible subrepresentations of a finite group by taking subrepresentations of permutation representations, but the $$\textbf{NonPermutation} \longrightarrow \textbf{Permutation}$$ direction is the focus of this particular question to keep it narrow.

My goal here, eventually, is to come up with a heuristic that might help me compute a row or two of the character table of a group by hand by looking at permutation representations that fix a one-dimensional subspace. It is logically a follow-up to this question that I asked in the recent past.

$$S_3$$ is generated by the derangement $$(123)$$ and the transposition $$(12)$$.

We have the sign representation that sends $$(12)$$ to $$\begin{bmatrix} -1 \end{bmatrix}$$ and $$(123)$$ to $$\begin{bmatrix} 1 \end{bmatrix}$$. This is a 1-dimensional representation.

We can "extend it" to the reducible permutation representation $$(12) \mapsto \begin{bmatrix} & 1 \\ 1 & \end{bmatrix}\;\;,\;\; (123) \mapsto \begin{bmatrix} 1 & \\ & 1 \end{bmatrix}$$, which has dimension 1 greater.

The faithful representation $$(12) \mapsto \begin{bmatrix} & 1 \\ 1 & \end{bmatrix} \;\;,\;\; (123) \mapsto \begin{bmatrix} \omega & \\ & \omega^2 \end{bmatrix}$$ with $$\omega = \exp\left(\frac{2\pi}{3}\right)$$ also has dimension 2.

And it can be extended to $$(12) \mapsto \begin{bmatrix} & 1 & \\ 1 & & \\ & & 1 \end{bmatrix} \;\;,\;\; (123) \mapsto \begin{bmatrix} & 1 & \\ & & 1 \\ 1 & & \end{bmatrix}$$, which has dimension 1 higher.

Let $$R$$ be a commutative ring with unity. Let $$\Lambda$$ be its lattice of ideals.

Let me define a function $$f : \Lambda \to \Lambda$$ using a transfinite definition.

Let $$E_\lambda$$ be the elements of $$R$$ placed in a well-order and indexed by the ordinal $$\lambda$$.

I will now compute $$f(X)$$, where $$X$$ is an ideal. Let $$(S)$$ be the ideal generated by a set $$S$$ and likewise for mixtures of sets and elements such as $$(S, e)$$.

Let $$g(0) = X \;\,\text{if}\;\, (E_0, X) = R \;\,\text{else}\;\, (E_0, X)$$.

For successor ordinals, let $$g(\alpha+1) = g(\alpha) \;\,\text{if}\;\, (E_\alpha, g(\alpha+1)) = R \;\,\text{else}\;\, (E_\alpha, g(\alpha+1))$$.

For limit ordinals, let $$g(\alpha) = (g(\beta) : \beta < \alpha) \;\,\text{if}\;\, (E_\alpha, (g(\beta) : \beta < \alpha)) = R \;\,\text{else}\;\, (E_\alpha, (g(\beta) : \beta < \alpha))$$.

And finally, define $$f(X)$$ as $$g(\lambda)$$.

If $$X$$ is a unit ideal, then $$f(X) = X$$ since we will never hit an else branch.

If $$X$$ is not a unit ideal, then $$f(X)$$ will be a maximal ideal containing $$X$$. Suppose for contradiction that $$f(X)$$

I was wondering the other day why interpretations from one structure $$\mathfrak{A}$$ to another $$\mathfrak{B}$$ preserve the truth of sentences in $$\mathfrak{A}$$. I think I have a simple proof of this fact, but it has led me to an expected conclusion.

First, let $$E$$ be the class of all structures whose domain is $$\{c\}$$, the denotation of every function and constant symbol is completely determined, but each relation symbol has two possible denotations.

It seems to me that we can always interpret any structure inside a structure within $$E$$ by sending every element of the domain to $$c$$.

This interpretation will preserve the truth of sentences in the original structure, but loses information about the relationship between, for example, $$\forall x \mathop. \varphi(x) \land \psi(x)$$ and $$\varphi(x)$$ and $$\psi(x)$$ since it identifies all satisfiable formulas with the same number of free variables.

Basically, my question is about the definition of interpretations and whether we need to or want to rule out interpretations going to a structure in $$E$$ when defining "just an interpretation" and not a "definable interpretation" or otherwise.

Interpretability is defined in Marker's Model Theory: An Introduction on page 24, but interpretations themselves are not until we get to the notion of definable interpretability. Hodges' a shorter model theory does define an interpretation on page 107 and that definition is similar to the one below; it includes domain formulas and maps formulas to formulas. I'm, however, using the definition from Wikipedia, I'm just changing it slightly to be a map between definable sets subject to certain conditions rather than a map between elements that preserves definability.

Here's the definition from Wikipedia:

An interpretation of a structure $$M$$ in a structure $$M$$ with parameters (or without parameters, respectively) is a pair $$(n, f)$$ where n is a natural number and $$f$$ is a surjective map from a subset of $$N^n$$ onto $$M$$ such that the $$f$$-preimage (more precisely the $$f^k$$ preimage of every $$X \subset M^k$$ definable in $$M$$ by a first-order formula without parameters is definable (in $$N$$) by a first-order formula with parameters (or without parameters, respectively).

The following definition below is intentionally agnostic with respect to whether parameters are allowed or not.

An interpretation in model theory $$i : \mathfrak{A} \to \mathfrak{B}$$ is a map from the definable sets of $$\mathfrak{A}$$ to the definable sets of $$\mathfrak{B}$$ subject to the following constraints below:

• There must exist a natural number $$n$$ and a function $$f : A \to 2^{B^{\,n}}$$ such that, for any definable set $$X$$ of dimension $$k$$, $$i(X)$$ is equal to $$\cup \{ f(\vec{v}) : \vec{v} \in X\}$$, where $$f(\vec{v})$$ is a tuple of length $$kn$$ defined by elementwise application of $$f$$ and then combining the results together using the Cartesian product.
• Destinations must be unique. For any distinct $$a, b$$ in $$A$$, $$f(a)$$ and $$f(b)$$ must be disjoint.
• Destinations must exist. $$f(a)$$ is not empty for any $$a$$.

#### Theorem: The Wikipedia definition and my definition are equivalent.

LTR: Let $$(n, g)$$ be an interpretation. Let $$f(x)$$ be defined as $$g^{\leftarrow}(x)$$, the preimage of $$x$$. Note that $$x$$ is in $$A$$ and $$f(x)$$ is in $$B^n$$.

$$g$$ is surjective, so $$f$$ never sends anything to $$\varnothing$$. $$g$$ is a function, so $$f$$ always sends distinct elements of $$A$$ to disjoint subsets.

RTL: Let $$f : A \to 2^{B^{\,n}}$$ be an interpretation. Let $$C$$ be the image of $$f$$ and let $$D$$ be $$\bigcup C$$. Let $$g$$ be a function $$g : C \to A$$ defined as: $$g(x) = y$$ if and only if $$x \in f(y)$$. Since $$f$$ sends distinct items to disjoint sets and doesn't send anything to the empty set, $$g$$ is a function. $$f$$ is a function, therefore $$g$$ is surjective.

#### Lemma: a sentence $$\varphi$$ is true if and only if its definable set is a singleton.

Suppose $$\varphi$$ is true in a structure $$\mathfrak{M}$$. Then $$\{ \vec{v} : \mathfrak{M} \models \varphi(\vec{v}) \}$$ will consist of exactly the empty variable map.

Suppose $$\varphi$$ is not true in a structure $$\mathfrak{M}$$. Then $$\{ \vec{v} : \mathfrak{M} \models \varphi(\vec{v}) \}$$ will be empty.

#### Theorem: $$i$$ preserves the truth of sentences.

Let $$\varphi$$ be a sentence. Suppose $$\varphi$$ is true. $$X = \{ \vec{v} : \mathfrak{M} \models \varphi(\vec{v}) \}$$ is a singleton. Then $$f$$, applied elementwise to the empty tuple, the sole element of $$X$$, will also produce an empty tuple and thus $$i(X)$$ will be a singleton.

Suppose $$\varphi$$ is not true. Then $$X = \{ \vec{v} : \mathfrak{M} \models \varphi(\vec{v}) \}$$ will be empty and thus $$i(X)$$ will also be empty.

Therefore $$i$$ preserves the truth of sentences.

#### Theorem: the map $$i : \mathfrak{A} \to E_0$$ sending every element of the domain to $$c$$ is an interpretation, where $$E_0$$ is a structure in $$E$$.

Let $$f$$ be the function $$x \mapsto \{c\}$$, it is a constant map

$$\sqrt[r]x_s=\operatorname{srt}_r(x)= 1+\sum_{n=1}^\infty\frac{\ln^n(x)}{n!}\frac{d^{n-1}\overbrace{e^{t-nte^{te^\cdots}}}^{r-2\ {e^t}\text{s}}}{dt^{n-1}}\bigg|_{t=0}=\exp\bigg(\sum_{n=1}^\infty\frac{\ln^n(x)}{n!}\frac{d^{n-1}\overbrace{e^{-nte^{te^\cdots}}}^{r-2\ {e^t}\text{s}}}{dt^{n-1}}\bigg|_{t=0}\bigg)$$

and use the following method for the explicit series expansion. Let’s use $$r=4$$ to illustrate and expand $$e^y$$ as a series:

$$\operatorname{srt}_4(x)=\sum_{n=1}^\infty\frac{\ln^n(x)}{n!}\left.\frac{d^{n-1}e^{-nte^{te^t}}}{dt^{n-1}}\right|_{t=0}=\sum_{n=1}^\infty\frac{\ln^n(x)}{n!}\sum_{m=0}^\infty\frac{(-n)^m }{m!}\left.\frac{d^{n-1}t^me^{mte^t}}{dt^{n-1}}\right|_{t=0}$$

Hmm. For any cyle we need $$2^m = (3+1/x_1)(3+1/x_2) \cdots (3+1/x_n)$$ Dividing by $$3^n$$ gives $$2^m/3^n = (1+1/3/x_1)(1+1/3/x_2) \cdots (1+1/3/x_n)$$ Because the rhs is larger than $$1$$, this says that $$2^m > 3^n$$ is required, and more precisely, the smallest $$m$$ is $$m = \lceil n \cdot \log_2(3) \rceil$$. The "ceil()" can be decomposed to explicitely $$m = n \cdot \log_2(3) - \{ n \cdot \log_2(3) \} + 1$$

This answer is free to use for anyone.

• I have a question, if two people edit a post at the same time, one of them will undoubtedly lose his work.
– user1034536
Jan 17 at 4:25