Plé úsáideora:Cliste/Teimpléid/nodaireacht na Mata

Ní aithin mé gach ceann a raibh ar an leathanach Béarla, mar sin d'fhág mé amach iad

Na cinn a d'fhág mé amach (As Béarla):

Tá cúpla do na cinn seo 'leath' isteach, má tá aon duine ag iarradh é a chur isteach is féidir é a cóipeáil ón leathanach seo

Siombail i HTML	Siombail in TeX	Ainm	Míniú	Shamplaí
		An slí a deirtear
		Catagóir
−	$-\!\,$	subtraction minus; take; subtract uimhríocht	9 − 4 means the subtraction of 4 from 9.	8 − 3 = 5
		negative sign negative; minus; the opposite of uimhríocht	−3 means the negative of the number 3.	−(−5) = 5
		set-theoretic complement minus; without set theory	A − B means the set that contains all the elements of A that are not in B. (\ can also be used for set-theoretic complement as described below.)	{1,2,4} − {1,3,4}  =  {2}
< >	$<\!\,$ $>\!\,$	éagothroime dian níos lú ná, níos mó ná order theory	x < y means x is less than y. x > y means x is greater than y.	3 < 4 5 > 4
		proper subgroup is a proper subgroup of group theory	H < G means H is a proper subgroup of G.	5Z < Z A3  <S3
≪ ≫	$\ll \!\,$ $\gg \!\,$	(very) strict inequality is much less than, is much greater than order theory	x ≪ y means x is much less than y. x ≫ y means x is much greater than y.	0.003 ≪ 1000000
		asymptotic comparison of smaller (greater) order than analytic number theory	f ≪ g means the growth of f is asymptotically bounded by g. (This is I. M. Vinogradov's notation. Another notation is the Big O notation, which looks like f = O(g).)	x ≪ ex
≤ ≥	$\leq \!\,$ $\geq \!\,$	inequality is less than or equal to, is greater than or equal to order theory	x ≤ y means x is less than or equal to y. x ≥ y means x is greater than or equal to y. (The forms <= and >= are generally used in programming languages where ease of typing and use of ASCII text is preferred.)	3 ≤ 4 and 5 ≤ 5 5 ≥ 4 and 5 ≥ 5
		subgroup is a subgroup of group theory	H ≤ G means H is a subgroup of G.	Z ≤ Z A3  ≤S3
		reduction is reducible to computational complexity theory	A ≤ B means the problem A can be reduced to the problem B. Subscripts can be added to the ≤ to indicate what kind of reduction.	If $\exists f\in F{\mbox{ . }}\forall x\in \mathbb {N} {\mbox{ . }}x\in A\Leftrightarrow f(x)\in B$ then $A\leq _{F}B$
≺	$\prec \!\,$	Karp reduction is Karp reducible to; is polynomial-time many-one reducible to computational complexity theory	L1 ≺ L2 means that the problem L1 is Karp reducible to L2.	If L1 ≺ L2 and L2 ∈ P, then L1 ∈ P.
⊧	$\vDash \!\,$	entailment entails model theory	A ⊧ B means the sentence A entails the sentence B, that is in every model in which A is true, B is also true.	A ⊧ A ? ¬A
⊢	$\vdash \!\,$	inference infers; is derived from propositional logic, predicate logic	x ⊢ y means y is derivable from x.	A ? B ⊢ ¬B ? ¬A.
⊗	$\otimes \!\,$	tensor product, tensor product of modules tensor product of linear algebra	$V\otimes U$ means the tensor product of V and U. $V\otimes _{R}U$ means the tensor product of modules V and U over the ring R.	{1, 2, 3, 4} ⊗ {1, 1, 2} = {{1, 2, 3, 4}, {1, 2, 3, 4}, {2, 4, 6, 8}}