<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=68.44.0.0%2F16</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=68.44.0.0%2F16"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/68.44.0.0/16"/>
	<updated>2026-07-09T13:40:36Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Specht_module&amp;diff=13826</id>
		<title>Specht module</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Specht_module&amp;diff=13826"/>
		<updated>2013-12-02T00:32:43Z</updated>

		<summary type="html">&lt;p&gt;68.44.67.172: A tabloid is an equivalence class of labelings of the Young diagram that are not necessarily tableaux; there is a unique tableau in each equivalence class.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[set theory]], a set is called &#039;&#039;&#039;hereditarily countable&#039;&#039;&#039; if it is a [[countable set]] of [[hereditary property|hereditarily]] countable sets. This [[inductive definition]] is in fact [[well-founded]] and can be expressed in the language of [[first-order logic|first-order]] set theory. A set is hereditarily countable if and only if it is countable, and every element of its [[transitive set|transitive closure]] is countable. If the [[axiom of countable choice]] holds, then a set is hereditarily countable if and only if its transitive closure is countable. &lt;br /&gt;
&lt;br /&gt;
The [[class (set theory)|class]] of all hereditarily countable sets can be proven to be a set from the axioms of [[Zermelo–Fraenkel set theory]] (ZF) without any form of the [[axiom of choice]], and this set is designated &amp;lt;math&amp;gt;H_{\aleph_1}&amp;lt;/math&amp;gt;. The hereditarily countable sets form a model of [[Kripke–Platek set theory]] with the [[axiom of infinity]] (KPI), if the axiom of countable choice is assumed in the [[metatheory]].&lt;br /&gt;
&lt;br /&gt;
If &amp;lt;math&amp;gt;x \in H_{\aleph_1}&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;L_{\omega_1}(x) \subset H_{\aleph_1}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
More generally, a set is &#039;&#039;&#039;hereditarily of cardinality less than κ&#039;&#039;&#039; if and only it is of [[cardinality]] less than κ, and all its elements  are hereditarily of cardinality less than κ; the class of all such sets can also be proven to be a set from the axioms of ZF, and is designated &amp;lt;math&amp;gt;H_\kappa \!&amp;lt;/math&amp;gt;. If the axiom of choice holds and the cardinal κ is regular, then a set is hereditarily of cardinality less than κ if and only if its transitive closure is of cardinality less than κ.  &lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Hereditarily finite set]]&lt;br /&gt;
*[[Constructible universe]]&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
*[http://www.jstor.org/pss/2273380 &amp;quot;On Hereditarily Countable Sets&amp;quot;] by [[Thomas Jech]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Set theory]]&lt;br /&gt;
[[Category:Large cardinals]]&lt;br /&gt;
&lt;br /&gt;
{{settheory-stub}}&lt;/div&gt;</summary>
		<author><name>68.44.67.172</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Quantum_depolarizing_channel&amp;diff=26586</id>
		<title>Quantum depolarizing channel</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Quantum_depolarizing_channel&amp;diff=26586"/>
		<updated>2013-09-10T13:06:06Z</updated>

		<summary type="html">&lt;p&gt;68.44.88.133: /* Outline of the proof of the additivity of Holevo information */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[mathematics]], specifically [[abstract algebra]], if (&#039;&#039;G&#039;&#039;, +) is an [[abelian group]] then &amp;lt;math&amp;gt;\scriptstyle \nu\colon G \to \mathbb{R}&amp;lt;/math&amp;gt; is said to be a &#039;&#039;&#039;norm on the abelian group&#039;&#039;&#039; (&#039;&#039;G&#039;&#039;, +) if:&lt;br /&gt;
&amp;lt;ol&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;&amp;lt;math&amp;gt;\scriptstyle \nu(g) &amp;gt; 0&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;\scriptstyle g\ne 0&amp;lt;/math&amp;gt;,&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;&amp;lt;math&amp;gt;\scriptstyle \nu(g+h) \le \nu(g) + \nu(h)&amp;lt;/math&amp;gt;,&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;&amp;lt;math&amp;gt;\scriptstyle \nu(mg) = |m| \nu(g)&amp;lt;/math&amp;gt; if &amp;lt;math&amp;gt;\scriptstyle m \in \mathbb{Z}&amp;lt;/math&amp;gt;.&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ol&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The norm &#039;&#039;ν&#039;&#039; is &#039;&#039;&#039;discrete&#039;&#039;&#039; if there is some [[real number]] &#039;&#039;ρ&#039;&#039; &amp;gt; 0 such that &#039;&#039;ν&#039;&#039;(&#039;&#039;g&#039;&#039;) &amp;gt; &#039;&#039;ρ&#039;&#039; whenever &#039;&#039;g&#039;&#039; ≠ 0.&lt;br /&gt;
&lt;br /&gt;
== Free abelian groups ==&lt;br /&gt;
An abelian group is a [[free abelian group]] [[if and only if]] it has a discrete norm.&amp;lt;ref&amp;gt;{{citation&lt;br /&gt;
 | last = Steprāns | first = Juris&lt;br /&gt;
 | doi = 10.2307/2044776&lt;br /&gt;
 | issue = 2&lt;br /&gt;
 | journal = Proceedings of the American Mathematical Society&lt;br /&gt;
 | mr = 770551&lt;br /&gt;
 | pages = 347–349&lt;br /&gt;
 | title = A characterization of free abelian groups&lt;br /&gt;
 | volume = 93&lt;br /&gt;
 | year = 1985}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Abelian group theory]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Abstract-algebra-stub}}&lt;/div&gt;</summary>
		<author><name>68.44.88.133</name></author>
	</entry>
</feed>