We use $\mathsf{AC}$ here. If $0 < \lambda < \operatorname{cf} \kappa$, $f \in \kappa^\lambda$ is bounded so belongs to $\alpha^\lambda$ for an ordinal $\alpha < \kappa$. Thus $\kappa^\lambda = \bigcup_{\alpha < \kappa} \alpha^\lambda$. Here we used set exponentiation, not cardinal exponentiation. Then we do cardinal exponentiation. $\kappa^\lambda \le \kappa \cdot \sup_{\alpha < \kappa} \lvert \alpha^\lambda \rvert = \kappa \cdot \sup_{\alpha < \kappa} \lvert \alpha \rvert^\lambda$, and since $\kappa \le \kappa^\lambda$ and $\sup_{\alpha < \kappa} \lvert \alpha \rvert^\lambda \le \kappa^\lambda$, $\kappa^\lambda = \kappa \cdot \sup_{\alpha < \kappa} \lvert \alpha \rvert^\lambda$. Here I have a question: If $\kappa$ is limit, $\kappa^\lambda = \sup_{\alpha < \kappa} \lvert \alpha \rvert^\lambda$? What I first thought is like this. Since $\kappa^\lambda = \bigcup_{\alpha < \kappa} \alpha^\lambda = \bigcup_{\mu < \kappa} \mu^\lambda$ where $\mu$ is cardinal, $\kappa^\lambda = \sup_{\mu < \kappa} \mu^\lambda$ because in terms of ordinals, union is same as supremum. But $\bigcup_{\mu < \kappa} \mu^\lambda$ is not union of ordinals, is it? Nevertheless it is union of a chain. If we provide a well-ordering for set exponentiation $\kappa^\lambda$ by cardinal exponentiation $\kappa^\lambda$, does set exponentiation $\mu^\lambda$ match to the initial segment by cardinal exponentiation $\mu^\lambda$? I can't think any further about this.
2026-03-28 00:36:55.1774658215
Confused about union while handling cardinal exponentiation
91 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Related Questions in CARDINALS
- Ordinals and cardinals in ETCS set axiomatic
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- If $\kappa$ is a regular cardinal then $\kappa^{<\kappa} = \max\{\kappa, 2^{<\kappa}\}$
- Intuition regarding: $\kappa^{+}=|\{\kappa\leq\alpha\lt \kappa^{+}\}|$
- On finding enough rationals (countable) to fill the uncountable number of intervals between the irrationals.
- Is the set of cardinalities totally ordered?
- Show that $n+\aleph_0=\aleph_0$
- $COF(\lambda)$ is stationary in $k$, where $\lambda < k$ is regular.
- What is the cardinality of a set of all points on a line?
- Better way to define this bijection [0,1) to (0,1)
Related Questions in ORDINALS
- Ordinals and cardinals in ETCS set axiomatic
- For each cardinal number $u$, there exists a smallest ordinal number $\alpha$ such that card$\alpha$ =$u$ .
- Intuition regarding: $\kappa^{+}=|\{\kappa\leq\alpha\lt \kappa^{+}\}|$
- Set membership as a relation on a particular set
- Goodstein's sequences and theorem.
- A proof of the simple pressing down lemma, is sup $x=x?$
- $COF(\lambda)$ is stationary in $k$, where $\lambda < k$ is regular.
- Difficulty in understanding cantor normal form
- What are $L_1$ and $L_2$ in the Gödel Constructible Hierarchy
- How many subsets are produced? (a transfinite induction argument)
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You ask whether the equality $\kappa^\lambda=\kappa\cdot\sup_{\alpha<\kappa}|\alpha|^\lambda$ can be simplified to $\kappa^\lambda=\sup_{\alpha<\kappa}|\alpha|^\lambda$ for $\kappa$ limit.
Perhaps the easiest way to argue is to note that for any cardinal $\rho<\kappa$, we also have $\rho^+<\kappa$, and $(\rho^+)^\lambda>\rho$, so $\rho<\sup_{\alpha<\kappa}|\alpha|^\lambda$ and, since this holds for all $\rho<\kappa$, then $\kappa\le\sup_{\alpha<\kappa}|\alpha|^\lambda$, and indeed the equality you ask about holds in this case.
In the sketch of your thoughts you present after the question, you correctly note that in the union it is enough to only consider those $\alpha$ that themselves are cardinals (because $\kappa$ is a limit cardinal, so for any $\alpha$ there is a cardinal $\mu$ larger than $\alpha$ and smaller than $\kappa$, and trivially any function with range contained in $\alpha$ has range contained in $\mu$). So, as sets of functions, we indeed have $$ \kappa^\lambda=\bigcup_{\mu<\kappa}\mu^\lambda.$$ Then you ask whether this implies that the cardinals $\kappa^\lambda$ and $\sup_{\mu<\kappa}\mu^\lambda$ coincide, but seem confused abut how to prove this. You can argue as follows: Call $\rho=\sup_\mu\mu^\lambda$. First, $|\bigcup_\mu\mu^\lambda|\le|\bigsqcup_\mu\mu^\lambda|$, where $\sqcup$ denotes disjoint union. For instance, given a function $f$ in $\bigcup_\mu\mu^\lambda$, map it to the copy of $f$ in the copy of $\mu^\lambda$ in $\bigsqcup_\mu\mu^\lambda$, where $\mu$ is least such that $f\in\mu^\lambda$.
But $|\bigsqcup_\mu\mu^\lambda|=\sum_\mu\mu^\lambda$, where the expressions are now cardinals rather than sets of functions, and $\sum_\mu\mu^\lambda\le\sum_\mu\rho=\kappa\cdot\rho$. Since $\kappa\le\rho$, as argued earlier, then this last product simplifies to $\rho$. We have shown that $$\left|\bigcup_{\mu<\kappa}\mu^\lambda\right|\le\sup_\mu\mu^\lambda.$$ The other inequality, should be clear since, as sets of functions, for any $\mu<\kappa$, $\mu^\lambda$ is a subset of $\bigcup_{\mu<\kappa}\mu^\lambda$. This shows that $\sup_{\mu<\kappa}\mu^\lambda=|\bigcup_{\mu<\kappa}\mu^\lambda|$. But we already have that $\bigcup_{\mu<\kappa}\mu^\lambda=\kappa^\lambda$, and we are done.