Equivalence of C & D: A Question

  • Thread starter phoenixthoth
  • Start date
  • Tags
    Equivalence
In summary, a full subcategory is when every object in one category is also an object in another category, and vice versa. This is determined by the objects in the category. Slice categories can be thought of as A-indexed families of disjoint sets, where each object corresponds to a fiber and the morphisms act "fiber-wise". They serve as a model to understand the relationship between objects in the original category and the base object.
  • #1
phoenixthoth
1,605
2
One question for now:
1. If C is a full subcategory of D and D is a full subcategory of C, what can be said, if anything, about C and D being either equal or equivalent in some way?
 
Mathematics news on Phys.org
  • #2
They'd have to be equal.

Every object of C is an object of D, and vice cersa. Full subcategories are determined by their objects.
 
  • #3
2. Could you explain slice categories?

I have a quote that I don't get:
It is useful to think of an object of Set/A as an A-indexed family of disjoint sets (the inverse images of the elements of A). The commutivity of teh above diagram means that the function h is consistent with the decomposition of B and C into disjoint sets.

In the "above diagram," f:B-->A, g:C-->A, and h:B-->C s.t. gh=f.

Thanks in advance...
 
  • #4
Have you worked much with fiber bundles? I think they're a good model to understand what's going on.

You can imagine the objects of the slice category are the projections from objects of the original category to the base object.

For a given projection, each "point" X of the base object corresponds to a "fiber", those "points" of the source object that project onto X. (Thus, we have a B-indexed family of fibers)

The morphisms of the slice category, then, are the morphisms that act "fiber-wise". That is, if P is in a fiber of X, then f(P) is also in a fiber of X.

Of course, in general you won't have points and fibers to manipulate, but I think this is the spirit behind it.
 
Last edited:

1. What is the difference between C and D?

The main difference between C and D is the syntax. C uses curly braces to indicate blocks of code, while D uses indentation. Additionally, C is a compiled language, while D is a combination of compiled and interpreted.

2. Can programs written in C and D be used interchangeably?

No, programs written in C and D are not interchangeable. While both languages have similar functionalities, they have different syntax and semantics. Therefore, a C program cannot be directly converted into a D program and vice versa.

3. Which language is more efficient, C or D?

It is difficult to determine which language is more efficient as it depends on the specific task and implementation. However, generally, C is known for its efficiency and speed, while D offers more modern features and conveniences.

4. Can C and D be used for the same types of applications?

Yes, both C and D can be used for similar types of applications, such as system programming, web development, and scientific computing. However, the choice of language ultimately depends on the specific needs and requirements of the project.

5. Are there any notable advantages of using D over C?

One of the main advantages of D over C is its memory management. D has automatic garbage collection, which helps prevent memory leaks and makes programming more efficient. Additionally, D has modern features such as built-in support for concurrency and functional programming, making it easier to write complex programs.

Similar threads

Replies
1
Views
390
Replies
20
Views
399
Replies
14
Views
494
  • Introductory Physics Homework Help
Replies
8
Views
761
  • General Math
5
Replies
142
Views
7K
  • General Math
Replies
2
Views
879
  • General Math
Replies
2
Views
1K
Replies
6
Views
956
Replies
2
Views
676
Back
Top