Weak Fan: Diverse Perspectives in Theory & Applications

• Weak Fan refers to multiple domain-specific concepts that share common terminology but differ in formal structure and application across graph drawing, logic, Hodge theory, and circuit design.
• In graph drawing, weak fan-planarity distinguishes specific forbidden crossing patterns, establishing a clear separation from strong fan-planarity while preserving edge density bounds.
• In mathematics, Hodge theory, and neuromorphic circuits, Weak Fan indicates a relaxed or weakened structural condition—ranging from compactness theorems to performance limitations in SFQ logic.

Searching^^^^^^^^8 arXiv8^^^^^^^^ for recent and relevant papers on "^^^^^^^^8Weak Fan8^^^^^^^^" across the senses present in the provided data. {"^^^^^^^^8query8 fan8 arXiv8^^^^^^^^", "^^^^^^^^8max_results8 ^^^^8query8Weak Fan8^^^^} Using the^^^^^^^^8 arXiv8^^^^^^^^ search tool to retrieve papers mentioning "^^^^^^^^8weak fan8^^^^^^^^". arxiv_search({"^^^^^^^^8query8 fan8 Fan8^^^^}) In current research usage, ^^^^^^^^8Weak Fan8^^^^^^^^ is not a single universally fixed concept. The expression appears in at least four distinct technical settings: graph drawing, where it denotes the permissive version of fan-planarity; constructive and reverse mathematics, where it denotes WWKL-style weakenings of Brouwerian fan principles; Hodge-theoretic compactification, where it denotes a ^^^^^^^^8weak fan8^^^^^^^^ of nilpotent cones; and superconducting neuromorphic hardware, where it refers to historically poor fan-in or fan-out capability in SFQ logic (&&&^^^^8Weak Fan8^^^^&&&, &&&^^^^8query8^^^^&&&, &&&^^^^8\8^^^^&&&, &&&^^^^8 arXiv8^^^^&&&). Across these settings, the common lexical element “fan” does not determine a common formal structure; the meaning is entirely domain-dependent.

^^^^8query8^^^^. Weak fan-planarity in graph drawing

In graph drawing, the relevant notion is ^^^^^^^^8weak fan8^^^^^^^^-planarity. A drawing is weakly fan-planar if it avoids two forbidden crossing patterns but may contain a third. The underlying constraint is that if an edge PRESERVED_PLACEHOLDER_^^^^8Weak Fan8^^^^ is crossed, then the crossing edges must form a fan: they all share a common endpoint, the anchor of PRESERVED_PLACEHOLDER_^^^^8query8^^^^, and cross PRESERVED_PLACEHOLDER_^^^^8\8^^^^ from the same side. The paper distinguishes three patterns. Pattern (I) forbids two edges crossing the same edge PRESERVED_PLACEHOLDER_^^^^8 arXiv8^^^^ from being non-adjacent. Pattern (II) requires two adjacent edges crossing PRESERVED_PLACEHOLDER_^^^^8max_results8^^^^ to cross from the same side. Pattern (III) is the additional configuration introduced in the later journal definition, and it is exactly the point at which weak and strong fan-planarity diverge (&&&^^^^8Weak Fan8^^^^&&&).

The distinction is formalized as follows. Weak fan-planarity forbids Patterns (I) and (II), but allows Pattern (III). Strong fan-planarity forbids Patterns (I), (II), and (III). In the cell-based characterization, the crossing edges and the crossed edge PRESERVED_PLACEHOLDER_^^^^8weak fan8^^^^ form two cells. In Pattern (II), one endpoint of PRESERVED_PLACEHOLDER_^^^^8query8^^^^ lies in the bounded cell. In Pattern (III), both endpoints of PRESERVED_PLACEHOLDER_^^^^8\8^^^^ lie in the bounded cell. Strong fan-planarity adds the requirement that both endpoints of $e$ lie in the unbounded cell (&&&^^^^8Weak Fan8^^^^&&&).

The inclusion is proper: $$\text{strongly fan-planar graphs} \subsetneq \text{weakly fan-planar graphs}.$$ The separation is established by constructing a graph PRESERVED_PLACEHOLDER_^^^^8query8Weak Fan8^^^^ with a weakly fan-planar drawing such that every weakly fan-planar drawing of PRESERVED_PLACEHOLDER_^^^^8query8query8^^^^ must contain at least one Pattern (III). The construction uses a ^^^^8 arXiv8^^^^-connected planar quadrangulation PRESERVED_PLACEHOLDER_^^^^8query8\8^^^^, a gadget PRESERVED_PLACEHOLDER_^^^^8query8 arXiv8^^^^ inserted into every face of PRESERVED_PLACEHOLDER_^^^^8query8max_results8^^^^, and replacement of every red edge by a PRESERVED_PLACEHOLDER_^^^^8query8weak fan8^^^^. This yields Theorem ^^^^8query8^^^^: there exists a weakly fan-planar graph that does not admit a strongly fan-planar drawing (&&&^^^^8Weak Fan8^^^^&&&).

For density arguments, the paper introduces a heart, a triple PRESERVED_PLACEHOLDER_^^^^8query8query8^^^^ such that PRESERVED_PLACEHOLDER_^^^^8query8\8^^^^ and PRESERVED_PLACEHOLDER_^^^^8query88^^^^ share an endpoint PRESERVED_PLACEHOLDER_^^^^8query8^^^^9, both cross PRESERVED_PLACEHOLDER_^^^^8\8Weak Fan8^^^^, they realize Pattern (III), and the subcurve of PRESERVED_PLACEHOLDER_^^^^8\8query8^^^^ between the two crossings is uncrossed. Lemma ^^^^8\8^^^^ states that if a weakly fan-planar drawing is not strongly fan-planar, then it contains a heart. The proof strategy then uses “valves” and a rerouting operation called flipping a valve to eliminate Pattern (III) configurations while controlling new crossings (&&&^^^^8Weak Fan8^^^^&&&).

Despite the strict inclusion, the exact edge bounds coincide. Theorem ^^^^8\8^^^^ states that a weakly fan-planar graph with PRESERVED_PLACEHOLDER_^^^^8\8\8^^^^ vertices has at most

PRESERVED_PLACEHOLDER_^^^^8\8 arXiv8^^^^

edges. Theorem ^^^^8 arXiv8^^^^ states that an PRESERVED_PLACEHOLDER_^^^^8\8max_results8^^^^-vertex bipartite weakly fan-planar graph has at most

PRESERVED_PLACEHOLDER_^^^^8\8weak fan8^^^^

edges. The same bounds were already known for strong fan-planarity. The same paper also situates ^^^^^^^^8weak fan8^^^^^^^^-planarity relative to adjacency-crossing graphs, in which only Pattern (I) is forbidden, yielding the proper inclusion chain

PRESERVED_PLACEHOLDER_^^^^8\8query8^^^^

A common misconception in this literature is that weak and strong fan-planarity are merely terminological variants; the separation theorem shows that they define genuinely different graph classes, even though their upper density bounds coincide (&&&^^^^8Weak Fan8^^^^&&&).

^^^^8\8^^^^. ^^^^^^^^8Weak Fan8^^^^^^^^ in constructive and reverse mathematics

In constructive and reverse mathematics, ^^^^^^^^8Weak Fan8^^^^^^^^ is used in a different sense. In “Separating the Fan Theorem and Its Weakenings,” the expression is introduced in the final “Questions” section as the weak analogue of each of the fan principles already under discussion, by explicit analogy with Weak Weak König’s Lemma (WWKL). The motivating contrast is: whereas PRESERVED_PLACEHOLDER_^^^^8\8\8^^^^ states that any bar contains an entire level of PRESERVED_PLACEHOLDER_^^^^8\88^^^^, PRESERVED_PLACEHOLDER_^^^^8\8^^^^9 states that any bar contains half of a level. The paper therefore proposes the scheme

PRESERVED_PLACEHOLDER_^^^^8 arXiv8Weak Fan8^^^^

rather than a single theorem with one canonical formalization (&&&^^^^8query8^^^^&&&).

This formulation weakens the conclusion, not the complexity class of admissible bars. By contrast, the ordinary fan-theorem hierarchy is organized by bar complexity: PRESERVED_PLACEHOLDER_^^^^8 arXiv8query8^^^^ The strongest principle is

PRESERVED_PLACEHOLDER_^^^^8 arXiv8\8^^^^

where uniformity is expressed by

PRESERVED_PLACEHOLDER_^^^^8 arXiv8 arXiv8^^^^

The weak versions retain the same bar classes but replace uniformity by the weaker WWKL-style largeness conclusion, described only as “contains half of a level” (&&&^^^^8query8^^^^&&&).

The implication structure given in the paper is straightforward in two directions. Any full fan principle implies its weak correlate, and weak principles inherit the usual downward hierarchy: PRESERVED_PLACEHOLDER_^^^^8 arXiv8max_results8^^^^ Likewise,

PRESERVED_PLACEHOLDER_^^^^8 arXiv8weak fan8^^^^

and similarly for the other variants. What remains open in that paper is whether there are diagonal implications, such as between PRESERVED_PLACEHOLDER_^^^^8 arXiv8query8^^^^ and PRESERVED_PLACEHOLDER_^^^^8 arXiv8\8^^^^. The authors do not provide Kripke-model separation theorems specifically for the weak hierarchy (&&&^^^^8query8^^^^&&&).

The background constructive landscape is supplied by Brouwer’s fan theorem itself. In Berger’s overview, Brouwer’s fan theorem is the statement that every detachable bar is a uniform bar on the binary fan. This places the weak versions within a larger network of compactness and continuity principles, including

PRESERVED_PLACEHOLDER_^^^^8 arXiv88^^^^

In that setting, PRESERVED_PLACEHOLDER_^^^^8 arXiv8^^^^9 is a compactness principle on Cantor space, PRESERVED_PLACEHOLDER_^^^^8max_results8Weak Fan8^^^^ is the uniform continuity theorem for pointwise continuous functions PRESERVED_PLACEHOLDER_^^^^8max_results8query8^^^^, and PRESERVED_PLACEHOLDER_^^^^8max_results8\8^^^^ is constructively equivalent to PRESERVED_PLACEHOLDER_^^^^8max_results8 arXiv8^^^^ (&&&^^^^8query8\8^^^^&&&). This suggests that “^^^^^^^^8Weak Fan8^^^^^^^^” in reverse mathematics is best understood as a measure-theoretic weakening of a compactness principle rather than as a weakened tree structure.

^^^^8 arXiv8^^^^. Approximate fans, almost-fans, and terminological instability

A related but not identical strand of the literature uses ^^^^^^^^8weak fan8^^^^^^^^ principle language for variants of Brouwerian compactness based on approximate or almost-fan structures. In “The Principle of Open Induction on Cantor space and the Approximate-Fan Theorem,” the Approximate-Fan Theorem (AppFT) is presented as a ^^^^^^^^8weak fan8^^^^^^^^ principle. An approximate-fan-law is a spread-law PRESERVED_PLACEHOLDER_^^^^8max_results8max_results8^^^^ such that, for each PRESERVED_PLACEHOLDER_^^^^8max_results8weak fan8^^^^, the set of nodes of length PRESERVED_PLACEHOLDER_^^^^8max_results8query8^^^^ compatible with PRESERVED_PLACEHOLDER_^^^^8max_results8\8^^^^ is bounded-in-number. In the explicit version, there exists a function PRESERVED_PLACEHOLDER_^^^^8max_results88^^^^ such that

PRESERVED_PLACEHOLDER_^^^^8max_results8^^^^9

The theorem is formulated as: in an explicit approximate fan, every thin bar is almost-finite (&&&^^^^8query8 arXiv8^^^^&&&).

The same paper places AppFT in a broad intuitionistic reverse-mathematical network. It states that

PRESERVED_PLACEHOLDER_^^^^8weak fan8Weak Fan8^^^^

that PRESERVED_PLACEHOLDER_^^^^8weak fan8query8^^^^ implies the Fan Theorem, and that the converse fails. It also gives equivalent or closely related formulations involving strong bars, the contrapositive of Bolzano–Weierstrass in PRESERVED_PLACEHOLDER_^^^^8weak fan8\8^^^^, Ramsey-theoretic principles PRESERVED_PLACEHOLDER_^^^^8weak fan8 arXiv8^^^^, and PRESERVED_PLACEHOLDER_^^^^8weak fan8max_results8^^^^, the contrapositive of Ascoli’s Lemma (&&&^^^^8query8 arXiv8^^^^&&&).

However, the terminology is not stable across authors. In “The Fan Theorem, its strong negation, and the determinacy of games,” the paper explicitly notes that some authors have called FT the ^^^^^^^^8Weak Fan8^^^^^^^^ Theorem WFT, but declines to adopt that usage. That work distinguishes PRESERVED_PLACEHOLDER_^^^^8weak fan8weak fan8^^^^, PRESERVED_PLACEHOLDER_^^^^8weak fan8query8^^^^, PRESERVED_PLACEHOLDER_^^^^8weak fan8\8^^^^, PRESERVED_PLACEHOLDER_^^^^8weak fan88^^^^, and PRESERVED_PLACEHOLDER_^^^^8weak fan8^^^^9, and emphasizes that there is no single uncontested target for the phrase “^^^^^^^^8weak fan8^^^^^^^^” in this area (&&&^^^^8query8weak fan8^^^^&&&).

This terminological instability is substantive rather than merely stylistic. One line of work treats ^^^^^^^^8weak fan8^^^^^^^^ principles as WWKL-style weakenings of the conclusion of a fan theorem (&&&^^^^8query8^^^^&&&). Another treats approximate or almost-fan principles as weakening the ambient branching hypothesis while preserving a compactness-type conclusion (&&&^^^^8query8 arXiv8^^^^&&&). A plausible implication is that the phrase “^^^^^^^^8Weak Fan8^^^^^^^^” in intuitionistic analysis should always be qualified by the exact scheme or structural assumption being used.

^^^^8max_results8^^^^. Weak fan structures in Hodge-theoretic compactification

In Hodge theory, a ^^^^^^^^8weak fan8^^^^^^^^ is a collection of nilpotent cones organizing boundary data for degenerations of period maps. In the explicit two-parameter K^^^^8 arXiv8^^^^ example, the relevant vector space is

PRESERVED_PLACEHOLDER_^^^^8query8Weak Fan8^^^^

with cup-product pairing PRESERVED_PLACEHOLDER_^^^^8query8query8^^^^ of signature PRESERVED_PLACEHOLDER_^^^^8query8\8^^^^, and the period domain is the type IV domain

PRESERVED_PLACEHOLDER_^^^^8query8 arXiv8^^^^

A two-parameter family over PRESERVED_PLACEHOLDER_^^^^8query8max_results8^^^^ produces commuting monodromy logarithms PRESERVED_PLACEHOLDER_^^^^8query8weak fan8^^^^ with

PRESERVED_PLACEHOLDER_^^^^8query8query8^^^^

and associated cone

PRESERVED_PLACEHOLDER_^^^^8query8\8^^^^

The ^^^^^^^^8weak fan8^^^^^^^^ is then

PRESERVED_PLACEHOLDER_^^^^8query88^^^^

where PRESERVED_PLACEHOLDER_^^^^8query8^^^^9 and PRESERVED_PLACEHOLDER_^^^^8\8Weak Fan8^^^^ (&&&^^^^8\8^^^^&&&).

The axioms emphasized in this example are face closure, compatibility, and a weaker intersection condition than in ordinary toric-fan theory. The faces of PRESERVED_PLACEHOLDER_^^^^8\8query8^^^^ are exactly

PRESERVED_PLACEHOLDER_^^^^8\8\8^^^^

and the ^^^^^^^^8weak fan8^^^^^^^^ is closed under taking faces. Each cone corresponds to a class of limiting mixed Hodge structures and to a boundary stratum: PRESERVED_PLACEHOLDER_^^^^8\8 arXiv8^^^^ and PRESERVED_PLACEHOLDER_^^^^8\8max_results8^^^^ correspond to one-parameter degenerations, while PRESERVED_PLACEHOLDER_^^^^8\8weak fan8^^^^ corresponds to the simultaneous degeneration PRESERVED_PLACEHOLDER_^^^^8\8query8^^^^ (&&&^^^^8\8^^^^&&&).

The reason the structure is called weak is not combinatorial weakness in the sense of sparse data, but the relaxation of the rigid toric intersection condition. The admissibility criterion is tailored to nilpotent orbit theory and compatibility of LMHS rather than to purely polyhedral geometry. In this setting, “^^^^^^^^8weak fan8^^^^^^^^” is therefore a Hodge-theoretic generalization of fan-like boundary combinatorics rather than a weakening of Brouwer’s fan theorem or of graph-theoretic fan-planarity (&&&^^^^8\8^^^^&&&).

^^^^8weak fan8^^^^. Weak fan in superconducting neuromorphic circuits

In superconducting neuromorphic hardware, “^^^^^^^^8weak fan8^^^^^^^^” has a hardware-architectural meaning. The paper uses fan-out for the number of output lines driven by a neuron’s spike, PRESERVED_PLACEHOLDER_^^^^8\8\8^^^^, and fan-in for the number of input signals summed at a neuron’s input, PRESERVED_PLACEHOLDER_^^^^8\88^^^^. It explicitly distinguishes the two: fan-out is digital, because the problem is to copy an SFQ pulse to many outputs, whereas fan-in is analog, because weighted synaptic inputs must be summed and compared with threshold (&&&^^^^8 arXiv8^^^^&&&).

The expression “^^^^^^^^8weak fan8^^^^^^^^” in this context refers to the historically poor fan-in or fan-out capability of standard SFQ logic, typically only ^^^^8\8^^^^ or ^^^^8 arXiv8^^^^. The paper’s central claim is that superconducting neuromorphic circuits can substantially relax this weakness. For fan-out, splitter trees or current-based reamplification via JTLs allow very large replication. Simulations reached ^^^^8query8^^^^-to-^^^^8query8\88 in a nested ^^^^8\8^^^^-layer tree and ^^^^8query8^^^^-to-^^^^8query8query8 arXiv88max_results8^^^^ in a ^^^^8query8max_results8^^^^-layer tree, with ^^^^8query8^^^^-to-^^^^8query8Weak Fan8^^^^,^^^^8Weak Fan8Weak Fan8Weak Fan8^^^^-class fan-out described as a realistic demonstrated or simulated level. The conclusion is that fan-out has no fundamental physics limit in the architectures considered; it is limited by junction count, chip area, power dissipation, delay, and layout constraints (&&&^^^^8 arXiv8^^^^&&&).

Fan-in is more limited because signal current decays roughly like PRESERVED_PLACEHOLDER_^^^^8\8^^^^9, threshold margin must be preserved, and crosstalk from inactive branches becomes important. The paper gives the practical criterion that the signal should be at least about ^^^^8\8Weak Fan8^^^^^^^^^^^^8\8 of $e$^^^^8Weak Fan8^^^^. Under WRSPICE simulations, current-based fan-in reaches about

$e$^^^^8query8^^^^

whereas flux-based fan-in performs much better: with $e$^^^^8\8^^^^, the maximum fan-in is over ^^^^8query8Weak Fan8Weak Fan8^^^^, and with $e$^^^^8 arXiv8^^^^, it is over ^^^^8 arXiv8Weak Fan8Weak Fan8^^^^. The key scaling advantage is the factor $e$^^^^8max_results8^^^^, which the paper notes can be ^^^^8weak fan8Weak Fan8^^^^ or more (&&&^^^^8 arXiv8^^^^&&&).

Here, then, “^^^^^^^^8weak fan8^^^^^^^^” does not name a theorem or a geometric object. It names a practical limitation of legacy SFQ circuitry that neuromorphic circuit design seeks to overcome.

^^^^8query8^^^^. Disambiguation and scope

Across these literatures, ^^^^^^^^8Weak Fan8^^^^^^^^ is best treated as a homonym. In graph theory it designates the permissive side of the weak/strong fan-planarity distinction and is characterized by allowing Pattern (III) while retaining the same edge-density bounds as strong fan-planarity (&&&^^^^8Weak Fan8^^^^&&&). In constructive mathematics it denotes either a WWKL-style weakening of a fan principle or, in adjacent usage, one of several approximate or almost-fan compactness principles (&&&^^^^8query8^^^^&&&, &&&^^^^8query8 arXiv8^^^^&&&). In Hodge theory it denotes a ^^^^^^^^8weak fan8^^^^^^^^ of nilpotent cones indexing boundary strata of degenerations (&&&^^^^8\8^^^^&&&). In superconducting hardware it denotes historically poor fan-in or fan-out capability in SFQ logic (&&&^^^^8 arXiv8^^^^&&&).

A recurrent source of confusion is the transfer of terminology across these domains. In intuitionistic analysis, even within a single field, authors differ on whether FT itself should ever be called a “^^^^^^^^8Weak Fan8^^^^^^^^ Theorem,” and some explicitly reject that nomenclature (&&&^^^^8query8weak fan8^^^^&&&). A plausible implication is that the term should not be used without a domain qualifier: weakly fan-planar, Weak $e$^^^^8weak fan8^^^^, ^^^^^^^^8weak fan8^^^^^^^^ structure, and ^^^^^^^^8weak fan8^^^^^^^^-in/fan-out are not variants of one concept but separate technical usages sharing only a word.