Let me quickly explain what I mean with my question.


Let $(\kappa\_i)\_{i\in I}$ be a collection of cardinal numbers, indexed by elements of some set $I$. We can try to define $\sum\limits\_{i\in I}\kappa\_i$ as follows: take collection $(A\_i)\_{i\in I}$ of sets such that $|A\_i|=\kappa\_i$, and let $A=\{(a,i):i\in I,a\in A\_i\}$. Then we say $\sum\limits\_{i\in I}\kappa\_i=|A|$. We can do similar trick with multiplication, by setting $B=\{f:f\text{ is a function from }I\text{ such that }f(i)\in A\_i\}$.


If we assume AC, then these notions are well-defined: First of all, we *can* choose such a sequence $(A\_i)\_{i\in I}$, and if we take two collections $(A\_i)\_{i\in I}$, $(A\_i')\_{i\in I}$ such that $|A\_i|=|A\_i'|=\kappa\_i$, then we can use choice to get bijections between $A\_i$ and $A\_i'$ for every $i\in I$ and then use there to create bijection between $A=\{(a,i):i\in I,a\in A\_i\}$ and $A'=\{(a',i):i\in I,a'\in A\_i'\}$, so this procedure defines only one cardinal. Similar trick for multiplication.


However, if we do *not* assume choice, then 1. we don't know a priori that we can always choose any sequence $(A\_i)\_{i\in I}$, and even if we can, we have no guarantee that there is only one possible size of $A$ we can get in this way. I don't know of scenario where we cannot find any sequence of sets with given cardinalities, but I know that uniqueness of size can fail quite spectacularly, even if we add $2$ countably many times (see [here](http://dml.cz/bitstream/handle/10338.dmlcz/119630/CommentatMathUnivCarolRetro_47-2006-4_15.pdf)).


I have three questions:



> 
> 1. Is it possible in abscence of choice that there is a collection of cardinals $(\kappa\_i)\_{i\in I}$, but there is no collection of sets $(A\_i)\_{i\in I}$ having respective cardinalities? (I suspect the answer is "yes")
> 2. If the answer to 1. is yes, then is it known that existence of such a collection implies axiom of choice? (I suspect answer to this to be "doesn't imply" or "not known")
> 3. Does existence of collections like above and "value of the sum and product of cardinals doesn't depend on choice of collection" imply axiom of choice? (no clue, but I'm hoping for "yes")
> 
> 
> 


These are main questions I'm interested in, but we can ask more by asking which combinations of below three imply choice:



> 
> For any collection of cardinals, there is collection of sets of respective cardinalities.
>  Sum of cardinals, if defined, is well-defined. (i.e. sum doesn't depend on choice of collection, but we allow possibility that the collection doesn't exist)
>  Product of cardinals, if defined, is well-defined.
> 
> 
> 


Thanks in advance for all feedback.



Does "cardinal arithmetic is well-defined" imply axiom of choice?
First let me answer the first question. Yes. It is possible. You can find the proof in Jech "The Axiom of Choice" in Theorems 11.2 and 11.3. Also you might be interested in reading Pincus' paper,



> 
> *David Pincus*, [**Cardinal representatives**](http://www.ams.org/mathscinet-getitem?mr=366666), *Israel J. Math.* **18** (1974), 321--344.
> 
> 
> 


Where he shows that it is also consistent that there are representatives to *all* cardinals uniformly, but the axiom of choice fails.


To the third question, which seems to mix two separate ideas, I don't know the answer, and I don't know if it was asked in explicit details. But even without any assumptions on cardinal representatives, just talking about disjoint unions (and products), let me give you the following answer.


If you allow talking about products, then trivially you get the axiom of choice back.


Suppose that $\{Y\_i\mid i\in I\}$ is a family of non-empty sets. Pick a large enough non-empty set $Y$ such that each $Y\_i$ satisfies $|Y\times Y\_i|=|Y|$.1 Now consider $\prod\_{i\in I} Y$ and $\prod\_{i\in I}(Y\times Y\_i)$, since the former is non-empty, the latter is non-empty as well. Now pick some $f$ such that $f(i)\in Y\times Y\_i$ and consider the projection onto $Y\_i$, as a choice function.


For addition it seems to be open. The last progress I am aware of can be found in Higasikawa's paper,



> 
> Masasi Higasikawa, **[Partition principles and infinite sums of cardinal numbers](http://projecteuclid.org/euclid.ndjfl/1040149358).** *Notre Dame J. Formal Logic* **36** (1995), no. 3, 425–434. 
> 
> 
> 


Where you can find a proof that this assumption implies The Partition Principle (whose choice strength is quite open for quite some time now). You can find other proofs related to this principle, and that in the presence of some additional assumptions it will imply the axiom of choice.


Two remarks that might be useful, taken from Gregory Moore's "Zermelo's Axiom of Choice":


1. The assumption is in fact equivalent to the statement that $\sum\_{i\in I}|A|=|A|\cdot|I|$.
2. If we also assume that "If $Y$ is a set and for every $y\in Y$, $|y|=|Y|$, then $|\bigcup Y|=|Y|$, then we can prove the axiom of choice.




---


Footnotes.


1. Such $Y$ always exists. For example $(\bigcup Y\_i)^\omega$.


