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.

Georgii: Let me start with some brief remarks. In a series of three papers: a. Wacław Sierpiński, "Contribution à la théorie des séries divergentes", Comp. Rend. Soc. Sci. Varsovie 3 (1910) 89–93 (in Polish). b. Wacław Sierpiński, "Remarque sur la théorème de Riemann relatif aux séries semi-convergentes", Prac. Mat. Fiz. XXI (1910) 17–20 […]

What precisely do you mean by a standard model? An $\omega$-model? (That is, a model whose set of natural numbers is isomorphic to $\omega$.) Or a $\beta$-model? (That is, a model whose ordinals are well-ordered.) If the latter, the Mostowski collapse theorem tells us any such model is isomorphic in a unique way to a unique transitive model. If the former, t […]

This is Theorem 39 in the paper (see Theorem 4.(i) for a user-friendly preview). But the fact that $(2^\kappa)^+\to(\kappa^+)^2_\kappa$ is older (1946) and due to Erdős, see here: Paul Erdős. Some set-theoretical properties of graphs, Univ. Nac. Tucumán. Revista A. 3 (1942), 363-367 MR5,151d. (Anyway, it is probably easier to read a more modern presentation, […]

This is a nice problem. Here is what I know. (Below, I refer to the Handbook. This is the Handbook of Set Theory, Foreman, Kanamori, eds., Springer, 2010.) First of all, the consistency of the failure of diamond at a weakly compact cardinal seems open. Woodin has asked this explicitly, I do not know if the question itself is due to him. Of course, $\diamonds […]

I thought about this question a while ago, while teaching a topics course. Since one can easily check that $${}|{\mathbb R}|=|{\mathcal P}({\mathbb N})|$$ by a direct construction that does not involve diagonalization, the question can be restated as: Is there a proof of Cantor's theorem that ${}|X|

Assuming that $\gamma$ is finite, the argument is fairly simple: Suppose $\beta\to(\alpha)^\gamma_\delta$, and fix a bijection $f$ between $|\beta|$ and $\beta$. Consider a coloring $c:[|\beta|]^\gamma\to\delta$. Using $f$ , this gives us a coloring $c':[\beta]^\gamma\to\delta$ (here we used that $\gamma$ is finite). We want to argue that there is a $c$ […]

An example I like is this: Say two sets of natural numbers are almost disjoint iff they are infinite but their intersection is finite. Suppose $\mathcal F$ is an uncountable family of almost disjoint sets. Then the collection of characteristic functions of the sets in $\mathcal F$ is an example. (If $A$ is a subset of $\mathbb N$, then its characteristic fun […]

The set $\mathrm{Def}(X)$ consists of all subsets of $X$ first-order definable in the structure $(X,\in)$ from parameters. What matters here is that there are only countably many formulas, and only $|X^{

There is no slowest divergent series. Let me take this to mean that given any sequence $a_n$ of positive numbers converging to zero whose series diverges, there is a sequence $b_n$ that converges to zero faster and the series also diverges, where "faster" means that $\lim b_n/a_n=0$. In fact, given any sequences of positive numbers $(a_{1,n}), (a_{ […]

Yes. In fact, by a counting argument, most dense co-dense sets are neither $G_\delta$ nor $F_\sigma$. The point is that there are exactly as many $G_\delta$ or $F_\sigma$ as there are real numbers, but there are as many dense co-dense sets as there are sets of real numbers. In somewhat more detail: There are only countably many rationals, so there are counta […]

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.