From mboxrd@z Thu Jan  1 00:00:00 1970
X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/1520
Path: news.gmane.org!not-for-mail
From: Peter Freyd <pjf@saul.cis.upenn.edu>
Newsgroups: gmane.science.mathematics.categories
Subject: Bruennler question
Date: Wed, 17 May 2000 10:46:52 -0400 (EDT)
Message-ID: <200005171446.KAA01340@saul.cis.upenn.edu>
NNTP-Posting-Host: main.gmane.org
X-Trace: ger.gmane.org 1241017895 31631 80.91.229.2 (29 Apr 2009 15:11:35 GMT)
X-Complaints-To: usenet@ger.gmane.org
NNTP-Posting-Date: Wed, 29 Apr 2009 15:11:35 +0000 (UTC)
To: categories@mta.ca
Original-X-From: rrosebru@mta.ca Wed May 17 12:37:22 2000 -0300
Original-Received: (from Majordom@localhost)
	by mailserv.mta.ca (8.9.3/8.9.3) id MAA32201
	for categories-list; Wed, 17 May 2000 12:33:42 -0300 (ADT)
X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f
Original-Sender: cat-dist@mta.ca
Precedence: bulk
Original-Lines: 19
Xref: news.gmane.org gmane.science.mathematics.categories:1520
Archived-At: <http://permalink.gmane.org/gmane.science.mathematics.categories/1520>

Kai Bruennler asks:

  Is there a binary product in the category of sets and functions
  that is "strictly associative", i.e.

  A x (B x C) = (A x B) x C   and
  the associativity isomorphisms are equal to the identity?

The answer is yes if you're willing to use a lot of choice. Perhaps 
the quickest construction is to assume a well-ordering on the universe
with the property that  x < y  whenever  x \in  y. Then define the
pair  l:AxB --> A, r:AxB --> B  by stipulating that  AxB  is a von
Neumann ordinal "lexicagraphically ordered" by  l  and  r, that is,

          (lx < ly)  or  (lx = ly  and  rx < ry)
whenever
          (x \in  y)  and  (y \in  AxB).