WordPress has the ability to insert LaTeX math displays (e.g. ) into both posts and comments. The format for this is “$latex *[Your LaTeX code]*$” (but without the brackets, of course). See this announcement for details.

There used to be a number of quirks with the WordPress LaTeX plugin, but they have now largely been fixed. If you find any problems, please report them at this page.

WordPress also supports a certain amount of HTML. As a consequence, be careful with using the < and > signs in a comment, they may be misinterpreted as HTML tags! You can use < and > instead. (Inside of a LaTeX environment, you can use \lt and \gt.)

In case a comment really gets mangled up by formatting errors, contact one of the moderators of the polymath project, so that he or she can manually correct it.

The comments to this post will serve as the LaTeX help forum and LaTeX sandbox for this blog. If you want to test out some LaTeX code in the comments below, you may wish to first describe the code without the “latex” symbol in order to show other readers what you are doing. For instance: “Here is a LaTeX test: $a^n+b^n=c^n$ becomes “. (Note that one can also mouse over a compiled LaTeX image to recover the original LaTeX source.)

### Like this:

Like Loading...

the line

Comment by Anonymous — October 17, 2011 @ 2:15 pm |

this is a test

$x^2 + x – 1 = 0$

Comment by M Wall — June 20, 2013 @ 8:44 am |

This might be an obvious question, but to have a sunflower with three petals, is to find three sets , so that , and .

What happens if instead of both properties, just one of them is forbidden? For example, if we forbid three sets in our family, so that ?

Comment by ILan — November 8, 2015 @ 2:59 pm |

The \gt and \lt don’t seem to be working: I’m trying to compile $a \gt b$: a>b$ works, see

Comment by Anonymous — March 7, 2016 @ 3:01 pm |

I will try to use Latex to express the process but there is no telling how it will turn out

Comment by PJKar — May 24, 2016 @ 8:21 pm |

Comment by Anonymous — December 11, 2016 @ 6:21 pm |

Comment by junkmailer — February 10, 2017 @ 7:21 pm |

This is a test:

$latex[x^2 + \phi]$

Comment by Anonymous — March 7, 2017 @ 4:35 am |

I think I understand now. For the operator norm question, has eigenvalues which are bounded above by .

For the positive definite imaginary part, I am still a bit confused. The imaginary part of does not even seem to be Hermitian. But I think I see how to get the conclusion that follows anyway: The eigenvalues above have positive imaginary part . Using the fact that has an orthogonal eigenbasis, you can now calculate that the has a nonnegative imaginary part for any .

Is this what it means for the imaginary part of $\latex R$ to be positive definite?

Comment by hhh — March 19, 2017 @ 6:11 pm |

I think I understand now. For the operator norm question, has eigenvalues which are bounded above by .

For the positive definite imaginary part, I am still a bit confused. The imaginary part of does not even seem to be Hermitian. But I think I see how to get the conclusion that follows anyway: The eigenvalues above have positive imaginary part . Using the fact that has an orthogonal eigenbasis, you can now calculate that the has a nonnegative imaginary part for any .

Is this what it means for the imaginary part of $\latex R$ to be positive definite?

Comment by hhh — March 19, 2017 @ 6:12 pm |

This proposition is true, though you’re quite right that I should have mentioned it. Here’s a proof sketch: If is immodest, then it generates what I called in the proof of Proposition 2 an ‘immodest S5’ Kripke frame—i.e., the relation partitions into equivalence classes, where each equivalence class . Then, for each pair of worlds , either (if ) or (if ). So, for each ,

And thus, if you treat as a local expert,

Comment by jdmitrig — June 19, 2017 @ 10:04 pm |

Thanks for some otheг excellent article. Ꮃhere

else may anyone get that type of info in suh an ideal meаns of writing?

I have a presentation neҳt week, and I am

on thee search fοr ѕuch info.

Comment by banque internet — June 27, 2017 @ 4:26 pm |