Discontinuous linear map

A linear transformation between topological vector spaces that fails the continuity or boundedness condition imposed by their topologies.

Version

v2 · 2026-09-19 · History

Domain-specific #

4200

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Functional Analysis → Mathematics

Core Idea

A linear map is discontinuous when it preserves vector addition and scalar multiplication but is not continuous at zero, hence not continuous anywhere. In normed spaces continuity is equivalent to a uniform operator bound; infinite-dimensional algebraic bases can define unbounded linear maps, often using choice. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of functional analysis. It is Every linear map from a finite-dimensional normed domain is continuous, and an unbounded operator with a restricted non-full domain is not automatically the same object..

How would you explain it like I'm…

 

No faithful explanation at this level. All three generators agree any child-level picture of a linear rule is a finite straight-line rule, which is always continuous; the simplification collapses into 'a linear graph with a jump at one spot', whereas the real object fails continuity everywhere and exists only with infinitely many independent directions.

Fair Rules That Can't Stay Gentle

In math, a linear map is a rule that is fair to adding and scaling: doubling the input doubles the output, and adding two inputs adds their outputs. When there are only a limited number of directions to move in, such a rule is always gentle: tiny changes in the input give tiny changes in the output. But when there are endlessly many directions, it is possible to build a fair rule where smaller and smaller nudges do not give smaller and smaller results. That kind of rule is called a discontinuous linear map, and it is not gentle anywhere, not just at one spot. Building one usually needs a special math assumption.

Unbounded (Discontinuous) Linear Map

A linear map preserves addition and scalar multiplication. A map is continuous if small changes in the input produce small changes in the output. For linear maps, continuity at zero forces continuity everywhere, so a discontinuous linear map fails continuity at every point, not at an isolated jump. In normed spaces, continuity is the same as being bounded: there is one fixed number that caps how much the map can stretch any vector. Every linear map out of a finite-dimensional normed space is automatically bounded, so discontinuous examples only appear with infinite-dimensional domains. They are typically built using an algebraic basis of an infinite-dimensional space, often relying on the axiom of choice.

 

A discontinuous linear map is a function between topological vector spaces that is linear (additive and homogeneous) but not continuous. Because of linearity, continuity at zero implies continuity everywhere, so discontinuity at zero means discontinuity at every point. In normed spaces, a linear map is continuous exactly when it is bounded, i.e. there is a uniform constant C with ||Tx|| <= C||x|| for all x; a discontinuous linear map is therefore an unbounded one. Every linear map out of a finite-dimensional normed space is continuous, so such maps require an infinite-dimensional domain. The standard construction takes an algebraic (Hamel) basis, normalizes the basis vectors, and assigns images whose norms grow without bound, extending linearly; existence of such a basis in general uses the axiom of choice. One must keep this distinct from an unbounded operator defined only on a proper, restricted domain, which is a different object. Establishing the concept requires fixing the domain and codomain topologies and showing linearity holds while a valid continuity test fails.

Scope of Application

Discontinuous linear map belongs to functional analysis and is useful where the analyst can specify topological vector spaces, a linear map, source and target topologies or norms, neighborhoods, sequences or nets, boundedness criteria, dimension, completeness, and choice assumptions, then evaluate linearity holds while a valid continuity diagnostic fails for the declared domain and codomain topologies. The scope is broad within that domain but bounded by the need for linearity holds while a valid continuity diagnostic fails for the declared domain and codomain topologies. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making linearity holds while a valid continuity diagnostic fails for the declared domain and codomain topologies the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Discontinuous linear map can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Discontinuous linear map. Discontinuous linear map compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: topological vector spaces, a linear map, source and target topologies or norms, neighborhoods, sequences or nets, boundedness criteria, dimension, completeness, and choice assumptions. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express linearity holds while a valid continuity diagnostic fails for the declared domain and codomain topologies independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of functional analysis because they reuse topological vector spaces, a linear map, source and target topologies or norms, neighborhoods, sequences or nets, boundedness criteria, dimension, completeness, and choice assumptions, In normed spaces continuity is equivalent to a uniform operator bound; infinite-dimensional algebraic bases can define unbounded linear maps, often using choice., and type the carrier, state every parameter and convention in the definition, test that linearity holds while a valid continuity diagnostic fails for the declared domain and codomain topologies, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Discontinuous linear map Domain-specific

Parents (1) — outgoing typed relations

• Discontinuous linear map is a kind of Continuity Prime

  What makes it its own entry: Every linear map from a finite-dimensional normed domain is continuous, and an unbounded operator with a restricted non-full domain is not automatically the same object.

Hierarchy paths (2) — routes to 2 parentless roots

• Discontinuous linear map → is a kind of Continuity → is a kind of Neighborhood → presupposes, typical Topology

Show alternative path (1)

Neighborhood in Abstraction Space

Discontinuous linear map sits in a crowded region of the domain-specific corpus (14^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Point-Set Topology Structures (51 abstractions)

Nearest neighbors

• Unbounded operator — 0.93
• Linear map — 0.91
• Differentiable vector-valued functions from Euclidean space — 0.91
• Fréchet space — 0.91
• Bounded operator — 0.90

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