<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Topics on Supportive Quantitative Methods</title>
    <link>https://teach.pikappa.eu/methods/topics/</link>
    <description>Recent content in Topics on Supportive Quantitative Methods</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 07 Mar 2022 11:36:59 +0100</lastBuildDate><atom:link href="https://teach.pikappa.eu/methods/topics/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Sets</title>
      <link>https://teach.pikappa.eu/methods/topics/sets/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      
      <guid>https://teach.pikappa.eu/methods/topics/sets/</guid>
      <description>&lt;p&gt;A &lt;strong&gt;set&lt;/strong&gt; is a collection of different things. The things contained in a set are called &lt;strong&gt;elements&lt;/strong&gt; or &lt;strong&gt;members&lt;/strong&gt;. To denote the membership of \(a\) to a set \(A\) we write \(a\in A\) and read &amp;ldquo;a belongs in A&amp;rdquo; or &amp;ldquo;a is in A&amp;rdquo;. If we want to indicate that \(a\) is not a member of \(A\), we write \(a\not\in A\) and read &amp;ldquo;a does not belong in A&amp;rdquo; or &amp;ldquo;a is not in A&amp;rdquo;. A set without elements is called the empty set, and it is denoted by \(\emptyset\).&lt;/p&gt;</description>
    </item>
    
    <item>
      <title>Functions</title>
      <link>https://teach.pikappa.eu/methods/topics/functions/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      
      <guid>https://teach.pikappa.eu/methods/topics/functions/</guid>
      <description>&lt;p&gt;A &lt;strong&gt;function&lt;/strong&gt; is a rule that maps each element of a set \(X\) to exactly one element of a set \(Y\). The set \(X\) is called the &lt;strong&gt;domain&lt;/strong&gt; of the function, and the set \(Y\) is called the &lt;strong&gt;codomain&lt;/strong&gt; of the function. A function that maps \(X\) to \(Y\) is usually denoted by \(f\colon X \to Y\). For each element \(x\in X\), we write \(f(x)\) and read &amp;ldquo;f of x&amp;rdquo; to denote the element of \(Y\) to which \(x\) is mapped. A function with codomain the set of real numbers \(\mathbb{R}\) is called a &lt;strong&gt;real-valued function&lt;/strong&gt;. A function having the set of real numbers as its domain is called a &lt;strong&gt;function of a real variable&lt;/strong&gt;. It is usual to omit these specializations whenever they are understood from context, and simply refer to functions \(f\colon \mathbb{R} \to \mathbb{R}\) as functions instead of real-valued functions of a real variable.&lt;/p&gt;</description>
    </item>
    
    <item>
      <title>Differentiation</title>
      <link>https://teach.pikappa.eu/methods/topics/differentiation/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      
      <guid>https://teach.pikappa.eu/methods/topics/differentiation/</guid>
      <description>&lt;p&gt;A function’s rate of change conveys very useful information about the nature of the rule that associates the domain and the codomain of the function. Suppose, for example, that \(C\) is a function describing the cost of a production process. For each desired output quantity \(q\in \mathbb{R}_{\ge 0}\), \(C(q)\) gives the minimum production cost for \(q\) (we call such functions &lt;em&gt;cost functions&lt;/em&gt; in economics). Knowledge of \(C\) allows one to find the minimum cost for producing an output quantity of, say, \(5\). What if we want to calculate the incremental cost of &amp;ldquo;slightly increasing production&amp;rdquo; by a small amount? We can calculate the additional cost by examining the rate of change of the cost function (this is known in economics as the &lt;em&gt;marginal cost function&lt;/em&gt;).&lt;/p&gt;</description>
    </item>
    
    <item>
      <title>Optimization</title>
      <link>https://teach.pikappa.eu/methods/topics/optimization/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      
      <guid>https://teach.pikappa.eu/methods/topics/optimization/</guid>
      <description>&lt;p&gt;Decision problems in economics are predominantly described as optimization problems. For example, suppose that one has to decide among a finite number of alternatives \(\alpha_{1}, \alpha_{2}, \dots, \alpha_{n}\). Alternatives are evaluated based on a payoff function \(u\). The payoff she receives by choosing alternative \(\alpha_{j}\) is given by \(u(\alpha_{j})\). One way to model the agent&amp;rsquo;s decision is to assume that she chooses the alternative that maximizes the payoff she gains.&lt;/p&gt;</description>
    </item>
    
    <item>
      <title>A Hitchhiker&#39;s Guide to Mathematics for Economic Courses</title>
      <link>https://teach.pikappa.eu/methods/topics/guide/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      
      <guid>https://teach.pikappa.eu/methods/topics/guide/</guid>
      <description>&lt;p&gt;We can only cover so much in a short preparatory course. This topic proposes a guide to help you navigate through your future economic studies.&lt;/p&gt;</description>
    </item>
    
  </channel>
</rss>
