I want to have an index entry typeset as $a_\text{T}$, so I issue the command \index{at@$a_\text{T}$}. Each use of this index command creates a separate line in the index. How can I get \makeindex to recognize they all reference the same topic?  My index entries look like this:
Dear all I think I have a problem with the collation of makeidx.  following some suggestions found here I have got in the text something like this  \index[p]{Plutarco!demalignitate@\textit{De Malignitate Herodoti}!00855 @855A|qt}  \index[p]{Plutarco!demalignitate@\textit{De Malignitate Herodoti}!00868 @868f-869b|nn{\thefootnote}}   the first is an \index entry in the text, the second in a footnote. My problem is that even if I put the sort also on the second level of indexing it keeps keeping them separated.  I use this package information  \usepackage[splitindex]{imakeidx} \makeindex[name=n, title=Nomi di persone e luoghi]  \makeindex[name=p, title=Passi citati nel testo] \makeindex[name=t, title=Altri testi citati] \makeindex[name=pap, title=Papiri e manoscritti citati nel testo]  \newcommand{\nn}[2]{#2 \textit{n}#1} \newcommand{\qt}[1]{\textbf{#1}}   in the .idx file I get this  \indexentry{Plutarco!demalignitate@\textit{De Malignitate Herodoti}!00855 @855A|hyperindexformat{\qt}}{8}  \indexentry{Plutarco!demalignitate@\textit  {De Malignitate Herodoti}!00868 @868 b-c|hyperindexformat{\nn{33}}}{10}   can somebody advise me on what I am doing wrong here, please? I have tried to use \string after the first sort with no effect.    sure, sorry: this is the file I'm using  \documentclass[12pt,a4paper]{book} \usepackage[utf8x]{inputenx}  \usepackage{palatino}        \usepackage[LGR,T1]{fontenc} \usepackage[english,german,polutonikogreek,italian]{babel}  \usepackage[splitindex]{imakeidx} \makeindex[name=p, title=Passi citati nel testo,columns=1] \newcommand{\nn}[2]{#2 \textit{n}#1} \newcommand{\qt}[1]{\textbf{#1}} \usepackage[hidelinks]{hyperref} \begin{document}  (855A\index[p]{Plutarco!demalignitate@\textit{De Malignitate Herodoti}!00855 @855A|qt})% \footnote{DHM 868 B-C\index[p]{Plutarco!demalignitate@\textit{De Malignitate Herodoti}!00868 @868 b-c|nn{\thefootnote}}} \printindex[p] \end{document}
I don't think I've seen any answers to this question, but I'm curious as to why, when you have a 64-bit OS installed (ex: Vista x64), IE defaults to the 32-bit version? Are there drawbacks to using the x64 version of IE (IE8, specifically)? Manually change filetype icons in Windows 7 I'm trying to find the dialog tab in Windows 7 that allows a user to change the icon used for a particular file type.  In Windows XP it would be under the Folder Options properties dialog.    Where is it on Windows 7?  I only want to change the icon of a specific filetype, to anything I want but this tab is no longer present in Folder Options of Windows 7. Does a US citizen traveling by plane in Mexico (international flight), for example from Mexicali to Mexico City need to have a passport? I"m studying normalization and have been reading through descriptions and examples online. One Concept that isn't clear to me is if the process can be automated at any point. I understand that a system can't tell you if you schema makes any real-world sense, but it seems likely to me that if you feed a program some arguments say, the functional dependencies, it would be able to do some steps for you.  Say you have a relationship R(A,B,C,D)  and you tell your program that A,B->C and A->D and that the primary key is (A,B)  Now if my understanding serves me correctly it should be possible for a program to identify that A->D violates 2NF because D depends on A and A is a subset of the primary key. That the proper decomposition would be R1(A,B,C) and R2(A,D).   The main book i'm learning from and my instructor indicate these normalization's are done all by hand. Is this correct or can some parts be automated? How to resolve a Java Rounding Double issue Seems like the subtraction is triggering some kind of issue and the resulting value is wrong.  double tempCommission = targetPremium.doubleValue()*rate.doubleValue()/100d;   78.75 = 787.5 * 10.0/100d  double netToCompany = targetPremium.doubleValue() - tempCommission;   708.75 = 787.5 - 78.75  double dCommission = request.getPremium().doubleValue() - netToCompany;   877.8499999999999 = 1586.6 - 708.75  The resulting expected value would be 877.85.  What should be done to ensure the correct calculation? Proving that $\lim\limits_{x \to 0}\frac{e^x-1}{x} = 1$ When should unions be used? Why do we need them? How do I go about proving this? I know one method is:  $\eqalign{    \cos (90^\circ + \theta ) &amp;\equiv \cos90^\circ \cos\theta  - \sin90^\circ \sin\theta   \cr    &amp;  \equiv (0)(\cos\theta ) - (1)(\sin \theta )  \cr    &amp;  \equiv  - \sin \theta  \cr} $  I'd appreciate others, particularly ones that will allow me to visualize this identity on the unit circle.  Thanks alot. Showing that $e^x > 1+x$ The most obvious answer everyone over the Internet is giving to this question is "Because anime is produced much faster compared to manga, they need to put in fillers in order to slow down the anime series". However, that shouldn't be the only reason.  For example, consider One Piece. The show is going on for more than 500 episodes, and less than 10% are fillers. Comparing that to Naruto, the show has almost the same number of episodes (original and Shippuuden combined), but almost 50% of its episodes are fillers. Needless to say, the manga of Naruto is so far ahead that the anime won't be able to catch up even if they produce 100+ episodes without any fillers. I know that there are questions asking like "intersection of a infinite collection of sets" and I can understand that the answer for that one is a null set, but I got a question here, in which all sets are finite and nonempty. Please take a look at the pic below.  It's a True/False question.  What I'm confused about is that the "infinity" sign in the interception. Since all sets are finite, does it mean that there are many sets in the chain are the same? (because the symbol used is for subsets not for proper subsets). Please give me some hints how I should think about this question.  Thank you How to compare Unicode strings in Javascript? Infinity, is clearly not . But there is some dissent on whether or not zero is finite. I have seen authors use "finite" to indicate the value of $0$ is excluded as well as infinity.  Is there any rule about this? How do I autohide the top panel in Unity? When windows are not maximized, the top panel is basically wasted space for me in Unity.  Is there a way to make it autohide? i.e. make it appear on mouse over. Cycles Normal Bake does'nt bake indents that are not tapered I can bake high poly normal maps with a lot of success, however if I try to bake a very simple indentation on a cube with no tapering I get a flat baked normal map, please see the below image to clarify what I mean.   I dont know I am doing wrong because if I scale down the indented face slightly it will bake the normal map correctly, as seen in the image below. Is it possible to write all mathematical formulas in a separate file and add them in main file on-demand? Default class inheritance access These two operators commute...but their eigenvectors aren't all the same. Why? The Hamiltonian   $$H =  \left[ \begin{array}{cccc} a &amp; 0 &amp; 0 &amp; -b \\ 0 &amp; 0 &amp; -b &amp; 0\\ 0 &amp; -b &amp; 0 &amp; 0\\ -b &amp; 0 &amp; 0 &amp; -a \end{array} \right] $$  commutes with the qubit exchange operator  $$ P = \left[ \begin{array}{cccc} 1 &amp; 0 &amp; 0 &amp; 0 \\ 0 &amp; 0 &amp; 1 &amp; 0\\ 0 &amp; 1 &amp; 0 &amp; 0\\ 0 &amp; 0 &amp; 0 &amp; 1 \end{array} \right] $$  So I would expect the two to have the same eigenvectors. The eigenvectors of $P$ are easily seen to be $(1,0,0,0)^T; (0,0,0,1)^T; (0,1,1,0)^T ; (0,1,-1,0)^T$. The latter two are also eigenvectors of $H$, but the first two are not. Why? I thought commuting operators shared the same eigenbasis? Assume $x$ doesn't occur free in $\alpha$, show that: $$\vdash (\forall x \beta \to \alpha) \leftrightarrow \exists x (\beta \to \alpha)$$   This is an exercise on page 130, A Mathematical Introduction to Logic, Herbert B. Enderton（2ed).   Here's my attempt: For the '$\to$' direction, since $x$ doesn't occur free in $\alpha$, we have $α→∀x α$ and $\forall x \alpha \to \alpha$ as logical axiom(In the second formula, we have$\alpha_x^x = \alpha$). Thus it suffice to show $\vdash (\forall x \beta \to \forall x \alpha) \rightarrow \exists x (\beta \to \alpha)$. By logical axiom $∀ x(α→β)→( ∀ x α→∀x β)$, it would suffice to show $\vdash \forall x (\beta \to   \alpha) \rightarrow (\exists x (\beta \to \alpha))$. It has been shown in a previous exercise that there's a deduction $∀ x ϕ→∃x ϕ$, so we are done for the "$\to$" part.  The problem for me is how to show the "$\leftarrow$" direction.  Added: Here's logical axioms that we can employ:         Tautologies(in the sense of propositional logic);   $∀ x α →α^x_ t $, where $t$ is substitutable for $x$ in $α$ ($α^x_ t$ is the formula derived from $\alpha$ by replacing $x$ by a term $t$);   $∀ x(α→β)→( ∀ x α→∀x β)$;   $α→∀x α$, where $x$ does not occur free in $α$.      Besides, generalization theorem and deduction principle can be utilized:     If $\Gamma \vdash ϕ$ and $x$ do not occur free in any   formula in$\Gamma$, then$\Gamma \vdash ∀ x ϕ$.      If $\Gamma ; γ \vdash ϕ,$ then $\Gamma \vdash  γ \to ϕ$. The Mac editor Latexian has built in methods for compiling using latex+dvips, pdflatex and xelatex.  Furthermore, it assumes bibtex and makeindex to deal with bibliographies and indexes, respectively.  How do I customize Latexian to use, e.g. LuaTeX for compiling or Biber for bibliographies?