<?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=130.123.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=130.123.0.0%2F16"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/130.123.0.0/16"/>
	<updated>2026-09-29T05:47:32Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Laplace_expansion&amp;diff=12246</id>
		<title>Laplace expansion</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Laplace_expansion&amp;diff=12246"/>
		<updated>2013-06-10T03:41:43Z</updated>

		<summary type="html">&lt;p&gt;130.123.104.22: /* Example */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In mathematics, in the field of [[functional analysis]], a &#039;&#039;&#039;Minkowski functional&#039;&#039;&#039; is a function that recovers a notion of distance on a linear space.&lt;br /&gt;
&lt;br /&gt;
Let &#039;&#039;K&#039;&#039; be a symmetric convex body in a linear space &#039;&#039;V&#039;&#039;.  We define a function &#039;&#039;p&#039;&#039; on &#039;&#039;V&#039;&#039; as&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p(x) = \inf \{ \lambda \in \mathbb{R}_{&amp;gt; 0} : x \in \lambda K \} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
if that [[infimum]] is well-defined.&amp;lt;ref&amp;gt;Thompson (1996) p.17&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Motivation ==&lt;br /&gt;
===Example 1===&lt;br /&gt;
&lt;br /&gt;
Consider a [[normed vector space]] &#039;&#039;X&#039;&#039;, with the norm ||·||. Let &#039;&#039;K&#039;&#039; be the unit sphere in &#039;&#039;X&#039;&#039;. Define a function &#039;&#039;p : X →&#039;&#039; &#039;&#039;&#039;R&#039;&#039;&#039; by &lt;br /&gt;
:&amp;lt;math&amp;gt;p(x) = \inf \left\{r &amp;gt; 0: x \in r K \right\}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
One can see that &amp;lt;math&amp;gt;p(x) = \|x\|&amp;lt;/math&amp;gt;, i.e. &#039;&#039;p&#039;&#039; is just the norm on &#039;&#039;X&#039;&#039;. The function &#039;&#039;p&#039;&#039; is a special case of a Minkowski functional.&lt;br /&gt;
&lt;br /&gt;
=== Example 2===&lt;br /&gt;
&lt;br /&gt;
Let &#039;&#039;X&#039;&#039; be a vector space without topology with underlying scalar field &#039;&#039;&#039;K&#039;&#039;&#039;. Take &#039;&#039;φ ∈  X&#039; &#039;&#039;, the algebraic dual of &#039;&#039;X&#039;&#039;, i.e. &#039;&#039;φ : X →&#039;&#039; &#039;&#039;&#039;K&#039;&#039;&#039; is a linear functional on &#039;&#039;X&#039;&#039;. Fix &#039;&#039;a &amp;gt; 0&#039;&#039;. Let the set &#039;&#039;K&#039;&#039; be given by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;K = \{ x \in X : | \phi(x) | \leq a \}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Again we define &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p(x) = \inf \left\{r &amp;gt; 0: x \in r K \right\}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Then&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p(x) = \frac{1}{a} | \phi(x) |.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The function &#039;&#039;p&#039;&#039;(&#039;&#039;x&#039;&#039;) is another instance of a Minkowski functional. It has the following properties:&lt;br /&gt;
&lt;br /&gt;
#It is &#039;&#039;subadditive&#039;&#039;: &#039;&#039;p&#039;&#039;(&#039;&#039;x&#039;&#039; + &#039;&#039;y&#039;&#039;) ≤ &#039;&#039;p&#039;&#039;(&#039;&#039;x&#039;&#039;) + &#039;&#039;p&#039;&#039;(&#039;&#039;y&#039;&#039;),&lt;br /&gt;
#It is &#039;&#039;homogeneous&#039;&#039;: for all &#039;&#039;α&#039;&#039; ∈ &#039;&#039;&#039;K&#039;&#039;&#039;, &#039;&#039;p&#039;&#039;(&#039;&#039;α x&#039;&#039;) = |&#039;&#039;α&#039;&#039;| &#039;&#039;p&#039;&#039;(&#039;&#039;x&#039;&#039;),&lt;br /&gt;
#It is nonnegative.&lt;br /&gt;
&lt;br /&gt;
Therefore &#039;&#039;p&#039;&#039; is a [[seminorm]] on &#039;&#039;X&#039;&#039;, with an induced topology. This is characteristic of Minkowski functionals defined via &amp;quot;nice&amp;quot; sets. There is a one-to-one correspondence between seminorms and the Minkowski functional given by such sets. What is meant precisely by &amp;quot;nice&amp;quot; is discussed in the section below. &lt;br /&gt;
&lt;br /&gt;
Notice that, in contrast to a stronger requirement for a norm, &#039;&#039;p(x) = 0&#039;&#039; need not imply &#039;&#039;x = 0&#039;&#039;. In the above example, one can take a nonzero &#039;&#039;x&#039;&#039; from the kernel of &#039;&#039;φ&#039;&#039;. Consequently, the resulting topology need not be [[Hausdorff space|Hausdorff]].&lt;br /&gt;
&lt;br /&gt;
== Definition ==&lt;br /&gt;
&lt;br /&gt;
The above examples suggest that, given a (complex or real) vector space &#039;&#039;X&#039;&#039; and a subset &#039;&#039;K&#039;&#039;, one can define a corresponding Minkowski functional&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p_K:X \rightarrow [0, \infty)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p_K (x) = \inf \left\{r &amp;gt; 0: x \in r K \right\},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which is often called the gauge of &amp;lt;math&amp;gt;K&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
It is implicitly assumed in this definition that 0 ∈ &#039;&#039;K&#039;&#039; and the set {&#039;&#039;r&#039;&#039; &amp;gt; 0: &#039;&#039;x&#039;&#039; ∈ &#039;&#039;r K&#039;&#039;} is nonempty. In order for &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039; to have the properties of a seminorm, additional restrictions must be imposed on &#039;&#039;K&#039;&#039;. These conditions are listed below.&lt;br /&gt;
&lt;br /&gt;
#The set &#039;&#039;K&#039;&#039; being [[convex set|convex]] implies the subadditivity of &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;.&lt;br /&gt;
#[[Homogeneous function|Homogeneity]], i.e. &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;α x&#039;&#039;) = |&#039;&#039;α&#039;&#039;| &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;x&#039;&#039;) for all &#039;&#039;α&#039;&#039;, is ensured if &#039;&#039;K&#039;&#039; is &#039;&#039;balanced&#039;&#039;, meaning &#039;&#039;α K&#039;&#039; ⊂ &#039;&#039;K&#039;&#039; for all |&#039;&#039;α&#039;&#039;| ≤ 1.&lt;br /&gt;
&lt;br /&gt;
A set &#039;&#039;K&#039;&#039; with these properties is said to be [[absolutely convex set|absolutely convex]].&lt;br /&gt;
&lt;br /&gt;
=== Convexity of &#039;&#039;K&#039;&#039; ===&lt;br /&gt;
&lt;br /&gt;
A simple geometric argument that shows convexity of &#039;&#039;K&#039;&#039; implies subadditivity is as follows. Suppose for the moment that &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;x&#039;&#039;) = &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;y&#039;&#039;) = &#039;&#039;r&#039;&#039;. Then for all &#039;&#039;ε&#039;&#039; &amp;gt; 0, we have &#039;&#039;x&#039;&#039;, &#039;&#039;y&#039;&#039; ∈ (&#039;&#039;r + ε&#039;&#039;) &#039;&#039;K&#039;&#039; = &#039;&#039; K&#039; &#039;&#039;. The assumption that &#039;&#039;K&#039;&#039; is convex means &#039;&#039; K&#039; &#039;&#039; is also. Therefore ½ &#039;&#039;x&#039;&#039; + ½ &#039;&#039;y&#039;&#039; is in &#039;&#039; K&#039; &#039;&#039;. By definition of the Minkowski functional &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;, one has&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p_K\left( \frac{1}{2} x + \frac{1}{2} y\right) \le r + \epsilon = \frac{1}{2} p_K(x) + \frac{1}{2} p_K(y) + \epsilon .&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
But the left hand side is ½ &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;x&#039;&#039; + &#039;&#039;y&#039;&#039;), i.e. the above becomes&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p_K(x + y) \le  p_K(x) + p_K(y) + \epsilon, \quad \mbox{for all} \quad \epsilon &amp;gt; 0.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the desired inequality. The general case &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;x&#039;&#039;) &amp;gt; &#039;&#039;p&amp;lt;sub&amp;gt;K&amp;lt;/sub&amp;gt;&#039;&#039;(&#039;&#039;y&#039;&#039;) is obtained after the obvious modification.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Note&#039;&#039;&#039; Convexity of &#039;&#039;K&#039;&#039;, together with the initial assumption that the set {&#039;&#039;r&#039;&#039; &amp;gt; 0: &#039;&#039;x&#039;&#039; ∈ &#039;&#039;r K&#039;&#039;} is nonempty, implies that &#039;&#039;K&#039;&#039; is [[absorbing set|&#039;&#039;absorbent&#039;&#039;]].&lt;br /&gt;
&lt;br /&gt;
=== Balancedness of &#039;&#039;K&#039;&#039; ===&lt;br /&gt;
&lt;br /&gt;
Notice that &#039;&#039;K&#039;&#039; being balanced implies that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\lambda x \in r K \quad \mbox{if and only if} \quad x \in \frac{r}{|\lambda|} K.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Therefore &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;p_K (\lambda x) = \inf \left\{r &amp;gt; 0:  \lambda x \in r K \right\} &lt;br /&gt;
=  \inf \left\{r &amp;gt; 0:  x \in \frac{r}{|\lambda|} K \right\}&lt;br /&gt;
= \inf \left\{ | \lambda | \frac{r}{ | \lambda | } &amp;gt; 0:  x \in \frac{r}{|\lambda|} K \right\}&lt;br /&gt;
= |\lambda| p_K(x).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Hadwiger&#039;s theorem]]&lt;br /&gt;
* [[Hugo Hadwiger]]&lt;br /&gt;
* [[Morphological image processing]]&lt;br /&gt;
&lt;br /&gt;
==Notes==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* {{cite book | title=Minkowski Geometry | series=Encyclopedia of Mathematics and Its Applications | first=Anthony C. | last=Thompson | publisher=[[Cambridge University Press]] | year=1996 | isbn=0-521-40472-X }}&lt;br /&gt;
&lt;br /&gt;
[[Category:Functional analysis]]&lt;br /&gt;
[[Category:Convex analysis]]&lt;/div&gt;</summary>
		<author><name>130.123.104.22</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Row_and_column_spaces&amp;diff=224094</id>
		<title>Row and column spaces</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Row_and_column_spaces&amp;diff=224094"/>
		<updated>2011-08-09T02:18:33Z</updated>

		<summary type="html">&lt;p&gt;130.123.96.22: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You big issue how to increase web traffic,and every day big one numerous webmasters too.You are burning to get instant traffic, but realise that long lasting traffic requires methods that can be sustained and, within a cases, will sustain themselves after a short time. Bravo! That&#039;s a very practical, professional and ultimately successful tackle.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
 &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Optimize your website for the search engines-By now, you have a domain. Right? If not, are usually the you waiting? If you have got a website, is it properly optimized for search engines? In other words, when people use Google to source the products and services enterprise offers, anyone show up at the top the search results? Or are other sellers outranking then you? Optimizing your website is one kind of the best things however do to get quality traffic that evolves into good brings.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Buying web traffic is quite typical on every company. Though some are effective hiring special staffs with their space, others resort to outsourcing which saves them more wealth. Though they knew the risks, they definitely will take it simply to grow their income. A lot of them currently successful but more of them failed. Whenever you want to grow your rank on a certain search engine, it is advisable to hire SEO to optimize your place. It could cost you offer but make sure that you&#039;re gaining a refund through higher sales.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;You might submit articles to major directories. Require once again target your market and write this subject method. You can include a website link to your own website this way as let me tell you. If you are terrible at writing there greater level of quality freelance writing services in which may do this for you can. You can then put your name on post as creator and you are the full credit for that content.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Here&#039;s the crunch. Failure to take care of your steady pace will cause you to that graveyard of hope - I understand you won&#039;t be one among the members in that respect there! It&#039;s not technically demanding nor does it look difficult to do, an individual need both planning and resourcefulness to grasp that plan to fruition. Traffic will be slow to reach first; locate discouraging as well as is where you need your determination. However, your research tells you that you may get there therefore, you know you are well on the right path, hence you can readily encourage yourself retain going. As the visitors start to arrive your time and effort will be rewarded.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Investment Frauds: They usually tout spectacular profits without risk. Rather than making money, you lose it. Never accept a party invitation to within your an investment opportunity. Investments should be manufactured at a local, reputable investment company or bank and always bring your son, daughter or every.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Simple put, you is certain to get traffic world wide web almost effortlessly if considerable time about a few months consistently and aggressively link building back to your website. You can achieve tremendous results indeed for years.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;If you have any kind of inquiries relating to where and how you can use [http://www.trafficfaze.com/ buy web traffic], you can contact us at our own web-site.&lt;/div&gt;</summary>
		<author><name>130.123.96.22</name></author>
	</entry>
</feed>