Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Path-connected means every pair is joined by a continuous map from ; a separation would pull back to a separation of an interval, so it implies connectedness. One valid boundary pair follows the bottom then right edges and the left then top edges. If opposite-corner paths were disjoint, normalising a continuous separation vector would construct the forbidden map , so they intersect. A path in between the other corners, together with a path in between its corners, would contradict that intersection result; hence those corners lie in different path components.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. B
  2. 11F
  3. Paper 2
  4. Ib
  5. 2026
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home