After his first set of theorems involving queen-accessibility, Professor Halfbrain started wondering about infinite chessboards rather than just ones with arbitrary large dimensions.
He came up with a few new theorems:
Theorem 1a. If the squares of an infinite chessboard are coloured with two colours, then the squares of at least one of the colours will form a queen-connected set.
Theorem 1b. If the squares of an infinite chessboard are coloured with three colours, then the squares of at least one of the colours will form a queen-connected set.
Theorem 1c. If the squares of an infinite chessboard are coloured with four colours, then the squares of at least one of the colours will form a queen-connected set.
Let a queen-connected component of a set $S$ of squares be a subset $C$ that is queen-connected, where no other squares in $S$ are queen-accessible from $C$.
Theorem 2a. If the squares of an infinite chessboard are coloured with five colours, then the squares of at least one of the colours will have fewer than five queen-connected components.
Theorem 2b. If the squares of an infinite chessboard are coloured with $n \ge 6$ colours, then the squares of at least one of the colours will have fewer than $n$ queen-connected components.
Can you prove or disprove these theorems? For which values of $n$ does theorem 2b hold true?