A proof of Shelah's partition theorem (Q1902340)

The author presents a proof of a recent partition theorem of Shelah: If \(\mu\) is a singular strong limit such that \(2^\mu> \mu^+\) then \({\mu^+ \choose \mu}\to {\mu^+ \choose {\mu+1}}^{1,1}_{\text{cf } \mu}\). This particular arrow is taken to mean: If \(\mu^+\times \mu\) is colored using fewer than \(\text{cf } \mu\) colors then there is a monochromatic rectangle \(A\times B\) where \(A\) and \(B\) have order \(\mu+1\) and \(\mu\), respectively. The proof is self-contained (this was the main purpose of the note) except for one key fact from pcf theory: There is a sequence of regular cardinals, converging to \(\mu\), whose reduced product modulo the bounded subsets of \(\text{cf } \mu\) is \(\mu^{++}\)-directed.