All blackboards are gone. They were replaced during the break. (So, no chance to use this MathOverflow question on the near future.) Makes me think of T.H. Huxley’s On a Piece of Chalk (see here) and wonder what the equivalent will be in a few decades.

On the plus side, we now have computers and projection equipment on each classroom. I am using this quite a bit in my abstract algebra class. Except that, during the first few weeks, it was more often than not that the keyboard would be locked away.

Annoyed, I called OIT and asked that they please make sure it was unlocked before my class. It worked for a few days. But then, again, I found it locked.

I called again (I was charming, I am sure). So, somebody came to the classroom, looked at me, smiled. And pressed a button, to open the drawer.

Sigh.

(In my defense, the class is at 8:30 in the morning, and I’m supposed to drink less coffee these days. But still.)

(“Thanks. I’m sorry. I’m an idiot.” “Oh, no, no. It is new.” “It is a button.”)

This entry was posted on Sunday, February 19th, 2012 at 4:26 pm and is filed under Life. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Have you had a chance to use a tablet+projection to replace the whiteboard? Infinite paper with infinite zoom to add additional comments in the right place is a great tool I use for taking notes, but never had a chance to use in class.

Let me address the first question. We can have models of $\mathsf{PA}$, $M\subsetneq N$ with $M$ cofinal in $N$. In fact, $M$ and $N$ do not even need to have the same cardinality. However, one can prove from the Davis-Matiyasevich-Putnam-Robinson theorem (on Hilbert's tenth problem) that already the assumption $M\subseteq N$ implies that $M$ is $\Sigma […]

The usual proof (as in Kanamori's book, section 11) is as follows: Work in $\mathsf{ZF}$. Note first, with Bernstein, that if $\omega_1\le\mathfrak c$, then there is a set of reals without the perfect set property: Either $\omega_1=\mathfrak c$, so $\mathbb R$ can be well-ordered, and we can build Bernstein sets using the usual transfinite recursion, or […]

Let $C$ be the standard Cantor middle-third set. As a consequence of the Baire category theorem, there are numbers $r$ such that $C+r$ consists solely of irrational numbers, see here. What would be an explicit example of a number $r$ with this property? Short of an explicit example, are there any references addressing this question? A natural approach would […]

The notions of Shelah cardinals and Woodin cardinals were introduced by Shelah and Woodin in their joint paper Large cardinals imply that every reasonably definable set of reals is Lebesgue measurable. Israel J. Math., 70 (3), (1990), 381–394. MR1074499 (92m:03087), which itself was the result of the hugely influential Martin's Maximum paper by Foreman, […]

The method of forcing certainly fits here. Before, set theorists expected that independence results would be obtained by building non-standard, ill-founded models, and model theoretic methods would be key to achieve this. Cohen's method begins with a transitive model and builds another transitive one, and the construction is very different from all the […]

If $\displaystyle S=\sum_{n=1}^\infty\frac{n}{2^n}$, then $$S-\frac12=\sum_{n=1}^\infty\frac{n+1}{2^{n+1}}=\frac12\sum_{n=1}^\infty\frac{n+1}{2^n}=\frac12\left(S+\sum_{n=1}^\infty\frac1{2^n}\right)=\frac12(S+1),$$ so $2S-1=S+1$, or $S=2$. All that remains is to justify that the series converges. But $n

$G_n$ is a union of open intervals $(\alpha,\beta)$. Add to $G_n$ two more open intervals, $(n-\delta_n,n+\delta_n)$ and $(n+1-\delta_n,n+1+\delta_n)$. This increases the (outer) measure of $G_n$ and therefore of $G_n\setminus F_n$ by at most $4\delta_n$. Since $m^*(G_n\setminus F_n)

Cohen's result is that from a certain set of axioms ($\mathsf{ZFC}$) we cannot prove the continuum hypothesis. Gödel's result is that from the same set of axioms, we cannot refute the continuum hypothesis. This only means that the set of axioms under consideration is not strong enough to settle this question. If you manage to exhibit a set of inter […]

The set $K$ is typically called the closure of $P$ under $+,\times$. We can define it recursively by setting $K_0=P$ and, given $K_n$, letting $K_{n+1}$ be $K_n\cup\{a+b\mid a,b\in K_n\}\cup\{a\times b\mid a,b\in K_n\}$. Finally, $K=\bigcup_n K_n$. The same idea applies to any number of operations, regardless of whether they are binary or not. Usually, given […]

There cannot be. First, if $x$ is rational, say $a/b$ where $a,b$ are relatively prime, let $q=p$ be a prime number. Then $q^x$ is irrational, because the $b$-th root of an integer is rational iff it is itself an integer. However, $x$ cannot be irrational, since it follows from the six exponentials theorem that if $p,q,r$ are three distinct primes, and $p^x, […]

This is quite hilarious (I sympathize).

Have you had a chance to use a tablet+projection to replace the whiteboard? Infinite paper with infinite zoom to add additional comments in the right place is a great tool I use for taking notes, but never had a chance to use in class.

I haven’t, but I probably should. I’ve heard Hugh Woodin uses this quite effectively teaching precalculus, of all things.