Border's theorem¶

Border's theorem gives necessary and sufficient inequalities for whether interim allocation rules can be implemented by an auction.

Version: v1 · 2026-09-28 · History
Domain-specific #: 7588
Domain group: Social Sciences
Origin domain: Economics & Finance
Subdomain: Mechanism Design → Economics & Finance

Core Idea¶

Border's theorem characterizes when an interim allocation rule for a single indivisible good can be implemented by an ex-post feasible auction.^[1] It converts the question “does some allocation mechanism produce these type-conditional winning probabilities?” into a family of necessary and sufficient inequalities.^[2]

An auction assigns each bidder a winning probability for every full profile of reported types, with total allocation probability at most one.^[3] The corresponding interim rule Qᵢ(tᵢ) averages bidder i's ex-post probability over the other bidders' possible types, conditional on i's own type.^[4] An interim rule is implementable exactly when at least one feasible ex-post allocation rule has those conditional averages.^[5]

In an independent and identically distributed, symmetric environment with N bidders, implementability requires that for every measurable set A of types, the aggregate interim probability allocated to types in A not exceed the probability that at least one bidder has a type in A.^[6] Formally, N∫A Q(t)dλ(t) ≤ 1 − λ(Aᶜ)ᴺ.^[7] Border's result is strong because this intuitive capacity inequality is sufficient as well as necessary.^[8] A finite-type version permits bidder-specific type sets and applies the analogous inequality to every collection of subsets Aᵢ.^[9]

The theorem concerns feasibility of reduced-form allocations, not incentive compatibility, payments, revenue optimality, or truthfulness by themselves.^[10] Its hypotheses—single-good feasibility, the stated type spaces and probability structure, and the applicable symmetric or finite version—are load-bearing.^[11] An arbitrary vector of marginal winning probabilities can satisfy pointwise bounds yet still fail the joint subset inequalities and therefore be nonimplementable.^[12]

How would you explain it like I'm…

The Promise-Keeping Check

Picture one cookie and several kids who might want it. Before anyone arrives, you promise each kind of kid a chance of getting the cookie. Border's theorem is a checklist that tells you whether those promises can really be kept: for any group of kinds of kids, the chances you promised them together can't be bigger than the chance that at least one kid of that kind actually shows up. If every group passes that check, there really is a way to hand out the cookie that keeps all your promises.

Can the Auction Keep Its Promises?

Border's theorem is about auctions for one single item. Each bidder has a 'type,' such as how much they want the item, and the auction decides who wins based on everyone's types. From the bidder's point of view, what matters is their chance of winning given their own type, averaged over everyone else. Border's theorem tells you exactly when a list of those chances can come from a real auction that never gives the item away more than once. The test is: for every group of types, the total winning chance promised to that group can't be more than the chance that someone from that group is actually bidding. If all those checks pass, a real auction exists.

Feasibility of Interim Auction Rules

Border's theorem characterizes which 'interim' allocation rules for one indivisible good can be produced by an actual auction. An auction (an ex-post rule) gives each bidder a winning probability for every full profile of types, with the probabilities adding to at most one. The interim rule Q_i(t_i) is bidder i's winning probability averaged over the other bidders' types, given i's own type. The theorem turns 'does some feasible auction produce these interim probabilities?' into a set of inequalities that are both necessary and sufficient. In the symmetric i.i.d. case, for every set A of types, the total interim probability given to types in A must not exceed the probability that at least one bidder has a type in A. It is about feasibility only — it says nothing by itself about incentives, payments, or revenue.

Border's theorem gives necessary and sufficient conditions for an interim (reduced-form) allocation rule for a single indivisible good to be implementable by an ex-post feasible auction. An ex-post rule assigns each bidder a winning probability for every profile of reported types, with total allocation at most one; the interim rule Q_i(t_i) is the expectation of bidder i's ex-post probability over others' types, conditional on t_i. An interim rule is implementable exactly when at least one feasible ex-post rule has those conditional averages. In the independent, identically distributed, symmetric setting with N bidders and type distribution λ, implementability holds iff for every measurable set A, N∫_A Q(t)dλ(t) ≤ 1 − λ(Aᶜ)^N — the expected allocation to types in A cannot exceed the probability that some bidder's type lies in A. Necessity is intuitive; the theorem's strength is that this capacity condition is also sufficient. A finite-type version allows bidder-specific type sets and imposes the analogous inequality for every collection of subsets A_i. Pointwise bounds on marginal winning probabilities are not enough: a rule can satisfy them yet violate the joint subset inequalities. The result concerns feasibility, not incentive compatibility, payments or revenue optimality, and its hypotheses are load-bearing.

Structural Signature¶

Sig role-phrases:

the auction environment — bidders have declared type spaces and probability distributions under the hypotheses of the chosen theorem version.
the ex-post allocation rule — every full type profile maps to winning probabilities whose total is at most one for the indivisible good.
the interim reduced form — each bidder's proposed winning probability is conditioned on that bidder's own type and averaged over the others.
the implementability question — the reduced form is feasible only if some ex-post allocation rule induces all of its conditional probabilities.
the subset-capacity test — for every required measurable or bidder-specific type subset, aggregate interim winning probability claimed inside it cannot exceed the probability that at least one eligible bidder is present.
the necessity-and-sufficiency guarantee — all required inequalities hold exactly when the reduced form is implementable under the stated environment.
the violated-subset certificate — failure of one inequality identifies a collection of interim promises that exceeds ex-post unit capacity.
the theorem-version branch — symmetric independent identically distributed and finite bidder-specific settings require their respective subset formulations.
the mechanism-design boundary — the result certifies allocation feasibility, not incentive compatibility, payments, individual rationality, truthfulness, revenue, or construction efficiency.

What It Is Not¶

Not a pointwise probability test. Bounds such as 0 ≤ Qᵢ(tᵢ) ≤ 1 do not ensure that the proposed interim probabilities can be jointly realized when bidders compete for one indivisible good.
Not merely a necessary capacity condition. Under the hypotheses of the applicable version, satisfaction of every required subset inequality is sufficient as well as necessary for implementability.
Not a theorem for every auction environment without modification. The single-good feasibility constraint, declared type spaces, distributions, and the symmetric or finite formulation are load-bearing.
Not incentive compatibility or truthfulness. Implementability here means that some ex-post feasible allocation rule induces the reduced form; strategic reporting constraints require separate analysis.
Not a payment or revenue theorem. Passing Border's inequalities supplies neither a payment rule nor conclusions about individual rationality, revenue equivalence, or optimality.
Not necessarily an efficient construction of the auction. The inequalities characterize existence of a feasible ex-post allocation rule, while finding or implementing a particular mechanism can remain a separate computational problem.

Scope of Application¶

Border's theorem applies as an implementability test only to interim allocation rules in single-indivisible-good auction environments satisfying the hypotheses of the selected theorem version; type spaces, distributions, symmetry, independence, and the required subset family must be declared.

Symmetric i.i.d. single-item auctions. With independently and identically distributed bidder types, the measurable-set inequalities characterize implementable symmetric interim rules.
Finite bidder-specific type environments. With finite type sets, the bidder-specific collection-of-subsets formulation tests reduced forms without requiring identical bidder distributions.^[13]
Reduced-form feasibility screening. A proposed vector of type-conditional winning probabilities can be tested before an ex-post allocation rule is constructed.
Single-good capacity diagnosis. Each inequality compares interim allocation promised to selected types with the probability that at least one eligible bidder is present for the one available good.
Infeasibility certification. One violated subset inequality identifies a class of marginal promises that cannot be jointly realized by any ex-post feasible auction under the stated environment.^[14]
Feasibility–incentive decomposition. Mechanism analyses use the theorem to settle allocation implementability separately from truthfulness, incentive compatibility, individual rationality, and payments.
Revenue-maximization formulations. Reduced-form optimization can impose Border inequalities as feasibility constraints before revenue and incentive objectives are analyzed.^[15]
Auction-comparison studies. Interim rules from different mechanisms can be compared on the same type distribution and single-good capacity convention without confusing equal marginals with equal ex-post rules.
Theorem-version selection. Continuous measurable-type, symmetric i.i.d., and finite heterogeneous formulations are applied only under their respective assumptions and inequality families.
Computational mechanism design. Finite instances can encode or separate subset constraints where the relevant family is computationally manageable; the theorem itself does not guarantee an efficient construction.^[16]
Proof and generalization research. Proposed extensions to correlated types, multiple items, or different feasibility systems require their own theorem; resemblance to the subset-capacity form does not place them automatically inside Border's result.

Clarity¶

Border’s theorem separates plausible marginal winning probabilities from reduced forms that some feasible auction can jointly realize. Pointwise requirements such as 0 ≤ Qᵢ(tᵢ) ≤ 1 do not prevent several type-contingent claims from collectively demanding more than one indivisible good. The subset inequalities expose exactly that hidden competition for allocation capacity.

The word implementable is also narrower here than desirable, truthful, or revenue-optimal. It asks only whether a feasible ex-post allocation rule has the proposed interim probabilities under the stated type distribution and version of the theorem; incentives and payments require additional conditions. The mechanism-design question becomes: for every required collection of types, does their aggregate interim allocation stay within the probability that the auction can serve at least one of them? Passing that family of tests certifies feasibility of the reduced form, not the rest of the mechanism.

Manages Complexity¶

An ex-post auction rule assigns outcomes over every joint profile of bidders’ private types, a space that expands across bidders and type combinations. Border’s theorem lets a designer work instead with each bidder’s type-conditional winning probability and a family of capacity inequalities. The left side aggregates proposed interim allocation to selected types; the right side records the probability that at least one eligible type is present. Satisfying every required inequality tells the designer that some single-good ex-post feasible rule realizes the reduced form, without first constructing or searching over all such rules.

The theorem keeps its principal regimes explicit: the independent, identically distributed symmetric version tests each measurable type set, while the finite-type version permits bidder-specific sets and tests collections of subsets. That reduction does not make every resulting problem small—the family of subsets can itself be large—and it stops at allocation feasibility. The inequalities do not establish incentive compatibility, truthful reporting, payments, individual rationality, revenue performance, or applicability beyond the theorem’s distributional, type-space, and single-indivisible-good hypotheses.

Abstract Reasoning¶

From proposed type-conditional winning probabilities and the bidders' type distributions to a feasibility judgment, Border's theorem compares every required type subset's claimed interim allocation with the probability that at least one eligible bidder is present. If all inequalities hold under the applicable theorem version, the reduced form is implementable by some ex-post feasible single-good auction; if one fails, that subset is a certificate that the marginals jointly demand more allocation capacity than the auction can supply. This turns a global existence question into ordered checks on selected type events without conflating each bidder's pointwise probability bound with joint feasibility.

Counterfactual changes clarify what drives the result. From increasing Q on a selected set while holding the type distribution fixed to possible violation of its capacity inequality, one can locate which interim promises make the reduced form infeasible. Changing the prior changes the right-hand availability event and can reverse the verdict even when Q is numerically unchanged. The inference must use the theorem matching the environment: the symmetric measurable-set form depends on independent identically distributed bidders, while finite bidder-specific type spaces require the corresponding collection-of-subsets form. Passing either test predicts existence of a feasible allocation rule, not truthfulness, payment feasibility, individual rationality, revenue optimality, or a particular constructive auction.

Knowledge Transfer¶

Within mechanism design, Border’s theorem transfers literally across single-item auction environments covered by a stated version of the theorem. The cargo that carries intact is bidder type distributions, interim winning probabilities, ex-post unit-capacity feasibility, the required family of type-subset inequalities, and necessity-and-sufficiency for implementability. Diagnostics transfer by finding a violated subset as a certificate of impossible marginals or, when all applicable inequalities hold, separating feasibility from later incentive and objective questions.

This is (C) a formal theorem only under its precise environment and distributional hypotheses. The home-bound cargo is auction allocation, types, reduced forms, and single-good capacity. Other marginal-consistency problems share a (B) capacity-inequality mechanism, but they are not Border’s theorem without a valid generalization. The stopping boundary is theorem scope: pointwise probabilities are insufficient, while implementability does not imply truthfulness, optimality, revenue performance, or an efficient construction.

Examples¶

Canonical¶

Take two independent bidders, each equally likely to have type H or L, competing for one good. Consider the symmetric auction that allocates to the sole H bidder when exactly one is present, splits allocation equally when both are H, and leaves the good unallocated when both are L. Conditional on being H, a bidder wins with probability 1 against L and 1/2 against H, so Q(H) = 3/4; conditional on L, Q(L) = 0.^[17] For A = {H}, Border's inequality gives 2 × (1/2) × (3/4) = 3/4 on the left and 1 - (1/2)² = 3/4 on the right.^[18] The other subsets also pass, so the reduced form is implementable, as the explicit auction confirms.

Mapped back: the two-bidder i.i.d. model is the auction environment, and the profile-contingent tie-breaking rule is the ex-post allocation rule. The values Q(H) = 3/4 and Q(L) = 0 form the interim reduced form. Testing {H} performs the subset-capacity test on the implementability question; passing every subset invokes the necessity-and-sufficiency guarantee under the symmetric branch of the theorem-version branch.

Applied / In Practice¶

Now suppose an optimizer proposes the pointwise-valid reduced form Q(H) = 0.9 and Q(L) = 0.1 in the same environment. Each number lies between zero and one, but the high-type subset already fails: its claimed interim allocation is 2 × (1/2) × 0.9 = 0.9, whereas the probability that at least one high type is present remains 1 - (1/2)² = 0.75.^[19] No ex-post rule for one indivisible good can realize those marginal promises.^[20] The failed feasibility screen says nothing yet about payments, truthful reporting, individual rationality, or revenue.

Mapped back: the proposed probabilities are the interim reduced form, and asking whether any single-good rule realizes them is the implementability question. The set {H} activates the subset-capacity test; 0.9 > 0.75 is the violated-subset certificate. The conclusion of infeasibility follows from the necessity-and-sufficiency guarantee, while the refusal to infer incentives or revenue preserves the mechanism-design boundary.

Structural Tensions¶

T1: Interim tractability versus ex-post detail. Reduced forms replace allocations over every joint type profile with type-conditional winning probabilities, making analysis more manageable, but discard which profile-level rule realizes those marginals. Border's theorem restores an existence test without identifying every underlying auction. Diagnostic: separate the question “is some ex-post rule possible?” from “which rule should be constructed or implemented?”

T2: Pointwise plausibility versus joint capacity. Each interim probability can lie between zero and one while selected types collectively claim more winning probability than one indivisible good can support. Individually reasonable marginals can be globally impossible. Diagnostic: test every required subset inequality rather than accepting the reduced form from its coordinatewise bounds.

T3: Intuitive necessity versus strong sufficiency. No subset can receive more expected allocation than the chance that at least one eligible bidder appears, so necessity is immediate; the theorem's power is that all such inequalities also suffice. Treating them as merely cautionary leaves the characterization underused. Diagnostic: after confirming the applicable hypotheses, read satisfaction of the complete family as an existence certificate, not only the absence of an obvious violation.

T4: Complete characterization versus constraint burden. The subset family exactly describes implementability, yet the number or analytical complexity of subsets can itself be large. A theorem that compresses the conceptual existence problem need not make its computational use cheap. Diagnostic: distinguish logical completeness of the inequalities from the cost of enumerating, separating, or optimizing over them.

T5: Version generality versus hypothesis sensitivity. The symmetric i.i.d. and finite bidder-specific forms share a capacity intuition, but use different type spaces, distributions, and subset expressions. Moving between them without checking assumptions can invalidate the test. Diagnostic: declare independence, symmetry, finiteness, and bidder-specific type structure before selecting the theorem statement.

T6: Allocation feasibility versus mechanism desirability. Passing Border's inequalities proves that some feasible ex-post allocation rule induces the reduced form, while saying nothing by itself about truthfulness, payments, individual rationality, revenue, or fairness. Feasibility is foundational but deliberately narrow. Diagnostic: list the remaining incentive and objective constraints separately after the implementability verdict.

T7: Necessity-and-Sufficiency reduction versus Border-theorem autonomy. The exact parent Prime Necessity and Sufficiency strictly subsumes the theorem: every qualifying version states that an interim reduced form is implementable if and only if the complete required family of subset-capacity inequalities holds. Border's Theorem remains in situ because it fixes bidders, types, distributions, single-good ex-post feasibility, interim marginals, and the version-specific inequality family. Reduction gains portable biconditional characterization structure but erases the auction-theoretic objects and guarantee; complete autonomy hides why both violation and satisfaction close the verdict. Diagnostic: if the bidder/type setting and subset-capacity conditions are removed while a two-direction characterization remains, Necessity and Sufficiency survives but Border's Theorem does not.

Structural–Framed Character¶

Border's Theorem is structural-leaning. Its evaluative_weight is low: implementability is a formal feasibility property under declared hypotheses, not a judgment that an auction is desirable, truthful, fair, or revenue-optimal. Its human_practice_bound character is low-medium because auctions and mechanisms are designed practices, but the subset inequalities and their biconditional consequence are mathematical once the environment is fixed. Its institutional_origin is low: professional mechanism-design conventions supply notation and theorem versions without conferring whether a reduced form satisfies the characterization. Its vocab_travels judgment is medium: necessity, sufficiency, condition, counterexample, subset, and capacity carry beyond auction theory, while bidders, interim allocations, types, and single-good feasibility remain home-bound. Its import_vs_recognize profile is recognition-dominant: the theorem exposes a two-direction logical structure already present between the inequality family and implementability rather than imposing an evaluative lens.

The smallest positively reviewed portable skeleton is Necessity and Sufficiency: one violated subset inequality refutes implementability, while satisfaction of every required inequality guarantees it within the declared universe. Border's Theorem remains autonomous because it fixes interim reduced forms, bidder type distributions, ex-post single-good feasibility, and version-specific subset-capacity conditions. Remove those auction-theoretic roles and the biconditional skeleton remains; remove either implication direction and the result is no longer Border's full characterization. The cross-domain reach belongs to that Prime.

Its character: a strongly formal mechanism-design theorem whose portable core is an exact necessary-and-sufficient characterization and whose residual identity lies in its auction-specific capacity inequalities.

Structural Core vs. Domain Accent¶

Border's Theorem is a domain-specific strict specialization of the Necessity and Sufficiency Prime: its theorem-specific inequalities do not merely screen interim allocations but exactly characterize implementability within the declared auction environment.

What is skeletal (could lift toward a cross-domain prime). The portable structure names a focal outcome, a candidate condition, a declared universe, separate necessity and sufficiency directions, directional counterexamples, and biconditional closure. That full Necessity and Sufficiency signature recurs in at least three unrelated domains: number theory proves both directions of a divisibility characterization, engineering distinguishes required functions from a jointly guaranteeing package, and diagnosis separates a rule-out prerequisite from a rule-in guarantee. Here the outcome is implementability, the condition is satisfaction of every required subset-capacity inequality, the universe is the chosen theorem version, a violated subset refutes necessity, and satisfaction of the whole family establishes sufficiency. Strip away bidders, types, interim probabilities, and unit capacity, and that two-direction characterization remains.

What is domain-bound. Border's domain accent fixes an ex-post allocation rule for a single indivisible good, its interim reduced form, bidder type spaces and distributions, the probability capacity available to chosen type subsets, and the symmetric or bidder-specific theorem branch. Those ingredients determine both the quantified inequality family and what counts as an admissible counterexample. Remove the bidirectional condition relation while retaining the auction objects, and one has feasibility ingredients or at most a necessary screen, not Border's theorem. Conversely, retain only Necessity and Sufficiency and the account no longer specifies which interim promises compete for unit capacity, how subsets are formed, or why satisfying their inequalities produces an implementable allocation.

Why this does not clear the prime bar. The portable prerequisite-versus-guarantee geometry is owned by Necessity and Sufficiency; Border's Theorem supplies one mechanism-design realization under load-bearing probabilistic and feasibility hypotheses. Removing its auction accent yields the parent Prime, not a substrate-free Border characterization, while removing the parent's two implication directions destroys the theorem's claimed exactness. The strict subsumption is therefore warranted because the complete parent signature survives the stripping test, but the child remains autonomous in its interim-allocation carrier, subset-capacity operation, version branches, and violated-subset collapse test.

This entry is a kind of Necessity and Sufficiency.

Strictly instantiates — Necessity and Sufficiency (Necessity and Sufficiency). The focal outcome is implementability by an ex-post feasible single-good auction; the candidate condition is satisfaction of every required subset-capacity inequality; and the declared universe is fixed by the theorem version's bidders, types, distributions, and feasibility convention. One violated inequality is a directional counterexample to implementability, while satisfaction of the entire required family guarantees that an implementing ex-post rule exists. Thus both directions close under the theorem's hypotheses. Removing that biconditional leaves only a necessary screening condition; preserving Necessity and Sufficiency without interim probabilities, type subsets, and single-good capacity leaves the broader parent.

Auction Theory is declined as the parent. It supplies the surrounding domain, but Border's theorem is a result about reduced-form implementability rather than a subtype carrying Auction Theory's full format, bidder, valuation, information, equilibrium, and outcome structure.

Relationships to Other Abstractions¶

Current abstraction Border's theorem Domain-specific

Parents (1) — more general patterns this builds on

Border's theorem is a kind of Necessity and Sufficiency Prime

The focal outcome is implementability by an ex-post feasible single-good auction; the candidate condition is satisfaction of every required subset-capacity inequality; and the declared universe is fixed by the theorem version's bidders, types, distributions, and feasibility convention.

Hierarchy path (1) — routes to 1 parentless root

Border's theorem → Necessity and Sufficiency → Relation

Neighborhood in Abstraction Space¶

Border's theorem sits in a sparse region of the domain-specific corpus (78^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Game-Theoretic Models & Paradoxes (37 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

An interim allocation rule. An interim rule is the type-conditional winning-probability object whose implementability is tested; Border's theorem is the characterization relating that object to all required subset inequalities. Tell: distinguish the proposed reduced form from the theorem that decides whether some ex-post rule induces it.
An ex-post allocation rule. An ex-post rule maps complete type profiles to feasible winning probabilities, whereas Border's theorem asks whether one exists behind given interim marginals. Tell: check whether a concrete profile-level mechanism is specified or only its existence is being characterized.
Pointwise probability feasibility. Bounds such as 0 ≤ Qᵢ(tᵢ) ≤ 1 constrain each coordinate separately but do not enforce competition for one indivisible good across bidders and types. Tell: test the full subset-capacity family rather than each marginal in isolation.
A merely necessary capacity condition. Many inequalities can rule out infeasibility without guaranteeing an implementation; Border's result is distinctive because all required inequalities are sufficient as well as necessary under its hypotheses. Tell: verify both logical directions.
Incentive compatibility. Incentive compatibility constrains whether truthful reporting is strategically optimal, while Border implementability only requires some feasible ex-post allocation rule to induce the reduced form. Tell: ask whether deviations and utilities are analyzed or only allocation capacity.
A payment rule. Payments assign transfers conditional on reports or outcomes; Border's inequalities characterize allocation feasibility without constructing or validating transfers. Tell: passing the test leaves payment design unresolved.
The Revenue Equivalence Theorem. Revenue equivalence compares expected payments across qualifying mechanisms under its own assumptions, whereas Border's theorem characterizes which interim allocations can be realized. Tell: identify whether the conclusion concerns payment equivalence or reduced-form feasibility.
An optimal-auction theorem. Revenue or welfare optimization selects among feasible mechanisms, while Border's theorem supplies feasibility constraints and no objective by itself. Tell: separate existence of an implementing allocation from claims that it is best.
A general theorem for correlated or multi-item environments. Border's stated versions depend on their single-good, type-space, distributional, and symmetry or finiteness assumptions. Tell: require a separately proved extension before carrying the inequalities to a different feasibility environment.

References¶

[1] Kim C. Border, “Implementation of Reduced Form Auctions: A Geometric Approach,” Econometrica 59(4) (1991) (source). registry ↩

[2] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[3] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[4] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[5] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[6] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[7] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[8] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[9] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[10] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[11] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[12] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[13] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[14] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[15] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[16] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[17] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[18] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[19] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩

[20] Unverified encyclopedia synthesis; no authoritative source located for the claim as written. ↩