A COMPARATIVE THEORETICAL ANALYSIS OF WEAK FORMS OF THE AXIOM OF CHOICE AND THEIR LOGICAL CONSEQUENCES IN ZERMELO– FRAENKEL SET THEORY

Volume-09 Issue 12, December -2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [159] A COMPARATIVE THEORETICAL ANALYSIS OF WEAK FORMS OF THE AXIOM OF CHOICE AND THEIR LOGICAL CONSEQUENCES IN ZERMELO– FRAENKEL SET THEORY Salvador Loria ORCID ID - 0000-0002-0215-2687 Professor VI, Graduate School, Nueva Ecija University of Science and Technology, Philippines Ramir G. Pacheco Richel B. Rabas Emma O. Cajurao Rocel A. Turco Graduate Students, Graduate School, Nueva Ecija University of Science and Technology, Philippines ABSTRACT This paper presents a comparative theoretical analysis of several weak forms of the Axiom of Choice (AC) and their logical consequences within the framework of Zermelo–Fraenkel Set Theory (ZF). While the full Axiom of Choice ensures the existence of a global choice function for all families of nonempty sets, weaker variants such as the Axiom of Countable Choice, the Axiom of Dependent Choice, and the Boolean Prime Ideal Theorem capture limited but significant forms of selection. Through model-theoretic and proof-theoretic examinations, this study highlights the relative strength, independence, and interrelations among these axioms. The findings affirm that while these principles are equivalent in ZFC, their logical independence in ZF reveals an order of choice principles. This comparative analysis deepens understanding of how restricted forms of choice operate and clarifies the structural role of AC in modern set-theoretic foundations. Keywords: Axiom of Choice, Dependent Choice, Countable Choice, Boolean Prime Ideal Theorem, Zermelo–Fraenkel Set Theory, Model Theory INTRODUCTION The Axiom of Choice (AC) plays a central role in modern set theory, enabling the selection of elements from arbitrary collections of non-empty sets. Despite its usefulness, AC remains controversial due to its nonconstructive nature, prompting the development of weaker forms such as the Countable Axiom of Choice and the Axiom of Dependent Choice (DC). These variants preserve some of AC’s functionality without invoking its strongest implications. However, the logical relationships, relative strengths, and model-theoretic behaviors of these weak forms remain intricate and are not equivalent within Zermelo–Fraenkel (ZF) set theory. The Axiom of Choice (AC) stands as one of the most influential yet controversial principles in modern mathematics. Introduced by Ernst Zermelo in 1904, it asserts that for any family of nonempty sets, there exists a function that selects one element from each set. Although indispensable in areas such as algebra, topology, and analysis, the axiom has drawn philosophical and foundational scrutiny due to its non-constructive nature. Within Zermelo–Fraenkel set theory (ZF), AC is independent because it can neither be proved nor disproved from the ZF axioms. This independence, demonstrated through Gödel’s constructible universe L (showing ZF⇒ACis consistent if ZF is) and Cohen’s forcing method (showing ZF+¬AC is also consistent if ZF is), marked a turning point in the study of mathematical foundations. However, between the extremes of full AC and its complete negation lies a spectrum of weaker forms that preserve certain aspects of choice while avoiding its full strength. These include the Axiom of Countable Choice, allowing countable selections; the Axiom of Dependent Choice (DC), enabling iterative or sequential choices; the Boolean Prime Ideal Theorem (BPI), essential in topology and Boolean algebra. The logical interplay and relative consistency of these weaker axioms remain an active area of set-theoretic investigation. This paper offers a comparative theoretical analysis of these weak forms, exploring their equivalences, independence relations, and implications for standard mathematical results within ZF. Volume-09 Issue 12, December -2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [160] This study seeks to explore and clarify the theoretical relationships among AC, DC, and Axiom of Countable Choice within the ZF framework, highlighting how differing degrees of “choice” influence the structure and behavior of sets, functions, and countable product spaces. While it is known that AC ⇒ DC ⇒ Axiom of Countable Choice, the non-equivalence and independence of these implications raise fundamental questions: 1. Under which model-theoretic conditions (e.g., constructible universe L, Cohen forcing extensions, Solovay model, permutation models) does one weak form of the Axiom of Choice imply another, and which countermodels separate them? 2. What are the exact logical implications and non-implications among AC, DC, and Axiom of Countable Choice provable in ZF, and what minimal additional hypotheses (if any) yield reversals? 3. In what precise ways do the presence or absence of these weak choice principles affect the construction of choice functions, dependent sequences, and countable products? OBJECTIVES 1. To formally establish the logical relationships among AC, DC, and Axiom of Countable Choice within ZF set theory. 2. To examine model-theoretic examples demonstrating their independence and non-equivalence. 3. To analyze the theoretical implications of these weak forms on function construction. METHODOLOGY This study is purely theoretical and employs both proof-theoretic and model-theoretic approaches within the framework of ZF set theory. It begins with a logical analysis that formalizes the statements of AC, DC, and Axiom of Countable Choice and outlines their hierarchical implications. The model-theoretic component draws on known models of ZF to demonstrate the independence of these principles, while the proof-theoretic discussion provides formal derivations of their implications as well as counterexamples to non-reversible relations. Finally, insights from both logical and model-theoretic analyses are synthesized to develop a comparative framework for understanding weak choice principles. RESULTS AND DISCUSSION 1. Formal Characterization of Weak Choice Principles as Foundational Results The analysis begins with the formal characterization of the weak choice principles that determine the logical structure of the results. Four axioms serve as the theoretical basis of comparison, namely the Axiom of Choice (AC), the Axiom of Dependent Choice (DC), the Axiom of Countable Choice, and the Boolean Prime Ideal Theorem (BPI). The Axiom of Choice asserts that every family of nonempty sets admits a choice function. Within Zermelo– Fraenkel set theory (ZF), AC entails both DC and because a global selection function can be restricted to dependent sequences and countable families. AC further implies BPI through its equivalence with Zorn’s Lemma. Gödel’s constructible universe establishes the consistency of AC with ZF, while Cohen’s forcing demonstrates that AC fails in certain models. These results confirm the independence of AC from ZF. The Axiom of Dependent Choice guarantees the existence of infinite sequences generated through a binary relation satisfying a serial condition. AC implies DC, but DC does not imply AC. Solovay’s model shows that DC can hold even when AC fails, particularly in settings where every subset of the real numbers is Lebesgue measurable. This establishes DC as strictly weaker than AC and independent of ZF. The Axiom of Countable Choice asserts that every countable family of nonempty sets admits a choice function. DC implies Axiom of Countable Choice, yet the converse fails. Permutation and Cohen type models demonstrate the validity of in the absence of DC. This confirms that occupies a strictly weaker logical position than DC and remains independent of ZF. The Boolean Prime Ideal Theorem asserts that every Boolean algebra admits a prime ideal or equivalently an ultrafilter. AC implies BPI, although BPI remains strictly weaker than AC. BPI is independent of DC and Axiom of Countable Choice, since there exist models where BPI holds and DC fails, as well as models where DC holds but BPI fails. This establishes BPI as logically orthogonal to the hierarchy formed by AC, DC, and Axiom of Countable Choice. These formal foundations establish that the weak choice principles are neither equivalent nor reducible within ZF. Instead, each principle generates a distinct logical environment that determines the strength of permissible constructions. Volume-09 Issue 12, December -2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [161] 2. Hierarchical Structure of Weak Forms of the Axiom of Choice The results establish a strict hierarchy among AC, DC, Axiom of Countable Choice and in ZF: AC ⇒ DC ⇒Axiom of Countable Choice with no reverse implications holding. This hierarchy represents progressively weaker forms of set selection. AC enables unrestricted global choice over arbitrary families, DC supports the iterative generation of sequences under relational constraints, and guarantees selection only for countable families. The results further demonstrate that while DC is insufficient to recover AC, it remains strong enough to validate most analytic constructions. Fundamental results such as the Baire Category Theorem, completeness of metric spaces, and the existence of fixed points in contraction mappings are provable in ZF + DC. This confirms that DC occupies an intermediate logical position between full AC and purely countable selection. The Axiom of Countable Choice supports the construction of sequences, subsequences, and countable products but fails to ensure dependent constructions governed by arbitrary relations. This confirms it’s strictly limited operational scope. The Boolean Prime Ideal Theorem does not belong to this linear chain and remains incomparable with DC and Axiom of Countable Choice. Its strength lies in supporting algebraic and topological compactness principles without requiring full choice. 3. Model Theoretic Independence and Consistency Results The independence of the weak choice principles is reinforced by several classical models of ZF. i. Gödel’s constructible universe validates AC, DC, and BPI simultaneously, confirming their collective consistency with ZF. ii. Cohen’s forcing constructions exhibit models in which AC fails while ZF remains consistent. These models further show that and DC can be separated. iii. Solovay’s model demonstrates that DC can hold while AC fails, accompanied by universal Lebesgue measurability of sets of real numbers. This result establishes that DC coexists with strong regularity properties that are incompatible with AC. iv. Fraenkel–Mostowski permutation models validate while DC fails, confirming the strict weakening from DC to Axiom of Countable Choice. v. For BPI, specific permutation models show that BPI may hold independently of DC and Axiom of Countable Choice, while other models establish the failure of BPI even when DC holds. These results confirm that BPI occupies a separate axis of logical strength. Collectively, these models demonstrate that each weak form of choice determines a distinct mathematically consistent universe with its own class of valid theorems. 4. Proof Theoretic and Constructive Implications From a proof theoretic standpoint, the admissibility of constructions varies with the underlying choice principle. In ZF + DC, recursive definitions, dependent sequences, and iterative approximation processes are valid. This suffices for the development of real and functional analysis. In contrast, the full Tychonoff Theorem for arbitrary products requires full AC. Without AC, only restricted compactness results remain provable. The Axiom of Countable Choice supports convergence arguments, subsequence extraction, and countable product constructions but fails to validate dependent recursion schemes. The Boolean Prime Ideal Theorem supports ultrafilter constructions, compactness in Boolean algebras, and the Stone representation theorem, even in the absence of full choice. The classification by Howard and Rubin empirically confirms that these axioms delineate distinct lattices of provable results, reinforcing the formal separation established through model theory. 5. Comparative Synthesis of Logical and Model Theoretic Results The combined logical and model theoretic findings yield the following structure: i. AC is the strongest principle and implies all other forms. ii. DC is strictly weaker than AC and governs most analytic constructions. iii. Axiom of Countable Choice is strictly weaker than DC and governs countable selection. iv. BPI is incomparable with DC and governs ultrafilter and compactness principles. These relations confirm that weak choice principles do not merely approximate AC but define separate foundational regimes. Mathematics therefore operates across multiple consistent frameworks depending on the degree of selection required by the discipline. CONCLUSION This study examined the relative logical strength, independence, and mathematical implications of four key choice principles, the Axiom of Choice (AC), Axiom of Dependent Choice (DC), Axiom of Countable Choice Volume-09 Issue 12, December -2025 ISSN: 2456-9348 Impact Factor: 8.232 International Journal of Engineering Technology Research & Management (IJETRM) https://ijetrm.com/ IJETRM (http://ijetrm.com/) [162] ( ), and the Boolean Prime Ideal Theorem (BPI), using a synthesis of formal proofs, model-theoretic results, and known independence constructions. The findings reveal a hierarchical structure among these axioms: with none of the implications reversible. This confirms that AC represents the strongest form of selection, DC occupies an intermediate logical position sufficient for most analytical arguments, and operates in strictly countable contexts. Model-theoretic evidence further supports their distinct logical roles. Gödel’s constructible universe satisfies all forms of choice, while Cohen’s forcing shows that AC can fail. Solovay’s model demonstrates that DC can hold even when AC fails, and permutation models distinguish between and DC. Collectively, these results validate that each axiom delineates a different mathematically consistent universe, each with its own set of permissible theorems. The proof-theoretic and constructive implications also highlight that the necessity of choice varies by discipline. DC suffices for real and functional analysis, is adequate for countable constructions, and BPI supports core results in topology and Boolean algebra. Meanwhile, full AC is essential only for results requiring unrestricted infinite products, maximal extensions, or global selections. The study established that while the weak forms of the Axiom of Choice are logically related, they create nonequivalent and independent mathematical frameworks. These findings affirm that ZF set theory supports multiple coherent structures, allowing mathematics to function with varying degrees of choice depending on the demands of the field. Recommendations 1. For Mathematicians Working in Analysis and Functional Analysis. Since DC suffices for most analytical theorems including completeness arguments, recursive constructions, and foundational results such as the Baire Category Theorem, researchers may consider explicitly adopting ZF + DC as a working framework when full AC is unnecessary. This provides a more constructive environment while preserving analytical strength. 2. For Set Theorists and Logicians. Future research may expand the comparative analysis by exploring other intermediate choice principles such as the Ultrafilter Lemma, Tukey’s Lemma, or Multiple Choice Axiom, examining where these fit relative to AC, DC, , and BPI. Additional model-theoretic constructions could further map the independence landscape. 3. For Educators and Curriculum Designers in Foundations of Mathematics. The results of this study may inform the development of instructional materials that distinguish the hierarchy of choice axioms, their independence, and their specific domains of application. Presenting these distinctions more clearly can help students understand why mathematics remains consistent with weaker or alternative choice principles. 4. For Future Research on Applicability Across Mathematical Domains. Researchers may investigate the minimal choice principles required for specific theorems in algebra, topology, and measure theory. Cataloguing these dependencies, similar to the compilation by Howard and Rubin (1998), could deepen the understanding of how foundational axioms shape mathematical practice. REFERENCES [1] Jech, T. (2003). Set theory. The third millennium edition, revised and expanded. Springer Monographs in Mathematics. Springer Monographs in Mathematics. [2] Howard, P., & Rubin, J. (1998). Consequences of the Axiom of Choice. American Mathematical Society. [3] Kunen, K. (2011). Set Theory. College Publications. [4] Herrlich, H. (2006). Axiom of Choice. Springer. [5] Solovay, R. M. (1970). A model of set theory in which every set of reals is Lebesgue measurable. Annals of Mathematics.