Fiber Cardinality Count¶
Quantitative metric — instantiates Preimage Set Characterization
Reports how many inputs map to each output — the size of the fiber — along with how much to trust that number.
A Fiber Cardinality Count answers a single quantitative question: for a given output, how many inputs map to it? The preimage of a point is its fiber; this mechanism measures the fiber's size — a magnitude per output, a distribution across outputs — without pinning down which inputs those are. Its defining discipline is that the number comes attached to a confidence: a count obtained by exhaustively sweeping the domain is a fact, while one obtained by sampling is an estimate with an unknown region behind it, and the two must never be reported as the same thing. It turns "this output is many-to-one" into "this output has about N preimages, known this well," which is what a decision needs when the degree of ambiguity — not its membership — is what matters.
Example¶
A geneticist characterizes the redundancy of the standard genetic code: for each amino acid (an output), how many codons (inputs) specify it? A Fiber Cardinality Count sweeps all 64 codons and tallies the fiber over each amino acid. The numbers vary sharply — leucine, serine, and arginine each have six codons mapping to them, while methionine and tryptophan have exactly one. That per-output count is the degeneracy of the code, and because the domain of 64 codons is small and fully enumerable, every count here is exact, not estimated.
The value is the magnitude, not the roster. Knowing that leucine has a fiber of six and tryptophan a fiber of one tells you where a single-nucleotide change is likely to be silent versus catastrophic — a conclusion that rides entirely on how many codons share each output, and not at all on naming which specific codons they are.
How it works¶
- Fix the output partition. Decide which output values get their own count — each distinct value, or values bucketed to a tolerance.
- Choose exhaustive or sampled. Either sweep the whole input domain (exact counts) or sample it and scale up (estimated counts); the choice governs everything about the number's trustworthiness.
- Tally per output. Count the inputs landing on each output value — the fiber size — and assemble the distribution of counts across outputs.
- Attach the confidence. For exhaustive counts, mark them exact; for sampled counts, carry an interval and flag the unsearched region the estimate is blind to.
Tuning parameters¶
- Enumeration mode — exhaustive sweep versus sampled estimate. Exhaustive gives exact counts but costs a full domain pass; sampling is cheap but delivers a number with a confidence interval and a blind spot.
- Sample size and design — for the sampled mode, how many inputs and drawn how. Larger, better-stratified samples tighten the estimate at rising cost; small or biased samples produce a confident-looking count that is quietly wrong.
- Output bucketing tolerance — how close two outputs must be to count as "the same" output whose fiber is pooled. Coarser buckets inflate fiber sizes; finer buckets fragment them.
- Reporting statistic — whether to surface each fiber's exact size, the distribution's shape, or summaries like the maximum or mean fiber. The choice frames what "how ambiguous is this mapping" means for the decision.
When it helps, and when it misleads¶
Its strength is quantifying ambiguity cheaply and comparably: a per-output count — the degeneracy of a code[n1], the average number of records behind a status, the size of the typical fiber — lets a decision reason about how much many-to-one it faces, and to do so across many outputs at once without enumerating any of them fully.
Its failure mode is the sampled count presented with the authority of an exhaustive one: when the domain is only partially searched, the true fiber can be far larger than the sample suggests, and the missing members live precisely in the unknown region the count cannot see. The classic misuse is reporting "on average two inputs per output" from a convenience sample and treating it as the population truth, when the heavy fibers — the outputs with dozens of hidden preimages — were exactly what the sample under-drew. The guarding discipline is to label every count as exact or estimated, carry the interval and the unsearched region with the number, and never let a sampled magnitude harden into a stated fact.
How it implements the components¶
collision_and_multiplicity_check— it quantifies multiplicity as a per-output fiber size, the numeric form of the many-to-one check.uncertainty_and_unknown_region— it attaches to each count its confidence, flagging the unsearched domain a sampled count is blind to.sampling_or_search_strategy— the exhaustive-versus-sampled enumeration choice that produces the count and sets its trustworthiness.
It does not implement inverse_uniqueness_test — issuing the verdict on which inputs coincide, and thus whether the mapping is injective, is the job of Collision Analysis Matrix, its nearest twin; the count is a magnitude per output, while the matrix names the colliding members. A fiber of size one is a special case the count can flag, but pinning down the coincidence when the count exceeds one is the matrix's work, not the count's.
Related¶
- Instantiates: Preimage Set Characterization — the count supplies the honest, confidence-tagged measure of how many-to-one each output is.
- Consumes: Constraint-Solver Backsolve or Inverse Lookup Query can supply the enumerated inputs whose per-output tallies the count summarizes.
- Sibling mechanisms: Inverse Lookup Query · Constraint-Solver Backsolve · Predicate Satisfaction Filter · Output-to-Input Traceback Map · Collision Analysis Matrix · Sensitivity-to-Mapping-Change Review · Preimage Table · Witness and Counterexample Set
Editorial Notes¶
Form Classification¶
Form family: Analysis, Modeling & Optimization
Rationale: Fiber Cardinality Count operates as a computation, comparison, model, or analytic representation used to infer, estimate, or choose because it reports how many inputs map to each output — the size of the fiber — along with how much to trust that number.
Independent corroboration: The frozen evidence defines Fiber Cardinality Count as 'Reports how many inputs map to each output — the size of the fiber — along with how much to trust that number', so its operative form is Analysis, Modeling & Optimization.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Mathematics
Origin pattern: Single lineage
Present-day reach: Universal
Rationale: Fibers, preimages, and their cardinalities are concepts of set theory, algebra, and topology.
Related originating lineages:
- Computer Science & Software Engineering — Enumeration and sampled counting algorithms operationalize fiber size in computational systems.
- Statistics & Experimental Design — Estimation uncertainty materially shapes the empirical version that reports how much to trust a count.
Review resolution: Both reviewers agree that mathematics is primary. I retain statistics_experimental_design, computer_science only as formative origin lineage(s), without treating every later application as an origin. single_lineage is appropriate because the evidence supports one principal professional lineage. Reach is universal as a separate applicability judgment: it does not widen or narrow the recorded provenance. Encyclopedia synthesis is true because the exact generalized artifact is an encyclopedia-authored combination or refinement. The secondary differences are reconciled with no unresolved primary-provenance ambiguity.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
[n1] In molecular biology, degeneracy of the genetic code is the fact that most amino acids are specified by more than one codon — the fiber over an amino acid typically has size greater than one. It is a canonical real example of a many-to-one mapping whose cardinality per output carries the biologically important information. ↩